@solidjs/signals 2.0.0-rc.8 → 2.0.0-rc.9

package/dist/observe/core/attribution-costs.js

@@ -0,0 +1,66 @@
+import { registerFold, rootsOf } from "./attribution.js";
+
+/**
+ * `costs()` — the cost tables: scopes ranked by the self-time they burn,
+ * root writes ranked by the downstream re-run time they cause. Folded from
+ * every `RerunEvent` as the engine records it.
+ *
+ * Its own module on purpose: the tables register with the engine's fold seam
+ * when this module is evaluated, so an observe-tier consumer that only
+ * subscribes to records (an APM adapter) never ships the accumulation or the
+ * tables; a consumer that imports `costs` gets both. Reset with the engine on
+ * `enable()`/`disable()`.
+ */ const scopeCosts = new Map;
+
+const writeCosts = new Map;
+
+function recordCosts(s, o) {
+    let t = scopeCosts.get(s);
+    if (t === undefined) {
+        t = {
+            name: o.nodeName,
+            kind: o.nodeKind,
+            runs: 0,
+            selfMs: 0,
+            wastedMs: 0,
+            overlayMs: 0
+        };
+        scopeCosts.set(s, t);
+    }
+    t.runs++;
+    t.selfMs += o.selfMs;
+    if (o.phase !== "plain") t.overlayMs += o.selfMs; else if (!o.changed && !o.held) t.wastedMs += o.selfMs;
+    const e = new Set;
+    rootsOf(o.causes, e);
+    for (const s of e) {
+        let t = writeCosts.get(s);
+        if (t === undefined) writeCosts.set(s, t = {
+            name: s,
+            runs: 0,
+            downstreamMs: 0
+        });
+        t.runs++;
+        t.downstreamMs += o.selfMs;
+    }
+}
+
+registerFold({
+    rerun: recordCosts,
+    reset() {
+        scopeCosts.clear();
+        writeCosts.clear();
+    }
+});
+
+/**
+ * Aggregated cost tables since `enable()`: `scopes` ranked by self-time
+ * (with `wastedMs` = time spent on unchanged-value runs), `writes` ranked by
+ * total downstream re-run time each root write caused.
+ */ function costs() {
+    return {
+        scopes: [ ...scopeCosts.values() ].sort((s, o) => o.selfMs - s.selfMs),
+        writes: [ ...writeCosts.values() ].sort((s, o) => o.downstreamMs - s.downstreamMs)
+    };
+}
+
+export { costs };

package/dist/observe/core/attribution-feedback.js

@@ -0,0 +1,282 @@
+import { registerFold, now, isSilentHold, isLongHold, formatOrigin, nodeName } from "./attribution.js";
+
+import { ownerPath } from "./dev.js";
+
+/**
+ * `feedback()` — what the user waited on, as ranked tables. Folded from the
+ * records the engine already keeps (holds, the interaction on each re-run,
+ * navigations) and two censuses the engine reports as they happen (flights
+ * started/landed/abandoned per async source; fallback shows per boundary).
+ *
+ * Its own module on purpose: the tables register with the engine's fold seam
+ * when this module is evaluated, so an observe-tier consumer that only
+ * subscribes to records never ships them. Reset with the engine on
+ * `enable()`/`disable()`.
+ */ const feedbackSources = new Map;
+
+const feedbackInteractions = new Map;
+
+const feedbackNavigations = new Map;
+
+const flightStats = new Map;
+
+const fallbackStats = new Map;
+
+const FALLBACK_FLASH_MS = 150;
+
+function flightBucket(e) {
+    let n = flightStats.get(e);
+    if (n === undefined) {
+        n = {
+            source: nodeName(e),
+            flights: 0,
+            landed: 0,
+            abandoned: 0,
+            landedMs: 0,
+            worstMs: 0
+        };
+        flightStats.set(e, n);
+    }
+    return n;
+}
+
+function trackFallback(e, n, t) {
+    let i = fallbackStats.get(e);
+    if (i === undefined) {
+        i = {
+            row: {
+                boundary: "boundary",
+                shows: 0,
+                shownMs: 0,
+                worstMs: 0,
+                flashes: 0
+            },
+            shownAt: null
+        };
+        fallbackStats.set(e, i);
+    }
+    // The first show can fire before the subtree exists; name on first sight.
+        if (i.row.boundary === "boundary" && n !== undefined) {
+        const e = ownerPath(n);
+        if (e !== undefined) i.row.boundary = e.join(" › ");
+    }
+    if (t) {
+        if (i.shownAt === null) {
+            i.shownAt = now();
+            i.row.shows++;
+        }
+        return;
+    }
+    if (i.shownAt === null) return;
+    const s = now() - i.shownAt;
+    i.shownAt = null;
+    i.row.shownMs += s;
+    if (s > i.row.worstMs) i.row.worstMs = s;
+    if (s < FALLBACK_FLASH_MS) i.row.flashes++;
+}
+
+function interactionBucket(e) {
+    const n = formatOrigin(e);
+    let t = feedbackInteractions.get(n);
+    if (t === undefined) {
+        t = {
+            row: {
+                interaction: n,
+                dispatches: 0,
+                runs: 0,
+                selfMs: 0,
+                worstDispatchMs: 0,
+                holds: 0,
+                heldMs: 0,
+                silentMs: 0,
+                worstHoldMs: 0
+            },
+            dispatches: new Map
+        };
+        feedbackInteractions.set(n, t);
+    }
+    const i = e.at ?? 0;
+    if (!t.dispatches.has(i)) {
+        t.dispatches.set(i, 0);
+        t.row.dispatches++;
+    }
+    return t;
+}
+
+function recordFeedbackRun(e) {
+    if (e.interaction === undefined) return;
+    const n = interactionBucket(e.interaction);
+    n.row.runs++;
+    n.row.selfMs += e.selfMs;
+    const t = e.interaction.at ?? 0;
+    const i = n.dispatches.get(t) + e.selfMs;
+    n.dispatches.set(t, i);
+    if (i > n.row.worstDispatchMs) n.row.worstDispatchMs = i;
+}
+
+function recordFeedbackHold(e) {
+    const n = [ ...e.blockers ].sort();
+    const t = n.join("\0");
+    let i = feedbackSources.get(t);
+    if (i === undefined) {
+        i = {
+            row: {
+                sources: n,
+                holds: 0,
+                heldMs: 0,
+                worstMs: 0,
+                silent: 0,
+                silentMs: 0,
+                latestOnly: 0,
+                long: 0,
+                longMs: 0,
+                acknowledgedBy: [],
+                interactions: [],
+                writes: [],
+                actions: 0
+            },
+            acks: new Map,
+            interactions: new Map,
+            writes: new Set
+        };
+        feedbackSources.set(t, i);
+    }
+    const s = i.row;
+    const o = isSilentHold(e);
+    s.holds++;
+    s.heldMs += e.holdMs;
+    if (e.holdMs > s.worstMs) s.worstMs = e.holdMs;
+    if (o) {
+        s.silent++;
+        s.silentMs += e.holdMs;
+    } else if (e.acknowledgements.length > 0 && e.acknowledgements.every(e => e.kind === "latest")) s.latestOnly++;
+    if (isLongHold(e)) {
+        s.long++;
+        s.longMs += e.tailMs;
+    }
+    if (e.action) s.actions++;
+    for (const n of e.acknowledgements) {
+        const e = `${n.kind}:${n.source}`;
+        i.acks.set(e, (i.acks.get(e) ?? 0) + 1);
+    }
+    for (const n of e.heldWrites) i.writes.add(n.name);
+    if (e.interaction !== undefined) {
+        const n = formatOrigin(e.interaction);
+        i.interactions.set(n, (i.interactions.get(n) ?? 0) + 1);
+        const t = interactionBucket(e.interaction);
+        t.row.holds++;
+        t.row.heldMs += e.holdMs;
+        if (o) t.row.silentMs += e.holdMs;
+        if (e.holdMs > t.row.worstHoldMs) t.row.worstHoldMs = e.holdMs;
+    }
+}
+
+function recordFeedbackNavigation(e) {
+    const n = e.name ?? e.to;
+    if (n === undefined) return;
+    let t = feedbackNavigations.get(n);
+    if (t === undefined) {
+        t = {
+            name: n,
+            navigations: 0,
+            settledMs: 0,
+            worstMs: 0,
+            held: 0,
+            heldMs: 0,
+            silent: 0,
+            superseded: 0,
+            redirected: 0
+        };
+        feedbackNavigations.set(n, t);
+    }
+    t.navigations++;
+    if (e.redirects !== undefined) t.redirected++;
+    if (e.outcome === "superseded") {
+        t.superseded++;
+        return;
+    }
+    const i = e.settledMs;
+    t.settledMs += i;
+    if (i > t.worstMs) t.worstMs = i;
+    if (e.outcome === "held") {
+        t.held++;
+        t.heldMs += e.hold?.holdMs ?? i;
+        if (e.hold !== undefined && isSilentHold(e.hold)) t.silent++;
+    }
+}
+
+function rankedCounts(e, n) {
+    return [ ...e ].sort((e, n) => n[1] - e[1]).map(([e, t]) => ({
+        [n]: e,
+        holds: t
+    }));
+}
+
+registerFold({
+    rerun: (e, n) => recordFeedbackRun(n),
+    hold: recordFeedbackHold,
+    navigation: recordFeedbackNavigation,
+    flightStart(e, n) {
+        const t = flightBucket(e);
+        t.flights++;
+        if (n) t.abandoned++;
+    },
+    flightLanded(e, n) {
+        const t = flightBucket(e);
+        t.landed++;
+        t.landedMs += n;
+        if (n > t.worstMs) t.worstMs = n;
+    },
+    fallback: trackFallback,
+    reset() {
+        feedbackSources.clear();
+        feedbackInteractions.clear();
+        feedbackNavigations.clear();
+        flightStats.clear();
+        fallbackStats.clear();
+    }
+});
+
+/**
+ * What the user waited on, folded from holds and the interaction on each
+ * re-run: `sources` ranks async sources by the silent time writes spent held
+ * behind them (with which affordances answered, how often, and which
+ * interactions were held); `interactions` ranks user events by the total time
+ * they cost — re-run work caused (long-flush hazard) beside time held
+ * (silent-hold hazard). Facts at every duration; SILENT_HOLD is the
+ * thresholded verdict. Three more tables round out the picture: `navigations`
+ * ranks routes by the time spent held navigating to them (folded from settled
+ * navigations), `flights` counts each async source's flights and how many
+ * were abandoned before landing (the re-ask storm), and `fallbacks` measures
+ * how long each loading boundary showed its fallback and how often that was a
+ * flash.
+ */ function feedback() {
+    const e = [ ...feedbackNavigations.values() ].map(e => ({
+        ...e
+    })).sort((e, n) => n.heldMs - e.heldMs || n.settledMs - e.settledMs);
+    const n = [ ...flightStats.values() ].map(e => ({
+        ...e
+    })).sort((e, n) => n.abandoned - e.abandoned || n.flights - e.flights);
+    const t = [ ...fallbackStats.values() ].map(e => ({
+        ...e.row
+    })).sort((e, n) => n.flashes - e.flashes || n.shownMs - e.shownMs);
+    const i = [ ...feedbackSources.values() ].map(e => ({
+        ...e.row,
+        acknowledgedBy: rankedCounts(e.acks, "by"),
+        interactions: rankedCounts(e.interactions, "interaction"),
+        writes: [ ...e.writes ]
+    })).sort((e, n) => n.silentMs - e.silentMs || n.heldMs - e.heldMs);
+    // Ranked by the total time the user spent on it: held plus synchronous work.
+        const s = [ ...feedbackInteractions.values() ].map(e => ({
+        ...e.row
+    })).sort((e, n) => n.heldMs + n.selfMs - (e.heldMs + e.selfMs));
+    return {
+        sources: i,
+        interactions: s,
+        navigations: e,
+        flights: n,
+        fallbacks: t
+    };
+}
+
+export { feedback };

package/dist/observe/core/attribution-hooks.js

@@ -1,7 +1,17 @@
 let attrHooks = null;
 
+/**
+ * The installed engine, registered on `globalThis` as well (the records
+ * channel's reason, see `Records`): a wire layer bundled without a framework
+ * import — `@solidjs/web`'s server-function client — stamps the records it
+ * emits through the engine's `currentOrigin`, and this is its reach. The
+ * module binding stays the core's own read (one null check per hook site);
+ * the registration mirrors it.
+ */ const INSTALLED = Symbol.for("@solidjs/signals/observe/attribution");
+
 function setAttributionHooks(t) {
     attrHooks = t;
+    globalThis[INSTALLED] = t ?? undefined;
 }
 
 /**
@@ -57,4 +67,16 @@ function setAttributionHooks(t) {
     }
 }
 
-export { attrHooks, setAttributionHooks, withInteraction, withOrigin };
+/**
+ * The provenance a root write performed now would carry, as the installed
+ * engine sees it (`AttributionHooks.currentOrigin`); `undefined` with no
+ * engine, or when nothing is in effect. Reachable as
+ * `OBSERVE.attribution.currentOrigin` — how a runtime stamps a fact of its
+ * own (a server-function call) with the interaction or navigation it ran
+ * for, so an observer joins the two by identity.
+ */ function currentOrigin() {
+    const t = attrHooks;
+    return t === null ? undefined : t.currentOrigin();
+}
+
+export { attrHooks, currentOrigin, setAttributionHooks, withInteraction, withOrigin };

package/dist/observe/core/attribution-queries.js

@@ -0,0 +1,28 @@
+import { nodeName, attribution } from "./attribution.js";
+
+import { $REFRESH } from "./constants.js";
+
+import { subjectOf } from "./dev.js";
+
+/**
+ * Point queries over the engine's live state — the devtools/console view of
+ * one scope. Their own module so a records-only consumer never ships them;
+ * they read the engine's ring buffer and the graph, and register nothing.
+ */
+/** The node behind a memo/effect accessor, or the raw node passed through. */ function nodeOf(t) {
+    return t?.[$REFRESH] ?? t;
+}
+
+/** Re-run history for one node — pass a memo/effect accessor or raw node. */ function why(t) {
+    const n = nodeOf(t);
+    return attribution.history().filter(t => subjectOf(t) === n);
+}
+
+/** Current dependency names of one scope — the devtools subscription view. */ function subscriptions(t) {
+    const n = nodeOf(t);
+    const o = [];
+    for (let t = n?.ee ?? null; t !== null; t = t.te) o.push(nodeName(t.re));
+    return o;
+}
+
+export { subscriptions, why };