File: bb-slp-layout-11.c

package info (click to toggle)
gcc-arm-none-eabi 15%3A14.2.rel1-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,099,328 kB
  • sloc: cpp: 3,627,108; ansic: 2,571,498; ada: 834,230; f90: 235,082; makefile: 79,231; asm: 74,984; xml: 51,692; exp: 39,736; sh: 33,298; objc: 15,629; python: 15,069; fortran: 14,429; pascal: 7,003; awk: 5,070; perl: 3,106; ml: 285; lisp: 253; lex: 204; haskell: 135
file content (34 lines) | stat: -rw-r--r-- 860 bytes parent folder | download 
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
 
/* { dg-do compile } */
/* { dg-additional-options "-fno-tree-loop-vectorize" } */

int a[4], b[4], c[400], d[400];

void f1()
{
  int a0 = a[0] - b[0];
  int a1 = a[1] + b[1];
  int a2 = a[2] - b[2];
  int a3 = a[3] + b[3];
  int b0 = a0;
  int b1 = a1;
  int b2 = a2;
  int b3 = a3;
  for (int i = 0; i < 100; ++i)
    {
      a0 += c[i * 4 + 1];
      a1 += c[i * 4 + 0];
      a2 += c[i * 4 + 3];
      a3 += c[i * 4 + 2];
      b0 ^= d[i * 4 + 3];
      b1 ^= d[i * 4 + 2];
      b2 ^= d[i * 4 + 1];
      b3 ^= d[i * 4 + 0];
    }
  a[0] = a0 ^ b0;
  a[1] = a1 ^ b1;
  a[2] = a2 ^ b2;
  a[3] = a3 ^ b3;
}

/* { dg-final { scan-tree-dump-times "add new stmt: \[^\\n\\r\]* = VEC_PERM_EXPR" 4 "slp1" { target { vect_int && vect_perm } } } } */
/* { dg-final { scan-tree-dump "duplicating permutation node" "slp1" { target { vect_int && vect_perm } } } } */