Mercurial > hg > CbC > CbC_gcc

comparison gcc/testsuite/gcc.dg/vect/slp-34.c @ 111:04ced10e8804

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
gcc 7
author kono
date Fri, 27 Oct 2017 22:46:09 +0900
parents
children
comparison
equal deleted inserted replaced
68:561a7518be6b 111:04ced10e8804
1 /* { dg-require-effective-target vect_int } */
2
3 #include <stdarg.h>
4 #include "tree-vect.h"
5
6 #define N 8
7
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};
9 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};
10
11 int
12 main1 ()
13 {
14 int i;
15 unsigned short out[N*8];
16 unsigned short out2[N*8];
17
18 /* SLP with unrolling by 8. */
19 for (i = 0; i < N; i++)
20 {
21 out[i*3] = in[i*3] + 5;
22 out[i*3 + 1] = in[i*3 + 1] + 6;
23 out[i*3 + 2] = in[i*3 + 2] + 16;
24
25 out2[i*5] = in2[i*5] + 2;
26 out2[i*5 + 1] = in2[i*5 + 1] + 2;
27 out2[i*5 + 2] = in2[i*5 + 2] + 1;
28 out2[i*5 + 3] = in2[i*5 + 3] + 3;
29 out2[i*5 + 4] = in2[i*5 + 4] + 13;
30 }
31
32 /* check results: */
33 for (i = 0; i < N; i++)
34 {
35 if (out[i*3] != in[i*3] + 5
36 || out[i*3 + 1] != in[i*3 + 1] + 6
37 || out[i*3 + 2] != in[i*3 + 2] + 16
38 || out2[i*5] != in2[i*5] + 2
39 || out2[i*5 + 1] != in2[i*5 + 1] + 2
40 || out2[i*5 + 2] != in2[i*5 + 2] + 1
41 || out2[i*5 + 3] != in2[i*5 + 3] + 3
42 || out2[i*5 + 4] != in2[i*5 + 4] + 13)
43 abort ();
44 }
45
46 return 0;
47 }
48
49 int main (void)
50 {
51 check_vect ();
52
53 main1 ();
54
55 return 0;
56 }
57
58 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
59 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 2 "vect" } } */
60