| /src/sys/crypto/aes/ |
| aes_selftest.c | 214 uint8_t iv0[16], iv[16]; local
220 iv0[i] = 0x20 ^ i;
229 memcpy(iv, iv0, 16);
235 memcpy(iv, iv0, 16);
243 memcpy(iv, iv0, 16);
252 memcpy(iv, iv0, 16);
344 uint8_t iv0[16], iv[16]; local
360 impl->ai_enc(&enc, blkno_buf, iv0, aes_nrounds[i]);
367 memcpy(iv, iv0, 16);
373 memcpy(iv, iv0, 16)
[all...] |
| aes_bear.c | 223 uint32_t cv0, cv1, cv2, cv3, iv0, iv1, iv2, iv3; local
235 iv0 = le32dec(iv + 4*0);
334 le32enc(out + 4*0, q[2*0] ^ iv0);
|
| aes_bear64.c | 236 uint32_t cv0, cv1, cv2, cv3, iv0, iv1, iv2, iv3; local
249 iv0 = le32dec(iv + 4*0);
383 le32enc(out + 4*0, w[0] ^ iv0);
|
| /src/sys/crypto/aes/arch/arm/ |
| aes_neon_subr.c | 104 uint8x16_t iv0, cv, b; local
109 iv0 = loadblock(iv);
139 out: storeblock(out, b ^ iv0);
|
| /src/sys/crypto/aes/arch/x86/ |
| aes_ssse3_subr.c | 101 __m128i iv0, cv, b; local
106 iv0 = loadblock(iv);
117 storeblock(out, b ^ iv0);
|
| /src/crypto/dist/ipsec-tools/src/racoon/ |
| eaytest.c | 595 vchar_t *iv0,
616 memcpy(iv->v, iv0->v, iv_length);
625 memcpy(iv->v, iv0->v, iv_length);
655 vchar_t iv0; local
664 iv0.v = str2val("26b68c90 9467b4ab 7ec29fa0 0b696b55", 16, &iv0.l);
669 &iv0, 8,
676 &iv0, 8,
683 &iv0, 16,
690 &iv0, 8
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| loop-iv.cc | 508 /* Evaluates addition or subtraction (according to OP) of IV1 to IV0. */
511 iv_add (class rtx_iv *iv0, class rtx_iv *iv1, enum rtx_code op)
517 if (iv0->extend == IV_UNKNOWN_EXTEND
518 && iv0->mode == iv0->extend_mode
519 && iv0->step == const0_rtx
520 && GET_MODE_SIZE (iv0->extend_mode) < GET_MODE_SIZE (iv1->extend_mode))
522 iv0->extend_mode = iv1->extend_mode;
523 iv0->base = simplify_gen_unary (ZERO_EXTEND, iv0->extend_mode
965 class rtx_iv iv0, iv1; local
2297 class rtx_iv iv0, iv1; local
[all...] |
| predict.cc | 1524 affine_iv iv0, iv1; local
1551 if (!simple_iv (loop, loop_containing_stmt (stmt), op0, &iv0, true))
1555 if (TREE_CODE (iv0.step) != INTEGER_CST
1558 if ((integer_zerop (iv0.step) && integer_zerop (iv1.step))
1559 || (!integer_zerop (iv0.step) && !integer_zerop (iv1.step)))
1562 if (integer_zerop (iv0.step))
1566 bound = iv0.base;
1576 base = iv0.base;
1577 if (tree_fits_shwi_p (iv0.step))
1578 step = iv0.step
[all...] |
| tree-ssa-loop-niter.cc | 1138 of the loop with ending condition IV0 < IV1 (computed in TYPE).
1139 DELTA is the difference IV1->base - IV0->base, STEP is the absolute value
1143 we return false. BNDS bounds the value of IV1->base - IV0->base,
1148 number_of_iterations_lt_to_ne (tree type, affine_iv *iv0, affine_iv *iv1,
1185 (iv0->no_overflow && integer_nonzerop (iv0->step))
1188 if (integer_nonzerop (iv0->step))
1192 iv0->base <= iv1->base + MOD. */
1205 /* The final value of the iv is iv0->base - MOD, assuming that this
1207 iv0->base - MOD <= iv1->base. *
3093 affine_iv iv0, iv1; local
[all...] |
| tree-ssa-loop-ivopts.cc | 1709 struct iv *iv0 = &const_iv, *iv1 = &const_iv; local
1728 iv0 = get_iv (data, *op0);
1733 if (iv0 && iv1 && !integer_zerop (iv0->step) && !integer_zerop (iv1->step))
1740 if ((!iv0 || integer_zerop (iv0->step))
1745 if (!iv0 || integer_zerop (iv0->step))
1748 std::swap (iv0, iv1);
1754 else if (!integer_zerop (iv0->step) && integer_zerop (iv1->step)
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| loop-iv.cc | 508 /* Evaluates addition or subtraction (according to OP) of IV1 to IV0. */
511 iv_add (class rtx_iv *iv0, class rtx_iv *iv1, enum rtx_code op)
517 if (iv0->extend == IV_UNKNOWN_EXTEND
518 && iv0->mode == iv0->extend_mode
519 && iv0->step == const0_rtx
520 && GET_MODE_SIZE (iv0->extend_mode) < GET_MODE_SIZE (iv1->extend_mode))
522 iv0->extend_mode = iv1->extend_mode;
523 iv0->base = simplify_gen_unary (ZERO_EXTEND, iv0->extend_mode
938 class rtx_iv iv0, iv1; local
2313 class rtx_iv iv0, iv1; local
[all...] |
| predict.cc | 1512 affine_iv iv0, iv1; local
1539 if (!simple_iv (loop, loop_containing_stmt (stmt), op0, &iv0, true))
1543 if (TREE_CODE (iv0.step) != INTEGER_CST
1546 if ((integer_zerop (iv0.step) && integer_zerop (iv1.step))
1547 || (!integer_zerop (iv0.step) && !integer_zerop (iv1.step)))
1550 if (integer_zerop (iv0.step))
1554 bound = iv0.base;
1564 base = iv0.base;
1565 if (tree_fits_shwi_p (iv0.step))
1566 step = iv0.step
[all...] |
| tree-ssa-loop-niter.cc | 1152 of the loop with ending condition IV0 < IV1 (computed in TYPE).
1153 DELTA is the difference IV1->base - IV0->base, STEP is the absolute value
1157 we return false. BNDS bounds the value of IV1->base - IV0->base,
1162 number_of_iterations_lt_to_ne (tree type, affine_iv *iv0, affine_iv *iv1,
1200 (iv0->no_overflow && integer_nonzerop (iv0->step))
1203 if (integer_nonzerop (iv0->step))
1207 iv0->base <= iv1->base + MOD. */
1220 /* The final value of the iv is iv0->base - MOD, assuming that this
1222 iv0->base - MOD <= iv1->base. *
2495 affine_iv iv0, iv1; local
[all...] |
| tree-ssa-loop-ivopts.cc | 1704 struct iv *iv0 = &const_iv, *iv1 = &const_iv; local
1723 iv0 = get_iv (data, *op0);
1728 if (iv0 && iv1 && !integer_zerop (iv0->step) && !integer_zerop (iv1->step))
1735 if ((!iv0 || integer_zerop (iv0->step))
1740 if (!iv0 || integer_zerop (iv0->step))
1743 std::swap (iv0, iv1);
1749 else if (!integer_zerop (iv0->step) && integer_zerop (iv1->step)
[all...] |
