Lines Matching refs:That
124 /// Similar to FAddend::drillDownOneStep() except that the value being
209 void FAddendCoef::operator=(const FAddendCoef& That) {
210 if (That.isInt())
211 set(That.IntVal);
213 set(That.getFpVal());
216 void FAddendCoef::operator+=(const FAddendCoef &That) {
218 if (isInt() == That.isInt()) {
220 IntVal += That.IntVal;
222 getFpVal().add(That.getFpVal(), RndMode);
227 const APFloat &T = That.getFpVal();
234 T.add(APFloat(T.getSemantics(), That.IntVal), RndMode);
237 void FAddendCoef::operator-=(const FAddendCoef &That) {
239 if (isInt() == That.isInt()) {
241 IntVal -= That.IntVal;
243 getFpVal().subtract(That.getFpVal(), RndMode);
248 const APFloat &T = That.getFpVal();
258 void FAddendCoef::operator*=(const FAddendCoef &That) {
259 if (That.isOne())
262 if (That.isMinusOne()) {
267 if (isInt() && That.isInt()) {
268 int Res = IntVal * (int)That.IntVal;
275 isInt() ? That.getFpVal().getSemantics() : getFpVal().getSemantics();
281 if (That.isInt())
282 F0.multiply(APFloat(Semantic, That.IntVal), APFloat::rmNearestTiesToEven);
284 F0.multiply(That.getFpVal(), APFloat::rmNearestTiesToEven);
599 // Set null such that next iteration of the outer loop will not process
657 // Note that at most three instructions are involved in Fadd-InstCombine: the
660 // than the original addition expression tree. This implies that the resulting
823 // dyn_castFoldableMul - If this value is a multiply that can be folded into
851 /// WillNotOverflowSignedAdd - Return true if we can prove that:
853 /// This basically requires proving that the add in the original type would not
859 // Add has the property that adding any two 2's complement numbers can only
861 // have at least two sign bits, we know that the addition of the two values
931 // If this is a xor that was canonicalized from a sub, turn it back into
