59 static struct radix_node
61 	     struct radix_node [2]),
62 	 *rn_newpair(void *, int, struct radix_node[2]),
63 	 *rn_search(void *, struct radix_node *),
64 	 *rn_search_m(void *, struct radix_node *, void *);
65 static struct radix_node *rn_addmask(void *, struct radix_mask_head *, int,int);
82 		rn_new_radix_mask(struct radix_node *tt,
84 static int	rn_satisfies_leaf(char *trial, struct radix_node *leaf,
147 static struct radix_node *
148 rn_search(void *v_arg, struct radix_node *head)  in rn_search()
150 	struct radix_node *x;  in rn_search()
166 static struct radix_node *
167 rn_search_m(void *v_arg, struct radix_node *head, void *m_arg)  in rn_search_m()
169 	struct radix_node *x;  in rn_search_m()
214 struct radix_node *
217 	struct radix_node *x;  in rn_lookup()
256 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip)  in rn_satisfies_leaf()
276 struct radix_node *
280 	struct radix_node *t = head->rnh_treetop, *x;  in rn_match()
283 	struct radix_node *saved_t, *top = t;  in rn_match()
379 struct	radix_node *rn_clist;
395 static struct radix_node *
396 rn_newpair(void *v, int b, struct radix_node nodes[2])  in rn_newpair()
398 	struct radix_node *tt = nodes, *t = tt + 1;  in rn_newpair()
425 static struct radix_node *
427     struct radix_node nodes[2])  in rn_insert()
430 	struct radix_node *top = head->rnh_treetop;  in rn_insert()
432 	struct radix_node *t = rn_search(v_arg, top);  in rn_insert()
435 	struct radix_node *p, *tt, *x;  in rn_insert()
489 struct radix_node *
494 	struct radix_node *x;  in rn_addmask()
497 	struct radix_node *saved_x;  in rn_addmask()
525 	R_Zalloc(x, struct radix_node *, RADIX_MAX_KEY_LEN + 2 * sizeof (*x));  in rn_addmask()
576 rn_new_radix_mask(struct radix_node *tt, struct radix_mask *next)  in rn_new_radix_mask()
597 struct radix_node *
599     struct radix_node treenodes[2])  in rn_addroute()
602 	struct radix_node *t, *x = NULL, *tt;  in rn_addroute()
603 	struct radix_node *saved_tt, *top = head->rnh_treetop;  in rn_addroute()
668 			struct	radix_node *xx = x;  in rn_addroute()
771 struct radix_node *
774 	struct radix_node *t, *p, *x, *tt;  in rn_delete()
776 	struct radix_node *dupedkey, *saved_tt, *top;  in rn_delete()
964 	struct radix_node *base, *next;  in rn_walktree_from()
967 	struct radix_node *rn, *last = NULL; /* shut up gcc */  in rn_walktree_from()
1069 	struct radix_node *base, *next;  in rn_walktree()
1070 	struct radix_node *rn = h->rnh_treetop;  in rn_walktree()
1112 rn_inithead_internal(struct radix_head *rh, struct radix_node *base_nodes, int off)  in rn_inithead_internal()
1114 	struct radix_node *t, *tt, *ttt;  in rn_inithead_internal()
1182 rn_freeentry(struct radix_node *rn, void *arg)  in rn_freeentry()
1185 	struct radix_node *x;  in rn_freeentry()
1187 	x = (struct radix_node *)rn_delete(rn + 2, NULL, rnh);  in rn_freeentry()