1 /* { dg-require-effective-target vect_int } */
2 /* { dg-require-effective-target vect_float } */
3 /* { dg-add-options bind_pic_locally } */
11 float fadd_results
[N
];
12 float fmul_results
[N
];
16 /****************************************************/
17 __attribute__ ((noinline
))
18 void icheck_results (int *a
, int *results
)
21 for (i
= 0; i
< N
; i
++)
23 if (a
[i
] != results
[i
])
28 __attribute__ ((noinline
))
29 void fcheck_results (float *a
, float *results
)
32 for (i
= 0; i
< N
; i
++)
34 if (a
[i
] != results
[i
])
39 __attribute__ ((noinline
)) void
42 fcheck_results (a
, fmul_results
);
45 __attribute__ ((noinline
)) void
48 fcheck_results (a
, fadd_results
);
51 __attribute__ ((noinline
)) void
54 icheck_results (a
, iadd_results
);
57 __attribute__ ((noinline
)) void
60 fcheck_results (a
, fresults1
);
63 __attribute__ ((noinline
)) void
66 fcheck_results (a
, fresults2
);
71 float b
[N
] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
72 float c
[N
] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
73 float d
[N
] = {0,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30};
74 int ic
[N
] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
75 int ib
[N
] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
77 char cb
[N
] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
81 /* All of the loops below are currently vectorizable, except
82 initialization ones. */
84 __attribute__ ((noinline
)) int
89 for (i
= 0; i
< N
; i
++)
97 fadd_results
[i
] = b
[i
] + c
[i
] + d
[i
];
98 iadd_results
[i
] = ib
[i
] + ic
[i
];
99 fmul_results
[i
] = b
[i
] * c
[i
];
102 asm volatile ("" ::: "memory");
105 /* Test 1: copy chars. */
106 for (i
= 0; i
< N
; i
++)
111 for (i
= 0; i
< N
; i
++)
118 /* Test 2: fp mult. */
119 for (i
= 0; i
< N
; i
++)
126 /* Test 3: mixed types (int, fp), same nunits in vector. */
127 for (i
= 0; i
< N
; i
++)
129 a
[i
] = b
[i
] + c
[i
] + d
[i
];
130 e
[i
] = b
[i
] + c
[i
] + d
[i
];
131 ia
[i
] = ib
[i
] + ic
[i
];
137 /* Initialization. */
138 for (i
= 0; i
< N
; i
++)
142 asm volatile ("" ::: "memory");
144 for (i
= 0; i
< N
/2; i
++)
146 fresults1
[i
] = b
[i
+N
/2] * c
[i
+N
/2] - b
[i
] * c
[i
];
147 fresults2
[i
+N
/2] = b
[i
] * c
[i
+N
/2] + b
[i
+N
/2] * c
[i
];
148 asm volatile ("" ::: "memory");
150 /* Test 4: access with offset. */
151 for (i
= 0; i
< N
/2; i
++)
153 a
[i
] = b
[i
+N
/2] * c
[i
+N
/2] - b
[i
] * c
[i
];
154 e
[i
+N
/2] = b
[i
] * c
[i
+N
/2] + b
[i
+N
/2] * c
[i
];
160 /* Test 5: access with offset. */
161 for (i
= 1; i
<=N
-4; i
++)
166 for (i
= 1; i
<=N
-4; i
++)
168 if (a
[i
+3] != b
[i
-1])
173 /* Test 6 - loop induction with stride != 1. */
183 for (i
= 0; i
<N
; i
++)
190 /* Test 7 - reverse access. */
191 for (i
= N
; i
> 0; i
--)
196 for (i
= 0; i
<N
; i
++)
203 /* Tests 8,9,10 - constants. */
204 for (i
= 0; i
< N
; i
++)
209 for (i
= 0; i
< N
; i
++)
215 for (i
= 0; i
< N
; i
++)
220 for (i
= 0; i
< N
; i
++)
226 for (i
= 0; i
< N
; i
++)
231 for (i
= 0; i
< N
; i
++)
233 if (ia
[i
] != ib
[i
] + 5)
247 /* { dg-final { scan-tree-dump-times "vectorized 10 loops" 1 "vect" } } */
248 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" { target { { vect_aligned_arrays } && {! vect_sizes_32B_16B} } } } } */
249 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { target { {! vect_aligned_arrays } && {vect_sizes_32B_16B} } } } } */
250 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" } } */