forked from WebKit/WebKit
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbig-int-cse.js
103 lines (81 loc) · 2.24 KB
/
big-int-cse.js
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
function assert(a, e) {
if (a !== e)
throw new Error("Expected " + e + " but got: " + a);
}
function bigIntAdd(a, b) {
let c = a + b;
return b + a + c;
}
noInline(bigIntAdd);
for (let i = 0; i < 100000; i++) {
assert(bigIntAdd(3n, 5n), 16n);
}
for (let i = 0; i < 100000; i++) {
assert(bigIntAdd(0xffffffffffffffffffn, 0xaaffffffffffffffffffn), 1624494070107157953511420n);
}
function bigIntMul(a, b) {
let c = a * b;
return b * a + c;
}
noInline(bigIntMul);
for (let i = 0; i < 100000; i++) {
assert(bigIntMul(3n, 5n), 30n);
}
for (let i = 0; i < 100000; i++) {
assert(bigIntMul(0xffffffffffffffffffn, 0xaaffffffffffffffffffn), 7626854857897473114403591155175632477091790850n);
}
function bigIntDiv(a, b) {
let c = a / b;
return a / b + c;
}
noInline(bigIntDiv);
for (let i = 0; i < 100000; i++) {
assert(bigIntDiv(15n, 5n), 6n);
}
for (let i = 0; i < 100000; i++) {
assert(bigIntDiv(0xaaffffffffffffffffffn, 0xffffffffffffffffffn), 342n);
}
function bigIntSub(a, b) {
let c = a - b;
return a - b + c;
}
noInline(bigIntSub);
for (let i = 0; i < 100000; i++) {
assert(bigIntSub(15n, 5n), 20n);
}
for (let i = 0; i < 100000; i++) {
assert(bigIntSub(0xaaffffffffffffffffffn, 0xffffffffffffffffffn), 1605604604175679372656640n);
}
function bigIntBitOr(a, b) {
let c = a | b;
return (b | a) + c;
}
noInline(bigIntBitOr);
for (let i = 0; i < 100000; i++) {
assert(bigIntBitOr(0b1101n, 0b0010n), 30n);
}
for (let i = 0; i < 100000; i++) {
assert(bigIntBitOr(0xaaffffffffffffffffffn, 0xffffffffffffffffffn), 1615049337141418663084030n);
}
function bigIntBitAnd(a, b) {
let c = a & b;
return (b & a) + c;
}
noInline(bigIntBitAnd);
for (let i = 0; i < 100000; i++) {
assert(bigIntBitAnd(0b1101n, 0b0010n), 0n);
}
for (let i = 0; i < 100000; i++) {
assert(bigIntBitAnd(0xaaffffffffffffffffffn, 0xffffffffffffffffffn), 9444732965739290427390n);
}
function bigIntBitXor(a, b) {
let c = a ^ b;
return (b ^ a) + c;
}
noInline(bigIntBitXor);
for (let i = 0; i < 100000; i++) {
assert(bigIntBitXor(0b1101n, 0b0010n), 30n);
}
for (let i = 0; i < 100000; i++) {
assert(bigIntBitXor(0xaaffffffffffffffffffn, 0xffffffffffffffffffn), 1605604604175679372656640n);
}