Searched refs:num_set (Results 1 - 5 of 5) sorted by relevance

/linux-master/tools/testing/selftests/kvm/lib/
H A Dsparsebit.c112 * the struct sparsebit_pvt num_set member.
148 * value in the struct sparsebit_pvt num_set member is updated. Other
191 sparsebit_num_t num_set; member in struct:sparsebit
403 return s->root && s->num_set == 0;
412 sparsebit_num_t num_set; local
414 num_set = node_num_set(nodep);
415 assert(s->num_set >= num_set || sparsebit_all_set(s));
416 s->num_set -= node_num_set(nodep);
823 s->num_set
[all...]
/linux-master/tools/testing/selftests/bpf/
H A Dtesting_helpers.c14 int parse_num_list(const char *s, bool **num_set, int *num_set_len) argument
69 *num_set = set;
H A Dtest_progs.c175 if (!sel->whitelist.cnt && !sel->num_set)
178 return num < sel->num_set_len && sel->num_set[num];
215 if (!sel->whitelist.cnt && !subtest_sel->num_set)
218 return subtest_num < subtest_sel->num_set_len && subtest_sel->num_set[subtest_num];
775 free(test_selector->num_set);
792 &env->subtest_selector.num_set,
799 if (parse_num_list(arg, &env->test_selector.num_set,
H A Dtest_progs.h66 bool *num_set; member in struct:test_selector
/linux-master/drivers/gpio/
H A Dgpiolib-cdev.c1444 unsigned int i, didx, num_set; local
1455 * Calculation of num_set and construction of the descs and vals arrays
1457 * allocation for the desc array for the common num_set == 1 case.
1461 for (num_set = 0, i = 0; i < lr->num_lines; i++) {
1468 __set_bit(num_set, vals);
1469 num_set++;
1470 /* capture desc for the num_set == 1 case */
1474 if (num_set == 0)
1477 if (num_set != 1) {
1479 descs = kmalloc_array(num_set, sizeo
[all...]

Completed in 217 milliseconds