summaryrefslogtreecommitdiffstats
path: root/js/src/jit-test/tests/cacheir/set-has-nongcthing.js
diff options
context:
space:
mode:
authorDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-07 19:33:14 +0000
committerDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-07 19:33:14 +0000
commit36d22d82aa202bb199967e9512281e9a53db42c9 (patch)
tree105e8c98ddea1c1e4784a60a5a6410fa416be2de /js/src/jit-test/tests/cacheir/set-has-nongcthing.js
parentInitial commit. (diff)
downloadfirefox-esr-upstream.tar.xz
firefox-esr-upstream.zip
Adding upstream version 115.7.0esr.upstream/115.7.0esrupstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'js/src/jit-test/tests/cacheir/set-has-nongcthing.js')
-rw-r--r--js/src/jit-test/tests/cacheir/set-has-nongcthing.js110
1 files changed, 110 insertions, 0 deletions
diff --git a/js/src/jit-test/tests/cacheir/set-has-nongcthing.js b/js/src/jit-test/tests/cacheir/set-has-nongcthing.js
new file mode 100644
index 0000000000..a5a64e0333
--- /dev/null
+++ b/js/src/jit-test/tests/cacheir/set-has-nongcthing.js
@@ -0,0 +1,110 @@
+// 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 testInt32(n) {
+ var xs = [1, 2];
+ var ys = [3, 4];
+ 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(testInt32);
+
+function testDouble(n) {
+ var xs = [Math.PI, Infinity];
+ var ys = [Math.E, -Infinity];
+ 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(testDouble);
+
+function testZero(n) {
+ var xs = [0, -0];
+ var ys = [1, -1];
+ var zs = [...xs, ...ys];
+ var set = createSet([0], 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(testZero);
+
+function testNaN(n) {
+ var xs = [NaN, -NaN];
+ var ys = [1, -1];
+ var zs = [...xs, ...ys];
+ var set = createSet([NaN], 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(testNaN);
+
+function testUndefinedAndNull(n) {
+ var xs = [undefined, null];
+ var ys = [1, -1];
+ 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(testUndefinedAndNull);
+
+function testBoolean(n) {
+ var xs = [true, false];
+ var ys = [1, -1];
+ 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(testBoolean);