Mercurial > hg > CbC > CbC_gcc
view gcc/testsuite/gcc.dg/vect/no-tree-pre-slp-29.c @ 131:84e7813d76e9
gcc-8.2
author | mir3636 |
---|---|
date | Thu, 25 Oct 2018 07:37:49 +0900 |
parents | 04ced10e8804 |
children |
line wrap: on
line source
/* { dg-require-effective-target vect_int } */ #include <stdarg.h> #include "tree-vect.h" #define N 8 unsigned short in2[N*8] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63}; int main1 (unsigned short *in) { int i; unsigned short out[N*8]; for (i = 0; i < N; i++) { out[i*4] = in[i*4]; out[i*4 + 1] = in[i*4 + 1]; out[i*4 + 2] = in[i*4 + 2]; out[i*4 + 3] = in[i*4 + 3]; } /* check results: */ for (i = 0; i < N; i++) { if (out[i*4] != in[i*4] || out[i*4 + 1] != in[i*4 + 1] || out[i*4 + 2] != in[i*4 + 2] || out[i*4 + 3] != in[i*4 + 3]) abort (); } return 0; } int main2 (unsigned short * __restrict__ in, unsigned short * __restrict__ out) { int i; for (i = 0; i < N; i++) { out[i*4] = in[i*4]; out[i*4 + 1] = in[i*4 + 1]; out[i*4 + 2] = in[i*4 + 2]; out[i*4 + 3] = in[i*4 + 3]; } /* check results: */ for (i = 0; i < N; i++) { if (out[i*4] != in[i*4] || out[i*4 + 1] != in[i*4 + 1] || out[i*4 + 2] != in[i*4 + 2] || out[i*4 + 3] != in[i*4 + 3]) abort (); } return 0; } int main (void) { unsigned short out[N*8]; check_vect (); main1 (&in2[5]); main2 (&in2[3], &out[3]); return 0; } /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 2 "vect" } } */ /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 2 "vect" } } */