Debian Codegraph @

gcc/testsuite/gcc.target/i386/vect-pr115385.c

raw
1 /* { dg-do compile } */
2 /* { dg-options "-O3 -msse4.1 -mno-avx -fdump-tree-vect-details" } */
3
4 void __attribute__((noipa)) foo(unsigned char * __restrict x,
5 unsigned char *y, int n)
6 {
7 for (int i = 0; i < n; ++i)
8 {
9 x[16*i+0] = y[3*i+0];
10 x[16*i+1] = y[3*i+1];
11 x[16*i+2] = y[3*i+2];
12 x[16*i+3] = y[3*i+0];
13 x[16*i+4] = y[3*i+1];
14 x[16*i+5] = y[3*i+2];
15 x[16*i+6] = y[3*i+0];
16 x[16*i+7] = y[3*i+1];
17 x[16*i+8] = y[3*i+2];
18 x[16*i+9] = y[3*i+0];
19 x[16*i+10] = y[3*i+1];
20 x[16*i+11] = y[3*i+2];
21 x[16*i+12] = y[3*i+0];
22 x[16*i+13] = y[3*i+1];
23 x[16*i+14] = y[3*i+2];
24 x[16*i+15] = y[3*i+0];
25 }
26 }
27
28 void __attribute__((noipa)) bar(unsigned char * __restrict x,
29 unsigned char *y, int n)
30 {
31 for (int i = 0; i < n; ++i)
32 {
33 x[16*i+0] = y[5*i+0];
34 x[16*i+1] = y[5*i+1];
35 x[16*i+2] = y[5*i+2];
36 x[16*i+3] = y[5*i+3];
37 x[16*i+4] = y[5*i+4];
38 x[16*i+5] = y[5*i+0];
39 x[16*i+6] = y[5*i+1];
40 x[16*i+7] = y[5*i+2];
41 x[16*i+8] = y[5*i+3];
42 x[16*i+9] = y[5*i+4];
43 x[16*i+10] = y[5*i+0];
44 x[16*i+11] = y[5*i+1];
45 x[16*i+12] = y[5*i+2];
46 x[16*i+13] = y[5*i+3];
47 x[16*i+14] = y[5*i+4];
48 x[16*i+15] = y[5*i+0];
49 }
50 }
51
52 /* { dg-final { scan-tree-dump "Data access with gaps requires scalar epilogue loop" "vect"} } */
53 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 2 "vect"} } */