52 struct radix_node {  struct
54 	struct	radix_node *rn_parent;	/* parent */  argument
65 			struct	radix_node *rn_Dupedkey;  argument
69 			struct	radix_node *rn_L;/* progeny */
70 			struct	radix_node *rn_R;/* progeny */
75 	struct radix_node *rn_twin;  argument
76 	struct radix_node *rn_ybro;  argument
98 		struct	radix_node *rmu_leaf;	/* for normal routes */
108 typedef int walktree_f_t(struct radix_node *, void *);
109 typedef struct radix_node *rn_matchaddr_f_t(void *v,
111 typedef struct radix_node *rn_addaddr_f_t(void *v, void *mask,
112     struct radix_head *head, struct radix_node nodes[]);
113 typedef struct radix_node *rn_deladdr_f_t(void *v, void *mask,
115 typedef struct radix_node *rn_lookup_f_t(void *v, void *mask,
121 typedef void rn_close_t(struct radix_node *rn, struct radix_head *head);
126 	struct	radix_node *rnh_treetop;
139 	struct	radix_node rnh_nodes[3];	/* empty tree for common case */
147 	struct radix_node mask_nodes[3];
150 void rn_inithead_internal(struct radix_head *rh, struct radix_node *base_nodes,
179 struct radix_node *rn_addroute(void *, void *, struct radix_head *,
180     struct radix_node[2]);
181 struct radix_node *rn_delete(void *, void *, struct radix_head *);
182 struct radix_node *rn_lookup (void *v_arg, void *m_arg,
184 struct radix_node *rn_match(void *, struct radix_head *);