| /freebsd-14.2/crypto/openssl/test/ |
| H A D | sparse_array_test.c | 34 } cases[] = { in test_sparse_array() local 50 if (!TEST_true(ossl_sa_char_set(sa, cases[i].n, cases[i].v))) { in test_sparse_array() 55 if (!TEST_str_eq(ossl_sa_char_get(sa, cases[j].n), cases[j].v)) { in test_sparse_array() 73 } cases[] = { in test_sparse_array_num() local 88 if (!TEST_true(ossl_sa_char_set(sa, cases[i].n, cases[i].v)) in test_sparse_array_num() 114 const struct index_cases_st *cases = doall_data->cases; in leaf_check_all() local 120 && n == cases[i].n && strcmp(value, cases[i].v) == 0) { in leaf_check_all() 130 const struct index_cases_st *cases = doall_data->cases; in leaf_delete() local 135 if (n == cases[i].n && strcmp(value, cases[i].v) == 0) { in leaf_delete() 158 doall_data.cases = cases; in test_sparse_array_doall() [all …]
|
| /freebsd-14.2/contrib/expat/tests/ |
| H A D | acc_tests.c | 60 struct AccountingTestCase cases[] = { in START_TEST() local 241 const size_t countCases = sizeof(cases) / sizeof(cases[0]); in START_TEST() 245 = strlen(cases[u].primaryText); in START_TEST() 247 = (cases[u].firstExternalText ? strlen(cases[u].firstExternalText) : 0) in START_TEST() 248 + (cases[u].secondExternalText ? strlen(cases[u].secondExternalText) in START_TEST() 250 + cases[u].expectedCountBytesIndirectExtra; in START_TEST() 254 if (cases[u].firstExternalText) { in START_TEST() 257 XML_SetUserData(parser, (void *)&cases[u]); in START_TEST() 399 struct TestCase cases[] = { in START_TEST() local 404 for (size_t i = 0; i < sizeof(cases) / sizeof(cases[0]); i++) { in START_TEST() [all …]
|
| H A D | ns_tests.c | 688 struct test_case cases[] = { in START_TEST() local 696 for (; i < sizeof(cases) / sizeof(cases[0]); i++) { in START_TEST() 697 set_subtest("%s", cases[i].doc); in START_TEST() 698 XML_Parser parser = XML_ParserCreateNS(NULL, cases[i].namesep); in START_TEST() 700 if (_XML_Parse_SINGLE_BYTES(parser, cases[i].doc, (int)strlen(cases[i].doc), in START_TEST() 702 != cases[i].expectedStatus) { in START_TEST()
|
| H A D | basic_tests.c | 328 struct TestCase cases[] = { in START_TEST() local 348 for (; i < sizeof(cases) / sizeof(*cases); i++) { in START_TEST() 349 const char *fromLim = cases[i].input + strlen(cases[i].input); in START_TEST() 1255 for (size_t i = 0; i < sizeof(cases) / sizeof(cases[0]); i++) { in START_TEST() 1315 struct TestCase cases[] = { in START_TEST() local 1326 for (size_t i = 0; i < sizeof(cases) / sizeof(cases[0]); i++) { in START_TEST() 1805 struct CaseData cases[] in START_TEST() local 1835 g_parser, cases[i].text, (int)strlen(cases[i].text), XML_TRUE); in START_TEST() 1869 struct CaseData cases[] = { in START_TEST() local 4902 for (; i < sizeof(cases) / sizeof(cases[0]); i++) { in START_TEST() [all …]
|
| /freebsd-14.2/contrib/kyua/integration/ |
| H A D | cmd_report_test.sh | 69 Test cases: 2 total, 1 skipped, 0 expected failures, 0 broken, 0 failed 81 Test cases: 2 total, 1 skipped, 0 expected failures, 0 broken, 0 failed 126 Test cases: 2 total, 1 skipped, 0 expected failures, 0 broken, 0 failed 155 Test cases: 1 total, 1 skipped, 0 expected failures, 0 broken, 0 failed 174 Test cases: 1 total, 0 skipped, 0 expected failures, 0 broken, 0 failed 184 Test cases: 1 total, 0 skipped, 0 expected failures, 0 broken, 0 failed 203 Test cases: 1 total, 1 skipped, 0 expected failures, 0 broken, 0 failed 207 kyua: W: No test cases matched by the filter 'first'. 208 kyua: W: No test cases matched by the filter 'simple_all_pass:second'. 275 Test cases: 2 total, 1 skipped, 0 expected failures, 0 broken, 0 failed [all …]
|
| /freebsd-14.2/crypto/heimdal/lib/wind/ |
| H A D | test-map.c | 53 static struct example cases[] = { variable 94 for (i = 0; i < sizeof(cases)/sizeof(cases[0]); ++i) in main() 95 failures += try(&cases[i]); in main()
|
| H A D | gen-punycode-examples.py | 79 cases.append([codes, m.group(1), desc]) 83 cases = [] variable 113 for x in cases: 128 "const size_t punycode_examples_size = %u;\n\n" % len(cases))
|
| /freebsd-14.2/usr.bin/rpcgen/ |
| H A D | rpc_parse.c | 290 case_list *cases; in def_union() local 300 tailp = &defp->def.un.cases; in def_union() 306 cases = XALLOC(case_list); in def_union() 307 cases->case_name = tok.str; in def_union() 313 cases->contflag = 1; in def_union() 315 *tailp = cases; in def_union() 316 tailp = &cases->next; in def_union() 317 cases = XALLOC(case_list); in def_union() 324 cases->case_decl = dec; in def_union() 326 *tailp = cases; in def_union() [all …]
|
| /freebsd-14.2/sys/kern/ |
| H A D | subr_coverage.c | 203 __sanitizer_cov_trace_switch(uint64_t val, uint64_t *cases) in __sanitizer_cov_trace_switch() argument 212 count = cases[0]; in __sanitizer_cov_trace_switch() 215 switch (cases[1]) { in __sanitizer_cov_trace_switch() 235 if (!trace_cmp(type, val, cases[i + 2], ret)) in __sanitizer_cov_trace_switch()
|
| /freebsd-14.2/cddl/usr.sbin/dtrace/tests/tools/ |
| H A D | gentest.sh | 5 Generate ATF test cases from a set of DTrace tests. 9 excludes: A shell script which defines test cases that are to be skipped,
|
| /freebsd-14.2/contrib/atf/ |
| H A D | NEWS | 42 * Added a new "require.diskspace" metadata property to test cases so that 66 make test cases fail fast when they run unprotected commands. However, 176 cases from breaking xsltproc later. 192 detect defined but unused test cases. 323 instead of just listing them as having 0 test cases. 345 turns out to be bad. First, use.fs=false prevents bogus test cases 392 * Added expected failures support to test cases and atf-run. These 479 specify which test cases require file system access. This is to 507 debugging of faulty test cases. 650 * Added the 'timeout' property to test cases, useful to set an [all …]
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/Mips/ |
| H A D | MSA.txt | 6 the implementation. In a small number of cases, this can cause different 19 same cases. andi.b should use fractionally less power than bclri.b in 24 constant since shf.w covers exactly the same cases. shf.w is used 48 It is not possible to emit splati.w since shf.w covers the same cases. 79 for both cases.
|
| /freebsd-14.2/sys/contrib/device-tree/Bindings/slimbus/ |
| H A D | bus.txt | 18 In some cases it may be necessary to describe non-probeable device 20 such cases, child nodes for those devices will be present as 28 Instance ID Is for the cases where multiple Devices of the
|
| H A D | slimbus.yaml | 39 In some cases it may be necessary to describe non-probeable device 40 details such as non-standard ways of powering up a device. In such cases, 54 - Instance ID, can be used for the cases where multiple devices of
|
| /freebsd-14.2/contrib/kyua/bootstrap/ |
| H A D | testsuite.at | 94 AT_SETUP([test program with zero test cases]) 99 re='plain_helpers:__test_cases_list__.*broken.*No test cases' 143 AT_SETUP([run two test cases, success]) 156 AT_SETUP([run two test cases, failure]) 169 AT_SETUP([run mixed test cases])
|
| /freebsd-14.2/contrib/arm-optimized-routines/math/test/testcases/directed/ |
| H A D | cosf.tst | 1 ; cosf.tst - Directed test cases for SP cosine 14 ; SDCOMP-26094: check cosf in the cases for which the range reducer
|
| H A D | sinf.tst | 1 ; sinf.tst - Directed test cases for SP sine 17 ; SDCOMP-26094: check sinf in the cases for which the range reducer
|
| /freebsd-14.2/sys/contrib/device-tree/Bindings/iommu/ |
| H A D | iommu.txt | 44 the specific IOMMU. Below are a few examples of typical use-cases: 51 In such cases the number of cells will usually be 1 as in the next case. 53 in order to enable translation for a given master. In such cases the single 54 address cell corresponds to the master device's ID. In some cases more than 62 Note that these are merely examples and real-world use-cases may use different 85 have a means to turn off translation. But it is invalid in such cases to
|
| /freebsd-14.2/contrib/kyua/ |
| H A D | NEWS.md | 18 * Fixed execution of test cases as an unprivileged user, at least under 21 test cases might have previously failed for mysterious reasons when 46 cases in parallel. This is a big deal because test cases are rarely 51 cases. With sequential execution, a full test suite run takes around 12 63 * Issue #2: Implemented support to execute test cases in parallel when 137 * Added support to print the details of all test cases (metadata and 143 metadata property, which can also be provided by ATF test cases as 160 where test cases could only do this from their body and cleanup 304 in `kyua-testers` 0.2 to isolate test cases into their own sessions 371 invoke test cases any more, which provides for better modularity, [all …]
|
| /freebsd-14.2/share/examples/tests/ |
| H A D | README | 25 To inspect the available sample test cases from an installed system: 29 To run the full suite of sample test cases:
|
| /freebsd-14.2/contrib/llvm-project/lld/docs/ELF/ |
| H A D | warn_backrefs.rst | 37 The ``warn-backrefs`` option provides information that helps identify cases 50 violations (albeit unable to catch all cases). There are two cases where GNU ld 81 There are two cases like a library sandwich where GNU ld will select a 92 redundant but benign. In some cases ``A.a`` and ``B`` should be surrounded by
|
| /freebsd-14.2/tools/test/netfibs/ |
| H A D | README | 2 This directory holds scripts and a support program for multiple test cases 3 exercising multi-IP FIBs. At this time only IPv6 test cases are provided. 16 intiator.sh runs two local test cases, one which shows a documented
|
| /freebsd-14.2/contrib/ntp/sntp/libevent/test/ |
| H A D | tinytest.c | 373 for (j=0; groups[i].cases[j].name; ++j) { 374 struct testcase_t *testcase = &groups[i].cases[j]; 526 for (j = 0; group->cases[j].name; ++j) { 527 struct testcase_t *testcase = &group->cases[j];
|
| /freebsd-14.2/contrib/libevent/test/ |
| H A D | tinytest.c | 373 for (j=0; groups[i].cases[j].name; ++j) { 374 struct testcase_t *testcase = &groups[i].cases[j]; 526 for (j = 0; group->cases[j].name; ++j) { 527 struct testcase_t *testcase = &group->cases[j];
|
| /freebsd-14.2/sys/contrib/device-tree/Bindings/interconnect/ |
| H A D | qcom,bcm-voter.yaml | 34 In most cases, it's necessary to wait in both the AMC and WAKE sets to 36 cases can ensure sufficient delay by other means, then this can be
|