|
111
|
1 /* { dg-require-effective-target vect_int } */
|
|
|
2
|
|
|
3 #include <stdarg.h>
|
|
|
4 #include "tree-vect.h"
|
|
|
5
|
|
|
6 #define N 8
|
|
|
7
|
|
|
8 int
|
|
|
9 main1 ()
|
|
|
10 {
|
|
|
11 int i;
|
|
|
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};
|
|
|
14 unsigned int ia[N*2];
|
|
|
15
|
|
|
16 for (i = 0; i < N*2; i++)
|
|
|
17 {
|
|
|
18 out[i*4] = (in[i*4] + 2) * 3;
|
|
|
19 out[i*4 + 1] = (in[i*4 + 1] + 2) * 7;
|
|
|
20 out[i*4 + 2] = (in[i*4 + 2] + 7) * 3;
|
|
|
21 out[i*4 + 3] = (in[i*4 + 3] + 7) * 7;
|
|
|
22
|
|
|
23 ia[i] = 7;
|
|
|
24 }
|
|
|
25
|
|
|
26 /* check results: */
|
|
|
27 for (i = 0; i < N*2; i++)
|
|
|
28 {
|
|
|
29 if (out[i*4] != (in[i*4] + 2) * 3
|
|
|
30 || out[i*4 + 1] != (in[i*4 + 1] + 2) * 7
|
|
|
31 || out[i*4 + 2] != (in[i*4 + 2] + 7) * 3
|
|
|
32 || out[i*4 + 3] != (in[i*4 + 3] + 7) * 7
|
|
|
33 || ia[i] != 7)
|
|
|
34 abort ();
|
|
|
35 }
|
|
|
36
|
|
|
37 return 0;
|
|
|
38 }
|
|
|
39
|
|
|
40 int main (void)
|
|
|
41 {
|
|
|
42 check_vect ();
|
|
|
43
|
|
|
44 main1 ();
|
|
|
45
|
|
|
46 return 0;
|
|
|
47 }
|
|
|
48
|
|
|
49 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_int_mult } } } } */
|
|
|
50 /* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" { target { ! vect_int_mult } } } } */
|
|
|
51 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" { target vect_int_mult } } } */
|
|
|
52 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect" { target { ! vect_int_mult } } } } */
|
