71 #define rn_dupedkey rn_u.rn_leaf.rn_Dupedkey 72 #define rn_key rn_u.rn_leaf.rn_Key 73 #define rn_mask rn_u.rn_leaf.rn_Mask 74 #define rn_off rn_u.rn_node.rn_Off 75 #define rn_l rn_u.rn_node.rn_L 76 #define rn_r rn_u.rn_node.rn_R 94 #define rm_mask rm_rmu.rmu_mask 95 #define rm_leaf rm_rmu.rmu_leaf 102 (
const void *
v,
const void *mask,
105 (
const void *
v,
const void *mask,
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_search_m(const void *, struct radix_node *, const void *)
int rn_walktree(struct radix_node_head *, int(*)(struct radix_node *, void *), void *)
struct radix_node * rn_newpair(const void *, int, struct radix_node[2])
int rn_refines(const void *, const void *)
struct radix_node * rn_Dupedkey
struct radix_node * rn_addmask(const void *, int, int)
struct radix_node * rn_search_matched(struct radix_node_head *, int(*)(struct radix_node *, void *), void *)
struct radix_node * rn_match(const void *, struct radix_node_head *)
struct radix_node * rn_search(const void *, struct radix_node *)
struct radix_mask * rm_mklist
struct radix_node * rnh_treetop
int rn_inithead0(struct radix_node_head *, int)
struct radix_node::@296::@297 rn_leaf
union radix_node::@296 rn_u
struct radix_mask * rn_mklist
int rn_inithead(void **, int)
struct radix_node * rn_lookup(const void *, const void *, struct radix_node_head *)
struct radix_node * rn_insert(const void *, struct radix_node_head *, int *, struct radix_node[2])
void rn_delayedinit(void **, int)
struct radix_node::@296::@298 rn_node
struct radix_node * rn_delete(const void *, const void *, struct radix_node_head *)
struct radix_node * rmu_leaf