Lines Matching refs:part
195 multiplication may require an extra part with the excess part
197 requires two parts to hold the single-part result). So we add an
558 APFloatBase::integerPart part, boundary;
566 part = parts[count] & (~(APFloatBase::integerPart) 0 >> (APFloatBase::integerPartWidth - partBits));
574 if (part - boundary <= boundary - part)
575 return part - boundary;
577 return boundary - part;
580 if (part == boundary) {
586 } else if (part == boundary - 1) {
598 DST must be at least one part larger than size of the answer. */
671 partAsHex (char *dst, APFloatBase::integerPart part, unsigned int count,
678 part >>= (APFloatBase::integerPartWidth - 4 * count);
680 dst[count] = hexDigitChars[part & 0xf];
681 part >>= 4;
771 unsigned part = bitsToPreserve / 64;
773 significand[part] &= ((1ULL << bitsToPreserve) - 1);
774 for (part++; part != numParts; ++part)
775 significand[part] = 0;
960 return &significand.part;
1077 significand.part = fullSignificand[0];
1101 fullSignificand[0] = significand.part;
2218 // Switch to built-in storage for a single part.
2223 significand.part = newPart;
2761 to hold the full significand, and an extra part required by
2796 /* Multiply out the current part. */
2800 /* If we used another part (likely but not guaranteed), increase
3039 integerPart part;
3041 /* Put the most significant integerPartWidth bits in "part". */
3043 part = 0; /* An imaginary higher zero part. */
3045 part = significand[count] << shift;
3048 part |= significand[count - 1] >> (integerPartWidth - shift);
3050 /* Convert as much of "part" to hexdigits as we can. */
3055 dst += partAsHex (dst, part, curDigits, hexDigitChars);
3817 // truncate trailing zeros, as those are part of the precision.