Lines Matching refs:rn_bit
122 * branching removed. The index rn_bit at an internal node n represents a bit
124 * of a node n have keys whose bits all agree up to position rn_bit - 1.
125 * (We say the index of n is rn_bit.)
127 * There is at least one descendant which has a one bit at position rn_bit,
137 * If a node n has a descendant (k, m) with index(m) == index(n) == rn_bit,
139 * If the index(m) < rn_bit, this implies the trailing last few bits of k
160 for (x = head, v = v_arg; x->rn_bit >= 0;) {
175 for (x = head; x->rn_bit >= 0;) {
281 int test, b, rn_bit;
287 for (; t->rn_bit >= 0; ) {
341 rn_bit = -1 - b;
354 if ((rn_bit <= t->rn_bit) && RN_MATCHF(t, f, w))
374 if ((rn_bit <= m->rm_bit) &&
402 t->rn_bit = b;
406 tt->rn_bit = -1;
459 } while (b > (unsigned) x->rn_bit);
460 /* x->rn_bit < b && x->rn_bit >= 0 */
553 x->rn_bit = -1 - b;
584 m->rm_bit = tt->rn_bit;
617 b_leaf = x->rn_bit;
618 b = -1 - x->rn_bit;
631 ((b_leaf < tt->rn_bit) /* index(netmask) > node */
670 tt->rn_bit = -1;
679 tt->rn_bit = x->rn_bit;
685 b_leaf = -1 - t->rn_bit;
691 if (x->rn_bit < 0) {
693 if (x->rn_mask && (x->rn_bit >= b_leaf) && x->rn_mklist == 0) {
709 if ((netmask == 0) || (b > t->rn_bit ))
711 b_leaf = tt->rn_bit;
715 } while (b <= t->rn_bit && x != top);
795 b = -1 - tt->rn_bit;
797 if (b > t->rn_bit)
802 } while (b <= t->rn_bit && x != top);
885 if (x->rn_bit >= 0) {
969 for (rn = h->rnh_treetop; rn->rn_bit >= 0; ) {
987 lastb = rn->rn_bit;
990 while (rn->rn_bit >= 0)
1001 if (rn->rn_bit <= lastb) {
1042 for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)
1086 while (rn->rn_bit >= 0)
1095 for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)
1133 tt->rn_bit = -1 - off;