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
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/IntrusiveList.h>
|
|
#include <AK/NonnullOwnPtr.h>
|
|
#include <LibJS/Forward.h>
|
|
#include <LibJS/Heap/HeapBlock.h>
|
|
|
|
namespace JS {
|
|
|
|
class CellAllocator {
|
|
public:
|
|
explicit CellAllocator(size_t cell_size);
|
|
~CellAllocator() = default;
|
|
|
|
size_t cell_size() const { return m_cell_size; }
|
|
|
|
Cell* allocate_cell(Heap&);
|
|
|
|
template<typename Callback>
|
|
IterationDecision for_each_block(Callback callback)
|
|
{
|
|
for (auto& block : m_full_blocks) {
|
|
if (callback(block) == IterationDecision::Break)
|
|
return IterationDecision::Break;
|
|
}
|
|
for (auto& block : m_usable_blocks) {
|
|
if (callback(block) == IterationDecision::Break)
|
|
return IterationDecision::Break;
|
|
}
|
|
return IterationDecision::Continue;
|
|
}
|
|
|
|
void block_did_become_empty(Badge<Heap>, HeapBlock&);
|
|
void block_did_become_usable(Badge<Heap>, HeapBlock&);
|
|
|
|
private:
|
|
const size_t m_cell_size;
|
|
|
|
using BlockList = IntrusiveList<&HeapBlock::m_list_node>;
|
|
BlockList m_full_blocks;
|
|
BlockList m_usable_blocks;
|
|
};
|
|
|
|
}
|