codegraph-java 0.1.0

package/dist/resolution/resolver-pool.js

@@ -0,0 +1,344 @@
+"use strict";
+/**
+ * ResolverPool — main-thread client for the parallel-resolution workers.
+ *
+ * resolveBatch() splits a rowid-ordered batch into ordered chunks, fans the
+ * chunks across the pool, and reassembles the results IN CHUNK ORDER, so the
+ * caller's admission (edge inserts, row cleanup, failure parking, deferred
+ * post-pass queues) is byte-for-byte the sequence the single-threaded loop
+ * would have produced. Any worker failure fails the batch — the caller falls
+ * back to the sequential path. Kill switch: CODEGRAPH_NO_PARALLEL_RESOLVE=1.
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ResolverPool = void 0;
+exports.minRefsForPool = minRefsForPool;
+const worker_threads_1 = require("worker_threads");
+const fs = __importStar(require("fs"));
+const path = __importStar(require("path"));
+const os = __importStar(require("os"));
+const memory_budget_1 = require("./memory-budget");
+const MIN_PARALLEL_BATCH = 1000;
+const CHUNK_SIZE = 500;
+/**
+ * Minimum TOTAL pending refs before the pool is created at all. Pool boot
+ * (module load + readonly DB open + framework detect + cache warm, times N
+ * workers) costs real CPU that CONTENDS with sequential resolution on the
+ * same cores — measured on a medium repo (~40k refs, ~1.2s of resolution)
+ * the pool made indexing slower. It pays off when resolution runs for tens
+ * of seconds to minutes (large JVM/Spring-class repos). Override:
+ * CODEGRAPH_PARALLEL_RESOLVE_MIN=<refs> (0 forces the pool on).
+ */
+function minRefsForPool() {
+    const raw = process.env.CODEGRAPH_PARALLEL_RESOLVE_MIN;
+    if (raw !== undefined) {
+        const parsed = Number.parseInt(raw, 10);
+        if (Number.isFinite(parsed) && parsed >= 0)
+            return parsed;
+    }
+    return 150_000;
+}
+class ResolverPool {
+    workers = [];
+    nextId = 0;
+    waiters = new Map();
+    synthWaiters = new Map();
+    recycleWaiters = new Map();
+    failed = null;
+    /**
+     * Pool size from CPU headroom, memory headroom, and the explicit override.
+     * Pure — every input injected — so the whole matrix is unit-testable.
+     *
+     * CPU term: `availableParallelism` (cpuset/affinity-honest — `os.cpus()`
+     * enumerates the host's CPUs and sized SIX workers inside a 2-CPU cpuset,
+     * §7a.1's false-premise finding), minus one for the persisting main thread,
+     * floored at 2 so a true 2-core box keeps the pool's ~2× on synthesis,
+     * capped at the long-standing 6.
+     *
+     * Memory term: workers hold real heap at scale (~1GB each against a 4.6GB
+     * kernel-scale DB — six of them OOM-killed a 7GB container once real
+     * 8-core concurrency let them peak simultaneously). Estimate per-worker
+     * cost from the DB size, keep 30% of the budget for the main thread, and
+     * let the smaller term win. Below 2 workers the pool isn't worth its boot
+     * cost — callers get null and stay sequential.
+     */
+    static resolvePoolSize(opts) {
+        if (opts.explicit !== undefined && opts.explicit !== '') {
+            const n = Number.parseInt(opts.explicit, 10);
+            if (Number.isFinite(n)) {
+                if (n <= 0)
+                    return null;
+                return Math.min(n, 16);
+            }
+        }
+        // No floor: at ap=2 the pool LOSES to sequential outright — measured on
+        // the kernel-scale 2-cpuset envelope: resolution 853s sequential vs
+        // 1,150s pooled-6-on-2 (§7a.1), and synthesis is Amdahl-bound by its
+        // dominant pass (cFnPtrEdges 306s of 358s) so pooling it bought nothing.
+        // ap−1 < 2 ⇒ sequential is the fast path, not a fallback.
+        const cpuCap = Math.min(opts.availableParallelism - 1, 6);
+        const perWorker = Math.min(Math.max(opts.dbSizeBytes * 0.2, 256 * 1024 * 1024), 1.5 * 1024 * 1024 * 1024);
+        const memCap = Math.floor((opts.memoryBudget * 0.7) / perWorker);
+        const size = Math.min(cpuCap, memCap);
+        return size >= 2 ? size : null;
+    }
+    /**
+     * Create a pool when the compiled worker exists (absent when running from
+     * source in tests → callers use the sequential path), the kill switch is
+     * off, and the machine has the cores AND memory to carry it. Returns null
+     * otherwise. `CODEGRAPH_RESOLVE_WORKERS` overrides the computed size
+     * (0 disables the pool; values are capped at 16).
+     */
+    static tryCreate(dbPath, projectRoot) {
+        if (process.env.CODEGRAPH_NO_PARALLEL_RESOLVE === '1')
+            return null;
+        const workerScript = path.join(__dirname, 'resolver-worker.js');
+        if (!fs.existsSync(workerScript))
+            return null;
+        let dbSizeBytes = 0;
+        try {
+            dbSizeBytes = fs.statSync(dbPath).size;
+        }
+        catch { /* fresh/missing file — the 256MB per-worker floor applies */ }
+        const ap = os.availableParallelism();
+        const budget = (0, memory_budget_1.memoryBudgetBytes)();
+        const size = ResolverPool.resolvePoolSize({
+            explicit: process.env.CODEGRAPH_RESOLVE_WORKERS,
+            availableParallelism: ap,
+            memoryBudget: budget,
+            dbSizeBytes,
+        });
+        // Both outcomes log under SYNTH_TIMINGS — a silent null is how §7a.1's
+        // diagnostic run hid the memory-term misfire for a whole 25-minute cycle.
+        if (process.env.CODEGRAPH_SYNTH_TIMINGS) {
+            console.error(`[pool-timing] pool ${size === null ? 'disabled' : `size=${size}`} (ap=${ap} budget=${Math.round(budget / 1024 / 1024)}MB db=${Math.round(dbSizeBytes / 1024 / 1024)}MB)`);
+        }
+        if (size === null)
+            return null;
+        try {
+            return new ResolverPool(workerScript, dbPath, projectRoot, size);
+        }
+        catch {
+            return null;
+        }
+    }
+    constructor(workerScript, dbPath, projectRoot, size) {
+        for (let i = 0; i < size; i++) {
+            const worker = new worker_threads_1.Worker(workerScript);
+            let readyResolve;
+            let readyReject;
+            const ready = new Promise((resolve, reject) => {
+                readyResolve = resolve;
+                readyReject = reject;
+            });
+            const pw = { worker, ready, busy: 0 };
+            worker.on('message', (msg) => {
+                if (msg.type === 'ready') {
+                    readyResolve();
+                }
+                else if (msg.type === 'result' && msg.id !== undefined) {
+                    pw.busy--;
+                    const waiter = this.waiters.get(msg.id);
+                    this.waiters.delete(msg.id);
+                    waiter?.resolve({
+                        resolved: msg.resolved,
+                        unresolved: msg.unresolved,
+                        deferredChain: msg.deferredChain,
+                        deferredThisMember: msg.deferredThisMember,
+                        byMethod: msg.byMethod,
+                    });
+                }
+                else if (msg.type === 'synth-result' && msg.id !== undefined) {
+                    pw.busy--;
+                    const waiter = this.synthWaiters.get(msg.id);
+                    this.synthWaiters.delete(msg.id);
+                    waiter?.resolve({ edges: msg.edges ?? [], ms: msg.ms ?? 0 });
+                }
+                else if (msg.type === 'recycled' && msg.id !== undefined) {
+                    const waiter = this.recycleWaiters.get(msg.id);
+                    this.recycleWaiters.delete(msg.id);
+                    waiter?.();
+                }
+                else if (msg.type === 'error') {
+                    pw.busy--;
+                    const err = new Error(`resolver worker: ${msg.message}`);
+                    if (msg.id !== undefined && this.waiters.has(msg.id)) {
+                        const waiter = this.waiters.get(msg.id);
+                        this.waiters.delete(msg.id);
+                        waiter.reject(err);
+                    }
+                    else if (msg.id !== undefined && this.synthWaiters.has(msg.id)) {
+                        const waiter = this.synthWaiters.get(msg.id);
+                        this.synthWaiters.delete(msg.id);
+                        waiter.reject(err);
+                    }
+                    else {
+                        this.fail(err);
+                    }
+                }
+            });
+            worker.on('error', (err) => {
+                this.fail(err instanceof Error ? err : new Error(String(err)));
+                readyReject(this.failed);
+            });
+            worker.on('exit', (code) => {
+                if (code !== 0) {
+                    this.fail(new Error(`resolver worker exited with code ${code}`));
+                    readyReject(this.failed);
+                }
+            });
+            worker.postMessage({ type: 'open', dbPath, projectRoot });
+            this.workers.push(pw);
+        }
+    }
+    fail(err) {
+        if (!this.failed)
+            this.failed = err;
+        for (const [, waiter] of this.waiters)
+            waiter.reject(this.failed);
+        this.waiters.clear();
+        for (const [, waiter] of this.synthWaiters)
+            waiter.reject(this.failed);
+        this.synthWaiters.clear();
+        // Pending recycles resolve rather than reject: their per-call timeout
+        // owns rejection, and the recycle caller checks this.failed next round.
+        for (const [, done] of this.recycleWaiters)
+            done();
+        this.recycleWaiters.clear();
+    }
+    /** Whether this batch is worth fanning out. */
+    static worthParallel(batchLength) {
+        return batchLength >= MIN_PARALLEL_BATCH;
+    }
+    async ready() {
+        await Promise.all(this.workers.map((w) => w.ready));
+    }
+    /**
+     * Resolve `refs` across the pool. Chunks preserve input order; the returned
+     * arrays are the in-order concatenation of the chunk results.
+     */
+    async resolveBatch(refs) {
+        if (this.failed)
+            throw this.failed;
+        const chunkPromises = [];
+        for (let i = 0; i < refs.length; i += CHUNK_SIZE) {
+            const chunk = refs.slice(i, i + CHUNK_SIZE);
+            const id = this.nextId++;
+            // Least-busy dispatch keeps workers evenly loaded regardless of chunk
+            // cost variance; result order is fixed by the promise array, not by
+            // completion order.
+            const pw = this.workers.reduce((a, b) => (b.busy < a.busy ? b : a));
+            pw.busy++;
+            chunkPromises.push(new Promise((resolve, reject) => {
+                this.waiters.set(id, { resolve, reject });
+                pw.worker.postMessage({ type: 'resolve', id, refs: chunk });
+            }));
+        }
+        const chunks = await Promise.all(chunkPromises);
+        const out = { resolved: [], unresolved: [], deferredChain: [], deferredThisMember: [], byMethod: {} };
+        for (const c of chunks) {
+            out.resolved.push(...c.resolved);
+            out.unresolved.push(...c.unresolved);
+            out.deferredChain.push(...c.deferredChain);
+            out.deferredThisMember.push(...c.deferredThisMember);
+            for (const [k, v] of Object.entries(c.byMethod))
+                out.byMethod[k] = (out.byMethod[k] || 0) + v;
+        }
+        return out;
+    }
+    /**
+     * Run one synthesis pass (by SYNTH_PASSES name) on the least-busy worker.
+     * The worker reads the committed graph on its own connection and returns
+     * the pass's edge list; the caller merges in canonical order. Rejects on
+     * worker failure — the caller retries the pass on the main thread.
+     */
+    async runSynthPass(passName) {
+        if (this.failed)
+            throw this.failed;
+        const id = this.nextId++;
+        const pw = this.workers.reduce((a, b) => (b.busy < a.busy ? b : a));
+        pw.busy++;
+        return new Promise((resolve, reject) => {
+            this.synthWaiters.set(id, { resolve, reject });
+            pw.worker.postMessage({ type: 'synth', id, pass: passName });
+        });
+    }
+    /**
+     * Ask every worker to close and reopen its read-only connection, and wait
+     * for all acks. MUST be called only at the pool-idle boundary (all fanned
+     * chunks settled, next batch not yet dispatched) — the workers close their
+     * connections in place. Why: a long-lived reader pins WAL checkpoint
+     * progress, and the deep WAL behind it taxes every main-thread B-tree
+     * page operation (writes-under-readers, plan §7a.6 — deletes 42.6→118.8s
+     * from 0 to 4 attached readers). Releasing the read marks periodically
+     * lets the existing checkpoints advance, keeping the WAL shallow WITHOUT
+     * the full-park folds an aggressive valve pays (+129s measured at 64MB).
+     * A recycle failure fails the pool — the caller's sequential fallback
+     * covers the rest of the run.
+     */
+    async recycleWorkers() {
+        if (this.failed)
+            throw this.failed;
+        await Promise.all(this.workers.map((pw) => new Promise((resolve, reject) => {
+            const id = this.nextId++;
+            const t = setTimeout(() => {
+                if (this.recycleWaiters.delete(id)) {
+                    const err = new Error('resolver worker recycle timed out');
+                    this.fail(err);
+                    reject(err);
+                }
+            }, 10_000);
+            this.recycleWaiters.set(id, () => {
+                clearTimeout(t);
+                resolve();
+            });
+            pw.worker.postMessage({ type: 'recycle', id });
+        })));
+    }
+    async destroy() {
+        await Promise.all(this.workers.map((pw) => new Promise((resolve) => {
+            const t = setTimeout(() => {
+                void pw.worker.terminate().then(() => resolve());
+            }, 5000);
+            pw.worker.once('exit', () => {
+                clearTimeout(t);
+                resolve();
+            });
+            pw.worker.postMessage({ type: 'close' });
+        })));
+    }
+}
+exports.ResolverPool = ResolverPool;
+//# sourceMappingURL=resolver-pool.js.map

package/dist/resolution/resolver-pool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolver-pool.js","sourceRoot":"","sources":["../../src/resolution/resolver-pool.ts"],"names":[],"mappings":";AAAA;;;;;;;;;GASG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA0CH,wCAOC;AA/CD,mDAAwC;AACxC,uCAAyB;AACzB,2CAA6B;AAC7B,uCAAyB;AAGzB,mDAAoD;AAsBpD,MAAM,kBAAkB,GAAG,IAAI,CAAC;AAChC,MAAM,UAAU,GAAG,GAAG,CAAC;AAEvB;;;;;;;;GAQG;AACH,SAAgB,cAAc;IAC5B,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,8BAA8B,CAAC;IACvD,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACxC,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,IAAI,CAAC;YAAE,OAAO,MAAM,CAAC;IAC5D,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,MAAa,YAAY;IACf,OAAO,GAAiB,EAAE,CAAC;IAC3B,MAAM,GAAG,CAAC,CAAC;IACX,OAAO,GAAG,IAAI,GAAG,EAA6E,CAAC;IAC/F,YAAY,GAAG,IAAI,GAAG,EAAiF,CAAC;IACxG,cAAc,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC/C,MAAM,GAAiB,IAAI,CAAC;IAEpC;;;;;;;;;;;;;;;;OAgBG;IACH,MAAM,CAAC,eAAe,CAAC,IAKtB;QACC,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,KAAK,EAAE,EAAE,CAAC;YACxD,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YAC7C,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvB,IAAI,CAAC,IAAI,CAAC;oBAAE,OAAO,IAAI,CAAC;gBACxB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QACD,wEAAwE;QACxE,oEAAoE;QACpE,qEAAqE;QACrE,yEAAyE;QACzE,0DAA0D;QAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,oBAAoB,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1D,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,GAAG,GAAG,EAAE,GAAG,GAAG,IAAI,GAAG,IAAI,CAAC,EAAE,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC;QAC1G,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,GAAG,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC;QACjE,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACtC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IACjC,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,SAAS,CAAC,MAAc,EAAE,WAAmB;QAClD,IAAI,OAAO,CAAC,GAAG,CAAC,6BAA6B,KAAK,GAAG;YAAE,OAAO,IAAI,CAAC;QACnE,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,oBAAoB,CAAC,CAAC;QAChE,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,YAAY,CAAC;YAAE,OAAO,IAAI,CAAC;QAC9C,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC;YACH,WAAW,GAAG,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC;QACzC,CAAC;QAAC,MAAM,CAAC,CAAC,6DAA6D,CAAC,CAAC;QACzE,MAAM,EAAE,GAAG,EAAE,CAAC,oBAAoB,EAAE,CAAC;QACrC,MAAM,MAAM,GAAG,IAAA,iCAAiB,GAAE,CAAC;QACnC,MAAM,IAAI,GAAG,YAAY,CAAC,eAAe,CAAC;YACxC,QAAQ,EAAE,OAAO,CAAC,GAAG,CAAC,yBAAyB;YAC/C,oBAAoB,EAAE,EAAE;YACxB,YAAY,EAAE,MAAM;YACpB,WAAW;SACZ,CAAC,CAAC;QACH,uEAAuE;QACvE,0EAA0E;QAC1E,IAAI,OAAO,CAAC,GAAG,CAAC,uBAAuB,EAAE,CAAC;YACxC,OAAO,CAAC,KAAK,CACX,sBAAsB,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,QAAQ,EAAE,WAAW,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,GAAG,IAAI,CAAC,SAAS,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,IAAI,GAAG,IAAI,CAAC,KAAK,CAC1K,CAAC;QACJ,CAAC;QACD,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAC/B,IAAI,CAAC;YACH,OAAO,IAAI,YAAY,CAAC,YAAY,EAAE,MAAM,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;QACnE,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,YAAoB,YAAoB,EAAE,MAAc,EAAE,WAAmB,EAAE,IAAY;QACzF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAG,IAAI,uBAAM,CAAC,YAAY,CAAC,CAAC;YACxC,IAAI,YAAyB,CAAC;YAC9B,IAAI,WAAgC,CAAC;YACrC,MAAM,KAAK,GAAG,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;gBAClD,YAAY,GAAG,OAAO,CAAC;gBACvB,WAAW,GAAG,MAAM,CAAC;YACvB,CAAC,CAAC,CAAC;YACH,MAAM,EAAE,GAAe,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;YAClD,MAAM,CAAC,EAAE,CAAC,SAAS,EAAE,CAAC,GAAwG,EAAE,EAAE;gBAChI,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;oBACzB,YAAY,EAAE,CAAC;gBACjB,CAAC;qBAAM,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,GAAG,CAAC,EAAE,KAAK,SAAS,EAAE,CAAC;oBACzD,EAAE,CAAC,IAAI,EAAE,CAAC;oBACV,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACxC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBAC5B,MAAM,EAAE,OAAO,CAAC;wBACd,QAAQ,EAAE,GAAG,CAAC,QAAS;wBACvB,UAAU,EAAE,GAAG,CAAC,UAAW;wBAC3B,aAAa,EAAE,GAAG,CAAC,aAAc;wBACjC,kBAAkB,EAAE,GAAG,CAAC,kBAAmB;wBAC3C,QAAQ,EAAE,GAAG,CAAC,QAAS;qBACxB,CAAC,CAAC;gBACL,CAAC;qBAAM,IAAI,GAAG,CAAC,IAAI,KAAK,cAAc,IAAI,GAAG,CAAC,EAAE,KAAK,SAAS,EAAE,CAAC;oBAC/D,EAAE,CAAC,IAAI,EAAE,CAAC;oBACV,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBAC7C,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACjC,MAAM,EAAE,OAAO,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,IAAI,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC/D,CAAC;qBAAM,IAAI,GAAG,CAAC,IAAI,KAAK,UAAU,IAAI,GAAG,CAAC,EAAE,KAAK,SAAS,EAAE,CAAC;oBAC3D,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBAC/C,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACnC,MAAM,EAAE,EAAE,CAAC;gBACb,CAAC;qBAAM,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;oBAChC,EAAE,CAAC,IAAI,EAAE,CAAC;oBACV,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,oBAAoB,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;oBACzD,IAAI,GAAG,CAAC,EAAE,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;wBACrD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;wBACzC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;wBAC5B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;oBACrB,CAAC;yBAAM,IAAI,GAAG,CAAC,EAAE,KAAK,SAAS,IAAI,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;wBACjE,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;wBAC9C,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;wBACjC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;oBACrB,CAAC;yBAAM,CAAC;wBACN,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACjB,CAAC;gBACH,CAAC;YACH,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE;gBACzB,IAAI,CAAC,IAAI,CAAC,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC/D,WAAW,CAAC,IAAI,CAAC,MAAO,CAAC,CAAC;YAC5B,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE;gBACzB,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;oBACf,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,oCAAoC,IAAI,EAAE,CAAC,CAAC,CAAC;oBACjE,WAAW,CAAC,IAAI,CAAC,MAAO,CAAC,CAAC;gBAC5B,CAAC;YACH,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;YAC1D,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAEO,IAAI,CAAC,GAAU;QACrB,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;QACpC,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO;YAAE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAClE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,YAAY;YAAE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvE,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1B,sEAAsE;QACtE,wEAAwE;QACxE,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,cAAc;YAAE,IAAI,EAAE,CAAC;QACnD,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC;IAC9B,CAAC;IAED,+CAA+C;IAC/C,MAAM,CAAC,aAAa,CAAC,WAAmB;QACtC,OAAO,WAAW,IAAI,kBAAkB,CAAC;IAC3C,CAAC;IAED,KAAK,CAAC,KAAK;QACT,MAAM,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACtD,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,YAAY,CAAC,IAA2B;QAC5C,IAAI,IAAI,CAAC,MAAM;YAAE,MAAM,IAAI,CAAC,MAAM,CAAC;QACnC,MAAM,aAAa,GAA2B,EAAE,CAAC;QACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC;YACjD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC;YAC5C,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACzB,sEAAsE;YACtE,oEAAoE;YACpE,oBAAoB;YACpB,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpE,EAAE,CAAC,IAAI,EAAE,CAAC;YACV,aAAa,CAAC,IAAI,CAChB,IAAI,OAAO,CAAc,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;gBAC3C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;gBAC1C,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;YAC9D,CAAC,CAAC,CACH,CAAC;QACJ,CAAC;QACD,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;QAChD,MAAM,GAAG,GAAgB,EAAE,QAAQ,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,aAAa,EAAE,EAAE,EAAE,kBAAkB,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;QACnH,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;YACjC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;YACrC,GAAG,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC;YAC3C,GAAG,CAAC,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,kBAAkB,CAAC,CAAC;YACrD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC;gBAAE,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAChG,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,YAAY,CAAC,QAAgB;QACjC,IAAI,IAAI,CAAC,MAAM;YAAE,MAAM,IAAI,CAAC,MAAM,CAAC;QACnC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,EAAE,CAAC,IAAI,EAAE,CAAC;QACV,OAAO,IAAI,OAAO,CAAkB,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YACtD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;YAC/C,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,KAAK,CAAC,cAAc;QAClB,IAAI,IAAI,CAAC,MAAM;YAAE,MAAM,IAAI,CAAC,MAAM,CAAC;QACnC,MAAM,OAAO,CAAC,GAAG,CACf,IAAI,CAAC,OAAO,CAAC,GAAG,CACd,CAAC,EAAE,EAAE,EAAE,CACL,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YACpC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,EAAE;gBACxB,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;oBACnC,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;oBAC3D,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACf,MAAM,CAAC,GAAG,CAAC,CAAC;gBACd,CAAC;YACH,CAAC,EAAE,MAAM,CAAC,CAAC;YACX,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE;gBAC/B,YAAY,CAAC,CAAC,CAAC,CAAC;gBAChB,OAAO,EAAE,CAAC;YACZ,CAAC,CAAC,CAAC;YACH,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,CAAC;QACjD,CAAC,CAAC,CACL,CACF,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,OAAO;QACX,MAAM,OAAO,CAAC,GAAG,CACf,IAAI,CAAC,OAAO,CAAC,GAAG,CACd,CAAC,EAAE,EAAE,EAAE,CACL,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,EAAE;YAC5B,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,EAAE;gBACxB,KAAK,EAAE,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;YACnD,CAAC,EAAE,IAAI,CAAC,CAAC;YACT,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE;gBAC1B,YAAY,CAAC,CAAC,CAAC,CAAC;gBAChB,OAAO,EAAE,CAAC;YACZ,CAAC,CAAC,CAAC;YACH,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;QAC3C,CAAC,CAAC,CACL,CACF,CAAC;IACJ,CAAC;CACF;AAtRD,oCAsRC"}

package/dist/resolution/resolver-worker.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Resolver worker — one member of the parallel-resolution pool.
+ *
+ * Opens the project database READ-ONLY on its own connection and hosts a full
+ * ReferenceResolver over it. The main thread partitions each resolution batch
+ * into ordered chunks, fans them across the pool, and ADMITS the results
+ * sequentially in chunk order — so edge insertion order (and every cleanup /
+ * parking side effect) is identical to the single-threaded loop. Workers only
+ * ever read; all writes stay on the main thread.
+ *
+ * Visibility note: the sequential baseline resolves every ref of a batch
+ * against the DB state committed BEFORE that batch (edges persist after the
+ * whole batch resolves). Workers read exactly that same committed state, so
+ * per-ref inputs match the baseline ref-for-ref.
+ */
+export {};
+//# sourceMappingURL=resolver-worker.d.ts.map

package/dist/resolution/resolver-worker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolver-worker.d.ts","sourceRoot":"","sources":["../../src/resolution/resolver-worker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG"}

package/dist/resolution/resolver-worker.js

@@ -0,0 +1,141 @@
+"use strict";
+/**
+ * Resolver worker — one member of the parallel-resolution pool.
+ *
+ * Opens the project database READ-ONLY on its own connection and hosts a full
+ * ReferenceResolver over it. The main thread partitions each resolution batch
+ * into ordered chunks, fans them across the pool, and ADMITS the results
+ * sequentially in chunk order — so edge insertion order (and every cleanup /
+ * parking side effect) is identical to the single-threaded loop. Workers only
+ * ever read; all writes stay on the main thread.
+ *
+ * Visibility note: the sequential baseline resolves every ref of a batch
+ * against the DB state committed BEFORE that batch (edges persist after the
+ * whole batch resolves). Workers read exactly that same committed state, so
+ * per-ref inputs match the baseline ref-for-ref.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+// Compile cache FIRST — same worker-boot rationale as parse-worker.ts.
+try {
+    // eslint-disable-next-line @typescript-eslint/no-require-imports
+    require('node:module').enableCompileCache?.();
+}
+catch { /* cache is best-effort */ }
+const worker_threads_1 = require("worker_threads");
+const sqlite_adapter_1 = require("../db/sqlite-adapter");
+const queries_1 = require("../db/queries");
+const index_1 = require("./index");
+const callback_synthesizer_1 = require("./callback-synthesizer");
+const cooperative_yield_1 = require("./cooperative-yield");
+if (!worker_threads_1.parentPort) {
+    throw new Error('resolver-worker must be run as a worker thread');
+}
+const port = worker_threads_1.parentPort;
+let db = null;
+let queries = null;
+let resolver = null;
+let dbPath = null;
+port.on('message', (msg) => {
+    try {
+        switch (msg.type) {
+            case 'open': {
+                const tOpen = Date.now();
+                dbPath = msg.dbPath;
+                const created = (0, sqlite_adapter_1.createDatabase)(msg.dbPath, { readOnly: true });
+                db = created.db;
+                db.pragma('busy_timeout = 5000');
+                db.pragma('cache_size = -32000');
+                const tDb = Date.now();
+                queries = new queries_1.QueryBuilder(db);
+                resolver = new index_1.ReferenceResolver(msg.projectRoot, queries);
+                resolver.initialize();
+                if (process.env.CODEGRAPH_SYNTH_TIMINGS)
+                    console.error(`[pool-timing] worker open: db=${tDb - tOpen}ms init=${Date.now() - tDb}ms`);
+                port.postMessage({ type: 'ready' });
+                break;
+            }
+            case 'recycle': {
+                // Close and reopen the read-only connection so the WAL checkpoints
+                // the writer runs can advance past this reader's mark (see
+                // QueryBuilder.rebind). Everything above the connection survives —
+                // the resolver keeps its warm caches; prepared statements re-prepare
+                // lazily. Runs only at the pool-idle boundary, so no query is in
+                // flight on this connection.
+                if (!queries || !dbPath)
+                    throw new Error('resolver-worker: recycle before open');
+                try {
+                    db?.close();
+                }
+                catch { /* already closed */ }
+                const reopened = (0, sqlite_adapter_1.createDatabase)(dbPath, { readOnly: true });
+                db = reopened.db;
+                db.pragma('busy_timeout = 5000');
+                db.pragma('cache_size = -32000');
+                queries.rebind(db);
+                port.postMessage({ type: 'recycled', id: msg.id });
+                break;
+            }
+            case 'resolve': {
+                if (!resolver)
+                    throw new Error('resolver-worker: resolve before open');
+                const tRes = Date.now();
+                const out = resolver.resolveListForAdmission(msg.refs);
+                if (process.env.CODEGRAPH_SYNTH_TIMINGS)
+                    console.error(`[pool-timing] worker resolve: ${msg.refs.length} refs in ${Date.now() - tRes}ms`);
+                port.postMessage({ type: 'result', id: msg.id, ...out });
+                break;
+            }
+            case 'synth': {
+                // Run one synthesis pass against this worker's read-only connection.
+                // Passes only READ (graph + source via the resolver's context); their
+                // edges are returned for the main thread's ordered merge. Async, with
+                // its own error propagation — a throwing pass reports {type:'error'}
+                // and the main thread retries it sequentially.
+                if (!resolver || !queries)
+                    throw new Error('resolver-worker: synth before open');
+                const pass = callback_synthesizer_1.SYNTH_PASSES.find((p) => p.name === msg.pass);
+                if (!pass)
+                    throw new Error(`resolver-worker: unknown synth pass '${msg.pass}'`);
+                const q = queries;
+                const r = resolver;
+                void (async () => {
+                    const t0 = Date.now();
+                    try {
+                        const edges = await pass.run(q, r.getResolutionContext(), (0, cooperative_yield_1.createYielder)());
+                        port.postMessage({ type: 'synth-result', id: msg.id, edges, ms: Date.now() - t0 });
+                    }
+                    catch (err) {
+                        port.postMessage({
+                            type: 'error',
+                            id: msg.id,
+                            message: err instanceof Error ? err.message : String(err),
+                        });
+                    }
+                })();
+                break;
+            }
+            case 'close': {
+                try {
+                    resolver?.dumpResolveProfile(`worker#${worker_threads_1.threadId}`);
+                }
+                catch { /* diagnostics never block shutdown */ }
+                try {
+                    db?.close();
+                }
+                catch {
+                    /* already closed */
+                }
+                process.exit(0);
+                break;
+            }
+        }
+    }
+    catch (err) {
+        port.postMessage({
+            type: 'error',
+            id: msg.id,
+            message: err instanceof Error ? err.message : String(err),
+        });
+    }
+});
+//# sourceMappingURL=resolver-worker.js.map

package/dist/resolution/resolver-worker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolver-worker.js","sourceRoot":"","sources":["../../src/resolution/resolver-worker.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;GAcG;;AAEH,uEAAuE;AACvE,IAAI,CAAC;IACH,iEAAiE;IAChE,OAAO,CAAC,aAAa,CAAyC,CAAC,kBAAkB,EAAE,EAAE,CAAC;AACzF,CAAC;AAAC,MAAM,CAAC,CAAC,0BAA0B,CAAC,CAAC;AAEtC,mDAAsD;AACtD,yDAAsE;AACtE,2CAA6C;AAC7C,mCAA4C;AAC5C,iEAAsD;AACtD,2DAAoD;AAGpD,IAAI,CAAC,2BAAU,EAAE,CAAC;IAChB,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;AACpE,CAAC;AACD,MAAM,IAAI,GAAG,2BAAU,CAAC;AAExB,IAAI,EAAE,GAA0B,IAAI,CAAC;AACrC,IAAI,OAAO,GAAwB,IAAI,CAAC;AACxC,IAAI,QAAQ,GAA6B,IAAI,CAAC;AAS9C,IAAI,MAAM,GAAkB,IAAI,CAAC;AAEjC,IAAI,CAAC,EAAE,CAAC,SAAS,EAAE,CAAC,GAAc,EAAE,EAAE;IACpC,IAAI,CAAC;QACH,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;YACjB,KAAK,MAAM,CAAC,CAAC,CAAC;gBACZ,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBACzB,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;gBACpB,MAAM,OAAO,GAAG,IAAA,+BAAc,EAAC,GAAG,CAAC,MAAM,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;gBAC/D,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC;gBAChB,EAAE,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC;gBACjC,EAAE,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC;gBACjC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBACvB,OAAO,GAAG,IAAI,sBAAY,CAAC,EAAE,CAAC,CAAC;gBAC/B,QAAQ,GAAG,IAAI,yBAAiB,CAAC,GAAG,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;gBAC3D,QAAQ,CAAC,UAAU,EAAE,CAAC;gBACtB,IAAI,OAAO,CAAC,GAAG,CAAC,uBAAuB;oBAAE,OAAO,CAAC,KAAK,CAAC,iCAAiC,GAAG,GAAG,KAAK,WAAW,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,IAAI,CAAC,CAAC;gBACpI,IAAI,CAAC,WAAW,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;gBACpC,MAAM;YACR,CAAC;YACD,KAAK,SAAS,CAAC,CAAC,CAAC;gBACf,mEAAmE;gBACnE,2DAA2D;gBAC3D,mEAAmE;gBACnE,qEAAqE;gBACrE,iEAAiE;gBACjE,6BAA6B;gBAC7B,IAAI,CAAC,OAAO,IAAI,CAAC,MAAM;oBAAE,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;gBACjF,IAAI,CAAC;oBACH,EAAE,EAAE,KAAK,EAAE,CAAC;gBACd,CAAC;gBAAC,MAAM,CAAC,CAAC,oBAAoB,CAAC,CAAC;gBAChC,MAAM,QAAQ,GAAG,IAAA,+BAAc,EAAC,MAAM,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;gBAC5D,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC;gBACjB,EAAE,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC;gBACjC,EAAE,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC;gBACjC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACnB,IAAI,CAAC,WAAW,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;gBACnD,MAAM;YACR,CAAC;YACD,KAAK,SAAS,CAAC,CAAC,CAAC;gBACf,IAAI,CAAC,QAAQ;oBAAE,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;gBACvE,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBACxB,MAAM,GAAG,GAAG,QAAQ,CAAC,uBAAuB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACvD,IAAI,OAAO,CAAC,GAAG,CAAC,uBAAuB;oBAAE,OAAO,CAAC,KAAK,CAAC,iCAAiC,GAAG,CAAC,IAAI,CAAC,MAAM,YAAY,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,IAAI,CAAC,CAAC;gBAC1I,IAAI,CAAC,WAAW,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC;gBACzD,MAAM;YACR,CAAC;YACD,KAAK,OAAO,CAAC,CAAC,CAAC;gBACb,qEAAqE;gBACrE,sEAAsE;gBACtE,sEAAsE;gBACtE,qEAAqE;gBACrE,+CAA+C;gBAC/C,IAAI,CAAC,QAAQ,IAAI,CAAC,OAAO;oBAAE,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;gBACjF,MAAM,IAAI,GAAG,mCAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC3D,IAAI,CAAC,IAAI;oBAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC;gBAChF,MAAM,CAAC,GAAG,OAAO,CAAC;gBAClB,MAAM,CAAC,GAAG,QAAQ,CAAC;gBACnB,KAAK,CAAC,KAAK,IAAI,EAAE;oBACf,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;oBACtB,IAAI,CAAC;wBACH,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,oBAAoB,EAAE,EAAE,IAAA,iCAAa,GAAE,CAAC,CAAC;wBAC3E,IAAI,CAAC,WAAW,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;oBACrF,CAAC;oBAAC,OAAO,GAAG,EAAE,CAAC;wBACb,IAAI,CAAC,WAAW,CAAC;4BACf,IAAI,EAAE,OAAO;4BACb,EAAE,EAAE,GAAG,CAAC,EAAE;4BACV,OAAO,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;yBAC1D,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC,CAAC,EAAE,CAAC;gBACL,MAAM;YACR,CAAC;YACD,KAAK,OAAO,CAAC,CAAC,CAAC;gBACb,IAAI,CAAC;oBACH,QAAQ,EAAE,kBAAkB,CAAC,UAAU,yBAAQ,EAAE,CAAC,CAAC;gBACrD,CAAC;gBAAC,MAAM,CAAC,CAAC,sCAAsC,CAAC,CAAC;gBAClD,IAAI,CAAC;oBACH,EAAE,EAAE,KAAK,EAAE,CAAC;gBACd,CAAC;gBAAC,MAAM,CAAC;oBACP,oBAAoB;gBACtB,CAAC;gBACD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAChB,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,WAAW,CAAC;YACf,IAAI,EAAE,OAAO;YACb,EAAE,EAAG,GAAuB,CAAC,EAAE;YAC/B,OAAO,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;SAC1D,CAAC,CAAC;IACL,CAAC;AACH,CAAC,CAAC,CAAC"}

package/dist/resolution/strip-comments.d.ts

@@ -0,0 +1,27 @@
+/**
+ * Per-language comment stripper for framework route extractors.
+ *
+ * Replaces comment characters and string-literal contents that hide
+ * routing-shaped text with spaces (NOT removal) so that source offsets
+ * are preserved. This means `match.index` from a regex run on the
+ * stripped output still maps to the same line in the original source.
+ *
+ * Example:
+ *   Input:  "x = 1  # path('/fake/', V)\n real = 2"
+ *   Output: "x = 1                       \n real = 2"
+ *
+ * Why strip strings/docstrings as well as comments? Python module/class
+ * docstrings are a common source of false positives — they often contain
+ * `path('/example/', View)` examples in usage docs. We treat triple-quoted
+ * strings the same as comments. Single-line strings stay intact (a `#`
+ * inside a Python string is NOT a comment).
+ *
+ * Scope: this is a pragmatic, regex-supporting helper, not a full parser.
+ * It does NOT try to detect JS regex literals, Python f-string expressions,
+ * or shell-style heredocs. Those edge cases are not load-bearing for the
+ * `path(...)`, `Route::get(...)`, `app.get(...)` style patterns that
+ * framework extractors scan for.
+ */
+export type CommentLang = 'python' | 'javascript' | 'typescript' | 'php' | 'ruby' | 'java' | 'csharp' | 'swift' | 'go' | 'rust' | 'c' | 'cpp' | 'erlang';
+export declare function stripCommentsForRegex(content: string, lang: CommentLang): string;
+//# sourceMappingURL=strip-comments.d.ts.map

package/dist/resolution/strip-comments.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"strip-comments.d.ts","sourceRoot":"","sources":["../../src/resolution/strip-comments.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,MAAM,MAAM,WAAW,GACnB,QAAQ,GACR,YAAY,GACZ,YAAY,GACZ,KAAK,GACL,MAAM,GACN,MAAM,GACN,QAAQ,GACR,OAAO,GACP,IAAI,GACJ,MAAM,GACN,GAAG,GACH,KAAK,GACL,QAAQ,CAAC;AAEb,wBAAgB,qBAAqB,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,GAAG,MAAM,CAyBhF"}