Home
last modified time | relevance | path

Searched refs:subtest_cnt (Results 1 – 4 of 4) sorted by relevance

/linux/tools/testing/selftests/bpf/prog_tests/
H A Darg_parsing.c17 for (j = 0; j < set->tests[i].subtest_cnt; j++) in free_test_filter_set()
38 ASSERT_EQ(set.tests[0].subtest_cnt, 0, "subtest filters count"); in test_parse_test_list()
48 ASSERT_EQ(set.tests[0].subtest_cnt, 0, "subtest filters count"); in test_parse_test_list()
49 ASSERT_EQ(set.tests[1].subtest_cnt, 0, "subtest filters count"); in test_parse_test_list()
62 if (!ASSERT_EQ(set.tests[0].subtest_cnt, 1, "subtest filters count")) in test_parse_test_list()
64 ASSERT_EQ(set.tests[1].subtest_cnt, 0, "subtest filters count"); in test_parse_test_list()
79 if (!ASSERT_EQ(set.tests[0].subtest_cnt, 1, "subtest filters count")) in test_parse_test_list()
81 ASSERT_EQ(set.tests[1].subtest_cnt, 0, "subtest filters count"); in test_parse_test_list()
82 ASSERT_EQ(set.tests[2].subtest_cnt, 0, "subtest filters count"); in test_parse_test_list()
95 if (!ASSERT_EQ(set.tests[0].subtest_cnt, 1, "subtest filters count")) in test_parse_test_list()
[all …]
/linux/tools/testing/selftests/bpf/
H A Dtesting_helpers.c102 test->subtest_cnt = 0; in do_insert_test()
110 for (i = 0; i < test->subtest_cnt; i++) { in do_insert_test()
118 sizeof(*test->subtests) * (test->subtest_cnt + 1)); in do_insert_test()
123 test->subtests[test->subtest_cnt] = subtest_str; in do_insert_test()
125 test->subtest_cnt++; in do_insert_test()
H A Dtest_progs.c185 !sel->blacklist.tests[i].subtest_cnt) in should_run()
208 if (!filter->tests[i].subtest_cnt) in match_subtest()
211 for (j = 0; j < filter->tests[i].subtest_cnt; j++) { in match_subtest()
246 !sel->whitelist.tests[i].subtest_cnt) in should_tmon()
889 for (j = 0; j < set->tests[i].subtest_cnt; j++) in free_test_filter_set()
H A Dtest_progs.h55 int subtest_cnt; member