|
111
|
1 /* { dg-require-effective-target vect_float } */
|
|
|
2 /* { dg-additional-options "--param vect-max-peeling-for-alignment=0" } */
|
|
|
3
|
|
|
4 #include "tree-vect.h"
|
|
|
5
|
|
|
6 #define N 256
|
|
|
7
|
|
|
8 __attribute__ ((noinline))
|
|
|
9 void bar (float *pa, float *pb, float *pc)
|
|
|
10 {
|
|
|
11 int i;
|
|
|
12
|
|
|
13 /* check results: */
|
|
|
14 for (i = 0; i < N; i++)
|
|
|
15 {
|
|
|
16 if (pa[i] != (pb[i] * pc[i]))
|
|
|
17 abort ();
|
|
|
18 }
|
|
|
19
|
|
|
20 return;
|
|
|
21 }
|
|
|
22
|
|
|
23 /* Unaligned pointer accesses, with unknown alignment.
|
|
|
24 The loop bound is known and divisible by the vectorization factor.
|
|
|
25 No aliasing problems.
|
|
|
26 vect-50.c is similar to this one with one difference:
|
|
|
27 the loop bound is unknown.
|
|
|
28 vect-45.c is similar to this one with one difference:
|
|
|
29 can't prove that pointers don't alias. */
|
|
|
30
|
|
|
31 __attribute__ ((noinline)) int
|
|
|
32 main1 (float * __restrict__ pa, float * __restrict__ pb, float * __restrict__ pc)
|
|
|
33 {
|
|
|
34 int i;
|
|
|
35
|
|
|
36 for (i = 0; i < N; i++)
|
|
|
37 {
|
|
|
38 pa[i] = pb[i] * pc[i];
|
|
|
39 }
|
|
|
40
|
|
|
41 bar (pa,pb,pc);
|
|
|
42
|
|
|
43 return 0;
|
|
|
44 }
|
|
|
45
|
|
|
46 int main (void)
|
|
|
47 {
|
|
|
48 int i;
|
|
|
49 float a[N+4] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
|
|
|
50 float b[N+4] __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,63,66,69};
|
|
|
51 float c[N+4] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23};
|
|
|
52
|
|
|
53 check_vect ();
|
|
|
54
|
|
|
55 main1 (a,b,c);
|
|
|
56 main1 (&a[1],b,c);
|
|
|
57 main1 (a,&b[1],c);
|
|
|
58 main1 (&a[1],&b[1],&c[1]);
|
|
|
59
|
|
|
60 return 0;
|
|
|
61 }
|
|
|
62
|
|
|
63 /* For targets that don't support misaligned loads we version for the
|
|
|
64 all three accesses (peeling to align the store will not force the
|
|
|
65 two loads to be aligned). */
|
|
|
66
|
|
|
67 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
|
131
|
68 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 3 "vect" { xfail { ! vect_unaligned_possible } } } } */
|
|
111
|
69 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" { xfail { { vect_no_align && { ! vect_hw_misalign } } || {! vector_alignment_reachable} } } } } */
|
|
|
70 /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 3 "vect" { target { vect_no_align && { ! vect_hw_misalign } } } } } */
|
|
|
71 /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 1 "vect" { target { {! vector_alignment_reachable} && {{! vect_no_align} && {! vect_hw_misalign} } } } } } */
|
