bsd/net/radix.c

87 static struct radix_node
89 			struct radix_node [2]),
90 	 *rn_newpair(void *, int, struct radix_node[2]),
91 	 *rn_search(void *, struct radix_node *),
92 	 *rn_search_m(void *, struct radix_node *, void *);
112 		rn_new_radix_mask(struct radix_node *tt,
114 static int rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip,
153 static struct radix_node *
154 rn_search(void *v_arg, struct radix_node *head)
156 	struct radix_node *x;
168 static struct radix_node *
169 rn_search_m(void *v_arg, struct radix_node *head, void *m_arg)
171 	struct radix_node *x;
210 struct radix_node *
216 struct radix_node *
220 	struct radix_node *x;
245 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip,
264 struct radix_node *
270 struct radix_node *
275 	struct radix_node *t = head->rnh_treetop, *x;
278 	struct radix_node *saved_t, *top = t;
392 struct	radix_node *rn_clist;
397 static struct radix_node *
398 rn_newpair(void *v, int b, struct radix_node nodes[2])
400 	struct radix_node *tt = nodes, *t = tt + 1;
419 static struct radix_node *
421 	  struct radix_node nodes[2])
424 	struct radix_node *top = head->rnh_treetop;
426 	struct radix_node *t = rn_search(v_arg, top);
429 	struct radix_node *tt;
450 	struct radix_node *p, *x = top;
486 struct radix_node *
490 	struct radix_node *x;
494 	struct radix_node *saved_x;
526 	R_Malloc(x, struct radix_node *, max_keylen + 2 * sizeof (*x));
573 rn_new_radix_mask(struct radix_node *tt, struct radix_mask *next)
594 struct radix_node *
596 	    struct radix_node treenodes[2])
599 	struct radix_node *t, *x = NULL, *tt;
600 	struct radix_node *saved_tt, *top = head->rnh_treetop;
646 			struct	radix_node *xx = x;
748 struct radix_node *
751 	struct radix_node *t, *p, *x, *tt;
753 	struct radix_node *dupedkey, *saved_tt, *top;
941 	struct radix_node *base, *next;
944 	struct radix_node *rn, *last;
1065 	struct radix_node *base, *next;
1066 	struct radix_node *rn;
1118 	struct radix_node *t, *tt, *ttt;