File: ssa-hoist-7.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 (54 lines) | stat: -rw-r--r-- 975 bytes parent folder | download | duplicates (2) 
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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
 
/* { dg-options "-O2 -fdump-tree-pre-stats" } */

void baz();
int tem;
void foo (int a, int b, int c, int d, int e, int x, int y, int z)
{
  if (a)
    {
      if (b)
        {
          if (c)
            {
	      if (d)
		{
		  if (e)
		    {
		      tem = x + y;
		    }
		  else
		    {
		      if (z) baz ();
		      tem = x + y;
		    }
		}
	      else
		{
		  if (z) baz ();
		  tem = x + y;
		}
	    }
          else
            {
              if (z) baz ();
              tem = x + y;
            }
        }
      else
        {
          if (z) baz ();
          tem = x + y;
        }
    }
  else
    {
      if (z) baz ();
      tem = x + y;
    }
}

/* Now inserting x + y five times is unnecessary but the cascading
   cannot be avoided with the simple-minded dataflow.  But make sure
   we do not iterate PRE insertion.  */
/* { dg-final { scan-tree-dump "insert iterations == 1" "pre" } } */
/* { dg-final { scan-tree-dump "HOIST inserted: 5" "pre" } } */