Alexander Duyck 37fd30f2da fib_trie: Merge tnode_free and leaf_free into node_free
Both the leaf and the tnode had an rcu_head in them, but they had them in
slightly different places.  Since we now have them in the same spot and
know that any node with bits == 0 is a leaf and the rest are either vmalloc
or kmalloc tnodes depending on the value of bits it makes it easy to combine
the functions and reduce overhead.

In addition I have taken advantage of the rcu_head pointer to go ahead and
put together a simple linked list instead of using the tnode pointer as
this way we can merge either type of structure for freeing.

Signed-off-by: Alexander Duyck <alexander.h.duyck@redhat.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2014-12-31 18:25:54 -05:00
..
2014-10-15 10:25:04 +10:30
2014-11-24 04:28:48 -05:00
2014-12-09 16:29:03 -05:00
2014-11-24 04:28:48 -05:00
2014-12-09 16:29:03 -05:00
2014-12-07 21:22:05 +01:00
2014-11-24 04:28:51 -05:00
2014-12-14 16:10:09 -08:00
2014-11-24 04:28:48 -05:00
2014-10-09 01:40:05 -04:00
2014-11-24 04:28:48 -05:00
2014-11-24 04:28:48 -05:00
2014-12-14 16:10:09 -08:00
2014-11-24 04:28:48 -05:00
2014-12-10 15:13:13 -08:00
2014-12-31 13:11:39 -05:00
2014-12-09 16:29:03 -05:00
2014-12-09 16:29:03 -05:00
2014-10-07 20:28:44 -04:00
2014-11-24 04:28:48 -05:00
2014-12-09 16:29:03 -05:00
2014-12-19 07:13:21 -05:00