81 static struct radix_node *rn_insert(void *, struct radix_node_head *, int *, struct radix_node[2]);
82 static struct radix_node *rn_newpair(void *, int, struct radix_node[2]);
83 static struct radix_node *rn_search(void *, struct radix_node *);
84 static struct radix_node *rn_search_m(void *, struct radix_node *, void *);
103 rn_new_radix_mask(struct radix_node *tt,
105 static int rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip,
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()
160 static struct radix_node *
161 rn_search_m(void *v_arg, struct radix_node *head, void *m_arg)  in rn_search_m()
163 	struct radix_node *x;  in rn_search_m()
211 struct radix_node *
217 struct radix_node *
221 	struct radix_node *x;  in rn_lookup_args()
248 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip,  in rn_satisfies_leaf()
270 struct radix_node *
276 struct radix_node *
281 	struct radix_node *t = head->rnh_treetop, *x;  in rn_match_args()
284 	struct radix_node *saved_t, *top = t;  in rn_match_args()
409 struct  radix_node *rn_clist;
414 static struct radix_node *
415 rn_newpair(void *v, int b, struct radix_node nodes[2])  in rn_newpair()
417 	struct radix_node *tt = nodes, *t = tt + 1;  in rn_newpair()
436 static struct radix_node *
438     struct radix_node nodes[2])  in rn_insert()
441 	struct radix_node *top = head->rnh_treetop;  in rn_insert()
443 	struct radix_node *t = rn_search(v_arg, top);  in rn_insert()
446 	struct radix_node *tt;  in rn_insert()
470 		struct radix_node *p, *x = top;  in rn_insert()
510 struct radix_node *
514 	struct radix_node *x;  in rn_addmask()
518 	struct radix_node *saved_x;  in rn_addmask()
613 rn_new_radix_mask(struct radix_node *tt, struct radix_mask *next)  in rn_new_radix_mask()
630 struct radix_node *
632     struct radix_node treenodes[2])  in rn_addroute()
635 	struct radix_node *t, *x = NULL, *tt;  in rn_addroute()
636 	struct radix_node *saved_tt, *top = head->rnh_treetop;  in rn_addroute()
685 			struct  radix_node *xx = x;  in rn_addroute()
800 struct radix_node *
803 	struct radix_node *t, *p, *x, *tt;  in rn_delete()
805 	struct radix_node *dupedkey, *saved_tt, *top;  in rn_delete()
1023 	struct radix_node *base, *next;  in rn_walktree_from()
1026 	struct radix_node *rn, *last;  in rn_walktree_from()
1155 	struct radix_node *base, *next;  in rn_walktree()
1156 	struct radix_node *rn;  in rn_walktree()
1214 	struct radix_node *t, *tt, *ttt;  in rn_inithead()
1274 	    sizeof(struct radix_node) * 2 + max_keylen,  in rn_init()