| /freebsd-9.3-release/crypto/openssl/crypto/des/ |
| H A D | cbc3_enc.c | 64 DES_cblock *iv1, DES_cblock *iv2, int enc)
72 (unsigned char *)output, length, &ks1, iv1, enc);
76 (unsigned char *)output, l8, &ks2, iv1, !enc);
87 (unsigned char *)output, l8, &ks2, iv1, !enc);
91 (unsigned char *)output, length, &ks1, iv1, enc);
93 memcpy(*iv1, niv1, sizeof(DES_cblock));
62 DES_3cbc_encrypt(DES_cblock *input, DES_cblock *output, long length, DES_key_schedule ks1, DES_key_schedule ks2, DES_cblock *iv1, DES_cblock *iv2, int enc) argument
|
| H A D | ede_cbcm_enc.c | 86 unsigned char *iv1, *iv2; local
88 iv1 = &(*ivec1)[0];
92 c2l(iv1, m0);
93 c2l(iv1, m1);
127 iv1 = &(*ivec1)[0];
128 l2c(m0, iv1);
129 l2c(m1, iv1);
137 c2l(iv1, m0);
138 c2l(iv1, m1);
178 iv1
[all...] |
| H A D | des_old.h | 144 # define des_ede3_cbcm_encrypt(i,o,l,k1,k2,k3,iv1,iv2,e)\
145 DES_ede3_cbcm_encrypt((i),(o),(l),&(k1),&(k2),&(k3),(iv1),(iv2),(e))
|
| /freebsd-9.3-release/contrib/gcc/ |
| H A D | loop-iv.c | 476 iv_add (struct rtx_iv *iv0, struct rtx_iv *iv1, enum rtx_code op) argument
485 && GET_MODE_SIZE (iv0->extend_mode) < GET_MODE_SIZE (iv1->extend_mode))
487 iv0->extend_mode = iv1->extend_mode;
491 if (iv1->extend == UNKNOWN
492 && iv1->mode == iv1->extend_mode
493 && iv1->step == const0_rtx
494 && GET_MODE_SIZE (iv1->extend_mode) < GET_MODE_SIZE (iv0->extend_mode))
496 iv1->extend_mode = iv0->extend_mode;
497 iv1
904 struct rtx_iv iv0, iv1; local
1874 canonicalize_iv_subregs(struct rtx_iv *iv0, struct rtx_iv *iv1, enum rtx_code cond, struct niter_desc *desc) argument
1993 struct rtx_iv iv0, iv1, tmp_iv; local
[all...] |
| H A D | tree-ssa-loop-niter.c | 211 number_of_iterations_lt_to_ne (tree type, affine_iv *iv0, affine_iv *iv1, argument
228 /* The final value of the iv is iv1->base + MOD, assuming that this
230 iv0->base <= iv1->base + MOD. */
231 if (!iv1->no_overflow && !zero_p (mod))
236 iv1->base, bound);
243 iv1->base, tmod));
249 iv0->base - MOD <= iv1->base. */
262 iv1->base);
283 assert_no_overflow_lt (tree type, affine_iv *iv0, affine_iv *iv1, argument
291 /* for (i = iv0->base; i < iv1
351 assert_loop_rolls_lt(tree type, affine_iv *iv0, affine_iv *iv1, struct tree_niter_desc *niter) argument
410 number_of_iterations_lt(tree type, affine_iv *iv0, affine_iv *iv1, struct tree_niter_desc *niter, bool never_infinite ATTRIBUTE_UNUSED) argument
500 number_of_iterations_le(tree type, affine_iv *iv0, affine_iv *iv1, struct tree_niter_desc *niter, bool never_infinite) argument
553 number_of_iterations_cond(tree type, affine_iv *iv0, enum tree_code code, affine_iv *iv1, struct tree_niter_desc *niter, bool only_exit) argument
1052 affine_iv iv0, iv1; local
[all...] |
| H A D | tree-ssa-loop-ivopts.c | 1241 struct iv *iv0 = NULL, *iv1 = NULL, *civ; local
1268 iv1 = get_iv (data, *op1_p);
1270 iv1 = &const_iv;
1274 (!iv0 || !iv1)
1277 || (!zero_p (iv0->step) && !zero_p (iv1->step)))
1284 if (zero_p (iv0->step) && zero_p (iv1->step))
1291 *civ = zero_p (iv0->step) ? *iv1: *iv0;
|
| /freebsd-9.3-release/tools/regression/net80211/wep/ |
| H A D | test_wep.c | 130 #define TEST(n,name,cipher,keyix,iv0,iv1,iv2,iv3) { \
131 name, IEEE80211_CIPHER_##cipher,keyix, { iv2,iv1,iv0,iv3 }, \
|
| /freebsd-9.3-release/crypto/openssl/ssl/ |
| H A D | t1_enc.c | 229 unsigned char iv1[EVP_MAX_IV_LENGTH * 2]; local
413 iv1, iv2, k * 2);
415 iv = iv1;
417 iv = &(iv1[k]);
456 OPENSSL_cleanse(iv1, sizeof(iv1));
|