nerdcruft/libcruft-util
1
0
Fork 0
Code Issues Releases Activity

bitwise: offset should start from least significant bits

Browse Source
This commit is contained in:
Danny Robson 2019-02-03 13:52:56 +11:00
parent ddc24b076b
commit cf268a1960
1 changed files with 3 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
bitwise.hpp
View File

@ -140,7 +140,7 @@ namespace cruft {
///
/// \tparam ValueT the underlying integral type
/// \tparam OffsetV the index of the first bit of the range (where 0 is
/// most significant)
/// least significant)
/// \tparam SizeV the number of bits in the range. Must be strictly
/// positive.
template <
@ -148,11 +148,10 @@ namespace cruft {
size_t OffsetV,
size_t SizeV
>
class bitfield {
class [[gnu::packed]] bitfield {
public:
static_assert (SizeV > 0);
static_assert (OffsetV + SizeV <= sizeof (ValueT) * 8);
static_assert (sizeof (ValueT) == sizeof (bitfield));
decltype(auto)
operator+ () const { return +value; }
@ -160,9 +159,7 @@ namespace cruft {
operator auto() const
{
auto const MASK = (1u << SizeV) - 1u;
auto const SHIFT = sizeof (ValueT) * 8 - OffsetV - SizeV;
return (value >> SHIFT) & MASK;
return (value >> OffsetV) & MASK;
}
ValueT value;