Mercurial > hg > CbC > CbC_gcc

comparison gcc/testsuite/gcc.dg/vect/slp-19c.c @ 131:84e7813d76e9

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
gcc-8.2
author mir3636
date Thu, 25 Oct 2018 07:37:49 +0900
parents 04ced10e8804
children
comparison
equal deleted inserted replaced
111:04ced10e8804 131:84e7813d76e9
1 /* { dg-require-effective-target vect_int } */ 1 /* { dg-require-effective-target vect_int } */
2 2
3 #include <stdarg.h> 3 #include <stdarg.h>
4 #include "tree-vect.h" 4 #include "tree-vect.h"
5 5
6 #if VECTOR_BITS > 128
7 #define N (VECTOR_BITS * 2 / 32)
8 #else
6 #define N 16 9 #define N 16
10 #endif
7 11
8 int 12 int
9 main1 () 13 main1 ()
10 { 14 {
11 unsigned int i; 15 unsigned int i;
12 unsigned int out[N*8]; 16 unsigned int out[N*8];
17 #if N == 16
13 unsigned int 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,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}; 18 unsigned int 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,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};
19 #else
20 unsigned int in[N * 8];
21 for (unsigned int i = 0; i < N * 8; ++i)
22 {
23 in[i] = i & 63;
24 asm volatile ("" ::: "memory");
25 }
26 #endif
14 unsigned int ia[N*2], a0, a1, a2, a3; 27 unsigned int ia[N*2], a0, a1, a2, a3;
15 28
16 /* The last stmt requires interleaving of not power of 2 size - not 29 /* The last stmt requires interleaving of not power of 2 size - not
17 vectorizable. */ 30 vectorizable. */
18 for (i = 0; i < N/2; i++) 31 for (i = 0; i < N/2; i++)