tree 6c3d1f48e0d659f6a1b761ad43a9f86f059e3595
parent 64c9b6fb26ebcc82e36438d4084f2258f29dbadf
author Alexander Duyck <alexander.h.duyck@redhat.com> 1420052141 -0800
committer David S. Miller <davem@davemloft.net> 1420068354 -0500

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>