Serenity Operating System
at master 50 lines 1.3 kB view raw
1/* 2 * Copyright (c) 2020, Andreas Kling <kling@serenityos.org> 3 * 4 * SPDX-License-Identifier: BSD-2-Clause 5 */ 6 7#include <AK/Badge.h> 8#include <LibJS/Heap/BlockAllocator.h> 9#include <LibJS/Heap/CellAllocator.h> 10#include <LibJS/Heap/Heap.h> 11#include <LibJS/Heap/HeapBlock.h> 12 13namespace JS { 14 15CellAllocator::CellAllocator(size_t cell_size) 16 : m_cell_size(cell_size) 17{ 18} 19 20Cell* CellAllocator::allocate_cell(Heap& heap) 21{ 22 if (m_usable_blocks.is_empty()) { 23 auto block = HeapBlock::create_with_cell_size(heap, m_cell_size); 24 m_usable_blocks.append(*block.leak_ptr()); 25 } 26 27 auto& block = *m_usable_blocks.last(); 28 auto* cell = block.allocate(); 29 VERIFY(cell); 30 if (block.is_full()) 31 m_full_blocks.append(*m_usable_blocks.last()); 32 return cell; 33} 34 35void CellAllocator::block_did_become_empty(Badge<Heap>, HeapBlock& block) 36{ 37 auto& heap = block.heap(); 38 block.m_list_node.remove(); 39 // NOTE: HeapBlocks are managed by the BlockAllocator, so we don't want to `delete` the block here. 40 block.~HeapBlock(); 41 heap.block_allocator().deallocate_block(&block); 42} 43 44void CellAllocator::block_did_become_usable(Badge<Heap>, HeapBlock& block) 45{ 46 VERIFY(!block.is_full()); 47 m_usable_blocks.append(block); 48} 49 50}