search for: cleaup_new_block

...written to use the minimum amount of stack space possible, and that stack space will have to be factored into the check in the function prologue (so every function prologue checks for the space it needs _plus_ the space required to run setup_new_block once, by a callee). *** cleanup_new_block cleaup_new_block will be a simple operation, which restores the old SP (saved_sp block header) and jumps to saved_ip (also from the block header). Later, if we decide to free unused blocks then that cleanup can be done here. *** Eliminating allocations and checks It is evident that setup_new_block is too expen...

On Wed, Mar 23, 2011 at 03:37:02PM +0530, Sanjoy Das wrote: > I intend to start with the simplest possible approach - representing the > stack as a doubly linked list of _block_s, the size of each _block_ > being a power of two. This can later be modified to improve performance > and accommodate other factors. Blocks will be chained together into a > doubly linked list structure

Hi All! I will be applying to the LLVM project for this GSoC, and I wanted some preliminary sanity check on my project idea. I intend to implement split (segmented) stacks for LLVM (like we have in Go, and as being implemented for GCC [1]). A lot of what follows is lifted from [1]; I will progressively add more details as I get more familiar with the LLVM codebase. I intend to start with