diff options
author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-19 00:47:55 +0000 |
---|---|---|
committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-19 00:47:55 +0000 |
commit | 26a029d407be480d791972afb5975cf62c9360a6 (patch) | |
tree | f435a8308119effd964b339f76abb83a57c29483 /js/src/jit-test/tests/cacheir/set-has-bigint.js | |
parent | Initial commit. (diff) | |
download | firefox-26a029d407be480d791972afb5975cf62c9360a6.tar.xz firefox-26a029d407be480d791972afb5975cf62c9360a6.zip |
Adding upstream version 124.0.1.upstream/124.0.1
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'js/src/jit-test/tests/cacheir/set-has-bigint.js')
-rw-r--r-- | js/src/jit-test/tests/cacheir/set-has-bigint.js | 84 |
1 files changed, 84 insertions, 0 deletions
diff --git a/js/src/jit-test/tests/cacheir/set-has-bigint.js b/js/src/jit-test/tests/cacheir/set-has-bigint.js new file mode 100644 index 0000000000..24c8889e99 --- /dev/null +++ b/js/src/jit-test/tests/cacheir/set-has-bigint.js @@ -0,0 +1,84 @@ +// 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 testInlineDigitsSameSign(n) { + var xs = [1n, 2n]; + var ys = [3n, 4n]; + var zs = [...xs, ...ys]; + var set = createSet(xs, n); + + var N = 100; + var c = 0; + for (var i = 0; i < N; ++i) { + var z = zs[i & 3]; + if (set.has(z)) c++; + } + assertEq(c, N / 2); +} +runTest(testInlineDigitsSameSign); + +function testInlineDigitsDifferentSign(n) { + var xs = [-1n, 2n]; + var ys = [1n, -2n]; + var zs = [...xs, ...ys]; + var set = createSet(xs, n); + + var N = 100; + var c = 0; + for (var i = 0; i < N; ++i) { + var z = zs[i & 3]; + if (set.has(z)) c++; + } + assertEq(c, N / 2); +} +runTest(testInlineDigitsDifferentSign); + +function testHeapDigitsSameSign(n) { + // Definitely uses heap digits. + var heap = 2n ** 1000n; + + var xs = [heap + 1n, heap + 2n]; + var ys = [heap + 3n, heap + 4n]; + var zs = [...xs, ...ys]; + var set = createSet(xs, n); + + var N = 100; + var c = 0; + for (var i = 0; i < N; ++i) { + var z = zs[i & 3]; + if (set.has(z)) c++; + } + assertEq(c, N / 2); +} +runTest(testHeapDigitsSameSign); + +function testHeapDigitsDifferentSign(n) { + // Definitely uses heap digits. + var heap = 2n ** 1000n; + + var xs = [-(heap + 1n), heap + 2n]; + var ys = [heap + 1n, -(heap + 2n)]; + var zs = [...xs, ...ys]; + var set = createSet(xs, n); + + var N = 100; + var c = 0; + for (var i = 0; i < N; ++i) { + var z = zs[i & 3]; + if (set.has(z)) c++; + } + assertEq(c, N / 2); +} +runTest(testHeapDigitsDifferentSign); |