Go to most recent revision |
Details |
Last modification |
View Log
| RSS feed
| Rev |
Author |
Line No. |
Line |
| 93 |
Kevin |
1 |
P1 Notes
|
|
|
2 |
|
|
|
3 |
Components:
|
|
|
4 |
- Array of bytes representing the memory pool
|
|
|
5 |
= byte[size of pool]
|
|
|
6 |
|
|
|
7 |
- Doubly linked list that keeps track of the free blocks in the memory pool
|
|
|
8 |
IE, holds the address and size of each free block in the memory pool
|
|
|
9 |
= int (location of block start)
|
|
|
10 |
= int (size of block)
|
|
|
11 |
= handle (next handle)
|
|
|
12 |
= handle (previous handle)
|
|
|
13 |
|
|
|
14 |
- Record array that stores the 'handles' to the stored data records in the memory pool
|
|
|
15 |
|
|
|
16 |
- Handle class
|
|
|
17 |
= int (location of start address in memory pool)
|
|
|
18 |
|