File: reassoc-2.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 (19 lines) | stat: -rw-r--r-- 539 bytes parent folder | download | duplicates (6) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
 
/* { dg-do compile } */
/* { dg-options "-O2 -fdump-tree-optimized" } */

int f (int a0,int a1,int a2,int a3,int a4) 
{ 
int b0, b1, b2, b3, b4,e; 
  /* this can be optimized to four additions... */ 
  b4 = a4 + a3 + a2 + a1 + a0; 
  b3 = a3 + a2 + a1 + a0; 
  b2 = a2 + a1 + a0; 
  b1 = a1 + a0; 
  /* This is actually 0 */
  e = b4 - b3 + b2 - b1 - a4 - a2;
  return e;
}

/* We can't reassociate the expressions due to undefined signed overflow.  */

/* { dg-final { scan-tree-dump-times "return 0" 1 "optimized" { xfail *-*-* } } } */