147 	for (x = head, v = v_arg; x->rn_bit >= 0;) {  in rn_search()
166 	for (x = head; x->rn_bit >= 0;) {  in rn_search_m()
279 	int test, b, rn_bit;  in rn_match()  local
285 	for (; t->rn_bit >= 0; ) {  in rn_match()
324 	rn_bit = -1 - b;  in rn_match()
337 			if (rn_bit <= t->rn_bit)  in rn_match()
355 				if (rn_bit <= m->rm_bit)  in rn_match()
407 	t->rn_bit = b;  in rn_newpair()
419 	tt->rn_bit = -1;  in rn_newpair()
470 	} while (b > (unsigned) x->rn_bit);  in rn_insert()
564 	x->rn_bit = -1 - b;  in rn_addmask()
595 	m->rm_bit = tt->rn_bit;  in rn_new_radix_mask()
629 		b_leaf = x->rn_bit;  in rn_addroute()
630 		b = -1 - x->rn_bit;  in rn_addroute()
643 			     ((b_leaf < tt->rn_bit) /* index(netmask) > node */  in rn_addroute()
685 		tt->rn_bit = -1;  in rn_addroute()
693 		tt->rn_bit = x->rn_bit;  in rn_addroute()
699 	b_leaf = -1 - t->rn_bit;  in rn_addroute()
705 	if (x->rn_bit < 0) {  in rn_addroute()
707 		if (x->rn_mask && (x->rn_bit >= b_leaf) && x->rn_mklist == 0) {  in rn_addroute()
723 	if ((netmask == 0) || (b > t->rn_bit ))  in rn_addroute()
725 	b_leaf = tt->rn_bit;  in rn_addroute()
729 	} while (b <= t->rn_bit && x != top);  in rn_addroute()
811 	b = -1 - tt->rn_bit;  in rn_delete()
813 	if (b > t->rn_bit)  in rn_delete()
818 	} while (b <= t->rn_bit && x != top);  in rn_delete()
900 		if (x->rn_bit >= 0) {  in rn_delete()
971 	for (rn = h->rnh_treetop; rn->rn_bit >= 0; ) {  in rn_walktree_from()
991 	if (rn->rn_bit >= 0)  in rn_walktree_from()
993 	lastb = last->rn_bit;  in rn_walktree_from()
1002 	while (rn->rn_bit >= 0)  in rn_walktree_from()
1014 			if (rn->rn_bit <= lastb) {  in rn_walktree_from()
1036 		for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)  in rn_walktree_from()
1070 	while (rn->rn_bit >= 0)  in rn_walktree()
1079 		for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)  in rn_walktree()
1114 	tt->rn_bit = -1 - off;  in rn_inithead_internal()