-
Notifications
You must be signed in to change notification settings - Fork 15
Expand file tree
/
Copy pathincremental.js
More file actions
498 lines (449 loc) · 17.5 KB
/
Copy pathincremental.js
File metadata and controls
498 lines (449 loc) · 17.5 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
/**
* Incremental single-file rebuild — used by watch mode.
*
* Reuses pipeline helpers instead of duplicating node insertion and edge building
* logic from the main builder. This eliminates the watcher.js divergence (ROADMAP 3.9).
*
* Reverse-dep cascade: when a file changes, files that have edges targeting it
* must have their outgoing edges rebuilt (since the changed file's node IDs change).
*/
import fs from 'node:fs';
import path from 'node:path';
import { bulkNodeIdsByFile } from '../../../db/index.js';
import { warn } from '../../../infrastructure/logger.js';
import { normalizePath } from '../../../shared/constants.js';
import { parseFileIncremental } from '../../parser.js';
import { computeConfidence, resolveImportPath } from '../resolve.js';
import { BUILTIN_RECEIVERS, readFileSafe } from './helpers.js';
// ── Node insertion ──────────────────────────────────────────────────────
function insertFileNodes(stmts, relPath, symbols) {
stmts.insertNode.run(relPath, 'file', relPath, 0, null);
for (const def of symbols.definitions) {
stmts.insertNode.run(def.name, def.kind, relPath, def.line, def.endLine || null);
if (def.children?.length) {
for (const child of def.children) {
stmts.insertNode.run(child.name, child.kind, relPath, child.line, child.endLine || null);
}
}
}
for (const exp of symbols.exports) {
stmts.insertNode.run(exp.name, exp.kind, relPath, exp.line, null);
}
}
// ── Containment edges ──────────────────────────────────────────────────
function buildContainmentEdges(db, stmts, relPath, symbols) {
const nodeIdMap = new Map();
for (const row of bulkNodeIdsByFile(db, relPath)) {
nodeIdMap.set(`${row.name}|${row.kind}|${row.line}`, row.id);
}
const fileId = nodeIdMap.get(`${relPath}|file|0`);
let edgesAdded = 0;
for (const def of symbols.definitions) {
const defId = nodeIdMap.get(`${def.name}|${def.kind}|${def.line}`);
if (fileId && defId) {
stmts.insertEdge.run(fileId, defId, 'contains', 1.0, 0);
edgesAdded++;
}
if (def.children?.length && defId) {
for (const child of def.children) {
const childId = nodeIdMap.get(`${child.name}|${child.kind}|${child.line}`);
if (childId) {
stmts.insertEdge.run(defId, childId, 'contains', 1.0, 0);
edgesAdded++;
if (child.kind === 'parameter') {
stmts.insertEdge.run(childId, defId, 'parameter_of', 1.0, 0);
edgesAdded++;
}
}
}
}
}
return edgesAdded;
}
// ── Reverse-dep cascade ────────────────────────────────────────────────
function findReverseDeps(db, relPath) {
return db
.prepare(
`SELECT DISTINCT n_src.file FROM edges e
JOIN nodes n_src ON e.source_id = n_src.id
JOIN nodes n_tgt ON e.target_id = n_tgt.id
WHERE n_tgt.file = ? AND n_src.file != ? AND n_src.kind != 'directory'`,
)
.all(relPath, relPath)
.map((r) => r.file);
}
function deleteOutgoingEdges(db, relPath) {
db.prepare('DELETE FROM edges WHERE source_id IN (SELECT id FROM nodes WHERE file = ?)').run(
relPath,
);
}
async function parseReverseDep(rootDir, depRelPath, engineOpts, cache) {
const absPath = path.join(rootDir, depRelPath);
if (!fs.existsSync(absPath)) return null;
let code;
try {
code = readFileSafe(absPath);
} catch {
return null;
}
return parseFileIncremental(cache, absPath, code, engineOpts);
}
function rebuildReverseDepEdges(db, rootDir, depRelPath, symbols, stmts, skipBarrel) {
const fileNodeRow = stmts.getNodeId.get(depRelPath, 'file', depRelPath, 0);
if (!fileNodeRow) return 0;
const aliases = { baseUrl: null, paths: {} };
let edgesAdded = buildContainmentEdges(db, stmts, depRelPath, symbols);
// Don't rebuild dir→file containment for reverse-deps (it was never deleted)
edgesAdded += buildImportEdges(
stmts,
depRelPath,
symbols,
rootDir,
fileNodeRow.id,
aliases,
skipBarrel ? null : db,
);
const importedNames = buildImportedNamesMap(symbols, rootDir, depRelPath, aliases);
edgesAdded += buildCallEdges(stmts, depRelPath, symbols, fileNodeRow, importedNames);
return edgesAdded;
}
// ── Directory containment edges ────────────────────────────────────────
function rebuildDirContainment(_db, stmts, relPath) {
const dir = normalizePath(path.dirname(relPath));
if (!dir || dir === '.') return 0;
const dirRow = stmts.getNodeId.get(dir, 'directory', dir, 0);
const fileRow = stmts.getNodeId.get(relPath, 'file', relPath, 0);
if (dirRow && fileRow) {
stmts.insertEdge.run(dirRow.id, fileRow.id, 'contains', 1.0, 0);
return 1;
}
return 0;
}
// ── Ancillary table cleanup ────────────────────────────────────────────
function purgeAncillaryData(db, relPath) {
const tryExec = (sql, ...args) => {
try {
db.prepare(sql).run(...args);
} catch (err) {
if (!err?.message?.includes('no such table')) throw err;
}
};
tryExec(
'DELETE FROM function_complexity WHERE node_id IN (SELECT id FROM nodes WHERE file = ?)',
relPath,
);
tryExec(
'DELETE FROM node_metrics WHERE node_id IN (SELECT id FROM nodes WHERE file = ?)',
relPath,
);
tryExec(
'DELETE FROM cfg_edges WHERE function_node_id IN (SELECT id FROM nodes WHERE file = ?)',
relPath,
);
tryExec(
'DELETE FROM cfg_blocks WHERE function_node_id IN (SELECT id FROM nodes WHERE file = ?)',
relPath,
);
tryExec(
'DELETE FROM dataflow WHERE source_id IN (SELECT id FROM nodes WHERE file = ?) OR target_id IN (SELECT id FROM nodes WHERE file = ?)',
relPath,
relPath,
);
tryExec('DELETE FROM ast_nodes WHERE file = ?', relPath);
}
// ── Import edge building ────────────────────────────────────────────────
// Lazily-cached prepared statements for barrel resolution (avoid re-preparing in hot loops)
let _barrelDb = null;
let _isBarrelStmt = null;
let _reexportTargetsStmt = null;
let _hasDefStmt = null;
function getBarrelStmts(db) {
if (_barrelDb !== db) {
_barrelDb = db;
_isBarrelStmt = db.prepare(
`SELECT COUNT(*) as c FROM edges e
JOIN nodes n ON e.source_id = n.id
WHERE e.kind = 'reexports' AND n.file = ? AND n.kind = 'file'`,
);
_reexportTargetsStmt = db.prepare(
`SELECT DISTINCT n2.file FROM edges e
JOIN nodes n1 ON e.source_id = n1.id
JOIN nodes n2 ON e.target_id = n2.id
WHERE e.kind = 'reexports' AND n1.file = ? AND n1.kind = 'file'`,
);
_hasDefStmt = db.prepare(
`SELECT 1 FROM nodes WHERE name = ? AND file = ? AND kind != 'file' AND kind != 'directory' LIMIT 1`,
);
}
return {
isBarrelStmt: _isBarrelStmt,
reexportTargetsStmt: _reexportTargetsStmt,
hasDefStmt: _hasDefStmt,
};
}
function isBarrelFile(db, relPath) {
const { isBarrelStmt } = getBarrelStmts(db);
const reexportCount = isBarrelStmt.get(relPath)?.c;
return (reexportCount || 0) > 0;
}
function resolveBarrelTarget(db, barrelPath, symbolName, visited = new Set()) {
if (visited.has(barrelPath)) return null;
visited.add(barrelPath);
const { reexportTargetsStmt, hasDefStmt } = getBarrelStmts(db);
// Find re-export targets from this barrel
const reexportTargets = reexportTargetsStmt.all(barrelPath);
for (const { file: targetFile } of reexportTargets) {
// Check if the symbol is defined in this target file
const hasDef = hasDefStmt.get(symbolName, targetFile);
if (hasDef) return targetFile;
// Recurse through barrel chains
if (isBarrelFile(db, targetFile)) {
const deeper = resolveBarrelTarget(db, targetFile, symbolName, visited);
if (deeper) return deeper;
}
}
return null;
}
function buildImportEdges(stmts, relPath, symbols, rootDir, fileNodeId, aliases, db) {
let edgesAdded = 0;
for (const imp of symbols.imports) {
const resolvedPath = resolveImportPath(
path.join(rootDir, relPath),
imp.source,
rootDir,
aliases,
);
const targetRow = stmts.getNodeId.get(resolvedPath, 'file', resolvedPath, 0);
if (targetRow) {
const edgeKind = imp.reexport ? 'reexports' : imp.typeOnly ? 'imports-type' : 'imports';
stmts.insertEdge.run(fileNodeId, targetRow.id, edgeKind, 1.0, 0);
edgesAdded++;
// Barrel resolution: create edges through re-export chains
if (!imp.reexport && db && isBarrelFile(db, resolvedPath)) {
const resolvedSources = new Set();
for (const name of imp.names) {
const cleanName = name.replace(/^\*\s+as\s+/, '');
const actualSource = resolveBarrelTarget(db, resolvedPath, cleanName);
if (actualSource && actualSource !== resolvedPath && !resolvedSources.has(actualSource)) {
resolvedSources.add(actualSource);
const actualRow = stmts.getNodeId.get(actualSource, 'file', actualSource, 0);
if (actualRow) {
const kind = edgeKind === 'imports-type' ? 'imports-type' : 'imports';
stmts.insertEdge.run(fileNodeId, actualRow.id, kind, 0.9, 0);
edgesAdded++;
}
}
}
}
}
}
return edgesAdded;
}
function buildImportedNamesMap(symbols, rootDir, relPath, aliases) {
const importedNames = new Map();
for (const imp of symbols.imports) {
const resolvedPath = resolveImportPath(
path.join(rootDir, relPath),
imp.source,
rootDir,
aliases,
);
for (const name of imp.names) {
importedNames.set(name.replace(/^\*\s+as\s+/, ''), resolvedPath);
}
}
return importedNames;
}
// ── Call edge building ──────────────────────────────────────────────────
function findCaller(call, definitions, relPath, stmts) {
let caller = null;
let callerSpan = Infinity;
for (const def of definitions) {
if (def.line <= call.line) {
const end = def.endLine || Infinity;
if (call.line <= end) {
const span = end - def.line;
if (span < callerSpan) {
const row = stmts.getNodeId.get(def.name, def.kind, relPath, def.line);
if (row) {
caller = row;
callerSpan = span;
}
}
} else if (!caller) {
const row = stmts.getNodeId.get(def.name, def.kind, relPath, def.line);
if (row) caller = row;
}
}
}
return caller;
}
function resolveCallTargets(stmts, call, relPath, importedNames, typeMap) {
const importedFrom = importedNames.get(call.name);
let targets;
if (importedFrom) {
targets = stmts.findNodeInFile.all(call.name, importedFrom);
}
if (!targets || targets.length === 0) {
targets = stmts.findNodeInFile.all(call.name, relPath);
if (targets.length === 0) {
targets = stmts.findNodeByName.all(call.name);
}
}
// Type-aware resolution: translate variable receiver to declared type
if ((!targets || targets.length === 0) && call.receiver && typeMap) {
const typeEntry = typeMap.get(call.receiver);
const typeName = typeEntry
? typeof typeEntry === 'string'
? typeEntry
: typeEntry.type
: null;
if (typeName) {
const qualified = `${typeName}.${call.name}`;
targets = stmts.findNodeByName.all(qualified);
}
}
return { targets, importedFrom };
}
function buildCallEdges(stmts, relPath, symbols, fileNodeRow, importedNames) {
const typeMap = symbols.typeMap || new Map();
let edgesAdded = 0;
for (const call of symbols.calls) {
if (call.receiver && BUILTIN_RECEIVERS.has(call.receiver)) continue;
const caller = findCaller(call, symbols.definitions, relPath, stmts) || fileNodeRow;
const { targets, importedFrom } = resolveCallTargets(
stmts,
call,
relPath,
importedNames,
typeMap,
);
for (const t of targets) {
if (t.id !== caller.id) {
const confidence = computeConfidence(relPath, t.file, importedFrom ?? null);
stmts.insertEdge.run(caller.id, t.id, 'calls', confidence, call.dynamic ? 1 : 0);
edgesAdded++;
}
}
}
return edgesAdded;
}
// ── Main entry point ────────────────────────────────────────────────────
/**
* Parse a single file and update the database incrementally.
*
* @param {import('better-sqlite3').Database} db
* @param {string} rootDir - Absolute root directory
* @param {string} filePath - Absolute file path
* @param {object} stmts - Prepared DB statements
* @param {object} engineOpts - Engine options
* @param {object|null} cache - Parse tree cache (native only)
* @param {object} [options]
* @param {Function} [options.diffSymbols] - Symbol diff function
* @returns {Promise<object|null>} Update result or null on failure
*/
export async function rebuildFile(db, rootDir, filePath, stmts, engineOpts, cache, options = {}) {
const { diffSymbols } = options;
const relPath = normalizePath(path.relative(rootDir, filePath));
const oldNodes = stmts.countNodes.get(relPath)?.c || 0;
const oldSymbols = diffSymbols ? stmts.listSymbols.all(relPath) : [];
// Find reverse-deps BEFORE purging (edges still reference the old nodes)
const reverseDeps = findReverseDeps(db, relPath);
// Purge ancillary tables, then edges, then nodes
purgeAncillaryData(db, relPath);
stmts.deleteEdgesForFile.run(relPath);
stmts.deleteNodes.run(relPath);
if (!fs.existsSync(filePath)) {
if (cache) cache.remove(filePath);
const symbolDiff = diffSymbols ? diffSymbols(oldSymbols, []) : null;
return {
file: relPath,
nodesAdded: 0,
nodesRemoved: oldNodes,
edgesAdded: 0,
deleted: true,
event: 'deleted',
symbolDiff,
nodesBefore: oldNodes,
nodesAfter: 0,
};
}
let code;
try {
code = readFileSafe(filePath);
} catch (err) {
warn(`Cannot read ${relPath}: ${err.message}`);
return null;
}
const symbols = await parseFileIncremental(cache, filePath, code, engineOpts);
if (!symbols) return null;
insertFileNodes(stmts, relPath, symbols);
const newNodes = stmts.countNodes.get(relPath)?.c || 0;
const newSymbols = diffSymbols ? stmts.listSymbols.all(relPath) : [];
const fileNodeRow = stmts.getNodeId.get(relPath, 'file', relPath, 0);
if (!fileNodeRow)
return { file: relPath, nodesAdded: newNodes, nodesRemoved: oldNodes, edgesAdded: 0 };
const aliases = { baseUrl: null, paths: {} };
let edgesAdded = buildContainmentEdges(db, stmts, relPath, symbols);
edgesAdded += rebuildDirContainment(db, stmts, relPath);
edgesAdded += buildImportEdges(stmts, relPath, symbols, rootDir, fileNodeRow.id, aliases, db);
const importedNames = buildImportedNamesMap(symbols, rootDir, relPath, aliases);
edgesAdded += buildCallEdges(stmts, relPath, symbols, fileNodeRow, importedNames);
// Cascade: rebuild outgoing edges for reverse-dep files.
// Two-pass approach: first rebuild direct edges (creating reexports edges for barrels),
// then add barrel import edges (which need reexports edges to exist for resolution).
const depSymbols = new Map();
for (const depRelPath of reverseDeps) {
deleteOutgoingEdges(db, depRelPath);
const symbols_ = await parseReverseDep(rootDir, depRelPath, engineOpts, cache);
if (symbols_) depSymbols.set(depRelPath, symbols_);
}
// Pass 1: direct edges only (no barrel resolution) — creates reexports edges
for (const [depRelPath, symbols_] of depSymbols) {
edgesAdded += rebuildReverseDepEdges(db, rootDir, depRelPath, symbols_, stmts, true);
}
// Pass 2: add barrel import edges (reexports edges now exist)
for (const [depRelPath, symbols_] of depSymbols) {
const fileNodeRow_ = stmts.getNodeId.get(depRelPath, 'file', depRelPath, 0);
if (!fileNodeRow_) continue;
const aliases_ = { baseUrl: null, paths: {} };
for (const imp of symbols_.imports) {
if (imp.reexport) continue;
const resolvedPath = resolveImportPath(
path.join(rootDir, depRelPath),
imp.source,
rootDir,
aliases_,
);
if (db && isBarrelFile(db, resolvedPath)) {
const resolvedSources = new Set();
for (const name of imp.names) {
const cleanName = name.replace(/^\*\s+as\s+/, '');
const actualSource = resolveBarrelTarget(db, resolvedPath, cleanName);
if (actualSource && actualSource !== resolvedPath && !resolvedSources.has(actualSource)) {
resolvedSources.add(actualSource);
const actualRow = stmts.getNodeId.get(actualSource, 'file', actualSource, 0);
if (actualRow) {
const kind = imp.typeOnly ? 'imports-type' : 'imports';
stmts.insertEdge.run(fileNodeRow_.id, actualRow.id, kind, 0.9, 0);
edgesAdded++;
}
}
}
}
}
}
const symbolDiff = diffSymbols ? diffSymbols(oldSymbols, newSymbols) : null;
const event = oldNodes === 0 ? 'added' : 'modified';
return {
file: relPath,
nodesAdded: newNodes,
nodesRemoved: oldNodes,
edgesAdded,
deleted: false,
event,
symbolDiff,
nodesBefore: oldNodes,
nodesAfter: newNodes,
};
}