Remove outermost loop parameter.
[official-gcc/graphite-test-results.git] / gcc / testsuite / gcc.dg / vect / slp-6.c
blob672b1d6e28abac387396dd15b627f70c65a54dad
1 /* { dg-require-effective-target vect_int } */
3 #include <stdarg.h>
4 #include <stdio.h>
5 #include "tree-vect.h"
7 #define N 8
9 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};
10 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};
12 int
13 main1 ()
15 int i;
16 unsigned short out[N*8];
17 unsigned int out2[N*8];
19 for (i = 0; i < N; i++)
21 out[i*8] = in[i*8] + 5;
22 out[i*8 + 1] = in[i*8 + 1] + 6;
23 out[i*8 + 2] = in[i*8 + 2] + 7;
24 out[i*8 + 3] = in[i*8 + 3] + 8;
25 out[i*8 + 4] = in[i*8 + 4] + 9;
26 out[i*8 + 5] = in[i*8 + 5] + 10;
27 out[i*8 + 6] = in[i*8 + 6] + 11;
28 out[i*8 + 7] = in[i*8 + 7] + 12;
31 /* check results: */
32 for (i = 0; i < N; i++)
34 if (out[i*8] != in[i*8] + 5
35 || out[i*8 + 1] != in[i*8 + 1] + 6
36 || out[i*8 + 2] != in[i*8 + 2] + 7
37 || out[i*8 + 3] != in[i*8 + 3] + 8
38 || out[i*8 + 4] != in[i*8 + 4] + 9
39 || out[i*8 + 5] != in[i*8 + 5] + 10
40 || out[i*8 + 6] != in[i*8 + 6] + 11
41 || out[i*8 + 7] != in[i*8 + 7] + 12)
42 abort ();
45 for (i = 0; i < N*2; i++)
47 out[i*4] = in[i*4] + 2;
48 out[i*4 + 1] = in[i*4 + 1] + 2;
49 out[i*4 + 2] = in[i*4 + 2] + 1;
50 out[i*4 + 3] = in[i*4 + 3] + 3;
53 /* check results: */
54 for (i = 0; i < N*2; i++)
56 if (out[i*4] != in[i*4] + 2
57 || out[i*4 + 1] != in[i*4 + 1] + 2
58 || out[i*4 + 2] != in[i*4 + 2] + 1
59 || out[i*4 + 3] != in[i*4 + 3] + 3)
60 abort ();
63 for (i = 0; i < N/2; i++)
65 out2[i*16] = in2[i*16] * 2;
66 out2[i*16 + 1] = in2[i*16 + 1] * 3;
67 out2[i*16 + 2] = in2[i*16 + 2] * 4;
68 out2[i*16 + 3] = in2[i*16 + 3] * 3;
69 out2[i*16 + 4] = in2[i*16 + 4] * 2;
70 out2[i*16 + 5] = in2[i*16 + 5] * 3;
71 out2[i*16 + 6] = in2[i*16 + 6] * 2;
72 out2[i*16 + 7] = in2[i*16 + 7] * 4;
73 out2[i*16 + 8] = in2[i*16 + 8] * 2;
74 out2[i*16 + 9] = in2[i*16 + 9] * 5;
75 out2[i*16 + 10] = in2[i*16 + 10] * 2;
76 out2[i*16 + 11] = in2[i*16 + 11] * 3;
77 out2[i*16 + 12] = in2[i*16 + 12] * 4;
78 out2[i*16 + 13] = in2[i*16 + 13] * 4;
79 out2[i*16 + 14] = in2[i*16 + 14] * 3;
80 out2[i*16 + 15] = in2[i*16 + 15] * 2;
83 /* check results: */
84 for (i = 0; i < N/2; i++)
86 if (out2[i*16] != in2[i*16] * 2
87 || out2[i*16 + 1] != in2[i*16 + 1] * 3
88 || out2[i*16 + 2] != in2[i*16 + 2] * 4
89 || out2[i*16 + 3] != in2[i*16 + 3] * 3
90 || out2[i*16 + 4] != in2[i*16 + 4] * 2
91 || out2[i*16 + 5] != in2[i*16 + 5] * 3
92 || out2[i*16 + 6] != in2[i*16 + 6] * 2
93 || out2[i*16 + 7] != in2[i*16 + 7] * 4
94 || out2[i*16 + 8] != in2[i*16 + 8] * 2
95 || out2[i*16 + 9] != in2[i*16 + 9] * 5
96 || out2[i*16 + 10] != in2[i*16 + 10] * 2
97 || out2[i*16 + 11] != in2[i*16 + 11] * 3
98 || out2[i*16 + 12] != in2[i*16 + 12] * 4
99 || out2[i*16 + 13] != in2[i*16 + 13] * 4
100 || out2[i*16 + 14] != in2[i*16 + 14] * 3
101 || out2[i*16 + 15] != in2[i*16 + 15] * 2)
102 abort ();
106 return 0;
109 int main (void)
111 check_vect ();
113 main1 ();
115 return 0;
118 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" {target vect_int_mult} } } */
119 /* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" {target { ! { vect_int_mult } } } } } */
120 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 3 "vect" {target vect_int_mult } } } */
121 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 2 "vect" {target { ! { vect_int_mult } } } } } */
122 /* { dg-final { cleanup-tree-dump "vect" } } */