1 /* { dg-require-effective-target vect_float } */
2 /* { dg-add-options double_vectors } */
9 /* Unaligned pointer read accesses, aligned write access.
10 The loop bound is known and divisible by the vectorization factor.
12 vect-56.c is similar to this one with one difference:
13 the alignment of the read accesses is known.
14 vect-52.c is similar to this one with one difference:
15 the loop bound is unknown.
16 vect-49.c is similar to this one with one difference:
17 aliasing is a problem. */
19 __attribute__ ((noinline
)) int
20 main1 (float *pb
, float *pc
)
22 float pa
[N
] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__
)));
25 for (i
= 0; i
< N
; i
++)
27 pa
[i
] = pb
[i
] * pc
[i
];
31 for (i
= 0; i
< N
; i
++)
33 if (pa
[i
] != (pb
[i
] * pc
[i
]))
43 float b
[N
+1] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__
))) = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57,60};
44 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};
54 /* For targets that don't support misaligned loads we version for the two loads.
55 (The store is aligned). */
57 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
58 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 3 "vect" { target { ! vect_align_stack_vars } xfail { ! vect_unaligned_possible } } } } */
59 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { target vect_align_stack_vars xfail { ! vect_unaligned_possible } } } } */
60 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" } } */
61 /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 2 "vect" { target { vect_no_align && { ! vect_hw_misalign } } } } } */