@opencodehub/ingestion 0.1.0

package/dist/pipeline/phases/cross-file.js

@@ -0,0 +1,411 @@
+/**
+ * Cross-file phase — upgrade low-confidence CALLS edges after every file
+ * has contributed its exports.
+ *
+ * At parse time every call site is resolved through the three-tier
+ * {@link resolve} helper (same-file → import-scoped → global). A call that
+ * only matches at the global tier is emitted with confidence 0.5 because we
+ * cannot prove which declaration the call targets. Once the whole repo has
+ * been parsed we can do better: if the caller file imports a module that
+ * now exports a matching identifier, the call is *import-scoped* in
+ * hindsight and deserves confidence 0.9.
+ *
+ * Strategy:
+ *  1. Build a directed import graph of repository files (skip external npm
+ *     specifiers — they were already dropped at parse time).
+ *  2. Run Tarjan's SCC algorithm on that graph. Circular imports collapse
+ *     into a single component; we still visit every file in a component.
+ *  3. Topologically sort the condensation so dependencies of file F are
+ *     processed before F. Inside a component, order by filename for
+ *     determinism.
+ *  4. For each file, walk every low-confidence (0.5) CALLS edge. Re-run
+ *     the resolution strategy with the symbol index. If it now produces a
+ *     higher-tier candidate, re-add the edge with the better confidence;
+ *     the graph's dedupe keeps the stronger edge.
+ *
+ * Determinism: SCC discovery order is driven by sorted file iteration, and
+ * condensation order is produced by Kahn's algorithm with a lexical tie
+ * break. Two runs on the same repo produce identical edge upgrades.
+ */
+import { makeNodeId } from "@opencodehub/core-types";
+import { getProvider } from "../../providers/registry.js";
+import { CONFIDENCE_BY_TIER, resolve, } from "../../providers/resolution/context.js";
+import { buildFilePathLookup, partitionPriorEdges, resolveIncrementalView, } from "./incremental-helper.js";
+import { INCREMENTAL_SCOPE_PHASE_NAME } from "./incremental-scope.js";
+import { ORM_PHASE_NAME } from "./orm.js";
+import { PARSE_PHASE_NAME } from "./parse.js";
+import { ROUTES_PHASE_NAME } from "./routes.js";
+import { TOOLS_PHASE_NAME } from "./tools.js";
+export const CROSS_FILE_PHASE_NAME = "crossFile";
+export const crossFilePhase = {
+    name: CROSS_FILE_PHASE_NAME,
+    deps: [
+        PARSE_PHASE_NAME,
+        ROUTES_PHASE_NAME,
+        TOOLS_PHASE_NAME,
+        ORM_PHASE_NAME,
+        INCREMENTAL_SCOPE_PHASE_NAME,
+    ],
+    async run(ctx, deps) {
+        const parse = deps.get(PARSE_PHASE_NAME);
+        if (parse === undefined) {
+            throw new Error("crossFile: parse output missing from dependency map");
+        }
+        return runCrossFile(ctx, parse);
+    },
+};
+function runCrossFile(ctx, parse) {
+    // ---- 0. : incremental-scope carry-forward. --------------------
+    //
+    // When the incremental view is active we first splat every prior-graph
+    // CALLS upgrade whose endpoints both live OUTSIDE the current closure
+    // into `ctx.graph`. The post-parse graph already carries the 0.5-tier
+    // CALLS; replaying the prior cross-file upgrades lets us skip work for
+    // non-closure files while keeping the final edge set byte-identical to
+    // a full run at the same commit. Determinism gate: see
+    // `packages/ingestion/src/pipeline/incremental-determinism.test.ts`.
+    const view = resolveIncrementalView(ctx);
+    if (view.active &&
+        view.previousGraph?.edges !== undefined &&
+        view.previousGraph.nodes !== undefined) {
+        const filePathByNodeId = buildFilePathLookup(view.previousGraph.nodes);
+        const carried = partitionPriorEdges(view.previousGraph.edges, filePathByNodeId, view.closure, new Set(["CALLS"]));
+        for (const e of carried) {
+            if (e.confidence <= CONFIDENCE_BY_TIER.global)
+                continue;
+            ctx.graph.addEdge({
+                from: e.from,
+                to: e.to,
+                type: e.type,
+                confidence: e.confidence,
+                ...(e.reason !== undefined ? { reason: e.reason } : {}),
+            });
+        }
+    }
+    // ---- 1. Build the import graph restricted to files we actually parsed. -
+    // In incremental mode we narrow the SCC+upgrade walk to closure files;
+    // the carry-forward above covers the non-closure tail.
+    const parsedFiles = view.active
+        ? [...parse.definitionsByFile.keys()].filter((f) => view.closure.has(f)).sort()
+        : [...parse.definitionsByFile.keys()].sort();
+    const parsedSet = new Set(parsedFiles);
+    const adjacency = new Map();
+    for (const f of parsedFiles)
+        adjacency.set(f, []);
+    // Walk the graph's IMPORTS edges — they were already resolved to in-repo
+    // File nodes at parse time, so we get the import graph for free without
+    // re-running path resolution.
+    for (const edge of ctx.graph.edges()) {
+        if (edge.type !== "IMPORTS")
+            continue;
+        const from = nodeIdToFilePath(edge.from);
+        const to = nodeIdToFilePath(edge.to);
+        if (from === undefined || to === undefined)
+            continue;
+        if (!parsedSet.has(from) || !parsedSet.has(to))
+            continue;
+        const list = adjacency.get(from);
+        if (list !== undefined && !list.includes(to))
+            list.push(to);
+    }
+    for (const [n, list] of adjacency) {
+        list.sort();
+        adjacency.set(n, list);
+    }
+    // ---- 2. Tarjan SCC on the import graph. -------------------------------
+    const sccs = tarjanScc(parsedFiles, adjacency);
+    const sccIndex = new Map();
+    sccs.forEach((members, i) => {
+        for (const m of members)
+            sccIndex.set(m, i);
+    });
+    // ---- 3. Kahn topo-sort over the condensation. -------------------------
+    const condensationAdj = new Map();
+    for (let i = 0; i < sccs.length; i++)
+        condensationAdj.set(i, new Set());
+    for (const [from, neighbors] of adjacency) {
+        const fi = sccIndex.get(from);
+        if (fi === undefined)
+            continue;
+        for (const to of neighbors) {
+            const ti = sccIndex.get(to);
+            if (ti === undefined || ti === fi)
+                continue;
+            condensationAdj.get(fi)?.add(ti);
+        }
+    }
+    const condensationOrder = kahnCondensation(condensationAdj);
+    // ---- 4. Process files in SCC-topo order; inside a component, by name. -
+    let upgradedCallsCount = 0;
+    let unresolvedRemaining = 0;
+    const largeSccs = [];
+    for (const idx of condensationOrder) {
+        const members = sccs[idx];
+        if (members === undefined)
+            continue;
+        if (members.length > 5) {
+            // Name the component by its lexicographically smallest member for a
+            // stable identifier across runs.
+            const smallest = [...members].sort()[0];
+            if (smallest !== undefined)
+                largeSccs.push(smallest);
+        }
+        const sortedMembers = [...members].sort();
+        for (const filePath of sortedMembers) {
+            const upgraded = reresolveCallsForFile(ctx, parse.symbolIndex, parse, filePath);
+            upgradedCallsCount += upgraded.upgraded;
+            unresolvedRemaining += upgraded.stillUnresolved;
+        }
+    }
+    return {
+        upgradedCallsCount,
+        unresolvedRemaining,
+        sccCount: sccs.length,
+        largeSccs,
+    };
+}
+function reresolveCallsForFile(ctx, symbolIndex, parse, filePath) {
+    // We compare against the edges already emitted at parse time: pick only
+    // CALLS edges whose source file matches `filePath` and whose confidence
+    // is capped at the global tier (0.5). Anything higher is already as
+    // strong as we can make it.
+    const defs = parse.definitionsByFile.get(filePath) ?? [];
+    const calls = parse.callsByFile.get(filePath) ?? [];
+    if (calls.length === 0)
+        return { upgraded: 0, stillUnresolved: 0 };
+    // Build a quick lookup from qualified name → current definition's id so we
+    // can re-derive the caller id without walking the whole graph per call.
+    const callerIdByQualifiedName = new Map();
+    for (const d of defs) {
+        const id = makeNodeId(d.kind, d.filePath, d.qualifiedName, {
+            ...(d.parameterCount !== undefined ? { parameterCount: d.parameterCount } : {}),
+            ...(d.parameterTypes !== undefined ? { parameterTypes: d.parameterTypes } : {}),
+            ...(d.isConst !== undefined ? { isConst: d.isConst } : {}),
+        });
+        callerIdByQualifiedName.set(d.qualifiedName, id);
+    }
+    const fileNodeId = makeNodeId("File", filePath, filePath);
+    const language = parse.definitionsByFile.has(filePath)
+        ? inferLanguageFromFile(filePath)
+        : undefined;
+    if (language === undefined)
+        return { upgraded: 0, stillUnresolved: 0 };
+    const provider = getProvider(language);
+    let upgraded = 0;
+    let stillUnresolved = 0;
+    for (const call of calls) {
+        const callerId = call.callerQualifiedName === "<module>"
+            ? fileNodeId
+            : callerIdByQualifiedName.get(call.callerQualifiedName);
+        if (callerId === undefined)
+            continue;
+        const candidates = resolve({ callerFile: filePath, calleeName: call.calleeName, provider }, symbolIndex);
+        const first = candidates[0];
+        if (first === undefined) {
+            stillUnresolved += 1;
+            continue;
+        }
+        // Only upgrade when the resolved tier is above the global floor.
+        if (first.confidence > CONFIDENCE_BY_TIER.global) {
+            ctx.graph.addEdge({
+                from: callerId,
+                to: first.targetId,
+                type: "CALLS",
+                confidence: first.confidence,
+                reason: `cross-file-${first.tier}`,
+            });
+            upgraded += 1;
+        }
+    }
+    return { upgraded, stillUnresolved };
+}
+function inferLanguageFromFile(filePath) {
+    const idx = filePath.lastIndexOf(".");
+    if (idx < 0)
+        return undefined;
+    const ext = filePath.slice(idx).toLowerCase();
+    switch (ext) {
+        case ".ts":
+        case ".mts":
+        case ".cts":
+            return "typescript";
+        case ".tsx":
+            return "tsx";
+        case ".js":
+        case ".mjs":
+        case ".cjs":
+        case ".jsx":
+            return "javascript";
+        case ".py":
+        case ".pyi":
+            return "python";
+        case ".go":
+            return "go";
+        case ".rs":
+            return "rust";
+        case ".java":
+            return "java";
+        case ".cs":
+            return "csharp";
+        case ".c":
+        case ".h":
+            // .h is ambiguous between C/C++; default to C. A dedicated C++ header
+            // detector can upgrade the classification later.
+            return "c";
+        case ".cpp":
+        case ".cc":
+        case ".cxx":
+        case ".hpp":
+        case ".hh":
+        case ".hxx":
+            return "cpp";
+        case ".rb":
+            return "ruby";
+        case ".kt":
+        case ".kts":
+            return "kotlin";
+        case ".swift":
+            return "swift";
+        case ".php":
+        case ".php3":
+        case ".php4":
+        case ".php5":
+        case ".php7":
+        case ".phtml":
+            return "php";
+        case ".dart":
+            return "dart";
+        default:
+            return undefined;
+    }
+}
+/**
+ * Recover a File's relative path from a `File:<path>:<qn>` node id. Returns
+ * undefined for non-file ids.
+ */
+function nodeIdToFilePath(id) {
+    if (!id.startsWith("File:"))
+        return undefined;
+    const after = id.slice("File:".length);
+    // File ids are `File:<path>:<path>` — the qualifiedName equals the path.
+    // Splitting on the middle colon is robust even when the path contains
+    // colons on Windows (we normalize to POSIX at scan time).
+    const colonIdx = after.indexOf(":");
+    if (colonIdx < 0)
+        return after;
+    return after.slice(0, colonIdx);
+}
+/**
+ * Iterative Tarjan strongly-connected-components.
+ * Input: sorted `nodes` list + adjacency map with sorted neighbor lists.
+ * Output: array of SCCs; each SCC is the sorted list of its members.
+ * Components are emitted in the order Tarjan discovers them, which — given
+ * pre-sorted inputs — is deterministic.
+ */
+function tarjanScc(nodes, adjacency) {
+    const index = new Map();
+    const lowlink = new Map();
+    const onStack = new Set();
+    const stack = [];
+    let counter = 0;
+    const result = [];
+    // Iterative simulation so deep call chains don't blow the stack.
+    function strongConnect(start) {
+        const dfsStack = [{ node: start, it: 0 }];
+        index.set(start, counter);
+        lowlink.set(start, counter);
+        counter += 1;
+        stack.push(start);
+        onStack.add(start);
+        while (dfsStack.length > 0) {
+            const frame = dfsStack[dfsStack.length - 1];
+            if (frame === undefined)
+                break;
+            const neighbors = adjacency.get(frame.node) ?? [];
+            if (frame.it < neighbors.length) {
+                const next = neighbors[frame.it];
+                frame.it += 1;
+                if (!index.has(next)) {
+                    index.set(next, counter);
+                    lowlink.set(next, counter);
+                    counter += 1;
+                    stack.push(next);
+                    onStack.add(next);
+                    dfsStack.push({ node: next, it: 0 });
+                }
+                else if (onStack.has(next)) {
+                    const cur = lowlink.get(frame.node) ?? 0;
+                    const nxt = index.get(next) ?? 0;
+                    lowlink.set(frame.node, Math.min(cur, nxt));
+                }
+            }
+            else {
+                // Finished `frame.node`: propagate to parent and maybe emit a SCC.
+                const low = lowlink.get(frame.node) ?? 0;
+                const idx = index.get(frame.node) ?? 0;
+                if (low === idx) {
+                    const component = [];
+                    while (stack.length > 0) {
+                        const w = stack.pop();
+                        onStack.delete(w);
+                        component.push(w);
+                        if (w === frame.node)
+                            break;
+                    }
+                    component.sort();
+                    result.push(component);
+                }
+                dfsStack.pop();
+                const parent = dfsStack[dfsStack.length - 1];
+                if (parent !== undefined) {
+                    const parentLow = lowlink.get(parent.node) ?? 0;
+                    const childLow = lowlink.get(frame.node) ?? 0;
+                    lowlink.set(parent.node, Math.min(parentLow, childLow));
+                }
+            }
+        }
+    }
+    for (const n of nodes) {
+        if (!index.has(n))
+            strongConnect(n);
+    }
+    return result;
+}
+/**
+ * Kahn's algorithm on a condensation (DAG over SCC indices). Returns an
+ * ordering of SCC indices such that each component is emitted before any
+ * component that depends on it. Tiebreak: smaller index first (the index
+ * already corresponds to SCC discovery order, which is deterministic).
+ */
+function kahnCondensation(adj) {
+    const indeg = new Map();
+    for (const i of adj.keys())
+        indeg.set(i, 0);
+    for (const [, outs] of adj) {
+        for (const o of outs)
+            indeg.set(o, (indeg.get(o) ?? 0) + 1);
+    }
+    const ready = [];
+    for (const [i, d] of indeg)
+        if (d === 0)
+            ready.push(i);
+    ready.sort((a, b) => a - b);
+    const out = [];
+    while (ready.length > 0) {
+        const n = ready.shift();
+        out.push(n);
+        const outs = adj.get(n) ?? new Set();
+        for (const next of outs) {
+            const d = (indeg.get(next) ?? 1) - 1;
+            indeg.set(next, d);
+            if (d === 0) {
+                let i = 0;
+                while (i < ready.length && (ready[i] ?? 0) < next)
+                    i += 1;
+                ready.splice(i, 0, next);
+            }
+        }
+    }
+    return out;
+}
+//# sourceMappingURL=cross-file.js.map

package/dist/pipeline/phases/cross-file.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cross-file.js","sourceRoot":"","sources":["../../../src/pipeline/phases/cross-file.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AAEH,OAAO,EAAE,UAAU,EAAe,MAAM,yBAAyB,CAAC;AAClE,OAAO,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAC1D,OAAO,EACL,kBAAkB,EAClB,OAAO,GAER,MAAM,uCAAuC,CAAC;AAE/C,OAAO,EACL,mBAAmB,EACnB,mBAAmB,EACnB,sBAAsB,GACvB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EAAE,4BAA4B,EAAE,MAAM,wBAAwB,CAAC;AACtE,OAAO,EAAE,cAAc,EAAE,MAAM,UAAU,CAAC;AAC1C,OAAO,EAAE,gBAAgB,EAAoB,MAAM,YAAY,CAAC;AAChE,OAAO,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAChD,OAAO,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAE9C,MAAM,CAAC,MAAM,qBAAqB,GAAG,WAAW,CAAC;AAUjD,MAAM,CAAC,MAAM,cAAc,GAAmC;IAC5D,IAAI,EAAE,qBAAqB;IAC3B,IAAI,EAAE;QACJ,gBAAgB;QAChB,iBAAiB;QACjB,gBAAgB;QAChB,cAAc;QACd,4BAA4B;KAC7B;IACD,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,gBAAgB,CAA4B,CAAC;QACpE,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,qDAAqD,CAAC,CAAC;QACzE,CAAC;QACD,OAAO,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAClC,CAAC;CACF,CAAC;AAEF,SAAS,YAAY,CAAC,GAAoB,EAAE,KAAkB;IAC5D,kEAAkE;IAClE,EAAE;IACF,uEAAuE;IACvE,sEAAsE;IACtE,sEAAsE;IACtE,uEAAuE;IACvE,uEAAuE;IACvE,uDAAuD;IACvD,qEAAqE;IACrE,MAAM,IAAI,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC;IACzC,IACE,IAAI,CAAC,MAAM;QACX,IAAI,CAAC,aAAa,EAAE,KAAK,KAAK,SAAS;QACvC,IAAI,CAAC,aAAa,CAAC,KAAK,KAAK,SAAS,EACtC,CAAC;QACD,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QACvE,MAAM,OAAO,GAAG,mBAAmB,CACjC,IAAI,CAAC,aAAa,CAAC,KAAK,EACxB,gBAAgB,EAChB,IAAI,CAAC,OAAO,EACZ,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CACnB,CAAC;QACF,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAI,CAAC,CAAC,UAAU,IAAI,kBAAkB,CAAC,MAAM;gBAAE,SAAS;YACxD,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC;gBAChB,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,UAAU,EAAE,CAAC,CAAC,UAAU;gBACxB,GAAG,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aACxD,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,2EAA2E;IAC3E,uEAAuE;IACvE,uDAAuD;IACvD,MAAM,WAAW,GAAsB,IAAI,CAAC,MAAM;QAChD,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE;QAC/E,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAC/C,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC;IAEvC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,KAAK,MAAM,CAAC,IAAI,WAAW;QAAE,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAElD,yEAAyE;IACzE,wEAAwE;IACxE,8BAA8B;IAC9B,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QACrC,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS;YAAE,SAAS;QACtC,MAAM,IAAI,GAAG,gBAAgB,CAAC,IAAI,CAAC,IAAc,CAAC,CAAC;QACnD,MAAM,EAAE,GAAG,gBAAgB,CAAC,IAAI,CAAC,EAAY,CAAC,CAAC;QAC/C,IAAI,IAAI,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS;YAAE,SAAS;QACrD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS;QACzD,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC9D,CAAC;IACD,KAAK,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,SAAS,EAAE,CAAC;QAClC,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,0EAA0E;IAC1E,MAAM,IAAI,GAAG,SAAS,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IAC/C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,IAAI,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE;QAC1B,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,0EAA0E;IAC1E,MAAM,eAAe,GAAG,IAAI,GAAG,EAAuB,CAAC;IACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,eAAe,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IACxE,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1C,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,EAAE,KAAK,SAAS;YAAE,SAAS;QAC/B,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;YAC3B,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC5B,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,EAAE;gBAAE,SAAS;YAC5C,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IACD,MAAM,iBAAiB,GAAG,gBAAgB,CAAC,eAAe,CAAC,CAAC;IAE5D,0EAA0E;IAC1E,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAC3B,IAAI,mBAAmB,GAAG,CAAC,CAAC;IAC5B,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,KAAK,MAAM,GAAG,IAAI,iBAAiB,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,OAAO,KAAK,SAAS;YAAE,SAAS;QACpC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,oEAAoE;YACpE,iCAAiC;YACjC,MAAM,QAAQ,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YACxC,IAAI,QAAQ,KAAK,SAAS;gBAAE,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvD,CAAC;QACD,MAAM,aAAa,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;QAC1C,KAAK,MAAM,QAAQ,IAAI,aAAa,EAAE,CAAC;YACrC,MAAM,QAAQ,GAAG,qBAAqB,CAAC,GAAG,EAAE,KAAK,CAAC,WAAW,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;YAChF,kBAAkB,IAAI,QAAQ,CAAC,QAAQ,CAAC;YACxC,mBAAmB,IAAI,QAAQ,CAAC,eAAe,CAAC;QAClD,CAAC;IACH,CAAC;IAED,OAAO;QACL,kBAAkB;QAClB,mBAAmB;QACnB,QAAQ,EAAE,IAAI,CAAC,MAAM;QACrB,SAAS;KACV,CAAC;AACJ,CAAC;AAED,SAAS,qBAAqB,CAC5B,GAAoB,EACpB,WAAwB,EACxB,KAAkB,EAClB,QAAgB;IAEhB,wEAAwE;IACxE,wEAAwE;IACxE,oEAAoE;IACpE,4BAA4B;IAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;IACzD,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;IACpD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC;IAEnE,2EAA2E;IAC3E,wEAAwE;IACxE,MAAM,uBAAuB,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1D,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,aAAa,EAAE;YACzD,GAAG,CAAC,CAAC,CAAC,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/E,GAAG,CAAC,CAAC,CAAC,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/E,GAAG,CAAC,CAAC,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC3D,CAAC,CAAC;QACH,uBAAuB,CAAC,GAAG,CAAC,CAAC,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;IACnD,CAAC;IACD,MAAM,UAAU,GAAG,UAAU,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAE1D,MAAM,QAAQ,GAAG,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,QAAQ,CAAC;QACpD,CAAC,CAAC,qBAAqB,CAAC,QAAQ,CAAC;QACjC,CAAC,CAAC,SAAS,CAAC;IACd,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC;IACvE,MAAM,QAAQ,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;IAEvC,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,eAAe,GAAG,CAAC,CAAC;IAExB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,QAAQ,GACZ,IAAI,CAAC,mBAAmB,KAAK,UAAU;YACrC,CAAC,CAAC,UAAU;YACZ,CAAC,CAAC,uBAAuB,CAAC,GAAG,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;QAC5D,IAAI,QAAQ,KAAK,SAAS;YAAE,SAAS;QAErC,MAAM,UAAU,GAAG,OAAO,CACxB,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,QAAQ,EAAE,EAC/D,WAAW,CACZ,CAAC;QACF,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,eAAe,IAAI,CAAC,CAAC;YACrB,SAAS;QACX,CAAC;QACD,iEAAiE;QACjE,IAAI,KAAK,CAAC,UAAU,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC;YACjD,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC;gBAChB,IAAI,EAAE,QAAQ;gBACd,EAAE,EAAE,KAAK,CAAC,QAAkB;gBAC5B,IAAI,EAAE,OAAO;gBACb,UAAU,EAAE,KAAK,CAAC,UAAU;gBAC5B,MAAM,EAAE,cAAc,KAAK,CAAC,IAAI,EAAE;aACnC,CAAC,CAAC;YACH,QAAQ,IAAI,CAAC,CAAC;QAChB,CAAC;IACH,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,CAAC;AACvC,CAAC;AAED,SAAS,qBAAqB,CAC5B,QAAgB;IAkBhB,MAAM,GAAG,GAAG,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACtC,IAAI,GAAG,GAAG,CAAC;QAAE,OAAO,SAAS,CAAC;IAC9B,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;IAC9C,QAAQ,GAAG,EAAE,CAAC;QACZ,KAAK,KAAK,CAAC;QACX,KAAK,MAAM,CAAC;QACZ,KAAK,MAAM;YACT,OAAO,YAAY,CAAC;QACtB,KAAK,MAAM;YACT,OAAO,KAAK,CAAC;QACf,KAAK,KAAK,CAAC;QACX,KAAK,MAAM,CAAC;QACZ,KAAK,MAAM,CAAC;QACZ,KAAK,MAAM;YACT,OAAO,YAAY,CAAC;QACtB,KAAK,KAAK,CAAC;QACX,KAAK,MAAM;YACT,OAAO,QAAQ,CAAC;QAClB,KAAK,KAAK;YACR,OAAO,IAAI,CAAC;QACd,KAAK,KAAK;YACR,OAAO,MAAM,CAAC;QAChB,KAAK,OAAO;YACV,OAAO,MAAM,CAAC;QAChB,KAAK,KAAK;YACR,OAAO,QAAQ,CAAC;QAClB,KAAK,IAAI,CAAC;QACV,KAAK,IAAI;YACP,sEAAsE;YACtE,iDAAiD;YACjD,OAAO,GAAG,CAAC;QACb,KAAK,MAAM,CAAC;QACZ,KAAK,KAAK,CAAC;QACX,KAAK,MAAM,CAAC;QACZ,KAAK,MAAM,CAAC;QACZ,KAAK,KAAK,CAAC;QACX,KAAK,MAAM;YACT,OAAO,KAAK,CAAC;QACf,KAAK,KAAK;YACR,OAAO,MAAM,CAAC;QAChB,KAAK,KAAK,CAAC;QACX,KAAK,MAAM;YACT,OAAO,QAAQ,CAAC;QAClB,KAAK,QAAQ;YACX,OAAO,OAAO,CAAC;QACjB,KAAK,MAAM,CAAC;QACZ,KAAK,OAAO,CAAC;QACb,KAAK,OAAO,CAAC;QACb,KAAK,OAAO,CAAC;QACb,KAAK,OAAO,CAAC;QACb,KAAK,QAAQ;YACX,OAAO,KAAK,CAAC;QACf,KAAK,OAAO;YACV,OAAO,MAAM,CAAC;QAChB;YACE,OAAO,SAAS,CAAC;IACrB,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,gBAAgB,CAAC,EAAU;IAClC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC;QAAE,OAAO,SAAS,CAAC;IAC9C,MAAM,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACvC,yEAAyE;IACzE,sEAAsE;IACtE,0DAA0D;IAC1D,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACpC,IAAI,QAAQ,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IAC/B,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;AAClC,CAAC;AAED;;;;;;GAMG;AACH,SAAS,SAAS,CAChB,KAAwB,EACxB,SAAiD;IAEjD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,MAAM,MAAM,GAAe,EAAE,CAAC;IAE9B,iEAAiE;IACjE,SAAS,aAAa,CAAC,KAAa;QAClC,MAAM,QAAQ,GAAmC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1E,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC1B,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC5B,OAAO,IAAI,CAAC,CAAC;QACb,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAEnB,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC5C,IAAI,KAAK,KAAK,SAAS;gBAAE,MAAM;YAC/B,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAClD,IAAI,KAAK,CAAC,EAAE,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC;gBAChC,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,EAAE,CAAW,CAAC;gBAC3C,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;gBACd,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACrB,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;oBACzB,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;oBAC3B,OAAO,IAAI,CAAC,CAAC;oBACb,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACjB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBAClB,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBACvC,CAAC;qBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC7B,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACzC,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACjC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;gBAC9C,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,mEAAmE;gBACnE,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACzC,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvC,IAAI,GAAG,KAAK,GAAG,EAAE,CAAC;oBAChB,MAAM,SAAS,GAAa,EAAE,CAAC;oBAC/B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBACxB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAY,CAAC;wBAChC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;wBAClB,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;wBAClB,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI;4BAAE,MAAM;oBAC9B,CAAC;oBACD,SAAS,CAAC,IAAI,EAAE,CAAC;oBACjB,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACzB,CAAC;gBACD,QAAQ,CAAC,GAAG,EAAE,CAAC;gBACf,MAAM,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAC7C,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;oBACzB,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAChD,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAC9C,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC;gBAC1D,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,aAAa,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CAAC,GAA6C;IACrE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,IAAI,EAAE;QAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9D,CAAC;IACD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK;QAAE,IAAI,CAAC,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAE5B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,EAAY,CAAC;QAClC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACZ,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QAC7C,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACrC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACnB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,IAAI,CAAC,GAAG,CAAC,CAAC;gBACV,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI;oBAAE,CAAC,IAAI,CAAC,CAAC;gBAC1D,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/pipeline/phases/dead-code.d.ts

@@ -0,0 +1,28 @@
+/**
+ * Dead-code phase.
+ *
+ * Runs after cross-file resolution, MRO, and community clustering so every
+ * referrer edge and community membership is available. For each classifiable
+ * Symbol in the in-memory graph we compute one of three verdicts via
+ * `@opencodehub/analysis::classifyDeadnessInMemory`:
+ *
+ *   - `live`                — at least one inbound referrer exists.
+ *   - `dead`                — non-exported, no inbound referrers.
+ *   - `unreachable-export`  — exported but no cross-module referrer.
+ *
+ * The phase denormalises the verdict onto each callable / type node so the
+ * downstream persistence layer writes it to the `deadness` column, and
+ * emits a warning log for every community whose entire membership is
+ * non-live (a "ghost community").
+ */
+import type { PipelinePhase } from "../types.js";
+export declare const DEAD_CODE_PHASE_NAME = "dead-code";
+export interface DeadCodeOutput {
+    readonly classifiedCount: number;
+    readonly deadCount: number;
+    readonly unreachableExportCount: number;
+    readonly ghostCommunityCount: number;
+    readonly ghostCommunities: readonly string[];
+}
+export declare const deadCodePhase: PipelinePhase<DeadCodeOutput>;
+//# sourceMappingURL=dead-code.d.ts.map

package/dist/pipeline/phases/dead-code.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dead-code.d.ts","sourceRoot":"","sources":["../../../src/pipeline/phases/dead-code.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAaH,OAAO,KAAK,EAAmB,aAAa,EAAE,MAAM,aAAa,CAAC;AAElE,eAAO,MAAM,oBAAoB,cAAc,CAAC;AAShD,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,sBAAsB,EAAE,MAAM,CAAC;IACxC,QAAQ,CAAC,mBAAmB,EAAE,MAAM,CAAC;IACrC,QAAQ,CAAC,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAC;CAC9C;AAED,eAAO,MAAM,aAAa,EAAE,aAAa,CAAC,cAAc,CAMvD,CAAC"}

package/dist/pipeline/phases/dead-code.js

@@ -0,0 +1,157 @@
+/**
+ * Dead-code phase.
+ *
+ * Runs after cross-file resolution, MRO, and community clustering so every
+ * referrer edge and community membership is available. For each classifiable
+ * Symbol in the in-memory graph we compute one of three verdicts via
+ * `@opencodehub/analysis::classifyDeadnessInMemory`:
+ *
+ *   - `live`                — at least one inbound referrer exists.
+ *   - `dead`                — non-exported, no inbound referrers.
+ *   - `unreachable-export`  — exported but no cross-module referrer.
+ *
+ * The phase denormalises the verdict onto each callable / type node so the
+ * downstream persistence layer writes it to the `deadness` column, and
+ * emits a warning log for every community whose entire membership is
+ * non-live (a "ghost community").
+ */
+import { classifyDeadnessInMemory, deadCodeReferrerRelations, deadCodeSymbolKinds, } from "@opencodehub/analysis";
+export const DEAD_CODE_PHASE_NAME = "dead-code";
+// Inline phase-name constants so this module stays independent of other
+// phases' source files — keeps the DAG declaration self-contained and avoids
+// dragging in unrelated modules when the phase is imported in isolation.
+const CROSS_FILE_PHASE_NAME = "crossFile";
+const MRO_PHASE_NAME = "mro";
+const COMMUNITIES_PHASE_NAME = "communities";
+export const deadCodePhase = {
+    name: DEAD_CODE_PHASE_NAME,
+    deps: [CROSS_FILE_PHASE_NAME, MRO_PHASE_NAME, COMMUNITIES_PHASE_NAME],
+    async run(ctx) {
+        return runDeadCode(ctx);
+    },
+};
+function runDeadCode(ctx) {
+    const symbolKinds = deadCodeSymbolKinds();
+    const referrerTypes = new Set(deadCodeReferrerRelations());
+    // ---- 1. Project the in-memory graph into the analyzer's row shapes. ----
+    const symbols = [];
+    const filePathById = new Map();
+    for (const node of ctx.graph.nodes()) {
+        filePathById.set(node.id, node.filePath);
+        if (!symbolKinds.has(node.kind))
+            continue;
+        const located = node;
+        symbols.push({
+            id: node.id,
+            name: node.name,
+            kind: node.kind,
+            filePath: node.filePath,
+            startLine: typeof located.startLine === "number" ? located.startLine : 0,
+            isExported: located.isExported === true,
+        });
+    }
+    if (symbols.length === 0) {
+        return {
+            classifiedCount: 0,
+            deadCount: 0,
+            unreachableExportCount: 0,
+            ghostCommunityCount: 0,
+            ghostCommunities: [],
+        };
+    }
+    const symbolIdSet = new Set(symbols.map((s) => s.id));
+    const referrers = [];
+    const memberships = [];
+    for (const edge of ctx.graph.edges()) {
+        const fromId = edge.from;
+        const toId = edge.to;
+        if (edge.type === "MEMBER_OF" && symbolIdSet.has(fromId)) {
+            memberships.push({ symbolId: fromId, communityId: toId });
+            continue;
+        }
+        if (!referrerTypes.has(edge.type))
+            continue;
+        if (!symbolIdSet.has(toId))
+            continue;
+        referrers.push({
+            targetId: toId,
+            sourceFile: filePathById.get(fromId) ?? "",
+        });
+    }
+    // ---- 2. Classify + denormalise onto each touched Symbol node. ----------
+    const result = classifyDeadnessInMemory(symbols, referrers, memberships);
+    for (const node of ctx.graph.nodes()) {
+        if (!symbolKinds.has(node.kind))
+            continue;
+        const verdict = result.symbols[node.id];
+        if (verdict === undefined)
+            continue;
+        ctx.graph.addNode(withDeadness(node, verdict));
+    }
+    // ---- 3. Emit a warning for each ghost community. -----------------------
+    //
+    // `result.ghostCommunities` catches two very different situations:
+    //
+    //   (a) every member is truly `dead` — actual leaked code in an
+    //       application. Worth surfacing.
+    //   (b) every member is `unreachable-export` — a library's public surface.
+    //       From this graph's internal view no local caller reaches them,
+    //       but the whole point of an exported symbol is that *external*
+    //       consumers do. On sdk-python this fired 110 times; on any
+    //       library it is pure noise.
+    //
+    // We keep the classification on each node unchanged (so `deadness` still
+    // rides along), but only warn on (a). We also skip tiny singleton
+    // communities because a lone unreferenced symbol rarely rewards the
+    // reader's attention at ingest time — it will show up via `codehub
+    // verdict` or a targeted `impact` call instead.
+    const MIN_COMMUNITY_MEMBERS_FOR_WARNING = 2;
+    const membersByCommunity = new Map();
+    for (const m of memberships) {
+        const bucket = membersByCommunity.get(m.communityId);
+        if (bucket !== undefined)
+            bucket.push(m.symbolId);
+        else
+            membersByCommunity.set(m.communityId, [m.symbolId]);
+    }
+    for (const communityId of result.ghostCommunities) {
+        const members = membersByCommunity.get(communityId) ?? [];
+        if (members.length < MIN_COMMUNITY_MEMBERS_FOR_WARNING)
+            continue;
+        let allDead = true;
+        for (const memberId of members) {
+            if (result.symbols[memberId] !== "dead") {
+                allDead = false;
+                break;
+            }
+        }
+        if (!allDead)
+            continue;
+        ctx.onProgress?.({
+            phase: DEAD_CODE_PHASE_NAME,
+            kind: "warn",
+            message: `dead-code: ghost community detected (${communityId}) — ${members.length} members, all dead`,
+        });
+    }
+    return {
+        classifiedCount: symbols.length,
+        deadCount: result.dead.length,
+        unreachableExportCount: result.unreachableExports.length,
+        ghostCommunityCount: result.ghostCommunities.length,
+        ghostCommunities: result.ghostCommunities,
+    };
+}
+/**
+ * Return a copy of `node` with `deadness` populated. Only callable / type
+ * kinds carry the field in the schema — the caller is responsible for
+ * filtering to those kinds. Retains every other field via spread so the
+ * graph's "most-defined-wins" deduplication keeps the new node. We round-trip
+ * through `unknown` because `GraphNode` is a tagged union and not every
+ * variant declares a `deadness` key — TypeScript rejects the literal spread
+ * otherwise.
+ */
+function withDeadness(node, deadness) {
+    const extended = { ...node, deadness };
+    return extended;
+}
+//# sourceMappingURL=dead-code.js.map

package/dist/pipeline/phases/dead-code.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dead-code.js","sourceRoot":"","sources":["../../../src/pipeline/phases/dead-code.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EACL,wBAAwB,EAMxB,yBAAyB,EACzB,mBAAmB,GACpB,MAAM,uBAAuB,CAAC;AAI/B,MAAM,CAAC,MAAM,oBAAoB,GAAG,WAAW,CAAC;AAEhD,wEAAwE;AACxE,6EAA6E;AAC7E,yEAAyE;AACzE,MAAM,qBAAqB,GAAG,WAAW,CAAC;AAC1C,MAAM,cAAc,GAAG,KAAK,CAAC;AAC7B,MAAM,sBAAsB,GAAG,aAAa,CAAC;AAU7C,MAAM,CAAC,MAAM,aAAa,GAAkC;IAC1D,IAAI,EAAE,oBAAoB;IAC1B,IAAI,EAAE,CAAC,qBAAqB,EAAE,cAAc,EAAE,sBAAsB,CAAC;IACrE,KAAK,CAAC,GAAG,CAAC,GAAG;QACX,OAAO,WAAW,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;CACF,CAAC;AAEF,SAAS,WAAW,CAAC,GAAoB;IACvC,MAAM,WAAW,GAAG,mBAAmB,EAAE,CAAC;IAC1C,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,yBAAyB,EAAE,CAAC,CAAC;IAE3D,2EAA2E;IAC3E,MAAM,OAAO,GAAwB,EAAE,CAAC;IACxC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QACrC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS;QAC1C,MAAM,OAAO,GAAG,IAGf,CAAC;QACF,OAAO,CAAC,IAAI,CAAC;YACX,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,SAAS,EAAE,OAAO,OAAO,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YACxE,UAAU,EAAE,OAAO,CAAC,UAAU,KAAK,IAAI;SACxC,CAAC,CAAC;IACL,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO;YACL,eAAe,EAAE,CAAC;YAClB,SAAS,EAAE,CAAC;YACZ,sBAAsB,EAAE,CAAC;YACzB,mBAAmB,EAAE,CAAC;YACtB,gBAAgB,EAAE,EAAE;SACrB,CAAC;IACJ,CAAC;IACD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEtD,MAAM,SAAS,GAA0B,EAAE,CAAC;IAC5C,MAAM,WAAW,GAA4B,EAAE,CAAC;IAChD,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QACrC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAc,CAAC;QACnC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAY,CAAC;QAC/B,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW,IAAI,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACzD,WAAW,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;YAC1D,SAAS;QACX,CAAC;QACD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS;QAC5C,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QACrC,SAAS,CAAC,IAAI,CAAC;YACb,QAAQ,EAAE,IAAI;YACd,UAAU,EAAE,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE;SAC3C,CAAC,CAAC;IACL,CAAC;IAED,2EAA2E;IAC3E,MAAM,MAAM,GAAmB,wBAAwB,CAAC,OAAO,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC;IACzF,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QACrC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS;QAC1C,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxC,IAAI,OAAO,KAAK,SAAS;YAAE,SAAS;QACpC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;IACjD,CAAC;IAED,2EAA2E;IAC3E,EAAE;IACF,mEAAmE;IACnE,EAAE;IACF,gEAAgE;IAChE,sCAAsC;IACtC,2EAA2E;IAC3E,sEAAsE;IACtE,qEAAqE;IACrE,iEAAiE;IACjE,kCAAkC;IAClC,EAAE;IACF,yEAAyE;IACzE,kEAAkE;IAClE,oEAAoE;IACpE,mEAAmE;IACnE,gDAAgD;IAChD,MAAM,iCAAiC,GAAG,CAAC,CAAC;IAC5C,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAoB,CAAC;IACvD,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;QACrD,IAAI,MAAM,KAAK,SAAS;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;;YAC7C,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC3D,CAAC;IACD,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;QAClD,MAAM,OAAO,GAAG,kBAAkB,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;QAC1D,IAAI,OAAO,CAAC,MAAM,GAAG,iCAAiC;YAAE,SAAS;QACjE,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,KAAK,MAAM,QAAQ,IAAI,OAAO,EAAE,CAAC;YAC/B,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,MAAM,EAAE,CAAC;gBACxC,OAAO,GAAG,KAAK,CAAC;gBAChB,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,CAAC,OAAO;YAAE,SAAS;QACvB,GAAG,CAAC,UAAU,EAAE,CAAC;YACf,KAAK,EAAE,oBAAoB;YAC3B,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE,wCAAwC,WAAW,OAAO,OAAO,CAAC,MAAM,oBAAoB;SACtG,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,eAAe,EAAE,OAAO,CAAC,MAAM;QAC/B,SAAS,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM;QAC7B,sBAAsB,EAAE,MAAM,CAAC,kBAAkB,CAAC,MAAM;QACxD,mBAAmB,EAAE,MAAM,CAAC,gBAAgB,CAAC,MAAM;QACnD,gBAAgB,EAAE,MAAM,CAAC,gBAAgB;KAC1C,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,YAAY,CAAC,IAAe,EAAE,QAAkB;IACvD,MAAM,QAAQ,GAAG,EAAE,GAAI,IAA2C,EAAE,QAAQ,EAAE,CAAC;IAC/E,OAAO,QAAgC,CAAC;AAC1C,CAAC"}

package/dist/pipeline/phases/default-set.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Default pipeline phase set — full 14-phase DAG.
+ *
+ * The runner treats this array as the canonical ordering source. Adding or
+ * removing a phase is a one-line change here; the DAG validator catches
+ * missing dependencies and cycles on the next run.
+ *
+ * Phase ordering (topologically):
+ *   scan → profile
+ *        → structure → markdown → parse → complexity → routes → tools →
+ *                                         orm → crossFile → mro →
+ *                                         communities → dead-code →
+ *                                         processes → temporal → annotate
+ *
+ * `markdown` depends on `structure` and could run alongside `parse`; the
+ * runner serialises everything since determinism dominates the latency
+ * win at MVP scale. `profile` and `temporal` are pure leaves on `scan`
+ * and could run in parallel with any post-scan phase once the runner
+ * learns to fan out. `profile` emits a single ProjectProfile node that
+ * scanner phases will consult to decide which scanners to invoke.
+ */
+import type { PipelinePhase } from "../types.js";
+export declare const DEFAULT_PHASES: readonly PipelinePhase[];
+//# sourceMappingURL=default-set.d.ts.map

package/dist/pipeline/phases/default-set.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"default-set.d.ts","sourceRoot":"","sources":["../../../src/pipeline/phases/default-set.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAgCjD,eAAO,MAAM,cAAc,EAAE,SAAS,aAAa,EAgFlD,CAAC"}