Lines Matching defs:bit
89 * assume 8 bit keys for all examples
125 int bit;
131 /* pos is past the last bit covered at this node */
140 /* find the mismatch bit */
141 bit = EXTRACTBIT(nodep->val, pos, key_len);
142 if (bit == ZERO) {
153 /* pos is before the last bit covered at this node */
154 nodep->zero->pos = pos - 1; /* link is one bit */
169 } else { /* bit == ONE */
180 /* pos is before the last bit covered at this node */
181 nodep->one->pos = pos - 1; /* link is one bit */
219 int bit;
234 /* check if bit is significant */
235 /* bit in key is significant if it is covered by the mask */
248 /* extra bit at current position */
249 bit = EXTRACTBIT(key, (pos - 1), key_len);
255 if (bit != EXTRACTBIT(c_node->val, (pos - 1),
279 if (bit == ZERO) {
285 /* bit at pos for node value should be 0 */
293 } else { /* ONE bit */
299 /* bit at pos for node value should be 1 */
333 int bit, i;
354 /* check if bit is significant */
359 bit = EXTRACTBIT(key.s6_addr32[i], (pos - 1), type_len);
360 if (bit == ZERO) {
365 } else { /* ONE bit */
404 int bit;
491 /* extract next bit and test */
492 bit = EXTRACTBIT(key, (pos - 1), (uint8_t)(*tid)->key_len);
493 if (bit == ZERO) {
498 } else { /* ONE bit */
630 int bit, i;
651 /* check if bit is significant */
656 bit = EXTRACTBIT(key.s6_addr32[i], (pos - 1), type_len);
657 if (bit == ZERO) {
662 } else { /* ONE bit */
704 int bit;
729 /* pos is set to next bit not covered by node */
746 bit = EXTRACTBIT(key, (pos - 1), (uint8_t)tid->key_len);
747 if (bit == ZERO) { /* choose leaf */
750 } else { /* bit == ONE */
781 int bit, i;
806 /* extract bit at pos */
807 bit =
809 if (bit == ZERO) { /* choose leaf */