Lines Matching defs:bits
99 // does not guarantee that bits are preserved, this class lets us
118 // This is helpful to have and is guaranteed not to stomp bits.
174 // The number of bits that are actually relevant in the uint_type.
178 // Number of bits that represent the exponent.
180 // Number of bits that represent the fractional part.
188 // 1 sign bit, 8 exponent bits, 23 fractional bits.
202 // 1 sign bit, 11 exponent bits, 52 fractional bits.
216 // 1 sign bit, 5 exponent bits, 10 fractional bits.
238 // assist in interpreting the bits of the value.
261 // Number of bits to shift left to set the highest relevant bit.
265 // If the fractional part does not fit evenly into a hex character (4-bits)
271 // The representation of the fraction, not the actual bits. This
294 // The bits that represent the exponent.
311 // Returns the bits associated with the value.
314 // Returns the bits associated with the value, without the leading sign bit.
320 // Returns the bits associated with the exponent, shifted to start at the
333 // Returns just the significand bits from the value.
374 // Do not use this method with raw bits extracted from a subnormal number,
605 // as close as possible. If we had to shift off bits so we are 0, then we
631 "The number of bits do not fit");
635 // Returns 4 bits represented by the hex character.
667 const uint_type bits = spvutils::BitwiseCast<uint_type>(value.value());
668 const char* const sign = (bits & HF::sign_mask) ? "-" : "";
670 (bits & HF::exponent_mask) >> HF::num_fraction_bits);
672 uint_type fraction = static_cast<uint_type>((bits & HF::fraction_encode_mask)
907 // If we are here the bits represented belong in the fractional