复旦大学软件学院计算机系统课件 Malloc.ppt

* * * * * * * * * * * * * * * * * * * * * * * * * Implicit list size 1 word Format of allocated and free blocks payload a = 1: allocated block a = 0: free block size: block size payload: application data (allocated blocks only) a optional padding 0 0 4 4 2 6 p * Finding a Free Block First fit: Search list from beginning, choose first free block that fits Can take linear time in total number of blocks (allocated and free) In practice it can cause “splinters” at beginning of list * Finding a Free Block Next fit: Like first-fit, but search list from location of end of previous search Research suggests that fragmentation is worse Best fit: Search the list, choose the free block with the closest size that fits Keeps fragments small --- usually helps fragmentation Will typically run slower than first-fit * Allocating in a free block Allocating in a free block - splitting Since allocated space might be smaller than free space, we might want to split the block 4 4 2 6 p 4 2 4 2 4 * Freeing a block Simplest implementation: Only need to clear allocated flag But can lead to “false fragmentation” There is enough free space, but the allocator won’t be able to find it 4 2 4 2 free(p) p 4 4 2 4 4 2 malloc(5) * Coalescing Join with next and/or previous block if they are free Coalescing with next block But how do we coalesce with previous block? 4 2 4 2 free(p) p 4 4 2 4 6 * Bidirectional Boundary tags [Knuth73] replicate size/allocated word at bottom of free blocks Allows us to traverse the “list” backwards, but requires extra space Important and general technique! * Bidirectional 4 4 4 4 6 4 6 4 1 word Format of allocated and free blocks a = 1: allocated block a = 0: free block size: block size payload: application data (allocated blocks only) boundary tag (footer) header size payload and padding a size a 0 0 0 0 * allocated allocated allocated free free allocated free free block being freed Case 1 Case 2 Case 3 Case 4 Constant Time Coalescing * m1 1 m1 1 n 1 n 1 m2