![]() |
ndn-lite
|
NameTree node. More...
#include <name-splay.h>

Data Fields | |
| uint8_t | val [NDN_NAME_COMPONENT_BLOCK_SIZE] |
| Name component of this node. More... | |
| struct nametree_entry * | sub |
| struct nametree_entry * | cop [2] |
| Subtree. More... | |
| ndn_table_id_t | pit_id |
| Child or parent. More... | |
| ndn_table_id_t | fib_id |
| Corresponding FIB entry's id. More... | |
| ndn_table_id_t | left_child |
| First child of this node. More... | |
| ndn_table_id_t | right_bro |
| Right brother of this node. More... | |
NameTree node.
| struct nametree_entry* nametree_entry::cop[2] |
Subtree.
| ndn_table_id_t nametree_entry::fib_id |
Corresponding FIB entry's id.
NDN_INVALID_ID if none.
| ndn_table_id_t nametree_entry::left_child |
First child of this node.
NDN_INVALID_ID if none.
| ndn_table_id_t nametree_entry::pit_id |
| ndn_table_id_t nametree_entry::right_bro |
Right brother of this node.
For root node, it points to a free list. And a free node's right brother is the next free node. NDN_INVALID_ID if none.
| struct nametree_entry* nametree_entry::sub |
| uint8_t nametree_entry::val |
Name component of this node.
1.8.15