1 /* { dg-require-effective-target vect_float } */
8 float fa[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
9 float fb[N+4] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
10 float fc[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
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. */
18 __attribute__ ((noinline)) int
19 main1 (float * __restrict__ pa, float * __restrict__ pb, float *__restrict__ pc)
23 for (i = 0; i < N; i++)
37 for (i = 0; i < N; i++)
42 for (i = 0; i < N; i++)
44 if (pa[i] != q[i] * pc[i])
61 /* For targets that don't support misaligned loads we version for the
62 all three accesses (peeling to align the store will not force the
63 two loads to be aligned). */
65 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
66 /* Uncomment when this testcase gets vectorized again:
67 dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail vect_no_align } }
68 dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail vect_no_align } }
69 dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 3 "vect" { target vect_no_align } }
71 /* { dg-final { cleanup-tree-dump "vect" } } */