49 struct radix_node {  struct
51 	struct	radix_node *rn_parent;	/* parent */  argument
62 			struct	radix_node *rn_Dupedkey;  argument
66 			struct	radix_node *rn_L;/* progeny */
67 			struct	radix_node *rn_R;/* progeny */
72 	struct radix_node *rn_twin;  argument
73 	struct radix_node *rn_ybro;  argument
95 		struct	radix_node *rmu_leaf;	/* for normal routes */
105 typedef int walktree_f_t(struct radix_node *, void *);
106 typedef struct radix_node *rn_matchaddr_f_t(const void *v,
108 typedef struct radix_node *rn_addaddr_f_t(void *v, const void *mask,
109     struct radix_head *head, struct radix_node nodes[]);
110 typedef struct radix_node *rn_deladdr_f_t(const void *v, const void *mask,
112 typedef struct radix_node *rn_lookup_f_t(const void *v, const void *mask,
118 typedef void rn_close_t(struct radix_node *rn, struct radix_head *head);
119 struct radix_node *rn_nextprefix(struct radix_node *rn);
124 	struct	radix_node *rnh_treetop;
137 	struct	radix_node rnh_nodes[3];	/* empty tree for common case */
145 	struct radix_node mask_nodes[3];
148 void rn_inithead_internal(struct radix_head *rh, struct radix_node *base_nodes,
177 struct radix_node *rn_addroute(void *, const void *, struct radix_head *,
178     struct radix_node[2]);
179 struct radix_node *rn_delete(const void *, const void *, struct radix_head *);
180 struct radix_node *rn_lookup (const void *v_arg, const void *m_arg,
182 struct radix_node *rn_match(const void *, struct radix_head *);