mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2025-12-05 01:10:24 +00:00
f87041bf3a
Some checks failed
CI / Lagom (false, FUZZ, ubuntu-24.04, Linux, Clang) (push) Has been cancelled
CI / Lagom (false, NO_FUZZ, macos-15, macOS, Clang) (push) Has been cancelled
CI / Lagom (false, NO_FUZZ, ubuntu-24.04, Linux, GNU) (push) Has been cancelled
CI / Lagom (true, NO_FUZZ, ubuntu-24.04, Linux, Clang) (push) Has been cancelled
Package the js repl as a binary artifact / build-and-package (macos-14, macOS, macOS-universal2) (push) Has been cancelled
Package the js repl as a binary artifact / build-and-package (ubuntu-24.04, Linux, Linux-x86_64) (push) Has been cancelled
Run test262 and test-wasm / run_and_update_results (push) Has been cancelled
Lint Code / lint (push) Has been cancelled
Push notes / build (push) Has been cancelled
Resulting in a massive rename across almost everywhere! Alongside the namespace change, we now have the following names: * JS::NonnullGCPtr -> GC::Ref * JS::GCPtr -> GC::Ptr * JS::HeapFunction -> GC::Function * JS::CellImpl -> GC::Cell * JS::Handle -> GC::Root
78 lines
1.9 KiB
C++
78 lines
1.9 KiB
C++
/*
|
|
* Copyright (c) 2024, Andreas Kling <andreas@ladybird.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 ConservativeVectorBase {
|
|
public:
|
|
virtual ReadonlySpan<FlatPtr> possible_values() const = 0;
|
|
|
|
protected:
|
|
explicit ConservativeVectorBase(Heap&);
|
|
~ConservativeVectorBase();
|
|
|
|
ConservativeVectorBase& operator=(ConservativeVectorBase const&);
|
|
|
|
Heap* m_heap { nullptr };
|
|
IntrusiveListNode<ConservativeVectorBase> m_list_node;
|
|
|
|
public:
|
|
using List = IntrusiveList<&ConservativeVectorBase::m_list_node>;
|
|
};
|
|
|
|
template<typename T, size_t inline_capacity>
|
|
class ConservativeVector final
|
|
: public ConservativeVectorBase
|
|
, public Vector<T, inline_capacity> {
|
|
|
|
public:
|
|
explicit ConservativeVector(Heap& heap)
|
|
: ConservativeVectorBase(heap)
|
|
{
|
|
}
|
|
|
|
virtual ~ConservativeVector() = default;
|
|
|
|
ConservativeVector(ConservativeVector const& other)
|
|
: ConservativeVectorBase(*other.m_heap)
|
|
, Vector<T, inline_capacity>(other)
|
|
{
|
|
}
|
|
|
|
ConservativeVector(ConservativeVector&& other)
|
|
: ConservativeVectorBase(*other.m_heap)
|
|
, Vector<T, inline_capacity>(move(static_cast<Vector<T, inline_capacity>&>(other)))
|
|
{
|
|
}
|
|
|
|
ConservativeVector& operator=(ConservativeVector const& other)
|
|
{
|
|
Vector<T, inline_capacity>::operator=(other);
|
|
ConservativeVectorBase::operator=(other);
|
|
return *this;
|
|
}
|
|
|
|
virtual ReadonlySpan<FlatPtr> possible_values() const override
|
|
{
|
|
static_assert(sizeof(T) >= sizeof(FlatPtr));
|
|
return ReadonlySpan<FlatPtr> {
|
|
reinterpret_cast<FlatPtr const*>(this->data()),
|
|
this->size() * sizeof(T) / sizeof(FlatPtr),
|
|
};
|
|
}
|
|
};
|
|
|
|
}
|