| /openbsd/src/gnu/gcc/gcc/ |
| D | loop-iv.c | 476 iv_add (struct rtx_iv *iv0, struct rtx_iv *iv1, enum rtx_code op) in iv_add() argument
482 if (iv0->extend == UNKNOWN in iv_add()
483 && iv0->mode == iv0->extend_mode in iv_add()
484 && iv0->step == const0_rtx in iv_add()
485 && GET_MODE_SIZE (iv0->extend_mode) < GET_MODE_SIZE (iv1->extend_mode)) in iv_add()
487 iv0->extend_mode = iv1->extend_mode; in iv_add()
488 iv0->base = simplify_gen_unary (ZERO_EXTEND, iv0->extend_mode, in iv_add()
489 iv0->base, iv0->mode); in iv_add()
494 && GET_MODE_SIZE (iv1->extend_mode) < GET_MODE_SIZE (iv0->extend_mode)) in iv_add()
496 iv1->extend_mode = iv0->extend_mode; in iv_add()
[all …]
|
| D | tree-ssa-loop-niter.c | 211 number_of_iterations_lt_to_ne (tree type, affine_iv *iv0, affine_iv *iv1, in number_of_iterations_lt_to_ne() argument
226 if (nonzero_p (iv0->step)) in number_of_iterations_lt_to_ne()
241 iv0->base, in number_of_iterations_lt_to_ne()
250 if (!iv0->no_overflow && !zero_p (mod)) in number_of_iterations_lt_to_ne()
255 iv0->base, bound); in number_of_iterations_lt_to_ne()
261 iv0->base, tmod), in number_of_iterations_lt_to_ne()
283 assert_no_overflow_lt (tree type, affine_iv *iv0, affine_iv *iv1, in assert_no_overflow_lt() argument
289 if (nonzero_p (iv0->step)) in assert_no_overflow_lt()
292 if (iv0->no_overflow) in assert_no_overflow_lt()
299 if (TREE_CODE (iv0->base) == INTEGER_CST) in assert_no_overflow_lt()
[all …]
|
| D | tree-ssa-loop-ivopts.c | 1241 struct iv *iv0 = NULL, *iv1 = NULL, *civ; in find_interesting_uses_cond() local
1263 iv0 = get_iv (data, *op0_p); in find_interesting_uses_cond()
1265 iv0 = &const_iv; in find_interesting_uses_cond()
1274 (!iv0 || !iv1) in find_interesting_uses_cond()
1277 || (!zero_p (iv0->step) && !zero_p (iv1->step))) in find_interesting_uses_cond()
1284 if (zero_p (iv0->step) && zero_p (iv1->step)) in find_interesting_uses_cond()
1291 *civ = zero_p (iv0->step) ? *iv1: *iv0; in find_interesting_uses_cond()
|
| /openbsd/src/regress/sys/crypto/enc/ |
| D | des3.c | 57 docrypt(const unsigned char *key, size_t klen, const unsigned char *iv0, in docrypt() argument
64 memcpy(iv, iv0, 8); in docrypt()
117 unsigned char iv0[8], iv[8], key[24] = "012345670123456701234567"; in main() local
129 for (i = 0; i < sizeof(iv0); i++ ) { in main()
132 iv0[i] = rand; in main()
143 memcpy(iv, iv0, sizeof(iv0)); in main()
146 memcpy(iv, iv0, sizeof(iv0)); in main()
158 memcpy(iv, iv0, sizeof(iv0)); in main()
163 memcpy(iv, iv0, sizeof(iv0)); in main()
|
| /openbsd/src/lib/libcrypto/aes/asm/ |
| D | aesni-x86_64.pl | 1021 my ($iv0,$iv1,$ivec)=("%xmm12","%xmm13","%xmm14");
1060 pxor $iv0,$iv0 # vector of 3 32-bit counters
1062 pinsrd \$0,$rnds_,$iv0
1066 pinsrd \$1,$rnds_,$iv0
1070 pinsrd \$2,$rnds_,$iv0
1073 movdqa $iv0,0x00(%rsp)
1074 pshufb $bswap_mask,$iv0
1078 pshufd \$`3<<6`,$iv0,$inout0 # place counter to upper dword
1079 pshufd \$`2<<6`,$iv0,$inout1
1080 pshufd \$`1<<6`,$iv0,$inout2
[all …]
|
| /openbsd/src/gnu/usr.bin/perl/t/opbasic/ |
| D | cmp.t | 13 my ($iv0, $iv1, $ivm1, $iv_min, $iv_max, $iv_big, $iv_small);
19 $iv0 = 2 - 2;
47 $uv_big, $uv_bigi, $iv0, $iv1, $ivm1, $iv_min, $iv_max, $iv_big,
|
| /openbsd/src/gnu/usr.bin/perl/ |
| D | op.c | 12188 bool iv0; in Perl_ck_cmp() local
12249 iv0 = (iv == 0); in Perl_ck_cmp()
12252 if (!(iv0 ^ reverse)) in Perl_ck_cmp()
12254 neg = iv0; in Perl_ck_cmp()
12257 if (iv0 ^ reverse) in Perl_ck_cmp()
12259 neg = !iv0; in Perl_ck_cmp()
12262 if (!(iv0 ^ reverse)) in Perl_ck_cmp()
12264 neg = !iv0; in Perl_ck_cmp()
12267 if (iv0 ^ reverse) in Perl_ck_cmp()
12269 neg = iv0; in Perl_ck_cmp()
[all …]
|