1 /* { dg-require-effective-target vect_int } */
12 unsigned int out
[N
*8], a0
, a1
, a2
, a3
, a4
, a5
, a6
, a7
, b1
, b0
, b2
, b3
, b4
, b5
, b6
, b7
;
13 unsigned int in
[N
*8] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63};
16 for (i
= 0; i
< N
; i
++)
24 a5
= in
[i
*8 + 5] + 10;
25 a6
= in
[i
*8 + 6] + 11;
26 a7
= in
[i
*8 + 7] + 12;
38 out
[i
*8 + 1] = b1
- 3;
39 out
[i
*8 + 2] = b2
- 2;
40 out
[i
*8 + 3] = b3
- 1;
41 out
[i
*8 + 4] = b4
- 8;
42 out
[i
*8 + 5] = b5
- 7;
43 out
[i
*8 + 6] = b6
- 3;
44 out
[i
*8 + 7] = b7
- 7;
50 for (i
= 0; i
< N
; i
++)
52 if (out
[i
*8] != (in
[i
*8] + 5) * 3 - 2
53 || out
[i
*8 + 1] != (in
[i
*8 + 1] + 6) * 2 - 3
54 || out
[i
*8 + 2] != (in
[i
*8 + 2] + 7) * 12 - 2
55 || out
[i
*8 + 3] != (in
[i
*8 + 3] + 8) * 5 - 1
56 || out
[i
*8 + 4] != (in
[i
*8 + 4] + 9) * 8 - 8
57 || out
[i
*8 + 5] != (in
[i
*8 + 5] + 10) * 4 - 7
58 || out
[i
*8 + 6] != (in
[i
*8 + 6] + 11) * 3 - 3
59 || out
[i
*8 + 7] != (in
[i
*8 + 7] + 12) * 2 - 7
60 || ia
[i
] != (in
[i
*8 + 6] + 11) * 3)
76 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_strided8 && vect_int_mult } } } } */
77 /* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" { target { ! { vect_strided8 && vect_int_mult } } } } } */
78 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" { target { vect_strided8 && vect_int_mult } } } } */
79 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect" { target { ! { vect_strided8 && vect_int_mult } } } } } */
80 /* { dg-final { cleanup-tree-dump "vect" } } */