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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
|
// |jit-test| --ion-limit-script-size=off
setJitCompilerOption("baseline.warmup.trigger", 9);
setJitCompilerOption("ion.warmup.trigger", 20);
// Prevent the GC from cancelling Ion compilations, when we expect them to succeed
gczeal(0);
// Keep in sync with BigInt::MaxBitLength.
const maxBitLength = 1024 * 1024;
const maxBigInt = BigInt.asUintN(maxBitLength, -1n);
const minBigInt = -maxBigInt;
function resumeHere() {}
function bigIntAddBail(i) {
var x = [0n, maxBigInt][0 + (i >= 99)];
var a = x + 1n;
// Add a function call to capture a resumepoint at the end of the call or
// inside the inlined block, such as the bailout does not rewind to the
// beginning of the function.
resumeHere();
if (i >= 99) {
bailout();
// Flag the computation as having removed uses to check that we properly
// report the error while executing the BigInt operation on bailout.
return a;
}
}
function bigIntSubBail(i) {
var x = [0n, minBigInt][0 + (i >= 99)];
var a = x - 1n;
// Add a function call to capture a resumepoint at the end of the call or
// inside the inlined block, such as the bailout does not rewind to the
// beginning of the function.
resumeHere();
if (i >= 99) {
bailout();
// Flag the computation as having removed uses to check that we properly
// report the error while executing the BigInt operation on bailout.
return a;
}
}
function bigIntMulBail(i) {
var x = [0n, maxBigInt][0 + (i >= 99)];
var a = x * 2n;
// Add a function call to capture a resumepoint at the end of the call or
// inside the inlined block, such as the bailout does not rewind to the
// beginning of the function.
resumeHere();
if (i >= 99) {
bailout();
// Flag the computation as having removed uses to check that we properly
// report the error while executing the BigInt operation on bailout.
return a;
}
}
function bigIntIncBail(i) {
var x = [0n, maxBigInt][0 + (i >= 99)];
var a = x++;
// Add a function call to capture a resumepoint at the end of the call or
// inside the inlined block, such as the bailout does not rewind to the
// beginning of the function.
resumeHere();
if (i >= 99) {
bailout();
// Flag the computation as having removed uses to check that we properly
// report the error while executing the BigInt operation on bailout.
return x;
}
}
function bigIntDecBail(i) {
var x = [0n, minBigInt][0 + (i >= 99)];
var a = x--;
// Add a function call to capture a resumepoint at the end of the call or
// inside the inlined block, such as the bailout does not rewind to the
// beginning of the function.
resumeHere();
if (i >= 99) {
bailout();
// Flag the computation as having removed uses to check that we properly
// report the error while executing the BigInt operation on bailout.
return x;
}
}
function bigIntBitNotBail(i) {
var x = [0n, maxBigInt][0 + (i >= 99)];
var a = ~x;
// Add a function call to capture a resumepoint at the end of the call or
// inside the inlined block, such as the bailout does not rewind to the
// beginning of the function.
resumeHere();
if (i >= 99) {
bailout();
// Flag the computation as having removed uses to check that we properly
// report the error while executing the BigInt operation on bailout.
return a;
}
}
function bigIntLshBail(i) {
var shift = [0n, BigInt(maxBitLength)][0 + (i >= 99)];
var a = 1n << shift;
// Add a function call to capture a resumepoint at the end of the call or
// inside the inlined block, such as the bailout does not rewind to the
// beginning of the function.
resumeHere();
if (i >= 99) {
bailout();
// Flag the computation as having removed uses to check that we properly
// report the error while executing the BigInt operation on bailout.
return a;
}
}
function bigIntRshBail(i) {
var shift = [0n, -BigInt(maxBitLength)][0 + (i >= 99)];
var a = 1n >> shift;
// Add a function call to capture a resumepoint at the end of the call or
// inside the inlined block, such as the bailout does not rewind to the
// beginning of the function.
resumeHere();
if (i >= 99) {
bailout();
// Flag the computation as having removed uses to check that we properly
// report the error while executing the BigInt operation on bailout.
return a;
}
}
function bigIntAsUintBail(i) {
var x = [0, maxBitLength + 1][0 + (i >= 99)];
var a = BigInt.asUintN(x, -1n);
// Add a function call to capture a resumepoint at the end of the call or
// inside the inlined block, such as the bailout does not rewind to the
// beginning of the function.
resumeHere();
if (i >= 99) {
bailout();
// Flag the computation as having removed uses to check that we properly
// report the error while executing the BigInt operation on bailout.
return a;
}
}
// Prevent compilation of the top-level
eval(`(${resumeHere})`);
// The bigIntXBail() functions create a BigInt which exceeds the maximum
// representable BigInt. This results in either throwing a RangeError or an
// out-of-memory error when the operation is recovered during a bailout.
try {
for (let i = 0; i < 100; i++) {
bigIntAddBail(i);
}
throw new Error("missing exception");
} catch (e) {
assertEq(e instanceof RangeError || e === "out of memory", true, String(e));
}
try {
for (let i = 0; i < 100; i++) {
bigIntSubBail(i);
}
throw new Error("missing exception");
} catch (e) {
assertEq(e instanceof RangeError || e === "out of memory", true, String(e));
}
try {
for (let i = 0; i < 100; i++) {
bigIntMulBail(i);
}
throw new Error("missing exception");
} catch (e) {
assertEq(e instanceof RangeError || e === "out of memory", true, String(e));
}
try {
for (let i = 0; i < 100; i++) {
bigIntIncBail(i);
}
throw new Error("missing exception");
} catch (e) {
assertEq(e instanceof RangeError || e === "out of memory", true, String(e));
}
try {
for (let i = 0; i < 100; i++) {
bigIntDecBail(i);
}
throw new Error("missing exception");
} catch (e) {
assertEq(e instanceof RangeError || e === "out of memory", true, String(e));
}
try {
for (let i = 0; i < 100; i++) {
bigIntBitNotBail(i);
}
throw new Error("missing exception");
} catch (e) {
assertEq(e instanceof RangeError || e === "out of memory", true, String(e));
}
try {
for (let i = 0; i < 100; i++) {
bigIntLshBail(i);
}
throw new Error("missing exception");
} catch (e) {
assertEq(e instanceof RangeError || e === "out of memory", true, String(e));
}
try {
for (let i = 0; i < 100; i++) {
bigIntRshBail(i);
}
throw new Error("missing exception");
} catch (e) {
assertEq(e instanceof RangeError || e === "out of memory", true, String(e));
}
try {
for (let i = 0; i < 100; i++) {
bigIntAsUintBail(i);
}
throw new Error("missing exception");
} catch (e) {
assertEq(e instanceof RangeError || e === "out of memory", true, String(e));
}
|
