driftdetect-core 0.1.0

package/dist/analyzers/flow-analyzer.d.ts

@@ -0,0 +1,241 @@
+/**
+ * Flow Analyzer - Control flow and data flow analysis
+ *
+ * Provides control flow graph (CFG) construction from AST,
+ * data flow analysis (reads, writes, captures), detection of
+ * unreachable code, infinite loops, missing return statements,
+ * null/undefined dereferences, unused variables, and uninitialized reads.
+ *
+ * @requirements 3.5 - Parser SHALL provide a unified AST query interface across all languages
+ */
+import type { AST, ASTNode } from '../parsers/types.js';
+import type { FlowAnalysisResult, ControlFlowNode, ControlFlowEdge } from './types.js';
+/**
+ * Options for flow analysis
+ */
+export interface FlowAnalysisOptions {
+    /** Whether to detect unreachable code */
+    detectUnreachable?: boolean;
+    /** Whether to detect infinite loops */
+    detectInfiniteLoops?: boolean;
+    /** Whether to detect missing return statements */
+    detectMissingReturns?: boolean;
+    /** Whether to detect null/undefined dereferences */
+    detectNullDereferences?: boolean;
+    /** Whether to detect unused variables */
+    detectUnusedVariables?: boolean;
+    /** Whether to detect uninitialized variable reads */
+    detectUninitializedReads?: boolean;
+    /** Maximum depth for analysis */
+    maxDepth?: number;
+}
+/**
+ * Flow Analyzer class for control flow and data flow analysis.
+ *
+ * Provides a unified interface for analyzing control flow and data flow
+ * across TypeScript and JavaScript code.
+ *
+ * @requirements 3.5 - Unified AST query interface across all languages
+ */
+export declare class FlowAnalyzer {
+    /** Counter for generating unique node IDs */
+    private nodeIdCounter;
+    /** All CFG nodes during construction */
+    private nodes;
+    /** All CFG edges during construction */
+    private edges;
+    /** Entry node ID */
+    private entryNodeId;
+    /** Exit node IDs */
+    private exitNodeIds;
+    /** Unreachable code locations */
+    private unreachableCode;
+    /** Infinite loop locations */
+    private infiniteLoops;
+    /** Missing return locations */
+    private missingReturns;
+    /** Current analysis options */
+    private options;
+    /**
+     * Analyze an AST and produce flow analysis results.
+     *
+     * @param ast - The AST to analyze
+     * @param options - Analysis options
+     * @returns Flow analysis result
+     */
+    analyze(ast: AST, options?: FlowAnalysisOptions): FlowAnalysisResult;
+    /**
+     * Analyze a single function/method for flow.
+     *
+     * @param node - The function AST node
+     * @param options - Analysis options
+     * @returns Flow analysis result for the function
+     */
+    analyzeFunction(node: ASTNode, options?: FlowAnalysisOptions): FlowAnalysisResult;
+    /**
+     * Build CFG from an AST node.
+     * Returns the IDs of nodes that flow out of this construct.
+     */
+    private buildCFG;
+    /**
+     * Build CFG for a block of statements.
+     */
+    private buildBlockCFG;
+    /**
+     * Build CFG for an if statement.
+     */
+    private buildIfCFG;
+    /**
+     * Build CFG for a for statement.
+     */
+    private buildForCFG;
+    /**
+     * Build CFG for a for-in or for-of statement.
+     */
+    private buildForInOfCFG;
+    /**
+     * Build CFG for a while statement.
+     */
+    private buildWhileCFG;
+    /**
+     * Build CFG for a do-while statement.
+     */
+    private buildDoWhileCFG;
+    /**
+     * Build CFG for a switch statement.
+     */
+    private buildSwitchCFG;
+    /**
+     * Build CFG for a try statement.
+     */
+    private buildTryCFG;
+    /**
+     * Build CFG for a return statement.
+     */
+    private buildReturnCFG;
+    /**
+     * Build CFG for a throw statement.
+     */
+    private buildThrowCFG;
+    /**
+     * Build CFG for a break statement.
+     */
+    private buildBreakCFG;
+    /**
+     * Build CFG for a continue statement.
+     */
+    private buildContinueCFG;
+    /**
+     * Build CFG for a regular statement.
+     */
+    private buildStatementCFG;
+    /**
+     * Analyze data flow in an AST.
+     */
+    private analyzeDataFlow;
+    /**
+     * Traverse AST for data flow information.
+     */
+    private traverseForDataFlow;
+    /**
+     * Detect potential null/undefined dereferences.
+     */
+    private detectNullDereferences;
+    /**
+     * Check if an expression is potentially null/undefined.
+     */
+    private isPotentiallyNull;
+    /**
+     * Mark all reachable nodes starting from entry.
+     */
+    private markReachableNodes;
+    /**
+     * Detect unreachable code.
+     */
+    private detectUnreachableCode;
+    /**
+     * Check for infinite loops.
+     */
+    private checkInfiniteLoop;
+    /**
+     * Check for missing return statements.
+     */
+    private checkMissingReturns;
+    /**
+     * Find the condition expression in a loop/if.
+     */
+    private findCondition;
+    /**
+     * Check if a node contains break or return.
+     */
+    private hasBreakOrReturn;
+    /**
+     * Reset analyzer state.
+     */
+    private reset;
+    /**
+     * Create a new CFG node.
+     */
+    private createNode;
+    /**
+     * Add an edge between two nodes.
+     */
+    private addEdge;
+    /**
+     * Create a flow context.
+     */
+    private createFlowContext;
+    /**
+     * Collect function parameters into context.
+     */
+    private collectFunctionParameters;
+    /**
+     * Collect variable declarations into context.
+     */
+    private collectVariableDeclarations;
+    /**
+     * Get parameter name from a parameter node.
+     */
+    private getParameterName;
+    /**
+     * Find a child node by type.
+     */
+    private findChildByType;
+    /**
+     * Check if a node is a statement.
+     */
+    private isStatement;
+    /**
+     * Get the parent context for an identifier (read or write).
+     */
+    private getParentContext;
+    /**
+     * Find a variable in parent contexts.
+     */
+    private findVariableInParentContext;
+    /**
+     * Build the final result.
+     */
+    private buildResult;
+    /**
+     * Get all nodes in the CFG.
+     */
+    getNodes(): ControlFlowNode[];
+    /**
+     * Get all edges in the CFG.
+     */
+    getEdges(): ControlFlowEdge[];
+    /**
+     * Check if a node is reachable.
+     */
+    isNodeReachable(nodeId: string): boolean;
+    /**
+     * Get predecessors of a node.
+     */
+    getPredecessors(nodeId: string): string[];
+    /**
+     * Get successors of a node.
+     */
+    getSuccessors(nodeId: string): string[];
+}
+//# sourceMappingURL=flow-analyzer.d.ts.map

package/dist/analyzers/flow-analyzer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"flow-analyzer.d.ts","sourceRoot":"","sources":["../../src/analyzers/flow-analyzer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,KAAK,EACV,kBAAkB,EAElB,eAAe,EACf,eAAe,EAKhB,MAAM,YAAY,CAAC;AAEpB;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC,yCAAyC;IACzC,iBAAiB,CAAC,EAAE,OAAO,CAAC;IAE5B,uCAAuC;IACvC,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAE9B,kDAAkD;IAClD,oBAAoB,CAAC,EAAE,OAAO,CAAC;IAE/B,oDAAoD;IACpD,sBAAsB,CAAC,EAAE,OAAO,CAAC;IAEjC,yCAAyC;IACzC,qBAAqB,CAAC,EAAE,OAAO,CAAC;IAEhC,qDAAqD;IACrD,wBAAwB,CAAC,EAAE,OAAO,CAAC;IAEnC,iCAAiC;IACjC,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAuDD;;;;;;;GAOG;AACH,qBAAa,YAAY;IACvB,6CAA6C;IAC7C,OAAO,CAAC,aAAa,CAAK;IAE1B,wCAAwC;IACxC,OAAO,CAAC,KAAK,CAA2C;IAExD,wCAAwC;IACxC,OAAO,CAAC,KAAK,CAAyB;IAEtC,oBAAoB;IACpB,OAAO,CAAC,WAAW,CAAuB;IAE1C,oBAAoB;IACpB,OAAO,CAAC,WAAW,CAA0B;IAE7C,iCAAiC;IACjC,OAAO,CAAC,eAAe,CAAwB;IAE/C,8BAA8B;IAC9B,OAAO,CAAC,aAAa,CAAwB;IAE7C,+BAA+B;IAC/B,OAAO,CAAC,cAAc,CAAwB;IAE9C,+BAA+B;IAC/B,OAAO,CAAC,OAAO,CAA2B;IAE1C;;;;;;OAMG;IACH,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,OAAO,GAAE,mBAAwB,GAAG,kBAAkB;IAoDxE;;;;;;OAMG;IACH,eAAe,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,GAAE,mBAAwB,GAAG,kBAAkB;IA4ErF;;;OAGG;IACH,OAAO,CAAC,QAAQ;IA6EhB;;OAEG;IACH,OAAO,CAAC,aAAa;IAqBrB;;OAEG;IACH,OAAO,CAAC,UAAU;IA2DlB;;OAEG;IACH,OAAO,CAAC,WAAW;IAyDnB;;OAEG;IACH,OAAO,CAAC,eAAe;IA6CvB;;OAEG;IACH,OAAO,CAAC,aAAa;IAiDrB;;OAEG;IACH,OAAO,CAAC,eAAe;IA8CvB;;OAEG;IACH,OAAO,CAAC,cAAc;IAsEtB;;OAEG;IACH,OAAO,CAAC,WAAW;IAgEnB;;OAEG;IACH,OAAO,CAAC,cAAc;IAuBtB;;OAEG;IACH,OAAO,CAAC,aAAa;IAmBrB;;OAEG;IACH,OAAO,CAAC,aAAa;IAwBrB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAuBxB;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAwBzB;;OAEG;IACH,OAAO,CAAC,eAAe;IA6CvB;;OAEG;IACH,OAAO,CAAC,mBAAmB;IA4F3B;;OAEG;IACH,OAAO,CAAC,sBAAsB;IA6B9B;;OAEG;IACH,OAAO,CAAC,iBAAiB;IA4BzB;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAuB1B;;OAEG;IACH,OAAO,CAAC,qBAAqB;IAS7B;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAoBzB;;OAEG;IACH,OAAO,CAAC,mBAAmB;IA0B3B;;OAEG;IACH,OAAO,CAAC,aAAa;IAWrB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAmBxB;;OAEG;IACH,OAAO,CAAC,KAAK;IAYb;;OAEG;IACH,OAAO,CAAC,UAAU;IAqBlB;;OAEG;IACH,OAAO,CAAC,OAAO;IAyBf;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAYzB;;OAEG;IACH,OAAO,CAAC,yBAAyB;IAuBjC;;OAEG;IACH,OAAO,CAAC,2BAA2B;IAiCnC;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAmBxB;;OAEG;IACH,OAAO,CAAC,eAAe;IASvB;;OAEG;IACH,OAAO,CAAC,WAAW;IAoBnB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAMxB;;OAEG;IACH,OAAO,CAAC,2BAA2B;IAiBnC;;OAEG;IACH,OAAO,CAAC,WAAW;IAmDnB;;OAEG;IACH,QAAQ,IAAI,eAAe,EAAE;IAiB7B;;OAEG;IACH,QAAQ,IAAI,eAAe,EAAE;IAI7B;;OAEG;IACH,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAKxC;;OAEG;IACH,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE;IAKzC;;OAEG;IACH,aAAa,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE;CAIxC"}