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()
648 		if (nodep->mask == 0) {  in node_reduce()
655 				nodep->mask = ~0;  in node_reduce()
658 				nodep->mask = (1u << nodep->num_after) - 1;  in node_reduce()
675 			if (prev->mask == 0 && prev->num_after == 0) {  in node_reduce()
686 			if (nodep->mask + 1 == 0 &&  in node_reduce()
689 				nodep->mask = 0;  in node_reduce()
703 			    (nodep->mask | (nodep->mask >> 1)) == nodep->mask) {  in node_reduce()
712 					= __builtin_popcount(nodep->mask);  in node_reduce()
714 				       ((1ULL << num_contiguous) - 1) == nodep->mask);  in node_reduce()
717 				nodep->mask = 0;  in node_reduce()
749 			if (next->mask == 0 && next->num_after == 0) {  in node_reduce()
760 			    next->mask == ~(mask_t) 0) {  in node_reduce()
762 				next->mask = 0;  in node_reduce()
799 	return !!(nodep->mask & (1 << (idx - nodep->idx)));  in sparsebit_is_set()
822 	assert(!(nodep->mask & (1 << (idx - nodep->idx))));  in bit_set()
823 	nodep->mask |= 1 << (idx - nodep->idx);  in bit_set()
857 	assert(nodep->mask & (1 << (idx - nodep->idx)));  in bit_clear()
858 	nodep->mask &= ~(1 << (idx - nodep->idx));  in bit_clear()
890 		indent, "", nodep->idx, nodep->mask, nodep->num_after);  in dump_nodes()
904 	int n1 = __builtin_ctz(nodep->mask & -leading);  in node_first_set()
912 	int n1 = __builtin_ctz(~nodep->mask & -leading);  in node_first_clear()
1065 	assert(s->root->mask != 0);  in sparsebit_any_set()
1068 		s->root->mask == ~(mask_t) 0));  in sparsebit_any_set()
1114 	if (nodep1->mask != ~(mask_t) 0)  in sparsebit_first_clear()
1128 		assert(nodep1->mask == ~(mask_t) 0);  in sparsebit_first_clear()
1196 	assert(candidate->mask != 0);  in sparsebit_next_set()
1220 	if (start < MASK_BITS && candidate->mask >= (1 << start))  in sparsebit_next_set()
1269 		if (!(nodep1->mask & (1 << idx)))  in sparsebit_next_clear()
1431 			if (!(nodep->mask & (1 << n1))) {  in sparsebit_set_num()
1432 				nodep->mask |= 1 << n1;  in sparsebit_set_num()
1494 			if (nodep->mask & (1 << n1)) {  in sparsebit_clear_num()
1495 				nodep->mask &= ~(1 << n1);  in sparsebit_clear_num()
1607 			if (nodep->mask & (1 << n1)) {  in sparsebit_dump()
1611 					if (nodep->mask & (1 << n1))  in sparsebit_dump()
1650 		if (!(nodep->mask & (1 << (MASK_BITS - 1))) && nodep->num_after) {  in sparsebit_dump()
1701 			if (nodep->mask & (1 << n1))  in sparsebit_validate_internal()
1713 		if (nodep->mask == 0) {  in sparsebit_validate_internal()
1716 				nodep, nodep->mask);  in sparsebit_validate_internal()
1843 			if (nodep->mask == ~(mask_t) 0 &&  in sparsebit_validate_internal()