auto res = mapped_name_by_decorated_name(str.c_str());

if (res == str.c_str()) return std::move(str);

return res;

auto ns = sink->get_namespace();

if (ns) ns->write(sink, addr);

else throw std::runtime_error("unable to serialize actor_addr: "

"no actor addressing defined");

auto ns = source->get_namespace();

if (ns) addr = ns->read(source);

else throw std::runtime_error("unable to deserialize actor_ptr: "

"no actor addressing defined");

actor_addr addr;

deserialize_impl(addr, source);

ptr = detail::raw_access::unsafe_cast(addr);

if (!gref) {

CPPA_LOGF_DEBUG("serialized an invalid group");

// write an empty string as module name

std::string empty_string;

sink->write_value(empty_string);

}

else {

sink->write_value(gref->module_name());

gref->serialize(sink);

}

auto modname = source->read<std::string>();

if (modname.empty()) gref = invalid_group;

else gref = group::get_module(modname)->deserialize(source);

// channel is an abstract base class that's either an actor or a group

// to indicate that, we write a flag first, that is

// 0 if ptr == nullptr

// 1 if ptr points to an actor

// 2 if ptr points to a group

uint8_t flag = 0;

auto wr_nullptr = [&] {

sink->write_value(flag);

};

if (!chref) {

// invalid channel

wr_nullptr();

}

else {

// raw pointer

auto rptr = detail::raw_access::get(chref);

// raw actor pointer

auto aptr = dynamic_cast<abstract_actor*>(rptr);

if (aptr != nullptr) {

flag = 1;

sink->write_value(flag);

serialize_impl(detail::raw_access::unsafe_cast(aptr), sink);

}

else {

// get raw group pointer and store it inside a group handle

group tmp{dynamic_cast<abstract_group*>(rptr)};

if (tmp) {

flag = 2;

sink->write_value(flag);

serialize_impl(tmp, sink);

}

else {

CPPA_LOGF_ERROR("ptr is neither an actor nor a group");

wr_nullptr();

}

}

}

auto flag = source->read<uint8_t>();

switch (flag) {

case 0: {

ptrref = channel{}; //ptrref.reset();

break;

}

case 1: {

actor tmp;

deserialize_impl(tmp, source);

ptrref = detail::raw_access::get(tmp);

break;

}

case 2: {

group tmp;

deserialize_impl(tmp, source);

ptrref = tmp;

break;

}

default: {

CPPA_LOGF_ERROR("invalid flag while deserializing 'channel'");

throw std::runtime_error("invalid flag");

}

}

auto tname = tup.tuple_type_names();

auto uti = get_uniform_type_info_map()

->by_uniform_name(tname

? *tname

: detail::get_tuple_type_names(*tup.vals()));

if (uti == nullptr) {

std::string err = "could not get uniform type info for \"";

err += tname ? *tname : detail::get_tuple_type_names(*tup.vals());

err += "\"";

CPPA_LOGF_ERROR(err);

throw std::runtime_error(err);

}

sink->begin_object(uti);

for (size_t i = 0; i < tup.size(); ++i) {

tup.type_at(i)->serialize(tup.at(i), sink);

}

sink->end_object();

auto uti = source->begin_object();

auto ptr = uti->new_instance();

auto ptr_guard = util::make_scope_guard([&] {

uti->delete_instance(ptr);

});

uti->deserialize(ptr, source);

source->end_object();

atref = uti->as_any_tuple(ptr);

serialize_impl(hdr.sender, sink);

serialize_impl(hdr.receiver, sink);

sink->write_value(hdr.id.integer_value());

deserialize_impl(hdr.sender, source);

deserialize_impl(hdr.receiver, source);

hdr.id = message_id::from_integer_value(source->read<std::uint64_t>());

if (ptr == nullptr) {

node_id::serialize_invalid(sink);

}

else {

sink->write_value(ptr->process_id());

sink->write_raw(ptr->host_id().size(), ptr->host_id().data());

}

node_id::host_id_type nid;

auto pid = source->read<uint32_t>();

source->read_raw(node_id::host_id_size, nid.data());

auto is_zero = [](uint8_t value) { return value == 0; };

if (pid == 0 && std::all_of(nid.begin(), nid.end(), is_zero)) {

// invalid process information (nullptr)

ptr.reset();

}

else ptr.reset(new node_id{pid, nid});

auto unit_val = source->read<uint32_t>();

auto count_val = source->read<uint32_t>();

switch (unit_val) {

case 1:

val.unit = util::time_unit::seconds;

break;

case 1000:

val.unit = util::time_unit::milliseconds;

break;

case 1000000:

val.unit = util::time_unit::microseconds;

break;

default:

val.unit = util::time_unit::none;

break;

}

val.count = count_val;

// in some cases (when dealing with dynamic libraries),

// address can be different although types are equal

return lhs == rhs || *lhs == *rhs;

protected:

uti_base() : m_native(&typeid(T)) { }

bool equal_to(const std::type_info& ti) const override {

return types_equal(m_native, &ti);

}

bool equals(const void* lhs, const void* rhs) const override {

return deref(lhs) == deref(rhs);

}

void* new_instance(const void* ptr) const override {

return (ptr) ? new T(deref(ptr)) : new T;

}

void delete_instance(void* instance) const override {

delete reinterpret_cast<T*>(instance);

}

any_tuple as_any_tuple(void* instance) const override {

return make_any_tuple(deref(instance));

}

static inline const T& deref(const void* ptr) {

return *reinterpret_cast<const T*>(ptr);

}

static inline T& deref(void* ptr) {

return *reinterpret_cast<T*>(ptr);

}

const std::type_info* m_native;

typedef uti_base<T> super;

public:

const char* name() const {

return mapped_name<T>();

}

protected:

void serialize(const void* instance, serializer* sink) const {

serialize_impl(super::deref(instance), sink);

}

void deserialize(void* instance, deserializer* source) const {

deserialize_impl(super::deref(instance), source);

}

public:

void add_native_type(const std::type_info& ti) {

// only push back if not already set

auto predicate = [&](const std::type_info* ptr) { return ptr == &ti; };

if (std::none_of(m_natives.begin(), m_natives.end(), predicate))

m_natives.push_back(&ti);

}

protected:

std::vector<const std::type_info*> m_natives;

public:

void serialize(const void* instance, serializer* sink) const override {

sink->write_value(deref(instance));

}

void deserialize(void* instance, deserializer* source) const override {

deref(instance) = source->read<T>();

}

const char* name() const override {

return static_name();

}

any_tuple as_any_tuple(void* instance) const override {

return make_any_tuple(deref(instance));

}

protected:

bool equal_to(const std::type_info& ti) const override {

auto tptr = &ti;

return std::any_of(m_natives.begin(), m_natives.end(),

[tptr](const std::type_info* ptr) {

return types_equal(ptr, tptr);

});

}

bool equals(const void* lhs, const void* rhs) const override {

return deref(lhs) == deref(rhs);

}

void* new_instance(const void* ptr) const override {

return (ptr) ? new T(deref(ptr)) : new T;

}

void delete_instance(void* instance) const override {

delete reinterpret_cast<T*>(instance);

}

private:

inline static const T& deref(const void* ptr) {

return *reinterpret_cast<const T*>(ptr);

}

inline static T& deref(void* ptr) {

return *reinterpret_cast<T*>(ptr);

}

static inline const char* static_name() {

return mapped_int_name<T>();

}

public:

void serialize(const void* instance, serializer* sink) const {

auto& val = deref(instance);

sink->write_value(static_cast<uint32_t>(val.size()));

sink->write_raw(val.size(), val.data());

}

void deserialize(void* instance, deserializer* source) const {

auto s = source->read<uint32_t>();

source->read_raw(s, deref(instance));

}

const char* name() const {

return static_name();

}

any_tuple as_any_tuple(void* instance) const override {

return make_any_tuple(deref(instance));

}

protected:

bool equal_to(const std::type_info& ti) const override {

return ti == typeid(util::buffer);

}

bool equals(const void* vlhs, const void* vrhs) const override {

auto& lhs = deref(vlhs);

auto& rhs = deref(vrhs);

return (lhs.empty() && rhs.empty())

|| ( lhs.size() == rhs.size()

&& memcmp(lhs.data(), rhs.data(), lhs.size()) == 0);

}

void* new_instance(const void* ptr) const override {

return (ptr) ? new util::buffer(deref(ptr)) : new util::buffer;

}

void delete_instance(void* instance) const override {

delete reinterpret_cast<util::buffer*>(instance);

}

private:

static inline util::buffer& deref(void* ptr) {

return *reinterpret_cast<util::buffer*>(ptr);

}

static inline const util::buffer& deref(const void* ptr) {

return *reinterpret_cast<const util::buffer*>(ptr);

}

static inline const char* static_name() {

return "@buffer";

}

public:

default_meta_tuple(const std::string& name) {

m_name = name;

auto elements = util::split(name, '+', false);

auto uti_map = get_uniform_type_info_map();

CPPA_REQUIRE(elements.size() > 0 && elements.front() == "@<>");

// ignore first element, because it's always "@<>"

for (size_t i = 1; i != elements.size(); ++i) {

try { m_elements.push_back(uti_map->by_uniform_name(elements[i])); }

catch (std::exception&) {

CPPA_LOG_ERROR("type name " << elements[i] << " not found");

}

}

}

void* new_instance(const void* instance = nullptr) const override {

object_array* result = nullptr;

if (instance) result = new object_array{*cast(instance)};

else {

result = new object_array;

for (auto uti : m_elements) result->push_back(uti->create());

}

result->ref();

return result;

}

void delete_instance(void* ptr) const override {

cast(ptr)->deref();

}

any_tuple as_any_tuple(void* ptr) const override {

return any_tuple{static_cast<any_tuple::raw_ptr>(cast(ptr))};

}

const char* name() const override {

return m_name.c_str();

}

void serialize(const void* ptr, serializer* sink) const override {

auto& oarr = *cast(ptr);

for (size_t i = 0; i < m_elements.size(); ++i) {

m_elements[i]->serialize(oarr.at(i), sink);

}

}

void deserialize(void* ptr, deserializer* source) const override {

auto& oarr = *cast(ptr);

for (size_t i = 0; i < m_elements.size(); ++i) {

m_elements[i]->deserialize(oarr.mutable_at(i), source);

}

}

bool equal_to(const std::type_info&) const override {

return false;

}

bool equals(const void* instance1, const void* instance2) const override {

auto& lhs = *cast(instance1);

auto& rhs = *cast(instance2);

full_eq_type cmp;

return std::equal(lhs.begin(), lhs.end(), rhs.begin(), cmp);

}

private:

std::string m_name;

std::vector<const uniform_type_info*> m_elements;

inline object_array* cast(void* ptr) const {

return reinterpret_cast<object_array*>(ptr);

}

inline const object_array* cast(const void* ptr) const {

return reinterpret_cast<const object_array*>(ptr);

}

public:

void initialize() {

// maps sizeof(integer_type) to {signed_type, unsigned_type}

abstract_int_tinfo* mapping[][2] = {

{nullptr, nullptr}, // no integer type for sizeof(T) == 0

{&m_type_u8, &m_type_i8},

{&m_type_u16, &m_type_i16},

{nullptr, nullptr}, // no integer type for sizeof(T) == 3

{&m_type_u32, &m_type_i32},

{nullptr, nullptr}, // no integer type for sizeof(T) == 5

{nullptr, nullptr}, // no integer type for sizeof(T) == 6

{nullptr, nullptr}, // no integer type for sizeof(T) == 7

{&m_type_u64, &m_type_i64}

};

push_native_type<char, signed char,

unsigned char, short,

signed short, unsigned short,

short int, signed short int,

unsigned short int, int,

signed int, unsigned int,

long int, signed long int,

unsigned long int, long,

signed long, unsigned long,

long long, signed long long,

unsigned long long, wchar_t,

std::int8_t, std::uint8_t,

std::int16_t, std::uint16_t,

std::int32_t, std::uint32_t,

std::int64_t, std::uint64_t,

char16_t, char32_t,

size_t, ptrdiff_t,

intptr_t >(mapping);

// fill builtin types *in sorted order* (by uniform name)

auto i = m_builtin_types.begin();

*i++ = &m_type_unit; // @0

*i++ = &m_ac_hdl; // @ac_hdl

*i++ = &m_type_actor; // @actor

*i++ = &m_type_actor_addr; // @actor_addr

*i++ = &m_type_atom; // @atom

*i++ = &m_type_buffer; // @buffer

*i++ = &m_type_channel; // @channel

*i++ = &m_cn_hdl; // @cn_hdl

*i++ = &m_type_down_msg; // @down

*i++ = &m_type_duration; // @duration

*i++ = &m_type_exit_msg; // @exit

*i++ = &m_type_group; // @group

*i++ = &m_type_group_down; // @group_down

*i++ = &m_type_header; // @header

*i++ = &m_type_i16; // @i16

*i++ = &m_type_i32; // @i32

*i++ = &m_type_i64; // @i64

*i++ = &m_type_i8; // @i8

*i++ = &m_type_long_double; // @ldouble

*i++ = &m_type_proc; // @proc

*i++ = &m_type_str; // @str

*i++ = &m_type_strmap; // @strmap

*i++ = &m_type_sync_exited; // @sync_exited

*i++ = &m_type_sync_timeout; // @sync_timeout

*i++ = &m_type_timeout; // @timeout

*i++ = &m_type_tuple; // @tuple

*i++ = &m_type_u16; // @u16

*i++ = &m_type_u16str; // @u16str

*i++ = &m_type_u32; // @u32

*i++ = &m_type_u32str; // @u32str

*i++ = &m_type_u64; // @u64

*i++ = &m_type_u8; // @u8

*i++ = &m_type_bool; // bool

*i++ = &m_type_double; // double

*i++ = &m_type_float; // float

CPPA_REQUIRE(i == m_builtin_types.end());

# if CPPA_DEBUG_MODE

auto cmp = [](pointer lhs, pointer rhs) {

return strcmp(lhs->name(), rhs->name()) < 0;

};

auto& arr = m_builtin_types;

if (!std::is_sorted(arr.begin(), arr.end(), cmp)) {

std::cerr << "FATAL: uniform type map not sorted" << std::endl

<< "order is:" << std::endl;

for (auto ptr : arr) std::cerr << ptr->name() << std::endl;

std::sort(arr.begin(), arr.end(), cmp);

std::cerr << std::endl << "order should be:" << std::endl;

for (auto ptr : arr) std::cerr << ptr->name() << std::endl;

abort();

}

auto cmp2 = [](const char** lhs, const char** rhs) {

return strcmp(lhs[0], rhs[0]) < 0;

};

if (!std::is_sorted(std::begin(mapped_type_names),

std::end(mapped_type_names), cmp2)) {

std::cerr << "FATAL: mapped_type_names not sorted" << std::endl;

abort();

}

# endif

// insert default hints

push_hint<atom_value>(this);

push_hint<atom_value, std::uint32_t>(this);

push_hint<atom_value, node_id_ptr>(this);

push_hint<atom_value, actor>(this);

push_hint<atom_value, node_id_ptr, std::uint32_t, std::uint32_t>(this);

push_hint<atom_value, std::uint32_t, std::string>(this);

}

pointer by_rtti(const std::type_info& ti) const {

util::shared_lock_guard<util::shared_spinlock> guard(m_lock);

auto res = find_rtti(m_builtin_types, ti);

return (res) ? res : find_rtti(m_user_types, ti);

}

pointer by_uniform_name(const std::string& name) {

pointer result = nullptr;

/* lifetime scope of guard */ {

util::shared_lock_guard<util::shared_spinlock> guard(m_lock);

result = find_name(m_builtin_types, name);

result = (result) ? result : find_name(m_user_types, name);

}

if (!result && name.compare(0, 3, "@<>") == 0) {

// create tuple UTI on-the-fly

result = insert(create_unique<default_meta_tuple>(name));

}

return result; //(res) ? res : find_name(m_user_types, name);

}

std::vector<pointer> get_all() const {

util::shared_lock_guard<util::shared_spinlock> guard(m_lock);

std::vector<pointer> res;

res.reserve(m_builtin_types.size() + m_user_types.size());

res.insert(res.end(), m_builtin_types.begin(), m_builtin_types.end());

res.insert(res.end(), m_user_types.begin(), m_user_types.end());

return res;

}

pointer insert(std::unique_ptr<uniform_type_info> uti) {

std::unique_lock<util::shared_spinlock> guard(m_lock);

auto e = m_user_types.end();

auto i = std::lower_bound(m_user_types.begin(), e, uti.get(),

[](uniform_type_info* lhs, pointer rhs) {

return strcmp(lhs->name(), rhs->name()) < 0;

});

if (i == e) {

m_user_types.push_back(uti.release());

return m_user_types.back();

}

else {

if (strcmp(uti->name(), (*i)->name()) == 0) {

// type already known

return *i;

}

// insert after lower bound (vector is always sorted)

auto new_pos = std::distance(m_user_types.begin(), i);

m_user_types.insert(i, uti.release());

return m_user_types[new_pos];

}

}

~utim_impl() {

for (auto ptr : m_user_types) delete ptr;

m_user_types.clear();

}

private:

typedef std::map<std::string, std::string> strmap;

// 0-9

uti_impl<node_id_ptr> m_type_proc;

uti_impl<io::accept_handle> m_ac_hdl;

uti_impl<io::connection_handle> m_cn_hdl;

uti_impl<channel> m_type_channel;

uti_impl<down_msg> m_type_down_msg;

uti_impl<exit_msg> m_type_exit_msg;

buffer_type_info_impl m_type_buffer;

uti_impl<actor> m_type_actor;

uti_impl<actor_addr> m_type_actor_addr;

uti_impl<group> m_type_group;

// 10-19

uti_impl<group_down_msg> m_type_group_down;

uti_impl<any_tuple> m_type_tuple;

uti_impl<util::duration> m_type_duration;

uti_impl<sync_exited_msg> m_type_sync_exited;

uti_impl<sync_timeout_msg> m_type_sync_timeout;

uti_impl<timeout_msg> m_type_timeout;

uti_impl<message_header> m_type_header;

uti_impl<unit_t> m_type_unit;

uti_impl<atom_value> m_type_atom;

uti_impl<std::string> m_type_str;

// 20-29

uti_impl<std::u16string> m_type_u16str;

uti_impl<std::u32string> m_type_u32str;

default_uniform_type_info<strmap> m_type_strmap;

uti_impl<bool> m_type_bool;

uti_impl<float> m_type_float;

uti_impl<double> m_type_double;

uti_impl<long double> m_type_long_double;

int_tinfo<std::int8_t> m_type_i8;

int_tinfo<std::uint8_t> m_type_u8;

int_tinfo<std::int16_t> m_type_i16;

// 30-34

int_tinfo<std::uint16_t> m_type_u16;

int_tinfo<std::int32_t> m_type_i32;

int_tinfo<std::uint32_t> m_type_u32;

int_tinfo<std::int64_t> m_type_i64;

int_tinfo<std::uint64_t> m_type_u64;

// both containers are sorted by uniform name

std::array<pointer, 35> m_builtin_types;

std::vector<uniform_type_info*> m_user_types;

mutable util::shared_spinlock m_lock;

template<typename Container>

pointer find_rtti(const Container& c, const std::type_info& ti) const {

auto e = c.end();

auto i = std::find_if(c.begin(), e, [&](pointer p) {

return p->equal_to(ti);

});

return (i == e) ? nullptr : *i;

}

template<typename Container>

pointer find_name(const Container& c, const std::string& name) const {

auto e = c.end();

// both containers are sorted

auto i = std::lower_bound(c.begin(), e, name,

[](pointer p, const std::string& n) {

return p->name() < n;

});

return (i != e && (*i)->name() == name) ? *i : nullptr;

}