Home | History | Annotate | Download | only in routed

Lines Matching defs:rn_b

73  * branching removed.  The index rn_b at an internal node n represents a bit
75  * of a node n have keys whose bits all agree up to position rn_b - 1.
76  * (We say the index of n is rn_b.)
78  * There is at least one descendant which has a one bit at position rn_b,
88  * If a node n has a descendant (k, m) with index(m) == index(n) == rn_b,
90  * If the index(m) < rn_b, this implies the trailing last few bits of k
112 	for (x = head, v = v_arg; x->rn_b >= 0;) {
129 	for (x = head; x->rn_b >= 0;) {
214 	int test, b, rn_b;
220 	for (; t->rn_b >= 0; ) {
272 	rn_b = -1 - b;
285 			if (rn_b <= t->rn_b)
305 					if (rn_b <= m->rm_b)
332 	t->rn_b = b; t->rn_bmask = 0x80 >> (b & 7);
334 	tt->rn_b = -1; tt->rn_key = (caddr_t)v; tt->rn_p = t;
387 	} while ((unsigned)b > (unsigned)x->rn_b);
476 	x->rn_b = -1 - b;
508 	m->rm_b = tt->rn_b;
543 		b_leaf = x->rn_b;
544 		b = -1 - x->rn_b;
557 			     ((b_leaf < tt->rn_b) || /* index(netmask) > node */
589 		tt->rn_b = -1;
597 		tt->rn_b = x->rn_b;
603 	b_leaf = -1 - t->rn_b;
606 	if (x->rn_b < 0) {
608 		if (x->rn_mask && (x->rn_b >= b_leaf) && x->rn_mklist == 0) {
623 	if ((netmask == 0) || (b > t->rn_b ))
625 	b_leaf = tt->rn_b;
629 	} while (b <= t->rn_b && x != top);
710 	b = -1 - tt->rn_b;
712 	if (b > t->rn_b)
717 	} while (b <= t->rn_b && x != top);
771 		if (x->rn_b >= 0) {
828 	while (rn->rn_b >= 0)
836 		for (rn = rn->rn_p->rn_r; rn->rn_b >= 0;)
868 	tt->rn_b = -1 - off;