mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-11-22 23:50:19 +00:00
a06b277471
The format is quite simply the type index followed by the type in its own native encoding; just implementing the receive side with static typing is a bit convoluted. The only limitation of this implementation is that the variant type has to contain an Empty somewhere as it is not default constructible otherwise. Co-authored-by: Ali Mohammad Pur <mpfard@serenityos.org>
187 lines
5.1 KiB
C++
187 lines
5.1 KiB
C++
/*
|
|
* Copyright (c) 2020, Andreas Kling <kling@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/Concepts.h>
|
|
#include <AK/DeprecatedString.h>
|
|
#include <AK/Forward.h>
|
|
#include <AK/NumericLimits.h>
|
|
#include <AK/StdLibExtras.h>
|
|
#include <AK/Try.h>
|
|
#include <AK/TypeList.h>
|
|
#include <AK/Variant.h>
|
|
#include <LibCore/SharedCircularQueue.h>
|
|
#include <LibCore/Stream.h>
|
|
#include <LibIPC/File.h>
|
|
#include <LibIPC/Forward.h>
|
|
#include <LibIPC/Message.h>
|
|
|
|
namespace IPC {
|
|
|
|
template<typename T>
|
|
inline ErrorOr<void> decode(Decoder&, T&)
|
|
{
|
|
static_assert(DependentFalse<T>, "Base IPC::decoder() instantiated");
|
|
VERIFY_NOT_REACHED();
|
|
}
|
|
|
|
class Decoder {
|
|
public:
|
|
Decoder(InputMemoryStream& stream, Core::Stream::LocalSocket& socket)
|
|
: m_stream(stream)
|
|
, m_socket(socket)
|
|
{
|
|
}
|
|
|
|
ErrorOr<void> decode(bool&);
|
|
ErrorOr<void> decode(u8&);
|
|
ErrorOr<void> decode(u16&);
|
|
ErrorOr<void> decode(unsigned&);
|
|
ErrorOr<void> decode(unsigned long&);
|
|
ErrorOr<void> decode(unsigned long long&);
|
|
ErrorOr<void> decode(i8&);
|
|
ErrorOr<void> decode(i16&);
|
|
ErrorOr<void> decode(i32&);
|
|
ErrorOr<void> decode(i64&);
|
|
ErrorOr<void> decode(float&);
|
|
ErrorOr<void> decode(double&);
|
|
ErrorOr<void> decode(DeprecatedString&);
|
|
ErrorOr<void> decode(ByteBuffer&);
|
|
ErrorOr<void> decode(JsonValue&);
|
|
ErrorOr<void> decode(URL&);
|
|
ErrorOr<void> decode(Dictionary&);
|
|
ErrorOr<void> decode(File&);
|
|
ErrorOr<void> decode(AK::Empty&);
|
|
template<typename K, typename V>
|
|
ErrorOr<void> decode(HashMap<K, V>& hashmap)
|
|
{
|
|
u32 size;
|
|
TRY(decode(size));
|
|
if (size > NumericLimits<i32>::max())
|
|
return Error::from_string_literal("IPC: Invalid HashMap size");
|
|
|
|
for (size_t i = 0; i < size; ++i) {
|
|
K key;
|
|
TRY(decode(key));
|
|
V value;
|
|
TRY(decode(value));
|
|
TRY(hashmap.try_set(move(key), move(value)));
|
|
}
|
|
return {};
|
|
}
|
|
|
|
template<typename K, typename V>
|
|
ErrorOr<void> decode(OrderedHashMap<K, V>& hashmap)
|
|
{
|
|
u32 size;
|
|
TRY(decode(size));
|
|
if (size > NumericLimits<i32>::max())
|
|
return Error::from_string_literal("IPC: Invalid HashMap size");
|
|
|
|
for (size_t i = 0; i < size; ++i) {
|
|
K key;
|
|
TRY(decode(key));
|
|
V value;
|
|
TRY(decode(value));
|
|
TRY(hashmap.try_set(move(key), move(value)));
|
|
}
|
|
return {};
|
|
}
|
|
|
|
template<Enum T>
|
|
ErrorOr<void> decode(T& enum_value)
|
|
{
|
|
UnderlyingType<T> inner_value;
|
|
TRY(decode(inner_value));
|
|
enum_value = T(inner_value);
|
|
return {};
|
|
}
|
|
|
|
template<typename T>
|
|
ErrorOr<void> decode(T& value)
|
|
{
|
|
return IPC::decode(*this, value);
|
|
}
|
|
|
|
template<typename T>
|
|
ErrorOr<void> decode(Vector<T>& vector)
|
|
{
|
|
u64 size;
|
|
TRY(decode(size));
|
|
if (size > NumericLimits<i32>::max())
|
|
return Error::from_string_literal("IPC: Invalid Vector size");
|
|
VERIFY(vector.is_empty());
|
|
TRY(vector.try_ensure_capacity(size));
|
|
for (size_t i = 0; i < size; ++i) {
|
|
T value;
|
|
TRY(decode(value));
|
|
vector.template unchecked_append(move(value));
|
|
}
|
|
return {};
|
|
}
|
|
|
|
template<typename T, size_t Size>
|
|
ErrorOr<void> decode(Core::SharedSingleProducerCircularQueue<T, Size>& queue)
|
|
{
|
|
// FIXME: We don't support decoding into valid queues.
|
|
VERIFY(!queue.is_valid());
|
|
|
|
IPC::File anon_file;
|
|
TRY(decode(anon_file));
|
|
queue = TRY((Core::SharedSingleProducerCircularQueue<T, Size>::try_create(anon_file.take_fd())));
|
|
return {};
|
|
}
|
|
|
|
template<typename... VariantTypes>
|
|
ErrorOr<void> decode(Variant<VariantTypes...>& variant)
|
|
{
|
|
typename AK::Variant<VariantTypes...>::IndexType type_index;
|
|
TRY(decode(type_index));
|
|
if (type_index >= sizeof...(VariantTypes))
|
|
return Error::from_string_literal("IPC: Invalid variant index");
|
|
|
|
TRY((decode_variant<0, sizeof...(VariantTypes), VariantTypes...>(type_index, variant)));
|
|
return {};
|
|
}
|
|
|
|
template<typename T>
|
|
ErrorOr<void> decode(Optional<T>& optional)
|
|
{
|
|
bool has_value;
|
|
TRY(decode(has_value));
|
|
if (!has_value) {
|
|
optional = {};
|
|
return {};
|
|
}
|
|
T value;
|
|
TRY(decode(value));
|
|
optional = move(value);
|
|
return {};
|
|
}
|
|
|
|
private:
|
|
template<size_t CurrentIndex, size_t Max, typename... VariantTypes>
|
|
ErrorOr<void> decode_variant(size_t index, Variant<VariantTypes...>& variant)
|
|
{
|
|
if constexpr (CurrentIndex < Max) {
|
|
if (index == CurrentIndex) {
|
|
typename TypeList<VariantTypes...>::template Type<CurrentIndex> element;
|
|
TRY(decode(element));
|
|
variant.set(move(element));
|
|
return {};
|
|
}
|
|
return decode_variant<CurrentIndex + 1, Max, VariantTypes...>(index, variant);
|
|
} else {
|
|
VERIFY_NOT_REACHED();
|
|
}
|
|
}
|
|
|
|
InputMemoryStream& m_stream;
|
|
Core::Stream::LocalSocket& m_socket;
|
|
};
|
|
|
|
}
|