Data Fields | |
| struct addrnode * | root |
| uint32_t | node_count |
| Number of elements in the tree (not always equal to number of nodes) | |
| uint32_t | max_node_count |
| Maximum number of allowed nodes, will be enforced by LRU list. | |
| size_t | size_bytes |
| Size of tree in bytes. | |
| addrlen_t | max_depth |
| Maximum prefix length we are willing to cache. | |
| void(* | delfunc )(void *, void *) |
| External function to delete elem. | |
| void * | env |
| Environment for delfunc. | |
| size_t(* | sizefunc )(void *) |
| External function returning size of elem. | |
| struct addrnode * | first |
| first node in LRU list, first candidate to go | |
| struct addrnode * | last |
| last node in LRU list, last candidate to go | |
| uint32_t addrtree::max_node_count |
Maximum number of allowed nodes, will be enforced by LRU list.
Excluding the root node, 0 for unlimited
Referenced by addrtree_create(), and lru_cleanup().
| void(* addrtree::delfunc) (void *, void *) |
External function to delete elem.
Called as delfunc(addrnode->elem, addrtree->env)
Referenced by addrtree_create(), and clean_node().
| size_t(* addrtree::sizefunc) (void *) |
External function returning size of elem.
Called as sizefunc(addrnode->elem)
Referenced by addrtree_create(), addrtree_insert(), clean_node(), and node_size().