1159 	sparsebit_idx_t lowest_possible = prev + 1;  in sparsebit_next_set()  local
1164 	if (lowest_possible == 0)  in sparsebit_next_set()
1183 			>= lowest_possible) {  in sparsebit_next_set()
1185 			if (candidate->idx <= lowest_possible) {  in sparsebit_next_set()
1206 		assert(candidate->idx > lowest_possible);  in sparsebit_next_set()
1219 	start = lowest_possible - candidate->idx;  in sparsebit_next_set()
1227 		return lowest_possible < first_num_after_idx  in sparsebit_next_set()
1228 			? first_num_after_idx : lowest_possible;  in sparsebit_next_set()
1252 	sparsebit_idx_t lowest_possible = prev + 1;  in sparsebit_next_clear()  local
1257 	if (lowest_possible == 0)  in sparsebit_next_clear()
1264 	nodep1 = node_find(s, lowest_possible);  in sparsebit_next_clear()
1266 		return lowest_possible;  in sparsebit_next_clear()
1269 	for (idx = lowest_possible - nodep1->idx; idx < MASK_BITS; idx++)  in sparsebit_next_clear()