Lines Matching refs:rn_b
82 * branching removed. The index rn_b at an internal node n represents a bit
84 * of a node n have keys whose bits all agree up to position rn_b - 1.
85 * (We say the index of n is rn_b.)
87 * There is at least one descendant which has a one bit at position rn_b,
97 * If a node n has a descendant (k, m) with index(m) == index(n) == rn_b,
99 * If the index(m) < rn_b, this implies the trailing last few bits of k
120 for (x = head, v = v_arg; x->rn_b >= 0; ) {
135 for (x = head; x->rn_b >= 0; ) {
226 int test, b, rn_b;
234 for (; t->rn_b >= 0; ) {
276 rn_b = -1 - b;
289 if (rn_b <= t->rn_b)
309 if (rn_b <= m->rm_b)
339 t->rn_b = b;
343 tt->rn_b = -1;
401 } while (b > (unsigned)x->rn_b);
500 x->rn_b = -1 - b;
532 m->rm_b = tt->rn_b;
567 b_leaf = x->rn_b;
568 b = -1 - x->rn_b;
584 ((b_leaf < tt->rn_b) ||
624 tt->rn_b = -1;
632 tt->rn_b = x->rn_b;
638 b_leaf = -1 - t->rn_b;
644 if (x->rn_b < 0) {
646 if (x->rn_mask != NULL && (x->rn_b >= b_leaf) &&
663 if ((netmask == NULL) || (b > t->rn_b)) {
666 b_leaf = tt->rn_b;
670 } while (b <= t->rn_b && x != top);
769 b = -1 - tt->rn_b;
771 if (b > t->rn_b)
776 } while (b <= t->rn_b && x != top);
862 if (x->rn_b >= 0) {
931 while (rn->rn_b >= 0)
939 for (rn = rn->rn_p->rn_r; rn->rn_b >= 0; )
969 tt->rn_b = -1 - off;