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 /* Check handling of accesses for which the "initial condition" -
|
|
13 the expression that represents the first location accessed - is
|
|
14 more involved than just an ssa_name. */
|
|
15
|
|
16 __attribute__ ((noinline)) int
|
|
17 main1 (float * __restrict__ pa, float * __restrict__ pb, float *__restrict__ pc)
|
|
18 {
|
|
19 int i;
|
|
20 float *q = pb + 4;
|
|
21
|
|
22 for (i = 0; i < N; i++)
|
|
23 {
|
|
24 pa[i] = q[i] * pc[i];
|
|
25 }
|
|
26
|
|
27 for (i = 0; i < N; i++)
|
|
28 {
|
|
29 if (pa[i] != q[i] * pc[i])
|
|
30 abort();
|
|
31 }
|
|
32
|
|
33 return 0;
|
|
34 }
|
|
35
|
|
36
|
|
37 int main (void)
|
|
38 {
|
|
39 check_vect ();
|
|
40
|
|
41 main1 (fa, fb, fc);
|
|
42
|
|
43 return 0;
|
|
44 }
|
|
45
|
|
46 /* For targets that don't support misaligned loads we version for the
|
|
47 all three accesses (peeling to align the store will not force the
|
|
48 two loads to be aligned). */
|
|
49
|
|
50 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
|
51 /* Uncomment when this testcase gets vectorized again:
|
|
52 dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail vect_no_align } }
|
|
53 dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail vect_no_align } }
|
|
54 dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 3 "vect" { target vect_no_align } }
|
|
55 */
|