Lines Matching defs:part

304    multiplication may require an extra part with the excess part
306    requires two parts to hold the single-part result).  So we add an
729   APFloatBase::integerPart part, boundary;
737   part = parts[count] & (~(APFloatBase::integerPart) 0 >> (APFloatBase::integerPartWidth - partBits));
745     if (part - boundary <= boundary - part)
746       return part - boundary;
748       return boundary - part;
751   if (part == boundary) {
757   } else if (part == boundary - 1) {
769    DST must be at least one part larger than size of the answer.  */
837 partAsHex (char *dst, APFloatBase::integerPart part, unsigned int count,
844   part >>= (APFloatBase::integerPartWidth - 4 * count);
846     dst[count] = hexDigitChars[part & 0xf];
847     part >>= 4;
959     unsigned part = bitsToPreserve / 64;
961     significand[part] &= ((1ULL << bitsToPreserve) - 1);
962     for (part++; part != numParts; ++part)
963       significand[part] = 0;
1225     return &significand.part;
1343       significand.part = fullSignificand[0];
1368       fullSignificand[0] = significand.part;
2597     // Switch to built-in storage for a single part.
2602     significand.part = newPart;
3161        to hold the full significand, and an extra part required by
3196       /* Multiply out the current part.  */
3200       /* If we used another part (likely but not guaranteed), increase
3443     integerPart part;
3445     /* Put the most significant integerPartWidth bits in "part".  */
3447       part = 0;  /* An imaginary higher zero part.  */
3449       part = significand[count] << shift;
3452       part |= significand[count - 1] >> (integerPartWidth - shift);
3454     /* Convert as much of "part" to hexdigits as we can.  */
3459     dst += partAsHex (dst, part, curDigits, hexDigitChars);
4289     // truncate trailing zeros, as those are part of the precision.