bit_field.h 7.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205
  1. // Licensed under GPLv2 or any later version
  2. // Refer to the license.txt file included.
  3. // Copyright 2014 Tony Wasserka
  4. // All rights reserved.
  5. //
  6. // Redistribution and use in source and binary forms, with or without
  7. // modification, are permitted provided that the following conditions are met:
  8. //
  9. // * Redistributions of source code must retain the above copyright
  10. // notice, this list of conditions and the following disclaimer.
  11. // * Redistributions in binary form must reproduce the above copyright
  12. // notice, this list of conditions and the following disclaimer in the
  13. // documentation and/or other materials provided with the distribution.
  14. // * Neither the name of the owner nor the names of its contributors may
  15. // be used to endorse or promote products derived from this software
  16. // without specific prior written permission.
  17. //
  18. // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  19. // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  20. // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  21. // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  22. // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  23. // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  24. // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  25. // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  26. // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  27. // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  28. // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  29. #pragma once
  30. #include <cstddef>
  31. #include <limits>
  32. #include <type_traits>
  33. #include "common/common_funcs.h"
  34. /*
  35. * Abstract bitfield class
  36. *
  37. * Allows endianness-independent access to individual bitfields within some raw
  38. * integer value. The assembly generated by this class is identical to the
  39. * usage of raw bitfields, so it's a perfectly fine replacement.
  40. *
  41. * For BitField<X,Y,Z>, X is the distance of the bitfield to the LSB of the
  42. * raw value, Y is the length in bits of the bitfield. Z is an integer type
  43. * which determines the sign of the bitfield. Z must have the same size as the
  44. * raw integer.
  45. *
  46. *
  47. * General usage:
  48. *
  49. * Create a new union with the raw integer value as a member.
  50. * Then for each bitfield you want to expose, add a BitField member
  51. * in the union. The template parameters are the bit offset and the number
  52. * of desired bits.
  53. *
  54. * Changes in the bitfield members will then get reflected in the raw integer
  55. * value and vice-versa.
  56. *
  57. *
  58. * Sample usage:
  59. *
  60. * union SomeRegister
  61. * {
  62. * u32 hex;
  63. *
  64. * BitField<0,7,u32> first_seven_bits; // unsigned
  65. * BitField<7,8,u32> next_eight_bits; // unsigned
  66. * BitField<3,15,s32> some_signed_fields; // signed
  67. * };
  68. *
  69. * This is equivalent to the little-endian specific code:
  70. *
  71. * union SomeRegister
  72. * {
  73. * u32 hex;
  74. *
  75. * struct
  76. * {
  77. * u32 first_seven_bits : 7;
  78. * u32 next_eight_bits : 8;
  79. * };
  80. * struct
  81. * {
  82. * u32 : 3; // padding
  83. * s32 some_signed_fields : 15;
  84. * };
  85. * };
  86. *
  87. *
  88. * Caveats:
  89. *
  90. * 1)
  91. * BitField provides automatic casting from and to the storage type where
  92. * appropriate. However, when using non-typesafe functions like printf, an
  93. * explicit cast must be performed on the BitField object to make sure it gets
  94. * passed correctly, e.g.:
  95. * printf("Value: %d", (s32)some_register.some_signed_fields);
  96. *
  97. * 2)
  98. * Not really a caveat, but potentially irritating: This class is used in some
  99. * packed structures that do not guarantee proper alignment. Therefore we have
  100. * to use #pragma pack here not to pack the members of the class, but instead
  101. * to break GCC's assumption that the members of the class are aligned on
  102. * sizeof(StorageType).
  103. * TODO(neobrain): Confirm that this is a proper fix and not just masking
  104. * symptoms.
  105. */
  106. #pragma pack(1)
  107. template<std::size_t position, std::size_t bits, typename T>
  108. struct BitField
  109. {
  110. private:
  111. // This constructor might be considered ambiguous:
  112. // Would it initialize the storage or just the bitfield?
  113. // Hence, delete it. Use the assignment operator to set bitfield values!
  114. BitField(T val) = delete;
  115. public:
  116. // Force default constructor to be created
  117. // so that we can use this within unions
  118. BitField() = default;
  119. #ifndef _WIN32
  120. // We explicitly delete the copy assigment operator here, because the
  121. // default copy assignment would copy the full storage value, rather than
  122. // just the bits relevant to this particular bit field.
  123. // Ideally, we would just implement the copy assignment to copy only the
  124. // relevant bits, but this requires compiler support for unrestricted
  125. // unions.
  126. // MSVC 2013 has no support for this, hence we disable this code on
  127. // Windows (so that the default copy assignment operator will be used).
  128. // For any C++11 conformant compiler we delete the operator to make sure
  129. // we never use this inappropriate operator to begin with.
  130. // TODO: Implement this operator properly once all target compilers
  131. // support unrestricted unions.
  132. BitField& operator=(const BitField&) = delete;
  133. #endif
  134. __forceinline BitField& operator=(T val)
  135. {
  136. Assign(val);
  137. return *this;
  138. }
  139. __forceinline operator T() const
  140. {
  141. return Value();
  142. }
  143. __forceinline void Assign(const T& value) {
  144. storage = (storage & ~GetMask()) | (((StorageType)value << position) & GetMask());
  145. }
  146. __forceinline T Value() const
  147. {
  148. if (std::numeric_limits<T>::is_signed)
  149. {
  150. std::size_t shift = 8 * sizeof(T)-bits;
  151. return (T)((storage << (shift - position)) >> shift);
  152. }
  153. else
  154. {
  155. return (T)((storage & GetMask()) >> position);
  156. }
  157. }
  158. // TODO: we may want to change this to explicit operator bool() if it's bug-free in VS2015
  159. __forceinline bool ToBool() const
  160. {
  161. return Value() != 0;
  162. }
  163. private:
  164. // StorageType is T for non-enum types and the underlying type of T if
  165. // T is an enumeration. Note that T is wrapped within an enable_if in the
  166. // former case to workaround compile errors which arise when using
  167. // std::underlying_type<T>::type directly.
  168. typedef typename std::conditional < std::is_enum<T>::value,
  169. std::underlying_type<T>,
  170. std::enable_if < true, T >> ::type::type StorageType;
  171. // Unsigned version of StorageType
  172. typedef typename std::make_unsigned<StorageType>::type StorageTypeU;
  173. __forceinline StorageType GetMask() const
  174. {
  175. return (((StorageTypeU)~0) >> (8 * sizeof(T)-bits)) << position;
  176. }
  177. StorageType storage;
  178. static_assert(bits + position <= 8 * sizeof(T), "Bitfield out of range");
  179. // And, you know, just in case people specify something stupid like bits=position=0x80000000
  180. static_assert(position < 8 * sizeof(T), "Invalid position");
  181. static_assert(bits <= 8 * sizeof(T), "Invalid number of bits");
  182. static_assert(bits > 0, "Invalid number of bits");
  183. static_assert(std::is_standard_layout<T>::value, "Invalid base type");
  184. };
  185. #pragma pack()