From 26a029d407be480d791972afb5975cf62c9360a6 Mon Sep 17 00:00:00 2001
From: Daniel Baumann <daniel.baumann@progress-linux.org>
Date: Fri, 19 Apr 2024 02:47:55 +0200
Subject: Adding upstream version 124.0.1.

Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
---
 .../finalizationRegistry-cleanupSome-recursive.js  | 51 ++++++++++++++++++++++
 1 file changed, 51 insertions(+)
 create mode 100644 js/src/jit-test/tests/gc/finalizationRegistry-cleanupSome-recursive.js

(limited to 'js/src/jit-test/tests/gc/finalizationRegistry-cleanupSome-recursive.js')

diff --git a/js/src/jit-test/tests/gc/finalizationRegistry-cleanupSome-recursive.js b/js/src/jit-test/tests/gc/finalizationRegistry-cleanupSome-recursive.js
new file mode 100644
index 0000000000..3245c1cff3
--- /dev/null
+++ b/js/src/jit-test/tests/gc/finalizationRegistry-cleanupSome-recursive.js
@@ -0,0 +1,51 @@
+// Test trying to call cleanupSome recursively in callback.
+
+// 0: Initial state.
+// 1: Attempt recursive calls.
+// 2: After recursive calls.
+let state = 0;
+
+let registry = new FinalizationRegistry(x => {
+  if (state === 0) {
+    state = 1;
+    try {
+      registry.cleanupSome();
+    } catch (e) {
+      // Pass the test if any error was thrown.
+      return;
+    } finally {
+      state = 2;
+    }
+    throw new Error("expected stack overflow error");
+  }
+
+  if (state === 1) {
+    registry.cleanupSome();
+  }
+});
+
+// Attempt to find the maximum supported stack depth.
+var stackSize = 0;
+function findStackSize(i) {
+  try {
+    stackSize = i;
+    findStackSize(i + 1);
+  } catch (e) {
+    return;
+  }
+}
+findStackSize(0);
+
+// Multiply the calculated stack size by some factor just to be on the safe side.
+const exceedStackDepthLimit = stackSize * 5;
+
+let values = [];
+for (let i = 0; i < exceedStackDepthLimit; ++i) {
+  let v = {};
+  registry.register(v, i);
+  values.push(v);
+}
+values.length = 0;
+
+gc();
+drainJobQueue();
-- 
cgit v1.2.3