// Copyright 2017 Dolphin Emulator Project // Licensed under GPLv2+ // Refer to the license.txt file included. #pragma once #include #include #include #include namespace Common { /// /// Retrieves the size of a type in bits. /// /// @tparam T Type to get the size of. /// /// @return the size of the type in bits. /// template constexpr size_t BitSize() noexcept { return sizeof(T) * CHAR_BIT; } /// /// Extracts a bit from a value. /// /// @param src The value to extract a bit from. /// @param bit The bit to extract. /// /// @tparam T The type of the value. /// /// @return The extracted bit. /// template constexpr T ExtractBit(const T src, const size_t bit) noexcept { return (src >> bit) & static_cast(1); } /// /// Extracts a bit from a value. /// /// @param src The value to extract a bit from. /// /// @tparam bit The bit to extract. /// @tparam T The type of the value. /// /// @return The extracted bit. /// template constexpr T ExtractBit(const T src) noexcept { static_assert(bit < BitSize(), "Specified bit must be within T's bit width."); return ExtractBit(src, bit); } /// /// Extracts a range of bits from a value. /// /// @param src The value to extract the bits from. /// @param begin The beginning of the bit range. This is inclusive. /// @param end The ending of the bit range. This is inclusive. /// /// @tparam T The type of the value. /// @tparam Result The returned result type. This is the unsigned analog /// of a signed type if a signed type is passed as T. /// /// @return The extracted bits. /// template > constexpr Result ExtractBits(const T src, const size_t begin, const size_t end) noexcept { return static_cast(((static_cast(src) << ((BitSize() - 1) - end)) >> (BitSize() - end + begin - 1))); } /// /// Extracts a range of bits from a value. /// /// @param src The value to extract the bits from. /// /// @tparam begin The beginning of the bit range. This is inclusive. /// @tparam end The ending of the bit range. This is inclusive. /// @tparam T The type of the value. /// @tparam Result The returned result type. This is the unsigned analog /// of a signed type if a signed type is passed as T. /// /// @return The extracted bits. /// template > constexpr Result ExtractBits(const T src) noexcept { static_assert(begin < end, "Beginning bit must be less than the ending bit."); static_assert(begin < BitSize(), "Beginning bit is larger than T's bit width."); static_assert(end < BitSize(), "Ending bit is larger than T's bit width."); return ExtractBits(src, begin, end); } /// /// Rotates a value left (ROL). /// /// @param value The value to rotate. /// @param amount The number of bits to rotate the value. /// @tparam T An unsigned type. /// /// @return The rotated value. /// template constexpr T RotateLeft(const T value, size_t amount) noexcept { static_assert(std::is_unsigned(), "Can only rotate unsigned types left."); amount %= BitSize(); if (amount == 0) return value; return static_cast((value << amount) | (value >> (BitSize() - amount))); } /// /// Rotates a value right (ROR). /// /// @param value The value to rotate. /// @param amount The number of bits to rotate the value. /// @tparam T An unsigned type. /// /// @return The rotated value. /// template constexpr T RotateRight(const T value, size_t amount) noexcept { static_assert(std::is_unsigned(), "Can only rotate unsigned types right."); amount %= BitSize(); if (amount == 0) return value; return static_cast((value >> amount) | (value << (BitSize() - amount))); } /// /// Verifies whether the supplied value is a valid bit mask of the form 0b00...0011...11. /// Both edge cases of all zeros and all ones are considered valid masks, too. /// /// @param mask The mask value to test for validity. /// /// @tparam T The type of the value. /// /// @return A bool indicating whether the mask is valid. /// template constexpr bool IsValidLowMask(const T mask) noexcept { static_assert(std::is_integral::value, "Mask must be an integral type."); static_assert(std::is_unsigned::value, "Signed masks can introduce hard to find bugs."); // Can be efficiently determined without looping or bit counting. It's the counterpart // to https://graphics.stanford.edu/~seander/bithacks.html#DetermineIfPowerOf2 // and doesn't require special casing either edge case. return (mask & (mask + 1)) == 0; } /// /// Reinterpret objects of one type as another by bit-casting between object representations. /// /// @remark This is the example implementation of std::bit_cast which is to be included /// in C++2a. See http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0476r2.html /// for more details. The only difference is this variant is not constexpr, /// as the mechanism for bit_cast requires a compiler built-in to have that quality. /// /// @param source The source object to convert to another representation. /// /// @tparam To The type to reinterpret source as. /// @tparam From The initial type representation of source. /// /// @return The representation of type From as type To. /// /// @pre Both To and From types must be the same size /// @pre Both To and From types must satisfy the TriviallyCopyable concept. /// template inline To BitCast(const From& source) noexcept { static_assert(sizeof(From) == sizeof(To), "BitCast source and destination types must be equal in size."); static_assert(std::is_trivially_copyable(), "BitCast source type must be trivially copyable."); static_assert(std::is_trivially_copyable(), "BitCast destination type must be trivially copyable."); std::aligned_storage_t storage; std::memcpy(&storage, &source, sizeof(storage)); return reinterpret_cast(storage); } template void SetBit(T& value, size_t bit_number, bool bit_value) { if (bit_value) value |= (1 << bit_number); else value &= ~(1 << bit_number); } } // namespace Common