mirror of
https://github.com/RGBCube/serenity
synced 2025-10-31 01:22:43 +00:00
c541310e19
This way we don't need to deal with shifting vector storage, and most operations are upgraded from O(n) to O(1) :^)
69 lines
2.2 KiB
C++
69 lines
2.2 KiB
C++
/*
|
|
* Copyright (c) 2020, Andreas Kling <kling@serenityos.org>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#include <AK/Badge.h>
|
|
#include <LibJS/Heap/Allocator.h>
|
|
#include <LibJS/Heap/HeapBlock.h>
|
|
|
|
namespace JS {
|
|
|
|
Allocator::Allocator(size_t cell_size)
|
|
: m_cell_size(cell_size)
|
|
{
|
|
}
|
|
|
|
Allocator::~Allocator()
|
|
{
|
|
}
|
|
|
|
Cell* Allocator::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();
|
|
ASSERT(cell);
|
|
if (block.is_full())
|
|
m_full_blocks.append(*m_usable_blocks.last());
|
|
return cell;
|
|
}
|
|
|
|
void Allocator::block_did_become_empty(Badge<Heap>, HeapBlock& block)
|
|
{
|
|
block.m_list_node.remove();
|
|
delete █
|
|
}
|
|
|
|
void Allocator::block_did_become_usable(Badge<Heap>, HeapBlock& block)
|
|
{
|
|
ASSERT(!block.is_full());
|
|
m_usable_blocks.append(block);
|
|
}
|
|
|
|
}
|