mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2025-07-16 05:51:55 +00:00
6b08a52c8b
`ConservativeVector`, `RootVector` and `RootHashMap` are final types, and their base classes have a protected destructor, so when their destructor is called, the static and dynamic types will be the same (can't destruct them through a pointer to a base or derived class). Therefore, there is no need for a virtual destructor. This fixes the newly introduced `-Wunnecessary-virtual-specifier` Clang warning (llvm/llvm-project#131188).
99 lines
2.3 KiB
C++
99 lines
2.3 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();
|
|
|
|
void assign_heap(Heap*);
|
|
|
|
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> {
|
|
|
|
using VectorBase = Vector<T, inline_capacity>;
|
|
|
|
public:
|
|
explicit RootVector(Heap& heap)
|
|
: RootVectorBase(heap)
|
|
{
|
|
}
|
|
|
|
~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)
|
|
, VectorBase(move(static_cast<VectorBase&>(other)))
|
|
{
|
|
}
|
|
|
|
RootVector& operator=(RootVector const& other)
|
|
{
|
|
if (&other == this)
|
|
return *this;
|
|
|
|
assign_heap(other.m_heap);
|
|
VectorBase::operator=(other);
|
|
return *this;
|
|
}
|
|
|
|
RootVector& operator=(RootVector&& other)
|
|
{
|
|
assign_heap(other.m_heap);
|
|
VectorBase::operator=(move(static_cast<VectorBase&>(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 });
|
|
}
|
|
}
|
|
}
|
|
};
|
|
|
|
}
|