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
|
// Similar test as "cacheir/set-has-value.js", except that we now perform
// duplicate lookups to ensure GVN works properly.
// Return a new set, possibly filling some dummy entries to enforce creating
// multiple hash buckets.
function createSet(values, n) {
var xs = [...values];
for (var i = 0; i < n; ++i) {
xs.push({});
}
return new Set(xs);
}
function runTest(fn) {
fn(0);
fn(100);
}
function testPolymorphic_same_set(n) {
var xs = [10, 10.5, "test", Symbol("?"), 123n, -123n, {}, []];
var ys = [-0, NaN, "bad", Symbol("!"), 42n, -99n, {}, []];
var zs = [...xs, ...ys];
var set = createSet(xs, n);
var N = 128;
var c = 0;
for (var i = 0; i < N; ++i) {
var z = zs[i & 15];
if (set.has(z)) c++;
if (set.has(z)) c++;
}
assertEq(c, N);
}
runTest(testPolymorphic_same_set);
// Duplicate the above tests, but this time use a different set.
function testPolymorphic_different_set(n) {
var xs = [10, 10.5, "test", Symbol("?"), 123n, -123n, {}, []];
var ys = [-0, NaN, "bad", Symbol("!"), 42n, -99n, {}, []];
var zs = [...xs, ...ys];
var set1 = createSet(xs, n);
var set2 = createSet(xs, n);
var N = 128;
var c = 0;
for (var i = 0; i < N; ++i) {
var z = zs[i & 15];
if (set1.has(z)) c++;
if (set2.has(z)) c++;
}
assertEq(c, N);
}
runTest(testPolymorphic_different_set);
// Test the alias information is correct.
function testPolymorphic_alias(n) {
var xs = [10, 10.5, "test", Symbol("?"), 123n, -123n, {}, []];
var set = createSet([], n);
var N = 128;
var c = 0;
for (var i = 0; i < N; ++i) {
var x = xs[i & 15];
set.add(x);
if (set.has(x)) c++;
set.delete(x);
if (set.has(x)) c++;
}
assertEq(c, N);
}
runTest(testPolymorphic_alias);
// And finally test that we don't actually support GVN for values, because the
// hash changes when moving a value which holds an object.
function testRekey() {
var set = new Set();
var c = 0;
var N = 100;
for (var i = 0; i < N; ++i) {
var k = (i & 1) ? {} : null;
set.add(k);
if (set.has(k)) c++;
minorgc();
if (set.has(k)) c++;
}
assertEq(c, N * 2);
}
testRekey();
|
