1 /* { dg-do compile } */
2 /* { dg-require-effective-target vect_int } */
3 /* { dg-require-effective-target vect_float } */
7 extern void abort (void);
9 int iadd_results[N] = {0,6,12,18,24,30,36,42,48,54,60,66,72,78,84,90};
10 float fadd_results[N] = {0.0,6.0,12.0,18.0,24.0,30.0,36.0,42.0,48.0,54.0,60.0,66.0,72.0,78.0,84.0,90.0};
11 float fmul_results[N] = {0.0,3.0,12.0,27.0,48.0,75.0,108.0,147.0,192.0,243.0,300.0,363.0,432.0,507.0,588.0,675.0};
12 float fresults1[N] = {192.00,240.00,288.00,336.00,384.00,432.00,480.00,528.00,48.00,54.00,60.00,66.00,72.00,78.00,84.00,90.00};
13 float fresults2[N] = {0.00,6.00,12.00,18.00,24.00,30.00,36.00,42.00,0.00,54.00,120.00,198.00,288.00,390.00,504.00,630.00};
15 /****************************************************/
16 void icheck_results (int *a, int *results)
19 for (i = 0; i < N; i++)
21 if (a[i] != results[i])
26 void fcheck_results (float *a, float *results)
29 for (i = 0; i < N; i++)
31 if (a[i] != results[i])
39 fcheck_results (a, fmul_results);
45 fcheck_results (a, fadd_results);
51 icheck_results (a, iadd_results);
57 fcheck_results (a, fresults1);
63 fcheck_results (a, fresults2);
67 /* None of the loops below is currently vectorizable. The vectorizer will
68 be enhanced to vectorize most of these loops. */
76 float b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
77 float c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
78 float d[N] = {0,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30};
79 short sc[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
80 short sb[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
82 int ic[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
83 int ib[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
92 /* Test 1 - unknown loop bound. */
93 for (i = 0; i < n; i++)
100 /* Test 2 - type cast. */
101 for (i = 0; i < N; i++)
108 /* Test 3 - strided access pattern. */
109 for (i = 0; i < N/2; i++)
111 a[i] = b[2*i+1] * c[2*i+1] - b[2*i] * c[2*i];
112 d[i] = b[2*i] * c[2*i+1] + b[2*i+1] * c[2*i];
117 /* Test 4 - no target support for integer mult. */
118 for (i = 0; i < N; i++)
120 ia[i] = ib[i] * ic[i];
125 /* Test 5 - two types with different nunits in vector. */
126 for (i = 0; i < N; i++)
128 ia[i] = ib[i] + ic[i];
129 sa[i] = sb[i] + sc[i];
135 /* Test 6 - too conservative dependence test. */
136 for (i = 0; i < N; i++){
138 a[i+1] = b[i] + c[i];
143 /* Test 7 - condition in loop. */
144 for (i = 0; i < N; i++){
145 a[i] = (b[i] > 0 ? b[i] : 0);
150 /* Test 8 - cross-iteration cycle. */
152 for (i = 0; i < N; i++) {
153 diff += (cb[i] - cc[i]);
158 /* Test 9 - outer-loop not attempted; inner-loop has cross
159 iteration cycle and multi-dimensional arrays. */
161 for (i = 0; i < N; i++) {
162 for (i = 0; i < N; i++) {
163 diff += (image[i][j] - block[i][j]);
169 /* Test 10 - induction. */
170 for ( i = 0; i < N; i++) {
176 /* Test 11 - reverse access and forward access. */
177 for (i = N; i > 0; i--)
182 for (i = 0; i <N; i++)
184 if (a[i] != b[N-1-i])
191 /* { dg-final { scan-tree-dump-times "vectorized " 3 "vect"} } */
192 /* { dg-final { scan-tree-dump-times "vectorized 0 loops" 2 "vect"} } */
193 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */