cakeml
cakeml copied to clipboard
Interprocedural optimization of stack limit checks
We could guarantee a certain amount of space to functions reached via an indirect call. For functions that use less than that amount of space, the amount they make available to called functions can be calculated; if a function cannot be reached with less remaining stack than the amount it uses, the stack check could be omitted.