57 static struct radix_node
59 	     struct radix_node [2]),
60 	 *rn_newpair(void *, int, struct radix_node[2]),
61 	 *rn_search(void *, struct radix_node *),
62 	 *rn_search_m(void *, struct radix_node *, void *);
63 static struct radix_node *rn_addmask(void *, struct radix_mask_head *, int,int);
79 		rn_new_radix_mask(struct radix_node *tt,
81 static int	rn_satisfies_leaf(char *trial, struct radix_node *leaf,
144 static struct radix_node *
145 rn_search(void *v_arg, struct radix_node *head)  in rn_search()
147 	struct radix_node *x;  in rn_search()
163 static struct radix_node *
164 rn_search_m(void *v_arg, struct radix_node *head, void *m_arg)  in rn_search_m()
166 	struct radix_node *x;  in rn_search_m()
211 struct radix_node *
214 	struct radix_node *x;  in rn_lookup()
253 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip)  in rn_satisfies_leaf()
273 struct radix_node *
277 	struct radix_node *t = head->rnh_treetop, *x;  in rn_match()
280 	struct radix_node *saved_t, *top = t;  in rn_match()
376 struct	radix_node *rn_clist;
392 static struct radix_node *
393 rn_newpair(void *v, int b, struct radix_node nodes[2])  in rn_newpair()
395 	struct radix_node *tt = nodes, *t = tt + 1;  in rn_newpair()
422 static struct radix_node *
424     struct radix_node nodes[2])  in rn_insert()
427 	struct radix_node *top = head->rnh_treetop;  in rn_insert()
429 	struct radix_node *t = rn_search(v_arg, top);  in rn_insert()
432 	struct radix_node *p, *tt, *x;  in rn_insert()
486 static struct radix_node *
491 	struct radix_node *x;  in rn_addmask()
494 	struct radix_node *saved_x;  in rn_addmask()
522 	R_Zalloc(x, struct radix_node *, RADIX_MAX_KEY_LEN + 2 * sizeof (*x));  in rn_addmask()
573 rn_new_radix_mask(struct radix_node *tt, struct radix_mask *next)  in rn_new_radix_mask()
594 struct radix_node *
596     struct radix_node treenodes[2])  in rn_addroute()
599 	struct radix_node *t, *x = NULL, *tt;  in rn_addroute()
600 	struct radix_node *saved_tt, *top = head->rnh_treetop;  in rn_addroute()
650 			struct	radix_node *xx = x;  in rn_addroute()
751 struct radix_node *
754 	struct radix_node *t, *p, *x, *tt;  in rn_delete()
756 	struct radix_node *dupedkey, *saved_tt, *top;  in rn_delete()
944 	struct radix_node *base, *next;  in rn_walktree_from()
947 	struct radix_node *rn, *last = NULL; /* shut up gcc */  in rn_walktree_from()
1048 	struct radix_node *base, *next;  in rn_walktree()
1049 	struct radix_node *rn = h->rnh_treetop;  in rn_walktree()
1091 rn_inithead_internal(struct radix_head *rh, struct radix_node *base_nodes, int off)  in rn_inithead_internal()
1093 	struct radix_node *t, *tt, *ttt;  in rn_inithead_internal()
1161 rn_freeentry(struct radix_node *rn, void *arg)  in rn_freeentry()
1164 	struct radix_node *x;  in rn_freeentry()
1166 	x = (struct radix_node *)rn_delete(rn + 2, NULL, rnh);  in rn_freeentry()