recon-generate 0.0.6 → 0.0.8

package/dist/pathsGenerator.js

@@ -0,0 +1,627 @@
+"use strict";
+/**
+ * Path Generator
+ *
+ * Generates minimal paths needed for 100% branch coverage.
+ * Output is optimized for LLM consumption.
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.runPaths = void 0;
+const child_process_1 = require("child_process");
+const fs = __importStar(require("fs/promises"));
+const path = __importStar(require("path"));
+const solc_typed_ast_1 = require("solc-typed-ast");
+const call_tree_builder_1 = require("./analyzer/call-tree-builder");
+const utils_1 = require("./utils");
+// Contracts to skip (test helpers)
+const SKIP_CONTRACTS = new Set(['IHevm', 'Vm', 'StdChains', 'StdCheatsSafe', 'StdCheats']);
+// ==================== Helpers ====================
+const runCmd = (cmd, cwd) => {
+    return new Promise((resolve, reject) => {
+        (0, child_process_1.exec)(cmd, { cwd, env: { ...process.env, PATH: (0, utils_1.getEnvPath)() } }, (err, _stdout, stderr) => {
+            if (err) {
+                reject(new Error(stderr || err.message));
+            }
+            else {
+                resolve();
+            }
+        });
+    });
+};
+const loadLatestSourceUnits = async (foundryRoot) => {
+    var _a;
+    const outDir = path.join(foundryRoot, '.recon', 'out');
+    const buildInfoDir = path.join(outDir, 'build-info');
+    let files = [];
+    try {
+        const entries = await fs.readdir(buildInfoDir);
+        const jsonFiles = entries.filter((f) => f.endsWith('.json'));
+        files = await Promise.all(jsonFiles.map(async (f) => ({
+            name: f,
+            path: path.join(buildInfoDir, f),
+            mtime: (await fs.stat(path.join(buildInfoDir, f))).mtime,
+        })));
+    }
+    catch (e) {
+        throw new Error(`No build-info directory found at ${buildInfoDir}: ${e}`);
+    }
+    if (files.length === 0) {
+        throw new Error(`No build-info JSON files found in ${buildInfoDir}.`);
+    }
+    const latestFile = files.sort((a, b) => b.mtime.getTime() - a.mtime.getTime())[0].path;
+    const fileContent = await fs.readFile(latestFile, 'utf-8');
+    const buildInfo = JSON.parse(fileContent);
+    const buildOutput = (_a = buildInfo.output) !== null && _a !== void 0 ? _a : buildInfo;
+    if (!buildOutput) {
+        throw new Error(`Build-info file ${latestFile} is missing output data.`);
+    }
+    const filteredAstData = { ...buildOutput };
+    if (filteredAstData.sources) {
+        const validSources = {};
+        for (const [key, content] of Object.entries(filteredAstData.sources)) {
+            const ast = content.ast || content.legacyAST || content.AST;
+            if (ast && (ast.nodeType === 'SourceUnit' || ast.name === 'SourceUnit')) {
+                validSources[key] = content;
+            }
+        }
+        filteredAstData.sources = validSources;
+    }
+    const reader = new solc_typed_ast_1.ASTReader();
+    return reader.read(filteredAstData);
+};
+// ==================== Main Entry ====================
+const runPaths = async (foundryRoot, cryticName, suiteNameSnake) => {
+    const buildCmd = `forge build --contracts ${cryticName} --build-info --out .recon/out`.replace(/\s+/g, ' ').trim();
+    await runCmd(buildCmd, foundryRoot);
+    const sourceUnits = await loadLatestSourceUnits(foundryRoot);
+    if (!sourceUnits || sourceUnits.length === 0) {
+        throw new Error('No source units were produced from the Crytic build; cannot generate paths.');
+    }
+    // Find target contract
+    const targetContract = findContract(sourceUnits, cryticName);
+    if (!targetContract) {
+        throw new Error(`Contract ${cryticName} not found`);
+    }
+    // Get target functions (including inherited ones)
+    const allFunctions = (0, utils_1.getDefinitions)(targetContract, 'vFunctions');
+    const targetFunctions = allFunctions.filter(f => f.visibility === solc_typed_ast_1.FunctionVisibility.Public &&
+        f.implemented &&
+        !f.name.startsWith('_'));
+    // Process each function
+    const output = {};
+    let totalPaths = 0;
+    for (const func of targetFunctions) {
+        // Find external call
+        const externalCall = findExternalCall(func);
+        if (!externalCall)
+            continue;
+        // Build call tree for external function
+        const extFunc = findFunction(sourceUnits, externalCall.contract, externalCall.function);
+        if (!extFunc)
+            continue;
+        const extContract = findContract(sourceUnits, externalCall.contract);
+        if (!extContract)
+            continue;
+        // Build call tree context
+        const context = {
+            nodeCounter: { value: 0 },
+            contract: extContract,
+            callStack: [],
+            activeNodes: new Map()
+        };
+        const callTree = (0, call_tree_builder_1.buildCallTree)(extFunc, [], undefined, undefined, context);
+        // Build param mapping
+        const paramMapping = buildParamMapping(func, externalCall);
+        // Enumerate paths
+        const enumerator = new PathEnumerator(sourceUnits, paramMapping);
+        const paths = enumerator.enumerate(callTree);
+        if (paths.length === 0)
+            continue;
+        // Simple output - combined string
+        const simplified = simplifyPaths(paths);
+        // Skip if no real branches (only "true")
+        if (simplified.length === 1 && simplified[0] === 'true')
+            continue;
+        output[func.name] = simplified;
+        totalPaths += simplified.length;
+    }
+    const pathsName = suiteNameSnake ? `recon-${suiteNameSnake}-paths.json` : 'recon-paths.json';
+    const pathsFilePath = path.join(foundryRoot, pathsName);
+    await fs.writeFile(pathsFilePath, JSON.stringify(output, null, 2));
+    console.log(`[recon-generate] Wrote paths file to ${pathsFilePath}`);
+};
+exports.runPaths = runPaths;
+// ==================== Source Helpers ====================
+function findContract(units, name) {
+    for (const unit of units) {
+        for (const contract of unit.vContracts) {
+            if (contract.name === name)
+                return contract;
+        }
+    }
+    return null;
+}
+function findFunction(units, contractName, funcName) {
+    const contract = findContract(units, contractName);
+    if (!contract)
+        return null;
+    for (const func of contract.vFunctions) {
+        if (func.name === funcName && func.implemented)
+            return func;
+    }
+    // Check base contracts
+    for (const baseContract of contract.vLinearizedBaseContracts) {
+        if (baseContract.id === contract.id)
+            continue;
+        for (const f of baseContract.vFunctions) {
+            if (f.name === funcName && f.implemented)
+                return f;
+        }
+    }
+    return null;
+}
+function findExternalCall(func) {
+    if (!func.vBody)
+        return null;
+    const calls = func.vBody.getChildrenByType(solc_typed_ast_1.FunctionCall);
+    for (const call of calls) {
+        const expr = call.vExpression;
+        if (expr instanceof solc_typed_ast_1.MemberAccess) {
+            const baseType = expr.vExpression.typeString || '';
+            if (baseType.startsWith('contract ')) {
+                const match = baseType.match(/contract\s+(\w+)/);
+                if (match && !SKIP_CONTRACTS.has(match[1])) {
+                    return {
+                        contract: match[1],
+                        function: expr.memberName,
+                        args: call.vArguments
+                    };
+                }
+            }
+        }
+    }
+    return null;
+}
+function buildParamMapping(func, extCall) {
+    const mapping = new Map();
+    for (const param of func.vParameters.vParameters) {
+        mapping.set(param.name, param.name);
+    }
+    return mapping;
+}
+// ==================== Path Enumeration ====================
+class PathEnumerator {
+    constructor(sourceUnits, paramMap) {
+        this.pathIdCounter = 0;
+        this.branchPoints = 0;
+        this.sourceUnits = sourceUnits;
+        this.paramMap = new Map(paramMap);
+    }
+    enumerate(callTree) {
+        this.pathIdCounter = 0;
+        this.branchPoints = 0;
+        const paths = this.processCallTree(callTree);
+        return paths
+            .filter(p => p.result === 'success')
+            .map(p => ({ id: p.id, conditions: p.conditions, requires: p.requires, result: p.result }));
+    }
+    processCallTree(node) {
+        const def = node.definition;
+        // Process children first (leaf to root)
+        const childPathsMap = new Map();
+        for (const child of node.children) {
+            if (child.fnCall instanceof solc_typed_ast_1.ModifierInvocation)
+                continue;
+            const savedMap = new Map(this.paramMap);
+            this.updateParamMap(child);
+            const childPaths = this.processCallTree(child);
+            childPathsMap.set(child.nodeId, childPaths);
+            this.paramMap = savedMap;
+        }
+        // Process function body
+        let activePaths = [{
+                id: ++this.pathIdCounter,
+                conditions: [],
+                requires: [],
+                terminated: false
+            }];
+        if (def.vBody) {
+            activePaths = this.walkBlock(def.vBody, activePaths, node, childPathsMap);
+        }
+        // Mark non-terminated as success
+        for (const p of activePaths) {
+            if (!p.terminated) {
+                p.terminated = true;
+                p.result = 'success';
+            }
+        }
+        return activePaths;
+    }
+    updateParamMap(node) {
+        const params = node.definition.vParameters.vParameters;
+        const args = node.callArgs;
+        for (let i = 0; i < params.length && i < args.length; i++) {
+            if (params[i].name && args[i]) {
+                this.paramMap.set(params[i].name, this.resolveExpr(args[i]));
+            }
+        }
+    }
+    walkBlock(block, paths, node, childPaths) {
+        for (const stmt of block.vStatements) {
+            if (paths.every(p => p.terminated))
+                break;
+            paths = this.processStatement(stmt, paths, node, childPaths);
+        }
+        return paths;
+    }
+    processStatement(stmt, paths, node, childPaths) {
+        if (stmt instanceof solc_typed_ast_1.IfStatement) {
+            return this.handleIf(stmt, paths, node, childPaths);
+        }
+        if (stmt instanceof solc_typed_ast_1.TryStatement) {
+            return this.handleTryCatch(stmt, paths, node, childPaths);
+        }
+        if (stmt instanceof solc_typed_ast_1.Return) {
+            for (const p of paths)
+                if (!p.terminated) {
+                    p.terminated = true;
+                    p.result = 'success';
+                }
+            return paths;
+        }
+        if (stmt instanceof solc_typed_ast_1.RevertStatement) {
+            for (const p of paths)
+                if (!p.terminated) {
+                    p.terminated = true;
+                    p.result = 'revert';
+                }
+            return paths;
+        }
+        if (stmt instanceof solc_typed_ast_1.Block || stmt instanceof solc_typed_ast_1.UncheckedBlock) {
+            return this.walkBlock(stmt, paths, node, childPaths);
+        }
+        // Check for require/assert
+        paths = this.checkRequire(stmt, paths);
+        // Check for external calls (add as constraint - must succeed)
+        paths = this.checkExternalCalls(stmt, paths);
+        // Check for internal calls
+        paths = this.checkInternalCalls(stmt, paths, node, childPaths);
+        return paths;
+    }
+    handleTryCatch(stmt, paths, node, childPaths) {
+        this.branchPoints++;
+        // Get the external call expression
+        const extCall = stmt.vExternalCall;
+        const callExpr = this.formatExternalCall(extCall);
+        const results = [];
+        for (const path of paths) {
+            if (path.terminated) {
+                results.push(path);
+                continue;
+            }
+            // Process each clause
+            for (const clause of stmt.vClauses) {
+                if (clause.errorName === '') {
+                    // Success clause (try block) - external call succeeds
+                    const successPath = {
+                        id: ++this.pathIdCounter,
+                        conditions: [...path.conditions, {
+                                original: callExpr,
+                                resolved: callExpr,
+                                mustBeTrue: true
+                            }],
+                        requires: [...path.requires],
+                        terminated: false
+                    };
+                    const successResults = this.walkBlock(clause.vBlock, [successPath], node, childPaths);
+                    results.push(...successResults);
+                }
+                else {
+                    // Catch clause - external call fails
+                    const catchPath = {
+                        id: ++this.pathIdCounter,
+                        conditions: [...path.conditions, {
+                                original: callExpr,
+                                resolved: callExpr,
+                                mustBeTrue: false // negated - call failed
+                            }],
+                        requires: [...path.requires],
+                        terminated: false
+                    };
+                    const catchResults = this.walkBlock(clause.vBlock, [catchPath], node, childPaths);
+                    results.push(...catchResults);
+                }
+            }
+        }
+        return results;
+    }
+    checkExternalCalls(stmt, paths) {
+        var _a, _b;
+        // Find all function calls in this statement
+        const calls = ((_b = (_a = stmt).getChildrenByType) === null || _b === void 0 ? void 0 : _b.call(_a, solc_typed_ast_1.FunctionCall)) || [];
+        for (const call of calls) {
+            // Check if it's a high-level external call
+            if ((0, utils_1.highLevelCall)(call)) {
+                const callExpr = this.formatExternalCall(call);
+                // Add as a constraint - external call must succeed
+                for (const p of paths) {
+                    if (!p.terminated) {
+                        p.requires.push({
+                            original: callExpr,
+                            resolved: callExpr,
+                            mustBeTrue: true
+                        });
+                    }
+                }
+            }
+        }
+        return paths;
+    }
+    formatExternalCall(call) {
+        if (call.vExpression instanceof solc_typed_ast_1.MemberAccess) {
+            const base = call.vExpression.vExpression;
+            const func = call.vExpression.memberName;
+            const baseStr = this.resolveExpr(base);
+            const args = call.vArguments.map(a => this.resolveExpr(a)).join(', ');
+            return `${baseStr}.${func}(${args})`;
+        }
+        return this.safeToSource(call);
+    }
+    handleIf(stmt, paths, node, childPaths) {
+        this.branchPoints++;
+        const condOrig = this.safeToSource(stmt.vCondition);
+        const condResolved = this.resolveExpr(stmt.vCondition);
+        const results = [];
+        for (const path of paths) {
+            if (path.terminated) {
+                results.push(path);
+                continue;
+            }
+            // True branch
+            const truePath = {
+                id: ++this.pathIdCounter,
+                conditions: [...path.conditions, { original: condOrig, resolved: condResolved, mustBeTrue: true }],
+                requires: [...path.requires],
+                terminated: false
+            };
+            if (stmt.vTrueBody) {
+                const trueResults = stmt.vTrueBody instanceof solc_typed_ast_1.Block || stmt.vTrueBody instanceof solc_typed_ast_1.UncheckedBlock
+                    ? this.walkBlock(stmt.vTrueBody, [truePath], node, childPaths)
+                    : this.processStatement(stmt.vTrueBody, [truePath], node, childPaths);
+                results.push(...trueResults);
+            }
+            else {
+                results.push(truePath);
+            }
+            // False branch
+            const falsePath = {
+                id: ++this.pathIdCounter,
+                conditions: [...path.conditions, { original: condOrig, resolved: condResolved, mustBeTrue: false }],
+                requires: [...path.requires],
+                terminated: false
+            };
+            if (stmt.vFalseBody) {
+                const falseResults = stmt.vFalseBody instanceof solc_typed_ast_1.Block || stmt.vFalseBody instanceof solc_typed_ast_1.UncheckedBlock
+                    ? this.walkBlock(stmt.vFalseBody, [falsePath], node, childPaths)
+                    : this.processStatement(stmt.vFalseBody, [falsePath], node, childPaths);
+                results.push(...falseResults);
+            }
+            else {
+                results.push(falsePath);
+            }
+        }
+        return results;
+    }
+    checkRequire(stmt, paths) {
+        var _a, _b;
+        const calls = ((_b = (_a = stmt).getChildrenByType) === null || _b === void 0 ? void 0 : _b.call(_a, solc_typed_ast_1.FunctionCall)) || [];
+        for (const call of calls) {
+            const expr = call.vExpression;
+            if (expr instanceof solc_typed_ast_1.Identifier && (expr.name === 'require' || expr.name === 'assert')) {
+                if (call.vArguments.length > 0) {
+                    const cond = call.vArguments[0];
+                    const condOrig = this.safeToSource(cond);
+                    const condResolved = this.resolveExpr(cond);
+                    for (const p of paths) {
+                        if (!p.terminated) {
+                            p.requires.push({ original: condOrig, resolved: condResolved, mustBeTrue: true });
+                        }
+                    }
+                }
+            }
+        }
+        return paths;
+    }
+    checkInternalCalls(stmt, paths, node, childPaths) {
+        var _a, _b;
+        const calls = ((_b = (_a = stmt).getChildrenByType) === null || _b === void 0 ? void 0 : _b.call(_a, solc_typed_ast_1.FunctionCall)) || [];
+        for (const call of calls) {
+            for (const child of node.children) {
+                if (child.fnCall instanceof solc_typed_ast_1.ModifierInvocation)
+                    continue;
+                if (child.fnCall.id === call.id && childPaths.has(child.nodeId)) {
+                    const cPaths = childPaths.get(child.nodeId);
+                    const merged = [];
+                    for (const p of paths) {
+                        if (p.terminated) {
+                            merged.push(p);
+                            continue;
+                        }
+                        for (const cp of cPaths) {
+                            if (cp.result === 'revert')
+                                continue;
+                            merged.push({
+                                id: ++this.pathIdCounter,
+                                conditions: [...p.conditions, ...cp.conditions],
+                                requires: [...p.requires, ...cp.requires],
+                                terminated: false
+                            });
+                        }
+                    }
+                    if (merged.length > 0)
+                        paths = merged;
+                }
+            }
+        }
+        return paths;
+    }
+    resolveExpr(expr) {
+        if (expr instanceof solc_typed_ast_1.Literal)
+            return expr.value || '0';
+        if (expr instanceof solc_typed_ast_1.Identifier) {
+            const name = expr.name;
+            if (this.paramMap.has(name))
+                return this.paramMap.get(name);
+            // State variables - no prefix needed, context makes it clear
+            return name;
+        }
+        if (expr instanceof solc_typed_ast_1.MemberAccess) {
+            const base = expr.vExpression;
+            if (base instanceof solc_typed_ast_1.Identifier && ['msg', 'block', 'tx'].includes(base.name)) {
+                return `${base.name}.${expr.memberName}`;
+            }
+            return `${this.resolveExpr(base)}.${expr.memberName}`;
+        }
+        if (expr instanceof solc_typed_ast_1.IndexAccess) {
+            const base = this.resolveExpr(expr.vBaseExpression);
+            const idx = expr.vIndexExpression ? this.resolveExpr(expr.vIndexExpression) : '0';
+            return `${base}[${idx}]`;
+        }
+        if (expr instanceof solc_typed_ast_1.BinaryOperation) {
+            const left = this.resolveExpr(expr.vLeftExpression);
+            const right = this.resolveExpr(expr.vRightExpression);
+            return `(${left} ${expr.operator} ${right})`;
+        }
+        if (expr instanceof solc_typed_ast_1.UnaryOperation) {
+            const sub = this.resolveExpr(expr.vSubExpression);
+            return expr.prefix ? `${expr.operator}${sub}` : `${sub}${expr.operator}`;
+        }
+        if (expr instanceof solc_typed_ast_1.FunctionCall && expr.kind === solc_typed_ast_1.FunctionCallKind.TypeConversion && expr.vArguments.length > 0) {
+            return this.resolveExpr(expr.vArguments[0]);
+        }
+        return this.safeToSource(expr);
+    }
+    safeToSource(node) {
+        try {
+            return (0, utils_1.toSource)(node);
+        }
+        catch {
+            return String(node);
+        }
+    }
+}
+// ==================== Path Simplification ====================
+function simplifyPaths(paths) {
+    if (paths.length === 0)
+        return [];
+    // Extract unique branches
+    const branches = new Map();
+    for (const p of paths) {
+        for (const c of p.conditions) {
+            branches.set(c.resolved, true);
+        }
+    }
+    // Find minimum covering set (greedy)
+    const needToCover = new Set();
+    for (const key of branches.keys()) {
+        needToCover.add(`T:${key}`);
+        needToCover.add(`F:${key}`);
+    }
+    const selected = [];
+    const covered = new Set();
+    while (covered.size < needToCover.size) {
+        let bestPath = null;
+        let bestNewCoverage = 0;
+        for (const path of paths) {
+            if (selected.includes(path))
+                continue;
+            let newCoverage = 0;
+            for (const c of path.conditions) {
+                const key = c.mustBeTrue ? `T:${c.resolved}` : `F:${c.resolved}`;
+                if (needToCover.has(key) && !covered.has(key))
+                    newCoverage++;
+            }
+            if (newCoverage > bestNewCoverage) {
+                bestNewCoverage = newCoverage;
+                bestPath = path;
+            }
+        }
+        if (!bestPath || bestNewCoverage === 0)
+            break;
+        selected.push(bestPath);
+        for (const c of bestPath.conditions) {
+            covered.add(c.mustBeTrue ? `T:${c.resolved}` : `F:${c.resolved}`);
+        }
+    }
+    if (selected.length === 0)
+        selected.push(paths[0]);
+    // Format as strings - include both conditions and external call requires
+    return selected.map(p => {
+        const conds = p.conditions.map(c => {
+            const clean = c.resolved.replace(/storage\./g, '').replace(/^\((.+)\)$/, '$1');
+            return c.mustBeTrue ? clean : negateCond(clean);
+        });
+        // Add external call requires (detect by pattern: has dot and parentheses)
+        // Filter out SafeCast overflow checks (noise)
+        const extCalls = p.requires
+            .filter(r => r.resolved.includes('.') && r.resolved.includes('('))
+            .filter(r => !isOverflowCheck(r.resolved))
+            .map(r => r.mustBeTrue ? r.resolved : `!${r.resolved}`);
+        const allConds = [...conds, ...extCalls];
+        return allConds.join(' && ') || 'true';
+    });
+}
+// Detect SafeCast overflow guards like (x <= type(uint128).max)
+function isOverflowCheck(s) {
+    return /<=\s*type\(u?int\d+\)\.max/.test(s);
+}
+function negateCond(cond) {
+    if (cond.startsWith('!'))
+        return cond.slice(1);
+    if (cond.includes('=='))
+        return cond.replace('==', '!=');
+    if (cond.includes('!='))
+        return cond.replace('!=', '==');
+    if (cond.includes('>='))
+        return cond.replace('>=', '<');
+    if (cond.includes('<='))
+        return cond.replace('<=', '>');
+    if (cond.includes('>') && !cond.includes('>='))
+        return cond.replace('>', '<=');
+    if (cond.includes('<') && !cond.includes('<='))
+        return cond.replace('<', '>=');
+    return `!(${cond})`;
+}

package/dist/processor.js

@@ -153,11 +153,26 @@ const processContract = (contract) => {
     return result;
 };
 exports.processContract = processContract;
+const skipPatterns = [
+    'test/',
+    'tests/',
+    'script/',
+    'scripts/',
+    'contracts/test/',
+    'contracts/script/',
+    'contracts/scripts/',
+    'lib/forge-std/',
+    'lib/chimera/',
+    'lib/setup-helpers/',
+];
 async function buildCoverageMap(asts, foundryRoot, contractFunctions) {
     const coverage = new Map();
     const fileCache = new Map();
     let nodesVisited = 0;
     let nodesAdded = 0;
+    const shouldSkipPath = (relPath) => {
+        return skipPatterns.some((p) => relPath.includes(p));
+    };
     const addNodeRange = async (node) => {
         var _a;
         nodesVisited++;
@@ -224,6 +239,9 @@ async function buildCoverageMap(asts, foundryRoot, contractFunctions) {
     }
     const normalized = {};
     for (const [relPath, ranges] of coverage.entries()) {
+        if (shouldSkipPath(relPath)) {
+            continue; // skip test/script/lib files at the final emission step only
+        }
         const sorted = Array.from(ranges).sort((a, b) => {
             const start = (val) => parseInt(val.split('-')[0], 10);
             return start(a) - start(b);

package/dist/types.d.ts

@@ -1,4 +1,4 @@
-import { ASTNode } from "solc-typed-ast";
+import { ASTNode, Expression, FunctionCall, FunctionDefinition, ModifierDefinition, ModifierInvocation, Statement } from "solc-typed-ast";
 export declare enum Actor {
     ACTOR = "actor",
     ADMIN = "admin"
@@ -54,3 +54,13 @@ export type RecordItem = {
     children: RecordItem[];
     callType?: CallType;
 };
+export type CallTree = {
+    nodeId: number;
+    definition: FunctionDefinition | ModifierDefinition;
+    fnCall?: FunctionCall | ModifierInvocation;
+    callArgs: Expression[];
+    callContext?: Statement;
+    children: CallTree[];
+    isRecursive?: boolean;
+    recursiveTargetNodeId?: number;
+};