Common: Remove redundant masking in BitField

For the signed case, the shifts already remove the rest of the value, so
ANDing by the mask is redundant.

1 files changed, 1 insertions, 1 deletions

diff --git a/src/common/bit_field.h b/src/common/bit_field.h
index 257d5577d..3bc53500d 100644
--- a/src/common/bit_field.h
+++ b/src/common/bit_field.h
@@ -160,7 +160,7 @@ public:
         if (std::numeric_limits<T>::is_signed)
         {
             std::size_t shift = 8 * sizeof(T)-bits;
-            return (T)(((storage & GetMask()) << (shift - position)) >> shift);
+            return (T)((storage << (shift - position)) >> shift);
         }
         else
         {