150 	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()
291 	int test, b, rn_bit;  in rn_match_args()  local
297 	for (; t->rn_bit >= 0;) {  in rn_match_args()
360 	rn_bit = -1 - b;  in rn_match_args()
375 			if ((rn_bit <= t->rn_bit) && RN_MATCHF(t, f, w)) {  in rn_match_args()
396 				if ((rn_bit <= m->rm_bit) &&  in rn_match_args()
427 	t->rn_bit = (short)b;  in rn_newpair()
431 	tt->rn_bit = -1;  in rn_newpair()
488 		} while (b > (unsigned) x->rn_bit);  in rn_insert()
595 	x->rn_bit = (short)(-1 - b);  in rn_addmask()
627 	m->rm_bit = tt->rn_bit;  in rn_new_radix_mask()
662 		b_leaf = x->rn_bit;  in rn_addroute()
663 		b = -1 - x->rn_bit;  in rn_addroute()
680 			    ((b_leaf < tt->rn_bit)  /* index(netmask) > node */  in rn_addroute()
722 		tt->rn_bit = -1;  in rn_addroute()
731 		tt->rn_bit = x->rn_bit;  in rn_addroute()
738 	b_leaf = -1 - t->rn_bit;  in rn_addroute()
745 	if (x->rn_bit < 0) {  in rn_addroute()
747 			if (rn_get_mask(x) != NULL && (x->rn_bit >= b_leaf) && x->rn_mklist == 0) {  in rn_addroute()
767 	if ((netmask == 0) || (b > t->rn_bit)) {  in rn_addroute()
770 	b_leaf = tt->rn_bit;  in rn_addroute()
774 	} while (b <= t->rn_bit && x != top);  in rn_addroute()
864 	b = -1 - tt->rn_bit;  in rn_delete()
866 	if (b > t->rn_bit) {  in rn_delete()
872 	} while (b <= t->rn_bit && x != top);  in rn_delete()
972 		if (x->rn_bit >= 0) {  in rn_delete()
1062 	for (rn = h->rnh_treetop; rn->rn_bit >= 0;) {  in rn_walktree_from()
1082 	lastb = rn->rn_bit;  in rn_walktree_from()
1085 	while (rn->rn_bit >= 0) {  in rn_walktree_from()
1097 			if (rn->rn_bit <= lastb) {  in rn_walktree_from()
1139 		for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;) {  in rn_walktree_from()
1187 	while (rn->rn_bit >= 0) {  in rn_walktree()
1198 		for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;) {  in rn_walktree()
1242 	tt->rn_bit = (short)(-1 - off);  in rn_inithead()