Lines Matching refs:partCount
353 unsigned int partCount,
358 lsb = APInt::tcLSB(parts, partCount);
365 if (bits <= partCount * integerPartWidth &&
592 count = partCount();
600 if (partCount() > 1)
622 partCount() >= partCount());
625 partCount());
637 unsigned numParts = partCount();
718 int i= partCount();
790 APFloat::partCount() const
812 if (partCount() > 1)
822 APInt::tcSet(significandParts(), 0, partCount());
831 carry = APInt::tcIncrement(significandParts(), partCount());
849 return APInt::tcAdd(parts, rhs.significandParts(), 0, partCount());
865 partCount());
893 partsCount = partCount();
977 partsCount = partCount();
1051 return APInt::tcMSB(significandParts(), partCount());
1057 return APInt::tcLSB(significandParts(), partCount());
1069 return shiftRight(significandParts(), partCount(), bits);
1079 unsigned int partsCount = partCount();
1103 partCount());
1130 APInt::tcSetLeastSignificantBits(significandParts(), partCount(),
1656 int parts = partCount();
1697 int parts = partCount();
1862 oldPartCount = partCount();
2009 lost_fraction = lostFractionThroughTruncation(src, partCount(),
2125 dstCount = partCount();
2149 unsigned int partCount = Val.getNumWords();
2158 return convertFromUnsignedParts(api.getRawData(), partCount, rounding_mode);
2198 unsigned int partCount = partCountForBits(width);
2199 APInt api = APInt(width, makeArrayRef(parts, partCount));
2207 return convertFromUnsignedParts(api.getRawData(), partCount, rounding_mode);
2223 partsCount = partCount();
2369 APInt::tcExtract(significandParts(), partCount(), decSig.significandParts(),
2378 decSig.partCount(),
2439 unsigned int partCount;
2445 partCount = static_cast<unsigned int>(D.lastSigDigit - D.firstSigDigit) + 1;
2446 partCount = partCountForBits(1 + 196 * partCount / 59);
2447 decSignificand = new integerPart[partCount + 1];
2448 partCount = 0;
2477 partCount, partCount + 1, false);
2481 if (decSignificand[partCount])
2482 partCount++;
2486 fs = roundSignificandWithExponent(decSignificand, partCount,
2612 partsCount = partCount();
2709 for (int i=partCount(); i>0; i--, p++)
2728 assert(partCount()==2);
2760 assert(partCount()==2);
2805 assert(partCount()==2);
2841 assert(partCount()==1);
2871 assert(partCount()==1);
2900 assert(partCount()==1);
2987 assert(partCount()==2);
3023 assert(partCount()==2);
3072 assert(partCount()==2);
3110 assert(partCount()==1);
3143 assert(partCount()==1);
3176 assert(partCount()==1);
