100 	for (x = head, v = v_arg; x->rn_b >= 0;) {  in rn_search()
117 	for (x = head; x->rn_b >= 0;) {  in rn_search_m()
203 	int test, b, rn_b;  in rn_match()  local
209 	for (; t->rn_b >= 0; ) {  in rn_match()
261 	rn_b = -1 - b;  in rn_match()
274 			if (rn_b <= t->rn_b)  in rn_match()
294 					if (rn_b <= m->rm_b)  in rn_match()
321 	t->rn_b = b; t->rn_bmask = 0x80 >> (b & 7);  in rn_newpair()
323 	tt->rn_b = -1; tt->rn_key = (caddr_t)v; tt->rn_p = t;  in rn_newpair()
376 	} while ((unsigned)b > (unsigned)x->rn_b);  in rn_insert()
465 	x->rn_b = -1 - b;  in rn_addmask()
497 	m->rm_b = tt->rn_b;  in rn_new_radix_mask()
532 		b_leaf = x->rn_b;  in rn_addroute()
533 		b = -1 - x->rn_b;  in rn_addroute()
546 			     ((b_leaf < tt->rn_b) || /* index(netmask) > node */  in rn_addroute()
578 		tt->rn_b = -1;  in rn_addroute()
586 		tt->rn_b = x->rn_b;  in rn_addroute()
592 	b_leaf = -1 - t->rn_b;  in rn_addroute()
595 	if (x->rn_b < 0) {  in rn_addroute()
597 		if (x->rn_mask && (x->rn_b >= b_leaf) && x->rn_mklist == 0) {  in rn_addroute()
612 	if ((netmask == 0) || (b > t->rn_b ))  in rn_addroute()
614 	b_leaf = tt->rn_b;  in rn_addroute()
618 	} while (b <= t->rn_b && x != top);  in rn_addroute()
699 	b = -1 - tt->rn_b;  in rn_delete()
701 	if (b > t->rn_b)  in rn_delete()
706 	} while (b <= t->rn_b && x != top);  in rn_delete()
760 		if (x->rn_b >= 0) {  in rn_delete()
817 	while (rn->rn_b >= 0)  in rn_walktree()
825 		for (rn = rn->rn_p->rn_r; rn->rn_b >= 0;)  in rn_walktree()
857 	tt->rn_b = -1 - off;  in rn_inithead()