free list

同根派生

The free list contains pages of physical memory that are not associated with any address space of VM object.
可用内存包含不同VM对象联系在一起任何地址空间物理内存的页。
Memory deallocation may be as simple as adding that chunk to the front of the free list, a O(1) operation.
内存的释放也很简单，只是将区块重新加到可用链表的开始，这是一个O(1)操作。
The theorem above guarantees all alignment requirements for allocating chunks and also implementation details such as the interleaved free list.
以上定理保证了区块分配的所有对齐要求，以及交错空闲列表等实现细节。
However, more complicated uses of Simple Segregated Storage may require a sorted free list, which makes deallocation O(N).
但是，对简单分隔存储的更为复杂的使用可能需要一个已排序的可用链表，这将使得释放操作变为O(N)复杂度。
When the block is freed, it may be coalesced into larger adjacent blocks and the free list is updated.
当块可用时，它可能会被接合到一个较大的相邻块中，可用列表也会被更新。