free list

常見例句

The free list contains pages of physical memory that are not associated with any address space of VM object.
可用內(nèi)存包含不同VM對(duì)象聯(lián)系在一起任何地址空間物理內(nèi)存的頁。
Memory deallocation may be as simple as adding that chunk to the front of the free list, a O(1) operation.
內(nèi)存的釋放也很簡單，只是將區(qū)塊重新加到可用鏈表的開始，這是一個(gè)O(1)操作。
The theorem above guarantees all alignment requirements for allocating chunks and also implementation details such as the interleaved free list.
以上定理保證了區(qū)塊分配的所有對(duì)齊要求，以及交錯(cuò)空閑列表等實(shí)現(xiàn)細(xì)節(jié)。
However, more complicated uses of Simple Segregated Storage may require a sorted free list, which makes deallocation O(N).
但是，對(duì)簡單分隔存儲(chǔ)的更為復(fù)雜的使用可能需要一個(gè)已排序的可用鏈表，這將使得釋放操作變?yōu)镺(N)復(fù)雜度。
When the block is freed, it may be coalesced into larger adjacent blocks and the free list is updated.
當(dāng)塊可用時(shí)，它可能會(huì)被接合到一個(gè)較大的相鄰塊中，可用列表也會(huì)被更新。
Freeing also causes a search of the free list, to find the proper place to insert the block being freed.
釋放過程也是首先搜索空閑塊鏈表，以找到可以插入被釋放塊的合適位置。