1 //===- InstructionCombining.cpp - Combine multiple instructions -----------===//
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 // InstructionCombining - Combine instructions to form fewer, simple
11 // instructions. This pass does not modify the CFG This pass is where algebraic
12 // simplification happens.
14 // This pass combines things like:
20 // This is a simple worklist driven algorithm.
22 // This pass guarantees that the following canonicalizations are performed on
24 // 1. If a binary operator has a constant operand, it is moved to the RHS
25 // 2. Bitwise operators with constant operands are always grouped so that
26 // shifts are performed first, then or's, then and's, then xor's.
27 // 3. Compare instructions are converted from <,>,<=,>= to ==,!= if possible
28 // 4. All cmp instructions on boolean values are replaced with logical ops
29 // 5. add X, X is represented as (X*2) => (X << 1)
30 // 6. Multiplies with a power-of-two constant argument are transformed into
34 //===----------------------------------------------------------------------===//
36 #define DEBUG_TYPE "instcombine"
37 #include "llvm/Transforms/Scalar.h"
38 #include "llvm/IntrinsicInst.h"
39 #include "llvm/Pass.h"
40 #include "llvm/DerivedTypes.h"
41 #include "llvm/GlobalVariable.h"
42 #include "llvm/ParameterAttributes.h"
43 #include "llvm/Analysis/ConstantFolding.h"
44 #include "llvm/Target/TargetData.h"
45 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
46 #include "llvm/Transforms/Utils/Local.h"
47 #include "llvm/Support/CallSite.h"
48 #include "llvm/Support/Debug.h"
49 #include "llvm/Support/GetElementPtrTypeIterator.h"
50 #include "llvm/Support/InstVisitor.h"
51 #include "llvm/Support/MathExtras.h"
52 #include "llvm/Support/PatternMatch.h"
53 #include "llvm/Support/Compiler.h"
54 #include "llvm/ADT/DenseMap.h"
55 #include "llvm/ADT/SmallVector.h"
56 #include "llvm/ADT/SmallPtrSet.h"
57 #include "llvm/ADT/Statistic.h"
58 #include "llvm/ADT/STLExtras.h"
62 using namespace llvm::PatternMatch;
64 STATISTIC(NumCombined , "Number of insts combined");
65 STATISTIC(NumConstProp, "Number of constant folds");
66 STATISTIC(NumDeadInst , "Number of dead inst eliminated");
67 STATISTIC(NumDeadStore, "Number of dead stores eliminated");
68 STATISTIC(NumSunkInst , "Number of instructions sunk");
71 class VISIBILITY_HIDDEN InstCombiner
72 : public FunctionPass,
73 public InstVisitor<InstCombiner, Instruction*> {
74 // Worklist of all of the instructions that need to be simplified.
75 std::vector<Instruction*> Worklist;
76 DenseMap<Instruction*, unsigned> WorklistMap;
78 bool MustPreserveLCSSA;
80 static char ID; // Pass identification, replacement for typeid
81 InstCombiner() : FunctionPass((intptr_t)&ID) {}
83 /// AddToWorkList - Add the specified instruction to the worklist if it
84 /// isn't already in it.
85 void AddToWorkList(Instruction *I) {
86 if (WorklistMap.insert(std::make_pair(I, Worklist.size())))
87 Worklist.push_back(I);
90 // RemoveFromWorkList - remove I from the worklist if it exists.
91 void RemoveFromWorkList(Instruction *I) {
92 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
93 if (It == WorklistMap.end()) return; // Not in worklist.
95 // Don't bother moving everything down, just null out the slot.
96 Worklist[It->second] = 0;
98 WorklistMap.erase(It);
101 Instruction *RemoveOneFromWorkList() {
102 Instruction *I = Worklist.back();
104 WorklistMap.erase(I);
109 /// AddUsersToWorkList - When an instruction is simplified, add all users of
110 /// the instruction to the work lists because they might get more simplified
113 void AddUsersToWorkList(Value &I) {
114 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
116 AddToWorkList(cast<Instruction>(*UI));
119 /// AddUsesToWorkList - When an instruction is simplified, add operands to
120 /// the work lists because they might get more simplified now.
122 void AddUsesToWorkList(Instruction &I) {
123 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
124 if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i)))
128 /// AddSoonDeadInstToWorklist - The specified instruction is about to become
129 /// dead. Add all of its operands to the worklist, turning them into
130 /// undef's to reduce the number of uses of those instructions.
132 /// Return the specified operand before it is turned into an undef.
134 Value *AddSoonDeadInstToWorklist(Instruction &I, unsigned op) {
135 Value *R = I.getOperand(op);
137 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
138 if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) {
140 // Set the operand to undef to drop the use.
141 I.setOperand(i, UndefValue::get(Op->getType()));
148 virtual bool runOnFunction(Function &F);
150 bool DoOneIteration(Function &F, unsigned ItNum);
152 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
153 AU.addRequired<TargetData>();
154 AU.addPreservedID(LCSSAID);
155 AU.setPreservesCFG();
158 TargetData &getTargetData() const { return *TD; }
160 // Visitation implementation - Implement instruction combining for different
161 // instruction types. The semantics are as follows:
163 // null - No change was made
164 // I - Change was made, I is still valid, I may be dead though
165 // otherwise - Change was made, replace I with returned instruction
167 Instruction *visitAdd(BinaryOperator &I);
168 Instruction *visitSub(BinaryOperator &I);
169 Instruction *visitMul(BinaryOperator &I);
170 Instruction *visitURem(BinaryOperator &I);
171 Instruction *visitSRem(BinaryOperator &I);
172 Instruction *visitFRem(BinaryOperator &I);
173 Instruction *commonRemTransforms(BinaryOperator &I);
174 Instruction *commonIRemTransforms(BinaryOperator &I);
175 Instruction *commonDivTransforms(BinaryOperator &I);
176 Instruction *commonIDivTransforms(BinaryOperator &I);
177 Instruction *visitUDiv(BinaryOperator &I);
178 Instruction *visitSDiv(BinaryOperator &I);
179 Instruction *visitFDiv(BinaryOperator &I);
180 Instruction *visitAnd(BinaryOperator &I);
181 Instruction *visitOr (BinaryOperator &I);
182 Instruction *visitXor(BinaryOperator &I);
183 Instruction *visitShl(BinaryOperator &I);
184 Instruction *visitAShr(BinaryOperator &I);
185 Instruction *visitLShr(BinaryOperator &I);
186 Instruction *commonShiftTransforms(BinaryOperator &I);
187 Instruction *visitFCmpInst(FCmpInst &I);
188 Instruction *visitICmpInst(ICmpInst &I);
189 Instruction *visitICmpInstWithCastAndCast(ICmpInst &ICI);
190 Instruction *visitICmpInstWithInstAndIntCst(ICmpInst &ICI,
193 Instruction *FoldICmpDivCst(ICmpInst &ICI, BinaryOperator *DivI,
194 ConstantInt *DivRHS);
196 Instruction *FoldGEPICmp(User *GEPLHS, Value *RHS,
197 ICmpInst::Predicate Cond, Instruction &I);
198 Instruction *FoldShiftByConstant(Value *Op0, ConstantInt *Op1,
200 Instruction *commonCastTransforms(CastInst &CI);
201 Instruction *commonIntCastTransforms(CastInst &CI);
202 Instruction *commonPointerCastTransforms(CastInst &CI);
203 Instruction *visitTrunc(TruncInst &CI);
204 Instruction *visitZExt(ZExtInst &CI);
205 Instruction *visitSExt(SExtInst &CI);
206 Instruction *visitFPTrunc(CastInst &CI);
207 Instruction *visitFPExt(CastInst &CI);
208 Instruction *visitFPToUI(CastInst &CI);
209 Instruction *visitFPToSI(CastInst &CI);
210 Instruction *visitUIToFP(CastInst &CI);
211 Instruction *visitSIToFP(CastInst &CI);
212 Instruction *visitPtrToInt(CastInst &CI);
213 Instruction *visitIntToPtr(IntToPtrInst &CI);
214 Instruction *visitBitCast(BitCastInst &CI);
215 Instruction *FoldSelectOpOp(SelectInst &SI, Instruction *TI,
217 Instruction *visitSelectInst(SelectInst &CI);
218 Instruction *visitCallInst(CallInst &CI);
219 Instruction *visitInvokeInst(InvokeInst &II);
220 Instruction *visitPHINode(PHINode &PN);
221 Instruction *visitGetElementPtrInst(GetElementPtrInst &GEP);
222 Instruction *visitAllocationInst(AllocationInst &AI);
223 Instruction *visitFreeInst(FreeInst &FI);
224 Instruction *visitLoadInst(LoadInst &LI);
225 Instruction *visitStoreInst(StoreInst &SI);
226 Instruction *visitBranchInst(BranchInst &BI);
227 Instruction *visitSwitchInst(SwitchInst &SI);
228 Instruction *visitInsertElementInst(InsertElementInst &IE);
229 Instruction *visitExtractElementInst(ExtractElementInst &EI);
230 Instruction *visitShuffleVectorInst(ShuffleVectorInst &SVI);
232 // visitInstruction - Specify what to return for unhandled instructions...
233 Instruction *visitInstruction(Instruction &I) { return 0; }
236 Instruction *visitCallSite(CallSite CS);
237 bool transformConstExprCastCall(CallSite CS);
238 Instruction *transformCallThroughTrampoline(CallSite CS);
241 // InsertNewInstBefore - insert an instruction New before instruction Old
242 // in the program. Add the new instruction to the worklist.
244 Instruction *InsertNewInstBefore(Instruction *New, Instruction &Old) {
245 assert(New && New->getParent() == 0 &&
246 "New instruction already inserted into a basic block!");
247 BasicBlock *BB = Old.getParent();
248 BB->getInstList().insert(&Old, New); // Insert inst
253 /// InsertCastBefore - Insert a cast of V to TY before the instruction POS.
254 /// This also adds the cast to the worklist. Finally, this returns the
256 Value *InsertCastBefore(Instruction::CastOps opc, Value *V, const Type *Ty,
258 if (V->getType() == Ty) return V;
260 if (Constant *CV = dyn_cast<Constant>(V))
261 return ConstantExpr::getCast(opc, CV, Ty);
263 Instruction *C = CastInst::create(opc, V, Ty, V->getName(), &Pos);
268 Value *InsertBitCastBefore(Value *V, const Type *Ty, Instruction &Pos) {
269 return InsertCastBefore(Instruction::BitCast, V, Ty, Pos);
273 // ReplaceInstUsesWith - This method is to be used when an instruction is
274 // found to be dead, replacable with another preexisting expression. Here
275 // we add all uses of I to the worklist, replace all uses of I with the new
276 // value, then return I, so that the inst combiner will know that I was
279 Instruction *ReplaceInstUsesWith(Instruction &I, Value *V) {
280 AddUsersToWorkList(I); // Add all modified instrs to worklist
282 I.replaceAllUsesWith(V);
285 // If we are replacing the instruction with itself, this must be in a
286 // segment of unreachable code, so just clobber the instruction.
287 I.replaceAllUsesWith(UndefValue::get(I.getType()));
292 // UpdateValueUsesWith - This method is to be used when an value is
293 // found to be replacable with another preexisting expression or was
294 // updated. Here we add all uses of I to the worklist, replace all uses of
295 // I with the new value (unless the instruction was just updated), then
296 // return true, so that the inst combiner will know that I was modified.
298 bool UpdateValueUsesWith(Value *Old, Value *New) {
299 AddUsersToWorkList(*Old); // Add all modified instrs to worklist
301 Old->replaceAllUsesWith(New);
302 if (Instruction *I = dyn_cast<Instruction>(Old))
304 if (Instruction *I = dyn_cast<Instruction>(New))
309 // EraseInstFromFunction - When dealing with an instruction that has side
310 // effects or produces a void value, we can't rely on DCE to delete the
311 // instruction. Instead, visit methods should return the value returned by
313 Instruction *EraseInstFromFunction(Instruction &I) {
314 assert(I.use_empty() && "Cannot erase instruction that is used!");
315 AddUsesToWorkList(I);
316 RemoveFromWorkList(&I);
318 return 0; // Don't do anything with FI
322 /// InsertOperandCastBefore - This inserts a cast of V to DestTy before the
323 /// InsertBefore instruction. This is specialized a bit to avoid inserting
324 /// casts that are known to not do anything...
326 Value *InsertOperandCastBefore(Instruction::CastOps opcode,
327 Value *V, const Type *DestTy,
328 Instruction *InsertBefore);
330 /// SimplifyCommutative - This performs a few simplifications for
331 /// commutative operators.
332 bool SimplifyCommutative(BinaryOperator &I);
334 /// SimplifyCompare - This reorders the operands of a CmpInst to get them in
335 /// most-complex to least-complex order.
336 bool SimplifyCompare(CmpInst &I);
338 /// SimplifyDemandedBits - Attempts to replace V with a simpler value based
339 /// on the demanded bits.
340 bool SimplifyDemandedBits(Value *V, APInt DemandedMask,
341 APInt& KnownZero, APInt& KnownOne,
344 Value *SimplifyDemandedVectorElts(Value *V, uint64_t DemandedElts,
345 uint64_t &UndefElts, unsigned Depth = 0);
347 // FoldOpIntoPhi - Given a binary operator or cast instruction which has a
348 // PHI node as operand #0, see if we can fold the instruction into the PHI
349 // (which is only possible if all operands to the PHI are constants).
350 Instruction *FoldOpIntoPhi(Instruction &I);
352 // FoldPHIArgOpIntoPHI - If all operands to a PHI node are the same "unary"
353 // operator and they all are only used by the PHI, PHI together their
354 // inputs, and do the operation once, to the result of the PHI.
355 Instruction *FoldPHIArgOpIntoPHI(PHINode &PN);
356 Instruction *FoldPHIArgBinOpIntoPHI(PHINode &PN);
359 Instruction *OptAndOp(Instruction *Op, ConstantInt *OpRHS,
360 ConstantInt *AndRHS, BinaryOperator &TheAnd);
362 Value *FoldLogicalPlusAnd(Value *LHS, Value *RHS, ConstantInt *Mask,
363 bool isSub, Instruction &I);
364 Instruction *InsertRangeTest(Value *V, Constant *Lo, Constant *Hi,
365 bool isSigned, bool Inside, Instruction &IB);
366 Instruction *PromoteCastOfAllocation(BitCastInst &CI, AllocationInst &AI);
367 Instruction *MatchBSwap(BinaryOperator &I);
368 bool SimplifyStoreAtEndOfBlock(StoreInst &SI);
369 Instruction *SimplifyMemTransfer(MemIntrinsic *MI);
372 Value *EvaluateInDifferentType(Value *V, const Type *Ty, bool isSigned);
375 char InstCombiner::ID = 0;
376 RegisterPass<InstCombiner> X("instcombine", "Combine redundant instructions");
379 // getComplexity: Assign a complexity or rank value to LLVM Values...
380 // 0 -> undef, 1 -> Const, 2 -> Other, 3 -> Arg, 3 -> Unary, 4 -> OtherInst
381 static unsigned getComplexity(Value *V) {
382 if (isa<Instruction>(V)) {
383 if (BinaryOperator::isNeg(V) || BinaryOperator::isNot(V))
387 if (isa<Argument>(V)) return 3;
388 return isa<Constant>(V) ? (isa<UndefValue>(V) ? 0 : 1) : 2;
391 // isOnlyUse - Return true if this instruction will be deleted if we stop using
393 static bool isOnlyUse(Value *V) {
394 return V->hasOneUse() || isa<Constant>(V);
397 // getPromotedType - Return the specified type promoted as it would be to pass
398 // though a va_arg area...
399 static const Type *getPromotedType(const Type *Ty) {
400 if (const IntegerType* ITy = dyn_cast<IntegerType>(Ty)) {
401 if (ITy->getBitWidth() < 32)
402 return Type::Int32Ty;
407 /// getBitCastOperand - If the specified operand is a CastInst or a constant
408 /// expression bitcast, return the operand value, otherwise return null.
409 static Value *getBitCastOperand(Value *V) {
410 if (BitCastInst *I = dyn_cast<BitCastInst>(V))
411 return I->getOperand(0);
412 else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V))
413 if (CE->getOpcode() == Instruction::BitCast)
414 return CE->getOperand(0);
418 /// This function is a wrapper around CastInst::isEliminableCastPair. It
419 /// simply extracts arguments and returns what that function returns.
420 static Instruction::CastOps
421 isEliminableCastPair(
422 const CastInst *CI, ///< The first cast instruction
423 unsigned opcode, ///< The opcode of the second cast instruction
424 const Type *DstTy, ///< The target type for the second cast instruction
425 TargetData *TD ///< The target data for pointer size
428 const Type *SrcTy = CI->getOperand(0)->getType(); // A from above
429 const Type *MidTy = CI->getType(); // B from above
431 // Get the opcodes of the two Cast instructions
432 Instruction::CastOps firstOp = Instruction::CastOps(CI->getOpcode());
433 Instruction::CastOps secondOp = Instruction::CastOps(opcode);
435 return Instruction::CastOps(
436 CastInst::isEliminableCastPair(firstOp, secondOp, SrcTy, MidTy,
437 DstTy, TD->getIntPtrType()));
440 /// ValueRequiresCast - Return true if the cast from "V to Ty" actually results
441 /// in any code being generated. It does not require codegen if V is simple
442 /// enough or if the cast can be folded into other casts.
443 static bool ValueRequiresCast(Instruction::CastOps opcode, const Value *V,
444 const Type *Ty, TargetData *TD) {
445 if (V->getType() == Ty || isa<Constant>(V)) return false;
447 // If this is another cast that can be eliminated, it isn't codegen either.
448 if (const CastInst *CI = dyn_cast<CastInst>(V))
449 if (isEliminableCastPair(CI, opcode, Ty, TD))
454 /// InsertOperandCastBefore - This inserts a cast of V to DestTy before the
455 /// InsertBefore instruction. This is specialized a bit to avoid inserting
456 /// casts that are known to not do anything...
458 Value *InstCombiner::InsertOperandCastBefore(Instruction::CastOps opcode,
459 Value *V, const Type *DestTy,
460 Instruction *InsertBefore) {
461 if (V->getType() == DestTy) return V;
462 if (Constant *C = dyn_cast<Constant>(V))
463 return ConstantExpr::getCast(opcode, C, DestTy);
465 return InsertCastBefore(opcode, V, DestTy, *InsertBefore);
468 // SimplifyCommutative - This performs a few simplifications for commutative
471 // 1. Order operands such that they are listed from right (least complex) to
472 // left (most complex). This puts constants before unary operators before
475 // 2. Transform: (op (op V, C1), C2) ==> (op V, (op C1, C2))
476 // 3. Transform: (op (op V1, C1), (op V2, C2)) ==> (op (op V1, V2), (op C1,C2))
478 bool InstCombiner::SimplifyCommutative(BinaryOperator &I) {
479 bool Changed = false;
480 if (getComplexity(I.getOperand(0)) < getComplexity(I.getOperand(1)))
481 Changed = !I.swapOperands();
483 if (!I.isAssociative()) return Changed;
484 Instruction::BinaryOps Opcode = I.getOpcode();
485 if (BinaryOperator *Op = dyn_cast<BinaryOperator>(I.getOperand(0)))
486 if (Op->getOpcode() == Opcode && isa<Constant>(Op->getOperand(1))) {
487 if (isa<Constant>(I.getOperand(1))) {
488 Constant *Folded = ConstantExpr::get(I.getOpcode(),
489 cast<Constant>(I.getOperand(1)),
490 cast<Constant>(Op->getOperand(1)));
491 I.setOperand(0, Op->getOperand(0));
492 I.setOperand(1, Folded);
494 } else if (BinaryOperator *Op1=dyn_cast<BinaryOperator>(I.getOperand(1)))
495 if (Op1->getOpcode() == Opcode && isa<Constant>(Op1->getOperand(1)) &&
496 isOnlyUse(Op) && isOnlyUse(Op1)) {
497 Constant *C1 = cast<Constant>(Op->getOperand(1));
498 Constant *C2 = cast<Constant>(Op1->getOperand(1));
500 // Fold (op (op V1, C1), (op V2, C2)) ==> (op (op V1, V2), (op C1,C2))
501 Constant *Folded = ConstantExpr::get(I.getOpcode(), C1, C2);
502 Instruction *New = BinaryOperator::create(Opcode, Op->getOperand(0),
506 I.setOperand(0, New);
507 I.setOperand(1, Folded);
514 /// SimplifyCompare - For a CmpInst this function just orders the operands
515 /// so that theyare listed from right (least complex) to left (most complex).
516 /// This puts constants before unary operators before binary operators.
517 bool InstCombiner::SimplifyCompare(CmpInst &I) {
518 if (getComplexity(I.getOperand(0)) >= getComplexity(I.getOperand(1)))
521 // Compare instructions are not associative so there's nothing else we can do.
525 // dyn_castNegVal - Given a 'sub' instruction, return the RHS of the instruction
526 // if the LHS is a constant zero (which is the 'negate' form).
528 static inline Value *dyn_castNegVal(Value *V) {
529 if (BinaryOperator::isNeg(V))
530 return BinaryOperator::getNegArgument(V);
532 // Constants can be considered to be negated values if they can be folded.
533 if (ConstantInt *C = dyn_cast<ConstantInt>(V))
534 return ConstantExpr::getNeg(C);
538 static inline Value *dyn_castNotVal(Value *V) {
539 if (BinaryOperator::isNot(V))
540 return BinaryOperator::getNotArgument(V);
542 // Constants can be considered to be not'ed values...
543 if (ConstantInt *C = dyn_cast<ConstantInt>(V))
544 return ConstantInt::get(~C->getValue());
548 // dyn_castFoldableMul - If this value is a multiply that can be folded into
549 // other computations (because it has a constant operand), return the
550 // non-constant operand of the multiply, and set CST to point to the multiplier.
551 // Otherwise, return null.
553 static inline Value *dyn_castFoldableMul(Value *V, ConstantInt *&CST) {
554 if (V->hasOneUse() && V->getType()->isInteger())
555 if (Instruction *I = dyn_cast<Instruction>(V)) {
556 if (I->getOpcode() == Instruction::Mul)
557 if ((CST = dyn_cast<ConstantInt>(I->getOperand(1))))
558 return I->getOperand(0);
559 if (I->getOpcode() == Instruction::Shl)
560 if ((CST = dyn_cast<ConstantInt>(I->getOperand(1)))) {
561 // The multiplier is really 1 << CST.
562 uint32_t BitWidth = cast<IntegerType>(V->getType())->getBitWidth();
563 uint32_t CSTVal = CST->getLimitedValue(BitWidth);
564 CST = ConstantInt::get(APInt(BitWidth, 1).shl(CSTVal));
565 return I->getOperand(0);
571 /// dyn_castGetElementPtr - If this is a getelementptr instruction or constant
572 /// expression, return it.
573 static User *dyn_castGetElementPtr(Value *V) {
574 if (isa<GetElementPtrInst>(V)) return cast<User>(V);
575 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V))
576 if (CE->getOpcode() == Instruction::GetElementPtr)
577 return cast<User>(V);
581 /// AddOne - Add one to a ConstantInt
582 static ConstantInt *AddOne(ConstantInt *C) {
583 APInt Val(C->getValue());
584 return ConstantInt::get(++Val);
586 /// SubOne - Subtract one from a ConstantInt
587 static ConstantInt *SubOne(ConstantInt *C) {
588 APInt Val(C->getValue());
589 return ConstantInt::get(--Val);
591 /// Add - Add two ConstantInts together
592 static ConstantInt *Add(ConstantInt *C1, ConstantInt *C2) {
593 return ConstantInt::get(C1->getValue() + C2->getValue());
595 /// And - Bitwise AND two ConstantInts together
596 static ConstantInt *And(ConstantInt *C1, ConstantInt *C2) {
597 return ConstantInt::get(C1->getValue() & C2->getValue());
599 /// Subtract - Subtract one ConstantInt from another
600 static ConstantInt *Subtract(ConstantInt *C1, ConstantInt *C2) {
601 return ConstantInt::get(C1->getValue() - C2->getValue());
603 /// Multiply - Multiply two ConstantInts together
604 static ConstantInt *Multiply(ConstantInt *C1, ConstantInt *C2) {
605 return ConstantInt::get(C1->getValue() * C2->getValue());
608 /// ComputeMaskedBits - Determine which of the bits specified in Mask are
609 /// known to be either zero or one and return them in the KnownZero/KnownOne
610 /// bit sets. This code only analyzes bits in Mask, in order to short-circuit
612 /// NOTE: we cannot consider 'undef' to be "IsZero" here. The problem is that
613 /// we cannot optimize based on the assumption that it is zero without changing
614 /// it to be an explicit zero. If we don't change it to zero, other code could
615 /// optimized based on the contradictory assumption that it is non-zero.
616 /// Because instcombine aggressively folds operations with undef args anyway,
617 /// this won't lose us code quality.
618 static void ComputeMaskedBits(Value *V, const APInt &Mask, APInt& KnownZero,
619 APInt& KnownOne, unsigned Depth = 0) {
620 assert(V && "No Value?");
621 assert(Depth <= 6 && "Limit Search Depth");
622 uint32_t BitWidth = Mask.getBitWidth();
623 assert(cast<IntegerType>(V->getType())->getBitWidth() == BitWidth &&
624 KnownZero.getBitWidth() == BitWidth &&
625 KnownOne.getBitWidth() == BitWidth &&
626 "V, Mask, KnownOne and KnownZero should have same BitWidth");
627 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
628 // We know all of the bits for a constant!
629 KnownOne = CI->getValue() & Mask;
630 KnownZero = ~KnownOne & Mask;
634 if (Depth == 6 || Mask == 0)
635 return; // Limit search depth.
637 Instruction *I = dyn_cast<Instruction>(V);
640 KnownZero.clear(); KnownOne.clear(); // Don't know anything.
641 APInt KnownZero2(KnownZero), KnownOne2(KnownOne);
643 switch (I->getOpcode()) {
644 case Instruction::And: {
645 // If either the LHS or the RHS are Zero, the result is zero.
646 ComputeMaskedBits(I->getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
647 APInt Mask2(Mask & ~KnownZero);
648 ComputeMaskedBits(I->getOperand(0), Mask2, KnownZero2, KnownOne2, Depth+1);
649 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
650 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
652 // Output known-1 bits are only known if set in both the LHS & RHS.
653 KnownOne &= KnownOne2;
654 // Output known-0 are known to be clear if zero in either the LHS | RHS.
655 KnownZero |= KnownZero2;
658 case Instruction::Or: {
659 ComputeMaskedBits(I->getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
660 APInt Mask2(Mask & ~KnownOne);
661 ComputeMaskedBits(I->getOperand(0), Mask2, KnownZero2, KnownOne2, Depth+1);
662 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
663 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
665 // Output known-0 bits are only known if clear in both the LHS & RHS.
666 KnownZero &= KnownZero2;
667 // Output known-1 are known to be set if set in either the LHS | RHS.
668 KnownOne |= KnownOne2;
671 case Instruction::Xor: {
672 ComputeMaskedBits(I->getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
673 ComputeMaskedBits(I->getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
674 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
675 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
677 // Output known-0 bits are known if clear or set in both the LHS & RHS.
678 APInt KnownZeroOut = (KnownZero & KnownZero2) | (KnownOne & KnownOne2);
679 // Output known-1 are known to be set if set in only one of the LHS, RHS.
680 KnownOne = (KnownZero & KnownOne2) | (KnownOne & KnownZero2);
681 KnownZero = KnownZeroOut;
684 case Instruction::Select:
685 ComputeMaskedBits(I->getOperand(2), Mask, KnownZero, KnownOne, Depth+1);
686 ComputeMaskedBits(I->getOperand(1), Mask, KnownZero2, KnownOne2, Depth+1);
687 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
688 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
690 // Only known if known in both the LHS and RHS.
691 KnownOne &= KnownOne2;
692 KnownZero &= KnownZero2;
694 case Instruction::FPTrunc:
695 case Instruction::FPExt:
696 case Instruction::FPToUI:
697 case Instruction::FPToSI:
698 case Instruction::SIToFP:
699 case Instruction::PtrToInt:
700 case Instruction::UIToFP:
701 case Instruction::IntToPtr:
702 return; // Can't work with floating point or pointers
703 case Instruction::Trunc: {
704 // All these have integer operands
705 uint32_t SrcBitWidth =
706 cast<IntegerType>(I->getOperand(0)->getType())->getBitWidth();
708 MaskIn.zext(SrcBitWidth);
709 KnownZero.zext(SrcBitWidth);
710 KnownOne.zext(SrcBitWidth);
711 ComputeMaskedBits(I->getOperand(0), MaskIn, KnownZero, KnownOne, Depth+1);
712 KnownZero.trunc(BitWidth);
713 KnownOne.trunc(BitWidth);
716 case Instruction::BitCast: {
717 const Type *SrcTy = I->getOperand(0)->getType();
718 if (SrcTy->isInteger()) {
719 ComputeMaskedBits(I->getOperand(0), Mask, KnownZero, KnownOne, Depth+1);
724 case Instruction::ZExt: {
725 // Compute the bits in the result that are not present in the input.
726 const IntegerType *SrcTy = cast<IntegerType>(I->getOperand(0)->getType());
727 uint32_t SrcBitWidth = SrcTy->getBitWidth();
730 MaskIn.trunc(SrcBitWidth);
731 KnownZero.trunc(SrcBitWidth);
732 KnownOne.trunc(SrcBitWidth);
733 ComputeMaskedBits(I->getOperand(0), MaskIn, KnownZero, KnownOne, Depth+1);
734 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
735 // The top bits are known to be zero.
736 KnownZero.zext(BitWidth);
737 KnownOne.zext(BitWidth);
738 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth);
741 case Instruction::SExt: {
742 // Compute the bits in the result that are not present in the input.
743 const IntegerType *SrcTy = cast<IntegerType>(I->getOperand(0)->getType());
744 uint32_t SrcBitWidth = SrcTy->getBitWidth();
747 MaskIn.trunc(SrcBitWidth);
748 KnownZero.trunc(SrcBitWidth);
749 KnownOne.trunc(SrcBitWidth);
750 ComputeMaskedBits(I->getOperand(0), MaskIn, KnownZero, KnownOne, Depth+1);
751 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
752 KnownZero.zext(BitWidth);
753 KnownOne.zext(BitWidth);
755 // If the sign bit of the input is known set or clear, then we know the
756 // top bits of the result.
757 if (KnownZero[SrcBitWidth-1]) // Input sign bit known zero
758 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth);
759 else if (KnownOne[SrcBitWidth-1]) // Input sign bit known set
760 KnownOne |= APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth);
763 case Instruction::Shl:
764 // (shl X, C1) & C2 == 0 iff (X & C2 >>u C1) == 0
765 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
766 uint64_t ShiftAmt = SA->getLimitedValue(BitWidth);
767 APInt Mask2(Mask.lshr(ShiftAmt));
768 ComputeMaskedBits(I->getOperand(0), Mask2, KnownZero, KnownOne, Depth+1);
769 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
770 KnownZero <<= ShiftAmt;
771 KnownOne <<= ShiftAmt;
772 KnownZero |= APInt::getLowBitsSet(BitWidth, ShiftAmt); // low bits known 0
776 case Instruction::LShr:
777 // (ushr X, C1) & C2 == 0 iff (-1 >> C1) & C2 == 0
778 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
779 // Compute the new bits that are at the top now.
780 uint64_t ShiftAmt = SA->getLimitedValue(BitWidth);
782 // Unsigned shift right.
783 APInt Mask2(Mask.shl(ShiftAmt));
784 ComputeMaskedBits(I->getOperand(0), Mask2, KnownZero,KnownOne,Depth+1);
785 assert((KnownZero & KnownOne) == 0&&"Bits known to be one AND zero?");
786 KnownZero = APIntOps::lshr(KnownZero, ShiftAmt);
787 KnownOne = APIntOps::lshr(KnownOne, ShiftAmt);
788 // high bits known zero.
789 KnownZero |= APInt::getHighBitsSet(BitWidth, ShiftAmt);
793 case Instruction::AShr:
794 // (ashr X, C1) & C2 == 0 iff (-1 >> C1) & C2 == 0
795 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
796 // Compute the new bits that are at the top now.
797 uint64_t ShiftAmt = SA->getLimitedValue(BitWidth);
799 // Signed shift right.
800 APInt Mask2(Mask.shl(ShiftAmt));
801 ComputeMaskedBits(I->getOperand(0), Mask2, KnownZero,KnownOne,Depth+1);
802 assert((KnownZero & KnownOne) == 0&&"Bits known to be one AND zero?");
803 KnownZero = APIntOps::lshr(KnownZero, ShiftAmt);
804 KnownOne = APIntOps::lshr(KnownOne, ShiftAmt);
806 APInt HighBits(APInt::getHighBitsSet(BitWidth, ShiftAmt));
807 if (KnownZero[BitWidth-ShiftAmt-1]) // New bits are known zero.
808 KnownZero |= HighBits;
809 else if (KnownOne[BitWidth-ShiftAmt-1]) // New bits are known one.
810 KnownOne |= HighBits;
817 /// MaskedValueIsZero - Return true if 'V & Mask' is known to be zero. We use
818 /// this predicate to simplify operations downstream. Mask is known to be zero
819 /// for bits that V cannot have.
820 static bool MaskedValueIsZero(Value *V, const APInt& Mask, unsigned Depth = 0) {
821 APInt KnownZero(Mask.getBitWidth(), 0), KnownOne(Mask.getBitWidth(), 0);
822 ComputeMaskedBits(V, Mask, KnownZero, KnownOne, Depth);
823 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
824 return (KnownZero & Mask) == Mask;
827 /// ShrinkDemandedConstant - Check to see if the specified operand of the
828 /// specified instruction is a constant integer. If so, check to see if there
829 /// are any bits set in the constant that are not demanded. If so, shrink the
830 /// constant and return true.
831 static bool ShrinkDemandedConstant(Instruction *I, unsigned OpNo,
833 assert(I && "No instruction?");
834 assert(OpNo < I->getNumOperands() && "Operand index too large");
836 // If the operand is not a constant integer, nothing to do.
837 ConstantInt *OpC = dyn_cast<ConstantInt>(I->getOperand(OpNo));
838 if (!OpC) return false;
840 // If there are no bits set that aren't demanded, nothing to do.
841 Demanded.zextOrTrunc(OpC->getValue().getBitWidth());
842 if ((~Demanded & OpC->getValue()) == 0)
845 // This instruction is producing bits that are not demanded. Shrink the RHS.
846 Demanded &= OpC->getValue();
847 I->setOperand(OpNo, ConstantInt::get(Demanded));
851 // ComputeSignedMinMaxValuesFromKnownBits - Given a signed integer type and a
852 // set of known zero and one bits, compute the maximum and minimum values that
853 // could have the specified known zero and known one bits, returning them in
855 static void ComputeSignedMinMaxValuesFromKnownBits(const Type *Ty,
856 const APInt& KnownZero,
857 const APInt& KnownOne,
858 APInt& Min, APInt& Max) {
859 uint32_t BitWidth = cast<IntegerType>(Ty)->getBitWidth();
860 assert(KnownZero.getBitWidth() == BitWidth &&
861 KnownOne.getBitWidth() == BitWidth &&
862 Min.getBitWidth() == BitWidth && Max.getBitWidth() == BitWidth &&
863 "Ty, KnownZero, KnownOne and Min, Max must have equal bitwidth.");
864 APInt UnknownBits = ~(KnownZero|KnownOne);
866 // The minimum value is when all unknown bits are zeros, EXCEPT for the sign
867 // bit if it is unknown.
869 Max = KnownOne|UnknownBits;
871 if (UnknownBits[BitWidth-1]) { // Sign bit is unknown
873 Max.clear(BitWidth-1);
877 // ComputeUnsignedMinMaxValuesFromKnownBits - Given an unsigned integer type and
878 // a set of known zero and one bits, compute the maximum and minimum values that
879 // could have the specified known zero and known one bits, returning them in
881 static void ComputeUnsignedMinMaxValuesFromKnownBits(const Type *Ty,
882 const APInt &KnownZero,
883 const APInt &KnownOne,
884 APInt &Min, APInt &Max) {
885 uint32_t BitWidth = cast<IntegerType>(Ty)->getBitWidth(); BitWidth = BitWidth;
886 assert(KnownZero.getBitWidth() == BitWidth &&
887 KnownOne.getBitWidth() == BitWidth &&
888 Min.getBitWidth() == BitWidth && Max.getBitWidth() &&
889 "Ty, KnownZero, KnownOne and Min, Max must have equal bitwidth.");
890 APInt UnknownBits = ~(KnownZero|KnownOne);
892 // The minimum value is when the unknown bits are all zeros.
894 // The maximum value is when the unknown bits are all ones.
895 Max = KnownOne|UnknownBits;
898 /// SimplifyDemandedBits - This function attempts to replace V with a simpler
899 /// value based on the demanded bits. When this function is called, it is known
900 /// that only the bits set in DemandedMask of the result of V are ever used
901 /// downstream. Consequently, depending on the mask and V, it may be possible
902 /// to replace V with a constant or one of its operands. In such cases, this
903 /// function does the replacement and returns true. In all other cases, it
904 /// returns false after analyzing the expression and setting KnownOne and known
905 /// to be one in the expression. KnownZero contains all the bits that are known
906 /// to be zero in the expression. These are provided to potentially allow the
907 /// caller (which might recursively be SimplifyDemandedBits itself) to simplify
908 /// the expression. KnownOne and KnownZero always follow the invariant that
909 /// KnownOne & KnownZero == 0. That is, a bit can't be both 1 and 0. Note that
910 /// the bits in KnownOne and KnownZero may only be accurate for those bits set
911 /// in DemandedMask. Note also that the bitwidth of V, DemandedMask, KnownZero
912 /// and KnownOne must all be the same.
913 bool InstCombiner::SimplifyDemandedBits(Value *V, APInt DemandedMask,
914 APInt& KnownZero, APInt& KnownOne,
916 assert(V != 0 && "Null pointer of Value???");
917 assert(Depth <= 6 && "Limit Search Depth");
918 uint32_t BitWidth = DemandedMask.getBitWidth();
919 const IntegerType *VTy = cast<IntegerType>(V->getType());
920 assert(VTy->getBitWidth() == BitWidth &&
921 KnownZero.getBitWidth() == BitWidth &&
922 KnownOne.getBitWidth() == BitWidth &&
923 "Value *V, DemandedMask, KnownZero and KnownOne \
924 must have same BitWidth");
925 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
926 // We know all of the bits for a constant!
927 KnownOne = CI->getValue() & DemandedMask;
928 KnownZero = ~KnownOne & DemandedMask;
934 if (!V->hasOneUse()) { // Other users may use these bits.
935 if (Depth != 0) { // Not at the root.
936 // Just compute the KnownZero/KnownOne bits to simplify things downstream.
937 ComputeMaskedBits(V, DemandedMask, KnownZero, KnownOne, Depth);
940 // If this is the root being simplified, allow it to have multiple uses,
941 // just set the DemandedMask to all bits.
942 DemandedMask = APInt::getAllOnesValue(BitWidth);
943 } else if (DemandedMask == 0) { // Not demanding any bits from V.
944 if (V != UndefValue::get(VTy))
945 return UpdateValueUsesWith(V, UndefValue::get(VTy));
947 } else if (Depth == 6) { // Limit search depth.
951 Instruction *I = dyn_cast<Instruction>(V);
952 if (!I) return false; // Only analyze instructions.
954 APInt LHSKnownZero(BitWidth, 0), LHSKnownOne(BitWidth, 0);
955 APInt &RHSKnownZero = KnownZero, &RHSKnownOne = KnownOne;
956 switch (I->getOpcode()) {
958 case Instruction::And:
959 // If either the LHS or the RHS are Zero, the result is zero.
960 if (SimplifyDemandedBits(I->getOperand(1), DemandedMask,
961 RHSKnownZero, RHSKnownOne, Depth+1))
963 assert((RHSKnownZero & RHSKnownOne) == 0 &&
964 "Bits known to be one AND zero?");
966 // If something is known zero on the RHS, the bits aren't demanded on the
968 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask & ~RHSKnownZero,
969 LHSKnownZero, LHSKnownOne, Depth+1))
971 assert((LHSKnownZero & LHSKnownOne) == 0 &&
972 "Bits known to be one AND zero?");
974 // If all of the demanded bits are known 1 on one side, return the other.
975 // These bits cannot contribute to the result of the 'and'.
976 if ((DemandedMask & ~LHSKnownZero & RHSKnownOne) ==
977 (DemandedMask & ~LHSKnownZero))
978 return UpdateValueUsesWith(I, I->getOperand(0));
979 if ((DemandedMask & ~RHSKnownZero & LHSKnownOne) ==
980 (DemandedMask & ~RHSKnownZero))
981 return UpdateValueUsesWith(I, I->getOperand(1));
983 // If all of the demanded bits in the inputs are known zeros, return zero.
984 if ((DemandedMask & (RHSKnownZero|LHSKnownZero)) == DemandedMask)
985 return UpdateValueUsesWith(I, Constant::getNullValue(VTy));
987 // If the RHS is a constant, see if we can simplify it.
988 if (ShrinkDemandedConstant(I, 1, DemandedMask & ~LHSKnownZero))
989 return UpdateValueUsesWith(I, I);
991 // Output known-1 bits are only known if set in both the LHS & RHS.
992 RHSKnownOne &= LHSKnownOne;
993 // Output known-0 are known to be clear if zero in either the LHS | RHS.
994 RHSKnownZero |= LHSKnownZero;
996 case Instruction::Or:
997 // If either the LHS or the RHS are One, the result is One.
998 if (SimplifyDemandedBits(I->getOperand(1), DemandedMask,
999 RHSKnownZero, RHSKnownOne, Depth+1))
1001 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1002 "Bits known to be one AND zero?");
1003 // If something is known one on the RHS, the bits aren't demanded on the
1005 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask & ~RHSKnownOne,
1006 LHSKnownZero, LHSKnownOne, Depth+1))
1008 assert((LHSKnownZero & LHSKnownOne) == 0 &&
1009 "Bits known to be one AND zero?");
1011 // If all of the demanded bits are known zero on one side, return the other.
1012 // These bits cannot contribute to the result of the 'or'.
1013 if ((DemandedMask & ~LHSKnownOne & RHSKnownZero) ==
1014 (DemandedMask & ~LHSKnownOne))
1015 return UpdateValueUsesWith(I, I->getOperand(0));
1016 if ((DemandedMask & ~RHSKnownOne & LHSKnownZero) ==
1017 (DemandedMask & ~RHSKnownOne))
1018 return UpdateValueUsesWith(I, I->getOperand(1));
1020 // If all of the potentially set bits on one side are known to be set on
1021 // the other side, just use the 'other' side.
1022 if ((DemandedMask & (~RHSKnownZero) & LHSKnownOne) ==
1023 (DemandedMask & (~RHSKnownZero)))
1024 return UpdateValueUsesWith(I, I->getOperand(0));
1025 if ((DemandedMask & (~LHSKnownZero) & RHSKnownOne) ==
1026 (DemandedMask & (~LHSKnownZero)))
1027 return UpdateValueUsesWith(I, I->getOperand(1));
1029 // If the RHS is a constant, see if we can simplify it.
1030 if (ShrinkDemandedConstant(I, 1, DemandedMask))
1031 return UpdateValueUsesWith(I, I);
1033 // Output known-0 bits are only known if clear in both the LHS & RHS.
1034 RHSKnownZero &= LHSKnownZero;
1035 // Output known-1 are known to be set if set in either the LHS | RHS.
1036 RHSKnownOne |= LHSKnownOne;
1038 case Instruction::Xor: {
1039 if (SimplifyDemandedBits(I->getOperand(1), DemandedMask,
1040 RHSKnownZero, RHSKnownOne, Depth+1))
1042 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1043 "Bits known to be one AND zero?");
1044 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask,
1045 LHSKnownZero, LHSKnownOne, Depth+1))
1047 assert((LHSKnownZero & LHSKnownOne) == 0 &&
1048 "Bits known to be one AND zero?");
1050 // If all of the demanded bits are known zero on one side, return the other.
1051 // These bits cannot contribute to the result of the 'xor'.
1052 if ((DemandedMask & RHSKnownZero) == DemandedMask)
1053 return UpdateValueUsesWith(I, I->getOperand(0));
1054 if ((DemandedMask & LHSKnownZero) == DemandedMask)
1055 return UpdateValueUsesWith(I, I->getOperand(1));
1057 // Output known-0 bits are known if clear or set in both the LHS & RHS.
1058 APInt KnownZeroOut = (RHSKnownZero & LHSKnownZero) |
1059 (RHSKnownOne & LHSKnownOne);
1060 // Output known-1 are known to be set if set in only one of the LHS, RHS.
1061 APInt KnownOneOut = (RHSKnownZero & LHSKnownOne) |
1062 (RHSKnownOne & LHSKnownZero);
1064 // If all of the demanded bits are known to be zero on one side or the
1065 // other, turn this into an *inclusive* or.
1066 // e.g. (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
1067 if ((DemandedMask & ~RHSKnownZero & ~LHSKnownZero) == 0) {
1069 BinaryOperator::createOr(I->getOperand(0), I->getOperand(1),
1071 InsertNewInstBefore(Or, *I);
1072 return UpdateValueUsesWith(I, Or);
1075 // If all of the demanded bits on one side are known, and all of the set
1076 // bits on that side are also known to be set on the other side, turn this
1077 // into an AND, as we know the bits will be cleared.
1078 // e.g. (X | C1) ^ C2 --> (X | C1) & ~C2 iff (C1&C2) == C2
1079 if ((DemandedMask & (RHSKnownZero|RHSKnownOne)) == DemandedMask) {
1081 if ((RHSKnownOne & LHSKnownOne) == RHSKnownOne) {
1082 Constant *AndC = ConstantInt::get(~RHSKnownOne & DemandedMask);
1084 BinaryOperator::createAnd(I->getOperand(0), AndC, "tmp");
1085 InsertNewInstBefore(And, *I);
1086 return UpdateValueUsesWith(I, And);
1090 // If the RHS is a constant, see if we can simplify it.
1091 // FIXME: for XOR, we prefer to force bits to 1 if they will make a -1.
1092 if (ShrinkDemandedConstant(I, 1, DemandedMask))
1093 return UpdateValueUsesWith(I, I);
1095 RHSKnownZero = KnownZeroOut;
1096 RHSKnownOne = KnownOneOut;
1099 case Instruction::Select:
1100 if (SimplifyDemandedBits(I->getOperand(2), DemandedMask,
1101 RHSKnownZero, RHSKnownOne, Depth+1))
1103 if (SimplifyDemandedBits(I->getOperand(1), DemandedMask,
1104 LHSKnownZero, LHSKnownOne, Depth+1))
1106 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1107 "Bits known to be one AND zero?");
1108 assert((LHSKnownZero & LHSKnownOne) == 0 &&
1109 "Bits known to be one AND zero?");
1111 // If the operands are constants, see if we can simplify them.
1112 if (ShrinkDemandedConstant(I, 1, DemandedMask))
1113 return UpdateValueUsesWith(I, I);
1114 if (ShrinkDemandedConstant(I, 2, DemandedMask))
1115 return UpdateValueUsesWith(I, I);
1117 // Only known if known in both the LHS and RHS.
1118 RHSKnownOne &= LHSKnownOne;
1119 RHSKnownZero &= LHSKnownZero;
1121 case Instruction::Trunc: {
1123 cast<IntegerType>(I->getOperand(0)->getType())->getBitWidth();
1124 DemandedMask.zext(truncBf);
1125 RHSKnownZero.zext(truncBf);
1126 RHSKnownOne.zext(truncBf);
1127 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask,
1128 RHSKnownZero, RHSKnownOne, Depth+1))
1130 DemandedMask.trunc(BitWidth);
1131 RHSKnownZero.trunc(BitWidth);
1132 RHSKnownOne.trunc(BitWidth);
1133 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1134 "Bits known to be one AND zero?");
1137 case Instruction::BitCast:
1138 if (!I->getOperand(0)->getType()->isInteger())
1141 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask,
1142 RHSKnownZero, RHSKnownOne, Depth+1))
1144 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1145 "Bits known to be one AND zero?");
1147 case Instruction::ZExt: {
1148 // Compute the bits in the result that are not present in the input.
1149 const IntegerType *SrcTy = cast<IntegerType>(I->getOperand(0)->getType());
1150 uint32_t SrcBitWidth = SrcTy->getBitWidth();
1152 DemandedMask.trunc(SrcBitWidth);
1153 RHSKnownZero.trunc(SrcBitWidth);
1154 RHSKnownOne.trunc(SrcBitWidth);
1155 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask,
1156 RHSKnownZero, RHSKnownOne, Depth+1))
1158 DemandedMask.zext(BitWidth);
1159 RHSKnownZero.zext(BitWidth);
1160 RHSKnownOne.zext(BitWidth);
1161 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1162 "Bits known to be one AND zero?");
1163 // The top bits are known to be zero.
1164 RHSKnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth);
1167 case Instruction::SExt: {
1168 // Compute the bits in the result that are not present in the input.
1169 const IntegerType *SrcTy = cast<IntegerType>(I->getOperand(0)->getType());
1170 uint32_t SrcBitWidth = SrcTy->getBitWidth();
1172 APInt InputDemandedBits = DemandedMask &
1173 APInt::getLowBitsSet(BitWidth, SrcBitWidth);
1175 APInt NewBits(APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth));
1176 // If any of the sign extended bits are demanded, we know that the sign
1178 if ((NewBits & DemandedMask) != 0)
1179 InputDemandedBits.set(SrcBitWidth-1);
1181 InputDemandedBits.trunc(SrcBitWidth);
1182 RHSKnownZero.trunc(SrcBitWidth);
1183 RHSKnownOne.trunc(SrcBitWidth);
1184 if (SimplifyDemandedBits(I->getOperand(0), InputDemandedBits,
1185 RHSKnownZero, RHSKnownOne, Depth+1))
1187 InputDemandedBits.zext(BitWidth);
1188 RHSKnownZero.zext(BitWidth);
1189 RHSKnownOne.zext(BitWidth);
1190 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1191 "Bits known to be one AND zero?");
1193 // If the sign bit of the input is known set or clear, then we know the
1194 // top bits of the result.
1196 // If the input sign bit is known zero, or if the NewBits are not demanded
1197 // convert this into a zero extension.
1198 if (RHSKnownZero[SrcBitWidth-1] || (NewBits & ~DemandedMask) == NewBits)
1200 // Convert to ZExt cast
1201 CastInst *NewCast = new ZExtInst(I->getOperand(0), VTy, I->getName(), I);
1202 return UpdateValueUsesWith(I, NewCast);
1203 } else if (RHSKnownOne[SrcBitWidth-1]) { // Input sign bit known set
1204 RHSKnownOne |= NewBits;
1208 case Instruction::Add: {
1209 // Figure out what the input bits are. If the top bits of the and result
1210 // are not demanded, then the add doesn't demand them from its input
1212 uint32_t NLZ = DemandedMask.countLeadingZeros();
1214 // If there is a constant on the RHS, there are a variety of xformations
1216 if (ConstantInt *RHS = dyn_cast<ConstantInt>(I->getOperand(1))) {
1217 // If null, this should be simplified elsewhere. Some of the xforms here
1218 // won't work if the RHS is zero.
1222 // If the top bit of the output is demanded, demand everything from the
1223 // input. Otherwise, we demand all the input bits except NLZ top bits.
1224 APInt InDemandedBits(APInt::getLowBitsSet(BitWidth, BitWidth - NLZ));
1226 // Find information about known zero/one bits in the input.
1227 if (SimplifyDemandedBits(I->getOperand(0), InDemandedBits,
1228 LHSKnownZero, LHSKnownOne, Depth+1))
1231 // If the RHS of the add has bits set that can't affect the input, reduce
1233 if (ShrinkDemandedConstant(I, 1, InDemandedBits))
1234 return UpdateValueUsesWith(I, I);
1236 // Avoid excess work.
1237 if (LHSKnownZero == 0 && LHSKnownOne == 0)
1240 // Turn it into OR if input bits are zero.
1241 if ((LHSKnownZero & RHS->getValue()) == RHS->getValue()) {
1243 BinaryOperator::createOr(I->getOperand(0), I->getOperand(1),
1245 InsertNewInstBefore(Or, *I);
1246 return UpdateValueUsesWith(I, Or);
1249 // We can say something about the output known-zero and known-one bits,
1250 // depending on potential carries from the input constant and the
1251 // unknowns. For example if the LHS is known to have at most the 0x0F0F0
1252 // bits set and the RHS constant is 0x01001, then we know we have a known
1253 // one mask of 0x00001 and a known zero mask of 0xE0F0E.
1255 // To compute this, we first compute the potential carry bits. These are
1256 // the bits which may be modified. I'm not aware of a better way to do
1258 const APInt& RHSVal = RHS->getValue();
1259 APInt CarryBits((~LHSKnownZero + RHSVal) ^ (~LHSKnownZero ^ RHSVal));
1261 // Now that we know which bits have carries, compute the known-1/0 sets.
1263 // Bits are known one if they are known zero in one operand and one in the
1264 // other, and there is no input carry.
1265 RHSKnownOne = ((LHSKnownZero & RHSVal) |
1266 (LHSKnownOne & ~RHSVal)) & ~CarryBits;
1268 // Bits are known zero if they are known zero in both operands and there
1269 // is no input carry.
1270 RHSKnownZero = LHSKnownZero & ~RHSVal & ~CarryBits;
1272 // If the high-bits of this ADD are not demanded, then it does not demand
1273 // the high bits of its LHS or RHS.
1274 if (DemandedMask[BitWidth-1] == 0) {
1275 // Right fill the mask of bits for this ADD to demand the most
1276 // significant bit and all those below it.
1277 APInt DemandedFromOps(APInt::getLowBitsSet(BitWidth, BitWidth-NLZ));
1278 if (SimplifyDemandedBits(I->getOperand(0), DemandedFromOps,
1279 LHSKnownZero, LHSKnownOne, Depth+1))
1281 if (SimplifyDemandedBits(I->getOperand(1), DemandedFromOps,
1282 LHSKnownZero, LHSKnownOne, Depth+1))
1288 case Instruction::Sub:
1289 // If the high-bits of this SUB are not demanded, then it does not demand
1290 // the high bits of its LHS or RHS.
1291 if (DemandedMask[BitWidth-1] == 0) {
1292 // Right fill the mask of bits for this SUB to demand the most
1293 // significant bit and all those below it.
1294 uint32_t NLZ = DemandedMask.countLeadingZeros();
1295 APInt DemandedFromOps(APInt::getLowBitsSet(BitWidth, BitWidth-NLZ));
1296 if (SimplifyDemandedBits(I->getOperand(0), DemandedFromOps,
1297 LHSKnownZero, LHSKnownOne, Depth+1))
1299 if (SimplifyDemandedBits(I->getOperand(1), DemandedFromOps,
1300 LHSKnownZero, LHSKnownOne, Depth+1))
1304 case Instruction::Shl:
1305 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
1306 uint64_t ShiftAmt = SA->getLimitedValue(BitWidth);
1307 APInt DemandedMaskIn(DemandedMask.lshr(ShiftAmt));
1308 if (SimplifyDemandedBits(I->getOperand(0), DemandedMaskIn,
1309 RHSKnownZero, RHSKnownOne, Depth+1))
1311 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1312 "Bits known to be one AND zero?");
1313 RHSKnownZero <<= ShiftAmt;
1314 RHSKnownOne <<= ShiftAmt;
1315 // low bits known zero.
1317 RHSKnownZero |= APInt::getLowBitsSet(BitWidth, ShiftAmt);
1320 case Instruction::LShr:
1321 // For a logical shift right
1322 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
1323 uint64_t ShiftAmt = SA->getLimitedValue(BitWidth);
1325 // Unsigned shift right.
1326 APInt DemandedMaskIn(DemandedMask.shl(ShiftAmt));
1327 if (SimplifyDemandedBits(I->getOperand(0), DemandedMaskIn,
1328 RHSKnownZero, RHSKnownOne, Depth+1))
1330 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1331 "Bits known to be one AND zero?");
1332 RHSKnownZero = APIntOps::lshr(RHSKnownZero, ShiftAmt);
1333 RHSKnownOne = APIntOps::lshr(RHSKnownOne, ShiftAmt);
1335 // Compute the new bits that are at the top now.
1336 APInt HighBits(APInt::getHighBitsSet(BitWidth, ShiftAmt));
1337 RHSKnownZero |= HighBits; // high bits known zero.
1341 case Instruction::AShr:
1342 // If this is an arithmetic shift right and only the low-bit is set, we can
1343 // always convert this into a logical shr, even if the shift amount is
1344 // variable. The low bit of the shift cannot be an input sign bit unless
1345 // the shift amount is >= the size of the datatype, which is undefined.
1346 if (DemandedMask == 1) {
1347 // Perform the logical shift right.
1348 Value *NewVal = BinaryOperator::createLShr(
1349 I->getOperand(0), I->getOperand(1), I->getName());
1350 InsertNewInstBefore(cast<Instruction>(NewVal), *I);
1351 return UpdateValueUsesWith(I, NewVal);
1354 // If the sign bit is the only bit demanded by this ashr, then there is no
1355 // need to do it, the shift doesn't change the high bit.
1356 if (DemandedMask.isSignBit())
1357 return UpdateValueUsesWith(I, I->getOperand(0));
1359 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
1360 uint32_t ShiftAmt = SA->getLimitedValue(BitWidth);
1362 // Signed shift right.
1363 APInt DemandedMaskIn(DemandedMask.shl(ShiftAmt));
1364 // If any of the "high bits" are demanded, we should set the sign bit as
1366 if (DemandedMask.countLeadingZeros() <= ShiftAmt)
1367 DemandedMaskIn.set(BitWidth-1);
1368 if (SimplifyDemandedBits(I->getOperand(0),
1370 RHSKnownZero, RHSKnownOne, Depth+1))
1372 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1373 "Bits known to be one AND zero?");
1374 // Compute the new bits that are at the top now.
1375 APInt HighBits(APInt::getHighBitsSet(BitWidth, ShiftAmt));
1376 RHSKnownZero = APIntOps::lshr(RHSKnownZero, ShiftAmt);
1377 RHSKnownOne = APIntOps::lshr(RHSKnownOne, ShiftAmt);
1379 // Handle the sign bits.
1380 APInt SignBit(APInt::getSignBit(BitWidth));
1381 // Adjust to where it is now in the mask.
1382 SignBit = APIntOps::lshr(SignBit, ShiftAmt);
1384 // If the input sign bit is known to be zero, or if none of the top bits
1385 // are demanded, turn this into an unsigned shift right.
1386 if (RHSKnownZero[BitWidth-ShiftAmt-1] ||
1387 (HighBits & ~DemandedMask) == HighBits) {
1388 // Perform the logical shift right.
1389 Value *NewVal = BinaryOperator::createLShr(
1390 I->getOperand(0), SA, I->getName());
1391 InsertNewInstBefore(cast<Instruction>(NewVal), *I);
1392 return UpdateValueUsesWith(I, NewVal);
1393 } else if ((RHSKnownOne & SignBit) != 0) { // New bits are known one.
1394 RHSKnownOne |= HighBits;
1400 // If the client is only demanding bits that we know, return the known
1402 if ((DemandedMask & (RHSKnownZero|RHSKnownOne)) == DemandedMask)
1403 return UpdateValueUsesWith(I, ConstantInt::get(RHSKnownOne));
1408 /// SimplifyDemandedVectorElts - The specified value producecs a vector with
1409 /// 64 or fewer elements. DemandedElts contains the set of elements that are
1410 /// actually used by the caller. This method analyzes which elements of the
1411 /// operand are undef and returns that information in UndefElts.
1413 /// If the information about demanded elements can be used to simplify the
1414 /// operation, the operation is simplified, then the resultant value is
1415 /// returned. This returns null if no change was made.
1416 Value *InstCombiner::SimplifyDemandedVectorElts(Value *V, uint64_t DemandedElts,
1417 uint64_t &UndefElts,
1419 unsigned VWidth = cast<VectorType>(V->getType())->getNumElements();
1420 assert(VWidth <= 64 && "Vector too wide to analyze!");
1421 uint64_t EltMask = ~0ULL >> (64-VWidth);
1422 assert(DemandedElts != EltMask && (DemandedElts & ~EltMask) == 0 &&
1423 "Invalid DemandedElts!");
1425 if (isa<UndefValue>(V)) {
1426 // If the entire vector is undefined, just return this info.
1427 UndefElts = EltMask;
1429 } else if (DemandedElts == 0) { // If nothing is demanded, provide undef.
1430 UndefElts = EltMask;
1431 return UndefValue::get(V->getType());
1435 if (ConstantVector *CP = dyn_cast<ConstantVector>(V)) {
1436 const Type *EltTy = cast<VectorType>(V->getType())->getElementType();
1437 Constant *Undef = UndefValue::get(EltTy);
1439 std::vector<Constant*> Elts;
1440 for (unsigned i = 0; i != VWidth; ++i)
1441 if (!(DemandedElts & (1ULL << i))) { // If not demanded, set to undef.
1442 Elts.push_back(Undef);
1443 UndefElts |= (1ULL << i);
1444 } else if (isa<UndefValue>(CP->getOperand(i))) { // Already undef.
1445 Elts.push_back(Undef);
1446 UndefElts |= (1ULL << i);
1447 } else { // Otherwise, defined.
1448 Elts.push_back(CP->getOperand(i));
1451 // If we changed the constant, return it.
1452 Constant *NewCP = ConstantVector::get(Elts);
1453 return NewCP != CP ? NewCP : 0;
1454 } else if (isa<ConstantAggregateZero>(V)) {
1455 // Simplify the CAZ to a ConstantVector where the non-demanded elements are
1457 const Type *EltTy = cast<VectorType>(V->getType())->getElementType();
1458 Constant *Zero = Constant::getNullValue(EltTy);
1459 Constant *Undef = UndefValue::get(EltTy);
1460 std::vector<Constant*> Elts;
1461 for (unsigned i = 0; i != VWidth; ++i)
1462 Elts.push_back((DemandedElts & (1ULL << i)) ? Zero : Undef);
1463 UndefElts = DemandedElts ^ EltMask;
1464 return ConstantVector::get(Elts);
1467 if (!V->hasOneUse()) { // Other users may use these bits.
1468 if (Depth != 0) { // Not at the root.
1469 // TODO: Just compute the UndefElts information recursively.
1473 } else if (Depth == 10) { // Limit search depth.
1477 Instruction *I = dyn_cast<Instruction>(V);
1478 if (!I) return false; // Only analyze instructions.
1480 bool MadeChange = false;
1481 uint64_t UndefElts2;
1483 switch (I->getOpcode()) {
1486 case Instruction::InsertElement: {
1487 // If this is a variable index, we don't know which element it overwrites.
1488 // demand exactly the same input as we produce.
1489 ConstantInt *Idx = dyn_cast<ConstantInt>(I->getOperand(2));
1491 // Note that we can't propagate undef elt info, because we don't know
1492 // which elt is getting updated.
1493 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), DemandedElts,
1494 UndefElts2, Depth+1);
1495 if (TmpV) { I->setOperand(0, TmpV); MadeChange = true; }
1499 // If this is inserting an element that isn't demanded, remove this
1501 unsigned IdxNo = Idx->getZExtValue();
1502 if (IdxNo >= VWidth || (DemandedElts & (1ULL << IdxNo)) == 0)
1503 return AddSoonDeadInstToWorklist(*I, 0);
1505 // Otherwise, the element inserted overwrites whatever was there, so the
1506 // input demanded set is simpler than the output set.
1507 TmpV = SimplifyDemandedVectorElts(I->getOperand(0),
1508 DemandedElts & ~(1ULL << IdxNo),
1509 UndefElts, Depth+1);
1510 if (TmpV) { I->setOperand(0, TmpV); MadeChange = true; }
1512 // The inserted element is defined.
1513 UndefElts |= 1ULL << IdxNo;
1516 case Instruction::BitCast: {
1517 // Vector->vector casts only.
1518 const VectorType *VTy = dyn_cast<VectorType>(I->getOperand(0)->getType());
1520 unsigned InVWidth = VTy->getNumElements();
1521 uint64_t InputDemandedElts = 0;
1524 if (VWidth == InVWidth) {
1525 // If we are converting from <4 x i32> -> <4 x f32>, we demand the same
1526 // elements as are demanded of us.
1528 InputDemandedElts = DemandedElts;
1529 } else if (VWidth > InVWidth) {
1533 // If there are more elements in the result than there are in the source,
1534 // then an input element is live if any of the corresponding output
1535 // elements are live.
1536 Ratio = VWidth/InVWidth;
1537 for (unsigned OutIdx = 0; OutIdx != VWidth; ++OutIdx) {
1538 if (DemandedElts & (1ULL << OutIdx))
1539 InputDemandedElts |= 1ULL << (OutIdx/Ratio);
1545 // If there are more elements in the source than there are in the result,
1546 // then an input element is live if the corresponding output element is
1548 Ratio = InVWidth/VWidth;
1549 for (unsigned InIdx = 0; InIdx != InVWidth; ++InIdx)
1550 if (DemandedElts & (1ULL << InIdx/Ratio))
1551 InputDemandedElts |= 1ULL << InIdx;
1554 // div/rem demand all inputs, because they don't want divide by zero.
1555 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), InputDemandedElts,
1556 UndefElts2, Depth+1);
1558 I->setOperand(0, TmpV);
1562 UndefElts = UndefElts2;
1563 if (VWidth > InVWidth) {
1564 assert(0 && "Unimp");
1565 // If there are more elements in the result than there are in the source,
1566 // then an output element is undef if the corresponding input element is
1568 for (unsigned OutIdx = 0; OutIdx != VWidth; ++OutIdx)
1569 if (UndefElts2 & (1ULL << (OutIdx/Ratio)))
1570 UndefElts |= 1ULL << OutIdx;
1571 } else if (VWidth < InVWidth) {
1572 assert(0 && "Unimp");
1573 // If there are more elements in the source than there are in the result,
1574 // then a result element is undef if all of the corresponding input
1575 // elements are undef.
1576 UndefElts = ~0ULL >> (64-VWidth); // Start out all undef.
1577 for (unsigned InIdx = 0; InIdx != InVWidth; ++InIdx)
1578 if ((UndefElts2 & (1ULL << InIdx)) == 0) // Not undef?
1579 UndefElts &= ~(1ULL << (InIdx/Ratio)); // Clear undef bit.
1583 case Instruction::And:
1584 case Instruction::Or:
1585 case Instruction::Xor:
1586 case Instruction::Add:
1587 case Instruction::Sub:
1588 case Instruction::Mul:
1589 // div/rem demand all inputs, because they don't want divide by zero.
1590 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), DemandedElts,
1591 UndefElts, Depth+1);
1592 if (TmpV) { I->setOperand(0, TmpV); MadeChange = true; }
1593 TmpV = SimplifyDemandedVectorElts(I->getOperand(1), DemandedElts,
1594 UndefElts2, Depth+1);
1595 if (TmpV) { I->setOperand(1, TmpV); MadeChange = true; }
1597 // Output elements are undefined if both are undefined. Consider things
1598 // like undef&0. The result is known zero, not undef.
1599 UndefElts &= UndefElts2;
1602 case Instruction::Call: {
1603 IntrinsicInst *II = dyn_cast<IntrinsicInst>(I);
1605 switch (II->getIntrinsicID()) {
1608 // Binary vector operations that work column-wise. A dest element is a
1609 // function of the corresponding input elements from the two inputs.
1610 case Intrinsic::x86_sse_sub_ss:
1611 case Intrinsic::x86_sse_mul_ss:
1612 case Intrinsic::x86_sse_min_ss:
1613 case Intrinsic::x86_sse_max_ss:
1614 case Intrinsic::x86_sse2_sub_sd:
1615 case Intrinsic::x86_sse2_mul_sd:
1616 case Intrinsic::x86_sse2_min_sd:
1617 case Intrinsic::x86_sse2_max_sd:
1618 TmpV = SimplifyDemandedVectorElts(II->getOperand(1), DemandedElts,
1619 UndefElts, Depth+1);
1620 if (TmpV) { II->setOperand(1, TmpV); MadeChange = true; }
1621 TmpV = SimplifyDemandedVectorElts(II->getOperand(2), DemandedElts,
1622 UndefElts2, Depth+1);
1623 if (TmpV) { II->setOperand(2, TmpV); MadeChange = true; }
1625 // If only the low elt is demanded and this is a scalarizable intrinsic,
1626 // scalarize it now.
1627 if (DemandedElts == 1) {
1628 switch (II->getIntrinsicID()) {
1630 case Intrinsic::x86_sse_sub_ss:
1631 case Intrinsic::x86_sse_mul_ss:
1632 case Intrinsic::x86_sse2_sub_sd:
1633 case Intrinsic::x86_sse2_mul_sd:
1634 // TODO: Lower MIN/MAX/ABS/etc
1635 Value *LHS = II->getOperand(1);
1636 Value *RHS = II->getOperand(2);
1637 // Extract the element as scalars.
1638 LHS = InsertNewInstBefore(new ExtractElementInst(LHS, 0U,"tmp"), *II);
1639 RHS = InsertNewInstBefore(new ExtractElementInst(RHS, 0U,"tmp"), *II);
1641 switch (II->getIntrinsicID()) {
1642 default: assert(0 && "Case stmts out of sync!");
1643 case Intrinsic::x86_sse_sub_ss:
1644 case Intrinsic::x86_sse2_sub_sd:
1645 TmpV = InsertNewInstBefore(BinaryOperator::createSub(LHS, RHS,
1646 II->getName()), *II);
1648 case Intrinsic::x86_sse_mul_ss:
1649 case Intrinsic::x86_sse2_mul_sd:
1650 TmpV = InsertNewInstBefore(BinaryOperator::createMul(LHS, RHS,
1651 II->getName()), *II);
1656 new InsertElementInst(UndefValue::get(II->getType()), TmpV, 0U,
1658 InsertNewInstBefore(New, *II);
1659 AddSoonDeadInstToWorklist(*II, 0);
1664 // Output elements are undefined if both are undefined. Consider things
1665 // like undef&0. The result is known zero, not undef.
1666 UndefElts &= UndefElts2;
1672 return MadeChange ? I : 0;
1675 /// @returns true if the specified compare predicate is
1676 /// true when both operands are equal...
1677 /// @brief Determine if the icmp Predicate is true when both operands are equal
1678 static bool isTrueWhenEqual(ICmpInst::Predicate pred) {
1679 return pred == ICmpInst::ICMP_EQ || pred == ICmpInst::ICMP_UGE ||
1680 pred == ICmpInst::ICMP_SGE || pred == ICmpInst::ICMP_ULE ||
1681 pred == ICmpInst::ICMP_SLE;
1684 /// @returns true if the specified compare instruction is
1685 /// true when both operands are equal...
1686 /// @brief Determine if the ICmpInst returns true when both operands are equal
1687 static bool isTrueWhenEqual(ICmpInst &ICI) {
1688 return isTrueWhenEqual(ICI.getPredicate());
1691 /// AssociativeOpt - Perform an optimization on an associative operator. This
1692 /// function is designed to check a chain of associative operators for a
1693 /// potential to apply a certain optimization. Since the optimization may be
1694 /// applicable if the expression was reassociated, this checks the chain, then
1695 /// reassociates the expression as necessary to expose the optimization
1696 /// opportunity. This makes use of a special Functor, which must define
1697 /// 'shouldApply' and 'apply' methods.
1699 template<typename Functor>
1700 Instruction *AssociativeOpt(BinaryOperator &Root, const Functor &F) {
1701 unsigned Opcode = Root.getOpcode();
1702 Value *LHS = Root.getOperand(0);
1704 // Quick check, see if the immediate LHS matches...
1705 if (F.shouldApply(LHS))
1706 return F.apply(Root);
1708 // Otherwise, if the LHS is not of the same opcode as the root, return.
1709 Instruction *LHSI = dyn_cast<Instruction>(LHS);
1710 while (LHSI && LHSI->getOpcode() == Opcode && LHSI->hasOneUse()) {
1711 // Should we apply this transform to the RHS?
1712 bool ShouldApply = F.shouldApply(LHSI->getOperand(1));
1714 // If not to the RHS, check to see if we should apply to the LHS...
1715 if (!ShouldApply && F.shouldApply(LHSI->getOperand(0))) {
1716 cast<BinaryOperator>(LHSI)->swapOperands(); // Make the LHS the RHS
1720 // If the functor wants to apply the optimization to the RHS of LHSI,
1721 // reassociate the expression from ((? op A) op B) to (? op (A op B))
1723 BasicBlock *BB = Root.getParent();
1725 // Now all of the instructions are in the current basic block, go ahead
1726 // and perform the reassociation.
1727 Instruction *TmpLHSI = cast<Instruction>(Root.getOperand(0));
1729 // First move the selected RHS to the LHS of the root...
1730 Root.setOperand(0, LHSI->getOperand(1));
1732 // Make what used to be the LHS of the root be the user of the root...
1733 Value *ExtraOperand = TmpLHSI->getOperand(1);
1734 if (&Root == TmpLHSI) {
1735 Root.replaceAllUsesWith(Constant::getNullValue(TmpLHSI->getType()));
1738 Root.replaceAllUsesWith(TmpLHSI); // Users now use TmpLHSI
1739 TmpLHSI->setOperand(1, &Root); // TmpLHSI now uses the root
1740 TmpLHSI->getParent()->getInstList().remove(TmpLHSI);
1741 BasicBlock::iterator ARI = &Root; ++ARI;
1742 BB->getInstList().insert(ARI, TmpLHSI); // Move TmpLHSI to after Root
1745 // Now propagate the ExtraOperand down the chain of instructions until we
1747 while (TmpLHSI != LHSI) {
1748 Instruction *NextLHSI = cast<Instruction>(TmpLHSI->getOperand(0));
1749 // Move the instruction to immediately before the chain we are
1750 // constructing to avoid breaking dominance properties.
1751 NextLHSI->getParent()->getInstList().remove(NextLHSI);
1752 BB->getInstList().insert(ARI, NextLHSI);
1755 Value *NextOp = NextLHSI->getOperand(1);
1756 NextLHSI->setOperand(1, ExtraOperand);
1758 ExtraOperand = NextOp;
1761 // Now that the instructions are reassociated, have the functor perform
1762 // the transformation...
1763 return F.apply(Root);
1766 LHSI = dyn_cast<Instruction>(LHSI->getOperand(0));
1772 // AddRHS - Implements: X + X --> X << 1
1775 AddRHS(Value *rhs) : RHS(rhs) {}
1776 bool shouldApply(Value *LHS) const { return LHS == RHS; }
1777 Instruction *apply(BinaryOperator &Add) const {
1778 return BinaryOperator::createShl(Add.getOperand(0),
1779 ConstantInt::get(Add.getType(), 1));
1783 // AddMaskingAnd - Implements (A & C1)+(B & C2) --> (A & C1)|(B & C2)
1785 struct AddMaskingAnd {
1787 AddMaskingAnd(Constant *c) : C2(c) {}
1788 bool shouldApply(Value *LHS) const {
1790 return match(LHS, m_And(m_Value(), m_ConstantInt(C1))) &&
1791 ConstantExpr::getAnd(C1, C2)->isNullValue();
1793 Instruction *apply(BinaryOperator &Add) const {
1794 return BinaryOperator::createOr(Add.getOperand(0), Add.getOperand(1));
1798 static Value *FoldOperationIntoSelectOperand(Instruction &I, Value *SO,
1800 if (CastInst *CI = dyn_cast<CastInst>(&I)) {
1801 if (Constant *SOC = dyn_cast<Constant>(SO))
1802 return ConstantExpr::getCast(CI->getOpcode(), SOC, I.getType());
1804 return IC->InsertNewInstBefore(CastInst::create(
1805 CI->getOpcode(), SO, I.getType(), SO->getName() + ".cast"), I);
1808 // Figure out if the constant is the left or the right argument.
1809 bool ConstIsRHS = isa<Constant>(I.getOperand(1));
1810 Constant *ConstOperand = cast<Constant>(I.getOperand(ConstIsRHS));
1812 if (Constant *SOC = dyn_cast<Constant>(SO)) {
1814 return ConstantExpr::get(I.getOpcode(), SOC, ConstOperand);
1815 return ConstantExpr::get(I.getOpcode(), ConstOperand, SOC);
1818 Value *Op0 = SO, *Op1 = ConstOperand;
1820 std::swap(Op0, Op1);
1822 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(&I))
1823 New = BinaryOperator::create(BO->getOpcode(), Op0, Op1,SO->getName()+".op");
1824 else if (CmpInst *CI = dyn_cast<CmpInst>(&I))
1825 New = CmpInst::create(CI->getOpcode(), CI->getPredicate(), Op0, Op1,
1826 SO->getName()+".cmp");
1828 assert(0 && "Unknown binary instruction type!");
1831 return IC->InsertNewInstBefore(New, I);
1834 // FoldOpIntoSelect - Given an instruction with a select as one operand and a
1835 // constant as the other operand, try to fold the binary operator into the
1836 // select arguments. This also works for Cast instructions, which obviously do
1837 // not have a second operand.
1838 static Instruction *FoldOpIntoSelect(Instruction &Op, SelectInst *SI,
1840 // Don't modify shared select instructions
1841 if (!SI->hasOneUse()) return 0;
1842 Value *TV = SI->getOperand(1);
1843 Value *FV = SI->getOperand(2);
1845 if (isa<Constant>(TV) || isa<Constant>(FV)) {
1846 // Bool selects with constant operands can be folded to logical ops.
1847 if (SI->getType() == Type::Int1Ty) return 0;
1849 Value *SelectTrueVal = FoldOperationIntoSelectOperand(Op, TV, IC);
1850 Value *SelectFalseVal = FoldOperationIntoSelectOperand(Op, FV, IC);
1852 return new SelectInst(SI->getCondition(), SelectTrueVal,
1859 /// FoldOpIntoPhi - Given a binary operator or cast instruction which has a PHI
1860 /// node as operand #0, see if we can fold the instruction into the PHI (which
1861 /// is only possible if all operands to the PHI are constants).
1862 Instruction *InstCombiner::FoldOpIntoPhi(Instruction &I) {
1863 PHINode *PN = cast<PHINode>(I.getOperand(0));
1864 unsigned NumPHIValues = PN->getNumIncomingValues();
1865 if (!PN->hasOneUse() || NumPHIValues == 0) return 0;
1867 // Check to see if all of the operands of the PHI are constants. If there is
1868 // one non-constant value, remember the BB it is. If there is more than one
1869 // or if *it* is a PHI, bail out.
1870 BasicBlock *NonConstBB = 0;
1871 for (unsigned i = 0; i != NumPHIValues; ++i)
1872 if (!isa<Constant>(PN->getIncomingValue(i))) {
1873 if (NonConstBB) return 0; // More than one non-const value.
1874 if (isa<PHINode>(PN->getIncomingValue(i))) return 0; // Itself a phi.
1875 NonConstBB = PN->getIncomingBlock(i);
1877 // If the incoming non-constant value is in I's block, we have an infinite
1879 if (NonConstBB == I.getParent())
1883 // If there is exactly one non-constant value, we can insert a copy of the
1884 // operation in that block. However, if this is a critical edge, we would be
1885 // inserting the computation one some other paths (e.g. inside a loop). Only
1886 // do this if the pred block is unconditionally branching into the phi block.
1888 BranchInst *BI = dyn_cast<BranchInst>(NonConstBB->getTerminator());
1889 if (!BI || !BI->isUnconditional()) return 0;
1892 // Okay, we can do the transformation: create the new PHI node.
1893 PHINode *NewPN = new PHINode(I.getType(), "");
1894 NewPN->reserveOperandSpace(PN->getNumOperands()/2);
1895 InsertNewInstBefore(NewPN, *PN);
1896 NewPN->takeName(PN);
1898 // Next, add all of the operands to the PHI.
1899 if (I.getNumOperands() == 2) {
1900 Constant *C = cast<Constant>(I.getOperand(1));
1901 for (unsigned i = 0; i != NumPHIValues; ++i) {
1903 if (Constant *InC = dyn_cast<Constant>(PN->getIncomingValue(i))) {
1904 if (CmpInst *CI = dyn_cast<CmpInst>(&I))
1905 InV = ConstantExpr::getCompare(CI->getPredicate(), InC, C);
1907 InV = ConstantExpr::get(I.getOpcode(), InC, C);
1909 assert(PN->getIncomingBlock(i) == NonConstBB);
1910 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(&I))
1911 InV = BinaryOperator::create(BO->getOpcode(),
1912 PN->getIncomingValue(i), C, "phitmp",
1913 NonConstBB->getTerminator());
1914 else if (CmpInst *CI = dyn_cast<CmpInst>(&I))
1915 InV = CmpInst::create(CI->getOpcode(),
1917 PN->getIncomingValue(i), C, "phitmp",
1918 NonConstBB->getTerminator());
1920 assert(0 && "Unknown binop!");
1922 AddToWorkList(cast<Instruction>(InV));
1924 NewPN->addIncoming(InV, PN->getIncomingBlock(i));
1927 CastInst *CI = cast<CastInst>(&I);
1928 const Type *RetTy = CI->getType();
1929 for (unsigned i = 0; i != NumPHIValues; ++i) {
1931 if (Constant *InC = dyn_cast<Constant>(PN->getIncomingValue(i))) {
1932 InV = ConstantExpr::getCast(CI->getOpcode(), InC, RetTy);
1934 assert(PN->getIncomingBlock(i) == NonConstBB);
1935 InV = CastInst::create(CI->getOpcode(), PN->getIncomingValue(i),
1936 I.getType(), "phitmp",
1937 NonConstBB->getTerminator());
1938 AddToWorkList(cast<Instruction>(InV));
1940 NewPN->addIncoming(InV, PN->getIncomingBlock(i));
1943 return ReplaceInstUsesWith(I, NewPN);
1946 Instruction *InstCombiner::visitAdd(BinaryOperator &I) {
1947 bool Changed = SimplifyCommutative(I);
1948 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1);
1950 if (Constant *RHSC = dyn_cast<Constant>(RHS)) {
1951 // X + undef -> undef
1952 if (isa<UndefValue>(RHS))
1953 return ReplaceInstUsesWith(I, RHS);
1956 if (!I.getType()->isFPOrFPVector()) { // NOTE: -0 + +0 = +0.
1957 if (RHSC->isNullValue())
1958 return ReplaceInstUsesWith(I, LHS);
1959 } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(RHSC)) {
1960 if (CFP->isExactlyValue(ConstantFP::getNegativeZero
1961 (I.getType())->getValueAPF()))
1962 return ReplaceInstUsesWith(I, LHS);
1965 if (ConstantInt *CI = dyn_cast<ConstantInt>(RHSC)) {
1966 // X + (signbit) --> X ^ signbit
1967 const APInt& Val = CI->getValue();
1968 uint32_t BitWidth = Val.getBitWidth();
1969 if (Val == APInt::getSignBit(BitWidth))
1970 return BinaryOperator::createXor(LHS, RHS);
1972 // See if SimplifyDemandedBits can simplify this. This handles stuff like
1973 // (X & 254)+1 -> (X&254)|1
1974 if (!isa<VectorType>(I.getType())) {
1975 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
1976 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
1977 KnownZero, KnownOne))
1982 if (isa<PHINode>(LHS))
1983 if (Instruction *NV = FoldOpIntoPhi(I))
1986 ConstantInt *XorRHS = 0;
1988 if (isa<ConstantInt>(RHSC) &&
1989 match(LHS, m_Xor(m_Value(XorLHS), m_ConstantInt(XorRHS)))) {
1990 uint32_t TySizeBits = I.getType()->getPrimitiveSizeInBits();
1991 const APInt& RHSVal = cast<ConstantInt>(RHSC)->getValue();
1993 uint32_t Size = TySizeBits / 2;
1994 APInt C0080Val(APInt(TySizeBits, 1ULL).shl(Size - 1));
1995 APInt CFF80Val(-C0080Val);
1997 if (TySizeBits > Size) {
1998 // If we have ADD(XOR(AND(X, 0xFF), 0x80), 0xF..F80), it's a sext.
1999 // If we have ADD(XOR(AND(X, 0xFF), 0xF..F80), 0x80), it's a sext.
2000 if ((RHSVal == CFF80Val && XorRHS->getValue() == C0080Val) ||
2001 (RHSVal == C0080Val && XorRHS->getValue() == CFF80Val)) {
2002 // This is a sign extend if the top bits are known zero.
2003 if (!MaskedValueIsZero(XorLHS,
2004 APInt::getHighBitsSet(TySizeBits, TySizeBits - Size)))
2005 Size = 0; // Not a sign ext, but can't be any others either.
2010 C0080Val = APIntOps::lshr(C0080Val, Size);
2011 CFF80Val = APIntOps::ashr(CFF80Val, Size);
2012 } while (Size >= 1);
2014 // FIXME: This shouldn't be necessary. When the backends can handle types
2015 // with funny bit widths then this whole cascade of if statements should
2016 // be removed. It is just here to get the size of the "middle" type back
2017 // up to something that the back ends can handle.
2018 const Type *MiddleType = 0;
2021 case 32: MiddleType = Type::Int32Ty; break;
2022 case 16: MiddleType = Type::Int16Ty; break;
2023 case 8: MiddleType = Type::Int8Ty; break;
2026 Instruction *NewTrunc = new TruncInst(XorLHS, MiddleType, "sext");
2027 InsertNewInstBefore(NewTrunc, I);
2028 return new SExtInst(NewTrunc, I.getType(), I.getName());
2034 if (I.getType()->isInteger() && I.getType() != Type::Int1Ty) {
2035 if (Instruction *Result = AssociativeOpt(I, AddRHS(RHS))) return Result;
2037 if (Instruction *RHSI = dyn_cast<Instruction>(RHS)) {
2038 if (RHSI->getOpcode() == Instruction::Sub)
2039 if (LHS == RHSI->getOperand(1)) // A + (B - A) --> B
2040 return ReplaceInstUsesWith(I, RHSI->getOperand(0));
2042 if (Instruction *LHSI = dyn_cast<Instruction>(LHS)) {
2043 if (LHSI->getOpcode() == Instruction::Sub)
2044 if (RHS == LHSI->getOperand(1)) // (B - A) + A --> B
2045 return ReplaceInstUsesWith(I, LHSI->getOperand(0));
2050 if (Value *V = dyn_castNegVal(LHS))
2051 return BinaryOperator::createSub(RHS, V);
2054 if (!isa<Constant>(RHS))
2055 if (Value *V = dyn_castNegVal(RHS))
2056 return BinaryOperator::createSub(LHS, V);
2060 if (Value *X = dyn_castFoldableMul(LHS, C2)) {
2061 if (X == RHS) // X*C + X --> X * (C+1)
2062 return BinaryOperator::createMul(RHS, AddOne(C2));
2064 // X*C1 + X*C2 --> X * (C1+C2)
2066 if (X == dyn_castFoldableMul(RHS, C1))
2067 return BinaryOperator::createMul(X, Add(C1, C2));
2070 // X + X*C --> X * (C+1)
2071 if (dyn_castFoldableMul(RHS, C2) == LHS)
2072 return BinaryOperator::createMul(LHS, AddOne(C2));
2074 // X + ~X --> -1 since ~X = -X-1
2075 if (dyn_castNotVal(LHS) == RHS || dyn_castNotVal(RHS) == LHS)
2076 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
2079 // (A & C1)+(B & C2) --> (A & C1)|(B & C2) iff C1&C2 == 0
2080 if (match(RHS, m_And(m_Value(), m_ConstantInt(C2))))
2081 if (Instruction *R = AssociativeOpt(I, AddMaskingAnd(C2)))
2084 if (ConstantInt *CRHS = dyn_cast<ConstantInt>(RHS)) {
2086 if (match(LHS, m_Not(m_Value(X)))) // ~X + C --> (C-1) - X
2087 return BinaryOperator::createSub(SubOne(CRHS), X);
2089 // (X & FF00) + xx00 -> (X+xx00) & FF00
2090 if (LHS->hasOneUse() && match(LHS, m_And(m_Value(X), m_ConstantInt(C2)))) {
2091 Constant *Anded = And(CRHS, C2);
2092 if (Anded == CRHS) {
2093 // See if all bits from the first bit set in the Add RHS up are included
2094 // in the mask. First, get the rightmost bit.
2095 const APInt& AddRHSV = CRHS->getValue();
2097 // Form a mask of all bits from the lowest bit added through the top.
2098 APInt AddRHSHighBits(~((AddRHSV & -AddRHSV)-1));
2100 // See if the and mask includes all of these bits.
2101 APInt AddRHSHighBitsAnd(AddRHSHighBits & C2->getValue());
2103 if (AddRHSHighBits == AddRHSHighBitsAnd) {
2104 // Okay, the xform is safe. Insert the new add pronto.
2105 Value *NewAdd = InsertNewInstBefore(BinaryOperator::createAdd(X, CRHS,
2106 LHS->getName()), I);
2107 return BinaryOperator::createAnd(NewAdd, C2);
2112 // Try to fold constant add into select arguments.
2113 if (SelectInst *SI = dyn_cast<SelectInst>(LHS))
2114 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2118 // add (cast *A to intptrtype) B ->
2119 // cast (GEP (cast *A to sbyte*) B) --> intptrtype
2121 CastInst *CI = dyn_cast<CastInst>(LHS);
2124 CI = dyn_cast<CastInst>(RHS);
2127 if (CI && CI->getType()->isSized() &&
2128 (CI->getType()->getPrimitiveSizeInBits() ==
2129 TD->getIntPtrType()->getPrimitiveSizeInBits())
2130 && isa<PointerType>(CI->getOperand(0)->getType())) {
2132 cast<PointerType>(CI->getOperand(0)->getType())->getAddressSpace();
2133 Value *I2 = InsertBitCastBefore(CI->getOperand(0),
2134 PointerType::get(Type::Int8Ty, AS), I);
2135 I2 = InsertNewInstBefore(new GetElementPtrInst(I2, Other, "ctg2"), I);
2136 return new PtrToIntInst(I2, CI->getType());
2140 // add (select X 0 (sub n A)) A --> select X A n
2142 SelectInst *SI = dyn_cast<SelectInst>(LHS);
2145 SI = dyn_cast<SelectInst>(RHS);
2148 if (SI && SI->hasOneUse()) {
2149 Value *TV = SI->getTrueValue();
2150 Value *FV = SI->getFalseValue();
2153 // Can we fold the add into the argument of the select?
2154 // We check both true and false select arguments for a matching subtract.
2155 if (match(FV, m_Zero()) && match(TV, m_Sub(m_Value(N), m_Value(A))) &&
2156 A == Other) // Fold the add into the true select value.
2157 return new SelectInst(SI->getCondition(), N, A);
2158 if (match(TV, m_Zero()) && match(FV, m_Sub(m_Value(N), m_Value(A))) &&
2159 A == Other) // Fold the add into the false select value.
2160 return new SelectInst(SI->getCondition(), A, N);
2164 return Changed ? &I : 0;
2167 // isSignBit - Return true if the value represented by the constant only has the
2168 // highest order bit set.
2169 static bool isSignBit(ConstantInt *CI) {
2170 uint32_t NumBits = CI->getType()->getPrimitiveSizeInBits();
2171 return CI->getValue() == APInt::getSignBit(NumBits);
2174 Instruction *InstCombiner::visitSub(BinaryOperator &I) {
2175 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2177 if (Op0 == Op1) // sub X, X -> 0
2178 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2180 // If this is a 'B = x-(-A)', change to B = x+A...
2181 if (Value *V = dyn_castNegVal(Op1))
2182 return BinaryOperator::createAdd(Op0, V);
2184 if (isa<UndefValue>(Op0))
2185 return ReplaceInstUsesWith(I, Op0); // undef - X -> undef
2186 if (isa<UndefValue>(Op1))
2187 return ReplaceInstUsesWith(I, Op1); // X - undef -> undef
2189 if (ConstantInt *C = dyn_cast<ConstantInt>(Op0)) {
2190 // Replace (-1 - A) with (~A)...
2191 if (C->isAllOnesValue())
2192 return BinaryOperator::createNot(Op1);
2194 // C - ~X == X + (1+C)
2196 if (match(Op1, m_Not(m_Value(X))))
2197 return BinaryOperator::createAdd(X, AddOne(C));
2199 // -(X >>u 31) -> (X >>s 31)
2200 // -(X >>s 31) -> (X >>u 31)
2202 if (BinaryOperator *SI = dyn_cast<BinaryOperator>(Op1))
2203 if (SI->getOpcode() == Instruction::LShr) {
2204 if (ConstantInt *CU = dyn_cast<ConstantInt>(SI->getOperand(1))) {
2205 // Check to see if we are shifting out everything but the sign bit.
2206 if (CU->getLimitedValue(SI->getType()->getPrimitiveSizeInBits()) ==
2207 SI->getType()->getPrimitiveSizeInBits()-1) {
2208 // Ok, the transformation is safe. Insert AShr.
2209 return BinaryOperator::create(Instruction::AShr,
2210 SI->getOperand(0), CU, SI->getName());
2214 else if (SI->getOpcode() == Instruction::AShr) {
2215 if (ConstantInt *CU = dyn_cast<ConstantInt>(SI->getOperand(1))) {
2216 // Check to see if we are shifting out everything but the sign bit.
2217 if (CU->getLimitedValue(SI->getType()->getPrimitiveSizeInBits()) ==
2218 SI->getType()->getPrimitiveSizeInBits()-1) {
2219 // Ok, the transformation is safe. Insert LShr.
2220 return BinaryOperator::createLShr(
2221 SI->getOperand(0), CU, SI->getName());
2227 // Try to fold constant sub into select arguments.
2228 if (SelectInst *SI = dyn_cast<SelectInst>(Op1))
2229 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2232 if (isa<PHINode>(Op0))
2233 if (Instruction *NV = FoldOpIntoPhi(I))
2237 if (BinaryOperator *Op1I = dyn_cast<BinaryOperator>(Op1)) {
2238 if (Op1I->getOpcode() == Instruction::Add &&
2239 !Op0->getType()->isFPOrFPVector()) {
2240 if (Op1I->getOperand(0) == Op0) // X-(X+Y) == -Y
2241 return BinaryOperator::createNeg(Op1I->getOperand(1), I.getName());
2242 else if (Op1I->getOperand(1) == Op0) // X-(Y+X) == -Y
2243 return BinaryOperator::createNeg(Op1I->getOperand(0), I.getName());
2244 else if (ConstantInt *CI1 = dyn_cast<ConstantInt>(I.getOperand(0))) {
2245 if (ConstantInt *CI2 = dyn_cast<ConstantInt>(Op1I->getOperand(1)))
2246 // C1-(X+C2) --> (C1-C2)-X
2247 return BinaryOperator::createSub(Subtract(CI1, CI2),
2248 Op1I->getOperand(0));
2252 if (Op1I->hasOneUse()) {
2253 // Replace (x - (y - z)) with (x + (z - y)) if the (y - z) subexpression
2254 // is not used by anyone else...
2256 if (Op1I->getOpcode() == Instruction::Sub &&
2257 !Op1I->getType()->isFPOrFPVector()) {
2258 // Swap the two operands of the subexpr...
2259 Value *IIOp0 = Op1I->getOperand(0), *IIOp1 = Op1I->getOperand(1);
2260 Op1I->setOperand(0, IIOp1);
2261 Op1I->setOperand(1, IIOp0);
2263 // Create the new top level add instruction...
2264 return BinaryOperator::createAdd(Op0, Op1);
2267 // Replace (A - (A & B)) with (A & ~B) if this is the only use of (A&B)...
2269 if (Op1I->getOpcode() == Instruction::And &&
2270 (Op1I->getOperand(0) == Op0 || Op1I->getOperand(1) == Op0)) {
2271 Value *OtherOp = Op1I->getOperand(Op1I->getOperand(0) == Op0);
2274 InsertNewInstBefore(BinaryOperator::createNot(OtherOp, "B.not"), I);
2275 return BinaryOperator::createAnd(Op0, NewNot);
2278 // 0 - (X sdiv C) -> (X sdiv -C)
2279 if (Op1I->getOpcode() == Instruction::SDiv)
2280 if (ConstantInt *CSI = dyn_cast<ConstantInt>(Op0))
2282 if (Constant *DivRHS = dyn_cast<Constant>(Op1I->getOperand(1)))
2283 return BinaryOperator::createSDiv(Op1I->getOperand(0),
2284 ConstantExpr::getNeg(DivRHS));
2286 // X - X*C --> X * (1-C)
2287 ConstantInt *C2 = 0;
2288 if (dyn_castFoldableMul(Op1I, C2) == Op0) {
2289 Constant *CP1 = Subtract(ConstantInt::get(I.getType(), 1), C2);
2290 return BinaryOperator::createMul(Op0, CP1);
2293 // X - ((X / Y) * Y) --> X % Y
2294 if (Op1I->getOpcode() == Instruction::Mul)
2295 if (Instruction *I = dyn_cast<Instruction>(Op1I->getOperand(0)))
2296 if (Op0 == I->getOperand(0) &&
2297 Op1I->getOperand(1) == I->getOperand(1)) {
2298 if (I->getOpcode() == Instruction::SDiv)
2299 return BinaryOperator::createSRem(Op0, Op1I->getOperand(1));
2300 if (I->getOpcode() == Instruction::UDiv)
2301 return BinaryOperator::createURem(Op0, Op1I->getOperand(1));
2306 if (!Op0->getType()->isFPOrFPVector())
2307 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0))
2308 if (Op0I->getOpcode() == Instruction::Add) {
2309 if (Op0I->getOperand(0) == Op1) // (Y+X)-Y == X
2310 return ReplaceInstUsesWith(I, Op0I->getOperand(1));
2311 else if (Op0I->getOperand(1) == Op1) // (X+Y)-Y == X
2312 return ReplaceInstUsesWith(I, Op0I->getOperand(0));
2313 } else if (Op0I->getOpcode() == Instruction::Sub) {
2314 if (Op0I->getOperand(0) == Op1) // (X-Y)-X == -Y
2315 return BinaryOperator::createNeg(Op0I->getOperand(1), I.getName());
2319 if (Value *X = dyn_castFoldableMul(Op0, C1)) {
2320 if (X == Op1) // X*C - X --> X * (C-1)
2321 return BinaryOperator::createMul(Op1, SubOne(C1));
2323 ConstantInt *C2; // X*C1 - X*C2 -> X * (C1-C2)
2324 if (X == dyn_castFoldableMul(Op1, C2))
2325 return BinaryOperator::createMul(Op1, Subtract(C1, C2));
2330 /// isSignBitCheck - Given an exploded icmp instruction, return true if the
2331 /// comparison only checks the sign bit. If it only checks the sign bit, set
2332 /// TrueIfSigned if the result of the comparison is true when the input value is
2334 static bool isSignBitCheck(ICmpInst::Predicate pred, ConstantInt *RHS,
2335 bool &TrueIfSigned) {
2337 case ICmpInst::ICMP_SLT: // True if LHS s< 0
2338 TrueIfSigned = true;
2339 return RHS->isZero();
2340 case ICmpInst::ICMP_SLE: // True if LHS s<= RHS and RHS == -1
2341 TrueIfSigned = true;
2342 return RHS->isAllOnesValue();
2343 case ICmpInst::ICMP_SGT: // True if LHS s> -1
2344 TrueIfSigned = false;
2345 return RHS->isAllOnesValue();
2346 case ICmpInst::ICMP_UGT:
2347 // True if LHS u> RHS and RHS == high-bit-mask - 1
2348 TrueIfSigned = true;
2349 return RHS->getValue() ==
2350 APInt::getSignedMaxValue(RHS->getType()->getPrimitiveSizeInBits());
2351 case ICmpInst::ICMP_UGE:
2352 // True if LHS u>= RHS and RHS == high-bit-mask (2^7, 2^15, 2^31, etc)
2353 TrueIfSigned = true;
2354 return RHS->getValue() ==
2355 APInt::getSignBit(RHS->getType()->getPrimitiveSizeInBits());
2361 Instruction *InstCombiner::visitMul(BinaryOperator &I) {
2362 bool Changed = SimplifyCommutative(I);
2363 Value *Op0 = I.getOperand(0);
2365 if (isa<UndefValue>(I.getOperand(1))) // undef * X -> 0
2366 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2368 // Simplify mul instructions with a constant RHS...
2369 if (Constant *Op1 = dyn_cast<Constant>(I.getOperand(1))) {
2370 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
2372 // ((X << C1)*C2) == (X * (C2 << C1))
2373 if (BinaryOperator *SI = dyn_cast<BinaryOperator>(Op0))
2374 if (SI->getOpcode() == Instruction::Shl)
2375 if (Constant *ShOp = dyn_cast<Constant>(SI->getOperand(1)))
2376 return BinaryOperator::createMul(SI->getOperand(0),
2377 ConstantExpr::getShl(CI, ShOp));
2380 return ReplaceInstUsesWith(I, Op1); // X * 0 == 0
2381 if (CI->equalsInt(1)) // X * 1 == X
2382 return ReplaceInstUsesWith(I, Op0);
2383 if (CI->isAllOnesValue()) // X * -1 == 0 - X
2384 return BinaryOperator::createNeg(Op0, I.getName());
2386 const APInt& Val = cast<ConstantInt>(CI)->getValue();
2387 if (Val.isPowerOf2()) { // Replace X*(2^C) with X << C
2388 return BinaryOperator::createShl(Op0,
2389 ConstantInt::get(Op0->getType(), Val.logBase2()));
2391 } else if (ConstantFP *Op1F = dyn_cast<ConstantFP>(Op1)) {
2392 if (Op1F->isNullValue())
2393 return ReplaceInstUsesWith(I, Op1);
2395 // "In IEEE floating point, x*1 is not equivalent to x for nans. However,
2396 // ANSI says we can drop signals, so we can do this anyway." (from GCC)
2397 // We need a better interface for long double here.
2398 if (Op1->getType() == Type::FloatTy || Op1->getType() == Type::DoubleTy)
2399 if (Op1F->isExactlyValue(1.0))
2400 return ReplaceInstUsesWith(I, Op0); // Eliminate 'mul double %X, 1.0'
2403 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0))
2404 if (Op0I->getOpcode() == Instruction::Add && Op0I->hasOneUse() &&
2405 isa<ConstantInt>(Op0I->getOperand(1))) {
2406 // Canonicalize (X+C1)*C2 -> X*C2+C1*C2.
2407 Instruction *Add = BinaryOperator::createMul(Op0I->getOperand(0),
2409 InsertNewInstBefore(Add, I);
2410 Value *C1C2 = ConstantExpr::getMul(Op1,
2411 cast<Constant>(Op0I->getOperand(1)));
2412 return BinaryOperator::createAdd(Add, C1C2);
2416 // Try to fold constant mul into select arguments.
2417 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
2418 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2421 if (isa<PHINode>(Op0))
2422 if (Instruction *NV = FoldOpIntoPhi(I))
2426 if (Value *Op0v = dyn_castNegVal(Op0)) // -X * -Y = X*Y
2427 if (Value *Op1v = dyn_castNegVal(I.getOperand(1)))
2428 return BinaryOperator::createMul(Op0v, Op1v);
2430 // If one of the operands of the multiply is a cast from a boolean value, then
2431 // we know the bool is either zero or one, so this is a 'masking' multiply.
2432 // See if we can simplify things based on how the boolean was originally
2434 CastInst *BoolCast = 0;
2435 if (ZExtInst *CI = dyn_cast<ZExtInst>(I.getOperand(0)))
2436 if (CI->getOperand(0)->getType() == Type::Int1Ty)
2439 if (ZExtInst *CI = dyn_cast<ZExtInst>(I.getOperand(1)))
2440 if (CI->getOperand(0)->getType() == Type::Int1Ty)
2443 if (ICmpInst *SCI = dyn_cast<ICmpInst>(BoolCast->getOperand(0))) {
2444 Value *SCIOp0 = SCI->getOperand(0), *SCIOp1 = SCI->getOperand(1);
2445 const Type *SCOpTy = SCIOp0->getType();
2448 // If the icmp is true iff the sign bit of X is set, then convert this
2449 // multiply into a shift/and combination.
2450 if (isa<ConstantInt>(SCIOp1) &&
2451 isSignBitCheck(SCI->getPredicate(), cast<ConstantInt>(SCIOp1), TIS) &&
2453 // Shift the X value right to turn it into "all signbits".
2454 Constant *Amt = ConstantInt::get(SCIOp0->getType(),
2455 SCOpTy->getPrimitiveSizeInBits()-1);
2457 InsertNewInstBefore(
2458 BinaryOperator::create(Instruction::AShr, SCIOp0, Amt,
2459 BoolCast->getOperand(0)->getName()+
2462 // If the multiply type is not the same as the source type, sign extend
2463 // or truncate to the multiply type.
2464 if (I.getType() != V->getType()) {
2465 uint32_t SrcBits = V->getType()->getPrimitiveSizeInBits();
2466 uint32_t DstBits = I.getType()->getPrimitiveSizeInBits();
2467 Instruction::CastOps opcode =
2468 (SrcBits == DstBits ? Instruction::BitCast :
2469 (SrcBits < DstBits ? Instruction::SExt : Instruction::Trunc));
2470 V = InsertCastBefore(opcode, V, I.getType(), I);
2473 Value *OtherOp = Op0 == BoolCast ? I.getOperand(1) : Op0;
2474 return BinaryOperator::createAnd(V, OtherOp);
2479 return Changed ? &I : 0;
2482 /// This function implements the transforms on div instructions that work
2483 /// regardless of the kind of div instruction it is (udiv, sdiv, or fdiv). It is
2484 /// used by the visitors to those instructions.
2485 /// @brief Transforms common to all three div instructions
2486 Instruction *InstCombiner::commonDivTransforms(BinaryOperator &I) {
2487 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2490 if (isa<UndefValue>(Op0))
2491 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2493 // X / undef -> undef
2494 if (isa<UndefValue>(Op1))
2495 return ReplaceInstUsesWith(I, Op1);
2497 // Handle cases involving: div X, (select Cond, Y, Z)
2498 if (SelectInst *SI = dyn_cast<SelectInst>(Op1)) {
2499 // div X, (Cond ? 0 : Y) -> div X, Y. If the div and the select are in the
2500 // same basic block, then we replace the select with Y, and the condition
2501 // of the select with false (if the cond value is in the same BB). If the
2502 // select has uses other than the div, this allows them to be simplified
2503 // also. Note that div X, Y is just as good as div X, 0 (undef)
2504 if (Constant *ST = dyn_cast<Constant>(SI->getOperand(1)))
2505 if (ST->isNullValue()) {
2506 Instruction *CondI = dyn_cast<Instruction>(SI->getOperand(0));
2507 if (CondI && CondI->getParent() == I.getParent())
2508 UpdateValueUsesWith(CondI, ConstantInt::getFalse());
2509 else if (I.getParent() != SI->getParent() || SI->hasOneUse())
2510 I.setOperand(1, SI->getOperand(2));
2512 UpdateValueUsesWith(SI, SI->getOperand(2));
2516 // Likewise for: div X, (Cond ? Y : 0) -> div X, Y
2517 if (Constant *ST = dyn_cast<Constant>(SI->getOperand(2)))
2518 if (ST->isNullValue()) {
2519 Instruction *CondI = dyn_cast<Instruction>(SI->getOperand(0));
2520 if (CondI && CondI->getParent() == I.getParent())
2521 UpdateValueUsesWith(CondI, ConstantInt::getTrue());
2522 else if (I.getParent() != SI->getParent() || SI->hasOneUse())
2523 I.setOperand(1, SI->getOperand(1));
2525 UpdateValueUsesWith(SI, SI->getOperand(1));
2533 /// This function implements the transforms common to both integer division
2534 /// instructions (udiv and sdiv). It is called by the visitors to those integer
2535 /// division instructions.
2536 /// @brief Common integer divide transforms
2537 Instruction *InstCombiner::commonIDivTransforms(BinaryOperator &I) {
2538 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2540 if (Instruction *Common = commonDivTransforms(I))
2543 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
2545 if (RHS->equalsInt(1))
2546 return ReplaceInstUsesWith(I, Op0);
2548 // (X / C1) / C2 -> X / (C1*C2)
2549 if (Instruction *LHS = dyn_cast<Instruction>(Op0))
2550 if (Instruction::BinaryOps(LHS->getOpcode()) == I.getOpcode())
2551 if (ConstantInt *LHSRHS = dyn_cast<ConstantInt>(LHS->getOperand(1))) {
2552 return BinaryOperator::create(I.getOpcode(), LHS->getOperand(0),
2553 Multiply(RHS, LHSRHS));
2556 if (!RHS->isZero()) { // avoid X udiv 0
2557 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
2558 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2560 if (isa<PHINode>(Op0))
2561 if (Instruction *NV = FoldOpIntoPhi(I))
2566 // 0 / X == 0, we don't need to preserve faults!
2567 if (ConstantInt *LHS = dyn_cast<ConstantInt>(Op0))
2568 if (LHS->equalsInt(0))
2569 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2574 Instruction *InstCombiner::visitUDiv(BinaryOperator &I) {
2575 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2577 // Handle the integer div common cases
2578 if (Instruction *Common = commonIDivTransforms(I))
2581 // X udiv C^2 -> X >> C
2582 // Check to see if this is an unsigned division with an exact power of 2,
2583 // if so, convert to a right shift.
2584 if (ConstantInt *C = dyn_cast<ConstantInt>(Op1)) {
2585 if (C->getValue().isPowerOf2()) // 0 not included in isPowerOf2
2586 return BinaryOperator::createLShr(Op0,
2587 ConstantInt::get(Op0->getType(), C->getValue().logBase2()));
2590 // X udiv (C1 << N), where C1 is "1<<C2" --> X >> (N+C2)
2591 if (BinaryOperator *RHSI = dyn_cast<BinaryOperator>(I.getOperand(1))) {
2592 if (RHSI->getOpcode() == Instruction::Shl &&
2593 isa<ConstantInt>(RHSI->getOperand(0))) {
2594 const APInt& C1 = cast<ConstantInt>(RHSI->getOperand(0))->getValue();
2595 if (C1.isPowerOf2()) {
2596 Value *N = RHSI->getOperand(1);
2597 const Type *NTy = N->getType();
2598 if (uint32_t C2 = C1.logBase2()) {
2599 Constant *C2V = ConstantInt::get(NTy, C2);
2600 N = InsertNewInstBefore(BinaryOperator::createAdd(N, C2V, "tmp"), I);
2602 return BinaryOperator::createLShr(Op0, N);
2607 // udiv X, (Select Cond, C1, C2) --> Select Cond, (shr X, C1), (shr X, C2)
2608 // where C1&C2 are powers of two.
2609 if (SelectInst *SI = dyn_cast<SelectInst>(Op1))
2610 if (ConstantInt *STO = dyn_cast<ConstantInt>(SI->getOperand(1)))
2611 if (ConstantInt *SFO = dyn_cast<ConstantInt>(SI->getOperand(2))) {
2612 const APInt &TVA = STO->getValue(), &FVA = SFO->getValue();
2613 if (TVA.isPowerOf2() && FVA.isPowerOf2()) {
2614 // Compute the shift amounts
2615 uint32_t TSA = TVA.logBase2(), FSA = FVA.logBase2();
2616 // Construct the "on true" case of the select
2617 Constant *TC = ConstantInt::get(Op0->getType(), TSA);
2618 Instruction *TSI = BinaryOperator::createLShr(
2619 Op0, TC, SI->getName()+".t");
2620 TSI = InsertNewInstBefore(TSI, I);
2622 // Construct the "on false" case of the select
2623 Constant *FC = ConstantInt::get(Op0->getType(), FSA);
2624 Instruction *FSI = BinaryOperator::createLShr(
2625 Op0, FC, SI->getName()+".f");
2626 FSI = InsertNewInstBefore(FSI, I);
2628 // construct the select instruction and return it.
2629 return new SelectInst(SI->getOperand(0), TSI, FSI, SI->getName());
2635 Instruction *InstCombiner::visitSDiv(BinaryOperator &I) {
2636 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2638 // Handle the integer div common cases
2639 if (Instruction *Common = commonIDivTransforms(I))
2642 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
2644 if (RHS->isAllOnesValue())
2645 return BinaryOperator::createNeg(Op0);
2648 if (Value *LHSNeg = dyn_castNegVal(Op0))
2649 return BinaryOperator::createSDiv(LHSNeg, ConstantExpr::getNeg(RHS));
2652 // If the sign bits of both operands are zero (i.e. we can prove they are
2653 // unsigned inputs), turn this into a udiv.
2654 if (I.getType()->isInteger()) {
2655 APInt Mask(APInt::getSignBit(I.getType()->getPrimitiveSizeInBits()));
2656 if (MaskedValueIsZero(Op1, Mask) && MaskedValueIsZero(Op0, Mask)) {
2657 // X sdiv Y -> X udiv Y, iff X and Y don't have sign bit set
2658 return BinaryOperator::createUDiv(Op0, Op1, I.getName());
2665 Instruction *InstCombiner::visitFDiv(BinaryOperator &I) {
2666 return commonDivTransforms(I);
2669 /// GetFactor - If we can prove that the specified value is at least a multiple
2670 /// of some factor, return that factor.
2671 static Constant *GetFactor(Value *V) {
2672 if (ConstantInt *CI = dyn_cast<ConstantInt>(V))
2675 // Unless we can be tricky, we know this is a multiple of 1.
2676 Constant *Result = ConstantInt::get(V->getType(), 1);
2678 Instruction *I = dyn_cast<Instruction>(V);
2679 if (!I) return Result;
2681 if (I->getOpcode() == Instruction::Mul) {
2682 // Handle multiplies by a constant, etc.
2683 return ConstantExpr::getMul(GetFactor(I->getOperand(0)),
2684 GetFactor(I->getOperand(1)));
2685 } else if (I->getOpcode() == Instruction::Shl) {
2686 // (X<<C) -> X * (1 << C)
2687 if (Constant *ShRHS = dyn_cast<Constant>(I->getOperand(1))) {
2688 ShRHS = ConstantExpr::getShl(Result, ShRHS);
2689 return ConstantExpr::getMul(GetFactor(I->getOperand(0)), ShRHS);
2691 } else if (I->getOpcode() == Instruction::And) {
2692 if (ConstantInt *RHS = dyn_cast<ConstantInt>(I->getOperand(1))) {
2693 // X & 0xFFF0 is known to be a multiple of 16.
2694 uint32_t Zeros = RHS->getValue().countTrailingZeros();
2695 if (Zeros != V->getType()->getPrimitiveSizeInBits())// don't shift by "32"
2696 return ConstantExpr::getShl(Result,
2697 ConstantInt::get(Result->getType(), Zeros));
2699 } else if (CastInst *CI = dyn_cast<CastInst>(I)) {
2700 // Only handle int->int casts.
2701 if (!CI->isIntegerCast())
2703 Value *Op = CI->getOperand(0);
2704 return ConstantExpr::getCast(CI->getOpcode(), GetFactor(Op), V->getType());
2709 /// This function implements the transforms on rem instructions that work
2710 /// regardless of the kind of rem instruction it is (urem, srem, or frem). It
2711 /// is used by the visitors to those instructions.
2712 /// @brief Transforms common to all three rem instructions
2713 Instruction *InstCombiner::commonRemTransforms(BinaryOperator &I) {
2714 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2716 // 0 % X == 0, we don't need to preserve faults!
2717 if (Constant *LHS = dyn_cast<Constant>(Op0))
2718 if (LHS->isNullValue())
2719 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2721 if (isa<UndefValue>(Op0)) // undef % X -> 0
2722 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2723 if (isa<UndefValue>(Op1))
2724 return ReplaceInstUsesWith(I, Op1); // X % undef -> undef
2726 // Handle cases involving: rem X, (select Cond, Y, Z)
2727 if (SelectInst *SI = dyn_cast<SelectInst>(Op1)) {
2728 // rem X, (Cond ? 0 : Y) -> rem X, Y. If the rem and the select are in
2729 // the same basic block, then we replace the select with Y, and the
2730 // condition of the select with false (if the cond value is in the same
2731 // BB). If the select has uses other than the div, this allows them to be
2733 if (Constant *ST = dyn_cast<Constant>(SI->getOperand(1)))
2734 if (ST->isNullValue()) {
2735 Instruction *CondI = dyn_cast<Instruction>(SI->getOperand(0));
2736 if (CondI && CondI->getParent() == I.getParent())
2737 UpdateValueUsesWith(CondI, ConstantInt::getFalse());
2738 else if (I.getParent() != SI->getParent() || SI->hasOneUse())
2739 I.setOperand(1, SI->getOperand(2));
2741 UpdateValueUsesWith(SI, SI->getOperand(2));
2744 // Likewise for: rem X, (Cond ? Y : 0) -> rem X, Y
2745 if (Constant *ST = dyn_cast<Constant>(SI->getOperand(2)))
2746 if (ST->isNullValue()) {
2747 Instruction *CondI = dyn_cast<Instruction>(SI->getOperand(0));
2748 if (CondI && CondI->getParent() == I.getParent())
2749 UpdateValueUsesWith(CondI, ConstantInt::getTrue());
2750 else if (I.getParent() != SI->getParent() || SI->hasOneUse())
2751 I.setOperand(1, SI->getOperand(1));
2753 UpdateValueUsesWith(SI, SI->getOperand(1));
2761 /// This function implements the transforms common to both integer remainder
2762 /// instructions (urem and srem). It is called by the visitors to those integer
2763 /// remainder instructions.
2764 /// @brief Common integer remainder transforms
2765 Instruction *InstCombiner::commonIRemTransforms(BinaryOperator &I) {
2766 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2768 if (Instruction *common = commonRemTransforms(I))
2771 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
2772 // X % 0 == undef, we don't need to preserve faults!
2773 if (RHS->equalsInt(0))
2774 return ReplaceInstUsesWith(I, UndefValue::get(I.getType()));
2776 if (RHS->equalsInt(1)) // X % 1 == 0
2777 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2779 if (Instruction *Op0I = dyn_cast<Instruction>(Op0)) {
2780 if (SelectInst *SI = dyn_cast<SelectInst>(Op0I)) {
2781 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2783 } else if (isa<PHINode>(Op0I)) {
2784 if (Instruction *NV = FoldOpIntoPhi(I))
2787 // (X * C1) % C2 --> 0 iff C1 % C2 == 0
2788 if (ConstantExpr::getSRem(GetFactor(Op0I), RHS)->isNullValue())
2789 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2796 Instruction *InstCombiner::visitURem(BinaryOperator &I) {
2797 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2799 if (Instruction *common = commonIRemTransforms(I))
2802 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
2803 // X urem C^2 -> X and C
2804 // Check to see if this is an unsigned remainder with an exact power of 2,
2805 // if so, convert to a bitwise and.
2806 if (ConstantInt *C = dyn_cast<ConstantInt>(RHS))
2807 if (C->getValue().isPowerOf2())
2808 return BinaryOperator::createAnd(Op0, SubOne(C));
2811 if (Instruction *RHSI = dyn_cast<Instruction>(I.getOperand(1))) {
2812 // Turn A % (C << N), where C is 2^k, into A & ((C << N)-1)
2813 if (RHSI->getOpcode() == Instruction::Shl &&
2814 isa<ConstantInt>(RHSI->getOperand(0))) {
2815 if (cast<ConstantInt>(RHSI->getOperand(0))->getValue().isPowerOf2()) {
2816 Constant *N1 = ConstantInt::getAllOnesValue(I.getType());
2817 Value *Add = InsertNewInstBefore(BinaryOperator::createAdd(RHSI, N1,
2819 return BinaryOperator::createAnd(Op0, Add);
2824 // urem X, (select Cond, 2^C1, 2^C2) --> select Cond, (and X, C1), (and X, C2)
2825 // where C1&C2 are powers of two.
2826 if (SelectInst *SI = dyn_cast<SelectInst>(Op1)) {
2827 if (ConstantInt *STO = dyn_cast<ConstantInt>(SI->getOperand(1)))
2828 if (ConstantInt *SFO = dyn_cast<ConstantInt>(SI->getOperand(2))) {
2829 // STO == 0 and SFO == 0 handled above.
2830 if ((STO->getValue().isPowerOf2()) &&
2831 (SFO->getValue().isPowerOf2())) {
2832 Value *TrueAnd = InsertNewInstBefore(
2833 BinaryOperator::createAnd(Op0, SubOne(STO), SI->getName()+".t"), I);
2834 Value *FalseAnd = InsertNewInstBefore(
2835 BinaryOperator::createAnd(Op0, SubOne(SFO), SI->getName()+".f"), I);
2836 return new SelectInst(SI->getOperand(0), TrueAnd, FalseAnd);
2844 Instruction *InstCombiner::visitSRem(BinaryOperator &I) {
2845 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2847 // Handle the integer rem common cases
2848 if (Instruction *common = commonIRemTransforms(I))
2851 if (Value *RHSNeg = dyn_castNegVal(Op1))
2852 if (!isa<ConstantInt>(RHSNeg) ||
2853 cast<ConstantInt>(RHSNeg)->getValue().isStrictlyPositive()) {
2855 AddUsesToWorkList(I);
2856 I.setOperand(1, RHSNeg);
2860 // If the sign bits of both operands are zero (i.e. we can prove they are
2861 // unsigned inputs), turn this into a urem.
2862 if (I.getType()->isInteger()) {
2863 APInt Mask(APInt::getSignBit(I.getType()->getPrimitiveSizeInBits()));
2864 if (MaskedValueIsZero(Op1, Mask) && MaskedValueIsZero(Op0, Mask)) {
2865 // X srem Y -> X urem Y, iff X and Y don't have sign bit set
2866 return BinaryOperator::createURem(Op0, Op1, I.getName());
2873 Instruction *InstCombiner::visitFRem(BinaryOperator &I) {
2874 return commonRemTransforms(I);
2877 // isMaxValueMinusOne - return true if this is Max-1
2878 static bool isMaxValueMinusOne(const ConstantInt *C, bool isSigned) {
2879 uint32_t TypeBits = C->getType()->getPrimitiveSizeInBits();
2881 return C->getValue() == APInt::getAllOnesValue(TypeBits) - 1;
2882 return C->getValue() == APInt::getSignedMaxValue(TypeBits)-1;
2885 // isMinValuePlusOne - return true if this is Min+1
2886 static bool isMinValuePlusOne(const ConstantInt *C, bool isSigned) {
2888 return C->getValue() == 1; // unsigned
2890 // Calculate 1111111111000000000000
2891 uint32_t TypeBits = C->getType()->getPrimitiveSizeInBits();
2892 return C->getValue() == APInt::getSignedMinValue(TypeBits)+1;
2895 // isOneBitSet - Return true if there is exactly one bit set in the specified
2897 static bool isOneBitSet(const ConstantInt *CI) {
2898 return CI->getValue().isPowerOf2();
2901 // isHighOnes - Return true if the constant is of the form 1+0+.
2902 // This is the same as lowones(~X).
2903 static bool isHighOnes(const ConstantInt *CI) {
2904 return (~CI->getValue() + 1).isPowerOf2();
2907 /// getICmpCode - Encode a icmp predicate into a three bit mask. These bits
2908 /// are carefully arranged to allow folding of expressions such as:
2910 /// (A < B) | (A > B) --> (A != B)
2912 /// Note that this is only valid if the first and second predicates have the
2913 /// same sign. Is illegal to do: (A u< B) | (A s> B)
2915 /// Three bits are used to represent the condition, as follows:
2920 /// <=> Value Definition
2921 /// 000 0 Always false
2928 /// 111 7 Always true
2930 static unsigned getICmpCode(const ICmpInst *ICI) {
2931 switch (ICI->getPredicate()) {
2933 case ICmpInst::ICMP_UGT: return 1; // 001
2934 case ICmpInst::ICMP_SGT: return 1; // 001
2935 case ICmpInst::ICMP_EQ: return 2; // 010
2936 case ICmpInst::ICMP_UGE: return 3; // 011
2937 case ICmpInst::ICMP_SGE: return 3; // 011
2938 case ICmpInst::ICMP_ULT: return 4; // 100
2939 case ICmpInst::ICMP_SLT: return 4; // 100
2940 case ICmpInst::ICMP_NE: return 5; // 101
2941 case ICmpInst::ICMP_ULE: return 6; // 110
2942 case ICmpInst::ICMP_SLE: return 6; // 110
2945 assert(0 && "Invalid ICmp predicate!");
2950 /// getICmpValue - This is the complement of getICmpCode, which turns an
2951 /// opcode and two operands into either a constant true or false, or a brand
2952 /// new ICmp instruction. The sign is passed in to determine which kind
2953 /// of predicate to use in new icmp instructions.
2954 static Value *getICmpValue(bool sign, unsigned code, Value *LHS, Value *RHS) {
2956 default: assert(0 && "Illegal ICmp code!");
2957 case 0: return ConstantInt::getFalse();
2960 return new ICmpInst(ICmpInst::ICMP_SGT, LHS, RHS);
2962 return new ICmpInst(ICmpInst::ICMP_UGT, LHS, RHS);
2963 case 2: return new ICmpInst(ICmpInst::ICMP_EQ, LHS, RHS);
2966 return new ICmpInst(ICmpInst::ICMP_SGE, LHS, RHS);
2968 return new ICmpInst(ICmpInst::ICMP_UGE, LHS, RHS);
2971 return new ICmpInst(ICmpInst::ICMP_SLT, LHS, RHS);
2973 return new ICmpInst(ICmpInst::ICMP_ULT, LHS, RHS);
2974 case 5: return new ICmpInst(ICmpInst::ICMP_NE, LHS, RHS);
2977 return new ICmpInst(ICmpInst::ICMP_SLE, LHS, RHS);
2979 return new ICmpInst(ICmpInst::ICMP_ULE, LHS, RHS);
2980 case 7: return ConstantInt::getTrue();
2984 static bool PredicatesFoldable(ICmpInst::Predicate p1, ICmpInst::Predicate p2) {
2985 return (ICmpInst::isSignedPredicate(p1) == ICmpInst::isSignedPredicate(p2)) ||
2986 (ICmpInst::isSignedPredicate(p1) &&
2987 (p2 == ICmpInst::ICMP_EQ || p2 == ICmpInst::ICMP_NE)) ||
2988 (ICmpInst::isSignedPredicate(p2) &&
2989 (p1 == ICmpInst::ICMP_EQ || p1 == ICmpInst::ICMP_NE));
2993 // FoldICmpLogical - Implements (icmp1 A, B) & (icmp2 A, B) --> (icmp3 A, B)
2994 struct FoldICmpLogical {
2997 ICmpInst::Predicate pred;
2998 FoldICmpLogical(InstCombiner &ic, ICmpInst *ICI)
2999 : IC(ic), LHS(ICI->getOperand(0)), RHS(ICI->getOperand(1)),
3000 pred(ICI->getPredicate()) {}
3001 bool shouldApply(Value *V) const {
3002 if (ICmpInst *ICI = dyn_cast<ICmpInst>(V))
3003 if (PredicatesFoldable(pred, ICI->getPredicate()))
3004 return (ICI->getOperand(0) == LHS && ICI->getOperand(1) == RHS ||
3005 ICI->getOperand(0) == RHS && ICI->getOperand(1) == LHS);
3008 Instruction *apply(Instruction &Log) const {
3009 ICmpInst *ICI = cast<ICmpInst>(Log.getOperand(0));
3010 if (ICI->getOperand(0) != LHS) {
3011 assert(ICI->getOperand(1) == LHS);
3012 ICI->swapOperands(); // Swap the LHS and RHS of the ICmp
3015 ICmpInst *RHSICI = cast<ICmpInst>(Log.getOperand(1));
3016 unsigned LHSCode = getICmpCode(ICI);
3017 unsigned RHSCode = getICmpCode(RHSICI);
3019 switch (Log.getOpcode()) {
3020 case Instruction::And: Code = LHSCode & RHSCode; break;
3021 case Instruction::Or: Code = LHSCode | RHSCode; break;
3022 case Instruction::Xor: Code = LHSCode ^ RHSCode; break;
3023 default: assert(0 && "Illegal logical opcode!"); return 0;
3026 bool isSigned = ICmpInst::isSignedPredicate(RHSICI->getPredicate()) ||
3027 ICmpInst::isSignedPredicate(ICI->getPredicate());
3029 Value *RV = getICmpValue(isSigned, Code, LHS, RHS);
3030 if (Instruction *I = dyn_cast<Instruction>(RV))
3032 // Otherwise, it's a constant boolean value...
3033 return IC.ReplaceInstUsesWith(Log, RV);
3036 } // end anonymous namespace
3038 // OptAndOp - This handles expressions of the form ((val OP C1) & C2). Where
3039 // the Op parameter is 'OP', OpRHS is 'C1', and AndRHS is 'C2'. Op is
3040 // guaranteed to be a binary operator.
3041 Instruction *InstCombiner::OptAndOp(Instruction *Op,
3043 ConstantInt *AndRHS,
3044 BinaryOperator &TheAnd) {
3045 Value *X = Op->getOperand(0);
3046 Constant *Together = 0;
3048 Together = And(AndRHS, OpRHS);
3050 switch (Op->getOpcode()) {
3051 case Instruction::Xor:
3052 if (Op->hasOneUse()) {
3053 // (X ^ C1) & C2 --> (X & C2) ^ (C1&C2)
3054 Instruction *And = BinaryOperator::createAnd(X, AndRHS);
3055 InsertNewInstBefore(And, TheAnd);
3057 return BinaryOperator::createXor(And, Together);
3060 case Instruction::Or:
3061 if (Together == AndRHS) // (X | C) & C --> C
3062 return ReplaceInstUsesWith(TheAnd, AndRHS);
3064 if (Op->hasOneUse() && Together != OpRHS) {
3065 // (X | C1) & C2 --> (X | (C1&C2)) & C2
3066 Instruction *Or = BinaryOperator::createOr(X, Together);
3067 InsertNewInstBefore(Or, TheAnd);
3069 return BinaryOperator::createAnd(Or, AndRHS);
3072 case Instruction::Add:
3073 if (Op->hasOneUse()) {
3074 // Adding a one to a single bit bit-field should be turned into an XOR
3075 // of the bit. First thing to check is to see if this AND is with a
3076 // single bit constant.
3077 const APInt& AndRHSV = cast<ConstantInt>(AndRHS)->getValue();
3079 // If there is only one bit set...
3080 if (isOneBitSet(cast<ConstantInt>(AndRHS))) {
3081 // Ok, at this point, we know that we are masking the result of the
3082 // ADD down to exactly one bit. If the constant we are adding has
3083 // no bits set below this bit, then we can eliminate the ADD.
3084 const APInt& AddRHS = cast<ConstantInt>(OpRHS)->getValue();
3086 // Check to see if any bits below the one bit set in AndRHSV are set.
3087 if ((AddRHS & (AndRHSV-1)) == 0) {
3088 // If not, the only thing that can effect the output of the AND is
3089 // the bit specified by AndRHSV. If that bit is set, the effect of
3090 // the XOR is to toggle the bit. If it is clear, then the ADD has
3092 if ((AddRHS & AndRHSV) == 0) { // Bit is not set, noop
3093 TheAnd.setOperand(0, X);
3096 // Pull the XOR out of the AND.
3097 Instruction *NewAnd = BinaryOperator::createAnd(X, AndRHS);
3098 InsertNewInstBefore(NewAnd, TheAnd);
3099 NewAnd->takeName(Op);
3100 return BinaryOperator::createXor(NewAnd, AndRHS);
3107 case Instruction::Shl: {
3108 // We know that the AND will not produce any of the bits shifted in, so if
3109 // the anded constant includes them, clear them now!
3111 uint32_t BitWidth = AndRHS->getType()->getBitWidth();
3112 uint32_t OpRHSVal = OpRHS->getLimitedValue(BitWidth);
3113 APInt ShlMask(APInt::getHighBitsSet(BitWidth, BitWidth-OpRHSVal));
3114 ConstantInt *CI = ConstantInt::get(AndRHS->getValue() & ShlMask);
3116 if (CI->getValue() == ShlMask) {
3117 // Masking out bits that the shift already masks
3118 return ReplaceInstUsesWith(TheAnd, Op); // No need for the and.
3119 } else if (CI != AndRHS) { // Reducing bits set in and.
3120 TheAnd.setOperand(1, CI);
3125 case Instruction::LShr:
3127 // We know that the AND will not produce any of the bits shifted in, so if
3128 // the anded constant includes them, clear them now! This only applies to
3129 // unsigned shifts, because a signed shr may bring in set bits!
3131 uint32_t BitWidth = AndRHS->getType()->getBitWidth();
3132 uint32_t OpRHSVal = OpRHS->getLimitedValue(BitWidth);
3133 APInt ShrMask(APInt::getLowBitsSet(BitWidth, BitWidth - OpRHSVal));
3134 ConstantInt *CI = ConstantInt::get(AndRHS->getValue() & ShrMask);
3136 if (CI->getValue() == ShrMask) {
3137 // Masking out bits that the shift already masks.
3138 return ReplaceInstUsesWith(TheAnd, Op);
3139 } else if (CI != AndRHS) {
3140 TheAnd.setOperand(1, CI); // Reduce bits set in and cst.
3145 case Instruction::AShr:
3147 // See if this is shifting in some sign extension, then masking it out
3149 if (Op->hasOneUse()) {
3150 uint32_t BitWidth = AndRHS->getType()->getBitWidth();
3151 uint32_t OpRHSVal = OpRHS->getLimitedValue(BitWidth);
3152 APInt ShrMask(APInt::getLowBitsSet(BitWidth, BitWidth - OpRHSVal));
3153 Constant *C = ConstantInt::get(AndRHS->getValue() & ShrMask);
3154 if (C == AndRHS) { // Masking out bits shifted in.
3155 // (Val ashr C1) & C2 -> (Val lshr C1) & C2
3156 // Make the argument unsigned.
3157 Value *ShVal = Op->getOperand(0);
3158 ShVal = InsertNewInstBefore(
3159 BinaryOperator::createLShr(ShVal, OpRHS,
3160 Op->getName()), TheAnd);
3161 return BinaryOperator::createAnd(ShVal, AndRHS, TheAnd.getName());
3170 /// InsertRangeTest - Emit a computation of: (V >= Lo && V < Hi) if Inside is
3171 /// true, otherwise (V < Lo || V >= Hi). In pratice, we emit the more efficient
3172 /// (V-Lo) <u Hi-Lo. This method expects that Lo <= Hi. isSigned indicates
3173 /// whether to treat the V, Lo and HI as signed or not. IB is the location to
3174 /// insert new instructions.
3175 Instruction *InstCombiner::InsertRangeTest(Value *V, Constant *Lo, Constant *Hi,
3176 bool isSigned, bool Inside,
3178 assert(cast<ConstantInt>(ConstantExpr::getICmp((isSigned ?
3179 ICmpInst::ICMP_SLE:ICmpInst::ICMP_ULE), Lo, Hi))->getZExtValue() &&
3180 "Lo is not <= Hi in range emission code!");
3183 if (Lo == Hi) // Trivially false.
3184 return new ICmpInst(ICmpInst::ICMP_NE, V, V);
3186 // V >= Min && V < Hi --> V < Hi
3187 if (cast<ConstantInt>(Lo)->isMinValue(isSigned)) {
3188 ICmpInst::Predicate pred = (isSigned ?
3189 ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT);
3190 return new ICmpInst(pred, V, Hi);
3193 // Emit V-Lo <u Hi-Lo
3194 Constant *NegLo = ConstantExpr::getNeg(Lo);
3195 Instruction *Add = BinaryOperator::createAdd(V, NegLo, V->getName()+".off");
3196 InsertNewInstBefore(Add, IB);
3197 Constant *UpperBound = ConstantExpr::getAdd(NegLo, Hi);
3198 return new ICmpInst(ICmpInst::ICMP_ULT, Add, UpperBound);
3201 if (Lo == Hi) // Trivially true.
3202 return new ICmpInst(ICmpInst::ICMP_EQ, V, V);
3204 // V < Min || V >= Hi -> V > Hi-1
3205 Hi = SubOne(cast<ConstantInt>(Hi));
3206 if (cast<ConstantInt>(Lo)->isMinValue(isSigned)) {
3207 ICmpInst::Predicate pred = (isSigned ?
3208 ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT);
3209 return new ICmpInst(pred, V, Hi);
3212 // Emit V-Lo >u Hi-1-Lo
3213 // Note that Hi has already had one subtracted from it, above.
3214 ConstantInt *NegLo = cast<ConstantInt>(ConstantExpr::getNeg(Lo));
3215 Instruction *Add = BinaryOperator::createAdd(V, NegLo, V->getName()+".off");
3216 InsertNewInstBefore(Add, IB);
3217 Constant *LowerBound = ConstantExpr::getAdd(NegLo, Hi);
3218 return new ICmpInst(ICmpInst::ICMP_UGT, Add, LowerBound);
3221 // isRunOfOnes - Returns true iff Val consists of one contiguous run of 1s with
3222 // any number of 0s on either side. The 1s are allowed to wrap from LSB to
3223 // MSB, so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is
3224 // not, since all 1s are not contiguous.
3225 static bool isRunOfOnes(ConstantInt *Val, uint32_t &MB, uint32_t &ME) {
3226 const APInt& V = Val->getValue();
3227 uint32_t BitWidth = Val->getType()->getBitWidth();
3228 if (!APIntOps::isShiftedMask(BitWidth, V)) return false;
3230 // look for the first zero bit after the run of ones
3231 MB = BitWidth - ((V - 1) ^ V).countLeadingZeros();
3232 // look for the first non-zero bit
3233 ME = V.getActiveBits();
3237 /// FoldLogicalPlusAnd - This is part of an expression (LHS +/- RHS) & Mask,
3238 /// where isSub determines whether the operator is a sub. If we can fold one of
3239 /// the following xforms:
3241 /// ((A & N) +/- B) & Mask -> (A +/- B) & Mask iff N&Mask == Mask
3242 /// ((A | N) +/- B) & Mask -> (A +/- B) & Mask iff N&Mask == 0
3243 /// ((A ^ N) +/- B) & Mask -> (A +/- B) & Mask iff N&Mask == 0
3245 /// return (A +/- B).
3247 Value *InstCombiner::FoldLogicalPlusAnd(Value *LHS, Value *RHS,
3248 ConstantInt *Mask, bool isSub,
3250 Instruction *LHSI = dyn_cast<Instruction>(LHS);
3251 if (!LHSI || LHSI->getNumOperands() != 2 ||
3252 !isa<ConstantInt>(LHSI->getOperand(1))) return 0;
3254 ConstantInt *N = cast<ConstantInt>(LHSI->getOperand(1));
3256 switch (LHSI->getOpcode()) {
3258 case Instruction::And:
3259 if (And(N, Mask) == Mask) {
3260 // If the AndRHS is a power of two minus one (0+1+), this is simple.
3261 if ((Mask->getValue().countLeadingZeros() +
3262 Mask->getValue().countPopulation()) ==
3263 Mask->getValue().getBitWidth())
3266 // Otherwise, if Mask is 0+1+0+, and if B is known to have the low 0+
3267 // part, we don't need any explicit masks to take them out of A. If that
3268 // is all N is, ignore it.
3269 uint32_t MB = 0, ME = 0;
3270 if (isRunOfOnes(Mask, MB, ME)) { // begin/end bit of run, inclusive
3271 uint32_t BitWidth = cast<IntegerType>(RHS->getType())->getBitWidth();
3272 APInt Mask(APInt::getLowBitsSet(BitWidth, MB-1));
3273 if (MaskedValueIsZero(RHS, Mask))
3278 case Instruction::Or:
3279 case Instruction::Xor:
3280 // If the AndRHS is a power of two minus one (0+1+), and N&Mask == 0
3281 if ((Mask->getValue().countLeadingZeros() +
3282 Mask->getValue().countPopulation()) == Mask->getValue().getBitWidth()
3283 && And(N, Mask)->isZero())
3290 New = BinaryOperator::createSub(LHSI->getOperand(0), RHS, "fold");
3292 New = BinaryOperator::createAdd(LHSI->getOperand(0), RHS, "fold");
3293 return InsertNewInstBefore(New, I);
3296 Instruction *InstCombiner::visitAnd(BinaryOperator &I) {
3297 bool Changed = SimplifyCommutative(I);
3298 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3300 if (isa<UndefValue>(Op1)) // X & undef -> 0
3301 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
3305 return ReplaceInstUsesWith(I, Op1);
3307 // See if we can simplify any instructions used by the instruction whose sole
3308 // purpose is to compute bits we don't care about.
3309 if (!isa<VectorType>(I.getType())) {
3310 uint32_t BitWidth = cast<IntegerType>(I.getType())->getBitWidth();
3311 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
3312 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
3313 KnownZero, KnownOne))
3316 if (ConstantVector *CP = dyn_cast<ConstantVector>(Op1)) {
3317 if (CP->isAllOnesValue()) // X & <-1,-1> -> X
3318 return ReplaceInstUsesWith(I, I.getOperand(0));
3319 } else if (isa<ConstantAggregateZero>(Op1)) {
3320 return ReplaceInstUsesWith(I, Op1); // X & <0,0> -> <0,0>
3324 if (ConstantInt *AndRHS = dyn_cast<ConstantInt>(Op1)) {
3325 const APInt& AndRHSMask = AndRHS->getValue();
3326 APInt NotAndRHS(~AndRHSMask);
3328 // Optimize a variety of ((val OP C1) & C2) combinations...
3329 if (isa<BinaryOperator>(Op0)) {
3330 Instruction *Op0I = cast<Instruction>(Op0);
3331 Value *Op0LHS = Op0I->getOperand(0);
3332 Value *Op0RHS = Op0I->getOperand(1);
3333 switch (Op0I->getOpcode()) {
3334 case Instruction::Xor:
3335 case Instruction::Or:
3336 // If the mask is only needed on one incoming arm, push it up.
3337 if (Op0I->hasOneUse()) {
3338 if (MaskedValueIsZero(Op0LHS, NotAndRHS)) {
3339 // Not masking anything out for the LHS, move to RHS.
3340 Instruction *NewRHS = BinaryOperator::createAnd(Op0RHS, AndRHS,
3341 Op0RHS->getName()+".masked");
3342 InsertNewInstBefore(NewRHS, I);
3343 return BinaryOperator::create(
3344 cast<BinaryOperator>(Op0I)->getOpcode(), Op0LHS, NewRHS);
3346 if (!isa<Constant>(Op0RHS) &&
3347 MaskedValueIsZero(Op0RHS, NotAndRHS)) {
3348 // Not masking anything out for the RHS, move to LHS.
3349 Instruction *NewLHS = BinaryOperator::createAnd(Op0LHS, AndRHS,
3350 Op0LHS->getName()+".masked");
3351 InsertNewInstBefore(NewLHS, I);
3352 return BinaryOperator::create(
3353 cast<BinaryOperator>(Op0I)->getOpcode(), NewLHS, Op0RHS);
3358 case Instruction::Add:
3359 // ((A & N) + B) & AndRHS -> (A + B) & AndRHS iff N&AndRHS == AndRHS.
3360 // ((A | N) + B) & AndRHS -> (A + B) & AndRHS iff N&AndRHS == 0
3361 // ((A ^ N) + B) & AndRHS -> (A + B) & AndRHS iff N&AndRHS == 0
3362 if (Value *V = FoldLogicalPlusAnd(Op0LHS, Op0RHS, AndRHS, false, I))
3363 return BinaryOperator::createAnd(V, AndRHS);
3364 if (Value *V = FoldLogicalPlusAnd(Op0RHS, Op0LHS, AndRHS, false, I))
3365 return BinaryOperator::createAnd(V, AndRHS); // Add commutes
3368 case Instruction::Sub:
3369 // ((A & N) - B) & AndRHS -> (A - B) & AndRHS iff N&AndRHS == AndRHS.
3370 // ((A | N) - B) & AndRHS -> (A - B) & AndRHS iff N&AndRHS == 0
3371 // ((A ^ N) - B) & AndRHS -> (A - B) & AndRHS iff N&AndRHS == 0
3372 if (Value *V = FoldLogicalPlusAnd(Op0LHS, Op0RHS, AndRHS, true, I))
3373 return BinaryOperator::createAnd(V, AndRHS);
3377 if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1)))
3378 if (Instruction *Res = OptAndOp(Op0I, Op0CI, AndRHS, I))
3380 } else if (CastInst *CI = dyn_cast<CastInst>(Op0)) {
3381 // If this is an integer truncation or change from signed-to-unsigned, and
3382 // if the source is an and/or with immediate, transform it. This
3383 // frequently occurs for bitfield accesses.
3384 if (Instruction *CastOp = dyn_cast<Instruction>(CI->getOperand(0))) {
3385 if ((isa<TruncInst>(CI) || isa<BitCastInst>(CI)) &&
3386 CastOp->getNumOperands() == 2)
3387 if (ConstantInt *AndCI = dyn_cast<ConstantInt>(CastOp->getOperand(1)))
3388 if (CastOp->getOpcode() == Instruction::And) {
3389 // Change: and (cast (and X, C1) to T), C2
3390 // into : and (cast X to T), trunc_or_bitcast(C1)&C2
3391 // This will fold the two constants together, which may allow
3392 // other simplifications.
3393 Instruction *NewCast = CastInst::createTruncOrBitCast(
3394 CastOp->getOperand(0), I.getType(),
3395 CastOp->getName()+".shrunk");
3396 NewCast = InsertNewInstBefore(NewCast, I);
3397 // trunc_or_bitcast(C1)&C2
3398 Constant *C3 = ConstantExpr::getTruncOrBitCast(AndCI,I.getType());
3399 C3 = ConstantExpr::getAnd(C3, AndRHS);
3400 return BinaryOperator::createAnd(NewCast, C3);
3401 } else if (CastOp->getOpcode() == Instruction::Or) {
3402 // Change: and (cast (or X, C1) to T), C2
3403 // into : trunc(C1)&C2 iff trunc(C1)&C2 == C2
3404 Constant *C3 = ConstantExpr::getTruncOrBitCast(AndCI,I.getType());
3405 if (ConstantExpr::getAnd(C3, AndRHS) == AndRHS) // trunc(C1)&C2
3406 return ReplaceInstUsesWith(I, AndRHS);
3411 // Try to fold constant and into select arguments.
3412 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
3413 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
3415 if (isa<PHINode>(Op0))
3416 if (Instruction *NV = FoldOpIntoPhi(I))
3420 Value *Op0NotVal = dyn_castNotVal(Op0);
3421 Value *Op1NotVal = dyn_castNotVal(Op1);
3423 if (Op0NotVal == Op1 || Op1NotVal == Op0) // A & ~A == ~A & A == 0
3424 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
3426 // (~A & ~B) == (~(A | B)) - De Morgan's Law
3427 if (Op0NotVal && Op1NotVal && isOnlyUse(Op0) && isOnlyUse(Op1)) {
3428 Instruction *Or = BinaryOperator::createOr(Op0NotVal, Op1NotVal,
3429 I.getName()+".demorgan");
3430 InsertNewInstBefore(Or, I);
3431 return BinaryOperator::createNot(Or);
3435 Value *A = 0, *B = 0, *C = 0, *D = 0;
3436 if (match(Op0, m_Or(m_Value(A), m_Value(B)))) {
3437 if (A == Op1 || B == Op1) // (A | ?) & A --> A
3438 return ReplaceInstUsesWith(I, Op1);
3440 // (A|B) & ~(A&B) -> A^B
3441 if (match(Op1, m_Not(m_And(m_Value(C), m_Value(D))))) {
3442 if ((A == C && B == D) || (A == D && B == C))
3443 return BinaryOperator::createXor(A, B);
3447 if (match(Op1, m_Or(m_Value(A), m_Value(B)))) {
3448 if (A == Op0 || B == Op0) // A & (A | ?) --> A
3449 return ReplaceInstUsesWith(I, Op0);
3451 // ~(A&B) & (A|B) -> A^B
3452 if (match(Op0, m_Not(m_And(m_Value(C), m_Value(D))))) {
3453 if ((A == C && B == D) || (A == D && B == C))
3454 return BinaryOperator::createXor(A, B);
3458 if (Op0->hasOneUse() &&
3459 match(Op0, m_Xor(m_Value(A), m_Value(B)))) {
3460 if (A == Op1) { // (A^B)&A -> A&(A^B)
3461 I.swapOperands(); // Simplify below
3462 std::swap(Op0, Op1);
3463 } else if (B == Op1) { // (A^B)&B -> B&(B^A)
3464 cast<BinaryOperator>(Op0)->swapOperands();
3465 I.swapOperands(); // Simplify below
3466 std::swap(Op0, Op1);
3469 if (Op1->hasOneUse() &&
3470 match(Op1, m_Xor(m_Value(A), m_Value(B)))) {
3471 if (B == Op0) { // B&(A^B) -> B&(B^A)
3472 cast<BinaryOperator>(Op1)->swapOperands();
3475 if (A == Op0) { // A&(A^B) -> A & ~B
3476 Instruction *NotB = BinaryOperator::createNot(B, "tmp");
3477 InsertNewInstBefore(NotB, I);
3478 return BinaryOperator::createAnd(A, NotB);
3483 if (ICmpInst *RHS = dyn_cast<ICmpInst>(Op1)) {
3484 // (icmp1 A, B) & (icmp2 A, B) --> (icmp3 A, B)
3485 if (Instruction *R = AssociativeOpt(I, FoldICmpLogical(*this, RHS)))
3488 Value *LHSVal, *RHSVal;
3489 ConstantInt *LHSCst, *RHSCst;
3490 ICmpInst::Predicate LHSCC, RHSCC;
3491 if (match(Op0, m_ICmp(LHSCC, m_Value(LHSVal), m_ConstantInt(LHSCst))))
3492 if (match(RHS, m_ICmp(RHSCC, m_Value(RHSVal), m_ConstantInt(RHSCst))))
3493 if (LHSVal == RHSVal && // Found (X icmp C1) & (X icmp C2)
3494 // ICMP_[GL]E X, CST is folded to ICMP_[GL]T elsewhere.
3495 LHSCC != ICmpInst::ICMP_UGE && LHSCC != ICmpInst::ICMP_ULE &&
3496 RHSCC != ICmpInst::ICMP_UGE && RHSCC != ICmpInst::ICMP_ULE &&
3497 LHSCC != ICmpInst::ICMP_SGE && LHSCC != ICmpInst::ICMP_SLE &&
3498 RHSCC != ICmpInst::ICMP_SGE && RHSCC != ICmpInst::ICMP_SLE &&
3500 // Don't try to fold ICMP_SLT + ICMP_ULT.
3501 (ICmpInst::isEquality(LHSCC) || ICmpInst::isEquality(RHSCC) ||
3502 ICmpInst::isSignedPredicate(LHSCC) ==
3503 ICmpInst::isSignedPredicate(RHSCC))) {
3504 // Ensure that the larger constant is on the RHS.
3505 ICmpInst::Predicate GT;
3506 if (ICmpInst::isSignedPredicate(LHSCC) ||
3507 (ICmpInst::isEquality(LHSCC) &&
3508 ICmpInst::isSignedPredicate(RHSCC)))
3509 GT = ICmpInst::ICMP_SGT;
3511 GT = ICmpInst::ICMP_UGT;
3513 Constant *Cmp = ConstantExpr::getICmp(GT, LHSCst, RHSCst);
3514 ICmpInst *LHS = cast<ICmpInst>(Op0);
3515 if (cast<ConstantInt>(Cmp)->getZExtValue()) {
3516 std::swap(LHS, RHS);
3517 std::swap(LHSCst, RHSCst);
3518 std::swap(LHSCC, RHSCC);
3521 // At this point, we know we have have two icmp instructions
3522 // comparing a value against two constants and and'ing the result
3523 // together. Because of the above check, we know that we only have
3524 // icmp eq, icmp ne, icmp [su]lt, and icmp [SU]gt here. We also know
3525 // (from the FoldICmpLogical check above), that the two constants
3526 // are not equal and that the larger constant is on the RHS
3527 assert(LHSCst != RHSCst && "Compares not folded above?");
3530 default: assert(0 && "Unknown integer condition code!");
3531 case ICmpInst::ICMP_EQ:
3533 default: assert(0 && "Unknown integer condition code!");
3534 case ICmpInst::ICMP_EQ: // (X == 13 & X == 15) -> false
3535 case ICmpInst::ICMP_UGT: // (X == 13 & X > 15) -> false
3536 case ICmpInst::ICMP_SGT: // (X == 13 & X > 15) -> false
3537 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
3538 case ICmpInst::ICMP_NE: // (X == 13 & X != 15) -> X == 13
3539 case ICmpInst::ICMP_ULT: // (X == 13 & X < 15) -> X == 13
3540 case ICmpInst::ICMP_SLT: // (X == 13 & X < 15) -> X == 13
3541 return ReplaceInstUsesWith(I, LHS);
3543 case ICmpInst::ICMP_NE:
3545 default: assert(0 && "Unknown integer condition code!");
3546 case ICmpInst::ICMP_ULT:
3547 if (LHSCst == SubOne(RHSCst)) // (X != 13 & X u< 14) -> X < 13
3548 return new ICmpInst(ICmpInst::ICMP_ULT, LHSVal, LHSCst);
3549 break; // (X != 13 & X u< 15) -> no change
3550 case ICmpInst::ICMP_SLT:
3551 if (LHSCst == SubOne(RHSCst)) // (X != 13 & X s< 14) -> X < 13
3552 return new ICmpInst(ICmpInst::ICMP_SLT, LHSVal, LHSCst);
3553 break; // (X != 13 & X s< 15) -> no change
3554 case ICmpInst::ICMP_EQ: // (X != 13 & X == 15) -> X == 15
3555 case ICmpInst::ICMP_UGT: // (X != 13 & X u> 15) -> X u> 15
3556 case ICmpInst::ICMP_SGT: // (X != 13 & X s> 15) -> X s> 15
3557 return ReplaceInstUsesWith(I, RHS);
3558 case ICmpInst::ICMP_NE:
3559 if (LHSCst == SubOne(RHSCst)){// (X != 13 & X != 14) -> X-13 >u 1
3560 Constant *AddCST = ConstantExpr::getNeg(LHSCst);
3561 Instruction *Add = BinaryOperator::createAdd(LHSVal, AddCST,
3562 LHSVal->getName()+".off");
3563 InsertNewInstBefore(Add, I);
3564 return new ICmpInst(ICmpInst::ICMP_UGT, Add,
3565 ConstantInt::get(Add->getType(), 1));
3567 break; // (X != 13 & X != 15) -> no change
3570 case ICmpInst::ICMP_ULT:
3572 default: assert(0 && "Unknown integer condition code!");
3573 case ICmpInst::ICMP_EQ: // (X u< 13 & X == 15) -> false
3574 case ICmpInst::ICMP_UGT: // (X u< 13 & X u> 15) -> false
3575 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
3576 case ICmpInst::ICMP_SGT: // (X u< 13 & X s> 15) -> no change
3578 case ICmpInst::ICMP_NE: // (X u< 13 & X != 15) -> X u< 13
3579 case ICmpInst::ICMP_ULT: // (X u< 13 & X u< 15) -> X u< 13
3580 return ReplaceInstUsesWith(I, LHS);
3581 case ICmpInst::ICMP_SLT: // (X u< 13 & X s< 15) -> no change
3585 case ICmpInst::ICMP_SLT:
3587 default: assert(0 && "Unknown integer condition code!");
3588 case ICmpInst::ICMP_EQ: // (X s< 13 & X == 15) -> false
3589 case ICmpInst::ICMP_SGT: // (X s< 13 & X s> 15) -> false
3590 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
3591 case ICmpInst::ICMP_UGT: // (X s< 13 & X u> 15) -> no change
3593 case ICmpInst::ICMP_NE: // (X s< 13 & X != 15) -> X < 13
3594 case ICmpInst::ICMP_SLT: // (X s< 13 & X s< 15) -> X < 13
3595 return ReplaceInstUsesWith(I, LHS);
3596 case ICmpInst::ICMP_ULT: // (X s< 13 & X u< 15) -> no change
3600 case ICmpInst::ICMP_UGT:
3602 default: assert(0 && "Unknown integer condition code!");
3603 case ICmpInst::ICMP_EQ: // (X u> 13 & X == 15) -> X > 13
3604 return ReplaceInstUsesWith(I, LHS);
3605 case ICmpInst::ICMP_UGT: // (X u> 13 & X u> 15) -> X u> 15
3606 return ReplaceInstUsesWith(I, RHS);
3607 case ICmpInst::ICMP_SGT: // (X u> 13 & X s> 15) -> no change
3609 case ICmpInst::ICMP_NE:
3610 if (RHSCst == AddOne(LHSCst)) // (X u> 13 & X != 14) -> X u> 14
3611 return new ICmpInst(LHSCC, LHSVal, RHSCst);
3612 break; // (X u> 13 & X != 15) -> no change
3613 case ICmpInst::ICMP_ULT: // (X u> 13 & X u< 15) ->(X-14) <u 1
3614 return InsertRangeTest(LHSVal, AddOne(LHSCst), RHSCst, false,
3616 case ICmpInst::ICMP_SLT: // (X u> 13 & X s< 15) -> no change
3620 case ICmpInst::ICMP_SGT:
3622 default: assert(0 && "Unknown integer condition code!");
3623 case ICmpInst::ICMP_EQ: // (X s> 13 & X == 15) -> X == 15
3624 case ICmpInst::ICMP_SGT: // (X s> 13 & X s> 15) -> X s> 15
3625 return ReplaceInstUsesWith(I, RHS);
3626 case ICmpInst::ICMP_UGT: // (X s> 13 & X u> 15) -> no change
3628 case ICmpInst::ICMP_NE:
3629 if (RHSCst == AddOne(LHSCst)) // (X s> 13 & X != 14) -> X s> 14
3630 return new ICmpInst(LHSCC, LHSVal, RHSCst);
3631 break; // (X s> 13 & X != 15) -> no change
3632 case ICmpInst::ICMP_SLT: // (X s> 13 & X s< 15) ->(X-14) s< 1
3633 return InsertRangeTest(LHSVal, AddOne(LHSCst), RHSCst, true,
3635 case ICmpInst::ICMP_ULT: // (X s> 13 & X u< 15) -> no change
3643 // fold (and (cast A), (cast B)) -> (cast (and A, B))
3644 if (CastInst *Op0C = dyn_cast<CastInst>(Op0))
3645 if (CastInst *Op1C = dyn_cast<CastInst>(Op1))
3646 if (Op0C->getOpcode() == Op1C->getOpcode()) { // same cast kind ?
3647 const Type *SrcTy = Op0C->getOperand(0)->getType();
3648 if (SrcTy == Op1C->getOperand(0)->getType() && SrcTy->isInteger() &&
3649 // Only do this if the casts both really cause code to be generated.
3650 ValueRequiresCast(Op0C->getOpcode(), Op0C->getOperand(0),
3652 ValueRequiresCast(Op1C->getOpcode(), Op1C->getOperand(0),
3654 Instruction *NewOp = BinaryOperator::createAnd(Op0C->getOperand(0),
3655 Op1C->getOperand(0),
3657 InsertNewInstBefore(NewOp, I);
3658 return CastInst::create(Op0C->getOpcode(), NewOp, I.getType());
3662 // (X >> Z) & (Y >> Z) -> (X&Y) >> Z for all shifts.
3663 if (BinaryOperator *SI1 = dyn_cast<BinaryOperator>(Op1)) {
3664 if (BinaryOperator *SI0 = dyn_cast<BinaryOperator>(Op0))
3665 if (SI0->isShift() && SI0->getOpcode() == SI1->getOpcode() &&
3666 SI0->getOperand(1) == SI1->getOperand(1) &&
3667 (SI0->hasOneUse() || SI1->hasOneUse())) {
3668 Instruction *NewOp =
3669 InsertNewInstBefore(BinaryOperator::createAnd(SI0->getOperand(0),
3671 SI0->getName()), I);
3672 return BinaryOperator::create(SI1->getOpcode(), NewOp,
3673 SI1->getOperand(1));
3677 // (fcmp ord x, c) & (fcmp ord y, c) -> (fcmp ord x, y)
3678 if (FCmpInst *LHS = dyn_cast<FCmpInst>(I.getOperand(0))) {
3679 if (FCmpInst *RHS = dyn_cast<FCmpInst>(I.getOperand(1))) {
3680 if (LHS->getPredicate() == FCmpInst::FCMP_ORD &&
3681 RHS->getPredicate() == FCmpInst::FCMP_ORD)
3682 if (ConstantFP *LHSC = dyn_cast<ConstantFP>(LHS->getOperand(1)))
3683 if (ConstantFP *RHSC = dyn_cast<ConstantFP>(RHS->getOperand(1))) {
3684 // If either of the constants are nans, then the whole thing returns
3686 if (LHSC->getValueAPF().isNaN() || RHSC->getValueAPF().isNaN())
3687 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
3688 return new FCmpInst(FCmpInst::FCMP_ORD, LHS->getOperand(0),
3689 RHS->getOperand(0));
3694 return Changed ? &I : 0;
3697 /// CollectBSwapParts - Look to see if the specified value defines a single byte
3698 /// in the result. If it does, and if the specified byte hasn't been filled in
3699 /// yet, fill it in and return false.
3700 static bool CollectBSwapParts(Value *V, SmallVector<Value*, 8> &ByteValues) {
3701 Instruction *I = dyn_cast<Instruction>(V);
3702 if (I == 0) return true;
3704 // If this is an or instruction, it is an inner node of the bswap.
3705 if (I->getOpcode() == Instruction::Or)
3706 return CollectBSwapParts(I->getOperand(0), ByteValues) ||
3707 CollectBSwapParts(I->getOperand(1), ByteValues);
3709 uint32_t BitWidth = I->getType()->getPrimitiveSizeInBits();
3710 // If this is a shift by a constant int, and it is "24", then its operand
3711 // defines a byte. We only handle unsigned types here.
3712 if (I->isShift() && isa<ConstantInt>(I->getOperand(1))) {
3713 // Not shifting the entire input by N-1 bytes?
3714 if (cast<ConstantInt>(I->getOperand(1))->getLimitedValue(BitWidth) !=
3715 8*(ByteValues.size()-1))
3719 if (I->getOpcode() == Instruction::Shl) {
3720 // X << 24 defines the top byte with the lowest of the input bytes.
3721 DestNo = ByteValues.size()-1;
3723 // X >>u 24 defines the low byte with the highest of the input bytes.
3727 // If the destination byte value is already defined, the values are or'd
3728 // together, which isn't a bswap (unless it's an or of the same bits).
3729 if (ByteValues[DestNo] && ByteValues[DestNo] != I->getOperand(0))
3731 ByteValues[DestNo] = I->getOperand(0);
3735 // Otherwise, we can only handle and(shift X, imm), imm). Bail out of if we
3737 Value *Shift = 0, *ShiftLHS = 0;
3738 ConstantInt *AndAmt = 0, *ShiftAmt = 0;
3739 if (!match(I, m_And(m_Value(Shift), m_ConstantInt(AndAmt))) ||
3740 !match(Shift, m_Shift(m_Value(ShiftLHS), m_ConstantInt(ShiftAmt))))
3742 Instruction *SI = cast<Instruction>(Shift);
3744 // Make sure that the shift amount is by a multiple of 8 and isn't too big.
3745 if (ShiftAmt->getLimitedValue(BitWidth) & 7 ||
3746 ShiftAmt->getLimitedValue(BitWidth) > 8*ByteValues.size())
3749 // Turn 0xFF -> 0, 0xFF00 -> 1, 0xFF0000 -> 2, etc.
3751 if (AndAmt->getValue().getActiveBits() > 64)
3753 uint64_t AndAmtVal = AndAmt->getZExtValue();
3754 for (DestByte = 0; DestByte != ByteValues.size(); ++DestByte)
3755 if (AndAmtVal == uint64_t(0xFF) << 8*DestByte)
3757 // Unknown mask for bswap.
3758 if (DestByte == ByteValues.size()) return true;
3760 unsigned ShiftBytes = ShiftAmt->getZExtValue()/8;
3762 if (SI->getOpcode() == Instruction::Shl)
3763 SrcByte = DestByte - ShiftBytes;
3765 SrcByte = DestByte + ShiftBytes;
3767 // If the SrcByte isn't a bswapped value from the DestByte, reject it.
3768 if (SrcByte != ByteValues.size()-DestByte-1)
3771 // If the destination byte value is already defined, the values are or'd
3772 // together, which isn't a bswap (unless it's an or of the same bits).
3773 if (ByteValues[DestByte] && ByteValues[DestByte] != SI->getOperand(0))
3775 ByteValues[DestByte] = SI->getOperand(0);
3779 /// MatchBSwap - Given an OR instruction, check to see if this is a bswap idiom.
3780 /// If so, insert the new bswap intrinsic and return it.
3781 Instruction *InstCombiner::MatchBSwap(BinaryOperator &I) {
3782 const IntegerType *ITy = dyn_cast<IntegerType>(I.getType());
3783 if (!ITy || ITy->getBitWidth() % 16)
3784 return 0; // Can only bswap pairs of bytes. Can't do vectors.
3786 /// ByteValues - For each byte of the result, we keep track of which value
3787 /// defines each byte.
3788 SmallVector<Value*, 8> ByteValues;
3789 ByteValues.resize(ITy->getBitWidth()/8);
3791 // Try to find all the pieces corresponding to the bswap.
3792 if (CollectBSwapParts(I.getOperand(0), ByteValues) ||
3793 CollectBSwapParts(I.getOperand(1), ByteValues))
3796 // Check to see if all of the bytes come from the same value.
3797 Value *V = ByteValues[0];
3798 if (V == 0) return 0; // Didn't find a byte? Must be zero.
3800 // Check to make sure that all of the bytes come from the same value.
3801 for (unsigned i = 1, e = ByteValues.size(); i != e; ++i)
3802 if (ByteValues[i] != V)
3804 const Type *Tys[] = { ITy };
3805 Module *M = I.getParent()->getParent()->getParent();
3806 Function *F = Intrinsic::getDeclaration(M, Intrinsic::bswap, Tys, 1);
3807 return new CallInst(F, V);
3811 Instruction *InstCombiner::visitOr(BinaryOperator &I) {
3812 bool Changed = SimplifyCommutative(I);
3813 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3815 if (isa<UndefValue>(Op1)) // X | undef -> -1
3816 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
3820 return ReplaceInstUsesWith(I, Op0);
3822 // See if we can simplify any instructions used by the instruction whose sole
3823 // purpose is to compute bits we don't care about.
3824 if (!isa<VectorType>(I.getType())) {
3825 uint32_t BitWidth = cast<IntegerType>(I.getType())->getBitWidth();
3826 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
3827 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
3828 KnownZero, KnownOne))
3830 } else if (isa<ConstantAggregateZero>(Op1)) {
3831 return ReplaceInstUsesWith(I, Op0); // X | <0,0> -> X
3832 } else if (ConstantVector *CP = dyn_cast<ConstantVector>(Op1)) {
3833 if (CP->isAllOnesValue()) // X | <-1,-1> -> <-1,-1>
3834 return ReplaceInstUsesWith(I, I.getOperand(1));
3840 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
3841 ConstantInt *C1 = 0; Value *X = 0;
3842 // (X & C1) | C2 --> (X | C2) & (C1|C2)
3843 if (match(Op0, m_And(m_Value(X), m_ConstantInt(C1))) && isOnlyUse(Op0)) {
3844 Instruction *Or = BinaryOperator::createOr(X, RHS);
3845 InsertNewInstBefore(Or, I);
3847 return BinaryOperator::createAnd(Or,
3848 ConstantInt::get(RHS->getValue() | C1->getValue()));
3851 // (X ^ C1) | C2 --> (X | C2) ^ (C1&~C2)
3852 if (match(Op0, m_Xor(m_Value(X), m_ConstantInt(C1))) && isOnlyUse(Op0)) {
3853 Instruction *Or = BinaryOperator::createOr(X, RHS);
3854 InsertNewInstBefore(Or, I);
3856 return BinaryOperator::createXor(Or,
3857 ConstantInt::get(C1->getValue() & ~RHS->getValue()));
3860 // Try to fold constant and into select arguments.
3861 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
3862 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
3864 if (isa<PHINode>(Op0))
3865 if (Instruction *NV = FoldOpIntoPhi(I))
3869 Value *A = 0, *B = 0;
3870 ConstantInt *C1 = 0, *C2 = 0;
3872 if (match(Op0, m_And(m_Value(A), m_Value(B))))
3873 if (A == Op1 || B == Op1) // (A & ?) | A --> A
3874 return ReplaceInstUsesWith(I, Op1);
3875 if (match(Op1, m_And(m_Value(A), m_Value(B))))
3876 if (A == Op0 || B == Op0) // A | (A & ?) --> A
3877 return ReplaceInstUsesWith(I, Op0);
3879 // (A | B) | C and A | (B | C) -> bswap if possible.
3880 // (A >> B) | (C << D) and (A << B) | (B >> C) -> bswap if possible.
3881 if (match(Op0, m_Or(m_Value(), m_Value())) ||
3882 match(Op1, m_Or(m_Value(), m_Value())) ||
3883 (match(Op0, m_Shift(m_Value(), m_Value())) &&
3884 match(Op1, m_Shift(m_Value(), m_Value())))) {
3885 if (Instruction *BSwap = MatchBSwap(I))
3889 // (X^C)|Y -> (X|Y)^C iff Y&C == 0
3890 if (Op0->hasOneUse() && match(Op0, m_Xor(m_Value(A), m_ConstantInt(C1))) &&
3891 MaskedValueIsZero(Op1, C1->getValue())) {
3892 Instruction *NOr = BinaryOperator::createOr(A, Op1);
3893 InsertNewInstBefore(NOr, I);
3895 return BinaryOperator::createXor(NOr, C1);
3898 // Y|(X^C) -> (X|Y)^C iff Y&C == 0
3899 if (Op1->hasOneUse() && match(Op1, m_Xor(m_Value(A), m_ConstantInt(C1))) &&
3900 MaskedValueIsZero(Op0, C1->getValue())) {
3901 Instruction *NOr = BinaryOperator::createOr(A, Op0);
3902 InsertNewInstBefore(NOr, I);
3904 return BinaryOperator::createXor(NOr, C1);
3908 Value *C = 0, *D = 0;
3909 if (match(Op0, m_And(m_Value(A), m_Value(C))) &&
3910 match(Op1, m_And(m_Value(B), m_Value(D)))) {
3911 Value *V1 = 0, *V2 = 0, *V3 = 0;
3912 C1 = dyn_cast<ConstantInt>(C);
3913 C2 = dyn_cast<ConstantInt>(D);
3914 if (C1 && C2) { // (A & C1)|(B & C2)
3915 // If we have: ((V + N) & C1) | (V & C2)
3916 // .. and C2 = ~C1 and C2 is 0+1+ and (N & C2) == 0
3917 // replace with V+N.
3918 if (C1->getValue() == ~C2->getValue()) {
3919 if ((C2->getValue() & (C2->getValue()+1)) == 0 && // C2 == 0+1+
3920 match(A, m_Add(m_Value(V1), m_Value(V2)))) {
3921 // Add commutes, try both ways.
3922 if (V1 == B && MaskedValueIsZero(V2, C2->getValue()))
3923 return ReplaceInstUsesWith(I, A);
3924 if (V2 == B && MaskedValueIsZero(V1, C2->getValue()))
3925 return ReplaceInstUsesWith(I, A);
3927 // Or commutes, try both ways.
3928 if ((C1->getValue() & (C1->getValue()+1)) == 0 &&
3929 match(B, m_Add(m_Value(V1), m_Value(V2)))) {
3930 // Add commutes, try both ways.
3931 if (V1 == A && MaskedValueIsZero(V2, C1->getValue()))
3932 return ReplaceInstUsesWith(I, B);
3933 if (V2 == A && MaskedValueIsZero(V1, C1->getValue()))
3934 return ReplaceInstUsesWith(I, B);
3937 V1 = 0; V2 = 0; V3 = 0;
3940 // Check to see if we have any common things being and'ed. If so, find the
3941 // terms for V1 & (V2|V3).
3942 if (isOnlyUse(Op0) || isOnlyUse(Op1)) {
3943 if (A == B) // (A & C)|(A & D) == A & (C|D)
3944 V1 = A, V2 = C, V3 = D;
3945 else if (A == D) // (A & C)|(B & A) == A & (B|C)
3946 V1 = A, V2 = B, V3 = C;
3947 else if (C == B) // (A & C)|(C & D) == C & (A|D)
3948 V1 = C, V2 = A, V3 = D;
3949 else if (C == D) // (A & C)|(B & C) == C & (A|B)
3950 V1 = C, V2 = A, V3 = B;
3954 InsertNewInstBefore(BinaryOperator::createOr(V2, V3, "tmp"), I);
3955 return BinaryOperator::createAnd(V1, Or);
3960 // (X >> Z) | (Y >> Z) -> (X|Y) >> Z for all shifts.
3961 if (BinaryOperator *SI1 = dyn_cast<BinaryOperator>(Op1)) {
3962 if (BinaryOperator *SI0 = dyn_cast<BinaryOperator>(Op0))
3963 if (SI0->isShift() && SI0->getOpcode() == SI1->getOpcode() &&
3964 SI0->getOperand(1) == SI1->getOperand(1) &&
3965 (SI0->hasOneUse() || SI1->hasOneUse())) {
3966 Instruction *NewOp =
3967 InsertNewInstBefore(BinaryOperator::createOr(SI0->getOperand(0),
3969 SI0->getName()), I);
3970 return BinaryOperator::create(SI1->getOpcode(), NewOp,
3971 SI1->getOperand(1));
3975 if (match(Op0, m_Not(m_Value(A)))) { // ~A | Op1
3976 if (A == Op1) // ~A | A == -1
3977 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
3981 // Note, A is still live here!
3982 if (match(Op1, m_Not(m_Value(B)))) { // Op0 | ~B
3984 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
3986 // (~A | ~B) == (~(A & B)) - De Morgan's Law
3987 if (A && isOnlyUse(Op0) && isOnlyUse(Op1)) {
3988 Value *And = InsertNewInstBefore(BinaryOperator::createAnd(A, B,
3989 I.getName()+".demorgan"), I);
3990 return BinaryOperator::createNot(And);
3994 // (icmp1 A, B) | (icmp2 A, B) --> (icmp3 A, B)
3995 if (ICmpInst *RHS = dyn_cast<ICmpInst>(I.getOperand(1))) {
3996 if (Instruction *R = AssociativeOpt(I, FoldICmpLogical(*this, RHS)))
3999 Value *LHSVal, *RHSVal;
4000 ConstantInt *LHSCst, *RHSCst;
4001 ICmpInst::Predicate LHSCC, RHSCC;
4002 if (match(Op0, m_ICmp(LHSCC, m_Value(LHSVal), m_ConstantInt(LHSCst))))
4003 if (match(RHS, m_ICmp(RHSCC, m_Value(RHSVal), m_ConstantInt(RHSCst))))
4004 if (LHSVal == RHSVal && // Found (X icmp C1) | (X icmp C2)
4005 // icmp [us][gl]e x, cst is folded to icmp [us][gl]t elsewhere.
4006 LHSCC != ICmpInst::ICMP_UGE && LHSCC != ICmpInst::ICMP_ULE &&
4007 RHSCC != ICmpInst::ICMP_UGE && RHSCC != ICmpInst::ICMP_ULE &&
4008 LHSCC != ICmpInst::ICMP_SGE && LHSCC != ICmpInst::ICMP_SLE &&
4009 RHSCC != ICmpInst::ICMP_SGE && RHSCC != ICmpInst::ICMP_SLE &&
4010 // We can't fold (ugt x, C) | (sgt x, C2).
4011 PredicatesFoldable(LHSCC, RHSCC)) {
4012 // Ensure that the larger constant is on the RHS.
4013 ICmpInst *LHS = cast<ICmpInst>(Op0);
4015 if (ICmpInst::isSignedPredicate(LHSCC))
4016 NeedsSwap = LHSCst->getValue().sgt(RHSCst->getValue());
4018 NeedsSwap = LHSCst->getValue().ugt(RHSCst->getValue());
4021 std::swap(LHS, RHS);
4022 std::swap(LHSCst, RHSCst);
4023 std::swap(LHSCC, RHSCC);
4026 // At this point, we know we have have two icmp instructions
4027 // comparing a value against two constants and or'ing the result
4028 // together. Because of the above check, we know that we only have
4029 // ICMP_EQ, ICMP_NE, ICMP_LT, and ICMP_GT here. We also know (from the
4030 // FoldICmpLogical check above), that the two constants are not
4032 assert(LHSCst != RHSCst && "Compares not folded above?");
4035 default: assert(0 && "Unknown integer condition code!");
4036 case ICmpInst::ICMP_EQ:
4038 default: assert(0 && "Unknown integer condition code!");
4039 case ICmpInst::ICMP_EQ:
4040 if (LHSCst == SubOne(RHSCst)) {// (X == 13 | X == 14) -> X-13 <u 2
4041 Constant *AddCST = ConstantExpr::getNeg(LHSCst);
4042 Instruction *Add = BinaryOperator::createAdd(LHSVal, AddCST,
4043 LHSVal->getName()+".off");
4044 InsertNewInstBefore(Add, I);
4045 AddCST = Subtract(AddOne(RHSCst), LHSCst);
4046 return new ICmpInst(ICmpInst::ICMP_ULT, Add, AddCST);
4048 break; // (X == 13 | X == 15) -> no change
4049 case ICmpInst::ICMP_UGT: // (X == 13 | X u> 14) -> no change
4050 case ICmpInst::ICMP_SGT: // (X == 13 | X s> 14) -> no change
4052 case ICmpInst::ICMP_NE: // (X == 13 | X != 15) -> X != 15
4053 case ICmpInst::ICMP_ULT: // (X == 13 | X u< 15) -> X u< 15
4054 case ICmpInst::ICMP_SLT: // (X == 13 | X s< 15) -> X s< 15
4055 return ReplaceInstUsesWith(I, RHS);
4058 case ICmpInst::ICMP_NE:
4060 default: assert(0 && "Unknown integer condition code!");
4061 case ICmpInst::ICMP_EQ: // (X != 13 | X == 15) -> X != 13
4062 case ICmpInst::ICMP_UGT: // (X != 13 | X u> 15) -> X != 13
4063 case ICmpInst::ICMP_SGT: // (X != 13 | X s> 15) -> X != 13
4064 return ReplaceInstUsesWith(I, LHS);
4065 case ICmpInst::ICMP_NE: // (X != 13 | X != 15) -> true
4066 case ICmpInst::ICMP_ULT: // (X != 13 | X u< 15) -> true
4067 case ICmpInst::ICMP_SLT: // (X != 13 | X s< 15) -> true
4068 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4071 case ICmpInst::ICMP_ULT:
4073 default: assert(0 && "Unknown integer condition code!");
4074 case ICmpInst::ICMP_EQ: // (X u< 13 | X == 14) -> no change
4076 case ICmpInst::ICMP_UGT: // (X u< 13 | X u> 15) ->(X-13) u> 2
4077 // If RHSCst is [us]MAXINT, it is always false. Not handling
4078 // this can cause overflow.
4079 if (RHSCst->isMaxValue(false))
4080 return ReplaceInstUsesWith(I, LHS);
4081 return InsertRangeTest(LHSVal, LHSCst, AddOne(RHSCst), false,
4083 case ICmpInst::ICMP_SGT: // (X u< 13 | X s> 15) -> no change
4085 case ICmpInst::ICMP_NE: // (X u< 13 | X != 15) -> X != 15
4086 case ICmpInst::ICMP_ULT: // (X u< 13 | X u< 15) -> X u< 15
4087 return ReplaceInstUsesWith(I, RHS);
4088 case ICmpInst::ICMP_SLT: // (X u< 13 | X s< 15) -> no change
4092 case ICmpInst::ICMP_SLT:
4094 default: assert(0 && "Unknown integer condition code!");
4095 case ICmpInst::ICMP_EQ: // (X s< 13 | X == 14) -> no change
4097 case ICmpInst::ICMP_SGT: // (X s< 13 | X s> 15) ->(X-13) s> 2
4098 // If RHSCst is [us]MAXINT, it is always false. Not handling
4099 // this can cause overflow.
4100 if (RHSCst->isMaxValue(true))
4101 return ReplaceInstUsesWith(I, LHS);
4102 return InsertRangeTest(LHSVal, LHSCst, AddOne(RHSCst), true,
4104 case ICmpInst::ICMP_UGT: // (X s< 13 | X u> 15) -> no change
4106 case ICmpInst::ICMP_NE: // (X s< 13 | X != 15) -> X != 15
4107 case ICmpInst::ICMP_SLT: // (X s< 13 | X s< 15) -> X s< 15
4108 return ReplaceInstUsesWith(I, RHS);
4109 case ICmpInst::ICMP_ULT: // (X s< 13 | X u< 15) -> no change
4113 case ICmpInst::ICMP_UGT:
4115 default: assert(0 && "Unknown integer condition code!");
4116 case ICmpInst::ICMP_EQ: // (X u> 13 | X == 15) -> X u> 13
4117 case ICmpInst::ICMP_UGT: // (X u> 13 | X u> 15) -> X u> 13
4118 return ReplaceInstUsesWith(I, LHS);
4119 case ICmpInst::ICMP_SGT: // (X u> 13 | X s> 15) -> no change
4121 case ICmpInst::ICMP_NE: // (X u> 13 | X != 15) -> true
4122 case ICmpInst::ICMP_ULT: // (X u> 13 | X u< 15) -> true
4123 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4124 case ICmpInst::ICMP_SLT: // (X u> 13 | X s< 15) -> no change
4128 case ICmpInst::ICMP_SGT:
4130 default: assert(0 && "Unknown integer condition code!");
4131 case ICmpInst::ICMP_EQ: // (X s> 13 | X == 15) -> X > 13
4132 case ICmpInst::ICMP_SGT: // (X s> 13 | X s> 15) -> X > 13
4133 return ReplaceInstUsesWith(I, LHS);
4134 case ICmpInst::ICMP_UGT: // (X s> 13 | X u> 15) -> no change
4136 case ICmpInst::ICMP_NE: // (X s> 13 | X != 15) -> true
4137 case ICmpInst::ICMP_SLT: // (X s> 13 | X s< 15) -> true
4138 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4139 case ICmpInst::ICMP_ULT: // (X s> 13 | X u< 15) -> no change
4147 // fold (or (cast A), (cast B)) -> (cast (or A, B))
4148 if (CastInst *Op0C = dyn_cast<CastInst>(Op0)) {
4149 if (CastInst *Op1C = dyn_cast<CastInst>(Op1))
4150 if (Op0C->getOpcode() == Op1C->getOpcode()) {// same cast kind ?
4151 const Type *SrcTy = Op0C->getOperand(0)->getType();
4152 if (SrcTy == Op1C->getOperand(0)->getType() && SrcTy->isInteger() &&
4153 // Only do this if the casts both really cause code to be generated.
4154 ValueRequiresCast(Op0C->getOpcode(), Op0C->getOperand(0),
4156 ValueRequiresCast(Op1C->getOpcode(), Op1C->getOperand(0),
4158 Instruction *NewOp = BinaryOperator::createOr(Op0C->getOperand(0),
4159 Op1C->getOperand(0),
4161 InsertNewInstBefore(NewOp, I);
4162 return CastInst::create(Op0C->getOpcode(), NewOp, I.getType());
4168 // (fcmp uno x, c) | (fcmp uno y, c) -> (fcmp uno x, y)
4169 if (FCmpInst *LHS = dyn_cast<FCmpInst>(I.getOperand(0))) {
4170 if (FCmpInst *RHS = dyn_cast<FCmpInst>(I.getOperand(1))) {
4171 if (LHS->getPredicate() == FCmpInst::FCMP_UNO &&
4172 RHS->getPredicate() == FCmpInst::FCMP_UNO)
4173 if (ConstantFP *LHSC = dyn_cast<ConstantFP>(LHS->getOperand(1)))
4174 if (ConstantFP *RHSC = dyn_cast<ConstantFP>(RHS->getOperand(1))) {
4175 // If either of the constants are nans, then the whole thing returns
4177 if (LHSC->getValueAPF().isNaN() || RHSC->getValueAPF().isNaN())
4178 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4180 // Otherwise, no need to compare the two constants, compare the
4182 return new FCmpInst(FCmpInst::FCMP_UNO, LHS->getOperand(0),
4183 RHS->getOperand(0));
4188 return Changed ? &I : 0;
4191 // XorSelf - Implements: X ^ X --> 0
4194 XorSelf(Value *rhs) : RHS(rhs) {}
4195 bool shouldApply(Value *LHS) const { return LHS == RHS; }
4196 Instruction *apply(BinaryOperator &Xor) const {
4202 Instruction *InstCombiner::visitXor(BinaryOperator &I) {
4203 bool Changed = SimplifyCommutative(I);
4204 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
4206 if (isa<UndefValue>(Op1))
4207 return ReplaceInstUsesWith(I, Op1); // X ^ undef -> undef
4209 // xor X, X = 0, even if X is nested in a sequence of Xor's.
4210 if (Instruction *Result = AssociativeOpt(I, XorSelf(Op1))) {
4211 assert(Result == &I && "AssociativeOpt didn't work?"); Result=Result;
4212 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
4215 // See if we can simplify any instructions used by the instruction whose sole
4216 // purpose is to compute bits we don't care about.
4217 if (!isa<VectorType>(I.getType())) {
4218 uint32_t BitWidth = cast<IntegerType>(I.getType())->getBitWidth();
4219 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
4220 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
4221 KnownZero, KnownOne))
4223 } else if (isa<ConstantAggregateZero>(Op1)) {
4224 return ReplaceInstUsesWith(I, Op0); // X ^ <0,0> -> X
4227 // Is this a ~ operation?
4228 if (Value *NotOp = dyn_castNotVal(&I)) {
4229 // ~(~X & Y) --> (X | ~Y) - De Morgan's Law
4230 // ~(~X | Y) === (X & ~Y) - De Morgan's Law
4231 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(NotOp)) {
4232 if (Op0I->getOpcode() == Instruction::And ||
4233 Op0I->getOpcode() == Instruction::Or) {
4234 if (dyn_castNotVal(Op0I->getOperand(1))) Op0I->swapOperands();
4235 if (Value *Op0NotVal = dyn_castNotVal(Op0I->getOperand(0))) {
4237 BinaryOperator::createNot(Op0I->getOperand(1),
4238 Op0I->getOperand(1)->getName()+".not");
4239 InsertNewInstBefore(NotY, I);
4240 if (Op0I->getOpcode() == Instruction::And)
4241 return BinaryOperator::createOr(Op0NotVal, NotY);
4243 return BinaryOperator::createAnd(Op0NotVal, NotY);
4250 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
4251 // xor (cmp A, B), true = not (cmp A, B) = !cmp A, B
4252 if (RHS == ConstantInt::getTrue() && Op0->hasOneUse()) {
4253 if (ICmpInst *ICI = dyn_cast<ICmpInst>(Op0))
4254 return new ICmpInst(ICI->getInversePredicate(),
4255 ICI->getOperand(0), ICI->getOperand(1));
4257 if (FCmpInst *FCI = dyn_cast<FCmpInst>(Op0))
4258 return new FCmpInst(FCI->getInversePredicate(),
4259 FCI->getOperand(0), FCI->getOperand(1));
4262 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0)) {
4263 // ~(c-X) == X-c-1 == X+(-c-1)
4264 if (Op0I->getOpcode() == Instruction::Sub && RHS->isAllOnesValue())
4265 if (Constant *Op0I0C = dyn_cast<Constant>(Op0I->getOperand(0))) {
4266 Constant *NegOp0I0C = ConstantExpr::getNeg(Op0I0C);
4267 Constant *ConstantRHS = ConstantExpr::getSub(NegOp0I0C,
4268 ConstantInt::get(I.getType(), 1));
4269 return BinaryOperator::createAdd(Op0I->getOperand(1), ConstantRHS);
4272 if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1)))
4273 if (Op0I->getOpcode() == Instruction::Add) {
4274 // ~(X-c) --> (-c-1)-X
4275 if (RHS->isAllOnesValue()) {
4276 Constant *NegOp0CI = ConstantExpr::getNeg(Op0CI);
4277 return BinaryOperator::createSub(
4278 ConstantExpr::getSub(NegOp0CI,
4279 ConstantInt::get(I.getType(), 1)),
4280 Op0I->getOperand(0));
4281 } else if (RHS->getValue().isSignBit()) {
4282 // (X + C) ^ signbit -> (X + C + signbit)
4283 Constant *C = ConstantInt::get(RHS->getValue() + Op0CI->getValue());
4284 return BinaryOperator::createAdd(Op0I->getOperand(0), C);
4287 } else if (Op0I->getOpcode() == Instruction::Or) {
4288 // (X|C1)^C2 -> X^(C1|C2) iff X&~C1 == 0
4289 if (MaskedValueIsZero(Op0I->getOperand(0), Op0CI->getValue())) {
4290 Constant *NewRHS = ConstantExpr::getOr(Op0CI, RHS);
4291 // Anything in both C1 and C2 is known to be zero, remove it from
4293 Constant *CommonBits = And(Op0CI, RHS);
4294 NewRHS = ConstantExpr::getAnd(NewRHS,
4295 ConstantExpr::getNot(CommonBits));
4296 AddToWorkList(Op0I);
4297 I.setOperand(0, Op0I->getOperand(0));
4298 I.setOperand(1, NewRHS);
4304 // Try to fold constant and into select arguments.
4305 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
4306 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
4308 if (isa<PHINode>(Op0))
4309 if (Instruction *NV = FoldOpIntoPhi(I))
4313 if (Value *X = dyn_castNotVal(Op0)) // ~A ^ A == -1
4315 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
4317 if (Value *X = dyn_castNotVal(Op1)) // A ^ ~A == -1
4319 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
4322 BinaryOperator *Op1I = dyn_cast<BinaryOperator>(Op1);
4325 if (match(Op1I, m_Or(m_Value(A), m_Value(B)))) {
4326 if (A == Op0) { // B^(B|A) == (A|B)^B
4327 Op1I->swapOperands();
4329 std::swap(Op0, Op1);
4330 } else if (B == Op0) { // B^(A|B) == (A|B)^B
4331 I.swapOperands(); // Simplified below.
4332 std::swap(Op0, Op1);
4334 } else if (match(Op1I, m_Xor(m_Value(A), m_Value(B)))) {
4335 if (Op0 == A) // A^(A^B) == B
4336 return ReplaceInstUsesWith(I, B);
4337 else if (Op0 == B) // A^(B^A) == B
4338 return ReplaceInstUsesWith(I, A);
4339 } else if (match(Op1I, m_And(m_Value(A), m_Value(B))) && Op1I->hasOneUse()){
4340 if (A == Op0) { // A^(A&B) -> A^(B&A)
4341 Op1I->swapOperands();
4344 if (B == Op0) { // A^(B&A) -> (B&A)^A
4345 I.swapOperands(); // Simplified below.
4346 std::swap(Op0, Op1);
4351 BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0);
4354 if (match(Op0I, m_Or(m_Value(A), m_Value(B))) && Op0I->hasOneUse()) {
4355 if (A == Op1) // (B|A)^B == (A|B)^B
4357 if (B == Op1) { // (A|B)^B == A & ~B
4359 InsertNewInstBefore(BinaryOperator::createNot(Op1, "tmp"), I);
4360 return BinaryOperator::createAnd(A, NotB);
4362 } else if (match(Op0I, m_Xor(m_Value(A), m_Value(B)))) {
4363 if (Op1 == A) // (A^B)^A == B
4364 return ReplaceInstUsesWith(I, B);
4365 else if (Op1 == B) // (B^A)^A == B
4366 return ReplaceInstUsesWith(I, A);
4367 } else if (match(Op0I, m_And(m_Value(A), m_Value(B))) && Op0I->hasOneUse()){
4368 if (A == Op1) // (A&B)^A -> (B&A)^A
4370 if (B == Op1 && // (B&A)^A == ~B & A
4371 !isa<ConstantInt>(Op1)) { // Canonical form is (B&C)^C
4373 InsertNewInstBefore(BinaryOperator::createNot(A, "tmp"), I);
4374 return BinaryOperator::createAnd(N, Op1);
4379 // (X >> Z) ^ (Y >> Z) -> (X^Y) >> Z for all shifts.
4380 if (Op0I && Op1I && Op0I->isShift() &&
4381 Op0I->getOpcode() == Op1I->getOpcode() &&
4382 Op0I->getOperand(1) == Op1I->getOperand(1) &&
4383 (Op1I->hasOneUse() || Op1I->hasOneUse())) {
4384 Instruction *NewOp =
4385 InsertNewInstBefore(BinaryOperator::createXor(Op0I->getOperand(0),
4386 Op1I->getOperand(0),
4387 Op0I->getName()), I);
4388 return BinaryOperator::create(Op1I->getOpcode(), NewOp,
4389 Op1I->getOperand(1));
4393 Value *A, *B, *C, *D;
4394 // (A & B)^(A | B) -> A ^ B
4395 if (match(Op0I, m_And(m_Value(A), m_Value(B))) &&
4396 match(Op1I, m_Or(m_Value(C), m_Value(D)))) {
4397 if ((A == C && B == D) || (A == D && B == C))
4398 return BinaryOperator::createXor(A, B);
4400 // (A | B)^(A & B) -> A ^ B
4401 if (match(Op0I, m_Or(m_Value(A), m_Value(B))) &&
4402 match(Op1I, m_And(m_Value(C), m_Value(D)))) {
4403 if ((A == C && B == D) || (A == D && B == C))
4404 return BinaryOperator::createXor(A, B);
4408 if ((Op0I->hasOneUse() || Op1I->hasOneUse()) &&
4409 match(Op0I, m_And(m_Value(A), m_Value(B))) &&
4410 match(Op1I, m_And(m_Value(C), m_Value(D)))) {
4411 // (X & Y)^(X & Y) -> (Y^Z) & X
4412 Value *X = 0, *Y = 0, *Z = 0;
4414 X = A, Y = B, Z = D;
4416 X = A, Y = B, Z = C;
4418 X = B, Y = A, Z = D;
4420 X = B, Y = A, Z = C;
4423 Instruction *NewOp =
4424 InsertNewInstBefore(BinaryOperator::createXor(Y, Z, Op0->getName()), I);
4425 return BinaryOperator::createAnd(NewOp, X);
4430 // (icmp1 A, B) ^ (icmp2 A, B) --> (icmp3 A, B)
4431 if (ICmpInst *RHS = dyn_cast<ICmpInst>(I.getOperand(1)))
4432 if (Instruction *R = AssociativeOpt(I, FoldICmpLogical(*this, RHS)))
4435 // fold (xor (cast A), (cast B)) -> (cast (xor A, B))
4436 if (CastInst *Op0C = dyn_cast<CastInst>(Op0)) {
4437 if (CastInst *Op1C = dyn_cast<CastInst>(Op1))
4438 if (Op0C->getOpcode() == Op1C->getOpcode()) { // same cast kind?
4439 const Type *SrcTy = Op0C->getOperand(0)->getType();
4440 if (SrcTy == Op1C->getOperand(0)->getType() && SrcTy->isInteger() &&
4441 // Only do this if the casts both really cause code to be generated.
4442 ValueRequiresCast(Op0C->getOpcode(), Op0C->getOperand(0),
4444 ValueRequiresCast(Op1C->getOpcode(), Op1C->getOperand(0),
4446 Instruction *NewOp = BinaryOperator::createXor(Op0C->getOperand(0),
4447 Op1C->getOperand(0),
4449 InsertNewInstBefore(NewOp, I);
4450 return CastInst::create(Op0C->getOpcode(), NewOp, I.getType());
4454 return Changed ? &I : 0;
4457 /// AddWithOverflow - Compute Result = In1+In2, returning true if the result
4458 /// overflowed for this type.
4459 static bool AddWithOverflow(ConstantInt *&Result, ConstantInt *In1,
4460 ConstantInt *In2, bool IsSigned = false) {
4461 Result = cast<ConstantInt>(Add(In1, In2));
4464 if (In2->getValue().isNegative())
4465 return Result->getValue().sgt(In1->getValue());
4467 return Result->getValue().slt(In1->getValue());
4469 return Result->getValue().ult(In1->getValue());
4472 /// EmitGEPOffset - Given a getelementptr instruction/constantexpr, emit the
4473 /// code necessary to compute the offset from the base pointer (without adding
4474 /// in the base pointer). Return the result as a signed integer of intptr size.
4475 static Value *EmitGEPOffset(User *GEP, Instruction &I, InstCombiner &IC) {
4476 TargetData &TD = IC.getTargetData();
4477 gep_type_iterator GTI = gep_type_begin(GEP);
4478 const Type *IntPtrTy = TD.getIntPtrType();
4479 Value *Result = Constant::getNullValue(IntPtrTy);
4481 // Build a mask for high order bits.
4482 unsigned IntPtrWidth = TD.getPointerSize()*8;
4483 uint64_t PtrSizeMask = ~0ULL >> (64-IntPtrWidth);
4485 for (unsigned i = 1, e = GEP->getNumOperands(); i != e; ++i, ++GTI) {
4486 Value *Op = GEP->getOperand(i);
4487 uint64_t Size = TD.getABITypeSize(GTI.getIndexedType()) & PtrSizeMask;
4488 if (ConstantInt *OpC = dyn_cast<ConstantInt>(Op)) {
4489 if (OpC->isZero()) continue;
4491 // Handle a struct index, which adds its field offset to the pointer.
4492 if (const StructType *STy = dyn_cast<StructType>(*GTI)) {
4493 Size = TD.getStructLayout(STy)->getElementOffset(OpC->getZExtValue());
4495 if (ConstantInt *RC = dyn_cast<ConstantInt>(Result))
4496 Result = ConstantInt::get(RC->getValue() + APInt(IntPtrWidth, Size));
4498 Result = IC.InsertNewInstBefore(
4499 BinaryOperator::createAdd(Result,
4500 ConstantInt::get(IntPtrTy, Size),
4501 GEP->getName()+".offs"), I);
4505 Constant *Scale = ConstantInt::get(IntPtrTy, Size);
4506 Constant *OC = ConstantExpr::getIntegerCast(OpC, IntPtrTy, true /*SExt*/);
4507 Scale = ConstantExpr::getMul(OC, Scale);
4508 if (Constant *RC = dyn_cast<Constant>(Result))
4509 Result = ConstantExpr::getAdd(RC, Scale);
4511 // Emit an add instruction.
4512 Result = IC.InsertNewInstBefore(
4513 BinaryOperator::createAdd(Result, Scale,
4514 GEP->getName()+".offs"), I);
4518 // Convert to correct type.
4519 if (Op->getType() != IntPtrTy) {
4520 if (Constant *OpC = dyn_cast<Constant>(Op))
4521 Op = ConstantExpr::getSExt(OpC, IntPtrTy);
4523 Op = IC.InsertNewInstBefore(new SExtInst(Op, IntPtrTy,
4524 Op->getName()+".c"), I);
4527 Constant *Scale = ConstantInt::get(IntPtrTy, Size);
4528 if (Constant *OpC = dyn_cast<Constant>(Op))
4529 Op = ConstantExpr::getMul(OpC, Scale);
4530 else // We'll let instcombine(mul) convert this to a shl if possible.
4531 Op = IC.InsertNewInstBefore(BinaryOperator::createMul(Op, Scale,
4532 GEP->getName()+".idx"), I);
4535 // Emit an add instruction.
4536 if (isa<Constant>(Op) && isa<Constant>(Result))
4537 Result = ConstantExpr::getAdd(cast<Constant>(Op),
4538 cast<Constant>(Result));
4540 Result = IC.InsertNewInstBefore(BinaryOperator::createAdd(Op, Result,
4541 GEP->getName()+".offs"), I);
4546 /// FoldGEPICmp - Fold comparisons between a GEP instruction and something
4547 /// else. At this point we know that the GEP is on the LHS of the comparison.
4548 Instruction *InstCombiner::FoldGEPICmp(User *GEPLHS, Value *RHS,
4549 ICmpInst::Predicate Cond,
4551 assert(dyn_castGetElementPtr(GEPLHS) && "LHS is not a getelementptr!");
4553 if (CastInst *CI = dyn_cast<CastInst>(RHS))
4554 if (isa<PointerType>(CI->getOperand(0)->getType()))
4555 RHS = CI->getOperand(0);
4557 Value *PtrBase = GEPLHS->getOperand(0);
4558 if (PtrBase == RHS) {
4559 // As an optimization, we don't actually have to compute the actual value of
4560 // OFFSET if this is a icmp_eq or icmp_ne comparison, just return whether
4561 // each index is zero or not.
4562 if (Cond == ICmpInst::ICMP_EQ || Cond == ICmpInst::ICMP_NE) {
4563 Instruction *InVal = 0;
4564 gep_type_iterator GTI = gep_type_begin(GEPLHS);
4565 for (unsigned i = 1, e = GEPLHS->getNumOperands(); i != e; ++i, ++GTI) {
4567 if (Constant *C = dyn_cast<Constant>(GEPLHS->getOperand(i))) {
4568 if (isa<UndefValue>(C)) // undef index -> undef.
4569 return ReplaceInstUsesWith(I, UndefValue::get(I.getType()));
4570 if (C->isNullValue())
4572 else if (TD->getABITypeSize(GTI.getIndexedType()) == 0) {
4573 EmitIt = false; // This is indexing into a zero sized array?
4574 } else if (isa<ConstantInt>(C))
4575 return ReplaceInstUsesWith(I, // No comparison is needed here.
4576 ConstantInt::get(Type::Int1Ty,
4577 Cond == ICmpInst::ICMP_NE));
4582 new ICmpInst(Cond, GEPLHS->getOperand(i),
4583 Constant::getNullValue(GEPLHS->getOperand(i)->getType()));
4587 InVal = InsertNewInstBefore(InVal, I);
4588 InsertNewInstBefore(Comp, I);
4589 if (Cond == ICmpInst::ICMP_NE) // True if any are unequal
4590 InVal = BinaryOperator::createOr(InVal, Comp);
4591 else // True if all are equal
4592 InVal = BinaryOperator::createAnd(InVal, Comp);
4600 // No comparison is needed here, all indexes = 0
4601 ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty,
4602 Cond == ICmpInst::ICMP_EQ));
4605 // Only lower this if the icmp is the only user of the GEP or if we expect
4606 // the result to fold to a constant!
4607 if (isa<ConstantExpr>(GEPLHS) || GEPLHS->hasOneUse()) {
4608 // ((gep Ptr, OFFSET) cmp Ptr) ---> (OFFSET cmp 0).
4609 Value *Offset = EmitGEPOffset(GEPLHS, I, *this);
4610 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), Offset,
4611 Constant::getNullValue(Offset->getType()));
4613 } else if (User *GEPRHS = dyn_castGetElementPtr(RHS)) {
4614 // If the base pointers are different, but the indices are the same, just
4615 // compare the base pointer.
4616 if (PtrBase != GEPRHS->getOperand(0)) {
4617 bool IndicesTheSame = GEPLHS->getNumOperands()==GEPRHS->getNumOperands();
4618 IndicesTheSame &= GEPLHS->getOperand(0)->getType() ==
4619 GEPRHS->getOperand(0)->getType();
4621 for (unsigned i = 1, e = GEPLHS->getNumOperands(); i != e; ++i)
4622 if (GEPLHS->getOperand(i) != GEPRHS->getOperand(i)) {
4623 IndicesTheSame = false;
4627 // If all indices are the same, just compare the base pointers.
4629 return new ICmpInst(ICmpInst::getSignedPredicate(Cond),
4630 GEPLHS->getOperand(0), GEPRHS->getOperand(0));
4632 // Otherwise, the base pointers are different and the indices are
4633 // different, bail out.
4637 // If one of the GEPs has all zero indices, recurse.
4638 bool AllZeros = true;
4639 for (unsigned i = 1, e = GEPLHS->getNumOperands(); i != e; ++i)
4640 if (!isa<Constant>(GEPLHS->getOperand(i)) ||
4641 !cast<Constant>(GEPLHS->getOperand(i))->isNullValue()) {
4646 return FoldGEPICmp(GEPRHS, GEPLHS->getOperand(0),
4647 ICmpInst::getSwappedPredicate(Cond), I);
4649 // If the other GEP has all zero indices, recurse.
4651 for (unsigned i = 1, e = GEPRHS->getNumOperands(); i != e; ++i)
4652 if (!isa<Constant>(GEPRHS->getOperand(i)) ||
4653 !cast<Constant>(GEPRHS->getOperand(i))->isNullValue()) {
4658 return FoldGEPICmp(GEPLHS, GEPRHS->getOperand(0), Cond, I);
4660 if (GEPLHS->getNumOperands() == GEPRHS->getNumOperands()) {
4661 // If the GEPs only differ by one index, compare it.
4662 unsigned NumDifferences = 0; // Keep track of # differences.
4663 unsigned DiffOperand = 0; // The operand that differs.
4664 for (unsigned i = 1, e = GEPRHS->getNumOperands(); i != e; ++i)
4665 if (GEPLHS->getOperand(i) != GEPRHS->getOperand(i)) {
4666 if (GEPLHS->getOperand(i)->getType()->getPrimitiveSizeInBits() !=
4667 GEPRHS->getOperand(i)->getType()->getPrimitiveSizeInBits()) {
4668 // Irreconcilable differences.
4672 if (NumDifferences++) break;
4677 if (NumDifferences == 0) // SAME GEP?
4678 return ReplaceInstUsesWith(I, // No comparison is needed here.
4679 ConstantInt::get(Type::Int1Ty,
4680 isTrueWhenEqual(Cond)));
4682 else if (NumDifferences == 1) {
4683 Value *LHSV = GEPLHS->getOperand(DiffOperand);
4684 Value *RHSV = GEPRHS->getOperand(DiffOperand);
4685 // Make sure we do a signed comparison here.
4686 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), LHSV, RHSV);
4690 // Only lower this if the icmp is the only user of the GEP or if we expect
4691 // the result to fold to a constant!
4692 if ((isa<ConstantExpr>(GEPLHS) || GEPLHS->hasOneUse()) &&
4693 (isa<ConstantExpr>(GEPRHS) || GEPRHS->hasOneUse())) {
4694 // ((gep Ptr, OFFSET1) cmp (gep Ptr, OFFSET2) ---> (OFFSET1 cmp OFFSET2)
4695 Value *L = EmitGEPOffset(GEPLHS, I, *this);
4696 Value *R = EmitGEPOffset(GEPRHS, I, *this);
4697 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), L, R);
4703 Instruction *InstCombiner::visitFCmpInst(FCmpInst &I) {
4704 bool Changed = SimplifyCompare(I);
4705 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
4707 // Fold trivial predicates.
4708 if (I.getPredicate() == FCmpInst::FCMP_FALSE)
4709 return ReplaceInstUsesWith(I, Constant::getNullValue(Type::Int1Ty));
4710 if (I.getPredicate() == FCmpInst::FCMP_TRUE)
4711 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 1));
4713 // Simplify 'fcmp pred X, X'
4715 switch (I.getPredicate()) {
4716 default: assert(0 && "Unknown predicate!");
4717 case FCmpInst::FCMP_UEQ: // True if unordered or equal
4718 case FCmpInst::FCMP_UGE: // True if unordered, greater than, or equal
4719 case FCmpInst::FCMP_ULE: // True if unordered, less than, or equal
4720 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 1));
4721 case FCmpInst::FCMP_OGT: // True if ordered and greater than
4722 case FCmpInst::FCMP_OLT: // True if ordered and less than
4723 case FCmpInst::FCMP_ONE: // True if ordered and operands are unequal
4724 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 0));
4726 case FCmpInst::FCMP_UNO: // True if unordered: isnan(X) | isnan(Y)
4727 case FCmpInst::FCMP_ULT: // True if unordered or less than
4728 case FCmpInst::FCMP_UGT: // True if unordered or greater than
4729 case FCmpInst::FCMP_UNE: // True if unordered or not equal
4730 // Canonicalize these to be 'fcmp uno %X, 0.0'.
4731 I.setPredicate(FCmpInst::FCMP_UNO);
4732 I.setOperand(1, Constant::getNullValue(Op0->getType()));
4735 case FCmpInst::FCMP_ORD: // True if ordered (no nans)
4736 case FCmpInst::FCMP_OEQ: // True if ordered and equal
4737 case FCmpInst::FCMP_OGE: // True if ordered and greater than or equal
4738 case FCmpInst::FCMP_OLE: // True if ordered and less than or equal
4739 // Canonicalize these to be 'fcmp ord %X, 0.0'.
4740 I.setPredicate(FCmpInst::FCMP_ORD);
4741 I.setOperand(1, Constant::getNullValue(Op0->getType()));
4746 if (isa<UndefValue>(Op1)) // fcmp pred X, undef -> undef
4747 return ReplaceInstUsesWith(I, UndefValue::get(Type::Int1Ty));
4749 // Handle fcmp with constant RHS
4750 if (Constant *RHSC = dyn_cast<Constant>(Op1)) {
4751 if (Instruction *LHSI = dyn_cast<Instruction>(Op0))
4752 switch (LHSI->getOpcode()) {
4753 case Instruction::PHI:
4754 if (Instruction *NV = FoldOpIntoPhi(I))
4757 case Instruction::Select:
4758 // If either operand of the select is a constant, we can fold the
4759 // comparison into the select arms, which will cause one to be
4760 // constant folded and the select turned into a bitwise or.
4761 Value *Op1 = 0, *Op2 = 0;
4762 if (LHSI->hasOneUse()) {
4763 if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(1))) {
4764 // Fold the known value into the constant operand.
4765 Op1 = ConstantExpr::getCompare(I.getPredicate(), C, RHSC);
4766 // Insert a new FCmp of the other select operand.
4767 Op2 = InsertNewInstBefore(new FCmpInst(I.getPredicate(),
4768 LHSI->getOperand(2), RHSC,
4770 } else if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(2))) {
4771 // Fold the known value into the constant operand.
4772 Op2 = ConstantExpr::getCompare(I.getPredicate(), C, RHSC);
4773 // Insert a new FCmp of the other select operand.
4774 Op1 = InsertNewInstBefore(new FCmpInst(I.getPredicate(),
4775 LHSI->getOperand(1), RHSC,
4781 return new SelectInst(LHSI->getOperand(0), Op1, Op2);
4786 return Changed ? &I : 0;
4789 Instruction *InstCombiner::visitICmpInst(ICmpInst &I) {
4790 bool Changed = SimplifyCompare(I);
4791 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
4792 const Type *Ty = Op0->getType();
4796 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty,
4797 isTrueWhenEqual(I)));
4799 if (isa<UndefValue>(Op1)) // X icmp undef -> undef
4800 return ReplaceInstUsesWith(I, UndefValue::get(Type::Int1Ty));
4802 // icmp <global/alloca*/null>, <global/alloca*/null> - Global/Stack value
4803 // addresses never equal each other! We already know that Op0 != Op1.
4804 if ((isa<GlobalValue>(Op0) || isa<AllocaInst>(Op0) ||
4805 isa<ConstantPointerNull>(Op0)) &&
4806 (isa<GlobalValue>(Op1) || isa<AllocaInst>(Op1) ||
4807 isa<ConstantPointerNull>(Op1)))
4808 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty,
4809 !isTrueWhenEqual(I)));
4811 // icmp's with boolean values can always be turned into bitwise operations
4812 if (Ty == Type::Int1Ty) {
4813 switch (I.getPredicate()) {
4814 default: assert(0 && "Invalid icmp instruction!");
4815 case ICmpInst::ICMP_EQ: { // icmp eq bool %A, %B -> ~(A^B)
4816 Instruction *Xor = BinaryOperator::createXor(Op0, Op1, I.getName()+"tmp");
4817 InsertNewInstBefore(Xor, I);
4818 return BinaryOperator::createNot(Xor);
4820 case ICmpInst::ICMP_NE: // icmp eq bool %A, %B -> A^B
4821 return BinaryOperator::createXor(Op0, Op1);
4823 case ICmpInst::ICMP_UGT:
4824 case ICmpInst::ICMP_SGT:
4825 std::swap(Op0, Op1); // Change icmp gt -> icmp lt
4827 case ICmpInst::ICMP_ULT:
4828 case ICmpInst::ICMP_SLT: { // icmp lt bool A, B -> ~X & Y
4829 Instruction *Not = BinaryOperator::createNot(Op0, I.getName()+"tmp");
4830 InsertNewInstBefore(Not, I);
4831 return BinaryOperator::createAnd(Not, Op1);
4833 case ICmpInst::ICMP_UGE:
4834 case ICmpInst::ICMP_SGE:
4835 std::swap(Op0, Op1); // Change icmp ge -> icmp le
4837 case ICmpInst::ICMP_ULE:
4838 case ICmpInst::ICMP_SLE: { // icmp le bool %A, %B -> ~A | B
4839 Instruction *Not = BinaryOperator::createNot(Op0, I.getName()+"tmp");
4840 InsertNewInstBefore(Not, I);
4841 return BinaryOperator::createOr(Not, Op1);
4846 // See if we are doing a comparison between a constant and an instruction that
4847 // can be folded into the comparison.
4848 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
4851 // (icmp ne/eq (sub A B) 0) -> (icmp ne/eq A, B)
4852 if (I.isEquality() && CI->isNullValue() &&
4853 match(Op0, m_Sub(m_Value(A), m_Value(B)))) {
4854 // (icmp cond A B) if cond is equality
4855 return new ICmpInst(I.getPredicate(), A, B);
4858 switch (I.getPredicate()) {
4860 case ICmpInst::ICMP_ULT: // A <u MIN -> FALSE
4861 if (CI->isMinValue(false))
4862 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4863 if (CI->isMaxValue(false)) // A <u MAX -> A != MAX
4864 return new ICmpInst(ICmpInst::ICMP_NE, Op0,Op1);
4865 if (isMinValuePlusOne(CI,false)) // A <u MIN+1 -> A == MIN
4866 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, SubOne(CI));
4867 // (x <u 2147483648) -> (x >s -1) -> true if sign bit clear
4868 if (CI->isMinValue(true))
4869 return new ICmpInst(ICmpInst::ICMP_SGT, Op0,
4870 ConstantInt::getAllOnesValue(Op0->getType()));
4874 case ICmpInst::ICMP_SLT:
4875 if (CI->isMinValue(true)) // A <s MIN -> FALSE
4876 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4877 if (CI->isMaxValue(true)) // A <s MAX -> A != MAX
4878 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
4879 if (isMinValuePlusOne(CI,true)) // A <s MIN+1 -> A == MIN
4880 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, SubOne(CI));
4883 case ICmpInst::ICMP_UGT:
4884 if (CI->isMaxValue(false)) // A >u MAX -> FALSE
4885 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4886 if (CI->isMinValue(false)) // A >u MIN -> A != MIN
4887 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
4888 if (isMaxValueMinusOne(CI, false)) // A >u MAX-1 -> A == MAX
4889 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, AddOne(CI));
4891 // (x >u 2147483647) -> (x <s 0) -> true if sign bit set
4892 if (CI->isMaxValue(true))
4893 return new ICmpInst(ICmpInst::ICMP_SLT, Op0,
4894 ConstantInt::getNullValue(Op0->getType()));
4897 case ICmpInst::ICMP_SGT:
4898 if (CI->isMaxValue(true)) // A >s MAX -> FALSE
4899 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4900 if (CI->isMinValue(true)) // A >s MIN -> A != MIN
4901 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
4902 if (isMaxValueMinusOne(CI, true)) // A >s MAX-1 -> A == MAX
4903 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, AddOne(CI));
4906 case ICmpInst::ICMP_ULE:
4907 if (CI->isMaxValue(false)) // A <=u MAX -> TRUE
4908 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4909 if (CI->isMinValue(false)) // A <=u MIN -> A == MIN
4910 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, Op1);
4911 if (isMaxValueMinusOne(CI,false)) // A <=u MAX-1 -> A != MAX
4912 return new ICmpInst(ICmpInst::ICMP_NE, Op0, AddOne(CI));
4915 case ICmpInst::ICMP_SLE:
4916 if (CI->isMaxValue(true)) // A <=s MAX -> TRUE
4917 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4918 if (CI->isMinValue(true)) // A <=s MIN -> A == MIN
4919 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, Op1);
4920 if (isMaxValueMinusOne(CI,true)) // A <=s MAX-1 -> A != MAX
4921 return new ICmpInst(ICmpInst::ICMP_NE, Op0, AddOne(CI));
4924 case ICmpInst::ICMP_UGE:
4925 if (CI->isMinValue(false)) // A >=u MIN -> TRUE
4926 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4927 if (CI->isMaxValue(false)) // A >=u MAX -> A == MAX
4928 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, Op1);
4929 if (isMinValuePlusOne(CI,false)) // A >=u MIN-1 -> A != MIN
4930 return new ICmpInst(ICmpInst::ICMP_NE, Op0, SubOne(CI));
4933 case ICmpInst::ICMP_SGE:
4934 if (CI->isMinValue(true)) // A >=s MIN -> TRUE
4935 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4936 if (CI->isMaxValue(true)) // A >=s MAX -> A == MAX
4937 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, Op1);
4938 if (isMinValuePlusOne(CI,true)) // A >=s MIN-1 -> A != MIN
4939 return new ICmpInst(ICmpInst::ICMP_NE, Op0, SubOne(CI));
4943 // If we still have a icmp le or icmp ge instruction, turn it into the
4944 // appropriate icmp lt or icmp gt instruction. Since the border cases have
4945 // already been handled above, this requires little checking.
4947 switch (I.getPredicate()) {
4949 case ICmpInst::ICMP_ULE:
4950 return new ICmpInst(ICmpInst::ICMP_ULT, Op0, AddOne(CI));
4951 case ICmpInst::ICMP_SLE:
4952 return new ICmpInst(ICmpInst::ICMP_SLT, Op0, AddOne(CI));
4953 case ICmpInst::ICMP_UGE:
4954 return new ICmpInst( ICmpInst::ICMP_UGT, Op0, SubOne(CI));
4955 case ICmpInst::ICMP_SGE:
4956 return new ICmpInst(ICmpInst::ICMP_SGT, Op0, SubOne(CI));
4959 // See if we can fold the comparison based on bits known to be zero or one
4960 // in the input. If this comparison is a normal comparison, it demands all
4961 // bits, if it is a sign bit comparison, it only demands the sign bit.
4964 bool isSignBit = isSignBitCheck(I.getPredicate(), CI, UnusedBit);
4966 uint32_t BitWidth = cast<IntegerType>(Ty)->getBitWidth();
4967 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
4968 if (SimplifyDemandedBits(Op0,
4969 isSignBit ? APInt::getSignBit(BitWidth)
4970 : APInt::getAllOnesValue(BitWidth),
4971 KnownZero, KnownOne, 0))
4974 // Given the known and unknown bits, compute a range that the LHS could be
4976 if ((KnownOne | KnownZero) != 0) {
4977 // Compute the Min, Max and RHS values based on the known bits. For the
4978 // EQ and NE we use unsigned values.
4979 APInt Min(BitWidth, 0), Max(BitWidth, 0);
4980 const APInt& RHSVal = CI->getValue();
4981 if (ICmpInst::isSignedPredicate(I.getPredicate())) {
4982 ComputeSignedMinMaxValuesFromKnownBits(Ty, KnownZero, KnownOne, Min,
4985 ComputeUnsignedMinMaxValuesFromKnownBits(Ty, KnownZero, KnownOne, Min,
4988 switch (I.getPredicate()) { // LE/GE have been folded already.
4989 default: assert(0 && "Unknown icmp opcode!");
4990 case ICmpInst::ICMP_EQ:
4991 if (Max.ult(RHSVal) || Min.ugt(RHSVal))
4992 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4994 case ICmpInst::ICMP_NE:
4995 if (Max.ult(RHSVal) || Min.ugt(RHSVal))
4996 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4998 case ICmpInst::ICMP_ULT:
4999 if (Max.ult(RHSVal))
5000 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5001 if (Min.uge(RHSVal))
5002 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5004 case ICmpInst::ICMP_UGT:
5005 if (Min.ugt(RHSVal))
5006 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5007 if (Max.ule(RHSVal))
5008 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5010 case ICmpInst::ICMP_SLT:
5011 if (Max.slt(RHSVal))
5012 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5013 if (Min.sgt(RHSVal))
5014 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5016 case ICmpInst::ICMP_SGT:
5017 if (Min.sgt(RHSVal))
5018 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5019 if (Max.sle(RHSVal))
5020 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5025 // Since the RHS is a ConstantInt (CI), if the left hand side is an
5026 // instruction, see if that instruction also has constants so that the
5027 // instruction can be folded into the icmp
5028 if (Instruction *LHSI = dyn_cast<Instruction>(Op0))
5029 if (Instruction *Res = visitICmpInstWithInstAndIntCst(I, LHSI, CI))
5033 // Handle icmp with constant (but not simple integer constant) RHS
5034 if (Constant *RHSC = dyn_cast<Constant>(Op1)) {
5035 if (Instruction *LHSI = dyn_cast<Instruction>(Op0))
5036 switch (LHSI->getOpcode()) {
5037 case Instruction::GetElementPtr:
5038 if (RHSC->isNullValue()) {
5039 // icmp pred GEP (P, int 0, int 0, int 0), null -> icmp pred P, null
5040 bool isAllZeros = true;
5041 for (unsigned i = 1, e = LHSI->getNumOperands(); i != e; ++i)
5042 if (!isa<Constant>(LHSI->getOperand(i)) ||
5043 !cast<Constant>(LHSI->getOperand(i))->isNullValue()) {
5048 return new ICmpInst(I.getPredicate(), LHSI->getOperand(0),
5049 Constant::getNullValue(LHSI->getOperand(0)->getType()));
5053 case Instruction::PHI:
5054 if (Instruction *NV = FoldOpIntoPhi(I))
5057 case Instruction::Select: {
5058 // If either operand of the select is a constant, we can fold the
5059 // comparison into the select arms, which will cause one to be
5060 // constant folded and the select turned into a bitwise or.
5061 Value *Op1 = 0, *Op2 = 0;
5062 if (LHSI->hasOneUse()) {
5063 if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(1))) {
5064 // Fold the known value into the constant operand.
5065 Op1 = ConstantExpr::getICmp(I.getPredicate(), C, RHSC);
5066 // Insert a new ICmp of the other select operand.
5067 Op2 = InsertNewInstBefore(new ICmpInst(I.getPredicate(),
5068 LHSI->getOperand(2), RHSC,
5070 } else if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(2))) {
5071 // Fold the known value into the constant operand.
5072 Op2 = ConstantExpr::getICmp(I.getPredicate(), C, RHSC);
5073 // Insert a new ICmp of the other select operand.
5074 Op1 = InsertNewInstBefore(new ICmpInst(I.getPredicate(),
5075 LHSI->getOperand(1), RHSC,
5081 return new SelectInst(LHSI->getOperand(0), Op1, Op2);
5084 case Instruction::Malloc:
5085 // If we have (malloc != null), and if the malloc has a single use, we
5086 // can assume it is successful and remove the malloc.
5087 if (LHSI->hasOneUse() && isa<ConstantPointerNull>(RHSC)) {
5088 AddToWorkList(LHSI);
5089 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty,
5090 !isTrueWhenEqual(I)));
5096 // If we can optimize a 'icmp GEP, P' or 'icmp P, GEP', do so now.
5097 if (User *GEP = dyn_castGetElementPtr(Op0))
5098 if (Instruction *NI = FoldGEPICmp(GEP, Op1, I.getPredicate(), I))
5100 if (User *GEP = dyn_castGetElementPtr(Op1))
5101 if (Instruction *NI = FoldGEPICmp(GEP, Op0,
5102 ICmpInst::getSwappedPredicate(I.getPredicate()), I))
5105 // Test to see if the operands of the icmp are casted versions of other
5106 // values. If the ptr->ptr cast can be stripped off both arguments, we do so
5108 if (BitCastInst *CI = dyn_cast<BitCastInst>(Op0)) {
5109 if (isa<PointerType>(Op0->getType()) &&
5110 (isa<Constant>(Op1) || isa<BitCastInst>(Op1))) {
5111 // We keep moving the cast from the left operand over to the right
5112 // operand, where it can often be eliminated completely.
5113 Op0 = CI->getOperand(0);
5115 // If operand #1 is a bitcast instruction, it must also be a ptr->ptr cast
5116 // so eliminate it as well.
5117 if (BitCastInst *CI2 = dyn_cast<BitCastInst>(Op1))
5118 Op1 = CI2->getOperand(0);
5120 // If Op1 is a constant, we can fold the cast into the constant.
5121 if (Op0->getType() != Op1->getType())
5122 if (Constant *Op1C = dyn_cast<Constant>(Op1)) {
5123 Op1 = ConstantExpr::getBitCast(Op1C, Op0->getType());
5125 // Otherwise, cast the RHS right before the icmp
5126 Op1 = InsertBitCastBefore(Op1, Op0->getType(), I);
5128 return new ICmpInst(I.getPredicate(), Op0, Op1);
5132 if (isa<CastInst>(Op0)) {
5133 // Handle the special case of: icmp (cast bool to X), <cst>
5134 // This comes up when you have code like
5137 // For generality, we handle any zero-extension of any operand comparison
5138 // with a constant or another cast from the same type.
5139 if (isa<ConstantInt>(Op1) || isa<CastInst>(Op1))
5140 if (Instruction *R = visitICmpInstWithCastAndCast(I))
5144 if (I.isEquality()) {
5145 Value *A, *B, *C, *D;
5146 if (match(Op0, m_Xor(m_Value(A), m_Value(B)))) {
5147 if (A == Op1 || B == Op1) { // (A^B) == A -> B == 0
5148 Value *OtherVal = A == Op1 ? B : A;
5149 return new ICmpInst(I.getPredicate(), OtherVal,
5150 Constant::getNullValue(A->getType()));
5153 if (match(Op1, m_Xor(m_Value(C), m_Value(D)))) {
5154 // A^c1 == C^c2 --> A == C^(c1^c2)
5155 if (ConstantInt *C1 = dyn_cast<ConstantInt>(B))
5156 if (ConstantInt *C2 = dyn_cast<ConstantInt>(D))
5157 if (Op1->hasOneUse()) {
5158 Constant *NC = ConstantInt::get(C1->getValue() ^ C2->getValue());
5159 Instruction *Xor = BinaryOperator::createXor(C, NC, "tmp");
5160 return new ICmpInst(I.getPredicate(), A,
5161 InsertNewInstBefore(Xor, I));
5164 // A^B == A^D -> B == D
5165 if (A == C) return new ICmpInst(I.getPredicate(), B, D);
5166 if (A == D) return new ICmpInst(I.getPredicate(), B, C);
5167 if (B == C) return new ICmpInst(I.getPredicate(), A, D);
5168 if (B == D) return new ICmpInst(I.getPredicate(), A, C);
5172 if (match(Op1, m_Xor(m_Value(A), m_Value(B))) &&
5173 (A == Op0 || B == Op0)) {
5174 // A == (A^B) -> B == 0
5175 Value *OtherVal = A == Op0 ? B : A;
5176 return new ICmpInst(I.getPredicate(), OtherVal,
5177 Constant::getNullValue(A->getType()));
5179 if (match(Op0, m_Sub(m_Value(A), m_Value(B))) && A == Op1) {
5180 // (A-B) == A -> B == 0
5181 return new ICmpInst(I.getPredicate(), B,
5182 Constant::getNullValue(B->getType()));
5184 if (match(Op1, m_Sub(m_Value(A), m_Value(B))) && A == Op0) {
5185 // A == (A-B) -> B == 0
5186 return new ICmpInst(I.getPredicate(), B,
5187 Constant::getNullValue(B->getType()));
5190 // (X&Z) == (Y&Z) -> (X^Y) & Z == 0
5191 if (Op0->hasOneUse() && Op1->hasOneUse() &&
5192 match(Op0, m_And(m_Value(A), m_Value(B))) &&
5193 match(Op1, m_And(m_Value(C), m_Value(D)))) {
5194 Value *X = 0, *Y = 0, *Z = 0;
5197 X = B; Y = D; Z = A;
5198 } else if (A == D) {
5199 X = B; Y = C; Z = A;
5200 } else if (B == C) {
5201 X = A; Y = D; Z = B;
5202 } else if (B == D) {
5203 X = A; Y = C; Z = B;
5206 if (X) { // Build (X^Y) & Z
5207 Op1 = InsertNewInstBefore(BinaryOperator::createXor(X, Y, "tmp"), I);
5208 Op1 = InsertNewInstBefore(BinaryOperator::createAnd(Op1, Z, "tmp"), I);
5209 I.setOperand(0, Op1);
5210 I.setOperand(1, Constant::getNullValue(Op1->getType()));
5215 return Changed ? &I : 0;
5219 /// FoldICmpDivCst - Fold "icmp pred, ([su]div X, DivRHS), CmpRHS" where DivRHS
5220 /// and CmpRHS are both known to be integer constants.
5221 Instruction *InstCombiner::FoldICmpDivCst(ICmpInst &ICI, BinaryOperator *DivI,
5222 ConstantInt *DivRHS) {
5223 ConstantInt *CmpRHS = cast<ConstantInt>(ICI.getOperand(1));
5224 const APInt &CmpRHSV = CmpRHS->getValue();
5226 // FIXME: If the operand types don't match the type of the divide
5227 // then don't attempt this transform. The code below doesn't have the
5228 // logic to deal with a signed divide and an unsigned compare (and
5229 // vice versa). This is because (x /s C1) <s C2 produces different
5230 // results than (x /s C1) <u C2 or (x /u C1) <s C2 or even
5231 // (x /u C1) <u C2. Simply casting the operands and result won't
5232 // work. :( The if statement below tests that condition and bails
5234 bool DivIsSigned = DivI->getOpcode() == Instruction::SDiv;
5235 if (!ICI.isEquality() && DivIsSigned != ICI.isSignedPredicate())
5237 if (DivRHS->isZero())
5238 return 0; // The ProdOV computation fails on divide by zero.
5240 // Compute Prod = CI * DivRHS. We are essentially solving an equation
5241 // of form X/C1=C2. We solve for X by multiplying C1 (DivRHS) and
5242 // C2 (CI). By solving for X we can turn this into a range check
5243 // instead of computing a divide.
5244 ConstantInt *Prod = Multiply(CmpRHS, DivRHS);
5246 // Determine if the product overflows by seeing if the product is
5247 // not equal to the divide. Make sure we do the same kind of divide
5248 // as in the LHS instruction that we're folding.
5249 bool ProdOV = (DivIsSigned ? ConstantExpr::getSDiv(Prod, DivRHS) :
5250 ConstantExpr::getUDiv(Prod, DivRHS)) != CmpRHS;
5252 // Get the ICmp opcode
5253 ICmpInst::Predicate Pred = ICI.getPredicate();
5255 // Figure out the interval that is being checked. For example, a comparison
5256 // like "X /u 5 == 0" is really checking that X is in the interval [0, 5).
5257 // Compute this interval based on the constants involved and the signedness of
5258 // the compare/divide. This computes a half-open interval, keeping track of
5259 // whether either value in the interval overflows. After analysis each
5260 // overflow variable is set to 0 if it's corresponding bound variable is valid
5261 // -1 if overflowed off the bottom end, or +1 if overflowed off the top end.
5262 int LoOverflow = 0, HiOverflow = 0;
5263 ConstantInt *LoBound = 0, *HiBound = 0;
5266 if (!DivIsSigned) { // udiv
5267 // e.g. X/5 op 3 --> [15, 20)
5269 HiOverflow = LoOverflow = ProdOV;
5271 HiOverflow = AddWithOverflow(HiBound, LoBound, DivRHS, false);
5272 } else if (DivRHS->getValue().isPositive()) { // Divisor is > 0.
5273 if (CmpRHSV == 0) { // (X / pos) op 0
5274 // Can't overflow. e.g. X/2 op 0 --> [-1, 2)
5275 LoBound = cast<ConstantInt>(ConstantExpr::getNeg(SubOne(DivRHS)));
5277 } else if (CmpRHSV.isPositive()) { // (X / pos) op pos
5278 LoBound = Prod; // e.g. X/5 op 3 --> [15, 20)
5279 HiOverflow = LoOverflow = ProdOV;
5281 HiOverflow = AddWithOverflow(HiBound, Prod, DivRHS, true);
5282 } else { // (X / pos) op neg
5283 // e.g. X/5 op -3 --> [-15-4, -15+1) --> [-19, -14)
5284 Constant *DivRHSH = ConstantExpr::getNeg(SubOne(DivRHS));
5285 LoOverflow = AddWithOverflow(LoBound, Prod,
5286 cast<ConstantInt>(DivRHSH), true) ? -1 : 0;
5287 HiBound = AddOne(Prod);
5288 HiOverflow = ProdOV ? -1 : 0;
5290 } else { // Divisor is < 0.
5291 if (CmpRHSV == 0) { // (X / neg) op 0
5292 // e.g. X/-5 op 0 --> [-4, 5)
5293 LoBound = AddOne(DivRHS);
5294 HiBound = cast<ConstantInt>(ConstantExpr::getNeg(DivRHS));
5295 if (HiBound == DivRHS) { // -INTMIN = INTMIN
5296 HiOverflow = 1; // [INTMIN+1, overflow)
5297 HiBound = 0; // e.g. X/INTMIN = 0 --> X > INTMIN
5299 } else if (CmpRHSV.isPositive()) { // (X / neg) op pos
5300 // e.g. X/-5 op 3 --> [-19, -14)
5301 HiOverflow = LoOverflow = ProdOV ? -1 : 0;
5303 LoOverflow = AddWithOverflow(LoBound, Prod, AddOne(DivRHS), true) ?-1:0;
5304 HiBound = AddOne(Prod);
5305 } else { // (X / neg) op neg
5306 // e.g. X/-5 op -3 --> [15, 20)
5308 LoOverflow = HiOverflow = ProdOV ? 1 : 0;
5309 HiBound = Subtract(Prod, DivRHS);
5312 // Dividing by a negative swaps the condition. LT <-> GT
5313 Pred = ICmpInst::getSwappedPredicate(Pred);
5316 Value *X = DivI->getOperand(0);
5318 default: assert(0 && "Unhandled icmp opcode!");
5319 case ICmpInst::ICMP_EQ:
5320 if (LoOverflow && HiOverflow)
5321 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
5322 else if (HiOverflow)
5323 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SGE :
5324 ICmpInst::ICMP_UGE, X, LoBound);
5325 else if (LoOverflow)
5326 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SLT :
5327 ICmpInst::ICMP_ULT, X, HiBound);
5329 return InsertRangeTest(X, LoBound, HiBound, DivIsSigned, true, ICI);
5330 case ICmpInst::ICMP_NE:
5331 if (LoOverflow && HiOverflow)
5332 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
5333 else if (HiOverflow)
5334 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SLT :
5335 ICmpInst::ICMP_ULT, X, LoBound);
5336 else if (LoOverflow)
5337 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SGE :
5338 ICmpInst::ICMP_UGE, X, HiBound);
5340 return InsertRangeTest(X, LoBound, HiBound, DivIsSigned, false, ICI);
5341 case ICmpInst::ICMP_ULT:
5342 case ICmpInst::ICMP_SLT:
5343 if (LoOverflow == +1) // Low bound is greater than input range.
5344 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
5345 if (LoOverflow == -1) // Low bound is less than input range.
5346 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
5347 return new ICmpInst(Pred, X, LoBound);
5348 case ICmpInst::ICMP_UGT:
5349 case ICmpInst::ICMP_SGT:
5350 if (HiOverflow == +1) // High bound greater than input range.
5351 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
5352 else if (HiOverflow == -1) // High bound less than input range.
5353 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
5354 if (Pred == ICmpInst::ICMP_UGT)
5355 return new ICmpInst(ICmpInst::ICMP_UGE, X, HiBound);
5357 return new ICmpInst(ICmpInst::ICMP_SGE, X, HiBound);
5362 /// visitICmpInstWithInstAndIntCst - Handle "icmp (instr, intcst)".
5364 Instruction *InstCombiner::visitICmpInstWithInstAndIntCst(ICmpInst &ICI,
5367 const APInt &RHSV = RHS->getValue();
5369 switch (LHSI->getOpcode()) {
5370 case Instruction::Xor: // (icmp pred (xor X, XorCST), CI)
5371 if (ConstantInt *XorCST = dyn_cast<ConstantInt>(LHSI->getOperand(1))) {
5372 // If this is a comparison that tests the signbit (X < 0) or (x > -1),
5374 if (ICI.getPredicate() == ICmpInst::ICMP_SLT && RHSV == 0 ||
5375 ICI.getPredicate() == ICmpInst::ICMP_SGT && RHSV.isAllOnesValue()) {
5376 Value *CompareVal = LHSI->getOperand(0);
5378 // If the sign bit of the XorCST is not set, there is no change to
5379 // the operation, just stop using the Xor.
5380 if (!XorCST->getValue().isNegative()) {
5381 ICI.setOperand(0, CompareVal);
5382 AddToWorkList(LHSI);
5386 // Was the old condition true if the operand is positive?
5387 bool isTrueIfPositive = ICI.getPredicate() == ICmpInst::ICMP_SGT;
5389 // If so, the new one isn't.
5390 isTrueIfPositive ^= true;
5392 if (isTrueIfPositive)
5393 return new ICmpInst(ICmpInst::ICMP_SGT, CompareVal, SubOne(RHS));
5395 return new ICmpInst(ICmpInst::ICMP_SLT, CompareVal, AddOne(RHS));
5399 case Instruction::And: // (icmp pred (and X, AndCST), RHS)
5400 if (LHSI->hasOneUse() && isa<ConstantInt>(LHSI->getOperand(1)) &&
5401 LHSI->getOperand(0)->hasOneUse()) {
5402 ConstantInt *AndCST = cast<ConstantInt>(LHSI->getOperand(1));
5404 // If the LHS is an AND of a truncating cast, we can widen the
5405 // and/compare to be the input width without changing the value
5406 // produced, eliminating a cast.
5407 if (TruncInst *Cast = dyn_cast<TruncInst>(LHSI->getOperand(0))) {
5408 // We can do this transformation if either the AND constant does not
5409 // have its sign bit set or if it is an equality comparison.
5410 // Extending a relational comparison when we're checking the sign
5411 // bit would not work.
5412 if (Cast->hasOneUse() &&
5413 (ICI.isEquality() || AndCST->getValue().isPositive() &&
5414 RHSV.isPositive())) {
5416 cast<IntegerType>(Cast->getOperand(0)->getType())->getBitWidth();
5417 APInt NewCST = AndCST->getValue();
5418 NewCST.zext(BitWidth);
5420 NewCI.zext(BitWidth);
5421 Instruction *NewAnd =
5422 BinaryOperator::createAnd(Cast->getOperand(0),
5423 ConstantInt::get(NewCST),LHSI->getName());
5424 InsertNewInstBefore(NewAnd, ICI);
5425 return new ICmpInst(ICI.getPredicate(), NewAnd,
5426 ConstantInt::get(NewCI));
5430 // If this is: (X >> C1) & C2 != C3 (where any shift and any compare
5431 // could exist), turn it into (X & (C2 << C1)) != (C3 << C1). This
5432 // happens a LOT in code produced by the C front-end, for bitfield
5434 BinaryOperator *Shift = dyn_cast<BinaryOperator>(LHSI->getOperand(0));
5435 if (Shift && !Shift->isShift())
5439 ShAmt = Shift ? dyn_cast<ConstantInt>(Shift->getOperand(1)) : 0;
5440 const Type *Ty = Shift ? Shift->getType() : 0; // Type of the shift.
5441 const Type *AndTy = AndCST->getType(); // Type of the and.
5443 // We can fold this as long as we can't shift unknown bits
5444 // into the mask. This can only happen with signed shift
5445 // rights, as they sign-extend.
5447 bool CanFold = Shift->isLogicalShift();
5449 // To test for the bad case of the signed shr, see if any
5450 // of the bits shifted in could be tested after the mask.
5451 uint32_t TyBits = Ty->getPrimitiveSizeInBits();
5452 int ShAmtVal = TyBits - ShAmt->getLimitedValue(TyBits);
5454 uint32_t BitWidth = AndTy->getPrimitiveSizeInBits();
5455 if ((APInt::getHighBitsSet(BitWidth, BitWidth-ShAmtVal) &
5456 AndCST->getValue()) == 0)
5462 if (Shift->getOpcode() == Instruction::Shl)
5463 NewCst = ConstantExpr::getLShr(RHS, ShAmt);
5465 NewCst = ConstantExpr::getShl(RHS, ShAmt);
5467 // Check to see if we are shifting out any of the bits being
5469 if (ConstantExpr::get(Shift->getOpcode(), NewCst, ShAmt) != RHS) {
5470 // If we shifted bits out, the fold is not going to work out.
5471 // As a special case, check to see if this means that the
5472 // result is always true or false now.
5473 if (ICI.getPredicate() == ICmpInst::ICMP_EQ)
5474 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
5475 if (ICI.getPredicate() == ICmpInst::ICMP_NE)
5476 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
5478 ICI.setOperand(1, NewCst);
5479 Constant *NewAndCST;
5480 if (Shift->getOpcode() == Instruction::Shl)
5481 NewAndCST = ConstantExpr::getLShr(AndCST, ShAmt);
5483 NewAndCST = ConstantExpr::getShl(AndCST, ShAmt);
5484 LHSI->setOperand(1, NewAndCST);
5485 LHSI->setOperand(0, Shift->getOperand(0));
5486 AddToWorkList(Shift); // Shift is dead.
5487 AddUsesToWorkList(ICI);
5493 // Turn ((X >> Y) & C) == 0 into (X & (C << Y)) == 0. The later is
5494 // preferable because it allows the C<<Y expression to be hoisted out
5495 // of a loop if Y is invariant and X is not.
5496 if (Shift && Shift->hasOneUse() && RHSV == 0 &&
5497 ICI.isEquality() && !Shift->isArithmeticShift() &&
5498 isa<Instruction>(Shift->getOperand(0))) {
5501 if (Shift->getOpcode() == Instruction::LShr) {
5502 NS = BinaryOperator::createShl(AndCST,
5503 Shift->getOperand(1), "tmp");
5505 // Insert a logical shift.
5506 NS = BinaryOperator::createLShr(AndCST,
5507 Shift->getOperand(1), "tmp");
5509 InsertNewInstBefore(cast<Instruction>(NS), ICI);
5511 // Compute X & (C << Y).
5512 Instruction *NewAnd =
5513 BinaryOperator::createAnd(Shift->getOperand(0), NS, LHSI->getName());
5514 InsertNewInstBefore(NewAnd, ICI);
5516 ICI.setOperand(0, NewAnd);
5522 case Instruction::Shl: { // (icmp pred (shl X, ShAmt), CI)
5523 ConstantInt *ShAmt = dyn_cast<ConstantInt>(LHSI->getOperand(1));
5526 uint32_t TypeBits = RHSV.getBitWidth();
5528 // Check that the shift amount is in range. If not, don't perform
5529 // undefined shifts. When the shift is visited it will be
5531 if (ShAmt->uge(TypeBits))
5534 if (ICI.isEquality()) {
5535 // If we are comparing against bits always shifted out, the
5536 // comparison cannot succeed.
5538 ConstantExpr::getShl(ConstantExpr::getLShr(RHS, ShAmt), ShAmt);
5539 if (Comp != RHS) {// Comparing against a bit that we know is zero.
5540 bool IsICMP_NE = ICI.getPredicate() == ICmpInst::ICMP_NE;
5541 Constant *Cst = ConstantInt::get(Type::Int1Ty, IsICMP_NE);
5542 return ReplaceInstUsesWith(ICI, Cst);
5545 if (LHSI->hasOneUse()) {
5546 // Otherwise strength reduce the shift into an and.
5547 uint32_t ShAmtVal = (uint32_t)ShAmt->getLimitedValue(TypeBits);
5549 ConstantInt::get(APInt::getLowBitsSet(TypeBits, TypeBits-ShAmtVal));
5552 BinaryOperator::createAnd(LHSI->getOperand(0),
5553 Mask, LHSI->getName()+".mask");
5554 Value *And = InsertNewInstBefore(AndI, ICI);
5555 return new ICmpInst(ICI.getPredicate(), And,
5556 ConstantInt::get(RHSV.lshr(ShAmtVal)));
5560 // Otherwise, if this is a comparison of the sign bit, simplify to and/test.
5561 bool TrueIfSigned = false;
5562 if (LHSI->hasOneUse() &&
5563 isSignBitCheck(ICI.getPredicate(), RHS, TrueIfSigned)) {
5564 // (X << 31) <s 0 --> (X&1) != 0
5565 Constant *Mask = ConstantInt::get(APInt(TypeBits, 1) <<
5566 (TypeBits-ShAmt->getZExtValue()-1));
5568 BinaryOperator::createAnd(LHSI->getOperand(0),
5569 Mask, LHSI->getName()+".mask");
5570 Value *And = InsertNewInstBefore(AndI, ICI);
5572 return new ICmpInst(TrueIfSigned ? ICmpInst::ICMP_NE : ICmpInst::ICMP_EQ,
5573 And, Constant::getNullValue(And->getType()));
5578 case Instruction::LShr: // (icmp pred (shr X, ShAmt), CI)
5579 case Instruction::AShr: {
5580 ConstantInt *ShAmt = dyn_cast<ConstantInt>(LHSI->getOperand(1));
5583 if (ICI.isEquality()) {
5584 // Check that the shift amount is in range. If not, don't perform
5585 // undefined shifts. When the shift is visited it will be
5587 uint32_t TypeBits = RHSV.getBitWidth();
5588 if (ShAmt->uge(TypeBits))
5590 uint32_t ShAmtVal = (uint32_t)ShAmt->getLimitedValue(TypeBits);
5592 // If we are comparing against bits always shifted out, the
5593 // comparison cannot succeed.
5594 APInt Comp = RHSV << ShAmtVal;
5595 if (LHSI->getOpcode() == Instruction::LShr)
5596 Comp = Comp.lshr(ShAmtVal);
5598 Comp = Comp.ashr(ShAmtVal);
5600 if (Comp != RHSV) { // Comparing against a bit that we know is zero.
5601 bool IsICMP_NE = ICI.getPredicate() == ICmpInst::ICMP_NE;
5602 Constant *Cst = ConstantInt::get(Type::Int1Ty, IsICMP_NE);
5603 return ReplaceInstUsesWith(ICI, Cst);
5606 if (LHSI->hasOneUse() || RHSV == 0) {
5607 // Otherwise strength reduce the shift into an and.
5608 APInt Val(APInt::getHighBitsSet(TypeBits, TypeBits - ShAmtVal));
5609 Constant *Mask = ConstantInt::get(Val);
5612 BinaryOperator::createAnd(LHSI->getOperand(0),
5613 Mask, LHSI->getName()+".mask");
5614 Value *And = InsertNewInstBefore(AndI, ICI);
5615 return new ICmpInst(ICI.getPredicate(), And,
5616 ConstantExpr::getShl(RHS, ShAmt));
5622 case Instruction::SDiv:
5623 case Instruction::UDiv:
5624 // Fold: icmp pred ([us]div X, C1), C2 -> range test
5625 // Fold this div into the comparison, producing a range check.
5626 // Determine, based on the divide type, what the range is being
5627 // checked. If there is an overflow on the low or high side, remember
5628 // it, otherwise compute the range [low, hi) bounding the new value.
5629 // See: InsertRangeTest above for the kinds of replacements possible.
5630 if (ConstantInt *DivRHS = dyn_cast<ConstantInt>(LHSI->getOperand(1)))
5631 if (Instruction *R = FoldICmpDivCst(ICI, cast<BinaryOperator>(LHSI),
5637 // Simplify icmp_eq and icmp_ne instructions with integer constant RHS.
5638 if (ICI.isEquality()) {
5639 bool isICMP_NE = ICI.getPredicate() == ICmpInst::ICMP_NE;
5641 // If the first operand is (add|sub|and|or|xor|rem) with a constant, and
5642 // the second operand is a constant, simplify a bit.
5643 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(LHSI)) {
5644 switch (BO->getOpcode()) {
5645 case Instruction::SRem:
5646 // If we have a signed (X % (2^c)) == 0, turn it into an unsigned one.
5647 if (RHSV == 0 && isa<ConstantInt>(BO->getOperand(1)) &&BO->hasOneUse()){
5648 const APInt &V = cast<ConstantInt>(BO->getOperand(1))->getValue();
5649 if (V.sgt(APInt(V.getBitWidth(), 1)) && V.isPowerOf2()) {
5650 Instruction *NewRem =
5651 BinaryOperator::createURem(BO->getOperand(0), BO->getOperand(1),
5653 InsertNewInstBefore(NewRem, ICI);
5654 return new ICmpInst(ICI.getPredicate(), NewRem,
5655 Constant::getNullValue(BO->getType()));
5659 case Instruction::Add:
5660 // Replace ((add A, B) != C) with (A != C-B) if B & C are constants.
5661 if (ConstantInt *BOp1C = dyn_cast<ConstantInt>(BO->getOperand(1))) {
5662 if (BO->hasOneUse())
5663 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
5664 Subtract(RHS, BOp1C));
5665 } else if (RHSV == 0) {
5666 // Replace ((add A, B) != 0) with (A != -B) if A or B is
5667 // efficiently invertible, or if the add has just this one use.
5668 Value *BOp0 = BO->getOperand(0), *BOp1 = BO->getOperand(1);
5670 if (Value *NegVal = dyn_castNegVal(BOp1))
5671 return new ICmpInst(ICI.getPredicate(), BOp0, NegVal);
5672 else if (Value *NegVal = dyn_castNegVal(BOp0))
5673 return new ICmpInst(ICI.getPredicate(), NegVal, BOp1);
5674 else if (BO->hasOneUse()) {
5675 Instruction *Neg = BinaryOperator::createNeg(BOp1);
5676 InsertNewInstBefore(Neg, ICI);
5678 return new ICmpInst(ICI.getPredicate(), BOp0, Neg);
5682 case Instruction::Xor:
5683 // For the xor case, we can xor two constants together, eliminating
5684 // the explicit xor.
5685 if (Constant *BOC = dyn_cast<Constant>(BO->getOperand(1)))
5686 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
5687 ConstantExpr::getXor(RHS, BOC));
5690 case Instruction::Sub:
5691 // Replace (([sub|xor] A, B) != 0) with (A != B)
5693 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
5697 case Instruction::Or:
5698 // If bits are being or'd in that are not present in the constant we
5699 // are comparing against, then the comparison could never succeed!
5700 if (Constant *BOC = dyn_cast<Constant>(BO->getOperand(1))) {
5701 Constant *NotCI = ConstantExpr::getNot(RHS);
5702 if (!ConstantExpr::getAnd(BOC, NotCI)->isNullValue())
5703 return ReplaceInstUsesWith(ICI, ConstantInt::get(Type::Int1Ty,
5708 case Instruction::And:
5709 if (ConstantInt *BOC = dyn_cast<ConstantInt>(BO->getOperand(1))) {
5710 // If bits are being compared against that are and'd out, then the
5711 // comparison can never succeed!
5712 if ((RHSV & ~BOC->getValue()) != 0)
5713 return ReplaceInstUsesWith(ICI, ConstantInt::get(Type::Int1Ty,
5716 // If we have ((X & C) == C), turn it into ((X & C) != 0).
5717 if (RHS == BOC && RHSV.isPowerOf2())
5718 return new ICmpInst(isICMP_NE ? ICmpInst::ICMP_EQ :
5719 ICmpInst::ICMP_NE, LHSI,
5720 Constant::getNullValue(RHS->getType()));
5722 // Replace (and X, (1 << size(X)-1) != 0) with x s< 0
5723 if (isSignBit(BOC)) {
5724 Value *X = BO->getOperand(0);
5725 Constant *Zero = Constant::getNullValue(X->getType());
5726 ICmpInst::Predicate pred = isICMP_NE ?
5727 ICmpInst::ICMP_SLT : ICmpInst::ICMP_SGE;
5728 return new ICmpInst(pred, X, Zero);
5731 // ((X & ~7) == 0) --> X < 8
5732 if (RHSV == 0 && isHighOnes(BOC)) {
5733 Value *X = BO->getOperand(0);
5734 Constant *NegX = ConstantExpr::getNeg(BOC);
5735 ICmpInst::Predicate pred = isICMP_NE ?
5736 ICmpInst::ICMP_UGE : ICmpInst::ICMP_ULT;
5737 return new ICmpInst(pred, X, NegX);
5742 } else if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(LHSI)) {
5743 // Handle icmp {eq|ne} <intrinsic>, intcst.
5744 if (II->getIntrinsicID() == Intrinsic::bswap) {
5746 ICI.setOperand(0, II->getOperand(1));
5747 ICI.setOperand(1, ConstantInt::get(RHSV.byteSwap()));
5751 } else { // Not a ICMP_EQ/ICMP_NE
5752 // If the LHS is a cast from an integral value of the same size,
5753 // then since we know the RHS is a constant, try to simlify.
5754 if (CastInst *Cast = dyn_cast<CastInst>(LHSI)) {
5755 Value *CastOp = Cast->getOperand(0);
5756 const Type *SrcTy = CastOp->getType();
5757 uint32_t SrcTySize = SrcTy->getPrimitiveSizeInBits();
5758 if (SrcTy->isInteger() &&
5759 SrcTySize == Cast->getType()->getPrimitiveSizeInBits()) {
5760 // If this is an unsigned comparison, try to make the comparison use
5761 // smaller constant values.
5762 if (ICI.getPredicate() == ICmpInst::ICMP_ULT && RHSV.isSignBit()) {
5763 // X u< 128 => X s> -1
5764 return new ICmpInst(ICmpInst::ICMP_SGT, CastOp,
5765 ConstantInt::get(APInt::getAllOnesValue(SrcTySize)));
5766 } else if (ICI.getPredicate() == ICmpInst::ICMP_UGT &&
5767 RHSV == APInt::getSignedMaxValue(SrcTySize)) {
5768 // X u> 127 => X s< 0
5769 return new ICmpInst(ICmpInst::ICMP_SLT, CastOp,
5770 Constant::getNullValue(SrcTy));
5778 /// visitICmpInstWithCastAndCast - Handle icmp (cast x to y), (cast/cst).
5779 /// We only handle extending casts so far.
5781 Instruction *InstCombiner::visitICmpInstWithCastAndCast(ICmpInst &ICI) {
5782 const CastInst *LHSCI = cast<CastInst>(ICI.getOperand(0));
5783 Value *LHSCIOp = LHSCI->getOperand(0);
5784 const Type *SrcTy = LHSCIOp->getType();
5785 const Type *DestTy = LHSCI->getType();
5788 // Turn icmp (ptrtoint x), (ptrtoint/c) into a compare of the input if the
5789 // integer type is the same size as the pointer type.
5790 if (LHSCI->getOpcode() == Instruction::PtrToInt &&
5791 getTargetData().getPointerSizeInBits() ==
5792 cast<IntegerType>(DestTy)->getBitWidth()) {
5794 if (Constant *RHSC = dyn_cast<Constant>(ICI.getOperand(1))) {
5795 RHSOp = ConstantExpr::getIntToPtr(RHSC, SrcTy);
5796 } else if (PtrToIntInst *RHSC = dyn_cast<PtrToIntInst>(ICI.getOperand(1))) {
5797 RHSOp = RHSC->getOperand(0);
5798 // If the pointer types don't match, insert a bitcast.
5799 if (LHSCIOp->getType() != RHSOp->getType())
5800 RHSOp = InsertBitCastBefore(RHSOp, LHSCIOp->getType(), ICI);
5804 return new ICmpInst(ICI.getPredicate(), LHSCIOp, RHSOp);
5807 // The code below only handles extension cast instructions, so far.
5809 if (LHSCI->getOpcode() != Instruction::ZExt &&
5810 LHSCI->getOpcode() != Instruction::SExt)
5813 bool isSignedExt = LHSCI->getOpcode() == Instruction::SExt;
5814 bool isSignedCmp = ICI.isSignedPredicate();
5816 if (CastInst *CI = dyn_cast<CastInst>(ICI.getOperand(1))) {
5817 // Not an extension from the same type?
5818 RHSCIOp = CI->getOperand(0);
5819 if (RHSCIOp->getType() != LHSCIOp->getType())
5822 // If the signedness of the two compares doesn't agree (i.e. one is a sext
5823 // and the other is a zext), then we can't handle this.
5824 if (CI->getOpcode() != LHSCI->getOpcode())
5827 // Likewise, if the signedness of the [sz]exts and the compare don't match,
5828 // then we can't handle this.
5829 if (isSignedExt != isSignedCmp && !ICI.isEquality())
5832 // Okay, just insert a compare of the reduced operands now!
5833 return new ICmpInst(ICI.getPredicate(), LHSCIOp, RHSCIOp);
5836 // If we aren't dealing with a constant on the RHS, exit early
5837 ConstantInt *CI = dyn_cast<ConstantInt>(ICI.getOperand(1));
5841 // Compute the constant that would happen if we truncated to SrcTy then
5842 // reextended to DestTy.
5843 Constant *Res1 = ConstantExpr::getTrunc(CI, SrcTy);
5844 Constant *Res2 = ConstantExpr::getCast(LHSCI->getOpcode(), Res1, DestTy);
5846 // If the re-extended constant didn't change...
5848 // Make sure that sign of the Cmp and the sign of the Cast are the same.
5849 // For example, we might have:
5850 // %A = sext short %X to uint
5851 // %B = icmp ugt uint %A, 1330
5852 // It is incorrect to transform this into
5853 // %B = icmp ugt short %X, 1330
5854 // because %A may have negative value.
5856 // However, it is OK if SrcTy is bool (See cast-set.ll testcase)
5857 // OR operation is EQ/NE.
5858 if (isSignedExt == isSignedCmp || SrcTy == Type::Int1Ty || ICI.isEquality())
5859 return new ICmpInst(ICI.getPredicate(), LHSCIOp, Res1);
5864 // The re-extended constant changed so the constant cannot be represented
5865 // in the shorter type. Consequently, we cannot emit a simple comparison.
5867 // First, handle some easy cases. We know the result cannot be equal at this
5868 // point so handle the ICI.isEquality() cases
5869 if (ICI.getPredicate() == ICmpInst::ICMP_EQ)
5870 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
5871 if (ICI.getPredicate() == ICmpInst::ICMP_NE)
5872 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
5874 // Evaluate the comparison for LT (we invert for GT below). LE and GE cases
5875 // should have been folded away previously and not enter in here.
5878 // We're performing a signed comparison.
5879 if (cast<ConstantInt>(CI)->getValue().isNegative())
5880 Result = ConstantInt::getFalse(); // X < (small) --> false
5882 Result = ConstantInt::getTrue(); // X < (large) --> true
5884 // We're performing an unsigned comparison.
5886 // We're performing an unsigned comp with a sign extended value.
5887 // This is true if the input is >= 0. [aka >s -1]
5888 Constant *NegOne = ConstantInt::getAllOnesValue(SrcTy);
5889 Result = InsertNewInstBefore(new ICmpInst(ICmpInst::ICMP_SGT, LHSCIOp,
5890 NegOne, ICI.getName()), ICI);
5892 // Unsigned extend & unsigned compare -> always true.
5893 Result = ConstantInt::getTrue();
5897 // Finally, return the value computed.
5898 if (ICI.getPredicate() == ICmpInst::ICMP_ULT ||
5899 ICI.getPredicate() == ICmpInst::ICMP_SLT) {
5900 return ReplaceInstUsesWith(ICI, Result);
5902 assert((ICI.getPredicate()==ICmpInst::ICMP_UGT ||
5903 ICI.getPredicate()==ICmpInst::ICMP_SGT) &&
5904 "ICmp should be folded!");
5905 if (Constant *CI = dyn_cast<Constant>(Result))
5906 return ReplaceInstUsesWith(ICI, ConstantExpr::getNot(CI));
5908 return BinaryOperator::createNot(Result);
5912 Instruction *InstCombiner::visitShl(BinaryOperator &I) {
5913 return commonShiftTransforms(I);
5916 Instruction *InstCombiner::visitLShr(BinaryOperator &I) {
5917 return commonShiftTransforms(I);
5920 Instruction *InstCombiner::visitAShr(BinaryOperator &I) {
5921 if (Instruction *R = commonShiftTransforms(I))
5924 Value *Op0 = I.getOperand(0);
5926 // ashr int -1, X = -1 (for any arithmetic shift rights of ~0)
5927 if (ConstantInt *CSI = dyn_cast<ConstantInt>(Op0))
5928 if (CSI->isAllOnesValue())
5929 return ReplaceInstUsesWith(I, CSI);
5931 // See if we can turn a signed shr into an unsigned shr.
5932 if (MaskedValueIsZero(Op0,
5933 APInt::getSignBit(I.getType()->getPrimitiveSizeInBits())))
5934 return BinaryOperator::createLShr(Op0, I.getOperand(1));
5939 Instruction *InstCombiner::commonShiftTransforms(BinaryOperator &I) {
5940 assert(I.getOperand(1)->getType() == I.getOperand(0)->getType());
5941 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
5943 // shl X, 0 == X and shr X, 0 == X
5944 // shl 0, X == 0 and shr 0, X == 0
5945 if (Op1 == Constant::getNullValue(Op1->getType()) ||
5946 Op0 == Constant::getNullValue(Op0->getType()))
5947 return ReplaceInstUsesWith(I, Op0);
5949 if (isa<UndefValue>(Op0)) {
5950 if (I.getOpcode() == Instruction::AShr) // undef >>s X -> undef
5951 return ReplaceInstUsesWith(I, Op0);
5952 else // undef << X -> 0, undef >>u X -> 0
5953 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
5955 if (isa<UndefValue>(Op1)) {
5956 if (I.getOpcode() == Instruction::AShr) // X >>s undef -> X
5957 return ReplaceInstUsesWith(I, Op0);
5958 else // X << undef, X >>u undef -> 0
5959 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
5962 // Try to fold constant and into select arguments.
5963 if (isa<Constant>(Op0))
5964 if (SelectInst *SI = dyn_cast<SelectInst>(Op1))
5965 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
5968 if (ConstantInt *CUI = dyn_cast<ConstantInt>(Op1))
5969 if (Instruction *Res = FoldShiftByConstant(Op0, CUI, I))
5974 Instruction *InstCombiner::FoldShiftByConstant(Value *Op0, ConstantInt *Op1,
5975 BinaryOperator &I) {
5976 bool isLeftShift = I.getOpcode() == Instruction::Shl;
5978 // See if we can simplify any instructions used by the instruction whose sole
5979 // purpose is to compute bits we don't care about.
5980 uint32_t TypeBits = Op0->getType()->getPrimitiveSizeInBits();
5981 APInt KnownZero(TypeBits, 0), KnownOne(TypeBits, 0);
5982 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(TypeBits),
5983 KnownZero, KnownOne))
5986 // shl uint X, 32 = 0 and shr ubyte Y, 9 = 0, ... just don't eliminate shr
5987 // of a signed value.
5989 if (Op1->uge(TypeBits)) {
5990 if (I.getOpcode() != Instruction::AShr)
5991 return ReplaceInstUsesWith(I, Constant::getNullValue(Op0->getType()));
5993 I.setOperand(1, ConstantInt::get(I.getType(), TypeBits-1));
5998 // ((X*C1) << C2) == (X * (C1 << C2))
5999 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(Op0))
6000 if (BO->getOpcode() == Instruction::Mul && isLeftShift)
6001 if (Constant *BOOp = dyn_cast<Constant>(BO->getOperand(1)))
6002 return BinaryOperator::createMul(BO->getOperand(0),
6003 ConstantExpr::getShl(BOOp, Op1));
6005 // Try to fold constant and into select arguments.
6006 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
6007 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
6009 if (isa<PHINode>(Op0))
6010 if (Instruction *NV = FoldOpIntoPhi(I))
6013 // Fold shift2(trunc(shift1(x,c1)), c2) -> trunc(shift2(shift1(x,c1),c2))
6014 if (TruncInst *TI = dyn_cast<TruncInst>(Op0)) {
6015 Instruction *TrOp = dyn_cast<Instruction>(TI->getOperand(0));
6016 // If 'shift2' is an ashr, we would have to get the sign bit into a funny
6017 // place. Don't try to do this transformation in this case. Also, we
6018 // require that the input operand is a shift-by-constant so that we have
6019 // confidence that the shifts will get folded together. We could do this
6020 // xform in more cases, but it is unlikely to be profitable.
6021 if (TrOp && I.isLogicalShift() && TrOp->isShift() &&
6022 isa<ConstantInt>(TrOp->getOperand(1))) {
6023 // Okay, we'll do this xform. Make the shift of shift.
6024 Constant *ShAmt = ConstantExpr::getZExt(Op1, TrOp->getType());
6025 Instruction *NSh = BinaryOperator::create(I.getOpcode(), TrOp, ShAmt,
6027 InsertNewInstBefore(NSh, I); // (shift2 (shift1 & 0x00FF), c2)
6029 // For logical shifts, the truncation has the effect of making the high
6030 // part of the register be zeros. Emulate this by inserting an AND to
6031 // clear the top bits as needed. This 'and' will usually be zapped by
6032 // other xforms later if dead.
6033 unsigned SrcSize = TrOp->getType()->getPrimitiveSizeInBits();
6034 unsigned DstSize = TI->getType()->getPrimitiveSizeInBits();
6035 APInt MaskV(APInt::getLowBitsSet(SrcSize, DstSize));
6037 // The mask we constructed says what the trunc would do if occurring
6038 // between the shifts. We want to know the effect *after* the second
6039 // shift. We know that it is a logical shift by a constant, so adjust the
6040 // mask as appropriate.
6041 if (I.getOpcode() == Instruction::Shl)
6042 MaskV <<= Op1->getZExtValue();
6044 assert(I.getOpcode() == Instruction::LShr && "Unknown logical shift");
6045 MaskV = MaskV.lshr(Op1->getZExtValue());
6048 Instruction *And = BinaryOperator::createAnd(NSh, ConstantInt::get(MaskV),
6050 InsertNewInstBefore(And, I); // shift1 & 0x00FF
6052 // Return the value truncated to the interesting size.
6053 return new TruncInst(And, I.getType());
6057 if (Op0->hasOneUse()) {
6058 if (BinaryOperator *Op0BO = dyn_cast<BinaryOperator>(Op0)) {
6059 // Turn ((X >> C) + Y) << C -> (X + (Y << C)) & (~0 << C)
6062 switch (Op0BO->getOpcode()) {
6064 case Instruction::Add:
6065 case Instruction::And:
6066 case Instruction::Or:
6067 case Instruction::Xor: {
6068 // These operators commute.
6069 // Turn (Y + (X >> C)) << C -> (X + (Y << C)) & (~0 << C)
6070 if (isLeftShift && Op0BO->getOperand(1)->hasOneUse() &&
6071 match(Op0BO->getOperand(1),
6072 m_Shr(m_Value(V1), m_ConstantInt(CC))) && CC == Op1) {
6073 Instruction *YS = BinaryOperator::createShl(
6074 Op0BO->getOperand(0), Op1,
6076 InsertNewInstBefore(YS, I); // (Y << C)
6078 BinaryOperator::create(Op0BO->getOpcode(), YS, V1,
6079 Op0BO->getOperand(1)->getName());
6080 InsertNewInstBefore(X, I); // (X + (Y << C))
6081 uint32_t Op1Val = Op1->getLimitedValue(TypeBits);
6082 return BinaryOperator::createAnd(X, ConstantInt::get(
6083 APInt::getHighBitsSet(TypeBits, TypeBits-Op1Val)));
6086 // Turn (Y + ((X >> C) & CC)) << C -> ((X & (CC << C)) + (Y << C))
6087 Value *Op0BOOp1 = Op0BO->getOperand(1);
6088 if (isLeftShift && Op0BOOp1->hasOneUse() &&
6090 m_And(m_Shr(m_Value(V1), m_Value(V2)),m_ConstantInt(CC))) &&
6091 cast<BinaryOperator>(Op0BOOp1)->getOperand(0)->hasOneUse() &&
6093 Instruction *YS = BinaryOperator::createShl(
6094 Op0BO->getOperand(0), Op1,
6096 InsertNewInstBefore(YS, I); // (Y << C)
6098 BinaryOperator::createAnd(V1, ConstantExpr::getShl(CC, Op1),
6099 V1->getName()+".mask");
6100 InsertNewInstBefore(XM, I); // X & (CC << C)
6102 return BinaryOperator::create(Op0BO->getOpcode(), YS, XM);
6107 case Instruction::Sub: {
6108 // Turn ((X >> C) + Y) << C -> (X + (Y << C)) & (~0 << C)
6109 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() &&
6110 match(Op0BO->getOperand(0),
6111 m_Shr(m_Value(V1), m_ConstantInt(CC))) && CC == Op1) {
6112 Instruction *YS = BinaryOperator::createShl(
6113 Op0BO->getOperand(1), Op1,
6115 InsertNewInstBefore(YS, I); // (Y << C)
6117 BinaryOperator::create(Op0BO->getOpcode(), V1, YS,
6118 Op0BO->getOperand(0)->getName());
6119 InsertNewInstBefore(X, I); // (X + (Y << C))
6120 uint32_t Op1Val = Op1->getLimitedValue(TypeBits);
6121 return BinaryOperator::createAnd(X, ConstantInt::get(
6122 APInt::getHighBitsSet(TypeBits, TypeBits-Op1Val)));
6125 // Turn (((X >> C)&CC) + Y) << C -> (X + (Y << C)) & (CC << C)
6126 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() &&
6127 match(Op0BO->getOperand(0),
6128 m_And(m_Shr(m_Value(V1), m_Value(V2)),
6129 m_ConstantInt(CC))) && V2 == Op1 &&
6130 cast<BinaryOperator>(Op0BO->getOperand(0))
6131 ->getOperand(0)->hasOneUse()) {
6132 Instruction *YS = BinaryOperator::createShl(
6133 Op0BO->getOperand(1), Op1,
6135 InsertNewInstBefore(YS, I); // (Y << C)
6137 BinaryOperator::createAnd(V1, ConstantExpr::getShl(CC, Op1),
6138 V1->getName()+".mask");
6139 InsertNewInstBefore(XM, I); // X & (CC << C)
6141 return BinaryOperator::create(Op0BO->getOpcode(), XM, YS);
6149 // If the operand is an bitwise operator with a constant RHS, and the
6150 // shift is the only use, we can pull it out of the shift.
6151 if (ConstantInt *Op0C = dyn_cast<ConstantInt>(Op0BO->getOperand(1))) {
6152 bool isValid = true; // Valid only for And, Or, Xor
6153 bool highBitSet = false; // Transform if high bit of constant set?
6155 switch (Op0BO->getOpcode()) {
6156 default: isValid = false; break; // Do not perform transform!
6157 case Instruction::Add:
6158 isValid = isLeftShift;
6160 case Instruction::Or:
6161 case Instruction::Xor:
6164 case Instruction::And:
6169 // If this is a signed shift right, and the high bit is modified
6170 // by the logical operation, do not perform the transformation.
6171 // The highBitSet boolean indicates the value of the high bit of
6172 // the constant which would cause it to be modified for this
6175 if (isValid && I.getOpcode() == Instruction::AShr)
6176 isValid = Op0C->getValue()[TypeBits-1] == highBitSet;
6179 Constant *NewRHS = ConstantExpr::get(I.getOpcode(), Op0C, Op1);
6181 Instruction *NewShift =
6182 BinaryOperator::create(I.getOpcode(), Op0BO->getOperand(0), Op1);
6183 InsertNewInstBefore(NewShift, I);
6184 NewShift->takeName(Op0BO);
6186 return BinaryOperator::create(Op0BO->getOpcode(), NewShift,
6193 // Find out if this is a shift of a shift by a constant.
6194 BinaryOperator *ShiftOp = dyn_cast<BinaryOperator>(Op0);
6195 if (ShiftOp && !ShiftOp->isShift())
6198 if (ShiftOp && isa<ConstantInt>(ShiftOp->getOperand(1))) {
6199 ConstantInt *ShiftAmt1C = cast<ConstantInt>(ShiftOp->getOperand(1));
6200 uint32_t ShiftAmt1 = ShiftAmt1C->getLimitedValue(TypeBits);
6201 uint32_t ShiftAmt2 = Op1->getLimitedValue(TypeBits);
6202 assert(ShiftAmt2 != 0 && "Should have been simplified earlier");
6203 if (ShiftAmt1 == 0) return 0; // Will be simplified in the future.
6204 Value *X = ShiftOp->getOperand(0);
6206 uint32_t AmtSum = ShiftAmt1+ShiftAmt2; // Fold into one big shift.
6207 if (AmtSum > TypeBits)
6210 const IntegerType *Ty = cast<IntegerType>(I.getType());
6212 // Check for (X << c1) << c2 and (X >> c1) >> c2
6213 if (I.getOpcode() == ShiftOp->getOpcode()) {
6214 return BinaryOperator::create(I.getOpcode(), X,
6215 ConstantInt::get(Ty, AmtSum));
6216 } else if (ShiftOp->getOpcode() == Instruction::LShr &&
6217 I.getOpcode() == Instruction::AShr) {
6218 // ((X >>u C1) >>s C2) -> (X >>u (C1+C2)) since C1 != 0.
6219 return BinaryOperator::createLShr(X, ConstantInt::get(Ty, AmtSum));
6220 } else if (ShiftOp->getOpcode() == Instruction::AShr &&
6221 I.getOpcode() == Instruction::LShr) {
6222 // ((X >>s C1) >>u C2) -> ((X >>s (C1+C2)) & mask) since C1 != 0.
6223 Instruction *Shift =
6224 BinaryOperator::createAShr(X, ConstantInt::get(Ty, AmtSum));
6225 InsertNewInstBefore(Shift, I);
6227 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt2));
6228 return BinaryOperator::createAnd(Shift, ConstantInt::get(Mask));
6231 // Okay, if we get here, one shift must be left, and the other shift must be
6232 // right. See if the amounts are equal.
6233 if (ShiftAmt1 == ShiftAmt2) {
6234 // If we have ((X >>? C) << C), turn this into X & (-1 << C).
6235 if (I.getOpcode() == Instruction::Shl) {
6236 APInt Mask(APInt::getHighBitsSet(TypeBits, TypeBits - ShiftAmt1));
6237 return BinaryOperator::createAnd(X, ConstantInt::get(Mask));
6239 // If we have ((X << C) >>u C), turn this into X & (-1 >>u C).
6240 if (I.getOpcode() == Instruction::LShr) {
6241 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt1));
6242 return BinaryOperator::createAnd(X, ConstantInt::get(Mask));
6244 // We can simplify ((X << C) >>s C) into a trunc + sext.
6245 // NOTE: we could do this for any C, but that would make 'unusual' integer
6246 // types. For now, just stick to ones well-supported by the code
6248 const Type *SExtType = 0;
6249 switch (Ty->getBitWidth() - ShiftAmt1) {
6256 SExtType = IntegerType::get(Ty->getBitWidth() - ShiftAmt1);
6261 Instruction *NewTrunc = new TruncInst(X, SExtType, "sext");
6262 InsertNewInstBefore(NewTrunc, I);
6263 return new SExtInst(NewTrunc, Ty);
6265 // Otherwise, we can't handle it yet.
6266 } else if (ShiftAmt1 < ShiftAmt2) {
6267 uint32_t ShiftDiff = ShiftAmt2-ShiftAmt1;
6269 // (X >>? C1) << C2 --> X << (C2-C1) & (-1 << C2)
6270 if (I.getOpcode() == Instruction::Shl) {
6271 assert(ShiftOp->getOpcode() == Instruction::LShr ||
6272 ShiftOp->getOpcode() == Instruction::AShr);
6273 Instruction *Shift =
6274 BinaryOperator::createShl(X, ConstantInt::get(Ty, ShiftDiff));
6275 InsertNewInstBefore(Shift, I);
6277 APInt Mask(APInt::getHighBitsSet(TypeBits, TypeBits - ShiftAmt2));
6278 return BinaryOperator::createAnd(Shift, ConstantInt::get(Mask));
6281 // (X << C1) >>u C2 --> X >>u (C2-C1) & (-1 >> C2)
6282 if (I.getOpcode() == Instruction::LShr) {
6283 assert(ShiftOp->getOpcode() == Instruction::Shl);
6284 Instruction *Shift =
6285 BinaryOperator::createLShr(X, ConstantInt::get(Ty, ShiftDiff));
6286 InsertNewInstBefore(Shift, I);
6288 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt2));
6289 return BinaryOperator::createAnd(Shift, ConstantInt::get(Mask));
6292 // We can't handle (X << C1) >>s C2, it shifts arbitrary bits in.
6294 assert(ShiftAmt2 < ShiftAmt1);
6295 uint32_t ShiftDiff = ShiftAmt1-ShiftAmt2;
6297 // (X >>? C1) << C2 --> X >>? (C1-C2) & (-1 << C2)
6298 if (I.getOpcode() == Instruction::Shl) {
6299 assert(ShiftOp->getOpcode() == Instruction::LShr ||
6300 ShiftOp->getOpcode() == Instruction::AShr);
6301 Instruction *Shift =
6302 BinaryOperator::create(ShiftOp->getOpcode(), X,
6303 ConstantInt::get(Ty, ShiftDiff));
6304 InsertNewInstBefore(Shift, I);
6306 APInt Mask(APInt::getHighBitsSet(TypeBits, TypeBits - ShiftAmt2));
6307 return BinaryOperator::createAnd(Shift, ConstantInt::get(Mask));
6310 // (X << C1) >>u C2 --> X << (C1-C2) & (-1 >> C2)
6311 if (I.getOpcode() == Instruction::LShr) {
6312 assert(ShiftOp->getOpcode() == Instruction::Shl);
6313 Instruction *Shift =
6314 BinaryOperator::createShl(X, ConstantInt::get(Ty, ShiftDiff));
6315 InsertNewInstBefore(Shift, I);
6317 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt2));
6318 return BinaryOperator::createAnd(Shift, ConstantInt::get(Mask));
6321 // We can't handle (X << C1) >>a C2, it shifts arbitrary bits in.
6328 /// DecomposeSimpleLinearExpr - Analyze 'Val', seeing if it is a simple linear
6329 /// expression. If so, decompose it, returning some value X, such that Val is
6332 static Value *DecomposeSimpleLinearExpr(Value *Val, unsigned &Scale,
6334 assert(Val->getType() == Type::Int32Ty && "Unexpected allocation size type!");
6335 if (ConstantInt *CI = dyn_cast<ConstantInt>(Val)) {
6336 Offset = CI->getZExtValue();
6338 return ConstantInt::get(Type::Int32Ty, 0);
6339 } else if (BinaryOperator *I = dyn_cast<BinaryOperator>(Val)) {
6340 if (ConstantInt *RHS = dyn_cast<ConstantInt>(I->getOperand(1))) {
6341 if (I->getOpcode() == Instruction::Shl) {
6342 // This is a value scaled by '1 << the shift amt'.
6343 Scale = 1U << RHS->getZExtValue();
6345 return I->getOperand(0);
6346 } else if (I->getOpcode() == Instruction::Mul) {
6347 // This value is scaled by 'RHS'.
6348 Scale = RHS->getZExtValue();
6350 return I->getOperand(0);
6351 } else if (I->getOpcode() == Instruction::Add) {
6352 // We have X+C. Check to see if we really have (X*C2)+C1,
6353 // where C1 is divisible by C2.
6356 DecomposeSimpleLinearExpr(I->getOperand(0), SubScale, Offset);
6357 Offset += RHS->getZExtValue();
6364 // Otherwise, we can't look past this.
6371 /// PromoteCastOfAllocation - If we find a cast of an allocation instruction,
6372 /// try to eliminate the cast by moving the type information into the alloc.
6373 Instruction *InstCombiner::PromoteCastOfAllocation(BitCastInst &CI,
6374 AllocationInst &AI) {
6375 const PointerType *PTy = cast<PointerType>(CI.getType());
6377 // Remove any uses of AI that are dead.
6378 assert(!CI.use_empty() && "Dead instructions should be removed earlier!");
6380 for (Value::use_iterator UI = AI.use_begin(), E = AI.use_end(); UI != E; ) {
6381 Instruction *User = cast<Instruction>(*UI++);
6382 if (isInstructionTriviallyDead(User)) {
6383 while (UI != E && *UI == User)
6384 ++UI; // If this instruction uses AI more than once, don't break UI.
6387 DOUT << "IC: DCE: " << *User;
6388 EraseInstFromFunction(*User);
6392 // Get the type really allocated and the type casted to.
6393 const Type *AllocElTy = AI.getAllocatedType();
6394 const Type *CastElTy = PTy->getElementType();
6395 if (!AllocElTy->isSized() || !CastElTy->isSized()) return 0;
6397 unsigned AllocElTyAlign = TD->getABITypeAlignment(AllocElTy);
6398 unsigned CastElTyAlign = TD->getABITypeAlignment(CastElTy);
6399 if (CastElTyAlign < AllocElTyAlign) return 0;
6401 // If the allocation has multiple uses, only promote it if we are strictly
6402 // increasing the alignment of the resultant allocation. If we keep it the
6403 // same, we open the door to infinite loops of various kinds.
6404 if (!AI.hasOneUse() && CastElTyAlign == AllocElTyAlign) return 0;
6406 uint64_t AllocElTySize = TD->getABITypeSize(AllocElTy);
6407 uint64_t CastElTySize = TD->getABITypeSize(CastElTy);
6408 if (CastElTySize == 0 || AllocElTySize == 0) return 0;
6410 // See if we can satisfy the modulus by pulling a scale out of the array
6412 unsigned ArraySizeScale;
6414 Value *NumElements = // See if the array size is a decomposable linear expr.
6415 DecomposeSimpleLinearExpr(AI.getOperand(0), ArraySizeScale, ArrayOffset);
6417 // If we can now satisfy the modulus, by using a non-1 scale, we really can
6419 if ((AllocElTySize*ArraySizeScale) % CastElTySize != 0 ||
6420 (AllocElTySize*ArrayOffset ) % CastElTySize != 0) return 0;
6422 unsigned Scale = (AllocElTySize*ArraySizeScale)/CastElTySize;
6427 // If the allocation size is constant, form a constant mul expression
6428 Amt = ConstantInt::get(Type::Int32Ty, Scale);
6429 if (isa<ConstantInt>(NumElements))
6430 Amt = Multiply(cast<ConstantInt>(NumElements), cast<ConstantInt>(Amt));
6431 // otherwise multiply the amount and the number of elements
6432 else if (Scale != 1) {
6433 Instruction *Tmp = BinaryOperator::createMul(Amt, NumElements, "tmp");
6434 Amt = InsertNewInstBefore(Tmp, AI);
6438 if (int Offset = (AllocElTySize*ArrayOffset)/CastElTySize) {
6439 Value *Off = ConstantInt::get(Type::Int32Ty, Offset, true);
6440 Instruction *Tmp = BinaryOperator::createAdd(Amt, Off, "tmp");
6441 Amt = InsertNewInstBefore(Tmp, AI);
6444 AllocationInst *New;
6445 if (isa<MallocInst>(AI))
6446 New = new MallocInst(CastElTy, Amt, AI.getAlignment());
6448 New = new AllocaInst(CastElTy, Amt, AI.getAlignment());
6449 InsertNewInstBefore(New, AI);
6452 // If the allocation has multiple uses, insert a cast and change all things
6453 // that used it to use the new cast. This will also hack on CI, but it will
6455 if (!AI.hasOneUse()) {
6456 AddUsesToWorkList(AI);
6457 // New is the allocation instruction, pointer typed. AI is the original
6458 // allocation instruction, also pointer typed. Thus, cast to use is BitCast.
6459 CastInst *NewCast = new BitCastInst(New, AI.getType(), "tmpcast");
6460 InsertNewInstBefore(NewCast, AI);
6461 AI.replaceAllUsesWith(NewCast);
6463 return ReplaceInstUsesWith(CI, New);
6466 /// CanEvaluateInDifferentType - Return true if we can take the specified value
6467 /// and return it as type Ty without inserting any new casts and without
6468 /// changing the computed value. This is used by code that tries to decide
6469 /// whether promoting or shrinking integer operations to wider or smaller types
6470 /// will allow us to eliminate a truncate or extend.
6472 /// This is a truncation operation if Ty is smaller than V->getType(), or an
6473 /// extension operation if Ty is larger.
6474 static bool CanEvaluateInDifferentType(Value *V, const IntegerType *Ty,
6475 unsigned CastOpc, int &NumCastsRemoved) {
6476 // We can always evaluate constants in another type.
6477 if (isa<ConstantInt>(V))
6480 Instruction *I = dyn_cast<Instruction>(V);
6481 if (!I) return false;
6483 const IntegerType *OrigTy = cast<IntegerType>(V->getType());
6485 // If this is an extension or truncate, we can often eliminate it.
6486 if (isa<TruncInst>(I) || isa<ZExtInst>(I) || isa<SExtInst>(I)) {
6487 // If this is a cast from the destination type, we can trivially eliminate
6488 // it, and this will remove a cast overall.
6489 if (I->getOperand(0)->getType() == Ty) {
6490 // If the first operand is itself a cast, and is eliminable, do not count
6491 // this as an eliminable cast. We would prefer to eliminate those two
6493 if (!isa<CastInst>(I->getOperand(0)))
6499 // We can't extend or shrink something that has multiple uses: doing so would
6500 // require duplicating the instruction in general, which isn't profitable.
6501 if (!I->hasOneUse()) return false;
6503 switch (I->getOpcode()) {
6504 case Instruction::Add:
6505 case Instruction::Sub:
6506 case Instruction::And:
6507 case Instruction::Or:
6508 case Instruction::Xor:
6509 // These operators can all arbitrarily be extended or truncated.
6510 return CanEvaluateInDifferentType(I->getOperand(0), Ty, CastOpc,
6512 CanEvaluateInDifferentType(I->getOperand(1), Ty, CastOpc,
6515 case Instruction::Shl:
6516 // If we are truncating the result of this SHL, and if it's a shift of a
6517 // constant amount, we can always perform a SHL in a smaller type.
6518 if (ConstantInt *CI = dyn_cast<ConstantInt>(I->getOperand(1))) {
6519 uint32_t BitWidth = Ty->getBitWidth();
6520 if (BitWidth < OrigTy->getBitWidth() &&
6521 CI->getLimitedValue(BitWidth) < BitWidth)
6522 return CanEvaluateInDifferentType(I->getOperand(0), Ty, CastOpc,
6526 case Instruction::LShr:
6527 // If this is a truncate of a logical shr, we can truncate it to a smaller
6528 // lshr iff we know that the bits we would otherwise be shifting in are
6530 if (ConstantInt *CI = dyn_cast<ConstantInt>(I->getOperand(1))) {
6531 uint32_t OrigBitWidth = OrigTy->getBitWidth();
6532 uint32_t BitWidth = Ty->getBitWidth();
6533 if (BitWidth < OrigBitWidth &&
6534 MaskedValueIsZero(I->getOperand(0),
6535 APInt::getHighBitsSet(OrigBitWidth, OrigBitWidth-BitWidth)) &&
6536 CI->getLimitedValue(BitWidth) < BitWidth) {
6537 return CanEvaluateInDifferentType(I->getOperand(0), Ty, CastOpc,
6542 case Instruction::ZExt:
6543 case Instruction::SExt:
6544 case Instruction::Trunc:
6545 // If this is the same kind of case as our original (e.g. zext+zext), we
6546 // can safely replace it. Note that replacing it does not reduce the number
6547 // of casts in the input.
6548 if (I->getOpcode() == CastOpc)
6553 // TODO: Can handle more cases here.
6560 /// EvaluateInDifferentType - Given an expression that
6561 /// CanEvaluateInDifferentType returns true for, actually insert the code to
6562 /// evaluate the expression.
6563 Value *InstCombiner::EvaluateInDifferentType(Value *V, const Type *Ty,
6565 if (Constant *C = dyn_cast<Constant>(V))
6566 return ConstantExpr::getIntegerCast(C, Ty, isSigned /*Sext or ZExt*/);
6568 // Otherwise, it must be an instruction.
6569 Instruction *I = cast<Instruction>(V);
6570 Instruction *Res = 0;
6571 switch (I->getOpcode()) {
6572 case Instruction::Add:
6573 case Instruction::Sub:
6574 case Instruction::And:
6575 case Instruction::Or:
6576 case Instruction::Xor:
6577 case Instruction::AShr:
6578 case Instruction::LShr:
6579 case Instruction::Shl: {
6580 Value *LHS = EvaluateInDifferentType(I->getOperand(0), Ty, isSigned);
6581 Value *RHS = EvaluateInDifferentType(I->getOperand(1), Ty, isSigned);
6582 Res = BinaryOperator::create((Instruction::BinaryOps)I->getOpcode(),
6583 LHS, RHS, I->getName());
6586 case Instruction::Trunc:
6587 case Instruction::ZExt:
6588 case Instruction::SExt:
6589 // If the source type of the cast is the type we're trying for then we can
6590 // just return the source. There's no need to insert it because it is not
6592 if (I->getOperand(0)->getType() == Ty)
6593 return I->getOperand(0);
6595 // Otherwise, must be the same type of case, so just reinsert a new one.
6596 Res = CastInst::create(cast<CastInst>(I)->getOpcode(), I->getOperand(0),
6600 // TODO: Can handle more cases here.
6601 assert(0 && "Unreachable!");
6605 return InsertNewInstBefore(Res, *I);
6608 /// @brief Implement the transforms common to all CastInst visitors.
6609 Instruction *InstCombiner::commonCastTransforms(CastInst &CI) {
6610 Value *Src = CI.getOperand(0);
6612 // Many cases of "cast of a cast" are eliminable. If it's eliminable we just
6613 // eliminate it now.
6614 if (CastInst *CSrc = dyn_cast<CastInst>(Src)) { // A->B->C cast
6615 if (Instruction::CastOps opc =
6616 isEliminableCastPair(CSrc, CI.getOpcode(), CI.getType(), TD)) {
6617 // The first cast (CSrc) is eliminable so we need to fix up or replace
6618 // the second cast (CI). CSrc will then have a good chance of being dead.
6619 return CastInst::create(opc, CSrc->getOperand(0), CI.getType());
6623 // If we are casting a select then fold the cast into the select
6624 if (SelectInst *SI = dyn_cast<SelectInst>(Src))
6625 if (Instruction *NV = FoldOpIntoSelect(CI, SI, this))
6628 // If we are casting a PHI then fold the cast into the PHI
6629 if (isa<PHINode>(Src))
6630 if (Instruction *NV = FoldOpIntoPhi(CI))
6636 /// @brief Implement the transforms for cast of pointer (bitcast/ptrtoint)
6637 Instruction *InstCombiner::commonPointerCastTransforms(CastInst &CI) {
6638 Value *Src = CI.getOperand(0);
6640 if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Src)) {
6641 // If casting the result of a getelementptr instruction with no offset, turn
6642 // this into a cast of the original pointer!
6643 if (GEP->hasAllZeroIndices()) {
6644 // Changing the cast operand is usually not a good idea but it is safe
6645 // here because the pointer operand is being replaced with another
6646 // pointer operand so the opcode doesn't need to change.
6648 CI.setOperand(0, GEP->getOperand(0));
6652 // If the GEP has a single use, and the base pointer is a bitcast, and the
6653 // GEP computes a constant offset, see if we can convert these three
6654 // instructions into fewer. This typically happens with unions and other
6655 // non-type-safe code.
6656 if (GEP->hasOneUse() && isa<BitCastInst>(GEP->getOperand(0))) {
6657 if (GEP->hasAllConstantIndices()) {
6658 // We are guaranteed to get a constant from EmitGEPOffset.
6659 ConstantInt *OffsetV = cast<ConstantInt>(EmitGEPOffset(GEP, CI, *this));
6660 int64_t Offset = OffsetV->getSExtValue();
6662 // Get the base pointer input of the bitcast, and the type it points to.
6663 Value *OrigBase = cast<BitCastInst>(GEP->getOperand(0))->getOperand(0);
6664 const Type *GEPIdxTy =
6665 cast<PointerType>(OrigBase->getType())->getElementType();
6666 if (GEPIdxTy->isSized()) {
6667 SmallVector<Value*, 8> NewIndices;
6669 // Start with the index over the outer type. Note that the type size
6670 // might be zero (even if the offset isn't zero) if the indexed type
6671 // is something like [0 x {int, int}]
6672 const Type *IntPtrTy = TD->getIntPtrType();
6673 int64_t FirstIdx = 0;
6674 if (int64_t TySize = TD->getABITypeSize(GEPIdxTy)) {
6675 FirstIdx = Offset/TySize;
6678 // Handle silly modulus not returning values values [0..TySize).
6682 assert(Offset >= 0);
6684 assert((uint64_t)Offset < (uint64_t)TySize &&"Out of range offset");
6687 NewIndices.push_back(ConstantInt::get(IntPtrTy, FirstIdx));
6689 // Index into the types. If we fail, set OrigBase to null.
6691 if (const StructType *STy = dyn_cast<StructType>(GEPIdxTy)) {
6692 const StructLayout *SL = TD->getStructLayout(STy);
6693 if (Offset < (int64_t)SL->getSizeInBytes()) {
6694 unsigned Elt = SL->getElementContainingOffset(Offset);
6695 NewIndices.push_back(ConstantInt::get(Type::Int32Ty, Elt));
6697 Offset -= SL->getElementOffset(Elt);
6698 GEPIdxTy = STy->getElementType(Elt);
6700 // Otherwise, we can't index into this, bail out.
6704 } else if (isa<ArrayType>(GEPIdxTy) || isa<VectorType>(GEPIdxTy)) {
6705 const SequentialType *STy = cast<SequentialType>(GEPIdxTy);
6706 if (uint64_t EltSize = TD->getABITypeSize(STy->getElementType())){
6707 NewIndices.push_back(ConstantInt::get(IntPtrTy,Offset/EltSize));
6710 NewIndices.push_back(ConstantInt::get(IntPtrTy, 0));
6712 GEPIdxTy = STy->getElementType();
6714 // Otherwise, we can't index into this, bail out.
6720 // If we were able to index down into an element, create the GEP
6721 // and bitcast the result. This eliminates one bitcast, potentially
6723 Instruction *NGEP = new GetElementPtrInst(OrigBase,
6725 NewIndices.end(), "");
6726 InsertNewInstBefore(NGEP, CI);
6727 NGEP->takeName(GEP);
6729 if (isa<BitCastInst>(CI))
6730 return new BitCastInst(NGEP, CI.getType());
6731 assert(isa<PtrToIntInst>(CI));
6732 return new PtrToIntInst(NGEP, CI.getType());
6739 return commonCastTransforms(CI);
6744 /// Only the TRUNC, ZEXT, SEXT, and BITCAST can both operand and result as
6745 /// integer types. This function implements the common transforms for all those
6747 /// @brief Implement the transforms common to CastInst with integer operands
6748 Instruction *InstCombiner::commonIntCastTransforms(CastInst &CI) {
6749 if (Instruction *Result = commonCastTransforms(CI))
6752 Value *Src = CI.getOperand(0);
6753 const Type *SrcTy = Src->getType();
6754 const Type *DestTy = CI.getType();
6755 uint32_t SrcBitSize = SrcTy->getPrimitiveSizeInBits();
6756 uint32_t DestBitSize = DestTy->getPrimitiveSizeInBits();
6758 // See if we can simplify any instructions used by the LHS whose sole
6759 // purpose is to compute bits we don't care about.
6760 APInt KnownZero(DestBitSize, 0), KnownOne(DestBitSize, 0);
6761 if (SimplifyDemandedBits(&CI, APInt::getAllOnesValue(DestBitSize),
6762 KnownZero, KnownOne))
6765 // If the source isn't an instruction or has more than one use then we
6766 // can't do anything more.
6767 Instruction *SrcI = dyn_cast<Instruction>(Src);
6768 if (!SrcI || !Src->hasOneUse())
6771 // Attempt to propagate the cast into the instruction for int->int casts.
6772 int NumCastsRemoved = 0;
6773 if (!isa<BitCastInst>(CI) &&
6774 CanEvaluateInDifferentType(SrcI, cast<IntegerType>(DestTy),
6775 CI.getOpcode(), NumCastsRemoved)) {
6776 // If this cast is a truncate, evaluting in a different type always
6777 // eliminates the cast, so it is always a win. If this is a zero-extension,
6778 // we need to do an AND to maintain the clear top-part of the computation,
6779 // so we require that the input have eliminated at least one cast. If this
6780 // is a sign extension, we insert two new casts (to do the extension) so we
6781 // require that two casts have been eliminated.
6783 switch (CI.getOpcode()) {
6785 // All the others use floating point so we shouldn't actually
6786 // get here because of the check above.
6787 assert(0 && "Unknown cast type");
6788 case Instruction::Trunc:
6791 case Instruction::ZExt:
6792 DoXForm = NumCastsRemoved >= 1;
6794 case Instruction::SExt:
6795 DoXForm = NumCastsRemoved >= 2;
6800 Value *Res = EvaluateInDifferentType(SrcI, DestTy,
6801 CI.getOpcode() == Instruction::SExt);
6802 assert(Res->getType() == DestTy);
6803 switch (CI.getOpcode()) {
6804 default: assert(0 && "Unknown cast type!");
6805 case Instruction::Trunc:
6806 case Instruction::BitCast:
6807 // Just replace this cast with the result.
6808 return ReplaceInstUsesWith(CI, Res);
6809 case Instruction::ZExt: {
6810 // We need to emit an AND to clear the high bits.
6811 assert(SrcBitSize < DestBitSize && "Not a zext?");
6812 Constant *C = ConstantInt::get(APInt::getLowBitsSet(DestBitSize,
6814 return BinaryOperator::createAnd(Res, C);
6816 case Instruction::SExt:
6817 // We need to emit a cast to truncate, then a cast to sext.
6818 return CastInst::create(Instruction::SExt,
6819 InsertCastBefore(Instruction::Trunc, Res, Src->getType(),
6825 Value *Op0 = SrcI->getNumOperands() > 0 ? SrcI->getOperand(0) : 0;
6826 Value *Op1 = SrcI->getNumOperands() > 1 ? SrcI->getOperand(1) : 0;
6828 switch (SrcI->getOpcode()) {
6829 case Instruction::Add:
6830 case Instruction::Mul:
6831 case Instruction::And:
6832 case Instruction::Or:
6833 case Instruction::Xor:
6834 // If we are discarding information, rewrite.
6835 if (DestBitSize <= SrcBitSize && DestBitSize != 1) {
6836 // Don't insert two casts if they cannot be eliminated. We allow
6837 // two casts to be inserted if the sizes are the same. This could
6838 // only be converting signedness, which is a noop.
6839 if (DestBitSize == SrcBitSize ||
6840 !ValueRequiresCast(CI.getOpcode(), Op1, DestTy,TD) ||
6841 !ValueRequiresCast(CI.getOpcode(), Op0, DestTy, TD)) {
6842 Instruction::CastOps opcode = CI.getOpcode();
6843 Value *Op0c = InsertOperandCastBefore(opcode, Op0, DestTy, SrcI);
6844 Value *Op1c = InsertOperandCastBefore(opcode, Op1, DestTy, SrcI);
6845 return BinaryOperator::create(
6846 cast<BinaryOperator>(SrcI)->getOpcode(), Op0c, Op1c);
6850 // cast (xor bool X, true) to int --> xor (cast bool X to int), 1
6851 if (isa<ZExtInst>(CI) && SrcBitSize == 1 &&
6852 SrcI->getOpcode() == Instruction::Xor &&
6853 Op1 == ConstantInt::getTrue() &&
6854 (!Op0->hasOneUse() || !isa<CmpInst>(Op0))) {
6855 Value *New = InsertOperandCastBefore(Instruction::ZExt, Op0, DestTy, &CI);
6856 return BinaryOperator::createXor(New, ConstantInt::get(CI.getType(), 1));
6859 case Instruction::SDiv:
6860 case Instruction::UDiv:
6861 case Instruction::SRem:
6862 case Instruction::URem:
6863 // If we are just changing the sign, rewrite.
6864 if (DestBitSize == SrcBitSize) {
6865 // Don't insert two casts if they cannot be eliminated. We allow
6866 // two casts to be inserted if the sizes are the same. This could
6867 // only be converting signedness, which is a noop.
6868 if (!ValueRequiresCast(CI.getOpcode(), Op1, DestTy, TD) ||
6869 !ValueRequiresCast(CI.getOpcode(), Op0, DestTy, TD)) {
6870 Value *Op0c = InsertOperandCastBefore(Instruction::BitCast,
6872 Value *Op1c = InsertOperandCastBefore(Instruction::BitCast,
6874 return BinaryOperator::create(
6875 cast<BinaryOperator>(SrcI)->getOpcode(), Op0c, Op1c);
6880 case Instruction::Shl:
6881 // Allow changing the sign of the source operand. Do not allow
6882 // changing the size of the shift, UNLESS the shift amount is a
6883 // constant. We must not change variable sized shifts to a smaller
6884 // size, because it is undefined to shift more bits out than exist
6886 if (DestBitSize == SrcBitSize ||
6887 (DestBitSize < SrcBitSize && isa<Constant>(Op1))) {
6888 Instruction::CastOps opcode = (DestBitSize == SrcBitSize ?
6889 Instruction::BitCast : Instruction::Trunc);
6890 Value *Op0c = InsertOperandCastBefore(opcode, Op0, DestTy, SrcI);
6891 Value *Op1c = InsertOperandCastBefore(opcode, Op1, DestTy, SrcI);
6892 return BinaryOperator::createShl(Op0c, Op1c);
6895 case Instruction::AShr:
6896 // If this is a signed shr, and if all bits shifted in are about to be
6897 // truncated off, turn it into an unsigned shr to allow greater
6899 if (DestBitSize < SrcBitSize &&
6900 isa<ConstantInt>(Op1)) {
6901 uint32_t ShiftAmt = cast<ConstantInt>(Op1)->getLimitedValue(SrcBitSize);
6902 if (SrcBitSize > ShiftAmt && SrcBitSize-ShiftAmt >= DestBitSize) {
6903 // Insert the new logical shift right.
6904 return BinaryOperator::createLShr(Op0, Op1);
6912 Instruction *InstCombiner::visitTrunc(TruncInst &CI) {
6913 if (Instruction *Result = commonIntCastTransforms(CI))
6916 Value *Src = CI.getOperand(0);
6917 const Type *Ty = CI.getType();
6918 uint32_t DestBitWidth = Ty->getPrimitiveSizeInBits();
6919 uint32_t SrcBitWidth = cast<IntegerType>(Src->getType())->getBitWidth();
6921 if (Instruction *SrcI = dyn_cast<Instruction>(Src)) {
6922 switch (SrcI->getOpcode()) {
6924 case Instruction::LShr:
6925 // We can shrink lshr to something smaller if we know the bits shifted in
6926 // are already zeros.
6927 if (ConstantInt *ShAmtV = dyn_cast<ConstantInt>(SrcI->getOperand(1))) {
6928 uint32_t ShAmt = ShAmtV->getLimitedValue(SrcBitWidth);
6930 // Get a mask for the bits shifting in.
6931 APInt Mask(APInt::getLowBitsSet(SrcBitWidth, ShAmt).shl(DestBitWidth));
6932 Value* SrcIOp0 = SrcI->getOperand(0);
6933 if (SrcI->hasOneUse() && MaskedValueIsZero(SrcIOp0, Mask)) {
6934 if (ShAmt >= DestBitWidth) // All zeros.
6935 return ReplaceInstUsesWith(CI, Constant::getNullValue(Ty));
6937 // Okay, we can shrink this. Truncate the input, then return a new
6939 Value *V1 = InsertCastBefore(Instruction::Trunc, SrcIOp0, Ty, CI);
6940 Value *V2 = InsertCastBefore(Instruction::Trunc, SrcI->getOperand(1),
6942 return BinaryOperator::createLShr(V1, V2);
6944 } else { // This is a variable shr.
6946 // Turn 'trunc (lshr X, Y) to bool' into '(X & (1 << Y)) != 0'. This is
6947 // more LLVM instructions, but allows '1 << Y' to be hoisted if
6948 // loop-invariant and CSE'd.
6949 if (CI.getType() == Type::Int1Ty && SrcI->hasOneUse()) {
6950 Value *One = ConstantInt::get(SrcI->getType(), 1);
6952 Value *V = InsertNewInstBefore(
6953 BinaryOperator::createShl(One, SrcI->getOperand(1),
6955 V = InsertNewInstBefore(BinaryOperator::createAnd(V,
6956 SrcI->getOperand(0),
6958 Value *Zero = Constant::getNullValue(V->getType());
6959 return new ICmpInst(ICmpInst::ICMP_NE, V, Zero);
6969 Instruction *InstCombiner::visitZExt(ZExtInst &CI) {
6970 // If one of the common conversion will work ..
6971 if (Instruction *Result = commonIntCastTransforms(CI))
6974 Value *Src = CI.getOperand(0);
6976 // If this is a cast of a cast
6977 if (CastInst *CSrc = dyn_cast<CastInst>(Src)) { // A->B->C cast
6978 // If this is a TRUNC followed by a ZEXT then we are dealing with integral
6979 // types and if the sizes are just right we can convert this into a logical
6980 // 'and' which will be much cheaper than the pair of casts.
6981 if (isa<TruncInst>(CSrc)) {
6982 // Get the sizes of the types involved
6983 Value *A = CSrc->getOperand(0);
6984 uint32_t SrcSize = A->getType()->getPrimitiveSizeInBits();
6985 uint32_t MidSize = CSrc->getType()->getPrimitiveSizeInBits();
6986 uint32_t DstSize = CI.getType()->getPrimitiveSizeInBits();
6987 // If we're actually extending zero bits and the trunc is a no-op
6988 if (MidSize < DstSize && SrcSize == DstSize) {
6989 // Replace both of the casts with an And of the type mask.
6990 APInt AndValue(APInt::getLowBitsSet(SrcSize, MidSize));
6991 Constant *AndConst = ConstantInt::get(AndValue);
6993 BinaryOperator::createAnd(CSrc->getOperand(0), AndConst);
6994 // Unfortunately, if the type changed, we need to cast it back.
6995 if (And->getType() != CI.getType()) {
6996 And->setName(CSrc->getName()+".mask");
6997 InsertNewInstBefore(And, CI);
6998 And = CastInst::createIntegerCast(And, CI.getType(), false/*ZExt*/);
7005 if (ICmpInst *ICI = dyn_cast<ICmpInst>(Src)) {
7006 // If we are just checking for a icmp eq of a single bit and zext'ing it
7007 // to an integer, then shift the bit to the appropriate place and then
7008 // cast to integer to avoid the comparison.
7009 if (ConstantInt *Op1C = dyn_cast<ConstantInt>(ICI->getOperand(1))) {
7010 const APInt &Op1CV = Op1C->getValue();
7012 // zext (x <s 0) to i32 --> x>>u31 true if signbit set.
7013 // zext (x >s -1) to i32 --> (x>>u31)^1 true if signbit clear.
7014 if ((ICI->getPredicate() == ICmpInst::ICMP_SLT && Op1CV == 0) ||
7015 (ICI->getPredicate() == ICmpInst::ICMP_SGT &&Op1CV.isAllOnesValue())){
7016 Value *In = ICI->getOperand(0);
7017 Value *Sh = ConstantInt::get(In->getType(),
7018 In->getType()->getPrimitiveSizeInBits()-1);
7019 In = InsertNewInstBefore(BinaryOperator::createLShr(In, Sh,
7020 In->getName()+".lobit"),
7022 if (In->getType() != CI.getType())
7023 In = CastInst::createIntegerCast(In, CI.getType(),
7024 false/*ZExt*/, "tmp", &CI);
7026 if (ICI->getPredicate() == ICmpInst::ICMP_SGT) {
7027 Constant *One = ConstantInt::get(In->getType(), 1);
7028 In = InsertNewInstBefore(BinaryOperator::createXor(In, One,
7029 In->getName()+".not"),
7033 return ReplaceInstUsesWith(CI, In);
7038 // zext (X == 0) to i32 --> X^1 iff X has only the low bit set.
7039 // zext (X == 0) to i32 --> (X>>1)^1 iff X has only the 2nd bit set.
7040 // zext (X == 1) to i32 --> X iff X has only the low bit set.
7041 // zext (X == 2) to i32 --> X>>1 iff X has only the 2nd bit set.
7042 // zext (X != 0) to i32 --> X iff X has only the low bit set.
7043 // zext (X != 0) to i32 --> X>>1 iff X has only the 2nd bit set.
7044 // zext (X != 1) to i32 --> X^1 iff X has only the low bit set.
7045 // zext (X != 2) to i32 --> (X>>1)^1 iff X has only the 2nd bit set.
7046 if ((Op1CV == 0 || Op1CV.isPowerOf2()) &&
7047 // This only works for EQ and NE
7048 ICI->isEquality()) {
7049 // If Op1C some other power of two, convert:
7050 uint32_t BitWidth = Op1C->getType()->getBitWidth();
7051 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
7052 APInt TypeMask(APInt::getAllOnesValue(BitWidth));
7053 ComputeMaskedBits(ICI->getOperand(0), TypeMask, KnownZero, KnownOne);
7055 APInt KnownZeroMask(~KnownZero);
7056 if (KnownZeroMask.isPowerOf2()) { // Exactly 1 possible 1?
7057 bool isNE = ICI->getPredicate() == ICmpInst::ICMP_NE;
7058 if (Op1CV != 0 && (Op1CV != KnownZeroMask)) {
7059 // (X&4) == 2 --> false
7060 // (X&4) != 2 --> true
7061 Constant *Res = ConstantInt::get(Type::Int1Ty, isNE);
7062 Res = ConstantExpr::getZExt(Res, CI.getType());
7063 return ReplaceInstUsesWith(CI, Res);
7066 uint32_t ShiftAmt = KnownZeroMask.logBase2();
7067 Value *In = ICI->getOperand(0);
7069 // Perform a logical shr by shiftamt.
7070 // Insert the shift to put the result in the low bit.
7071 In = InsertNewInstBefore(
7072 BinaryOperator::createLShr(In,
7073 ConstantInt::get(In->getType(), ShiftAmt),
7074 In->getName()+".lobit"), CI);
7077 if ((Op1CV != 0) == isNE) { // Toggle the low bit.
7078 Constant *One = ConstantInt::get(In->getType(), 1);
7079 In = BinaryOperator::createXor(In, One, "tmp");
7080 InsertNewInstBefore(cast<Instruction>(In), CI);
7083 if (CI.getType() == In->getType())
7084 return ReplaceInstUsesWith(CI, In);
7086 return CastInst::createIntegerCast(In, CI.getType(), false/*ZExt*/);
7094 Instruction *InstCombiner::visitSExt(SExtInst &CI) {
7095 if (Instruction *I = commonIntCastTransforms(CI))
7098 Value *Src = CI.getOperand(0);
7100 // sext (x <s 0) -> ashr x, 31 -> all ones if signed
7101 // sext (x >s -1) -> ashr x, 31 -> all ones if not signed
7102 if (ICmpInst *ICI = dyn_cast<ICmpInst>(Src)) {
7103 // If we are just checking for a icmp eq of a single bit and zext'ing it
7104 // to an integer, then shift the bit to the appropriate place and then
7105 // cast to integer to avoid the comparison.
7106 if (ConstantInt *Op1C = dyn_cast<ConstantInt>(ICI->getOperand(1))) {
7107 const APInt &Op1CV = Op1C->getValue();
7109 // sext (x <s 0) to i32 --> x>>s31 true if signbit set.
7110 // sext (x >s -1) to i32 --> (x>>s31)^-1 true if signbit clear.
7111 if ((ICI->getPredicate() == ICmpInst::ICMP_SLT && Op1CV == 0) ||
7112 (ICI->getPredicate() == ICmpInst::ICMP_SGT &&Op1CV.isAllOnesValue())){
7113 Value *In = ICI->getOperand(0);
7114 Value *Sh = ConstantInt::get(In->getType(),
7115 In->getType()->getPrimitiveSizeInBits()-1);
7116 In = InsertNewInstBefore(BinaryOperator::createAShr(In, Sh,
7117 In->getName()+".lobit"),
7119 if (In->getType() != CI.getType())
7120 In = CastInst::createIntegerCast(In, CI.getType(),
7121 true/*SExt*/, "tmp", &CI);
7123 if (ICI->getPredicate() == ICmpInst::ICMP_SGT)
7124 In = InsertNewInstBefore(BinaryOperator::createNot(In,
7125 In->getName()+".not"), CI);
7127 return ReplaceInstUsesWith(CI, In);
7135 Instruction *InstCombiner::visitFPTrunc(CastInst &CI) {
7136 return commonCastTransforms(CI);
7139 Instruction *InstCombiner::visitFPExt(CastInst &CI) {
7140 return commonCastTransforms(CI);
7143 Instruction *InstCombiner::visitFPToUI(CastInst &CI) {
7144 return commonCastTransforms(CI);
7147 Instruction *InstCombiner::visitFPToSI(CastInst &CI) {
7148 return commonCastTransforms(CI);
7151 Instruction *InstCombiner::visitUIToFP(CastInst &CI) {
7152 return commonCastTransforms(CI);
7155 Instruction *InstCombiner::visitSIToFP(CastInst &CI) {
7156 return commonCastTransforms(CI);
7159 Instruction *InstCombiner::visitPtrToInt(CastInst &CI) {
7160 return commonPointerCastTransforms(CI);
7163 Instruction *InstCombiner::visitIntToPtr(IntToPtrInst &CI) {
7164 if (Instruction *I = commonCastTransforms(CI))
7167 const Type *DestPointee = cast<PointerType>(CI.getType())->getElementType();
7168 if (!DestPointee->isSized()) return 0;
7170 // If this is inttoptr(add (ptrtoint x), cst), try to turn this into a GEP.
7173 if (match(CI.getOperand(0), m_Add(m_Cast<PtrToIntInst>(m_Value(X)),
7174 m_ConstantInt(Cst)))) {
7175 // If the source and destination operands have the same type, see if this
7176 // is a single-index GEP.
7177 if (X->getType() == CI.getType()) {
7178 // Get the size of the pointee type.
7179 uint64_t Size = TD->getABITypeSizeInBits(DestPointee);
7181 // Convert the constant to intptr type.
7182 APInt Offset = Cst->getValue();
7183 Offset.sextOrTrunc(TD->getPointerSizeInBits());
7185 // If Offset is evenly divisible by Size, we can do this xform.
7186 if (Size && !APIntOps::srem(Offset, APInt(Offset.getBitWidth(), Size))){
7187 Offset = APIntOps::sdiv(Offset, APInt(Offset.getBitWidth(), Size));
7188 return new GetElementPtrInst(X, ConstantInt::get(Offset));
7191 // TODO: Could handle other cases, e.g. where add is indexing into field of
7193 } else if (CI.getOperand(0)->hasOneUse() &&
7194 match(CI.getOperand(0), m_Add(m_Value(X), m_ConstantInt(Cst)))) {
7195 // Otherwise, if this is inttoptr(add x, cst), try to turn this into an
7196 // "inttoptr+GEP" instead of "add+intptr".
7198 // Get the size of the pointee type.
7199 uint64_t Size = TD->getABITypeSize(DestPointee);
7201 // Convert the constant to intptr type.
7202 APInt Offset = Cst->getValue();
7203 Offset.sextOrTrunc(TD->getPointerSizeInBits());
7205 // If Offset is evenly divisible by Size, we can do this xform.
7206 if (Size && !APIntOps::srem(Offset, APInt(Offset.getBitWidth(), Size))){
7207 Offset = APIntOps::sdiv(Offset, APInt(Offset.getBitWidth(), Size));
7209 Instruction *P = InsertNewInstBefore(new IntToPtrInst(X, CI.getType(),
7211 return new GetElementPtrInst(P, ConstantInt::get(Offset), "tmp");
7217 Instruction *InstCombiner::visitBitCast(BitCastInst &CI) {
7218 // If the operands are integer typed then apply the integer transforms,
7219 // otherwise just apply the common ones.
7220 Value *Src = CI.getOperand(0);
7221 const Type *SrcTy = Src->getType();
7222 const Type *DestTy = CI.getType();
7224 if (SrcTy->isInteger() && DestTy->isInteger()) {
7225 if (Instruction *Result = commonIntCastTransforms(CI))
7227 } else if (isa<PointerType>(SrcTy)) {
7228 if (Instruction *I = commonPointerCastTransforms(CI))
7231 if (Instruction *Result = commonCastTransforms(CI))
7236 // Get rid of casts from one type to the same type. These are useless and can
7237 // be replaced by the operand.
7238 if (DestTy == Src->getType())
7239 return ReplaceInstUsesWith(CI, Src);
7241 if (const PointerType *DstPTy = dyn_cast<PointerType>(DestTy)) {
7242 const PointerType *SrcPTy = cast<PointerType>(SrcTy);
7243 const Type *DstElTy = DstPTy->getElementType();
7244 const Type *SrcElTy = SrcPTy->getElementType();
7246 // If we are casting a malloc or alloca to a pointer to a type of the same
7247 // size, rewrite the allocation instruction to allocate the "right" type.
7248 if (AllocationInst *AI = dyn_cast<AllocationInst>(Src))
7249 if (Instruction *V = PromoteCastOfAllocation(CI, *AI))
7252 // If the source and destination are pointers, and this cast is equivalent
7253 // to a getelementptr X, 0, 0, 0... turn it into the appropriate gep.
7254 // This can enhance SROA and other transforms that want type-safe pointers.
7255 Constant *ZeroUInt = Constant::getNullValue(Type::Int32Ty);
7256 unsigned NumZeros = 0;
7257 while (SrcElTy != DstElTy &&
7258 isa<CompositeType>(SrcElTy) && !isa<PointerType>(SrcElTy) &&
7259 SrcElTy->getNumContainedTypes() /* not "{}" */) {
7260 SrcElTy = cast<CompositeType>(SrcElTy)->getTypeAtIndex(ZeroUInt);
7264 // If we found a path from the src to dest, create the getelementptr now.
7265 if (SrcElTy == DstElTy) {
7266 SmallVector<Value*, 8> Idxs(NumZeros+1, ZeroUInt);
7267 return new GetElementPtrInst(Src, Idxs.begin(), Idxs.end(), "",
7268 ((Instruction*) NULL));
7272 if (ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(Src)) {
7273 if (SVI->hasOneUse()) {
7274 // Okay, we have (bitconvert (shuffle ..)). Check to see if this is
7275 // a bitconvert to a vector with the same # elts.
7276 if (isa<VectorType>(DestTy) &&
7277 cast<VectorType>(DestTy)->getNumElements() ==
7278 SVI->getType()->getNumElements()) {
7280 // If either of the operands is a cast from CI.getType(), then
7281 // evaluating the shuffle in the casted destination's type will allow
7282 // us to eliminate at least one cast.
7283 if (((Tmp = dyn_cast<CastInst>(SVI->getOperand(0))) &&
7284 Tmp->getOperand(0)->getType() == DestTy) ||
7285 ((Tmp = dyn_cast<CastInst>(SVI->getOperand(1))) &&
7286 Tmp->getOperand(0)->getType() == DestTy)) {
7287 Value *LHS = InsertOperandCastBefore(Instruction::BitCast,
7288 SVI->getOperand(0), DestTy, &CI);
7289 Value *RHS = InsertOperandCastBefore(Instruction::BitCast,
7290 SVI->getOperand(1), DestTy, &CI);
7291 // Return a new shuffle vector. Use the same element ID's, as we
7292 // know the vector types match #elts.
7293 return new ShuffleVectorInst(LHS, RHS, SVI->getOperand(2));
7301 /// GetSelectFoldableOperands - We want to turn code that looks like this:
7303 /// %D = select %cond, %C, %A
7305 /// %C = select %cond, %B, 0
7308 /// Assuming that the specified instruction is an operand to the select, return
7309 /// a bitmask indicating which operands of this instruction are foldable if they
7310 /// equal the other incoming value of the select.
7312 static unsigned GetSelectFoldableOperands(Instruction *I) {
7313 switch (I->getOpcode()) {
7314 case Instruction::Add:
7315 case Instruction::Mul:
7316 case Instruction::And:
7317 case Instruction::Or:
7318 case Instruction::Xor:
7319 return 3; // Can fold through either operand.
7320 case Instruction::Sub: // Can only fold on the amount subtracted.
7321 case Instruction::Shl: // Can only fold on the shift amount.
7322 case Instruction::LShr:
7323 case Instruction::AShr:
7326 return 0; // Cannot fold
7330 /// GetSelectFoldableConstant - For the same transformation as the previous
7331 /// function, return the identity constant that goes into the select.
7332 static Constant *GetSelectFoldableConstant(Instruction *I) {
7333 switch (I->getOpcode()) {
7334 default: assert(0 && "This cannot happen!"); abort();
7335 case Instruction::Add:
7336 case Instruction::Sub:
7337 case Instruction::Or:
7338 case Instruction::Xor:
7339 case Instruction::Shl:
7340 case Instruction::LShr:
7341 case Instruction::AShr:
7342 return Constant::getNullValue(I->getType());
7343 case Instruction::And:
7344 return Constant::getAllOnesValue(I->getType());
7345 case Instruction::Mul:
7346 return ConstantInt::get(I->getType(), 1);
7350 /// FoldSelectOpOp - Here we have (select c, TI, FI), and we know that TI and FI
7351 /// have the same opcode and only one use each. Try to simplify this.
7352 Instruction *InstCombiner::FoldSelectOpOp(SelectInst &SI, Instruction *TI,
7354 if (TI->getNumOperands() == 1) {
7355 // If this is a non-volatile load or a cast from the same type,
7358 if (TI->getOperand(0)->getType() != FI->getOperand(0)->getType())
7361 return 0; // unknown unary op.
7364 // Fold this by inserting a select from the input values.
7365 SelectInst *NewSI = new SelectInst(SI.getCondition(), TI->getOperand(0),
7366 FI->getOperand(0), SI.getName()+".v");
7367 InsertNewInstBefore(NewSI, SI);
7368 return CastInst::create(Instruction::CastOps(TI->getOpcode()), NewSI,
7372 // Only handle binary operators here.
7373 if (!isa<BinaryOperator>(TI))
7376 // Figure out if the operations have any operands in common.
7377 Value *MatchOp, *OtherOpT, *OtherOpF;
7379 if (TI->getOperand(0) == FI->getOperand(0)) {
7380 MatchOp = TI->getOperand(0);
7381 OtherOpT = TI->getOperand(1);
7382 OtherOpF = FI->getOperand(1);
7383 MatchIsOpZero = true;
7384 } else if (TI->getOperand(1) == FI->getOperand(1)) {
7385 MatchOp = TI->getOperand(1);
7386 OtherOpT = TI->getOperand(0);
7387 OtherOpF = FI->getOperand(0);
7388 MatchIsOpZero = false;
7389 } else if (!TI->isCommutative()) {
7391 } else if (TI->getOperand(0) == FI->getOperand(1)) {
7392 MatchOp = TI->getOperand(0);
7393 OtherOpT = TI->getOperand(1);
7394 OtherOpF = FI->getOperand(0);
7395 MatchIsOpZero = true;
7396 } else if (TI->getOperand(1) == FI->getOperand(0)) {
7397 MatchOp = TI->getOperand(1);
7398 OtherOpT = TI->getOperand(0);
7399 OtherOpF = FI->getOperand(1);
7400 MatchIsOpZero = true;
7405 // If we reach here, they do have operations in common.
7406 SelectInst *NewSI = new SelectInst(SI.getCondition(), OtherOpT,
7407 OtherOpF, SI.getName()+".v");
7408 InsertNewInstBefore(NewSI, SI);
7410 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(TI)) {
7412 return BinaryOperator::create(BO->getOpcode(), MatchOp, NewSI);
7414 return BinaryOperator::create(BO->getOpcode(), NewSI, MatchOp);
7416 assert(0 && "Shouldn't get here");
7420 Instruction *InstCombiner::visitSelectInst(SelectInst &SI) {
7421 Value *CondVal = SI.getCondition();
7422 Value *TrueVal = SI.getTrueValue();
7423 Value *FalseVal = SI.getFalseValue();
7425 // select true, X, Y -> X
7426 // select false, X, Y -> Y
7427 if (ConstantInt *C = dyn_cast<ConstantInt>(CondVal))
7428 return ReplaceInstUsesWith(SI, C->getZExtValue() ? TrueVal : FalseVal);
7430 // select C, X, X -> X
7431 if (TrueVal == FalseVal)
7432 return ReplaceInstUsesWith(SI, TrueVal);
7434 if (isa<UndefValue>(TrueVal)) // select C, undef, X -> X
7435 return ReplaceInstUsesWith(SI, FalseVal);
7436 if (isa<UndefValue>(FalseVal)) // select C, X, undef -> X
7437 return ReplaceInstUsesWith(SI, TrueVal);
7438 if (isa<UndefValue>(CondVal)) { // select undef, X, Y -> X or Y
7439 if (isa<Constant>(TrueVal))
7440 return ReplaceInstUsesWith(SI, TrueVal);
7442 return ReplaceInstUsesWith(SI, FalseVal);
7445 if (SI.getType() == Type::Int1Ty) {
7446 if (ConstantInt *C = dyn_cast<ConstantInt>(TrueVal)) {
7447 if (C->getZExtValue()) {
7448 // Change: A = select B, true, C --> A = or B, C
7449 return BinaryOperator::createOr(CondVal, FalseVal);
7451 // Change: A = select B, false, C --> A = and !B, C
7453 InsertNewInstBefore(BinaryOperator::createNot(CondVal,
7454 "not."+CondVal->getName()), SI);
7455 return BinaryOperator::createAnd(NotCond, FalseVal);
7457 } else if (ConstantInt *C = dyn_cast<ConstantInt>(FalseVal)) {
7458 if (C->getZExtValue() == false) {
7459 // Change: A = select B, C, false --> A = and B, C
7460 return BinaryOperator::createAnd(CondVal, TrueVal);
7462 // Change: A = select B, C, true --> A = or !B, C
7464 InsertNewInstBefore(BinaryOperator::createNot(CondVal,
7465 "not."+CondVal->getName()), SI);
7466 return BinaryOperator::createOr(NotCond, TrueVal);
7470 // select a, b, a -> a&b
7471 // select a, a, b -> a|b
7472 if (CondVal == TrueVal)
7473 return BinaryOperator::createOr(CondVal, FalseVal);
7474 else if (CondVal == FalseVal)
7475 return BinaryOperator::createAnd(CondVal, TrueVal);
7478 // Selecting between two integer constants?
7479 if (ConstantInt *TrueValC = dyn_cast<ConstantInt>(TrueVal))
7480 if (ConstantInt *FalseValC = dyn_cast<ConstantInt>(FalseVal)) {
7481 // select C, 1, 0 -> zext C to int
7482 if (FalseValC->isZero() && TrueValC->getValue() == 1) {
7483 return CastInst::create(Instruction::ZExt, CondVal, SI.getType());
7484 } else if (TrueValC->isZero() && FalseValC->getValue() == 1) {
7485 // select C, 0, 1 -> zext !C to int
7487 InsertNewInstBefore(BinaryOperator::createNot(CondVal,
7488 "not."+CondVal->getName()), SI);
7489 return CastInst::create(Instruction::ZExt, NotCond, SI.getType());
7492 // FIXME: Turn select 0/-1 and -1/0 into sext from condition!
7494 if (ICmpInst *IC = dyn_cast<ICmpInst>(SI.getCondition())) {
7496 // (x <s 0) ? -1 : 0 -> ashr x, 31
7497 if (TrueValC->isAllOnesValue() && FalseValC->isZero())
7498 if (ConstantInt *CmpCst = dyn_cast<ConstantInt>(IC->getOperand(1))) {
7499 if (IC->getPredicate() == ICmpInst::ICMP_SLT && CmpCst->isZero()) {
7500 // The comparison constant and the result are not neccessarily the
7501 // same width. Make an all-ones value by inserting a AShr.
7502 Value *X = IC->getOperand(0);
7503 uint32_t Bits = X->getType()->getPrimitiveSizeInBits();
7504 Constant *ShAmt = ConstantInt::get(X->getType(), Bits-1);
7505 Instruction *SRA = BinaryOperator::create(Instruction::AShr, X,
7507 InsertNewInstBefore(SRA, SI);
7509 // Finally, convert to the type of the select RHS. We figure out
7510 // if this requires a SExt, Trunc or BitCast based on the sizes.
7511 Instruction::CastOps opc = Instruction::BitCast;
7512 uint32_t SRASize = SRA->getType()->getPrimitiveSizeInBits();
7513 uint32_t SISize = SI.getType()->getPrimitiveSizeInBits();
7514 if (SRASize < SISize)
7515 opc = Instruction::SExt;
7516 else if (SRASize > SISize)
7517 opc = Instruction::Trunc;
7518 return CastInst::create(opc, SRA, SI.getType());
7523 // If one of the constants is zero (we know they can't both be) and we
7524 // have an icmp instruction with zero, and we have an 'and' with the
7525 // non-constant value, eliminate this whole mess. This corresponds to
7526 // cases like this: ((X & 27) ? 27 : 0)
7527 if (TrueValC->isZero() || FalseValC->isZero())
7528 if (IC->isEquality() && isa<ConstantInt>(IC->getOperand(1)) &&
7529 cast<Constant>(IC->getOperand(1))->isNullValue())
7530 if (Instruction *ICA = dyn_cast<Instruction>(IC->getOperand(0)))
7531 if (ICA->getOpcode() == Instruction::And &&
7532 isa<ConstantInt>(ICA->getOperand(1)) &&
7533 (ICA->getOperand(1) == TrueValC ||
7534 ICA->getOperand(1) == FalseValC) &&
7535 isOneBitSet(cast<ConstantInt>(ICA->getOperand(1)))) {
7536 // Okay, now we know that everything is set up, we just don't
7537 // know whether we have a icmp_ne or icmp_eq and whether the
7538 // true or false val is the zero.
7539 bool ShouldNotVal = !TrueValC->isZero();
7540 ShouldNotVal ^= IC->getPredicate() == ICmpInst::ICMP_NE;
7543 V = InsertNewInstBefore(BinaryOperator::create(
7544 Instruction::Xor, V, ICA->getOperand(1)), SI);
7545 return ReplaceInstUsesWith(SI, V);
7550 // See if we are selecting two values based on a comparison of the two values.
7551 if (FCmpInst *FCI = dyn_cast<FCmpInst>(CondVal)) {
7552 if (FCI->getOperand(0) == TrueVal && FCI->getOperand(1) == FalseVal) {
7553 // Transform (X == Y) ? X : Y -> Y
7554 if (FCI->getPredicate() == FCmpInst::FCMP_OEQ) {
7555 // This is not safe in general for floating point:
7556 // consider X== -0, Y== +0.
7557 // It becomes safe if either operand is a nonzero constant.
7558 ConstantFP *CFPt, *CFPf;
7559 if (((CFPt = dyn_cast<ConstantFP>(TrueVal)) &&
7560 !CFPt->getValueAPF().isZero()) ||
7561 ((CFPf = dyn_cast<ConstantFP>(FalseVal)) &&
7562 !CFPf->getValueAPF().isZero()))
7563 return ReplaceInstUsesWith(SI, FalseVal);
7565 // Transform (X != Y) ? X : Y -> X
7566 if (FCI->getPredicate() == FCmpInst::FCMP_ONE)
7567 return ReplaceInstUsesWith(SI, TrueVal);
7568 // NOTE: if we wanted to, this is where to detect MIN/MAX/ABS/etc.
7570 } else if (FCI->getOperand(0) == FalseVal && FCI->getOperand(1) == TrueVal){
7571 // Transform (X == Y) ? Y : X -> X
7572 if (FCI->getPredicate() == FCmpInst::FCMP_OEQ) {
7573 // This is not safe in general for floating point:
7574 // consider X== -0, Y== +0.
7575 // It becomes safe if either operand is a nonzero constant.
7576 ConstantFP *CFPt, *CFPf;
7577 if (((CFPt = dyn_cast<ConstantFP>(TrueVal)) &&
7578 !CFPt->getValueAPF().isZero()) ||
7579 ((CFPf = dyn_cast<ConstantFP>(FalseVal)) &&
7580 !CFPf->getValueAPF().isZero()))
7581 return ReplaceInstUsesWith(SI, FalseVal);
7583 // Transform (X != Y) ? Y : X -> Y
7584 if (FCI->getPredicate() == FCmpInst::FCMP_ONE)
7585 return ReplaceInstUsesWith(SI, TrueVal);
7586 // NOTE: if we wanted to, this is where to detect MIN/MAX/ABS/etc.
7590 // See if we are selecting two values based on a comparison of the two values.
7591 if (ICmpInst *ICI = dyn_cast<ICmpInst>(CondVal)) {
7592 if (ICI->getOperand(0) == TrueVal && ICI->getOperand(1) == FalseVal) {
7593 // Transform (X == Y) ? X : Y -> Y
7594 if (ICI->getPredicate() == ICmpInst::ICMP_EQ)
7595 return ReplaceInstUsesWith(SI, FalseVal);
7596 // Transform (X != Y) ? X : Y -> X
7597 if (ICI->getPredicate() == ICmpInst::ICMP_NE)
7598 return ReplaceInstUsesWith(SI, TrueVal);
7599 // NOTE: if we wanted to, this is where to detect MIN/MAX/ABS/etc.
7601 } else if (ICI->getOperand(0) == FalseVal && ICI->getOperand(1) == TrueVal){
7602 // Transform (X == Y) ? Y : X -> X
7603 if (ICI->getPredicate() == ICmpInst::ICMP_EQ)
7604 return ReplaceInstUsesWith(SI, FalseVal);
7605 // Transform (X != Y) ? Y : X -> Y
7606 if (ICI->getPredicate() == ICmpInst::ICMP_NE)
7607 return ReplaceInstUsesWith(SI, TrueVal);
7608 // NOTE: if we wanted to, this is where to detect MIN/MAX/ABS/etc.
7612 if (Instruction *TI = dyn_cast<Instruction>(TrueVal))
7613 if (Instruction *FI = dyn_cast<Instruction>(FalseVal))
7614 if (TI->hasOneUse() && FI->hasOneUse()) {
7615 Instruction *AddOp = 0, *SubOp = 0;
7617 // Turn (select C, (op X, Y), (op X, Z)) -> (op X, (select C, Y, Z))
7618 if (TI->getOpcode() == FI->getOpcode())
7619 if (Instruction *IV = FoldSelectOpOp(SI, TI, FI))
7622 // Turn select C, (X+Y), (X-Y) --> (X+(select C, Y, (-Y))). This is
7623 // even legal for FP.
7624 if (TI->getOpcode() == Instruction::Sub &&
7625 FI->getOpcode() == Instruction::Add) {
7626 AddOp = FI; SubOp = TI;
7627 } else if (FI->getOpcode() == Instruction::Sub &&
7628 TI->getOpcode() == Instruction::Add) {
7629 AddOp = TI; SubOp = FI;
7633 Value *OtherAddOp = 0;
7634 if (SubOp->getOperand(0) == AddOp->getOperand(0)) {
7635 OtherAddOp = AddOp->getOperand(1);
7636 } else if (SubOp->getOperand(0) == AddOp->getOperand(1)) {
7637 OtherAddOp = AddOp->getOperand(0);
7641 // So at this point we know we have (Y -> OtherAddOp):
7642 // select C, (add X, Y), (sub X, Z)
7643 Value *NegVal; // Compute -Z
7644 if (Constant *C = dyn_cast<Constant>(SubOp->getOperand(1))) {
7645 NegVal = ConstantExpr::getNeg(C);
7647 NegVal = InsertNewInstBefore(
7648 BinaryOperator::createNeg(SubOp->getOperand(1), "tmp"), SI);
7651 Value *NewTrueOp = OtherAddOp;
7652 Value *NewFalseOp = NegVal;
7654 std::swap(NewTrueOp, NewFalseOp);
7655 Instruction *NewSel =
7656 new SelectInst(CondVal, NewTrueOp,NewFalseOp,SI.getName()+".p");
7658 NewSel = InsertNewInstBefore(NewSel, SI);
7659 return BinaryOperator::createAdd(SubOp->getOperand(0), NewSel);
7664 // See if we can fold the select into one of our operands.
7665 if (SI.getType()->isInteger()) {
7666 // See the comment above GetSelectFoldableOperands for a description of the
7667 // transformation we are doing here.
7668 if (Instruction *TVI = dyn_cast<Instruction>(TrueVal))
7669 if (TVI->hasOneUse() && TVI->getNumOperands() == 2 &&
7670 !isa<Constant>(FalseVal))
7671 if (unsigned SFO = GetSelectFoldableOperands(TVI)) {
7672 unsigned OpToFold = 0;
7673 if ((SFO & 1) && FalseVal == TVI->getOperand(0)) {
7675 } else if ((SFO & 2) && FalseVal == TVI->getOperand(1)) {
7680 Constant *C = GetSelectFoldableConstant(TVI);
7681 Instruction *NewSel =
7682 new SelectInst(SI.getCondition(), TVI->getOperand(2-OpToFold), C);
7683 InsertNewInstBefore(NewSel, SI);
7684 NewSel->takeName(TVI);
7685 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(TVI))
7686 return BinaryOperator::create(BO->getOpcode(), FalseVal, NewSel);
7688 assert(0 && "Unknown instruction!!");
7693 if (Instruction *FVI = dyn_cast<Instruction>(FalseVal))
7694 if (FVI->hasOneUse() && FVI->getNumOperands() == 2 &&
7695 !isa<Constant>(TrueVal))
7696 if (unsigned SFO = GetSelectFoldableOperands(FVI)) {
7697 unsigned OpToFold = 0;
7698 if ((SFO & 1) && TrueVal == FVI->getOperand(0)) {
7700 } else if ((SFO & 2) && TrueVal == FVI->getOperand(1)) {
7705 Constant *C = GetSelectFoldableConstant(FVI);
7706 Instruction *NewSel =
7707 new SelectInst(SI.getCondition(), C, FVI->getOperand(2-OpToFold));
7708 InsertNewInstBefore(NewSel, SI);
7709 NewSel->takeName(FVI);
7710 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(FVI))
7711 return BinaryOperator::create(BO->getOpcode(), TrueVal, NewSel);
7713 assert(0 && "Unknown instruction!!");
7718 if (BinaryOperator::isNot(CondVal)) {
7719 SI.setOperand(0, BinaryOperator::getNotArgument(CondVal));
7720 SI.setOperand(1, FalseVal);
7721 SI.setOperand(2, TrueVal);
7728 /// GetOrEnforceKnownAlignment - If the specified pointer has an alignment that
7729 /// we can determine, return it, otherwise return 0. If PrefAlign is specified,
7730 /// and it is more than the alignment of the ultimate object, see if we can
7731 /// increase the alignment of the ultimate object, making this check succeed.
7732 static unsigned GetOrEnforceKnownAlignment(Value *V, TargetData *TD,
7733 unsigned PrefAlign = 0) {
7734 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(V)) {
7735 unsigned Align = GV->getAlignment();
7736 if (Align == 0 && TD && GV->getType()->getElementType()->isSized())
7737 Align = TD->getPrefTypeAlignment(GV->getType()->getElementType());
7739 // If there is a large requested alignment and we can, bump up the alignment
7741 if (PrefAlign > Align && GV->hasInitializer()) {
7742 GV->setAlignment(PrefAlign);
7746 } else if (AllocationInst *AI = dyn_cast<AllocationInst>(V)) {
7747 unsigned Align = AI->getAlignment();
7748 if (Align == 0 && TD) {
7749 if (isa<AllocaInst>(AI))
7750 Align = TD->getPrefTypeAlignment(AI->getType()->getElementType());
7751 else if (isa<MallocInst>(AI)) {
7752 // Malloc returns maximally aligned memory.
7753 Align = TD->getABITypeAlignment(AI->getType()->getElementType());
7756 (unsigned)TD->getABITypeAlignment(Type::DoubleTy));
7759 (unsigned)TD->getABITypeAlignment(Type::Int64Ty));
7763 // If there is a requested alignment and if this is an alloca, round up. We
7764 // don't do this for malloc, because some systems can't respect the request.
7765 if (PrefAlign > Align && isa<AllocaInst>(AI)) {
7766 AI->setAlignment(PrefAlign);
7770 } else if (isa<BitCastInst>(V) ||
7771 (isa<ConstantExpr>(V) &&
7772 cast<ConstantExpr>(V)->getOpcode() == Instruction::BitCast)) {
7773 return GetOrEnforceKnownAlignment(cast<User>(V)->getOperand(0),
7775 } else if (User *GEPI = dyn_castGetElementPtr(V)) {
7776 // If all indexes are zero, it is just the alignment of the base pointer.
7777 bool AllZeroOperands = true;
7778 for (unsigned i = 1, e = GEPI->getNumOperands(); i != e; ++i)
7779 if (!isa<Constant>(GEPI->getOperand(i)) ||
7780 !cast<Constant>(GEPI->getOperand(i))->isNullValue()) {
7781 AllZeroOperands = false;
7785 if (AllZeroOperands) {
7786 // Treat this like a bitcast.
7787 return GetOrEnforceKnownAlignment(GEPI->getOperand(0), TD, PrefAlign);
7790 unsigned BaseAlignment = GetOrEnforceKnownAlignment(GEPI->getOperand(0),TD);
7791 if (BaseAlignment == 0) return 0;
7793 // Otherwise, if the base alignment is >= the alignment we expect for the
7794 // base pointer type, then we know that the resultant pointer is aligned at
7795 // least as much as its type requires.
7798 const Type *BasePtrTy = GEPI->getOperand(0)->getType();
7799 const PointerType *PtrTy = cast<PointerType>(BasePtrTy);
7800 unsigned Align = TD->getABITypeAlignment(PtrTy->getElementType());
7801 if (Align <= BaseAlignment) {
7802 const Type *GEPTy = GEPI->getType();
7803 const PointerType *GEPPtrTy = cast<PointerType>(GEPTy);
7804 Align = std::min(Align, (unsigned)
7805 TD->getABITypeAlignment(GEPPtrTy->getElementType()));
7813 Instruction *InstCombiner::SimplifyMemTransfer(MemIntrinsic *MI) {
7814 unsigned DstAlign = GetOrEnforceKnownAlignment(MI->getOperand(1), TD);
7815 unsigned SrcAlign = GetOrEnforceKnownAlignment(MI->getOperand(2), TD);
7816 unsigned MinAlign = std::min(DstAlign, SrcAlign);
7817 unsigned CopyAlign = MI->getAlignment()->getZExtValue();
7819 if (CopyAlign < MinAlign) {
7820 MI->setAlignment(ConstantInt::get(Type::Int32Ty, MinAlign));
7824 // If MemCpyInst length is 1/2/4/8 bytes then replace memcpy with
7826 ConstantInt *MemOpLength = dyn_cast<ConstantInt>(MI->getOperand(3));
7827 if (MemOpLength == 0) return 0;
7829 // Source and destination pointer types are always "i8*" for intrinsic. See
7830 // if the size is something we can handle with a single primitive load/store.
7831 // A single load+store correctly handles overlapping memory in the memmove
7833 unsigned Size = MemOpLength->getZExtValue();
7834 if (Size == 0 || Size > 8 || (Size&(Size-1)))
7835 return 0; // If not 1/2/4/8 bytes, exit.
7837 // Use an integer load+store unless we can find something better.
7838 Type *NewPtrTy = PointerType::getUnqual(IntegerType::get(Size<<3));
7840 // Memcpy forces the use of i8* for the source and destination. That means
7841 // that if you're using memcpy to move one double around, you'll get a cast
7842 // from double* to i8*. We'd much rather use a double load+store rather than
7843 // an i64 load+store, here because this improves the odds that the source or
7844 // dest address will be promotable. See if we can find a better type than the
7845 // integer datatype.
7846 if (Value *Op = getBitCastOperand(MI->getOperand(1))) {
7847 const Type *SrcETy = cast<PointerType>(Op->getType())->getElementType();
7848 if (SrcETy->isSized() && TD->getTypeStoreSize(SrcETy) == Size) {
7849 // The SrcETy might be something like {{{double}}} or [1 x double]. Rip
7850 // down through these levels if so.
7851 while (!SrcETy->isFirstClassType()) {
7852 if (const StructType *STy = dyn_cast<StructType>(SrcETy)) {
7853 if (STy->getNumElements() == 1)
7854 SrcETy = STy->getElementType(0);
7857 } else if (const ArrayType *ATy = dyn_cast<ArrayType>(SrcETy)) {
7858 if (ATy->getNumElements() == 1)
7859 SrcETy = ATy->getElementType();
7866 if (SrcETy->isFirstClassType())
7867 NewPtrTy = PointerType::getUnqual(SrcETy);
7872 // If the memcpy/memmove provides better alignment info than we can
7874 SrcAlign = std::max(SrcAlign, CopyAlign);
7875 DstAlign = std::max(DstAlign, CopyAlign);
7877 Value *Src = InsertBitCastBefore(MI->getOperand(2), NewPtrTy, *MI);
7878 Value *Dest = InsertBitCastBefore(MI->getOperand(1), NewPtrTy, *MI);
7879 Instruction *L = new LoadInst(Src, "tmp", false, SrcAlign);
7880 InsertNewInstBefore(L, *MI);
7881 InsertNewInstBefore(new StoreInst(L, Dest, false, DstAlign), *MI);
7883 // Set the size of the copy to 0, it will be deleted on the next iteration.
7884 MI->setOperand(3, Constant::getNullValue(MemOpLength->getType()));
7888 /// visitCallInst - CallInst simplification. This mostly only handles folding
7889 /// of intrinsic instructions. For normal calls, it allows visitCallSite to do
7890 /// the heavy lifting.
7892 Instruction *InstCombiner::visitCallInst(CallInst &CI) {
7893 IntrinsicInst *II = dyn_cast<IntrinsicInst>(&CI);
7894 if (!II) return visitCallSite(&CI);
7896 // Intrinsics cannot occur in an invoke, so handle them here instead of in
7898 if (MemIntrinsic *MI = dyn_cast<MemIntrinsic>(II)) {
7899 bool Changed = false;
7901 // memmove/cpy/set of zero bytes is a noop.
7902 if (Constant *NumBytes = dyn_cast<Constant>(MI->getLength())) {
7903 if (NumBytes->isNullValue()) return EraseInstFromFunction(CI);
7905 if (ConstantInt *CI = dyn_cast<ConstantInt>(NumBytes))
7906 if (CI->getZExtValue() == 1) {
7907 // Replace the instruction with just byte operations. We would
7908 // transform other cases to loads/stores, but we don't know if
7909 // alignment is sufficient.
7913 // If we have a memmove and the source operation is a constant global,
7914 // then the source and dest pointers can't alias, so we can change this
7915 // into a call to memcpy.
7916 if (MemMoveInst *MMI = dyn_cast<MemMoveInst>(MI)) {
7917 if (GlobalVariable *GVSrc = dyn_cast<GlobalVariable>(MMI->getSource()))
7918 if (GVSrc->isConstant()) {
7919 Module *M = CI.getParent()->getParent()->getParent();
7920 Intrinsic::ID MemCpyID;
7921 if (CI.getOperand(3)->getType() == Type::Int32Ty)
7922 MemCpyID = Intrinsic::memcpy_i32;
7924 MemCpyID = Intrinsic::memcpy_i64;
7925 CI.setOperand(0, Intrinsic::getDeclaration(M, MemCpyID));
7930 // If we can determine a pointer alignment that is bigger than currently
7931 // set, update the alignment.
7932 if (isa<MemCpyInst>(MI) || isa<MemMoveInst>(MI)) {
7933 if (Instruction *I = SimplifyMemTransfer(MI))
7935 } else if (isa<MemSetInst>(MI)) {
7936 unsigned Alignment = GetOrEnforceKnownAlignment(MI->getDest(), TD);
7937 if (MI->getAlignment()->getZExtValue() < Alignment) {
7938 MI->setAlignment(ConstantInt::get(Type::Int32Ty, Alignment));
7943 if (Changed) return II;
7945 switch (II->getIntrinsicID()) {
7947 case Intrinsic::ppc_altivec_lvx:
7948 case Intrinsic::ppc_altivec_lvxl:
7949 case Intrinsic::x86_sse_loadu_ps:
7950 case Intrinsic::x86_sse2_loadu_pd:
7951 case Intrinsic::x86_sse2_loadu_dq:
7952 // Turn PPC lvx -> load if the pointer is known aligned.
7953 // Turn X86 loadups -> load if the pointer is known aligned.
7954 if (GetOrEnforceKnownAlignment(II->getOperand(1), TD, 16) >= 16) {
7955 Value *Ptr = InsertBitCastBefore(II->getOperand(1),
7956 PointerType::getUnqual(II->getType()),
7958 return new LoadInst(Ptr);
7961 case Intrinsic::ppc_altivec_stvx:
7962 case Intrinsic::ppc_altivec_stvxl:
7963 // Turn stvx -> store if the pointer is known aligned.
7964 if (GetOrEnforceKnownAlignment(II->getOperand(2), TD, 16) >= 16) {
7965 const Type *OpPtrTy =
7966 PointerType::getUnqual(II->getOperand(1)->getType());
7967 Value *Ptr = InsertBitCastBefore(II->getOperand(2), OpPtrTy, CI);
7968 return new StoreInst(II->getOperand(1), Ptr);
7971 case Intrinsic::x86_sse_storeu_ps:
7972 case Intrinsic::x86_sse2_storeu_pd:
7973 case Intrinsic::x86_sse2_storeu_dq:
7974 case Intrinsic::x86_sse2_storel_dq:
7975 // Turn X86 storeu -> store if the pointer is known aligned.
7976 if (GetOrEnforceKnownAlignment(II->getOperand(1), TD, 16) >= 16) {
7977 const Type *OpPtrTy =
7978 PointerType::getUnqual(II->getOperand(2)->getType());
7979 Value *Ptr = InsertBitCastBefore(II->getOperand(1), OpPtrTy, CI);
7980 return new StoreInst(II->getOperand(2), Ptr);
7984 case Intrinsic::x86_sse_cvttss2si: {
7985 // These intrinsics only demands the 0th element of its input vector. If
7986 // we can simplify the input based on that, do so now.
7988 if (Value *V = SimplifyDemandedVectorElts(II->getOperand(1), 1,
7990 II->setOperand(1, V);
7996 case Intrinsic::ppc_altivec_vperm:
7997 // Turn vperm(V1,V2,mask) -> shuffle(V1,V2,mask) if mask is a constant.
7998 if (ConstantVector *Mask = dyn_cast<ConstantVector>(II->getOperand(3))) {
7999 assert(Mask->getNumOperands() == 16 && "Bad type for intrinsic!");
8001 // Check that all of the elements are integer constants or undefs.
8002 bool AllEltsOk = true;
8003 for (unsigned i = 0; i != 16; ++i) {
8004 if (!isa<ConstantInt>(Mask->getOperand(i)) &&
8005 !isa<UndefValue>(Mask->getOperand(i))) {
8012 // Cast the input vectors to byte vectors.
8013 Value *Op0 =InsertBitCastBefore(II->getOperand(1),Mask->getType(),CI);
8014 Value *Op1 =InsertBitCastBefore(II->getOperand(2),Mask->getType(),CI);
8015 Value *Result = UndefValue::get(Op0->getType());
8017 // Only extract each element once.
8018 Value *ExtractedElts[32];
8019 memset(ExtractedElts, 0, sizeof(ExtractedElts));
8021 for (unsigned i = 0; i != 16; ++i) {
8022 if (isa<UndefValue>(Mask->getOperand(i)))
8024 unsigned Idx=cast<ConstantInt>(Mask->getOperand(i))->getZExtValue();
8025 Idx &= 31; // Match the hardware behavior.
8027 if (ExtractedElts[Idx] == 0) {
8029 new ExtractElementInst(Idx < 16 ? Op0 : Op1, Idx&15, "tmp");
8030 InsertNewInstBefore(Elt, CI);
8031 ExtractedElts[Idx] = Elt;
8034 // Insert this value into the result vector.
8035 Result = new InsertElementInst(Result, ExtractedElts[Idx], i,"tmp");
8036 InsertNewInstBefore(cast<Instruction>(Result), CI);
8038 return CastInst::create(Instruction::BitCast, Result, CI.getType());
8043 case Intrinsic::stackrestore: {
8044 // If the save is right next to the restore, remove the restore. This can
8045 // happen when variable allocas are DCE'd.
8046 if (IntrinsicInst *SS = dyn_cast<IntrinsicInst>(II->getOperand(1))) {
8047 if (SS->getIntrinsicID() == Intrinsic::stacksave) {
8048 BasicBlock::iterator BI = SS;
8050 return EraseInstFromFunction(CI);
8054 // If the stack restore is in a return/unwind block and if there are no
8055 // allocas or calls between the restore and the return, nuke the restore.
8056 TerminatorInst *TI = II->getParent()->getTerminator();
8057 if (isa<ReturnInst>(TI) || isa<UnwindInst>(TI)) {
8058 BasicBlock::iterator BI = II;
8059 bool CannotRemove = false;
8060 for (++BI; &*BI != TI; ++BI) {
8061 if (isa<AllocaInst>(BI) ||
8062 (isa<CallInst>(BI) && !isa<IntrinsicInst>(BI))) {
8063 CannotRemove = true;
8068 return EraseInstFromFunction(CI);
8075 return visitCallSite(II);
8078 // InvokeInst simplification
8080 Instruction *InstCombiner::visitInvokeInst(InvokeInst &II) {
8081 return visitCallSite(&II);
8084 // visitCallSite - Improvements for call and invoke instructions.
8086 Instruction *InstCombiner::visitCallSite(CallSite CS) {
8087 bool Changed = false;
8089 // If the callee is a constexpr cast of a function, attempt to move the cast
8090 // to the arguments of the call/invoke.
8091 if (transformConstExprCastCall(CS)) return 0;
8093 Value *Callee = CS.getCalledValue();
8095 if (Function *CalleeF = dyn_cast<Function>(Callee))
8096 if (CalleeF->getCallingConv() != CS.getCallingConv()) {
8097 Instruction *OldCall = CS.getInstruction();
8098 // If the call and callee calling conventions don't match, this call must
8099 // be unreachable, as the call is undefined.
8100 new StoreInst(ConstantInt::getTrue(),
8101 UndefValue::get(PointerType::getUnqual(Type::Int1Ty)),
8103 if (!OldCall->use_empty())
8104 OldCall->replaceAllUsesWith(UndefValue::get(OldCall->getType()));
8105 if (isa<CallInst>(OldCall)) // Not worth removing an invoke here.
8106 return EraseInstFromFunction(*OldCall);
8110 if (isa<ConstantPointerNull>(Callee) || isa<UndefValue>(Callee)) {
8111 // This instruction is not reachable, just remove it. We insert a store to
8112 // undef so that we know that this code is not reachable, despite the fact
8113 // that we can't modify the CFG here.
8114 new StoreInst(ConstantInt::getTrue(),
8115 UndefValue::get(PointerType::getUnqual(Type::Int1Ty)),
8116 CS.getInstruction());
8118 if (!CS.getInstruction()->use_empty())
8119 CS.getInstruction()->
8120 replaceAllUsesWith(UndefValue::get(CS.getInstruction()->getType()));
8122 if (InvokeInst *II = dyn_cast<InvokeInst>(CS.getInstruction())) {
8123 // Don't break the CFG, insert a dummy cond branch.
8124 new BranchInst(II->getNormalDest(), II->getUnwindDest(),
8125 ConstantInt::getTrue(), II);
8127 return EraseInstFromFunction(*CS.getInstruction());
8130 if (BitCastInst *BC = dyn_cast<BitCastInst>(Callee))
8131 if (IntrinsicInst *In = dyn_cast<IntrinsicInst>(BC->getOperand(0)))
8132 if (In->getIntrinsicID() == Intrinsic::init_trampoline)
8133 return transformCallThroughTrampoline(CS);
8135 const PointerType *PTy = cast<PointerType>(Callee->getType());
8136 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
8137 if (FTy->isVarArg()) {
8138 // See if we can optimize any arguments passed through the varargs area of
8140 for (CallSite::arg_iterator I = CS.arg_begin()+FTy->getNumParams(),
8141 E = CS.arg_end(); I != E; ++I)
8142 if (CastInst *CI = dyn_cast<CastInst>(*I)) {
8143 // If this cast does not effect the value passed through the varargs
8144 // area, we can eliminate the use of the cast.
8145 Value *Op = CI->getOperand(0);
8146 if (CI->isLosslessCast()) {
8153 if (isa<InlineAsm>(Callee) && !CS.doesNotThrow()) {
8154 // Inline asm calls cannot throw - mark them 'nounwind'.
8155 CS.setDoesNotThrow();
8159 return Changed ? CS.getInstruction() : 0;
8162 // transformConstExprCastCall - If the callee is a constexpr cast of a function,
8163 // attempt to move the cast to the arguments of the call/invoke.
8165 bool InstCombiner::transformConstExprCastCall(CallSite CS) {
8166 if (!isa<ConstantExpr>(CS.getCalledValue())) return false;
8167 ConstantExpr *CE = cast<ConstantExpr>(CS.getCalledValue());
8168 if (CE->getOpcode() != Instruction::BitCast ||
8169 !isa<Function>(CE->getOperand(0)))
8171 Function *Callee = cast<Function>(CE->getOperand(0));
8172 Instruction *Caller = CS.getInstruction();
8173 const ParamAttrsList* CallerPAL = CS.getParamAttrs();
8175 // Okay, this is a cast from a function to a different type. Unless doing so
8176 // would cause a type conversion of one of our arguments, change this call to
8177 // be a direct call with arguments casted to the appropriate types.
8179 const FunctionType *FT = Callee->getFunctionType();
8180 const Type *OldRetTy = Caller->getType();
8182 // Check to see if we are changing the return type...
8183 if (OldRetTy != FT->getReturnType()) {
8184 if (Callee->isDeclaration() && !Caller->use_empty() &&
8185 // Conversion is ok if changing from pointer to int of same size.
8186 !(isa<PointerType>(FT->getReturnType()) &&
8187 TD->getIntPtrType() == OldRetTy))
8188 return false; // Cannot transform this return value.
8190 if (!Caller->use_empty() &&
8191 // void -> non-void is handled specially
8192 FT->getReturnType() != Type::VoidTy &&
8193 !CastInst::isCastable(FT->getReturnType(), OldRetTy))
8194 return false; // Cannot transform this return value.
8196 if (CallerPAL && !Caller->use_empty()) {
8197 uint16_t RAttrs = CallerPAL->getParamAttrs(0);
8198 if (RAttrs & ParamAttr::typeIncompatible(FT->getReturnType()))
8199 return false; // Attribute not compatible with transformed value.
8202 // If the callsite is an invoke instruction, and the return value is used by
8203 // a PHI node in a successor, we cannot change the return type of the call
8204 // because there is no place to put the cast instruction (without breaking
8205 // the critical edge). Bail out in this case.
8206 if (!Caller->use_empty())
8207 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller))
8208 for (Value::use_iterator UI = II->use_begin(), E = II->use_end();
8210 if (PHINode *PN = dyn_cast<PHINode>(*UI))
8211 if (PN->getParent() == II->getNormalDest() ||
8212 PN->getParent() == II->getUnwindDest())
8216 unsigned NumActualArgs = unsigned(CS.arg_end()-CS.arg_begin());
8217 unsigned NumCommonArgs = std::min(FT->getNumParams(), NumActualArgs);
8219 CallSite::arg_iterator AI = CS.arg_begin();
8220 for (unsigned i = 0, e = NumCommonArgs; i != e; ++i, ++AI) {
8221 const Type *ParamTy = FT->getParamType(i);
8222 const Type *ActTy = (*AI)->getType();
8224 if (!CastInst::isCastable(ActTy, ParamTy))
8225 return false; // Cannot transform this parameter value.
8228 uint16_t PAttrs = CallerPAL->getParamAttrs(i + 1);
8229 if (PAttrs & ParamAttr::typeIncompatible(ParamTy))
8230 return false; // Attribute not compatible with transformed value.
8233 ConstantInt *c = dyn_cast<ConstantInt>(*AI);
8234 // Some conversions are safe even if we do not have a body.
8235 // Either we can cast directly, or we can upconvert the argument
8236 bool isConvertible = ActTy == ParamTy ||
8237 (isa<PointerType>(ParamTy) && isa<PointerType>(ActTy)) ||
8238 (ParamTy->isInteger() && ActTy->isInteger() &&
8239 ParamTy->getPrimitiveSizeInBits() >= ActTy->getPrimitiveSizeInBits()) ||
8240 (c && ParamTy->getPrimitiveSizeInBits() >= ActTy->getPrimitiveSizeInBits()
8241 && c->getValue().isStrictlyPositive());
8242 if (Callee->isDeclaration() && !isConvertible) return false;
8245 if (FT->getNumParams() < NumActualArgs && !FT->isVarArg() &&
8246 Callee->isDeclaration())
8247 return false; // Do not delete arguments unless we have a function body...
8249 if (FT->getNumParams() < NumActualArgs && FT->isVarArg() && CallerPAL)
8250 // In this case we have more arguments than the new function type, but we
8251 // won't be dropping them. Check that these extra arguments have attributes
8252 // that are compatible with being a vararg call argument.
8253 for (unsigned i = CallerPAL->size(); i; --i) {
8254 if (CallerPAL->getParamIndex(i - 1) <= FT->getNumParams())
8256 uint16_t PAttrs = CallerPAL->getParamAttrsAtIndex(i - 1);
8257 if (PAttrs & ParamAttr::VarArgsIncompatible)
8261 // Okay, we decided that this is a safe thing to do: go ahead and start
8262 // inserting cast instructions as necessary...
8263 std::vector<Value*> Args;
8264 Args.reserve(NumActualArgs);
8265 ParamAttrsVector attrVec;
8266 attrVec.reserve(NumCommonArgs);
8268 // Get any return attributes.
8269 uint16_t RAttrs = CallerPAL ? CallerPAL->getParamAttrs(0) : 0;
8271 // If the return value is not being used, the type may not be compatible
8272 // with the existing attributes. Wipe out any problematic attributes.
8273 RAttrs &= ~ParamAttr::typeIncompatible(FT->getReturnType());
8275 // Add the new return attributes.
8277 attrVec.push_back(ParamAttrsWithIndex::get(0, RAttrs));
8279 AI = CS.arg_begin();
8280 for (unsigned i = 0; i != NumCommonArgs; ++i, ++AI) {
8281 const Type *ParamTy = FT->getParamType(i);
8282 if ((*AI)->getType() == ParamTy) {
8283 Args.push_back(*AI);
8285 Instruction::CastOps opcode = CastInst::getCastOpcode(*AI,
8286 false, ParamTy, false);
8287 CastInst *NewCast = CastInst::create(opcode, *AI, ParamTy, "tmp");
8288 Args.push_back(InsertNewInstBefore(NewCast, *Caller));
8291 // Add any parameter attributes.
8292 uint16_t PAttrs = CallerPAL ? CallerPAL->getParamAttrs(i + 1) : 0;
8294 attrVec.push_back(ParamAttrsWithIndex::get(i + 1, PAttrs));
8297 // If the function takes more arguments than the call was taking, add them
8299 for (unsigned i = NumCommonArgs; i != FT->getNumParams(); ++i)
8300 Args.push_back(Constant::getNullValue(FT->getParamType(i)));
8302 // If we are removing arguments to the function, emit an obnoxious warning...
8303 if (FT->getNumParams() < NumActualArgs)
8304 if (!FT->isVarArg()) {
8305 cerr << "WARNING: While resolving call to function '"
8306 << Callee->getName() << "' arguments were dropped!\n";
8308 // Add all of the arguments in their promoted form to the arg list...
8309 for (unsigned i = FT->getNumParams(); i != NumActualArgs; ++i, ++AI) {
8310 const Type *PTy = getPromotedType((*AI)->getType());
8311 if (PTy != (*AI)->getType()) {
8312 // Must promote to pass through va_arg area!
8313 Instruction::CastOps opcode = CastInst::getCastOpcode(*AI, false,
8315 Instruction *Cast = CastInst::create(opcode, *AI, PTy, "tmp");
8316 InsertNewInstBefore(Cast, *Caller);
8317 Args.push_back(Cast);
8319 Args.push_back(*AI);
8322 // Add any parameter attributes.
8323 uint16_t PAttrs = CallerPAL ? CallerPAL->getParamAttrs(i + 1) : 0;
8325 attrVec.push_back(ParamAttrsWithIndex::get(i + 1, PAttrs));
8329 if (FT->getReturnType() == Type::VoidTy)
8330 Caller->setName(""); // Void type should not have a name.
8332 const ParamAttrsList* NewCallerPAL = ParamAttrsList::get(attrVec);
8335 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
8336 NC = new InvokeInst(Callee, II->getNormalDest(), II->getUnwindDest(),
8337 Args.begin(), Args.end(), Caller->getName(), Caller);
8338 cast<InvokeInst>(NC)->setCallingConv(II->getCallingConv());
8339 cast<InvokeInst>(NC)->setParamAttrs(NewCallerPAL);
8341 NC = new CallInst(Callee, Args.begin(), Args.end(),
8342 Caller->getName(), Caller);
8343 CallInst *CI = cast<CallInst>(Caller);
8344 if (CI->isTailCall())
8345 cast<CallInst>(NC)->setTailCall();
8346 cast<CallInst>(NC)->setCallingConv(CI->getCallingConv());
8347 cast<CallInst>(NC)->setParamAttrs(NewCallerPAL);
8350 // Insert a cast of the return type as necessary.
8352 if (OldRetTy != NV->getType() && !Caller->use_empty()) {
8353 if (NV->getType() != Type::VoidTy) {
8354 Instruction::CastOps opcode = CastInst::getCastOpcode(NC, false,
8356 NV = NC = CastInst::create(opcode, NC, OldRetTy, "tmp");
8358 // If this is an invoke instruction, we should insert it after the first
8359 // non-phi, instruction in the normal successor block.
8360 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
8361 BasicBlock::iterator I = II->getNormalDest()->begin();
8362 while (isa<PHINode>(I)) ++I;
8363 InsertNewInstBefore(NC, *I);
8365 // Otherwise, it's a call, just insert cast right after the call instr
8366 InsertNewInstBefore(NC, *Caller);
8368 AddUsersToWorkList(*Caller);
8370 NV = UndefValue::get(Caller->getType());
8374 if (Caller->getType() != Type::VoidTy && !Caller->use_empty())
8375 Caller->replaceAllUsesWith(NV);
8376 Caller->eraseFromParent();
8377 RemoveFromWorkList(Caller);
8381 // transformCallThroughTrampoline - Turn a call to a function created by the
8382 // init_trampoline intrinsic into a direct call to the underlying function.
8384 Instruction *InstCombiner::transformCallThroughTrampoline(CallSite CS) {
8385 Value *Callee = CS.getCalledValue();
8386 const PointerType *PTy = cast<PointerType>(Callee->getType());
8387 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
8389 IntrinsicInst *Tramp =
8390 cast<IntrinsicInst>(cast<BitCastInst>(Callee)->getOperand(0));
8393 cast<Function>(IntrinsicInst::StripPointerCasts(Tramp->getOperand(2)));
8394 const PointerType *NestFPTy = cast<PointerType>(NestF->getType());
8395 const FunctionType *NestFTy = cast<FunctionType>(NestFPTy->getElementType());
8397 if (const ParamAttrsList *NestAttrs = NestF->getParamAttrs()) {
8398 unsigned NestIdx = 1;
8399 const Type *NestTy = 0;
8400 uint16_t NestAttr = 0;
8402 // Look for a parameter marked with the 'nest' attribute.
8403 for (FunctionType::param_iterator I = NestFTy->param_begin(),
8404 E = NestFTy->param_end(); I != E; ++NestIdx, ++I)
8405 if (NestAttrs->paramHasAttr(NestIdx, ParamAttr::Nest)) {
8406 // Record the parameter type and any other attributes.
8408 NestAttr = NestAttrs->getParamAttrs(NestIdx);
8413 Instruction *Caller = CS.getInstruction();
8414 std::vector<Value*> NewArgs;
8415 NewArgs.reserve(unsigned(CS.arg_end()-CS.arg_begin())+1);
8417 // Insert the nest argument into the call argument list, which may
8418 // mean appending it.
8421 CallSite::arg_iterator I = CS.arg_begin(), E = CS.arg_end();
8423 if (Idx == NestIdx) {
8424 // Add the chain argument.
8425 Value *NestVal = Tramp->getOperand(3);
8426 if (NestVal->getType() != NestTy)
8427 NestVal = new BitCastInst(NestVal, NestTy, "nest", Caller);
8428 NewArgs.push_back(NestVal);
8434 // Add the original argument.
8435 NewArgs.push_back(*I);
8441 // The trampoline may have been bitcast to a bogus type (FTy).
8442 // Handle this by synthesizing a new function type, equal to FTy
8443 // with the chain parameter inserted. Likewise for attributes.
8445 const ParamAttrsList *Attrs = CS.getParamAttrs();
8446 std::vector<const Type*> NewTypes;
8447 ParamAttrsVector NewAttrs;
8448 NewTypes.reserve(FTy->getNumParams()+1);
8450 // Add any function result attributes.
8451 uint16_t Attr = Attrs ? Attrs->getParamAttrs(0) : 0;
8453 NewAttrs.push_back (ParamAttrsWithIndex::get(0, Attr));
8455 // Insert the chain's type into the list of parameter types, which may
8456 // mean appending it. Likewise for the chain's attributes.
8459 FunctionType::param_iterator I = FTy->param_begin(),
8460 E = FTy->param_end();
8463 if (Idx == NestIdx) {
8464 // Add the chain's type and attributes.
8465 NewTypes.push_back(NestTy);
8466 NewAttrs.push_back(ParamAttrsWithIndex::get(NestIdx, NestAttr));
8472 // Add the original type and attributes.
8473 NewTypes.push_back(*I);
8474 Attr = Attrs ? Attrs->getParamAttrs(Idx) : 0;
8477 (ParamAttrsWithIndex::get(Idx + (Idx >= NestIdx), Attr));
8483 // Replace the trampoline call with a direct call. Let the generic
8484 // code sort out any function type mismatches.
8485 FunctionType *NewFTy =
8486 FunctionType::get(FTy->getReturnType(), NewTypes, FTy->isVarArg());
8487 Constant *NewCallee = NestF->getType() == PointerType::getUnqual(NewFTy) ?
8488 NestF : ConstantExpr::getBitCast(NestF, PointerType::getUnqual(NewFTy));
8489 const ParamAttrsList *NewPAL = ParamAttrsList::get(NewAttrs);
8491 Instruction *NewCaller;
8492 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
8493 NewCaller = new InvokeInst(NewCallee,
8494 II->getNormalDest(), II->getUnwindDest(),
8495 NewArgs.begin(), NewArgs.end(),
8496 Caller->getName(), Caller);
8497 cast<InvokeInst>(NewCaller)->setCallingConv(II->getCallingConv());
8498 cast<InvokeInst>(NewCaller)->setParamAttrs(NewPAL);
8500 NewCaller = new CallInst(NewCallee, NewArgs.begin(), NewArgs.end(),
8501 Caller->getName(), Caller);
8502 if (cast<CallInst>(Caller)->isTailCall())
8503 cast<CallInst>(NewCaller)->setTailCall();
8504 cast<CallInst>(NewCaller)->
8505 setCallingConv(cast<CallInst>(Caller)->getCallingConv());
8506 cast<CallInst>(NewCaller)->setParamAttrs(NewPAL);
8508 if (Caller->getType() != Type::VoidTy && !Caller->use_empty())
8509 Caller->replaceAllUsesWith(NewCaller);
8510 Caller->eraseFromParent();
8511 RemoveFromWorkList(Caller);
8516 // Replace the trampoline call with a direct call. Since there is no 'nest'
8517 // parameter, there is no need to adjust the argument list. Let the generic
8518 // code sort out any function type mismatches.
8519 Constant *NewCallee =
8520 NestF->getType() == PTy ? NestF : ConstantExpr::getBitCast(NestF, PTy);
8521 CS.setCalledFunction(NewCallee);
8522 return CS.getInstruction();
8525 /// FoldPHIArgBinOpIntoPHI - If we have something like phi [add (a,b), add(c,d)]
8526 /// and if a/b/c/d and the add's all have a single use, turn this into two phi's
8527 /// and a single binop.
8528 Instruction *InstCombiner::FoldPHIArgBinOpIntoPHI(PHINode &PN) {
8529 Instruction *FirstInst = cast<Instruction>(PN.getIncomingValue(0));
8530 assert(isa<BinaryOperator>(FirstInst) || isa<GetElementPtrInst>(FirstInst) ||
8531 isa<CmpInst>(FirstInst));
8532 unsigned Opc = FirstInst->getOpcode();
8533 Value *LHSVal = FirstInst->getOperand(0);
8534 Value *RHSVal = FirstInst->getOperand(1);
8536 const Type *LHSType = LHSVal->getType();
8537 const Type *RHSType = RHSVal->getType();
8539 // Scan to see if all operands are the same opcode, all have one use, and all
8540 // kill their operands (i.e. the operands have one use).
8541 for (unsigned i = 0; i != PN.getNumIncomingValues(); ++i) {
8542 Instruction *I = dyn_cast<Instruction>(PN.getIncomingValue(i));
8543 if (!I || I->getOpcode() != Opc || !I->hasOneUse() ||
8544 // Verify type of the LHS matches so we don't fold cmp's of different
8545 // types or GEP's with different index types.
8546 I->getOperand(0)->getType() != LHSType ||
8547 I->getOperand(1)->getType() != RHSType)
8550 // If they are CmpInst instructions, check their predicates
8551 if (Opc == Instruction::ICmp || Opc == Instruction::FCmp)
8552 if (cast<CmpInst>(I)->getPredicate() !=
8553 cast<CmpInst>(FirstInst)->getPredicate())
8556 // Keep track of which operand needs a phi node.
8557 if (I->getOperand(0) != LHSVal) LHSVal = 0;
8558 if (I->getOperand(1) != RHSVal) RHSVal = 0;
8561 // Otherwise, this is safe to transform, determine if it is profitable.
8563 // If this is a GEP, and if the index (not the pointer) needs a PHI, bail out.
8564 // Indexes are often folded into load/store instructions, so we don't want to
8565 // hide them behind a phi.
8566 if (isa<GetElementPtrInst>(FirstInst) && RHSVal == 0)
8569 Value *InLHS = FirstInst->getOperand(0);
8570 Value *InRHS = FirstInst->getOperand(1);
8571 PHINode *NewLHS = 0, *NewRHS = 0;
8573 NewLHS = new PHINode(LHSType, FirstInst->getOperand(0)->getName()+".pn");
8574 NewLHS->reserveOperandSpace(PN.getNumOperands()/2);
8575 NewLHS->addIncoming(InLHS, PN.getIncomingBlock(0));
8576 InsertNewInstBefore(NewLHS, PN);
8581 NewRHS = new PHINode(RHSType, FirstInst->getOperand(1)->getName()+".pn");
8582 NewRHS->reserveOperandSpace(PN.getNumOperands()/2);
8583 NewRHS->addIncoming(InRHS, PN.getIncomingBlock(0));
8584 InsertNewInstBefore(NewRHS, PN);
8588 // Add all operands to the new PHIs.
8589 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
8591 Value *NewInLHS =cast<Instruction>(PN.getIncomingValue(i))->getOperand(0);
8592 NewLHS->addIncoming(NewInLHS, PN.getIncomingBlock(i));
8595 Value *NewInRHS =cast<Instruction>(PN.getIncomingValue(i))->getOperand(1);
8596 NewRHS->addIncoming(NewInRHS, PN.getIncomingBlock(i));
8600 if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(FirstInst))
8601 return BinaryOperator::create(BinOp->getOpcode(), LHSVal, RHSVal);
8602 else if (CmpInst *CIOp = dyn_cast<CmpInst>(FirstInst))
8603 return CmpInst::create(CIOp->getOpcode(), CIOp->getPredicate(), LHSVal,
8606 assert(isa<GetElementPtrInst>(FirstInst));
8607 return new GetElementPtrInst(LHSVal, RHSVal);
8611 /// isSafeToSinkLoad - Return true if we know that it is safe sink the load out
8612 /// of the block that defines it. This means that it must be obvious the value
8613 /// of the load is not changed from the point of the load to the end of the
8616 /// Finally, it is safe, but not profitable, to sink a load targetting a
8617 /// non-address-taken alloca. Doing so will cause us to not promote the alloca
8619 static bool isSafeToSinkLoad(LoadInst *L) {
8620 BasicBlock::iterator BBI = L, E = L->getParent()->end();
8622 for (++BBI; BBI != E; ++BBI)
8623 if (BBI->mayWriteToMemory())
8626 // Check for non-address taken alloca. If not address-taken already, it isn't
8627 // profitable to do this xform.
8628 if (AllocaInst *AI = dyn_cast<AllocaInst>(L->getOperand(0))) {
8629 bool isAddressTaken = false;
8630 for (Value::use_iterator UI = AI->use_begin(), E = AI->use_end();
8632 if (isa<LoadInst>(UI)) continue;
8633 if (StoreInst *SI = dyn_cast<StoreInst>(*UI)) {
8634 // If storing TO the alloca, then the address isn't taken.
8635 if (SI->getOperand(1) == AI) continue;
8637 isAddressTaken = true;
8641 if (!isAddressTaken)
8649 // FoldPHIArgOpIntoPHI - If all operands to a PHI node are the same "unary"
8650 // operator and they all are only used by the PHI, PHI together their
8651 // inputs, and do the operation once, to the result of the PHI.
8652 Instruction *InstCombiner::FoldPHIArgOpIntoPHI(PHINode &PN) {
8653 Instruction *FirstInst = cast<Instruction>(PN.getIncomingValue(0));
8655 // Scan the instruction, looking for input operations that can be folded away.
8656 // If all input operands to the phi are the same instruction (e.g. a cast from
8657 // the same type or "+42") we can pull the operation through the PHI, reducing
8658 // code size and simplifying code.
8659 Constant *ConstantOp = 0;
8660 const Type *CastSrcTy = 0;
8661 bool isVolatile = false;
8662 if (isa<CastInst>(FirstInst)) {
8663 CastSrcTy = FirstInst->getOperand(0)->getType();
8664 } else if (isa<BinaryOperator>(FirstInst) || isa<CmpInst>(FirstInst)) {
8665 // Can fold binop, compare or shift here if the RHS is a constant,
8666 // otherwise call FoldPHIArgBinOpIntoPHI.
8667 ConstantOp = dyn_cast<Constant>(FirstInst->getOperand(1));
8668 if (ConstantOp == 0)
8669 return FoldPHIArgBinOpIntoPHI(PN);
8670 } else if (LoadInst *LI = dyn_cast<LoadInst>(FirstInst)) {
8671 isVolatile = LI->isVolatile();
8672 // We can't sink the load if the loaded value could be modified between the
8673 // load and the PHI.
8674 if (LI->getParent() != PN.getIncomingBlock(0) ||
8675 !isSafeToSinkLoad(LI))
8677 } else if (isa<GetElementPtrInst>(FirstInst)) {
8678 if (FirstInst->getNumOperands() == 2)
8679 return FoldPHIArgBinOpIntoPHI(PN);
8680 // Can't handle general GEPs yet.
8683 return 0; // Cannot fold this operation.
8686 // Check to see if all arguments are the same operation.
8687 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
8688 if (!isa<Instruction>(PN.getIncomingValue(i))) return 0;
8689 Instruction *I = cast<Instruction>(PN.getIncomingValue(i));
8690 if (!I->hasOneUse() || !I->isSameOperationAs(FirstInst))
8693 if (I->getOperand(0)->getType() != CastSrcTy)
8694 return 0; // Cast operation must match.
8695 } else if (LoadInst *LI = dyn_cast<LoadInst>(I)) {
8696 // We can't sink the load if the loaded value could be modified between
8697 // the load and the PHI.
8698 if (LI->isVolatile() != isVolatile ||
8699 LI->getParent() != PN.getIncomingBlock(i) ||
8700 !isSafeToSinkLoad(LI))
8702 } else if (I->getOperand(1) != ConstantOp) {
8707 // Okay, they are all the same operation. Create a new PHI node of the
8708 // correct type, and PHI together all of the LHS's of the instructions.
8709 PHINode *NewPN = new PHINode(FirstInst->getOperand(0)->getType(),
8710 PN.getName()+".in");
8711 NewPN->reserveOperandSpace(PN.getNumOperands()/2);
8713 Value *InVal = FirstInst->getOperand(0);
8714 NewPN->addIncoming(InVal, PN.getIncomingBlock(0));
8716 // Add all operands to the new PHI.
8717 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
8718 Value *NewInVal = cast<Instruction>(PN.getIncomingValue(i))->getOperand(0);
8719 if (NewInVal != InVal)
8721 NewPN->addIncoming(NewInVal, PN.getIncomingBlock(i));
8726 // The new PHI unions all of the same values together. This is really
8727 // common, so we handle it intelligently here for compile-time speed.
8731 InsertNewInstBefore(NewPN, PN);
8735 // Insert and return the new operation.
8736 if (CastInst* FirstCI = dyn_cast<CastInst>(FirstInst))
8737 return CastInst::create(FirstCI->getOpcode(), PhiVal, PN.getType());
8738 else if (isa<LoadInst>(FirstInst))
8739 return new LoadInst(PhiVal, "", isVolatile);
8740 else if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(FirstInst))
8741 return BinaryOperator::create(BinOp->getOpcode(), PhiVal, ConstantOp);
8742 else if (CmpInst *CIOp = dyn_cast<CmpInst>(FirstInst))
8743 return CmpInst::create(CIOp->getOpcode(), CIOp->getPredicate(),
8744 PhiVal, ConstantOp);
8746 assert(0 && "Unknown operation");
8750 /// DeadPHICycle - Return true if this PHI node is only used by a PHI node cycle
8752 static bool DeadPHICycle(PHINode *PN,
8753 SmallPtrSet<PHINode*, 16> &PotentiallyDeadPHIs) {
8754 if (PN->use_empty()) return true;
8755 if (!PN->hasOneUse()) return false;
8757 // Remember this node, and if we find the cycle, return.
8758 if (!PotentiallyDeadPHIs.insert(PN))
8761 // Don't scan crazily complex things.
8762 if (PotentiallyDeadPHIs.size() == 16)
8765 if (PHINode *PU = dyn_cast<PHINode>(PN->use_back()))
8766 return DeadPHICycle(PU, PotentiallyDeadPHIs);
8771 /// PHIsEqualValue - Return true if this phi node is always equal to
8772 /// NonPhiInVal. This happens with mutually cyclic phi nodes like:
8773 /// z = some value; x = phi (y, z); y = phi (x, z)
8774 static bool PHIsEqualValue(PHINode *PN, Value *NonPhiInVal,
8775 SmallPtrSet<PHINode*, 16> &ValueEqualPHIs) {
8776 // See if we already saw this PHI node.
8777 if (!ValueEqualPHIs.insert(PN))
8780 // Don't scan crazily complex things.
8781 if (ValueEqualPHIs.size() == 16)
8784 // Scan the operands to see if they are either phi nodes or are equal to
8786 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
8787 Value *Op = PN->getIncomingValue(i);
8788 if (PHINode *OpPN = dyn_cast<PHINode>(Op)) {
8789 if (!PHIsEqualValue(OpPN, NonPhiInVal, ValueEqualPHIs))
8791 } else if (Op != NonPhiInVal)
8799 // PHINode simplification
8801 Instruction *InstCombiner::visitPHINode(PHINode &PN) {
8802 // If LCSSA is around, don't mess with Phi nodes
8803 if (MustPreserveLCSSA) return 0;
8805 if (Value *V = PN.hasConstantValue())
8806 return ReplaceInstUsesWith(PN, V);
8808 // If all PHI operands are the same operation, pull them through the PHI,
8809 // reducing code size.
8810 if (isa<Instruction>(PN.getIncomingValue(0)) &&
8811 PN.getIncomingValue(0)->hasOneUse())
8812 if (Instruction *Result = FoldPHIArgOpIntoPHI(PN))
8815 // If this is a trivial cycle in the PHI node graph, remove it. Basically, if
8816 // this PHI only has a single use (a PHI), and if that PHI only has one use (a
8817 // PHI)... break the cycle.
8818 if (PN.hasOneUse()) {
8819 Instruction *PHIUser = cast<Instruction>(PN.use_back());
8820 if (PHINode *PU = dyn_cast<PHINode>(PHIUser)) {
8821 SmallPtrSet<PHINode*, 16> PotentiallyDeadPHIs;
8822 PotentiallyDeadPHIs.insert(&PN);
8823 if (DeadPHICycle(PU, PotentiallyDeadPHIs))
8824 return ReplaceInstUsesWith(PN, UndefValue::get(PN.getType()));
8827 // If this phi has a single use, and if that use just computes a value for
8828 // the next iteration of a loop, delete the phi. This occurs with unused
8829 // induction variables, e.g. "for (int j = 0; ; ++j);". Detecting this
8830 // common case here is good because the only other things that catch this
8831 // are induction variable analysis (sometimes) and ADCE, which is only run
8833 if (PHIUser->hasOneUse() &&
8834 (isa<BinaryOperator>(PHIUser) || isa<GetElementPtrInst>(PHIUser)) &&
8835 PHIUser->use_back() == &PN) {
8836 return ReplaceInstUsesWith(PN, UndefValue::get(PN.getType()));
8840 // We sometimes end up with phi cycles that non-obviously end up being the
8841 // same value, for example:
8842 // z = some value; x = phi (y, z); y = phi (x, z)
8843 // where the phi nodes don't necessarily need to be in the same block. Do a
8844 // quick check to see if the PHI node only contains a single non-phi value, if
8845 // so, scan to see if the phi cycle is actually equal to that value.
8847 unsigned InValNo = 0, NumOperandVals = PN.getNumIncomingValues();
8848 // Scan for the first non-phi operand.
8849 while (InValNo != NumOperandVals &&
8850 isa<PHINode>(PN.getIncomingValue(InValNo)))
8853 if (InValNo != NumOperandVals) {
8854 Value *NonPhiInVal = PN.getOperand(InValNo);
8856 // Scan the rest of the operands to see if there are any conflicts, if so
8857 // there is no need to recursively scan other phis.
8858 for (++InValNo; InValNo != NumOperandVals; ++InValNo) {
8859 Value *OpVal = PN.getIncomingValue(InValNo);
8860 if (OpVal != NonPhiInVal && !isa<PHINode>(OpVal))
8864 // If we scanned over all operands, then we have one unique value plus
8865 // phi values. Scan PHI nodes to see if they all merge in each other or
8867 if (InValNo == NumOperandVals) {
8868 SmallPtrSet<PHINode*, 16> ValueEqualPHIs;
8869 if (PHIsEqualValue(&PN, NonPhiInVal, ValueEqualPHIs))
8870 return ReplaceInstUsesWith(PN, NonPhiInVal);
8877 static Value *InsertCastToIntPtrTy(Value *V, const Type *DTy,
8878 Instruction *InsertPoint,
8880 unsigned PtrSize = DTy->getPrimitiveSizeInBits();
8881 unsigned VTySize = V->getType()->getPrimitiveSizeInBits();
8882 // We must cast correctly to the pointer type. Ensure that we
8883 // sign extend the integer value if it is smaller as this is
8884 // used for address computation.
8885 Instruction::CastOps opcode =
8886 (VTySize < PtrSize ? Instruction::SExt :
8887 (VTySize == PtrSize ? Instruction::BitCast : Instruction::Trunc));
8888 return IC->InsertCastBefore(opcode, V, DTy, *InsertPoint);
8892 Instruction *InstCombiner::visitGetElementPtrInst(GetElementPtrInst &GEP) {
8893 Value *PtrOp = GEP.getOperand(0);
8894 // Is it 'getelementptr %P, i32 0' or 'getelementptr %P'
8895 // If so, eliminate the noop.
8896 if (GEP.getNumOperands() == 1)
8897 return ReplaceInstUsesWith(GEP, PtrOp);
8899 if (isa<UndefValue>(GEP.getOperand(0)))
8900 return ReplaceInstUsesWith(GEP, UndefValue::get(GEP.getType()));
8902 bool HasZeroPointerIndex = false;
8903 if (Constant *C = dyn_cast<Constant>(GEP.getOperand(1)))
8904 HasZeroPointerIndex = C->isNullValue();
8906 if (GEP.getNumOperands() == 2 && HasZeroPointerIndex)
8907 return ReplaceInstUsesWith(GEP, PtrOp);
8909 // Eliminate unneeded casts for indices.
8910 bool MadeChange = false;
8912 gep_type_iterator GTI = gep_type_begin(GEP);
8913 for (unsigned i = 1, e = GEP.getNumOperands(); i != e; ++i, ++GTI) {
8914 if (isa<SequentialType>(*GTI)) {
8915 if (CastInst *CI = dyn_cast<CastInst>(GEP.getOperand(i))) {
8916 if (CI->getOpcode() == Instruction::ZExt ||
8917 CI->getOpcode() == Instruction::SExt) {
8918 const Type *SrcTy = CI->getOperand(0)->getType();
8919 // We can eliminate a cast from i32 to i64 iff the target
8920 // is a 32-bit pointer target.
8921 if (SrcTy->getPrimitiveSizeInBits() >= TD->getPointerSizeInBits()) {
8923 GEP.setOperand(i, CI->getOperand(0));
8927 // If we are using a wider index than needed for this platform, shrink it
8928 // to what we need. If the incoming value needs a cast instruction,
8929 // insert it. This explicit cast can make subsequent optimizations more
8931 Value *Op = GEP.getOperand(i);
8932 if (TD->getTypeSizeInBits(Op->getType()) > TD->getPointerSizeInBits())
8933 if (Constant *C = dyn_cast<Constant>(Op)) {
8934 GEP.setOperand(i, ConstantExpr::getTrunc(C, TD->getIntPtrType()));
8937 Op = InsertCastBefore(Instruction::Trunc, Op, TD->getIntPtrType(),
8939 GEP.setOperand(i, Op);
8944 if (MadeChange) return &GEP;
8946 // If this GEP instruction doesn't move the pointer, and if the input operand
8947 // is a bitcast of another pointer, just replace the GEP with a bitcast of the
8948 // real input to the dest type.
8949 if (GEP.hasAllZeroIndices()) {
8950 if (BitCastInst *BCI = dyn_cast<BitCastInst>(GEP.getOperand(0))) {
8951 // If the bitcast is of an allocation, and the allocation will be
8952 // converted to match the type of the cast, don't touch this.
8953 if (isa<AllocationInst>(BCI->getOperand(0))) {
8954 // See if the bitcast simplifies, if so, don't nuke this GEP yet.
8955 if (Instruction *I = visitBitCast(*BCI)) {
8958 BCI->getParent()->getInstList().insert(BCI, I);
8959 ReplaceInstUsesWith(*BCI, I);
8964 return new BitCastInst(BCI->getOperand(0), GEP.getType());
8968 // Combine Indices - If the source pointer to this getelementptr instruction
8969 // is a getelementptr instruction, combine the indices of the two
8970 // getelementptr instructions into a single instruction.
8972 SmallVector<Value*, 8> SrcGEPOperands;
8973 if (User *Src = dyn_castGetElementPtr(PtrOp))
8974 SrcGEPOperands.append(Src->op_begin(), Src->op_end());
8976 if (!SrcGEPOperands.empty()) {
8977 // Note that if our source is a gep chain itself that we wait for that
8978 // chain to be resolved before we perform this transformation. This
8979 // avoids us creating a TON of code in some cases.
8981 if (isa<GetElementPtrInst>(SrcGEPOperands[0]) &&
8982 cast<Instruction>(SrcGEPOperands[0])->getNumOperands() == 2)
8983 return 0; // Wait until our source is folded to completion.
8985 SmallVector<Value*, 8> Indices;
8987 // Find out whether the last index in the source GEP is a sequential idx.
8988 bool EndsWithSequential = false;
8989 for (gep_type_iterator I = gep_type_begin(*cast<User>(PtrOp)),
8990 E = gep_type_end(*cast<User>(PtrOp)); I != E; ++I)
8991 EndsWithSequential = !isa<StructType>(*I);
8993 // Can we combine the two pointer arithmetics offsets?
8994 if (EndsWithSequential) {
8995 // Replace: gep (gep %P, long B), long A, ...
8996 // With: T = long A+B; gep %P, T, ...
8998 Value *Sum, *SO1 = SrcGEPOperands.back(), *GO1 = GEP.getOperand(1);
8999 if (SO1 == Constant::getNullValue(SO1->getType())) {
9001 } else if (GO1 == Constant::getNullValue(GO1->getType())) {
9004 // If they aren't the same type, convert both to an integer of the
9005 // target's pointer size.
9006 if (SO1->getType() != GO1->getType()) {
9007 if (Constant *SO1C = dyn_cast<Constant>(SO1)) {
9008 SO1 = ConstantExpr::getIntegerCast(SO1C, GO1->getType(), true);
9009 } else if (Constant *GO1C = dyn_cast<Constant>(GO1)) {
9010 GO1 = ConstantExpr::getIntegerCast(GO1C, SO1->getType(), true);
9012 unsigned PS = TD->getPointerSizeInBits();
9013 if (TD->getTypeSizeInBits(SO1->getType()) == PS) {
9014 // Convert GO1 to SO1's type.
9015 GO1 = InsertCastToIntPtrTy(GO1, SO1->getType(), &GEP, this);
9017 } else if (TD->getTypeSizeInBits(GO1->getType()) == PS) {
9018 // Convert SO1 to GO1's type.
9019 SO1 = InsertCastToIntPtrTy(SO1, GO1->getType(), &GEP, this);
9021 const Type *PT = TD->getIntPtrType();
9022 SO1 = InsertCastToIntPtrTy(SO1, PT, &GEP, this);
9023 GO1 = InsertCastToIntPtrTy(GO1, PT, &GEP, this);
9027 if (isa<Constant>(SO1) && isa<Constant>(GO1))
9028 Sum = ConstantExpr::getAdd(cast<Constant>(SO1), cast<Constant>(GO1));
9030 Sum = BinaryOperator::createAdd(SO1, GO1, PtrOp->getName()+".sum");
9031 InsertNewInstBefore(cast<Instruction>(Sum), GEP);
9035 // Recycle the GEP we already have if possible.
9036 if (SrcGEPOperands.size() == 2) {
9037 GEP.setOperand(0, SrcGEPOperands[0]);
9038 GEP.setOperand(1, Sum);
9041 Indices.insert(Indices.end(), SrcGEPOperands.begin()+1,
9042 SrcGEPOperands.end()-1);
9043 Indices.push_back(Sum);
9044 Indices.insert(Indices.end(), GEP.op_begin()+2, GEP.op_end());
9046 } else if (isa<Constant>(*GEP.idx_begin()) &&
9047 cast<Constant>(*GEP.idx_begin())->isNullValue() &&
9048 SrcGEPOperands.size() != 1) {
9049 // Otherwise we can do the fold if the first index of the GEP is a zero
9050 Indices.insert(Indices.end(), SrcGEPOperands.begin()+1,
9051 SrcGEPOperands.end());
9052 Indices.insert(Indices.end(), GEP.idx_begin()+1, GEP.idx_end());
9055 if (!Indices.empty())
9056 return new GetElementPtrInst(SrcGEPOperands[0], Indices.begin(),
9057 Indices.end(), GEP.getName());
9059 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(PtrOp)) {
9060 // GEP of global variable. If all of the indices for this GEP are
9061 // constants, we can promote this to a constexpr instead of an instruction.
9063 // Scan for nonconstants...
9064 SmallVector<Constant*, 8> Indices;
9065 User::op_iterator I = GEP.idx_begin(), E = GEP.idx_end();
9066 for (; I != E && isa<Constant>(*I); ++I)
9067 Indices.push_back(cast<Constant>(*I));
9069 if (I == E) { // If they are all constants...
9070 Constant *CE = ConstantExpr::getGetElementPtr(GV,
9071 &Indices[0],Indices.size());
9073 // Replace all uses of the GEP with the new constexpr...
9074 return ReplaceInstUsesWith(GEP, CE);
9076 } else if (Value *X = getBitCastOperand(PtrOp)) { // Is the operand a cast?
9077 if (!isa<PointerType>(X->getType())) {
9078 // Not interesting. Source pointer must be a cast from pointer.
9079 } else if (HasZeroPointerIndex) {
9080 // transform: GEP (bitcast [10 x i8]* X to [0 x i8]*), i32 0, ...
9081 // into : GEP [10 x i8]* X, i32 0, ...
9083 // This occurs when the program declares an array extern like "int X[];"
9085 const PointerType *CPTy = cast<PointerType>(PtrOp->getType());
9086 const PointerType *XTy = cast<PointerType>(X->getType());
9087 if (const ArrayType *XATy =
9088 dyn_cast<ArrayType>(XTy->getElementType()))
9089 if (const ArrayType *CATy =
9090 dyn_cast<ArrayType>(CPTy->getElementType()))
9091 if (CATy->getElementType() == XATy->getElementType()) {
9092 // At this point, we know that the cast source type is a pointer
9093 // to an array of the same type as the destination pointer
9094 // array. Because the array type is never stepped over (there
9095 // is a leading zero) we can fold the cast into this GEP.
9096 GEP.setOperand(0, X);
9099 } else if (GEP.getNumOperands() == 2) {
9100 // Transform things like:
9101 // %t = getelementptr i32* bitcast ([2 x i32]* %str to i32*), i32 %V
9102 // into: %t1 = getelementptr [2 x i32]* %str, i32 0, i32 %V; bitcast
9103 const Type *SrcElTy = cast<PointerType>(X->getType())->getElementType();
9104 const Type *ResElTy=cast<PointerType>(PtrOp->getType())->getElementType();
9105 if (isa<ArrayType>(SrcElTy) &&
9106 TD->getABITypeSize(cast<ArrayType>(SrcElTy)->getElementType()) ==
9107 TD->getABITypeSize(ResElTy)) {
9109 Idx[0] = Constant::getNullValue(Type::Int32Ty);
9110 Idx[1] = GEP.getOperand(1);
9111 Value *V = InsertNewInstBefore(
9112 new GetElementPtrInst(X, Idx, Idx + 2, GEP.getName()), GEP);
9113 // V and GEP are both pointer types --> BitCast
9114 return new BitCastInst(V, GEP.getType());
9117 // Transform things like:
9118 // getelementptr i8* bitcast ([100 x double]* X to i8*), i32 %tmp
9119 // (where tmp = 8*tmp2) into:
9120 // getelementptr [100 x double]* %arr, i32 0, i32 %tmp2; bitcast
9122 if (isa<ArrayType>(SrcElTy) && ResElTy == Type::Int8Ty) {
9123 uint64_t ArrayEltSize =
9124 TD->getABITypeSize(cast<ArrayType>(SrcElTy)->getElementType());
9126 // Check to see if "tmp" is a scale by a multiple of ArrayEltSize. We
9127 // allow either a mul, shift, or constant here.
9129 ConstantInt *Scale = 0;
9130 if (ArrayEltSize == 1) {
9131 NewIdx = GEP.getOperand(1);
9132 Scale = ConstantInt::get(NewIdx->getType(), 1);
9133 } else if (ConstantInt *CI = dyn_cast<ConstantInt>(GEP.getOperand(1))) {
9134 NewIdx = ConstantInt::get(CI->getType(), 1);
9136 } else if (Instruction *Inst =dyn_cast<Instruction>(GEP.getOperand(1))){
9137 if (Inst->getOpcode() == Instruction::Shl &&
9138 isa<ConstantInt>(Inst->getOperand(1))) {
9139 ConstantInt *ShAmt = cast<ConstantInt>(Inst->getOperand(1));
9140 uint32_t ShAmtVal = ShAmt->getLimitedValue(64);
9141 Scale = ConstantInt::get(Inst->getType(), 1ULL << ShAmtVal);
9142 NewIdx = Inst->getOperand(0);
9143 } else if (Inst->getOpcode() == Instruction::Mul &&
9144 isa<ConstantInt>(Inst->getOperand(1))) {
9145 Scale = cast<ConstantInt>(Inst->getOperand(1));
9146 NewIdx = Inst->getOperand(0);
9150 // If the index will be to exactly the right offset with the scale taken
9151 // out, perform the transformation. Note, we don't know whether Scale is
9152 // signed or not. We'll use unsigned version of division/modulo
9153 // operation after making sure Scale doesn't have the sign bit set.
9154 if (Scale && Scale->getSExtValue() >= 0LL &&
9155 Scale->getZExtValue() % ArrayEltSize == 0) {
9156 Scale = ConstantInt::get(Scale->getType(),
9157 Scale->getZExtValue() / ArrayEltSize);
9158 if (Scale->getZExtValue() != 1) {
9159 Constant *C = ConstantExpr::getIntegerCast(Scale, NewIdx->getType(),
9161 Instruction *Sc = BinaryOperator::createMul(NewIdx, C, "idxscale");
9162 NewIdx = InsertNewInstBefore(Sc, GEP);
9165 // Insert the new GEP instruction.
9167 Idx[0] = Constant::getNullValue(Type::Int32Ty);
9169 Instruction *NewGEP =
9170 new GetElementPtrInst(X, Idx, Idx + 2, GEP.getName());
9171 NewGEP = InsertNewInstBefore(NewGEP, GEP);
9172 // The NewGEP must be pointer typed, so must the old one -> BitCast
9173 return new BitCastInst(NewGEP, GEP.getType());
9182 Instruction *InstCombiner::visitAllocationInst(AllocationInst &AI) {
9183 // Convert: malloc Ty, C - where C is a constant != 1 into: malloc [C x Ty], 1
9184 if (AI.isArrayAllocation()) // Check C != 1
9185 if (const ConstantInt *C = dyn_cast<ConstantInt>(AI.getArraySize())) {
9187 ArrayType::get(AI.getAllocatedType(), C->getZExtValue());
9188 AllocationInst *New = 0;
9190 // Create and insert the replacement instruction...
9191 if (isa<MallocInst>(AI))
9192 New = new MallocInst(NewTy, 0, AI.getAlignment(), AI.getName());
9194 assert(isa<AllocaInst>(AI) && "Unknown type of allocation inst!");
9195 New = new AllocaInst(NewTy, 0, AI.getAlignment(), AI.getName());
9198 InsertNewInstBefore(New, AI);
9200 // Scan to the end of the allocation instructions, to skip over a block of
9201 // allocas if possible...
9203 BasicBlock::iterator It = New;
9204 while (isa<AllocationInst>(*It)) ++It;
9206 // Now that I is pointing to the first non-allocation-inst in the block,
9207 // insert our getelementptr instruction...
9209 Value *NullIdx = Constant::getNullValue(Type::Int32Ty);
9213 Value *V = new GetElementPtrInst(New, Idx, Idx + 2,
9214 New->getName()+".sub", It);
9216 // Now make everything use the getelementptr instead of the original
9218 return ReplaceInstUsesWith(AI, V);
9219 } else if (isa<UndefValue>(AI.getArraySize())) {
9220 return ReplaceInstUsesWith(AI, Constant::getNullValue(AI.getType()));
9223 // If alloca'ing a zero byte object, replace the alloca with a null pointer.
9224 // Note that we only do this for alloca's, because malloc should allocate and
9225 // return a unique pointer, even for a zero byte allocation.
9226 if (isa<AllocaInst>(AI) && AI.getAllocatedType()->isSized() &&
9227 TD->getABITypeSize(AI.getAllocatedType()) == 0)
9228 return ReplaceInstUsesWith(AI, Constant::getNullValue(AI.getType()));
9233 Instruction *InstCombiner::visitFreeInst(FreeInst &FI) {
9234 Value *Op = FI.getOperand(0);
9236 // free undef -> unreachable.
9237 if (isa<UndefValue>(Op)) {
9238 // Insert a new store to null because we cannot modify the CFG here.
9239 new StoreInst(ConstantInt::getTrue(),
9240 UndefValue::get(PointerType::getUnqual(Type::Int1Ty)), &FI);
9241 return EraseInstFromFunction(FI);
9244 // If we have 'free null' delete the instruction. This can happen in stl code
9245 // when lots of inlining happens.
9246 if (isa<ConstantPointerNull>(Op))
9247 return EraseInstFromFunction(FI);
9249 // Change free <ty>* (cast <ty2>* X to <ty>*) into free <ty2>* X
9250 if (BitCastInst *CI = dyn_cast<BitCastInst>(Op)) {
9251 FI.setOperand(0, CI->getOperand(0));
9255 // Change free (gep X, 0,0,0,0) into free(X)
9256 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(Op)) {
9257 if (GEPI->hasAllZeroIndices()) {
9258 AddToWorkList(GEPI);
9259 FI.setOperand(0, GEPI->getOperand(0));
9264 // Change free(malloc) into nothing, if the malloc has a single use.
9265 if (MallocInst *MI = dyn_cast<MallocInst>(Op))
9266 if (MI->hasOneUse()) {
9267 EraseInstFromFunction(FI);
9268 return EraseInstFromFunction(*MI);
9275 /// InstCombineLoadCast - Fold 'load (cast P)' -> cast (load P)' when possible.
9276 static Instruction *InstCombineLoadCast(InstCombiner &IC, LoadInst &LI,
9277 const TargetData *TD) {
9278 User *CI = cast<User>(LI.getOperand(0));
9279 Value *CastOp = CI->getOperand(0);
9281 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(CI)) {
9282 // Instead of loading constant c string, use corresponding integer value
9283 // directly if string length is small enough.
9284 const std::string &Str = CE->getOperand(0)->getStringValue();
9286 unsigned len = Str.length();
9287 const Type *Ty = cast<PointerType>(CE->getType())->getElementType();
9288 unsigned numBits = Ty->getPrimitiveSizeInBits();
9289 // Replace LI with immediate integer store.
9290 if ((numBits >> 3) == len + 1) {
9291 APInt StrVal(numBits, 0);
9292 APInt SingleChar(numBits, 0);
9293 if (TD->isLittleEndian()) {
9294 for (signed i = len-1; i >= 0; i--) {
9295 SingleChar = (uint64_t) Str[i];
9296 StrVal = (StrVal << 8) | SingleChar;
9299 for (unsigned i = 0; i < len; i++) {
9300 SingleChar = (uint64_t) Str[i];
9301 StrVal = (StrVal << 8) | SingleChar;
9303 // Append NULL at the end.
9305 StrVal = (StrVal << 8) | SingleChar;
9307 Value *NL = ConstantInt::get(StrVal);
9308 return IC.ReplaceInstUsesWith(LI, NL);
9313 const Type *DestPTy = cast<PointerType>(CI->getType())->getElementType();
9314 if (const PointerType *SrcTy = dyn_cast<PointerType>(CastOp->getType())) {
9315 const Type *SrcPTy = SrcTy->getElementType();
9317 if (DestPTy->isInteger() || isa<PointerType>(DestPTy) ||
9318 isa<VectorType>(DestPTy)) {
9319 // If the source is an array, the code below will not succeed. Check to
9320 // see if a trivial 'gep P, 0, 0' will help matters. Only do this for
9322 if (const ArrayType *ASrcTy = dyn_cast<ArrayType>(SrcPTy))
9323 if (Constant *CSrc = dyn_cast<Constant>(CastOp))
9324 if (ASrcTy->getNumElements() != 0) {
9326 Idxs[0] = Idxs[1] = Constant::getNullValue(Type::Int32Ty);
9327 CastOp = ConstantExpr::getGetElementPtr(CSrc, Idxs, 2);
9328 SrcTy = cast<PointerType>(CastOp->getType());
9329 SrcPTy = SrcTy->getElementType();
9332 if ((SrcPTy->isInteger() || isa<PointerType>(SrcPTy) ||
9333 isa<VectorType>(SrcPTy)) &&
9334 // Do not allow turning this into a load of an integer, which is then
9335 // casted to a pointer, this pessimizes pointer analysis a lot.
9336 (isa<PointerType>(SrcPTy) == isa<PointerType>(LI.getType())) &&
9337 IC.getTargetData().getTypeSizeInBits(SrcPTy) ==
9338 IC.getTargetData().getTypeSizeInBits(DestPTy)) {
9340 // Okay, we are casting from one integer or pointer type to another of
9341 // the same size. Instead of casting the pointer before the load, cast
9342 // the result of the loaded value.
9343 Value *NewLoad = IC.InsertNewInstBefore(new LoadInst(CastOp,
9345 LI.isVolatile()),LI);
9346 // Now cast the result of the load.
9347 return new BitCastInst(NewLoad, LI.getType());
9354 /// isSafeToLoadUnconditionally - Return true if we know that executing a load
9355 /// from this value cannot trap. If it is not obviously safe to load from the
9356 /// specified pointer, we do a quick local scan of the basic block containing
9357 /// ScanFrom, to determine if the address is already accessed.
9358 static bool isSafeToLoadUnconditionally(Value *V, Instruction *ScanFrom) {
9359 // If it is an alloca it is always safe to load from.
9360 if (isa<AllocaInst>(V)) return true;
9362 // If it is a global variable it is mostly safe to load from.
9363 if (const GlobalValue *GV = dyn_cast<GlobalVariable>(V))
9364 // Don't try to evaluate aliases. External weak GV can be null.
9365 return !isa<GlobalAlias>(GV) && !GV->hasExternalWeakLinkage();
9367 // Otherwise, be a little bit agressive by scanning the local block where we
9368 // want to check to see if the pointer is already being loaded or stored
9369 // from/to. If so, the previous load or store would have already trapped,
9370 // so there is no harm doing an extra load (also, CSE will later eliminate
9371 // the load entirely).
9372 BasicBlock::iterator BBI = ScanFrom, E = ScanFrom->getParent()->begin();
9377 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) {
9378 if (LI->getOperand(0) == V) return true;
9379 } else if (StoreInst *SI = dyn_cast<StoreInst>(BBI))
9380 if (SI->getOperand(1) == V) return true;
9386 /// GetUnderlyingObject - Trace through a series of getelementptrs and bitcasts
9387 /// until we find the underlying object a pointer is referring to or something
9388 /// we don't understand. Note that the returned pointer may be offset from the
9389 /// input, because we ignore GEP indices.
9390 static Value *GetUnderlyingObject(Value *Ptr) {
9392 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Ptr)) {
9393 if (CE->getOpcode() == Instruction::BitCast ||
9394 CE->getOpcode() == Instruction::GetElementPtr)
9395 Ptr = CE->getOperand(0);
9398 } else if (BitCastInst *BCI = dyn_cast<BitCastInst>(Ptr)) {
9399 Ptr = BCI->getOperand(0);
9400 } else if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Ptr)) {
9401 Ptr = GEP->getOperand(0);
9408 Instruction *InstCombiner::visitLoadInst(LoadInst &LI) {
9409 Value *Op = LI.getOperand(0);
9411 // Attempt to improve the alignment.
9412 unsigned KnownAlign = GetOrEnforceKnownAlignment(Op, TD);
9413 if (KnownAlign > LI.getAlignment())
9414 LI.setAlignment(KnownAlign);
9416 // load (cast X) --> cast (load X) iff safe
9417 if (isa<CastInst>(Op))
9418 if (Instruction *Res = InstCombineLoadCast(*this, LI, TD))
9421 // None of the following transforms are legal for volatile loads.
9422 if (LI.isVolatile()) return 0;
9424 if (&LI.getParent()->front() != &LI) {
9425 BasicBlock::iterator BBI = &LI; --BBI;
9426 // If the instruction immediately before this is a store to the same
9427 // address, do a simple form of store->load forwarding.
9428 if (StoreInst *SI = dyn_cast<StoreInst>(BBI))
9429 if (SI->getOperand(1) == LI.getOperand(0))
9430 return ReplaceInstUsesWith(LI, SI->getOperand(0));
9431 if (LoadInst *LIB = dyn_cast<LoadInst>(BBI))
9432 if (LIB->getOperand(0) == LI.getOperand(0))
9433 return ReplaceInstUsesWith(LI, LIB);
9436 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(Op)) {
9437 const Value *GEPI0 = GEPI->getOperand(0);
9438 // TODO: Consider a target hook for valid address spaces for this xform.
9439 if (isa<ConstantPointerNull>(GEPI0) &&
9440 cast<PointerType>(GEPI0->getType())->getAddressSpace() == 0) {
9441 // Insert a new store to null instruction before the load to indicate
9442 // that this code is not reachable. We do this instead of inserting
9443 // an unreachable instruction directly because we cannot modify the
9445 new StoreInst(UndefValue::get(LI.getType()),
9446 Constant::getNullValue(Op->getType()), &LI);
9447 return ReplaceInstUsesWith(LI, UndefValue::get(LI.getType()));
9451 if (Constant *C = dyn_cast<Constant>(Op)) {
9452 // load null/undef -> undef
9453 // TODO: Consider a target hook for valid address spaces for this xform.
9454 if (isa<UndefValue>(C) || (C->isNullValue() &&
9455 cast<PointerType>(Op->getType())->getAddressSpace() == 0)) {
9456 // Insert a new store to null instruction before the load to indicate that
9457 // this code is not reachable. We do this instead of inserting an
9458 // unreachable instruction directly because we cannot modify the CFG.
9459 new StoreInst(UndefValue::get(LI.getType()),
9460 Constant::getNullValue(Op->getType()), &LI);
9461 return ReplaceInstUsesWith(LI, UndefValue::get(LI.getType()));
9464 // Instcombine load (constant global) into the value loaded.
9465 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(Op))
9466 if (GV->isConstant() && !GV->isDeclaration())
9467 return ReplaceInstUsesWith(LI, GV->getInitializer());
9469 // Instcombine load (constantexpr_GEP global, 0, ...) into the value loaded.
9470 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Op))
9471 if (CE->getOpcode() == Instruction::GetElementPtr) {
9472 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(CE->getOperand(0)))
9473 if (GV->isConstant() && !GV->isDeclaration())
9475 ConstantFoldLoadThroughGEPConstantExpr(GV->getInitializer(), CE))
9476 return ReplaceInstUsesWith(LI, V);
9477 if (CE->getOperand(0)->isNullValue()) {
9478 // Insert a new store to null instruction before the load to indicate
9479 // that this code is not reachable. We do this instead of inserting
9480 // an unreachable instruction directly because we cannot modify the
9482 new StoreInst(UndefValue::get(LI.getType()),
9483 Constant::getNullValue(Op->getType()), &LI);
9484 return ReplaceInstUsesWith(LI, UndefValue::get(LI.getType()));
9487 } else if (CE->isCast()) {
9488 if (Instruction *Res = InstCombineLoadCast(*this, LI, TD))
9493 // If this load comes from anywhere in a constant global, and if the global
9494 // is all undef or zero, we know what it loads.
9495 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(GetUnderlyingObject(Op))) {
9496 if (GV->isConstant() && GV->hasInitializer()) {
9497 if (GV->getInitializer()->isNullValue())
9498 return ReplaceInstUsesWith(LI, Constant::getNullValue(LI.getType()));
9499 else if (isa<UndefValue>(GV->getInitializer()))
9500 return ReplaceInstUsesWith(LI, UndefValue::get(LI.getType()));
9504 if (Op->hasOneUse()) {
9505 // Change select and PHI nodes to select values instead of addresses: this
9506 // helps alias analysis out a lot, allows many others simplifications, and
9507 // exposes redundancy in the code.
9509 // Note that we cannot do the transformation unless we know that the
9510 // introduced loads cannot trap! Something like this is valid as long as
9511 // the condition is always false: load (select bool %C, int* null, int* %G),
9512 // but it would not be valid if we transformed it to load from null
9515 if (SelectInst *SI = dyn_cast<SelectInst>(Op)) {
9516 // load (select (Cond, &V1, &V2)) --> select(Cond, load &V1, load &V2).
9517 if (isSafeToLoadUnconditionally(SI->getOperand(1), SI) &&
9518 isSafeToLoadUnconditionally(SI->getOperand(2), SI)) {
9519 Value *V1 = InsertNewInstBefore(new LoadInst(SI->getOperand(1),
9520 SI->getOperand(1)->getName()+".val"), LI);
9521 Value *V2 = InsertNewInstBefore(new LoadInst(SI->getOperand(2),
9522 SI->getOperand(2)->getName()+".val"), LI);
9523 return new SelectInst(SI->getCondition(), V1, V2);
9526 // load (select (cond, null, P)) -> load P
9527 if (Constant *C = dyn_cast<Constant>(SI->getOperand(1)))
9528 if (C->isNullValue()) {
9529 LI.setOperand(0, SI->getOperand(2));
9533 // load (select (cond, P, null)) -> load P
9534 if (Constant *C = dyn_cast<Constant>(SI->getOperand(2)))
9535 if (C->isNullValue()) {
9536 LI.setOperand(0, SI->getOperand(1));
9544 /// InstCombineStoreToCast - Fold store V, (cast P) -> store (cast V), P
9546 static Instruction *InstCombineStoreToCast(InstCombiner &IC, StoreInst &SI) {
9547 User *CI = cast<User>(SI.getOperand(1));
9548 Value *CastOp = CI->getOperand(0);
9550 const Type *DestPTy = cast<PointerType>(CI->getType())->getElementType();
9551 if (const PointerType *SrcTy = dyn_cast<PointerType>(CastOp->getType())) {
9552 const Type *SrcPTy = SrcTy->getElementType();
9554 if (DestPTy->isInteger() || isa<PointerType>(DestPTy)) {
9555 // If the source is an array, the code below will not succeed. Check to
9556 // see if a trivial 'gep P, 0, 0' will help matters. Only do this for
9558 if (const ArrayType *ASrcTy = dyn_cast<ArrayType>(SrcPTy))
9559 if (Constant *CSrc = dyn_cast<Constant>(CastOp))
9560 if (ASrcTy->getNumElements() != 0) {
9562 Idxs[0] = Idxs[1] = Constant::getNullValue(Type::Int32Ty);
9563 CastOp = ConstantExpr::getGetElementPtr(CSrc, Idxs, 2);
9564 SrcTy = cast<PointerType>(CastOp->getType());
9565 SrcPTy = SrcTy->getElementType();
9568 if ((SrcPTy->isInteger() || isa<PointerType>(SrcPTy)) &&
9569 IC.getTargetData().getTypeSizeInBits(SrcPTy) ==
9570 IC.getTargetData().getTypeSizeInBits(DestPTy)) {
9572 // Okay, we are casting from one integer or pointer type to another of
9573 // the same size. Instead of casting the pointer before
9574 // the store, cast the value to be stored.
9576 Value *SIOp0 = SI.getOperand(0);
9577 Instruction::CastOps opcode = Instruction::BitCast;
9578 const Type* CastSrcTy = SIOp0->getType();
9579 const Type* CastDstTy = SrcPTy;
9580 if (isa<PointerType>(CastDstTy)) {
9581 if (CastSrcTy->isInteger())
9582 opcode = Instruction::IntToPtr;
9583 } else if (isa<IntegerType>(CastDstTy)) {
9584 if (isa<PointerType>(SIOp0->getType()))
9585 opcode = Instruction::PtrToInt;
9587 if (Constant *C = dyn_cast<Constant>(SIOp0))
9588 NewCast = ConstantExpr::getCast(opcode, C, CastDstTy);
9590 NewCast = IC.InsertNewInstBefore(
9591 CastInst::create(opcode, SIOp0, CastDstTy, SIOp0->getName()+".c"),
9593 return new StoreInst(NewCast, CastOp);
9600 Instruction *InstCombiner::visitStoreInst(StoreInst &SI) {
9601 Value *Val = SI.getOperand(0);
9602 Value *Ptr = SI.getOperand(1);
9604 if (isa<UndefValue>(Ptr)) { // store X, undef -> noop (even if volatile)
9605 EraseInstFromFunction(SI);
9610 // If the RHS is an alloca with a single use, zapify the store, making the
9612 if (Ptr->hasOneUse()) {
9613 if (isa<AllocaInst>(Ptr)) {
9614 EraseInstFromFunction(SI);
9619 if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Ptr))
9620 if (isa<AllocaInst>(GEP->getOperand(0)) &&
9621 GEP->getOperand(0)->hasOneUse()) {
9622 EraseInstFromFunction(SI);
9628 // Attempt to improve the alignment.
9629 unsigned KnownAlign = GetOrEnforceKnownAlignment(Ptr, TD);
9630 if (KnownAlign > SI.getAlignment())
9631 SI.setAlignment(KnownAlign);
9633 // Do really simple DSE, to catch cases where there are several consequtive
9634 // stores to the same location, separated by a few arithmetic operations. This
9635 // situation often occurs with bitfield accesses.
9636 BasicBlock::iterator BBI = &SI;
9637 for (unsigned ScanInsts = 6; BBI != SI.getParent()->begin() && ScanInsts;
9641 if (StoreInst *PrevSI = dyn_cast<StoreInst>(BBI)) {
9642 // Prev store isn't volatile, and stores to the same location?
9643 if (!PrevSI->isVolatile() && PrevSI->getOperand(1) == SI.getOperand(1)) {
9646 EraseInstFromFunction(*PrevSI);
9652 // If this is a load, we have to stop. However, if the loaded value is from
9653 // the pointer we're loading and is producing the pointer we're storing,
9654 // then *this* store is dead (X = load P; store X -> P).
9655 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) {
9656 if (LI == Val && LI->getOperand(0) == Ptr && !SI.isVolatile()) {
9657 EraseInstFromFunction(SI);
9661 // Otherwise, this is a load from some other location. Stores before it
9666 // Don't skip over loads or things that can modify memory.
9667 if (BBI->mayWriteToMemory())
9672 if (SI.isVolatile()) return 0; // Don't hack volatile stores.
9674 // store X, null -> turns into 'unreachable' in SimplifyCFG
9675 if (isa<ConstantPointerNull>(Ptr)) {
9676 if (!isa<UndefValue>(Val)) {
9677 SI.setOperand(0, UndefValue::get(Val->getType()));
9678 if (Instruction *U = dyn_cast<Instruction>(Val))
9679 AddToWorkList(U); // Dropped a use.
9682 return 0; // Do not modify these!
9685 // store undef, Ptr -> noop
9686 if (isa<UndefValue>(Val)) {
9687 EraseInstFromFunction(SI);
9692 // If the pointer destination is a cast, see if we can fold the cast into the
9694 if (isa<CastInst>(Ptr))
9695 if (Instruction *Res = InstCombineStoreToCast(*this, SI))
9697 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Ptr))
9699 if (Instruction *Res = InstCombineStoreToCast(*this, SI))
9703 // If this store is the last instruction in the basic block, and if the block
9704 // ends with an unconditional branch, try to move it to the successor block.
9706 if (BranchInst *BI = dyn_cast<BranchInst>(BBI))
9707 if (BI->isUnconditional())
9708 if (SimplifyStoreAtEndOfBlock(SI))
9709 return 0; // xform done!
9714 /// SimplifyStoreAtEndOfBlock - Turn things like:
9715 /// if () { *P = v1; } else { *P = v2 }
9716 /// into a phi node with a store in the successor.
9718 /// Simplify things like:
9719 /// *P = v1; if () { *P = v2; }
9720 /// into a phi node with a store in the successor.
9722 bool InstCombiner::SimplifyStoreAtEndOfBlock(StoreInst &SI) {
9723 BasicBlock *StoreBB = SI.getParent();
9725 // Check to see if the successor block has exactly two incoming edges. If
9726 // so, see if the other predecessor contains a store to the same location.
9727 // if so, insert a PHI node (if needed) and move the stores down.
9728 BasicBlock *DestBB = StoreBB->getTerminator()->getSuccessor(0);
9730 // Determine whether Dest has exactly two predecessors and, if so, compute
9731 // the other predecessor.
9732 pred_iterator PI = pred_begin(DestBB);
9733 BasicBlock *OtherBB = 0;
9737 if (PI == pred_end(DestBB))
9740 if (*PI != StoreBB) {
9745 if (++PI != pred_end(DestBB))
9749 // Verify that the other block ends in a branch and is not otherwise empty.
9750 BasicBlock::iterator BBI = OtherBB->getTerminator();
9751 BranchInst *OtherBr = dyn_cast<BranchInst>(BBI);
9752 if (!OtherBr || BBI == OtherBB->begin())
9755 // If the other block ends in an unconditional branch, check for the 'if then
9756 // else' case. there is an instruction before the branch.
9757 StoreInst *OtherStore = 0;
9758 if (OtherBr->isUnconditional()) {
9759 // If this isn't a store, or isn't a store to the same location, bail out.
9761 OtherStore = dyn_cast<StoreInst>(BBI);
9762 if (!OtherStore || OtherStore->getOperand(1) != SI.getOperand(1))
9765 // Otherwise, the other block ended with a conditional branch. If one of the
9766 // destinations is StoreBB, then we have the if/then case.
9767 if (OtherBr->getSuccessor(0) != StoreBB &&
9768 OtherBr->getSuccessor(1) != StoreBB)
9771 // Okay, we know that OtherBr now goes to Dest and StoreBB, so this is an
9772 // if/then triangle. See if there is a store to the same ptr as SI that
9773 // lives in OtherBB.
9775 // Check to see if we find the matching store.
9776 if ((OtherStore = dyn_cast<StoreInst>(BBI))) {
9777 if (OtherStore->getOperand(1) != SI.getOperand(1))
9781 // If we find something that may be using the stored value, or if we run
9782 // out of instructions, we can't do the xform.
9783 if (isa<LoadInst>(BBI) || BBI->mayWriteToMemory() ||
9784 BBI == OtherBB->begin())
9788 // In order to eliminate the store in OtherBr, we have to
9789 // make sure nothing reads the stored value in StoreBB.
9790 for (BasicBlock::iterator I = StoreBB->begin(); &*I != &SI; ++I) {
9791 // FIXME: This should really be AA driven.
9792 if (isa<LoadInst>(I) || I->mayWriteToMemory())
9797 // Insert a PHI node now if we need it.
9798 Value *MergedVal = OtherStore->getOperand(0);
9799 if (MergedVal != SI.getOperand(0)) {
9800 PHINode *PN = new PHINode(MergedVal->getType(), "storemerge");
9801 PN->reserveOperandSpace(2);
9802 PN->addIncoming(SI.getOperand(0), SI.getParent());
9803 PN->addIncoming(OtherStore->getOperand(0), OtherBB);
9804 MergedVal = InsertNewInstBefore(PN, DestBB->front());
9807 // Advance to a place where it is safe to insert the new store and
9809 BBI = DestBB->begin();
9810 while (isa<PHINode>(BBI)) ++BBI;
9811 InsertNewInstBefore(new StoreInst(MergedVal, SI.getOperand(1),
9812 OtherStore->isVolatile()), *BBI);
9814 // Nuke the old stores.
9815 EraseInstFromFunction(SI);
9816 EraseInstFromFunction(*OtherStore);
9822 Instruction *InstCombiner::visitBranchInst(BranchInst &BI) {
9823 // Change br (not X), label True, label False to: br X, label False, True
9825 BasicBlock *TrueDest;
9826 BasicBlock *FalseDest;
9827 if (match(&BI, m_Br(m_Not(m_Value(X)), TrueDest, FalseDest)) &&
9828 !isa<Constant>(X)) {
9829 // Swap Destinations and condition...
9831 BI.setSuccessor(0, FalseDest);
9832 BI.setSuccessor(1, TrueDest);
9836 // Cannonicalize fcmp_one -> fcmp_oeq
9837 FCmpInst::Predicate FPred; Value *Y;
9838 if (match(&BI, m_Br(m_FCmp(FPred, m_Value(X), m_Value(Y)),
9839 TrueDest, FalseDest)))
9840 if ((FPred == FCmpInst::FCMP_ONE || FPred == FCmpInst::FCMP_OLE ||
9841 FPred == FCmpInst::FCMP_OGE) && BI.getCondition()->hasOneUse()) {
9842 FCmpInst *I = cast<FCmpInst>(BI.getCondition());
9843 FCmpInst::Predicate NewPred = FCmpInst::getInversePredicate(FPred);
9844 Instruction *NewSCC = new FCmpInst(NewPred, X, Y, "", I);
9845 NewSCC->takeName(I);
9846 // Swap Destinations and condition...
9847 BI.setCondition(NewSCC);
9848 BI.setSuccessor(0, FalseDest);
9849 BI.setSuccessor(1, TrueDest);
9850 RemoveFromWorkList(I);
9851 I->eraseFromParent();
9852 AddToWorkList(NewSCC);
9856 // Cannonicalize icmp_ne -> icmp_eq
9857 ICmpInst::Predicate IPred;
9858 if (match(&BI, m_Br(m_ICmp(IPred, m_Value(X), m_Value(Y)),
9859 TrueDest, FalseDest)))
9860 if ((IPred == ICmpInst::ICMP_NE || IPred == ICmpInst::ICMP_ULE ||
9861 IPred == ICmpInst::ICMP_SLE || IPred == ICmpInst::ICMP_UGE ||
9862 IPred == ICmpInst::ICMP_SGE) && BI.getCondition()->hasOneUse()) {
9863 ICmpInst *I = cast<ICmpInst>(BI.getCondition());
9864 ICmpInst::Predicate NewPred = ICmpInst::getInversePredicate(IPred);
9865 Instruction *NewSCC = new ICmpInst(NewPred, X, Y, "", I);
9866 NewSCC->takeName(I);
9867 // Swap Destinations and condition...
9868 BI.setCondition(NewSCC);
9869 BI.setSuccessor(0, FalseDest);
9870 BI.setSuccessor(1, TrueDest);
9871 RemoveFromWorkList(I);
9872 I->eraseFromParent();;
9873 AddToWorkList(NewSCC);
9880 Instruction *InstCombiner::visitSwitchInst(SwitchInst &SI) {
9881 Value *Cond = SI.getCondition();
9882 if (Instruction *I = dyn_cast<Instruction>(Cond)) {
9883 if (I->getOpcode() == Instruction::Add)
9884 if (ConstantInt *AddRHS = dyn_cast<ConstantInt>(I->getOperand(1))) {
9885 // change 'switch (X+4) case 1:' into 'switch (X) case -3'
9886 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2)
9887 SI.setOperand(i,ConstantExpr::getSub(cast<Constant>(SI.getOperand(i)),
9889 SI.setOperand(0, I->getOperand(0));
9897 /// CheapToScalarize - Return true if the value is cheaper to scalarize than it
9898 /// is to leave as a vector operation.
9899 static bool CheapToScalarize(Value *V, bool isConstant) {
9900 if (isa<ConstantAggregateZero>(V))
9902 if (ConstantVector *C = dyn_cast<ConstantVector>(V)) {
9903 if (isConstant) return true;
9904 // If all elts are the same, we can extract.
9905 Constant *Op0 = C->getOperand(0);
9906 for (unsigned i = 1; i < C->getNumOperands(); ++i)
9907 if (C->getOperand(i) != Op0)
9911 Instruction *I = dyn_cast<Instruction>(V);
9912 if (!I) return false;
9914 // Insert element gets simplified to the inserted element or is deleted if
9915 // this is constant idx extract element and its a constant idx insertelt.
9916 if (I->getOpcode() == Instruction::InsertElement && isConstant &&
9917 isa<ConstantInt>(I->getOperand(2)))
9919 if (I->getOpcode() == Instruction::Load && I->hasOneUse())
9921 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(I))
9922 if (BO->hasOneUse() &&
9923 (CheapToScalarize(BO->getOperand(0), isConstant) ||
9924 CheapToScalarize(BO->getOperand(1), isConstant)))
9926 if (CmpInst *CI = dyn_cast<CmpInst>(I))
9927 if (CI->hasOneUse() &&
9928 (CheapToScalarize(CI->getOperand(0), isConstant) ||
9929 CheapToScalarize(CI->getOperand(1), isConstant)))
9935 /// Read and decode a shufflevector mask.
9937 /// It turns undef elements into values that are larger than the number of
9938 /// elements in the input.
9939 static std::vector<unsigned> getShuffleMask(const ShuffleVectorInst *SVI) {
9940 unsigned NElts = SVI->getType()->getNumElements();
9941 if (isa<ConstantAggregateZero>(SVI->getOperand(2)))
9942 return std::vector<unsigned>(NElts, 0);
9943 if (isa<UndefValue>(SVI->getOperand(2)))
9944 return std::vector<unsigned>(NElts, 2*NElts);
9946 std::vector<unsigned> Result;
9947 const ConstantVector *CP = cast<ConstantVector>(SVI->getOperand(2));
9948 for (unsigned i = 0, e = CP->getNumOperands(); i != e; ++i)
9949 if (isa<UndefValue>(CP->getOperand(i)))
9950 Result.push_back(NElts*2); // undef -> 8
9952 Result.push_back(cast<ConstantInt>(CP->getOperand(i))->getZExtValue());
9956 /// FindScalarElement - Given a vector and an element number, see if the scalar
9957 /// value is already around as a register, for example if it were inserted then
9958 /// extracted from the vector.
9959 static Value *FindScalarElement(Value *V, unsigned EltNo) {
9960 assert(isa<VectorType>(V->getType()) && "Not looking at a vector?");
9961 const VectorType *PTy = cast<VectorType>(V->getType());
9962 unsigned Width = PTy->getNumElements();
9963 if (EltNo >= Width) // Out of range access.
9964 return UndefValue::get(PTy->getElementType());
9966 if (isa<UndefValue>(V))
9967 return UndefValue::get(PTy->getElementType());
9968 else if (isa<ConstantAggregateZero>(V))
9969 return Constant::getNullValue(PTy->getElementType());
9970 else if (ConstantVector *CP = dyn_cast<ConstantVector>(V))
9971 return CP->getOperand(EltNo);
9972 else if (InsertElementInst *III = dyn_cast<InsertElementInst>(V)) {
9973 // If this is an insert to a variable element, we don't know what it is.
9974 if (!isa<ConstantInt>(III->getOperand(2)))
9976 unsigned IIElt = cast<ConstantInt>(III->getOperand(2))->getZExtValue();
9978 // If this is an insert to the element we are looking for, return the
9981 return III->getOperand(1);
9983 // Otherwise, the insertelement doesn't modify the value, recurse on its
9985 return FindScalarElement(III->getOperand(0), EltNo);
9986 } else if (ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(V)) {
9987 unsigned InEl = getShuffleMask(SVI)[EltNo];
9989 return FindScalarElement(SVI->getOperand(0), InEl);
9990 else if (InEl < Width*2)
9991 return FindScalarElement(SVI->getOperand(1), InEl - Width);
9993 return UndefValue::get(PTy->getElementType());
9996 // Otherwise, we don't know.
10000 Instruction *InstCombiner::visitExtractElementInst(ExtractElementInst &EI) {
10002 // If vector val is undef, replace extract with scalar undef.
10003 if (isa<UndefValue>(EI.getOperand(0)))
10004 return ReplaceInstUsesWith(EI, UndefValue::get(EI.getType()));
10006 // If vector val is constant 0, replace extract with scalar 0.
10007 if (isa<ConstantAggregateZero>(EI.getOperand(0)))
10008 return ReplaceInstUsesWith(EI, Constant::getNullValue(EI.getType()));
10010 if (ConstantVector *C = dyn_cast<ConstantVector>(EI.getOperand(0))) {
10011 // If vector val is constant with uniform operands, replace EI
10012 // with that operand
10013 Constant *op0 = C->getOperand(0);
10014 for (unsigned i = 1; i < C->getNumOperands(); ++i)
10015 if (C->getOperand(i) != op0) {
10020 return ReplaceInstUsesWith(EI, op0);
10023 // If extracting a specified index from the vector, see if we can recursively
10024 // find a previously computed scalar that was inserted into the vector.
10025 if (ConstantInt *IdxC = dyn_cast<ConstantInt>(EI.getOperand(1))) {
10026 unsigned IndexVal = IdxC->getZExtValue();
10027 unsigned VectorWidth =
10028 cast<VectorType>(EI.getOperand(0)->getType())->getNumElements();
10030 // If this is extracting an invalid index, turn this into undef, to avoid
10031 // crashing the code below.
10032 if (IndexVal >= VectorWidth)
10033 return ReplaceInstUsesWith(EI, UndefValue::get(EI.getType()));
10035 // This instruction only demands the single element from the input vector.
10036 // If the input vector has a single use, simplify it based on this use
10038 if (EI.getOperand(0)->hasOneUse() && VectorWidth != 1) {
10039 uint64_t UndefElts;
10040 if (Value *V = SimplifyDemandedVectorElts(EI.getOperand(0),
10043 EI.setOperand(0, V);
10048 if (Value *Elt = FindScalarElement(EI.getOperand(0), IndexVal))
10049 return ReplaceInstUsesWith(EI, Elt);
10051 // If the this extractelement is directly using a bitcast from a vector of
10052 // the same number of elements, see if we can find the source element from
10053 // it. In this case, we will end up needing to bitcast the scalars.
10054 if (BitCastInst *BCI = dyn_cast<BitCastInst>(EI.getOperand(0))) {
10055 if (const VectorType *VT =
10056 dyn_cast<VectorType>(BCI->getOperand(0)->getType()))
10057 if (VT->getNumElements() == VectorWidth)
10058 if (Value *Elt = FindScalarElement(BCI->getOperand(0), IndexVal))
10059 return new BitCastInst(Elt, EI.getType());
10063 if (Instruction *I = dyn_cast<Instruction>(EI.getOperand(0))) {
10064 if (I->hasOneUse()) {
10065 // Push extractelement into predecessor operation if legal and
10066 // profitable to do so
10067 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(I)) {
10068 bool isConstantElt = isa<ConstantInt>(EI.getOperand(1));
10069 if (CheapToScalarize(BO, isConstantElt)) {
10070 ExtractElementInst *newEI0 =
10071 new ExtractElementInst(BO->getOperand(0), EI.getOperand(1),
10072 EI.getName()+".lhs");
10073 ExtractElementInst *newEI1 =
10074 new ExtractElementInst(BO->getOperand(1), EI.getOperand(1),
10075 EI.getName()+".rhs");
10076 InsertNewInstBefore(newEI0, EI);
10077 InsertNewInstBefore(newEI1, EI);
10078 return BinaryOperator::create(BO->getOpcode(), newEI0, newEI1);
10080 } else if (isa<LoadInst>(I)) {
10082 cast<PointerType>(I->getOperand(0)->getType())->getAddressSpace();
10083 Value *Ptr = InsertBitCastBefore(I->getOperand(0),
10084 PointerType::get(EI.getType(), AS),EI);
10085 GetElementPtrInst *GEP =
10086 new GetElementPtrInst(Ptr, EI.getOperand(1), I->getName() + ".gep");
10087 InsertNewInstBefore(GEP, EI);
10088 return new LoadInst(GEP);
10091 if (InsertElementInst *IE = dyn_cast<InsertElementInst>(I)) {
10092 // Extracting the inserted element?
10093 if (IE->getOperand(2) == EI.getOperand(1))
10094 return ReplaceInstUsesWith(EI, IE->getOperand(1));
10095 // If the inserted and extracted elements are constants, they must not
10096 // be the same value, extract from the pre-inserted value instead.
10097 if (isa<Constant>(IE->getOperand(2)) &&
10098 isa<Constant>(EI.getOperand(1))) {
10099 AddUsesToWorkList(EI);
10100 EI.setOperand(0, IE->getOperand(0));
10103 } else if (ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(I)) {
10104 // If this is extracting an element from a shufflevector, figure out where
10105 // it came from and extract from the appropriate input element instead.
10106 if (ConstantInt *Elt = dyn_cast<ConstantInt>(EI.getOperand(1))) {
10107 unsigned SrcIdx = getShuffleMask(SVI)[Elt->getZExtValue()];
10109 if (SrcIdx < SVI->getType()->getNumElements())
10110 Src = SVI->getOperand(0);
10111 else if (SrcIdx < SVI->getType()->getNumElements()*2) {
10112 SrcIdx -= SVI->getType()->getNumElements();
10113 Src = SVI->getOperand(1);
10115 return ReplaceInstUsesWith(EI, UndefValue::get(EI.getType()));
10117 return new ExtractElementInst(Src, SrcIdx);
10124 /// CollectSingleShuffleElements - If V is a shuffle of values that ONLY returns
10125 /// elements from either LHS or RHS, return the shuffle mask and true.
10126 /// Otherwise, return false.
10127 static bool CollectSingleShuffleElements(Value *V, Value *LHS, Value *RHS,
10128 std::vector<Constant*> &Mask) {
10129 assert(V->getType() == LHS->getType() && V->getType() == RHS->getType() &&
10130 "Invalid CollectSingleShuffleElements");
10131 unsigned NumElts = cast<VectorType>(V->getType())->getNumElements();
10133 if (isa<UndefValue>(V)) {
10134 Mask.assign(NumElts, UndefValue::get(Type::Int32Ty));
10136 } else if (V == LHS) {
10137 for (unsigned i = 0; i != NumElts; ++i)
10138 Mask.push_back(ConstantInt::get(Type::Int32Ty, i));
10140 } else if (V == RHS) {
10141 for (unsigned i = 0; i != NumElts; ++i)
10142 Mask.push_back(ConstantInt::get(Type::Int32Ty, i+NumElts));
10144 } else if (InsertElementInst *IEI = dyn_cast<InsertElementInst>(V)) {
10145 // If this is an insert of an extract from some other vector, include it.
10146 Value *VecOp = IEI->getOperand(0);
10147 Value *ScalarOp = IEI->getOperand(1);
10148 Value *IdxOp = IEI->getOperand(2);
10150 if (!isa<ConstantInt>(IdxOp))
10152 unsigned InsertedIdx = cast<ConstantInt>(IdxOp)->getZExtValue();
10154 if (isa<UndefValue>(ScalarOp)) { // inserting undef into vector.
10155 // Okay, we can handle this if the vector we are insertinting into is
10156 // transitively ok.
10157 if (CollectSingleShuffleElements(VecOp, LHS, RHS, Mask)) {
10158 // If so, update the mask to reflect the inserted undef.
10159 Mask[InsertedIdx] = UndefValue::get(Type::Int32Ty);
10162 } else if (ExtractElementInst *EI = dyn_cast<ExtractElementInst>(ScalarOp)){
10163 if (isa<ConstantInt>(EI->getOperand(1)) &&
10164 EI->getOperand(0)->getType() == V->getType()) {
10165 unsigned ExtractedIdx =
10166 cast<ConstantInt>(EI->getOperand(1))->getZExtValue();
10168 // This must be extracting from either LHS or RHS.
10169 if (EI->getOperand(0) == LHS || EI->getOperand(0) == RHS) {
10170 // Okay, we can handle this if the vector we are insertinting into is
10171 // transitively ok.
10172 if (CollectSingleShuffleElements(VecOp, LHS, RHS, Mask)) {
10173 // If so, update the mask to reflect the inserted value.
10174 if (EI->getOperand(0) == LHS) {
10175 Mask[InsertedIdx & (NumElts-1)] =
10176 ConstantInt::get(Type::Int32Ty, ExtractedIdx);
10178 assert(EI->getOperand(0) == RHS);
10179 Mask[InsertedIdx & (NumElts-1)] =
10180 ConstantInt::get(Type::Int32Ty, ExtractedIdx+NumElts);
10189 // TODO: Handle shufflevector here!
10194 /// CollectShuffleElements - We are building a shuffle of V, using RHS as the
10195 /// RHS of the shuffle instruction, if it is not null. Return a shuffle mask
10196 /// that computes V and the LHS value of the shuffle.
10197 static Value *CollectShuffleElements(Value *V, std::vector<Constant*> &Mask,
10199 assert(isa<VectorType>(V->getType()) &&
10200 (RHS == 0 || V->getType() == RHS->getType()) &&
10201 "Invalid shuffle!");
10202 unsigned NumElts = cast<VectorType>(V->getType())->getNumElements();
10204 if (isa<UndefValue>(V)) {
10205 Mask.assign(NumElts, UndefValue::get(Type::Int32Ty));
10207 } else if (isa<ConstantAggregateZero>(V)) {
10208 Mask.assign(NumElts, ConstantInt::get(Type::Int32Ty, 0));
10210 } else if (InsertElementInst *IEI = dyn_cast<InsertElementInst>(V)) {
10211 // If this is an insert of an extract from some other vector, include it.
10212 Value *VecOp = IEI->getOperand(0);
10213 Value *ScalarOp = IEI->getOperand(1);
10214 Value *IdxOp = IEI->getOperand(2);
10216 if (ExtractElementInst *EI = dyn_cast<ExtractElementInst>(ScalarOp)) {
10217 if (isa<ConstantInt>(EI->getOperand(1)) && isa<ConstantInt>(IdxOp) &&
10218 EI->getOperand(0)->getType() == V->getType()) {
10219 unsigned ExtractedIdx =
10220 cast<ConstantInt>(EI->getOperand(1))->getZExtValue();
10221 unsigned InsertedIdx = cast<ConstantInt>(IdxOp)->getZExtValue();
10223 // Either the extracted from or inserted into vector must be RHSVec,
10224 // otherwise we'd end up with a shuffle of three inputs.
10225 if (EI->getOperand(0) == RHS || RHS == 0) {
10226 RHS = EI->getOperand(0);
10227 Value *V = CollectShuffleElements(VecOp, Mask, RHS);
10228 Mask[InsertedIdx & (NumElts-1)] =
10229 ConstantInt::get(Type::Int32Ty, NumElts+ExtractedIdx);
10233 if (VecOp == RHS) {
10234 Value *V = CollectShuffleElements(EI->getOperand(0), Mask, RHS);
10235 // Everything but the extracted element is replaced with the RHS.
10236 for (unsigned i = 0; i != NumElts; ++i) {
10237 if (i != InsertedIdx)
10238 Mask[i] = ConstantInt::get(Type::Int32Ty, NumElts+i);
10243 // If this insertelement is a chain that comes from exactly these two
10244 // vectors, return the vector and the effective shuffle.
10245 if (CollectSingleShuffleElements(IEI, EI->getOperand(0), RHS, Mask))
10246 return EI->getOperand(0);
10251 // TODO: Handle shufflevector here!
10253 // Otherwise, can't do anything fancy. Return an identity vector.
10254 for (unsigned i = 0; i != NumElts; ++i)
10255 Mask.push_back(ConstantInt::get(Type::Int32Ty, i));
10259 Instruction *InstCombiner::visitInsertElementInst(InsertElementInst &IE) {
10260 Value *VecOp = IE.getOperand(0);
10261 Value *ScalarOp = IE.getOperand(1);
10262 Value *IdxOp = IE.getOperand(2);
10264 // Inserting an undef or into an undefined place, remove this.
10265 if (isa<UndefValue>(ScalarOp) || isa<UndefValue>(IdxOp))
10266 ReplaceInstUsesWith(IE, VecOp);
10268 // If the inserted element was extracted from some other vector, and if the
10269 // indexes are constant, try to turn this into a shufflevector operation.
10270 if (ExtractElementInst *EI = dyn_cast<ExtractElementInst>(ScalarOp)) {
10271 if (isa<ConstantInt>(EI->getOperand(1)) && isa<ConstantInt>(IdxOp) &&
10272 EI->getOperand(0)->getType() == IE.getType()) {
10273 unsigned NumVectorElts = IE.getType()->getNumElements();
10274 unsigned ExtractedIdx =
10275 cast<ConstantInt>(EI->getOperand(1))->getZExtValue();
10276 unsigned InsertedIdx = cast<ConstantInt>(IdxOp)->getZExtValue();
10278 if (ExtractedIdx >= NumVectorElts) // Out of range extract.
10279 return ReplaceInstUsesWith(IE, VecOp);
10281 if (InsertedIdx >= NumVectorElts) // Out of range insert.
10282 return ReplaceInstUsesWith(IE, UndefValue::get(IE.getType()));
10284 // If we are extracting a value from a vector, then inserting it right
10285 // back into the same place, just use the input vector.
10286 if (EI->getOperand(0) == VecOp && ExtractedIdx == InsertedIdx)
10287 return ReplaceInstUsesWith(IE, VecOp);
10289 // We could theoretically do this for ANY input. However, doing so could
10290 // turn chains of insertelement instructions into a chain of shufflevector
10291 // instructions, and right now we do not merge shufflevectors. As such,
10292 // only do this in a situation where it is clear that there is benefit.
10293 if (isa<UndefValue>(VecOp) || isa<ConstantAggregateZero>(VecOp)) {
10294 // Turn this into shuffle(EIOp0, VecOp, Mask). The result has all of
10295 // the values of VecOp, except then one read from EIOp0.
10296 // Build a new shuffle mask.
10297 std::vector<Constant*> Mask;
10298 if (isa<UndefValue>(VecOp))
10299 Mask.assign(NumVectorElts, UndefValue::get(Type::Int32Ty));
10301 assert(isa<ConstantAggregateZero>(VecOp) && "Unknown thing");
10302 Mask.assign(NumVectorElts, ConstantInt::get(Type::Int32Ty,
10305 Mask[InsertedIdx] = ConstantInt::get(Type::Int32Ty, ExtractedIdx);
10306 return new ShuffleVectorInst(EI->getOperand(0), VecOp,
10307 ConstantVector::get(Mask));
10310 // If this insertelement isn't used by some other insertelement, turn it
10311 // (and any insertelements it points to), into one big shuffle.
10312 if (!IE.hasOneUse() || !isa<InsertElementInst>(IE.use_back())) {
10313 std::vector<Constant*> Mask;
10315 Value *LHS = CollectShuffleElements(&IE, Mask, RHS);
10316 if (RHS == 0) RHS = UndefValue::get(LHS->getType());
10317 // We now have a shuffle of LHS, RHS, Mask.
10318 return new ShuffleVectorInst(LHS, RHS, ConstantVector::get(Mask));
10327 Instruction *InstCombiner::visitShuffleVectorInst(ShuffleVectorInst &SVI) {
10328 Value *LHS = SVI.getOperand(0);
10329 Value *RHS = SVI.getOperand(1);
10330 std::vector<unsigned> Mask = getShuffleMask(&SVI);
10332 bool MadeChange = false;
10334 // Undefined shuffle mask -> undefined value.
10335 if (isa<UndefValue>(SVI.getOperand(2)))
10336 return ReplaceInstUsesWith(SVI, UndefValue::get(SVI.getType()));
10338 // If we have shuffle(x, undef, mask) and any elements of mask refer to
10339 // the undef, change them to undefs.
10340 if (isa<UndefValue>(SVI.getOperand(1))) {
10341 // Scan to see if there are any references to the RHS. If so, replace them
10342 // with undef element refs and set MadeChange to true.
10343 for (unsigned i = 0, e = Mask.size(); i != e; ++i) {
10344 if (Mask[i] >= e && Mask[i] != 2*e) {
10351 // Remap any references to RHS to use LHS.
10352 std::vector<Constant*> Elts;
10353 for (unsigned i = 0, e = Mask.size(); i != e; ++i) {
10354 if (Mask[i] == 2*e)
10355 Elts.push_back(UndefValue::get(Type::Int32Ty));
10357 Elts.push_back(ConstantInt::get(Type::Int32Ty, Mask[i]));
10359 SVI.setOperand(2, ConstantVector::get(Elts));
10363 // Canonicalize shuffle(x ,x,mask) -> shuffle(x, undef,mask')
10364 // Canonicalize shuffle(undef,x,mask) -> shuffle(x, undef,mask').
10365 if (LHS == RHS || isa<UndefValue>(LHS)) {
10366 if (isa<UndefValue>(LHS) && LHS == RHS) {
10367 // shuffle(undef,undef,mask) -> undef.
10368 return ReplaceInstUsesWith(SVI, LHS);
10371 // Remap any references to RHS to use LHS.
10372 std::vector<Constant*> Elts;
10373 for (unsigned i = 0, e = Mask.size(); i != e; ++i) {
10374 if (Mask[i] >= 2*e)
10375 Elts.push_back(UndefValue::get(Type::Int32Ty));
10377 if ((Mask[i] >= e && isa<UndefValue>(RHS)) ||
10378 (Mask[i] < e && isa<UndefValue>(LHS)))
10379 Mask[i] = 2*e; // Turn into undef.
10381 Mask[i] &= (e-1); // Force to LHS.
10382 Elts.push_back(ConstantInt::get(Type::Int32Ty, Mask[i]));
10385 SVI.setOperand(0, SVI.getOperand(1));
10386 SVI.setOperand(1, UndefValue::get(RHS->getType()));
10387 SVI.setOperand(2, ConstantVector::get(Elts));
10388 LHS = SVI.getOperand(0);
10389 RHS = SVI.getOperand(1);
10393 // Analyze the shuffle, are the LHS or RHS and identity shuffles?
10394 bool isLHSID = true, isRHSID = true;
10396 for (unsigned i = 0, e = Mask.size(); i != e; ++i) {
10397 if (Mask[i] >= e*2) continue; // Ignore undef values.
10398 // Is this an identity shuffle of the LHS value?
10399 isLHSID &= (Mask[i] == i);
10401 // Is this an identity shuffle of the RHS value?
10402 isRHSID &= (Mask[i]-e == i);
10405 // Eliminate identity shuffles.
10406 if (isLHSID) return ReplaceInstUsesWith(SVI, LHS);
10407 if (isRHSID) return ReplaceInstUsesWith(SVI, RHS);
10409 // If the LHS is a shufflevector itself, see if we can combine it with this
10410 // one without producing an unusual shuffle. Here we are really conservative:
10411 // we are absolutely afraid of producing a shuffle mask not in the input
10412 // program, because the code gen may not be smart enough to turn a merged
10413 // shuffle into two specific shuffles: it may produce worse code. As such,
10414 // we only merge two shuffles if the result is one of the two input shuffle
10415 // masks. In this case, merging the shuffles just removes one instruction,
10416 // which we know is safe. This is good for things like turning:
10417 // (splat(splat)) -> splat.
10418 if (ShuffleVectorInst *LHSSVI = dyn_cast<ShuffleVectorInst>(LHS)) {
10419 if (isa<UndefValue>(RHS)) {
10420 std::vector<unsigned> LHSMask = getShuffleMask(LHSSVI);
10422 std::vector<unsigned> NewMask;
10423 for (unsigned i = 0, e = Mask.size(); i != e; ++i)
10424 if (Mask[i] >= 2*e)
10425 NewMask.push_back(2*e);
10427 NewMask.push_back(LHSMask[Mask[i]]);
10429 // If the result mask is equal to the src shuffle or this shuffle mask, do
10430 // the replacement.
10431 if (NewMask == LHSMask || NewMask == Mask) {
10432 std::vector<Constant*> Elts;
10433 for (unsigned i = 0, e = NewMask.size(); i != e; ++i) {
10434 if (NewMask[i] >= e*2) {
10435 Elts.push_back(UndefValue::get(Type::Int32Ty));
10437 Elts.push_back(ConstantInt::get(Type::Int32Ty, NewMask[i]));
10440 return new ShuffleVectorInst(LHSSVI->getOperand(0),
10441 LHSSVI->getOperand(1),
10442 ConstantVector::get(Elts));
10447 return MadeChange ? &SVI : 0;
10453 /// TryToSinkInstruction - Try to move the specified instruction from its
10454 /// current block into the beginning of DestBlock, which can only happen if it's
10455 /// safe to move the instruction past all of the instructions between it and the
10456 /// end of its block.
10457 static bool TryToSinkInstruction(Instruction *I, BasicBlock *DestBlock) {
10458 assert(I->hasOneUse() && "Invariants didn't hold!");
10460 // Cannot move control-flow-involving, volatile loads, vaarg, etc.
10461 if (isa<PHINode>(I) || I->mayWriteToMemory()) return false;
10463 // Do not sink alloca instructions out of the entry block.
10464 if (isa<AllocaInst>(I) && I->getParent() ==
10465 &DestBlock->getParent()->getEntryBlock())
10468 // We can only sink load instructions if there is nothing between the load and
10469 // the end of block that could change the value.
10470 if (LoadInst *LI = dyn_cast<LoadInst>(I)) {
10471 for (BasicBlock::iterator Scan = LI, E = LI->getParent()->end();
10473 if (Scan->mayWriteToMemory())
10477 BasicBlock::iterator InsertPos = DestBlock->begin();
10478 while (isa<PHINode>(InsertPos)) ++InsertPos;
10480 I->moveBefore(InsertPos);
10486 /// AddReachableCodeToWorklist - Walk the function in depth-first order, adding
10487 /// all reachable code to the worklist.
10489 /// This has a couple of tricks to make the code faster and more powerful. In
10490 /// particular, we constant fold and DCE instructions as we go, to avoid adding
10491 /// them to the worklist (this significantly speeds up instcombine on code where
10492 /// many instructions are dead or constant). Additionally, if we find a branch
10493 /// whose condition is a known constant, we only visit the reachable successors.
10495 static void AddReachableCodeToWorklist(BasicBlock *BB,
10496 SmallPtrSet<BasicBlock*, 64> &Visited,
10498 const TargetData *TD) {
10499 std::vector<BasicBlock*> Worklist;
10500 Worklist.push_back(BB);
10502 while (!Worklist.empty()) {
10503 BB = Worklist.back();
10504 Worklist.pop_back();
10506 // We have now visited this block! If we've already been here, ignore it.
10507 if (!Visited.insert(BB)) continue;
10509 for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E; ) {
10510 Instruction *Inst = BBI++;
10512 // DCE instruction if trivially dead.
10513 if (isInstructionTriviallyDead(Inst)) {
10515 DOUT << "IC: DCE: " << *Inst;
10516 Inst->eraseFromParent();
10520 // ConstantProp instruction if trivially constant.
10521 if (Constant *C = ConstantFoldInstruction(Inst, TD)) {
10522 DOUT << "IC: ConstFold to: " << *C << " from: " << *Inst;
10523 Inst->replaceAllUsesWith(C);
10525 Inst->eraseFromParent();
10529 IC.AddToWorkList(Inst);
10532 // Recursively visit successors. If this is a branch or switch on a
10533 // constant, only visit the reachable successor.
10534 TerminatorInst *TI = BB->getTerminator();
10535 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
10536 if (BI->isConditional() && isa<ConstantInt>(BI->getCondition())) {
10537 bool CondVal = cast<ConstantInt>(BI->getCondition())->getZExtValue();
10538 Worklist.push_back(BI->getSuccessor(!CondVal));
10541 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) {
10542 if (ConstantInt *Cond = dyn_cast<ConstantInt>(SI->getCondition())) {
10543 // See if this is an explicit destination.
10544 for (unsigned i = 1, e = SI->getNumSuccessors(); i != e; ++i)
10545 if (SI->getCaseValue(i) == Cond) {
10546 Worklist.push_back(SI->getSuccessor(i));
10550 // Otherwise it is the default destination.
10551 Worklist.push_back(SI->getSuccessor(0));
10556 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
10557 Worklist.push_back(TI->getSuccessor(i));
10561 bool InstCombiner::DoOneIteration(Function &F, unsigned Iteration) {
10562 bool Changed = false;
10563 TD = &getAnalysis<TargetData>();
10565 DEBUG(DOUT << "\n\nINSTCOMBINE ITERATION #" << Iteration << " on "
10566 << F.getNameStr() << "\n");
10569 // Do a depth-first traversal of the function, populate the worklist with
10570 // the reachable instructions. Ignore blocks that are not reachable. Keep
10571 // track of which blocks we visit.
10572 SmallPtrSet<BasicBlock*, 64> Visited;
10573 AddReachableCodeToWorklist(F.begin(), Visited, *this, TD);
10575 // Do a quick scan over the function. If we find any blocks that are
10576 // unreachable, remove any instructions inside of them. This prevents
10577 // the instcombine code from having to deal with some bad special cases.
10578 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
10579 if (!Visited.count(BB)) {
10580 Instruction *Term = BB->getTerminator();
10581 while (Term != BB->begin()) { // Remove instrs bottom-up
10582 BasicBlock::iterator I = Term; --I;
10584 DOUT << "IC: DCE: " << *I;
10587 if (!I->use_empty())
10588 I->replaceAllUsesWith(UndefValue::get(I->getType()));
10589 I->eraseFromParent();
10594 while (!Worklist.empty()) {
10595 Instruction *I = RemoveOneFromWorkList();
10596 if (I == 0) continue; // skip null values.
10598 // Check to see if we can DCE the instruction.
10599 if (isInstructionTriviallyDead(I)) {
10600 // Add operands to the worklist.
10601 if (I->getNumOperands() < 4)
10602 AddUsesToWorkList(*I);
10605 DOUT << "IC: DCE: " << *I;
10607 I->eraseFromParent();
10608 RemoveFromWorkList(I);
10612 // Instruction isn't dead, see if we can constant propagate it.
10613 if (Constant *C = ConstantFoldInstruction(I, TD)) {
10614 DOUT << "IC: ConstFold to: " << *C << " from: " << *I;
10616 // Add operands to the worklist.
10617 AddUsesToWorkList(*I);
10618 ReplaceInstUsesWith(*I, C);
10621 I->eraseFromParent();
10622 RemoveFromWorkList(I);
10626 // See if we can trivially sink this instruction to a successor basic block.
10627 if (I->hasOneUse()) {
10628 BasicBlock *BB = I->getParent();
10629 BasicBlock *UserParent = cast<Instruction>(I->use_back())->getParent();
10630 if (UserParent != BB) {
10631 bool UserIsSuccessor = false;
10632 // See if the user is one of our successors.
10633 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI)
10634 if (*SI == UserParent) {
10635 UserIsSuccessor = true;
10639 // If the user is one of our immediate successors, and if that successor
10640 // only has us as a predecessors (we'd have to split the critical edge
10641 // otherwise), we can keep going.
10642 if (UserIsSuccessor && !isa<PHINode>(I->use_back()) &&
10643 next(pred_begin(UserParent)) == pred_end(UserParent))
10644 // Okay, the CFG is simple enough, try to sink this instruction.
10645 Changed |= TryToSinkInstruction(I, UserParent);
10649 // Now that we have an instruction, try combining it to simplify it...
10653 DEBUG(std::ostringstream SS; I->print(SS); OrigI = SS.str(););
10654 if (Instruction *Result = visit(*I)) {
10656 // Should we replace the old instruction with a new one?
10658 DOUT << "IC: Old = " << *I
10659 << " New = " << *Result;
10661 // Everything uses the new instruction now.
10662 I->replaceAllUsesWith(Result);
10664 // Push the new instruction and any users onto the worklist.
10665 AddToWorkList(Result);
10666 AddUsersToWorkList(*Result);
10668 // Move the name to the new instruction first.
10669 Result->takeName(I);
10671 // Insert the new instruction into the basic block...
10672 BasicBlock *InstParent = I->getParent();
10673 BasicBlock::iterator InsertPos = I;
10675 if (!isa<PHINode>(Result)) // If combining a PHI, don't insert
10676 while (isa<PHINode>(InsertPos)) // middle of a block of PHIs.
10679 InstParent->getInstList().insert(InsertPos, Result);
10681 // Make sure that we reprocess all operands now that we reduced their
10683 AddUsesToWorkList(*I);
10685 // Instructions can end up on the worklist more than once. Make sure
10686 // we do not process an instruction that has been deleted.
10687 RemoveFromWorkList(I);
10689 // Erase the old instruction.
10690 InstParent->getInstList().erase(I);
10693 DOUT << "IC: Mod = " << OrigI
10694 << " New = " << *I;
10697 // If the instruction was modified, it's possible that it is now dead.
10698 // if so, remove it.
10699 if (isInstructionTriviallyDead(I)) {
10700 // Make sure we process all operands now that we are reducing their
10702 AddUsesToWorkList(*I);
10704 // Instructions may end up in the worklist more than once. Erase all
10705 // occurrences of this instruction.
10706 RemoveFromWorkList(I);
10707 I->eraseFromParent();
10710 AddUsersToWorkList(*I);
10717 assert(WorklistMap.empty() && "Worklist empty, but map not?");
10719 // Do an explicit clear, this shrinks the map if needed.
10720 WorklistMap.clear();
10725 bool InstCombiner::runOnFunction(Function &F) {
10726 MustPreserveLCSSA = mustPreserveAnalysisID(LCSSAID);
10728 bool EverMadeChange = false;
10730 // Iterate while there is work to do.
10731 unsigned Iteration = 0;
10732 while (DoOneIteration(F, Iteration++))
10733 EverMadeChange = true;
10734 return EverMadeChange;
10737 FunctionPass *llvm::createInstructionCombiningPass() {
10738 return new InstCombiner();