|
111
|
1 /* { dg-require-effective-target vect_float } */
|
|
|
2
|
|
|
3 #include <stdarg.h>
|
|
|
4 #include "tree-vect.h"
|
|
|
5
|
|
|
6 #define N 128
|
|
|
7
|
|
|
8 /* Check handling of accesses for which the "initial condition" -
|
|
|
9 the expression that represents the first location accessed - is
|
|
|
10 more involved than just an ssa_name. */
|
|
|
11
|
|
|
12 float a[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
|
|
|
13 float b[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};
|
|
|
14 float c[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};
|
|
|
15
|
|
|
16 volatile int y = 0;
|
|
|
17
|
|
|
18 __attribute__ ((noinline)) int
|
|
|
19 main1 (float *__restrict__ pa, float * __restrict__ pb, float * __restrict__ pc)
|
|
|
20 {
|
|
|
21 int i;
|
|
|
22 float *q = pb + 4;
|
|
|
23
|
|
|
24 for (i = 0; i < N; i++)
|
|
|
25 {
|
|
|
26 b[i] = i;
|
|
|
27 c[i] = 0.5 + i;
|
|
|
28 if (y)
|
|
|
29 abort ();
|
|
|
30 }
|
|
|
31 for (; i < N+4; i++)
|
|
|
32 {
|
|
|
33 b[i] = i;
|
|
|
34 if (y)
|
|
|
35 abort ();
|
|
|
36 }
|
|
|
37
|
|
|
38 for (i = 0; i < N; i++)
|
|
|
39 {
|
|
|
40 pa[i] = q[i] * pc[i];
|
|
|
41 }
|
|
|
42
|
|
|
43 for (i = 0; i < N; i++)
|
|
|
44 {
|
|
|
45 if (pa[i] != q[i] * pc[i])
|
|
|
46 abort ();
|
|
|
47 }
|
|
|
48
|
|
|
49 return 0;
|
|
|
50 }
|
|
|
51
|
|
|
52 int main (void)
|
|
|
53 {
|
|
|
54 check_vect ();
|
|
|
55
|
|
|
56 main1 (a, b, c);
|
|
|
57
|
|
|
58 return 0;
|
|
|
59 }
|
|
|
60
|
|
|
61 /* Xfail until handling restrict is refined. See pr29145. */
|
|
|
62 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
|
|
63 /* Uncomment when this testcase gets vectorized again:
|
|
|
64 dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 3 "vect" { target vect_no_align } }
|
|
|
65 dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail vect_no_align } }
|
|
|
66 dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail vect_no_align } }
|
|
|
67 */
|
