File: reassoc-2.c

package info (click to toggle)
gcc-arm-none-eabi 15%3A8-2019-q3-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 571,828 kB
  • sloc: ansic: 2,937,651; cpp: 881,644; ada: 597,189; makefile: 65,528; asm: 56,499; xml: 46,621; exp: 24,747; sh: 19,684; python: 7,256; pascal: 4,370; awk: 3,497; perl: 2,695; yacc: 316; ml: 285; f90: 234; lex: 198; objc: 194; haskell: 119
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 *-*-* } } } */