54 static struct radix_node
56 	     struct radix_node [2]),
57 	 *rn_newpair(void *, int, struct radix_node[2]),
58 	 *rn_search(const void *, struct radix_node *),
59 	 *rn_search_m(const void *, struct radix_node *, void *);
60 static struct radix_node *rn_addmask(const void *, struct radix_mask_head *, int,int);
76 		rn_new_radix_mask(struct radix_node *tt,
78 static int	rn_satisfies_leaf(const char *trial, struct radix_node *leaf,
141 static struct radix_node *
142 rn_search(const void *v_arg, struct radix_node *head)  in rn_search()
144 	struct radix_node *x;  in rn_search()
160 static struct radix_node *
161 rn_search_m(const void *v_arg, struct radix_node *head, void *m_arg)  in rn_search_m()
163 	struct radix_node *x;  in rn_search_m()
208 struct radix_node *
211 	struct radix_node *x;  in rn_lookup()
250 rn_satisfies_leaf(const char *trial, struct radix_node *leaf, int skip)  in rn_satisfies_leaf()
270 struct radix_node *
274 	struct radix_node *t = head->rnh_treetop, *x;  in rn_match()
277 	struct radix_node *saved_t, *top = t;  in rn_match()
375 struct radix_node *
376 rn_nextprefix(struct radix_node *rn)  in rn_nextprefix()
387 struct	radix_node *rn_clist;
403 static struct radix_node *
404 rn_newpair(void *v, int b, struct radix_node nodes[2])  in rn_newpair()
406 	struct radix_node *tt = nodes, *t = tt + 1;  in rn_newpair()
433 static struct radix_node *
435     struct radix_node nodes[2])  in rn_insert()
438 	struct radix_node *top = head->rnh_treetop;  in rn_insert()
440 	struct radix_node *t = rn_search(v_arg, top);  in rn_insert()
443 	struct radix_node *p, *tt, *x;  in rn_insert()
497 static struct radix_node *
503 	struct radix_node *x;  in rn_addmask()
506 	struct radix_node *saved_x;  in rn_addmask()
534 	R_Zalloc(x, struct radix_node *, RADIX_MAX_KEY_LEN + 2 * sizeof (*x));  in rn_addmask()
585 rn_new_radix_mask(struct radix_node *tt, struct radix_mask *next)  in rn_new_radix_mask()
606 struct radix_node *
608     struct radix_node treenodes[2])  in rn_addroute()
611 	struct radix_node *t, *x = NULL, *tt;  in rn_addroute()
612 	struct radix_node *saved_tt, *top = head->rnh_treetop;  in rn_addroute()
662 			struct	radix_node *xx = x;  in rn_addroute()
763 struct radix_node *
766 	struct radix_node *t, *p, *x, *tt;  in rn_delete()
768 	struct radix_node *dupedkey, *saved_tt, *top;  in rn_delete()
957 	struct radix_node *base, *next;  in rn_walktree_from()
960 	struct radix_node *rn, *last = NULL; /* shut up gcc */  in rn_walktree_from()
1061 	struct radix_node *base, *next;  in rn_walktree()
1062 	struct radix_node *rn = h->rnh_treetop;  in rn_walktree()
1104 rn_inithead_internal(struct radix_head *rh, struct radix_node *base_nodes, int off)  in rn_inithead_internal()
1106 	struct radix_node *t, *tt, *ttt;  in rn_inithead_internal()
1174 rn_freeentry(struct radix_node *rn, void *arg)  in rn_freeentry()
1177 	struct radix_node *x;  in rn_freeentry()
1179 	x = (struct radix_node *)rn_delete(rn + 2, NULL, rnh);  in rn_freeentry()