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

package/dist/prod/core/owner.js

@@ -1,32 +1,26 @@
-import { REACTIVE_DISPOSED, CONFIG_CHILD_COMPANIONS, STATUS_PENDING, CONFIG_AUTO_DISPOSE, REACTIVE_ZOMBIE, REACTIVE_IN_HEAP, REACTIVE_IN_HEAP_HEIGHT, CONFIG_TRANSPARENT, defaultContext } from "./constants.js";
+import { defaultContext, CONFIG_TRANSPARENT, REACTIVE_DISPOSED, STATUS_PENDING, REACTIVE_FRAME_READ, CONFIG_AUTO_DISPOSE, REACTIVE_ZOMBIE } from "./constants.js";
 
-import { context, runWithOwner, pendingCheckActive, latestReadActive, tracking } from "./core.js";
+import { context, runWithOwner, tracking } from "./core.js";
 
 import { clearDeps, unobserved } from "./graph.js";
 
-import { deleteFromHeap, queueFor, insertIntoHeap, insertIntoHeapHeight } from "./heap.js";
+import { deleteFromHeap } from "./heap.js";
 
-import { GlobalQueue, wokenTransitions, schedule, zombieQueue, dirtyQueue, globalQueue } from "./scheduler.js";
+import { schedule, dirtyQueue } from "./scheduler.js";
 
-const PENDING_OWNER = {};
-
- // Dummy owner to trigger store's read() path
+// L2 (step 2): the parked frame. A pass parks the previous frame's children
+// and `_disposal` list on `_x._pendingFirstChild` / `_x._pendingDisposal`
+// (`parkChildren`, core.ts); they keep reacting until the node's commit
+// disposes them (`zombie` walk below) or the owner dies. `markDisposal` flags
+// the parked subtree REACTIVE_ZOMBIE: the splice guard and the reawaken path
+// 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.tn;
+    let n = e.Ve;
     while (n) {
-        const e = n.oe;
-        n.oe = e | REACTIVE_ZOMBIE;
-        // migrate height-adjust entries too, not just recompute entries: every
-        // `deleteFromHeap` call site picks the queue from the zombie flag, so a
-        // node left physically linked in `dirtyQueue` after being zombified gets
-        // unlinked from the wrong queue on dispose, corrupting the bucket and
-        // livelocking the next `runHeap` that reaches it (#2759)
-                if (e & (REACTIVE_IN_HEAP | REACTIVE_IN_HEAP_HEIGHT)) {
-            deleteFromHeap(n, e & REACTIVE_ZOMBIE ? zombieQueue : dirtyQueue);
-            if (e & REACTIVE_IN_HEAP) insertIntoHeap(n, zombieQueue); else insertIntoHeapHeight(n, zombieQueue);
-        }
+        n.R |= REACTIVE_ZOMBIE;
         markDisposal(n);
-        n = n.un;
+        n = n.ge;
     }
 }
 
@@ -37,44 +31,32 @@ 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.C &= ~CONFIG_AUTO_DISPOSE;
+    e.i &= ~CONFIG_AUTO_DISPOSE;
     unobserved(e);
 }
 
 function disposeChildren(e, n = false, t) {
-    const i = e.oe;
+    const i = e.R;
     if (i & REACTIVE_DISPOSED) return;
-    // A previous frame parked as zombies (#3404) dies with its owner (#3024):
-    // the commit that would retire it returns on the DISPOSED flag set below,
-    // so it drains here or its cleanups never run and the zombies stay
-    // subscribed, to rerun in a torn-down tree (#3561). Death only (`self`):
-    // a rerun's `disposeChildren(el)` leaves the frame rendering until commit.
-        if (n && !t && e.o !== null && (e.o._n !== null || e.o.fn !== null)) disposeChildren(e, false, true);
+    // 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) {
-        e.oe = i | REACTIVE_DISPOSED;
-        // Companions are created detached and outlive their owner, but a verdict
-        // must not: a disposed source can never settle, so an isPending companion
-        // latched `true` here would hold a spinner forever (INV-9, the PR #2845
-        // edge). Snap runs after the DISPOSED flag is set so the oracle reads
-        // false, and notifies subscribers still watching the companion.
-                const n = e;
-        if (n.o?.Ze || n.o?.He) GlobalQueue.ri(n);
-        // A firewall's leaves have no lifecycle of their own, so a companion on
-        // one of them outlives its source the same way (INV-9's rationale). The
-        // firewall knows which leaves carry companions (CONFIG_CHILD_COMPANIONS,
-        // #3038): snap them with it — the snap retires a shadow whose firewall is
-        // disposed (spec O5).
-                if (n.C & CONFIG_CHILD_COMPANIONS) n.o.Un.forEach(GlobalQueue.ri);
-        // A pending reader parked in a transaction may be the only thing holding
-        // it (#3372): its death is a completion event the transaction must be
-        // re-judged for, and nothing else re-enters a parked transaction.
-                const t = n.we;
-        if (t && n.h & STATUS_PENDING && !wokenTransitions.includes(t)) wokenTransitions.push(t), 
-        schedule();
+        e.R = i | REACTIVE_DISPOSED;
+    }
+    if (n && e.ee) {
+        if (e.m !== null) e.m.Te = 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 (n && e.he && e.o !== null) e.o.Ce = null;
-    let l = t ? e.o?._n ?? null : e.tn;
-    if (!t) e.tn = null;
+    let l = t ? e.m.Qe : e.Ve;
+    if (t) e.m.Qe = null; else e.Ve = null;
     while (l) {
         const e = l;
         // Owner teardown is death regardless of the child's own lifecycle
@@ -84,7 +66,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.C &= ~CONFIG_AUTO_DISPOSE;
+                e.i &= ~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 —
@@ -92,50 +74,49 @@ function disposeChildren(e, n = false, t) {
         // comes back to life (post-unmount runs, leaked cleanups, #2983).
         // deleteFromHeap self-guards on the in-heap flags (and tolerates plain
         // Owners, whose _flags is undefined), so no gate here.
-                deleteFromHeap(e, queueFor(e));
+                deleteFromHeap(e, dirtyQueue);
         clearDeps(e);
         // The chain is detached above so a node a cleanup links mid-drain lands
         // 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.gn = l;
+                l.Ke = 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.un;
+                l = l.ge;
     }
-    if (t) {
-        if (e.o !== null) e.o._n = null;
-    } else e.En = 0;
+    if (!t) e.Be = 0;
     // O(1) splice out of parent's chain on individual dispose. Skipped during
-    // batch dispose (parent already disposed) and zombie disposal (node sits on
-    // parent's _pendingFirstChild). 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.oe & REACTIVE_DISPOSED)) {
-        const n = e.gn;
-        const t = e.un;
-        if (n !== null) n.un = t; else e._parent.tn = t;
-        if (t !== null) t.gn = n;
-        e.gn = null;
+    // 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;
     }
     runDisposal(e, t);
     // Final effect-returned cleanup fires at true disposal, after `_disposal`
     // to mirror rerun ordering (compute-phase teardown first, cleanup last).
-        if (n && e.wn) {
-        const n = e.wn;
-        e.wn = undefined;
+        if (n && e.st) {
+        const n = e.st;
+        e.st = undefined;
         n();
     }
 }
 
 function linkChild(e, n) {
-    const t = e.tn;
-    n.gn = null;
-    n.un = t;
-    if (t !== null) t.gn = n;
-    e.tn = n;
+    const t = e.Ve;
+    n.Ke = null;
+    n.ge = t;
+    if (t !== null) t.Ke = n;
+    e.Ve = n;
 }
 
 function runDisposal(e, n) {
@@ -145,9 +126,9 @@ 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.o?.fn : e.qe;
+    const t = n ? e.m.ve : e.Re;
     if (!t) return;
-    if (n) e.o.fn = null; else e.qe = null;
+    if (n) e.m.ve = null; else e.Re = null;
     if (Array.isArray(t)) {
         // Unwind order (#3572, restores 1.x #1562): later registrations run
         // before earlier ones. Children have already been disposed by the caller,
@@ -164,8 +145,8 @@ function runDisposal(e, n) {
 
 function childId(e, n) {
     let t = e;
-    while (t.C & CONFIG_TRANSPARENT && t._parent) t = t._parent;
-    if (t.id != null) return formatId(t.id, n ? t.En++ : t.En);
+    while (t.i & CONFIG_TRANSPARENT && t._parent) t = t._parent;
+    if (t.id != null) return formatId(t.id, n ? t.Be++ : t.Be);
     throw new Error("");
 }
 
@@ -216,7 +197,6 @@ function formatId(e, n) {
  * }
  * ```
  */ function getObserver() {
-    if (pendingCheckActive || latestReadActive) return PENDING_OWNER;
     return tracking ? context : null;
 }
 
@@ -246,14 +226,14 @@ function formatId(e, n) {
  * checks. `cleanup()` is the unchecked primitive used by internals.
  */ function cleanup(e) {
     if (!context) return e;
-    if (!context.qe) context.qe = e; else if (Array.isArray(context.qe)) context.qe.push(e); else context.qe = [ context.qe, e ];
+    if (!context.Re) context.Re = e; else if (Array.isArray(context.Re)) context.Re.push(e); else context.Re = [ context.Re, e ];
     return e;
 }
 
 /**
- * Returns `true` if the owner has been disposed (or marked zombie pending
- * disposal). Pair with a captured owner to bail out of late callbacks whose
- * surrounding component already unmounted.
+ * Returns `true` if the owner has been disposed. Pair with a captured owner
+ * to bail out of late callbacks whose surrounding component already
+ * unmounted.
  *
  * @example
  * ```ts
@@ -266,7 +246,7 @@ function formatId(e, n) {
  * }
  * ```
  */ function isDisposed(e) {
-    return !!(e.oe & (REACTIVE_DISPOSED | REACTIVE_ZOMBIE));
+    return !!(e.R & REACTIVE_DISPOSED);
 }
 
 function disposeRootSelf(e = true) {
@@ -289,17 +269,16 @@ function disposeRootSelf(e = true) {
     // is a plain store rather than a shape fork between labelled and plain roots.
         const i = {
         id: inheritId(e, t, n),
-        C: t ? CONFIG_TRANSPARENT : 0,
-        Wn: true,
-        qn: n?.Wn ? n.qn : n,
-        tn: null,
-        un: null,
-        gn: null,
-        qe: null,
-        T: n?.T ?? globalQueue,
-        Je: n?.Je || defaultContext,
-        En: 0,
-        o: null,
+        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,
         _parent: n,
         dispose: disposeRootSelf
     };