Cascading Code Calls

Cascading code calls is one of the key use cases of Code Mode. Instead of invoking tools one by one or through the traditional MCP call pattern, it treats MCP tools as callable methods that you can compose into custom business logic. This significantly reduces the number of round trips between the model and the tools, saving a large amount of tokens.

Example Scenario

In the example below, github.list_commits is the official GitHub MCP tool, which can be used to query the commit history of a repository.

The agent’s task is to count the number of commits in the agents repository. If using the github.list_commits tool alone, the model would need to fetch each page of results and aggregate them manually. With 1,503 commits in total and 50 commits per page, there would be 30 pages, requiring 30 separate requests before the information could be summarized. This process consumes a significant amount of tokens. In many scenarios, the upper limit of requests is unpredictable, making repeated requests impractical.

In Code Mode, the github.list_commits MCP tool is exposed as an API, and the model generates the following code that aggregates all the data in a single request.

In complex business scenarios, Code Mode is more convenient and can save a substantial amount of tokens.

async () => {                                                             …
    const owner = "jiweigang1";
    const repo = "agents";
    const perPage = 50;
    let page = 1;
    let total = 0;
    const authorMap = new Map();
    while (true) {
      const commits = await codemode.github.list_commits({
        owner,
        repo,
        perPage,
        page,
        fields: ["sha", "author"]
      });
      if (!Array.isArray(commits) || commits.length === 0) break;
      total += commits.length;
      for (const c of commits) {
        const login = c.author?.login || c.commit?.author?.name || "Unknown";
        authorMap.set(login, (authorMap.get(login) || 0) + 1);
      }
      if (commits.length < perPage) break;
      page++;
    }
    return {
      total,
      pages: page,
      byAuthor: Array.from(authorMap.entries()).sort((a, b) => b[1] - a[1])
    };
}



项目：jiweigang1/agents默认分支：main总提交次数：1503

  提交次数 Top 10（按 GitHub 作者统计）：

  ┌──────┬─────────────────────┬──────────┐
  │ 排名 │ 作者                │ 提交次数 │
  ├──────┼─────────────────────┼──────────┤
  │ 1    │ threepointone       │ 917      │
  │ 2    │ mattzcarey          │ 124      │
  │ 3    │ github-actions[bot] │ 119      │
  │ 4    │ whoiskatrin         │ 92       │
  │ 5    │ cjol                │ 40       │
  │ 6    │ dependabot[bot]     │ 24       │
  │ 7    │ deathbyknowledge    │ 24       │
  │ 8    │ ben-reitz           │ 15       │
  │ 9    │ ghostwriternr       │ 13       │
  │ 10   │ Muhammad-Bin-Ali    │ 10       │
  └──────┴─────────────────────┴──────────┘

  你本人（jiweigang1）在这个项目中的提交次数：2 次。

Welcome to Hawa Code: https://www.hawacode.com/

Hexo

Hawa Code Code Mode Cascading Code Calls, Saving 99% Tokens

Cascading Code Calls

Example Scenario