|
111
|
1 /* { dg-require-effective-target vect_float } */
|
|
|
2
|
|
|
3 #include <stdarg.h>
|
|
|
4 #include "tree-vect.h"
|
|
|
5
|
|
|
6 #define N 16
|
|
|
7
|
|
|
8 float fa[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
|
|
|
9 float fb[N+4] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0.0, 1.0, 2.0, 3.0, 4.0, 5.0, 7.0, 9.0, 10.0, 11.0, 12.0, 13.0, 14.0, 15.0, 16.0, 17.0, 18.0, 19.0};
|
|
|
10 float fc[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0.5, 1.5, 2.5, 3.5, 4.5, 5.5, 7.5, 9.5, 10.5, 11.5, 12.5, 13.5, 14.5, 15.5};
|
|
|
11
|
|
|
12 /* Like vect-80.c but the pointers are not annotated as restricted,
|
|
|
13 and therefore can't be antialiased. */
|
|
|
14
|
|
|
15 __attribute__ ((noinline)) int
|
|
|
16 main1 (float *pa, float *pb, float *pc)
|
|
|
17 {
|
|
|
18 int i;
|
|
|
19 float *q = pb + 4;
|
|
|
20
|
|
|
21 for (i = 0; i < N; i++)
|
|
|
22 {
|
|
|
23 pa[i] = q[i] * pc[i];
|
|
|
24 }
|
|
|
25
|
|
|
26 for (i = 0; i < N; i++)
|
|
|
27 {
|
|
|
28 if (pa[i] != q[i] * pc[i])
|
|
|
29 abort();
|
|
|
30 }
|
|
|
31
|
|
|
32 return 0;
|
|
|
33 }
|
|
|
34
|
|
|
35
|
|
|
36 int main (void)
|
|
|
37 {
|
|
|
38 check_vect ();
|
|
|
39
|
|
|
40 main1 (fa, fb, fc);
|
|
|
41
|
|
|
42 return 0;
|
|
|
43 }
|
|
|
44
|
|
|
45 /* Currently the loops fail to vectorize due to aliasing problems.
|
|
|
46 If/when the aliasing problems are resolved, unalignment may
|
|
|
47 prevent vectorization on some targets. */
|
|
|
48 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail *-*-* } } } */
|
|
|
49 /* { dg-final { scan-tree-dump-times "can't determine dependence" 1 "vect" { target { ! vect_multiple_sizes } } } } */
|
|
131
|
50 /* { dg-final { scan-tree-dump "can't determine dependence" "vect" { target vect_multiple_sizes } } } */
|
