aboutsummaryrefslogtreecommitdiff
path: root/tools/test-js-optimizer-asm-regs-output.js
blob: c2efa506d055ca0e9b14272774fcda772d2207fd (plain)
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
function asm(d1, i2) {
  d1 = +d1;
  i2 = i2 | 0;
  var i3 = 0, d4 = +0;
  i2 = d1 + d1 | 0;
  d1 = d(Math_max(10, Math_min(5, f())));
  i3 = i2 + 2 | 0;
  print(i3);
  d4 = d1 * 5;
  return d4;
}
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;
  var i3 = 0, d4 = +0;
  switch (d1 | 0) {
   case 0:
    i2 = d1 + d1 | 0;
    d1 = d(Math_max(10, Math_min(5, f())));
    i3 = i2 + 2 | 0;
    print(i3);
    d4 = d1 * 5;
    return d4;
   case 1:
    return 20;
  }
}
function switchey2() {
  var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, d6 = +0, d7 = +0, i8 = 0, i9 = 0;
  i1 = STACKTOP;
  STACKTOP = STACKTOP + 8 | 0;
  i2 = 1;
  while (1) switch (i2 | 0) {
   case 1:
    i3 = i1 | 0;
    __ZN6RandomC1Ev(i3);
    i4 = 0;
    i5 = 0;
    i2 = 2;
    break;
   case 2:
    d6 = +__ZN6Random3getEf(8, +1);
    d7 = +__ZN6Random3getEf(i3, +1);
    _printf(24, (tempInt = STACKTOP, STACKTOP = STACKTOP + 16 | 0, HEAPF64[CHECK_ALIGN_8(tempInt | 0) >> 3] = d6, HEAPF64[CHECK_ALIGN_8(tempInt + 8 | 0) >> 3] = d7, tempInt) | 0);
    i8 = (d6 != d7 & 1) + i5 | 0;
    i9 = i4 + 1 | 0;
    if ((i9 | 0) < 100) {
      i4 = i9;
      i5 = i8;
      i2 = 2;
      break;
    } else {
      i2 = 3;
      break;
    }
   case 3:
    _printf(16, (tempInt = STACKTOP, STACKTOP = STACKTOP + 8 | 0, HEAP32[CHECK_ALIGN_4(tempInt | 0) >> 2] = i8, tempInt) | 0);
    STACKTOP = i1;
    return 0;
  }
  return 0;
}
function iffey() {
  var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, d6 = +0, d7 = +0, i8 = 0, i9 = 0;
  i1 = STACKTOP;
  STACKTOP = STACKTOP + 8 | 0;
  i2 = 1;
  while (1) {
    if (i2 | 0) {
      i3 = i1 | 0;
      __ZN6RandomC1Ev(i3);
      i4 = 0;
      i5 = 0;
      i2 = 2;
    } else {
      d6 = +__ZN6Random3getEf(8, +1);
      d7 = +__ZN6Random3getEf(i3, +1);
      _printf(24, (tempInt = STACKTOP, STACKTOP = STACKTOP + 16 | 0, HEAPF64[CHECK_ALIGN_8(tempInt | 0) >> 3] = d6, HEAPF64[CHECK_ALIGN_8(tempInt + 8 | 0) >> 3] = d7, tempInt) | 0);
      i8 = (d6 != d7 & 1) + i5 | 0;
      i9 = i4 + 1 | 0;
      if ((i9 | 0) < 100) {
        i4 = i9;
        i5 = i8;
        i2 = 2;
      } else {
        i2 = 3;
        return 10;
      }
    }
  }
  return 0;
}