82 static struct radix_node *rn_insert(void *, struct radix_node_head *, int *, struct radix_node[2]);
83 static struct radix_node *rn_newpair(const void * __sized_by(vlen), uint8_t vlen, int, struct radix…
84 static struct radix_node *rn_search(void *, struct radix_node *);
85 static struct radix_node *rn_search_m(void *, struct radix_node *, void *);
130 static struct radix_mask * rn_new_radix_mask(struct radix_node *tt, struct radix_mask *next);
131 static int rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip,
155 			struct radix_node tt;
156 			struct radix_node t;
160 		struct radix_node rnb_nodes[2];
164 static struct radix_node *
165 rn_lexical_parent(struct radix_node *tt)  in rn_lexical_parent()
240 static struct radix_node *
241 rn_search(void *v_arg, struct radix_node *head)  in rn_search()
243 	struct radix_node *x = head;  in rn_search()
257 static struct radix_node *
258 rn_search_m(void *v_arg, struct radix_node *head, void *m_arg)  in rn_search_m()
260 	struct radix_node *x = head;  in rn_search_m()
315 struct radix_node *
321 struct radix_node *
325 	struct radix_node *x;  in rn_lookup_args()
355 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip,  in rn_satisfies_leaf()
383 struct radix_node *
389 struct radix_node *
395 	struct radix_node *t = head->rnh_treetop, *x;  in rn_match_args()
397 	struct radix_node *saved_t, *top = t;  in rn_match_args()
540 struct  radix_node *rn_clist;
545 static struct radix_node *
546 rn_newpair(const void *v __sized_by(vlen), uint8_t vlen, int b, struct radix_node nodes[2])  in rn_newpair()
548 	struct radix_node *tt = &nodes[0];  in rn_newpair()
549 	struct radix_node *t = &nodes[1];  in rn_newpair()
570 static struct radix_node *
572     struct radix_node nodes[2])  in rn_insert()
576 	struct radix_node *top = head->rnh_treetop;  in rn_insert()
578 	struct radix_node *t = rn_search(v_arg, top);  in rn_insert()
581 	struct radix_node *tt;  in rn_insert()
606 		struct radix_node *p, *x = top;  in rn_insert()
648 struct radix_node *
653 	struct radix_node *x __single;  in rn_addmask()
755 rn_new_radix_mask(struct radix_node *tt, struct radix_mask *next)  in rn_new_radix_mask()
772 struct radix_node *
774     struct radix_node treenodes[2])  in rn_addroute()
780 	struct radix_node *t, *x = NULL, *tt;  in rn_addroute()
781 	struct radix_node *saved_tt, *top = head->rnh_treetop;  in rn_addroute()
833 			struct  radix_node *xx = x;  in rn_addroute()
948 struct radix_node *
956 	struct radix_node *t __single, *p __single, *x __single, *tt __single;  in rn_delete()
958 	struct radix_node *dupedkey, *saved_tt, *top;  in rn_delete()
1196 	struct radix_node *base, *next;  in rn_walktree_from()
1199 	struct radix_node *rn, *last;  in rn_walktree_from()
1330 	struct radix_node *base, *next;  in rn_walktree()
1331 	struct radix_node *rn;  in rn_walktree()
1389 	struct radix_node *t, *tt, *ttt;  in rn_inithead()