driftdetect-core 0.4.1 → 0.4.3

package/dist/call-graph/analysis/path-finder.js

@@ -0,0 +1,360 @@
+/**
+ * Path Finder
+ *
+ * Advanced path finding algorithms for call graph traversal.
+ * Supports finding shortest paths, all paths, and critical paths
+ * between functions in the call graph.
+ */
+// ============================================================================
+// Path Finder
+// ============================================================================
+/**
+ * Advanced path finding for call graphs
+ */
+export class PathFinder {
+    graph;
+    constructor(graph) {
+        this.graph = graph;
+    }
+    /**
+     * Find the shortest path between two functions
+     */
+    findShortestPath(fromId, toId, options = {}) {
+        const result = this.findPaths(fromId, toId, { ...options, maxPaths: 1 });
+        return result.paths[0] ?? null;
+    }
+    /**
+     * Find all paths between two functions
+     */
+    findAllPaths(fromId, toId, options = {}) {
+        return this.findPaths(fromId, toId, options);
+    }
+    /**
+     * Find paths from a location to any data access
+     */
+    findPathsToData(from, options = {}) {
+        const startTime = Date.now();
+        const paths = [];
+        let nodesVisited = 0;
+        // Find containing function
+        const fromFunc = this.findContainingFunction(from.file, from.line);
+        if (!fromFunc) {
+            return {
+                paths: [],
+                exhaustive: true,
+                nodesVisited: 0,
+                searchTimeMs: Date.now() - startTime,
+            };
+        }
+        // Find all data accessors
+        for (const accessorId of this.graph.dataAccessors) {
+            const result = this.findPaths(fromFunc.id, accessorId, options);
+            paths.push(...result.paths);
+            nodesVisited += result.nodesVisited;
+            if (options.maxPaths && paths.length >= options.maxPaths) {
+                break;
+            }
+        }
+        // Sort by depth
+        paths.sort((a, b) => a.depth - b.depth);
+        return {
+            paths: options.maxPaths ? paths.slice(0, options.maxPaths) : paths,
+            exhaustive: !options.maxPaths || paths.length < options.maxPaths,
+            nodesVisited,
+            searchTimeMs: Date.now() - startTime,
+        };
+    }
+    /**
+     * Find paths from entry points to a specific function
+     */
+    findPathsFromEntryPoints(toId, options = {}) {
+        const startTime = Date.now();
+        const paths = [];
+        let nodesVisited = 0;
+        for (const entryPointId of this.graph.entryPoints) {
+            const result = this.findPaths(entryPointId, toId, options);
+            paths.push(...result.paths);
+            nodesVisited += result.nodesVisited;
+            if (options.maxPaths && paths.length >= options.maxPaths) {
+                break;
+            }
+        }
+        // Sort by depth
+        paths.sort((a, b) => a.depth - b.depth);
+        return {
+            paths: options.maxPaths ? paths.slice(0, options.maxPaths) : paths,
+            exhaustive: !options.maxPaths || paths.length < options.maxPaths,
+            nodesVisited,
+            searchTimeMs: Date.now() - startTime,
+        };
+    }
+    /**
+     * Find the critical path (most impactful) to data access
+     */
+    findCriticalPath(from, dataAccessPoints, options = {}) {
+        const pathsResult = this.findPathsToData(from, { ...options, maxPaths: 100 });
+        if (pathsResult.paths.length === 0) {
+            return {
+                criticalPath: null,
+                rankedPaths: [],
+            };
+        }
+        // Score each path
+        const rankedPaths = pathsResult.paths.map((path) => {
+            const { score, factors } = this.scorePath(path, dataAccessPoints);
+            return { path, score, factors };
+        });
+        // Sort by score (descending)
+        rankedPaths.sort((a, b) => b.score - a.score);
+        return {
+            criticalPath: rankedPaths[0]?.path ?? null,
+            rankedPaths,
+        };
+    }
+    /**
+     * Check if two functions are connected
+     */
+    isConnected(fromId, toId, maxDepth = 10) {
+        return this.findShortestPath(fromId, toId, { maxDepth }) !== null;
+    }
+    /**
+     * Get all functions reachable from a starting point
+     */
+    getReachableFunctions(fromId, options = {}) {
+        const maxDepth = options.maxDepth ?? Infinity;
+        const includeUnresolved = options.includeUnresolved ?? false;
+        const minConfidence = options.minConfidence ?? 0;
+        const reachable = new Set();
+        const queue = [{ id: fromId, depth: 0 }];
+        while (queue.length > 0) {
+            const { id, depth } = queue.shift();
+            if (reachable.has(id) || depth > maxDepth)
+                continue;
+            reachable.add(id);
+            const func = this.graph.functions.get(id);
+            if (!func)
+                continue;
+            for (const call of func.calls) {
+                if (!call.resolved && !includeUnresolved)
+                    continue;
+                if (call.confidence < minConfidence)
+                    continue;
+                for (const candidateId of call.resolvedCandidates) {
+                    if (!reachable.has(candidateId)) {
+                        queue.push({ id: candidateId, depth: depth + 1 });
+                    }
+                }
+            }
+        }
+        return reachable;
+    }
+    /**
+     * Get all functions that can reach a target
+     */
+    getCallers(toId, options = {}) {
+        const maxDepth = options.maxDepth ?? Infinity;
+        const callers = new Set();
+        const queue = [{ id: toId, depth: 0 }];
+        while (queue.length > 0) {
+            const { id, depth } = queue.shift();
+            if (callers.has(id) || depth > maxDepth)
+                continue;
+            callers.add(id);
+            const func = this.graph.functions.get(id);
+            if (!func)
+                continue;
+            for (const callSite of func.calledBy) {
+                if (!callers.has(callSite.callerId)) {
+                    queue.push({ id: callSite.callerId, depth: depth + 1 });
+                }
+            }
+        }
+        return callers;
+    }
+    /**
+     * Find paths between two functions using BFS
+     */
+    findPaths(fromId, toId, options = {}) {
+        const startTime = Date.now();
+        const maxDepth = options.maxDepth ?? 20;
+        const maxPaths = options.maxPaths ?? 100;
+        const includeUnresolved = options.includeUnresolved ?? false;
+        const minConfidence = options.minConfidence ?? 0;
+        const paths = [];
+        let nodesVisited = 0;
+        // Handle same node case
+        if (fromId === toId) {
+            const func = this.graph.functions.get(fromId);
+            if (func) {
+                return {
+                    paths: [{
+                            nodes: [{
+                                    functionId: fromId,
+                                    functionName: func.qualifiedName,
+                                    file: func.file,
+                                    line: func.startLine,
+                                }],
+                            depth: 0,
+                            minConfidence: 1,
+                            hasUnresolved: false,
+                        }],
+                    exhaustive: true,
+                    nodesVisited: 1,
+                    searchTimeMs: Date.now() - startTime,
+                };
+            }
+        }
+        // BFS with path tracking
+        const visited = new Map(); // Track minimum depth to reach each node
+        const queue = [];
+        const fromFunc = this.graph.functions.get(fromId);
+        if (!fromFunc) {
+            return {
+                paths: [],
+                exhaustive: true,
+                nodesVisited: 0,
+                searchTimeMs: Date.now() - startTime,
+            };
+        }
+        queue.push({
+            id: fromId,
+            path: [{
+                    functionId: fromId,
+                    functionName: fromFunc.qualifiedName,
+                    file: fromFunc.file,
+                    line: fromFunc.startLine,
+                }],
+            depth: 0,
+            minConf: 1,
+            hasUnresolved: false,
+        });
+        while (queue.length > 0 && paths.length < maxPaths) {
+            const current = queue.shift();
+            const { id, path, depth, minConf, hasUnresolved } = current;
+            nodesVisited++;
+            if (depth > maxDepth)
+                continue;
+            // Skip if we've visited this node at a lower depth (optimization)
+            const prevDepth = visited.get(id);
+            if (prevDepth !== undefined && prevDepth < depth)
+                continue;
+            visited.set(id, depth);
+            // Check if we reached the target
+            if (id === toId) {
+                paths.push({
+                    nodes: path,
+                    depth,
+                    minConfidence: minConf,
+                    hasUnresolved,
+                });
+                continue;
+            }
+            const func = this.graph.functions.get(id);
+            if (!func)
+                continue;
+            // Explore calls
+            for (const call of func.calls) {
+                if (!call.resolved && !includeUnresolved)
+                    continue;
+                if (call.confidence < minConfidence)
+                    continue;
+                for (const candidateId of call.resolvedCandidates) {
+                    const candidate = this.graph.functions.get(candidateId);
+                    if (!candidate)
+                        continue;
+                    // Don't revisit nodes in the current path (avoid cycles)
+                    if (path.some((n) => n.functionId === candidateId))
+                        continue;
+                    queue.push({
+                        id: candidateId,
+                        path: [
+                            ...path,
+                            {
+                                functionId: candidateId,
+                                functionName: candidate.qualifiedName,
+                                file: candidate.file,
+                                line: candidate.startLine,
+                            },
+                        ],
+                        depth: depth + 1,
+                        minConf: Math.min(minConf, call.confidence),
+                        hasUnresolved: hasUnresolved || !call.resolved,
+                    });
+                }
+            }
+        }
+        return {
+            paths,
+            exhaustive: paths.length < maxPaths,
+            nodesVisited,
+            searchTimeMs: Date.now() - startTime,
+        };
+    }
+    /**
+     * Score a path based on criticality factors
+     */
+    scorePath(path, dataAccessPoints) {
+        let score = 100;
+        const factors = [];
+        // Shorter paths are more critical (easier to exploit)
+        if (path.depth <= 2) {
+            score += 20;
+            factors.push('Short call chain');
+        }
+        else if (path.depth > 5) {
+            score -= 10;
+            factors.push('Deep call chain');
+        }
+        // Higher confidence paths are more reliable
+        if (path.minConfidence >= 0.9) {
+            score += 10;
+            factors.push('High confidence resolution');
+        }
+        else if (path.minConfidence < 0.5) {
+            score -= 20;
+            factors.push('Low confidence resolution');
+        }
+        // Unresolved calls reduce criticality
+        if (path.hasUnresolved) {
+            score -= 15;
+            factors.push('Contains unresolved calls');
+        }
+        // Check if path ends at sensitive data
+        const lastNode = path.nodes[path.nodes.length - 1];
+        if (lastNode) {
+            const accessPoint = dataAccessPoints.find((ap) => ap.file === lastNode.file && ap.line === lastNode.line);
+            if (accessPoint) {
+                // Boost for write/delete operations
+                if (accessPoint.operation === 'write' || accessPoint.operation === 'delete') {
+                    score += 15;
+                    factors.push('Write/delete operation');
+                }
+            }
+        }
+        return { score: Math.max(0, score), factors };
+    }
+    /**
+     * Find the function containing a location
+     */
+    findContainingFunction(file, line) {
+        let best = null;
+        let bestSize = Infinity;
+        for (const [, func] of this.graph.functions) {
+            if (func.file === file && line >= func.startLine && line <= func.endLine) {
+                const size = func.endLine - func.startLine;
+                if (size < bestSize) {
+                    best = func;
+                    bestSize = size;
+                }
+            }
+        }
+        return best;
+    }
+}
+/**
+ * Create a new path finder
+ */
+export function createPathFinder(graph) {
+    return new PathFinder(graph);
+}
+//# sourceMappingURL=path-finder.js.map

package/dist/call-graph/analysis/path-finder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"path-finder.js","sourceRoot":"","sources":["../../../src/call-graph/analysis/path-finder.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAsEH,+EAA+E;AAC/E,cAAc;AACd,+EAA+E;AAE/E;;GAEG;AACH,MAAM,OAAO,UAAU;IACJ,KAAK,CAAY;IAElC,YAAY,KAAgB;QAC1B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,gBAAgB,CACd,MAAc,EACd,IAAY,EACZ,UAA6B,EAAE;QAE/B,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,GAAG,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QACzE,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,YAAY,CACV,MAAc,EACd,IAAY,EACZ,UAA6B,EAAE;QAE/B,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IAC/C,CAAC;IAED;;OAEG;IACH,eAAe,CACb,IAAkB,EAClB,UAA6B,EAAE;QAE/B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,2BAA2B;QAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACnE,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO;gBACL,KAAK,EAAE,EAAE;gBACT,UAAU,EAAE,IAAI;gBAChB,YAAY,EAAE,CAAC;gBACf,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;aACrC,CAAC;QACJ,CAAC;QAED,0BAA0B;QAC1B,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;YAClD,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;YAChE,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5B,YAAY,IAAI,MAAM,CAAC,YAAY,CAAC;YAEpC,IAAI,OAAO,CAAC,QAAQ,IAAI,KAAK,CAAC,MAAM,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;gBACzD,MAAM;YACR,CAAC;QACH,CAAC;QAED,gBAAgB;QAChB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAExC,OAAO;YACL,KAAK,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK;YAClE,UAAU,EAAE,CAAC,OAAO,CAAC,QAAQ,IAAI,KAAK,CAAC,MAAM,GAAG,OAAO,CAAC,QAAQ;YAChE,YAAY;YACZ,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SACrC,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,wBAAwB,CACtB,IAAY,EACZ,UAA6B,EAAE;QAE/B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,KAAK,MAAM,YAAY,IAAI,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;YAClD,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;YAC3D,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5B,YAAY,IAAI,MAAM,CAAC,YAAY,CAAC;YAEpC,IAAI,OAAO,CAAC,QAAQ,IAAI,KAAK,CAAC,MAAM,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;gBACzD,MAAM;YACR,CAAC;QACH,CAAC;QAED,gBAAgB;QAChB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAExC,OAAO;YACL,KAAK,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK;YAClE,UAAU,EAAE,CAAC,OAAO,CAAC,QAAQ,IAAI,KAAK,CAAC,MAAM,GAAG,OAAO,CAAC,QAAQ;YAChE,YAAY;YACZ,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SACrC,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,gBAAgB,CACd,IAAkB,EAClB,gBAAmC,EACnC,UAA6B,EAAE;QAE/B,MAAM,WAAW,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,EAAE,GAAG,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC;QAE9E,IAAI,WAAW,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnC,OAAO;gBACL,YAAY,EAAE,IAAI;gBAClB,WAAW,EAAE,EAAE;aAChB,CAAC;QACJ,CAAC;QAED,kBAAkB;QAClB,MAAM,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YACjD,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAC;YAClE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;QAClC,CAAC,CAAC,CAAC;QAEH,6BAA6B;QAC7B,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAE9C,OAAO;YACL,YAAY,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,IAAI;YAC1C,WAAW;SACZ,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,MAAc,EAAE,IAAY,EAAE,WAAmB,EAAE;QAC7D,OAAO,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,QAAQ,EAAE,CAAC,KAAK,IAAI,CAAC;IACpE,CAAC;IAED;;OAEG;IACH,qBAAqB,CACnB,MAAc,EACd,UAA6B,EAAE;QAE/B,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,QAAQ,CAAC;QAC9C,MAAM,iBAAiB,GAAG,OAAO,CAAC,iBAAiB,IAAI,KAAK,CAAC;QAC7D,MAAM,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,CAAC,CAAC;QAEjD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QACpC,MAAM,KAAK,GAAyC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAE/E,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAErC,IAAI,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,GAAG,QAAQ;gBAAE,SAAS;YACpD,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAElB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC1C,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,iBAAiB;oBAAE,SAAS;gBACnD,IAAI,IAAI,CAAC,UAAU,GAAG,aAAa;oBAAE,SAAS;gBAE9C,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;oBAClD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;wBAChC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;oBACpD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,UAAU,CACR,IAAY,EACZ,UAA6B,EAAE;QAE/B,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,QAAQ,CAAC;QAC9C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAyC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAE7E,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAErC,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,GAAG,QAAQ;gBAAE,SAAS;YAClD,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAEhB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC1C,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACrC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACpC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC1D,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,SAAS,CACf,MAAc,EACd,IAAY,EACZ,UAA6B,EAAE;QAE/B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,EAAE,CAAC;QACxC,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,GAAG,CAAC;QACzC,MAAM,iBAAiB,GAAG,OAAO,CAAC,iBAAiB,IAAI,KAAK,CAAC;QAC7D,MAAM,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,CAAC,CAAC;QAEjD,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,wBAAwB;QACxB,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC9C,IAAI,IAAI,EAAE,CAAC;gBACT,OAAO;oBACL,KAAK,EAAE,CAAC;4BACN,KAAK,EAAE,CAAC;oCACN,UAAU,EAAE,MAAM;oCAClB,YAAY,EAAE,IAAI,CAAC,aAAa;oCAChC,IAAI,EAAE,IAAI,CAAC,IAAI;oCACf,IAAI,EAAE,IAAI,CAAC,SAAS;iCACrB,CAAC;4BACF,KAAK,EAAE,CAAC;4BACR,aAAa,EAAE,CAAC;4BAChB,aAAa,EAAE,KAAK;yBACrB,CAAC;oBACF,UAAU,EAAE,IAAI;oBAChB,YAAY,EAAE,CAAC;oBACf,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;iBACrC,CAAC;YACJ,CAAC;QACH,CAAC;QAED,yBAAyB;QACzB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,yCAAyC;QACpF,MAAM,KAAK,GAMN,EAAE,CAAC;QAER,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAClD,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO;gBACL,KAAK,EAAE,EAAE;gBACT,UAAU,EAAE,IAAI;gBAChB,YAAY,EAAE,CAAC;gBACf,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;aACrC,CAAC;QACJ,CAAC;QAED,KAAK,CAAC,IAAI,CAAC;YACT,EAAE,EAAE,MAAM;YACV,IAAI,EAAE,CAAC;oBACL,UAAU,EAAE,MAAM;oBAClB,YAAY,EAAE,QAAQ,CAAC,aAAa;oBACpC,IAAI,EAAE,QAAQ,CAAC,IAAI;oBACnB,IAAI,EAAE,QAAQ,CAAC,SAAS;iBACzB,CAAC;YACF,KAAK,EAAE,CAAC;YACR,OAAO,EAAE,CAAC;YACV,aAAa,EAAE,KAAK;SACrB,CAAC,CAAC;QAEH,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,QAAQ,EAAE,CAAC;YACnD,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,aAAa,EAAE,GAAG,OAAO,CAAC;YAC5D,YAAY,EAAE,CAAC;YAEf,IAAI,KAAK,GAAG,QAAQ;gBAAE,SAAS;YAE/B,kEAAkE;YAClE,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAClC,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,GAAG,KAAK;gBAAE,SAAS;YAC3D,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAEvB,iCAAiC;YACjC,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;gBAChB,KAAK,CAAC,IAAI,CAAC;oBACT,KAAK,EAAE,IAAI;oBACX,KAAK;oBACL,aAAa,EAAE,OAAO;oBACtB,aAAa;iBACd,CAAC,CAAC;gBACH,SAAS;YACX,CAAC;YAED,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC1C,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,gBAAgB;YAChB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,iBAAiB;oBAAE,SAAS;gBACnD,IAAI,IAAI,CAAC,UAAU,GAAG,aAAa;oBAAE,SAAS;gBAE9C,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;oBAClD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;oBACxD,IAAI,CAAC,SAAS;wBAAE,SAAS;oBAEzB,yDAAyD;oBACzD,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,WAAW,CAAC;wBAAE,SAAS;oBAE7D,KAAK,CAAC,IAAI,CAAC;wBACT,EAAE,EAAE,WAAW;wBACf,IAAI,EAAE;4BACJ,GAAG,IAAI;4BACP;gCACE,UAAU,EAAE,WAAW;gCACvB,YAAY,EAAE,SAAS,CAAC,aAAa;gCACrC,IAAI,EAAE,SAAS,CAAC,IAAI;gCACpB,IAAI,EAAE,SAAS,CAAC,SAAS;6BAC1B;yBACF;wBACD,KAAK,EAAE,KAAK,GAAG,CAAC;wBAChB,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC;wBAC3C,aAAa,EAAE,aAAa,IAAI,CAAC,IAAI,CAAC,QAAQ;qBAC/C,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,KAAK;YACL,UAAU,EAAE,KAAK,CAAC,MAAM,GAAG,QAAQ;YACnC,YAAY;YACZ,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SACrC,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,SAAS,CACf,IAAc,EACd,gBAAmC;QAEnC,IAAI,KAAK,GAAG,GAAG,CAAC;QAChB,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,sDAAsD;QACtD,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC;YACpB,KAAK,IAAI,EAAE,CAAC;YACZ,OAAO,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QACnC,CAAC;aAAM,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;YAC1B,KAAK,IAAI,EAAE,CAAC;YACZ,OAAO,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;QAClC,CAAC;QAED,4CAA4C;QAC5C,IAAI,IAAI,CAAC,aAAa,IAAI,GAAG,EAAE,CAAC;YAC9B,KAAK,IAAI,EAAE,CAAC;YACZ,OAAO,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC;QAC7C,CAAC;aAAM,IAAI,IAAI,CAAC,aAAa,GAAG,GAAG,EAAE,CAAC;YACpC,KAAK,IAAI,EAAE,CAAC;YACZ,OAAO,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;QAC5C,CAAC;QAED,sCAAsC;QACtC,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,KAAK,IAAI,EAAE,CAAC;YACZ,OAAO,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;QAC5C,CAAC;QAED,uCAAuC;QACvC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACnD,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,WAAW,GAAG,gBAAgB,CAAC,IAAI,CACvC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,IAAI,EAAE,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,CAC/D,CAAC;YACF,IAAI,WAAW,EAAE,CAAC;gBAChB,oCAAoC;gBACpC,IAAI,WAAW,CAAC,SAAS,KAAK,OAAO,IAAI,WAAW,CAAC,SAAS,KAAK,QAAQ,EAAE,CAAC;oBAC5E,KAAK,IAAI,EAAE,CAAC;oBACZ,OAAO,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;gBACzC,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,OAAO,EAAE,CAAC;IAChD,CAAC;IAED;;OAEG;IACK,sBAAsB,CAAC,IAAY,EAAE,IAAY;QACvD,IAAI,IAAI,GAAwB,IAAI,CAAC;QACrC,IAAI,QAAQ,GAAG,QAAQ,CAAC;QAExB,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC;YAC5C,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACzE,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC;gBAC3C,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;oBACpB,IAAI,GAAG,IAAI,CAAC;oBACZ,QAAQ,GAAG,IAAI,CAAC;gBAClB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAgB;IAC/C,OAAO,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;AAC/B,CAAC"}

package/dist/call-graph/analysis/reachability.d.ts

@@ -0,0 +1,56 @@
+/**
+ * Reachability Analysis Engine
+ *
+ * Answers the core question: "What data can this line of code ultimately access?"
+ * Uses BFS traversal through the call graph to find all reachable data access points.
+ */
+import type { CallGraph, ReachabilityResult, ReachabilityOptions, CallPathNode, CodeLocation, InverseReachabilityOptions, InverseReachabilityResult } from '../types.js';
+/**
+ * Reachability Analysis Engine
+ */
+export declare class ReachabilityEngine {
+    private graph;
+    constructor(graph: CallGraph);
+    /**
+     * Get all data reachable from a specific code location
+     */
+    getReachableData(file: string, line: number, options?: ReachabilityOptions): ReachabilityResult;
+    /**
+     * Get all data reachable from a function
+     */
+    getReachableDataFromFunction(functionId: string, options?: ReachabilityOptions): ReachabilityResult;
+    /**
+     * Get the call path from a location to a specific data access point
+     */
+    getCallPath(from: CodeLocation, toTable: string, toField?: string): CallPathNode[][];
+    /**
+     * Inverse query: "Who can reach this data?"
+     * Find all code paths that can access a specific table/field
+     */
+    getCodePathsToData(options: InverseReachabilityOptions): InverseReachabilityResult;
+    /**
+     * Find all paths from entry points to a specific function
+     */
+    private findPathsToFunction;
+    /**
+     * BFS to find paths between two functions
+     */
+    private findPathsBFS;
+    /**
+     * Find the function containing a specific line
+     */
+    private findContainingFunction;
+    /**
+     * Build the reachability result
+     */
+    private buildResult;
+    /**
+     * Classify sensitivity type based on field name
+     */
+    private classifySensitivity;
+    /**
+     * Create an empty result
+     */
+    private createEmptyResult;
+}
+//# sourceMappingURL=reachability.d.ts.map

package/dist/call-graph/analysis/reachability.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reachability.d.ts","sourceRoot":"","sources":["../../../src/call-graph/analysis/reachability.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EACV,SAAS,EAET,kBAAkB,EAClB,mBAAmB,EAEnB,YAAY,EACZ,YAAY,EAEZ,0BAA0B,EAC1B,yBAAyB,EAE1B,MAAM,aAAa,CAAC;AAErB;;GAEG;AACH,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,KAAK,CAAY;gBAEb,KAAK,EAAE,SAAS;IAI5B;;OAEG;IACH,gBAAgB,CACd,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,MAAM,EACZ,OAAO,GAAE,mBAAwB,GAChC,kBAAkB;IAUrB;;OAEG;IACH,4BAA4B,CAC1B,UAAU,EAAE,MAAM,EAClB,OAAO,GAAE,mBAAwB,GAChC,kBAAkB;IAwFrB;;OAEG;IACH,WAAW,CACT,IAAI,EAAE,YAAY,EAClB,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE,MAAM,GACf,YAAY,EAAE,EAAE;IAkBnB;;;OAGG;IACH,kBAAkB,CAAC,OAAO,EAAE,0BAA0B,GAAG,yBAAyB;IAsDlF;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAoB3B;;OAEG;IACH,OAAO,CAAC,YAAY;IAyEpB;;OAEG;IACH,OAAO,CAAC,sBAAsB;IAiB9B;;OAEG;IACH,OAAO,CAAC,WAAW;IAwEnB;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAmB3B;;OAEG;IACH,OAAO,CAAC,iBAAiB;CAU1B"}