Removing recursion via explicit callstack simulation
gsky
12 points
2 comments
March 10, 2026
Related Discussions
Found 5 related stories in 667.2ms across 14,015 title embeddings via pgvector HNSW
- Reducing Assumptions, Exploding Your Code mpweiher · 30 pts · July 05, 2026 · 46% similar
- Show HN: Arcaide – Explore code with multi-level call graphs aqula · 25 pts · July 09, 2026 · 46% similar
- Tracing Rays with Jank pjmlp · 33 pts · June 02, 2026 · 44% similar
- Tracing Rays with Jank yogthos · 31 pts · June 02, 2026 · 44% similar
- Surpassing vLLM with a Generated Inference Stack lukebechtel · 31 pts · March 10, 2026 · 42% similar
Discussion Highlights (2 comments)
juancn
It can be done mechanically, it's essentially what a compiler does. But yeah, it can be a useful technique, specially when there's tail recursion and the explicit stack just vanishes and the recursion turns into a plain old loop which the hardware just loves.
Panzerschrek
While coding recursive algorithms in C++ and Rust I have found, that they have some overhead due to performing recursive calls. Compilers can't inline such calls (with exception of tail-recursion). So, replacing recursion with manually-managed stack gives some performance boost. I am wondering why no major C++ compiler can do this for me automatically.