func Main() t.3 = HeapAllocZ(4) [t.3+0] = :functable_BT t.4 = t.3 t.5 = t.4 t.6 = [t.5+0] t.7 = [t.6+0] t.2 = call t.7(t.5) t.8 = t.2 t.9 = t.8 PrintIntS(t.9) ret const functable_BT :BT_Start func BT_Start(this ) t.2 = HeapAllocZ(104) [t.2+0] = :functable_Tree t.3 = t.2 t.4 = t.3 t.1 = t.4 t.7 = t.1 t.1 = t.7 t.8 = [t.1+0] t.9 = [t.8+0] t.10 = 16 t.11 = t.10 t.6 = call t.9(t.1 t.11) t.12 = t.6 t.5 = t.12 t.14 = t.1 t.1 = t.14 t.15 = [t.1+0] t.16 = [t.15+72] t.13 = call t.16(t.1) t.17 = t.13 t.5 = t.17 t.18 = 100000000 t.19 = t.18 t.20 = t.19 PrintIntS(t.20) t.22 = t.1 t.1 = t.22 t.23 = [t.1+0] t.24 = [t.23+48] t.25 = 8 t.26 = t.25 t.21 = call t.24(t.1 t.26) t.27 = t.21 t.5 = t.27 t.29 = t.1 t.1 = t.29 t.30 = [t.1+0] t.31 = [t.30+72] t.28 = call t.31(t.1) t.32 = t.28 t.5 = t.32 t.34 = t.1 t.1 = t.34 t.35 = [t.1+0] t.36 = [t.35+48] t.37 = 24 t.38 = t.37 t.33 = call t.36(t.1 t.38) t.39 = t.33 t.5 = t.39 t.41 = t.1 t.1 = t.41 t.42 = [t.1+0] t.43 = [t.42+48] t.44 = 4 t.45 = t.44 t.40 = call t.43(t.1 t.45) t.46 = t.40 t.5 = t.46 t.48 = t.1 t.1 = t.48 t.49 = [t.1+0] t.50 = [t.49+48] t.51 = 12 t.52 = t.51 t.47 = call t.50(t.1 t.52) t.53 = t.47 t.5 = t.53 t.55 = t.1 t.1 = t.55 t.56 = [t.1+0] t.57 = [t.56+48] t.58 = 20 t.59 = t.58 t.54 = call t.57(t.1 t.59) t.60 = t.54 t.5 = t.60 t.62 = t.1 t.1 = t.62 t.63 = [t.1+0] t.64 = [t.63+48] t.65 = 28 t.66 = t.65 t.61 = call t.64(t.1 t.66) t.67 = t.61 t.5 = t.67 t.69 = t.1 t.1 = t.69 t.70 = [t.1+0] t.71 = [t.70+48] t.72 = 14 t.73 = t.72 t.68 = call t.71(t.1 t.73) t.74 = t.68 t.5 = t.74 t.76 = t.1 t.1 = t.76 t.77 = [t.1+0] t.78 = [t.77+72] t.75 = call t.78(t.1) t.79 = t.75 t.5 = t.79 t.81 = t.1 t.1 = t.81 t.82 = [t.1+0] t.83 = [t.82+68] t.84 = 24 t.85 = t.84 t.80 = call t.83(t.1 t.85) t.86 = t.80 t.87 = t.86 PrintIntS(t.87) t.89 = t.1 t.1 = t.89 t.90 = [t.1+0] t.91 = [t.90+68] t.92 = 12 t.93 = t.92 t.88 = call t.91(t.1 t.93) t.94 = t.88 t.95 = t.94 PrintIntS(t.95) t.97 = t.1 t.1 = t.97 t.98 = [t.1+0] t.99 = [t.98+68] t.100 = 16 t.101 = t.100 t.96 = call t.99(t.1 t.101) t.102 = t.96 t.103 = t.102 PrintIntS(t.103) t.105 = t.1 t.1 = t.105 t.106 = [t.1+0] t.107 = [t.106+68] t.108 = 50 t.109 = t.108 t.104 = call t.107(t.1 t.109) t.110 = t.104 t.111 = t.110 PrintIntS(t.111) t.113 = t.1 t.1 = t.113 t.114 = [t.1+0] t.115 = [t.114+68] t.116 = 12 t.117 = t.116 t.112 = call t.115(t.1 t.117) t.118 = t.112 t.119 = t.118 PrintIntS(t.119) t.121 = t.1 t.1 = t.121 t.122 = [t.1+0] t.123 = [t.122+52] t.124 = 12 t.125 = t.124 t.120 = call t.123(t.1 t.125) t.126 = t.120 t.5 = t.126 t.128 = t.1 t.1 = t.128 t.129 = [t.1+0] t.130 = [t.129+72] t.127 = call t.130(t.1) t.131 = t.127 t.5 = t.131 t.133 = t.1 t.1 = t.133 t.134 = [t.1+0] t.135 = [t.134+68] t.136 = 12 t.137 = t.136 t.132 = call t.135(t.1 t.137) t.138 = t.132 t.139 = t.138 PrintIntS(t.139) t.140 = 0 t.141 = t.140 t.142 = t.141 ret t.142 const functable_Tree :Tree_Init :Tree_SetRight :Tree_SetLeft :Tree_GetRight :Tree_GetLeft :Tree_GetKey :Tree_SetKey :Tree_GetHas_Right :Tree_GetHas_Left :Tree_SetHas_Left :Tree_SetHas_Right :Tree_Compare :Tree_Insert :Tree_Delete :Tree_Remove :Tree_RemoveRight :Tree_RemoveLeft :Tree_Search :Tree_Print :Tree_RecPrint func Tree_Init(this t.0 ) t.1 = t.0 t.2 = t.1 [this+88] = t.2 t.3 = 0 t.4 = t.3 [this+92] = t.4 t.5 = 0 t.6 = t.5 [this+96] = t.6 t.7 = 1 t.8 = t.7 t.9 = t.8 ret t.9 func Tree_SetRight(this t.0 ) t.1 = t.0 t.2 = t.1 [this+84] = t.2 t.3 = 1 t.4 = t.3 t.5 = t.4 ret t.5 func Tree_SetLeft(this t.0 ) t.1 = t.0 t.2 = t.1 [this+80] = t.2 t.3 = 1 t.4 = t.3 t.5 = t.4 ret t.5 func Tree_GetRight(this ) t.0 = [this+84] t.1 = t.0 t.2 = t.1 ret t.2 func Tree_GetLeft(this ) t.0 = [this+80] t.1 = t.0 t.2 = t.1 ret t.2 func Tree_GetKey(this ) t.0 = [this+88] t.1 = t.0 t.2 = t.1 ret t.2 func Tree_SetKey(this t.0 ) t.1 = t.0 t.2 = t.1 [this+88] = t.2 t.3 = 1 t.4 = t.3 t.5 = t.4 ret t.5 func Tree_GetHas_Right(this ) t.0 = [this+96] t.1 = t.0 t.2 = t.1 ret t.2 func Tree_GetHas_Left(this ) t.0 = [this+92] t.1 = t.0 t.2 = t.1 ret t.2 func Tree_SetHas_Left(this t.0 ) t.1 = t.0 t.2 = t.1 [this+92] = t.2 t.3 = 1 t.4 = t.3 t.5 = t.4 ret t.5 func Tree_SetHas_Right(this t.0 ) t.1 = t.0 t.2 = t.1 [this+96] = t.2 t.3 = 1 t.4 = t.3 t.5 = t.4 ret t.5 func Tree_Compare(this t.0 t.1 ) t.3 = 0 t.4 = t.3 t.2 = t.4 t.7 = t.1 t.8 = 1 t.6 = Add(t.7 t.8) t.9 = t.6 t.5 = t.9 t.11 = t.0 t.12 = t.1 t.10 = LtS(t.11 t.12) t.13 = t.10 t.14 = t.13 if0 t.14 goto :if202_else if202_body: t.15 = 0 t.16 = t.15 t.2 = t.16 goto :if202_end if202_else: t.19 = t.0 t.20 = t.5 t.18 = LtS(t.19 t.20) t.21 = t.18 t.22 = t.21 t.23 = t.22 t.17 = Eq(t.23 0) t.24 = t.17 t.25 = t.24 t.26 = t.25 if0 t.26 goto :if209_else if209_body: t.27 = 0 t.28 = t.27 t.2 = t.28 goto :if209_end if209_else: t.29 = 1 t.30 = t.29 t.2 = t.30 if209_end: if202_end: t.31 = t.2 t.32 = t.31 t.33 = t.32 ret t.33 func Tree_Insert(this t.0 ) t.3 = HeapAllocZ(104) [t.3+0] = :functable_Tree t.4 = t.3 t.5 = t.4 t.2 = t.5 t.8 = t.2 t.2 = t.8 t.9 = [t.2+0] t.10 = [t.9+0] t.11 = t.0 t.12 = t.11 t.7 = call t.10(t.2 t.12) t.13 = t.7 t.6 = t.13 t.15 = this t.16 = t.15 t.14 = t.16 t.18 = 1 t.19 = t.18 t.17 = t.19 while240_test: t.20 = t.17 t.21 = t.20 t.22 = t.21 if0 t.22 goto :while240_end while240_body: t.25 = t.14 t.14 = t.25 t.26 = [t.14+0] t.27 = [t.26+20] t.24 = call t.27(t.14) t.28 = t.24 t.23 = t.28 t.30 = t.0 t.31 = t.23 t.29 = LtS(t.30 t.31) t.32 = t.29 t.33 = t.32 if0 t.33 goto :if249_else if249_body: t.35 = t.14 t.14 = t.35 t.36 = [t.14+0] t.37 = [t.36+32] t.34 = call t.37(t.14) t.38 = t.34 t.39 = t.38 if0 t.39 goto :if254_else if254_body: t.41 = t.14 t.14 = t.41 t.42 = [t.14+0] t.43 = [t.42+16] t.40 = call t.43(t.14) t.44 = t.40 t.14 = t.44 goto :if254_end if254_else: t.45 = 0 t.46 = t.45 t.17 = t.46 t.48 = t.14 t.14 = t.48 t.49 = [t.14+0] t.50 = [t.49+36] t.51 = 1 t.52 = t.51 t.47 = call t.50(t.14 t.52) t.53 = t.47 t.6 = t.53 t.55 = t.14 t.14 = t.55 t.56 = [t.14+0] t.57 = [t.56+8] t.58 = t.2 t.59 = t.58 t.54 = call t.57(t.14 t.59) t.60 = t.54 t.6 = t.60 if254_end: goto :if249_end if249_else: t.62 = t.14 t.14 = t.62 t.63 = [t.14+0] t.64 = [t.63+28] t.61 = call t.64(t.14) t.65 = t.61 t.66 = t.65 if0 t.66 goto :if281_else if281_body: t.68 = t.14 t.14 = t.68 t.69 = [t.14+0] t.70 = [t.69+12] t.67 = call t.70(t.14) t.71 = t.67 t.14 = t.71 goto :if281_end if281_else: t.72 = 0 t.73 = t.72 t.17 = t.73 t.75 = t.14 t.14 = t.75 t.76 = [t.14+0] t.77 = [t.76+40] t.78 = 1 t.79 = t.78 t.74 = call t.77(t.14 t.79) t.80 = t.74 t.6 = t.80 t.82 = t.14 t.14 = t.82 t.83 = [t.14+0] t.84 = [t.83+4] t.85 = t.2 t.86 = t.85 t.81 = call t.84(t.14 t.86) t.87 = t.81 t.6 = t.87 if281_end: if249_end: goto :while240_test while240_end: t.88 = 1 t.89 = t.88 t.90 = t.89 ret t.90 func Tree_Delete(this t.0 ) t.3 = this t.4 = t.3 t.2 = t.4 t.6 = this t.7 = t.6 t.5 = t.7 t.9 = 1 t.10 = t.9 t.8 = t.10 t.12 = 0 t.13 = t.12 t.11 = t.13 t.15 = 1 t.16 = t.15 t.14 = t.16 while321_test: t.17 = t.8 t.18 = t.17 t.19 = t.18 if0 t.19 goto :while321_end while321_body: t.22 = t.2 t.2 = t.22 t.23 = [t.2+0] t.24 = [t.23+20] t.21 = call t.24(t.2) t.25 = t.21 t.20 = t.25 t.27 = t.0 t.28 = t.20 t.26 = LtS(t.27 t.28) t.29 = t.26 t.30 = t.29 if0 t.30 goto :if330_else if330_body: t.32 = t.2 t.2 = t.32 t.33 = [t.2+0] t.34 = [t.33+32] t.31 = call t.34(t.2) t.35 = t.31 t.36 = t.35 if0 t.36 goto :if335_else if335_body: t.37 = t.2 t.38 = t.37 t.5 = t.38 t.40 = t.2 t.2 = t.40 t.41 = [t.2+0] t.42 = [t.41+16] t.39 = call t.42(t.2) t.43 = t.39 t.2 = t.43 goto :if335_end if335_else: t.44 = 0 t.45 = t.44 t.8 = t.45 if335_end: goto :if330_end if330_else: t.47 = t.20 t.48 = t.0 t.46 = LtS(t.47 t.48) t.49 = t.46 t.50 = t.49 if0 t.50 goto :if350_else if350_body: t.52 = t.2 t.2 = t.52 t.53 = [t.2+0] t.54 = [t.53+28] t.51 = call t.54(t.2) t.55 = t.51 t.56 = t.55 if0 t.56 goto :if355_else if355_body: t.57 = t.2 t.58 = t.57 t.5 = t.58 t.60 = t.2 t.2 = t.60 t.61 = [t.2+0] t.62 = [t.61+12] t.59 = call t.62(t.2) t.63 = t.59 t.2 = t.63 goto :if355_end if355_else: t.64 = 0 t.65 = t.64 t.8 = t.65 if355_end: goto :if350_end if350_else: t.66 = t.14 t.67 = t.66 t.68 = t.67 if0 t.68 goto :if370_else if370_body: t.72 = t.2 t.2 = t.72 t.73 = [t.2+0] t.74 = [t.73+28] t.71 = call t.74(t.2) t.75 = t.71 t.70 = Eq(t.75 0) t.76 = t.70 t.77 = t.76 t.78 = t.77 t.81 = t.2 t.2 = t.81 t.82 = [t.2+0] t.83 = [t.82+32] t.80 = call t.83(t.2) t.84 = t.80 t.79 = Eq(t.84 0) t.85 = t.79 t.86 = t.85 t.87 = t.86 t.88 = Eq(1 t.78) t.89 = Eq(1 t.87) t.69 = Eq(t.88 t.89) t.90 = t.69 t.91 = t.90 if0 t.91 goto :if373_else if373_body: t.93 = 1 t.94 = t.93 t.92 = t.94 goto :if373_end if373_else: t.96 = this t.97 = [this] t.98 = t.5 t.99 = t.98 t.100 = t.2 t.101 = t.100 t.97 = [t.97+56] t.95 = call t.97(this t.99 t.101) t.102 = t.95 t.92 = t.102 if373_end: goto :if370_end if370_else: t.104 = this t.105 = [this] t.106 = t.5 t.107 = t.106 t.108 = t.2 t.109 = t.108 t.105 = [t.105+56] t.103 = call t.105(this t.107 t.109) t.110 = t.103 t.92 = t.110 if370_end: t.111 = 1 t.112 = t.111 t.11 = t.112 t.113 = 0 t.114 = t.113 t.8 = t.114 if350_end: if330_end: t.115 = 0 t.116 = t.115 t.14 = t.116 goto :while321_test while321_end: t.117 = t.11 t.118 = t.117 t.119 = t.118 ret t.119 func Tree_Remove(this t.0 t.1 ) t.3 = t.1 t.1 = t.3 t.4 = [t.1+0] t.5 = [t.4+32] t.2 = call t.5(t.1) t.6 = t.2 t.7 = t.6 if0 t.7 goto :if423_else if423_body: t.10 = this t.11 = [this] t.12 = t.0 t.13 = t.12 t.14 = t.1 t.15 = t.14 t.11 = [t.11+64] t.9 = call t.11(this t.13 t.15) t.16 = t.9 t.8 = t.16 goto :if423_end if423_else: t.18 = t.1 t.1 = t.18 t.19 = [t.1+0] t.20 = [t.19+28] t.17 = call t.20(t.1) t.21 = t.17 t.22 = t.21 if0 t.22 goto :if437_else if437_body: t.24 = this t.25 = [this] t.26 = t.0 t.27 = t.26 t.28 = t.1 t.29 = t.28 t.25 = [t.25+60] t.23 = call t.25(this t.27 t.29) t.30 = t.23 t.8 = t.30 goto :if437_end if437_else: t.33 = t.1 t.1 = t.33 t.34 = [t.1+0] t.35 = [t.34+20] t.32 = call t.35(t.1) t.36 = t.32 t.31 = t.36 t.40 = t.0 t.0 = t.40 t.41 = [t.0+0] t.42 = [t.41+16] t.39 = call t.42(t.0) t.43 = t.39 t.44 = t.43 t.45 = t.44 t.46 = [t.45+0] t.47 = [t.46+20] t.38 = call t.47(t.45) t.48 = t.38 t.37 = t.48 t.50 = this t.51 = [this] t.52 = t.31 t.53 = t.52 t.54 = t.37 t.55 = t.54 t.51 = [t.51+44] t.49 = call t.51(this t.53 t.55) t.56 = t.49 t.57 = t.56 if0 t.57 goto :if467_else if467_body: t.59 = t.0 t.0 = t.59 t.60 = [t.0+0] t.61 = [t.60+8] t.62 = [this+100] t.63 = t.62 t.58 = call t.61(t.0 t.63) t.64 = t.58 t.8 = t.64 t.66 = t.0 t.0 = t.66 t.67 = [t.0+0] t.68 = [t.67+36] t.69 = 0 t.70 = t.69 t.65 = call t.68(t.0 t.70) t.71 = t.65 t.8 = t.71 goto :if467_end if467_else: t.73 = t.0 t.0 = t.73 t.74 = [t.0+0] t.75 = [t.74+4] t.76 = [this+100] t.77 = t.76 t.72 = call t.75(t.0 t.77) t.78 = t.72 t.8 = t.78 t.80 = t.0 t.0 = t.80 t.81 = [t.0+0] t.82 = [t.81+40] t.83 = 0 t.84 = t.83 t.79 = call t.82(t.0 t.84) t.85 = t.79 t.8 = t.85 if467_end: if437_end: if423_end: t.86 = 1 t.87 = t.86 t.88 = t.87 ret t.88 func Tree_RemoveRight(this t.0 t.1 ) while507_test: t.3 = t.1 t.1 = t.3 t.4 = [t.1+0] t.5 = [t.4+28] t.2 = call t.5(t.1) t.6 = t.2 t.7 = t.6 if0 t.7 goto :while507_end while507_body: t.10 = t.1 t.1 = t.10 t.11 = [t.1+0] t.12 = [t.11+24] t.15 = t.1 t.1 = t.15 t.16 = [t.1+0] t.17 = [t.16+12] t.14 = call t.17(t.1) t.18 = t.14 t.19 = t.18 t.20 = t.19 t.21 = [t.20+0] t.22 = [t.21+20] t.13 = call t.22(t.20) t.23 = t.13 t.9 = call t.12(t.1 t.23) t.24 = t.9 t.8 = t.24 t.25 = t.1 t.26 = t.25 t.0 = t.26 t.28 = t.1 t.1 = t.28 t.29 = [t.1+0] t.30 = [t.29+12] t.27 = call t.30(t.1) t.31 = t.27 t.1 = t.31 goto :while507_test while507_end: t.33 = t.0 t.0 = t.33 t.34 = [t.0+0] t.35 = [t.34+4] t.36 = [this+100] t.37 = t.36 t.32 = call t.35(t.0 t.37) t.38 = t.32 t.8 = t.38 t.40 = t.0 t.0 = t.40 t.41 = [t.0+0] t.42 = [t.41+40] t.43 = 0 t.44 = t.43 t.39 = call t.42(t.0 t.44) t.45 = t.39 t.8 = t.45 t.46 = 1 t.47 = t.46 t.48 = t.47 ret t.48 func Tree_RemoveLeft(this t.0 t.1 ) while554_test: t.3 = t.1 t.1 = t.3 t.4 = [t.1+0] t.5 = [t.4+32] t.2 = call t.5(t.1) t.6 = t.2 t.7 = t.6 if0 t.7 goto :while554_end while554_body: t.10 = t.1 t.1 = t.10 t.11 = [t.1+0] t.12 = [t.11+24] t.15 = t.1 t.1 = t.15 t.16 = [t.1+0] t.17 = [t.16+16] t.14 = call t.17(t.1) t.18 = t.14 t.19 = t.18 t.20 = t.19 t.21 = [t.20+0] t.22 = [t.21+20] t.13 = call t.22(t.20) t.23 = t.13 t.9 = call t.12(t.1 t.23) t.24 = t.9 t.8 = t.24 t.25 = t.1 t.26 = t.25 t.0 = t.26 t.28 = t.1 t.1 = t.28 t.29 = [t.1+0] t.30 = [t.29+16] t.27 = call t.30(t.1) t.31 = t.27 t.1 = t.31 goto :while554_test while554_end: t.33 = t.0 t.0 = t.33 t.34 = [t.0+0] t.35 = [t.34+8] t.36 = [this+100] t.37 = t.36 t.32 = call t.35(t.0 t.37) t.38 = t.32 t.8 = t.38 t.40 = t.0 t.0 = t.40 t.41 = [t.0+0] t.42 = [t.41+36] t.43 = 0 t.44 = t.43 t.39 = call t.42(t.0 t.44) t.45 = t.39 t.8 = t.45 t.46 = 1 t.47 = t.46 t.48 = t.47 ret t.48 func Tree_Search(this t.0 ) t.3 = this t.4 = t.3 t.2 = t.4 t.6 = 1 t.7 = t.6 t.5 = t.7 t.9 = 0 t.10 = t.9 t.8 = t.10 while607_test: t.11 = t.5 t.12 = t.11 t.13 = t.12 if0 t.13 goto :while607_end while607_body: t.16 = t.2 t.2 = t.16 t.17 = [t.2+0] t.18 = [t.17+20] t.15 = call t.18(t.2) t.19 = t.15 t.14 = t.19 t.21 = t.0 t.22 = t.14 t.20 = LtS(t.21 t.22) t.23 = t.20 t.24 = t.23 if0 t.24 goto :if616_else if616_body: t.26 = t.2 t.2 = t.26 t.27 = [t.2+0] t.28 = [t.27+32] t.25 = call t.28(t.2) t.29 = t.25 t.30 = t.29 if0 t.30 goto :if621_else if621_body: t.32 = t.2 t.2 = t.32 t.33 = [t.2+0] t.34 = [t.33+16] t.31 = call t.34(t.2) t.35 = t.31 t.2 = t.35 goto :if621_end if621_else: t.36 = 0 t.37 = t.36 t.5 = t.37 if621_end: goto :if616_end if616_else: t.39 = t.14 t.40 = t.0 t.38 = LtS(t.39 t.40) t.41 = t.38 t.42 = t.41 if0 t.42 goto :if634_else if634_body: t.44 = t.2 t.2 = t.44 t.45 = [t.2+0] t.46 = [t.45+28] t.43 = call t.46(t.2) t.47 = t.43 t.48 = t.47 if0 t.48 goto :if639_else if639_body: t.50 = t.2 t.2 = t.50 t.51 = [t.2+0] t.52 = [t.51+12] t.49 = call t.52(t.2) t.53 = t.49 t.2 = t.53 goto :if639_end if639_else: t.54 = 0 t.55 = t.54 t.5 = t.55 if639_end: goto :if634_end if634_else: t.56 = 1 t.57 = t.56 t.8 = t.57 t.58 = 0 t.59 = t.58 t.5 = t.59 if634_end: if616_end: goto :while607_test while607_end: t.60 = t.8 t.61 = t.60 t.62 = t.61 ret t.62 func Tree_Print(this ) t.2 = this t.3 = t.2 t.1 = t.3 t.6 = this t.7 = [this] t.8 = t.1 t.9 = t.8 t.7 = [t.7+76] t.5 = call t.7(this t.9) t.10 = t.5 t.4 = t.10 t.11 = 1 t.12 = t.11 t.13 = t.12 ret t.13 func Tree_RecPrint(this t.0 ) t.2 = t.0 t.0 = t.2 t.3 = [t.0+0] t.4 = [t.3+32] t.1 = call t.4(t.0) t.5 = t.1 t.6 = t.5 if0 t.6 goto :if670_else if670_body: t.9 = this t.10 = [this] t.12 = t.0 t.0 = t.12 t.13 = [t.0+0] t.14 = [t.13+16] t.11 = call t.14(t.0) t.15 = t.11 t.10 = [t.10+76] t.8 = call t.10(this t.15) t.16 = t.8 t.7 = t.16 goto :if670_end if670_else: t.17 = 1 t.18 = t.17 t.7 = t.18 if670_end: t.20 = t.0 t.0 = t.20 t.21 = [t.0+0] t.22 = [t.21+20] t.19 = call t.22(t.0) t.23 = t.19 t.24 = t.23 PrintIntS(t.24) t.26 = t.0 t.0 = t.26 t.27 = [t.0+0] t.28 = [t.27+28] t.25 = call t.28(t.0) t.29 = t.25 t.30 = t.29 if0 t.30 goto :if693_else if693_body: t.32 = this t.33 = [this] t.35 = t.0 t.0 = t.35 t.36 = [t.0+0] t.37 = [t.36+12] t.34 = call t.37(t.0) t.38 = t.34 t.33 = [t.33+76] t.31 = call t.33(this t.38) t.39 = t.31 t.7 = t.39 goto :if693_end if693_else: t.40 = 1 t.41 = t.40 t.7 = t.41 if693_end: t.42 = 1 t.43 = t.42 t.44 = t.43 ret t.44 func AllocArray(size) bytes = MulS(size 4) bytes = Add(bytes 4) v = HeapAllocZ(bytes) [v] = size ret v