73 static int rn_satisfies_leaf(const char *, struct radix_node *, int);
75 static struct radix_mask *rn_new_radix_mask(struct radix_node *,
77 static struct radix_node *rn_walknext(struct radix_node *, rn_printer_t,
79 static struct radix_node *rn_walkfirst(struct radix_node *, rn_printer_t,
81 static void rn_nodeprint(struct radix_node *, rn_printer_t, void *,
125 struct radix_node *
128 	struct radix_node *head)  in rn_search()
131 	struct radix_node *x;  in rn_search()
142 struct radix_node *
145 	struct radix_node *head,  in rn_search_m()
148 	struct radix_node *x;  in rn_search_m()
192 struct radix_node *
198 	struct radix_node *x;  in rn_lookup()
217 	struct radix_node *leaf,  in rn_satisfies_leaf()
237 struct radix_node *
243 	struct radix_node *t = head->rnh_treetop;  in rn_match()
244 	struct radix_node *top = t;  in rn_match()
245 	struct radix_node *x;  in rn_match()
246 	struct radix_node *saved_t;  in rn_match()
345 rn_nodeprint(struct radix_node *rn, rn_printer_t printer, void *arg,  in rn_nodeprint()
369 	struct radix_node *dup, *rn;  in rn_treeprint()
395 struct radix_node *
399 	struct radix_node nodes[2])  in rn_newpair()
401 	struct radix_node *tt = nodes;  in rn_newpair()
402 	struct radix_node *t = tt + 1;  in rn_newpair()
410 struct radix_node *
415 	struct radix_node nodes[2])  in rn_insert()
417 	struct radix_node *top = head->rnh_treetop;  in rn_insert()
418 	struct radix_node *t = rn_search(v_arg, top);  in rn_insert()
419 	struct radix_node *tt;  in rn_insert()
445 	struct radix_node *p, *x = top;  in rn_insert()
478 struct radix_node *
487 	struct radix_node *x;  in rn_addmask()
488 	struct radix_node *saved_x;  in rn_addmask()
522 	R_Malloc(x, struct radix_node *, max_keylen + 2 * sizeof (*x));  in rn_addmask()
573 	struct radix_node *tt,  in rn_new_radix_mask()
595 struct radix_node *
600 	struct radix_node treenodes[2])  in rn_addroute()
603 	struct radix_node *t, *x = NULL, *tt;  in rn_addroute()
604 	struct radix_node *saved_tt, *top = head->rnh_treetop;  in rn_addroute()
653 			struct	radix_node *xx = x;  in rn_addroute()
753 struct radix_node *
758 	struct radix_node *rn)  in rn_delete1()
760 	struct radix_node *t, *p, *x, *tt;  in rn_delete1()
762 	struct radix_node *dupedkey, *saved_tt, *top;  in rn_delete1()
937 struct radix_node *
946 static struct radix_node *
947 rn_walknext(struct radix_node *rn, rn_printer_t printer, void *arg)  in rn_walknext()
966 static struct radix_node *
967 rn_walkfirst(struct radix_node *rn, rn_printer_t printer, void *arg)  in rn_walkfirst()
981 	int (*f)(struct radix_node *, void *),  in rn_walktree()  argument
985 	struct radix_node *base, *next, *rn;  in rn_walktree()
1008 struct radix_node *
1010     int (*matcher)(struct radix_node *, void *), void *w)  in rn_search_matched()  argument
1013 	struct radix_node *base, *next, *rn;  in rn_search_matched()
1082 	struct radix_node *t;  in rn_inithead0()
1083 	struct radix_node *tt;  in rn_inithead0()
1084 	struct radix_node *ttt;  in rn_inithead0()