Go to the source code of this file.
|
#define | RNF_NORMAL 1 /* leaf contains normal route */ |
|
#define | RNF_ROOT 2 /* leaf is root leaf for tree */ |
|
#define | RNF_ACTIVE 4 /* This node is alive (for rtfree) */ |
|
#define | rn_dupedkey rn_u.rn_leaf.rn_Dupedkey |
|
#define | rn_key rn_u.rn_leaf.rn_Key |
|
#define | rn_mask rn_u.rn_leaf.rn_Mask |
|
#define | rn_off rn_u.rn_node.rn_Off |
|
#define | rn_l rn_u.rn_node.rn_L |
|
#define | rn_r rn_u.rn_node.rn_R |
|
#define | rm_mask rm_rmu.rmu_mask |
|
#define | rm_leaf rm_rmu.rmu_leaf /* extra field would make 32 bytes */ |
|
|
void | rn_init (void) |
|
int | rn_inithead (void **, int) |
|
void | rn_delayedinit (void **, int) |
|
int | rn_inithead0 (struct radix_node_head *, int) |
|
int | rn_refines (const void *, const void *) |
|
int | rn_walktree (struct radix_node_head *, int(*)(struct radix_node *, void *), void *) |
|
struct radix_node * | rn_search_matched (struct radix_node_head *, int(*)(struct radix_node *, void *), void *) |
|
struct radix_node * | rn_addmask (const void *, int, int) |
|
struct radix_node * | rn_addroute (const void *, const void *, struct radix_node_head *, struct radix_node [2]) |
|
struct radix_node * | rn_delete1 (const void *, const void *, struct radix_node_head *, struct radix_node *) |
|
struct radix_node * | rn_delete (const void *, const void *, struct radix_node_head *) |
|
struct radix_node * | rn_insert (const void *, struct radix_node_head *, int *, struct radix_node [2]) |
|
struct radix_node * | rn_lookup (const void *, const void *, struct radix_node_head *) |
|
struct radix_node * | rn_match (const void *, struct radix_node_head *) |
|
struct radix_node * | rn_newpair (const void *, int, struct radix_node[2]) |
|
struct radix_node * | rn_search (const void *, struct radix_node *) |
|
struct radix_node * | rn_search_m (const void *, struct radix_node *, const void *) |
|
◆ rm_leaf
#define rm_leaf rm_rmu.rmu_leaf /* extra field would make 32 bytes */ |
◆ rm_mask
#define rm_mask rm_rmu.rmu_mask |
◆ rn_dupedkey
#define rn_dupedkey rn_u.rn_leaf.rn_Dupedkey |
◆ rn_key
#define rn_key rn_u.rn_leaf.rn_Key |
◆ rn_l
#define rn_l rn_u.rn_node.rn_L |
◆ rn_mask
#define rn_mask rn_u.rn_leaf.rn_Mask |
◆ rn_off
#define rn_off rn_u.rn_node.rn_Off |
◆ rn_r
#define rn_r rn_u.rn_node.rn_R |
◆ RNF_ACTIVE
#define RNF_ACTIVE 4 /* This node is alive (for rtfree) */ |
◆ RNF_NORMAL
#define RNF_NORMAL 1 /* leaf contains normal route */ |
◆ RNF_ROOT
#define RNF_ROOT 2 /* leaf is root leaf for tree */ |
◆ rn_addmask()
struct radix_node* rn_addmask |
( |
const void * |
, |
|
|
int |
, |
|
|
int |
|
|
) |
| |
◆ rn_addroute()
◆ rn_delayedinit()
void rn_delayedinit |
( |
void ** |
, |
|
|
int |
|
|
) |
| |
◆ rn_delete()
◆ rn_delete1()
◆ rn_init()
◆ rn_inithead()
int rn_inithead |
( |
void ** |
, |
|
|
int |
|
|
) |
| |
◆ rn_inithead0()
◆ rn_insert()
◆ rn_lookup()
◆ rn_match()
◆ rn_newpair()
◆ rn_refines()
int rn_refines |
( |
const void * |
, |
|
|
const void * |
|
|
) |
| |
◆ rn_search()
◆ rn_search_m()
◆ rn_search_matched()
◆ rn_walktree()