Searched refs:fib_find_node (Results 1 – 2 of 2) sorted by relevance
62 fib_find_node()68 fib_find_node(). Inserting a new node means we might have to run the119 The lookup is in its simplest form just like fib_find_node(). We descend the
967 fib_find_node(struct trie *t, u32 key) in fib_find_node() function1216 l = fib_find_node(t, key); in fib_table_insert()1654 l = fib_find_node(t, key); in fib_table_delete()1695 l = fib_find_node(t, key); in fib_table_delete()1942 l = fib_find_node(t, key); in fib_table_dump()2442 if (iter->pos > 0 && pos >= iter->pos && (l = fib_find_node(t, iter->key))) in fib_route_get_idx()