search for: prolgu

...placed on the new block is not the original return address placed on the old stack by the callee, but is the address of a another naked function (called cleanup_new_block) described below. 4. The stack pointer is set to (the address of the new block + 3 * word size). 5. Control is returned to the prolgue, and execution continues normally. We cannot use a usual ret here, so we'll have to use one of the caller-saved registers to communicate the address of the next instruction to setup_new_block. **** Frame pointers In case the frame pointer is being maintained for the function, the value a...

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