First, the node from the free tree with the lowest address (which is greater than or equal to the requested block size) is removed.
首先,删除空闲树中(大于或等于请求的块大小的)地址最低的节点。
If the size of the reallocated block is smaller than the original block, the block is split and the extra block is returned to the free tree with the required size block being returned to the caller.
如果重新分配的块小于原来的块,那么把它分割开,多余的块返回给空闲树,请求的块返回给调用者。
If the size of the reallocated block is smaller than the original block, the block is split and the extra block is returned to the free tree with the required size block being returned to the caller.
如果重新分配的块小于原来的块,那么把它分割开,多余的块返回给空闲树,请求的块返回给调用者。
应用推荐