Changes between Version 10 and Version 11 of Commentary/Rts/HaskellExecution
- Timestamp:
- 09/28/06 18:31:35 (7 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
Commentary/Rts/HaskellExecution
v10 v11 17 17 * `Hp` points to the byte before the first free byte in the (contiguous) allocation space. 18 18 19 * `HpLim` points to the last avai able byte in the current chunk of allocation space (see [[ref(Heap/Stack check failures)]]).19 * `HpLim` points to the last available byte in the current chunk of allocation space (see [[ref(Heap/Stack check failures)]]). 20 20 21 * `Sp` points to the youngest allocated byte of stack. The stack grows downwards. Why? Because that means thata return address is at a lower address than the stack frame it "knows about", and that in turn means that we can treat a stack frame very like a heap object, with an info pointer (return address) as its first word.21 * `Sp` points to the youngest allocated byte of stack. The stack grows downwards. Why? Because that means a return address is at a lower address than the stack frame it "knows about", and that in turn means that we can treat a stack frame very like a heap object, with an info pointer (return address) as its first word. 22 22 23 23 * `SpLim` points to the last (youngest) available byte in the current stack. … … 46 46 47 47 * A '''known call''' is a call of a function whose binding site is statically visible: 48 * The function is bound at top level in this module 49 * The function is bound at top level in another module, and optimistion is on, so we can see the details (notably arity) of the function in the module's interface file .48 * The function is bound at top level in this module; or, 49 * The function is bound at top level in another module, and optimistion is on, so we can see the details (notably arity) of the function in the module's interface file; or, 50 50 * The function is bound by an `let` binding that encloses the call. 51 51
