@oculum/scanner 1.0.14 → 1.0.15

package/dist/parse/ast.d.ts

@@ -0,0 +1,58 @@
+/**
+ * Tree-sitter AST Integration
+ *
+ * Parses source files into typed ASTs using tree-sitter.
+ * Supports JS, TS, TSX, and JSX with language auto-detection.
+ * Includes an LRU cache keyed by content hash for incremental scan reuse.
+ */
+import Parser from 'tree-sitter';
+export type ASTLanguage = 'javascript' | 'typescript' | 'tsx' | 'python';
+export interface ParsedAST {
+    tree: Parser.Tree;
+    language: ASTLanguage;
+    filePath: string;
+    /** Content hash used as cache key */
+    hash: string;
+}
+/**
+ * Detect AST language from file extension.
+ * Returns null for unsupported file types (Go, config files, etc.)
+ */
+export declare function detectLanguage(filePath: string): ASTLanguage | null;
+/**
+ * Parse a file into a tree-sitter AST.
+ * Returns null if the language is unsupported or parsing fails.
+ * Results are cached by content hash for incremental scan reuse.
+ */
+export declare function parseFile(content: string, filePath: string): ParsedAST | null;
+/**
+ * Parse multiple files, returning a map of filePath → ParsedAST.
+ * Files with unsupported languages or parse errors are omitted.
+ */
+export declare function parseFiles(files: Array<{
+    path: string;
+    content: string;
+}>): Map<string, ParsedAST>;
+/**
+ * Clear the AST cache. Useful for testing.
+ */
+export declare function clearASTCache(): void;
+/**
+ * Get current cache size. Useful for diagnostics.
+ */
+export declare function getASTCacheSize(): number;
+/**
+ * Walk all descendants of a node, calling visitor for each.
+ * Uses a cursor for efficient traversal (avoids creating child arrays).
+ */
+export declare function walkAST(node: Parser.SyntaxNode, visitor: (node: Parser.SyntaxNode) => void | boolean): void;
+/**
+ * Find all AST nodes matching a given type.
+ * Equivalent to `node.descendantsOfType(type)` but with better typing.
+ */
+export declare function findNodesOfType(root: Parser.SyntaxNode, type: string | string[]): Parser.SyntaxNode[];
+/**
+ * Find the innermost function or method surrounding a given node.
+ */
+export declare function findEnclosingFunction(node: Parser.SyntaxNode): Parser.SyntaxNode | null;
+//# sourceMappingURL=ast.d.ts.map

package/dist/parse/ast.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast.d.ts","sourceRoot":"","sources":["../../src/parse/ast.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,MAAM,MAAM,aAAa,CAAA;AAYhC,MAAM,MAAM,WAAW,GAAG,YAAY,GAAG,YAAY,GAAG,KAAK,GAAG,QAAQ,CAAA;AAExE,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC,IAAI,CAAA;IACjB,QAAQ,EAAE,WAAW,CAAA;IACrB,QAAQ,EAAE,MAAM,CAAA;IAChB,qCAAqC;IACrC,IAAI,EAAE,MAAM,CAAA;CACb;AAkBD;;;GAGG;AACH,wBAAgB,cAAc,CAAC,QAAQ,EAAE,MAAM,GAAG,WAAW,GAAG,IAAI,CAKnE;AAmED;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI,CAkC7E;AAED;;;GAGG;AACH,wBAAgB,UAAU,CACxB,KAAK,EAAE,KAAK,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,CAAC,GAC9C,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CASxB;AAED;;GAEG;AACH,wBAAgB,aAAa,IAAI,IAAI,CAEpC;AAED;;GAEG;AACH,wBAAgB,eAAe,IAAI,MAAM,CAExC;AAMD;;;GAGG;AACH,wBAAgB,OAAO,CACrB,IAAI,EAAE,MAAM,CAAC,UAAU,EACvB,OAAO,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC,UAAU,KAAK,IAAI,GAAG,OAAO,GACnD,IAAI,CA2BN;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAC7B,IAAI,EAAE,MAAM,CAAC,UAAU,EACvB,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,GACtB,MAAM,CAAC,UAAU,EAAE,CAGrB;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,UAAU,GAAG,IAAI,CAqBvF"}

package/dist/parse/ast.js

@@ -0,0 +1,230 @@
+"use strict";
+/**
+ * Tree-sitter AST Integration
+ *
+ * Parses source files into typed ASTs using tree-sitter.
+ * Supports JS, TS, TSX, and JSX with language auto-detection.
+ * Includes an LRU cache keyed by content hash for incremental scan reuse.
+ */
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.detectLanguage = detectLanguage;
+exports.parseFile = parseFile;
+exports.parseFiles = parseFiles;
+exports.clearASTCache = clearASTCache;
+exports.getASTCacheSize = getASTCacheSize;
+exports.walkAST = walkAST;
+exports.findNodesOfType = findNodesOfType;
+exports.findEnclosingFunction = findEnclosingFunction;
+const tree_sitter_1 = __importDefault(require("tree-sitter"));
+const tree_sitter_javascript_1 = __importDefault(require("tree-sitter-javascript"));
+// eslint-disable-next-line @typescript-eslint/no-require-imports
+const { typescript: TypeScript, tsx: TSX } = require('tree-sitter-typescript');
+// eslint-disable-next-line @typescript-eslint/no-require-imports
+const Python = require('tree-sitter-python');
+const crypto_1 = require("crypto");
+// ============================================================================
+// Language Detection
+// ============================================================================
+const EXT_TO_LANGUAGE = {
+    '.js': 'javascript',
+    '.mjs': 'javascript',
+    '.cjs': 'javascript',
+    '.jsx': 'tsx', // JSX uses TSX grammar (superset)
+    '.ts': 'typescript',
+    '.mts': 'typescript',
+    '.cts': 'typescript',
+    '.tsx': 'tsx',
+    '.py': 'python',
+};
+/**
+ * Detect AST language from file extension.
+ * Returns null for unsupported file types (Go, config files, etc.)
+ */
+function detectLanguage(filePath) {
+    const lastDot = filePath.lastIndexOf('.');
+    if (lastDot === -1)
+        return null;
+    const ext = filePath.slice(lastDot).toLowerCase();
+    return EXT_TO_LANGUAGE[ext] ?? null;
+}
+// ============================================================================
+// Parser Pool (one per language to avoid setLanguage churn)
+// ============================================================================
+const parsers = new Map();
+function getParser(language) {
+    let parser = parsers.get(language);
+    if (parser)
+        return parser;
+    parser = new tree_sitter_1.default();
+    switch (language) {
+        case 'javascript':
+            parser.setLanguage(tree_sitter_javascript_1.default);
+            break;
+        case 'typescript':
+            parser.setLanguage(TypeScript);
+            break;
+        case 'tsx':
+            parser.setLanguage(TSX);
+            break;
+        case 'python':
+            parser.setLanguage(Python);
+            break;
+    }
+    parsers.set(language, parser);
+    return parser;
+}
+// ============================================================================
+// AST Cache (LRU by content hash)
+// ============================================================================
+const MAX_CACHE_SIZE = 500;
+const astCache = new Map();
+function hashContent(content) {
+    return (0, crypto_1.createHash)('sha1').update(content).digest('hex');
+}
+function evictIfNeeded() {
+    if (astCache.size <= MAX_CACHE_SIZE)
+        return;
+    // Evict least recently accessed
+    let oldest = null;
+    let oldestTime = Infinity;
+    for (const [key, entry] of astCache) {
+        if (entry.lastAccess < oldestTime) {
+            oldestTime = entry.lastAccess;
+            oldest = key;
+        }
+    }
+    if (oldest)
+        astCache.delete(oldest);
+}
+// ============================================================================
+// Public API
+// ============================================================================
+/**
+ * Parse a file into a tree-sitter AST.
+ * Returns null if the language is unsupported or parsing fails.
+ * Results are cached by content hash for incremental scan reuse.
+ */
+function parseFile(content, filePath) {
+    const language = detectLanguage(filePath);
+    if (!language)
+        return null;
+    const hash = hashContent(content);
+    const cacheKey = `${language}:${hash}`;
+    // Check cache
+    const cached = astCache.get(cacheKey);
+    if (cached) {
+        cached.lastAccess = Date.now();
+        // Return with correct filePath (cache may hold AST from a different path with same content)
+        if (cached.ast.filePath !== filePath) {
+            return { ...cached.ast, filePath };
+        }
+        return cached.ast;
+    }
+    // Parse
+    try {
+        const parser = getParser(language);
+        const tree = parser.parse(content);
+        const ast = { tree, language, filePath, hash };
+        // Cache
+        evictIfNeeded();
+        astCache.set(cacheKey, { ast, lastAccess: Date.now() });
+        return ast;
+    }
+    catch {
+        // Graceful fallback — unparseable files are handled by regex detectors
+        return null;
+    }
+}
+/**
+ * Parse multiple files, returning a map of filePath → ParsedAST.
+ * Files with unsupported languages or parse errors are omitted.
+ */
+function parseFiles(files) {
+    const results = new Map();
+    for (const file of files) {
+        const ast = parseFile(file.content, file.path);
+        if (ast) {
+            results.set(file.path, ast);
+        }
+    }
+    return results;
+}
+/**
+ * Clear the AST cache. Useful for testing.
+ */
+function clearASTCache() {
+    astCache.clear();
+}
+/**
+ * Get current cache size. Useful for diagnostics.
+ */
+function getASTCacheSize() {
+    return astCache.size;
+}
+// ============================================================================
+// AST Traversal Helpers
+// ============================================================================
+/**
+ * Walk all descendants of a node, calling visitor for each.
+ * Uses a cursor for efficient traversal (avoids creating child arrays).
+ */
+function walkAST(node, visitor) {
+    const cursor = node.walk();
+    let reachedRoot = false;
+    while (!reachedRoot) {
+        // Visit current node; if visitor returns true, skip subtree
+        const skip = visitor(cursor.currentNode);
+        if (!skip && cursor.gotoFirstChild()) {
+            continue;
+        }
+        if (cursor.gotoNextSibling()) {
+            continue;
+        }
+        // Walk back up until we can go to a sibling
+        while (true) {
+            if (!cursor.gotoParent()) {
+                reachedRoot = true;
+                break;
+            }
+            if (cursor.gotoNextSibling()) {
+                break;
+            }
+        }
+    }
+}
+/**
+ * Find all AST nodes matching a given type.
+ * Equivalent to `node.descendantsOfType(type)` but with better typing.
+ */
+function findNodesOfType(root, type) {
+    const types = Array.isArray(type) ? type : [type];
+    return root.descendantsOfType(types);
+}
+/**
+ * Find the innermost function or method surrounding a given node.
+ */
+function findEnclosingFunction(node) {
+    const functionTypes = [
+        // JavaScript/TypeScript
+        'function_declaration',
+        'function_expression',
+        'arrow_function',
+        'method_definition',
+        'generator_function_declaration',
+        'generator_function',
+        // Python
+        'function_definition',
+    ];
+    let current = node.parent;
+    while (current) {
+        if (functionTypes.includes(current.type)) {
+            return current;
+        }
+        current = current.parent;
+    }
+    return null;
+}
+//# sourceMappingURL=ast.js.map

package/dist/parse/ast.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast.js","sourceRoot":"","sources":["../../src/parse/ast.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;;;AA4CH,wCAKC;AAwED,8BAkCC;AAMD,gCAWC;AAKD,sCAEC;AAKD,0CAEC;AAUD,0BA8BC;AAMD,0CAMC;AAKD,sDAqBC;AAtQD,8DAAgC;AAChC,oFAA+C;AAC/C,iEAAiE;AACjE,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,OAAO,CAAC,wBAAwB,CAAC,CAAA;AAC9E,iEAAiE;AACjE,MAAM,MAAM,GAAG,OAAO,CAAC,oBAAoB,CAAC,CAAA;AAC5C,mCAAmC;AAgBnC,+EAA+E;AAC/E,qBAAqB;AACrB,+EAA+E;AAE/E,MAAM,eAAe,GAAgC;IACnD,KAAK,EAAE,YAAY;IACnB,MAAM,EAAE,YAAY;IACpB,MAAM,EAAE,YAAY;IACpB,MAAM,EAAE,KAAK,EAAS,kCAAkC;IACxD,KAAK,EAAE,YAAY;IACnB,MAAM,EAAE,YAAY;IACpB,MAAM,EAAE,YAAY;IACpB,MAAM,EAAE,KAAK;IACb,KAAK,EAAE,QAAQ;CAChB,CAAA;AAED;;;GAGG;AACH,SAAgB,cAAc,CAAC,QAAgB;IAC7C,MAAM,OAAO,GAAG,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;IACzC,IAAI,OAAO,KAAK,CAAC,CAAC;QAAE,OAAO,IAAI,CAAA;IAC/B,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAA;IACjD,OAAO,eAAe,CAAC,GAAG,CAAC,IAAI,IAAI,CAAA;AACrC,CAAC;AAED,+EAA+E;AAC/E,4DAA4D;AAC5D,+EAA+E;AAE/E,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAA;AAE9C,SAAS,SAAS,CAAC,QAAqB;IACtC,IAAI,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;IAClC,IAAI,MAAM;QAAE,OAAO,MAAM,CAAA;IAEzB,MAAM,GAAG,IAAI,qBAAM,EAAE,CAAA;IACrB,QAAQ,QAAQ,EAAE,CAAC;QACjB,KAAK,YAAY;YACf,MAAM,CAAC,WAAW,CAAC,gCAAU,CAAC,CAAA;YAC9B,MAAK;QACP,KAAK,YAAY;YACf,MAAM,CAAC,WAAW,CAAC,UAAU,CAAC,CAAA;YAC9B,MAAK;QACP,KAAK,KAAK;YACR,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;YACvB,MAAK;QACP,KAAK,QAAQ;YACX,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAA;YAC1B,MAAK;IACT,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAA;IAC7B,OAAO,MAAM,CAAA;AACf,CAAC;AAED,+EAA+E;AAC/E,kCAAkC;AAClC,+EAA+E;AAE/E,MAAM,cAAc,GAAG,GAAG,CAAA;AAO1B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAsB,CAAA;AAE9C,SAAS,WAAW,CAAC,OAAe;IAClC,OAAO,IAAA,mBAAU,EAAC,MAAM,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;AACzD,CAAC;AAED,SAAS,aAAa;IACpB,IAAI,QAAQ,CAAC,IAAI,IAAI,cAAc;QAAE,OAAM;IAE3C,gCAAgC;IAChC,IAAI,MAAM,GAAkB,IAAI,CAAA;IAChC,IAAI,UAAU,GAAG,QAAQ,CAAA;IACzB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE,CAAC;QACpC,IAAI,KAAK,CAAC,UAAU,GAAG,UAAU,EAAE,CAAC;YAClC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAA;YAC7B,MAAM,GAAG,GAAG,CAAA;QACd,CAAC;IACH,CAAC;IACD,IAAI,MAAM;QAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;AACrC,CAAC;AAED,+EAA+E;AAC/E,aAAa;AACb,+EAA+E;AAE/E;;;;GAIG;AACH,SAAgB,SAAS,CAAC,OAAe,EAAE,QAAgB;IACzD,MAAM,QAAQ,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAA;IACzC,IAAI,CAAC,QAAQ;QAAE,OAAO,IAAI,CAAA;IAE1B,MAAM,IAAI,GAAG,WAAW,CAAC,OAAO,CAAC,CAAA;IACjC,MAAM,QAAQ,GAAG,GAAG,QAAQ,IAAI,IAAI,EAAE,CAAA;IAEtC,cAAc;IACd,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;IACrC,IAAI,MAAM,EAAE,CAAC;QACX,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;QAC9B,4FAA4F;QAC5F,IAAI,MAAM,CAAC,GAAG,CAAC,QAAQ,KAAK,QAAQ,EAAE,CAAC;YACrC,OAAO,EAAE,GAAG,MAAM,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAA;QACpC,CAAC;QACD,OAAO,MAAM,CAAC,GAAG,CAAA;IACnB,CAAC;IAED,QAAQ;IACR,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAA;QAClC,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;QAElC,MAAM,GAAG,GAAc,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAA;QAEzD,QAAQ;QACR,aAAa,EAAE,CAAA;QACf,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,GAAG,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAA;QAEvD,OAAO,GAAG,CAAA;IACZ,CAAC;IAAC,MAAM,CAAC;QACP,uEAAuE;QACvE,OAAO,IAAI,CAAA;IACb,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAgB,UAAU,CACxB,KAA+C;IAE/C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAqB,CAAA;IAC5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;QAC9C,IAAI,GAAG,EAAE,CAAC;YACR,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QAC7B,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAA;AAChB,CAAC;AAED;;GAEG;AACH,SAAgB,aAAa;IAC3B,QAAQ,CAAC,KAAK,EAAE,CAAA;AAClB,CAAC;AAED;;GAEG;AACH,SAAgB,eAAe;IAC7B,OAAO,QAAQ,CAAC,IAAI,CAAA;AACtB,CAAC;AAED,+EAA+E;AAC/E,wBAAwB;AACxB,+EAA+E;AAE/E;;;GAGG;AACH,SAAgB,OAAO,CACrB,IAAuB,EACvB,OAAoD;IAEpD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE,CAAA;IAC1B,IAAI,WAAW,GAAG,KAAK,CAAA;IAEvB,OAAO,CAAC,WAAW,EAAE,CAAC;QACpB,4DAA4D;QAC5D,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,CAAA;QAExC,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC,cAAc,EAAE,EAAE,CAAC;YACrC,SAAQ;QACV,CAAC;QAED,IAAI,MAAM,CAAC,eAAe,EAAE,EAAE,CAAC;YAC7B,SAAQ;QACV,CAAC;QAED,4CAA4C;QAC5C,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,EAAE,CAAC;gBACzB,WAAW,GAAG,IAAI,CAAA;gBAClB,MAAK;YACP,CAAC;YACD,IAAI,MAAM,CAAC,eAAe,EAAE,EAAE,CAAC;gBAC7B,MAAK;YACP,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAgB,eAAe,CAC7B,IAAuB,EACvB,IAAuB;IAEvB,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;IACjD,OAAO,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAA;AACtC,CAAC;AAED;;GAEG;AACH,SAAgB,qBAAqB,CAAC,IAAuB;IAC3D,MAAM,aAAa,GAAG;QACpB,wBAAwB;QACxB,sBAAsB;QACtB,qBAAqB;QACrB,gBAAgB;QAChB,mBAAmB;QACnB,gCAAgC;QAChC,oBAAoB;QACpB,SAAS;QACT,qBAAqB;KACtB,CAAA;IAED,IAAI,OAAO,GAAG,IAAI,CAAC,MAAM,CAAA;IACzB,OAAO,OAAO,EAAE,CAAC;QACf,IAAI,aAAa,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,OAAO,OAAO,CAAA;QAChB,CAAC;QACD,OAAO,GAAG,OAAO,CAAC,MAAM,CAAA;IAC1B,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC"}

package/dist/parse/call-graph.d.ts

@@ -0,0 +1,41 @@
+/**
+ * Intra-file Call Graph Builder
+ *
+ * Builds a bidirectional call graph from a parsed AST, tracking which functions
+ * call which other functions within the same file. Used for taint analysis
+ * and understanding code flow in security-relevant contexts.
+ */
+import type Parser from 'tree-sitter';
+import { type ParsedAST } from './ast';
+export interface CallGraph {
+    functions: Map<string, FunctionNode>;
+    calls: Map<string, Set<string>>;
+    calledBy: Map<string, Set<string>>;
+}
+export interface FunctionNode {
+    name: string;
+    node: Parser.SyntaxNode;
+    params: string[];
+    isAsync: boolean;
+    isExported: boolean;
+}
+/**
+ * Build a call graph from a parsed AST.
+ * Tracks all function declarations and intra-file call relationships.
+ */
+export declare function buildCallGraph(ast: ParsedAST): CallGraph;
+export declare function collectFunctions(root: Parser.SyntaxNode, functions: Map<string, FunctionNode>): void;
+/**
+ * Get all functions that call the given function.
+ */
+export declare function getCallersOf(graph: CallGraph, functionName: string): string[];
+/**
+ * Get all functions called by the given function.
+ */
+export declare function getCalleesOf(graph: CallGraph, functionName: string): string[];
+/**
+ * Find a call path from one function to another using BFS.
+ * Returns the chain as an array including both endpoints, or null if no path exists.
+ */
+export declare function getCallChain(graph: CallGraph, from: string, to: string): string[] | null;
+//# sourceMappingURL=call-graph.d.ts.map

package/dist/parse/call-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"call-graph.d.ts","sourceRoot":"","sources":["../../src/parse/call-graph.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AACrC,OAAO,EAAkC,KAAK,SAAS,EAAE,MAAM,OAAO,CAAA;AAStE,MAAM,WAAW,SAAS;IACxB,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAA;IACpC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAA;IAC/B,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAA;CACnC;AAED,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAA;IACZ,IAAI,EAAE,MAAM,CAAC,UAAU,CAAA;IACvB,MAAM,EAAE,MAAM,EAAE,CAAA;IAChB,OAAO,EAAE,OAAO,CAAA;IAChB,UAAU,EAAE,OAAO,CAAA;CACpB;AAQD;;;GAGG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,SAAS,GAAG,SAAS,CAwExD;AAMD,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,CAAC,UAAU,EAAE,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,GAAG,IAAI,CAmCpG;AA2ND;;GAEG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM,EAAE,CAG7E;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM,EAAE,CAG7E;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,IAAI,CAwBxF"}