1 /* Disabling epilogues until we find a better way to deal with scans. */
2 /* { dg-additional-options "--param vect-epilogues-nomask=0 -fdump-tree-optimized-details-blocks" } */
3 /* { dg-require-effective-target vect_float } */
4 /* { dg-add-options double_vectors } */
11 __attribute__ ((noinline
))
12 void bar (float *pa
, float *pb
, float *pc
)
18 for (i
= 0; i
< N
/2; i
++)
20 if (pa
[i
+1] != (pb
[i
+1] * pc
[i
+1]))
27 /* Unaligned pointer accesses, with a known alignment.
28 The loop bound is known and divisible by the vectorization factor.
30 vect-58.c is similar to this one with one difference:
31 the loop bound is unknown. */
33 float b
[N
] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__
))) = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57};
34 float c
[N
] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__
))) = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19};
36 __attribute__ ((noinline
)) int
40 float a
[N
] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__
)));
45 for (i
= 0; i
< N
/2; i
++)
47 pa
[i
+1] = pb
[i
+1] * pc
[i
+1];
65 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
66 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" { xfail { ! vect_align_stack_vars } } } } */
67 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail vect_element_align_preferred } } } */
68 /* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */