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
|
// Different typed array types to ensure we emit a SetProp IC.
var xs = [
new BigInt64Array(10),
new BigUint64Array(10),
];
// Store with 0n as rhs.
function storeConstantZero() {
var value = 0n;
for (var i = 0; i < 100; ++i) {
var ta = xs[i & 1];
ta[0] = value;
}
assertEq(xs[0][0], BigInt.asIntN(64, value));
assertEq(xs[1][0], BigInt.asUintN(64, value));
}
storeConstantZero();
// Store non-negative BigInt using inline digits.
function storeInlineDigits() {
var value = 1n;
for (var i = 0; i < 100; ++i) {
var ta = xs[i & 1];
ta[0] = value;
}
assertEq(xs[0][0], BigInt.asIntN(64, value));
assertEq(xs[1][0], BigInt.asUintN(64, value));
}
storeInlineDigits();
// Store negative BigInt using inline digits.
function storeInlineDigitsNegative() {
var value = -1n;
for (var i = 0; i < 100; ++i) {
var ta = xs[i & 1];
ta[0] = value;
}
assertEq(xs[0][0], BigInt.asIntN(64, value));
assertEq(xs[1][0], BigInt.asUintN(64, value));
}
storeInlineDigitsNegative();
// Still inline digits, but now two digits on 32-bit platforms
function storeInlineDigitsTwoDigits() {
var value = 4294967296n;
for (var i = 0; i < 100; ++i) {
var ta = xs[i & 1];
ta[0] = value;
}
assertEq(xs[0][0], BigInt.asIntN(64, value));
assertEq(xs[1][0], BigInt.asUintN(64, value));
}
storeInlineDigitsTwoDigits();
// Negative case of |storeInlineDigitsTwoDigits|.
function storeInlineDigitsTwoDigitsNegative() {
var value = -4294967296n;
for (var i = 0; i < 100; ++i) {
var ta = xs[i & 1];
ta[0] = value;
}
assertEq(xs[0][0], BigInt.asIntN(64, value));
assertEq(xs[1][0], BigInt.asUintN(64, value));
}
storeInlineDigitsTwoDigitsNegative();
// Store BigInt using heap digits.
function storeHeapDigits() {
var value = 2n ** 1000n;
for (var i = 0; i < 100; ++i) {
var ta = xs[i & 1];
ta[0] = value;
}
assertEq(xs[0][0], BigInt.asIntN(64, value));
assertEq(xs[1][0], BigInt.asUintN(64, value));
}
storeHeapDigits();
// Store negative BigInt using heap digits.
function storeHeapDigitsNegative() {
var value = -(2n ** 1000n);
for (var i = 0; i < 100; ++i) {
var ta = xs[i & 1];
ta[0] = value;
}
assertEq(xs[0][0], BigInt.asIntN(64, value));
assertEq(xs[1][0], BigInt.asUintN(64, value));
}
storeHeapDigitsNegative();
// Store BigInt with first number requiring heap digits.
function storeFirstHeapDigits() {
var value = 2n ** 64n;
for (var i = 0; i < 100; ++i) {
var ta = xs[i & 1];
ta[0] = value;
}
assertEq(xs[0][0], BigInt.asIntN(64, value));
assertEq(xs[1][0], BigInt.asUintN(64, value));
}
storeFirstHeapDigits();
// Store negative BigInt with first number requiring heap digits.
function storeFirstHeapDigitsNegative() {
var value = -(2n ** 64n);
for (var i = 0; i < 100; ++i) {
var ta = xs[i & 1];
ta[0] = value;
}
assertEq(xs[0][0], BigInt.asIntN(64, value));
assertEq(xs[1][0], BigInt.asUintN(64, value));
}
storeFirstHeapDigitsNegative();
|
