174 	while (x->rn_bit >= 0) {  in rn_search()
193 	while (x->rn_bit >= 0) {  in rn_search_m()
324 	int test, b, rn_bit;  in rn_match_args()  local
330 	for (; t->rn_bit >= 0;) {  in rn_match_args()
393 	rn_bit = -1 - b;  in rn_match_args()
408 			if ((rn_bit <= t->rn_bit) && RN_MATCHF(t, f, w)) {  in rn_match_args()
429 				if ((rn_bit <= m->rm_bit) &&  in rn_match_args()
460 	t->rn_bit = (short)b;  in rn_newpair()
464 	tt->rn_bit = -1;  in rn_newpair()
522 		} while (b > (unsigned) x->rn_bit);  in rn_insert()
629 	x->rn_bit = (short)(-1 - b);  in rn_addmask()
661 	m->rm_bit = tt->rn_bit;  in rn_new_radix_mask()
698 		b_leaf = x->rn_bit;  in rn_addroute()
699 		b = -1 - x->rn_bit;  in rn_addroute()
716 			    ((b_leaf < tt->rn_bit)  /* index(netmask) > node */  in rn_addroute()
758 		tt->rn_bit = -1;  in rn_addroute()
767 		tt->rn_bit = x->rn_bit;  in rn_addroute()
774 	b_leaf = -1 - t->rn_bit;  in rn_addroute()
781 	if (x->rn_bit < 0) {  in rn_addroute()
783 			if (rn_get_mask(x) != NULL && (x->rn_bit >= b_leaf) && x->rn_mklist == 0) {  in rn_addroute()
803 	if ((netmask == 0) || (b > t->rn_bit)) {  in rn_addroute()
806 	b_leaf = tt->rn_bit;  in rn_addroute()
810 	} while (b <= t->rn_bit && x != top);  in rn_addroute()
900 	b = -1 - tt->rn_bit;  in rn_delete()
902 	if (b > t->rn_bit) {  in rn_delete()
908 	} while (b <= t->rn_bit && x != top);  in rn_delete()
1008 		if (x->rn_bit >= 0) {  in rn_delete()
1098 	for (rn = h->rnh_treetop; rn->rn_bit >= 0;) {  in rn_walktree_from()
1118 	lastb = rn->rn_bit;  in rn_walktree_from()
1121 	while (rn->rn_bit >= 0) {  in rn_walktree_from()
1133 			if (rn->rn_bit <= lastb) {  in rn_walktree_from()
1175 		for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;) {  in rn_walktree_from()
1223 	while (rn->rn_bit >= 0) {  in rn_walktree()
1234 		for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;) {  in rn_walktree()
1278 	tt->rn_bit = (short)(-1 - off);  in rn_inithead()