| /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/lib/libm/noieee_src/ |
| n_fmod.c | 148 int i,cases; local
155 for (cases = 0; cases < NCASES; cases++) {
156 switch (cases) {
|
| /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.
|
| directive-for-empty.mk | 7 # 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
|
| recursive.mk | 34 # therefore that's acceptable. In most practical cases, the missing
|
| varname-dot-parsedir.mk | 43 .info The location can be faked in some cases.
|
| varname-dot-parsefile.mk | 38 .info The location can be faked in some cases.
|
| deptgt-end-fail.mk | 62 # Until 2020-12-07, several of the test cases printed "`all' not remade
|
| varmod-order.mk | 63 # Repeating the 'n' is not supported. In the typical use cases, the sorting
|
| /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))
|
| aes_sse2_4x32_subr.c | 342 } cases[] = { local
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[i].out[2] |
[all...] |
| aes_via.c | 469 } cases[] = { local
480 for (i = 0; i < sizeof(cases)/sizeof(cases[0]); i++) {
481 t0 = cases[i].in[0];
482 t1 = cases[i].in[1];
483 t2 = cases[i].in[2];
484 t3 = cases[i].in[3];
486 if (t0 != cases[i].out[0] ||
487 t1 != cases[i].out[1] ||
488 t2 != cases[i].out[2] |
[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...] |
| rpc_parse.h | 108 case_list *cases; member in struct:union_def
|
| /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))
|
| aes_neon_subr.c | 165 } cases[] = { local
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/ |
| ffs.S | 53 bt Lzero ! testing here to accelerate ret=1..8 cases
|
| /src/sys/crypto/aes/ |
| aes_bear.c | 364 } cases[] = { local
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[i].out[2] |
[all...] |
| aes_bear64.c | 413 } cases[] = { local
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[i].out[2] |
[all...] |
| /src/doc/ |
| TODO.modules | 46 this in all cases; currently the "push" only occurs if the
234 cases, wrong headers are included (because a XEN-related #define
|
| /src/sys/kern/ |
| subr_kcov.c | 755 void __sanitizer_cov_trace_switch(uint64_t val, uint64_t *cases);
758 __sanitizer_cov_trace_switch(uint64_t val, uint64_t *cases)
764 ncases = cases[0];
765 nbits = cases[1];
786 trace_cmp(type, cases[i + 2], val, pc);
|
| /src/tests/bin/ps/ |
| t_ps.sh | 219 atf_set "descr" "Checks simple cases of 'ps -o foo' to control which" \
|
