You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
110 lines
3.6 KiB
110 lines
3.6 KiB
// Copyright (c) 2014-2022, The Monero Project
|
|
//
|
|
// All rights reserved.
|
|
//
|
|
// Redistribution and use in source and binary forms, with or without modification, are
|
|
// permitted provided that the following conditions are met:
|
|
//
|
|
// 1. Redistributions of source code must retain the above copyright notice, this list of
|
|
// conditions and the following disclaimer.
|
|
//
|
|
// 2. Redistributions in binary form must reproduce the above copyright notice, this list
|
|
// of conditions and the following disclaimer in the documentation and/or other
|
|
// materials provided with the distribution.
|
|
//
|
|
// 3. Neither the name of the copyright holder nor the names of its contributors may be
|
|
// used to endorse or promote products derived from this software without specific
|
|
// prior written permission.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
|
|
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|
// MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
|
|
// THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
|
// STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
|
|
// THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
//
|
|
// Parts of this file are originally copyright (c) 2012-2013 The Cryptonote developers
|
|
|
|
#pragma once
|
|
#include <memory>
|
|
#include <boost/type_traits/make_unsigned.hpp>
|
|
#include "serialization.h"
|
|
|
|
namespace serialization
|
|
{
|
|
namespace detail
|
|
{
|
|
template<typename T>
|
|
inline constexpr bool use_pair_varint() noexcept
|
|
{
|
|
return std::is_integral<T>::value && std::is_unsigned<T>::value && sizeof(T) > 1;
|
|
}
|
|
|
|
template <typename Archive, class T>
|
|
typename std::enable_if<!use_pair_varint<T>(), bool>::type
|
|
serialize_pair_element(Archive& ar, T& e)
|
|
{
|
|
return do_serialize(ar, e);
|
|
}
|
|
|
|
template<typename Archive, typename T>
|
|
typename std::enable_if<use_pair_varint<T>(), bool>::type
|
|
serialize_pair_element(Archive& ar, T& e)
|
|
{
|
|
static constexpr const bool previously_varint = std::is_same<uint64_t, T>();
|
|
|
|
if (!previously_varint && ar.varint_bug_backward_compatibility_enabled() && !typename Archive::is_saving())
|
|
return do_serialize(ar, e);
|
|
ar.serialize_varint(e);
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
|
|
template <template <bool> class Archive, class F, class S>
|
|
inline bool do_serialize(Archive<false>& ar, std::pair<F,S>& p)
|
|
{
|
|
size_t cnt;
|
|
ar.begin_array(cnt);
|
|
if (!ar.good())
|
|
return false;
|
|
if (cnt != 2)
|
|
return false;
|
|
|
|
if (!::serialization::detail::serialize_pair_element(ar, p.first))
|
|
return false;
|
|
if (!ar.good())
|
|
return false;
|
|
ar.delimit_array();
|
|
if (!::serialization::detail::serialize_pair_element(ar, p.second))
|
|
return false;
|
|
if (!ar.good())
|
|
return false;
|
|
|
|
ar.end_array();
|
|
return true;
|
|
}
|
|
|
|
template <template <bool> class Archive, class F, class S>
|
|
inline bool do_serialize(Archive<true>& ar, std::pair<F,S>& p)
|
|
{
|
|
ar.begin_array(2);
|
|
if (!ar.good())
|
|
return false;
|
|
if(!::serialization::detail::serialize_pair_element(ar, p.first))
|
|
return false;
|
|
if (!ar.good())
|
|
return false;
|
|
ar.delimit_array();
|
|
if(!::serialization::detail::serialize_pair_element(ar, p.second))
|
|
return false;
|
|
if (!ar.good())
|
|
return false;
|
|
ar.end_array();
|
|
return true;
|
|
}
|
|
|