List the blocks in the heap
=> r1 = address of heap
r2 = initially 0 for first block, otherwise address of previous block
<= r0 = 0 if block is free, -1 otherwise
r2 = address of block (or 0 if no more)
r3 = size of block (of 0 if no more)
This call allows the user to step through all the blocks in the heap, for example to perform garbage collection of the data within.
|
|
|