2018-03-08 Richard Biener <rguenther@suse.de>
[official-gcc.git] / gcc / testsuite / gcc.target / powerpc / vsx-vectorize-3.c
blobb65b1342c31031bdf5839c777648c0c918e8556c
1 /* { dg-do compile { target { powerpc*-*-* && lp64 } } } */
2 /* { dg-skip-if "" { powerpc*-*-darwin* } } */
3 /* { dg-require-effective-target powerpc_vsx_ok } */
4 /* { dg-skip-if "do not override -mcpu" { powerpc*-*-* } { "-mcpu=*" } { "-mcpu=power7" } } */
5 /* { dg-options "-mcpu=power7 -O2 -ftree-vectorize -fno-vect-cost-model -fdump-tree-vect-details" } */
7 /* Taken from vect/vect-95.c. */
8 #include <stdlib.h>
9 #include <stdarg.h>
11 #define N 256
13 __attribute__ ((noinline))
14 void bar (short *pa, short *pb, short *pc)
16 int i;
18 /* check results: */
19 for (i = 0; i < N; i++)
21 if (pa[i] != (pb[i] * pc[i]))
22 abort ();
25 return;
29 __attribute__ ((noinline)) int
30 main1 (int n, short * __restrict__ pa, short * __restrict__ pb, short * __restrict__ pc)
32 int i;
34 for (i = 0; i < n; i++)
36 pa[i] = pb[i] * pc[i];
39 bar (pa,pb,pc);
41 return 0;
44 int main (void)
46 int i;
47 short a[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
48 short b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57};
49 short c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19};
51 main1 (N,a,b,c);
52 main1 (N-2,a,b,c);
54 return 0;
57 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
58 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" } } */
59 /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 0 "vect" } } */
60 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" } } */