81 struct radix_node {  struct
83 	struct  radix_node *rn_parent;  /* parent */  argument
94 			struct  radix_node *rn_Dupedkey;  argument
98 			struct  radix_node *rn_L;/* progeny */
99 			struct  radix_node *rn_R;/* progeny */
104 	struct radix_node *rn_twin;  argument
105 	struct radix_node *rn_ybro;  argument
136 		struct  radix_node *rm_leaf;    /* for normal routes */
152 typedef int walktree_f_t(struct radix_node *, void *);
153 typedef int rn_matchf_t(struct radix_node *, void *);
160 	struct  radix_node *rnh_treetop;
163 	struct  radix_node *(*rnh_addaddr)      /* add based on sockaddr */
165 	    struct radix_node_head *head, struct radix_node nodes[]);
166 	struct  radix_node *(*rnh_addpkt)       /* add based on packet hdr */
168 	    struct radix_node_head *head, struct radix_node nodes[]);
169 	struct  radix_node *(*rnh_deladdr)      /* remove based on sockaddr */
171 	struct  radix_node *(*rnh_delpkt)       /* remove based on packet hdr */
173 	struct  radix_node *(*rnh_matchaddr)    /* locate based on sockaddr */
176 	struct  radix_node *(*rnh_matchaddr_args)
179 	struct  radix_node *(*rnh_lookup)       /* locate based on sockaddr */
182 	struct  radix_node *(*rnh_lookup_args)
185 	struct  radix_node *(*rnh_matchpkt)     /* locate based on packet hdr */
193 	(struct radix_node *rn, struct radix_node_head *head);
194 	struct  radix_node rnh_nodes[3];        /* empty tree for common case */
211 struct radix_node *rn_addmask(void *, int, int);
212 struct radix_node *rn_addroute(void *, void *, struct radix_node_head *,
213     struct radix_node [2]);
214 struct radix_node *rn_delete(void *, void *, struct radix_node_head *);
215 struct radix_node *rn_lookup(void *v_arg, void *m_arg, struct radix_node_head *head);
216 struct radix_node *rn_lookup_args(void *v_arg, void *m_arg, struct radix_node_head *head,
218 struct radix_node *rn_match(void *, struct radix_node_head *);
219 struct radix_node *rn_match_args(void *, struct radix_node_head *, rn_matchf_t *, void *);