1 /* { dg-require-effective-target vect_float } */
8 __attribute__ ((noinline
))
9 void bar (float *pa
, float *pb
, float *pc
)
14 for (i
= 0; i
< N
; i
++)
16 if (pa
[i
] != (pb
[i
] * pc
[i
]))
23 __attribute__ ((noinline
)) int
24 main1 (int n
, float * __restrict__ pa
, float * __restrict__ pb
, float * __restrict__ pc
)
28 for (i
= 0; i
< n
; i
++)
30 pa
[i
] = pb
[i
] * pc
[i
];
38 /* Unaligned pointer accesses, with unknown alignment.
39 The loop bound is unknown.
41 vect-44.c is similar to this one with one difference:
42 the loop bound is known.
43 vect-51.c is similar to this one with one difference:
44 can't prove that pointers don't alias. */
50 float b
[N
] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57};
51 float c
[N
] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19};
59 /* For targets that don't support misaligned loads we version for the
60 all three accesses (peeling to align the store will not force the
61 two loads to be aligned). */
63 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
64 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail vect_no_align } } } */
65 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail { vect_no_align || {! vector_alignment_reachable} } } } } */
66 /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 3 "vect" { target vect_no_align } } } */
67 /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 1 "vect" { target { {! vector_alignment_reachable} && {! vect_no_align} } } } } */
68 /* { dg-final { cleanup-tree-dump "vect" } } */