ladybird/Libraries/LibGC/RootVector.h

87 lines
2.1 KiB
C++

/*
* Copyright (c) 2021, Andreas Kling <andreas@ladybird.org>
* Copyright (c) 2022, Linus Groh <linusg@serenityos.org>
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#pragma once
#include <AK/HashMap.h>
#include <AK/IntrusiveList.h>
#include <AK/Vector.h>
#include <LibGC/Cell.h>
#include <LibGC/Forward.h>
#include <LibGC/HeapRoot.h>
namespace GC {
class RootVectorBase {
public:
virtual void gather_roots(HashMap<Cell*, GC::HeapRoot>&) const = 0;
protected:
explicit RootVectorBase(Heap&);
~RootVectorBase();
RootVectorBase& operator=(RootVectorBase const&);
Heap* m_heap { nullptr };
IntrusiveListNode<RootVectorBase> m_list_node;
public:
using List = IntrusiveList<&RootVectorBase::m_list_node>;
};
template<typename T, size_t inline_capacity>
class RootVector final
: public RootVectorBase
, public Vector<T, inline_capacity> {
public:
explicit RootVector(Heap& heap)
: RootVectorBase(heap)
{
}
virtual ~RootVector() = default;
RootVector(Heap& heap, ReadonlySpan<T> other)
: RootVectorBase(heap)
, Vector<T, inline_capacity>(other)
{
}
RootVector(RootVector const& other)
: RootVectorBase(*other.m_heap)
, Vector<T, inline_capacity>(other)
{
}
RootVector(RootVector&& other)
: RootVectorBase(*other.m_heap)
, Vector<T, inline_capacity>(move(static_cast<Vector<T, inline_capacity>&>(other)))
{
}
RootVector& operator=(RootVector const& other)
{
Vector<T, inline_capacity>::operator=(other);
RootVectorBase::operator=(other);
return *this;
}
virtual void gather_roots(HashMap<Cell*, GC::HeapRoot>& roots) const override
{
for (auto& value : *this) {
if constexpr (IsBaseOf<NanBoxedValue, T>) {
if (value.is_cell())
roots.set(&const_cast<T&>(value).as_cell(), HeapRoot { .type = HeapRoot::Type::RootVector });
} else {
roots.set(value, HeapRoot { .type = HeapRoot::Type::RootVector });
}
}
}
};
}