* tree-loop-distribution.c (struct partition): New field recording
[official-gcc.git] / gcc / testsuite / gcc.dg / vect / slp-11b.c
blob0cc23770badf0e00ef98769a2dd14a92dca32cca
1 /* { dg-require-effective-target vect_int } */
3 #include <stdarg.h>
4 #include "tree-vect.h"
6 #define N 8
8 int
9 main1 ()
11 int i;
12 unsigned int out[N*8], a0, a1, a2, a3, a4, a5, a6, a7, b1, b0, b2, b3, b4, b5, b6, b7;
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};
15 /* Requires permutation - not SLPable. */
16 for (i = 0; i < N*2; i++)
18 out[i*4] = (in[i*4] + 2) * 3;
19 out[i*4 + 1] = (in[i*4 + 2] + 2) * 7;
20 out[i*4 + 2] = (in[i*4 + 1] + 7) * 3;
21 out[i*4 + 3] = (in[i*4 + 3] + 3) * 4;
24 /* check results: */
25 for (i = 0; i < N*2; i++)
27 if (out[i*4] != (in[i*4] + 2) * 3
28 || out[i*4 + 1] != (in[i*4 + 2] + 2) * 7
29 || out[i*4 + 2] != (in[i*4 + 1] + 7) * 3
30 || out[i*4 + 3] != (in[i*4 + 3] + 3) * 4)
31 abort ();
34 return 0;
37 int main (void)
39 check_vect ();
41 main1 ();
43 return 0;
46 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_strided4 && vect_int_mult } } } } */
47 /* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" { target { ! { vect_strided4 && vect_int_mult } } } } } */
48 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect" } } */