1 /* { dg-require-effective-target vect_float } */
8 void bar (float *pa
, float *pb
, float *pc
)
13 for (i
= 0; i
< N
; i
++)
15 if (pa
[i
] != (pb
[i
] * pc
[i
]))
22 /* Unaligned pointer accesses, with unknown alignment.
23 The loop bound is known and divisible by the vectorization factor.
25 vect-50.c is similar to this one with one difference:
26 the loop bound is unknown.
27 vect-45.c is similar to this one with one difference:
28 can't prove that pointers don't alias. */
31 main1 (float * __restrict__ pa
, float * __restrict__ pb
, float * __restrict__ pc
)
35 for (i
= 0; i
< N
; i
++)
37 pa
[i
] = pb
[i
] * pc
[i
];
48 float a
[N
+4] __attribute__ ((__aligned__(16)));
49 float b
[N
+4] __attribute__ ((__aligned__(16))) = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57,60,63,66,69};
50 float c
[N
+4] __attribute__ ((__aligned__(16))) = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23};
57 main1 (&a
[1],&b
[1],&c
[1]);
62 /* For targets that don't support misaligned loads we version for the
63 all three accesses (peeling to align the store will not force the
64 two loads to be aligned). */
66 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
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 } } } */
70 /* { dg-final { cleanup-tree-dump "vect" } } */