URL
https://opencores.org/ocsvn/openrisc_me/openrisc_me/trunk
Subversion Repositories openrisc_me
[/] [openrisc/] [trunk/] [gnu-src/] [gcc-4.5.1/] [gcc/] [testsuite/] [gcc.dg/] [vect/] [slp-13.c] - Rev 298
Compare with Previous | Blame | View Log
/* { dg-require-effective-target vect_int } */ #include <stdarg.h> #include <stdio.h> #include "tree-vect.h" #define N 8 int main1 () { int i; unsigned short out[N*8]; unsigned short in[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}; unsigned int 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}; unsigned int out2[N*8]; /* Induction is not SLPable yet. */ for (i = 0; i < N; i++) { out[i*8] = in[i*8] + i; out[i*8 + 1] = in[i*8 + 1] + i; out[i*8 + 2] = in[i*8 + 2] + i; out[i*8 + 3] = in[i*8 + 3] + i; out[i*8 + 4] = in[i*8 + 4] + i; out[i*8 + 5] = in[i*8 + 5] + i; out[i*8 + 6] = in[i*8 + 6] + i; out[i*8 + 7] = in[i*8 + 7] + i; } /* check results: */ for (i = 0; i < N; i++) { if (out[i*8] != in[i*8] + i || out[i*8 + 1] != in[i*8 + 1] + i || out[i*8 + 2] != in[i*8 + 2] + i || out[i*8 + 3] != in[i*8 + 3] + i || out[i*8 + 4] != in[i*8 + 4] + i || out[i*8 + 5] != in[i*8 + 5] + i || out[i*8 + 6] != in[i*8 + 6] + i || out[i*8 + 7] != in[i*8 + 7] + i) abort (); } /* Induction is not SLPable yet and strided group size must be a power of 2 to get vectorized. */ for (i = 0; i < N/2; i++) { out2[i*12] = in2[i*12] + i; out2[i*12 + 1] = in2[i*12 + 1] + i; out2[i*12 + 2] = in2[i*12 + 2] + i; out2[i*12 + 3] = in2[i*12 + 3] + i; out2[i*12 + 4] = in2[i*12 + 4] + i; out2[i*12 + 5] = in2[i*12 + 5] + i; out2[i*12 + 6] = in2[i*12 + 6] + i; out2[i*12 + 7] = in2[i*12 + 7] + i; out2[i*12 + 8] = in2[i*12 + 8] + i; out2[i*12 + 9] = in2[i*12 + 9] + i; out2[i*12 + 10] = in2[i*12 + 10] + i; out2[i*12 + 11] = in2[i*12 + 11] + i; } /* check results: */ for (i = 0; i < N/2; i++) { if (out2[i*12] != in2[i*12] + i || out2[i*12 + 1] != in2[i*12 + 1] + i || out2[i*12 + 2] != in2[i*12 + 2] + i || out2[i*12 + 3] != in2[i*12 + 3] + i || out2[i*12 + 4] != in2[i*12 + 4] + i || out2[i*12 + 5] != in2[i*12 + 5] + i || out2[i*12 + 6] != in2[i*12 + 6] + i || out2[i*12 + 7] != in2[i*12 + 7] + i || out2[i*12 + 8] != in2[i*12 + 8] + i || out2[i*12 + 9] != in2[i*12 + 9] + i || out2[i*12 + 10] != in2[i*12 + 10] + i || out2[i*12 + 11] != in2[i*12 + 11] + i) abort (); } /* Not power of 2 but SLPable. */ for (i = 0; i < N/2; i++) { out2[i*12] = in2[i*12] + 1; out2[i*12 + 1] = in2[i*12 + 1] + 2; out2[i*12 + 2] = in2[i*12 + 2] + 3; out2[i*12 + 3] = in2[i*12 + 3] + 4; out2[i*12 + 4] = in2[i*12 + 4] + 5; out2[i*12 + 5] = in2[i*12 + 5] + 6; out2[i*12 + 6] = in2[i*12 + 6] + 7; out2[i*12 + 7] = in2[i*12 + 7] + 8; out2[i*12 + 8] = in2[i*12 + 8] + 9; out2[i*12 + 9] = in2[i*12 + 9] + 10; out2[i*12 + 10] = in2[i*12 + 10] + 11; out2[i*12 + 11] = in2[i*12 + 11] + 12; } /* check results: */ for (i = 0; i < N/2; i++) { if (out2[i*12] != in2[i*12] + 1 || out2[i*12 + 1] != in2[i*12 + 1] + 2 || out2[i*12 + 2] != in2[i*12 + 2] + 3 || out2[i*12 + 3] != in2[i*12 + 3] + 4 || out2[i*12 + 4] != in2[i*12 + 4] + 5 || out2[i*12 + 5] != in2[i*12 + 5] + 6 || out2[i*12 + 6] != in2[i*12 + 6] + 7 || out2[i*12 + 7] != in2[i*12 + 7] + 8 || out2[i*12 + 8] != in2[i*12 + 8] + 9 || out2[i*12 + 9] != in2[i*12 + 9] + 10 || out2[i*12 + 10] != in2[i*12 + 10] + 11 || out2[i*12 + 11] != in2[i*12 + 11] + 12) abort (); } return 0; } int main (void) { check_vect (); main1 (); return 0; } /* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" { target { vect_interleave && vect_extract_even_odd } } } } */ /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 3 "vect" { xfail *-*-* } } } */ /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" } } */ /* { dg-final { cleanup-tree-dump "vect" } } */