Go to the source code of this file.
|
fib_node_index_t | ip4_fib_hash_table_lookup (const ip4_fib_hash_t *fib, const ip4_address_t *addr, u32 len) |
|
index_t | ip4_fib_hash_table_lookup_lb (const ip4_fib_hash_t *fib, const ip4_address_t *addr) |
|
fib_node_index_t | ip4_fib_hash_table_lookup_exact_match (const ip4_fib_hash_t *fib, const ip4_address_t *addr, u32 len) |
|
void | ip4_fib_hash_table_entry_remove (ip4_fib_hash_t *fib, const ip4_address_t *addr, u32 len) |
|
void | ip4_fib_hash_table_entry_insert (ip4_fib_hash_t *fib, const ip4_address_t *addr, u32 len, fib_node_index_t fib_entry_index) |
|
void | ip4_fib_hash_table_init (ip4_fib_hash_t *fib) |
|
void | ip4_fib_hash_table_destroy (ip4_fib_hash_t *fib) |
|
void | ip4_fib_hash_table_walk (ip4_fib_hash_t *fib, fib_table_walk_fn_t fn, void *ctx) |
| Walk all entries in a FIB table N.B: This is NOT safe to deletes. More...
|
|
void | ip4_fib_hash_table_sub_tree_walk (ip4_fib_hash_t *fib, const fib_prefix_t *root, fib_table_walk_fn_t fn, void *ctx) |
| Walk all entries in a sub-tree of the FIB table N.B: This is NOT safe to deletes. More...
|
|
◆ ip4_fib_hash_t
◆ ip4_fib_hash_table_destroy()
◆ ip4_fib_hash_table_entry_insert()
◆ ip4_fib_hash_table_entry_remove()
◆ ip4_fib_hash_table_init()
◆ ip4_fib_hash_table_lookup()
◆ ip4_fib_hash_table_lookup_exact_match()
◆ ip4_fib_hash_table_lookup_lb()
◆ ip4_fib_hash_table_sub_tree_walk()
Walk all entries in a sub-tree of the FIB table N.B: This is NOT safe to deletes.
If you need to delete walk the whole table and store elements in a vector, then delete the elements
Definition at line 172 of file ip4_fib_hash.c.
◆ ip4_fib_hash_table_walk()
Walk all entries in a FIB table N.B: This is NOT safe to deletes.
If you need to delete walk the whole table and store elements in a vector, then delete the elements
Definition at line 155 of file ip4_fib_hash.c.