grepmax 0.7.12 → 0.7.13

package/dist/commands/mcp.js

@@ -226,6 +226,10 @@ const TOOLS = [
                     type: "string",
                     description: "The function, method, or class name to trace (e.g. 'handleAuth')",
                 },
+                depth: {
+                    type: "number",
+                    description: "Traversal depth for callers (default 1, max 3). depth: 2 shows callers-of-callers.",
+                },
             },
             required: ["symbol"],
         },
@@ -861,20 +865,29 @@ exports.mcp = new commander_1.Command("mcp")
             try {
                 const db = getVectorDb();
                 const builder = new graph_builder_1.GraphBuilder(db);
-                const graph = yield builder.buildGraph(symbol);
+                const depth = Math.min(Math.max(Number(args.depth) || 1, 1), 3);
+                const graph = yield builder.buildGraphMultiHop(symbol, depth);
                 if (!graph.center) {
                     return ok(`Symbol '${symbol}' not found in the index.`);
                 }
                 const lines = [];
                 // Center
                 lines.push(`${graph.center.symbol} [${graph.center.role}] ${graph.center.file}:${graph.center.line + 1}`);
-                // Callers
-                if (graph.callers.length > 0) {
-                    lines.push("Callers:");
-                    for (const caller of graph.callers) {
-                        lines.push(`  <- ${caller.symbol} ${caller.file}:${caller.line + 1}`);
+                // Callers (recursive tree)
+                function formatCallerTree(trees, indent) {
+                    for (const t of trees) {
+                        const rel = t.node.file.startsWith(projectRoot)
+                            ? t.node.file.slice(projectRoot.length + 1)
+                            : t.node.file;
+                        const pad = "  ".repeat(indent);
+                        lines.push(`${pad}<- ${t.node.symbol} ${rel}:${t.node.line + 1}`);
+                        formatCallerTree(t.callers, indent + 1);
                     }
                 }
+                if (graph.callerTree.length > 0) {
+                    lines.push("Callers:");
+                    formatCallerTree(graph.callerTree, 1);
+                }
                 else {
                     lines.push("Callers: none");
                 }

package/dist/lib/graph/graph-builder.js

@@ -105,6 +105,40 @@ class GraphBuilder {
             return { center, callers, callees: calleeNodes };
         });
     }
+    buildGraphMultiHop(symbol, depth) {
+        return __awaiter(this, void 0, void 0, function* () {
+            const graph = yield this.buildGraph(symbol);
+            if (depth <= 1 || !graph.center) {
+                return {
+                    center: graph.center,
+                    callerTree: graph.callers.map((c) => ({ node: c, callers: [] })),
+                    callees: graph.callees,
+                };
+            }
+            const visited = new Set([symbol]);
+            const callerTree = yield this.expandCallers(graph.callers, depth - 1, visited);
+            return { center: graph.center, callerTree, callees: graph.callees };
+        });
+    }
+    expandCallers(callers, remainingDepth, visited) {
+        return __awaiter(this, void 0, void 0, function* () {
+            const trees = [];
+            for (const caller of callers) {
+                if (visited.has(caller.symbol)) {
+                    trees.push({ node: caller, callers: [] });
+                    continue;
+                }
+                visited.add(caller.symbol);
+                let subCallers = [];
+                if (remainingDepth > 0) {
+                    const upstreamCallers = yield this.getCallers(caller.symbol);
+                    subCallers = yield this.expandCallers(upstreamCallers, remainingDepth - 1, visited);
+                }
+                trees.push({ node: caller, callers: subCallers });
+            }
+            return trees;
+        });
+    }
     mapRowToNode(row, targetSymbol, type) {
         // Helper to convert Arrow Vector to array if needed
         const toArray = (val) => {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "grepmax",
-  "version": "0.7.12",
+  "version": "0.7.13",
   "author": "Robert Owens <robowens@me.com>",
   "homepage": "https://github.com/reowens/grepmax",
   "bugs": {

package/plugins/grepmax/.claude-plugin/plugin.json

@@ -1,6 +1,6 @@
 {
   "name": "grepmax",
-  "version": "0.7.12",
+  "version": "0.7.13",
   "description": "Semantic code search for Claude Code. Automatically indexes your project and provides intelligent search capabilities.",
   "author": {
     "name": "Robert Owens",

package/plugins/grepmax/skills/grepmax/SKILL.md

@@ -71,6 +71,7 @@ File or directory structure — signatures with bodies collapsed (~4x fewer toke
 ### trace_calls
 Call graph — who calls a symbol and what it calls. Callers and callees include file:line locations. Unscoped — follows calls across all indexed directories.
 - `symbol` (required): Function/method/class name
+- `depth` (optional): Traversal depth for callers (default 1, max 3). depth: 2 shows callers-of-callers with indentation.
 
 ### list_symbols
 List indexed symbols with definition locations, role, and export status.