I hope someday we can stop thinking of "stack" and "heap" as the two fundamentally different modes of memory allocation and instead reframe memory allocation as a continuum of strategies, from bump allocation to segregated fit to best fit to compacting, etc.
-
-
The popular solution appears to be using a region of guard pages. Why eagerly check? https://lwn.net/Articles/725832/ …
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
A) in a big chunk of code there's no recursion so can statically compute max stack size. Most recursions can be transformed to tail calls/loops or bound in depth another way B) primary cost difference is the nursery roots scanning and pointer chasing, evicting all useful cache
-
For a you can tag code pointers so that the set of possible functions called is small and can compute a worst case. There are cases that make this very hard because of undeterminable code pointers, but we didn't have a problem implementing A on a real, large project
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.