Browse Source

terminology: inline allocation

Peter Thiemann 3 years ago
parent
commit
3b7d1e984d
1 changed files with 4 additions and 1 deletions
  1. 4 1
      book.tex

+ 4 - 1
book.tex

@@ -11934,7 +11934,10 @@ The x86 instructions \code{andq} (for bitwise-and) and \code{sarq}
 (shift right) can be used to accomplish this.
 
 We compile the \code{allocate} form to operations on the
-\code{free\_ptr}, as shown below. The address in the \code{free\_ptr}
+\code{free\_ptr}, as shown below. This approach is called \emph{inline
+allocation} as it implements allocation by bumping the allocation
+pointer. It is much more efficient than calling a function for each
+allocation. The address in the \code{free\_ptr}
 is the next free address in the FromSpace, so we copy it into
 \code{r11} and then move it forward by enough space for the tuple
 being allocated, which is $8(\itm{len}+1)$ bytes because each element