Searched refs:cases (Results 1 - 25 of 86) sorted by relevance

1234

/src/tests/lib/libm/
H A Dt_errhandling.c55 } cases[] = { local in function:ATF_TC_BODY
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);
H A Dt_modf.c58 } cases[] = { variable in typeref:typename:const struct __anon94f73b780208[]
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[
[all...]
/src/lib/libm/noieee_src/
H A Dn_fmod.c148 int i,cases; local in function:main
155 for (cases = 0; cases < NCASES; cases++) {
156 switch (cases) {
/src/usr.bin/make/unit-tests/
H A Dvarname-dot-parsedir.exp2 make: <normalized>:43: The location can be faked in some cases.
H A Dvarname-dot-parsefile.exp2 make: <normalized>:38: The location can be faked in some cases.
H A Ddepsrc-exec.mk7 # TODO: Describe possible use cases for .EXEC.
H A Ddepsrc-optional.mk6 # TODO: Describe practical use cases for this feature.
H A Ddirective-for-empty.mk7 # replacement is a bit naive but covers most of the practical cases. The one
51 # loop would be naive and require many special cases, as there are many cases
56 # edge cases, see directive-for-escape.mk. Adding another such tricky detail
H A Drecursive.mk34 # therefore that's acceptable. In most practical cases, the missing
H A Dvarname-dot-parsedir.mk43 .info The location can be faked in some cases.
H A Dvarname-dot-parsefile.mk38 .info The location can be faked in some cases.
H A Ddeptgt-end-fail.mk62 # Until 2020-12-07, several of the test cases printed "`all' not remade
/src/sys/crypto/aes/arch/x86/
H A Daes_ssse3_subr.c139 } cases[] = { local in function:aes_ssse3_xts_update_selftest
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[
[all...]
H A Daes_ni.c254 } cases[] = { local in function:aesni_xts_update_selftest
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))
H A Daes_via.c467 } cases[] = { local in function:aesvia_xts_update_selftest
478 for (i = 0; i < sizeof(cases)/sizeof(cases[0]); i++) {
479 t0 = cases[i].in[0];
480 t1 = cases[i].in[1];
481 t2 = cases[i].in[2];
482 t3 = cases[i].in[3];
484 if (t0 != cases[i].out[0] ||
485 t1 != cases[i].out[1] ||
486 t2 != cases[
[all...]
H A Daes_sse2_4x32_subr.c342 } cases[] = { local in function:aes_sse2_4x32_xts_update_selftest
354 for (i = 0; i < sizeof(cases)/sizeof(cases[0]); i++) {
355 t[0] = cases[i].in[0];
356 t[1] = cases[i].in[1];
357 t[2] = cases[i].in[2];
358 t[3] = cases[i].in[3];
360 if (t[0] != cases[i].out[0] ||
361 t[1] != cases[i].out[1] ||
362 t[2] != cases[
[all...]
/src/usr.bin/rpcgen/
H A Drpc_parse.c297 case_list *cases; local in function:def_union
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
[all...]
H A Drpc_parse.h108 case_list *cases; member in struct:union_def
/src/sys/crypto/aes/arch/arm/
H A Daes_armv8.c256 } cases[] = { local in function:aesarmv8_xts_update_selftest
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))
H A Daes_neon_subr.c165 } cases[] = { local in function:aes_neon_xts_update_selftest
183 for (i = 0; i < sizeof(cases)/sizeof(cases[0]); i++) {
184 storeblock(t, aes_neon_xts_update(loadblock(cases[i].in)));
185 if (memcmp(t, cases[i].out, 16)) {
/src/common/lib/libc/arch/sh3/string/
H A Dffs.S53 bt Lzero ! testing here to accelerate ret=1..8 cases
/src/sys/crypto/aes/
H A Daes_bear.c364 } cases[] = { local in function:aesbear_xts_update_selftest
375 for (i = 0; i < sizeof(cases)/sizeof(cases[0]); i++) {
376 t0 = cases[i].in[0];
377 t1 = cases[i].in[1];
378 t2 = cases[i].in[2];
379 t3 = cases[i].in[3];
381 if (t0 != cases[i].out[0] ||
382 t1 != cases[i].out[1] ||
383 t2 != cases[
[all...]
H A Daes_bear64.c413 } cases[] = { local in function:aesbear64_xts_update_selftest
424 for (i = 0; i < sizeof(cases)/sizeof(cases[0]); i++) {
425 t0 = cases[i].in[0];
426 t1 = cases[i].in[1];
427 t2 = cases[i].in[2];
428 t3 = cases[i].in[3];
430 if (t0 != cases[i].out[0] ||
431 t1 != cases[i].out[1] ||
432 t2 != cases[
[all...]
/src/sys/kern/
H A Dsubr_kcov.c753 void __sanitizer_cov_trace_switch(uint64_t val, uint64_t *cases);
756 __sanitizer_cov_trace_switch(uint64_t val, uint64_t *cases) argument
762 ncases = cases[0];
763 nbits = cases[1];
784 trace_cmp(type, cases[i + 2], val, pc);
/src/tests/bin/ps/
H A Dt_ps.sh219 atf_set "descr" "Checks simple cases of 'ps -o foo' to control which" \

Completed in 14 milliseconds

1234