1171 	struct node *candidate = NULL;  in sparsebit_next_set()  local
1184 			candidate = nodep;  in sparsebit_next_set()
1185 			if (candidate->idx <= lowest_possible) {  in sparsebit_next_set()
1194 	if (!candidate)  in sparsebit_next_set()
1197 	assert(candidate->mask != 0);  in sparsebit_next_set()
1206 		assert(candidate->idx > lowest_possible);  in sparsebit_next_set()
1208 		return node_first_set(candidate, 0);  in sparsebit_next_set()
1219 	start = lowest_possible - candidate->idx;  in sparsebit_next_set()
1221 	if (start < MASK_BITS && candidate->mask >= (1 << start))  in sparsebit_next_set()
1222 		return node_first_set(candidate, start);  in sparsebit_next_set()
1224 	if (candidate->num_after) {  in sparsebit_next_set()
1225 		sparsebit_idx_t first_num_after_idx = candidate->idx + MASK_BITS;  in sparsebit_next_set()
1239 	candidate = node_next(s, candidate);  in sparsebit_next_set()
1240 	if (!candidate)  in sparsebit_next_set()
1243 	return node_first_set(candidate, 0);  in sparsebit_next_set()