1 /* { dg-require-effective-target vect_int } */
9 unsigned short in[N] = {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};
10 unsigned short in2[N] = {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};
11 unsigned short in3[N] = {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};
12 unsigned short check[N] = {0,1,2,3,5,6,7,8,10,11,12,13,15,16,17,18,20,21,22,23,25,26,27,28,30,31,32,33,35,36,37,38};
13 unsigned short check3[N] = {0,1,2,3,4,5,6,7,8,9,10,11,5,6,7,8,9,10,11,12,13,14,15,16,10,11,12,13,14,15,16,17};
20 for (i = 0; i < N/4; i++)
22 in[i*4] = in[i*4] + 5;
23 in[i*4 + 1] = in[i*4 + 1] + 5;
24 in[i*4 + 2] = in[i*4 + 2] + 5;
25 in[i*4 + 3] = in[i*4 + 3] + 5;
30 for (i = 0; i < N; i++)
36 /* Not vectorizable because of data dependencies. */
37 for (i = 1; i < N/4; i++)
39 in2[i*4] = in2[(i-1)*4] + 5;
40 in2[i*4 + 1] = in2[(i-1)*4 + 1] + 5;
41 in2[i*4 + 2] = in2[(i-1)*4 + 2] + 5;
42 in2[i*4 + 3] = in2[(i-1)*4 + 3] + 5;
47 for (i = 4; i < N; i++)
49 if (in2[i] != check[i])
53 /* Not vectorizable because of data dependencies: distance 3 is greater than
54 the actual VF with SLP (2), but the analysis fail to detect that for now. */
55 for (i = 3; i < N/4; i++)
57 in3[i*4] = in3[(i-3)*4] + 5;
58 in3[i*4 + 1] = in3[(i-3)*4 + 1] + 5;
59 in3[i*4 + 2] = in3[(i-3)*4 + 2] + 5;
60 in3[i*4 + 3] = in3[(i-3)*4 + 3] + 5;
65 for (i = 12; i < N; i++)
67 if (in3[i] != check3[i])
84 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
85 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" } } */
86 /* { dg-final { cleanup-tree-dump "vect" } } */