Home | History | Annotate | Download | only in net

Lines Matching defs:rn_b

93  * branching removed.  The index rn_b at an internal node n represents a bit
95  * of a node n have keys whose bits all agree up to position rn_b - 1.
96  * (We say the index of n is rn_b.)
98  * There is at least one descendant which has a one bit at position rn_b,
108  * If a node n has a descendant (k, m) with index(m) == index(n) == rn_b,
110  * If the index(m) < rn_b, this implies the trailing last few bits of k
133 	for (x = head; x->rn_b >= 0;) {
152 	for (x = head; x->rn_b >= 0;) {
253 	int test, b, rn_b;
259 	for (; t->rn_b >= 0; ) {
295 	rn_b = -1 - b;
308 			if (rn_b <= t->rn_b)
327 					if (rn_b <= m->rm_b)
403 	t->rn_b = b; t->rn_bmask = 0x80 >> (b & 7);
405 	tt->rn_b = -1; tt->rn_key = v; tt->rn_p = t;
452 	} while (b > (unsigned) x->rn_b); /* x->rn_b < b && x->rn_b >= 0 */
547 	x->rn_b = -1 - b;
584 	m->rm_b = tt->rn_b;
620 		b_leaf = x->rn_b;
621 		b = -1 - x->rn_b;
634 			     (b_leaf < tt->rn_b || /* index(netmask) > node */
673 		tt->rn_b = -1;
681 		tt->rn_b = x->rn_b;
687 	b_leaf = -1 - t->rn_b;
693 	if (x->rn_b < 0) {
695 			if (x->rn_mask != NULL && x->rn_b >= b_leaf &&
714 	if (netmask == NULL || b > t->rn_b)
716 	b_leaf = tt->rn_b;
720 	} while (b <= t->rn_b && x != top);
803 	b = -1 - tt->rn_b;
805 	if (b > t->rn_b)
810 	} while (b <= t->rn_b && x != top);
887 	else if (x->rn_b >= 0) {
958 	for (rn = rn->rn_p->rn_r; rn->rn_b >= 0;) {
970 	while (rn->rn_b >= 0) {
1093 	tt->rn_b = -1 - off;