lowest_possible  1158 tools/testing/selftests/kvm/lib/sparsebit.c 	sparsebit_idx_t lowest_possible = prev + 1;
lowest_possible  1163 tools/testing/selftests/kvm/lib/sparsebit.c 	if (lowest_possible == 0)
lowest_possible  1182 tools/testing/selftests/kvm/lib/sparsebit.c 			>= lowest_possible) {
lowest_possible  1184 tools/testing/selftests/kvm/lib/sparsebit.c 			if (candidate->idx <= lowest_possible) {
lowest_possible  1205 tools/testing/selftests/kvm/lib/sparsebit.c 		assert(candidate->idx > lowest_possible);
lowest_possible  1218 tools/testing/selftests/kvm/lib/sparsebit.c 	start = lowest_possible - candidate->idx;
lowest_possible  1226 tools/testing/selftests/kvm/lib/sparsebit.c 		return lowest_possible < first_num_after_idx
lowest_possible  1227 tools/testing/selftests/kvm/lib/sparsebit.c 			? first_num_after_idx : lowest_possible;
lowest_possible  1251 tools/testing/selftests/kvm/lib/sparsebit.c 	sparsebit_idx_t lowest_possible = prev + 1;
lowest_possible  1256 tools/testing/selftests/kvm/lib/sparsebit.c 	if (lowest_possible == 0)
lowest_possible  1263 tools/testing/selftests/kvm/lib/sparsebit.c 	nodep1 = node_find(s, lowest_possible);
lowest_possible  1265 tools/testing/selftests/kvm/lib/sparsebit.c 		return lowest_possible;
lowest_possible  1268 tools/testing/selftests/kvm/lib/sparsebit.c 	for (idx = lowest_possible - nodep1->idx; idx < MASK_BITS; idx++)