1 /* { dg-require-effective-target vect_float } */
2 /* { dg-additional-options "-fdump-tree-optimized-details-blocks" } */
9 float fa
[N
] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__
)));
10 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};
11 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};
13 /* Check handling of accesses for which the "initial condition" -
14 the expression that represents the first location accessed - is
15 more involved than just an ssa_name. */
17 __attribute__ ((noinline
)) int
18 main1 (float * __restrict__ pa
, float * __restrict__ pb
, float *__restrict__ pc
)
23 for (i
= 0; i
< N
; i
++)
29 for (i
= 0; i
< N
; i
++)
31 if (pa
[i
] != q
[i
] * pc
[i
])
48 /* For targets that don't support misaligned loads we version for the
49 all three accesses (peeling to align the store will not force the
50 two loads to be aligned). */
52 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
53 /* Uncomment when this testcase gets vectorized again:
54 dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail vect_no_align } }
55 dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail vect_no_align } }
56 dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 3 "vect" { target vect_no_align } }
58 /* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */