82 static struct radix_node *rn_insert(void *, struct radix_node_head *, int *, struct radix_node[2]);
83 static struct radix_node *rn_newpair(void * __sized_by(vlen), uint8_t vlen, int, struct radix_node[…
84 static struct radix_node *rn_search(void *, struct radix_node *);
85 static struct radix_node *rn_search_m(void *, struct radix_node *, void *);
103 static struct radix_mask * rn_new_radix_mask(struct radix_node *tt, struct radix_mask *next);
104 static int rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip,
167 static struct radix_node *
168 rn_search(void *v_arg, struct radix_node *head)  in rn_search()
170 	struct radix_node *x = head;  in rn_search()
184 static struct radix_node *
185 rn_search_m(void *v_arg, struct radix_node *head, void *m_arg)  in rn_search_m()
187 	struct radix_node *x = head;  in rn_search_m()
242 struct radix_node *
248 struct radix_node *
252 	struct radix_node *x;  in rn_lookup_args()
282 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip,  in rn_satisfies_leaf()
307 struct radix_node *
313 struct radix_node *
319 	struct radix_node *t = head->rnh_treetop, *x;  in rn_match_args()
322 	struct radix_node *saved_t, *top = t;  in rn_match_args()
451 struct  radix_node *rn_clist;
456 static struct radix_node *
457 rn_newpair(void *v __sized_by(vlen), uint8_t vlen, int b, struct radix_node nodes[2])  in rn_newpair()
459 	struct radix_node *tt = nodes, *t = tt + 1;  in rn_newpair()
478 static struct radix_node *
480     struct radix_node nodes[2])  in rn_insert()
484 	struct radix_node *top = head->rnh_treetop;  in rn_insert()
486 	struct radix_node *t = rn_search(v_arg, top);  in rn_insert()
489 	struct radix_node *tt;  in rn_insert()
513 		struct radix_node *p, *x = top;  in rn_insert()
553 struct radix_node *
557 	struct radix_node *x;  in rn_addmask()
561 	struct radix_node *saved_x;  in rn_addmask()
656 rn_new_radix_mask(struct radix_node *tt, struct radix_mask *next)  in rn_new_radix_mask()
673 struct radix_node *
675     struct radix_node treenodes[2])  in rn_addroute()
680 	struct radix_node *t, *x = NULL, *tt;  in rn_addroute()
681 	struct radix_node *saved_tt, *top = head->rnh_treetop;  in rn_addroute()
733 			struct  radix_node *xx = x;  in rn_addroute()
848 struct radix_node *
851 	struct radix_node *t, *p, *x, *tt;  in rn_delete()
853 	struct radix_node *dupedkey, *saved_tt, *top;  in rn_delete()
1071 	struct radix_node *base, *next;  in rn_walktree_from()
1074 	struct radix_node *rn, *last;  in rn_walktree_from()
1203 	struct radix_node *base, *next;  in rn_walktree()
1204 	struct radix_node *rn;  in rn_walktree()
1262 	struct radix_node *t, *tt, *ttt;  in rn_inithead()
1322 	    sizeof(struct radix_node) * 2 + max_keylen,  in rn_init()