optave-codegraph 3.13.0

package/dist/domain/graph/builder/stages/build-edges.js

@@ -0,0 +1,1425 @@
+/**
+ * Stage: buildEdges
+ *
+ * Builds import, call, receiver, extends, and implements edges.
+ * Uses pre-loaded node lookup maps (N+1 optimization).
+ */
+import path from 'node:path';
+import { performance } from 'node:perf_hooks';
+import { getNodeId } from '../../../../db/index.js';
+import { setTypeMapEntry } from '../../../../extractors/helpers.js';
+import { PROPAGATION_HOP_PENALTY } from '../../../../extractors/javascript.js';
+import { debug } from '../../../../infrastructure/logger.js';
+import { loadNative } from '../../../../infrastructure/native.js';
+import { TS_NATIVE_CONFIDENCE_FLOOR } from '../../../../shared/constants.js';
+import { computeConfidence } from '../../resolve.js';
+import { buildPointsToMap, resolveViaPointsTo } from '../../resolver/points-to.js';
+import { enrichTypeMapWithTsc } from '../../resolver/ts-resolver.js';
+import { findCaller, isModuleScopedLanguage, resolveCallTargets, resolveReceiverEdge, } from '../call-resolver.js';
+import { buildChaContext, resolveChaTargets, resolveThisDispatch } from '../cha.js';
+import { BUILTIN_RECEIVERS, batchInsertEdges, CHA_DISPATCH_PENALTY, CHA_TYPED_DISPATCH_CONFIDENCE, runChaPostPass, } from '../helpers.js';
+import { getResolved, isBarrelFile, resolveBarrelExportCached } from './resolve-imports.js';
+// ── Node lookup setup ───────────────────────────────────────────────────
+function makeGetNodeIdStmt(db) {
+    return {
+        get: (name, kind, file, line) => {
+            const id = getNodeId(db, name, kind, file, line);
+            return id != null ? { id } : undefined;
+        },
+    };
+}
+function setupNodeLookups(ctx, allNodes) {
+    ctx.nodesByName = new Map();
+    for (const node of allNodes) {
+        if (!ctx.nodesByName.has(node.name))
+            ctx.nodesByName.set(node.name, []);
+        ctx.nodesByName.get(node.name).push(node);
+    }
+    ctx.nodesByNameAndFile = new Map();
+    for (const node of allNodes) {
+        const key = `${node.name}|${node.file}`;
+        if (!ctx.nodesByNameAndFile.has(key))
+            ctx.nodesByNameAndFile.set(key, []);
+        ctx.nodesByNameAndFile.get(key).push(node);
+    }
+}
+// ── Import edges ────────────────────────────────────────────────────────
+/** Pick the edge kind for an import statement based on its modifiers. */
+function importEdgeKind(imp) {
+    if (imp.reexport)
+        return 'reexports';
+    if (imp.typeOnly)
+        return 'imports-type';
+    if (imp.dynamicImport)
+        return 'dynamic-imports';
+    return 'imports';
+}
+/**
+ * For a `import type` statement, emit symbol-level `imports-type` edges so
+ * the target symbols get fan-in credit and aren't classified as dead code.
+ */
+function emitTypeOnlySymbolEdges(ctx, imp, resolvedPath, fileNodeId, allEdgeRows) {
+    if (!ctx.nodesByNameAndFile)
+        return;
+    for (const name of imp.names) {
+        const cleanName = name.replace(/^\*\s+as\s+/, '');
+        let targetFile = resolvedPath;
+        if (isBarrelFile(ctx, resolvedPath)) {
+            const actual = resolveBarrelExportCached(ctx, resolvedPath, cleanName);
+            if (actual)
+                targetFile = actual;
+        }
+        const candidates = ctx.nodesByNameAndFile.get(`${cleanName}|${targetFile}`);
+        if (candidates && candidates.length > 0) {
+            allEdgeRows.push([fileNodeId, candidates[0].id, 'imports-type', 1.0, 0, null, null]);
+        }
+    }
+}
+/**
+ * Process a single import statement and emit all resulting edges (file→file,
+ * type-only symbol-level, and barrel re-export targets).
+ */
+function emitEdgesForImport(ctx, imp, fileNodeId, relPath, getNodeIdStmt, allEdgeRows) {
+    const resolvedPath = getResolved(ctx, path.join(ctx.rootDir, relPath), imp.source);
+    const targetRow = getNodeIdStmt.get(resolvedPath, 'file', resolvedPath, 0);
+    if (!targetRow)
+        return;
+    const edgeKind = importEdgeKind(imp);
+    allEdgeRows.push([fileNodeId, targetRow.id, edgeKind, 1.0, 0, null, null]);
+    if (imp.typeOnly) {
+        emitTypeOnlySymbolEdges(ctx, imp, resolvedPath, fileNodeId, allEdgeRows);
+    }
+    if (!imp.reexport && isBarrelFile(ctx, resolvedPath)) {
+        buildBarrelEdges(ctx, imp, resolvedPath, fileNodeId, edgeKind, getNodeIdStmt, allEdgeRows);
+    }
+}
+function buildImportEdges(ctx, getNodeIdStmt, allEdgeRows) {
+    const { fileSymbols, barrelOnlyFiles } = ctx;
+    for (const [relPath, symbols] of fileSymbols) {
+        const isBarrelOnly = barrelOnlyFiles.has(relPath);
+        const fileNodeRow = getNodeIdStmt.get(relPath, 'file', relPath, 0);
+        if (!fileNodeRow)
+            continue;
+        const fileNodeId = fileNodeRow.id;
+        for (const imp of symbols.imports) {
+            // Barrel-only files: only emit reexport edges, skip regular imports
+            if (isBarrelOnly && !imp.reexport)
+                continue;
+            emitEdgesForImport(ctx, imp, fileNodeId, relPath, getNodeIdStmt, allEdgeRows);
+        }
+    }
+}
+function buildBarrelEdges(ctx, imp, resolvedPath, fileNodeId, edgeKind, getNodeIdStmt, edgeRows) {
+    const resolvedSources = new Set();
+    for (const name of imp.names) {
+        const cleanName = name.replace(/^\*\s+as\s+/, '');
+        const actualSource = resolveBarrelExportCached(ctx, resolvedPath, cleanName);
+        if (actualSource && actualSource !== resolvedPath && !resolvedSources.has(actualSource)) {
+            resolvedSources.add(actualSource);
+            const actualRow = getNodeIdStmt.get(actualSource, 'file', actualSource, 0);
+            if (actualRow) {
+                const kind = edgeKind === 'imports-type'
+                    ? 'imports-type'
+                    : edgeKind === 'dynamic-imports'
+                        ? 'dynamic-imports'
+                        : 'imports';
+                edgeRows.push([fileNodeId, actualRow.id, kind, 0.9, 0, null, null]);
+            }
+        }
+    }
+}
+function createFileNodeIdRegistry(getNodeIdStmt) {
+    const ids = [];
+    const seen = new Set();
+    const cache = new Map();
+    return {
+        ids,
+        add(relPath) {
+            if (seen.has(relPath))
+                return cache.get(relPath);
+            const row = getNodeIdStmt.get(relPath, 'file', relPath, 0);
+            if (row) {
+                seen.add(relPath);
+                ids.push({ file: relPath, nodeId: row.id });
+                cache.set(relPath, row);
+            }
+            return row;
+        },
+    };
+}
+function toNativeImportInfo(imp) {
+    return {
+        source: imp.source,
+        names: imp.names,
+        reexport: !!imp.reexport,
+        typeOnly: !!imp.typeOnly,
+        dynamicImport: !!imp.dynamicImport,
+        wildcardReexport: !!imp.wildcardReexport,
+    };
+}
+/**
+ * Pre-resolve every import for the given files, registering each resolved
+ * target with the registry so the native side has full node-id coverage.
+ *
+ * Resolved-import keys use forward-slash-normalized rootDir + "/" + relPath to
+ * match the Rust lookup format. On Windows, rootDir has backslashes but Rust
+ * normalizes them — the JS side must do the same or every key lookup misses
+ * (#750).
+ */
+function buildNativeFileInputs(ctx, registry) {
+    const { fileSymbols, barrelOnlyFiles, rootDir } = ctx;
+    const fwdRootDir = rootDir.replace(/\\/g, '/');
+    const files = [];
+    const resolvedImports = [];
+    for (const [relPath, symbols] of fileSymbols) {
+        const fileNodeRow = registry.add(relPath);
+        if (!fileNodeRow)
+            continue;
+        const importInfos = [];
+        for (const imp of symbols.imports) {
+            const resolvedPath = getResolved(ctx, path.join(rootDir, relPath), imp.source);
+            registry.add(resolvedPath);
+            resolvedImports.push({ key: `${fwdRootDir}/${relPath}|${imp.source}`, resolvedPath });
+            importInfos.push(toNativeImportInfo(imp));
+        }
+        files.push({
+            file: relPath,
+            fileNodeId: fileNodeRow.id,
+            isBarrelOnly: barrelOnlyFiles.has(relPath),
+            imports: importInfos,
+            definitionNames: symbols.definitions.map((d) => d.name),
+        });
+    }
+    return { files, resolvedImports };
+}
+/** Flatten `ctx.reexportMap` into the array shape the native side expects. */
+function buildNativeReexports(ctx, registry) {
+    const fileReexports = [];
+    if (!ctx.reexportMap)
+        return fileReexports;
+    for (const [file, entries] of ctx.reexportMap) {
+        const reexports = entries.map((re) => ({
+            source: re.source,
+            names: re.names,
+            wildcardReexport: !!re.wildcardReexport,
+        }));
+        fileReexports.push({ file, reexports });
+        for (const re of reexports) {
+            registry.add(re.source);
+        }
+    }
+    return fileReexports;
+}
+function collectBarrelFiles(ctx) {
+    const barrelFiles = [];
+    for (const [relPath] of ctx.fileSymbols) {
+        if (isBarrelFile(ctx, relPath))
+            barrelFiles.push(relPath);
+    }
+    return barrelFiles;
+}
+function collectSymbolNodes(ctx) {
+    const symbolNodes = [];
+    if (!ctx.nodesByNameAndFile)
+        return symbolNodes;
+    for (const [key, nodes] of ctx.nodesByNameAndFile) {
+        if (nodes.length === 0)
+            continue;
+        const [name, file] = key.split('|');
+        symbolNodes.push({ name: name, file: file, nodeId: nodes[0].id });
+    }
+    return symbolNodes;
+}
+function buildImportEdgesNative(ctx, getNodeIdStmt, allEdgeRows, native) {
+    const registry = createFileNodeIdRegistry(getNodeIdStmt);
+    const { files, resolvedImports } = buildNativeFileInputs(ctx, registry);
+    const fileReexports = buildNativeReexports(ctx, registry);
+    const barrelFiles = collectBarrelFiles(ctx);
+    const symbolNodes = collectSymbolNodes(ctx);
+    const nativeEdges = native.buildImportEdges(files, resolvedImports, fileReexports, registry.ids, barrelFiles, ctx.rootDir, symbolNodes);
+    for (const e of nativeEdges) {
+        allEdgeRows.push([e.sourceId, e.targetId, e.kind, e.confidence, e.dynamic, null, null]);
+    }
+}
+// ── Phase 8.2: Cross-file return-type propagation ───────────────────────
+/**
+ * Augment each file's typeMap with return types from imported functions.
+ *
+ * The per-file extractor already resolves same-file call assignments (intra-file
+ * propagation). This function handles the cross-file case: when a file imports a
+ * function from another file and assigns its return value to a variable, we look up
+ * the callee's return type in the source file's returnTypeMap and inject it.
+ *
+ * Called once before call-edge building so both the native and JS paths benefit.
+ */
+function propagateReturnTypesAcrossFiles(fileSymbols, ctx, rootDir) {
+    // Index: filePath → per-file return-type map
+    const returnTypeIndex = new Map();
+    for (const [relPath, symbols] of fileSymbols) {
+        if (symbols.returnTypeMap?.size)
+            returnTypeIndex.set(relPath, symbols.returnTypeMap);
+    }
+    if (returnTypeIndex.size === 0)
+        return;
+    // Flat global map for qualified method lookups (TypeName.methodName → entry).
+    // Conflicts resolved by keeping the highest-confidence entry.
+    const globalReturnTypeMap = new Map();
+    for (const rtm of returnTypeIndex.values()) {
+        for (const [name, entry] of rtm) {
+            const existing = globalReturnTypeMap.get(name);
+            if (!existing || entry.confidence > existing.confidence)
+                globalReturnTypeMap.set(name, entry);
+        }
+    }
+    for (const [relPath, symbols] of fileSymbols) {
+        if (!symbols.callAssignments?.length)
+            continue;
+        // Phase 8.4 side-effect: buildImportedNamesMap now traces through barrel
+        // files (traceBarrel), so `importedFrom` resolves to the leaf definition
+        // file rather than the barrel. This means returnTypeIndex.get(importedFrom)
+        // now finds entries it previously missed, improving cross-file return-type
+        // propagation through re-export chains (Phase 8.2 improvement).
+        const importedNamesMap = buildImportedNamesMap(ctx, relPath, symbols, rootDir);
+        for (const ca of symbols.callAssignments) {
+            if (symbols.typeMap.has(ca.varName))
+                continue; // already resolved locally
+            let returnEntry;
+            if (ca.receiverTypeName) {
+                returnEntry = globalReturnTypeMap.get(`${ca.receiverTypeName}.${ca.calleeName}`);
+            }
+            else {
+                const importedFrom = importedNamesMap.get(ca.calleeName);
+                if (importedFrom)
+                    returnEntry = returnTypeIndex.get(importedFrom)?.get(ca.calleeName);
+            }
+            if (returnEntry) {
+                const propagatedConf = returnEntry.confidence - PROPAGATION_HOP_PENALTY;
+                if (propagatedConf > 0)
+                    setTypeMapEntry(symbols.typeMap, ca.varName, returnEntry.type, propagatedConf);
+            }
+        }
+    }
+}
+// ── Call edges (native engine) ──────────────────────────────────────────
+function buildCallEdgesNative(ctx, getNodeIdStmt, allEdgeRows, allNodes, native) {
+    const { fileSymbols, barrelOnlyFiles, rootDir } = ctx;
+    const nativeFiles = [];
+    for (const [relPath, symbols] of fileSymbols) {
+        if (barrelOnlyFiles.has(relPath))
+            continue;
+        const fileNodeRow = getNodeIdStmt.get(relPath, 'file', relPath, 0);
+        if (!fileNodeRow)
+            continue;
+        const importedNames = buildImportedNamesForNative(ctx, relPath, symbols, rootDir);
+        const typeMapRaw = symbols.typeMap instanceof Map
+            ? [...symbols.typeMap.entries()].map(([name, entry]) => ({
+                name,
+                typeName: typeof entry === 'string' ? entry : entry.type,
+                confidence: typeof entry === 'object' ? entry.confidence : 0.9,
+            }))
+            : Array.isArray(symbols.typeMap)
+                ? symbols.typeMap
+                : [];
+        // Deduplicate: keep highest-confidence entry per name (first-wins on tie),
+        // matching JS setTypeMapEntry semantics.  The Map branch is already
+        // deduped by setTypeMapEntry — this loop is only needed for the Array
+        // branch (pre-rebuilt native addon) but runs unconditionally as
+        // belt-and-suspenders since it's a cheap O(n) pass.
+        const typeMapDedup = new Map();
+        for (const entry of typeMapRaw) {
+            const existing = typeMapDedup.get(entry.name);
+            if (!existing || entry.confidence > existing.confidence) {
+                typeMapDedup.set(entry.name, entry);
+            }
+        }
+        const typeMap = [...typeMapDedup.values()];
+        nativeFiles.push({
+            file: relPath,
+            fileNodeId: fileNodeRow.id,
+            definitions: symbols.definitions.map((d) => {
+                const params = d.children?.filter((c) => c.kind === 'parameter').map((c) => c.name);
+                return {
+                    name: d.name,
+                    kind: d.kind,
+                    line: d.line,
+                    endLine: d.endLine ?? null,
+                    params: params?.length ? params : undefined,
+                };
+            }),
+            calls: symbols.calls,
+            importedNames,
+            classes: symbols.classes,
+            typeMap,
+            fnRefBindings: symbols.fnRefBindings?.length ? symbols.fnRefBindings : undefined,
+            paramBindings: symbols.paramBindings?.length ? symbols.paramBindings : undefined,
+            thisCallBindings: symbols.thisCallBindings?.length ? symbols.thisCallBindings : undefined,
+            arrayElemBindings: symbols.arrayElemBindings?.length ? symbols.arrayElemBindings : undefined,
+            spreadArgBindings: symbols.spreadArgBindings?.length ? symbols.spreadArgBindings : undefined,
+            forOfBindings: symbols.forOfBindings?.length ? symbols.forOfBindings : undefined,
+            arrayCallbackBindings: symbols.arrayCallbackBindings?.length
+                ? symbols.arrayCallbackBindings
+                : undefined,
+            objectRestParamBindings: symbols.objectRestParamBindings?.length
+                ? symbols.objectRestParamBindings
+                : undefined,
+            objectPropBindings: symbols.objectPropBindings?.length
+                ? symbols.objectPropBindings
+                : undefined,
+        });
+    }
+    const nativeEdges = native.buildCallEdges(nativeFiles, allNodes, [
+        ...BUILTIN_RECEIVERS,
+    ]);
+    for (const e of nativeEdges) {
+        allEdgeRows.push([
+            e.sourceId,
+            e.targetId,
+            e.kind,
+            e.confidence,
+            e.dynamic,
+            e.kind === 'calls' ? 'ts-native' : null,
+            e.dynamic_kind ?? null,
+        ]);
+    }
+}
+/**
+ * Object.defineProperty accessor post-pass for the native call-edge path.
+ *
+ * When a function is registered as a getter/setter via
+ * `Object.defineProperty(obj, "bar", { get: getter })`, calls to `this.X()`
+ * inside `getter` need to resolve against `obj` (because `this === obj` when
+ * the accessor is invoked). The native Rust engine has no knowledge of
+ * `definePropertyReceivers`, so this JS post-pass adds the missing edges.
+ */
+function buildDefinePropertyPostPass(ctx, getNodeIdStmt, allEdgeRows, sharedLookup) {
+    const filesWithReceivers = [...ctx.fileSymbols].filter(([, symbols]) => symbols.definePropertyReceivers && symbols.definePropertyReceivers.size > 0);
+    if (filesWithReceivers.length === 0)
+        return;
+    const seenByPair = new Set();
+    for (const [srcId, tgtId] of allEdgeRows) {
+        seenByPair.add(`${srcId}|${tgtId}`);
+    }
+    const { barrelOnlyFiles, rootDir } = ctx;
+    const lookup = sharedLookup ?? makeContextLookup(ctx, getNodeIdStmt);
+    for (const [relPath, symbols] of filesWithReceivers) {
+        if (barrelOnlyFiles.has(relPath))
+            continue;
+        const fileNodeRow = getNodeIdStmt.get(relPath, 'file', relPath, 0);
+        if (!fileNodeRow)
+            continue;
+        const importedNames = buildImportedNamesMap(ctx, relPath, symbols, rootDir);
+        const typeMap = symbols.typeMap || new Map();
+        const definePropertyReceivers = symbols.definePropertyReceivers;
+        for (const call of symbols.calls) {
+            if (call.receiver !== 'this')
+                continue;
+            const caller = findCaller(lookup, call, symbols.definitions, relPath, fileNodeRow);
+            if (!caller.callerName)
+                continue;
+            const receiverVarName = definePropertyReceivers.get(caller.callerName);
+            if (!receiverVarName)
+                continue;
+            // Only add edges the native engine missed (no direct target already).
+            const { targets: directTargets } = resolveCallTargets(lookup, call, relPath, importedNames, typeMap, caller.callerName);
+            if (directTargets.length > 0)
+                continue;
+            // Resolve via receiver type
+            let targets = [];
+            const typeEntry = typeMap.get(receiverVarName);
+            const typeName = typeEntry
+                ? typeof typeEntry === 'string'
+                    ? typeEntry
+                    : typeEntry.type
+                : null;
+            if (typeName) {
+                const qualifiedName = `${typeName}.${call.name}`;
+                targets = lookup.byNameAndFile(qualifiedName, relPath);
+            }
+            // Same-file fallback for plain object-literal methods
+            if (targets.length === 0) {
+                targets = lookup.byNameAndFile(call.name, relPath);
+            }
+            for (const t of targets) {
+                const edgeKey = `${caller.id}|${t.id}`;
+                if (t.id !== caller.id && !seenByPair.has(edgeKey)) {
+                    const conf = computeConfidence(relPath, t.file, null);
+                    if (conf > 0) {
+                        seenByPair.add(edgeKey);
+                        allEdgeRows.push([caller.id, t.id, 'calls', conf, 0, 'ts-native', null]);
+                    }
+                }
+            }
+        }
+    }
+}
+/**
+ * Phase 8.5: CHA + RTA post-pass for the native call-edge path.
+ *
+ * The native Rust engine has no knowledge of the CHA context, so `this.method()`
+ * calls and interface method dispatches are not expanded to their concrete
+ * implementations.  This JS post-pass runs after the native edges and adds only
+ * the CHA-resolved edges that the native engine missed.
+ *
+ * Seeds seenByPair from the current allEdgeRows snapshot to avoid duplicating
+ * edges the native engine already produced.
+ */
+function buildChaPostPass(ctx, getNodeIdStmt, allEdgeRows, chaCtx) {
+    // Fast-exit when the CHA context is empty (no class hierarchy in the project)
+    if (chaCtx.implementors.size === 0 && chaCtx.parents.size === 0)
+        return;
+    // Seed only from 'calls' edges — import/extends/implements edges share (src,tgt) pairs
+    // with real call edges at the file-node level and would cause false dedup if included.
+    const seenByPair = new Set();
+    for (const row of allEdgeRows) {
+        if (row[2] === 'calls')
+            seenByPair.add(`${row[0]}|${row[1]}`);
+    }
+    const { fileSymbols, barrelOnlyFiles } = ctx;
+    const lookup = makeContextLookup(ctx, getNodeIdStmt);
+    for (const [relPath, symbols] of fileSymbols) {
+        if (barrelOnlyFiles.has(relPath))
+            continue;
+        const fileNodeRow = getNodeIdStmt.get(relPath, 'file', relPath, 0);
+        if (!fileNodeRow)
+            continue;
+        const typeMap = symbols.typeMap || new Map();
+        for (const call of symbols.calls) {
+            if (!call.receiver)
+                continue;
+            if (BUILTIN_RECEIVERS.has(call.receiver))
+                continue;
+            const caller = findCaller(lookup, call, symbols.definitions, relPath, fileNodeRow);
+            let chaTargets = [];
+            let isTypedReceiverDispatch = false;
+            if (call.receiver === 'this' || call.receiver === 'self' || call.receiver === 'super') {
+                chaTargets = resolveThisDispatch(call.name, caller.callerName, call.receiver, chaCtx, lookup, relPath);
+            }
+            else {
+                const typeEntry = typeMap.get(call.receiver);
+                const typeName = typeEntry
+                    ? typeof typeEntry === 'string'
+                        ? typeEntry
+                        : typeEntry.type
+                    : null;
+                if (typeName) {
+                    chaTargets = resolveChaTargets(typeName, call.name, chaCtx, lookup);
+                    isTypedReceiverDispatch = true;
+                }
+            }
+            for (const t of chaTargets) {
+                const edgeKey = `${caller.id}|${t.id}`;
+                if (t.id !== caller.id && !seenByPair.has(edgeKey)) {
+                    // Typed-receiver (interface/CHA) dispatch: use CHA_TYPED_DISPATCH_CONFIDENCE
+                    // — file proximity is not meaningful for virtual dispatch confidence.
+                    // this/super dispatch keeps computeConfidence-based proximity scoring to
+                    // match runPostNativeThisDispatch (native-orchestrator.ts).
+                    const conf = isTypedReceiverDispatch
+                        ? CHA_TYPED_DISPATCH_CONFIDENCE
+                        : computeConfidence(relPath, t.file, null) - CHA_DISPATCH_PENALTY;
+                    if (conf > 0) {
+                        seenByPair.add(edgeKey);
+                        // Tag super-dispatch edges distinctly so runChaPostPass can exclude them
+                        // from further CHA expansion (super calls are not virtual dispatch).
+                        const technique = call.receiver === 'super' ? 'super-dispatch' : 'cha';
+                        allEdgeRows.push([caller.id, t.id, 'calls', conf, 0, technique, null]);
+                    }
+                }
+            }
+        }
+    }
+}
+function buildImportedNamesForNative(ctx, relPath, symbols, rootDir) {
+    const importedNames = [];
+    // Process dynamic imports first (lower priority), then static imports
+    // (higher priority). Rust HashMap::collect keeps the last entry per key,
+    // so static imports win when both contribute the same name.
+    const addImports = (imp) => {
+        const resolvedPath = getResolved(ctx, path.join(rootDir, relPath), imp.source);
+        for (const name of imp.names) {
+            const cleanName = name.replace(/^\*\s+as\s+/, '');
+            let targetFile = resolvedPath;
+            if (isBarrelFile(ctx, resolvedPath)) {
+                const actual = resolveBarrelExportCached(ctx, resolvedPath, cleanName);
+                if (actual)
+                    targetFile = actual;
+            }
+            importedNames.push({ name: cleanName, file: targetFile });
+        }
+    };
+    for (const imp of symbols.imports) {
+        if (imp.dynamicImport)
+            addImports(imp);
+    }
+    for (const imp of symbols.imports) {
+        if (!imp.dynamicImport)
+            addImports(imp);
+    }
+    return importedNames;
+}
+// ── Call edges (JS fallback) ────────────────────────────────────────────
+function buildCallEdgesJS(ctx, getNodeIdStmt, allEdgeRows, chaCtx) {
+    const { fileSymbols, barrelOnlyFiles, rootDir } = ctx;
+    const lookup = makeContextLookup(ctx, getNodeIdStmt);
+    for (const [relPath, symbols] of fileSymbols) {
+        if (barrelOnlyFiles.has(relPath))
+            continue;
+        const fileNodeRow = getNodeIdStmt.get(relPath, 'file', relPath, 0);
+        if (!fileNodeRow)
+            continue;
+        const importedNames = buildImportedNamesMap(ctx, relPath, symbols, rootDir);
+        const typeMap = new Map(symbols.typeMap instanceof Map ? symbols.typeMap : []);
+        // Phase 8.3f: seed typeMap[callee::restName] = { type: argName } for each
+        // object-destructuring rest parameter binding × call-site argument binding.
+        // Keys are scoped so two functions with the same rest-param name in the same
+        // file don't collide (#1358). When only one callee uses a given rest name,
+        // also seed the unscoped key as a null-callerName fallback.
+        if (symbols.objectRestParamBindings?.length && symbols.paramBindings?.length) {
+            const restNameCallees = new Map();
+            for (const orpb of symbols.objectRestParamBindings) {
+                if (!restNameCallees.has(orpb.restName))
+                    restNameCallees.set(orpb.restName, new Set());
+                restNameCallees.get(orpb.restName).add(orpb.callee);
+            }
+            for (const orpb of symbols.objectRestParamBindings) {
+                for (const pb of symbols.paramBindings) {
+                    if (pb.callee === orpb.callee && pb.argIndex === orpb.argIndex) {
+                        const scopedKey = `${orpb.callee}::${orpb.restName}`;
+                        if (!typeMap.has(scopedKey)) {
+                            typeMap.set(scopedKey, { type: pb.argName, confidence: 0.65 });
+                            if (restNameCallees.get(orpb.restName).size === 1 && !typeMap.has(orpb.restName)) {
+                                typeMap.set(orpb.restName, { type: pb.argName, confidence: 0.65 });
+                            }
+                        }
+                    }
+                }
+            }
+        }
+        const seenCallEdges = new Set();
+        const ptsMap = buildPointsToMapForFile(symbols, importedNames);
+        buildFileCallEdges(relPath, symbols, fileNodeRow, importedNames, seenCallEdges, lookup, allEdgeRows, typeMap, ptsMap, chaCtx);
+        buildClassHierarchyEdges(ctx, relPath, symbols, allEdgeRows);
+    }
+}
+function buildImportedNamesMap(ctx, relPath, symbols, rootDir) {
+    const importedNames = new Map();
+    // Process dynamic imports first (lower priority), then static imports
+    // (higher priority). Static imports represent direct bindings while dynamic
+    // imports often use aliased destructuring (`{ foo: bar } = await import(…)`).
+    // When both contribute the same name, the static binding is authoritative.
+    //
+    // Phase 8.4: trace through barrel files so that symbol names map to their
+    // actual definition file, not the re-exporting barrel. Mirrors the tracing
+    // already done in buildImportedNamesForNative (the native path).
+    const traceBarrel = (resolvedPath, cleanName) => {
+        if (!isBarrelFile(ctx, resolvedPath))
+            return resolvedPath;
+        const actual = resolveBarrelExportCached(ctx, resolvedPath, cleanName);
+        return actual ?? resolvedPath;
+    };
+    for (const imp of symbols.imports) {
+        if (!imp.dynamicImport)
+            continue;
+        const resolvedPath = getResolved(ctx, path.join(rootDir, relPath), imp.source);
+        for (const name of imp.names) {
+            const cleanName = name.replace(/^\*\s+as\s+/, '');
+            importedNames.set(cleanName, traceBarrel(resolvedPath, cleanName));
+        }
+    }
+    for (const imp of symbols.imports) {
+        if (imp.dynamicImport)
+            continue;
+        const resolvedPath = getResolved(ctx, path.join(rootDir, relPath), imp.source);
+        for (const name of imp.names) {
+            const cleanName = name.replace(/^\*\s+as\s+/, '');
+            importedNames.set(cleanName, traceBarrel(resolvedPath, cleanName));
+        }
+    }
+    return importedNames;
+}
+function makeContextLookup(ctx, getNodeIdStmt) {
+    return {
+        byNameAndFile: (name, file) => ctx.nodesByNameAndFile.get(`${name}|${file}`) ?? [],
+        byName: (name) => ctx.nodesByName.get(name) ?? [],
+        isBarrel: (file) => isBarrelFile(ctx, file),
+        resolveBarrel: (barrelFile, symbolName) => resolveBarrelExportCached(ctx, barrelFile, symbolName),
+        nodeId: (name, kind, file, line) => getNodeIdStmt.get(name, kind, file, line),
+    };
+}
+/**
+ * Build a per-file points-to map for Phase 8.3 alias resolution.
+ * Returns null fast when the file has no function-reference bindings.
+ *
+ * Only callable definitions (function/method) are seeded as concrete targets.
+ * Class and interface names are intentionally excluded — aliasing a constructor
+ * (`const Svc = MyService`) is an uncommon pattern that would require tracking
+ * `new`-expression flows separately from the alias chain. That is left to Phase
+ * 8.2 call-assignment propagation, which already handles constructor assignments.
+ */
+function buildPointsToMapForFile(symbols, importedNames) {
+    const hasThisCallBindings = !!symbols.thisCallBindings?.length;
+    if (!symbols.fnRefBindings?.length &&
+        !symbols.paramBindings?.length &&
+        !symbols.arrayElemBindings?.length &&
+        !symbols.spreadArgBindings?.length &&
+        !symbols.forOfBindings?.length &&
+        !symbols.arrayCallbackBindings?.length &&
+        !symbols.objectRestParamBindings?.length &&
+        !symbols.objectPropBindings?.length &&
+        !hasThisCallBindings)
+        return null;
+    const defNames = new Set(symbols.definitions
+        .filter((d) => d.kind === 'function' || d.kind === 'method')
+        .map((d) => d.name));
+    const definitionParams = buildDefinitionParamsMap(symbols.definitions);
+    // Convert thisCallBindings into scoped fnRefBindings: `fn::this → namedCtx`.
+    // The scoped key `fn::this` is looked up when `this()` calls are resolved inside
+    // function `fn` — caller.callerName='fn', call.name='this' → scopedPtsKey='fn::this'.
+    let allFnRefBindings = symbols.fnRefBindings ?? [];
+    if (hasThisCallBindings) {
+        const extra = (symbols.thisCallBindings ?? []).map((b) => ({
+            lhs: `${b.callee}::this`,
+            rhs: b.thisArg,
+        }));
+        allFnRefBindings = [...allFnRefBindings, ...extra];
+    }
+    return buildPointsToMap(allFnRefBindings, defNames, importedNames, symbols.paramBindings, definitionParams, symbols.arrayElemBindings, symbols.spreadArgBindings, symbols.forOfBindings, symbols.arrayCallbackBindings, symbols.objectRestParamBindings, symbols.objectPropBindings);
+}
+function buildDefinitionParamsMap(definitions) {
+    const map = new Map();
+    for (const def of definitions) {
+        if ((def.kind === 'function' || def.kind === 'method') && def.children) {
+            const params = def.children.filter((c) => c.kind === 'parameter').map((c) => c.name);
+            if (params.length > 0) {
+                if (map.has(def.name)) {
+                    // Two definitions share the same name (e.g. overloads, same-named method and
+                    // function, or conditional redeclaration). Keep the first entry — using the
+                    // wrong parameter list would map argIndex to the wrong parameter name.
+                    debug(`buildDefinitionParamsMap: duplicate def name "${def.name}" (kind=${def.kind}, line=${def.line}) — skipping; first entry kept`);
+                }
+                else {
+                    map.set(def.name, params);
+                }
+            }
+        }
+    }
+    return map;
+}
+// ── Per-call resolution helpers ─────────────────────────────────────────
+/**
+ * Resolve targets for a single call site with all JS-path fallbacks applied.
+ *
+ * Runs in order:
+ *   1. Primary resolution via `resolveCallTargets` (importedNames + typeMap).
+ *   2. Same-class `this.method()` fallback (non-super receivers only).
+ *   3. Same-class bare-call fallback for non-JS/TS class-scoped languages.
+ *   4. Object.defineProperty accessor fallback (this-calls inside getter/setter).
+ *
+ * Returns the resolved targets array and the importedFrom hint for confidence scoring.
+ */
+function resolveFallbackTargets(call, caller, relPath, importedNames, lookup, typeMap, definePropertyReceivers) {
+    let { targets, importedFrom } = resolveCallTargets(lookup, call, relPath, importedNames, typeMap, caller.callerName);
+    // Same-class `this.method()` fallback: when the call receiver is `this` and
+    // resolveCallTargets found nothing, derive the enclosing class name from the
+    // caller (e.g. `Logger.info` → class prefix `Logger`) and retry with the
+    // qualified method name `Logger._write`. This mirrors what the native Rust
+    // engine does implicitly via its class-scoped symbol table.
+    // NOTE: restricted to `this` only — `super.method()` targets a parent class,
+    // not the enclosing class, so qualifying with the child class name would
+    // produce a false edge when the child also defines a same-named method.
+    if (targets.length === 0 && call.receiver === 'this' && caller.callerName != null) {
+        const lastDot = caller.callerName.lastIndexOf('.');
+        if (lastDot > 0) {
+            const prevDot = caller.callerName.lastIndexOf('.', lastDot - 1);
+            const className = caller.callerName.slice(prevDot + 1, lastDot);
+            const qualified = lookup
+                .byNameAndFile(`${className}.${call.name}`, relPath)
+                .filter((n) => n.kind === 'method');
+            if (qualified.length > 0)
+                targets = qualified;
+        }
+    }
+    // Same-class bare-call fallback: when a no-receiver call can't be resolved
+    // globally, try the caller's own class as a qualifier. Handles C# static
+    // sibling calls: `IsValidEmail()` inside `Validators.ValidateUser` resolves
+    // to `Validators.IsValidEmail`. Skipped for JS/TS where bare calls are
+    // module-scoped, not class-scoped.
+    if (targets.length === 0 &&
+        !call.receiver &&
+        caller.callerName != null &&
+        !isModuleScopedLanguage(relPath)) {
+        const lastDot = caller.callerName.lastIndexOf('.');
+        if (lastDot > 0) {
+            const prevDot = caller.callerName.lastIndexOf('.', lastDot - 1);
+            const className = caller.callerName.slice(prevDot + 1, lastDot);
+            const qualified = lookup
+                .byNameAndFile(`${className}.${call.name}`, relPath)
+                .filter((n) => n.kind === 'method');
+            if (qualified.length > 0)
+                targets = qualified;
+        }
+    }
+    // Object.defineProperty accessor fallback: when a function is registered as
+    // a getter/setter via `Object.defineProperty(obj, "bar", { get: getter })`,
+    // calls to `this.X()` inside `getter` resolve against `obj` (this === obj
+    // when the accessor is invoked). If the same-class fallback above found
+    // nothing, try treating `obj` as the receiver and look up `obj.X` in the
+    // typeMap, or fall back to a same-file lookup of any definition named X
+    // that belongs to the object literal or its type.
+    if (targets.length === 0 &&
+        call.receiver === 'this' &&
+        caller.callerName != null &&
+        definePropertyReceivers) {
+        const receiverVarName = definePropertyReceivers.get(caller.callerName);
+        if (receiverVarName) {
+            const typeEntry = typeMap.get(receiverVarName);
+            const typeName = typeEntry
+                ? typeof typeEntry === 'string'
+                    ? typeEntry
+                    : typeEntry.type
+                : null;
+            if (typeName) {
+                const qualified = lookup.byNameAndFile(`${typeName}.${call.name}`, relPath);
+                if (qualified.length > 0)
+                    targets = [...qualified];
+            }
+            // If still no targets, search for any definition named `call.name` in
+            // the same file — handles plain object literals where the method isn't
+            // qualified (e.g. `const obj = { baz() {} }` defines `baz` directly).
+            // Note: this is intentionally broad — it matches any same-file definition
+            // with the called name, not just members of the receiver object. This is
+            // the same behaviour used by the native post-pass path (buildDefinePropertyPostPass).
+            if (targets.length === 0) {
+                const sameFile = lookup.byNameAndFile(call.name, relPath);
+                if (sameFile.length > 0)
+                    targets = [...sameFile];
+            }
+        }
+    }
+    return { targets, importedFrom };
+}
+/**
+ * Emit direct-call edges for the resolved targets of a single call site.
+ *
+ * Sorts targets by confidence descending first, then for each target:
+ *   - Skips self-edges and already-seen edges.
+ *   - If a pts edge already exists for this pair, upgrades it in-place to
+ *     direct-call confidence and promotes to seenCallEdges.
+ *   - Otherwise records a new `calls` edge with `ts-native` technique.
+ */
+function emitDirectCallEdgesForCall(caller, targets, importedFrom, isDynamic, relPath, seenCallEdges, ptsEdgeRows, allEdgeRows) {
+    // Sort targets by confidence descending before emitting edges.
+    // For multi-target calls with duplicate (source_id, target_id) pairs the
+    // stored confidence depends on which duplicate is processed last — sorting
+    // here guarantees the highest-confidence target wins on dedup, matching the
+    // native engine's sort_targets_by_confidence call in build_edges.rs.
+    const sorted = targets.length > 1
+        ? [...targets].sort((a, b) => computeConfidence(relPath, b.file, importedFrom ?? null) -
+            computeConfidence(relPath, a.file, importedFrom ?? null))
+        : targets;
+    for (const t of sorted) {
+        const edgeKey = `${caller.id}|${t.id}`;
+        if (t.id === caller.id)
+            continue;
+        const confidence = computeConfidence(relPath, t.file, importedFrom ?? null);
+        if (seenCallEdges.has(edgeKey))
+            continue;
+        const ptsIdx = ptsEdgeRows.get(edgeKey);
+        if (ptsIdx !== undefined) {
+            // A pts-resolved edge already exists for this caller→target pair with a
+            // penalised confidence. Upgrade it to the direct-call confidence in-place,
+            // then promote to seenCallEdges so no further processing is needed.
+            const ptsRow = allEdgeRows[ptsIdx];
+            if (ptsRow) {
+                ptsRow[3] = confidence;
+                ptsRow[4] = isDynamic; // upgrade is_dynamic: direct call overrides the pts-alias dynamic flag
+                ptsRow[5] = 'ts-native'; // promoted from pts to direct-call resolution
+            }
+            ptsEdgeRows.delete(edgeKey);
+            seenCallEdges.add(edgeKey);
+        }
+        else {
+            seenCallEdges.add(edgeKey);
+            allEdgeRows.push([caller.id, t.id, 'calls', confidence, isDynamic, 'ts-native', null]);
+        }
+    }
+}
+/**
+ * Phase 8.3 / 8.3c / bind: emit pts-resolved edges for unresolved no-receiver calls.
+ *
+ * Fires for three cases:
+ *   (a) dynamic=true: alias calls emitted by extractCallbackReferenceCalls.
+ *       Looks up `call.name` directly (alias entries are flat-keyed).
+ *   (b) non-dynamic: parameter variable calls (fn() where fn is a param).
+ *       Looks up the scoped key `callerName::call.name` to avoid spurious
+ *       edges from same-named parameters across different functions.
+ *   (c) non-dynamic: module-level alias bindings — `f = fn.bind(ctx)` or
+ *       `const f = handler` — where pts('f') was seeded by fnRefBindings.
+ *       Checked against fnRefBindingLhs so case (c) only fires for genuine
+ *       bind/alias entries and never for self-seeded local definitions.
+ *
+ * Pts edges are added to ptsEdgeRows (not seenCallEdges) so that a later
+ * direct call to the same target can upgrade confidence rather than being
+ * silently dropped by the dedup guard.
+ */
+function emitPtsNoReceiverEdges(call, caller, isDynamic, relPath, importedNames, lookup, typeMap, ptsMap, fnRefBindingLhs, seenCallEdges, ptsEdgeRows, allEdgeRows) {
+    const scopedPtsKey = caller.callerName != null ? `${caller.callerName}::${call.name}` : null;
+    // Module-level calls (callerName === null) use the '<module>' sentinel emitted by
+    // extractSpreadForOfWalk for top-level for-of loops. Look it up as a fallback so
+    // that `for (const f of arr) { f(); }` at module scope resolves correctly.
+    const modulePtsKey = caller.callerName === null && ptsMap.has(`<module>::${call.name}`)
+        ? `<module>::${call.name}`
+        : null;
+    const flatPtsKey = !call.dynamic && fnRefBindingLhs.has(call.name) && ptsMap.has(call.name) ? call.name : null;
+    if (!(call.dynamic ||
+        (scopedPtsKey != null && ptsMap.has(scopedPtsKey)) ||
+        modulePtsKey != null ||
+        flatPtsKey != null))
+        return;
+    const ptsLookupName = call.dynamic
+        ? call.name
+        : scopedPtsKey != null && ptsMap.has(scopedPtsKey)
+            ? scopedPtsKey
+            : modulePtsKey != null
+                ? modulePtsKey
+                : // flatPtsKey != null is guaranteed: if neither call.dynamic nor scopedPtsKey
+                    // nor modulePtsKey matched, flatPtsKey must be non-null.
+                    flatPtsKey;
+    for (const alias of resolveViaPointsTo(ptsLookupName, ptsMap)) {
+        // Resolve the concrete alias target. Only `name` is needed here — receiver
+        // and line are not relevant for alias resolution (we are looking up the
+        // aliased function by name, not dispatching a method call).
+        const { targets: aliasTargets, importedFrom: aliasFrom } = resolveCallTargets(lookup, { name: alias }, relPath, importedNames, typeMap);
+        const sortedAliasTargets = aliasTargets.length > 1
+            ? [...aliasTargets].sort((a, b) => computeConfidence(relPath, b.file, aliasFrom ?? null) -
+                computeConfidence(relPath, a.file, aliasFrom ?? null))
+            : aliasTargets;
+        for (const t of sortedAliasTargets) {
+            const edgeKey = `${caller.id}|${t.id}`;
+            if (t.id !== caller.id && !seenCallEdges.has(edgeKey) && !ptsEdgeRows.has(edgeKey)) {
+                const conf = computeConfidence(relPath, t.file, aliasFrom ?? null) - PROPAGATION_HOP_PENALTY;
+                if (conf > 0) {
+                    ptsEdgeRows.set(edgeKey, allEdgeRows.length);
+                    allEdgeRows.push([caller.id, t.id, 'calls', conf, isDynamic, 'points-to', null]);
+                }
+            }
+        }
+    }
+}
+/**
+ * Phase 8.3f: emit pts-resolved edges for unresolved receiver calls via
+ * object-rest param bindings.
+ *
+ * Fires when `rest.prop()` is encountered and `rest` was seeded as
+ * `pts["rest.prop"]` by the object-rest dispatch chain
+ * (ObjectRestParamBinding + paramBinding + ObjectPropBinding).
+ */
+function emitPtsReceiverEdges(call, caller, isDynamic, relPath, importedNames, lookup, typeMap, ptsMap, seenCallEdges, ptsEdgeRows, allEdgeRows) {
+    const receiverKey = `${call.receiver}.${call.name}`;
+    if (!ptsMap.has(receiverKey))
+        return;
+    for (const alias of resolveViaPointsTo(receiverKey, ptsMap)) {
+        const { targets: aliasTargets, importedFrom: aliasFrom } = resolveCallTargets(lookup, { name: alias }, relPath, importedNames, typeMap);
+        const sortedAliasTargets = aliasTargets.length > 1
+            ? [...aliasTargets].sort((a, b) => computeConfidence(relPath, b.file, aliasFrom ?? null) -
+                computeConfidence(relPath, a.file, aliasFrom ?? null))
+            : aliasTargets;
+        for (const t of sortedAliasTargets) {
+            const edgeKey = `${caller.id}|${t.id}`;
+            if (t.id !== caller.id && !seenCallEdges.has(edgeKey) && !ptsEdgeRows.has(edgeKey)) {
+                const conf = computeConfidence(relPath, t.file, aliasFrom ?? null) - PROPAGATION_HOP_PENALTY;
+                if (conf > 0) {
+                    ptsEdgeRows.set(edgeKey, allEdgeRows.length);
+                    allEdgeRows.push([caller.id, t.id, 'calls', conf, isDynamic, 'points-to', null]);
+                }
+            }
+        }
+    }
+}
+/**
+ * Phase 8.5: emit CHA + RTA dispatch edges for a single call site.
+ *
+ * For `this`/`self`/`super` calls: resolve through the class hierarchy.
+ * For typed receiver calls: expand to all instantiated concrete implementations.
+ */
+function emitChaCallEdgesForCall(call, caller, relPath, typeMap, lookup, chaCtx, seenCallEdges, ptsEdgeRows, allEdgeRows) {
+    let chaTargets = [];
+    let isTypedReceiverDispatch = false;
+    if (call.receiver === 'this' || call.receiver === 'self' || call.receiver === 'super') {
+        chaTargets = resolveThisDispatch(call.name, caller.callerName, call.receiver, chaCtx, lookup, relPath);
+    }
+    else if (!BUILTIN_RECEIVERS.has(call.receiver)) {
+        const typeEntry = typeMap.get(call.receiver);
+        const typeName = typeEntry
+            ? typeof typeEntry === 'string'
+                ? typeEntry
+                : typeEntry.type
+            : null;
+        if (typeName) {
+            chaTargets = resolveChaTargets(typeName, call.name, chaCtx, lookup);
+            isTypedReceiverDispatch = true;
+        }
+    }
+    for (const t of chaTargets) {
+        const edgeKey = `${caller.id}|${t.id}`;
+        if (t.id !== caller.id && !seenCallEdges.has(edgeKey) && !ptsEdgeRows.has(edgeKey)) {
+            // Typed-receiver (interface/CHA) dispatch: use CHA_TYPED_DISPATCH_CONFIDENCE
+            // — file proximity is not meaningful for virtual dispatch confidence.
+            // this/super dispatch keeps computeConfidence-based proximity scoring to
+            // match runPostNativeThisDispatch (native-orchestrator.ts).
+            const conf = isTypedReceiverDispatch
+                ? CHA_TYPED_DISPATCH_CONFIDENCE
+                : computeConfidence(relPath, t.file, null) - CHA_DISPATCH_PENALTY;
+            if (conf > 0) {
+                seenCallEdges.add(edgeKey);
+                allEdgeRows.push([caller.id, t.id, 'calls', conf, 0, 'cha', null]);
+            }
+        }
+    }
+}
+/**
+ * Dynamic kinds that can never be resolved statically — emit a sink edge to the
+ * file node instead of silently dropping the call site.  confidence=0.0 keeps
+ * these below DEFAULT_MIN_CONFIDENCE so they never appear in normal query results.
+ */
+const FLAG_ONLY_KINDS = new Set([
+    'eval',
+    'computed-key',
+    'unresolved-dynamic',
+]);
+/**
+ * Build call edges for all calls in a single file (WASM/JS engine path).
+ *
+ * Iterates over `symbols.calls` and dispatches each call through the full
+ * JS resolution cascade:
+ *   1. `resolveFallbackTargets`  — primary + class-fallback + defineProperty fallback
+ *   2. `emitDirectCallEdgesForCall` — emit direct-call edges (upgrading any pts pair)
+ *   3. `emitPtsNoReceiverEdges`  — Phase 8.3/8.3c pts fallback for no-receiver calls
+ *   4. `emitPtsReceiverEdges`    — Phase 8.3f pts fallback for rest-param receiver calls
+ *   5. Inline `resolveReceiverEdge` — emit `receiver` edge for external receivers
+ *   6. `emitChaCallEdgesForCall` — Phase 8.5 CHA + RTA dispatch expansion
+ *   7. Sink edge for flag-only dynamic kinds (eval, computed-key, unresolved-dynamic)
+ */
+function buildFileCallEdges(relPath, symbols, fileNodeRow, importedNames, seenCallEdges, lookup, allEdgeRows, typeMap, ptsMap, chaCtx) {
+    // Tracks edges that were inserted by the pts fallback (edgeKey → allEdgeRows index).
+    // Kept separate from seenCallEdges so that a subsequent direct-call edge for the same
+    // caller→target pair can upgrade the confidence in-place rather than being silently
+    // dropped by the dedup guard. Once upgraded, the key moves to seenCallEdges and is
+    // no longer tracked here.
+    const ptsEdgeRows = new Map();
+    // Pre-compute the set of names that appear as lhs in fnRefBindings so that
+    // case (c) of the pts gate below only fires for names that are genuine
+    // bind/alias entries, not for every locally-defined function or import that
+    // buildPointsToMap seeds with a self-pointing entry.
+    const fnRefBindingLhs = new Set(symbols.fnRefBindings?.map((b) => b.lhs) ?? []);
+    for (const call of symbols.calls) {
+        if (call.receiver && BUILTIN_RECEIVERS.has(call.receiver))
+            continue;
+        const caller = findCaller(lookup, call, symbols.definitions, relPath, fileNodeRow);
+        const isDynamic = call.dynamic ? 1 : 0;
+        // Step 1: Resolve targets with all JS-path fallbacks.
+        const { targets, importedFrom } = resolveFallbackTargets(call, caller, relPath, importedNames, lookup, typeMap, symbols.definePropertyReceivers);
+        // Step 2: Emit direct-call edges (upgrades any pending pts edge in-place).
+        emitDirectCallEdgesForCall(caller, targets, importedFrom, isDynamic, relPath, seenCallEdges, ptsEdgeRows, allEdgeRows);
+        // Step 3: Phase 8.3/8.3c pts fallback for unresolved no-receiver calls.
+        if (targets.length === 0 && !call.receiver && ptsMap) {
+            emitPtsNoReceiverEdges(call, caller, isDynamic, relPath, importedNames, lookup, typeMap, ptsMap, fnRefBindingLhs, seenCallEdges, ptsEdgeRows, allEdgeRows);
+        }
+        // Step 4: Phase 8.3f pts fallback for unresolved receiver calls (rest params).
+        if (targets.length === 0 &&
+            call.receiver &&
+            !BUILTIN_RECEIVERS.has(call.receiver) &&
+            call.receiver !== 'this' &&
+            call.receiver !== 'self' &&
+            call.receiver !== 'super' &&
+            ptsMap) {
+            emitPtsReceiverEdges(call, caller, isDynamic, relPath, importedNames, lookup, typeMap, ptsMap, seenCallEdges, ptsEdgeRows, allEdgeRows);
+        }
+        // Step 5: Emit receiver edge for external (non-this/self/super) receivers.
+        if (call.receiver &&
+            !BUILTIN_RECEIVERS.has(call.receiver) &&
+            call.receiver !== 'this' &&
+            call.receiver !== 'self' &&
+            call.receiver !== 'super') {
+            const recv = resolveReceiverEdge(lookup, { name: call.name, receiver: call.receiver }, caller, relPath, typeMap, seenCallEdges, importedNames);
+            if (recv) {
+                allEdgeRows.push([
+                    recv.callerId,
+                    recv.receiverId,
+                    'receiver',
+                    recv.confidence,
+                    0,
+                    null,
+                    null,
+                ]);
+            }
+        }
+        // Step 6: Phase 8.5 CHA + RTA dispatch expansion.
+        if (chaCtx && call.receiver) {
+            emitChaCallEdgesForCall(call, caller, relPath, typeMap, lookup, chaCtx, seenCallEdges, ptsEdgeRows, allEdgeRows);
+        }
+        // Step 7: Flag-only dynamic kinds with no resolved target → sink edge to the
+        // file node.  confidence=0.0 keeps it below DEFAULT_MIN_CONFIDENCE so it never
+        // appears in normal query results, but is queryable via `codegraph roles --dynamic`.
+        if (targets.length === 0 && call.dynamicKind && FLAG_ONLY_KINDS.has(call.dynamicKind)) {
+            // Key per (caller, file, kind) so each kind gets at most one sink edge per caller.
+            const sinkKey = `${caller.id}:${fileNodeRow.id}:${call.dynamicKind}`;
+            if (!seenCallEdges.has(sinkKey)) {
+                seenCallEdges.add(sinkKey);
+                allEdgeRows.push([caller.id, fileNodeRow.id, 'calls', 0.0, 1, null, call.dynamicKind]);
+            }
+        }
+    }
+}
+// ── Class hierarchy edges ───────────────────────────────────────────────
+const HIERARCHY_SOURCE_KINDS = new Set(['class', 'struct', 'record', 'enum']);
+const EXTENDS_TARGET_KINDS = new Set(['class', 'struct', 'trait', 'record']);
+const IMPLEMENTS_TARGET_KINDS = new Set(['interface', 'trait', 'class']);
+function buildClassHierarchyEdges(ctx, relPath, symbols, allEdgeRows) {
+    for (const cls of symbols.classes) {
+        if (cls.extends) {
+            const sourceRow = (ctx.nodesByNameAndFile.get(`${cls.name}|${relPath}`) || []).find((n) => HIERARCHY_SOURCE_KINDS.has(n.kind));
+            const targetRows = (ctx.nodesByName.get(cls.extends) || []).filter((n) => EXTENDS_TARGET_KINDS.has(n.kind));
+            if (sourceRow) {
+                for (const t of targetRows) {
+                    allEdgeRows.push([sourceRow.id, t.id, 'extends', 1.0, 0, null, null]);
+                }
+            }
+        }
+        if (cls.implements) {
+            const sourceRow = (ctx.nodesByNameAndFile.get(`${cls.name}|${relPath}`) || []).find((n) => HIERARCHY_SOURCE_KINDS.has(n.kind));
+            const targetRows = (ctx.nodesByName.get(cls.implements) || []).filter((n) => IMPLEMENTS_TARGET_KINDS.has(n.kind));
+            if (sourceRow) {
+                for (const t of targetRows) {
+                    allEdgeRows.push([sourceRow.id, t.id, 'implements', 1.0, 0, null, null]);
+                }
+            }
+        }
+    }
+}
+// ── Native bulk-insert technique back-fill ──────────────────────────────
+/**
+ * After native bulkInsertEdges (which does not write the technique column),
+ * apply technique values from the in-memory row array back to the DB, and lift
+ * any resolved ts-native edge below TS_NATIVE_CONFIDENCE_FLOOR to that floor.
+ *
+ * Rows with an explicit technique get a targeted UPDATE by (source_id, target_id).
+ * The catch-all 'ts-native' tag is scoped to only the source_ids present in this
+ * batch — this prevents mis-tagging pre-migration NULL-technique edges from
+ * unchanged files that were never purged and re-inserted.
+ */
+function applyEdgeTechniquesAfterNativeInsert(db, rows) {
+    const callRows = rows.filter((r) => r[2] === 'calls');
+    if (callRows.length === 0)
+        return;
+    const taggedRows = callRows.filter((r) => r[5] != null);
+    // Collect distinct source IDs for this batch so the catch-all UPDATE is scoped
+    // to edges inserted in the current run, not the entire table.
+    const sourceIds = [...new Set(callRows.map((r) => r[0]))];
+    // Chunk to stay within SQLite's SQLITE_LIMIT_VARIABLE_NUMBER (999 on older builds).
+    const CHUNK_SIZE = 500;
+    // Rows that carry an explicit dynamic_kind (sink edges for flagged dynamic calls).
+    const dynamicKindRows = callRows.filter((r) => r[6] != null);
+    const tx = db.transaction(() => {
+        if (taggedRows.length > 0) {
+            const stmt = db.prepare("UPDATE edges SET technique = ? WHERE kind = 'calls' AND source_id = ? AND target_id = ? AND technique IS NULL");
+            for (const r of taggedRows)
+                stmt.run(r[5], r[0], r[1]);
+        }
+        for (let i = 0; i < sourceIds.length; i += CHUNK_SIZE) {
+            const chunk = sourceIds.slice(i, i + CHUNK_SIZE);
+            const placeholders = chunk.map(() => '?').join(',');
+            db.prepare(`UPDATE edges SET technique = 'ts-native' WHERE kind = 'calls' AND technique IS NULL AND source_id IN (${placeholders})`).run(...chunk);
+            // Lift resolved ts-native edges below the confidence floor for this chunk.
+            db.prepare(`UPDATE edges SET confidence = ?
+         WHERE kind = 'calls' AND technique = 'ts-native'
+           AND confidence > 0 AND confidence < ?
+           AND source_id IN (${placeholders})`).run(TS_NATIVE_CONFIDENCE_FLOOR, TS_NATIVE_CONFIDENCE_FLOOR, ...chunk);
+        }
+        // Back-fill dynamic_kind for flagged sink edges emitted by the native engine.
+        // Native bulkInsertEdges uses INSERT OR IGNORE and does not write dynamic_kind, so
+        // this UPDATE is the only way to set it for natively-inserted sink edges.
+        //
+        // Scope to confidence=0.0 AND dynamic=1 so we only touch sink edges (never normal
+        // call edges that happen to share the same (source_id, target_id) pair).
+        // Include dynamic_kind in the WHERE so two sink edges from the same caller to the
+        // same file with different kinds don't clobber each other across incremental runs.
+        if (dynamicKindRows.length > 0) {
+            const stmt = db.prepare("UPDATE edges SET dynamic_kind = ? WHERE kind = 'calls' AND source_id = ? AND target_id = ? AND confidence = 0.0 AND dynamic = 1 AND (dynamic_kind IS NULL OR dynamic_kind = ?)");
+            for (const r of dynamicKindRows)
+                stmt.run(r[6], r[0], r[1], r[6]);
+        }
+    });
+    tx();
+}
+// ── Reverse-dep edge reconnection (#932, #933) ─────────────────────────
+/**
+ * Reconnect edges that were saved before changed-file purge.
+ *
+ * Each saved edge records: sourceId (still valid — reverse-dep nodes were not
+ * purged) and target attributes (name, kind, file, line).  The target node was
+ * deleted and re-inserted with a new ID by insertNodes.  We look up the new ID
+ * by (name, kind, file) and re-create the edge.
+ */
+function reconnectReverseDepEdges(ctx) {
+    const { db } = ctx;
+    const findNodeStmt = db.prepare('SELECT id FROM nodes WHERE name = ? AND kind = ? AND file = ? ORDER BY ABS(line - ?) LIMIT 1');
+    const reconnectedRows = [];
+    let dropped = 0;
+    for (const saved of ctx.savedReverseDepEdges) {
+        const newTarget = findNodeStmt.get(saved.tgtName, saved.tgtKind, saved.tgtFile, saved.tgtLine);
+        if (newTarget) {
+            reconnectedRows.push([
+                saved.sourceId,
+                newTarget.id,
+                saved.edgeKind,
+                saved.confidence,
+                saved.dynamic,
+                saved.technique,
+                saved.dynamicKind ?? null,
+            ]);
+        }
+        else {
+            // Target was removed or renamed in the changed file — edge is stale
+            dropped++;
+        }
+    }
+    if (reconnectedRows.length > 0) {
+        if (ctx.nativeDb?.bulkInsertEdges) {
+            const nativeEdges = reconnectedRows.map((r) => ({
+                sourceId: r[0],
+                targetId: r[1],
+                kind: r[2],
+                confidence: r[3],
+                dynamic: r[4],
+            }));
+            const ok = ctx.nativeDb.bulkInsertEdges(nativeEdges);
+            if (!ok) {
+                batchInsertEdges(db, reconnectedRows);
+            }
+            else {
+                applyEdgeTechniquesAfterNativeInsert(db, reconnectedRows);
+            }
+        }
+        else {
+            batchInsertEdges(db, reconnectedRows);
+        }
+    }
+    debug(`Reconnected ${reconnectedRows.length} reverse-dep edges` +
+        (dropped > 0 ? ` (${dropped} dropped — targets removed/renamed)` : ''));
+}
+// ── Main entry point ────────────────────────────────────────────────────
+/**
+ * For small incremental builds (≤5 changed files on a large codebase), scope
+ * the node loading query to only files that are relevant: changed files +
+ * their import targets. Falls back to loading ALL nodes for full builds or
+ * larger incremental changes.
+ */
+const NODE_KIND_FILTER_SQL = `kind IN ('function','method','class','interface','struct','type','module','enum','trait','record','constant','variable')`;
+function loadNodes(ctx) {
+    const { db, fileSymbols, isFullBuild, batchResolved } = ctx;
+    const nodeKindFilter = NODE_KIND_FILTER_SQL;
+    // Gate: only scope for small incremental on large codebases
+    if (!isFullBuild && fileSymbols.size <= ctx.config.build.smallFilesThreshold) {
+        const existingFileCount = db.prepare("SELECT COUNT(*) as c FROM nodes WHERE kind = 'file'").get().c;
+        if (existingFileCount > 20) {
+            // Collect relevant files: changed files + their import targets
+            const relevantFiles = new Set(fileSymbols.keys());
+            if (batchResolved) {
+                for (const resolvedPath of batchResolved.values()) {
+                    relevantFiles.add(resolvedPath);
+                }
+            }
+            // Also add barrel-only files
+            for (const barrelPath of ctx.barrelOnlyFiles) {
+                relevantFiles.add(barrelPath);
+            }
+            const placeholders = [...relevantFiles].map(() => '?').join(',');
+            const rows = db
+                .prepare(`SELECT id, name, kind, file, line FROM nodes WHERE ${nodeKindFilter} AND file IN (${placeholders})`)
+                .all(...relevantFiles);
+            return { rows, scoped: true };
+        }
+    }
+    const rows = db
+        .prepare(`SELECT id, name, kind, file, line FROM nodes WHERE ${nodeKindFilter}`)
+        .all();
+    return { rows, scoped: false };
+}
+/**
+ * For scoped node loading, patch nodesByName.get with a lazy SQL fallback
+ * so global name-only lookups (resolveByMethodOrGlobal)
+ * can still find nodes outside the scoped set.
+ */
+function addLazyFallback(ctx, scopedLoad) {
+    if (!scopedLoad)
+        return;
+    const { db } = ctx;
+    // Match the upfront kind filter exactly. Using `kind != 'file'` here lets
+    // parameters, properties, and other non-definition kinds leak into call
+    // resolution, producing bogus call edges like `parser.ts → <a parameter
+    // with the same name>` (#1174 follow-up). Calls only ever target the
+    // definition kinds, so the fallback's filter must agree with `loadNodes`.
+    const fallbackStmt = db.prepare(`SELECT id, name, kind, file, line FROM nodes WHERE name = ? AND ${NODE_KIND_FILTER_SQL}`);
+    const originalGet = ctx.nodesByName.get.bind(ctx.nodesByName);
+    ctx.nodesByName.get = (name) => {
+        const result = originalGet(name);
+        if (result !== undefined)
+            return result;
+        const rows = fallbackStmt.all(name);
+        if (rows.length > 0) {
+            ctx.nodesByName.set(name, rows);
+            return rows;
+        }
+        return undefined;
+    };
+}
+export async function buildEdges(ctx) {
+    const { db, engineName } = ctx;
+    const getNodeIdStmt = makeGetNodeIdStmt(db);
+    const { rows: allNodesBefore, scoped: scopedLoad } = loadNodes(ctx);
+    setupNodeLookups(ctx, allNodesBefore);
+    addLazyFallback(ctx, scopedLoad);
+    const t0 = performance.now();
+    // Enrich typeMap for .ts/.tsx files using the TypeScript compiler API.
+    // Runs before call-edge construction so the accurate types are available
+    // for method-call resolution. Gated on config so users can opt out.
+    //
+    // Skip for small incremental builds: TypeScript program creation requires
+    // loading the entire tsconfig file list (~700ms startup on the codegraph
+    // corpus), which dominates the 1-file rebuild time. Native engine bypasses
+    // this entirely via the Rust orchestrator; WASM/JS engines need this gate
+    // to match native's effective behaviour on tiny incremental changes.
+    // Mirrors the smallFilesThreshold gates for nativeDb and native call-edges.
+    const isSmallIncremental = !ctx.isFullBuild && ctx.fileSymbols.size <= ctx.config.build.smallFilesThreshold;
+    if (ctx.config.build.typescriptResolver && !isSmallIncremental) {
+        await enrichTypeMapWithTsc(ctx.rootDir, ctx.fileSymbols);
+    }
+    const native = engineName === 'native' ? loadNative() : null;
+    // Phase 8.2: Augment typeMaps with cross-file return-type propagation before
+    // the transaction opens. This is pure in-memory mutation (no DB I/O) and must
+    // run outside the transaction to avoid leaving ctx.fileSymbols in a partial
+    // state if the transaction rolls back unexpectedly.
+    propagateReturnTypesAcrossFiles(ctx.fileSymbols, ctx, ctx.rootDir);
+    // Phase 8.5: Build CHA context after propagation so typeMap confidence values
+    // (used for RTA seeding) reflect any cross-file propagated types.
+    const chaCtx = buildChaContext(ctx.fileSymbols);
+    // Phase 1: Compute edges inside a better-sqlite3 transaction.
+    // Barrel-edge deletion lives here so that the JS path (which also inserts
+    // edges in this transaction) keeps deletion + insertion atomic.
+    // When using the native rusqlite path, insertion happens in Phase 2 on a
+    // separate connection — a crash between Phase 1 and Phase 2 would leave
+    // barrel edges missing until the next incremental rebuild re-creates them.
+    const allEdgeRows = [];
+    const computeEdgesTx = db.transaction(() => {
+        if (ctx.barrelOnlyFiles.size > 0) {
+            const deleteOutgoingEdges = db.prepare('DELETE FROM edges WHERE source_id IN (SELECT id FROM nodes WHERE file = ?)');
+            for (const relPath of ctx.barrelOnlyFiles) {
+                deleteOutgoingEdges.run(relPath);
+            }
+        }
+        // Skip native import-edge path for small incremental builds: napi-rs
+        // marshaling overhead (~13ms) exceeds Rust computation savings at this scale.
+        const useNativeImportEdges = native?.buildImportEdges &&
+            (ctx.isFullBuild || ctx.fileSymbols.size > ctx.config.build.smallFilesThreshold);
+        if (useNativeImportEdges) {
+            const beforeLen = allEdgeRows.length;
+            buildImportEdgesNative(ctx, getNodeIdStmt, allEdgeRows, native);
+            // Fallback: if native produced 0 import edges but there are imports to
+            // process, the native binary may have a key-format mismatch (e.g. Windows
+            // path separators — #750).  Retry with the JS implementation.
+            // NOTE: This also fires for codebases where every import targets an
+            // external package (npm deps) that the resolver intentionally skips.
+            // In that case the JS path resolves zero edges too, so the only cost
+            // is the redundant JS traversal — no correctness impact.
+            const hasImports = [...ctx.fileSymbols.values()].some((s) => s.imports.length > 0);
+            if (allEdgeRows.length === beforeLen && hasImports) {
+                debug('Native buildImportEdges produced 0 edges — falling back to JS');
+                buildImportEdges(ctx, getNodeIdStmt, allEdgeRows);
+            }
+        }
+        else {
+            buildImportEdges(ctx, getNodeIdStmt, allEdgeRows);
+        }
+        // Skip native call-edge path for small incremental builds: napi-rs
+        // marshaling overhead for allNodes exceeds Rust computation savings.
+        const useNativeCallEdges = native?.buildCallEdges &&
+            (ctx.isFullBuild || ctx.fileSymbols.size > ctx.config.build.smallFilesThreshold);
+        if (useNativeCallEdges) {
+            buildCallEdgesNative(ctx, getNodeIdStmt, allEdgeRows, allNodesBefore, native);
+            // The native engine receives all pts bindings (paramBindings,
+            // fnRefBindings, thisCallBindings, objectRestParamBindings, …) through
+            // NativeFileEntry and runs the same points-to solver as the JS path, so
+            // no pts post-passes are needed here. Only capabilities that remain
+            // JS-only run as post-passes below.
+            const sharedLookup = makeContextLookup(ctx, getNodeIdStmt);
+            // Object.defineProperty accessor post-pass: resolve this-dispatch inside
+            // getter/setter functions registered via Object.defineProperty.
+            buildDefinePropertyPostPass(ctx, getNodeIdStmt, allEdgeRows, sharedLookup);
+            // Phase 8.5 post-pass: augment native call edges with CHA-resolved dispatch.
+            // The native Rust engine has no knowledge of the CHA context, so this/self
+            // calls and interface dispatch are not expanded to concrete implementations.
+            buildChaPostPass(ctx, getNodeIdStmt, allEdgeRows, chaCtx);
+        }
+        else {
+            buildCallEdgesJS(ctx, getNodeIdStmt, allEdgeRows, chaCtx);
+        }
+        // Apply ts-native confidence floor to allEdgeRows in-memory.  The proximity
+        // heuristic returns 0.3 for cross-module calls with no import-path evidence,
+        // but both WASM and native engines perform actual name-based symbol lookup,
+        // which is stronger evidence than pure proximity.  Clamping to
+        // TS_NATIVE_CONFIDENCE_FLOOR (0.5) avoids unfairly dragging down the
+        // call-confidence metric.  Sink edges (confidence = 0.0) are excluded so
+        // they remain below DEFAULT_MIN_CONFIDENCE.
+        for (const r of allEdgeRows) {
+            if (r[2] === 'calls' &&
+                r[5] === 'ts-native' &&
+                r[3] > 0 &&
+                r[3] < TS_NATIVE_CONFIDENCE_FLOOR) {
+                r[3] = TS_NATIVE_CONFIDENCE_FLOOR;
+            }
+        }
+        // When using native edge insert, skip JS insert here — do it after tx commits.
+        // Otherwise insert edges within this transaction for atomicity.
+        const useNativeEdgeInsert = ctx.engineName === 'native' && !!ctx.nativeDb?.bulkInsertEdges;
+        if (!useNativeEdgeInsert) {
+            batchInsertEdges(db, allEdgeRows);
+        }
+    });
+    computeEdgesTx();
+    // Phase 2: Native rusqlite bulk insert (outside better-sqlite3 transaction
+    // to avoid SQLITE_BUSY contention). Uses NativeDatabase persistent connection.
+    // Standalone napi functions were removed in 6.17.
+    if (ctx.engineName === 'native' && ctx.nativeDb?.bulkInsertEdges && allEdgeRows.length > 0) {
+        const nativeEdges = allEdgeRows.map((r) => ({
+            sourceId: r[0],
+            targetId: r[1],
+            kind: r[2],
+            confidence: r[3],
+            dynamic: r[4],
+        }));
+        const ok = ctx.nativeDb.bulkInsertEdges(nativeEdges);
+        if (!ok) {
+            debug('Native bulkInsertEdges failed — falling back to JS batchInsertEdges');
+            batchInsertEdges(ctx.db, allEdgeRows);
+        }
+        else {
+            applyEdgeTechniquesAfterNativeInsert(ctx.db, allEdgeRows);
+        }
+    }
+    // Phase 3: Reconnect saved reverse-dep edges (#932, #933).
+    // When the WASM/JS path purged changed files, edges FROM reverse-dep files TO
+    // those files were deleted (target-side).  The reverse-dep files were NOT
+    // reparsed — instead we saved the edge topology before purge and now reconnect
+    // each edge to the new node IDs created by insertNodes.
+    if (ctx.savedReverseDepEdges.length > 0) {
+        reconnectReverseDepEdges(ctx);
+    }
+    // Phase 4: CHA post-pass — expand virtual-dispatch edges for class hierarchies
+    // and interface implementations. Runs after all call + hierarchy edges are
+    // committed so the DB is consistent.
+    // Note: the native orchestrator success path runs this independently in
+    // tryNativeOrchestrator; this phase covers the WASM and native-fallback paths.
+    runChaPostPass(db);
+    ctx.timing.edgesMs = performance.now() - t0;
+}
+//# sourceMappingURL=build-edges.js.map