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
main1()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 float out2[N*8], fa[N*4];
15 unsigned int ia[N], ib[N*2];
16
17 for (i = 0; i < N; i++)
18 {
19
20 a0 = in[i*8] + 5;
21 a1 = in[i*8 + 1] + 6;
22 a2 = in[i*8 + 2] + 7;
23 a3 = in[i*8 + 3] + 8;
24 a4 = in[i*8 + 4] + 9;
25 a5 = in[i*8 + 5] + 10;
26 a6 = in[i*8 + 6] + 11;
27 a7 = in[i*8 + 7] + 12;
28
29 b0 = a0 * 3;
30 b1 = a1 * 2;
31 b2 = a2 * 12;
32 b3 = a3 * 5;
33 b4 = a4 * 8;
34 b5 = a5 * 4;
35 b6 = a6 * 3;
36 b7 = a7 * 2;
37
38 out[i*8] = b0 - 2;
39 out[i*8 + 1] = b1 - 3;
40 out[i*8 + 2] = b2 - 2;
41 out[i*8 + 3] = b3 - 1;
42 out[i*8 + 4] = b4 - 8;
43 out[i*8 + 5] = b5 - 7;
44 out[i*8 + 6] = b6 - 3;
45 out[i*8 + 7] = b7 - 7;
46
47 ia[i] = b6;
48 }
49
50 /* check results: */
51 for (i = 0; i < N; i++)
52 {
53 if (out[i*8] != (in[i*8] + 5) * 3 - 2
54 || out[i*8 + 1] != (in[i*8 + 1] + 6) * 2 - 3
55 || out[i*8 + 2] != (in[i*8 + 2] + 7) * 12 - 2
56 || out[i*8 + 3] != (in[i*8 + 3] + 8) * 5 - 1
57 || out[i*8 + 4] != (in[i*8 + 4] + 9) * 8 - 8
58 || out[i*8 + 5] != (in[i*8 + 5] + 10) * 4 - 7
59 || out[i*8 + 6] != (in[i*8 + 6] + 11) * 3 - 3
60 || out[i*8 + 7] != (in[i*8 + 7] + 12) * 2 - 7
61 || ia[i] != (in[i*8 + 6] + 11) * 3)
62 abort ();
63 }
64
65 for (i = 0; i < N*2; i++)
66 {
67 out[i*4] = (in[i*4] + 2) * 3;
68 out[i*4 + 1] = (in[i*4 + 1] + 2) * 7;
69 out[i*4 + 2] = (in[i*4 + 2] + 7) * 3;
70 out[i*4 + 3] = (in[i*4 + 3] + 7) * 7;
71
72 ib[i] = 7;
73 }
74
75 /* check results: */
76 for (i = 0; i < N*2; i++)
77 {
78 if (out[i*4] != (in[i*4] + 2) * 3
79 || out[i*4 + 1] != (in[i*4 + 1] + 2) * 7
80 || out[i*4 + 2] != (in[i*4 + 2] + 7) * 3
81 || out[i*4 + 3] != (in[i*4 + 3] + 7) * 7
82 || ib[i] != 7)
83 abort ();
84 }
85
86 for (i = 0; i < N*4; i++)
87 {
88 out2[i*2] = (float) (in[i*2] * 2 + 11) ;
89 out2[i*2 + 1] = (float) (in[i*2 + 1] * 3 + 7);
90
91 fa[i] = (float) in[i*2+1];
92 }
93
94 /* check results: */
95 for (i = 0; i < N*4; i++)
96 {
97 if (out2[i*2] != (float) (in[i*2] * 2 + 11)
98 || out2[i*2 + 1] != (float) (in[i*2 + 1] * 3 + 7)
99 || fa[i] != (float) in[i*2+1])
100 abort ();
101 }
102
103
104 return 0;
105 }
106
main(void)107 int main (void)
108 {
109 check_vect ();
110
111 main1 ();
112
113 return 0;
114 }
115
116 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" {target { vect_strided8 && vect_int_mult } } } } */
117 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 3 "vect" {target { vect_strided8 && vect_int_mult } } } } */
118
119