Lines Matching refs:radix_node
53 # define radix_node ipf_radix_node
61 struct radix_node {
63 struct radix_node *rn_p; /* parent */
74 struct radix_node *rn_Dupedkey;
78 struct radix_node *rn_L;/* progeny */
79 struct radix_node *rn_R;/* progeny */
84 struct radix_node *rn_twin;
85 struct radix_node *rn_ybro;
107 struct radix_node *rmu_leaf; /* for normal routes */
125 struct radix_node *rnh_treetop;
126 struct radix_node *rnh_leaflist;
132 struct radix_node *(*rnh_addaddr) /* add based on sockaddr */
134 struct radix_node_head *head, struct radix_node nodes[]));
135 struct radix_node *(*rnh_addpkt) /* add based on packet hdr */
137 struct radix_node_head *head, struct radix_node nodes[]));
138 struct radix_node *(*rnh_deladdr) /* remove based on sockaddr */
140 struct radix_node *(*rnh_delpkt) /* remove based on packet hdr */
142 struct radix_node *(*rnh_matchaddr) /* locate based on sockaddr */
144 struct radix_node *(*rnh_lookup) /* locate based on sockaddr */
146 struct radix_node *(*rnh_matchpkt) /* locate based on packet hdr */
150 int (*)(struct radix_node *, void *), void *));
151 struct radix_node rnh_nodes[3]; /* empty tree for common case */
206 int (*)(struct radix_node *, void *), void *));
207 struct radix_node
210 struct radix_node [2])),
213 struct radix_node [2])),
216 *rn_newpair __P((void *, int, struct radix_node[2])),
217 *rn_search __P((void *, struct radix_node *)),
218 *rn_search_m __P((void *, struct radix_node *, void *));