Lines Matching refs:mask
174 mask_t mask; member
199 return nodep->num_after + __builtin_popcount(nodep->mask); in node_num_set()
288 root->mask = subtree->mask; in node_copy_subtree()
387 assert(!(nodep->mask & (1 << n1))); in node_add()
388 nodep->mask |= (1 << n1); in node_add()
543 nodep2->mask = ~(mask_t) 0; in node_split()
546 nodep2->mask = (1 << nodep2->num_after) - 1; in node_split()
610 if (nodep->mask == 0 && nodep->num_after == 0) { in node_reduce()
647 if (nodep->mask == 0) { in node_reduce()
654 nodep->mask = ~0; in node_reduce()
657 nodep->mask = (1u << nodep->num_after) - 1; in node_reduce()
674 if (prev->mask == 0 && prev->num_after == 0) { in node_reduce()
685 if (nodep->mask + 1 == 0 && in node_reduce()
688 nodep->mask = 0; in node_reduce()
702 (nodep->mask | (nodep->mask >> 1)) == nodep->mask) { in node_reduce()
711 = __builtin_popcount(nodep->mask); in node_reduce()
713 ((1ULL << num_contiguous) - 1) == nodep->mask); in node_reduce()
716 nodep->mask = 0; in node_reduce()
748 if (next->mask == 0 && next->num_after == 0) { in node_reduce()
759 next->mask == ~(mask_t) 0) { in node_reduce()
761 next->mask = 0; in node_reduce()
798 return !!(nodep->mask & (1 << (idx - nodep->idx))); in sparsebit_is_set()
821 assert(!(nodep->mask & (1 << (idx - nodep->idx)))); in bit_set()
822 nodep->mask |= 1 << (idx - nodep->idx); in bit_set()
856 assert(nodep->mask & (1 << (idx - nodep->idx))); in bit_clear()
857 nodep->mask &= ~(1 << (idx - nodep->idx)); in bit_clear()
889 indent, "", nodep->idx, nodep->mask, nodep->num_after); in dump_nodes()
903 int n1 = __builtin_ctz(nodep->mask & -leading); in node_first_set()
911 int n1 = __builtin_ctz(~nodep->mask & -leading); in node_first_clear()
1064 assert(s->root->mask != 0); in sparsebit_any_set()
1067 s->root->mask == ~(mask_t) 0)); in sparsebit_any_set()
1113 if (nodep1->mask != ~(mask_t) 0) in sparsebit_first_clear()
1127 assert(nodep1->mask == ~(mask_t) 0); in sparsebit_first_clear()
1195 assert(candidate->mask != 0); in sparsebit_next_set()
1219 if (start < MASK_BITS && candidate->mask >= (1 << start)) in sparsebit_next_set()
1268 if (!(nodep1->mask & (1 << idx))) in sparsebit_next_clear()
1430 if (!(nodep->mask & (1 << n1))) { in sparsebit_set_num()
1431 nodep->mask |= 1 << n1; in sparsebit_set_num()
1493 if (nodep->mask & (1 << n1)) { in sparsebit_clear_num()
1494 nodep->mask &= ~(1 << n1); in sparsebit_clear_num()
1606 if (nodep->mask & (1 << n1)) { in sparsebit_dump()
1610 if (nodep->mask & (1 << n1)) in sparsebit_dump()
1649 if (!(nodep->mask & (1 << (MASK_BITS - 1))) && nodep->num_after) { in sparsebit_dump()
1700 if (nodep->mask & (1 << n1)) in sparsebit_validate_internal()
1712 if (nodep->mask == 0) { in sparsebit_validate_internal()
1715 nodep, nodep->mask); in sparsebit_validate_internal()
1842 if (nodep->mask == ~(mask_t) 0 && in sparsebit_validate_internal()