100 struct radix_node {  struct
102 	struct  radix_node *rn_parent;  /* parent */  argument
118 			struct  radix_node *rn_Dupedkey;  argument
122 			struct  radix_node *rn_L;/* progeny */
123 			struct  radix_node *rn_R;/* progeny */
128 	struct radix_node *rn_twin;  argument
129 	struct radix_node *rn_ybro;  argument
152 typedef struct radix_node * __single radix_node_ref_t;
163 rn_set_key(struct radix_node *rn, void *key __sized_by(keylen), uint8_t keylen)  in rn_set_key()
176 rn_set_key(struct radix_node *rn, const void *key __sized_by(keylen), uint8_t keylen)  in rn_set_key()
191 rn_get_keylen(struct radix_node *rn)  in rn_get_keylen()
214 rn_get_key(struct radix_node *rn)  in rn_get_key()
223 rn_get_key(struct radix_node *rn, uint8_t *plen)  in rn_get_key()
236 rn_set_mask(struct radix_node *rn, void *mask __sized_by(masklen), uint8_t masklen)  in rn_set_mask()
267 rn_get_masklen(struct radix_node *rn)  in rn_get_masklen()
289 rn_get_mask(struct radix_node *rn)  in rn_get_mask()
309 		struct  radix_node *rm_leaf;    /* for normal routes */
382 typedef int walktree_f_t(struct radix_node *, void *);
383 typedef int rn_matchf_t(struct radix_node *, void *);
390 	struct  radix_node *rnh_treetop;
393 	struct  radix_node *(*rnh_addaddr)      /* add based on sockaddr */
395 	    struct radix_node_head *head, struct radix_node nodes[]);
396 	struct  radix_node *(*rnh_addpkt)       /* add based on packet hdr */
398 	    struct radix_node_head *head, struct radix_node nodes[]);
399 	struct  radix_node *(*rnh_deladdr)      /* remove based on sockaddr */
401 	struct  radix_node *(*rnh_delpkt)       /* remove based on packet hdr */
403 	struct  radix_node *(*rnh_matchaddr)    /* locate based on sockaddr */
406 	struct  radix_node *(*rnh_matchaddr_args)
409 	struct  radix_node *(*rnh_lookup)       /* locate based on sockaddr */
412 	struct  radix_node *(*rnh_lookup_args)
415 	struct  radix_node *(*rnh_matchpkt)     /* locate based on packet hdr */
423 	(struct radix_node *rn, struct radix_node_head *head);
424 	struct  radix_node rnh_nodes[3];        /* empty tree for common case */
443 struct radix_node *rn_addmask(void *, int, int);
444 struct radix_node *rn_addroute(void *, void *, struct radix_node_head *,
445     struct radix_node [2]);
446 struct radix_node *rn_delete(void *, void *, struct radix_node_head *);
447 struct radix_node *rn_lookup(void *v_arg, void *m_arg, struct radix_node_head *head);
448 struct radix_node *rn_lookup_args(void *v_arg, void *m_arg, struct radix_node_head *head,
450 struct radix_node *rn_match(void *, struct radix_node_head *);
451 struct radix_node *rn_match_args(void *, struct radix_node_head *, rn_matchf_t *, void *);