1 /* { dg-require-effective-target vect_int } */
2 /* { dg-require-effective-target vect_float } */
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 __attribute__ ((noinline))
17 void icheck_results (int *a, int *results)
20 for (i = 0; i < N; i++)
22 if (a[i] != results[i])
27 __attribute__ ((noinline))
28 void fcheck_results (float *a, float *results)
31 for (i = 0; i < N; i++)
33 if (a[i] != results[i])
38 __attribute__ ((noinline)) void
41 fcheck_results (a, fmul_results);
44 __attribute__ ((noinline)) void
47 fcheck_results (a, fadd_results);
50 __attribute__ ((noinline)) void
53 icheck_results (a, iadd_results);
56 __attribute__ ((noinline)) void
59 fcheck_results (a, fresults1);
62 __attribute__ ((noinline)) void
65 fcheck_results (a, fresults2);
70 float b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
71 float c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
72 float d[N] = {0,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30};
73 int ic[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
74 int ib[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
76 char cb[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
80 /* All of the loops below are currently vectorizable. */
82 __attribute__ ((noinline)) int
87 /* Test 1: copy chars. */
88 for (i = 0; i < N; i++)
93 for (i = 0; i < N; i++)
100 /* Test 2: fp mult. */
101 for (i = 0; i < N; i++)
108 /* Test 3: mixed types (int, fp), same nunits in vector. */
109 for (i = 0; i < N; i++)
111 a[i] = b[i] + c[i] + d[i];
112 e[i] = b[i] + c[i] + d[i];
113 ia[i] = ib[i] + ic[i];
120 /* Test 4: access with offset. */
121 for (i = 0; i < N/2; i++)
123 a[i] = b[i+N/2] * c[i+N/2] - b[i] * c[i];
124 e[i+N/2] = b[i] * c[i+N/2] + b[i+N/2] * c[i];
130 /* Test 5: access with offset */
131 for (i = 1; i <=N-4; i++)
136 for (i = 1; i <=N-4; i++)
138 if (a[i+3] != b[i-1])
143 /* Test 6 - loop induction with stride != 1. */
153 for (i = 0; i <N; i++)
160 /* Test 7 - reverse access. */
161 for (i = N; i > 0; i--)
166 for (i = 0; i <N; i++)
173 /* Tests 8,9,10 - constants. */
174 for (i = 0; i < N; i++)
179 for (i = 0; i < N; i++)
185 for (i = 0; i < N; i++)
190 for (i = 0; i < N; i++)
196 for (i = 0; i < N; i++)
201 for (i = 0; i < N; i++)
203 if (ia[i] != ib[i] + 5)
217 /* { dg-final { scan-tree-dump-times "vectorized 10 loops" 1 "vect" } } */
218 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
219 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" } } */
220 /* { dg-final { cleanup-tree-dump "vect" } } */