Lines Matching refs:radix_node
78 struct radix_node {
80 struct radix_node *rn_parent; /* parent */
91 struct radix_node *rn_Dupedkey;
95 struct radix_node *rn_L;/* progeny */
96 struct radix_node *rn_R;/* progeny */
101 struct radix_node *rn_twin;
102 struct radix_node *rn_ybro;
124 struct radix_node *rmu_leaf; /* for normal routes */
142 typedef int walktree_f_t(struct radix_node *, void *);
143 typedef int rn_matchf_t(struct radix_node *, void *);
146 struct radix_node *rnh_treetop;
149 struct radix_node *(*rnh_addaddr) /* add based on sockaddr */
151 struct radix_node_head *head, struct radix_node nodes[]);
152 struct radix_node *(*rnh_addpkt) /* add based on packet hdr */
154 struct radix_node_head *head, struct radix_node nodes[]);
155 struct radix_node *(*rnh_deladdr) /* remove based on sockaddr */
157 struct radix_node *(*rnh_delpkt) /* remove based on packet hdr */
159 struct radix_node *(*rnh_matchaddr) /* locate based on sockaddr */
162 struct radix_node *(*rnh_matchaddr_args)
165 struct radix_node *(*rnh_lookup) /* locate based on sockaddr */
168 struct radix_node *(*rnh_lookup_args)
171 struct radix_node *(*rnh_matchpkt) /* locate based on packet hdr */
179 (struct radix_node *rn, struct radix_node_head *head);
180 struct radix_node rnh_nodes[3]; /* empty tree for common case */
201 struct radix_node
204 struct radix_node [2]),