driftdetect-core 0.4.1 → 0.4.2

package/dist/call-graph/analysis/reachability.js

@@ -0,0 +1,357 @@
+/**
+ * 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.
+ */
+/**
+ * Reachability Analysis Engine
+ */
+export class ReachabilityEngine {
+    graph;
+    constructor(graph) {
+        this.graph = graph;
+    }
+    /**
+     * Get all data reachable from a specific code location
+     */
+    getReachableData(file, line, options = {}) {
+        // Find the containing function
+        const func = this.findContainingFunction(file, line);
+        if (!func) {
+            return this.createEmptyResult({ file, line });
+        }
+        return this.getReachableDataFromFunction(func.id, options);
+    }
+    /**
+     * Get all data reachable from a function
+     */
+    getReachableDataFromFunction(functionId, options = {}) {
+        const func = this.graph.functions.get(functionId);
+        if (!func) {
+            return this.createEmptyResult({ file: '', line: 0, functionId });
+        }
+        const { maxDepth = Infinity, sensitiveOnly = false, tables = [], includeUnresolved = false, } = options;
+        const visited = new Set();
+        const reachableAccess = [];
+        const queue = [];
+        // Start BFS from the given function
+        queue.push({
+            funcId: functionId,
+            path: [],
+            depth: 0,
+        });
+        while (queue.length > 0) {
+            const current = queue.shift();
+            const { funcId, path, depth } = current;
+            if (visited.has(funcId) || depth > maxDepth) {
+                continue;
+            }
+            visited.add(funcId);
+            const currentFunc = this.graph.functions.get(funcId);
+            if (!currentFunc)
+                continue;
+            // Build current path
+            const currentPath = [
+                ...path,
+                {
+                    functionId: funcId,
+                    functionName: currentFunc.qualifiedName,
+                    file: currentFunc.file,
+                    line: currentFunc.startLine,
+                },
+            ];
+            // Collect data access from this function
+            for (const access of currentFunc.dataAccess) {
+                // Filter by tables if specified
+                if (tables.length > 0 && !tables.includes(access.table)) {
+                    continue;
+                }
+                reachableAccess.push({
+                    access,
+                    path: currentPath,
+                    depth,
+                });
+            }
+            // Follow calls to other functions
+            for (const call of currentFunc.calls) {
+                if (!call.resolved && !includeUnresolved) {
+                    continue;
+                }
+                // Add all resolved candidates to the queue
+                for (const candidateId of call.resolvedCandidates) {
+                    if (!visited.has(candidateId)) {
+                        queue.push({
+                            funcId: candidateId,
+                            path: currentPath,
+                            depth: depth + 1,
+                        });
+                    }
+                }
+            }
+        }
+        // Build result
+        return this.buildResult({ file: func.file, line: func.startLine, functionId }, reachableAccess, sensitiveOnly);
+    }
+    /**
+     * Get the call path from a location to a specific data access point
+     */
+    getCallPath(from, toTable, toField) {
+        const result = this.getReachableData(from.file, from.line, {
+            tables: [toTable],
+        });
+        const paths = [];
+        for (const access of result.reachableAccess) {
+            // If field specified, filter by field
+            if (toField && !access.access.fields.includes(toField)) {
+                continue;
+            }
+            paths.push(access.path);
+        }
+        return paths;
+    }
+    /**
+     * Inverse query: "Who can reach this data?"
+     * Find all code paths that can access a specific table/field
+     */
+    getCodePathsToData(options) {
+        const { table, field, maxDepth = Infinity } = options;
+        // Find all functions that directly access this table
+        const directAccessors = [];
+        for (const funcId of this.graph.dataAccessors) {
+            const func = this.graph.functions.get(funcId);
+            if (!func)
+                continue;
+            for (const access of func.dataAccess) {
+                if (access.table === table) {
+                    if (!field || access.fields.includes(field)) {
+                        directAccessors.push(funcId);
+                        break;
+                    }
+                }
+            }
+        }
+        // For each direct accessor, find all paths from entry points
+        const accessPaths = [];
+        const reachingEntryPoints = new Set();
+        for (const accessorId of directAccessors) {
+            const accessor = this.graph.functions.get(accessorId);
+            if (!accessor)
+                continue;
+            // Find the specific access point
+            const accessPoint = accessor.dataAccess.find((a) => a.table === table && (!field || a.fields.includes(field)));
+            if (!accessPoint)
+                continue;
+            // BFS backwards from accessor to find entry points
+            const pathsToAccessor = this.findPathsToFunction(accessorId, maxDepth);
+            for (const { entryPoint, path } of pathsToAccessor) {
+                reachingEntryPoints.add(entryPoint);
+                accessPaths.push({
+                    entryPoint,
+                    path,
+                    accessPoint,
+                });
+            }
+        }
+        return {
+            target: { table, field: field ?? undefined },
+            accessPaths,
+            entryPoints: Array.from(reachingEntryPoints),
+            totalAccessors: directAccessors.length,
+        };
+    }
+    /**
+     * Find all paths from entry points to a specific function
+     */
+    findPathsToFunction(targetId, maxDepth) {
+        const results = [];
+        // For each entry point, try to find a path to the target
+        for (const entryPointId of this.graph.entryPoints) {
+            const paths = this.findPathsBFS(entryPointId, targetId, maxDepth);
+            for (const path of paths) {
+                results.push({
+                    entryPoint: entryPointId,
+                    path,
+                });
+            }
+        }
+        return results;
+    }
+    /**
+     * BFS to find paths between two functions
+     */
+    findPathsBFS(fromId, toId, maxDepth) {
+        const paths = [];
+        const queue = [];
+        const visited = new Map(); // Track minimum depth to reach each node
+        const fromFunc = this.graph.functions.get(fromId);
+        if (!fromFunc)
+            return paths;
+        queue.push({
+            funcId: fromId,
+            path: [{
+                    functionId: fromId,
+                    functionName: fromFunc.qualifiedName,
+                    file: fromFunc.file,
+                    line: fromFunc.startLine,
+                }],
+            depth: 0,
+        });
+        while (queue.length > 0) {
+            const current = queue.shift();
+            const { funcId, path, depth } = current;
+            if (depth > maxDepth)
+                continue;
+            // Check if we've reached the target
+            if (funcId === toId) {
+                paths.push(path);
+                continue; // Don't stop - there might be other paths
+            }
+            // Skip if we've visited this node at a lower depth
+            const previousDepth = visited.get(funcId);
+            if (previousDepth !== undefined && previousDepth <= depth) {
+                continue;
+            }
+            visited.set(funcId, depth);
+            const currentFunc = this.graph.functions.get(funcId);
+            if (!currentFunc)
+                continue;
+            // Follow calls
+            for (const call of currentFunc.calls) {
+                if (!call.resolved)
+                    continue;
+                for (const candidateId of call.resolvedCandidates) {
+                    const candidate = this.graph.functions.get(candidateId);
+                    if (!candidate)
+                        continue;
+                    queue.push({
+                        funcId: candidateId,
+                        path: [
+                            ...path,
+                            {
+                                functionId: candidateId,
+                                functionName: candidate.qualifiedName,
+                                file: candidate.file,
+                                line: candidate.startLine,
+                            },
+                        ],
+                        depth: depth + 1,
+                    });
+                }
+            }
+        }
+        return paths;
+    }
+    /**
+     * Find the function containing a specific line
+     */
+    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;
+    }
+    /**
+     * Build the reachability result
+     */
+    buildResult(origin, reachableAccess, sensitiveOnly) {
+        // Collect unique tables
+        const tablesSet = new Set();
+        for (const access of reachableAccess) {
+            tablesSet.add(access.access.table);
+        }
+        // Group sensitive fields
+        const sensitiveFieldsMap = new Map();
+        for (const access of reachableAccess) {
+            // Check if any fields are sensitive (simplified - real impl would check against known sensitive fields)
+            const sensitivePatterns = [
+                'password', 'secret', 'token', 'key', 'ssn', 'social_security',
+                'credit_card', 'card_number', 'cvv', 'pin', 'dob', 'date_of_birth',
+                'email', 'phone', 'address', 'salary', 'income',
+            ];
+            for (const field of access.access.fields) {
+                const fieldLower = field.toLowerCase();
+                const isSensitive = sensitivePatterns.some((p) => fieldLower.includes(p));
+                if (isSensitive) {
+                    const key = `${access.access.table}.${field}`;
+                    const existing = sensitiveFieldsMap.get(key);
+                    if (existing) {
+                        existing.paths.push(access.path);
+                        existing.accessCount++;
+                    }
+                    else {
+                        sensitiveFieldsMap.set(key, {
+                            field: {
+                                field,
+                                table: access.access.table,
+                                sensitivityType: this.classifySensitivity(field),
+                                file: access.access.file,
+                                line: access.access.line,
+                                confidence: 0.8,
+                            },
+                            paths: [access.path],
+                            accessCount: 1,
+                        });
+                    }
+                }
+            }
+        }
+        // Filter if sensitiveOnly
+        let filteredAccess = reachableAccess;
+        if (sensitiveOnly) {
+            const sensitiveKeys = new Set(sensitiveFieldsMap.keys());
+            filteredAccess = reachableAccess.filter((a) => a.access.fields.some((f) => sensitiveKeys.has(`${a.access.table}.${f}`)));
+        }
+        // Calculate max depth
+        const maxDepth = filteredAccess.reduce((max, a) => Math.max(max, a.depth), 0);
+        return {
+            origin,
+            reachableAccess: filteredAccess,
+            tables: Array.from(tablesSet),
+            sensitiveFields: Array.from(sensitiveFieldsMap.values()),
+            maxDepth,
+            functionsTraversed: new Set(filteredAccess.flatMap((a) => a.path.map((p) => p.functionId))).size,
+        };
+    }
+    /**
+     * Classify sensitivity type based on field name
+     */
+    classifySensitivity(field) {
+        const fieldLower = field.toLowerCase();
+        if (['password', 'secret', 'token', 'key', 'api_key', 'auth'].some((p) => fieldLower.includes(p))) {
+            return 'credentials';
+        }
+        if (['credit_card', 'card_number', 'cvv', 'account_number', 'salary', 'income', 'bank'].some((p) => fieldLower.includes(p))) {
+            return 'financial';
+        }
+        if (['diagnosis', 'medical', 'health', 'prescription', 'condition'].some((p) => fieldLower.includes(p))) {
+            return 'health';
+        }
+        if (['ssn', 'social_security', 'email', 'phone', 'address', 'dob', 'name', 'birth'].some((p) => fieldLower.includes(p))) {
+            return 'pii';
+        }
+        return 'unknown';
+    }
+    /**
+     * Create an empty result
+     */
+    createEmptyResult(origin) {
+        return {
+            origin,
+            reachableAccess: [],
+            tables: [],
+            sensitiveFields: [],
+            maxDepth: 0,
+            functionsTraversed: 0,
+        };
+    }
+}
+//# sourceMappingURL=reachability.js.map

package/dist/call-graph/analysis/reachability.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reachability.js","sourceRoot":"","sources":["../../../src/call-graph/analysis/reachability.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAgBH;;GAEG;AACH,MAAM,OAAO,kBAAkB;IACrB,KAAK,CAAY;IAEzB,YAAY,KAAgB;QAC1B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,gBAAgB,CACd,IAAY,EACZ,IAAY,EACZ,UAA+B,EAAE;QAEjC,+BAA+B;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACrD,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,IAAI,CAAC,iBAAiB,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;QAChD,CAAC;QAED,OAAO,IAAI,CAAC,4BAA4B,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAC7D,CAAC;IAED;;OAEG;IACH,4BAA4B,CAC1B,UAAkB,EAClB,UAA+B,EAAE;QAEjC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAClD,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,IAAI,CAAC,iBAAiB,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC;QACnE,CAAC;QAED,MAAM,EACJ,QAAQ,GAAG,QAAQ,EACnB,aAAa,GAAG,KAAK,EACrB,MAAM,GAAG,EAAE,EACX,iBAAiB,GAAG,KAAK,GAC1B,GAAG,OAAO,CAAC;QAEZ,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,eAAe,GAA0B,EAAE,CAAC;QAClD,MAAM,KAAK,GAAmE,EAAE,CAAC;QAEjF,oCAAoC;QACpC,KAAK,CAAC,IAAI,CAAC;YACT,MAAM,EAAE,UAAU;YAClB,IAAI,EAAE,EAAE;YACR,KAAK,EAAE,CAAC;SACT,CAAC,CAAC;QAEH,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC;YAExC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;gBAC5C,SAAS;YACX,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAEpB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACrD,IAAI,CAAC,WAAW;gBAAE,SAAS;YAE3B,qBAAqB;YACrB,MAAM,WAAW,GAAmB;gBAClC,GAAG,IAAI;gBACP;oBACE,UAAU,EAAE,MAAM;oBAClB,YAAY,EAAE,WAAW,CAAC,aAAa;oBACvC,IAAI,EAAE,WAAW,CAAC,IAAI;oBACtB,IAAI,EAAE,WAAW,CAAC,SAAS;iBAC5B;aACF,CAAC;YAEF,yCAAyC;YACzC,KAAK,MAAM,MAAM,IAAI,WAAW,CAAC,UAAU,EAAE,CAAC;gBAC5C,gCAAgC;gBAChC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;oBACxD,SAAS;gBACX,CAAC;gBAED,eAAe,CAAC,IAAI,CAAC;oBACnB,MAAM;oBACN,IAAI,EAAE,WAAW;oBACjB,KAAK;iBACN,CAAC,CAAC;YACL,CAAC;YAED,kCAAkC;YAClC,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,KAAK,EAAE,CAAC;gBACrC,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,iBAAiB,EAAE,CAAC;oBACzC,SAAS;gBACX,CAAC;gBAED,2CAA2C;gBAC3C,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;oBAClD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;wBAC9B,KAAK,CAAC,IAAI,CAAC;4BACT,MAAM,EAAE,WAAW;4BACnB,IAAI,EAAE,WAAW;4BACjB,KAAK,EAAE,KAAK,GAAG,CAAC;yBACjB,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,eAAe;QACf,OAAO,IAAI,CAAC,WAAW,CACrB,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,UAAU,EAAE,EACrD,eAAe,EACf,aAAa,CACd,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,WAAW,CACT,IAAkB,EAClB,OAAe,EACf,OAAgB;QAEhB,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE;YACzD,MAAM,EAAE,CAAC,OAAO,CAAC;SAClB,CAAC,CAAC;QAEH,MAAM,KAAK,GAAqB,EAAE,CAAC;QAEnC,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,eAAe,EAAE,CAAC;YAC5C,sCAAsC;YACtC,IAAI,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;gBACvD,SAAS;YACX,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,kBAAkB,CAAC,OAAmC;QACpD,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,GAAG,QAAQ,EAAE,GAAG,OAAO,CAAC;QAEtD,qDAAqD;QACrD,MAAM,eAAe,GAAa,EAAE,CAAC;QACrC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;YAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC9C,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;gBACrC,IAAI,MAAM,CAAC,KAAK,KAAK,KAAK,EAAE,CAAC;oBAC3B,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;wBAC5C,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;wBAC7B,MAAM;oBACR,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,6DAA6D;QAC7D,MAAM,WAAW,GAAwB,EAAE,CAAC;QAC5C,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAU,CAAC;QAE9C,KAAK,MAAM,UAAU,IAAI,eAAe,EAAE,CAAC;YACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YACtD,IAAI,CAAC,QAAQ;gBAAE,SAAS;YAExB,iCAAiC;YACjC,MAAM,WAAW,GAAG,QAAQ,CAAC,UAAU,CAAC,IAAI,CAC1C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,KAAK,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CACjE,CAAC;YACF,IAAI,CAAC,WAAW;gBAAE,SAAS;YAE3B,mDAAmD;YACnD,MAAM,eAAe,GAAG,IAAI,CAAC,mBAAmB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;YAEvE,KAAK,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,eAAe,EAAE,CAAC;gBACnD,mBAAmB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBACpC,WAAW,CAAC,IAAI,CAAC;oBACf,UAAU;oBACV,IAAI;oBACJ,WAAW;iBACZ,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO;YACL,MAAM,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,IAAI,SAAS,EAAE;YAC5C,WAAW;YACX,WAAW,EAAE,KAAK,CAAC,IAAI,CAAC,mBAAmB,CAAC;YAC5C,cAAc,EAAE,eAAe,CAAC,MAAM;SACvC,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,mBAAmB,CACzB,QAAgB,EAChB,QAAgB;QAEhB,MAAM,OAAO,GAAwD,EAAE,CAAC;QAExE,yDAAyD;QACzD,KAAK,MAAM,YAAY,IAAI,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;YAClD,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;YAClE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,OAAO,CAAC,IAAI,CAAC;oBACX,UAAU,EAAE,YAAY;oBACxB,IAAI;iBACL,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,YAAY,CAClB,MAAc,EACd,IAAY,EACZ,QAAgB;QAEhB,MAAM,KAAK,GAAqB,EAAE,CAAC;QACnC,MAAM,KAAK,GAAmE,EAAE,CAAC;QACjF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,yCAAyC;QAEpF,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAClD,IAAI,CAAC,QAAQ;YAAE,OAAO,KAAK,CAAC;QAE5B,KAAK,CAAC,IAAI,CAAC;YACT,MAAM,EAAE,MAAM;YACd,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;SACT,CAAC,CAAC;QAEH,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC;YAExC,IAAI,KAAK,GAAG,QAAQ;gBAAE,SAAS;YAE/B,oCAAoC;YACpC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;gBACpB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,SAAS,CAAC,0CAA0C;YACtD,CAAC;YAED,mDAAmD;YACnD,MAAM,aAAa,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC1C,IAAI,aAAa,KAAK,SAAS,IAAI,aAAa,IAAI,KAAK,EAAE,CAAC;gBAC1D,SAAS;YACX,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAE3B,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACrD,IAAI,CAAC,WAAW;gBAAE,SAAS;YAE3B,eAAe;YACf,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,KAAK,EAAE,CAAC;gBACrC,IAAI,CAAC,IAAI,CAAC,QAAQ;oBAAE,SAAS;gBAE7B,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,KAAK,CAAC,IAAI,CAAC;wBACT,MAAM,EAAE,WAAW;wBACnB,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;qBACjB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,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;IAED;;OAEG;IACK,WAAW,CACjB,MAAoB,EACpB,eAAsC,EACtC,aAAsB;QAEtB,wBAAwB;QACxB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QACpC,KAAK,MAAM,MAAM,IAAI,eAAe,EAAE,CAAC;YACrC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrC,CAAC;QAED,yBAAyB;QACzB,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAgC,CAAC;QACnE,KAAK,MAAM,MAAM,IAAI,eAAe,EAAE,CAAC;YACrC,wGAAwG;YACxG,MAAM,iBAAiB,GAAG;gBACxB,UAAU,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,iBAAiB;gBAC9D,aAAa,EAAE,aAAa,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,eAAe;gBAClE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ;aAChD,CAAC;YAEF,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;gBACzC,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;gBACvC,MAAM,WAAW,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBAE1E,IAAI,WAAW,EAAE,CAAC;oBAChB,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI,KAAK,EAAE,CAAC;oBAC9C,MAAM,QAAQ,GAAG,kBAAkB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBAE7C,IAAI,QAAQ,EAAE,CAAC;wBACb,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;wBACjC,QAAQ,CAAC,WAAW,EAAE,CAAC;oBACzB,CAAC;yBAAM,CAAC;wBACN,kBAAkB,CAAC,GAAG,CAAC,GAAG,EAAE;4BAC1B,KAAK,EAAE;gCACL,KAAK;gCACL,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK;gCAC1B,eAAe,EAAE,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC;gCAChD,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI;gCACxB,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI;gCACxB,UAAU,EAAE,GAAG;6BAChB;4BACD,KAAK,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC;4BACpB,WAAW,EAAE,CAAC;yBACf,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,0BAA0B;QAC1B,IAAI,cAAc,GAAG,eAAe,CAAC;QACrC,IAAI,aAAa,EAAE,CAAC;YAClB,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,kBAAkB,CAAC,IAAI,EAAE,CAAC,CAAC;YACzD,cAAc,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAC5C,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,CACzE,CAAC;QACJ,CAAC;QAED,sBAAsB;QACtB,MAAM,QAAQ,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;QAE9E,OAAO;YACL,MAAM;YACN,eAAe,EAAE,cAAc;YAC/B,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC;YAC7B,eAAe,EAAE,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,CAAC;YACxD,QAAQ;YACR,kBAAkB,EAAE,IAAI,GAAG,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI;SACjG,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,mBAAmB,CAAC,KAAa;QACvC,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QAEvC,IAAI,CAAC,UAAU,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAClG,OAAO,aAAa,CAAC;QACvB,CAAC;QACD,IAAI,CAAC,aAAa,EAAE,aAAa,EAAE,KAAK,EAAE,gBAAgB,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5H,OAAO,WAAW,CAAC;QACrB,CAAC;QACD,IAAI,CAAC,WAAW,EAAE,SAAS,EAAE,QAAQ,EAAE,cAAc,EAAE,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACxG,OAAO,QAAQ,CAAC;QAClB,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,iBAAiB,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACxH,OAAO,KAAK,CAAC;QACf,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,MAAoB;QAC5C,OAAO;YACL,MAAM;YACN,eAAe,EAAE,EAAE;YACnB,MAAM,EAAE,EAAE;YACV,eAAe,EAAE,EAAE;YACnB,QAAQ,EAAE,CAAC;YACX,kBAAkB,EAAE,CAAC;SACtB,CAAC;IACJ,CAAC;CACF"}

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

@@ -0,0 +1,11 @@
+#!/usr/bin/env node
+/**
+ * Call Graph Demo Script
+ *
+ * Demonstrates the call-graph system's capabilities on a real Python codebase.
+ * Shows: extraction, graph building, reachability analysis, and data flow mapping.
+ *
+ * Run: node drift/packages/core/dist/call-graph/demo.js
+ */
+export {};
+//# sourceMappingURL=demo.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"demo.d.ts","sourceRoot":"","sources":["../../src/call-graph/demo.ts"],"names":[],"mappings":";AACA;;;;;;;GAOG"}