HomeSort by: relevance | last modified time | path
    Searched defs:cases (Results 1 - 13 of 13) sorted by relevancy

  /src/tests/lib/libm/
t_modf.c 58 } cases[] = { variable in typeref:typename:const struct __anon763216d20208[]
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...]
t_errhandling.c 55 } 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);
  /src/lib/libm/noieee_src/
n_fmod.c 148 int i,cases; local in function:main
155 for (cases = 0; cases < NCASES; cases++) {
156 switch (cases) {
  /src/sys/crypto/aes/arch/arm/
aes_armv8.c 256 } 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))
aes_neon_subr.c 165 } 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/sys/crypto/aes/arch/x86/
aes_ni.c 254 } 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))
aes_sse2_subr.c 313 } cases[] = { local in function:aes_sse2_xts_update_selftest
325 for (i = 0; i < sizeof(cases)/sizeof(cases[0]); i++) {
326 t[0] = cases[i].in[0];
327 t[1] = cases[i].in[1];
328 t[2] = cases[i].in[2];
329 t[3] = cases[i].in[3];
331 if (t[0] != cases[i].out[0] ||
332 t[1] != cases[i].out[1] ||
333 t[2] != cases[i].out[2] |
    [all...]
aes_ssse3_subr.c 139 } 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[i].out[2] |
    [all...]
aes_via.c 461 } cases[] = { local in function:aesvia_xts_update_selftest
472 for (i = 0; i < sizeof(cases)/sizeof(cases[0]); i++) {
473 t0 = cases[i].in[0];
474 t1 = cases[i].in[1];
475 t2 = cases[i].in[2];
476 t3 = cases[i].in[3];
478 if (t0 != cases[i].out[0] ||
479 t1 != cases[i].out[1] ||
480 t2 != cases[i].out[2] |
    [all...]
  /src/usr.bin/rpcgen/
rpc_parse.c 297 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->case_decl = dec
    [all...]
rpc_parse.h 108 case_list *cases; member in struct:union_def
  /src/sys/crypto/aes/
aes_bear.c 364 } 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[i].out[2] |
    [all...]
  /src/sys/lib/libkern/
entpool.c 615 /* Cases correspond to entpool_selftest above. */
616 static const struct event *const cases[] = {
746 for (i = 0; i < arraycount(cases); i++) {
748 compute(output, cases[i]);
606 static const struct event *const cases[] = { variable in typeref:typename:const struct event * const[]

Completed in 19 milliseconds