STRUCT AUXTRACE_CACHE(9)

💖 NAME 💖

okay so this is the struct auxtrace_cache(9) page from the Kernel API Manual, and it's literally about a hash table to implement a cache. no cap, that's the whole vibe. ✨

🌸 SYNOPSIS 🌸

the struct is giving exactly this, so copy it character for character bestie:

       struct auxtrace_cache {
           struct hlist_head *hashtable;
           size_t sz;
           size_t entry_size;
           size_t limit;
           size_t cnt;
           unsigned int bits;
        };

🫶 Members 🫶

• hashtable — the hashtable itself. iconic. 💅
• sz — hashtable size, aka the number of hlists in it.
• entry_size — size of an entry, periodt.
• limit — caps the number of entries at this maximum; when you hit it, the cache is dropped and caching begins again with an empty cache. it's giving reset button energy. 🔥
• cnt — current number of entries.
• bits — hashtable size, where sz = 2^bits. math girlie moment. ✨

🔎 SEE ALSO 🔎

• Kernel file ./tools/perf/util/auxtrace.c and auxtrace_record__init(9) — that's the whole SEE ALSO list, bestie. 🦋

mwah 💋 — the source/version situation is ./tools/perf/util, dated October 2026, and yeah, this is still the struct auxtrace_cache(9) page. 🎀