and high storage nucleus chains.
FLPA
a full
even if there is no such page available.
contains the one-byte storage
chain.
contains the one-byte FREETAB table code for storage on this
chain.
following steps are taken in an attempt to satisfy the request. As soon
1.
2.
size.
3. Extend high storage user storage downward into the user program
area, modifying
4. For a variable request, put all available storage in the user
program area onto the high
the largest block available on either the high storage user chain
or the low storage user chain. The allocated block will not be
satisfactory unless it is larger than the
in an attempt
1.
available, and put them on the low storage nucleus chain.
3.
4. Get free pages from the high storage user chain, if they are
available, and put them on the high storage nucleus chain.
5. Extend high storage nucleus storage downward into the
6. For variable requests, put all available pages from the user chains
and the user
largest block available on either the
or the high storage nucleus chains.