File: ssa-sccvn-4.c

package info (click to toggle)
gcc-arm-none-eabi 15%3A7-2018-q2-5
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 539,188 kB
  • sloc: ansic: 2,739,935; cpp: 848,238; ada: 602,637; makefile: 62,919; asm: 55,635; xml: 46,238; exp: 23,020; sh: 19,616; python: 6,371; pascal: 3,889; awk: 3,278; perl: 2,691; yacc: 316; ml: 285; f90: 234; lex: 198; objc: 194; haskell: 119
file content (26 lines) | stat: -rw-r--r-- 566 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
20
21
22
23
24
25
26
 
/* { dg-do compile } */ 
/* { dg-options "-O2 -fdump-tree-fre1-stats" } */

int vnum_test8(int *data) 
{ 
  int i; 
  int stop = data[3]; 
  int m = data[4]; 
  int n = m; 
  int p = 0;

  for (i=0; i<stop; i++) { 
    int k = data[2]; 
    data[5] = 0;
    if (i < 30)
      data[5] = m - n;
    p = data[5];
    k = data[1]; 
    m = m + k; 
    n = n + k; 
  } 
  return p;
} 
/* We should eliminate m - n, n + k, set data[5] = 0, eliminate the
   address arithmetic for data[5], and set p = 0.
/* { dg-final { scan-tree-dump-times "Eliminated: 5" 1 "fre1"} } */