circle-ir 3.9.7 → 3.9.10

package/dist/core/circle-ir-core.cjs

@@ -10591,7 +10591,8 @@ function findSinks(calls, patterns) {
             cwe: pattern.cwe,
             location,
             line: call.location.line,
-            confidence
+            confidence,
+            method: call.method_name
           });
         }
       }

package/dist/core/circle-ir-core.js

@@ -10526,7 +10526,8 @@ function findSinks(calls, patterns) {
             cwe: pattern.cwe,
             location,
             line: call.location.line,
-            confidence
+            confidence,
+            method: call.method_name
           });
         }
       }

package/dist/graph/dominator-graph.d.ts

@@ -0,0 +1,53 @@
+/**
+ * DominatorGraph
+ *
+ * Computes the dominator tree for a control-flow graph using the
+ * Cooper et al. "A Simple, Fast Dominance Algorithm" (2001).
+ *
+ * Chosen over Lengauer-Tarjan because typical intra-procedural CFGs have
+ * fewer than 100 blocks — O(n²) worst-case is negligible and the algorithm
+ * is straightforward to verify correct.
+ *
+ * Reference:
+ *   Cooper, K.D., Harvey, T.J., Kennedy, K. (2001). "A Simple, Fast Dominance
+ *   Algorithm". Software Practice & Experience, 4, 1–10.
+ *
+ * Design invariants:
+ * - No Node.js-specific APIs. Browser + Node.js + Cloudflare Workers safe.
+ * - Does not mutate the input CFG.
+ * - Unreachable blocks are excluded from all dominator queries.
+ */
+import type { CFG } from '../types/index.js';
+/**
+ * Dominator tree for a CFG, computed with the Cooper et al. algorithm.
+ *
+ * Entry blocks have no immediate dominator (immediateDominator returns null).
+ * Only blocks reachable from the entry are included.
+ */
+export declare class DominatorGraph {
+    private readonly idom;
+    private readonly rpoIndex;
+    private readonly entryId;
+    /** Cached reverse map: blockId → all blockIds it strictly dominates. */
+    private _dominated;
+    constructor(cfg: CFG, entryId?: number);
+    /**
+     * Returns true if block `a` dominates block `b`.
+     * A block dominates itself (reflexive).
+     */
+    dominates(a: number, b: number): boolean;
+    /**
+     * Returns true if block `a` strictly dominates block `b` (a ≠ b and a dom b).
+     */
+    strictlyDominates(a: number, b: number): boolean;
+    /**
+     * Returns the immediate dominator of `blockId`, or null for the entry block
+     * (or any block not in the dominator tree).
+     */
+    immediateDominator(blockId: number): number | null;
+    /**
+     * Returns all block IDs strictly dominated by `blockId`.
+     * (Computed lazily and cached on first call.)
+     */
+    dominated(blockId: number): number[];
+}

package/dist/graph/dominator-graph.js

@@ -0,0 +1,256 @@
+/**
+ * DominatorGraph
+ *
+ * Computes the dominator tree for a control-flow graph using the
+ * Cooper et al. "A Simple, Fast Dominance Algorithm" (2001).
+ *
+ * Chosen over Lengauer-Tarjan because typical intra-procedural CFGs have
+ * fewer than 100 blocks — O(n²) worst-case is negligible and the algorithm
+ * is straightforward to verify correct.
+ *
+ * Reference:
+ *   Cooper, K.D., Harvey, T.J., Kennedy, K. (2001). "A Simple, Fast Dominance
+ *   Algorithm". Software Practice & Experience, 4, 1–10.
+ *
+ * Design invariants:
+ * - No Node.js-specific APIs. Browser + Node.js + Cloudflare Workers safe.
+ * - Does not mutate the input CFG.
+ * - Unreachable blocks are excluded from all dominator queries.
+ */
+// ---------------------------------------------------------------------------
+// Internal helpers
+// ---------------------------------------------------------------------------
+/**
+ * Compute Reverse Post-Order starting from `entryId`.
+ * Returns the RPO traversal order and a map from blockId → RPO position.
+ * Blocks unreachable from `entryId` are excluded.
+ */
+function computeRPO(cfg, entryId) {
+    // Build outgoing adjacency
+    const outgoing = new Map();
+    for (const edge of cfg.edges) {
+        const list = outgoing.get(edge.from) ?? [];
+        list.push(edge.to);
+        outgoing.set(edge.from, list);
+    }
+    // Iterative DFS to compute post-order, then reverse
+    const visited = new Set();
+    const postOrder = [];
+    const stack = [{ id: entryId, childIndex: 0 }];
+    visited.add(entryId);
+    while (stack.length > 0) {
+        const top = stack[stack.length - 1];
+        const children = outgoing.get(top.id) ?? [];
+        // Find next unvisited child
+        let pushed = false;
+        while (top.childIndex < children.length) {
+            const child = children[top.childIndex++];
+            if (!visited.has(child)) {
+                visited.add(child);
+                stack.push({ id: child, childIndex: 0 });
+                pushed = true;
+                break;
+            }
+        }
+        if (!pushed) {
+            // All children visited — add to post-order
+            postOrder.push(top.id);
+            stack.pop();
+        }
+    }
+    const rpoOrder = postOrder.reverse();
+    const rpoIndex = new Map();
+    for (let i = 0; i < rpoOrder.length; i++) {
+        rpoIndex.set(rpoOrder[i], i);
+    }
+    return { rpoOrder, rpoIndex };
+}
+/**
+ * Cooper et al. intersect function.
+ * Walks up the idom tree from b1 and b2 until a common ancestor is found.
+ * Uses RPO positions for comparisons (smaller RPO index = earlier in RPO = closer to entry).
+ *
+ * IMPORTANT: The entry block must have idom[entry] = entry (self-loop sentinel)
+ * so the walk terminates. This sentinel is removed from the public idom map after
+ * computation, but must be present during computation.
+ */
+function intersect(b1, b2, idom, rpoIndex) {
+    let finger1 = b1;
+    let finger2 = b2;
+    while (finger1 !== finger2) {
+        // Walk finger1 up while its RPO position is deeper (larger index) than finger2
+        while ((rpoIndex.get(finger1) ?? Number.MAX_SAFE_INTEGER) >
+            (rpoIndex.get(finger2) ?? Number.MAX_SAFE_INTEGER)) {
+            const parent = idom.get(finger1);
+            if (parent === undefined || parent === finger1)
+                break; // at root or self-loop
+            finger1 = parent;
+        }
+        // Walk finger2 up while its RPO position is deeper than finger1
+        while ((rpoIndex.get(finger2) ?? Number.MAX_SAFE_INTEGER) >
+            (rpoIndex.get(finger1) ?? Number.MAX_SAFE_INTEGER)) {
+            const parent = idom.get(finger2);
+            if (parent === undefined || parent === finger2)
+                break; // at root or self-loop
+            finger2 = parent;
+        }
+        // If neither changed (both at root or unreachable), break
+        if (finger1 === finger2)
+            break;
+        // Safety: if both are at positions we can't walk further, break
+        const rpo1 = rpoIndex.get(finger1) ?? Number.MAX_SAFE_INTEGER;
+        const rpo2 = rpoIndex.get(finger2) ?? Number.MAX_SAFE_INTEGER;
+        if (rpo1 === rpo2 && finger1 !== finger2)
+            break; // can't converge further
+    }
+    return finger1;
+}
+/**
+ * Cooper et al. iterative idom computation.
+ * Requires rpoOrder and rpoIndex from computeRPO.
+ * Returns a map: blockId → immediate dominator blockId.
+ * Entry block has idom[entry] = entry (sentinel) during computation;
+ * callers remove this after the function returns.
+ */
+function computeIdom(cfg, rpoOrder, rpoIndex, entryId) {
+    // Build incoming adjacency
+    const incoming = new Map();
+    for (const edge of cfg.edges) {
+        const list = incoming.get(edge.to) ?? [];
+        list.push(edge.from);
+        incoming.set(edge.to, list);
+    }
+    const idom = new Map();
+    // Initialise: entry block idom = itself (sentinel for termination)
+    idom.set(entryId, entryId);
+    // Iterate until stable
+    let changed = true;
+    while (changed) {
+        changed = false;
+        // Process in RPO order, skip entry (index 0)
+        for (let i = 1; i < rpoOrder.length; i++) {
+            const b = rpoOrder[i];
+            const preds = incoming.get(b) ?? [];
+            // Pick the first predecessor that already has an idom computed
+            // (i.e., already processed in RPO order)
+            let newIdom;
+            for (const p of preds) {
+                if (idom.has(p)) {
+                    newIdom = p;
+                    break;
+                }
+            }
+            if (newIdom === undefined)
+                continue;
+            // Intersect with all other processed predecessors
+            for (const p of preds) {
+                if (p === newIdom)
+                    continue;
+                if (idom.has(p)) {
+                    newIdom = intersect(p, newIdom, idom, rpoIndex);
+                }
+            }
+            if (idom.get(b) !== newIdom) {
+                idom.set(b, newIdom);
+                changed = true;
+            }
+        }
+    }
+    return idom;
+}
+// ---------------------------------------------------------------------------
+// Public class
+// ---------------------------------------------------------------------------
+/**
+ * Dominator tree for a CFG, computed with the Cooper et al. algorithm.
+ *
+ * Entry blocks have no immediate dominator (immediateDominator returns null).
+ * Only blocks reachable from the entry are included.
+ */
+export class DominatorGraph {
+    idom;
+    rpoIndex;
+    entryId;
+    /** Cached reverse map: blockId → all blockIds it strictly dominates. */
+    _dominated = null;
+    constructor(cfg, entryId) {
+        if (cfg.blocks.length === 0) {
+            this.entryId = entryId ?? 0;
+            this.idom = new Map();
+            this.rpoIndex = new Map();
+            return;
+        }
+        // Determine entry: prefer provided entryId, then type='entry' block,
+        // then the block with the smallest id.
+        this.entryId =
+            entryId ??
+                cfg.blocks.find(b => b.type === 'entry')?.id ??
+                cfg.blocks.reduce((a, b) => (a.id < b.id ? a : b)).id;
+        const { rpoOrder, rpoIndex } = computeRPO(cfg, this.entryId);
+        this.rpoIndex = rpoIndex;
+        this.idom = computeIdom(cfg, rpoOrder, rpoIndex, this.entryId);
+        // Remove the sentinel self-reference for the entry block
+        // so immediateDominator(entryId) returns null
+        this.idom.delete(this.entryId);
+    }
+    /**
+     * Returns true if block `a` dominates block `b`.
+     * A block dominates itself (reflexive).
+     */
+    dominates(a, b) {
+        if (a === b)
+            return true;
+        return this.strictlyDominates(a, b);
+    }
+    /**
+     * Returns true if block `a` strictly dominates block `b` (a ≠ b and a dom b).
+     */
+    strictlyDominates(a, b) {
+        if (a === b)
+            return false;
+        // Walk up the idom chain from b; if we reach a, then a dom b.
+        const visited = new Set();
+        let cur = this.idom.get(b);
+        while (cur !== undefined && !visited.has(cur)) {
+            if (cur === a)
+                return true;
+            visited.add(cur);
+            cur = this.idom.get(cur);
+        }
+        return false;
+    }
+    /**
+     * Returns the immediate dominator of `blockId`, or null for the entry block
+     * (or any block not in the dominator tree).
+     */
+    immediateDominator(blockId) {
+        return this.idom.get(blockId) ?? null;
+    }
+    /**
+     * Returns all block IDs strictly dominated by `blockId`.
+     * (Computed lazily and cached on first call.)
+     */
+    dominated(blockId) {
+        if (!this._dominated) {
+            this._dominated = new Map();
+            for (const [child, parent] of this.idom.entries()) {
+                // Walk up from child to find all ancestors (blocks that dominate child)
+                const ancestors = [];
+                const seen = new Set();
+                let cur = parent;
+                while (cur !== undefined && !seen.has(cur)) {
+                    seen.add(cur);
+                    ancestors.push(cur);
+                    cur = this.idom.get(cur);
+                }
+                for (const anc of ancestors) {
+                    const list = this._dominated.get(anc) ?? [];
+                    list.push(child);
+                    this._dominated.set(anc, list);
+                }
+            }
+        }
+        return this._dominated.get(blockId) ?? [];
+    }
+}
+//# sourceMappingURL=dominator-graph.js.map

package/dist/graph/dominator-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dominator-graph.js","sourceRoot":"","sources":["../../src/graph/dominator-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAIH,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAE9E;;;;GAIG;AACH,SAAS,UAAU,CACjB,GAAQ,EACR,OAAe;IAEf,2BAA2B;IAC3B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC3C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,oDAAoD;IACpD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,MAAM,KAAK,GAA8C,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;IAC1F,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAErB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACpC,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAE5C,4BAA4B;QAC5B,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,OAAO,GAAG,CAAC,UAAU,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;YACxC,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC;YACzC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACnB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;gBACzC,MAAM,GAAG,IAAI,CAAC;gBACd,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,2CAA2C;YAC3C,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACvB,KAAK,CAAC,GAAG,EAAE,CAAC;QACd,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC;IACrC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/B,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;AAChC,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,SAAS,CAChB,EAAU,EACV,EAAU,EACV,IAAyB,EACzB,QAA6B;IAE7B,IAAI,OAAO,GAAG,EAAE,CAAC;IACjB,IAAI,OAAO,GAAG,EAAE,CAAC;IAEjB,OAAO,OAAO,KAAK,OAAO,EAAE,CAAC;QAC3B,+EAA+E;QAC/E,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,gBAAgB,CAAC;YAClD,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,gBAAgB,CAAC,EAAE,CAAC;YAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACjC,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,OAAO;gBAAE,MAAM,CAAC,uBAAuB;YAC9E,OAAO,GAAG,MAAM,CAAC;QACnB,CAAC;QAED,gEAAgE;QAChE,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,gBAAgB,CAAC;YAClD,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,gBAAgB,CAAC,EAAE,CAAC;YAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACjC,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,OAAO;gBAAE,MAAM,CAAC,uBAAuB;YAC9E,OAAO,GAAG,MAAM,CAAC;QACnB,CAAC;QAED,0DAA0D;QAC1D,IAAI,OAAO,KAAK,OAAO;YAAE,MAAM;QAC/B,gEAAgE;QAChE,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,gBAAgB,CAAC;QAC9D,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,gBAAgB,CAAC;QAC9D,IAAI,IAAI,KAAK,IAAI,IAAI,OAAO,KAAK,OAAO;YAAE,MAAM,CAAC,yBAAyB;IAC5E,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,WAAW,CAClB,GAAQ,EACR,QAAkB,EAClB,QAA6B,EAC7B,OAAe;IAEf,2BAA2B;IAC3B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QACzC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEvC,mEAAmE;IACnE,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAE3B,uBAAuB;IACvB,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,OAAO,OAAO,EAAE,CAAC;QACf,OAAO,GAAG,KAAK,CAAC;QAEhB,6CAA6C;QAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAEpC,+DAA+D;YAC/D,yCAAyC;YACzC,IAAI,OAA2B,CAAC;YAChC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChB,OAAO,GAAG,CAAC,CAAC;oBACZ,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,OAAO,KAAK,SAAS;gBAAE,SAAS;YAEpC,kDAAkD;YAClD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,CAAC,KAAK,OAAO;oBAAE,SAAS;gBAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChB,OAAO,GAAG,SAAS,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAClD,CAAC;YACH,CAAC;YAED,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,OAAO,EAAE,CAAC;gBAC5B,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;gBACrB,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E;;;;;GAKG;AACH,MAAM,OAAO,cAAc;IACR,IAAI,CAAsB;IAC1B,QAAQ,CAAsB;IAC9B,OAAO,CAAS;IACjC,wEAAwE;IAChE,UAAU,GAAiC,IAAI,CAAC;IAExD,YAAY,GAAQ,EAAE,OAAgB;QACpC,IAAI,GAAG,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,OAAO,GAAG,OAAO,IAAI,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;YACtB,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;YAC1B,OAAO;QACT,CAAC;QAED,qEAAqE;QACrE,uCAAuC;QACvC,IAAI,CAAC,OAAO;YACV,OAAO;gBACP,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,EAAE,EAAE;gBAC5C,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAExD,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAC7D,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,IAAI,GAAG,WAAW,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAE/D,yDAAyD;QACzD,8CAA8C;QAC9C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACjC,CAAC;IAED;;;OAGG;IACH,SAAS,CAAC,CAAS,EAAE,CAAS;QAC5B,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACzB,OAAO,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,iBAAiB,CAAC,CAAS,EAAE,CAAS;QACpC,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAC1B,8DAA8D;QAC9D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,IAAI,GAAG,GAAuB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/C,OAAO,GAAG,KAAK,SAAS,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC9C,IAAI,GAAG,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC3B,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,kBAAkB,CAAC,OAAe;QAChC,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC;IACxC,CAAC;IAED;;;OAGG;IACH,SAAS,CAAC,OAAe;QACvB,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YACrB,IAAI,CAAC,UAAU,GAAG,IAAI,GAAG,EAAE,CAAC;YAC5B,KAAK,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;gBAClD,wEAAwE;gBACxE,MAAM,SAAS,GAAa,EAAE,CAAC;gBAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;gBAC/B,IAAI,GAAG,GAAuB,MAAM,CAAC;gBACrC,OAAO,GAAG,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC3C,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACd,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACpB,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC3B,CAAC;gBACD,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;oBAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;oBAC5C,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACjB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBACjC,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;IAC5C,CAAC;CACF"}

package/dist/graph/exception-flow-graph.d.ts

@@ -0,0 +1,44 @@
+/**
+ * ExceptionFlowGraph — lightweight wrapper over CFG exception edges.
+ *
+ * The CFG builder emits edges with `type === 'exception'` connecting the
+ * first block of a try body (`from`) to the first block of the corresponding
+ * catch handler (`to`).  This class indexes those edges so exception-aware
+ * passes can query try/catch structure without re-scanning the edge list.
+ */
+import type { CFG, CFGBlock } from '../types/index.js';
+export interface TryCatchInfo {
+    tryEntryId: number;
+    catchEntryId: number;
+    /** First block of the try body. */
+    tryBlock: CFGBlock;
+    /** First block of the catch handler. */
+    catchBlock: CFGBlock;
+}
+export declare class ExceptionFlowGraph {
+    /** All try/catch pairs found in the CFG. */
+    readonly pairs: TryCatchInfo[];
+    /** Block IDs that are catch-handler entry blocks. */
+    readonly catchEntryIds: Set<number>;
+    /** Block IDs that are try-body entry blocks. */
+    readonly tryEntryIds: Set<number>;
+    private readonly tryCatchMap;
+    private readonly catchTryMap;
+    constructor(cfg: CFG, blockById: Map<number, CFGBlock>);
+    /** True if at least one try/catch pair was found. */
+    get hasTryCatch(): boolean;
+    /** True if the given block ID is a catch-handler entry block. */
+    isCatchEntry(blockId: number): boolean;
+    /** True if the given block ID is a try-body entry block. */
+    isTryEntry(blockId: number): boolean;
+    /**
+     * Returns the catch-entry block IDs for the given try-entry block.
+     * Multiple values mean multiple catch clauses for the same try.
+     */
+    catchBlocksFor(tryEntryId: number): number[];
+    /**
+     * Returns the try-entry block ID corresponding to a catch-entry block,
+     * or `undefined` if the block is not a catch entry.
+     */
+    tryBlockFor(catchEntryId: number): number | undefined;
+}

package/dist/graph/exception-flow-graph.js

@@ -0,0 +1,75 @@
+/**
+ * ExceptionFlowGraph — lightweight wrapper over CFG exception edges.
+ *
+ * The CFG builder emits edges with `type === 'exception'` connecting the
+ * first block of a try body (`from`) to the first block of the corresponding
+ * catch handler (`to`).  This class indexes those edges so exception-aware
+ * passes can query try/catch structure without re-scanning the edge list.
+ */
+// ---------------------------------------------------------------------------
+// ExceptionFlowGraph
+// ---------------------------------------------------------------------------
+export class ExceptionFlowGraph {
+    /** All try/catch pairs found in the CFG. */
+    pairs;
+    /** Block IDs that are catch-handler entry blocks. */
+    catchEntryIds;
+    /** Block IDs that are try-body entry blocks. */
+    tryEntryIds;
+    tryCatchMap; // tryEntryId → [catchEntryId, …]
+    catchTryMap; // catchEntryId → tryEntryId
+    constructor(cfg, blockById) {
+        this.pairs = [];
+        this.catchEntryIds = new Set();
+        this.tryEntryIds = new Set();
+        this.tryCatchMap = new Map();
+        this.catchTryMap = new Map();
+        for (const edge of cfg.edges) {
+            if (edge.type !== 'exception')
+                continue;
+            const tryBlock = blockById.get(edge.from);
+            const catchBlock = blockById.get(edge.to);
+            if (!tryBlock || !catchBlock)
+                continue;
+            this.tryEntryIds.add(edge.from);
+            this.catchEntryIds.add(edge.to);
+            const catches = this.tryCatchMap.get(edge.from) ?? [];
+            catches.push(edge.to);
+            this.tryCatchMap.set(edge.from, catches);
+            this.catchTryMap.set(edge.to, edge.from);
+            this.pairs.push({
+                tryEntryId: edge.from,
+                catchEntryId: edge.to,
+                tryBlock,
+                catchBlock,
+            });
+        }
+    }
+    /** True if at least one try/catch pair was found. */
+    get hasTryCatch() {
+        return this.pairs.length > 0;
+    }
+    /** True if the given block ID is a catch-handler entry block. */
+    isCatchEntry(blockId) {
+        return this.catchEntryIds.has(blockId);
+    }
+    /** True if the given block ID is a try-body entry block. */
+    isTryEntry(blockId) {
+        return this.tryEntryIds.has(blockId);
+    }
+    /**
+     * Returns the catch-entry block IDs for the given try-entry block.
+     * Multiple values mean multiple catch clauses for the same try.
+     */
+    catchBlocksFor(tryEntryId) {
+        return this.tryCatchMap.get(tryEntryId) ?? [];
+    }
+    /**
+     * Returns the try-entry block ID corresponding to a catch-entry block,
+     * or `undefined` if the block is not a catch entry.
+     */
+    tryBlockFor(catchEntryId) {
+        return this.catchTryMap.get(catchEntryId);
+    }
+}
+//# sourceMappingURL=exception-flow-graph.js.map

package/dist/graph/exception-flow-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"exception-flow-graph.js","sourceRoot":"","sources":["../../src/graph/exception-flow-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAiBH,8EAA8E;AAC9E,qBAAqB;AACrB,8EAA8E;AAE9E,MAAM,OAAO,kBAAkB;IAC7B,4CAA4C;IACnC,KAAK,CAAiB;IAE/B,qDAAqD;IAC5C,aAAa,CAAc;IAEpC,gDAAgD;IACvC,WAAW,CAAc;IAEjB,WAAW,CAAwB,CAAC,iCAAiC;IACrE,WAAW,CAAsB,CAAG,4BAA4B;IAEjF,YAAY,GAAQ,EAAE,SAAgC;QACpD,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,aAAa,GAAG,IAAI,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;QAE7B,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;YAC7B,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW;gBAAE,SAAS;YAExC,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1C,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC1C,IAAI,CAAC,QAAQ,IAAI,CAAC,UAAU;gBAAE,SAAS;YAEvC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAEhC,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACtD,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACtB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YAEzC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YAEzC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;gBACd,UAAU,EAAE,IAAI,CAAC,IAAI;gBACrB,YAAY,EAAE,IAAI,CAAC,EAAE;gBACrB,QAAQ;gBACR,UAAU;aACX,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,qDAAqD;IACrD,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAC/B,CAAC;IAED,iEAAiE;IACjE,YAAY,CAAC,OAAe;QAC1B,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACzC,CAAC;IAED,4DAA4D;IAC5D,UAAU,CAAC,OAAe;QACxB,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACvC,CAAC;IAED;;;OAGG;IACH,cAAc,CAAC,UAAkB;QAC/B,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;IAChD,CAAC;IAED;;;OAGG;IACH,WAAW,CAAC,YAAoB;QAC9B,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IAC5C,CAAC;CACF"}

package/dist/graph/index.d.ts

@@ -1,4 +1,6 @@
 export { CodeGraph } from './code-graph.js';
 export { ProjectGraph } from './project-graph.js';
 export { ImportGraph } from './import-graph.js';
+export { DominatorGraph } from './dominator-graph.js';
+export { ExceptionFlowGraph, type TryCatchInfo } from './exception-flow-graph.js';
 export { AnalysisPipeline, type AnalysisPass, type PassContext, type PipelineRunResult, } from './analysis-pass.js';

package/dist/graph/index.js

@@ -1,5 +1,7 @@
 export { CodeGraph } from './code-graph.js';
 export { ProjectGraph } from './project-graph.js';
 export { ImportGraph } from './import-graph.js';
+export { DominatorGraph } from './dominator-graph.js';
+export { ExceptionFlowGraph } from './exception-flow-graph.js';
 export { AnalysisPipeline, } from './analysis-pass.js';
 //# sourceMappingURL=index.js.map

package/dist/graph/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAC5C,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EACL,gBAAgB,GAIjB,MAAM,oBAAoB,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAC5C,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,EAAE,kBAAkB,EAAqB,MAAM,2BAA2B,CAAC;AAClF,OAAO,EACL,gBAAgB,GAIjB,MAAM,oBAAoB,CAAC"}

package/dist/index.d.ts

@@ -10,6 +10,8 @@ export { initParser, parse, walkTree, findNodes, findAncestor, getNodeText, coll
 export { extractMeta, extractTypes, extractCalls, extractImports, extractExports, buildCFG, buildDFG, } from './core/index.js';
 export { getDefaultConfig, createTaintConfig, analyzeTaint, detectUnresolved, propagateTaint, generateFindings, analyzeConstantPropagation, ConstantPropagator, isKnown, createUnknown, getNodeLine, DEFAULT_SOURCES, DEFAULT_SINKS, DEFAULT_SANITIZERS, type ConstantValue, type ConstantPropagatorResult, type TaintPropagationResult, type TaintedVariable, type TaintFlow, } from './analysis/index.js';
 export { getRuleInfo, RULE_DEFINITIONS, type RuleInfo, } from './analysis/rules.js';
+export { DominatorGraph } from './graph/dominator-graph.js';
+export { ExceptionFlowGraph, type TryCatchInfo } from './graph/exception-flow-graph.js';
 export { TypeHierarchyResolver, createWithJdkTypes, SymbolTable, buildSymbolTable, CrossFileResolver, buildCrossFileResolver, } from './resolution/index.js';
 export { getLanguageRegistry, registerLanguage, getLanguagePlugin, getLanguageForFile, detectLanguage, isLanguageSupported, registerBuiltinPlugins, JavaPlugin, JavaScriptPlugin, PythonPlugin, RustPlugin, BaseLanguagePlugin, } from './languages/index.js';
 export type { LanguagePlugin, LanguageRegistry, LanguageNodeTypes, ExtractionContext, FrameworkInfo, TaintSourcePattern, TaintSinkPattern, } from './languages/index.js';

package/dist/index.js

@@ -13,6 +13,9 @@ export { extractMeta, extractTypes, extractCalls, extractImports, extractExports
 export { getDefaultConfig, createTaintConfig, analyzeTaint, detectUnresolved, propagateTaint, generateFindings, analyzeConstantPropagation, ConstantPropagator, isKnown, createUnknown, getNodeLine, DEFAULT_SOURCES, DEFAULT_SINKS, DEFAULT_SANITIZERS, } from './analysis/index.js';
 // Rule definitions
 export { getRuleInfo, RULE_DEFINITIONS, } from './analysis/rules.js';
+// Graph utilities
+export { DominatorGraph } from './graph/dominator-graph.js';
+export { ExceptionFlowGraph } from './graph/exception-flow-graph.js';
 // Resolution utilities
 export { TypeHierarchyResolver, createWithJdkTypes, SymbolTable, buildSymbolTable, CrossFileResolver, buildCrossFileResolver, } from './resolution/index.js';
 // Language plugins

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,gBAAgB;AAChB,OAAO,EACL,YAAY,EACZ,OAAO,EACP,aAAa,EACb,cAAc,EACd,qBAAqB,EACrB,aAAa,GAEd,MAAM,eAAe,CAAC;AAuEvB,sCAAsC;AACtC,OAAO,EACL,UAAU,EACV,KAAK,EACL,QAAQ,EACR,SAAS,EACT,YAAY,EACZ,WAAW,EACX,eAAe,GAMhB,MAAM,iBAAiB,CAAC;AAEzB,kBAAkB;AAClB,OAAO,EACL,WAAW,EACX,YAAY,EACZ,YAAY,EACZ,cAAc,EACd,cAAc,EACd,QAAQ,EACR,QAAQ,GACT,MAAM,iBAAiB,CAAC;AAEzB,qBAAqB;AACrB,OAAO,EACL,gBAAgB,EAChB,iBAAiB,EACjB,YAAY,EACZ,gBAAgB,EAChB,cAAc,EACd,gBAAgB,EAChB,0BAA0B,EAC1B,kBAAkB,EAClB,OAAO,EACP,aAAa,EACb,WAAW,EACX,eAAe,EACf,aAAa,EACb,kBAAkB,GAMnB,MAAM,qBAAqB,CAAC;AAE7B,mBAAmB;AACnB,OAAO,EACL,WAAW,EACX,gBAAgB,GAEjB,MAAM,qBAAqB,CAAC;AAE7B,uBAAuB;AACvB,OAAO,EACL,qBAAqB,EACrB,kBAAkB,EAClB,WAAW,EACX,gBAAgB,EAChB,iBAAiB,EACjB,sBAAsB,GACvB,MAAM,uBAAuB,CAAC;AAE/B,mBAAmB;AACnB,OAAO,EACL,mBAAmB,EACnB,gBAAgB,EAChB,iBAAiB,EACjB,kBAAkB,EAClB,cAAc,EACd,mBAAmB,EACnB,sBAAsB,EACtB,UAAU,EACV,gBAAgB,EAChB,YAAY,EACZ,UAAU,EACV,kBAAkB,GACnB,MAAM,sBAAsB,CAAC;AAY9B,gCAAgC;AAChC,OAAO,EACL,MAAM,EACN,SAAS,EACT,eAAe,EACf,WAAW,EACX,WAAW,GAIZ,MAAM,mBAAmB,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,gBAAgB;AAChB,OAAO,EACL,YAAY,EACZ,OAAO,EACP,aAAa,EACb,cAAc,EACd,qBAAqB,EACrB,aAAa,GAEd,MAAM,eAAe,CAAC;AAuEvB,sCAAsC;AACtC,OAAO,EACL,UAAU,EACV,KAAK,EACL,QAAQ,EACR,SAAS,EACT,YAAY,EACZ,WAAW,EACX,eAAe,GAMhB,MAAM,iBAAiB,CAAC;AAEzB,kBAAkB;AAClB,OAAO,EACL,WAAW,EACX,YAAY,EACZ,YAAY,EACZ,cAAc,EACd,cAAc,EACd,QAAQ,EACR,QAAQ,GACT,MAAM,iBAAiB,CAAC;AAEzB,qBAAqB;AACrB,OAAO,EACL,gBAAgB,EAChB,iBAAiB,EACjB,YAAY,EACZ,gBAAgB,EAChB,cAAc,EACd,gBAAgB,EAChB,0BAA0B,EAC1B,kBAAkB,EAClB,OAAO,EACP,aAAa,EACb,WAAW,EACX,eAAe,EACf,aAAa,EACb,kBAAkB,GAMnB,MAAM,qBAAqB,CAAC;AAE7B,mBAAmB;AACnB,OAAO,EACL,WAAW,EACX,gBAAgB,GAEjB,MAAM,qBAAqB,CAAC;AAE7B,kBAAkB;AAClB,OAAO,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAC5D,OAAO,EAAE,kBAAkB,EAAqB,MAAM,iCAAiC,CAAC;AAExF,uBAAuB;AACvB,OAAO,EACL,qBAAqB,EACrB,kBAAkB,EAClB,WAAW,EACX,gBAAgB,EAChB,iBAAiB,EACjB,sBAAsB,GACvB,MAAM,uBAAuB,CAAC;AAE/B,mBAAmB;AACnB,OAAO,EACL,mBAAmB,EACnB,gBAAgB,EAChB,iBAAiB,EACjB,kBAAkB,EAClB,cAAc,EACd,mBAAmB,EACnB,sBAAsB,EACtB,UAAU,EACV,gBAAgB,EAChB,YAAY,EACZ,UAAU,EACV,kBAAkB,GACnB,MAAM,sBAAsB,CAAC;AAY9B,gCAAgC;AAChC,OAAO,EACL,MAAM,EACN,SAAS,EACT,eAAe,EACf,WAAW,EACX,WAAW,GAIZ,MAAM,mBAAmB,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "circle-ir",
-  "version": "3.9.7",
+  "version": "3.9.10",
   "description": "High-performance Static Application Security Testing (SAST) library for detecting security vulnerabilities through taint analysis",
   "main": "dist/index.js",
   "module": "dist/index.js",