256 lines
8.2 KiB
C++
256 lines
8.2 KiB
C++
/*
|
|
* Copyright (C) 2015 Cloudius Systems, Ltd.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include "types.hh"
|
|
#include <iostream>
|
|
#include <algorithm>
|
|
#include <vector>
|
|
#include <boost/range/iterator_range.hpp>
|
|
#include "util/serialization.hh"
|
|
#include "unimplemented.hh"
|
|
|
|
// value_traits is meant to abstract away whether we are working on 'bytes'
|
|
// elements or 'bytes_opt' elements. We don't support optional values, but
|
|
// there are some generic layers which use this code which provide us with
|
|
// data in that format. In order to avoid allocation and rewriting that data
|
|
// into a new vector just to throw it away soon after that, we accept that
|
|
// format too.
|
|
|
|
template <typename T>
|
|
struct value_traits {
|
|
static const T& unwrap(const T& t) { return t; }
|
|
};
|
|
|
|
template<>
|
|
struct value_traits<bytes_opt> {
|
|
static const bytes& unwrap(const bytes_opt& t) {
|
|
assert(t);
|
|
return *t;
|
|
}
|
|
};
|
|
|
|
template<bool AllowPrefixes = false>
|
|
class tuple_type final {
|
|
private:
|
|
const std::vector<shared_ptr<abstract_type>> _types;
|
|
const bool _byte_order_equal;
|
|
const bool _byte_order_comparable;
|
|
public:
|
|
using prefix_type = tuple_type<true>;
|
|
using value_type = std::vector<bytes>;
|
|
|
|
tuple_type(std::vector<shared_ptr<abstract_type>> types)
|
|
: _types(std::move(types))
|
|
, _byte_order_equal(std::all_of(_types.begin(), _types.end(), [] (auto t) {
|
|
return t->is_byte_order_equal();
|
|
}))
|
|
, _byte_order_comparable(std::all_of(_types.begin(), _types.end(), [] (auto t) {
|
|
return t->is_byte_order_comparable();
|
|
}))
|
|
{ }
|
|
|
|
tuple_type(tuple_type&&) = default;
|
|
|
|
auto const& types() {
|
|
return _types;
|
|
}
|
|
|
|
prefix_type as_prefix() {
|
|
return prefix_type(_types);
|
|
}
|
|
|
|
/*
|
|
* Format:
|
|
* <len(value1)><value1><len(value2)><value2>...
|
|
*/
|
|
template<typename Wrapped>
|
|
void serialize_value(const std::vector<Wrapped>& values, bytes::iterator& out) {
|
|
if (AllowPrefixes) {
|
|
assert(values.size() <= _types.size());
|
|
} else {
|
|
assert(values.size() == _types.size());
|
|
}
|
|
|
|
for (auto&& wrapped : values) {
|
|
auto&& val = value_traits<Wrapped>::unwrap(wrapped);
|
|
assert(val.size() <= std::numeric_limits<int32_t>::max());
|
|
write<uint32_t>(out, uint32_t(val.size()));
|
|
out = std::copy(val.begin(), val.end(), out);
|
|
}
|
|
}
|
|
template <typename Wrapped>
|
|
size_t serialized_size(const std::vector<Wrapped>& values) {
|
|
size_t len = 0;
|
|
for (auto&& wrapped : values) {
|
|
auto&& val = value_traits<Wrapped>::unwrap(wrapped);
|
|
assert(val.size() <= std::numeric_limits<int32_t>::max());
|
|
len += sizeof(uint32_t) + val.size();
|
|
}
|
|
return len;
|
|
}
|
|
bytes serialize_value(const std::vector<bytes>& values) {
|
|
return ::serialize_value(*this, values);
|
|
}
|
|
bytes serialize_optionals(const std::vector<bytes_opt>& values) {
|
|
return ::serialize_value(*this, values);
|
|
}
|
|
bytes serialize_value_deep(const std::vector<boost::any>& values) {
|
|
// TODO: Optimize
|
|
std::vector<bytes> partial;
|
|
partial.reserve(values.size());
|
|
auto i = _types.begin();
|
|
for (auto&& component : values) {
|
|
assert(i != _types.end());
|
|
partial.push_back((*i++)->decompose(component));
|
|
}
|
|
return serialize_value(partial);
|
|
}
|
|
bytes decompose_value(const value_type& values) {
|
|
return ::serialize_value(*this, values);
|
|
}
|
|
class iterator : public std::iterator<std::forward_iterator_tag, bytes_view> {
|
|
private:
|
|
ssize_t _types_left;
|
|
bytes_view _v;
|
|
value_type _current;
|
|
private:
|
|
void read_current() {
|
|
if (_types_left == 0) {
|
|
if (!_v.empty()) {
|
|
throw marshal_exception();
|
|
}
|
|
_v = bytes_view(nullptr, 0);
|
|
return;
|
|
}
|
|
if (_v.empty()) {
|
|
if (AllowPrefixes) {
|
|
_v = bytes_view(nullptr, 0);
|
|
return;
|
|
} else {
|
|
throw marshal_exception();
|
|
}
|
|
}
|
|
auto len = read_simple<uint32_t>(_v);
|
|
if (_v.size() < len) {
|
|
throw marshal_exception();
|
|
}
|
|
_current = bytes_view(_v.begin(), len);
|
|
_v.remove_prefix(len);
|
|
}
|
|
public:
|
|
struct end_iterator_tag {};
|
|
iterator(const tuple_type& t, const bytes_view& v) : _types_left(t._types.size()), _v(v) {
|
|
read_current();
|
|
}
|
|
iterator(end_iterator_tag, const bytes_view& v) : _v(nullptr, 0) {}
|
|
iterator& operator++() {
|
|
--_types_left;
|
|
read_current();
|
|
return *this;
|
|
}
|
|
const value_type& operator*() const { return _current; }
|
|
bool operator!=(const iterator& i) const { return _v.begin() != i._v.begin(); }
|
|
bool operator==(const iterator& i) const { return _v.begin() == i._v.begin(); }
|
|
};
|
|
iterator begin(const bytes_view& v) const {
|
|
return iterator(*this, v);
|
|
}
|
|
iterator end(const bytes_view& v) const {
|
|
return iterator(typename iterator::end_iterator_tag(), v);
|
|
}
|
|
auto iter_items(const bytes_view& v) {
|
|
return boost::iterator_range<iterator>(begin(v), end(v));
|
|
}
|
|
value_type deserialize_value(bytes_view v) {
|
|
std::vector<bytes> result;
|
|
result.reserve(_types.size());
|
|
std::transform(begin(v), end(v), std::back_inserter(result), [] (auto&& v) {
|
|
return bytes(v.begin(), v.end());
|
|
});
|
|
return result;
|
|
}
|
|
bool less(bytes_view b1, bytes_view b2) {
|
|
return compare(b1, b2) < 0;
|
|
}
|
|
size_t hash(bytes_view v) {
|
|
if (_byte_order_equal) {
|
|
return std::hash<bytes_view>()(v);
|
|
}
|
|
auto t = _types.begin();
|
|
size_t h = 0;
|
|
for (auto&& value : iter_items(v)) {
|
|
h ^= (*t)->hash(value);
|
|
++t;
|
|
}
|
|
return h;
|
|
}
|
|
int compare(bytes_view b1, bytes_view b2) {
|
|
if (_byte_order_comparable) {
|
|
return compare_unsigned(b1, b2);
|
|
}
|
|
return lexicographical_tri_compare(_types.begin(),
|
|
begin(b1), end(b1), begin(b2), end(b2), [] (auto&& type, auto&& v1, auto&& v2) {
|
|
return type->compare(v1, v2);
|
|
});
|
|
}
|
|
bytes from_string(sstring_view s) {
|
|
throw std::runtime_error("not implemented");
|
|
}
|
|
sstring to_string(const bytes& b) {
|
|
throw std::runtime_error("not implemented");
|
|
}
|
|
/**
|
|
* Returns true iff all components of 'prefix' are equal to corresponding
|
|
* leading components of 'value'.
|
|
*
|
|
* The 'value' is assumed to be serialized using tuple_type<AllowPrefixes=false>
|
|
*/
|
|
bool is_prefix_of(bytes_view prefix, bytes_view value) const {
|
|
assert(AllowPrefixes);
|
|
|
|
for (auto&& type : _types) {
|
|
if (prefix.empty()) {
|
|
return true;
|
|
}
|
|
assert(!value.empty());
|
|
auto len1 = read_simple<uint32_t>(prefix);
|
|
auto len2 = read_simple<uint32_t>(value);
|
|
if (prefix.size() < len1 || value.size() < len2) {
|
|
throw marshal_exception();
|
|
}
|
|
if (!type->equal(bytes_view(prefix.begin(), len1), bytes_view(value.begin(), len2))) {
|
|
return false;
|
|
}
|
|
prefix.remove_prefix(len1);
|
|
value.remove_prefix(len2);
|
|
}
|
|
|
|
if (!prefix.empty() || !value.empty()) {
|
|
throw marshal_exception();
|
|
}
|
|
|
|
return true;
|
|
}
|
|
// Retruns true iff given prefix has no missing components
|
|
bool is_full(bytes_view v) const {
|
|
assert(AllowPrefixes);
|
|
return std::distance(begin(v), end(v)) == (ssize_t)_types.size();
|
|
}
|
|
void validate(bytes_view v) {
|
|
// FIXME: implement
|
|
warn(unimplemented::cause::VALIDATION);
|
|
}
|
|
bool equal(bytes_view v1, bytes_view v2) {
|
|
if (_byte_order_equal) {
|
|
return compare_unsigned(v1, v2) == 0;
|
|
}
|
|
// FIXME: call equal() on each component
|
|
return compare(v1, v2) == 0;
|
|
}
|
|
};
|
|
|
|
using tuple_prefix = tuple_type<true>;
|