56 static struct radix_node
58 	     struct radix_node [2]),
59 	 *rn_newpair(void *, int, struct radix_node[2]),
60 	 *rn_search(const void *, struct radix_node *),
61 	 *rn_search_m(const void *, struct radix_node *, void *);
62 static struct radix_node *rn_addmask(const void *, struct radix_mask_head *, int,int);
78 		rn_new_radix_mask(struct radix_node *tt,
80 static int	rn_satisfies_leaf(const char *trial, struct radix_node *leaf,
143 static struct radix_node *
144 rn_search(const void *v_arg, struct radix_node *head)  in rn_search()
146 	struct radix_node *x;  in rn_search()
162 static struct radix_node *
163 rn_search_m(const void *v_arg, struct radix_node *head, void *m_arg)  in rn_search_m()
165 	struct radix_node *x;  in rn_search_m()
210 struct radix_node *
213 	struct radix_node *x;  in rn_lookup()
252 rn_satisfies_leaf(const char *trial, struct radix_node *leaf, int skip)  in rn_satisfies_leaf()
272 struct radix_node *
276 	struct radix_node *t = head->rnh_treetop, *x;  in rn_match()
279 	struct radix_node *saved_t, *top = t;  in rn_match()
377 struct radix_node *
378 rn_nextprefix(struct radix_node *rn)  in rn_nextprefix()
389 struct	radix_node *rn_clist;
405 static struct radix_node *
406 rn_newpair(void *v, int b, struct radix_node nodes[2])  in rn_newpair()
408 	struct radix_node *tt = nodes, *t = tt + 1;  in rn_newpair()
435 static struct radix_node *
437     struct radix_node nodes[2])  in rn_insert()
440 	struct radix_node *top = head->rnh_treetop;  in rn_insert()
442 	struct radix_node *t = rn_search(v_arg, top);  in rn_insert()
445 	struct radix_node *p, *tt, *x;  in rn_insert()
499 static struct radix_node *
505 	struct radix_node *x;  in rn_addmask()
508 	struct radix_node *saved_x;  in rn_addmask()
536 	R_Zalloc(x, struct radix_node *, RADIX_MAX_KEY_LEN + 2 * sizeof (*x));  in rn_addmask()
587 rn_new_radix_mask(struct radix_node *tt, struct radix_mask *next)  in rn_new_radix_mask()
608 struct radix_node *
610     struct radix_node treenodes[2])  in rn_addroute()
613 	struct radix_node *t, *x = NULL, *tt;  in rn_addroute()
614 	struct radix_node *saved_tt, *top = head->rnh_treetop;  in rn_addroute()
664 			struct	radix_node *xx = x;  in rn_addroute()
765 struct radix_node *
768 	struct radix_node *t, *p, *x, *tt;  in rn_delete()
770 	struct radix_node *dupedkey, *saved_tt, *top;  in rn_delete()
959 	struct radix_node *base, *next;  in rn_walktree_from()
962 	struct radix_node *rn, *last = NULL; /* shut up gcc */  in rn_walktree_from()
1063 	struct radix_node *base, *next;  in rn_walktree()
1064 	struct radix_node *rn = h->rnh_treetop;  in rn_walktree()
1106 rn_inithead_internal(struct radix_head *rh, struct radix_node *base_nodes, int off)  in rn_inithead_internal()
1108 	struct radix_node *t, *tt, *ttt;  in rn_inithead_internal()
1176 rn_freeentry(struct radix_node *rn, void *arg)  in rn_freeentry()
1179 	struct radix_node *x;  in rn_freeentry()
1181 	x = (struct radix_node *)rn_delete(rn + 2, NULL, rnh);  in rn_freeentry()