1 /* { dg-require-effective-target vect_int } */
10 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};
11 unsigned int in2[N*16] = {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 unsigned int out2[N*16];
18 unsigned int a0, a1, a2, a3, a4, a5, a6, a7, b1, b0, b2, b3, b4, b5, b6, b7;
20 /* SLP group of size that is not a multiple of vector size.
22 for (i = 0; i < N; i++)
31 out[i*2 + 1] = b1 - 3;
33 out2[i*6] = in2[i*6] * 2;
34 out2[i*6 + 1] = in2[i*6 + 1] * 3;
35 out2[i*6 + 2] = in2[i*6 + 2] * 4;
36 out2[i*6 + 3] = in2[i*6 + 3] * 2;
37 out2[i*6 + 4] = in2[i*6 + 4] * 4;
38 out2[i*6 + 5] = in2[i*6 + 5] * 3;
42 for (i = 0; i < N; i++)
44 if (out[i*2] != (in[i*2] + 5) * 3 - 2
45 || out[i*2 + 1] != (in[i*2 + 1] + 6) * 2 - 3
46 || out2[i*6] != in2[i*6] * 2
47 || out2[i*6 + 1] != in2[i*6 + 1] * 3
48 || out2[i*6 + 2] != in2[i*6 + 2] * 4
49 || out2[i*6 + 3] != in2[i*6 + 3] * 2
50 || out2[i*6 + 4] != in2[i*6 + 4] * 4
51 || out2[i*6 + 5] != in2[i*6 + 5] * 3)
69 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_int_mult } } } */
70 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 2 "vect" { target vect_int_mult } } } */
71 /* { dg-final { cleanup-tree-dump "vect" } } */