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());
848 return APInt::tcAdd(parts, rhs.significandParts(), 0, partCount());
864 partCount());
892 partsCount = partCount();
975 partsCount = partCount();
1049 return APInt::tcMSB(significandParts(), partCount());
1055 return APInt::tcLSB(significandParts(), partCount());
1067 return shiftRight(significandParts(), partCount(), bits);
1077 unsigned int partsCount = partCount();
1101 partCount());
1128 APInt::tcSetLeastSignificantBits(significandParts(), partCount(),
1652 int parts = partCount();
1693 int parts = partCount();
1858 oldPartCount = partCount();
2005 lost_fraction = lostFractionThroughTruncation(src, partCount(),
2121 dstCount = partCount();
2145 unsigned int partCount = Val.getNumWords();
2154 return convertFromUnsignedParts(api.getRawData(), partCount, rounding_mode);
2194 unsigned int partCount = partCountForBits(width);
2195 APInt api = APInt(width, makeArrayRef(parts, partCount));
2203 return convertFromUnsignedParts(api.getRawData(), partCount, rounding_mode);
2219 partsCount = partCount();
2365 APInt::tcExtract(significandParts(), partCount(), decSig.significandParts(),
2374 decSig.partCount(),
2435 unsigned int partCount;
2441 partCount = static_cast<unsigned int>(D.lastSigDigit - D.firstSigDigit) + 1;
2442 partCount = partCountForBits(1 + 196 * partCount / 59);
2443 decSignificand = new integerPart[partCount + 1];
2444 partCount = 0;
2473 partCount, partCount + 1, false);
2477 if (decSignificand[partCount])
2478 partCount++;
2482 fs = roundSignificandWithExponent(decSignificand, partCount,
2608 partsCount = partCount();
2705 for (int i=partCount(); i>0; i--, p++)
2724 assert(partCount()==2);
2756 assert(partCount()==2);
2801 assert(partCount()==2);
2837 assert(partCount()==1);
2867 assert(partCount()==1);
2896 assert(partCount()==1);
2983 assert(partCount()==2);
3019 assert(partCount()==2);
3068 assert(partCount()==2);
3106 assert(partCount()==1);
3139 assert(partCount()==1);
3172 assert(partCount()==1);
