[−][src]Trait context_coroutine::stacks::Stack

pub trait Stack {
    fn bottom(&self) -> StackPointer;
}

Organisation of the stack in x86 (and nearly all other modern CPUs).

  • The bottom (origin) of the stack is a high address.
  • The top of the stack is a low address.
  • The stack grows downwards.
  • Thus pushing onto the stack subtracts from the top address, making it lower (smaller).
  • Thus popping from the stack adds to the top address, making it higher (larger).
  • Eli Bendersky explains this well.

A diagram:-

eg 0x1006  +---+ Bottom (origin): High Address
           | S |
           | T |
           | A |
           | C |
           | K |
eg 0x1000  +---+ Top: Low Address

Pushing a 2 byte value, X, grows the stack thus:-

eg 0x1006  +---+ Bottom (origin): High Address
           | S |
           | T |
           | A |
           | C |
           | K |
eg 0x1000  |···| Former Top
           | X |
eg  0x998  +---+ Top: Low Address

Stacks can have a 'guard' page below the Bottom which can be mprotected'd as PROT_NONE; any reads or write will cause a SIGSEGV.

eg 0x1006  +---+ Bottom (origin): High Address
           | S |
           | T |
           | A | Regular Pages (mprotect: PROT_READ + PROT_WRITE)
           | C |
           | K |
eg 0x1000  +---+ Top: Low Address
           |   |
           |   | Guard Page (mprotect: PROT_NONE)
           |   |
           +---+ Top of Guard Page

A 'guard' page is 4,096 bytes on x86-64.

Required methods

fn bottom(&self) -> StackPointer

Bottom (origin) of stack (a high address).

This must be 16-byte aligned on x86-64.

Loading content...

Implementors

impl Stack for ProtectedStack[src]

Loading content...