1 //===- InstCombineAddSub.cpp ----------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the visit functions for add, fadd, sub, and fsub.
12 //===----------------------------------------------------------------------===//
14 #include "InstCombine.h"
15 #include "llvm/Analysis/InstructionSimplify.h"
16 #include "llvm/DataLayout.h"
17 #include "llvm/Support/GetElementPtrTypeIterator.h"
18 #include "llvm/Support/PatternMatch.h"
20 using namespace PatternMatch;
22 /// AddOne - Add one to a ConstantInt.
23 static Constant *AddOne(Constant *C) {
24 return ConstantExpr::getAdd(C, ConstantInt::get(C->getType(), 1));
26 /// SubOne - Subtract one from a ConstantInt.
27 static Constant *SubOne(ConstantInt *C) {
28 return ConstantInt::get(C->getContext(), C->getValue()-1);
32 // dyn_castFoldableMul - If this value is a multiply that can be folded into
33 // other computations (because it has a constant operand), return the
34 // non-constant operand of the multiply, and set CST to point to the multiplier.
35 // Otherwise, return null.
37 static inline Value *dyn_castFoldableMul(Value *V, ConstantInt *&CST) {
38 if (!V->hasOneUse() || !V->getType()->isIntegerTy())
41 Instruction *I = dyn_cast<Instruction>(V);
44 if (I->getOpcode() == Instruction::Mul)
45 if ((CST = dyn_cast<ConstantInt>(I->getOperand(1))))
46 return I->getOperand(0);
47 if (I->getOpcode() == Instruction::Shl)
48 if ((CST = dyn_cast<ConstantInt>(I->getOperand(1)))) {
49 // The multiplier is really 1 << CST.
50 uint32_t BitWidth = cast<IntegerType>(V->getType())->getBitWidth();
51 uint32_t CSTVal = CST->getLimitedValue(BitWidth);
52 CST = ConstantInt::get(V->getType()->getContext(),
53 APInt(BitWidth, 1).shl(CSTVal));
54 return I->getOperand(0);
60 /// WillNotOverflowSignedAdd - Return true if we can prove that:
61 /// (sext (add LHS, RHS)) === (add (sext LHS), (sext RHS))
62 /// This basically requires proving that the add in the original type would not
63 /// overflow to change the sign bit or have a carry out.
64 bool InstCombiner::WillNotOverflowSignedAdd(Value *LHS, Value *RHS) {
65 // There are different heuristics we can use for this. Here are some simple
68 // Add has the property that adding any two 2's complement numbers can only
69 // have one carry bit which can change a sign. As such, if LHS and RHS each
70 // have at least two sign bits, we know that the addition of the two values
71 // will sign extend fine.
72 if (ComputeNumSignBits(LHS) > 1 && ComputeNumSignBits(RHS) > 1)
76 // If one of the operands only has one non-zero bit, and if the other operand
77 // has a known-zero bit in a more significant place than it (not including the
78 // sign bit) the ripple may go up to and fill the zero, but won't change the
79 // sign. For example, (X & ~4) + 1.
86 Instruction *InstCombiner::visitAdd(BinaryOperator &I) {
87 bool Changed = SimplifyAssociativeOrCommutative(I);
88 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1);
90 if (Value *V = SimplifyAddInst(LHS, RHS, I.hasNoSignedWrap(),
91 I.hasNoUnsignedWrap(), TD))
92 return ReplaceInstUsesWith(I, V);
94 // (A*B)+(A*C) -> A*(B+C) etc
95 if (Value *V = SimplifyUsingDistributiveLaws(I))
96 return ReplaceInstUsesWith(I, V);
98 if (ConstantInt *CI = dyn_cast<ConstantInt>(RHS)) {
99 // X + (signbit) --> X ^ signbit
100 const APInt &Val = CI->getValue();
102 return BinaryOperator::CreateXor(LHS, RHS);
104 // See if SimplifyDemandedBits can simplify this. This handles stuff like
105 // (X & 254)+1 -> (X&254)|1
106 if (SimplifyDemandedInstructionBits(I))
109 // zext(bool) + C -> bool ? C + 1 : C
110 if (ZExtInst *ZI = dyn_cast<ZExtInst>(LHS))
111 if (ZI->getSrcTy()->isIntegerTy(1))
112 return SelectInst::Create(ZI->getOperand(0), AddOne(CI), CI);
114 Value *XorLHS = 0; ConstantInt *XorRHS = 0;
115 if (match(LHS, m_Xor(m_Value(XorLHS), m_ConstantInt(XorRHS)))) {
116 uint32_t TySizeBits = I.getType()->getScalarSizeInBits();
117 const APInt &RHSVal = CI->getValue();
118 unsigned ExtendAmt = 0;
119 // If we have ADD(XOR(AND(X, 0xFF), 0x80), 0xF..F80), it's a sext.
120 // If we have ADD(XOR(AND(X, 0xFF), 0xF..F80), 0x80), it's a sext.
121 if (XorRHS->getValue() == -RHSVal) {
122 if (RHSVal.isPowerOf2())
123 ExtendAmt = TySizeBits - RHSVal.logBase2() - 1;
124 else if (XorRHS->getValue().isPowerOf2())
125 ExtendAmt = TySizeBits - XorRHS->getValue().logBase2() - 1;
129 APInt Mask = APInt::getHighBitsSet(TySizeBits, ExtendAmt);
130 if (!MaskedValueIsZero(XorLHS, Mask))
135 Constant *ShAmt = ConstantInt::get(I.getType(), ExtendAmt);
136 Value *NewShl = Builder->CreateShl(XorLHS, ShAmt, "sext");
137 return BinaryOperator::CreateAShr(NewShl, ShAmt);
140 // If this is a xor that was canonicalized from a sub, turn it back into
141 // a sub and fuse this add with it.
142 if (LHS->hasOneUse() && (XorRHS->getValue()+1).isPowerOf2()) {
143 IntegerType *IT = cast<IntegerType>(I.getType());
144 APInt LHSKnownOne(IT->getBitWidth(), 0);
145 APInt LHSKnownZero(IT->getBitWidth(), 0);
146 ComputeMaskedBits(XorLHS, LHSKnownZero, LHSKnownOne);
147 if ((XorRHS->getValue() | LHSKnownZero).isAllOnesValue())
148 return BinaryOperator::CreateSub(ConstantExpr::getAdd(XorRHS, CI),
154 if (isa<Constant>(RHS) && isa<PHINode>(LHS))
155 if (Instruction *NV = FoldOpIntoPhi(I))
158 if (I.getType()->isIntegerTy(1))
159 return BinaryOperator::CreateXor(LHS, RHS);
163 BinaryOperator *New =
164 BinaryOperator::CreateShl(LHS, ConstantInt::get(I.getType(), 1));
165 New->setHasNoSignedWrap(I.hasNoSignedWrap());
166 New->setHasNoUnsignedWrap(I.hasNoUnsignedWrap());
171 // -A + -B --> -(A + B)
172 if (Value *LHSV = dyn_castNegVal(LHS)) {
173 if (!isa<Constant>(RHS))
174 if (Value *RHSV = dyn_castNegVal(RHS)) {
175 Value *NewAdd = Builder->CreateAdd(LHSV, RHSV, "sum");
176 return BinaryOperator::CreateNeg(NewAdd);
179 return BinaryOperator::CreateSub(RHS, LHSV);
183 if (!isa<Constant>(RHS))
184 if (Value *V = dyn_castNegVal(RHS))
185 return BinaryOperator::CreateSub(LHS, V);
189 if (Value *X = dyn_castFoldableMul(LHS, C2)) {
190 if (X == RHS) // X*C + X --> X * (C+1)
191 return BinaryOperator::CreateMul(RHS, AddOne(C2));
193 // X*C1 + X*C2 --> X * (C1+C2)
195 if (X == dyn_castFoldableMul(RHS, C1))
196 return BinaryOperator::CreateMul(X, ConstantExpr::getAdd(C1, C2));
199 // X + X*C --> X * (C+1)
200 if (dyn_castFoldableMul(RHS, C2) == LHS)
201 return BinaryOperator::CreateMul(LHS, AddOne(C2));
203 // A+B --> A|B iff A and B have no bits set in common.
204 if (IntegerType *IT = dyn_cast<IntegerType>(I.getType())) {
205 APInt LHSKnownOne(IT->getBitWidth(), 0);
206 APInt LHSKnownZero(IT->getBitWidth(), 0);
207 ComputeMaskedBits(LHS, LHSKnownZero, LHSKnownOne);
208 if (LHSKnownZero != 0) {
209 APInt RHSKnownOne(IT->getBitWidth(), 0);
210 APInt RHSKnownZero(IT->getBitWidth(), 0);
211 ComputeMaskedBits(RHS, RHSKnownZero, RHSKnownOne);
213 // No bits in common -> bitwise or.
214 if ((LHSKnownZero|RHSKnownZero).isAllOnesValue())
215 return BinaryOperator::CreateOr(LHS, RHS);
219 // W*X + Y*Z --> W * (X+Z) iff W == Y
221 Value *W, *X, *Y, *Z;
222 if (match(LHS, m_Mul(m_Value(W), m_Value(X))) &&
223 match(RHS, m_Mul(m_Value(Y), m_Value(Z)))) {
236 Value *NewAdd = Builder->CreateAdd(X, Z, LHS->getName());
237 return BinaryOperator::CreateMul(W, NewAdd);
242 if (ConstantInt *CRHS = dyn_cast<ConstantInt>(RHS)) {
244 if (match(LHS, m_Not(m_Value(X)))) // ~X + C --> (C-1) - X
245 return BinaryOperator::CreateSub(SubOne(CRHS), X);
247 // (X & FF00) + xx00 -> (X+xx00) & FF00
248 if (LHS->hasOneUse() &&
249 match(LHS, m_And(m_Value(X), m_ConstantInt(C2))) &&
250 CRHS->getValue() == (CRHS->getValue() & C2->getValue())) {
251 // See if all bits from the first bit set in the Add RHS up are included
252 // in the mask. First, get the rightmost bit.
253 const APInt &AddRHSV = CRHS->getValue();
255 // Form a mask of all bits from the lowest bit added through the top.
256 APInt AddRHSHighBits(~((AddRHSV & -AddRHSV)-1));
258 // See if the and mask includes all of these bits.
259 APInt AddRHSHighBitsAnd(AddRHSHighBits & C2->getValue());
261 if (AddRHSHighBits == AddRHSHighBitsAnd) {
262 // Okay, the xform is safe. Insert the new add pronto.
263 Value *NewAdd = Builder->CreateAdd(X, CRHS, LHS->getName());
264 return BinaryOperator::CreateAnd(NewAdd, C2);
268 // Try to fold constant add into select arguments.
269 if (SelectInst *SI = dyn_cast<SelectInst>(LHS))
270 if (Instruction *R = FoldOpIntoSelect(I, SI))
274 // add (select X 0 (sub n A)) A --> select X A n
276 SelectInst *SI = dyn_cast<SelectInst>(LHS);
279 SI = dyn_cast<SelectInst>(RHS);
282 if (SI && SI->hasOneUse()) {
283 Value *TV = SI->getTrueValue();
284 Value *FV = SI->getFalseValue();
287 // Can we fold the add into the argument of the select?
288 // We check both true and false select arguments for a matching subtract.
289 if (match(FV, m_Zero()) && match(TV, m_Sub(m_Value(N), m_Specific(A))))
290 // Fold the add into the true select value.
291 return SelectInst::Create(SI->getCondition(), N, A);
293 if (match(TV, m_Zero()) && match(FV, m_Sub(m_Value(N), m_Specific(A))))
294 // Fold the add into the false select value.
295 return SelectInst::Create(SI->getCondition(), A, N);
299 // Check for (add (sext x), y), see if we can merge this into an
300 // integer add followed by a sext.
301 if (SExtInst *LHSConv = dyn_cast<SExtInst>(LHS)) {
302 // (add (sext x), cst) --> (sext (add x, cst'))
303 if (ConstantInt *RHSC = dyn_cast<ConstantInt>(RHS)) {
305 ConstantExpr::getTrunc(RHSC, LHSConv->getOperand(0)->getType());
306 if (LHSConv->hasOneUse() &&
307 ConstantExpr::getSExt(CI, I.getType()) == RHSC &&
308 WillNotOverflowSignedAdd(LHSConv->getOperand(0), CI)) {
309 // Insert the new, smaller add.
310 Value *NewAdd = Builder->CreateNSWAdd(LHSConv->getOperand(0),
312 return new SExtInst(NewAdd, I.getType());
316 // (add (sext x), (sext y)) --> (sext (add int x, y))
317 if (SExtInst *RHSConv = dyn_cast<SExtInst>(RHS)) {
318 // Only do this if x/y have the same type, if at last one of them has a
319 // single use (so we don't increase the number of sexts), and if the
320 // integer add will not overflow.
321 if (LHSConv->getOperand(0)->getType()==RHSConv->getOperand(0)->getType()&&
322 (LHSConv->hasOneUse() || RHSConv->hasOneUse()) &&
323 WillNotOverflowSignedAdd(LHSConv->getOperand(0),
324 RHSConv->getOperand(0))) {
325 // Insert the new integer add.
326 Value *NewAdd = Builder->CreateNSWAdd(LHSConv->getOperand(0),
327 RHSConv->getOperand(0), "addconv");
328 return new SExtInst(NewAdd, I.getType());
333 // Check for (x & y) + (x ^ y)
335 Value *A = 0, *B = 0;
336 if (match(RHS, m_Xor(m_Value(A), m_Value(B))) &&
337 (match(LHS, m_And(m_Specific(A), m_Specific(B))) ||
338 match(LHS, m_And(m_Specific(B), m_Specific(A)))))
339 return BinaryOperator::CreateOr(A, B);
341 if (match(LHS, m_Xor(m_Value(A), m_Value(B))) &&
342 (match(RHS, m_And(m_Specific(A), m_Specific(B))) ||
343 match(RHS, m_And(m_Specific(B), m_Specific(A)))))
344 return BinaryOperator::CreateOr(A, B);
347 return Changed ? &I : 0;
350 Instruction *InstCombiner::visitFAdd(BinaryOperator &I) {
351 bool Changed = SimplifyAssociativeOrCommutative(I);
352 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1);
354 if (Value *V = SimplifyFAddInst(LHS, RHS, I.getFastMathFlags(), TD))
355 return ReplaceInstUsesWith(I, V);
357 if (isa<Constant>(RHS) && isa<PHINode>(LHS))
358 if (Instruction *NV = FoldOpIntoPhi(I))
362 // -A + -B --> -(A + B)
363 if (Value *LHSV = dyn_castFNegVal(LHS))
364 return BinaryOperator::CreateFSub(RHS, LHSV);
367 if (!isa<Constant>(RHS))
368 if (Value *V = dyn_castFNegVal(RHS))
369 return BinaryOperator::CreateFSub(LHS, V);
371 // Check for (fadd double (sitofp x), y), see if we can merge this into an
372 // integer add followed by a promotion.
373 if (SIToFPInst *LHSConv = dyn_cast<SIToFPInst>(LHS)) {
374 // (fadd double (sitofp x), fpcst) --> (sitofp (add int x, intcst))
375 // ... if the constant fits in the integer value. This is useful for things
376 // like (double)(x & 1234) + 4.0 -> (double)((X & 1234)+4) which no longer
377 // requires a constant pool load, and generally allows the add to be better
379 if (ConstantFP *CFP = dyn_cast<ConstantFP>(RHS)) {
381 ConstantExpr::getFPToSI(CFP, LHSConv->getOperand(0)->getType());
382 if (LHSConv->hasOneUse() &&
383 ConstantExpr::getSIToFP(CI, I.getType()) == CFP &&
384 WillNotOverflowSignedAdd(LHSConv->getOperand(0), CI)) {
385 // Insert the new integer add.
386 Value *NewAdd = Builder->CreateNSWAdd(LHSConv->getOperand(0),
388 return new SIToFPInst(NewAdd, I.getType());
392 // (fadd double (sitofp x), (sitofp y)) --> (sitofp (add int x, y))
393 if (SIToFPInst *RHSConv = dyn_cast<SIToFPInst>(RHS)) {
394 // Only do this if x/y have the same type, if at last one of them has a
395 // single use (so we don't increase the number of int->fp conversions),
396 // and if the integer add will not overflow.
397 if (LHSConv->getOperand(0)->getType()==RHSConv->getOperand(0)->getType()&&
398 (LHSConv->hasOneUse() || RHSConv->hasOneUse()) &&
399 WillNotOverflowSignedAdd(LHSConv->getOperand(0),
400 RHSConv->getOperand(0))) {
401 // Insert the new integer add.
402 Value *NewAdd = Builder->CreateNSWAdd(LHSConv->getOperand(0),
403 RHSConv->getOperand(0),"addconv");
404 return new SIToFPInst(NewAdd, I.getType());
409 return Changed ? &I : 0;
413 /// Optimize pointer differences into the same array into a size. Consider:
414 /// &A[10] - &A[0]: we should compile this to "10". LHS/RHS are the pointer
415 /// operands to the ptrtoint instructions for the LHS/RHS of the subtract.
417 Value *InstCombiner::OptimizePointerDifference(Value *LHS, Value *RHS,
419 assert(TD && "Must have target data info for this");
421 // If LHS is a gep based on RHS or RHS is a gep based on LHS, we can optimize
423 bool Swapped = false;
424 GEPOperator *GEP1 = 0, *GEP2 = 0;
426 // For now we require one side to be the base pointer "A" or a constant
427 // GEP derived from it.
428 if (GEPOperator *LHSGEP = dyn_cast<GEPOperator>(LHS)) {
430 if (LHSGEP->getOperand(0) == RHS) {
433 } else if (GEPOperator *RHSGEP = dyn_cast<GEPOperator>(RHS)) {
434 // (gep X, ...) - (gep X, ...)
435 if (LHSGEP->getOperand(0)->stripPointerCasts() ==
436 RHSGEP->getOperand(0)->stripPointerCasts()) {
444 if (GEPOperator *RHSGEP = dyn_cast<GEPOperator>(RHS)) {
446 if (RHSGEP->getOperand(0) == LHS) {
449 } else if (GEPOperator *LHSGEP = dyn_cast<GEPOperator>(LHS)) {
450 // (gep X, ...) - (gep X, ...)
451 if (RHSGEP->getOperand(0)->stripPointerCasts() ==
452 LHSGEP->getOperand(0)->stripPointerCasts()) {
460 // Avoid duplicating the arithmetic if GEP2 has non-constant indices and
463 (GEP2 != 0 && !GEP2->hasAllConstantIndices() && !GEP2->hasOneUse()))
466 // Emit the offset of the GEP and an intptr_t.
467 Value *Result = EmitGEPOffset(GEP1);
469 // If we had a constant expression GEP on the other side offsetting the
470 // pointer, subtract it from the offset we have.
472 Value *Offset = EmitGEPOffset(GEP2);
473 Result = Builder->CreateSub(Result, Offset);
476 // If we have p - gep(p, ...) then we have to negate the result.
478 Result = Builder->CreateNeg(Result, "diff.neg");
480 return Builder->CreateIntCast(Result, Ty, true);
484 Instruction *InstCombiner::visitSub(BinaryOperator &I) {
485 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
487 if (Value *V = SimplifySubInst(Op0, Op1, I.hasNoSignedWrap(),
488 I.hasNoUnsignedWrap(), TD))
489 return ReplaceInstUsesWith(I, V);
491 // (A*B)-(A*C) -> A*(B-C) etc
492 if (Value *V = SimplifyUsingDistributiveLaws(I))
493 return ReplaceInstUsesWith(I, V);
495 // If this is a 'B = x-(-A)', change to B = x+A. This preserves NSW/NUW.
496 if (Value *V = dyn_castNegVal(Op1)) {
497 BinaryOperator *Res = BinaryOperator::CreateAdd(Op0, V);
498 Res->setHasNoSignedWrap(I.hasNoSignedWrap());
499 Res->setHasNoUnsignedWrap(I.hasNoUnsignedWrap());
503 if (I.getType()->isIntegerTy(1))
504 return BinaryOperator::CreateXor(Op0, Op1);
506 // Replace (-1 - A) with (~A).
507 if (match(Op0, m_AllOnes()))
508 return BinaryOperator::CreateNot(Op1);
510 if (ConstantInt *C = dyn_cast<ConstantInt>(Op0)) {
511 // C - ~X == X + (1+C)
513 if (match(Op1, m_Not(m_Value(X))))
514 return BinaryOperator::CreateAdd(X, AddOne(C));
516 // -(X >>u 31) -> (X >>s 31)
517 // -(X >>s 31) -> (X >>u 31)
519 Value *X; ConstantInt *CI;
520 if (match(Op1, m_LShr(m_Value(X), m_ConstantInt(CI))) &&
521 // Verify we are shifting out everything but the sign bit.
522 CI->getValue() == I.getType()->getPrimitiveSizeInBits()-1)
523 return BinaryOperator::CreateAShr(X, CI);
525 if (match(Op1, m_AShr(m_Value(X), m_ConstantInt(CI))) &&
526 // Verify we are shifting out everything but the sign bit.
527 CI->getValue() == I.getType()->getPrimitiveSizeInBits()-1)
528 return BinaryOperator::CreateLShr(X, CI);
531 // Try to fold constant sub into select arguments.
532 if (SelectInst *SI = dyn_cast<SelectInst>(Op1))
533 if (Instruction *R = FoldOpIntoSelect(I, SI))
536 // C-(X+C2) --> (C-C2)-X
538 if (match(Op1, m_Add(m_Value(X), m_ConstantInt(C2))))
539 return BinaryOperator::CreateSub(ConstantExpr::getSub(C, C2), X);
541 if (SimplifyDemandedInstructionBits(I))
547 // X-(X+Y) == -Y X-(Y+X) == -Y
548 if (match(Op1, m_Add(m_Specific(Op0), m_Value(Y))) ||
549 match(Op1, m_Add(m_Value(Y), m_Specific(Op0))))
550 return BinaryOperator::CreateNeg(Y);
553 if (match(Op0, m_Sub(m_Specific(Op1), m_Value(Y))))
554 return BinaryOperator::CreateNeg(Y);
557 if (Op1->hasOneUse()) {
558 Value *X = 0, *Y = 0, *Z = 0;
562 // (X - (Y - Z)) --> (X + (Z - Y)).
563 if (match(Op1, m_Sub(m_Value(Y), m_Value(Z))))
564 return BinaryOperator::CreateAdd(Op0,
565 Builder->CreateSub(Z, Y, Op1->getName()));
567 // (X - (X & Y)) --> (X & ~Y)
569 if (match(Op1, m_And(m_Value(Y), m_Specific(Op0))) ||
570 match(Op1, m_And(m_Specific(Op0), m_Value(Y))))
571 return BinaryOperator::CreateAnd(Op0,
572 Builder->CreateNot(Y, Y->getName() + ".not"));
574 // 0 - (X sdiv C) -> (X sdiv -C)
575 if (match(Op1, m_SDiv(m_Value(X), m_Constant(C))) &&
576 match(Op0, m_Zero()))
577 return BinaryOperator::CreateSDiv(X, ConstantExpr::getNeg(C));
579 // 0 - (X << Y) -> (-X << Y) when X is freely negatable.
580 if (match(Op1, m_Shl(m_Value(X), m_Value(Y))) && match(Op0, m_Zero()))
581 if (Value *XNeg = dyn_castNegVal(X))
582 return BinaryOperator::CreateShl(XNeg, Y);
584 // X - X*C --> X * (1-C)
585 if (match(Op1, m_Mul(m_Specific(Op0), m_ConstantInt(CI)))) {
586 Constant *CP1 = ConstantExpr::getSub(ConstantInt::get(I.getType(),1), CI);
587 return BinaryOperator::CreateMul(Op0, CP1);
590 // X - X<<C --> X * (1-(1<<C))
591 if (match(Op1, m_Shl(m_Specific(Op0), m_ConstantInt(CI)))) {
592 Constant *One = ConstantInt::get(I.getType(), 1);
593 C = ConstantExpr::getSub(One, ConstantExpr::getShl(One, CI));
594 return BinaryOperator::CreateMul(Op0, C);
597 // X - A*-B -> X + A*B
598 // X - -A*B -> X + A*B
600 if (match(Op1, m_Mul(m_Value(A), m_Neg(m_Value(B)))) ||
601 match(Op1, m_Mul(m_Neg(m_Value(A)), m_Value(B))))
602 return BinaryOperator::CreateAdd(Op0, Builder->CreateMul(A, B));
604 // X - A*CI -> X + A*-CI
605 // X - CI*A -> X + A*-CI
606 if (match(Op1, m_Mul(m_Value(A), m_ConstantInt(CI))) ||
607 match(Op1, m_Mul(m_ConstantInt(CI), m_Value(A)))) {
608 Value *NewMul = Builder->CreateMul(A, ConstantExpr::getNeg(CI));
609 return BinaryOperator::CreateAdd(Op0, NewMul);
614 if (Value *X = dyn_castFoldableMul(Op0, C1)) {
615 if (X == Op1) // X*C - X --> X * (C-1)
616 return BinaryOperator::CreateMul(Op1, SubOne(C1));
618 ConstantInt *C2; // X*C1 - X*C2 -> X * (C1-C2)
619 if (X == dyn_castFoldableMul(Op1, C2))
620 return BinaryOperator::CreateMul(X, ConstantExpr::getSub(C1, C2));
623 // Optimize pointer differences into the same array into a size. Consider:
624 // &A[10] - &A[0]: we should compile this to "10".
626 Value *LHSOp, *RHSOp;
627 if (match(Op0, m_PtrToInt(m_Value(LHSOp))) &&
628 match(Op1, m_PtrToInt(m_Value(RHSOp))))
629 if (Value *Res = OptimizePointerDifference(LHSOp, RHSOp, I.getType()))
630 return ReplaceInstUsesWith(I, Res);
632 // trunc(p)-trunc(q) -> trunc(p-q)
633 if (match(Op0, m_Trunc(m_PtrToInt(m_Value(LHSOp)))) &&
634 match(Op1, m_Trunc(m_PtrToInt(m_Value(RHSOp)))))
635 if (Value *Res = OptimizePointerDifference(LHSOp, RHSOp, I.getType()))
636 return ReplaceInstUsesWith(I, Res);
642 Instruction *InstCombiner::visitFSub(BinaryOperator &I) {
643 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
645 if (Value *V = SimplifyFSubInst(Op0, Op1, I.getFastMathFlags(), TD))
646 return ReplaceInstUsesWith(I, V);
648 // If this is a 'B = x-(-A)', change to B = x+A...
649 if (Value *V = dyn_castFNegVal(Op1))
650 return BinaryOperator::CreateFAdd(Op0, V);