138 строки
2.6 KiB
JavaScript
138 строки
2.6 KiB
JavaScript
function asm(d1, i2) {
|
|
d1 = +d1;
|
|
i2 = i2 | 0;
|
|
i2 = d1 + d1 | 0;
|
|
d1 = d(Math_max(10, Math_min(5, f())));
|
|
i2 = i2 + 2 | 0;
|
|
print(i2);
|
|
d1 = d1 * 5;
|
|
return d1;
|
|
}
|
|
function _doit(i1, i2, i3) {
|
|
i1 = i1 | 0;
|
|
i2 = i2 | 0;
|
|
i3 = i3 | 0;
|
|
i1 = STACKTOP;
|
|
_printf(__str | 0, (tempInt = STACKTOP, STACKTOP = STACKTOP + 8 | 0, HEAP32[(tempInt & 16777215) >> 2] = i2, HEAP32[(tempInt + 4 & 16777215) >> 2] = i3, tempInt));
|
|
STACKTOP = i1;
|
|
return 0 | 0;
|
|
}
|
|
function stackRestore(i1) {
|
|
i1 = i1 | 0;
|
|
STACKTOP = i1;
|
|
}
|
|
function switchey(d1, i2) {
|
|
d1 = +d1;
|
|
i2 = i2 | 0;
|
|
switch (d1 | 0) {
|
|
case 0:
|
|
i2 = d1 + d1 | 0;
|
|
d1 = d(Math_max(10, Math_min(5, f())));
|
|
i2 = i2 + 2 | 0;
|
|
print(i2);
|
|
d1 = d1 * 5;
|
|
return d1;
|
|
case 1:
|
|
return 20;
|
|
}
|
|
}
|
|
function switchey2() {
|
|
var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, d6 = +0, d7 = +0;
|
|
i5 = STACKTOP;
|
|
STACKTOP = STACKTOP + 8 | 0;
|
|
i3 = 1;
|
|
while (1) switch (i3 | 0) {
|
|
case 1:
|
|
i4 = i5 | 0;
|
|
__ZN6RandomC1Ev(i4);
|
|
i1 = 0;
|
|
i2 = 0;
|
|
i3 = 2;
|
|
break;
|
|
case 2:
|
|
d7 = +__ZN6Random3getEf(8, +1);
|
|
d6 = +__ZN6Random3getEf(i4, +1);
|
|
_printf(24, (tempInt = STACKTOP, STACKTOP = STACKTOP + 16 | 0, HEAPF64[CHECK_ALIGN_8(tempInt | 0) >> 3] = d7, HEAPF64[CHECK_ALIGN_8(tempInt + 8 | 0) >> 3] = d6, tempInt) | 0);
|
|
i2 = (d7 != d6 & 1) + i2 | 0;
|
|
i1 = i1 + 1 | 0;
|
|
if ((i1 | 0) < 100) {
|
|
i3 = 2;
|
|
break;
|
|
} else {
|
|
i3 = 3;
|
|
break;
|
|
}
|
|
case 3:
|
|
_printf(16, (tempInt = STACKTOP, STACKTOP = STACKTOP + 8 | 0, HEAP32[CHECK_ALIGN_4(tempInt | 0) >> 2] = i2, tempInt) | 0);
|
|
STACKTOP = i5;
|
|
return 0;
|
|
}
|
|
return 0;
|
|
}
|
|
function iffey() {
|
|
var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, d6 = +0, d7 = +0;
|
|
i5 = STACKTOP;
|
|
STACKTOP = STACKTOP + 8 | 0;
|
|
i3 = 1;
|
|
while (1) {
|
|
if (i3 | 0) {
|
|
i4 = i5 | 0;
|
|
__ZN6RandomC1Ev(i4);
|
|
i1 = 0;
|
|
i2 = 0;
|
|
i3 = 2;
|
|
} else {
|
|
d7 = +__ZN6Random3getEf(8, +1);
|
|
d6 = +__ZN6Random3getEf(i4, +1);
|
|
_printf(24, (tempInt = STACKTOP, STACKTOP = STACKTOP + 16 | 0, HEAPF64[CHECK_ALIGN_8(tempInt | 0) >> 3] = d7, HEAPF64[CHECK_ALIGN_8(tempInt + 8 | 0) >> 3] = d6, tempInt) | 0);
|
|
i2 = (d7 != d6 & 1) + i2 | 0;
|
|
i1 = i1 + 1 | 0;
|
|
if ((i1 | 0) < 100) {
|
|
i3 = 2;
|
|
} else {
|
|
return 10;
|
|
}
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
function labelledJump(i1) {
|
|
i1 = i1 | 0;
|
|
var i2 = 0, i3 = 0;
|
|
i2 = 2;
|
|
if (i1) {
|
|
i1 = 17;
|
|
i3 = 1;
|
|
}
|
|
if (i3 == 1) {
|
|
i1 = i1 + 1;
|
|
} else {
|
|
i1 = i2 + 1;
|
|
}
|
|
return i1;
|
|
}
|
|
function linkedVars() {
|
|
var i1 = 0, i2 = 0;
|
|
while (1) {
|
|
i1 = 9;
|
|
i2 = 5;
|
|
while (i1 > 0 | i2 > 0) {
|
|
if (i1 < i2) {
|
|
i1 = i1 - 1;
|
|
} else {
|
|
i2 = i2 - 1;
|
|
}
|
|
}
|
|
if (i1 < i2) {
|
|
break;
|
|
}
|
|
}
|
|
return i1 + i2;
|
|
}
|
|
function deadCondExpr(i1) {
|
|
i1 = i1 | 0;
|
|
var i2 = 0;
|
|
return i2 | 0;
|
|
}
|
|
|