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()
286 	int test, b, rn_bit;  in rn_match_args()  local
292 	for (; t->rn_bit >= 0;) {  in rn_match_args()
352 	rn_bit = -1 - b;  in rn_match_args()
366 			if ((rn_bit <= t->rn_bit) && RN_MATCHF(t, f, w)) {  in rn_match_args()
387 				if ((rn_bit <= m->rm_bit) &&  in rn_match_args()
418 	t->rn_bit = (short)b;  in rn_newpair()
422 	tt->rn_bit = -1;  in rn_newpair()
479 		} while (b > (unsigned) x->rn_bit);  in rn_insert()
586 	x->rn_bit = (short)(-1 - b);  in rn_addmask()
618 	m->rm_bit = tt->rn_bit;  in rn_new_radix_mask()
653 		b_leaf = x->rn_bit;  in rn_addroute()
654 		b = -1 - x->rn_bit;  in rn_addroute()
668 			    ((b_leaf < tt->rn_bit)  /* index(netmask) > node */  in rn_addroute()
710 		tt->rn_bit = -1;  in rn_addroute()
719 		tt->rn_bit = x->rn_bit;  in rn_addroute()
726 	b_leaf = -1 - t->rn_bit;  in rn_addroute()
733 	if (x->rn_bit < 0) {  in rn_addroute()
735 			if (x->rn_mask && (x->rn_bit >= b_leaf) && x->rn_mklist == 0) {  in rn_addroute()
755 	if ((netmask == 0) || (b > t->rn_bit)) {  in rn_addroute()
758 	b_leaf = tt->rn_bit;  in rn_addroute()
762 	} while (b <= t->rn_bit && x != top);  in rn_addroute()
852 	b = -1 - tt->rn_bit;  in rn_delete()
854 	if (b > t->rn_bit) {  in rn_delete()
860 	} while (b <= t->rn_bit && x != top);  in rn_delete()
960 		if (x->rn_bit >= 0) {  in rn_delete()
1050 	for (rn = h->rnh_treetop; rn->rn_bit >= 0;) {  in rn_walktree_from()
1070 	lastb = rn->rn_bit;  in rn_walktree_from()
1073 	while (rn->rn_bit >= 0) {  in rn_walktree_from()
1085 			if (rn->rn_bit <= lastb) {  in rn_walktree_from()
1127 		for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;) {  in rn_walktree_from()
1175 	while (rn->rn_bit >= 0) {  in rn_walktree()
1186 		for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;) {  in rn_walktree()
1230 	tt->rn_bit = (short)(-1 - off);  in rn_inithead()