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