80  * branching removed.  The index rn_b at an internal node n represents a bit
82  * of a node n have keys whose bits all agree up to position rn_b - 1.
83  * (We say the index of n is rn_b.)
85  * There is at least one descendant which has a one bit at position rn_b,
95  * If a node n has a descendant (k, m) with index(m) == index(n) == rn_b,
97  * If the index(m) < rn_b, this implies the trailing last few bits of k
118 	for (x = head, v = v_arg; x->rn_b >= 0; ) {  in rn_search()
133 	for (x = head; x->rn_b >= 0; ) {  in rn_search_m()
224 	int test, b, rn_b;  in rn_match()  local
232 	for (; t->rn_b >= 0; ) {  in rn_match()
274 	rn_b = -1 - b;  in rn_match()
287 			if (rn_b <= t->rn_b)  in rn_match()
307 					if (rn_b <= m->rm_b)  in rn_match()
337 	t->rn_b = b;  in rn_newpair()
341 	tt->rn_b = -1;  in rn_newpair()
399 		} while (b > (unsigned)x->rn_b);  in rn_insert()
498 	x->rn_b = -1 - b;  in rn_addmask()
530 	m->rm_b = tt->rn_b;  in rn_new_radix_mask()
565 		b_leaf = x->rn_b;  in rn_addroute()
566 		b = -1 - x->rn_b;  in rn_addroute()
582 				((b_leaf < tt->rn_b) ||  in rn_addroute()
622 		tt->rn_b = -1;  in rn_addroute()
630 		tt->rn_b = x->rn_b;  in rn_addroute()
636 	b_leaf = -1 - t->rn_b;  in rn_addroute()
642 	if (x->rn_b < 0) {  in rn_addroute()
644 			if (x->rn_mask != NULL && (x->rn_b >= b_leaf) &&  in rn_addroute()
661 	if ((netmask == NULL) || (b > t->rn_b)) {  in rn_addroute()
664 	b_leaf = tt->rn_b;  in rn_addroute()
668 	} while (b <= t->rn_b && x != top);  in rn_addroute()
767 	b = -1 - tt->rn_b;  in rn_delete()
769 	if (b > t->rn_b)  in rn_delete()
774 	} while (b <= t->rn_b && x != top);  in rn_delete()
860 		if (x->rn_b >= 0) {  in rn_delete()
929 	while (rn->rn_b >= 0)  in rn_walktree()
937 		for (rn = rn->rn_p->rn_r; rn->rn_b >= 0; )  in rn_walktree()
967 	tt->rn_b = -1 - off;  in rn_inithead()