Searched full:rn_b (Results 1 – 3 of 3) sorted by relevance
80 * branching removed. The index rn_b at an internal node n represents a bit82 * 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 k118 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() local232 for (; t->rn_b >= 0; ) { in rn_match()[all …]
56 int16_t rn_b; /* bit offset; -1-index(netmask) */ member
62 short rn_b; /* bit offset; -1-index(netmask) */ member