mirror of
				https://github.com/RGBCube/serenity
				synced 2025-10-28 11:02:36 +00:00 
			
		
		
		
	 e2d154c74d
			
		
	
	
		e2d154c74d
		
	
	
	
	
		
			
			Default implementations allow for more optimizations. See: https://pvs-studio.com/en/docs/warnings/v832/
		
			
				
	
	
		
			50 lines
		
	
	
	
		
			1.2 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			50 lines
		
	
	
	
		
			1.2 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| /*
 | |
|  * Copyright (c) 2020, Andreas Kling <kling@serenityos.org>
 | |
|  *
 | |
|  * SPDX-License-Identifier: BSD-2-Clause
 | |
|  */
 | |
| 
 | |
| #include <AK/Badge.h>
 | |
| #include <LibJS/Heap/BlockAllocator.h>
 | |
| #include <LibJS/Heap/CellAllocator.h>
 | |
| #include <LibJS/Heap/Heap.h>
 | |
| #include <LibJS/Heap/HeapBlock.h>
 | |
| 
 | |
| namespace JS {
 | |
| 
 | |
| CellAllocator::CellAllocator(size_t cell_size)
 | |
|     : m_cell_size(cell_size)
 | |
| {
 | |
| }
 | |
| 
 | |
| Cell* CellAllocator::allocate_cell(Heap& heap)
 | |
| {
 | |
|     if (m_usable_blocks.is_empty()) {
 | |
|         auto block = HeapBlock::create_with_cell_size(heap, m_cell_size);
 | |
|         m_usable_blocks.append(*block.leak_ptr());
 | |
|     }
 | |
| 
 | |
|     auto& block = *m_usable_blocks.last();
 | |
|     auto* cell = block.allocate();
 | |
|     VERIFY(cell);
 | |
|     if (block.is_full())
 | |
|         m_full_blocks.append(*m_usable_blocks.last());
 | |
|     return cell;
 | |
| }
 | |
| 
 | |
| void CellAllocator::block_did_become_empty(Badge<Heap>, HeapBlock& block)
 | |
| {
 | |
|     auto& heap = block.heap();
 | |
|     block.m_list_node.remove();
 | |
|     // NOTE: HeapBlocks are managed by the BlockAllocator, so we don't want to `delete` the block here.
 | |
|     block.~HeapBlock();
 | |
|     heap.block_allocator().deallocate_block(&block);
 | |
| }
 | |
| 
 | |
| void CellAllocator::block_did_become_usable(Badge<Heap>, HeapBlock& block)
 | |
| {
 | |
|     VERIFY(!block.is_full());
 | |
|     m_usable_blocks.append(block);
 | |
| }
 | |
| 
 | |
| }
 |