2017-01-21 00:27:20 +01:00
|
|
|
/*
|
|
|
|
|
|
|
|
Copyright (c) 2017, Arvid Norberg
|
|
|
|
All rights reserved.
|
|
|
|
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
|
|
modification, are permitted provided that the following conditions
|
|
|
|
are met:
|
|
|
|
|
|
|
|
* Redistributions of source code must retain the above copyright
|
|
|
|
notice, this list of conditions and the following disclaimer.
|
|
|
|
* 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.
|
|
|
|
* Neither the name of the author 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 OWNER 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.
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef TORRENT_ALIGNED_UNION_HPP_INCLUDE
|
|
|
|
#define TORRENT_ALIGNED_UNION_HPP_INCLUDE
|
|
|
|
|
|
|
|
#include <type_traits>
|
|
|
|
|
|
|
|
namespace libtorrent { namespace aux {
|
|
|
|
|
2017-10-15 04:29:33 +02:00
|
|
|
#if defined __GNUC__ && __GNUC__ < 5 && !defined(_LIBCPP_VERSION)
|
2017-01-21 00:27:20 +01:00
|
|
|
|
2017-01-24 20:03:17 +01:00
|
|
|
constexpr std::size_t max(std::size_t a)
|
2017-01-21 00:27:20 +01:00
|
|
|
{ return a; }
|
|
|
|
|
2017-01-24 20:03:17 +01:00
|
|
|
constexpr std::size_t max(std::size_t a, std::size_t b)
|
2017-01-21 00:27:20 +01:00
|
|
|
{ return a > b ? a : b; }
|
|
|
|
|
|
|
|
template <typename... Vals>
|
2017-01-24 20:03:17 +01:00
|
|
|
constexpr std::size_t max(std::size_t a, std::size_t b, Vals... v)
|
2017-01-21 00:27:20 +01:00
|
|
|
{ return max(a, max(b, v...)); }
|
|
|
|
|
|
|
|
// this is for backwards compatibility with not-quite C++11 compilers
|
2017-01-24 20:03:17 +01:00
|
|
|
template <std::size_t Len, typename... Types>
|
2017-01-21 00:27:20 +01:00
|
|
|
struct aligned_union
|
|
|
|
{
|
|
|
|
struct type
|
|
|
|
{
|
|
|
|
alignas(max(alignof(Types)...))
|
|
|
|
char buffer[max(Len, max(sizeof(Types)...))];
|
|
|
|
};
|
|
|
|
};
|
|
|
|
|
|
|
|
#else
|
|
|
|
|
|
|
|
using std::aligned_union;
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
}}
|
|
|
|
|
|
|
|
#endif
|