1
0
mirror of https://github.com/SerenityOS/serenity synced 2024-07-05 22:34:49 +00:00

AK: Avoid the use of typeinfo in Variant

typeid() and RTTI was a nice clutch to implement this, but let's move
away from the horrible slowness and implement variants using type
indices for faster variants.
This commit is contained in:
Ali Mohammad Pur 2021-05-08 23:38:34 +04:30 committed by Linus Groh
parent 659c22e17e
commit 3038b6b7dc

View File

@ -9,72 +9,102 @@
#include <AK/Array.h>
#include <AK/BitCast.h>
#include <AK/StdLibExtras.h>
#include <typeinfo>
namespace AK::Detail {
template<typename... Ts>
struct Variant;
template<typename T, typename IndexType, IndexType InitialIndex, typename... InTypes>
struct VariantIndexOf {
static_assert(DependentFalse<T, IndexType, InTypes...>, "Invalid VariantIndex instantiated");
};
template<typename F, typename... Ts>
struct Variant<F, Ts...> {
static void delete_(const std::type_info& id, void* data)
template<typename T, typename IndexType, IndexType InitialIndex, typename InType, typename... RestOfInTypes>
struct VariantIndexOf<T, IndexType, InitialIndex, InType, RestOfInTypes...> {
consteval IndexType operator()()
{
if (id == typeid(F))
bit_cast<F*>(data)->~F();
if constexpr (IsSame<T, InType>)
return InitialIndex;
else
Variant<Ts...>::delete_(id, data);
}
static void move_(const std::type_info& old_id, void* old_data, void* new_data)
{
if (old_id == typeid(F))
new (new_data) F(move(*bit_cast<F*>(old_data)));
else
Variant<Ts...>::move_(old_id, old_data, new_data);
}
static void copy_(const std::type_info& old_id, const void* old_data, void* new_data)
{
if (old_id == typeid(F))
new (new_data) F(*bit_cast<F*>(old_data));
else
Variant<Ts...>::copy_(old_id, old_data, new_data);
}
template<typename Visitor>
static void visit_(const std::type_info& id, void* data, Visitor&& visitor)
{
if (id == typeid(F))
visitor(*bit_cast<F*>(data));
else
Variant<Ts...>::visit_(id, data, forward<Visitor>(visitor));
}
template<typename Visitor>
static void visit_(const std::type_info& id, const void* data, Visitor&& visitor)
{
if (id == typeid(F))
visitor(*bit_cast<const F*>(data));
else
Variant<Ts...>::visit_(id, data, forward<Visitor>(visitor));
return VariantIndexOf<T, IndexType, InitialIndex + 1, RestOfInTypes...> {}();
}
};
template<>
struct Variant<> {
static void delete_(const std::type_info&, void*) { }
static void move_(const std::type_info&, void*, void*) { }
static void copy_(const std::type_info&, const void*, void*) { }
template<typename T, typename IndexType, IndexType InitialIndex>
struct VariantIndexOf<T, IndexType, InitialIndex> {
consteval IndexType operator()() { return InitialIndex; }
};
template<typename T, typename IndexType, typename... Ts>
consteval IndexType index_of()
{
return VariantIndexOf<T, IndexType, 0, Ts...> {}();
}
template<typename IndexType, IndexType InitialIndex, typename... Ts>
struct Variant;
template<typename IndexType, IndexType InitialIndex, typename F, typename... Ts>
struct Variant<IndexType, InitialIndex, F, Ts...> {
static constexpr auto current_index = VariantIndexOf<F, IndexType, InitialIndex, F, Ts...> {}();
static void delete_(IndexType id, void* data)
{
if (id == current_index)
bit_cast<F*>(data)->~F();
else
Variant<IndexType, InitialIndex + 1, Ts...>::delete_(id, data);
}
static void move_(IndexType old_id, void* old_data, void* new_data)
{
if (old_id == current_index)
new (new_data) F(move(*bit_cast<F*>(old_data)));
else
Variant<IndexType, InitialIndex + 1, Ts...>::move_(old_id, old_data, new_data);
}
static void copy_(IndexType old_id, const void* old_data, void* new_data)
{
if (old_id == current_index)
new (new_data) F(*bit_cast<F*>(old_data));
else
Variant<IndexType, InitialIndex + 1, Ts...>::copy_(old_id, old_data, new_data);
}
template<typename Visitor>
static void visit_(const std::type_info&, void*, Visitor&&) { }
static void visit_(IndexType id, void* data, Visitor&& visitor)
{
if (id == current_index)
visitor(*bit_cast<F*>(data));
else
Variant<IndexType, InitialIndex + 1, Ts...>::visit_(id, data, forward<Visitor>(visitor));
}
template<typename Visitor>
static void visit_(const std::type_info&, const void*, Visitor&&) { }
static void visit_(IndexType id, const void* data, Visitor&& visitor)
{
if (id == current_index)
visitor(*bit_cast<const F*>(data));
else
Variant<IndexType, InitialIndex + 1, Ts...>::visit_(id, data, forward<Visitor>(visitor));
}
};
template<typename IndexType, IndexType InitialIndex>
struct Variant<IndexType, InitialIndex> {
static void delete_(IndexType, void*) { }
static void move_(IndexType, void*, void*) { }
static void copy_(IndexType, const void*, void*) { }
template<typename Visitor>
static void visit_(IndexType, void*, Visitor&&) { }
template<typename Visitor>
static void visit_(IndexType, const void*, Visitor&&) { }
};
struct VariantNoClearTag {
explicit VariantNoClearTag() = default;
};
struct VariantConstructTag {
explicit VariantConstructTag() = default;
};
template<typename T, typename Base>
struct VariantConstructors {
@ -118,15 +148,22 @@ struct Empty {
template<typename... Ts>
struct Variant
: public Detail::VariantConstructors<Ts, Variant<Ts...>>... {
private:
using IndexType = Conditional<sizeof...(Ts) < 255, u8, size_t>; // Note: size+1 reserved for internal value checks
static constexpr IndexType invalid_index = sizeof...(Ts);
template<typename T>
static constexpr IndexType index_of() { return Detail::index_of<T, IndexType, Ts...>(); }
public:
template<typename... NewTs>
friend struct Variant;
Variant(const Variant& old)
: Detail::VariantConstructors<Ts, Variant<Ts...>>()...
, m_type_info(old.m_type_info)
, m_index(old.m_index)
{
Helper::copy_(*old.m_type_info, old.m_data, m_data);
Helper::copy_(old.m_index, old.m_data, m_data);
}
// Note: A moved-from variant emulates the state of the object it contains
@ -135,129 +172,139 @@ struct Variant
// but it will still contain the "moved-from" state of the object it previously contained.
Variant(Variant&& old)
: Detail::VariantConstructors<Ts, Variant<Ts...>>()...
, m_type_info(old.m_type_info)
, m_index(old.m_index)
{
Helper::move_(*old.m_type_info, old.m_data, m_data);
Helper::move_(old.m_index, old.m_data, m_data);
}
~Variant()
{
Helper::delete_(*m_type_info, m_data);
Helper::delete_(m_index, m_data);
}
Variant& operator=(const Variant& other)
{
m_type_info = other.m_type_info;
Helper::copy_(*other.m_type_info, other.m_data, m_data);
m_index = other.m_index;
Helper::copy_(other.m_index, other.m_data, m_data);
return *this;
}
Variant& operator=(Variant&& other)
{
m_type_info = other.m_type_info;
Helper::move_(*other.m_type_info, other.m_data, m_data);
m_index = other.m_index;
Helper::move_(other.m_index, other.m_data, m_data);
return *this;
}
using Detail::VariantConstructors<Ts, Variant<Ts...>>::VariantConstructors...;
template<typename T>
void set(T&& t)
void set(T&& t) requires(index_of<T>() != invalid_index)
{
Helper::delete_(*m_type_info, m_data);
new (m_data) T(forward<T>(t));
m_type_info = &typeid(T);
using StrippedT = RemoveCV<RemoveReference<T>>;
constexpr auto new_index = index_of<StrippedT>();
Helper::delete_(m_index, m_data);
new (m_data) StrippedT(forward<T>(t));
m_index = new_index;
}
template<typename T>
void set(T&& t, Detail::VariantNoClearTag)
{
new (m_data) T(forward<T>(t));
m_type_info = &typeid(T);
using StrippedT = RemoveCV<RemoveReference<T>>;
constexpr auto new_index = index_of<StrippedT>();
new (m_data) StrippedT(forward<T>(t));
m_index = new_index;
}
template<typename T>
T* get_pointer()
{
if (typeid(T) == *m_type_info)
return reinterpret_cast<T*>(m_data);
if (index_of<T>() == m_index)
return bit_cast<T*>(&m_data);
return nullptr;
}
template<typename T>
T& get()
[[gnu::noinline]] T& get()
{
VERIFY(typeid(T) == *m_type_info);
return *reinterpret_cast<T*>(m_data);
VERIFY(has<T>());
return *bit_cast<T*>(&m_data);
}
template<typename T>
const T* get_pointer() const
[[gnu::noinline]] const T* get_pointer() const
{
if (typeid(T) == *m_type_info)
return reinterpret_cast<const T*>(m_data);
if (index_of<T>() == m_index)
return bit_cast<const T*>(&m_data);
return nullptr;
}
template<typename T>
const T& get() const
[[gnu::noinline]] const T& get() const
{
VERIFY(typeid(T) == *m_type_info);
return *reinterpret_cast<const T*>(m_data);
VERIFY(has<T>());
return *bit_cast<const T*>(&m_data);
}
template<typename T>
[[nodiscard]] bool has() const
{
return typeid(T) == *m_type_info;
return index_of<T>() == m_index;
}
template<typename... Fs>
void visit(Fs&&... functions)
{
Visitor<Fs...> visitor { forward<Fs>(functions)... };
Helper::visit_(*m_type_info, m_data, visitor);
Helper::visit_(m_index, m_data, visitor);
}
template<typename... Fs>
void visit(Fs&&... functions) const
{
Visitor<Fs...> visitor { forward<Fs>(functions)... };
Helper::visit_(*m_type_info, m_data, visitor);
Helper::visit_(m_index, m_data, visitor);
}
template<typename... NewTs>
Variant<NewTs...> downcast() &&
{
VERIFY(covers<NewTs...>());
Variant<NewTs...> instance { m_type_info };
Helper::move_(*m_type_info, m_data, instance.m_data);
Variant<NewTs...> instance { Variant<NewTs...>::invalid_index, Detail::VariantConstructTag {} };
visit([&](auto& value) {
if constexpr (Variant<NewTs...>::template can_contain<RemoveCV<RemoveReference<decltype(value)>>>())
instance.set(move(value), Detail::VariantNoClearTag {});
});
VERIFY(instance.m_index != instance.invalid_index);
return instance;
}
template<typename... NewTs>
Variant<NewTs...> downcast() &
{
VERIFY(covers<NewTs...>());
Variant<NewTs...> instance { m_type_info };
Helper::copy_(*m_type_info, m_data, instance.m_data);
Variant<NewTs...> instance { Variant<NewTs...>::invalid_index, Detail::VariantConstructTag {} };
visit([&](const auto& value) {
if constexpr (Variant<NewTs...>::template can_contain<RemoveCV<RemoveReference<decltype(value)>>>())
instance.set(value, Detail::VariantNoClearTag {});
});
VERIFY(instance.m_index != instance.invalid_index);
return instance;
}
template<typename T>
static constexpr bool can_contain()
{
return index_of<T>() != invalid_index;
}
private:
static constexpr auto data_size = integer_sequence_generate_array<size_t>(0, IntegerSequence<size_t, sizeof(Ts)...>()).max();
static constexpr auto data_alignment = integer_sequence_generate_array<size_t>(0, IntegerSequence<size_t, alignof(Ts)...>()).max();
using Helper = Detail::Variant<Ts...>;
using Helper = Detail::Variant<IndexType, 0, Ts...>;
template<typename... NewTs>
bool covers() const
{
return ((typeid(NewTs) == *m_type_info) || ...);
}
explicit Variant(const std::type_info* type_info)
: Detail::VariantConstructors<Ts, Variant<Ts...>>()...
, m_type_info(type_info)
explicit Variant(IndexType index, Detail::VariantConstructTag)
: Detail::MergeAndDeduplicatePacks<Detail::VariantConstructors<Ts, Variant<Ts...>>...>()
, m_index(index)
{
}
@ -275,7 +322,7 @@ private:
// Note: Make sure not to default-initialize!
// VariantConstructors::VariantConstructors(T) will set this to the correct value
// So default-constructing to anything will leave the first initialization with that value instead of the correct one.
const std::type_info* m_type_info;
IndexType m_index;
};
}