| /src/sys/net/ |
| radix.h | 44 short rn_b; /* bit offset; -1-index(netmask) */ member in struct:radix_node
|
| radix.c | 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; local in function:rn_match
259 for (; t->rn_b >= 0; )
[all...] |
| /src/sbin/routed/ |
| radix.h | 51 short rn_b; /* bit offset; -1-index(netmask) */ member in struct:radix_node
|
| radix.c | 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; local in function:rn_match
220 for (; t->rn_b >= 0; )
[all...] |
