Mercurial > hg > CbC > CbC_gcc
comparison gcc/testsuite/gcc.dg/vect/vect-50.c @ 111:04ced10e8804
gcc 7
author | kono |
---|---|
date | Fri, 27 Oct 2017 22:46:09 +0900 |
parents | |
children | 84e7813d76e9 |
comparison
equal
deleted
inserted
replaced
68:561a7518be6b | 111:04ced10e8804 |
---|---|
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 __attribute__ ((noinline)) int | |
24 main1 (int n, float * __restrict__ pa, float * __restrict__ pb, float * __restrict__ pc) | |
25 { | |
26 int i; | |
27 | |
28 for (i = 0; i < n; i++) | |
29 { | |
30 pa[i] = pb[i] * pc[i]; | |
31 } | |
32 | |
33 bar (pa,pb,pc); | |
34 | |
35 return 0; | |
36 } | |
37 | |
38 /* Unaligned pointer accesses, with unknown alignment. | |
39 The loop bound is unknown. | |
40 No aliasing problems. | |
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. */ | |
45 | |
46 int main (void) | |
47 { | |
48 int i; | |
49 float a[N]; | |
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}; | |
52 | |
53 check_vect (); | |
54 | |
55 main1 (N,a,b,c); | |
56 return 0; | |
57 } | |
58 | |
59 /* For targets that don't support misaligned loads and don't support | |
60 misaligned stores we version for the all three accesses (peeling to | |
61 align the store will not force the two loads to be aligned). */ | |
62 | |
63 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */ | |
64 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 3 "vect" { xfail { vect_no_align && { ! vect_hw_misalign } } } } } */ | |
65 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 3 "vect" { target vect_hw_misalign } } } */ | |
66 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" { xfail { { vect_no_align && { ! vect_hw_misalign } } || {! vector_alignment_reachable} } } } } */ | |
67 /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 3 "vect" { target { vect_no_align && { ! vect_hw_misalign } } } } } */ | |
68 /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 1 "vect" { target { {! vector_alignment_reachable} && { {! vect_no_align } && {! vect_hw_misalign } } } } } } */ |