60 struct radix_node {  struct
62 	struct	radix_node *rn_parent;	/* parent */  argument
73 			struct	radix_node *rn_Dupedkey;  argument
77 			struct	radix_node *rn_L; /* progeny */
78 			struct	radix_node *rn_R; /* progeny */
102 		struct	radix_node *rmu_leaf;	/* for normal routes */  argument
110 typedef int walktree_f_t(struct radix_node *, void *);
111 typedef boolean_t match_leaf_t(struct radix_node *, void *);
112 typedef void (*lockf_t)(struct radix_node *);
115 	struct	radix_node *rnh_treetop;
118 	struct	radix_node *(*rnh_addaddr)	/* add based on sockaddr */
120 		struct radix_node_head *head, struct radix_node nodes[]);
121 	struct	radix_node *(*rnh_addpkt)	/* add based on packet hdr */
123 		    struct radix_node_head *head, struct radix_node nodes[]);
124 	struct	radix_node *(*rnh_deladdr)	/* remove based on sockaddr */
126 	struct	radix_node *(*rnh_delpkt)	/* remove based on packet hdr */
128 	struct	radix_node *(*rnh_matchaddr)	/* locate based on sockaddr */
131 	struct	radix_node *(*rnh_matchaddr_args)
134 	struct	radix_node *(*rnh_lookup)	/* locate based on sockaddr */
136 	struct	radix_node *(*rnh_matchpkt)	/* locate based on packet hdr */
148 		(struct radix_node *rn, struct radix_node_head *head);
149 	struct	radix_node rnh_nodes[3];	/* empty tree for common case */
186 typedef struct radix_node rn_t;
227 int	rn_freenode(struct radix_node *, void *);