trace
Find the shortest call path between two symbols or trace outbound calls from a symbol to uncover transitive dependencies in code.
Instructions
Call-graph navigation in ONE deterministic step instead of hopping context→context (a tool call per hop). With from and to: the exact SHORTEST call path between two symbols — "how does the HTTP handler reach the DB write?" — including detecting when the dependency actually runs the other way. With only from: the outbound call-flow tree. Use this for hidden/transitive dependencies that ranked search can't surface; pair with impact (blast radius) and context (1-hop neighbors).
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| to | No | Optional target symbol; when set, returns the shortest call path from→to | |
| from | Yes | Entrypoint symbol name or sym: id to trace outward from | |
| repo | No | Repository name | |
| depth | No | Max call-graph hops to traverse (default 12) | |
| format | No | Response text encoding: toon (default) | json |