Displaying 1 result from an estimated 1 matches for "cycleentri".
Did you mean:
cycleentry
2018 May 11
2
best way to represent function call with new stack in LLVM IR?
In the Zig frontend, we know at compile-time the entire call graph. This
means we know stack size for all functions and therefore the upper bound
stack usage.
Recursive calls can have a runtime-decided stack usage, and therefore I am
adding a frontend feature that will heap-allocate memory to use for some
function calls.
The idea is that recursion adds cycles to the call graph, and we know at