|
| static alias_list_t * | alias_list_new (unsigned int max_size) |
| | Create a new list on the stack.
|
| |
| static bool | alias_list_append (alias_list_t *as, key_mask_t val, uint32_t source) |
| | Append an element to a list.
|
| |
| static alias_element_t | alias_list_get (alias_list_t *as, unsigned int i) |
| | Get an element from the list.
|
| |
| static void | alias_list_join (alias_list_t *a, alias_list_t *b) |
| | Append a list to an existing list.
|
| |
| void | alias_list_delete (alias_list_t *a) |
| | Delete all elements in an alias list.
|
| |
| static aliases_t | aliases_init (void) |
| | Create a new, empty, aliases container.
|
| |
| static alias_list_t * | aliases_find (aliases_t *a, key_mask_t key) |
| | Retrieve an element from an aliases container.
|
| |
| static bool | aliases_contains (aliases_t *a, key_mask_t key) |
| | See if the aliases contain holds an element.
|
| |
| static bool | aliases_insert (aliases_t *a, key_mask_t key, alias_list_t *value) |
| | Add/overwrite an element into an aliases tree.
|
| |
| static void | aliases_remove (aliases_t *a, key_mask_t key) |
| | Remove an element from an aliases tree.
|
| |
| static void | aliases_clear (aliases_t *a) |
| | Remove all elements from an aliases container and free all sub-containers.
|
| |
Aliases in the routing tree.
Aliases are built using a trie structure as this avoids the need for rebalancing at the cost of more memory.
Definition in file aliases.h.
