| /src/crypto/external/apache2/openssl/dist/test/ |
| sparse_array_test.c | 34 } cases[] = { local
49 for (i = 0; i < OSSL_NELEM(cases); i++) {
50 if (!TEST_true(ossl_sa_char_set(sa, cases[i].n, cases[i].v))) {
55 if (!TEST_str_eq(ossl_sa_char_get(sa, cases[j].n), cases[j].v)) {
73 } cases[] = { local
87 for (i = 0; i < OSSL_NELEM(cases); i++)
88 if (!TEST_true(ossl_sa_char_set(sa, cases[i].n, cases[i].v)
106 const struct index_cases_st *cases; member in struct:doall_st
114 const struct index_cases_st *cases = doall_data->cases; local
130 const struct index_cases_st *cases = doall_data->cases; local
145 static const struct index_cases_st cases[] = { local
[all...] |
| packettest.c | 478 static const struct quic_test_case cases[] = { local
505 for (i = 0; i < OSSL_NELEM(cases); ++i) {
509 if (!TEST_true(PACKET_buf_init(&pkt, cases[i].buf, sizeof(cases[i].buf)))
511 || !TEST_uint64_t_eq(v, cases[i].value)
513 sizeof(cases[i].buf) - cases[i].expected_read_count))
528 static const struct quic_test_case cases[] = { local
529 /* success cases */
537 /* failure cases */
[all...] |
| /src/crypto/external/bsd/openssl/dist/test/ |
| sparse_array_test.c | 34 } cases[] = { local
49 for (i = 0; i < OSSL_NELEM(cases); i++) {
50 if (!TEST_true(ossl_sa_char_set(sa, cases[i].n, cases[i].v))) {
55 if (!TEST_str_eq(ossl_sa_char_get(sa, cases[j].n), cases[j].v)) {
73 } cases[] = { local
87 for (i = 0; i < OSSL_NELEM(cases); i++)
88 if (!TEST_true(ossl_sa_char_set(sa, cases[i].n, cases[i].v)
106 const struct index_cases_st *cases; member in struct:doall_st
114 const struct index_cases_st *cases = doall_data->cases; local
130 const struct index_cases_st *cases = doall_data->cases; local
145 static const struct index_cases_st cases[] = { local
[all...] |
| /src/external/apache2/llvm/dist/clang/tools/scan-build-py/tests/ |
| __init__.py | 9 import tests.functional.cases
16 suite.addTests(loader.loadTestsFromModule(tests.functional.cases))
|
| /src/tests/lib/libm/ |
| t_errhandling.c | 55 } cases[] = { local
67 for (i = 0; i < __arraycount(cases); i++) {
68 const volatile double x = cases[i].x;
78 cases[i].e) != 0,
79 "expected=0x%x actual=0x%x", cases[i].e, except);
|
| t_modf.c | 58 } cases[] = { variable in typeref:struct:__anon7905
212 for (n = 0; n < __arraycount(cases); n++) {
215 x = cases[n].x;
217 ATF_CHECK_EQ_MSG(i, cases[n].i,
218 "cases[%u]: modf %g=%a"
222 cases[n].i, cases[n].i, cases[n].f, cases[n].f);
223 ATF_CHECK_EQ_MSG(f, cases[n].f
[all...] |
| /src/external/mit/expat/dist/tests/ |
| acc_tests.c | 60 struct AccountingTestCase cases[] = { local
241 const size_t countCases = sizeof(cases) / sizeof(cases[0]);
245 = strlen(cases[u].primaryText);
247 = (cases[u].firstExternalText ? strlen(cases[u].firstExternalText) : 0)
248 + (cases[u].secondExternalText ? strlen(cases[u].secondExternalText)
250 + cases[u].expectedCountBytesIndirectExtra;
254 if (cases[u].firstExternalText)
399 struct TestCase cases[] = { local
[all...] |
| ns_tests.c | 688 struct test_case cases[] = { local
696 for (; i < sizeof(cases) / sizeof(cases[0]); i++) {
697 set_subtest("%s", cases[i].doc);
698 XML_Parser parser = XML_ParserCreateNS(NULL, cases[i].namesep);
700 if (_XML_Parse_SINGLE_BYTES(parser, cases[i].doc, (int)strlen(cases[i].doc),
702 != cases[i].expectedStatus) {
|
| /src/crypto/external/bsd/heimdal/dist/lib/wind/ |
| test-map.c | 55 static struct example cases[] = { variable in typeref:struct:example
96 for (i = 0; i < sizeof(cases)/sizeof(cases[0]); ++i)
97 failures += try(&cases[i]);
|
| gen-punycode-examples.py | 78 cases.append([codes, m.group(1), desc])
82 cases = [] variable
112 for x in cases:
127 "const size_t punycode_examples_size = %u;\n\n" % len(cases))
|
| /src/lib/libm/noieee_src/ |
| n_fmod.c | 148 int i,cases; local
155 for (cases = 0; cases < NCASES; cases++) {
156 switch (cases) {
|
| /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/core/internal/ |
| switch_.d | 23 // This closes recursion for other cases.
70 static immutable T[][caseLabels.length] cases = asImmutable([caseLabels]);
73 return __switchSearch!T(cases[], condition);
77 // binary search in sorted string cases, also see `__switch`.
78 private int __switchSearch(T)(/*in*/ const scope T[][] cases, /*in*/ const scope T[] condition) pure nothrow @safe @nogc
81 size_t high = cases.length;
87 if (condition.length == cases[mid].length)
89 r = __cmp(condition, cases[mid]);
95 r = ((condition.length > cases[mid].length) << 1) - 1;
|
| /src/usr.bin/make/unit-tests/ |
| varname-dot-parsedir.exp | 2 make: <normalized>:43: The location can be faked in some cases.
|
| varname-dot-parsefile.exp | 2 make: <normalized>:38: The location can be faked in some cases.
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/ |
| system.d | 20 This is for cases where you need a value representing the OS at
67 This is intended for cases where you need to deal with endianness at
|
| /src/sys/crypto/aes/arch/x86/ |
| aes_ssse3_subr.c | 139 } cases[] = { local
151 for (i = 0; i < sizeof(cases)/sizeof(cases[0]); i++) {
152 t[0] = cases[i].in[0];
153 t[1] = cases[i].in[1];
154 t[2] = cases[i].in[2];
155 t[3] = cases[i].in[3];
157 if (t[0] != cases[i].out[0] ||
158 t[1] != cases[i].out[1] ||
159 t[2] != cases[i].out[2] |
[all...] |
| aes_ni.c | 254 } cases[] = { local
269 for (i = 0; i < sizeof(cases)/sizeof(cases[0]); i++) {
270 aesni_xts_update(cases[i].in, tweak);
271 if (memcmp(tweak, cases[i].out, 16))
|
| /src/external/bsd/atf/dist/tools/ |
| atf-report_test.sh | 98 atf_check -s eq:0 -o match:'test cases' -o match:'Failed test cases' \
146 expect_helpers (1/1): 17 test cases
166 Test cases for known bugs:
177 Failed test cases:
181 1 passed test cases.
182 7 failed test cases.
183 9 expected failed test cases.
184 0 skipped test cases.
231 atf_check -s eq:0 -o ignore -e empty grep "test cases" fmt2.ou
[all...] |
| /src/external/bsd/libevent/dist/test/ |
| tinytest.h | 69 struct testcase_t *cases; /** Array, ending with END_OF_TESTCASES */ member in struct:testgroup_t
|
| /src/external/bsd/ntp/dist/sntp/libevent/test/ |
| tinytest.h | 70 struct testcase_t *cases; /** Array, ending with END_OF_TESTCASES */ member in struct:testgroup_t
|
| /src/external/bsd/kyua-cli/dist/integration/ |
| cmd_report_test.sh | 78 Test cases: 2 total, 1 skipped, 0 expected failures, 0 broken, 0 failed
90 Test cases: 2 total, 1 skipped, 0 expected failures, 0 broken, 0 failed
154 Test cases: 2 total, 1 skipped, 0 expected failures, 0 broken, 0 failed
171 Test cases: 2 total, 1 skipped, 0 expected failures, 0 broken, 0 failed
202 Test cases: 2 total, 1 skipped, 0 expected failures, 0 broken, 0 failed
220 Test cases: 2 total, 1 skipped, 0 expected failures, 0 broken, 0 failed
241 Test cases: 2 total, 1 skipped, 0 expected failures, 0 broken, 0 failed
260 Test cases: 2 total, 1 skipped, 0 expected failures, 0 broken, 0 failed
|
| /src/external/bsd/openldap/dist/libraries/liblunicode/ucdata/ |
| bidiapi.txt | 35 and is used only in cases where a string contains no characters with strong
|
| ucgendat.c | 186 static ac_uint4 cases[3]; variable
388 * Optimize the cases of extending the last range and adding new ranges to
542 cases[2] = code;
548 if (cases[0] == 0)
549 cases[0] = code;
574 title[i].key = cases[2]; /* Title */
575 title[i].other1 = cases[0]; /* Upper */
576 title[i].other2 = cases[1]; /* Lower */
589 cases[0] = code;
595 if (cases[2] == 0
[all...] |
| /src/usr.bin/rpcgen/ |
| rpc_parse.c | 297 case_list *cases; local
307 tailp = &defp->def.un.cases;
313 cases = ALLOC(case_list);
314 cases->case_name = tok.str;
321 cases->contflag = 1; /* continued case
323 *tailp = cases;
324 tailp = &cases->next;
325 cases = ALLOC(case_list);
326 cases->case_name = tok.str;
332 cases->case_decl = dec
[all...] |
| /src/sys/crypto/aes/arch/arm/ |
| aes_armv8.c | 256 } cases[] = { local
271 for (i = 0; i < sizeof(cases)/sizeof(cases[0]); i++) {
272 aesarmv8_xts_update(cases[i].in, tweak);
273 if (memcmp(tweak, cases[i].out, 16))
|
