FUNCTION::STACK(3stap)

✨ NAME ✨

function::stack β€” bestie, this one hands u the return address at a given depth of the kernel stack backtrace πŸ’… (yes, in the 3stap manual, we're fancy like that)


🌸 SYNOPSIS 🌸

stack:long(n:long)

πŸŽ€ ARGUMENTS πŸŽ€

  • n β€” how many levels to descend in the stack, like climbing down the ladder of ur call history πŸͺœ

πŸ’– DESCRIPTION πŸ’–

Okay so here's the vibe: it performs a simple (kernel) backtrace, and then gives u back the element sitting at the position u asked for. That's it. That's the whole thing. Lowkey iconic for how much it does with so little 🫢

But here's the part that's actually the main character: the results of the backtrace itself are cached πŸ”₯. So the backtrace computation is performed at most once, no matter how many times stack gets called, or in what order u call it. Not me being obsessed with memoization ✨ periodt.


πŸ¦‹ SEE ALSO πŸ¦‹


okay bye bestie, that's the whole page πŸ’– this was the SystemTap Tapset Reference, Version (September 2026) β€” mwah, go write some tapsets, u ate πŸŒˆπŸ‘‘

πŸ“¦ where this page comes from