;; Function f (f) ;; 2 loops found ;; ;; Loop 0 ;; header 0, latch 1 ;; depth 0, outer -1 ;; nodes: 0 1 2 3 4 5 ;; ;; Loop 1 ;; header 4, latch 3 ;; depth 1, outer 0 ;; nodes: 4 3 ;; 2 succs { 4 } ;; 3 succs { 4 } ;; 4 succs { 3 5 } ;; 5 succs { 1 } f (int start, int end, int * a, int * b, int c, struct s * sp) { int i; int count; int (*) (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; : goto ; : D.2014_7 = (long unsigned int) i_2; D.2015_8 = D.2014_7 * 4; D.2016_10 = a_9(D) + D.2015_8; D.2014_11 = (long unsigned int) i_2; D.2015_12 = D.2014_11 * 4; D.2017_14 = b_13(D) + D.2015_12; D.2018_15 = *D.2017_14; D.2019_17 = D.2018_15 + c_16(D); *D.2016_10 = D.2019_17; count_18 = count_1 + 1; i_19 = i_2 + 1; : # count_1 = PHI <0(2), count_18(3)> # i_2 = PHI if (i_2 <= end_6(D)) goto ; else goto ; : D.2020_21 = sp_20(D)->s; D.2021_22 = D.2020_21->vp; D.2022_23 = (int (*) (const char *, void *, int *)) D.2021_22; D.2022_23 ("Hello World!\n", exit, &M_var); return count_1; } ;; Function g (g) ;; 1 loops found ;; ;; Loop 0 ;; header 0, latch 1 ;; depth 0, outer -1 ;; nodes: 0 1 2 3 4 5 6 7 8 ;; 2 succs { 7 8 3 4 5 6 } ;; 3 succs { 8 } ;; 4 succs { 8 } ;; 5 succs { 8 } ;; 6 succs { 8 } ;; 7 succs { 8 } ;; 8 succs { 1 } g (int i) { int D.2012; : switch (i_2(D)) , case 1: , case 2: , case 3: , case 4: , case 5: > : goto (); : goto (); : goto (); : goto (); : # D.2012_1 = PHI <42(2), 60(3), 7(4), 3(5), 1048576(6), 0(7)> : return D.2012_1; }