;; Function f (f)

;; 2 loops found
;;
;; Loop 0
;;  header 0, latch 1
;;  depth 0, outer -1
;;  nodes: 0 1 2 6 5 3 7 8 4
;;
;; Loop 1
;;  header 3, latch 7
;;  depth 1, outer 0
;;  nodes: 3 7
;; 2 succs { 5 6 }
;; 6 succs { 4 }
;; 5 succs { 3 }
;; 3 succs { 7 8 }
;; 7 succs { 3 }
;; 8 succs { 4 }
;; 4 succs { 1 }

SSA replacement table
N_i -> { O_1 ... O_j } means that N_i replaces O_1, ..., O_j

count_37 -> { count_18 }

Number of virtual NEW -> OLD mappings:       0
Number of real NEW -> OLD mappings:          1
Number of total NEW -> OLD mappings:         1

Number of virtual symbols: 0


Incremental SSA update started at block: 2

Number of blocks in CFG: 9
Number of blocks to update: 4 ( 44%)



f (int start, int end, int * a, int * b, int c, struct s * sp)
{
  int pretmp.9;
  int * pretmp.8;
  long unsigned int pretmp.7;
  int pretmp.6;
  int * pretmp.5;
  long unsigned int pretmp.4;
  int i;
  int count;
  int (*<T264>) (const char *, void *, int *) D.2022;
  void * D.2021;
  struct s * D.2020;
  int D.2019;
  int D.2018;
  int * D.2017;
  int * D.2016;
  long unsigned int D.2015;
  long unsigned int D.2014;

<bb 2>:
  if (start_4(D) <= end_6(D))
    goto <bb 5>;
  else
    goto <bb 6>;

<bb 6>:
  goto <bb 4>;

<bb 5>:

<bb 3>:
  # count_31 = PHI <count_18(7), 0(5)>
  # i_32 = PHI <i_19(7), start_4(D)(5)>
  D.2014_7 = (long unsigned int) i_32;
  D.2015_8 = D.2014_7 * 4;
  D.2016_10 = a_9(D) + D.2015_8;
  D.2017_14 = b_13(D) + D.2015_8;
  D.2018_15 = *D.2017_14;
  D.2019_17 = D.2018_15 + c_16(D);
  *D.2016_10 = D.2019_17;
  count_18 = count_31 + 1;
  i_19 = i_32 + 1;
  if (end_6(D) >= i_19)
    goto <bb 7>;
  else
    goto <bb 8>;

<bb 7>:
  goto <bb 3>;

<bb 8>:
  # count_37 = PHI <count_18(3)>

<bb 4>:
  # count_11 = PHI <count_37(8), 0(6)>
  D.2020_21 = sp_20(D)->s;
  D.2021_22 = D.2020_21->vp;
  D.2022_23 = (int (*<T264>) (const char *, void *, int *)) D.2021_22;
  D.2022_23 ("Hello World!\n", exit, &M_var);
  return count_11;

}



;; Function g (g)

;; 1 loops found
;;
;; Loop 0
;;  header 0, latch 1
;;  depth 0, outer -1
;;  nodes: 0 1 2 5 3 4
;; 2 succs { 5 3 }
;; 5 succs { 4 }
;; 3 succs { 4 }
;; 4 succs { 1 }
g (int i)
{
  unsigned int D.2029;
  unsigned int csui.0;
  int D.2012;

<bb 2>:
  D.2029_7 = (unsigned int) i_2(D);
  csui.0_8 = D.2029_7 + 4294967295;
  if (csui.0_8 <= 4)
    goto <bb 3> (<L9>);
  else
    goto <bb 5>;

<bb 5>:
  goto <bb 4> (<L10>);

<L9>:
  D.2012_6 = CSWTCH.1[csui.0_8];

  # D.2012_1 = PHI <D.2012_6(3), 0(5)>
<L10>:
<L7>:
  return D.2012_1;

}