JakeChampion / JakeChampion/trafficserver

[audit][perf] Remap path Trie uses 2KB 256-way nodes: one dependent cache miss per URL path character on every lookup

Open
#46 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

area:perf audit severity:medium
Dominant language
C++
Stars
0
Forks
0
Avg merge
8h 2m
Merged PRs (30d)
21

Description

Severity: medium · Category: performance
Location: include/tscore/Trie.h:111

What's wrong

UrlMappingPathIndex::Search (src/proxy/http/remap/UrlMappingPathIndex.cc:91) runs Trie::Search on the request path for every hash-mapped remap lookup. Each Trie node holds 'Node *children[256]' plus value/occupied/rank (~2072 bytes), and Search performs 'curr_node = curr_node->GetChild(key[i])' — a dependent pointer chase into a fresh 2KB heap block per path character until the deepest matching rule prefix. Nodes are individually ats_malloc'd (Trie.h:105), so consecutive characters have no locality: a config whose rules share a 30-character path prefix costs ~30 serialized cache misses per request, per table consulted. The layout is also memory-hostile at config scale (one 2KB node per distinct prefix character across all rules), which further guarantees the working set does not fit in cache.

Evidence
Trie.h:76: static const int N_NODE_CHILDREN = 256;
Trie.h:111: Node *children[N_NODE_CHILDREN];
Trie.h:105: child = static_cast<Node *>(ats_malloc(sizeof(Node)));
Trie.h:210-211: curr_node = curr_node->GetChild(key[i]); ++i;
Suggested fix

Replace with a compressed radix tree (path compression collapses shared prefixes to one node with an inline string compare) or a flat structure; even a first step of storing edges as a small sorted array instead of 256 pointers would cut node size ~60x and make the walk mostly cache-resident.


Filed from an automated multi-lens codebase audit. Full report: CODEBASE_AUDIT.md / audit-report.html on branch claude/codebase-audit-review-9nw7vz.

Contributor guide

Open the contributing guide

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

Start with include/tscore/Trie.h:76, 105, 111, and 210-211, then trace UrlMappingPathIndex::Search in src/proxy/http/remap/UrlMappingPathIndex.cc:91. Compare the proposed radix-tree or flatter edge representations against the current node layout and lookup path. Done means reducing per-node memory and dependent cache misses without changing remap path matching behavior.

Written by the indexing model from the issue text.

Assessment

Tech stack
cpp
Domain
performance
Issue type
Refactor
Difficulty
5/5
Estimated time
Over a week
Activity status
Active
Clarity
Mostly clear
Newbie friendliness
42/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.