376 rn_nextprefix(struct radix_node *rn)  in rn_nextprefix()  argument
378 	for (rn = rn->rn_dupedkey; rn != NULL; rn = rn->rn_dupedkey) {  in rn_nextprefix()
379 		if (!(rn->rn_flags & RNF_ROOT))  in rn_nextprefix()
380 			return (rn);  in rn_nextprefix()
960 	struct radix_node *rn, *last = NULL; /* shut up gcc */  in rn_walktree_from()  local
971 	for (rn = h->rnh_treetop; rn->rn_bit >= 0; ) {  in rn_walktree_from()
972 		last = rn;  in rn_walktree_from()
975 		if (!(rn->rn_bmask & xm[rn->rn_offset])) {  in rn_walktree_from()
978 		if (rn->rn_bmask & xa[rn->rn_offset]) {  in rn_walktree_from()
979 			rn = rn->rn_right;  in rn_walktree_from()
981 			rn = rn->rn_left;  in rn_walktree_from()
991 	if (rn->rn_bit >= 0)  in rn_walktree_from()
992 		rn = last;  in rn_walktree_from()
1002 	while (rn->rn_bit >= 0)  in rn_walktree_from()
1003 		rn = rn->rn_left;  in rn_walktree_from()
1007 		base = rn;  in rn_walktree_from()
1009 		while (rn->rn_parent->rn_right == rn  in rn_walktree_from()
1010 		       && !(rn->rn_flags & RNF_ROOT)) {  in rn_walktree_from()
1011 			rn = rn->rn_parent;  in rn_walktree_from()
1014 			if (rn->rn_bit <= lastb) {  in rn_walktree_from()
1032 		if (rn->rn_parent->rn_flags & RNF_ROOT)  in rn_walktree_from()
1036 		for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)  in rn_walktree_from()
1037 			rn = rn->rn_left;  in rn_walktree_from()
1038 		next = rn;  in rn_walktree_from()
1040 		while ((rn = base) != NULL) {  in rn_walktree_from()
1041 			base = rn->rn_dupedkey;  in rn_walktree_from()
1043 			if (!(rn->rn_flags & RNF_ROOT)  in rn_walktree_from()
1044 			    && (error = (*f)(rn, w)))  in rn_walktree_from()
1047 		rn = next;  in rn_walktree_from()
1049 		if (rn->rn_flags & RNF_ROOT) {  in rn_walktree_from()
1062 	struct radix_node *rn = h->rnh_treetop;  in rn_walktree()  local
1070 	while (rn->rn_bit >= 0)  in rn_walktree()
1071 		rn = rn->rn_left;  in rn_walktree()
1073 		base = rn;  in rn_walktree()
1075 		while (rn->rn_parent->rn_right == rn  in rn_walktree()
1076 		       && (rn->rn_flags & RNF_ROOT) == 0)  in rn_walktree()
1077 			rn = rn->rn_parent;  in rn_walktree()
1079 		for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)  in rn_walktree()
1080 			rn = rn->rn_left;  in rn_walktree()
1081 		next = rn;  in rn_walktree()
1083 		while ((rn = base)) {  in rn_walktree()
1084 			base = rn->rn_dupedkey;  in rn_walktree()
1085 			if (!(rn->rn_flags & RNF_ROOT)  in rn_walktree()
1086 			    && (error = (*f)(rn, w)))  in rn_walktree()
1089 		rn = next;  in rn_walktree()
1090 		if (rn->rn_flags & RNF_ROOT)  in rn_walktree()
1174 rn_freeentry(struct radix_node *rn, void *arg)  in rn_freeentry()  argument
1179 	x = (struct radix_node *)rn_delete(rn + 2, NULL, rnh);  in rn_freeentry()