@solidjs/signals 2.0.0-rc.15 → 2.0.0-rc.17

package/dist/prod/core/owner.js

@@ -1,12 +1,12 @@
-import { defaultContext, CONFIG_TRANSPARENT, REACTIVE_DISPOSED, STATUS_PENDING, REACTIVE_FRAME_READ, CONFIG_AUTO_DISPOSE, REACTIVE_ZOMBIE } from "./constants.js";
+import { defaultContext, CONFIG_TRANSPARENT, REACTIVE_NONE, REACTIVE_DISPOSED, CONFIG_AUTO_DISPOSE, STATUS_PENDING, REACTIVE_FRAME_READ, REACTIVE_ZOMBIE } from "./constants.js";
 
 import { context, runWithOwner, tracking } from "./core.js";
 
-import { clearDeps, unobserved } from "./graph.js";
+import { unobserved, clearDeps } from "./graph.js";
 
 import { deleteFromHeap } from "./heap.js";
 
-import { schedule, dirtyQueue } from "./scheduler.js";
+import { globalQueue, schedule, dirtyQueue } from "./scheduler.js";
 
 // L2 (step 2): the parked frame. A pass parks the previous frame's children
 // and `_disposal` list on `_x._pendingFirstChild` / `_x._pendingDisposal`
@@ -16,11 +16,11 @@ import { schedule, dirtyQueue } from "./scheduler.js";
 // key off it, and the heap defers a zombie's recompute past the seam (no
 // second heap — the deferral list in scheduler.ts).
 function markDisposal(e) {
-    let n = e.Ve;
+    let n = e.De;
     while (n) {
         n.R |= REACTIVE_ZOMBIE;
         markDisposal(n);
-        n = n.ge;
+        n = n.pe;
     }
 }
 
@@ -31,32 +31,56 @@ function dispose(e) {
     // left queued would be recomputed and resurrected by the next flush (#2983)
     // — dep unlinking, child disposal) is exactly unobserved()'s body; only
     // this flag distinguishes death from dormancy.
-    e.i &= ~CONFIG_AUTO_DISPOSE;
+    e.l &= ~CONFIG_AUTO_DISPOSE;
     unobserved(e);
 }
 
-function disposeChildren(e, n = false, t) {
-    const i = e.R;
-    if (i & REACTIVE_DISPOSED) return;
+// The first error a cleanup threw, boxed so a thrown `undefined` still
+// counts. A throwing cleanup stops neither its siblings nor the rest of the
+// tree: every cleanup runs. The error is rethrown once the teardown is over:
+// by a root's dispose call outside a flush (`disposeRootSelf`), otherwise when
+// the flush ends (`flush`; `runCleanup` schedules one), so a flush is never
+// left half-applied. A halt drops it: the error that halted is the one
+// reported, and a stale one must not surface from a later, unrelated dispose.
+let cleanupError;
+
+/** Runs a cleanup or `unobserved` hook; a throw is collected, not raised. @internal */ function runCleanup(e) {
+    try {
+        e();
+    } catch (e) {
+        cleanupError ||= [ e ];
+        schedule();
+    }
+}
+
+/** Rethrows the error `runCleanup` collected, once; `drop` discards it. @internal */ function rethrowCleanupError(e) {
+    const n = cleanupError;
+    cleanupError = undefined;
+    if (n && !e) throw n[0];
+}
+
+function disposeChildren(e, n = false, r) {
+    const t = e.R;
+    if (t & REACTIVE_DISPOSED) return;
     // A parked frame dies with its owner (#3024): the commit that would retire
     // it never comes once the node is DISPOSED, so it drains here or its
     // cleanups never run and it stays subscribed, rerunning in a torn-down
     // tree (#3561). Death only (`self`): a re-pass leaves the frame reacting
     // until the commit.
-        if (n && !t && e.m !== null && (e.m.Qe !== null || e.m.ve !== null)) disposeChildren(e, false, true);
+        if (n && !r && e.T !== null && (e.T.Ue !== null || e.T.me !== null)) disposeChildren(e, false, true);
     if (n) {
-        e.R = i | REACTIVE_DISPOSED;
+        e.R = t | REACTIVE_DISPOSED;
     }
-    if (n && e.ee) {
-        if (e.m !== null) e.m.Te = null;
+    if (n && e.X) {
+        if (e.T !== null) e.T.Se = null;
         // A death that can unblock the future (L2, `futureBlocked`): a held
         // flight's — a transaction's or a lane's (its `_x._transaction`) — or a
         // stale reader's (REACTIVE_FRAME_READ — a frame that derived from one).
         // Nothing else re-examines a dead node, so make sure a seam comes.
-                if (e.S & STATUS_PENDING && e.m?.He != null || i & REACTIVE_FRAME_READ) schedule();
+                if (e.m & STATUS_PENDING && e.T?.Re != null || t & REACTIVE_FRAME_READ) schedule();
     }
-    let l = t ? e.m.Qe : e.Ve;
-    if (t) e.m.Qe = null; else e.Ve = null;
+    let l = r ? e.T.Ue : e.De;
+    if (r) e.T.Ue = null; else e.De = null;
     while (l) {
         const e = l;
         // Owner teardown is death regardless of the child's own lifecycle
@@ -66,7 +90,7 @@ function disposeChildren(e, n = false, t) {
         // disposeChildren call early-returns on REACTIVE_DISPOSED) die too.
         // Only unobserved()'s own node keeps its dormancy — it is never in
         // this loop; its children are rebuilt fresh on reawaken.
-                e.i &= ~CONFIG_AUTO_DISPOSE;
+                e.l &= ~CONFIG_AUTO_DISPOSE;
         // Heap removal must not be gated on `_deps`: a dependency-free
         // computation queued by refresh() has a null dep list but still sits in
         // the dirty heap, and left there the post-disposal flush recomputes it —
@@ -80,43 +104,43 @@ function disposeChildren(e, n = false, t) {
         // on the fresh head and survives. Pointing each drained child's prev at
         // itself routes its later splice onto the detached chain, never the head,
         // and keeps the dev owner-chain-head invariant honest for those children.
-                l.Ke = l;
+                l.Ze = l;
         disposeChildren(l, true);
         // Read after, not before: a sibling this disposal made dormant spliced
         // itself out of the detached chain, and a cleanup may then have linked
         // it at the fresh head, which rewrote the `_nextSibling` a pre-read
         // would still be holding.
-                l = l.ge;
+                l = l.pe;
     }
-    if (!t) e.Be = 0;
+    if (!r) e.ye = 0;
     // O(1) splice out of parent's chain on individual dispose. Skipped during
     // batch dispose (parent already disposed) and for a zombie (it sits on the
     // parent's parked frame, drained whole by the commit). We leave
     // node._nextSibling intact so outer walks that already advanced past us
     // still reach later siblings.
-        if (n && !t && !(i & REACTIVE_ZOMBIE) && e._parent !== null && !(e._parent.R & REACTIVE_DISPOSED)) {
-        const n = e.Ke;
-        const t = e.ge;
-        if (n !== null) n.ge = t; else e._parent.Ve = t;
-        if (t !== null) t.Ke = n;
-        e.Ke = null;
+        if (n && !r && !(t & REACTIVE_ZOMBIE) && e._parent !== null && !(e._parent.R & REACTIVE_DISPOSED)) {
+        const n = e.Ze;
+        const r = e.pe;
+        if (n !== null) n.pe = r; else e._parent.De = r;
+        if (r !== null) r.Ze = n;
+        e.Ze = null;
     }
-    runDisposal(e, t);
+    runDisposal(e, r);
     // Final effect-returned cleanup fires at true disposal, after `_disposal`
     // to mirror rerun ordering (compute-phase teardown first, cleanup last).
-        if (n && e.st) {
-        const n = e.st;
-        e.st = undefined;
-        n();
+        if (n && e.Je) {
+        const n = e.Je;
+        e.Je = undefined;
+        runCleanup(n);
     }
 }
 
 function linkChild(e, n) {
-    const t = e.Ve;
-    n.Ke = null;
-    n.ge = t;
-    if (t !== null) t.Ke = n;
-    e.Ve = n;
+    const r = e.De;
+    n.Ze = null;
+    n.pe = r;
+    if (r !== null) r.Ze = n;
+    e.De = n;
 }
 
 function runDisposal(e, n) {
@@ -126,27 +150,26 @@ function runDisposal(e, n) {
     // walk ran every entry a second time. Detached, the re-entrant drain finds
     // nothing. The same shape latched a throwing cleanup: the list survived the
     // throw and every later drain re-ran and re-threw it.
-    const t = n ? e.m.ve : e.Re;
-    if (!t) return;
-    if (n) e.m.ve = null; else e.Re = null;
-    if (Array.isArray(t)) {
+    const r = n ? e.T.me : e.He;
+    if (!r) return;
+    if (n) e.T.me = null; else e.He = null;
+    if (Array.isArray(r)) {
         // Unwind order (#3572, restores 1.x #1562): later registrations run
         // before earlier ones. Children have already been disposed by the caller,
         // so with LIFO a body that registers cleanup before creating its children
         // tears down after them — the same order a per-component owner gives.
-        for (let e = t.length - 1; e >= 0; e--) {
-            const n = t[e];
-            n.call(n);
+        for (let e = r.length - 1; e >= 0; e--) {
+            runCleanup(r[e]);
         }
     } else {
-        t.call(t);
+        runCleanup(r);
     }
 }
 
 function childId(e, n) {
-    let t = e;
-    while (t.i & CONFIG_TRANSPARENT && t._parent) t = t._parent;
-    if (t.id != null) return formatId(t.id, n ? t.Be++ : t.Be);
+    let r = e;
+    while (r.l & CONFIG_TRANSPARENT && r._parent) r = r._parent;
+    if (r.id != null) return formatId(r.id, n ? r.ye++ : r.ye);
     throw new Error("");
 }
 
@@ -163,8 +186,8 @@ function childId(e, n) {
  * The id a freshly-created node inherits: an explicit `options.id` wins;
  * transparent nodes share their parent's id; otherwise the parent's next
  * child id is consumed (or `undefined` outside an id-carrying tree).
- */ function inheritId(e, n, t) {
-    return e?.id ?? (n ? t?.id : t?.id != null ? getNextChildId(t) : undefined);
+ */ function inheritId(e, n, r) {
+    return e?.id ?? (n ? r?.id : r?.id != null ? getNextChildId(r) : undefined);
 }
 
 /**
@@ -177,8 +200,8 @@ function childId(e, n) {
 }
 
 function formatId(e, n) {
-    const t = n.toString(36), i = t.length - 1;
-    return e + (i ? String.fromCharCode(64 + i) : "") + t;
+    const r = n.toString(36), t = r.length - 1;
+    return e + (t ? String.fromCharCode(64 + t) : "") + r;
 }
 
 /**
@@ -223,10 +246,12 @@ function formatId(e, n) {
 /**
  * Low-level: registers `fn` as a disposal callback on the current owner.
  * Most code should use `onCleanup()` from `solid-js`, which adds dev-mode
- * checks. `cleanup()` is the unchecked primitive used by internals.
- */ function cleanup(e) {
-    if (!context) return e;
-    if (!context.Re) context.Re = e; else if (Array.isArray(context.Re)) context.Re.push(e); else context.Re = [ context.Re, e ];
+ * checks. `cleanup()` is the unchecked primitive used by internals; `owner`
+ * (internal) targets a specific owner's disposal list instead of the ambient
+ * one.
+ */ function cleanup(e, n = context) {
+    if (!n) return e;
+    if (!n.He) n.He = e; else if (Array.isArray(n.He)) n.He.push(e); else n.He = [ n.He, e ];
     return e;
 }
 
@@ -251,6 +276,9 @@ function formatId(e, n) {
 
 function disposeRootSelf(e = true) {
     disposeChildren(this, e);
+    // Outside a flush the dispose call rethrows; inside one, the flush does.
+    // Kept out of `disposeChildren`, whose hot path it slows.
+        if (cleanupError && !globalQueue.q) rethrowCleanupError();
 }
 
 /**
@@ -262,28 +290,34 @@ function disposeRootSelf(e = true) {
  * @internal
  */ function createOwner(e) {
     const n = context;
-    const t = e?.transparent ?? false;
+    const r = e?.transparent ?? false;
     // Prod and observe boilerplates (see core.ts computed()). The observe
-    // literal carries the `_name` slot the rendering layer fills with the
-    // component label (`owner._name = "<App>"`) — a slot, so labelling a root
-    // is a plain store rather than a shape fork between labelled and plain roots.
-        const i = {
-        id: inheritId(e, t, n),
-        i: t ? CONFIG_TRANSPARENT : 0,
-        $e: true,
-        et: n?.$e ? n.et : n,
-        Ve: null,
-        ge: null,
-        Ke: null,
-        Re: null,
-        D: n?.D || defaultContext,
-        Be: 0,
-        m: null,
+    // literal carries the `_name` and `_loc` slots the rendering layer fills
+    // with the component label and JSX site (`owner._name = "<App>"`,
+    // `owner._loc = "src/App.tsx:3:5"`) — slots, so labelling a root is a
+    // plain store rather than a shape fork between labelled and plain roots.
+        const t = {
+        id: inheritId(e, r, n),
+        l: r ? CONFIG_TRANSPARENT : 0,
+        // Present from birth: disposeChildren marks death here on roots too, and
+        // a first store of a missing property is a shape transition plus a
+        // properties-store allocation per root — on a 100×4 table teardown that
+        // was 12 KB and most of disposal's time (2026-10-17).
+        R: REACTIVE_NONE,
+        Qe: true,
+        Ye: n?.Qe ? n.Ye : n,
+        De: null,
+        pe: null,
+        Ze: null,
+        He: null,
+        A: n?.A || defaultContext,
+        ye: 0,
+        T: null,
         _parent: n,
         dispose: disposeRootSelf
     };
-    if (n) linkChild(n, i);
-    return i;
+    if (n) linkChild(n, t);
+    return t;
 }
 
 /**
@@ -319,10 +353,13 @@ function disposeRootSelf(e = true) {
  * const detached = runWithOwner(null, () => createRoot(d => d));
  * ```
  *
- * @description https://docs.solidjs.com/reference/reactive-utilities/create-root
+ * @description https://v2.solidjs.com/reference/solid-js/advanced/owner-introspection/create-root
  */ function createRoot(e, n) {
-    const t = createOwner(n);
-    return runWithOwner(t, () => e(() => t.dispose()));
+    const r = createOwner(n);
+    // A bound function, not an arrow: an arrow would share this scope, which
+    // holds `init`, so keeping `dispose` would keep `init` and all it closes
+    // over alive (#4095).
+        return runWithOwner(r, () => e(disposeRootSelf.bind(r, true)));
 }
 
-export { cleanup, createOwner, createRoot, dispose, disposeChildren, getNextChildId, getObserver, getOwner, inheritId, isDisposed, linkChild, markDisposal, peekNextChildId };
+export { cleanup, createOwner, createRoot, dispose, disposeChildren, getNextChildId, getObserver, getOwner, inheritId, isDisposed, linkChild, markDisposal, peekNextChildId, rethrowCleanupError, runCleanup };