1 //===- InstructionCombining.cpp - Combine multiple instructions -----------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source 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/Analysis/ConstantFolding.h"
43 #include "llvm/Target/TargetData.h"
44 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
45 #include "llvm/Transforms/Utils/Local.h"
46 #include "llvm/Support/CallSite.h"
47 #include "llvm/Support/Debug.h"
48 #include "llvm/Support/GetElementPtrTypeIterator.h"
49 #include "llvm/Support/InstVisitor.h"
50 #include "llvm/Support/MathExtras.h"
51 #include "llvm/Support/PatternMatch.h"
52 #include "llvm/Support/Compiler.h"
53 #include "llvm/ADT/DenseMap.h"
54 #include "llvm/ADT/SmallVector.h"
55 #include "llvm/ADT/SmallPtrSet.h"
56 #include "llvm/ADT/Statistic.h"
57 #include "llvm/ADT/STLExtras.h"
61 using namespace llvm::PatternMatch;
63 STATISTIC(NumCombined , "Number of insts combined");
64 STATISTIC(NumConstProp, "Number of constant folds");
65 STATISTIC(NumDeadInst , "Number of dead inst eliminated");
66 STATISTIC(NumDeadStore, "Number of dead stores eliminated");
67 STATISTIC(NumSunkInst , "Number of instructions sunk");
70 class VISIBILITY_HIDDEN InstCombiner
71 : public FunctionPass,
72 public InstVisitor<InstCombiner, Instruction*> {
73 // Worklist of all of the instructions that need to be simplified.
74 std::vector<Instruction*> Worklist;
75 DenseMap<Instruction*, unsigned> WorklistMap;
77 bool MustPreserveLCSSA;
79 static char ID; // Pass identification, replacement for typeid
80 InstCombiner() : FunctionPass((intptr_t)&ID) {}
82 /// AddToWorkList - Add the specified instruction to the worklist if it
83 /// isn't already in it.
84 void AddToWorkList(Instruction *I) {
85 if (WorklistMap.insert(std::make_pair(I, Worklist.size())))
86 Worklist.push_back(I);
89 // RemoveFromWorkList - remove I from the worklist if it exists.
90 void RemoveFromWorkList(Instruction *I) {
91 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
92 if (It == WorklistMap.end()) return; // Not in worklist.
94 // Don't bother moving everything down, just null out the slot.
95 Worklist[It->second] = 0;
97 WorklistMap.erase(It);
100 Instruction *RemoveOneFromWorkList() {
101 Instruction *I = Worklist.back();
103 WorklistMap.erase(I);
108 /// AddUsersToWorkList - When an instruction is simplified, add all users of
109 /// the instruction to the work lists because they might get more simplified
112 void AddUsersToWorkList(Value &I) {
113 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
115 AddToWorkList(cast<Instruction>(*UI));
118 /// AddUsesToWorkList - When an instruction is simplified, add operands to
119 /// the work lists because they might get more simplified now.
121 void AddUsesToWorkList(Instruction &I) {
122 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
123 if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i)))
127 /// AddSoonDeadInstToWorklist - The specified instruction is about to become
128 /// dead. Add all of its operands to the worklist, turning them into
129 /// undef's to reduce the number of uses of those instructions.
131 /// Return the specified operand before it is turned into an undef.
133 Value *AddSoonDeadInstToWorklist(Instruction &I, unsigned op) {
134 Value *R = I.getOperand(op);
136 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
137 if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) {
139 // Set the operand to undef to drop the use.
140 I.setOperand(i, UndefValue::get(Op->getType()));
147 virtual bool runOnFunction(Function &F);
149 bool DoOneIteration(Function &F, unsigned ItNum);
151 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
152 AU.addRequired<TargetData>();
153 AU.addPreservedID(LCSSAID);
154 AU.setPreservesCFG();
157 TargetData &getTargetData() const { return *TD; }
159 // Visitation implementation - Implement instruction combining for different
160 // instruction types. The semantics are as follows:
162 // null - No change was made
163 // I - Change was made, I is still valid, I may be dead though
164 // otherwise - Change was made, replace I with returned instruction
166 Instruction *visitAdd(BinaryOperator &I);
167 Instruction *visitSub(BinaryOperator &I);
168 Instruction *visitMul(BinaryOperator &I);
169 Instruction *visitURem(BinaryOperator &I);
170 Instruction *visitSRem(BinaryOperator &I);
171 Instruction *visitFRem(BinaryOperator &I);
172 Instruction *commonRemTransforms(BinaryOperator &I);
173 Instruction *commonIRemTransforms(BinaryOperator &I);
174 Instruction *commonDivTransforms(BinaryOperator &I);
175 Instruction *commonIDivTransforms(BinaryOperator &I);
176 Instruction *visitUDiv(BinaryOperator &I);
177 Instruction *visitSDiv(BinaryOperator &I);
178 Instruction *visitFDiv(BinaryOperator &I);
179 Instruction *visitAnd(BinaryOperator &I);
180 Instruction *visitOr (BinaryOperator &I);
181 Instruction *visitXor(BinaryOperator &I);
182 Instruction *visitShl(BinaryOperator &I);
183 Instruction *visitAShr(BinaryOperator &I);
184 Instruction *visitLShr(BinaryOperator &I);
185 Instruction *commonShiftTransforms(BinaryOperator &I);
186 Instruction *visitFCmpInst(FCmpInst &I);
187 Instruction *visitICmpInst(ICmpInst &I);
188 Instruction *visitICmpInstWithCastAndCast(ICmpInst &ICI);
189 Instruction *visitICmpInstWithInstAndIntCst(ICmpInst &ICI,
192 Instruction *FoldICmpDivCst(ICmpInst &ICI, BinaryOperator *DivI,
193 ConstantInt *DivRHS);
195 Instruction *FoldGEPICmp(User *GEPLHS, Value *RHS,
196 ICmpInst::Predicate Cond, Instruction &I);
197 Instruction *FoldShiftByConstant(Value *Op0, ConstantInt *Op1,
199 Instruction *commonCastTransforms(CastInst &CI);
200 Instruction *commonIntCastTransforms(CastInst &CI);
201 Instruction *commonPointerCastTransforms(CastInst &CI);
202 Instruction *visitTrunc(TruncInst &CI);
203 Instruction *visitZExt(ZExtInst &CI);
204 Instruction *visitSExt(SExtInst &CI);
205 Instruction *visitFPTrunc(CastInst &CI);
206 Instruction *visitFPExt(CastInst &CI);
207 Instruction *visitFPToUI(CastInst &CI);
208 Instruction *visitFPToSI(CastInst &CI);
209 Instruction *visitUIToFP(CastInst &CI);
210 Instruction *visitSIToFP(CastInst &CI);
211 Instruction *visitPtrToInt(CastInst &CI);
212 Instruction *visitIntToPtr(CastInst &CI);
213 Instruction *visitBitCast(BitCastInst &CI);
214 Instruction *FoldSelectOpOp(SelectInst &SI, Instruction *TI,
216 Instruction *visitSelectInst(SelectInst &CI);
217 Instruction *visitCallInst(CallInst &CI);
218 Instruction *visitInvokeInst(InvokeInst &II);
219 Instruction *visitPHINode(PHINode &PN);
220 Instruction *visitGetElementPtrInst(GetElementPtrInst &GEP);
221 Instruction *visitAllocationInst(AllocationInst &AI);
222 Instruction *visitFreeInst(FreeInst &FI);
223 Instruction *visitLoadInst(LoadInst &LI);
224 Instruction *visitStoreInst(StoreInst &SI);
225 Instruction *visitBranchInst(BranchInst &BI);
226 Instruction *visitSwitchInst(SwitchInst &SI);
227 Instruction *visitInsertElementInst(InsertElementInst &IE);
228 Instruction *visitExtractElementInst(ExtractElementInst &EI);
229 Instruction *visitShuffleVectorInst(ShuffleVectorInst &SVI);
231 // visitInstruction - Specify what to return for unhandled instructions...
232 Instruction *visitInstruction(Instruction &I) { return 0; }
235 Instruction *visitCallSite(CallSite CS);
236 bool transformConstExprCastCall(CallSite CS);
239 // InsertNewInstBefore - insert an instruction New before instruction Old
240 // in the program. Add the new instruction to the worklist.
242 Instruction *InsertNewInstBefore(Instruction *New, Instruction &Old) {
243 assert(New && New->getParent() == 0 &&
244 "New instruction already inserted into a basic block!");
245 BasicBlock *BB = Old.getParent();
246 BB->getInstList().insert(&Old, New); // Insert inst
251 /// InsertCastBefore - Insert a cast of V to TY before the instruction POS.
252 /// This also adds the cast to the worklist. Finally, this returns the
254 Value *InsertCastBefore(Instruction::CastOps opc, Value *V, const Type *Ty,
256 if (V->getType() == Ty) return V;
258 if (Constant *CV = dyn_cast<Constant>(V))
259 return ConstantExpr::getCast(opc, CV, Ty);
261 Instruction *C = CastInst::create(opc, V, Ty, V->getName(), &Pos);
266 // ReplaceInstUsesWith - This method is to be used when an instruction is
267 // found to be dead, replacable with another preexisting expression. Here
268 // we add all uses of I to the worklist, replace all uses of I with the new
269 // value, then return I, so that the inst combiner will know that I was
272 Instruction *ReplaceInstUsesWith(Instruction &I, Value *V) {
273 AddUsersToWorkList(I); // Add all modified instrs to worklist
275 I.replaceAllUsesWith(V);
278 // If we are replacing the instruction with itself, this must be in a
279 // segment of unreachable code, so just clobber the instruction.
280 I.replaceAllUsesWith(UndefValue::get(I.getType()));
285 // UpdateValueUsesWith - This method is to be used when an value is
286 // found to be replacable with another preexisting expression or was
287 // updated. Here we add all uses of I to the worklist, replace all uses of
288 // I with the new value (unless the instruction was just updated), then
289 // return true, so that the inst combiner will know that I was modified.
291 bool UpdateValueUsesWith(Value *Old, Value *New) {
292 AddUsersToWorkList(*Old); // Add all modified instrs to worklist
294 Old->replaceAllUsesWith(New);
295 if (Instruction *I = dyn_cast<Instruction>(Old))
297 if (Instruction *I = dyn_cast<Instruction>(New))
302 // EraseInstFromFunction - When dealing with an instruction that has side
303 // effects or produces a void value, we can't rely on DCE to delete the
304 // instruction. Instead, visit methods should return the value returned by
306 Instruction *EraseInstFromFunction(Instruction &I) {
307 assert(I.use_empty() && "Cannot erase instruction that is used!");
308 AddUsesToWorkList(I);
309 RemoveFromWorkList(&I);
311 return 0; // Don't do anything with FI
315 /// InsertOperandCastBefore - This inserts a cast of V to DestTy before the
316 /// InsertBefore instruction. This is specialized a bit to avoid inserting
317 /// casts that are known to not do anything...
319 Value *InsertOperandCastBefore(Instruction::CastOps opcode,
320 Value *V, const Type *DestTy,
321 Instruction *InsertBefore);
323 /// SimplifyCommutative - This performs a few simplifications for
324 /// commutative operators.
325 bool SimplifyCommutative(BinaryOperator &I);
327 /// SimplifyCompare - This reorders the operands of a CmpInst to get them in
328 /// most-complex to least-complex order.
329 bool SimplifyCompare(CmpInst &I);
331 /// SimplifyDemandedBits - Attempts to replace V with a simpler value based
332 /// on the demanded bits.
333 bool SimplifyDemandedBits(Value *V, APInt DemandedMask,
334 APInt& KnownZero, APInt& KnownOne,
337 Value *SimplifyDemandedVectorElts(Value *V, uint64_t DemandedElts,
338 uint64_t &UndefElts, unsigned Depth = 0);
340 // FoldOpIntoPhi - Given a binary operator or cast instruction which has a
341 // PHI node as operand #0, see if we can fold the instruction into the PHI
342 // (which is only possible if all operands to the PHI are constants).
343 Instruction *FoldOpIntoPhi(Instruction &I);
345 // FoldPHIArgOpIntoPHI - If all operands to a PHI node are the same "unary"
346 // operator and they all are only used by the PHI, PHI together their
347 // inputs, and do the operation once, to the result of the PHI.
348 Instruction *FoldPHIArgOpIntoPHI(PHINode &PN);
349 Instruction *FoldPHIArgBinOpIntoPHI(PHINode &PN);
352 Instruction *OptAndOp(Instruction *Op, ConstantInt *OpRHS,
353 ConstantInt *AndRHS, BinaryOperator &TheAnd);
355 Value *FoldLogicalPlusAnd(Value *LHS, Value *RHS, ConstantInt *Mask,
356 bool isSub, Instruction &I);
357 Instruction *InsertRangeTest(Value *V, Constant *Lo, Constant *Hi,
358 bool isSigned, bool Inside, Instruction &IB);
359 Instruction *PromoteCastOfAllocation(BitCastInst &CI, AllocationInst &AI);
360 Instruction *MatchBSwap(BinaryOperator &I);
361 bool SimplifyStoreAtEndOfBlock(StoreInst &SI);
363 Value *EvaluateInDifferentType(Value *V, const Type *Ty, bool isSigned);
366 char InstCombiner::ID = 0;
367 RegisterPass<InstCombiner> X("instcombine", "Combine redundant instructions");
370 // getComplexity: Assign a complexity or rank value to LLVM Values...
371 // 0 -> undef, 1 -> Const, 2 -> Other, 3 -> Arg, 3 -> Unary, 4 -> OtherInst
372 static unsigned getComplexity(Value *V) {
373 if (isa<Instruction>(V)) {
374 if (BinaryOperator::isNeg(V) || BinaryOperator::isNot(V))
378 if (isa<Argument>(V)) return 3;
379 return isa<Constant>(V) ? (isa<UndefValue>(V) ? 0 : 1) : 2;
382 // isOnlyUse - Return true if this instruction will be deleted if we stop using
384 static bool isOnlyUse(Value *V) {
385 return V->hasOneUse() || isa<Constant>(V);
388 // getPromotedType - Return the specified type promoted as it would be to pass
389 // though a va_arg area...
390 static const Type *getPromotedType(const Type *Ty) {
391 if (const IntegerType* ITy = dyn_cast<IntegerType>(Ty)) {
392 if (ITy->getBitWidth() < 32)
393 return Type::Int32Ty;
398 /// getBitCastOperand - If the specified operand is a CastInst or a constant
399 /// expression bitcast, return the operand value, otherwise return null.
400 static Value *getBitCastOperand(Value *V) {
401 if (BitCastInst *I = dyn_cast<BitCastInst>(V))
402 return I->getOperand(0);
403 else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V))
404 if (CE->getOpcode() == Instruction::BitCast)
405 return CE->getOperand(0);
409 /// This function is a wrapper around CastInst::isEliminableCastPair. It
410 /// simply extracts arguments and returns what that function returns.
411 static Instruction::CastOps
412 isEliminableCastPair(
413 const CastInst *CI, ///< The first cast instruction
414 unsigned opcode, ///< The opcode of the second cast instruction
415 const Type *DstTy, ///< The target type for the second cast instruction
416 TargetData *TD ///< The target data for pointer size
419 const Type *SrcTy = CI->getOperand(0)->getType(); // A from above
420 const Type *MidTy = CI->getType(); // B from above
422 // Get the opcodes of the two Cast instructions
423 Instruction::CastOps firstOp = Instruction::CastOps(CI->getOpcode());
424 Instruction::CastOps secondOp = Instruction::CastOps(opcode);
426 return Instruction::CastOps(
427 CastInst::isEliminableCastPair(firstOp, secondOp, SrcTy, MidTy,
428 DstTy, TD->getIntPtrType()));
431 /// ValueRequiresCast - Return true if the cast from "V to Ty" actually results
432 /// in any code being generated. It does not require codegen if V is simple
433 /// enough or if the cast can be folded into other casts.
434 static bool ValueRequiresCast(Instruction::CastOps opcode, const Value *V,
435 const Type *Ty, TargetData *TD) {
436 if (V->getType() == Ty || isa<Constant>(V)) return false;
438 // If this is another cast that can be eliminated, it isn't codegen either.
439 if (const CastInst *CI = dyn_cast<CastInst>(V))
440 if (isEliminableCastPair(CI, opcode, Ty, TD))
445 /// InsertOperandCastBefore - This inserts a cast of V to DestTy before the
446 /// InsertBefore instruction. This is specialized a bit to avoid inserting
447 /// casts that are known to not do anything...
449 Value *InstCombiner::InsertOperandCastBefore(Instruction::CastOps opcode,
450 Value *V, const Type *DestTy,
451 Instruction *InsertBefore) {
452 if (V->getType() == DestTy) return V;
453 if (Constant *C = dyn_cast<Constant>(V))
454 return ConstantExpr::getCast(opcode, C, DestTy);
456 return InsertCastBefore(opcode, V, DestTy, *InsertBefore);
459 // SimplifyCommutative - This performs a few simplifications for commutative
462 // 1. Order operands such that they are listed from right (least complex) to
463 // left (most complex). This puts constants before unary operators before
466 // 2. Transform: (op (op V, C1), C2) ==> (op V, (op C1, C2))
467 // 3. Transform: (op (op V1, C1), (op V2, C2)) ==> (op (op V1, V2), (op C1,C2))
469 bool InstCombiner::SimplifyCommutative(BinaryOperator &I) {
470 bool Changed = false;
471 if (getComplexity(I.getOperand(0)) < getComplexity(I.getOperand(1)))
472 Changed = !I.swapOperands();
474 if (!I.isAssociative()) return Changed;
475 Instruction::BinaryOps Opcode = I.getOpcode();
476 if (BinaryOperator *Op = dyn_cast<BinaryOperator>(I.getOperand(0)))
477 if (Op->getOpcode() == Opcode && isa<Constant>(Op->getOperand(1))) {
478 if (isa<Constant>(I.getOperand(1))) {
479 Constant *Folded = ConstantExpr::get(I.getOpcode(),
480 cast<Constant>(I.getOperand(1)),
481 cast<Constant>(Op->getOperand(1)));
482 I.setOperand(0, Op->getOperand(0));
483 I.setOperand(1, Folded);
485 } else if (BinaryOperator *Op1=dyn_cast<BinaryOperator>(I.getOperand(1)))
486 if (Op1->getOpcode() == Opcode && isa<Constant>(Op1->getOperand(1)) &&
487 isOnlyUse(Op) && isOnlyUse(Op1)) {
488 Constant *C1 = cast<Constant>(Op->getOperand(1));
489 Constant *C2 = cast<Constant>(Op1->getOperand(1));
491 // Fold (op (op V1, C1), (op V2, C2)) ==> (op (op V1, V2), (op C1,C2))
492 Constant *Folded = ConstantExpr::get(I.getOpcode(), C1, C2);
493 Instruction *New = BinaryOperator::create(Opcode, Op->getOperand(0),
497 I.setOperand(0, New);
498 I.setOperand(1, Folded);
505 /// SimplifyCompare - For a CmpInst this function just orders the operands
506 /// so that theyare listed from right (least complex) to left (most complex).
507 /// This puts constants before unary operators before binary operators.
508 bool InstCombiner::SimplifyCompare(CmpInst &I) {
509 if (getComplexity(I.getOperand(0)) >= getComplexity(I.getOperand(1)))
512 // Compare instructions are not associative so there's nothing else we can do.
516 // dyn_castNegVal - Given a 'sub' instruction, return the RHS of the instruction
517 // if the LHS is a constant zero (which is the 'negate' form).
519 static inline Value *dyn_castNegVal(Value *V) {
520 if (BinaryOperator::isNeg(V))
521 return BinaryOperator::getNegArgument(V);
523 // Constants can be considered to be negated values if they can be folded.
524 if (ConstantInt *C = dyn_cast<ConstantInt>(V))
525 return ConstantExpr::getNeg(C);
529 static inline Value *dyn_castNotVal(Value *V) {
530 if (BinaryOperator::isNot(V))
531 return BinaryOperator::getNotArgument(V);
533 // Constants can be considered to be not'ed values...
534 if (ConstantInt *C = dyn_cast<ConstantInt>(V))
535 return ConstantInt::get(~C->getValue());
539 // dyn_castFoldableMul - If this value is a multiply that can be folded into
540 // other computations (because it has a constant operand), return the
541 // non-constant operand of the multiply, and set CST to point to the multiplier.
542 // Otherwise, return null.
544 static inline Value *dyn_castFoldableMul(Value *V, ConstantInt *&CST) {
545 if (V->hasOneUse() && V->getType()->isInteger())
546 if (Instruction *I = dyn_cast<Instruction>(V)) {
547 if (I->getOpcode() == Instruction::Mul)
548 if ((CST = dyn_cast<ConstantInt>(I->getOperand(1))))
549 return I->getOperand(0);
550 if (I->getOpcode() == Instruction::Shl)
551 if ((CST = dyn_cast<ConstantInt>(I->getOperand(1)))) {
552 // The multiplier is really 1 << CST.
553 uint32_t BitWidth = cast<IntegerType>(V->getType())->getBitWidth();
554 uint32_t CSTVal = CST->getLimitedValue(BitWidth);
555 CST = ConstantInt::get(APInt(BitWidth, 1).shl(CSTVal));
556 return I->getOperand(0);
562 /// dyn_castGetElementPtr - If this is a getelementptr instruction or constant
563 /// expression, return it.
564 static User *dyn_castGetElementPtr(Value *V) {
565 if (isa<GetElementPtrInst>(V)) return cast<User>(V);
566 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V))
567 if (CE->getOpcode() == Instruction::GetElementPtr)
568 return cast<User>(V);
572 /// AddOne - Add one to a ConstantInt
573 static ConstantInt *AddOne(ConstantInt *C) {
574 APInt Val(C->getValue());
575 return ConstantInt::get(++Val);
577 /// SubOne - Subtract one from a ConstantInt
578 static ConstantInt *SubOne(ConstantInt *C) {
579 APInt Val(C->getValue());
580 return ConstantInt::get(--Val);
582 /// Add - Add two ConstantInts together
583 static ConstantInt *Add(ConstantInt *C1, ConstantInt *C2) {
584 return ConstantInt::get(C1->getValue() + C2->getValue());
586 /// And - Bitwise AND two ConstantInts together
587 static ConstantInt *And(ConstantInt *C1, ConstantInt *C2) {
588 return ConstantInt::get(C1->getValue() & C2->getValue());
590 /// Subtract - Subtract one ConstantInt from another
591 static ConstantInt *Subtract(ConstantInt *C1, ConstantInt *C2) {
592 return ConstantInt::get(C1->getValue() - C2->getValue());
594 /// Multiply - Multiply two ConstantInts together
595 static ConstantInt *Multiply(ConstantInt *C1, ConstantInt *C2) {
596 return ConstantInt::get(C1->getValue() * C2->getValue());
599 /// ComputeMaskedBits - Determine which of the bits specified in Mask are
600 /// known to be either zero or one and return them in the KnownZero/KnownOne
601 /// bit sets. This code only analyzes bits in Mask, in order to short-circuit
603 /// NOTE: we cannot consider 'undef' to be "IsZero" here. The problem is that
604 /// we cannot optimize based on the assumption that it is zero without changing
605 /// it to be an explicit zero. If we don't change it to zero, other code could
606 /// optimized based on the contradictory assumption that it is non-zero.
607 /// Because instcombine aggressively folds operations with undef args anyway,
608 /// this won't lose us code quality.
609 static void ComputeMaskedBits(Value *V, const APInt &Mask, APInt& KnownZero,
610 APInt& KnownOne, unsigned Depth = 0) {
611 assert(V && "No Value?");
612 assert(Depth <= 6 && "Limit Search Depth");
613 uint32_t BitWidth = Mask.getBitWidth();
614 assert(cast<IntegerType>(V->getType())->getBitWidth() == BitWidth &&
615 KnownZero.getBitWidth() == BitWidth &&
616 KnownOne.getBitWidth() == BitWidth &&
617 "V, Mask, KnownOne and KnownZero should have same BitWidth");
618 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
619 // We know all of the bits for a constant!
620 KnownOne = CI->getValue() & Mask;
621 KnownZero = ~KnownOne & Mask;
625 if (Depth == 6 || Mask == 0)
626 return; // Limit search depth.
628 Instruction *I = dyn_cast<Instruction>(V);
631 KnownZero.clear(); KnownOne.clear(); // Don't know anything.
632 APInt KnownZero2(KnownZero), KnownOne2(KnownOne);
634 switch (I->getOpcode()) {
635 case Instruction::And: {
636 // If either the LHS or the RHS are Zero, the result is zero.
637 ComputeMaskedBits(I->getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
638 APInt Mask2(Mask & ~KnownZero);
639 ComputeMaskedBits(I->getOperand(0), Mask2, KnownZero2, KnownOne2, Depth+1);
640 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
641 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
643 // Output known-1 bits are only known if set in both the LHS & RHS.
644 KnownOne &= KnownOne2;
645 // Output known-0 are known to be clear if zero in either the LHS | RHS.
646 KnownZero |= KnownZero2;
649 case Instruction::Or: {
650 ComputeMaskedBits(I->getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
651 APInt Mask2(Mask & ~KnownOne);
652 ComputeMaskedBits(I->getOperand(0), Mask2, KnownZero2, KnownOne2, Depth+1);
653 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
654 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
656 // Output known-0 bits are only known if clear in both the LHS & RHS.
657 KnownZero &= KnownZero2;
658 // Output known-1 are known to be set if set in either the LHS | RHS.
659 KnownOne |= KnownOne2;
662 case Instruction::Xor: {
663 ComputeMaskedBits(I->getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
664 ComputeMaskedBits(I->getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
665 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
666 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
668 // Output known-0 bits are known if clear or set in both the LHS & RHS.
669 APInt KnownZeroOut = (KnownZero & KnownZero2) | (KnownOne & KnownOne2);
670 // Output known-1 are known to be set if set in only one of the LHS, RHS.
671 KnownOne = (KnownZero & KnownOne2) | (KnownOne & KnownZero2);
672 KnownZero = KnownZeroOut;
675 case Instruction::Select:
676 ComputeMaskedBits(I->getOperand(2), Mask, KnownZero, KnownOne, Depth+1);
677 ComputeMaskedBits(I->getOperand(1), Mask, KnownZero2, KnownOne2, Depth+1);
678 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
679 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
681 // Only known if known in both the LHS and RHS.
682 KnownOne &= KnownOne2;
683 KnownZero &= KnownZero2;
685 case Instruction::FPTrunc:
686 case Instruction::FPExt:
687 case Instruction::FPToUI:
688 case Instruction::FPToSI:
689 case Instruction::SIToFP:
690 case Instruction::PtrToInt:
691 case Instruction::UIToFP:
692 case Instruction::IntToPtr:
693 return; // Can't work with floating point or pointers
694 case Instruction::Trunc: {
695 // All these have integer operands
696 uint32_t SrcBitWidth =
697 cast<IntegerType>(I->getOperand(0)->getType())->getBitWidth();
699 MaskIn.zext(SrcBitWidth);
700 KnownZero.zext(SrcBitWidth);
701 KnownOne.zext(SrcBitWidth);
702 ComputeMaskedBits(I->getOperand(0), MaskIn, KnownZero, KnownOne, Depth+1);
703 KnownZero.trunc(BitWidth);
704 KnownOne.trunc(BitWidth);
707 case Instruction::BitCast: {
708 const Type *SrcTy = I->getOperand(0)->getType();
709 if (SrcTy->isInteger()) {
710 ComputeMaskedBits(I->getOperand(0), Mask, KnownZero, KnownOne, Depth+1);
715 case Instruction::ZExt: {
716 // Compute the bits in the result that are not present in the input.
717 const IntegerType *SrcTy = cast<IntegerType>(I->getOperand(0)->getType());
718 uint32_t SrcBitWidth = SrcTy->getBitWidth();
721 MaskIn.trunc(SrcBitWidth);
722 KnownZero.trunc(SrcBitWidth);
723 KnownOne.trunc(SrcBitWidth);
724 ComputeMaskedBits(I->getOperand(0), MaskIn, KnownZero, KnownOne, Depth+1);
725 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
726 // The top bits are known to be zero.
727 KnownZero.zext(BitWidth);
728 KnownOne.zext(BitWidth);
729 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth);
732 case Instruction::SExt: {
733 // Compute the bits in the result that are not present in the input.
734 const IntegerType *SrcTy = cast<IntegerType>(I->getOperand(0)->getType());
735 uint32_t SrcBitWidth = SrcTy->getBitWidth();
738 MaskIn.trunc(SrcBitWidth);
739 KnownZero.trunc(SrcBitWidth);
740 KnownOne.trunc(SrcBitWidth);
741 ComputeMaskedBits(I->getOperand(0), MaskIn, KnownZero, KnownOne, Depth+1);
742 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
743 KnownZero.zext(BitWidth);
744 KnownOne.zext(BitWidth);
746 // If the sign bit of the input is known set or clear, then we know the
747 // top bits of the result.
748 if (KnownZero[SrcBitWidth-1]) // Input sign bit known zero
749 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth);
750 else if (KnownOne[SrcBitWidth-1]) // Input sign bit known set
751 KnownOne |= APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth);
754 case Instruction::Shl:
755 // (shl X, C1) & C2 == 0 iff (X & C2 >>u C1) == 0
756 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
757 uint64_t ShiftAmt = SA->getLimitedValue(BitWidth);
758 APInt Mask2(Mask.lshr(ShiftAmt));
759 ComputeMaskedBits(I->getOperand(0), Mask2, KnownZero, KnownOne, Depth+1);
760 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
761 KnownZero <<= ShiftAmt;
762 KnownOne <<= ShiftAmt;
763 KnownZero |= APInt::getLowBitsSet(BitWidth, ShiftAmt); // low bits known 0
767 case Instruction::LShr:
768 // (ushr X, C1) & C2 == 0 iff (-1 >> C1) & C2 == 0
769 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
770 // Compute the new bits that are at the top now.
771 uint64_t ShiftAmt = SA->getLimitedValue(BitWidth);
773 // Unsigned shift right.
774 APInt Mask2(Mask.shl(ShiftAmt));
775 ComputeMaskedBits(I->getOperand(0), Mask2, KnownZero,KnownOne,Depth+1);
776 assert((KnownZero & KnownOne) == 0&&"Bits known to be one AND zero?");
777 KnownZero = APIntOps::lshr(KnownZero, ShiftAmt);
778 KnownOne = APIntOps::lshr(KnownOne, ShiftAmt);
779 // high bits known zero.
780 KnownZero |= APInt::getHighBitsSet(BitWidth, ShiftAmt);
784 case Instruction::AShr:
785 // (ashr X, C1) & C2 == 0 iff (-1 >> C1) & C2 == 0
786 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
787 // Compute the new bits that are at the top now.
788 uint64_t ShiftAmt = SA->getLimitedValue(BitWidth);
790 // Signed shift right.
791 APInt Mask2(Mask.shl(ShiftAmt));
792 ComputeMaskedBits(I->getOperand(0), Mask2, KnownZero,KnownOne,Depth+1);
793 assert((KnownZero & KnownOne) == 0&&"Bits known to be one AND zero?");
794 KnownZero = APIntOps::lshr(KnownZero, ShiftAmt);
795 KnownOne = APIntOps::lshr(KnownOne, ShiftAmt);
797 APInt HighBits(APInt::getHighBitsSet(BitWidth, ShiftAmt));
798 if (KnownZero[BitWidth-ShiftAmt-1]) // New bits are known zero.
799 KnownZero |= HighBits;
800 else if (KnownOne[BitWidth-ShiftAmt-1]) // New bits are known one.
801 KnownOne |= HighBits;
808 /// MaskedValueIsZero - Return true if 'V & Mask' is known to be zero. We use
809 /// this predicate to simplify operations downstream. Mask is known to be zero
810 /// for bits that V cannot have.
811 static bool MaskedValueIsZero(Value *V, const APInt& Mask, unsigned Depth = 0) {
812 APInt KnownZero(Mask.getBitWidth(), 0), KnownOne(Mask.getBitWidth(), 0);
813 ComputeMaskedBits(V, Mask, KnownZero, KnownOne, Depth);
814 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
815 return (KnownZero & Mask) == Mask;
818 /// ShrinkDemandedConstant - Check to see if the specified operand of the
819 /// specified instruction is a constant integer. If so, check to see if there
820 /// are any bits set in the constant that are not demanded. If so, shrink the
821 /// constant and return true.
822 static bool ShrinkDemandedConstant(Instruction *I, unsigned OpNo,
824 assert(I && "No instruction?");
825 assert(OpNo < I->getNumOperands() && "Operand index too large");
827 // If the operand is not a constant integer, nothing to do.
828 ConstantInt *OpC = dyn_cast<ConstantInt>(I->getOperand(OpNo));
829 if (!OpC) return false;
831 // If there are no bits set that aren't demanded, nothing to do.
832 Demanded.zextOrTrunc(OpC->getValue().getBitWidth());
833 if ((~Demanded & OpC->getValue()) == 0)
836 // This instruction is producing bits that are not demanded. Shrink the RHS.
837 Demanded &= OpC->getValue();
838 I->setOperand(OpNo, ConstantInt::get(Demanded));
842 // ComputeSignedMinMaxValuesFromKnownBits - Given a signed integer type and a
843 // set of known zero and one bits, compute the maximum and minimum values that
844 // could have the specified known zero and known one bits, returning them in
846 static void ComputeSignedMinMaxValuesFromKnownBits(const Type *Ty,
847 const APInt& KnownZero,
848 const APInt& KnownOne,
849 APInt& Min, APInt& Max) {
850 uint32_t BitWidth = cast<IntegerType>(Ty)->getBitWidth();
851 assert(KnownZero.getBitWidth() == BitWidth &&
852 KnownOne.getBitWidth() == BitWidth &&
853 Min.getBitWidth() == BitWidth && Max.getBitWidth() == BitWidth &&
854 "Ty, KnownZero, KnownOne and Min, Max must have equal bitwidth.");
855 APInt UnknownBits = ~(KnownZero|KnownOne);
857 // The minimum value is when all unknown bits are zeros, EXCEPT for the sign
858 // bit if it is unknown.
860 Max = KnownOne|UnknownBits;
862 if (UnknownBits[BitWidth-1]) { // Sign bit is unknown
864 Max.clear(BitWidth-1);
868 // ComputeUnsignedMinMaxValuesFromKnownBits - Given an unsigned integer type and
869 // a set of known zero and one bits, compute the maximum and minimum values that
870 // could have the specified known zero and known one bits, returning them in
872 static void ComputeUnsignedMinMaxValuesFromKnownBits(const Type *Ty,
873 const APInt& KnownZero,
874 const APInt& KnownOne,
877 uint32_t BitWidth = cast<IntegerType>(Ty)->getBitWidth();
878 assert(KnownZero.getBitWidth() == BitWidth &&
879 KnownOne.getBitWidth() == BitWidth &&
880 Min.getBitWidth() == BitWidth && Max.getBitWidth() &&
881 "Ty, KnownZero, KnownOne and Min, Max must have equal bitwidth.");
882 APInt UnknownBits = ~(KnownZero|KnownOne);
884 // The minimum value is when the unknown bits are all zeros.
886 // The maximum value is when the unknown bits are all ones.
887 Max = KnownOne|UnknownBits;
890 /// SimplifyDemandedBits - This function attempts to replace V with a simpler
891 /// value based on the demanded bits. When this function is called, it is known
892 /// that only the bits set in DemandedMask of the result of V are ever used
893 /// downstream. Consequently, depending on the mask and V, it may be possible
894 /// to replace V with a constant or one of its operands. In such cases, this
895 /// function does the replacement and returns true. In all other cases, it
896 /// returns false after analyzing the expression and setting KnownOne and known
897 /// to be one in the expression. KnownZero contains all the bits that are known
898 /// to be zero in the expression. These are provided to potentially allow the
899 /// caller (which might recursively be SimplifyDemandedBits itself) to simplify
900 /// the expression. KnownOne and KnownZero always follow the invariant that
901 /// KnownOne & KnownZero == 0. That is, a bit can't be both 1 and 0. Note that
902 /// the bits in KnownOne and KnownZero may only be accurate for those bits set
903 /// in DemandedMask. Note also that the bitwidth of V, DemandedMask, KnownZero
904 /// and KnownOne must all be the same.
905 bool InstCombiner::SimplifyDemandedBits(Value *V, APInt DemandedMask,
906 APInt& KnownZero, APInt& KnownOne,
908 assert(V != 0 && "Null pointer of Value???");
909 assert(Depth <= 6 && "Limit Search Depth");
910 uint32_t BitWidth = DemandedMask.getBitWidth();
911 const IntegerType *VTy = cast<IntegerType>(V->getType());
912 assert(VTy->getBitWidth() == BitWidth &&
913 KnownZero.getBitWidth() == BitWidth &&
914 KnownOne.getBitWidth() == BitWidth &&
915 "Value *V, DemandedMask, KnownZero and KnownOne \
916 must have same BitWidth");
917 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
918 // We know all of the bits for a constant!
919 KnownOne = CI->getValue() & DemandedMask;
920 KnownZero = ~KnownOne & DemandedMask;
926 if (!V->hasOneUse()) { // Other users may use these bits.
927 if (Depth != 0) { // Not at the root.
928 // Just compute the KnownZero/KnownOne bits to simplify things downstream.
929 ComputeMaskedBits(V, DemandedMask, KnownZero, KnownOne, Depth);
932 // If this is the root being simplified, allow it to have multiple uses,
933 // just set the DemandedMask to all bits.
934 DemandedMask = APInt::getAllOnesValue(BitWidth);
935 } else if (DemandedMask == 0) { // Not demanding any bits from V.
936 if (V != UndefValue::get(VTy))
937 return UpdateValueUsesWith(V, UndefValue::get(VTy));
939 } else if (Depth == 6) { // Limit search depth.
943 Instruction *I = dyn_cast<Instruction>(V);
944 if (!I) return false; // Only analyze instructions.
946 APInt LHSKnownZero(BitWidth, 0), LHSKnownOne(BitWidth, 0);
947 APInt &RHSKnownZero = KnownZero, &RHSKnownOne = KnownOne;
948 switch (I->getOpcode()) {
950 case Instruction::And:
951 // If either the LHS or the RHS are Zero, the result is zero.
952 if (SimplifyDemandedBits(I->getOperand(1), DemandedMask,
953 RHSKnownZero, RHSKnownOne, Depth+1))
955 assert((RHSKnownZero & RHSKnownOne) == 0 &&
956 "Bits known to be one AND zero?");
958 // If something is known zero on the RHS, the bits aren't demanded on the
960 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask & ~RHSKnownZero,
961 LHSKnownZero, LHSKnownOne, Depth+1))
963 assert((LHSKnownZero & LHSKnownOne) == 0 &&
964 "Bits known to be one AND zero?");
966 // If all of the demanded bits are known 1 on one side, return the other.
967 // These bits cannot contribute to the result of the 'and'.
968 if ((DemandedMask & ~LHSKnownZero & RHSKnownOne) ==
969 (DemandedMask & ~LHSKnownZero))
970 return UpdateValueUsesWith(I, I->getOperand(0));
971 if ((DemandedMask & ~RHSKnownZero & LHSKnownOne) ==
972 (DemandedMask & ~RHSKnownZero))
973 return UpdateValueUsesWith(I, I->getOperand(1));
975 // If all of the demanded bits in the inputs are known zeros, return zero.
976 if ((DemandedMask & (RHSKnownZero|LHSKnownZero)) == DemandedMask)
977 return UpdateValueUsesWith(I, Constant::getNullValue(VTy));
979 // If the RHS is a constant, see if we can simplify it.
980 if (ShrinkDemandedConstant(I, 1, DemandedMask & ~LHSKnownZero))
981 return UpdateValueUsesWith(I, I);
983 // Output known-1 bits are only known if set in both the LHS & RHS.
984 RHSKnownOne &= LHSKnownOne;
985 // Output known-0 are known to be clear if zero in either the LHS | RHS.
986 RHSKnownZero |= LHSKnownZero;
988 case Instruction::Or:
989 // If either the LHS or the RHS are One, the result is One.
990 if (SimplifyDemandedBits(I->getOperand(1), DemandedMask,
991 RHSKnownZero, RHSKnownOne, Depth+1))
993 assert((RHSKnownZero & RHSKnownOne) == 0 &&
994 "Bits known to be one AND zero?");
995 // If something is known one on the RHS, the bits aren't demanded on the
997 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask & ~RHSKnownOne,
998 LHSKnownZero, LHSKnownOne, Depth+1))
1000 assert((LHSKnownZero & LHSKnownOne) == 0 &&
1001 "Bits known to be one AND zero?");
1003 // If all of the demanded bits are known zero on one side, return the other.
1004 // These bits cannot contribute to the result of the 'or'.
1005 if ((DemandedMask & ~LHSKnownOne & RHSKnownZero) ==
1006 (DemandedMask & ~LHSKnownOne))
1007 return UpdateValueUsesWith(I, I->getOperand(0));
1008 if ((DemandedMask & ~RHSKnownOne & LHSKnownZero) ==
1009 (DemandedMask & ~RHSKnownOne))
1010 return UpdateValueUsesWith(I, I->getOperand(1));
1012 // If all of the potentially set bits on one side are known to be set on
1013 // the other side, just use the 'other' side.
1014 if ((DemandedMask & (~RHSKnownZero) & LHSKnownOne) ==
1015 (DemandedMask & (~RHSKnownZero)))
1016 return UpdateValueUsesWith(I, I->getOperand(0));
1017 if ((DemandedMask & (~LHSKnownZero) & RHSKnownOne) ==
1018 (DemandedMask & (~LHSKnownZero)))
1019 return UpdateValueUsesWith(I, I->getOperand(1));
1021 // If the RHS is a constant, see if we can simplify it.
1022 if (ShrinkDemandedConstant(I, 1, DemandedMask))
1023 return UpdateValueUsesWith(I, I);
1025 // Output known-0 bits are only known if clear in both the LHS & RHS.
1026 RHSKnownZero &= LHSKnownZero;
1027 // Output known-1 are known to be set if set in either the LHS | RHS.
1028 RHSKnownOne |= LHSKnownOne;
1030 case Instruction::Xor: {
1031 if (SimplifyDemandedBits(I->getOperand(1), DemandedMask,
1032 RHSKnownZero, RHSKnownOne, Depth+1))
1034 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1035 "Bits known to be one AND zero?");
1036 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask,
1037 LHSKnownZero, LHSKnownOne, Depth+1))
1039 assert((LHSKnownZero & LHSKnownOne) == 0 &&
1040 "Bits known to be one AND zero?");
1042 // If all of the demanded bits are known zero on one side, return the other.
1043 // These bits cannot contribute to the result of the 'xor'.
1044 if ((DemandedMask & RHSKnownZero) == DemandedMask)
1045 return UpdateValueUsesWith(I, I->getOperand(0));
1046 if ((DemandedMask & LHSKnownZero) == DemandedMask)
1047 return UpdateValueUsesWith(I, I->getOperand(1));
1049 // Output known-0 bits are known if clear or set in both the LHS & RHS.
1050 APInt KnownZeroOut = (RHSKnownZero & LHSKnownZero) |
1051 (RHSKnownOne & LHSKnownOne);
1052 // Output known-1 are known to be set if set in only one of the LHS, RHS.
1053 APInt KnownOneOut = (RHSKnownZero & LHSKnownOne) |
1054 (RHSKnownOne & LHSKnownZero);
1056 // If all of the demanded bits are known to be zero on one side or the
1057 // other, turn this into an *inclusive* or.
1058 // e.g. (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
1059 if ((DemandedMask & ~RHSKnownZero & ~LHSKnownZero) == 0) {
1061 BinaryOperator::createOr(I->getOperand(0), I->getOperand(1),
1063 InsertNewInstBefore(Or, *I);
1064 return UpdateValueUsesWith(I, Or);
1067 // If all of the demanded bits on one side are known, and all of the set
1068 // bits on that side are also known to be set on the other side, turn this
1069 // into an AND, as we know the bits will be cleared.
1070 // e.g. (X | C1) ^ C2 --> (X | C1) & ~C2 iff (C1&C2) == C2
1071 if ((DemandedMask & (RHSKnownZero|RHSKnownOne)) == DemandedMask) {
1073 if ((RHSKnownOne & LHSKnownOne) == RHSKnownOne) {
1074 Constant *AndC = ConstantInt::get(~RHSKnownOne & DemandedMask);
1076 BinaryOperator::createAnd(I->getOperand(0), AndC, "tmp");
1077 InsertNewInstBefore(And, *I);
1078 return UpdateValueUsesWith(I, And);
1082 // If the RHS is a constant, see if we can simplify it.
1083 // FIXME: for XOR, we prefer to force bits to 1 if they will make a -1.
1084 if (ShrinkDemandedConstant(I, 1, DemandedMask))
1085 return UpdateValueUsesWith(I, I);
1087 RHSKnownZero = KnownZeroOut;
1088 RHSKnownOne = KnownOneOut;
1091 case Instruction::Select:
1092 if (SimplifyDemandedBits(I->getOperand(2), DemandedMask,
1093 RHSKnownZero, RHSKnownOne, Depth+1))
1095 if (SimplifyDemandedBits(I->getOperand(1), DemandedMask,
1096 LHSKnownZero, LHSKnownOne, Depth+1))
1098 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1099 "Bits known to be one AND zero?");
1100 assert((LHSKnownZero & LHSKnownOne) == 0 &&
1101 "Bits known to be one AND zero?");
1103 // If the operands are constants, see if we can simplify them.
1104 if (ShrinkDemandedConstant(I, 1, DemandedMask))
1105 return UpdateValueUsesWith(I, I);
1106 if (ShrinkDemandedConstant(I, 2, DemandedMask))
1107 return UpdateValueUsesWith(I, I);
1109 // Only known if known in both the LHS and RHS.
1110 RHSKnownOne &= LHSKnownOne;
1111 RHSKnownZero &= LHSKnownZero;
1113 case Instruction::Trunc: {
1115 cast<IntegerType>(I->getOperand(0)->getType())->getBitWidth();
1116 DemandedMask.zext(truncBf);
1117 RHSKnownZero.zext(truncBf);
1118 RHSKnownOne.zext(truncBf);
1119 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask,
1120 RHSKnownZero, RHSKnownOne, Depth+1))
1122 DemandedMask.trunc(BitWidth);
1123 RHSKnownZero.trunc(BitWidth);
1124 RHSKnownOne.trunc(BitWidth);
1125 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1126 "Bits known to be one AND zero?");
1129 case Instruction::BitCast:
1130 if (!I->getOperand(0)->getType()->isInteger())
1133 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask,
1134 RHSKnownZero, RHSKnownOne, Depth+1))
1136 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1137 "Bits known to be one AND zero?");
1139 case Instruction::ZExt: {
1140 // Compute the bits in the result that are not present in the input.
1141 const IntegerType *SrcTy = cast<IntegerType>(I->getOperand(0)->getType());
1142 uint32_t SrcBitWidth = SrcTy->getBitWidth();
1144 DemandedMask.trunc(SrcBitWidth);
1145 RHSKnownZero.trunc(SrcBitWidth);
1146 RHSKnownOne.trunc(SrcBitWidth);
1147 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask,
1148 RHSKnownZero, RHSKnownOne, Depth+1))
1150 DemandedMask.zext(BitWidth);
1151 RHSKnownZero.zext(BitWidth);
1152 RHSKnownOne.zext(BitWidth);
1153 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1154 "Bits known to be one AND zero?");
1155 // The top bits are known to be zero.
1156 RHSKnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth);
1159 case Instruction::SExt: {
1160 // Compute the bits in the result that are not present in the input.
1161 const IntegerType *SrcTy = cast<IntegerType>(I->getOperand(0)->getType());
1162 uint32_t SrcBitWidth = SrcTy->getBitWidth();
1164 APInt InputDemandedBits = DemandedMask &
1165 APInt::getLowBitsSet(BitWidth, SrcBitWidth);
1167 APInt NewBits(APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth));
1168 // If any of the sign extended bits are demanded, we know that the sign
1170 if ((NewBits & DemandedMask) != 0)
1171 InputDemandedBits.set(SrcBitWidth-1);
1173 InputDemandedBits.trunc(SrcBitWidth);
1174 RHSKnownZero.trunc(SrcBitWidth);
1175 RHSKnownOne.trunc(SrcBitWidth);
1176 if (SimplifyDemandedBits(I->getOperand(0), InputDemandedBits,
1177 RHSKnownZero, RHSKnownOne, Depth+1))
1179 InputDemandedBits.zext(BitWidth);
1180 RHSKnownZero.zext(BitWidth);
1181 RHSKnownOne.zext(BitWidth);
1182 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1183 "Bits known to be one AND zero?");
1185 // If the sign bit of the input is known set or clear, then we know the
1186 // top bits of the result.
1188 // If the input sign bit is known zero, or if the NewBits are not demanded
1189 // convert this into a zero extension.
1190 if (RHSKnownZero[SrcBitWidth-1] || (NewBits & ~DemandedMask) == NewBits)
1192 // Convert to ZExt cast
1193 CastInst *NewCast = new ZExtInst(I->getOperand(0), VTy, I->getName(), I);
1194 return UpdateValueUsesWith(I, NewCast);
1195 } else if (RHSKnownOne[SrcBitWidth-1]) { // Input sign bit known set
1196 RHSKnownOne |= NewBits;
1200 case Instruction::Add: {
1201 // Figure out what the input bits are. If the top bits of the and result
1202 // are not demanded, then the add doesn't demand them from its input
1204 uint32_t NLZ = DemandedMask.countLeadingZeros();
1206 // If there is a constant on the RHS, there are a variety of xformations
1208 if (ConstantInt *RHS = dyn_cast<ConstantInt>(I->getOperand(1))) {
1209 // If null, this should be simplified elsewhere. Some of the xforms here
1210 // won't work if the RHS is zero.
1214 // If the top bit of the output is demanded, demand everything from the
1215 // input. Otherwise, we demand all the input bits except NLZ top bits.
1216 APInt InDemandedBits(APInt::getLowBitsSet(BitWidth, BitWidth - NLZ));
1218 // Find information about known zero/one bits in the input.
1219 if (SimplifyDemandedBits(I->getOperand(0), InDemandedBits,
1220 LHSKnownZero, LHSKnownOne, Depth+1))
1223 // If the RHS of the add has bits set that can't affect the input, reduce
1225 if (ShrinkDemandedConstant(I, 1, InDemandedBits))
1226 return UpdateValueUsesWith(I, I);
1228 // Avoid excess work.
1229 if (LHSKnownZero == 0 && LHSKnownOne == 0)
1232 // Turn it into OR if input bits are zero.
1233 if ((LHSKnownZero & RHS->getValue()) == RHS->getValue()) {
1235 BinaryOperator::createOr(I->getOperand(0), I->getOperand(1),
1237 InsertNewInstBefore(Or, *I);
1238 return UpdateValueUsesWith(I, Or);
1241 // We can say something about the output known-zero and known-one bits,
1242 // depending on potential carries from the input constant and the
1243 // unknowns. For example if the LHS is known to have at most the 0x0F0F0
1244 // bits set and the RHS constant is 0x01001, then we know we have a known
1245 // one mask of 0x00001 and a known zero mask of 0xE0F0E.
1247 // To compute this, we first compute the potential carry bits. These are
1248 // the bits which may be modified. I'm not aware of a better way to do
1250 const APInt& RHSVal = RHS->getValue();
1251 APInt CarryBits((~LHSKnownZero + RHSVal) ^ (~LHSKnownZero ^ RHSVal));
1253 // Now that we know which bits have carries, compute the known-1/0 sets.
1255 // Bits are known one if they are known zero in one operand and one in the
1256 // other, and there is no input carry.
1257 RHSKnownOne = ((LHSKnownZero & RHSVal) |
1258 (LHSKnownOne & ~RHSVal)) & ~CarryBits;
1260 // Bits are known zero if they are known zero in both operands and there
1261 // is no input carry.
1262 RHSKnownZero = LHSKnownZero & ~RHSVal & ~CarryBits;
1264 // If the high-bits of this ADD are not demanded, then it does not demand
1265 // the high bits of its LHS or RHS.
1266 if (DemandedMask[BitWidth-1] == 0) {
1267 // Right fill the mask of bits for this ADD to demand the most
1268 // significant bit and all those below it.
1269 APInt DemandedFromOps(APInt::getLowBitsSet(BitWidth, BitWidth-NLZ));
1270 if (SimplifyDemandedBits(I->getOperand(0), DemandedFromOps,
1271 LHSKnownZero, LHSKnownOne, Depth+1))
1273 if (SimplifyDemandedBits(I->getOperand(1), DemandedFromOps,
1274 LHSKnownZero, LHSKnownOne, Depth+1))
1280 case Instruction::Sub:
1281 // If the high-bits of this SUB are not demanded, then it does not demand
1282 // the high bits of its LHS or RHS.
1283 if (DemandedMask[BitWidth-1] == 0) {
1284 // Right fill the mask of bits for this SUB to demand the most
1285 // significant bit and all those below it.
1286 uint32_t NLZ = DemandedMask.countLeadingZeros();
1287 APInt DemandedFromOps(APInt::getLowBitsSet(BitWidth, BitWidth-NLZ));
1288 if (SimplifyDemandedBits(I->getOperand(0), DemandedFromOps,
1289 LHSKnownZero, LHSKnownOne, Depth+1))
1291 if (SimplifyDemandedBits(I->getOperand(1), DemandedFromOps,
1292 LHSKnownZero, LHSKnownOne, Depth+1))
1296 case Instruction::Shl:
1297 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
1298 uint64_t ShiftAmt = SA->getLimitedValue(BitWidth);
1299 APInt DemandedMaskIn(DemandedMask.lshr(ShiftAmt));
1300 if (SimplifyDemandedBits(I->getOperand(0), DemandedMaskIn,
1301 RHSKnownZero, RHSKnownOne, Depth+1))
1303 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1304 "Bits known to be one AND zero?");
1305 RHSKnownZero <<= ShiftAmt;
1306 RHSKnownOne <<= ShiftAmt;
1307 // low bits known zero.
1309 RHSKnownZero |= APInt::getLowBitsSet(BitWidth, ShiftAmt);
1312 case Instruction::LShr:
1313 // For a logical shift right
1314 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
1315 uint64_t ShiftAmt = SA->getLimitedValue(BitWidth);
1317 // Unsigned shift right.
1318 APInt DemandedMaskIn(DemandedMask.shl(ShiftAmt));
1319 if (SimplifyDemandedBits(I->getOperand(0), DemandedMaskIn,
1320 RHSKnownZero, RHSKnownOne, Depth+1))
1322 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1323 "Bits known to be one AND zero?");
1324 RHSKnownZero = APIntOps::lshr(RHSKnownZero, ShiftAmt);
1325 RHSKnownOne = APIntOps::lshr(RHSKnownOne, ShiftAmt);
1327 // Compute the new bits that are at the top now.
1328 APInt HighBits(APInt::getHighBitsSet(BitWidth, ShiftAmt));
1329 RHSKnownZero |= HighBits; // high bits known zero.
1333 case Instruction::AShr:
1334 // If this is an arithmetic shift right and only the low-bit is set, we can
1335 // always convert this into a logical shr, even if the shift amount is
1336 // variable. The low bit of the shift cannot be an input sign bit unless
1337 // the shift amount is >= the size of the datatype, which is undefined.
1338 if (DemandedMask == 1) {
1339 // Perform the logical shift right.
1340 Value *NewVal = BinaryOperator::createLShr(
1341 I->getOperand(0), I->getOperand(1), I->getName());
1342 InsertNewInstBefore(cast<Instruction>(NewVal), *I);
1343 return UpdateValueUsesWith(I, NewVal);
1346 // If the sign bit is the only bit demanded by this ashr, then there is no
1347 // need to do it, the shift doesn't change the high bit.
1348 if (DemandedMask.isSignBit())
1349 return UpdateValueUsesWith(I, I->getOperand(0));
1351 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
1352 uint32_t ShiftAmt = SA->getLimitedValue(BitWidth);
1354 // Signed shift right.
1355 APInt DemandedMaskIn(DemandedMask.shl(ShiftAmt));
1356 // If any of the "high bits" are demanded, we should set the sign bit as
1358 if (DemandedMask.countLeadingZeros() <= ShiftAmt)
1359 DemandedMaskIn.set(BitWidth-1);
1360 if (SimplifyDemandedBits(I->getOperand(0),
1362 RHSKnownZero, RHSKnownOne, Depth+1))
1364 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1365 "Bits known to be one AND zero?");
1366 // Compute the new bits that are at the top now.
1367 APInt HighBits(APInt::getHighBitsSet(BitWidth, ShiftAmt));
1368 RHSKnownZero = APIntOps::lshr(RHSKnownZero, ShiftAmt);
1369 RHSKnownOne = APIntOps::lshr(RHSKnownOne, ShiftAmt);
1371 // Handle the sign bits.
1372 APInt SignBit(APInt::getSignBit(BitWidth));
1373 // Adjust to where it is now in the mask.
1374 SignBit = APIntOps::lshr(SignBit, ShiftAmt);
1376 // If the input sign bit is known to be zero, or if none of the top bits
1377 // are demanded, turn this into an unsigned shift right.
1378 if (RHSKnownZero[BitWidth-ShiftAmt-1] ||
1379 (HighBits & ~DemandedMask) == HighBits) {
1380 // Perform the logical shift right.
1381 Value *NewVal = BinaryOperator::createLShr(
1382 I->getOperand(0), SA, I->getName());
1383 InsertNewInstBefore(cast<Instruction>(NewVal), *I);
1384 return UpdateValueUsesWith(I, NewVal);
1385 } else if ((RHSKnownOne & SignBit) != 0) { // New bits are known one.
1386 RHSKnownOne |= HighBits;
1392 // If the client is only demanding bits that we know, return the known
1394 if ((DemandedMask & (RHSKnownZero|RHSKnownOne)) == DemandedMask)
1395 return UpdateValueUsesWith(I, ConstantInt::get(RHSKnownOne));
1400 /// SimplifyDemandedVectorElts - The specified value producecs a vector with
1401 /// 64 or fewer elements. DemandedElts contains the set of elements that are
1402 /// actually used by the caller. This method analyzes which elements of the
1403 /// operand are undef and returns that information in UndefElts.
1405 /// If the information about demanded elements can be used to simplify the
1406 /// operation, the operation is simplified, then the resultant value is
1407 /// returned. This returns null if no change was made.
1408 Value *InstCombiner::SimplifyDemandedVectorElts(Value *V, uint64_t DemandedElts,
1409 uint64_t &UndefElts,
1411 unsigned VWidth = cast<VectorType>(V->getType())->getNumElements();
1412 assert(VWidth <= 64 && "Vector too wide to analyze!");
1413 uint64_t EltMask = ~0ULL >> (64-VWidth);
1414 assert(DemandedElts != EltMask && (DemandedElts & ~EltMask) == 0 &&
1415 "Invalid DemandedElts!");
1417 if (isa<UndefValue>(V)) {
1418 // If the entire vector is undefined, just return this info.
1419 UndefElts = EltMask;
1421 } else if (DemandedElts == 0) { // If nothing is demanded, provide undef.
1422 UndefElts = EltMask;
1423 return UndefValue::get(V->getType());
1427 if (ConstantVector *CP = dyn_cast<ConstantVector>(V)) {
1428 const Type *EltTy = cast<VectorType>(V->getType())->getElementType();
1429 Constant *Undef = UndefValue::get(EltTy);
1431 std::vector<Constant*> Elts;
1432 for (unsigned i = 0; i != VWidth; ++i)
1433 if (!(DemandedElts & (1ULL << i))) { // If not demanded, set to undef.
1434 Elts.push_back(Undef);
1435 UndefElts |= (1ULL << i);
1436 } else if (isa<UndefValue>(CP->getOperand(i))) { // Already undef.
1437 Elts.push_back(Undef);
1438 UndefElts |= (1ULL << i);
1439 } else { // Otherwise, defined.
1440 Elts.push_back(CP->getOperand(i));
1443 // If we changed the constant, return it.
1444 Constant *NewCP = ConstantVector::get(Elts);
1445 return NewCP != CP ? NewCP : 0;
1446 } else if (isa<ConstantAggregateZero>(V)) {
1447 // Simplify the CAZ to a ConstantVector where the non-demanded elements are
1449 const Type *EltTy = cast<VectorType>(V->getType())->getElementType();
1450 Constant *Zero = Constant::getNullValue(EltTy);
1451 Constant *Undef = UndefValue::get(EltTy);
1452 std::vector<Constant*> Elts;
1453 for (unsigned i = 0; i != VWidth; ++i)
1454 Elts.push_back((DemandedElts & (1ULL << i)) ? Zero : Undef);
1455 UndefElts = DemandedElts ^ EltMask;
1456 return ConstantVector::get(Elts);
1459 if (!V->hasOneUse()) { // Other users may use these bits.
1460 if (Depth != 0) { // Not at the root.
1461 // TODO: Just compute the UndefElts information recursively.
1465 } else if (Depth == 10) { // Limit search depth.
1469 Instruction *I = dyn_cast<Instruction>(V);
1470 if (!I) return false; // Only analyze instructions.
1472 bool MadeChange = false;
1473 uint64_t UndefElts2;
1475 switch (I->getOpcode()) {
1478 case Instruction::InsertElement: {
1479 // If this is a variable index, we don't know which element it overwrites.
1480 // demand exactly the same input as we produce.
1481 ConstantInt *Idx = dyn_cast<ConstantInt>(I->getOperand(2));
1483 // Note that we can't propagate undef elt info, because we don't know
1484 // which elt is getting updated.
1485 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), DemandedElts,
1486 UndefElts2, Depth+1);
1487 if (TmpV) { I->setOperand(0, TmpV); MadeChange = true; }
1491 // If this is inserting an element that isn't demanded, remove this
1493 unsigned IdxNo = Idx->getZExtValue();
1494 if (IdxNo >= VWidth || (DemandedElts & (1ULL << IdxNo)) == 0)
1495 return AddSoonDeadInstToWorklist(*I, 0);
1497 // Otherwise, the element inserted overwrites whatever was there, so the
1498 // input demanded set is simpler than the output set.
1499 TmpV = SimplifyDemandedVectorElts(I->getOperand(0),
1500 DemandedElts & ~(1ULL << IdxNo),
1501 UndefElts, Depth+1);
1502 if (TmpV) { I->setOperand(0, TmpV); MadeChange = true; }
1504 // The inserted element is defined.
1505 UndefElts |= 1ULL << IdxNo;
1508 case Instruction::BitCast: {
1509 // Vector->vector casts only.
1510 const VectorType *VTy = dyn_cast<VectorType>(I->getOperand(0)->getType());
1512 unsigned InVWidth = VTy->getNumElements();
1513 uint64_t InputDemandedElts = 0;
1516 if (VWidth == InVWidth) {
1517 // If we are converting from <4 x i32> -> <4 x f32>, we demand the same
1518 // elements as are demanded of us.
1520 InputDemandedElts = DemandedElts;
1521 } else if (VWidth > InVWidth) {
1525 // If there are more elements in the result than there are in the source,
1526 // then an input element is live if any of the corresponding output
1527 // elements are live.
1528 Ratio = VWidth/InVWidth;
1529 for (unsigned OutIdx = 0; OutIdx != VWidth; ++OutIdx) {
1530 if (DemandedElts & (1ULL << OutIdx))
1531 InputDemandedElts |= 1ULL << (OutIdx/Ratio);
1537 // If there are more elements in the source than there are in the result,
1538 // then an input element is live if the corresponding output element is
1540 Ratio = InVWidth/VWidth;
1541 for (unsigned InIdx = 0; InIdx != InVWidth; ++InIdx)
1542 if (DemandedElts & (1ULL << InIdx/Ratio))
1543 InputDemandedElts |= 1ULL << InIdx;
1546 // div/rem demand all inputs, because they don't want divide by zero.
1547 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), InputDemandedElts,
1548 UndefElts2, Depth+1);
1550 I->setOperand(0, TmpV);
1554 UndefElts = UndefElts2;
1555 if (VWidth > InVWidth) {
1556 assert(0 && "Unimp");
1557 // If there are more elements in the result than there are in the source,
1558 // then an output element is undef if the corresponding input element is
1560 for (unsigned OutIdx = 0; OutIdx != VWidth; ++OutIdx)
1561 if (UndefElts2 & (1ULL << (OutIdx/Ratio)))
1562 UndefElts |= 1ULL << OutIdx;
1563 } else if (VWidth < InVWidth) {
1564 assert(0 && "Unimp");
1565 // If there are more elements in the source than there are in the result,
1566 // then a result element is undef if all of the corresponding input
1567 // elements are undef.
1568 UndefElts = ~0ULL >> (64-VWidth); // Start out all undef.
1569 for (unsigned InIdx = 0; InIdx != InVWidth; ++InIdx)
1570 if ((UndefElts2 & (1ULL << InIdx)) == 0) // Not undef?
1571 UndefElts &= ~(1ULL << (InIdx/Ratio)); // Clear undef bit.
1575 case Instruction::And:
1576 case Instruction::Or:
1577 case Instruction::Xor:
1578 case Instruction::Add:
1579 case Instruction::Sub:
1580 case Instruction::Mul:
1581 // div/rem demand all inputs, because they don't want divide by zero.
1582 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), DemandedElts,
1583 UndefElts, Depth+1);
1584 if (TmpV) { I->setOperand(0, TmpV); MadeChange = true; }
1585 TmpV = SimplifyDemandedVectorElts(I->getOperand(1), DemandedElts,
1586 UndefElts2, Depth+1);
1587 if (TmpV) { I->setOperand(1, TmpV); MadeChange = true; }
1589 // Output elements are undefined if both are undefined. Consider things
1590 // like undef&0. The result is known zero, not undef.
1591 UndefElts &= UndefElts2;
1594 case Instruction::Call: {
1595 IntrinsicInst *II = dyn_cast<IntrinsicInst>(I);
1597 switch (II->getIntrinsicID()) {
1600 // Binary vector operations that work column-wise. A dest element is a
1601 // function of the corresponding input elements from the two inputs.
1602 case Intrinsic::x86_sse_sub_ss:
1603 case Intrinsic::x86_sse_mul_ss:
1604 case Intrinsic::x86_sse_min_ss:
1605 case Intrinsic::x86_sse_max_ss:
1606 case Intrinsic::x86_sse2_sub_sd:
1607 case Intrinsic::x86_sse2_mul_sd:
1608 case Intrinsic::x86_sse2_min_sd:
1609 case Intrinsic::x86_sse2_max_sd:
1610 TmpV = SimplifyDemandedVectorElts(II->getOperand(1), DemandedElts,
1611 UndefElts, Depth+1);
1612 if (TmpV) { II->setOperand(1, TmpV); MadeChange = true; }
1613 TmpV = SimplifyDemandedVectorElts(II->getOperand(2), DemandedElts,
1614 UndefElts2, Depth+1);
1615 if (TmpV) { II->setOperand(2, TmpV); MadeChange = true; }
1617 // If only the low elt is demanded and this is a scalarizable intrinsic,
1618 // scalarize it now.
1619 if (DemandedElts == 1) {
1620 switch (II->getIntrinsicID()) {
1622 case Intrinsic::x86_sse_sub_ss:
1623 case Intrinsic::x86_sse_mul_ss:
1624 case Intrinsic::x86_sse2_sub_sd:
1625 case Intrinsic::x86_sse2_mul_sd:
1626 // TODO: Lower MIN/MAX/ABS/etc
1627 Value *LHS = II->getOperand(1);
1628 Value *RHS = II->getOperand(2);
1629 // Extract the element as scalars.
1630 LHS = InsertNewInstBefore(new ExtractElementInst(LHS, 0U,"tmp"), *II);
1631 RHS = InsertNewInstBefore(new ExtractElementInst(RHS, 0U,"tmp"), *II);
1633 switch (II->getIntrinsicID()) {
1634 default: assert(0 && "Case stmts out of sync!");
1635 case Intrinsic::x86_sse_sub_ss:
1636 case Intrinsic::x86_sse2_sub_sd:
1637 TmpV = InsertNewInstBefore(BinaryOperator::createSub(LHS, RHS,
1638 II->getName()), *II);
1640 case Intrinsic::x86_sse_mul_ss:
1641 case Intrinsic::x86_sse2_mul_sd:
1642 TmpV = InsertNewInstBefore(BinaryOperator::createMul(LHS, RHS,
1643 II->getName()), *II);
1648 new InsertElementInst(UndefValue::get(II->getType()), TmpV, 0U,
1650 InsertNewInstBefore(New, *II);
1651 AddSoonDeadInstToWorklist(*II, 0);
1656 // Output elements are undefined if both are undefined. Consider things
1657 // like undef&0. The result is known zero, not undef.
1658 UndefElts &= UndefElts2;
1664 return MadeChange ? I : 0;
1667 /// @returns true if the specified compare instruction is
1668 /// true when both operands are equal...
1669 /// @brief Determine if the ICmpInst returns true if both operands are equal
1670 static bool isTrueWhenEqual(ICmpInst &ICI) {
1671 ICmpInst::Predicate pred = ICI.getPredicate();
1672 return pred == ICmpInst::ICMP_EQ || pred == ICmpInst::ICMP_UGE ||
1673 pred == ICmpInst::ICMP_SGE || pred == ICmpInst::ICMP_ULE ||
1674 pred == ICmpInst::ICMP_SLE;
1677 /// AssociativeOpt - Perform an optimization on an associative operator. This
1678 /// function is designed to check a chain of associative operators for a
1679 /// potential to apply a certain optimization. Since the optimization may be
1680 /// applicable if the expression was reassociated, this checks the chain, then
1681 /// reassociates the expression as necessary to expose the optimization
1682 /// opportunity. This makes use of a special Functor, which must define
1683 /// 'shouldApply' and 'apply' methods.
1685 template<typename Functor>
1686 Instruction *AssociativeOpt(BinaryOperator &Root, const Functor &F) {
1687 unsigned Opcode = Root.getOpcode();
1688 Value *LHS = Root.getOperand(0);
1690 // Quick check, see if the immediate LHS matches...
1691 if (F.shouldApply(LHS))
1692 return F.apply(Root);
1694 // Otherwise, if the LHS is not of the same opcode as the root, return.
1695 Instruction *LHSI = dyn_cast<Instruction>(LHS);
1696 while (LHSI && LHSI->getOpcode() == Opcode && LHSI->hasOneUse()) {
1697 // Should we apply this transform to the RHS?
1698 bool ShouldApply = F.shouldApply(LHSI->getOperand(1));
1700 // If not to the RHS, check to see if we should apply to the LHS...
1701 if (!ShouldApply && F.shouldApply(LHSI->getOperand(0))) {
1702 cast<BinaryOperator>(LHSI)->swapOperands(); // Make the LHS the RHS
1706 // If the functor wants to apply the optimization to the RHS of LHSI,
1707 // reassociate the expression from ((? op A) op B) to (? op (A op B))
1709 BasicBlock *BB = Root.getParent();
1711 // Now all of the instructions are in the current basic block, go ahead
1712 // and perform the reassociation.
1713 Instruction *TmpLHSI = cast<Instruction>(Root.getOperand(0));
1715 // First move the selected RHS to the LHS of the root...
1716 Root.setOperand(0, LHSI->getOperand(1));
1718 // Make what used to be the LHS of the root be the user of the root...
1719 Value *ExtraOperand = TmpLHSI->getOperand(1);
1720 if (&Root == TmpLHSI) {
1721 Root.replaceAllUsesWith(Constant::getNullValue(TmpLHSI->getType()));
1724 Root.replaceAllUsesWith(TmpLHSI); // Users now use TmpLHSI
1725 TmpLHSI->setOperand(1, &Root); // TmpLHSI now uses the root
1726 TmpLHSI->getParent()->getInstList().remove(TmpLHSI);
1727 BasicBlock::iterator ARI = &Root; ++ARI;
1728 BB->getInstList().insert(ARI, TmpLHSI); // Move TmpLHSI to after Root
1731 // Now propagate the ExtraOperand down the chain of instructions until we
1733 while (TmpLHSI != LHSI) {
1734 Instruction *NextLHSI = cast<Instruction>(TmpLHSI->getOperand(0));
1735 // Move the instruction to immediately before the chain we are
1736 // constructing to avoid breaking dominance properties.
1737 NextLHSI->getParent()->getInstList().remove(NextLHSI);
1738 BB->getInstList().insert(ARI, NextLHSI);
1741 Value *NextOp = NextLHSI->getOperand(1);
1742 NextLHSI->setOperand(1, ExtraOperand);
1744 ExtraOperand = NextOp;
1747 // Now that the instructions are reassociated, have the functor perform
1748 // the transformation...
1749 return F.apply(Root);
1752 LHSI = dyn_cast<Instruction>(LHSI->getOperand(0));
1758 // AddRHS - Implements: X + X --> X << 1
1761 AddRHS(Value *rhs) : RHS(rhs) {}
1762 bool shouldApply(Value *LHS) const { return LHS == RHS; }
1763 Instruction *apply(BinaryOperator &Add) const {
1764 return BinaryOperator::createShl(Add.getOperand(0),
1765 ConstantInt::get(Add.getType(), 1));
1769 // AddMaskingAnd - Implements (A & C1)+(B & C2) --> (A & C1)|(B & C2)
1771 struct AddMaskingAnd {
1773 AddMaskingAnd(Constant *c) : C2(c) {}
1774 bool shouldApply(Value *LHS) const {
1776 return match(LHS, m_And(m_Value(), m_ConstantInt(C1))) &&
1777 ConstantExpr::getAnd(C1, C2)->isNullValue();
1779 Instruction *apply(BinaryOperator &Add) const {
1780 return BinaryOperator::createOr(Add.getOperand(0), Add.getOperand(1));
1784 static Value *FoldOperationIntoSelectOperand(Instruction &I, Value *SO,
1786 if (CastInst *CI = dyn_cast<CastInst>(&I)) {
1787 if (Constant *SOC = dyn_cast<Constant>(SO))
1788 return ConstantExpr::getCast(CI->getOpcode(), SOC, I.getType());
1790 return IC->InsertNewInstBefore(CastInst::create(
1791 CI->getOpcode(), SO, I.getType(), SO->getName() + ".cast"), I);
1794 // Figure out if the constant is the left or the right argument.
1795 bool ConstIsRHS = isa<Constant>(I.getOperand(1));
1796 Constant *ConstOperand = cast<Constant>(I.getOperand(ConstIsRHS));
1798 if (Constant *SOC = dyn_cast<Constant>(SO)) {
1800 return ConstantExpr::get(I.getOpcode(), SOC, ConstOperand);
1801 return ConstantExpr::get(I.getOpcode(), ConstOperand, SOC);
1804 Value *Op0 = SO, *Op1 = ConstOperand;
1806 std::swap(Op0, Op1);
1808 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(&I))
1809 New = BinaryOperator::create(BO->getOpcode(), Op0, Op1,SO->getName()+".op");
1810 else if (CmpInst *CI = dyn_cast<CmpInst>(&I))
1811 New = CmpInst::create(CI->getOpcode(), CI->getPredicate(), Op0, Op1,
1812 SO->getName()+".cmp");
1814 assert(0 && "Unknown binary instruction type!");
1817 return IC->InsertNewInstBefore(New, I);
1820 // FoldOpIntoSelect - Given an instruction with a select as one operand and a
1821 // constant as the other operand, try to fold the binary operator into the
1822 // select arguments. This also works for Cast instructions, which obviously do
1823 // not have a second operand.
1824 static Instruction *FoldOpIntoSelect(Instruction &Op, SelectInst *SI,
1826 // Don't modify shared select instructions
1827 if (!SI->hasOneUse()) return 0;
1828 Value *TV = SI->getOperand(1);
1829 Value *FV = SI->getOperand(2);
1831 if (isa<Constant>(TV) || isa<Constant>(FV)) {
1832 // Bool selects with constant operands can be folded to logical ops.
1833 if (SI->getType() == Type::Int1Ty) return 0;
1835 Value *SelectTrueVal = FoldOperationIntoSelectOperand(Op, TV, IC);
1836 Value *SelectFalseVal = FoldOperationIntoSelectOperand(Op, FV, IC);
1838 return new SelectInst(SI->getCondition(), SelectTrueVal,
1845 /// FoldOpIntoPhi - Given a binary operator or cast instruction which has a PHI
1846 /// node as operand #0, see if we can fold the instruction into the PHI (which
1847 /// is only possible if all operands to the PHI are constants).
1848 Instruction *InstCombiner::FoldOpIntoPhi(Instruction &I) {
1849 PHINode *PN = cast<PHINode>(I.getOperand(0));
1850 unsigned NumPHIValues = PN->getNumIncomingValues();
1851 if (!PN->hasOneUse() || NumPHIValues == 0) return 0;
1853 // Check to see if all of the operands of the PHI are constants. If there is
1854 // one non-constant value, remember the BB it is. If there is more than one
1855 // or if *it* is a PHI, bail out.
1856 BasicBlock *NonConstBB = 0;
1857 for (unsigned i = 0; i != NumPHIValues; ++i)
1858 if (!isa<Constant>(PN->getIncomingValue(i))) {
1859 if (NonConstBB) return 0; // More than one non-const value.
1860 if (isa<PHINode>(PN->getIncomingValue(i))) return 0; // Itself a phi.
1861 NonConstBB = PN->getIncomingBlock(i);
1863 // If the incoming non-constant value is in I's block, we have an infinite
1865 if (NonConstBB == I.getParent())
1869 // If there is exactly one non-constant value, we can insert a copy of the
1870 // operation in that block. However, if this is a critical edge, we would be
1871 // inserting the computation one some other paths (e.g. inside a loop). Only
1872 // do this if the pred block is unconditionally branching into the phi block.
1874 BranchInst *BI = dyn_cast<BranchInst>(NonConstBB->getTerminator());
1875 if (!BI || !BI->isUnconditional()) return 0;
1878 // Okay, we can do the transformation: create the new PHI node.
1879 PHINode *NewPN = new PHINode(I.getType(), "");
1880 NewPN->reserveOperandSpace(PN->getNumOperands()/2);
1881 InsertNewInstBefore(NewPN, *PN);
1882 NewPN->takeName(PN);
1884 // Next, add all of the operands to the PHI.
1885 if (I.getNumOperands() == 2) {
1886 Constant *C = cast<Constant>(I.getOperand(1));
1887 for (unsigned i = 0; i != NumPHIValues; ++i) {
1889 if (Constant *InC = dyn_cast<Constant>(PN->getIncomingValue(i))) {
1890 if (CmpInst *CI = dyn_cast<CmpInst>(&I))
1891 InV = ConstantExpr::getCompare(CI->getPredicate(), InC, C);
1893 InV = ConstantExpr::get(I.getOpcode(), InC, C);
1895 assert(PN->getIncomingBlock(i) == NonConstBB);
1896 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(&I))
1897 InV = BinaryOperator::create(BO->getOpcode(),
1898 PN->getIncomingValue(i), C, "phitmp",
1899 NonConstBB->getTerminator());
1900 else if (CmpInst *CI = dyn_cast<CmpInst>(&I))
1901 InV = CmpInst::create(CI->getOpcode(),
1903 PN->getIncomingValue(i), C, "phitmp",
1904 NonConstBB->getTerminator());
1906 assert(0 && "Unknown binop!");
1908 AddToWorkList(cast<Instruction>(InV));
1910 NewPN->addIncoming(InV, PN->getIncomingBlock(i));
1913 CastInst *CI = cast<CastInst>(&I);
1914 const Type *RetTy = CI->getType();
1915 for (unsigned i = 0; i != NumPHIValues; ++i) {
1917 if (Constant *InC = dyn_cast<Constant>(PN->getIncomingValue(i))) {
1918 InV = ConstantExpr::getCast(CI->getOpcode(), InC, RetTy);
1920 assert(PN->getIncomingBlock(i) == NonConstBB);
1921 InV = CastInst::create(CI->getOpcode(), PN->getIncomingValue(i),
1922 I.getType(), "phitmp",
1923 NonConstBB->getTerminator());
1924 AddToWorkList(cast<Instruction>(InV));
1926 NewPN->addIncoming(InV, PN->getIncomingBlock(i));
1929 return ReplaceInstUsesWith(I, NewPN);
1932 Instruction *InstCombiner::visitAdd(BinaryOperator &I) {
1933 bool Changed = SimplifyCommutative(I);
1934 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1);
1936 if (Constant *RHSC = dyn_cast<Constant>(RHS)) {
1937 // X + undef -> undef
1938 if (isa<UndefValue>(RHS))
1939 return ReplaceInstUsesWith(I, RHS);
1942 if (!I.getType()->isFPOrFPVector()) { // NOTE: -0 + +0 = +0.
1943 if (RHSC->isNullValue())
1944 return ReplaceInstUsesWith(I, LHS);
1945 } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(RHSC)) {
1946 if (CFP->isExactlyValue(-0.0))
1947 return ReplaceInstUsesWith(I, LHS);
1950 if (ConstantInt *CI = dyn_cast<ConstantInt>(RHSC)) {
1951 // X + (signbit) --> X ^ signbit
1952 const APInt& Val = CI->getValue();
1953 uint32_t BitWidth = Val.getBitWidth();
1954 if (Val == APInt::getSignBit(BitWidth))
1955 return BinaryOperator::createXor(LHS, RHS);
1957 // See if SimplifyDemandedBits can simplify this. This handles stuff like
1958 // (X & 254)+1 -> (X&254)|1
1959 if (!isa<VectorType>(I.getType())) {
1960 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
1961 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
1962 KnownZero, KnownOne))
1967 if (isa<PHINode>(LHS))
1968 if (Instruction *NV = FoldOpIntoPhi(I))
1971 ConstantInt *XorRHS = 0;
1973 if (isa<ConstantInt>(RHSC) &&
1974 match(LHS, m_Xor(m_Value(XorLHS), m_ConstantInt(XorRHS)))) {
1975 uint32_t TySizeBits = I.getType()->getPrimitiveSizeInBits();
1976 const APInt& RHSVal = cast<ConstantInt>(RHSC)->getValue();
1978 uint32_t Size = TySizeBits / 2;
1979 APInt C0080Val(APInt(TySizeBits, 1ULL).shl(Size - 1));
1980 APInt CFF80Val(-C0080Val);
1982 if (TySizeBits > Size) {
1983 // If we have ADD(XOR(AND(X, 0xFF), 0x80), 0xF..F80), it's a sext.
1984 // If we have ADD(XOR(AND(X, 0xFF), 0xF..F80), 0x80), it's a sext.
1985 if ((RHSVal == CFF80Val && XorRHS->getValue() == C0080Val) ||
1986 (RHSVal == C0080Val && XorRHS->getValue() == CFF80Val)) {
1987 // This is a sign extend if the top bits are known zero.
1988 if (!MaskedValueIsZero(XorLHS,
1989 APInt::getHighBitsSet(TySizeBits, TySizeBits - Size)))
1990 Size = 0; // Not a sign ext, but can't be any others either.
1995 C0080Val = APIntOps::lshr(C0080Val, Size);
1996 CFF80Val = APIntOps::ashr(CFF80Val, Size);
1997 } while (Size >= 1);
1999 // FIXME: This shouldn't be necessary. When the backends can handle types
2000 // with funny bit widths then this whole cascade of if statements should
2001 // be removed. It is just here to get the size of the "middle" type back
2002 // up to something that the back ends can handle.
2003 const Type *MiddleType = 0;
2006 case 32: MiddleType = Type::Int32Ty; break;
2007 case 16: MiddleType = Type::Int16Ty; break;
2008 case 8: MiddleType = Type::Int8Ty; break;
2011 Instruction *NewTrunc = new TruncInst(XorLHS, MiddleType, "sext");
2012 InsertNewInstBefore(NewTrunc, I);
2013 return new SExtInst(NewTrunc, I.getType(), I.getName());
2019 if (I.getType()->isInteger() && I.getType() != Type::Int1Ty) {
2020 if (Instruction *Result = AssociativeOpt(I, AddRHS(RHS))) return Result;
2022 if (Instruction *RHSI = dyn_cast<Instruction>(RHS)) {
2023 if (RHSI->getOpcode() == Instruction::Sub)
2024 if (LHS == RHSI->getOperand(1)) // A + (B - A) --> B
2025 return ReplaceInstUsesWith(I, RHSI->getOperand(0));
2027 if (Instruction *LHSI = dyn_cast<Instruction>(LHS)) {
2028 if (LHSI->getOpcode() == Instruction::Sub)
2029 if (RHS == LHSI->getOperand(1)) // (B - A) + A --> B
2030 return ReplaceInstUsesWith(I, LHSI->getOperand(0));
2035 if (Value *V = dyn_castNegVal(LHS))
2036 return BinaryOperator::createSub(RHS, V);
2039 if (!isa<Constant>(RHS))
2040 if (Value *V = dyn_castNegVal(RHS))
2041 return BinaryOperator::createSub(LHS, V);
2045 if (Value *X = dyn_castFoldableMul(LHS, C2)) {
2046 if (X == RHS) // X*C + X --> X * (C+1)
2047 return BinaryOperator::createMul(RHS, AddOne(C2));
2049 // X*C1 + X*C2 --> X * (C1+C2)
2051 if (X == dyn_castFoldableMul(RHS, C1))
2052 return BinaryOperator::createMul(X, Add(C1, C2));
2055 // X + X*C --> X * (C+1)
2056 if (dyn_castFoldableMul(RHS, C2) == LHS)
2057 return BinaryOperator::createMul(LHS, AddOne(C2));
2059 // X + ~X --> -1 since ~X = -X-1
2060 if (dyn_castNotVal(LHS) == RHS || dyn_castNotVal(RHS) == LHS)
2061 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
2064 // (A & C1)+(B & C2) --> (A & C1)|(B & C2) iff C1&C2 == 0
2065 if (match(RHS, m_And(m_Value(), m_ConstantInt(C2))))
2066 if (Instruction *R = AssociativeOpt(I, AddMaskingAnd(C2)))
2069 if (ConstantInt *CRHS = dyn_cast<ConstantInt>(RHS)) {
2071 if (match(LHS, m_Not(m_Value(X)))) // ~X + C --> (C-1) - X
2072 return BinaryOperator::createSub(SubOne(CRHS), X);
2074 // (X & FF00) + xx00 -> (X+xx00) & FF00
2075 if (LHS->hasOneUse() && match(LHS, m_And(m_Value(X), m_ConstantInt(C2)))) {
2076 Constant *Anded = And(CRHS, C2);
2077 if (Anded == CRHS) {
2078 // See if all bits from the first bit set in the Add RHS up are included
2079 // in the mask. First, get the rightmost bit.
2080 const APInt& AddRHSV = CRHS->getValue();
2082 // Form a mask of all bits from the lowest bit added through the top.
2083 APInt AddRHSHighBits(~((AddRHSV & -AddRHSV)-1));
2085 // See if the and mask includes all of these bits.
2086 APInt AddRHSHighBitsAnd(AddRHSHighBits & C2->getValue());
2088 if (AddRHSHighBits == AddRHSHighBitsAnd) {
2089 // Okay, the xform is safe. Insert the new add pronto.
2090 Value *NewAdd = InsertNewInstBefore(BinaryOperator::createAdd(X, CRHS,
2091 LHS->getName()), I);
2092 return BinaryOperator::createAnd(NewAdd, C2);
2097 // Try to fold constant add into select arguments.
2098 if (SelectInst *SI = dyn_cast<SelectInst>(LHS))
2099 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2103 // add (cast *A to intptrtype) B ->
2104 // cast (GEP (cast *A to sbyte*) B) ->
2107 CastInst *CI = dyn_cast<CastInst>(LHS);
2110 CI = dyn_cast<CastInst>(RHS);
2113 if (CI && CI->getType()->isSized() &&
2114 (CI->getType()->getPrimitiveSizeInBits() ==
2115 TD->getIntPtrType()->getPrimitiveSizeInBits())
2116 && isa<PointerType>(CI->getOperand(0)->getType())) {
2117 Value *I2 = InsertCastBefore(Instruction::BitCast, CI->getOperand(0),
2118 PointerType::get(Type::Int8Ty), I);
2119 I2 = InsertNewInstBefore(new GetElementPtrInst(I2, Other, "ctg2"), I);
2120 return new PtrToIntInst(I2, CI->getType());
2124 return Changed ? &I : 0;
2127 // isSignBit - Return true if the value represented by the constant only has the
2128 // highest order bit set.
2129 static bool isSignBit(ConstantInt *CI) {
2130 uint32_t NumBits = CI->getType()->getPrimitiveSizeInBits();
2131 return CI->getValue() == APInt::getSignBit(NumBits);
2134 Instruction *InstCombiner::visitSub(BinaryOperator &I) {
2135 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2137 if (Op0 == Op1) // sub X, X -> 0
2138 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2140 // If this is a 'B = x-(-A)', change to B = x+A...
2141 if (Value *V = dyn_castNegVal(Op1))
2142 return BinaryOperator::createAdd(Op0, V);
2144 if (isa<UndefValue>(Op0))
2145 return ReplaceInstUsesWith(I, Op0); // undef - X -> undef
2146 if (isa<UndefValue>(Op1))
2147 return ReplaceInstUsesWith(I, Op1); // X - undef -> undef
2149 if (ConstantInt *C = dyn_cast<ConstantInt>(Op0)) {
2150 // Replace (-1 - A) with (~A)...
2151 if (C->isAllOnesValue())
2152 return BinaryOperator::createNot(Op1);
2154 // C - ~X == X + (1+C)
2156 if (match(Op1, m_Not(m_Value(X))))
2157 return BinaryOperator::createAdd(X, AddOne(C));
2159 // -(X >>u 31) -> (X >>s 31)
2160 // -(X >>s 31) -> (X >>u 31)
2162 if (BinaryOperator *SI = dyn_cast<BinaryOperator>(Op1))
2163 if (SI->getOpcode() == Instruction::LShr) {
2164 if (ConstantInt *CU = dyn_cast<ConstantInt>(SI->getOperand(1))) {
2165 // Check to see if we are shifting out everything but the sign bit.
2166 if (CU->getLimitedValue(SI->getType()->getPrimitiveSizeInBits()) ==
2167 SI->getType()->getPrimitiveSizeInBits()-1) {
2168 // Ok, the transformation is safe. Insert AShr.
2169 return BinaryOperator::create(Instruction::AShr,
2170 SI->getOperand(0), CU, SI->getName());
2174 else if (SI->getOpcode() == Instruction::AShr) {
2175 if (ConstantInt *CU = dyn_cast<ConstantInt>(SI->getOperand(1))) {
2176 // Check to see if we are shifting out everything but the sign bit.
2177 if (CU->getLimitedValue(SI->getType()->getPrimitiveSizeInBits()) ==
2178 SI->getType()->getPrimitiveSizeInBits()-1) {
2179 // Ok, the transformation is safe. Insert LShr.
2180 return BinaryOperator::createLShr(
2181 SI->getOperand(0), CU, SI->getName());
2187 // Try to fold constant sub into select arguments.
2188 if (SelectInst *SI = dyn_cast<SelectInst>(Op1))
2189 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2192 if (isa<PHINode>(Op0))
2193 if (Instruction *NV = FoldOpIntoPhi(I))
2197 if (BinaryOperator *Op1I = dyn_cast<BinaryOperator>(Op1)) {
2198 if (Op1I->getOpcode() == Instruction::Add &&
2199 !Op0->getType()->isFPOrFPVector()) {
2200 if (Op1I->getOperand(0) == Op0) // X-(X+Y) == -Y
2201 return BinaryOperator::createNeg(Op1I->getOperand(1), I.getName());
2202 else if (Op1I->getOperand(1) == Op0) // X-(Y+X) == -Y
2203 return BinaryOperator::createNeg(Op1I->getOperand(0), I.getName());
2204 else if (ConstantInt *CI1 = dyn_cast<ConstantInt>(I.getOperand(0))) {
2205 if (ConstantInt *CI2 = dyn_cast<ConstantInt>(Op1I->getOperand(1)))
2206 // C1-(X+C2) --> (C1-C2)-X
2207 return BinaryOperator::createSub(Subtract(CI1, CI2),
2208 Op1I->getOperand(0));
2212 if (Op1I->hasOneUse()) {
2213 // Replace (x - (y - z)) with (x + (z - y)) if the (y - z) subexpression
2214 // is not used by anyone else...
2216 if (Op1I->getOpcode() == Instruction::Sub &&
2217 !Op1I->getType()->isFPOrFPVector()) {
2218 // Swap the two operands of the subexpr...
2219 Value *IIOp0 = Op1I->getOperand(0), *IIOp1 = Op1I->getOperand(1);
2220 Op1I->setOperand(0, IIOp1);
2221 Op1I->setOperand(1, IIOp0);
2223 // Create the new top level add instruction...
2224 return BinaryOperator::createAdd(Op0, Op1);
2227 // Replace (A - (A & B)) with (A & ~B) if this is the only use of (A&B)...
2229 if (Op1I->getOpcode() == Instruction::And &&
2230 (Op1I->getOperand(0) == Op0 || Op1I->getOperand(1) == Op0)) {
2231 Value *OtherOp = Op1I->getOperand(Op1I->getOperand(0) == Op0);
2234 InsertNewInstBefore(BinaryOperator::createNot(OtherOp, "B.not"), I);
2235 return BinaryOperator::createAnd(Op0, NewNot);
2238 // 0 - (X sdiv C) -> (X sdiv -C)
2239 if (Op1I->getOpcode() == Instruction::SDiv)
2240 if (ConstantInt *CSI = dyn_cast<ConstantInt>(Op0))
2242 if (Constant *DivRHS = dyn_cast<Constant>(Op1I->getOperand(1)))
2243 return BinaryOperator::createSDiv(Op1I->getOperand(0),
2244 ConstantExpr::getNeg(DivRHS));
2246 // X - X*C --> X * (1-C)
2247 ConstantInt *C2 = 0;
2248 if (dyn_castFoldableMul(Op1I, C2) == Op0) {
2249 Constant *CP1 = Subtract(ConstantInt::get(I.getType(), 1), C2);
2250 return BinaryOperator::createMul(Op0, CP1);
2255 if (!Op0->getType()->isFPOrFPVector())
2256 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0))
2257 if (Op0I->getOpcode() == Instruction::Add) {
2258 if (Op0I->getOperand(0) == Op1) // (Y+X)-Y == X
2259 return ReplaceInstUsesWith(I, Op0I->getOperand(1));
2260 else if (Op0I->getOperand(1) == Op1) // (X+Y)-Y == X
2261 return ReplaceInstUsesWith(I, Op0I->getOperand(0));
2262 } else if (Op0I->getOpcode() == Instruction::Sub) {
2263 if (Op0I->getOperand(0) == Op1) // (X-Y)-X == -Y
2264 return BinaryOperator::createNeg(Op0I->getOperand(1), I.getName());
2268 if (Value *X = dyn_castFoldableMul(Op0, C1)) {
2269 if (X == Op1) // X*C - X --> X * (C-1)
2270 return BinaryOperator::createMul(Op1, SubOne(C1));
2272 ConstantInt *C2; // X*C1 - X*C2 -> X * (C1-C2)
2273 if (X == dyn_castFoldableMul(Op1, C2))
2274 return BinaryOperator::createMul(Op1, Subtract(C1, C2));
2279 /// isSignBitCheck - Given an exploded icmp instruction, return true if the
2280 /// comparison only checks the sign bit. If it only checks the sign bit, set
2281 /// TrueIfSigned if the result of the comparison is true when the input value is
2283 static bool isSignBitCheck(ICmpInst::Predicate pred, ConstantInt *RHS,
2284 bool &TrueIfSigned) {
2286 case ICmpInst::ICMP_SLT: // True if LHS s< 0
2287 TrueIfSigned = true;
2288 return RHS->isZero();
2289 case ICmpInst::ICMP_SLE: // True if LHS s<= RHS and RHS == -1
2290 TrueIfSigned = true;
2291 return RHS->isAllOnesValue();
2292 case ICmpInst::ICMP_SGT: // True if LHS s> -1
2293 TrueIfSigned = false;
2294 return RHS->isAllOnesValue();
2295 case ICmpInst::ICMP_UGT:
2296 // True if LHS u> RHS and RHS == high-bit-mask - 1
2297 TrueIfSigned = true;
2298 return RHS->getValue() ==
2299 APInt::getSignedMaxValue(RHS->getType()->getPrimitiveSizeInBits());
2300 case ICmpInst::ICMP_UGE:
2301 // True if LHS u>= RHS and RHS == high-bit-mask (2^7, 2^15, 2^31, etc)
2302 TrueIfSigned = true;
2303 return RHS->getValue() ==
2304 APInt::getSignBit(RHS->getType()->getPrimitiveSizeInBits());
2310 Instruction *InstCombiner::visitMul(BinaryOperator &I) {
2311 bool Changed = SimplifyCommutative(I);
2312 Value *Op0 = I.getOperand(0);
2314 if (isa<UndefValue>(I.getOperand(1))) // undef * X -> 0
2315 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2317 // Simplify mul instructions with a constant RHS...
2318 if (Constant *Op1 = dyn_cast<Constant>(I.getOperand(1))) {
2319 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
2321 // ((X << C1)*C2) == (X * (C2 << C1))
2322 if (BinaryOperator *SI = dyn_cast<BinaryOperator>(Op0))
2323 if (SI->getOpcode() == Instruction::Shl)
2324 if (Constant *ShOp = dyn_cast<Constant>(SI->getOperand(1)))
2325 return BinaryOperator::createMul(SI->getOperand(0),
2326 ConstantExpr::getShl(CI, ShOp));
2329 return ReplaceInstUsesWith(I, Op1); // X * 0 == 0
2330 if (CI->equalsInt(1)) // X * 1 == X
2331 return ReplaceInstUsesWith(I, Op0);
2332 if (CI->isAllOnesValue()) // X * -1 == 0 - X
2333 return BinaryOperator::createNeg(Op0, I.getName());
2335 const APInt& Val = cast<ConstantInt>(CI)->getValue();
2336 if (Val.isPowerOf2()) { // Replace X*(2^C) with X << C
2337 return BinaryOperator::createShl(Op0,
2338 ConstantInt::get(Op0->getType(), Val.logBase2()));
2340 } else if (ConstantFP *Op1F = dyn_cast<ConstantFP>(Op1)) {
2341 if (Op1F->isNullValue())
2342 return ReplaceInstUsesWith(I, Op1);
2344 // "In IEEE floating point, x*1 is not equivalent to x for nans. However,
2345 // ANSI says we can drop signals, so we can do this anyway." (from GCC)
2346 if (Op1F->getValue() == 1.0)
2347 return ReplaceInstUsesWith(I, Op0); // Eliminate 'mul double %X, 1.0'
2350 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0))
2351 if (Op0I->getOpcode() == Instruction::Add && Op0I->hasOneUse() &&
2352 isa<ConstantInt>(Op0I->getOperand(1))) {
2353 // Canonicalize (X+C1)*C2 -> X*C2+C1*C2.
2354 Instruction *Add = BinaryOperator::createMul(Op0I->getOperand(0),
2356 InsertNewInstBefore(Add, I);
2357 Value *C1C2 = ConstantExpr::getMul(Op1,
2358 cast<Constant>(Op0I->getOperand(1)));
2359 return BinaryOperator::createAdd(Add, C1C2);
2363 // Try to fold constant mul into select arguments.
2364 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
2365 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2368 if (isa<PHINode>(Op0))
2369 if (Instruction *NV = FoldOpIntoPhi(I))
2373 if (Value *Op0v = dyn_castNegVal(Op0)) // -X * -Y = X*Y
2374 if (Value *Op1v = dyn_castNegVal(I.getOperand(1)))
2375 return BinaryOperator::createMul(Op0v, Op1v);
2377 // If one of the operands of the multiply is a cast from a boolean value, then
2378 // we know the bool is either zero or one, so this is a 'masking' multiply.
2379 // See if we can simplify things based on how the boolean was originally
2381 CastInst *BoolCast = 0;
2382 if (ZExtInst *CI = dyn_cast<ZExtInst>(I.getOperand(0)))
2383 if (CI->getOperand(0)->getType() == Type::Int1Ty)
2386 if (ZExtInst *CI = dyn_cast<ZExtInst>(I.getOperand(1)))
2387 if (CI->getOperand(0)->getType() == Type::Int1Ty)
2390 if (ICmpInst *SCI = dyn_cast<ICmpInst>(BoolCast->getOperand(0))) {
2391 Value *SCIOp0 = SCI->getOperand(0), *SCIOp1 = SCI->getOperand(1);
2392 const Type *SCOpTy = SCIOp0->getType();
2395 // If the icmp is true iff the sign bit of X is set, then convert this
2396 // multiply into a shift/and combination.
2397 if (isa<ConstantInt>(SCIOp1) &&
2398 isSignBitCheck(SCI->getPredicate(), cast<ConstantInt>(SCIOp1), TIS) &&
2400 // Shift the X value right to turn it into "all signbits".
2401 Constant *Amt = ConstantInt::get(SCIOp0->getType(),
2402 SCOpTy->getPrimitiveSizeInBits()-1);
2404 InsertNewInstBefore(
2405 BinaryOperator::create(Instruction::AShr, SCIOp0, Amt,
2406 BoolCast->getOperand(0)->getName()+
2409 // If the multiply type is not the same as the source type, sign extend
2410 // or truncate to the multiply type.
2411 if (I.getType() != V->getType()) {
2412 uint32_t SrcBits = V->getType()->getPrimitiveSizeInBits();
2413 uint32_t DstBits = I.getType()->getPrimitiveSizeInBits();
2414 Instruction::CastOps opcode =
2415 (SrcBits == DstBits ? Instruction::BitCast :
2416 (SrcBits < DstBits ? Instruction::SExt : Instruction::Trunc));
2417 V = InsertCastBefore(opcode, V, I.getType(), I);
2420 Value *OtherOp = Op0 == BoolCast ? I.getOperand(1) : Op0;
2421 return BinaryOperator::createAnd(V, OtherOp);
2426 return Changed ? &I : 0;
2429 /// This function implements the transforms on div instructions that work
2430 /// regardless of the kind of div instruction it is (udiv, sdiv, or fdiv). It is
2431 /// used by the visitors to those instructions.
2432 /// @brief Transforms common to all three div instructions
2433 Instruction *InstCombiner::commonDivTransforms(BinaryOperator &I) {
2434 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2437 if (isa<UndefValue>(Op0))
2438 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2440 // X / undef -> undef
2441 if (isa<UndefValue>(Op1))
2442 return ReplaceInstUsesWith(I, Op1);
2444 // Handle cases involving: div X, (select Cond, Y, Z)
2445 if (SelectInst *SI = dyn_cast<SelectInst>(Op1)) {
2446 // div X, (Cond ? 0 : Y) -> div X, Y. If the div and the select are in the
2447 // same basic block, then we replace the select with Y, and the condition
2448 // of the select with false (if the cond value is in the same BB). If the
2449 // select has uses other than the div, this allows them to be simplified
2450 // also. Note that div X, Y is just as good as div X, 0 (undef)
2451 if (Constant *ST = dyn_cast<Constant>(SI->getOperand(1)))
2452 if (ST->isNullValue()) {
2453 Instruction *CondI = dyn_cast<Instruction>(SI->getOperand(0));
2454 if (CondI && CondI->getParent() == I.getParent())
2455 UpdateValueUsesWith(CondI, ConstantInt::getFalse());
2456 else if (I.getParent() != SI->getParent() || SI->hasOneUse())
2457 I.setOperand(1, SI->getOperand(2));
2459 UpdateValueUsesWith(SI, SI->getOperand(2));
2463 // Likewise for: div X, (Cond ? Y : 0) -> div X, Y
2464 if (Constant *ST = dyn_cast<Constant>(SI->getOperand(2)))
2465 if (ST->isNullValue()) {
2466 Instruction *CondI = dyn_cast<Instruction>(SI->getOperand(0));
2467 if (CondI && CondI->getParent() == I.getParent())
2468 UpdateValueUsesWith(CondI, ConstantInt::getTrue());
2469 else if (I.getParent() != SI->getParent() || SI->hasOneUse())
2470 I.setOperand(1, SI->getOperand(1));
2472 UpdateValueUsesWith(SI, SI->getOperand(1));
2480 /// This function implements the transforms common to both integer division
2481 /// instructions (udiv and sdiv). It is called by the visitors to those integer
2482 /// division instructions.
2483 /// @brief Common integer divide transforms
2484 Instruction *InstCombiner::commonIDivTransforms(BinaryOperator &I) {
2485 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2487 if (Instruction *Common = commonDivTransforms(I))
2490 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
2492 if (RHS->equalsInt(1))
2493 return ReplaceInstUsesWith(I, Op0);
2495 // (X / C1) / C2 -> X / (C1*C2)
2496 if (Instruction *LHS = dyn_cast<Instruction>(Op0))
2497 if (Instruction::BinaryOps(LHS->getOpcode()) == I.getOpcode())
2498 if (ConstantInt *LHSRHS = dyn_cast<ConstantInt>(LHS->getOperand(1))) {
2499 return BinaryOperator::create(I.getOpcode(), LHS->getOperand(0),
2500 Multiply(RHS, LHSRHS));
2503 if (!RHS->isZero()) { // avoid X udiv 0
2504 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
2505 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2507 if (isa<PHINode>(Op0))
2508 if (Instruction *NV = FoldOpIntoPhi(I))
2513 // 0 / X == 0, we don't need to preserve faults!
2514 if (ConstantInt *LHS = dyn_cast<ConstantInt>(Op0))
2515 if (LHS->equalsInt(0))
2516 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2521 Instruction *InstCombiner::visitUDiv(BinaryOperator &I) {
2522 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2524 // Handle the integer div common cases
2525 if (Instruction *Common = commonIDivTransforms(I))
2528 // X udiv C^2 -> X >> C
2529 // Check to see if this is an unsigned division with an exact power of 2,
2530 // if so, convert to a right shift.
2531 if (ConstantInt *C = dyn_cast<ConstantInt>(Op1)) {
2532 if (C->getValue().isPowerOf2()) // 0 not included in isPowerOf2
2533 return BinaryOperator::createLShr(Op0,
2534 ConstantInt::get(Op0->getType(), C->getValue().logBase2()));
2537 // X udiv (C1 << N), where C1 is "1<<C2" --> X >> (N+C2)
2538 if (BinaryOperator *RHSI = dyn_cast<BinaryOperator>(I.getOperand(1))) {
2539 if (RHSI->getOpcode() == Instruction::Shl &&
2540 isa<ConstantInt>(RHSI->getOperand(0))) {
2541 const APInt& C1 = cast<ConstantInt>(RHSI->getOperand(0))->getValue();
2542 if (C1.isPowerOf2()) {
2543 Value *N = RHSI->getOperand(1);
2544 const Type *NTy = N->getType();
2545 if (uint32_t C2 = C1.logBase2()) {
2546 Constant *C2V = ConstantInt::get(NTy, C2);
2547 N = InsertNewInstBefore(BinaryOperator::createAdd(N, C2V, "tmp"), I);
2549 return BinaryOperator::createLShr(Op0, N);
2554 // udiv X, (Select Cond, C1, C2) --> Select Cond, (shr X, C1), (shr X, C2)
2555 // where C1&C2 are powers of two.
2556 if (SelectInst *SI = dyn_cast<SelectInst>(Op1))
2557 if (ConstantInt *STO = dyn_cast<ConstantInt>(SI->getOperand(1)))
2558 if (ConstantInt *SFO = dyn_cast<ConstantInt>(SI->getOperand(2))) {
2559 const APInt &TVA = STO->getValue(), &FVA = SFO->getValue();
2560 if (TVA.isPowerOf2() && FVA.isPowerOf2()) {
2561 // Compute the shift amounts
2562 uint32_t TSA = TVA.logBase2(), FSA = FVA.logBase2();
2563 // Construct the "on true" case of the select
2564 Constant *TC = ConstantInt::get(Op0->getType(), TSA);
2565 Instruction *TSI = BinaryOperator::createLShr(
2566 Op0, TC, SI->getName()+".t");
2567 TSI = InsertNewInstBefore(TSI, I);
2569 // Construct the "on false" case of the select
2570 Constant *FC = ConstantInt::get(Op0->getType(), FSA);
2571 Instruction *FSI = BinaryOperator::createLShr(
2572 Op0, FC, SI->getName()+".f");
2573 FSI = InsertNewInstBefore(FSI, I);
2575 // construct the select instruction and return it.
2576 return new SelectInst(SI->getOperand(0), TSI, FSI, SI->getName());
2582 Instruction *InstCombiner::visitSDiv(BinaryOperator &I) {
2583 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2585 // Handle the integer div common cases
2586 if (Instruction *Common = commonIDivTransforms(I))
2589 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
2591 if (RHS->isAllOnesValue())
2592 return BinaryOperator::createNeg(Op0);
2595 if (Value *LHSNeg = dyn_castNegVal(Op0))
2596 return BinaryOperator::createSDiv(LHSNeg, ConstantExpr::getNeg(RHS));
2599 // If the sign bits of both operands are zero (i.e. we can prove they are
2600 // unsigned inputs), turn this into a udiv.
2601 if (I.getType()->isInteger()) {
2602 APInt Mask(APInt::getSignBit(I.getType()->getPrimitiveSizeInBits()));
2603 if (MaskedValueIsZero(Op1, Mask) && MaskedValueIsZero(Op0, Mask)) {
2604 return BinaryOperator::createUDiv(Op0, Op1, I.getName());
2611 Instruction *InstCombiner::visitFDiv(BinaryOperator &I) {
2612 return commonDivTransforms(I);
2615 /// GetFactor - If we can prove that the specified value is at least a multiple
2616 /// of some factor, return that factor.
2617 static Constant *GetFactor(Value *V) {
2618 if (ConstantInt *CI = dyn_cast<ConstantInt>(V))
2621 // Unless we can be tricky, we know this is a multiple of 1.
2622 Constant *Result = ConstantInt::get(V->getType(), 1);
2624 Instruction *I = dyn_cast<Instruction>(V);
2625 if (!I) return Result;
2627 if (I->getOpcode() == Instruction::Mul) {
2628 // Handle multiplies by a constant, etc.
2629 return ConstantExpr::getMul(GetFactor(I->getOperand(0)),
2630 GetFactor(I->getOperand(1)));
2631 } else if (I->getOpcode() == Instruction::Shl) {
2632 // (X<<C) -> X * (1 << C)
2633 if (Constant *ShRHS = dyn_cast<Constant>(I->getOperand(1))) {
2634 ShRHS = ConstantExpr::getShl(Result, ShRHS);
2635 return ConstantExpr::getMul(GetFactor(I->getOperand(0)), ShRHS);
2637 } else if (I->getOpcode() == Instruction::And) {
2638 if (ConstantInt *RHS = dyn_cast<ConstantInt>(I->getOperand(1))) {
2639 // X & 0xFFF0 is known to be a multiple of 16.
2640 uint32_t Zeros = RHS->getValue().countTrailingZeros();
2641 if (Zeros != V->getType()->getPrimitiveSizeInBits())
2642 return ConstantExpr::getShl(Result,
2643 ConstantInt::get(Result->getType(), Zeros));
2645 } else if (CastInst *CI = dyn_cast<CastInst>(I)) {
2646 // Only handle int->int casts.
2647 if (!CI->isIntegerCast())
2649 Value *Op = CI->getOperand(0);
2650 return ConstantExpr::getCast(CI->getOpcode(), GetFactor(Op), V->getType());
2655 /// This function implements the transforms on rem instructions that work
2656 /// regardless of the kind of rem instruction it is (urem, srem, or frem). It
2657 /// is used by the visitors to those instructions.
2658 /// @brief Transforms common to all three rem instructions
2659 Instruction *InstCombiner::commonRemTransforms(BinaryOperator &I) {
2660 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2662 // 0 % X == 0, we don't need to preserve faults!
2663 if (Constant *LHS = dyn_cast<Constant>(Op0))
2664 if (LHS->isNullValue())
2665 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2667 if (isa<UndefValue>(Op0)) // undef % X -> 0
2668 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2669 if (isa<UndefValue>(Op1))
2670 return ReplaceInstUsesWith(I, Op1); // X % undef -> undef
2672 // Handle cases involving: rem X, (select Cond, Y, Z)
2673 if (SelectInst *SI = dyn_cast<SelectInst>(Op1)) {
2674 // rem X, (Cond ? 0 : Y) -> rem X, Y. If the rem and the select are in
2675 // the same basic block, then we replace the select with Y, and the
2676 // condition of the select with false (if the cond value is in the same
2677 // BB). If the select has uses other than the div, this allows them to be
2679 if (Constant *ST = dyn_cast<Constant>(SI->getOperand(1)))
2680 if (ST->isNullValue()) {
2681 Instruction *CondI = dyn_cast<Instruction>(SI->getOperand(0));
2682 if (CondI && CondI->getParent() == I.getParent())
2683 UpdateValueUsesWith(CondI, ConstantInt::getFalse());
2684 else if (I.getParent() != SI->getParent() || SI->hasOneUse())
2685 I.setOperand(1, SI->getOperand(2));
2687 UpdateValueUsesWith(SI, SI->getOperand(2));
2690 // Likewise for: rem X, (Cond ? Y : 0) -> rem X, Y
2691 if (Constant *ST = dyn_cast<Constant>(SI->getOperand(2)))
2692 if (ST->isNullValue()) {
2693 Instruction *CondI = dyn_cast<Instruction>(SI->getOperand(0));
2694 if (CondI && CondI->getParent() == I.getParent())
2695 UpdateValueUsesWith(CondI, ConstantInt::getTrue());
2696 else if (I.getParent() != SI->getParent() || SI->hasOneUse())
2697 I.setOperand(1, SI->getOperand(1));
2699 UpdateValueUsesWith(SI, SI->getOperand(1));
2707 /// This function implements the transforms common to both integer remainder
2708 /// instructions (urem and srem). It is called by the visitors to those integer
2709 /// remainder instructions.
2710 /// @brief Common integer remainder transforms
2711 Instruction *InstCombiner::commonIRemTransforms(BinaryOperator &I) {
2712 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2714 if (Instruction *common = commonRemTransforms(I))
2717 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
2718 // X % 0 == undef, we don't need to preserve faults!
2719 if (RHS->equalsInt(0))
2720 return ReplaceInstUsesWith(I, UndefValue::get(I.getType()));
2722 if (RHS->equalsInt(1)) // X % 1 == 0
2723 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2725 if (Instruction *Op0I = dyn_cast<Instruction>(Op0)) {
2726 if (SelectInst *SI = dyn_cast<SelectInst>(Op0I)) {
2727 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2729 } else if (isa<PHINode>(Op0I)) {
2730 if (Instruction *NV = FoldOpIntoPhi(I))
2733 // (X * C1) % C2 --> 0 iff C1 % C2 == 0
2734 if (ConstantExpr::getSRem(GetFactor(Op0I), RHS)->isNullValue())
2735 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2742 Instruction *InstCombiner::visitURem(BinaryOperator &I) {
2743 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2745 if (Instruction *common = commonIRemTransforms(I))
2748 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
2749 // X urem C^2 -> X and C
2750 // Check to see if this is an unsigned remainder with an exact power of 2,
2751 // if so, convert to a bitwise and.
2752 if (ConstantInt *C = dyn_cast<ConstantInt>(RHS))
2753 if (C->getValue().isPowerOf2())
2754 return BinaryOperator::createAnd(Op0, SubOne(C));
2757 if (Instruction *RHSI = dyn_cast<Instruction>(I.getOperand(1))) {
2758 // Turn A % (C << N), where C is 2^k, into A & ((C << N)-1)
2759 if (RHSI->getOpcode() == Instruction::Shl &&
2760 isa<ConstantInt>(RHSI->getOperand(0))) {
2761 if (cast<ConstantInt>(RHSI->getOperand(0))->getValue().isPowerOf2()) {
2762 Constant *N1 = ConstantInt::getAllOnesValue(I.getType());
2763 Value *Add = InsertNewInstBefore(BinaryOperator::createAdd(RHSI, N1,
2765 return BinaryOperator::createAnd(Op0, Add);
2770 // urem X, (select Cond, 2^C1, 2^C2) --> select Cond, (and X, C1), (and X, C2)
2771 // where C1&C2 are powers of two.
2772 if (SelectInst *SI = dyn_cast<SelectInst>(Op1)) {
2773 if (ConstantInt *STO = dyn_cast<ConstantInt>(SI->getOperand(1)))
2774 if (ConstantInt *SFO = dyn_cast<ConstantInt>(SI->getOperand(2))) {
2775 // STO == 0 and SFO == 0 handled above.
2776 if ((STO->getValue().isPowerOf2()) &&
2777 (SFO->getValue().isPowerOf2())) {
2778 Value *TrueAnd = InsertNewInstBefore(
2779 BinaryOperator::createAnd(Op0, SubOne(STO), SI->getName()+".t"), I);
2780 Value *FalseAnd = InsertNewInstBefore(
2781 BinaryOperator::createAnd(Op0, SubOne(SFO), SI->getName()+".f"), I);
2782 return new SelectInst(SI->getOperand(0), TrueAnd, FalseAnd);
2790 Instruction *InstCombiner::visitSRem(BinaryOperator &I) {
2791 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2793 if (Instruction *common = commonIRemTransforms(I))
2796 if (Value *RHSNeg = dyn_castNegVal(Op1))
2797 if (!isa<ConstantInt>(RHSNeg) ||
2798 cast<ConstantInt>(RHSNeg)->getValue().isStrictlyPositive()) {
2800 AddUsesToWorkList(I);
2801 I.setOperand(1, RHSNeg);
2805 // If the top bits of both operands are zero (i.e. we can prove they are
2806 // unsigned inputs), turn this into a urem.
2807 APInt Mask(APInt::getSignBit(I.getType()->getPrimitiveSizeInBits()));
2808 if (MaskedValueIsZero(Op1, Mask) && MaskedValueIsZero(Op0, Mask)) {
2809 // X srem Y -> X urem Y, iff X and Y don't have sign bit set
2810 return BinaryOperator::createURem(Op0, Op1, I.getName());
2816 Instruction *InstCombiner::visitFRem(BinaryOperator &I) {
2817 return commonRemTransforms(I);
2820 // isMaxValueMinusOne - return true if this is Max-1
2821 static bool isMaxValueMinusOne(const ConstantInt *C, bool isSigned) {
2822 uint32_t TypeBits = C->getType()->getPrimitiveSizeInBits();
2824 return C->getValue() == APInt::getAllOnesValue(TypeBits) - 1;
2825 return C->getValue() == APInt::getSignedMaxValue(TypeBits)-1;
2828 // isMinValuePlusOne - return true if this is Min+1
2829 static bool isMinValuePlusOne(const ConstantInt *C, bool isSigned) {
2831 return C->getValue() == 1; // unsigned
2833 // Calculate 1111111111000000000000
2834 uint32_t TypeBits = C->getType()->getPrimitiveSizeInBits();
2835 return C->getValue() == APInt::getSignedMinValue(TypeBits)+1;
2838 // isOneBitSet - Return true if there is exactly one bit set in the specified
2840 static bool isOneBitSet(const ConstantInt *CI) {
2841 return CI->getValue().isPowerOf2();
2844 // isHighOnes - Return true if the constant is of the form 1+0+.
2845 // This is the same as lowones(~X).
2846 static bool isHighOnes(const ConstantInt *CI) {
2847 return (~CI->getValue() + 1).isPowerOf2();
2850 /// getICmpCode - Encode a icmp predicate into a three bit mask. These bits
2851 /// are carefully arranged to allow folding of expressions such as:
2853 /// (A < B) | (A > B) --> (A != B)
2855 /// Note that this is only valid if the first and second predicates have the
2856 /// same sign. Is illegal to do: (A u< B) | (A s> B)
2858 /// Three bits are used to represent the condition, as follows:
2863 /// <=> Value Definition
2864 /// 000 0 Always false
2871 /// 111 7 Always true
2873 static unsigned getICmpCode(const ICmpInst *ICI) {
2874 switch (ICI->getPredicate()) {
2876 case ICmpInst::ICMP_UGT: return 1; // 001
2877 case ICmpInst::ICMP_SGT: return 1; // 001
2878 case ICmpInst::ICMP_EQ: return 2; // 010
2879 case ICmpInst::ICMP_UGE: return 3; // 011
2880 case ICmpInst::ICMP_SGE: return 3; // 011
2881 case ICmpInst::ICMP_ULT: return 4; // 100
2882 case ICmpInst::ICMP_SLT: return 4; // 100
2883 case ICmpInst::ICMP_NE: return 5; // 101
2884 case ICmpInst::ICMP_ULE: return 6; // 110
2885 case ICmpInst::ICMP_SLE: return 6; // 110
2888 assert(0 && "Invalid ICmp predicate!");
2893 /// getICmpValue - This is the complement of getICmpCode, which turns an
2894 /// opcode and two operands into either a constant true or false, or a brand
2895 /// new /// ICmp instruction. The sign is passed in to determine which kind
2896 /// of predicate to use in new icmp instructions.
2897 static Value *getICmpValue(bool sign, unsigned code, Value *LHS, Value *RHS) {
2899 default: assert(0 && "Illegal ICmp code!");
2900 case 0: return ConstantInt::getFalse();
2903 return new ICmpInst(ICmpInst::ICMP_SGT, LHS, RHS);
2905 return new ICmpInst(ICmpInst::ICMP_UGT, LHS, RHS);
2906 case 2: return new ICmpInst(ICmpInst::ICMP_EQ, LHS, RHS);
2909 return new ICmpInst(ICmpInst::ICMP_SGE, LHS, RHS);
2911 return new ICmpInst(ICmpInst::ICMP_UGE, LHS, RHS);
2914 return new ICmpInst(ICmpInst::ICMP_SLT, LHS, RHS);
2916 return new ICmpInst(ICmpInst::ICMP_ULT, LHS, RHS);
2917 case 5: return new ICmpInst(ICmpInst::ICMP_NE, LHS, RHS);
2920 return new ICmpInst(ICmpInst::ICMP_SLE, LHS, RHS);
2922 return new ICmpInst(ICmpInst::ICMP_ULE, LHS, RHS);
2923 case 7: return ConstantInt::getTrue();
2927 static bool PredicatesFoldable(ICmpInst::Predicate p1, ICmpInst::Predicate p2) {
2928 return (ICmpInst::isSignedPredicate(p1) == ICmpInst::isSignedPredicate(p2)) ||
2929 (ICmpInst::isSignedPredicate(p1) &&
2930 (p2 == ICmpInst::ICMP_EQ || p2 == ICmpInst::ICMP_NE)) ||
2931 (ICmpInst::isSignedPredicate(p2) &&
2932 (p1 == ICmpInst::ICMP_EQ || p1 == ICmpInst::ICMP_NE));
2936 // FoldICmpLogical - Implements (icmp1 A, B) & (icmp2 A, B) --> (icmp3 A, B)
2937 struct FoldICmpLogical {
2940 ICmpInst::Predicate pred;
2941 FoldICmpLogical(InstCombiner &ic, ICmpInst *ICI)
2942 : IC(ic), LHS(ICI->getOperand(0)), RHS(ICI->getOperand(1)),
2943 pred(ICI->getPredicate()) {}
2944 bool shouldApply(Value *V) const {
2945 if (ICmpInst *ICI = dyn_cast<ICmpInst>(V))
2946 if (PredicatesFoldable(pred, ICI->getPredicate()))
2947 return (ICI->getOperand(0) == LHS && ICI->getOperand(1) == RHS ||
2948 ICI->getOperand(0) == RHS && ICI->getOperand(1) == LHS);
2951 Instruction *apply(Instruction &Log) const {
2952 ICmpInst *ICI = cast<ICmpInst>(Log.getOperand(0));
2953 if (ICI->getOperand(0) != LHS) {
2954 assert(ICI->getOperand(1) == LHS);
2955 ICI->swapOperands(); // Swap the LHS and RHS of the ICmp
2958 ICmpInst *RHSICI = cast<ICmpInst>(Log.getOperand(1));
2959 unsigned LHSCode = getICmpCode(ICI);
2960 unsigned RHSCode = getICmpCode(RHSICI);
2962 switch (Log.getOpcode()) {
2963 case Instruction::And: Code = LHSCode & RHSCode; break;
2964 case Instruction::Or: Code = LHSCode | RHSCode; break;
2965 case Instruction::Xor: Code = LHSCode ^ RHSCode; break;
2966 default: assert(0 && "Illegal logical opcode!"); return 0;
2969 bool isSigned = ICmpInst::isSignedPredicate(RHSICI->getPredicate()) ||
2970 ICmpInst::isSignedPredicate(ICI->getPredicate());
2972 Value *RV = getICmpValue(isSigned, Code, LHS, RHS);
2973 if (Instruction *I = dyn_cast<Instruction>(RV))
2975 // Otherwise, it's a constant boolean value...
2976 return IC.ReplaceInstUsesWith(Log, RV);
2979 } // end anonymous namespace
2981 // OptAndOp - This handles expressions of the form ((val OP C1) & C2). Where
2982 // the Op parameter is 'OP', OpRHS is 'C1', and AndRHS is 'C2'. Op is
2983 // guaranteed to be a binary operator.
2984 Instruction *InstCombiner::OptAndOp(Instruction *Op,
2986 ConstantInt *AndRHS,
2987 BinaryOperator &TheAnd) {
2988 Value *X = Op->getOperand(0);
2989 Constant *Together = 0;
2991 Together = And(AndRHS, OpRHS);
2993 switch (Op->getOpcode()) {
2994 case Instruction::Xor:
2995 if (Op->hasOneUse()) {
2996 // (X ^ C1) & C2 --> (X & C2) ^ (C1&C2)
2997 Instruction *And = BinaryOperator::createAnd(X, AndRHS);
2998 InsertNewInstBefore(And, TheAnd);
3000 return BinaryOperator::createXor(And, Together);
3003 case Instruction::Or:
3004 if (Together == AndRHS) // (X | C) & C --> C
3005 return ReplaceInstUsesWith(TheAnd, AndRHS);
3007 if (Op->hasOneUse() && Together != OpRHS) {
3008 // (X | C1) & C2 --> (X | (C1&C2)) & C2
3009 Instruction *Or = BinaryOperator::createOr(X, Together);
3010 InsertNewInstBefore(Or, TheAnd);
3012 return BinaryOperator::createAnd(Or, AndRHS);
3015 case Instruction::Add:
3016 if (Op->hasOneUse()) {
3017 // Adding a one to a single bit bit-field should be turned into an XOR
3018 // of the bit. First thing to check is to see if this AND is with a
3019 // single bit constant.
3020 const APInt& AndRHSV = cast<ConstantInt>(AndRHS)->getValue();
3022 // If there is only one bit set...
3023 if (isOneBitSet(cast<ConstantInt>(AndRHS))) {
3024 // Ok, at this point, we know that we are masking the result of the
3025 // ADD down to exactly one bit. If the constant we are adding has
3026 // no bits set below this bit, then we can eliminate the ADD.
3027 const APInt& AddRHS = cast<ConstantInt>(OpRHS)->getValue();
3029 // Check to see if any bits below the one bit set in AndRHSV are set.
3030 if ((AddRHS & (AndRHSV-1)) == 0) {
3031 // If not, the only thing that can effect the output of the AND is
3032 // the bit specified by AndRHSV. If that bit is set, the effect of
3033 // the XOR is to toggle the bit. If it is clear, then the ADD has
3035 if ((AddRHS & AndRHSV) == 0) { // Bit is not set, noop
3036 TheAnd.setOperand(0, X);
3039 // Pull the XOR out of the AND.
3040 Instruction *NewAnd = BinaryOperator::createAnd(X, AndRHS);
3041 InsertNewInstBefore(NewAnd, TheAnd);
3042 NewAnd->takeName(Op);
3043 return BinaryOperator::createXor(NewAnd, AndRHS);
3050 case Instruction::Shl: {
3051 // We know that the AND will not produce any of the bits shifted in, so if
3052 // the anded constant includes them, clear them now!
3054 uint32_t BitWidth = AndRHS->getType()->getBitWidth();
3055 uint32_t OpRHSVal = OpRHS->getLimitedValue(BitWidth);
3056 APInt ShlMask(APInt::getHighBitsSet(BitWidth, BitWidth-OpRHSVal));
3057 ConstantInt *CI = ConstantInt::get(AndRHS->getValue() & ShlMask);
3059 if (CI->getValue() == ShlMask) {
3060 // Masking out bits that the shift already masks
3061 return ReplaceInstUsesWith(TheAnd, Op); // No need for the and.
3062 } else if (CI != AndRHS) { // Reducing bits set in and.
3063 TheAnd.setOperand(1, CI);
3068 case Instruction::LShr:
3070 // We know that the AND will not produce any of the bits shifted in, so if
3071 // the anded constant includes them, clear them now! This only applies to
3072 // unsigned shifts, because a signed shr may bring in set bits!
3074 uint32_t BitWidth = AndRHS->getType()->getBitWidth();
3075 uint32_t OpRHSVal = OpRHS->getLimitedValue(BitWidth);
3076 APInt ShrMask(APInt::getLowBitsSet(BitWidth, BitWidth - OpRHSVal));
3077 ConstantInt *CI = ConstantInt::get(AndRHS->getValue() & ShrMask);
3079 if (CI->getValue() == ShrMask) {
3080 // Masking out bits that the shift already masks.
3081 return ReplaceInstUsesWith(TheAnd, Op);
3082 } else if (CI != AndRHS) {
3083 TheAnd.setOperand(1, CI); // Reduce bits set in and cst.
3088 case Instruction::AShr:
3090 // See if this is shifting in some sign extension, then masking it out
3092 if (Op->hasOneUse()) {
3093 uint32_t BitWidth = AndRHS->getType()->getBitWidth();
3094 uint32_t OpRHSVal = OpRHS->getLimitedValue(BitWidth);
3095 APInt ShrMask(APInt::getLowBitsSet(BitWidth, BitWidth - OpRHSVal));
3096 Constant *C = ConstantInt::get(AndRHS->getValue() & ShrMask);
3097 if (C == AndRHS) { // Masking out bits shifted in.
3098 // (Val ashr C1) & C2 -> (Val lshr C1) & C2
3099 // Make the argument unsigned.
3100 Value *ShVal = Op->getOperand(0);
3101 ShVal = InsertNewInstBefore(
3102 BinaryOperator::createLShr(ShVal, OpRHS,
3103 Op->getName()), TheAnd);
3104 return BinaryOperator::createAnd(ShVal, AndRHS, TheAnd.getName());
3113 /// InsertRangeTest - Emit a computation of: (V >= Lo && V < Hi) if Inside is
3114 /// true, otherwise (V < Lo || V >= Hi). In pratice, we emit the more efficient
3115 /// (V-Lo) <u Hi-Lo. This method expects that Lo <= Hi. isSigned indicates
3116 /// whether to treat the V, Lo and HI as signed or not. IB is the location to
3117 /// insert new instructions.
3118 Instruction *InstCombiner::InsertRangeTest(Value *V, Constant *Lo, Constant *Hi,
3119 bool isSigned, bool Inside,
3121 assert(cast<ConstantInt>(ConstantExpr::getICmp((isSigned ?
3122 ICmpInst::ICMP_SLE:ICmpInst::ICMP_ULE), Lo, Hi))->getZExtValue() &&
3123 "Lo is not <= Hi in range emission code!");
3126 if (Lo == Hi) // Trivially false.
3127 return new ICmpInst(ICmpInst::ICMP_NE, V, V);
3129 // V >= Min && V < Hi --> V < Hi
3130 if (cast<ConstantInt>(Lo)->isMinValue(isSigned)) {
3131 ICmpInst::Predicate pred = (isSigned ?
3132 ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT);
3133 return new ICmpInst(pred, V, Hi);
3136 // Emit V-Lo <u Hi-Lo
3137 Constant *NegLo = ConstantExpr::getNeg(Lo);
3138 Instruction *Add = BinaryOperator::createAdd(V, NegLo, V->getName()+".off");
3139 InsertNewInstBefore(Add, IB);
3140 Constant *UpperBound = ConstantExpr::getAdd(NegLo, Hi);
3141 return new ICmpInst(ICmpInst::ICMP_ULT, Add, UpperBound);
3144 if (Lo == Hi) // Trivially true.
3145 return new ICmpInst(ICmpInst::ICMP_EQ, V, V);
3147 // V < Min || V >= Hi -> V > Hi-1
3148 Hi = SubOne(cast<ConstantInt>(Hi));
3149 if (cast<ConstantInt>(Lo)->isMinValue(isSigned)) {
3150 ICmpInst::Predicate pred = (isSigned ?
3151 ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT);
3152 return new ICmpInst(pred, V, Hi);
3155 // Emit V-Lo >u Hi-1-Lo
3156 // Note that Hi has already had one subtracted from it, above.
3157 ConstantInt *NegLo = cast<ConstantInt>(ConstantExpr::getNeg(Lo));
3158 Instruction *Add = BinaryOperator::createAdd(V, NegLo, V->getName()+".off");
3159 InsertNewInstBefore(Add, IB);
3160 Constant *LowerBound = ConstantExpr::getAdd(NegLo, Hi);
3161 return new ICmpInst(ICmpInst::ICMP_UGT, Add, LowerBound);
3164 // isRunOfOnes - Returns true iff Val consists of one contiguous run of 1s with
3165 // any number of 0s on either side. The 1s are allowed to wrap from LSB to
3166 // MSB, so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is
3167 // not, since all 1s are not contiguous.
3168 static bool isRunOfOnes(ConstantInt *Val, uint32_t &MB, uint32_t &ME) {
3169 const APInt& V = Val->getValue();
3170 uint32_t BitWidth = Val->getType()->getBitWidth();
3171 if (!APIntOps::isShiftedMask(BitWidth, V)) return false;
3173 // look for the first zero bit after the run of ones
3174 MB = BitWidth - ((V - 1) ^ V).countLeadingZeros();
3175 // look for the first non-zero bit
3176 ME = V.getActiveBits();
3180 /// FoldLogicalPlusAnd - This is part of an expression (LHS +/- RHS) & Mask,
3181 /// where isSub determines whether the operator is a sub. If we can fold one of
3182 /// the following xforms:
3184 /// ((A & N) +/- B) & Mask -> (A +/- B) & Mask iff N&Mask == Mask
3185 /// ((A | N) +/- B) & Mask -> (A +/- B) & Mask iff N&Mask == 0
3186 /// ((A ^ N) +/- B) & Mask -> (A +/- B) & Mask iff N&Mask == 0
3188 /// return (A +/- B).
3190 Value *InstCombiner::FoldLogicalPlusAnd(Value *LHS, Value *RHS,
3191 ConstantInt *Mask, bool isSub,
3193 Instruction *LHSI = dyn_cast<Instruction>(LHS);
3194 if (!LHSI || LHSI->getNumOperands() != 2 ||
3195 !isa<ConstantInt>(LHSI->getOperand(1))) return 0;
3197 ConstantInt *N = cast<ConstantInt>(LHSI->getOperand(1));
3199 switch (LHSI->getOpcode()) {
3201 case Instruction::And:
3202 if (And(N, Mask) == Mask) {
3203 // If the AndRHS is a power of two minus one (0+1+), this is simple.
3204 if ((Mask->getValue().countLeadingZeros() +
3205 Mask->getValue().countPopulation()) ==
3206 Mask->getValue().getBitWidth())
3209 // Otherwise, if Mask is 0+1+0+, and if B is known to have the low 0+
3210 // part, we don't need any explicit masks to take them out of A. If that
3211 // is all N is, ignore it.
3212 uint32_t MB = 0, ME = 0;
3213 if (isRunOfOnes(Mask, MB, ME)) { // begin/end bit of run, inclusive
3214 uint32_t BitWidth = cast<IntegerType>(RHS->getType())->getBitWidth();
3215 APInt Mask(APInt::getLowBitsSet(BitWidth, MB-1));
3216 if (MaskedValueIsZero(RHS, Mask))
3221 case Instruction::Or:
3222 case Instruction::Xor:
3223 // If the AndRHS is a power of two minus one (0+1+), and N&Mask == 0
3224 if ((Mask->getValue().countLeadingZeros() +
3225 Mask->getValue().countPopulation()) == Mask->getValue().getBitWidth()
3226 && And(N, Mask)->isZero())
3233 New = BinaryOperator::createSub(LHSI->getOperand(0), RHS, "fold");
3235 New = BinaryOperator::createAdd(LHSI->getOperand(0), RHS, "fold");
3236 return InsertNewInstBefore(New, I);
3239 Instruction *InstCombiner::visitAnd(BinaryOperator &I) {
3240 bool Changed = SimplifyCommutative(I);
3241 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3243 if (isa<UndefValue>(Op1)) // X & undef -> 0
3244 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
3248 return ReplaceInstUsesWith(I, Op1);
3250 // See if we can simplify any instructions used by the instruction whose sole
3251 // purpose is to compute bits we don't care about.
3252 if (!isa<VectorType>(I.getType())) {
3253 uint32_t BitWidth = cast<IntegerType>(I.getType())->getBitWidth();
3254 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
3255 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
3256 KnownZero, KnownOne))
3259 if (ConstantVector *CP = dyn_cast<ConstantVector>(Op1)) {
3260 if (CP->isAllOnesValue()) // X & <-1,-1> -> X
3261 return ReplaceInstUsesWith(I, I.getOperand(0));
3262 } else if (isa<ConstantAggregateZero>(Op1)) {
3263 return ReplaceInstUsesWith(I, Op1); // X & <0,0> -> <0,0>
3267 if (ConstantInt *AndRHS = dyn_cast<ConstantInt>(Op1)) {
3268 const APInt& AndRHSMask = AndRHS->getValue();
3269 APInt NotAndRHS(~AndRHSMask);
3271 // Optimize a variety of ((val OP C1) & C2) combinations...
3272 if (isa<BinaryOperator>(Op0)) {
3273 Instruction *Op0I = cast<Instruction>(Op0);
3274 Value *Op0LHS = Op0I->getOperand(0);
3275 Value *Op0RHS = Op0I->getOperand(1);
3276 switch (Op0I->getOpcode()) {
3277 case Instruction::Xor:
3278 case Instruction::Or:
3279 // If the mask is only needed on one incoming arm, push it up.
3280 if (Op0I->hasOneUse()) {
3281 if (MaskedValueIsZero(Op0LHS, NotAndRHS)) {
3282 // Not masking anything out for the LHS, move to RHS.
3283 Instruction *NewRHS = BinaryOperator::createAnd(Op0RHS, AndRHS,
3284 Op0RHS->getName()+".masked");
3285 InsertNewInstBefore(NewRHS, I);
3286 return BinaryOperator::create(
3287 cast<BinaryOperator>(Op0I)->getOpcode(), Op0LHS, NewRHS);
3289 if (!isa<Constant>(Op0RHS) &&
3290 MaskedValueIsZero(Op0RHS, NotAndRHS)) {
3291 // Not masking anything out for the RHS, move to LHS.
3292 Instruction *NewLHS = BinaryOperator::createAnd(Op0LHS, AndRHS,
3293 Op0LHS->getName()+".masked");
3294 InsertNewInstBefore(NewLHS, I);
3295 return BinaryOperator::create(
3296 cast<BinaryOperator>(Op0I)->getOpcode(), NewLHS, Op0RHS);
3301 case Instruction::Add:
3302 // ((A & N) + B) & AndRHS -> (A + B) & AndRHS iff N&AndRHS == AndRHS.
3303 // ((A | N) + B) & AndRHS -> (A + B) & AndRHS iff N&AndRHS == 0
3304 // ((A ^ N) + B) & AndRHS -> (A + B) & AndRHS iff N&AndRHS == 0
3305 if (Value *V = FoldLogicalPlusAnd(Op0LHS, Op0RHS, AndRHS, false, I))
3306 return BinaryOperator::createAnd(V, AndRHS);
3307 if (Value *V = FoldLogicalPlusAnd(Op0RHS, Op0LHS, AndRHS, false, I))
3308 return BinaryOperator::createAnd(V, AndRHS); // Add commutes
3311 case Instruction::Sub:
3312 // ((A & N) - B) & AndRHS -> (A - B) & AndRHS iff N&AndRHS == AndRHS.
3313 // ((A | N) - B) & AndRHS -> (A - B) & AndRHS iff N&AndRHS == 0
3314 // ((A ^ N) - B) & AndRHS -> (A - B) & AndRHS iff N&AndRHS == 0
3315 if (Value *V = FoldLogicalPlusAnd(Op0LHS, Op0RHS, AndRHS, true, I))
3316 return BinaryOperator::createAnd(V, AndRHS);
3320 if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1)))
3321 if (Instruction *Res = OptAndOp(Op0I, Op0CI, AndRHS, I))
3323 } else if (CastInst *CI = dyn_cast<CastInst>(Op0)) {
3324 // If this is an integer truncation or change from signed-to-unsigned, and
3325 // if the source is an and/or with immediate, transform it. This
3326 // frequently occurs for bitfield accesses.
3327 if (Instruction *CastOp = dyn_cast<Instruction>(CI->getOperand(0))) {
3328 if ((isa<TruncInst>(CI) || isa<BitCastInst>(CI)) &&
3329 CastOp->getNumOperands() == 2)
3330 if (ConstantInt *AndCI = dyn_cast<ConstantInt>(CastOp->getOperand(1)))
3331 if (CastOp->getOpcode() == Instruction::And) {
3332 // Change: and (cast (and X, C1) to T), C2
3333 // into : and (cast X to T), trunc_or_bitcast(C1)&C2
3334 // This will fold the two constants together, which may allow
3335 // other simplifications.
3336 Instruction *NewCast = CastInst::createTruncOrBitCast(
3337 CastOp->getOperand(0), I.getType(),
3338 CastOp->getName()+".shrunk");
3339 NewCast = InsertNewInstBefore(NewCast, I);
3340 // trunc_or_bitcast(C1)&C2
3341 Constant *C3 = ConstantExpr::getTruncOrBitCast(AndCI,I.getType());
3342 C3 = ConstantExpr::getAnd(C3, AndRHS);
3343 return BinaryOperator::createAnd(NewCast, C3);
3344 } else if (CastOp->getOpcode() == Instruction::Or) {
3345 // Change: and (cast (or X, C1) to T), C2
3346 // into : trunc(C1)&C2 iff trunc(C1)&C2 == C2
3347 Constant *C3 = ConstantExpr::getTruncOrBitCast(AndCI,I.getType());
3348 if (ConstantExpr::getAnd(C3, AndRHS) == AndRHS) // trunc(C1)&C2
3349 return ReplaceInstUsesWith(I, AndRHS);
3354 // Try to fold constant and into select arguments.
3355 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
3356 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
3358 if (isa<PHINode>(Op0))
3359 if (Instruction *NV = FoldOpIntoPhi(I))
3363 Value *Op0NotVal = dyn_castNotVal(Op0);
3364 Value *Op1NotVal = dyn_castNotVal(Op1);
3366 if (Op0NotVal == Op1 || Op1NotVal == Op0) // A & ~A == ~A & A == 0
3367 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
3369 // (~A & ~B) == (~(A | B)) - De Morgan's Law
3370 if (Op0NotVal && Op1NotVal && isOnlyUse(Op0) && isOnlyUse(Op1)) {
3371 Instruction *Or = BinaryOperator::createOr(Op0NotVal, Op1NotVal,
3372 I.getName()+".demorgan");
3373 InsertNewInstBefore(Or, I);
3374 return BinaryOperator::createNot(Or);
3378 Value *A = 0, *B = 0, *C = 0, *D = 0;
3379 if (match(Op0, m_Or(m_Value(A), m_Value(B)))) {
3380 if (A == Op1 || B == Op1) // (A | ?) & A --> A
3381 return ReplaceInstUsesWith(I, Op1);
3383 // (A|B) & ~(A&B) -> A^B
3384 if (match(Op1, m_Not(m_And(m_Value(C), m_Value(D))))) {
3385 if ((A == C && B == D) || (A == D && B == C))
3386 return BinaryOperator::createXor(A, B);
3390 if (match(Op1, m_Or(m_Value(A), m_Value(B)))) {
3391 if (A == Op0 || B == Op0) // A & (A | ?) --> A
3392 return ReplaceInstUsesWith(I, Op0);
3394 // ~(A&B) & (A|B) -> A^B
3395 if (match(Op0, m_Not(m_And(m_Value(C), m_Value(D))))) {
3396 if ((A == C && B == D) || (A == D && B == C))
3397 return BinaryOperator::createXor(A, B);
3401 if (Op0->hasOneUse() &&
3402 match(Op0, m_Xor(m_Value(A), m_Value(B)))) {
3403 if (A == Op1) { // (A^B)&A -> A&(A^B)
3404 I.swapOperands(); // Simplify below
3405 std::swap(Op0, Op1);
3406 } else if (B == Op1) { // (A^B)&B -> B&(B^A)
3407 cast<BinaryOperator>(Op0)->swapOperands();
3408 I.swapOperands(); // Simplify below
3409 std::swap(Op0, Op1);
3412 if (Op1->hasOneUse() &&
3413 match(Op1, m_Xor(m_Value(A), m_Value(B)))) {
3414 if (B == Op0) { // B&(A^B) -> B&(B^A)
3415 cast<BinaryOperator>(Op1)->swapOperands();
3418 if (A == Op0) { // A&(A^B) -> A & ~B
3419 Instruction *NotB = BinaryOperator::createNot(B, "tmp");
3420 InsertNewInstBefore(NotB, I);
3421 return BinaryOperator::createAnd(A, NotB);
3426 if (ICmpInst *RHS = dyn_cast<ICmpInst>(Op1)) {
3427 // (icmp1 A, B) & (icmp2 A, B) --> (icmp3 A, B)
3428 if (Instruction *R = AssociativeOpt(I, FoldICmpLogical(*this, RHS)))
3431 Value *LHSVal, *RHSVal;
3432 ConstantInt *LHSCst, *RHSCst;
3433 ICmpInst::Predicate LHSCC, RHSCC;
3434 if (match(Op0, m_ICmp(LHSCC, m_Value(LHSVal), m_ConstantInt(LHSCst))))
3435 if (match(RHS, m_ICmp(RHSCC, m_Value(RHSVal), m_ConstantInt(RHSCst))))
3436 if (LHSVal == RHSVal && // Found (X icmp C1) & (X icmp C2)
3437 // ICMP_[GL]E X, CST is folded to ICMP_[GL]T elsewhere.
3438 LHSCC != ICmpInst::ICMP_UGE && LHSCC != ICmpInst::ICMP_ULE &&
3439 RHSCC != ICmpInst::ICMP_UGE && RHSCC != ICmpInst::ICMP_ULE &&
3440 LHSCC != ICmpInst::ICMP_SGE && LHSCC != ICmpInst::ICMP_SLE &&
3441 RHSCC != ICmpInst::ICMP_SGE && RHSCC != ICmpInst::ICMP_SLE) {
3442 // Ensure that the larger constant is on the RHS.
3443 ICmpInst::Predicate GT = ICmpInst::isSignedPredicate(LHSCC) ?
3444 ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT;
3445 Constant *Cmp = ConstantExpr::getICmp(GT, LHSCst, RHSCst);
3446 ICmpInst *LHS = cast<ICmpInst>(Op0);
3447 if (cast<ConstantInt>(Cmp)->getZExtValue()) {
3448 std::swap(LHS, RHS);
3449 std::swap(LHSCst, RHSCst);
3450 std::swap(LHSCC, RHSCC);
3453 // At this point, we know we have have two icmp instructions
3454 // comparing a value against two constants and and'ing the result
3455 // together. Because of the above check, we know that we only have
3456 // icmp eq, icmp ne, icmp [su]lt, and icmp [SU]gt here. We also know
3457 // (from the FoldICmpLogical check above), that the two constants
3458 // are not equal and that the larger constant is on the RHS
3459 assert(LHSCst != RHSCst && "Compares not folded above?");
3462 default: assert(0 && "Unknown integer condition code!");
3463 case ICmpInst::ICMP_EQ:
3465 default: assert(0 && "Unknown integer condition code!");
3466 case ICmpInst::ICMP_EQ: // (X == 13 & X == 15) -> false
3467 case ICmpInst::ICMP_UGT: // (X == 13 & X > 15) -> false
3468 case ICmpInst::ICMP_SGT: // (X == 13 & X > 15) -> false
3469 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
3470 case ICmpInst::ICMP_NE: // (X == 13 & X != 15) -> X == 13
3471 case ICmpInst::ICMP_ULT: // (X == 13 & X < 15) -> X == 13
3472 case ICmpInst::ICMP_SLT: // (X == 13 & X < 15) -> X == 13
3473 return ReplaceInstUsesWith(I, LHS);
3475 case ICmpInst::ICMP_NE:
3477 default: assert(0 && "Unknown integer condition code!");
3478 case ICmpInst::ICMP_ULT:
3479 if (LHSCst == SubOne(RHSCst)) // (X != 13 & X u< 14) -> X < 13
3480 return new ICmpInst(ICmpInst::ICMP_ULT, LHSVal, LHSCst);
3481 break; // (X != 13 & X u< 15) -> no change
3482 case ICmpInst::ICMP_SLT:
3483 if (LHSCst == SubOne(RHSCst)) // (X != 13 & X s< 14) -> X < 13
3484 return new ICmpInst(ICmpInst::ICMP_SLT, LHSVal, LHSCst);
3485 break; // (X != 13 & X s< 15) -> no change
3486 case ICmpInst::ICMP_EQ: // (X != 13 & X == 15) -> X == 15
3487 case ICmpInst::ICMP_UGT: // (X != 13 & X u> 15) -> X u> 15
3488 case ICmpInst::ICMP_SGT: // (X != 13 & X s> 15) -> X s> 15
3489 return ReplaceInstUsesWith(I, RHS);
3490 case ICmpInst::ICMP_NE:
3491 if (LHSCst == SubOne(RHSCst)){// (X != 13 & X != 14) -> X-13 >u 1
3492 Constant *AddCST = ConstantExpr::getNeg(LHSCst);
3493 Instruction *Add = BinaryOperator::createAdd(LHSVal, AddCST,
3494 LHSVal->getName()+".off");
3495 InsertNewInstBefore(Add, I);
3496 return new ICmpInst(ICmpInst::ICMP_UGT, Add,
3497 ConstantInt::get(Add->getType(), 1));
3499 break; // (X != 13 & X != 15) -> no change
3502 case ICmpInst::ICMP_ULT:
3504 default: assert(0 && "Unknown integer condition code!");
3505 case ICmpInst::ICMP_EQ: // (X u< 13 & X == 15) -> false
3506 case ICmpInst::ICMP_UGT: // (X u< 13 & X u> 15) -> false
3507 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
3508 case ICmpInst::ICMP_SGT: // (X u< 13 & X s> 15) -> no change
3510 case ICmpInst::ICMP_NE: // (X u< 13 & X != 15) -> X u< 13
3511 case ICmpInst::ICMP_ULT: // (X u< 13 & X u< 15) -> X u< 13
3512 return ReplaceInstUsesWith(I, LHS);
3513 case ICmpInst::ICMP_SLT: // (X u< 13 & X s< 15) -> no change
3517 case ICmpInst::ICMP_SLT:
3519 default: assert(0 && "Unknown integer condition code!");
3520 case ICmpInst::ICMP_EQ: // (X s< 13 & X == 15) -> false
3521 case ICmpInst::ICMP_SGT: // (X s< 13 & X s> 15) -> false
3522 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
3523 case ICmpInst::ICMP_UGT: // (X s< 13 & X u> 15) -> no change
3525 case ICmpInst::ICMP_NE: // (X s< 13 & X != 15) -> X < 13
3526 case ICmpInst::ICMP_SLT: // (X s< 13 & X s< 15) -> X < 13
3527 return ReplaceInstUsesWith(I, LHS);
3528 case ICmpInst::ICMP_ULT: // (X s< 13 & X u< 15) -> no change
3532 case ICmpInst::ICMP_UGT:
3534 default: assert(0 && "Unknown integer condition code!");
3535 case ICmpInst::ICMP_EQ: // (X u> 13 & X == 15) -> X > 13
3536 return ReplaceInstUsesWith(I, LHS);
3537 case ICmpInst::ICMP_UGT: // (X u> 13 & X u> 15) -> X u> 15
3538 return ReplaceInstUsesWith(I, RHS);
3539 case ICmpInst::ICMP_SGT: // (X u> 13 & X s> 15) -> no change
3541 case ICmpInst::ICMP_NE:
3542 if (RHSCst == AddOne(LHSCst)) // (X u> 13 & X != 14) -> X u> 14
3543 return new ICmpInst(LHSCC, LHSVal, RHSCst);
3544 break; // (X u> 13 & X != 15) -> no change
3545 case ICmpInst::ICMP_ULT: // (X u> 13 & X u< 15) ->(X-14) <u 1
3546 return InsertRangeTest(LHSVal, AddOne(LHSCst), RHSCst, false,
3548 case ICmpInst::ICMP_SLT: // (X u> 13 & X s< 15) -> no change
3552 case ICmpInst::ICMP_SGT:
3554 default: assert(0 && "Unknown integer condition code!");
3555 case ICmpInst::ICMP_EQ: // (X s> 13 & X == 15) -> X s> 13
3556 return ReplaceInstUsesWith(I, LHS);
3557 case ICmpInst::ICMP_SGT: // (X s> 13 & X s> 15) -> X s> 15
3558 return ReplaceInstUsesWith(I, RHS);
3559 case ICmpInst::ICMP_UGT: // (X s> 13 & X u> 15) -> no change
3561 case ICmpInst::ICMP_NE:
3562 if (RHSCst == AddOne(LHSCst)) // (X s> 13 & X != 14) -> X s> 14
3563 return new ICmpInst(LHSCC, LHSVal, RHSCst);
3564 break; // (X s> 13 & X != 15) -> no change
3565 case ICmpInst::ICMP_SLT: // (X s> 13 & X s< 15) ->(X-14) s< 1
3566 return InsertRangeTest(LHSVal, AddOne(LHSCst), RHSCst, true,
3568 case ICmpInst::ICMP_ULT: // (X s> 13 & X u< 15) -> no change
3576 // fold (and (cast A), (cast B)) -> (cast (and A, B))
3577 if (CastInst *Op0C = dyn_cast<CastInst>(Op0))
3578 if (CastInst *Op1C = dyn_cast<CastInst>(Op1))
3579 if (Op0C->getOpcode() == Op1C->getOpcode()) { // same cast kind ?
3580 const Type *SrcTy = Op0C->getOperand(0)->getType();
3581 if (SrcTy == Op1C->getOperand(0)->getType() && SrcTy->isInteger() &&
3582 // Only do this if the casts both really cause code to be generated.
3583 ValueRequiresCast(Op0C->getOpcode(), Op0C->getOperand(0),
3585 ValueRequiresCast(Op1C->getOpcode(), Op1C->getOperand(0),
3587 Instruction *NewOp = BinaryOperator::createAnd(Op0C->getOperand(0),
3588 Op1C->getOperand(0),
3590 InsertNewInstBefore(NewOp, I);
3591 return CastInst::create(Op0C->getOpcode(), NewOp, I.getType());
3595 // (X >> Z) & (Y >> Z) -> (X&Y) >> Z for all shifts.
3596 if (BinaryOperator *SI1 = dyn_cast<BinaryOperator>(Op1)) {
3597 if (BinaryOperator *SI0 = dyn_cast<BinaryOperator>(Op0))
3598 if (SI0->isShift() && SI0->getOpcode() == SI1->getOpcode() &&
3599 SI0->getOperand(1) == SI1->getOperand(1) &&
3600 (SI0->hasOneUse() || SI1->hasOneUse())) {
3601 Instruction *NewOp =
3602 InsertNewInstBefore(BinaryOperator::createAnd(SI0->getOperand(0),
3604 SI0->getName()), I);
3605 return BinaryOperator::create(SI1->getOpcode(), NewOp,
3606 SI1->getOperand(1));
3610 return Changed ? &I : 0;
3613 /// CollectBSwapParts - Look to see if the specified value defines a single byte
3614 /// in the result. If it does, and if the specified byte hasn't been filled in
3615 /// yet, fill it in and return false.
3616 static bool CollectBSwapParts(Value *V, SmallVector<Value*, 8> &ByteValues) {
3617 Instruction *I = dyn_cast<Instruction>(V);
3618 if (I == 0) return true;
3620 // If this is an or instruction, it is an inner node of the bswap.
3621 if (I->getOpcode() == Instruction::Or)
3622 return CollectBSwapParts(I->getOperand(0), ByteValues) ||
3623 CollectBSwapParts(I->getOperand(1), ByteValues);
3625 uint32_t BitWidth = I->getType()->getPrimitiveSizeInBits();
3626 // If this is a shift by a constant int, and it is "24", then its operand
3627 // defines a byte. We only handle unsigned types here.
3628 if (I->isShift() && isa<ConstantInt>(I->getOperand(1))) {
3629 // Not shifting the entire input by N-1 bytes?
3630 if (cast<ConstantInt>(I->getOperand(1))->getLimitedValue(BitWidth) !=
3631 8*(ByteValues.size()-1))
3635 if (I->getOpcode() == Instruction::Shl) {
3636 // X << 24 defines the top byte with the lowest of the input bytes.
3637 DestNo = ByteValues.size()-1;
3639 // X >>u 24 defines the low byte with the highest of the input bytes.
3643 // If the destination byte value is already defined, the values are or'd
3644 // together, which isn't a bswap (unless it's an or of the same bits).
3645 if (ByteValues[DestNo] && ByteValues[DestNo] != I->getOperand(0))
3647 ByteValues[DestNo] = I->getOperand(0);
3651 // Otherwise, we can only handle and(shift X, imm), imm). Bail out of if we
3653 Value *Shift = 0, *ShiftLHS = 0;
3654 ConstantInt *AndAmt = 0, *ShiftAmt = 0;
3655 if (!match(I, m_And(m_Value(Shift), m_ConstantInt(AndAmt))) ||
3656 !match(Shift, m_Shift(m_Value(ShiftLHS), m_ConstantInt(ShiftAmt))))
3658 Instruction *SI = cast<Instruction>(Shift);
3660 // Make sure that the shift amount is by a multiple of 8 and isn't too big.
3661 if (ShiftAmt->getLimitedValue(BitWidth) & 7 ||
3662 ShiftAmt->getLimitedValue(BitWidth) > 8*ByteValues.size())
3665 // Turn 0xFF -> 0, 0xFF00 -> 1, 0xFF0000 -> 2, etc.
3667 if (AndAmt->getValue().getActiveBits() > 64)
3669 uint64_t AndAmtVal = AndAmt->getZExtValue();
3670 for (DestByte = 0; DestByte != ByteValues.size(); ++DestByte)
3671 if (AndAmtVal == uint64_t(0xFF) << 8*DestByte)
3673 // Unknown mask for bswap.
3674 if (DestByte == ByteValues.size()) return true;
3676 unsigned ShiftBytes = ShiftAmt->getZExtValue()/8;
3678 if (SI->getOpcode() == Instruction::Shl)
3679 SrcByte = DestByte - ShiftBytes;
3681 SrcByte = DestByte + ShiftBytes;
3683 // If the SrcByte isn't a bswapped value from the DestByte, reject it.
3684 if (SrcByte != ByteValues.size()-DestByte-1)
3687 // If the destination byte value is already defined, the values are or'd
3688 // together, which isn't a bswap (unless it's an or of the same bits).
3689 if (ByteValues[DestByte] && ByteValues[DestByte] != SI->getOperand(0))
3691 ByteValues[DestByte] = SI->getOperand(0);
3695 /// MatchBSwap - Given an OR instruction, check to see if this is a bswap idiom.
3696 /// If so, insert the new bswap intrinsic and return it.
3697 Instruction *InstCombiner::MatchBSwap(BinaryOperator &I) {
3698 const IntegerType *ITy = dyn_cast<IntegerType>(I.getType());
3699 if (!ITy || ITy->getBitWidth() % 16)
3700 return 0; // Can only bswap pairs of bytes. Can't do vectors.
3702 /// ByteValues - For each byte of the result, we keep track of which value
3703 /// defines each byte.
3704 SmallVector<Value*, 8> ByteValues;
3705 ByteValues.resize(ITy->getBitWidth()/8);
3707 // Try to find all the pieces corresponding to the bswap.
3708 if (CollectBSwapParts(I.getOperand(0), ByteValues) ||
3709 CollectBSwapParts(I.getOperand(1), ByteValues))
3712 // Check to see if all of the bytes come from the same value.
3713 Value *V = ByteValues[0];
3714 if (V == 0) return 0; // Didn't find a byte? Must be zero.
3716 // Check to make sure that all of the bytes come from the same value.
3717 for (unsigned i = 1, e = ByteValues.size(); i != e; ++i)
3718 if (ByteValues[i] != V)
3720 const Type *Tys[] = { ITy, ITy };
3721 Module *M = I.getParent()->getParent()->getParent();
3722 Function *F = Intrinsic::getDeclaration(M, Intrinsic::bswap, Tys, 2);
3723 return new CallInst(F, V);
3727 Instruction *InstCombiner::visitOr(BinaryOperator &I) {
3728 bool Changed = SimplifyCommutative(I);
3729 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3731 if (isa<UndefValue>(Op1)) // X | undef -> -1
3732 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
3736 return ReplaceInstUsesWith(I, Op0);
3738 // See if we can simplify any instructions used by the instruction whose sole
3739 // purpose is to compute bits we don't care about.
3740 if (!isa<VectorType>(I.getType())) {
3741 uint32_t BitWidth = cast<IntegerType>(I.getType())->getBitWidth();
3742 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
3743 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
3744 KnownZero, KnownOne))
3746 } else if (isa<ConstantAggregateZero>(Op1)) {
3747 return ReplaceInstUsesWith(I, Op0); // X | <0,0> -> X
3748 } else if (ConstantVector *CP = dyn_cast<ConstantVector>(Op1)) {
3749 if (CP->isAllOnesValue()) // X | <-1,-1> -> <-1,-1>
3750 return ReplaceInstUsesWith(I, I.getOperand(1));
3756 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
3757 ConstantInt *C1 = 0; Value *X = 0;
3758 // (X & C1) | C2 --> (X | C2) & (C1|C2)
3759 if (match(Op0, m_And(m_Value(X), m_ConstantInt(C1))) && isOnlyUse(Op0)) {
3760 Instruction *Or = BinaryOperator::createOr(X, RHS);
3761 InsertNewInstBefore(Or, I);
3763 return BinaryOperator::createAnd(Or,
3764 ConstantInt::get(RHS->getValue() | C1->getValue()));
3767 // (X ^ C1) | C2 --> (X | C2) ^ (C1&~C2)
3768 if (match(Op0, m_Xor(m_Value(X), m_ConstantInt(C1))) && isOnlyUse(Op0)) {
3769 Instruction *Or = BinaryOperator::createOr(X, RHS);
3770 InsertNewInstBefore(Or, I);
3772 return BinaryOperator::createXor(Or,
3773 ConstantInt::get(C1->getValue() & ~RHS->getValue()));
3776 // Try to fold constant and into select arguments.
3777 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
3778 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
3780 if (isa<PHINode>(Op0))
3781 if (Instruction *NV = FoldOpIntoPhi(I))
3785 Value *A = 0, *B = 0;
3786 ConstantInt *C1 = 0, *C2 = 0;
3788 if (match(Op0, m_And(m_Value(A), m_Value(B))))
3789 if (A == Op1 || B == Op1) // (A & ?) | A --> A
3790 return ReplaceInstUsesWith(I, Op1);
3791 if (match(Op1, m_And(m_Value(A), m_Value(B))))
3792 if (A == Op0 || B == Op0) // A | (A & ?) --> A
3793 return ReplaceInstUsesWith(I, Op0);
3795 // (A | B) | C and A | (B | C) -> bswap if possible.
3796 // (A >> B) | (C << D) and (A << B) | (B >> C) -> bswap if possible.
3797 if (match(Op0, m_Or(m_Value(), m_Value())) ||
3798 match(Op1, m_Or(m_Value(), m_Value())) ||
3799 (match(Op0, m_Shift(m_Value(), m_Value())) &&
3800 match(Op1, m_Shift(m_Value(), m_Value())))) {
3801 if (Instruction *BSwap = MatchBSwap(I))
3805 // (X^C)|Y -> (X|Y)^C iff Y&C == 0
3806 if (Op0->hasOneUse() && match(Op0, m_Xor(m_Value(A), m_ConstantInt(C1))) &&
3807 MaskedValueIsZero(Op1, C1->getValue())) {
3808 Instruction *NOr = BinaryOperator::createOr(A, Op1);
3809 InsertNewInstBefore(NOr, I);
3811 return BinaryOperator::createXor(NOr, C1);
3814 // Y|(X^C) -> (X|Y)^C iff Y&C == 0
3815 if (Op1->hasOneUse() && match(Op1, m_Xor(m_Value(A), m_ConstantInt(C1))) &&
3816 MaskedValueIsZero(Op0, C1->getValue())) {
3817 Instruction *NOr = BinaryOperator::createOr(A, Op0);
3818 InsertNewInstBefore(NOr, I);
3820 return BinaryOperator::createXor(NOr, C1);
3824 Value *C = 0, *D = 0;
3825 if (match(Op0, m_And(m_Value(A), m_Value(C))) &&
3826 match(Op1, m_And(m_Value(B), m_Value(D)))) {
3827 Value *V1 = 0, *V2 = 0, *V3 = 0;
3828 C1 = dyn_cast<ConstantInt>(C);
3829 C2 = dyn_cast<ConstantInt>(D);
3830 if (C1 && C2) { // (A & C1)|(B & C2)
3831 // If we have: ((V + N) & C1) | (V & C2)
3832 // .. and C2 = ~C1 and C2 is 0+1+ and (N & C2) == 0
3833 // replace with V+N.
3834 if (C1->getValue() == ~C2->getValue()) {
3835 if ((C2->getValue() & (C2->getValue()+1)) == 0 && // C2 == 0+1+
3836 match(A, m_Add(m_Value(V1), m_Value(V2)))) {
3837 // Add commutes, try both ways.
3838 if (V1 == B && MaskedValueIsZero(V2, C2->getValue()))
3839 return ReplaceInstUsesWith(I, A);
3840 if (V2 == B && MaskedValueIsZero(V1, C2->getValue()))
3841 return ReplaceInstUsesWith(I, A);
3843 // Or commutes, try both ways.
3844 if ((C1->getValue() & (C1->getValue()+1)) == 0 &&
3845 match(B, m_Add(m_Value(V1), m_Value(V2)))) {
3846 // Add commutes, try both ways.
3847 if (V1 == A && MaskedValueIsZero(V2, C1->getValue()))
3848 return ReplaceInstUsesWith(I, B);
3849 if (V2 == A && MaskedValueIsZero(V1, C1->getValue()))
3850 return ReplaceInstUsesWith(I, B);
3853 V1 = 0; V2 = 0; V3 = 0;
3856 // Check to see if we have any common things being and'ed. If so, find the
3857 // terms for V1 & (V2|V3).
3858 if (isOnlyUse(Op0) || isOnlyUse(Op1)) {
3859 if (A == B) // (A & C)|(A & D) == A & (C|D)
3860 V1 = A, V2 = C, V3 = D;
3861 else if (A == D) // (A & C)|(B & A) == A & (B|C)
3862 V1 = A, V2 = B, V3 = C;
3863 else if (C == B) // (A & C)|(C & D) == C & (A|D)
3864 V1 = C, V2 = A, V3 = D;
3865 else if (C == D) // (A & C)|(B & C) == C & (A|B)
3866 V1 = C, V2 = A, V3 = B;
3870 InsertNewInstBefore(BinaryOperator::createOr(V2, V3, "tmp"), I);
3871 return BinaryOperator::createAnd(V1, Or);
3876 // (X >> Z) | (Y >> Z) -> (X|Y) >> Z for all shifts.
3877 if (BinaryOperator *SI1 = dyn_cast<BinaryOperator>(Op1)) {
3878 if (BinaryOperator *SI0 = dyn_cast<BinaryOperator>(Op0))
3879 if (SI0->isShift() && SI0->getOpcode() == SI1->getOpcode() &&
3880 SI0->getOperand(1) == SI1->getOperand(1) &&
3881 (SI0->hasOneUse() || SI1->hasOneUse())) {
3882 Instruction *NewOp =
3883 InsertNewInstBefore(BinaryOperator::createOr(SI0->getOperand(0),
3885 SI0->getName()), I);
3886 return BinaryOperator::create(SI1->getOpcode(), NewOp,
3887 SI1->getOperand(1));
3891 if (match(Op0, m_Not(m_Value(A)))) { // ~A | Op1
3892 if (A == Op1) // ~A | A == -1
3893 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
3897 // Note, A is still live here!
3898 if (match(Op1, m_Not(m_Value(B)))) { // Op0 | ~B
3900 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
3902 // (~A | ~B) == (~(A & B)) - De Morgan's Law
3903 if (A && isOnlyUse(Op0) && isOnlyUse(Op1)) {
3904 Value *And = InsertNewInstBefore(BinaryOperator::createAnd(A, B,
3905 I.getName()+".demorgan"), I);
3906 return BinaryOperator::createNot(And);
3910 // (icmp1 A, B) | (icmp2 A, B) --> (icmp3 A, B)
3911 if (ICmpInst *RHS = dyn_cast<ICmpInst>(I.getOperand(1))) {
3912 if (Instruction *R = AssociativeOpt(I, FoldICmpLogical(*this, RHS)))
3915 Value *LHSVal, *RHSVal;
3916 ConstantInt *LHSCst, *RHSCst;
3917 ICmpInst::Predicate LHSCC, RHSCC;
3918 if (match(Op0, m_ICmp(LHSCC, m_Value(LHSVal), m_ConstantInt(LHSCst))))
3919 if (match(RHS, m_ICmp(RHSCC, m_Value(RHSVal), m_ConstantInt(RHSCst))))
3920 if (LHSVal == RHSVal && // Found (X icmp C1) | (X icmp C2)
3921 // icmp [us][gl]e x, cst is folded to icmp [us][gl]t elsewhere.
3922 LHSCC != ICmpInst::ICMP_UGE && LHSCC != ICmpInst::ICMP_ULE &&
3923 RHSCC != ICmpInst::ICMP_UGE && RHSCC != ICmpInst::ICMP_ULE &&
3924 LHSCC != ICmpInst::ICMP_SGE && LHSCC != ICmpInst::ICMP_SLE &&
3925 RHSCC != ICmpInst::ICMP_SGE && RHSCC != ICmpInst::ICMP_SLE &&
3926 // We can't fold (ugt x, C) | (sgt x, C2).
3927 PredicatesFoldable(LHSCC, RHSCC)) {
3928 // Ensure that the larger constant is on the RHS.
3929 ICmpInst *LHS = cast<ICmpInst>(Op0);
3931 if (ICmpInst::isSignedPredicate(LHSCC))
3932 NeedsSwap = LHSCst->getValue().sgt(RHSCst->getValue());
3934 NeedsSwap = LHSCst->getValue().ugt(RHSCst->getValue());
3937 std::swap(LHS, RHS);
3938 std::swap(LHSCst, RHSCst);
3939 std::swap(LHSCC, RHSCC);
3942 // At this point, we know we have have two icmp instructions
3943 // comparing a value against two constants and or'ing the result
3944 // together. Because of the above check, we know that we only have
3945 // ICMP_EQ, ICMP_NE, ICMP_LT, and ICMP_GT here. We also know (from the
3946 // FoldICmpLogical check above), that the two constants are not
3948 assert(LHSCst != RHSCst && "Compares not folded above?");
3951 default: assert(0 && "Unknown integer condition code!");
3952 case ICmpInst::ICMP_EQ:
3954 default: assert(0 && "Unknown integer condition code!");
3955 case ICmpInst::ICMP_EQ:
3956 if (LHSCst == SubOne(RHSCst)) {// (X == 13 | X == 14) -> X-13 <u 2
3957 Constant *AddCST = ConstantExpr::getNeg(LHSCst);
3958 Instruction *Add = BinaryOperator::createAdd(LHSVal, AddCST,
3959 LHSVal->getName()+".off");
3960 InsertNewInstBefore(Add, I);
3961 AddCST = Subtract(AddOne(RHSCst), LHSCst);
3962 return new ICmpInst(ICmpInst::ICMP_ULT, Add, AddCST);
3964 break; // (X == 13 | X == 15) -> no change
3965 case ICmpInst::ICMP_UGT: // (X == 13 | X u> 14) -> no change
3966 case ICmpInst::ICMP_SGT: // (X == 13 | X s> 14) -> no change
3968 case ICmpInst::ICMP_NE: // (X == 13 | X != 15) -> X != 15
3969 case ICmpInst::ICMP_ULT: // (X == 13 | X u< 15) -> X u< 15
3970 case ICmpInst::ICMP_SLT: // (X == 13 | X s< 15) -> X s< 15
3971 return ReplaceInstUsesWith(I, RHS);
3974 case ICmpInst::ICMP_NE:
3976 default: assert(0 && "Unknown integer condition code!");
3977 case ICmpInst::ICMP_EQ: // (X != 13 | X == 15) -> X != 13
3978 case ICmpInst::ICMP_UGT: // (X != 13 | X u> 15) -> X != 13
3979 case ICmpInst::ICMP_SGT: // (X != 13 | X s> 15) -> X != 13
3980 return ReplaceInstUsesWith(I, LHS);
3981 case ICmpInst::ICMP_NE: // (X != 13 | X != 15) -> true
3982 case ICmpInst::ICMP_ULT: // (X != 13 | X u< 15) -> true
3983 case ICmpInst::ICMP_SLT: // (X != 13 | X s< 15) -> true
3984 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
3987 case ICmpInst::ICMP_ULT:
3989 default: assert(0 && "Unknown integer condition code!");
3990 case ICmpInst::ICMP_EQ: // (X u< 13 | X == 14) -> no change
3992 case ICmpInst::ICMP_UGT: // (X u< 13 | X u> 15) ->(X-13) u> 2
3993 return InsertRangeTest(LHSVal, LHSCst, AddOne(RHSCst), false,
3995 case ICmpInst::ICMP_SGT: // (X u< 13 | X s> 15) -> no change
3997 case ICmpInst::ICMP_NE: // (X u< 13 | X != 15) -> X != 15
3998 case ICmpInst::ICMP_ULT: // (X u< 13 | X u< 15) -> X u< 15
3999 return ReplaceInstUsesWith(I, RHS);
4000 case ICmpInst::ICMP_SLT: // (X u< 13 | X s< 15) -> no change
4004 case ICmpInst::ICMP_SLT:
4006 default: assert(0 && "Unknown integer condition code!");
4007 case ICmpInst::ICMP_EQ: // (X s< 13 | X == 14) -> no change
4009 case ICmpInst::ICMP_SGT: // (X s< 13 | X s> 15) ->(X-13) s> 2
4010 return InsertRangeTest(LHSVal, LHSCst, AddOne(RHSCst), true,
4012 case ICmpInst::ICMP_UGT: // (X s< 13 | X u> 15) -> no change
4014 case ICmpInst::ICMP_NE: // (X s< 13 | X != 15) -> X != 15
4015 case ICmpInst::ICMP_SLT: // (X s< 13 | X s< 15) -> X s< 15
4016 return ReplaceInstUsesWith(I, RHS);
4017 case ICmpInst::ICMP_ULT: // (X s< 13 | X u< 15) -> no change
4021 case ICmpInst::ICMP_UGT:
4023 default: assert(0 && "Unknown integer condition code!");
4024 case ICmpInst::ICMP_EQ: // (X u> 13 | X == 15) -> X u> 13
4025 case ICmpInst::ICMP_UGT: // (X u> 13 | X u> 15) -> X u> 13
4026 return ReplaceInstUsesWith(I, LHS);
4027 case ICmpInst::ICMP_SGT: // (X u> 13 | X s> 15) -> no change
4029 case ICmpInst::ICMP_NE: // (X u> 13 | X != 15) -> true
4030 case ICmpInst::ICMP_ULT: // (X u> 13 | X u< 15) -> true
4031 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4032 case ICmpInst::ICMP_SLT: // (X u> 13 | X s< 15) -> no change
4036 case ICmpInst::ICMP_SGT:
4038 default: assert(0 && "Unknown integer condition code!");
4039 case ICmpInst::ICMP_EQ: // (X s> 13 | X == 15) -> X > 13
4040 case ICmpInst::ICMP_SGT: // (X s> 13 | X s> 15) -> X > 13
4041 return ReplaceInstUsesWith(I, LHS);
4042 case ICmpInst::ICMP_UGT: // (X s> 13 | X u> 15) -> no change
4044 case ICmpInst::ICMP_NE: // (X s> 13 | X != 15) -> true
4045 case ICmpInst::ICMP_SLT: // (X s> 13 | X s< 15) -> true
4046 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4047 case ICmpInst::ICMP_ULT: // (X s> 13 | X u< 15) -> no change
4055 // fold (or (cast A), (cast B)) -> (cast (or A, B))
4056 if (CastInst *Op0C = dyn_cast<CastInst>(Op0))
4057 if (CastInst *Op1C = dyn_cast<CastInst>(Op1))
4058 if (Op0C->getOpcode() == Op1C->getOpcode()) {// same cast kind ?
4059 const Type *SrcTy = Op0C->getOperand(0)->getType();
4060 if (SrcTy == Op1C->getOperand(0)->getType() && SrcTy->isInteger() &&
4061 // Only do this if the casts both really cause code to be generated.
4062 ValueRequiresCast(Op0C->getOpcode(), Op0C->getOperand(0),
4064 ValueRequiresCast(Op1C->getOpcode(), Op1C->getOperand(0),
4066 Instruction *NewOp = BinaryOperator::createOr(Op0C->getOperand(0),
4067 Op1C->getOperand(0),
4069 InsertNewInstBefore(NewOp, I);
4070 return CastInst::create(Op0C->getOpcode(), NewOp, I.getType());
4075 return Changed ? &I : 0;
4078 // XorSelf - Implements: X ^ X --> 0
4081 XorSelf(Value *rhs) : RHS(rhs) {}
4082 bool shouldApply(Value *LHS) const { return LHS == RHS; }
4083 Instruction *apply(BinaryOperator &Xor) const {
4089 Instruction *InstCombiner::visitXor(BinaryOperator &I) {
4090 bool Changed = SimplifyCommutative(I);
4091 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
4093 if (isa<UndefValue>(Op1))
4094 return ReplaceInstUsesWith(I, Op1); // X ^ undef -> undef
4096 // xor X, X = 0, even if X is nested in a sequence of Xor's.
4097 if (Instruction *Result = AssociativeOpt(I, XorSelf(Op1))) {
4098 assert(Result == &I && "AssociativeOpt didn't work?");
4099 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
4102 // See if we can simplify any instructions used by the instruction whose sole
4103 // purpose is to compute bits we don't care about.
4104 if (!isa<VectorType>(I.getType())) {
4105 uint32_t BitWidth = cast<IntegerType>(I.getType())->getBitWidth();
4106 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
4107 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
4108 KnownZero, KnownOne))
4110 } else if (isa<ConstantAggregateZero>(Op1)) {
4111 return ReplaceInstUsesWith(I, Op0); // X ^ <0,0> -> X
4114 // Is this a ~ operation?
4115 if (Value *NotOp = dyn_castNotVal(&I)) {
4116 // ~(~X & Y) --> (X | ~Y) - De Morgan's Law
4117 // ~(~X | Y) === (X & ~Y) - De Morgan's Law
4118 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(NotOp)) {
4119 if (Op0I->getOpcode() == Instruction::And ||
4120 Op0I->getOpcode() == Instruction::Or) {
4121 if (dyn_castNotVal(Op0I->getOperand(1))) Op0I->swapOperands();
4122 if (Value *Op0NotVal = dyn_castNotVal(Op0I->getOperand(0))) {
4124 BinaryOperator::createNot(Op0I->getOperand(1),
4125 Op0I->getOperand(1)->getName()+".not");
4126 InsertNewInstBefore(NotY, I);
4127 if (Op0I->getOpcode() == Instruction::And)
4128 return BinaryOperator::createOr(Op0NotVal, NotY);
4130 return BinaryOperator::createAnd(Op0NotVal, NotY);
4137 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
4138 // xor (icmp A, B), true = not (icmp A, B) = !icmp A, B
4139 if (ICmpInst *ICI = dyn_cast<ICmpInst>(Op0))
4140 if (RHS == ConstantInt::getTrue() && ICI->hasOneUse())
4141 return new ICmpInst(ICI->getInversePredicate(),
4142 ICI->getOperand(0), ICI->getOperand(1));
4144 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0)) {
4145 // ~(c-X) == X-c-1 == X+(-c-1)
4146 if (Op0I->getOpcode() == Instruction::Sub && RHS->isAllOnesValue())
4147 if (Constant *Op0I0C = dyn_cast<Constant>(Op0I->getOperand(0))) {
4148 Constant *NegOp0I0C = ConstantExpr::getNeg(Op0I0C);
4149 Constant *ConstantRHS = ConstantExpr::getSub(NegOp0I0C,
4150 ConstantInt::get(I.getType(), 1));
4151 return BinaryOperator::createAdd(Op0I->getOperand(1), ConstantRHS);
4154 if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1)))
4155 if (Op0I->getOpcode() == Instruction::Add) {
4156 // ~(X-c) --> (-c-1)-X
4157 if (RHS->isAllOnesValue()) {
4158 Constant *NegOp0CI = ConstantExpr::getNeg(Op0CI);
4159 return BinaryOperator::createSub(
4160 ConstantExpr::getSub(NegOp0CI,
4161 ConstantInt::get(I.getType(), 1)),
4162 Op0I->getOperand(0));
4163 } else if (RHS->getValue().isSignBit()) {
4164 // (X + C) ^ signbit -> (X + C + signbit)
4165 Constant *C = ConstantInt::get(RHS->getValue() + Op0CI->getValue());
4166 return BinaryOperator::createAdd(Op0I->getOperand(0), C);
4169 } else if (Op0I->getOpcode() == Instruction::Or) {
4170 // (X|C1)^C2 -> X^(C1|C2) iff X&~C1 == 0
4171 if (MaskedValueIsZero(Op0I->getOperand(0), Op0CI->getValue())) {
4172 Constant *NewRHS = ConstantExpr::getOr(Op0CI, RHS);
4173 // Anything in both C1 and C2 is known to be zero, remove it from
4175 Constant *CommonBits = And(Op0CI, RHS);
4176 NewRHS = ConstantExpr::getAnd(NewRHS,
4177 ConstantExpr::getNot(CommonBits));
4178 AddToWorkList(Op0I);
4179 I.setOperand(0, Op0I->getOperand(0));
4180 I.setOperand(1, NewRHS);
4186 // Try to fold constant and into select arguments.
4187 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
4188 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
4190 if (isa<PHINode>(Op0))
4191 if (Instruction *NV = FoldOpIntoPhi(I))
4195 if (Value *X = dyn_castNotVal(Op0)) // ~A ^ A == -1
4197 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
4199 if (Value *X = dyn_castNotVal(Op1)) // A ^ ~A == -1
4201 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
4204 BinaryOperator *Op1I = dyn_cast<BinaryOperator>(Op1);
4207 if (match(Op1I, m_Or(m_Value(A), m_Value(B)))) {
4208 if (A == Op0) { // B^(B|A) == (A|B)^B
4209 Op1I->swapOperands();
4211 std::swap(Op0, Op1);
4212 } else if (B == Op0) { // B^(A|B) == (A|B)^B
4213 I.swapOperands(); // Simplified below.
4214 std::swap(Op0, Op1);
4216 } else if (match(Op1I, m_Xor(m_Value(A), m_Value(B)))) {
4217 if (Op0 == A) // A^(A^B) == B
4218 return ReplaceInstUsesWith(I, B);
4219 else if (Op0 == B) // A^(B^A) == B
4220 return ReplaceInstUsesWith(I, A);
4221 } else if (match(Op1I, m_And(m_Value(A), m_Value(B))) && Op1I->hasOneUse()){
4222 if (A == Op0) { // A^(A&B) -> A^(B&A)
4223 Op1I->swapOperands();
4226 if (B == Op0) { // A^(B&A) -> (B&A)^A
4227 I.swapOperands(); // Simplified below.
4228 std::swap(Op0, Op1);
4233 BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0);
4236 if (match(Op0I, m_Or(m_Value(A), m_Value(B))) && Op0I->hasOneUse()) {
4237 if (A == Op1) // (B|A)^B == (A|B)^B
4239 if (B == Op1) { // (A|B)^B == A & ~B
4241 InsertNewInstBefore(BinaryOperator::createNot(Op1, "tmp"), I);
4242 return BinaryOperator::createAnd(A, NotB);
4244 } else if (match(Op0I, m_Xor(m_Value(A), m_Value(B)))) {
4245 if (Op1 == A) // (A^B)^A == B
4246 return ReplaceInstUsesWith(I, B);
4247 else if (Op1 == B) // (B^A)^A == B
4248 return ReplaceInstUsesWith(I, A);
4249 } else if (match(Op0I, m_And(m_Value(A), m_Value(B))) && Op0I->hasOneUse()){
4250 if (A == Op1) // (A&B)^A -> (B&A)^A
4252 if (B == Op1 && // (B&A)^A == ~B & A
4253 !isa<ConstantInt>(Op1)) { // Canonical form is (B&C)^C
4255 InsertNewInstBefore(BinaryOperator::createNot(A, "tmp"), I);
4256 return BinaryOperator::createAnd(N, Op1);
4261 // (X >> Z) ^ (Y >> Z) -> (X^Y) >> Z for all shifts.
4262 if (Op0I && Op1I && Op0I->isShift() &&
4263 Op0I->getOpcode() == Op1I->getOpcode() &&
4264 Op0I->getOperand(1) == Op1I->getOperand(1) &&
4265 (Op1I->hasOneUse() || Op1I->hasOneUse())) {
4266 Instruction *NewOp =
4267 InsertNewInstBefore(BinaryOperator::createXor(Op0I->getOperand(0),
4268 Op1I->getOperand(0),
4269 Op0I->getName()), I);
4270 return BinaryOperator::create(Op1I->getOpcode(), NewOp,
4271 Op1I->getOperand(1));
4275 Value *A, *B, *C, *D;
4276 // (A & B)^(A | B) -> A ^ B
4277 if (match(Op0I, m_And(m_Value(A), m_Value(B))) &&
4278 match(Op1I, m_Or(m_Value(C), m_Value(D)))) {
4279 if ((A == C && B == D) || (A == D && B == C))
4280 return BinaryOperator::createXor(A, B);
4282 // (A | B)^(A & B) -> A ^ B
4283 if (match(Op0I, m_Or(m_Value(A), m_Value(B))) &&
4284 match(Op1I, m_And(m_Value(C), m_Value(D)))) {
4285 if ((A == C && B == D) || (A == D && B == C))
4286 return BinaryOperator::createXor(A, B);
4290 if ((Op0I->hasOneUse() || Op1I->hasOneUse()) &&
4291 match(Op0I, m_And(m_Value(A), m_Value(B))) &&
4292 match(Op1I, m_And(m_Value(C), m_Value(D)))) {
4293 // (X & Y)^(X & Y) -> (Y^Z) & X
4294 Value *X = 0, *Y = 0, *Z = 0;
4296 X = A, Y = B, Z = D;
4298 X = A, Y = B, Z = C;
4300 X = B, Y = A, Z = D;
4302 X = B, Y = A, Z = C;
4305 Instruction *NewOp =
4306 InsertNewInstBefore(BinaryOperator::createXor(Y, Z, Op0->getName()), I);
4307 return BinaryOperator::createAnd(NewOp, X);
4312 // (icmp1 A, B) ^ (icmp2 A, B) --> (icmp3 A, B)
4313 if (ICmpInst *RHS = dyn_cast<ICmpInst>(I.getOperand(1)))
4314 if (Instruction *R = AssociativeOpt(I, FoldICmpLogical(*this, RHS)))
4317 // fold (xor (cast A), (cast B)) -> (cast (xor A, B))
4318 if (CastInst *Op0C = dyn_cast<CastInst>(Op0))
4319 if (CastInst *Op1C = dyn_cast<CastInst>(Op1))
4320 if (Op0C->getOpcode() == Op1C->getOpcode()) { // same cast kind?
4321 const Type *SrcTy = Op0C->getOperand(0)->getType();
4322 if (SrcTy == Op1C->getOperand(0)->getType() && SrcTy->isInteger() &&
4323 // Only do this if the casts both really cause code to be generated.
4324 ValueRequiresCast(Op0C->getOpcode(), Op0C->getOperand(0),
4326 ValueRequiresCast(Op1C->getOpcode(), Op1C->getOperand(0),
4328 Instruction *NewOp = BinaryOperator::createXor(Op0C->getOperand(0),
4329 Op1C->getOperand(0),
4331 InsertNewInstBefore(NewOp, I);
4332 return CastInst::create(Op0C->getOpcode(), NewOp, I.getType());
4336 return Changed ? &I : 0;
4339 /// AddWithOverflow - Compute Result = In1+In2, returning true if the result
4340 /// overflowed for this type.
4341 static bool AddWithOverflow(ConstantInt *&Result, ConstantInt *In1,
4342 ConstantInt *In2, bool IsSigned = false) {
4343 Result = cast<ConstantInt>(Add(In1, In2));
4346 if (In2->getValue().isNegative())
4347 return Result->getValue().sgt(In1->getValue());
4349 return Result->getValue().slt(In1->getValue());
4351 return Result->getValue().ult(In1->getValue());
4354 /// EmitGEPOffset - Given a getelementptr instruction/constantexpr, emit the
4355 /// code necessary to compute the offset from the base pointer (without adding
4356 /// in the base pointer). Return the result as a signed integer of intptr size.
4357 static Value *EmitGEPOffset(User *GEP, Instruction &I, InstCombiner &IC) {
4358 TargetData &TD = IC.getTargetData();
4359 gep_type_iterator GTI = gep_type_begin(GEP);
4360 const Type *IntPtrTy = TD.getIntPtrType();
4361 Value *Result = Constant::getNullValue(IntPtrTy);
4363 // Build a mask for high order bits.
4364 unsigned IntPtrWidth = TD.getPointerSize()*8;
4365 uint64_t PtrSizeMask = ~0ULL >> (64-IntPtrWidth);
4367 for (unsigned i = 1, e = GEP->getNumOperands(); i != e; ++i, ++GTI) {
4368 Value *Op = GEP->getOperand(i);
4369 uint64_t Size = TD.getTypeSize(GTI.getIndexedType()) & PtrSizeMask;
4370 if (ConstantInt *OpC = dyn_cast<ConstantInt>(Op)) {
4371 if (OpC->isZero()) continue;
4373 // Handle a struct index, which adds its field offset to the pointer.
4374 if (const StructType *STy = dyn_cast<StructType>(*GTI)) {
4375 Size = TD.getStructLayout(STy)->getElementOffset(OpC->getZExtValue());
4377 if (ConstantInt *RC = dyn_cast<ConstantInt>(Result))
4378 Result = ConstantInt::get(RC->getValue() + APInt(IntPtrWidth, Size));
4380 Result = IC.InsertNewInstBefore(
4381 BinaryOperator::createAdd(Result,
4382 ConstantInt::get(IntPtrTy, Size),
4383 GEP->getName()+".offs"), I);
4387 Constant *Scale = ConstantInt::get(IntPtrTy, Size);
4388 Constant *OC = ConstantExpr::getIntegerCast(OpC, IntPtrTy, true /*SExt*/);
4389 Scale = ConstantExpr::getMul(OC, Scale);
4390 if (Constant *RC = dyn_cast<Constant>(Result))
4391 Result = ConstantExpr::getAdd(RC, Scale);
4393 // Emit an add instruction.
4394 Result = IC.InsertNewInstBefore(
4395 BinaryOperator::createAdd(Result, Scale,
4396 GEP->getName()+".offs"), I);
4400 // Convert to correct type.
4401 if (Op->getType() != IntPtrTy) {
4402 if (Constant *OpC = dyn_cast<Constant>(Op))
4403 Op = ConstantExpr::getSExt(OpC, IntPtrTy);
4405 Op = IC.InsertNewInstBefore(new SExtInst(Op, IntPtrTy,
4406 Op->getName()+".c"), I);
4409 Constant *Scale = ConstantInt::get(IntPtrTy, Size);
4410 if (Constant *OpC = dyn_cast<Constant>(Op))
4411 Op = ConstantExpr::getMul(OpC, Scale);
4412 else // We'll let instcombine(mul) convert this to a shl if possible.
4413 Op = IC.InsertNewInstBefore(BinaryOperator::createMul(Op, Scale,
4414 GEP->getName()+".idx"), I);
4417 // Emit an add instruction.
4418 if (isa<Constant>(Op) && isa<Constant>(Result))
4419 Result = ConstantExpr::getAdd(cast<Constant>(Op),
4420 cast<Constant>(Result));
4422 Result = IC.InsertNewInstBefore(BinaryOperator::createAdd(Op, Result,
4423 GEP->getName()+".offs"), I);
4428 /// FoldGEPICmp - Fold comparisons between a GEP instruction and something
4429 /// else. At this point we know that the GEP is on the LHS of the comparison.
4430 Instruction *InstCombiner::FoldGEPICmp(User *GEPLHS, Value *RHS,
4431 ICmpInst::Predicate Cond,
4433 assert(dyn_castGetElementPtr(GEPLHS) && "LHS is not a getelementptr!");
4435 if (CastInst *CI = dyn_cast<CastInst>(RHS))
4436 if (isa<PointerType>(CI->getOperand(0)->getType()))
4437 RHS = CI->getOperand(0);
4439 Value *PtrBase = GEPLHS->getOperand(0);
4440 if (PtrBase == RHS) {
4441 // As an optimization, we don't actually have to compute the actual value of
4442 // OFFSET if this is a icmp_eq or icmp_ne comparison, just return whether
4443 // each index is zero or not.
4444 if (Cond == ICmpInst::ICMP_EQ || Cond == ICmpInst::ICMP_NE) {
4445 Instruction *InVal = 0;
4446 gep_type_iterator GTI = gep_type_begin(GEPLHS);
4447 for (unsigned i = 1, e = GEPLHS->getNumOperands(); i != e; ++i, ++GTI) {
4449 if (Constant *C = dyn_cast<Constant>(GEPLHS->getOperand(i))) {
4450 if (isa<UndefValue>(C)) // undef index -> undef.
4451 return ReplaceInstUsesWith(I, UndefValue::get(I.getType()));
4452 if (C->isNullValue())
4454 else if (TD->getTypeSize(GTI.getIndexedType()) == 0) {
4455 EmitIt = false; // This is indexing into a zero sized array?
4456 } else if (isa<ConstantInt>(C))
4457 return ReplaceInstUsesWith(I, // No comparison is needed here.
4458 ConstantInt::get(Type::Int1Ty,
4459 Cond == ICmpInst::ICMP_NE));
4464 new ICmpInst(Cond, GEPLHS->getOperand(i),
4465 Constant::getNullValue(GEPLHS->getOperand(i)->getType()));
4469 InVal = InsertNewInstBefore(InVal, I);
4470 InsertNewInstBefore(Comp, I);
4471 if (Cond == ICmpInst::ICMP_NE) // True if any are unequal
4472 InVal = BinaryOperator::createOr(InVal, Comp);
4473 else // True if all are equal
4474 InVal = BinaryOperator::createAnd(InVal, Comp);
4482 // No comparison is needed here, all indexes = 0
4483 ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty,
4484 Cond == ICmpInst::ICMP_EQ));
4487 // Only lower this if the icmp is the only user of the GEP or if we expect
4488 // the result to fold to a constant!
4489 if (isa<ConstantExpr>(GEPLHS) || GEPLHS->hasOneUse()) {
4490 // ((gep Ptr, OFFSET) cmp Ptr) ---> (OFFSET cmp 0).
4491 Value *Offset = EmitGEPOffset(GEPLHS, I, *this);
4492 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), Offset,
4493 Constant::getNullValue(Offset->getType()));
4495 } else if (User *GEPRHS = dyn_castGetElementPtr(RHS)) {
4496 // If the base pointers are different, but the indices are the same, just
4497 // compare the base pointer.
4498 if (PtrBase != GEPRHS->getOperand(0)) {
4499 bool IndicesTheSame = GEPLHS->getNumOperands()==GEPRHS->getNumOperands();
4500 IndicesTheSame &= GEPLHS->getOperand(0)->getType() ==
4501 GEPRHS->getOperand(0)->getType();
4503 for (unsigned i = 1, e = GEPLHS->getNumOperands(); i != e; ++i)
4504 if (GEPLHS->getOperand(i) != GEPRHS->getOperand(i)) {
4505 IndicesTheSame = false;
4509 // If all indices are the same, just compare the base pointers.
4511 return new ICmpInst(ICmpInst::getSignedPredicate(Cond),
4512 GEPLHS->getOperand(0), GEPRHS->getOperand(0));
4514 // Otherwise, the base pointers are different and the indices are
4515 // different, bail out.
4519 // If one of the GEPs has all zero indices, recurse.
4520 bool AllZeros = true;
4521 for (unsigned i = 1, e = GEPLHS->getNumOperands(); i != e; ++i)
4522 if (!isa<Constant>(GEPLHS->getOperand(i)) ||
4523 !cast<Constant>(GEPLHS->getOperand(i))->isNullValue()) {
4528 return FoldGEPICmp(GEPRHS, GEPLHS->getOperand(0),
4529 ICmpInst::getSwappedPredicate(Cond), I);
4531 // If the other GEP has all zero indices, recurse.
4533 for (unsigned i = 1, e = GEPRHS->getNumOperands(); i != e; ++i)
4534 if (!isa<Constant>(GEPRHS->getOperand(i)) ||
4535 !cast<Constant>(GEPRHS->getOperand(i))->isNullValue()) {
4540 return FoldGEPICmp(GEPLHS, GEPRHS->getOperand(0), Cond, I);
4542 if (GEPLHS->getNumOperands() == GEPRHS->getNumOperands()) {
4543 // If the GEPs only differ by one index, compare it.
4544 unsigned NumDifferences = 0; // Keep track of # differences.
4545 unsigned DiffOperand = 0; // The operand that differs.
4546 for (unsigned i = 1, e = GEPRHS->getNumOperands(); i != e; ++i)
4547 if (GEPLHS->getOperand(i) != GEPRHS->getOperand(i)) {
4548 if (GEPLHS->getOperand(i)->getType()->getPrimitiveSizeInBits() !=
4549 GEPRHS->getOperand(i)->getType()->getPrimitiveSizeInBits()) {
4550 // Irreconcilable differences.
4554 if (NumDifferences++) break;
4559 if (NumDifferences == 0) // SAME GEP?
4560 return ReplaceInstUsesWith(I, // No comparison is needed here.
4561 ConstantInt::get(Type::Int1Ty,
4562 Cond == ICmpInst::ICMP_EQ));
4563 else if (NumDifferences == 1) {
4564 Value *LHSV = GEPLHS->getOperand(DiffOperand);
4565 Value *RHSV = GEPRHS->getOperand(DiffOperand);
4566 // Make sure we do a signed comparison here.
4567 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), LHSV, RHSV);
4571 // Only lower this if the icmp is the only user of the GEP or if we expect
4572 // the result to fold to a constant!
4573 if ((isa<ConstantExpr>(GEPLHS) || GEPLHS->hasOneUse()) &&
4574 (isa<ConstantExpr>(GEPRHS) || GEPRHS->hasOneUse())) {
4575 // ((gep Ptr, OFFSET1) cmp (gep Ptr, OFFSET2) ---> (OFFSET1 cmp OFFSET2)
4576 Value *L = EmitGEPOffset(GEPLHS, I, *this);
4577 Value *R = EmitGEPOffset(GEPRHS, I, *this);
4578 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), L, R);
4584 Instruction *InstCombiner::visitFCmpInst(FCmpInst &I) {
4585 bool Changed = SimplifyCompare(I);
4586 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
4588 // Fold trivial predicates.
4589 if (I.getPredicate() == FCmpInst::FCMP_FALSE)
4590 return ReplaceInstUsesWith(I, Constant::getNullValue(Type::Int1Ty));
4591 if (I.getPredicate() == FCmpInst::FCMP_TRUE)
4592 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 1));
4594 // Simplify 'fcmp pred X, X'
4596 switch (I.getPredicate()) {
4597 default: assert(0 && "Unknown predicate!");
4598 case FCmpInst::FCMP_UEQ: // True if unordered or equal
4599 case FCmpInst::FCMP_UGE: // True if unordered, greater than, or equal
4600 case FCmpInst::FCMP_ULE: // True if unordered, less than, or equal
4601 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 1));
4602 case FCmpInst::FCMP_OGT: // True if ordered and greater than
4603 case FCmpInst::FCMP_OLT: // True if ordered and less than
4604 case FCmpInst::FCMP_ONE: // True if ordered and operands are unequal
4605 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 0));
4607 case FCmpInst::FCMP_UNO: // True if unordered: isnan(X) | isnan(Y)
4608 case FCmpInst::FCMP_ULT: // True if unordered or less than
4609 case FCmpInst::FCMP_UGT: // True if unordered or greater than
4610 case FCmpInst::FCMP_UNE: // True if unordered or not equal
4611 // Canonicalize these to be 'fcmp uno %X, 0.0'.
4612 I.setPredicate(FCmpInst::FCMP_UNO);
4613 I.setOperand(1, Constant::getNullValue(Op0->getType()));
4616 case FCmpInst::FCMP_ORD: // True if ordered (no nans)
4617 case FCmpInst::FCMP_OEQ: // True if ordered and equal
4618 case FCmpInst::FCMP_OGE: // True if ordered and greater than or equal
4619 case FCmpInst::FCMP_OLE: // True if ordered and less than or equal
4620 // Canonicalize these to be 'fcmp ord %X, 0.0'.
4621 I.setPredicate(FCmpInst::FCMP_ORD);
4622 I.setOperand(1, Constant::getNullValue(Op0->getType()));
4627 if (isa<UndefValue>(Op1)) // fcmp pred X, undef -> undef
4628 return ReplaceInstUsesWith(I, UndefValue::get(Type::Int1Ty));
4630 // Handle fcmp with constant RHS
4631 if (Constant *RHSC = dyn_cast<Constant>(Op1)) {
4632 if (Instruction *LHSI = dyn_cast<Instruction>(Op0))
4633 switch (LHSI->getOpcode()) {
4634 case Instruction::PHI:
4635 if (Instruction *NV = FoldOpIntoPhi(I))
4638 case Instruction::Select:
4639 // If either operand of the select is a constant, we can fold the
4640 // comparison into the select arms, which will cause one to be
4641 // constant folded and the select turned into a bitwise or.
4642 Value *Op1 = 0, *Op2 = 0;
4643 if (LHSI->hasOneUse()) {
4644 if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(1))) {
4645 // Fold the known value into the constant operand.
4646 Op1 = ConstantExpr::getCompare(I.getPredicate(), C, RHSC);
4647 // Insert a new FCmp of the other select operand.
4648 Op2 = InsertNewInstBefore(new FCmpInst(I.getPredicate(),
4649 LHSI->getOperand(2), RHSC,
4651 } else if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(2))) {
4652 // Fold the known value into the constant operand.
4653 Op2 = ConstantExpr::getCompare(I.getPredicate(), C, RHSC);
4654 // Insert a new FCmp of the other select operand.
4655 Op1 = InsertNewInstBefore(new FCmpInst(I.getPredicate(),
4656 LHSI->getOperand(1), RHSC,
4662 return new SelectInst(LHSI->getOperand(0), Op1, Op2);
4667 return Changed ? &I : 0;
4670 Instruction *InstCombiner::visitICmpInst(ICmpInst &I) {
4671 bool Changed = SimplifyCompare(I);
4672 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
4673 const Type *Ty = Op0->getType();
4677 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty,
4678 isTrueWhenEqual(I)));
4680 if (isa<UndefValue>(Op1)) // X icmp undef -> undef
4681 return ReplaceInstUsesWith(I, UndefValue::get(Type::Int1Ty));
4683 // icmp of GlobalValues can never equal each other as long as they aren't
4684 // external weak linkage type.
4685 if (GlobalValue *GV0 = dyn_cast<GlobalValue>(Op0))
4686 if (GlobalValue *GV1 = dyn_cast<GlobalValue>(Op1))
4687 if (!GV0->hasExternalWeakLinkage() || !GV1->hasExternalWeakLinkage())
4688 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty,
4689 !isTrueWhenEqual(I)));
4691 // icmp <global/alloca*/null>, <global/alloca*/null> - Global/Stack value
4692 // addresses never equal each other! We already know that Op0 != Op1.
4693 if ((isa<GlobalValue>(Op0) || isa<AllocaInst>(Op0) ||
4694 isa<ConstantPointerNull>(Op0)) &&
4695 (isa<GlobalValue>(Op1) || isa<AllocaInst>(Op1) ||
4696 isa<ConstantPointerNull>(Op1)))
4697 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty,
4698 !isTrueWhenEqual(I)));
4700 // icmp's with boolean values can always be turned into bitwise operations
4701 if (Ty == Type::Int1Ty) {
4702 switch (I.getPredicate()) {
4703 default: assert(0 && "Invalid icmp instruction!");
4704 case ICmpInst::ICMP_EQ: { // icmp eq bool %A, %B -> ~(A^B)
4705 Instruction *Xor = BinaryOperator::createXor(Op0, Op1, I.getName()+"tmp");
4706 InsertNewInstBefore(Xor, I);
4707 return BinaryOperator::createNot(Xor);
4709 case ICmpInst::ICMP_NE: // icmp eq bool %A, %B -> A^B
4710 return BinaryOperator::createXor(Op0, Op1);
4712 case ICmpInst::ICMP_UGT:
4713 case ICmpInst::ICMP_SGT:
4714 std::swap(Op0, Op1); // Change icmp gt -> icmp lt
4716 case ICmpInst::ICMP_ULT:
4717 case ICmpInst::ICMP_SLT: { // icmp lt bool A, B -> ~X & Y
4718 Instruction *Not = BinaryOperator::createNot(Op0, I.getName()+"tmp");
4719 InsertNewInstBefore(Not, I);
4720 return BinaryOperator::createAnd(Not, Op1);
4722 case ICmpInst::ICMP_UGE:
4723 case ICmpInst::ICMP_SGE:
4724 std::swap(Op0, Op1); // Change icmp ge -> icmp le
4726 case ICmpInst::ICMP_ULE:
4727 case ICmpInst::ICMP_SLE: { // icmp le bool %A, %B -> ~A | B
4728 Instruction *Not = BinaryOperator::createNot(Op0, I.getName()+"tmp");
4729 InsertNewInstBefore(Not, I);
4730 return BinaryOperator::createOr(Not, Op1);
4735 // See if we are doing a comparison between a constant and an instruction that
4736 // can be folded into the comparison.
4737 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
4738 switch (I.getPredicate()) {
4740 case ICmpInst::ICMP_ULT: // A <u MIN -> FALSE
4741 if (CI->isMinValue(false))
4742 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4743 if (CI->isMaxValue(false)) // A <u MAX -> A != MAX
4744 return new ICmpInst(ICmpInst::ICMP_NE, Op0,Op1);
4745 if (isMinValuePlusOne(CI,false)) // A <u MIN+1 -> A == MIN
4746 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, SubOne(CI));
4747 // (x <u 2147483648) -> (x >s -1) -> true if sign bit clear
4748 if (CI->isMinValue(true))
4749 return new ICmpInst(ICmpInst::ICMP_SGT, Op0,
4750 ConstantInt::getAllOnesValue(Op0->getType()));
4754 case ICmpInst::ICMP_SLT:
4755 if (CI->isMinValue(true)) // A <s MIN -> FALSE
4756 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4757 if (CI->isMaxValue(true)) // A <s MAX -> A != MAX
4758 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
4759 if (isMinValuePlusOne(CI,true)) // A <s MIN+1 -> A == MIN
4760 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, SubOne(CI));
4763 case ICmpInst::ICMP_UGT:
4764 if (CI->isMaxValue(false)) // A >u MAX -> FALSE
4765 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4766 if (CI->isMinValue(false)) // A >u MIN -> A != MIN
4767 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
4768 if (isMaxValueMinusOne(CI, false)) // A >u MAX-1 -> A == MAX
4769 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, AddOne(CI));
4771 // (x >u 2147483647) -> (x <s 0) -> true if sign bit set
4772 if (CI->isMaxValue(true))
4773 return new ICmpInst(ICmpInst::ICMP_SLT, Op0,
4774 ConstantInt::getNullValue(Op0->getType()));
4777 case ICmpInst::ICMP_SGT:
4778 if (CI->isMaxValue(true)) // A >s MAX -> FALSE
4779 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4780 if (CI->isMinValue(true)) // A >s MIN -> A != MIN
4781 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
4782 if (isMaxValueMinusOne(CI, true)) // A >s MAX-1 -> A == MAX
4783 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, AddOne(CI));
4786 case ICmpInst::ICMP_ULE:
4787 if (CI->isMaxValue(false)) // A <=u MAX -> TRUE
4788 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4789 if (CI->isMinValue(false)) // A <=u MIN -> A == MIN
4790 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, Op1);
4791 if (isMaxValueMinusOne(CI,false)) // A <=u MAX-1 -> A != MAX
4792 return new ICmpInst(ICmpInst::ICMP_NE, Op0, AddOne(CI));
4795 case ICmpInst::ICMP_SLE:
4796 if (CI->isMaxValue(true)) // A <=s MAX -> TRUE
4797 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4798 if (CI->isMinValue(true)) // A <=s MIN -> A == MIN
4799 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, Op1);
4800 if (isMaxValueMinusOne(CI,true)) // A <=s MAX-1 -> A != MAX
4801 return new ICmpInst(ICmpInst::ICMP_NE, Op0, AddOne(CI));
4804 case ICmpInst::ICMP_UGE:
4805 if (CI->isMinValue(false)) // A >=u MIN -> TRUE
4806 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4807 if (CI->isMaxValue(false)) // A >=u MAX -> A == MAX
4808 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, Op1);
4809 if (isMinValuePlusOne(CI,false)) // A >=u MIN-1 -> A != MIN
4810 return new ICmpInst(ICmpInst::ICMP_NE, Op0, SubOne(CI));
4813 case ICmpInst::ICMP_SGE:
4814 if (CI->isMinValue(true)) // A >=s MIN -> TRUE
4815 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4816 if (CI->isMaxValue(true)) // A >=s MAX -> A == MAX
4817 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, Op1);
4818 if (isMinValuePlusOne(CI,true)) // A >=s MIN-1 -> A != MIN
4819 return new ICmpInst(ICmpInst::ICMP_NE, Op0, SubOne(CI));
4823 // If we still have a icmp le or icmp ge instruction, turn it into the
4824 // appropriate icmp lt or icmp gt instruction. Since the border cases have
4825 // already been handled above, this requires little checking.
4827 switch (I.getPredicate()) {
4829 case ICmpInst::ICMP_ULE:
4830 return new ICmpInst(ICmpInst::ICMP_ULT, Op0, AddOne(CI));
4831 case ICmpInst::ICMP_SLE:
4832 return new ICmpInst(ICmpInst::ICMP_SLT, Op0, AddOne(CI));
4833 case ICmpInst::ICMP_UGE:
4834 return new ICmpInst( ICmpInst::ICMP_UGT, Op0, SubOne(CI));
4835 case ICmpInst::ICMP_SGE:
4836 return new ICmpInst(ICmpInst::ICMP_SGT, Op0, SubOne(CI));
4839 // See if we can fold the comparison based on bits known to be zero or one
4840 // in the input. If this comparison is a normal comparison, it demands all
4841 // bits, if it is a sign bit comparison, it only demands the sign bit.
4844 bool isSignBit = isSignBitCheck(I.getPredicate(), CI, UnusedBit);
4846 uint32_t BitWidth = cast<IntegerType>(Ty)->getBitWidth();
4847 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
4848 if (SimplifyDemandedBits(Op0,
4849 isSignBit ? APInt::getSignBit(BitWidth)
4850 : APInt::getAllOnesValue(BitWidth),
4851 KnownZero, KnownOne, 0))
4854 // Given the known and unknown bits, compute a range that the LHS could be
4856 if ((KnownOne | KnownZero) != 0) {
4857 // Compute the Min, Max and RHS values based on the known bits. For the
4858 // EQ and NE we use unsigned values.
4859 APInt Min(BitWidth, 0), Max(BitWidth, 0);
4860 const APInt& RHSVal = CI->getValue();
4861 if (ICmpInst::isSignedPredicate(I.getPredicate())) {
4862 ComputeSignedMinMaxValuesFromKnownBits(Ty, KnownZero, KnownOne, Min,
4865 ComputeUnsignedMinMaxValuesFromKnownBits(Ty, KnownZero, KnownOne, Min,
4868 switch (I.getPredicate()) { // LE/GE have been folded already.
4869 default: assert(0 && "Unknown icmp opcode!");
4870 case ICmpInst::ICMP_EQ:
4871 if (Max.ult(RHSVal) || Min.ugt(RHSVal))
4872 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4874 case ICmpInst::ICMP_NE:
4875 if (Max.ult(RHSVal) || Min.ugt(RHSVal))
4876 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4878 case ICmpInst::ICMP_ULT:
4879 if (Max.ult(RHSVal))
4880 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4881 if (Min.uge(RHSVal))
4882 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4884 case ICmpInst::ICMP_UGT:
4885 if (Min.ugt(RHSVal))
4886 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4887 if (Max.ule(RHSVal))
4888 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4890 case ICmpInst::ICMP_SLT:
4891 if (Max.slt(RHSVal))
4892 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4893 if (Min.sgt(RHSVal))
4894 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4896 case ICmpInst::ICMP_SGT:
4897 if (Min.sgt(RHSVal))
4898 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4899 if (Max.sle(RHSVal))
4900 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4905 // Since the RHS is a ConstantInt (CI), if the left hand side is an
4906 // instruction, see if that instruction also has constants so that the
4907 // instruction can be folded into the icmp
4908 if (Instruction *LHSI = dyn_cast<Instruction>(Op0))
4909 if (Instruction *Res = visitICmpInstWithInstAndIntCst(I, LHSI, CI))
4913 // Handle icmp with constant (but not simple integer constant) RHS
4914 if (Constant *RHSC = dyn_cast<Constant>(Op1)) {
4915 if (Instruction *LHSI = dyn_cast<Instruction>(Op0))
4916 switch (LHSI->getOpcode()) {
4917 case Instruction::GetElementPtr:
4918 if (RHSC->isNullValue()) {
4919 // icmp pred GEP (P, int 0, int 0, int 0), null -> icmp pred P, null
4920 bool isAllZeros = true;
4921 for (unsigned i = 1, e = LHSI->getNumOperands(); i != e; ++i)
4922 if (!isa<Constant>(LHSI->getOperand(i)) ||
4923 !cast<Constant>(LHSI->getOperand(i))->isNullValue()) {
4928 return new ICmpInst(I.getPredicate(), LHSI->getOperand(0),
4929 Constant::getNullValue(LHSI->getOperand(0)->getType()));
4933 case Instruction::PHI:
4934 if (Instruction *NV = FoldOpIntoPhi(I))
4937 case Instruction::Select: {
4938 // If either operand of the select is a constant, we can fold the
4939 // comparison into the select arms, which will cause one to be
4940 // constant folded and the select turned into a bitwise or.
4941 Value *Op1 = 0, *Op2 = 0;
4942 if (LHSI->hasOneUse()) {
4943 if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(1))) {
4944 // Fold the known value into the constant operand.
4945 Op1 = ConstantExpr::getICmp(I.getPredicate(), C, RHSC);
4946 // Insert a new ICmp of the other select operand.
4947 Op2 = InsertNewInstBefore(new ICmpInst(I.getPredicate(),
4948 LHSI->getOperand(2), RHSC,
4950 } else if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(2))) {
4951 // Fold the known value into the constant operand.
4952 Op2 = ConstantExpr::getICmp(I.getPredicate(), C, RHSC);
4953 // Insert a new ICmp of the other select operand.
4954 Op1 = InsertNewInstBefore(new ICmpInst(I.getPredicate(),
4955 LHSI->getOperand(1), RHSC,
4961 return new SelectInst(LHSI->getOperand(0), Op1, Op2);
4964 case Instruction::Malloc:
4965 // If we have (malloc != null), and if the malloc has a single use, we
4966 // can assume it is successful and remove the malloc.
4967 if (LHSI->hasOneUse() && isa<ConstantPointerNull>(RHSC)) {
4968 AddToWorkList(LHSI);
4969 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty,
4970 !isTrueWhenEqual(I)));
4976 // If we can optimize a 'icmp GEP, P' or 'icmp P, GEP', do so now.
4977 if (User *GEP = dyn_castGetElementPtr(Op0))
4978 if (Instruction *NI = FoldGEPICmp(GEP, Op1, I.getPredicate(), I))
4980 if (User *GEP = dyn_castGetElementPtr(Op1))
4981 if (Instruction *NI = FoldGEPICmp(GEP, Op0,
4982 ICmpInst::getSwappedPredicate(I.getPredicate()), I))
4985 // Test to see if the operands of the icmp are casted versions of other
4986 // values. If the ptr->ptr cast can be stripped off both arguments, we do so
4988 if (BitCastInst *CI = dyn_cast<BitCastInst>(Op0)) {
4989 if (isa<PointerType>(Op0->getType()) &&
4990 (isa<Constant>(Op1) || isa<BitCastInst>(Op1))) {
4991 // We keep moving the cast from the left operand over to the right
4992 // operand, where it can often be eliminated completely.
4993 Op0 = CI->getOperand(0);
4995 // If operand #1 is a bitcast instruction, it must also be a ptr->ptr cast
4996 // so eliminate it as well.
4997 if (BitCastInst *CI2 = dyn_cast<BitCastInst>(Op1))
4998 Op1 = CI2->getOperand(0);
5000 // If Op1 is a constant, we can fold the cast into the constant.
5001 if (Op0->getType() != Op1->getType())
5002 if (Constant *Op1C = dyn_cast<Constant>(Op1)) {
5003 Op1 = ConstantExpr::getBitCast(Op1C, Op0->getType());
5005 // Otherwise, cast the RHS right before the icmp
5006 Op1 = InsertCastBefore(Instruction::BitCast, Op1, Op0->getType(), I);
5008 return new ICmpInst(I.getPredicate(), Op0, Op1);
5012 if (isa<CastInst>(Op0)) {
5013 // Handle the special case of: icmp (cast bool to X), <cst>
5014 // This comes up when you have code like
5017 // For generality, we handle any zero-extension of any operand comparison
5018 // with a constant or another cast from the same type.
5019 if (isa<ConstantInt>(Op1) || isa<CastInst>(Op1))
5020 if (Instruction *R = visitICmpInstWithCastAndCast(I))
5024 if (I.isEquality()) {
5025 Value *A, *B, *C, *D;
5026 if (match(Op0, m_Xor(m_Value(A), m_Value(B)))) {
5027 if (A == Op1 || B == Op1) { // (A^B) == A -> B == 0
5028 Value *OtherVal = A == Op1 ? B : A;
5029 return new ICmpInst(I.getPredicate(), OtherVal,
5030 Constant::getNullValue(A->getType()));
5033 if (match(Op1, m_Xor(m_Value(C), m_Value(D)))) {
5034 // A^c1 == C^c2 --> A == C^(c1^c2)
5035 if (ConstantInt *C1 = dyn_cast<ConstantInt>(B))
5036 if (ConstantInt *C2 = dyn_cast<ConstantInt>(D))
5037 if (Op1->hasOneUse()) {
5038 Constant *NC = ConstantInt::get(C1->getValue() ^ C2->getValue());
5039 Instruction *Xor = BinaryOperator::createXor(C, NC, "tmp");
5040 return new ICmpInst(I.getPredicate(), A,
5041 InsertNewInstBefore(Xor, I));
5044 // A^B == A^D -> B == D
5045 if (A == C) return new ICmpInst(I.getPredicate(), B, D);
5046 if (A == D) return new ICmpInst(I.getPredicate(), B, C);
5047 if (B == C) return new ICmpInst(I.getPredicate(), A, D);
5048 if (B == D) return new ICmpInst(I.getPredicate(), A, C);
5052 if (match(Op1, m_Xor(m_Value(A), m_Value(B))) &&
5053 (A == Op0 || B == Op0)) {
5054 // A == (A^B) -> B == 0
5055 Value *OtherVal = A == Op0 ? B : A;
5056 return new ICmpInst(I.getPredicate(), OtherVal,
5057 Constant::getNullValue(A->getType()));
5059 if (match(Op0, m_Sub(m_Value(A), m_Value(B))) && A == Op1) {
5060 // (A-B) == A -> B == 0
5061 return new ICmpInst(I.getPredicate(), B,
5062 Constant::getNullValue(B->getType()));
5064 if (match(Op1, m_Sub(m_Value(A), m_Value(B))) && A == Op0) {
5065 // A == (A-B) -> B == 0
5066 return new ICmpInst(I.getPredicate(), B,
5067 Constant::getNullValue(B->getType()));
5070 // (X&Z) == (Y&Z) -> (X^Y) & Z == 0
5071 if (Op0->hasOneUse() && Op1->hasOneUse() &&
5072 match(Op0, m_And(m_Value(A), m_Value(B))) &&
5073 match(Op1, m_And(m_Value(C), m_Value(D)))) {
5074 Value *X = 0, *Y = 0, *Z = 0;
5077 X = B; Y = D; Z = A;
5078 } else if (A == D) {
5079 X = B; Y = C; Z = A;
5080 } else if (B == C) {
5081 X = A; Y = D; Z = B;
5082 } else if (B == D) {
5083 X = A; Y = C; Z = B;
5086 if (X) { // Build (X^Y) & Z
5087 Op1 = InsertNewInstBefore(BinaryOperator::createXor(X, Y, "tmp"), I);
5088 Op1 = InsertNewInstBefore(BinaryOperator::createAnd(Op1, Z, "tmp"), I);
5089 I.setOperand(0, Op1);
5090 I.setOperand(1, Constant::getNullValue(Op1->getType()));
5095 return Changed ? &I : 0;
5099 /// FoldICmpDivCst - Fold "icmp pred, ([su]div X, DivRHS), CmpRHS" where DivRHS
5100 /// and CmpRHS are both known to be integer constants.
5101 Instruction *InstCombiner::FoldICmpDivCst(ICmpInst &ICI, BinaryOperator *DivI,
5102 ConstantInt *DivRHS) {
5103 ConstantInt *CmpRHS = cast<ConstantInt>(ICI.getOperand(1));
5104 const APInt &CmpRHSV = CmpRHS->getValue();
5106 // FIXME: If the operand types don't match the type of the divide
5107 // then don't attempt this transform. The code below doesn't have the
5108 // logic to deal with a signed divide and an unsigned compare (and
5109 // vice versa). This is because (x /s C1) <s C2 produces different
5110 // results than (x /s C1) <u C2 or (x /u C1) <s C2 or even
5111 // (x /u C1) <u C2. Simply casting the operands and result won't
5112 // work. :( The if statement below tests that condition and bails
5114 bool DivIsSigned = DivI->getOpcode() == Instruction::SDiv;
5115 if (!ICI.isEquality() && DivIsSigned != ICI.isSignedPredicate())
5117 if (DivRHS->isZero())
5118 return 0; // The ProdOV computation fails on divide by zero.
5120 // Compute Prod = CI * DivRHS. We are essentially solving an equation
5121 // of form X/C1=C2. We solve for X by multiplying C1 (DivRHS) and
5122 // C2 (CI). By solving for X we can turn this into a range check
5123 // instead of computing a divide.
5124 ConstantInt *Prod = Multiply(CmpRHS, DivRHS);
5126 // Determine if the product overflows by seeing if the product is
5127 // not equal to the divide. Make sure we do the same kind of divide
5128 // as in the LHS instruction that we're folding.
5129 bool ProdOV = (DivIsSigned ? ConstantExpr::getSDiv(Prod, DivRHS) :
5130 ConstantExpr::getUDiv(Prod, DivRHS)) != CmpRHS;
5132 // Get the ICmp opcode
5133 ICmpInst::Predicate Pred = ICI.getPredicate();
5135 // Figure out the interval that is being checked. For example, a comparison
5136 // like "X /u 5 == 0" is really checking that X is in the interval [0, 5).
5137 // Compute this interval based on the constants involved and the signedness of
5138 // the compare/divide. This computes a half-open interval, keeping track of
5139 // whether either value in the interval overflows. After analysis each
5140 // overflow variable is set to 0 if it's corresponding bound variable is valid
5141 // -1 if overflowed off the bottom end, or +1 if overflowed off the top end.
5142 int LoOverflow = 0, HiOverflow = 0;
5143 ConstantInt *LoBound = 0, *HiBound = 0;
5146 if (!DivIsSigned) { // udiv
5147 // e.g. X/5 op 3 --> [15, 20)
5149 HiOverflow = LoOverflow = ProdOV;
5151 HiOverflow = AddWithOverflow(HiBound, LoBound, DivRHS, false);
5152 } else if (DivRHS->getValue().isPositive()) { // Divisor is > 0.
5153 if (CmpRHSV == 0) { // (X / pos) op 0
5154 // Can't overflow. e.g. X/2 op 0 --> [-1, 2)
5155 LoBound = cast<ConstantInt>(ConstantExpr::getNeg(SubOne(DivRHS)));
5157 } else if (CmpRHSV.isPositive()) { // (X / pos) op pos
5158 LoBound = Prod; // e.g. X/5 op 3 --> [15, 20)
5159 HiOverflow = LoOverflow = ProdOV;
5161 HiOverflow = AddWithOverflow(HiBound, Prod, DivRHS, true);
5162 } else { // (X / pos) op neg
5163 // e.g. X/5 op -3 --> [-15-4, -15+1) --> [-19, -14)
5164 Constant *DivRHSH = ConstantExpr::getNeg(SubOne(DivRHS));
5165 LoOverflow = AddWithOverflow(LoBound, Prod,
5166 cast<ConstantInt>(DivRHSH), true) ? -1 : 0;
5167 HiBound = AddOne(Prod);
5168 HiOverflow = ProdOV ? -1 : 0;
5170 } else { // Divisor is < 0.
5171 if (CmpRHSV == 0) { // (X / neg) op 0
5172 // e.g. X/-5 op 0 --> [-4, 5)
5173 LoBound = AddOne(DivRHS);
5174 HiBound = cast<ConstantInt>(ConstantExpr::getNeg(DivRHS));
5175 if (HiBound == DivRHS) { // -INTMIN = INTMIN
5176 HiOverflow = 1; // [INTMIN+1, overflow)
5177 HiBound = 0; // e.g. X/INTMIN = 0 --> X > INTMIN
5179 } else if (CmpRHSV.isPositive()) { // (X / neg) op pos
5180 // e.g. X/-5 op 3 --> [-19, -14)
5181 HiOverflow = LoOverflow = ProdOV ? -1 : 0;
5183 LoOverflow = AddWithOverflow(LoBound, Prod, AddOne(DivRHS), true) ?-1:0;
5184 HiBound = AddOne(Prod);
5185 } else { // (X / neg) op neg
5186 // e.g. X/-5 op -3 --> [15, 20)
5188 LoOverflow = HiOverflow = ProdOV ? 1 : 0;
5189 HiBound = Subtract(Prod, DivRHS);
5192 // Dividing by a negative swaps the condition. LT <-> GT
5193 Pred = ICmpInst::getSwappedPredicate(Pred);
5196 Value *X = DivI->getOperand(0);
5198 default: assert(0 && "Unhandled icmp opcode!");
5199 case ICmpInst::ICMP_EQ:
5200 if (LoOverflow && HiOverflow)
5201 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
5202 else if (HiOverflow)
5203 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SGE :
5204 ICmpInst::ICMP_UGE, X, LoBound);
5205 else if (LoOverflow)
5206 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SLT :
5207 ICmpInst::ICMP_ULT, X, HiBound);
5209 return InsertRangeTest(X, LoBound, HiBound, DivIsSigned, true, ICI);
5210 case ICmpInst::ICMP_NE:
5211 if (LoOverflow && HiOverflow)
5212 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
5213 else if (HiOverflow)
5214 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SLT :
5215 ICmpInst::ICMP_ULT, X, LoBound);
5216 else if (LoOverflow)
5217 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SGE :
5218 ICmpInst::ICMP_UGE, X, HiBound);
5220 return InsertRangeTest(X, LoBound, HiBound, DivIsSigned, false, ICI);
5221 case ICmpInst::ICMP_ULT:
5222 case ICmpInst::ICMP_SLT:
5223 if (LoOverflow == +1) // Low bound is greater than input range.
5224 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
5225 if (LoOverflow == -1) // Low bound is less than input range.
5226 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
5227 return new ICmpInst(Pred, X, LoBound);
5228 case ICmpInst::ICMP_UGT:
5229 case ICmpInst::ICMP_SGT:
5230 if (HiOverflow == +1) // High bound greater than input range.
5231 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
5232 else if (HiOverflow == -1) // High bound less than input range.
5233 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
5234 if (Pred == ICmpInst::ICMP_UGT)
5235 return new ICmpInst(ICmpInst::ICMP_UGE, X, HiBound);
5237 return new ICmpInst(ICmpInst::ICMP_SGE, X, HiBound);
5242 /// visitICmpInstWithInstAndIntCst - Handle "icmp (instr, intcst)".
5244 Instruction *InstCombiner::visitICmpInstWithInstAndIntCst(ICmpInst &ICI,
5247 const APInt &RHSV = RHS->getValue();
5249 switch (LHSI->getOpcode()) {
5250 case Instruction::Xor: // (icmp pred (xor X, XorCST), CI)
5251 if (ConstantInt *XorCST = dyn_cast<ConstantInt>(LHSI->getOperand(1))) {
5252 // If this is a comparison that tests the signbit (X < 0) or (x > -1),
5254 if (ICI.getPredicate() == ICmpInst::ICMP_SLT && RHSV == 0 ||
5255 ICI.getPredicate() == ICmpInst::ICMP_SGT && RHSV.isAllOnesValue()) {
5256 Value *CompareVal = LHSI->getOperand(0);
5258 // If the sign bit of the XorCST is not set, there is no change to
5259 // the operation, just stop using the Xor.
5260 if (!XorCST->getValue().isNegative()) {
5261 ICI.setOperand(0, CompareVal);
5262 AddToWorkList(LHSI);
5266 // Was the old condition true if the operand is positive?
5267 bool isTrueIfPositive = ICI.getPredicate() == ICmpInst::ICMP_SGT;
5269 // If so, the new one isn't.
5270 isTrueIfPositive ^= true;
5272 if (isTrueIfPositive)
5273 return new ICmpInst(ICmpInst::ICMP_SGT, CompareVal, SubOne(RHS));
5275 return new ICmpInst(ICmpInst::ICMP_SLT, CompareVal, AddOne(RHS));
5279 case Instruction::And: // (icmp pred (and X, AndCST), RHS)
5280 if (LHSI->hasOneUse() && isa<ConstantInt>(LHSI->getOperand(1)) &&
5281 LHSI->getOperand(0)->hasOneUse()) {
5282 ConstantInt *AndCST = cast<ConstantInt>(LHSI->getOperand(1));
5284 // If the LHS is an AND of a truncating cast, we can widen the
5285 // and/compare to be the input width without changing the value
5286 // produced, eliminating a cast.
5287 if (TruncInst *Cast = dyn_cast<TruncInst>(LHSI->getOperand(0))) {
5288 // We can do this transformation if either the AND constant does not
5289 // have its sign bit set or if it is an equality comparison.
5290 // Extending a relational comparison when we're checking the sign
5291 // bit would not work.
5292 if (Cast->hasOneUse() &&
5293 (ICI.isEquality() || AndCST->getValue().isPositive() &&
5294 RHSV.isPositive())) {
5296 cast<IntegerType>(Cast->getOperand(0)->getType())->getBitWidth();
5297 APInt NewCST = AndCST->getValue();
5298 NewCST.zext(BitWidth);
5300 NewCI.zext(BitWidth);
5301 Instruction *NewAnd =
5302 BinaryOperator::createAnd(Cast->getOperand(0),
5303 ConstantInt::get(NewCST),LHSI->getName());
5304 InsertNewInstBefore(NewAnd, ICI);
5305 return new ICmpInst(ICI.getPredicate(), NewAnd,
5306 ConstantInt::get(NewCI));
5310 // If this is: (X >> C1) & C2 != C3 (where any shift and any compare
5311 // could exist), turn it into (X & (C2 << C1)) != (C3 << C1). This
5312 // happens a LOT in code produced by the C front-end, for bitfield
5314 BinaryOperator *Shift = dyn_cast<BinaryOperator>(LHSI->getOperand(0));
5315 if (Shift && !Shift->isShift())
5319 ShAmt = Shift ? dyn_cast<ConstantInt>(Shift->getOperand(1)) : 0;
5320 const Type *Ty = Shift ? Shift->getType() : 0; // Type of the shift.
5321 const Type *AndTy = AndCST->getType(); // Type of the and.
5323 // We can fold this as long as we can't shift unknown bits
5324 // into the mask. This can only happen with signed shift
5325 // rights, as they sign-extend.
5327 bool CanFold = Shift->isLogicalShift();
5329 // To test for the bad case of the signed shr, see if any
5330 // of the bits shifted in could be tested after the mask.
5331 uint32_t TyBits = Ty->getPrimitiveSizeInBits();
5332 int ShAmtVal = TyBits - ShAmt->getLimitedValue(TyBits);
5334 uint32_t BitWidth = AndTy->getPrimitiveSizeInBits();
5335 if ((APInt::getHighBitsSet(BitWidth, BitWidth-ShAmtVal) &
5336 AndCST->getValue()) == 0)
5342 if (Shift->getOpcode() == Instruction::Shl)
5343 NewCst = ConstantExpr::getLShr(RHS, ShAmt);
5345 NewCst = ConstantExpr::getShl(RHS, ShAmt);
5347 // Check to see if we are shifting out any of the bits being
5349 if (ConstantExpr::get(Shift->getOpcode(), NewCst, ShAmt) != RHS) {
5350 // If we shifted bits out, the fold is not going to work out.
5351 // As a special case, check to see if this means that the
5352 // result is always true or false now.
5353 if (ICI.getPredicate() == ICmpInst::ICMP_EQ)
5354 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
5355 if (ICI.getPredicate() == ICmpInst::ICMP_NE)
5356 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
5358 ICI.setOperand(1, NewCst);
5359 Constant *NewAndCST;
5360 if (Shift->getOpcode() == Instruction::Shl)
5361 NewAndCST = ConstantExpr::getLShr(AndCST, ShAmt);
5363 NewAndCST = ConstantExpr::getShl(AndCST, ShAmt);
5364 LHSI->setOperand(1, NewAndCST);
5365 LHSI->setOperand(0, Shift->getOperand(0));
5366 AddToWorkList(Shift); // Shift is dead.
5367 AddUsesToWorkList(ICI);
5373 // Turn ((X >> Y) & C) == 0 into (X & (C << Y)) == 0. The later is
5374 // preferable because it allows the C<<Y expression to be hoisted out
5375 // of a loop if Y is invariant and X is not.
5376 if (Shift && Shift->hasOneUse() && RHSV == 0 &&
5377 ICI.isEquality() && !Shift->isArithmeticShift() &&
5378 isa<Instruction>(Shift->getOperand(0))) {
5381 if (Shift->getOpcode() == Instruction::LShr) {
5382 NS = BinaryOperator::createShl(AndCST,
5383 Shift->getOperand(1), "tmp");
5385 // Insert a logical shift.
5386 NS = BinaryOperator::createLShr(AndCST,
5387 Shift->getOperand(1), "tmp");
5389 InsertNewInstBefore(cast<Instruction>(NS), ICI);
5391 // Compute X & (C << Y).
5392 Instruction *NewAnd =
5393 BinaryOperator::createAnd(Shift->getOperand(0), NS, LHSI->getName());
5394 InsertNewInstBefore(NewAnd, ICI);
5396 ICI.setOperand(0, NewAnd);
5402 case Instruction::Shl: { // (icmp pred (shl X, ShAmt), CI)
5403 ConstantInt *ShAmt = dyn_cast<ConstantInt>(LHSI->getOperand(1));
5406 uint32_t TypeBits = RHSV.getBitWidth();
5408 // Check that the shift amount is in range. If not, don't perform
5409 // undefined shifts. When the shift is visited it will be
5411 if (ShAmt->uge(TypeBits))
5414 if (ICI.isEquality()) {
5415 // If we are comparing against bits always shifted out, the
5416 // comparison cannot succeed.
5418 ConstantExpr::getShl(ConstantExpr::getLShr(RHS, ShAmt), ShAmt);
5419 if (Comp != RHS) {// Comparing against a bit that we know is zero.
5420 bool IsICMP_NE = ICI.getPredicate() == ICmpInst::ICMP_NE;
5421 Constant *Cst = ConstantInt::get(Type::Int1Ty, IsICMP_NE);
5422 return ReplaceInstUsesWith(ICI, Cst);
5425 if (LHSI->hasOneUse()) {
5426 // Otherwise strength reduce the shift into an and.
5427 uint32_t ShAmtVal = (uint32_t)ShAmt->getLimitedValue(TypeBits);
5429 ConstantInt::get(APInt::getLowBitsSet(TypeBits, TypeBits-ShAmtVal));
5432 BinaryOperator::createAnd(LHSI->getOperand(0),
5433 Mask, LHSI->getName()+".mask");
5434 Value *And = InsertNewInstBefore(AndI, ICI);
5435 return new ICmpInst(ICI.getPredicate(), And,
5436 ConstantInt::get(RHSV.lshr(ShAmtVal)));
5440 // Otherwise, if this is a comparison of the sign bit, simplify to and/test.
5441 bool TrueIfSigned = false;
5442 if (LHSI->hasOneUse() &&
5443 isSignBitCheck(ICI.getPredicate(), RHS, TrueIfSigned)) {
5444 // (X << 31) <s 0 --> (X&1) != 0
5445 Constant *Mask = ConstantInt::get(APInt(TypeBits, 1) <<
5446 (TypeBits-ShAmt->getZExtValue()-1));
5448 BinaryOperator::createAnd(LHSI->getOperand(0),
5449 Mask, LHSI->getName()+".mask");
5450 Value *And = InsertNewInstBefore(AndI, ICI);
5452 return new ICmpInst(TrueIfSigned ? ICmpInst::ICMP_NE : ICmpInst::ICMP_EQ,
5453 And, Constant::getNullValue(And->getType()));
5458 case Instruction::LShr: // (icmp pred (shr X, ShAmt), CI)
5459 case Instruction::AShr: {
5460 ConstantInt *ShAmt = dyn_cast<ConstantInt>(LHSI->getOperand(1));
5463 if (ICI.isEquality()) {
5464 // Check that the shift amount is in range. If not, don't perform
5465 // undefined shifts. When the shift is visited it will be
5467 uint32_t TypeBits = RHSV.getBitWidth();
5468 if (ShAmt->uge(TypeBits))
5470 uint32_t ShAmtVal = (uint32_t)ShAmt->getLimitedValue(TypeBits);
5472 // If we are comparing against bits always shifted out, the
5473 // comparison cannot succeed.
5474 APInt Comp = RHSV << ShAmtVal;
5475 if (LHSI->getOpcode() == Instruction::LShr)
5476 Comp = Comp.lshr(ShAmtVal);
5478 Comp = Comp.ashr(ShAmtVal);
5480 if (Comp != RHSV) { // Comparing against a bit that we know is zero.
5481 bool IsICMP_NE = ICI.getPredicate() == ICmpInst::ICMP_NE;
5482 Constant *Cst = ConstantInt::get(Type::Int1Ty, IsICMP_NE);
5483 return ReplaceInstUsesWith(ICI, Cst);
5486 if (LHSI->hasOneUse() || RHSV == 0) {
5487 // Otherwise strength reduce the shift into an and.
5488 APInt Val(APInt::getHighBitsSet(TypeBits, TypeBits - ShAmtVal));
5489 Constant *Mask = ConstantInt::get(Val);
5492 BinaryOperator::createAnd(LHSI->getOperand(0),
5493 Mask, LHSI->getName()+".mask");
5494 Value *And = InsertNewInstBefore(AndI, ICI);
5495 return new ICmpInst(ICI.getPredicate(), And,
5496 ConstantExpr::getShl(RHS, ShAmt));
5502 case Instruction::SDiv:
5503 case Instruction::UDiv:
5504 // Fold: icmp pred ([us]div X, C1), C2 -> range test
5505 // Fold this div into the comparison, producing a range check.
5506 // Determine, based on the divide type, what the range is being
5507 // checked. If there is an overflow on the low or high side, remember
5508 // it, otherwise compute the range [low, hi) bounding the new value.
5509 // See: InsertRangeTest above for the kinds of replacements possible.
5510 if (ConstantInt *DivRHS = dyn_cast<ConstantInt>(LHSI->getOperand(1)))
5511 if (Instruction *R = FoldICmpDivCst(ICI, cast<BinaryOperator>(LHSI),
5517 // Simplify icmp_eq and icmp_ne instructions with integer constant RHS.
5518 if (ICI.isEquality()) {
5519 bool isICMP_NE = ICI.getPredicate() == ICmpInst::ICMP_NE;
5521 // If the first operand is (add|sub|and|or|xor|rem) with a constant, and
5522 // the second operand is a constant, simplify a bit.
5523 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(LHSI)) {
5524 switch (BO->getOpcode()) {
5525 case Instruction::SRem:
5526 // If we have a signed (X % (2^c)) == 0, turn it into an unsigned one.
5527 if (RHSV == 0 && isa<ConstantInt>(BO->getOperand(1)) &&BO->hasOneUse()){
5528 const APInt &V = cast<ConstantInt>(BO->getOperand(1))->getValue();
5529 if (V.sgt(APInt(V.getBitWidth(), 1)) && V.isPowerOf2()) {
5530 Instruction *NewRem =
5531 BinaryOperator::createURem(BO->getOperand(0), BO->getOperand(1),
5533 InsertNewInstBefore(NewRem, ICI);
5534 return new ICmpInst(ICI.getPredicate(), NewRem,
5535 Constant::getNullValue(BO->getType()));
5539 case Instruction::Add:
5540 // Replace ((add A, B) != C) with (A != C-B) if B & C are constants.
5541 if (ConstantInt *BOp1C = dyn_cast<ConstantInt>(BO->getOperand(1))) {
5542 if (BO->hasOneUse())
5543 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
5544 Subtract(RHS, BOp1C));
5545 } else if (RHSV == 0) {
5546 // Replace ((add A, B) != 0) with (A != -B) if A or B is
5547 // efficiently invertible, or if the add has just this one use.
5548 Value *BOp0 = BO->getOperand(0), *BOp1 = BO->getOperand(1);
5550 if (Value *NegVal = dyn_castNegVal(BOp1))
5551 return new ICmpInst(ICI.getPredicate(), BOp0, NegVal);
5552 else if (Value *NegVal = dyn_castNegVal(BOp0))
5553 return new ICmpInst(ICI.getPredicate(), NegVal, BOp1);
5554 else if (BO->hasOneUse()) {
5555 Instruction *Neg = BinaryOperator::createNeg(BOp1);
5556 InsertNewInstBefore(Neg, ICI);
5558 return new ICmpInst(ICI.getPredicate(), BOp0, Neg);
5562 case Instruction::Xor:
5563 // For the xor case, we can xor two constants together, eliminating
5564 // the explicit xor.
5565 if (Constant *BOC = dyn_cast<Constant>(BO->getOperand(1)))
5566 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
5567 ConstantExpr::getXor(RHS, BOC));
5570 case Instruction::Sub:
5571 // Replace (([sub|xor] A, B) != 0) with (A != B)
5573 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
5577 case Instruction::Or:
5578 // If bits are being or'd in that are not present in the constant we
5579 // are comparing against, then the comparison could never succeed!
5580 if (Constant *BOC = dyn_cast<Constant>(BO->getOperand(1))) {
5581 Constant *NotCI = ConstantExpr::getNot(RHS);
5582 if (!ConstantExpr::getAnd(BOC, NotCI)->isNullValue())
5583 return ReplaceInstUsesWith(ICI, ConstantInt::get(Type::Int1Ty,
5588 case Instruction::And:
5589 if (ConstantInt *BOC = dyn_cast<ConstantInt>(BO->getOperand(1))) {
5590 // If bits are being compared against that are and'd out, then the
5591 // comparison can never succeed!
5592 if ((RHSV & ~BOC->getValue()) != 0)
5593 return ReplaceInstUsesWith(ICI, ConstantInt::get(Type::Int1Ty,
5596 // If we have ((X & C) == C), turn it into ((X & C) != 0).
5597 if (RHS == BOC && RHSV.isPowerOf2())
5598 return new ICmpInst(isICMP_NE ? ICmpInst::ICMP_EQ :
5599 ICmpInst::ICMP_NE, LHSI,
5600 Constant::getNullValue(RHS->getType()));
5602 // Replace (and X, (1 << size(X)-1) != 0) with x s< 0
5603 if (isSignBit(BOC)) {
5604 Value *X = BO->getOperand(0);
5605 Constant *Zero = Constant::getNullValue(X->getType());
5606 ICmpInst::Predicate pred = isICMP_NE ?
5607 ICmpInst::ICMP_SLT : ICmpInst::ICMP_SGE;
5608 return new ICmpInst(pred, X, Zero);
5611 // ((X & ~7) == 0) --> X < 8
5612 if (RHSV == 0 && isHighOnes(BOC)) {
5613 Value *X = BO->getOperand(0);
5614 Constant *NegX = ConstantExpr::getNeg(BOC);
5615 ICmpInst::Predicate pred = isICMP_NE ?
5616 ICmpInst::ICMP_UGE : ICmpInst::ICMP_ULT;
5617 return new ICmpInst(pred, X, NegX);
5622 } else if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(LHSI)) {
5623 // Handle icmp {eq|ne} <intrinsic>, intcst.
5624 if (II->getIntrinsicID() == Intrinsic::bswap) {
5626 ICI.setOperand(0, II->getOperand(1));
5627 ICI.setOperand(1, ConstantInt::get(RHSV.byteSwap()));
5631 } else { // Not a ICMP_EQ/ICMP_NE
5632 // If the LHS is a cast from an integral value of the same size,
5633 // then since we know the RHS is a constant, try to simlify.
5634 if (CastInst *Cast = dyn_cast<CastInst>(LHSI)) {
5635 Value *CastOp = Cast->getOperand(0);
5636 const Type *SrcTy = CastOp->getType();
5637 uint32_t SrcTySize = SrcTy->getPrimitiveSizeInBits();
5638 if (SrcTy->isInteger() &&
5639 SrcTySize == Cast->getType()->getPrimitiveSizeInBits()) {
5640 // If this is an unsigned comparison, try to make the comparison use
5641 // smaller constant values.
5642 if (ICI.getPredicate() == ICmpInst::ICMP_ULT && RHSV.isSignBit()) {
5643 // X u< 128 => X s> -1
5644 return new ICmpInst(ICmpInst::ICMP_SGT, CastOp,
5645 ConstantInt::get(APInt::getAllOnesValue(SrcTySize)));
5646 } else if (ICI.getPredicate() == ICmpInst::ICMP_UGT &&
5647 RHSV == APInt::getSignedMaxValue(SrcTySize)) {
5648 // X u> 127 => X s< 0
5649 return new ICmpInst(ICmpInst::ICMP_SLT, CastOp,
5650 Constant::getNullValue(SrcTy));
5658 /// visitICmpInstWithCastAndCast - Handle icmp (cast x to y), (cast/cst).
5659 /// We only handle extending casts so far.
5661 Instruction *InstCombiner::visitICmpInstWithCastAndCast(ICmpInst &ICI) {
5662 const CastInst *LHSCI = cast<CastInst>(ICI.getOperand(0));
5663 Value *LHSCIOp = LHSCI->getOperand(0);
5664 const Type *SrcTy = LHSCIOp->getType();
5665 const Type *DestTy = LHSCI->getType();
5668 // Turn icmp (ptrtoint x), (ptrtoint/c) into a compare of the input if the
5669 // integer type is the same size as the pointer type.
5670 if (LHSCI->getOpcode() == Instruction::PtrToInt &&
5671 getTargetData().getPointerSizeInBits() ==
5672 cast<IntegerType>(DestTy)->getBitWidth()) {
5674 if (Constant *RHSC = dyn_cast<Constant>(ICI.getOperand(1))) {
5675 RHSOp = ConstantExpr::getIntToPtr(RHSC, SrcTy);
5676 } else if (PtrToIntInst *RHSC = dyn_cast<PtrToIntInst>(ICI.getOperand(1))) {
5677 RHSOp = RHSC->getOperand(0);
5678 // If the pointer types don't match, insert a bitcast.
5679 if (LHSCIOp->getType() != RHSOp->getType())
5680 RHSOp = InsertCastBefore(Instruction::BitCast, RHSOp,
5681 LHSCIOp->getType(), ICI);
5685 return new ICmpInst(ICI.getPredicate(), LHSCIOp, RHSOp);
5688 // The code below only handles extension cast instructions, so far.
5690 if (LHSCI->getOpcode() != Instruction::ZExt &&
5691 LHSCI->getOpcode() != Instruction::SExt)
5694 bool isSignedExt = LHSCI->getOpcode() == Instruction::SExt;
5695 bool isSignedCmp = ICI.isSignedPredicate();
5697 if (CastInst *CI = dyn_cast<CastInst>(ICI.getOperand(1))) {
5698 // Not an extension from the same type?
5699 RHSCIOp = CI->getOperand(0);
5700 if (RHSCIOp->getType() != LHSCIOp->getType())
5703 // If the signedness of the two compares doesn't agree (i.e. one is a sext
5704 // and the other is a zext), then we can't handle this.
5705 if (CI->getOpcode() != LHSCI->getOpcode())
5708 // Likewise, if the signedness of the [sz]exts and the compare don't match,
5709 // then we can't handle this.
5710 if (isSignedExt != isSignedCmp && !ICI.isEquality())
5713 // Okay, just insert a compare of the reduced operands now!
5714 return new ICmpInst(ICI.getPredicate(), LHSCIOp, RHSCIOp);
5717 // If we aren't dealing with a constant on the RHS, exit early
5718 ConstantInt *CI = dyn_cast<ConstantInt>(ICI.getOperand(1));
5722 // Compute the constant that would happen if we truncated to SrcTy then
5723 // reextended to DestTy.
5724 Constant *Res1 = ConstantExpr::getTrunc(CI, SrcTy);
5725 Constant *Res2 = ConstantExpr::getCast(LHSCI->getOpcode(), Res1, DestTy);
5727 // If the re-extended constant didn't change...
5729 // Make sure that sign of the Cmp and the sign of the Cast are the same.
5730 // For example, we might have:
5731 // %A = sext short %X to uint
5732 // %B = icmp ugt uint %A, 1330
5733 // It is incorrect to transform this into
5734 // %B = icmp ugt short %X, 1330
5735 // because %A may have negative value.
5737 // However, it is OK if SrcTy is bool (See cast-set.ll testcase)
5738 // OR operation is EQ/NE.
5739 if (isSignedExt == isSignedCmp || SrcTy == Type::Int1Ty || ICI.isEquality())
5740 return new ICmpInst(ICI.getPredicate(), LHSCIOp, Res1);
5745 // The re-extended constant changed so the constant cannot be represented
5746 // in the shorter type. Consequently, we cannot emit a simple comparison.
5748 // First, handle some easy cases. We know the result cannot be equal at this
5749 // point so handle the ICI.isEquality() cases
5750 if (ICI.getPredicate() == ICmpInst::ICMP_EQ)
5751 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
5752 if (ICI.getPredicate() == ICmpInst::ICMP_NE)
5753 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
5755 // Evaluate the comparison for LT (we invert for GT below). LE and GE cases
5756 // should have been folded away previously and not enter in here.
5759 // We're performing a signed comparison.
5760 if (cast<ConstantInt>(CI)->getValue().isNegative())
5761 Result = ConstantInt::getFalse(); // X < (small) --> false
5763 Result = ConstantInt::getTrue(); // X < (large) --> true
5765 // We're performing an unsigned comparison.
5767 // We're performing an unsigned comp with a sign extended value.
5768 // This is true if the input is >= 0. [aka >s -1]
5769 Constant *NegOne = ConstantInt::getAllOnesValue(SrcTy);
5770 Result = InsertNewInstBefore(new ICmpInst(ICmpInst::ICMP_SGT, LHSCIOp,
5771 NegOne, ICI.getName()), ICI);
5773 // Unsigned extend & unsigned compare -> always true.
5774 Result = ConstantInt::getTrue();
5778 // Finally, return the value computed.
5779 if (ICI.getPredicate() == ICmpInst::ICMP_ULT ||
5780 ICI.getPredicate() == ICmpInst::ICMP_SLT) {
5781 return ReplaceInstUsesWith(ICI, Result);
5783 assert((ICI.getPredicate()==ICmpInst::ICMP_UGT ||
5784 ICI.getPredicate()==ICmpInst::ICMP_SGT) &&
5785 "ICmp should be folded!");
5786 if (Constant *CI = dyn_cast<Constant>(Result))
5787 return ReplaceInstUsesWith(ICI, ConstantExpr::getNot(CI));
5789 return BinaryOperator::createNot(Result);
5793 Instruction *InstCombiner::visitShl(BinaryOperator &I) {
5794 return commonShiftTransforms(I);
5797 Instruction *InstCombiner::visitLShr(BinaryOperator &I) {
5798 return commonShiftTransforms(I);
5801 Instruction *InstCombiner::visitAShr(BinaryOperator &I) {
5802 return commonShiftTransforms(I);
5805 Instruction *InstCombiner::commonShiftTransforms(BinaryOperator &I) {
5806 assert(I.getOperand(1)->getType() == I.getOperand(0)->getType());
5807 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
5809 // shl X, 0 == X and shr X, 0 == X
5810 // shl 0, X == 0 and shr 0, X == 0
5811 if (Op1 == Constant::getNullValue(Op1->getType()) ||
5812 Op0 == Constant::getNullValue(Op0->getType()))
5813 return ReplaceInstUsesWith(I, Op0);
5815 if (isa<UndefValue>(Op0)) {
5816 if (I.getOpcode() == Instruction::AShr) // undef >>s X -> undef
5817 return ReplaceInstUsesWith(I, Op0);
5818 else // undef << X -> 0, undef >>u X -> 0
5819 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
5821 if (isa<UndefValue>(Op1)) {
5822 if (I.getOpcode() == Instruction::AShr) // X >>s undef -> X
5823 return ReplaceInstUsesWith(I, Op0);
5824 else // X << undef, X >>u undef -> 0
5825 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
5828 // ashr int -1, X = -1 (for any arithmetic shift rights of ~0)
5829 if (I.getOpcode() == Instruction::AShr)
5830 if (ConstantInt *CSI = dyn_cast<ConstantInt>(Op0))
5831 if (CSI->isAllOnesValue())
5832 return ReplaceInstUsesWith(I, CSI);
5834 // Try to fold constant and into select arguments.
5835 if (isa<Constant>(Op0))
5836 if (SelectInst *SI = dyn_cast<SelectInst>(Op1))
5837 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
5840 // See if we can turn a signed shr into an unsigned shr.
5841 if (I.isArithmeticShift()) {
5842 if (MaskedValueIsZero(Op0,
5843 APInt::getSignBit(I.getType()->getPrimitiveSizeInBits()))) {
5844 return BinaryOperator::createLShr(Op0, Op1, I.getName());
5848 if (ConstantInt *CUI = dyn_cast<ConstantInt>(Op1))
5849 if (Instruction *Res = FoldShiftByConstant(Op0, CUI, I))
5854 Instruction *InstCombiner::FoldShiftByConstant(Value *Op0, ConstantInt *Op1,
5855 BinaryOperator &I) {
5856 bool isLeftShift = I.getOpcode() == Instruction::Shl;
5858 // See if we can simplify any instructions used by the instruction whose sole
5859 // purpose is to compute bits we don't care about.
5860 uint32_t TypeBits = Op0->getType()->getPrimitiveSizeInBits();
5861 APInt KnownZero(TypeBits, 0), KnownOne(TypeBits, 0);
5862 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(TypeBits),
5863 KnownZero, KnownOne))
5866 // shl uint X, 32 = 0 and shr ubyte Y, 9 = 0, ... just don't eliminate shr
5867 // of a signed value.
5869 if (Op1->uge(TypeBits)) {
5870 if (I.getOpcode() != Instruction::AShr)
5871 return ReplaceInstUsesWith(I, Constant::getNullValue(Op0->getType()));
5873 I.setOperand(1, ConstantInt::get(I.getType(), TypeBits-1));
5878 // ((X*C1) << C2) == (X * (C1 << C2))
5879 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(Op0))
5880 if (BO->getOpcode() == Instruction::Mul && isLeftShift)
5881 if (Constant *BOOp = dyn_cast<Constant>(BO->getOperand(1)))
5882 return BinaryOperator::createMul(BO->getOperand(0),
5883 ConstantExpr::getShl(BOOp, Op1));
5885 // Try to fold constant and into select arguments.
5886 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
5887 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
5889 if (isa<PHINode>(Op0))
5890 if (Instruction *NV = FoldOpIntoPhi(I))
5893 if (Op0->hasOneUse()) {
5894 if (BinaryOperator *Op0BO = dyn_cast<BinaryOperator>(Op0)) {
5895 // Turn ((X >> C) + Y) << C -> (X + (Y << C)) & (~0 << C)
5898 switch (Op0BO->getOpcode()) {
5900 case Instruction::Add:
5901 case Instruction::And:
5902 case Instruction::Or:
5903 case Instruction::Xor: {
5904 // These operators commute.
5905 // Turn (Y + (X >> C)) << C -> (X + (Y << C)) & (~0 << C)
5906 if (isLeftShift && Op0BO->getOperand(1)->hasOneUse() &&
5907 match(Op0BO->getOperand(1),
5908 m_Shr(m_Value(V1), m_ConstantInt(CC))) && CC == Op1) {
5909 Instruction *YS = BinaryOperator::createShl(
5910 Op0BO->getOperand(0), Op1,
5912 InsertNewInstBefore(YS, I); // (Y << C)
5914 BinaryOperator::create(Op0BO->getOpcode(), YS, V1,
5915 Op0BO->getOperand(1)->getName());
5916 InsertNewInstBefore(X, I); // (X + (Y << C))
5917 uint32_t Op1Val = Op1->getLimitedValue(TypeBits);
5918 return BinaryOperator::createAnd(X, ConstantInt::get(
5919 APInt::getHighBitsSet(TypeBits, TypeBits-Op1Val)));
5922 // Turn (Y + ((X >> C) & CC)) << C -> ((X & (CC << C)) + (Y << C))
5923 Value *Op0BOOp1 = Op0BO->getOperand(1);
5924 if (isLeftShift && Op0BOOp1->hasOneUse() &&
5926 m_And(m_Shr(m_Value(V1), m_Value(V2)),m_ConstantInt(CC))) &&
5927 cast<BinaryOperator>(Op0BOOp1)->getOperand(0)->hasOneUse() &&
5929 Instruction *YS = BinaryOperator::createShl(
5930 Op0BO->getOperand(0), Op1,
5932 InsertNewInstBefore(YS, I); // (Y << C)
5934 BinaryOperator::createAnd(V1, ConstantExpr::getShl(CC, Op1),
5935 V1->getName()+".mask");
5936 InsertNewInstBefore(XM, I); // X & (CC << C)
5938 return BinaryOperator::create(Op0BO->getOpcode(), YS, XM);
5943 case Instruction::Sub: {
5944 // Turn ((X >> C) + Y) << C -> (X + (Y << C)) & (~0 << C)
5945 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() &&
5946 match(Op0BO->getOperand(0),
5947 m_Shr(m_Value(V1), m_ConstantInt(CC))) && CC == Op1) {
5948 Instruction *YS = BinaryOperator::createShl(
5949 Op0BO->getOperand(1), Op1,
5951 InsertNewInstBefore(YS, I); // (Y << C)
5953 BinaryOperator::create(Op0BO->getOpcode(), V1, YS,
5954 Op0BO->getOperand(0)->getName());
5955 InsertNewInstBefore(X, I); // (X + (Y << C))
5956 uint32_t Op1Val = Op1->getLimitedValue(TypeBits);
5957 return BinaryOperator::createAnd(X, ConstantInt::get(
5958 APInt::getHighBitsSet(TypeBits, TypeBits-Op1Val)));
5961 // Turn (((X >> C)&CC) + Y) << C -> (X + (Y << C)) & (CC << C)
5962 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() &&
5963 match(Op0BO->getOperand(0),
5964 m_And(m_Shr(m_Value(V1), m_Value(V2)),
5965 m_ConstantInt(CC))) && V2 == Op1 &&
5966 cast<BinaryOperator>(Op0BO->getOperand(0))
5967 ->getOperand(0)->hasOneUse()) {
5968 Instruction *YS = BinaryOperator::createShl(
5969 Op0BO->getOperand(1), Op1,
5971 InsertNewInstBefore(YS, I); // (Y << C)
5973 BinaryOperator::createAnd(V1, ConstantExpr::getShl(CC, Op1),
5974 V1->getName()+".mask");
5975 InsertNewInstBefore(XM, I); // X & (CC << C)
5977 return BinaryOperator::create(Op0BO->getOpcode(), XM, YS);
5985 // If the operand is an bitwise operator with a constant RHS, and the
5986 // shift is the only use, we can pull it out of the shift.
5987 if (ConstantInt *Op0C = dyn_cast<ConstantInt>(Op0BO->getOperand(1))) {
5988 bool isValid = true; // Valid only for And, Or, Xor
5989 bool highBitSet = false; // Transform if high bit of constant set?
5991 switch (Op0BO->getOpcode()) {
5992 default: isValid = false; break; // Do not perform transform!
5993 case Instruction::Add:
5994 isValid = isLeftShift;
5996 case Instruction::Or:
5997 case Instruction::Xor:
6000 case Instruction::And:
6005 // If this is a signed shift right, and the high bit is modified
6006 // by the logical operation, do not perform the transformation.
6007 // The highBitSet boolean indicates the value of the high bit of
6008 // the constant which would cause it to be modified for this
6011 if (isValid && !isLeftShift && I.getOpcode() == Instruction::AShr) {
6012 isValid = Op0C->getValue()[TypeBits-1] == highBitSet;
6016 Constant *NewRHS = ConstantExpr::get(I.getOpcode(), Op0C, Op1);
6018 Instruction *NewShift =
6019 BinaryOperator::create(I.getOpcode(), Op0BO->getOperand(0), Op1);
6020 InsertNewInstBefore(NewShift, I);
6021 NewShift->takeName(Op0BO);
6023 return BinaryOperator::create(Op0BO->getOpcode(), NewShift,
6030 // Find out if this is a shift of a shift by a constant.
6031 BinaryOperator *ShiftOp = dyn_cast<BinaryOperator>(Op0);
6032 if (ShiftOp && !ShiftOp->isShift())
6035 if (ShiftOp && isa<ConstantInt>(ShiftOp->getOperand(1))) {
6036 ConstantInt *ShiftAmt1C = cast<ConstantInt>(ShiftOp->getOperand(1));
6037 uint32_t ShiftAmt1 = ShiftAmt1C->getLimitedValue(TypeBits);
6038 uint32_t ShiftAmt2 = Op1->getLimitedValue(TypeBits);
6039 assert(ShiftAmt2 != 0 && "Should have been simplified earlier");
6040 if (ShiftAmt1 == 0) return 0; // Will be simplified in the future.
6041 Value *X = ShiftOp->getOperand(0);
6043 uint32_t AmtSum = ShiftAmt1+ShiftAmt2; // Fold into one big shift.
6044 if (AmtSum > TypeBits)
6047 const IntegerType *Ty = cast<IntegerType>(I.getType());
6049 // Check for (X << c1) << c2 and (X >> c1) >> c2
6050 if (I.getOpcode() == ShiftOp->getOpcode()) {
6051 return BinaryOperator::create(I.getOpcode(), X,
6052 ConstantInt::get(Ty, AmtSum));
6053 } else if (ShiftOp->getOpcode() == Instruction::LShr &&
6054 I.getOpcode() == Instruction::AShr) {
6055 // ((X >>u C1) >>s C2) -> (X >>u (C1+C2)) since C1 != 0.
6056 return BinaryOperator::createLShr(X, ConstantInt::get(Ty, AmtSum));
6057 } else if (ShiftOp->getOpcode() == Instruction::AShr &&
6058 I.getOpcode() == Instruction::LShr) {
6059 // ((X >>s C1) >>u C2) -> ((X >>s (C1+C2)) & mask) since C1 != 0.
6060 Instruction *Shift =
6061 BinaryOperator::createAShr(X, ConstantInt::get(Ty, AmtSum));
6062 InsertNewInstBefore(Shift, I);
6064 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt2));
6065 return BinaryOperator::createAnd(Shift, ConstantInt::get(Mask));
6068 // Okay, if we get here, one shift must be left, and the other shift must be
6069 // right. See if the amounts are equal.
6070 if (ShiftAmt1 == ShiftAmt2) {
6071 // If we have ((X >>? C) << C), turn this into X & (-1 << C).
6072 if (I.getOpcode() == Instruction::Shl) {
6073 APInt Mask(APInt::getHighBitsSet(TypeBits, TypeBits - ShiftAmt1));
6074 return BinaryOperator::createAnd(X, ConstantInt::get(Mask));
6076 // If we have ((X << C) >>u C), turn this into X & (-1 >>u C).
6077 if (I.getOpcode() == Instruction::LShr) {
6078 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt1));
6079 return BinaryOperator::createAnd(X, ConstantInt::get(Mask));
6081 // We can simplify ((X << C) >>s C) into a trunc + sext.
6082 // NOTE: we could do this for any C, but that would make 'unusual' integer
6083 // types. For now, just stick to ones well-supported by the code
6085 const Type *SExtType = 0;
6086 switch (Ty->getBitWidth() - ShiftAmt1) {
6093 SExtType = IntegerType::get(Ty->getBitWidth() - ShiftAmt1);
6098 Instruction *NewTrunc = new TruncInst(X, SExtType, "sext");
6099 InsertNewInstBefore(NewTrunc, I);
6100 return new SExtInst(NewTrunc, Ty);
6102 // Otherwise, we can't handle it yet.
6103 } else if (ShiftAmt1 < ShiftAmt2) {
6104 uint32_t ShiftDiff = ShiftAmt2-ShiftAmt1;
6106 // (X >>? C1) << C2 --> X << (C2-C1) & (-1 << C2)
6107 if (I.getOpcode() == Instruction::Shl) {
6108 assert(ShiftOp->getOpcode() == Instruction::LShr ||
6109 ShiftOp->getOpcode() == Instruction::AShr);
6110 Instruction *Shift =
6111 BinaryOperator::createShl(X, ConstantInt::get(Ty, ShiftDiff));
6112 InsertNewInstBefore(Shift, I);
6114 APInt Mask(APInt::getHighBitsSet(TypeBits, TypeBits - ShiftAmt2));
6115 return BinaryOperator::createAnd(Shift, ConstantInt::get(Mask));
6118 // (X << C1) >>u C2 --> X >>u (C2-C1) & (-1 >> C2)
6119 if (I.getOpcode() == Instruction::LShr) {
6120 assert(ShiftOp->getOpcode() == Instruction::Shl);
6121 Instruction *Shift =
6122 BinaryOperator::createLShr(X, ConstantInt::get(Ty, ShiftDiff));
6123 InsertNewInstBefore(Shift, I);
6125 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt2));
6126 return BinaryOperator::createAnd(Shift, ConstantInt::get(Mask));
6129 // We can't handle (X << C1) >>s C2, it shifts arbitrary bits in.
6131 assert(ShiftAmt2 < ShiftAmt1);
6132 uint32_t ShiftDiff = ShiftAmt1-ShiftAmt2;
6134 // (X >>? C1) << C2 --> X >>? (C1-C2) & (-1 << C2)
6135 if (I.getOpcode() == Instruction::Shl) {
6136 assert(ShiftOp->getOpcode() == Instruction::LShr ||
6137 ShiftOp->getOpcode() == Instruction::AShr);
6138 Instruction *Shift =
6139 BinaryOperator::create(ShiftOp->getOpcode(), X,
6140 ConstantInt::get(Ty, ShiftDiff));
6141 InsertNewInstBefore(Shift, I);
6143 APInt Mask(APInt::getHighBitsSet(TypeBits, TypeBits - ShiftAmt2));
6144 return BinaryOperator::createAnd(Shift, ConstantInt::get(Mask));
6147 // (X << C1) >>u C2 --> X << (C1-C2) & (-1 >> C2)
6148 if (I.getOpcode() == Instruction::LShr) {
6149 assert(ShiftOp->getOpcode() == Instruction::Shl);
6150 Instruction *Shift =
6151 BinaryOperator::createShl(X, ConstantInt::get(Ty, ShiftDiff));
6152 InsertNewInstBefore(Shift, I);
6154 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt2));
6155 return BinaryOperator::createAnd(Shift, ConstantInt::get(Mask));
6158 // We can't handle (X << C1) >>a C2, it shifts arbitrary bits in.
6165 /// DecomposeSimpleLinearExpr - Analyze 'Val', seeing if it is a simple linear
6166 /// expression. If so, decompose it, returning some value X, such that Val is
6169 static Value *DecomposeSimpleLinearExpr(Value *Val, unsigned &Scale,
6171 assert(Val->getType() == Type::Int32Ty && "Unexpected allocation size type!");
6172 if (ConstantInt *CI = dyn_cast<ConstantInt>(Val)) {
6173 Offset = CI->getZExtValue();
6175 return ConstantInt::get(Type::Int32Ty, 0);
6176 } else if (Instruction *I = dyn_cast<Instruction>(Val)) {
6177 if (I->getNumOperands() == 2) {
6178 if (ConstantInt *CUI = dyn_cast<ConstantInt>(I->getOperand(1))) {
6179 if (I->getOpcode() == Instruction::Shl) {
6180 // This is a value scaled by '1 << the shift amt'.
6181 Scale = 1U << CUI->getZExtValue();
6183 return I->getOperand(0);
6184 } else if (I->getOpcode() == Instruction::Mul) {
6185 // This value is scaled by 'CUI'.
6186 Scale = CUI->getZExtValue();
6188 return I->getOperand(0);
6189 } else if (I->getOpcode() == Instruction::Add) {
6190 // We have X+C. Check to see if we really have (X*C2)+C1,
6191 // where C1 is divisible by C2.
6194 DecomposeSimpleLinearExpr(I->getOperand(0), SubScale, Offset);
6195 Offset += CUI->getZExtValue();
6196 if (SubScale > 1 && (Offset % SubScale == 0)) {
6205 // Otherwise, we can't look past this.
6212 /// PromoteCastOfAllocation - If we find a cast of an allocation instruction,
6213 /// try to eliminate the cast by moving the type information into the alloc.
6214 Instruction *InstCombiner::PromoteCastOfAllocation(BitCastInst &CI,
6215 AllocationInst &AI) {
6216 const PointerType *PTy = cast<PointerType>(CI.getType());
6218 // Remove any uses of AI that are dead.
6219 assert(!CI.use_empty() && "Dead instructions should be removed earlier!");
6221 for (Value::use_iterator UI = AI.use_begin(), E = AI.use_end(); UI != E; ) {
6222 Instruction *User = cast<Instruction>(*UI++);
6223 if (isInstructionTriviallyDead(User)) {
6224 while (UI != E && *UI == User)
6225 ++UI; // If this instruction uses AI more than once, don't break UI.
6228 DOUT << "IC: DCE: " << *User;
6229 EraseInstFromFunction(*User);
6233 // Get the type really allocated and the type casted to.
6234 const Type *AllocElTy = AI.getAllocatedType();
6235 const Type *CastElTy = PTy->getElementType();
6236 if (!AllocElTy->isSized() || !CastElTy->isSized()) return 0;
6238 unsigned AllocElTyAlign = TD->getABITypeAlignment(AllocElTy);
6239 unsigned CastElTyAlign = TD->getABITypeAlignment(CastElTy);
6240 if (CastElTyAlign < AllocElTyAlign) return 0;
6242 // If the allocation has multiple uses, only promote it if we are strictly
6243 // increasing the alignment of the resultant allocation. If we keep it the
6244 // same, we open the door to infinite loops of various kinds.
6245 if (!AI.hasOneUse() && CastElTyAlign == AllocElTyAlign) return 0;
6247 uint64_t AllocElTySize = TD->getTypeSize(AllocElTy);
6248 uint64_t CastElTySize = TD->getTypeSize(CastElTy);
6249 if (CastElTySize == 0 || AllocElTySize == 0) return 0;
6251 // See if we can satisfy the modulus by pulling a scale out of the array
6253 unsigned ArraySizeScale;
6255 Value *NumElements = // See if the array size is a decomposable linear expr.
6256 DecomposeSimpleLinearExpr(AI.getOperand(0), ArraySizeScale, ArrayOffset);
6258 // If we can now satisfy the modulus, by using a non-1 scale, we really can
6260 if ((AllocElTySize*ArraySizeScale) % CastElTySize != 0 ||
6261 (AllocElTySize*ArrayOffset ) % CastElTySize != 0) return 0;
6263 unsigned Scale = (AllocElTySize*ArraySizeScale)/CastElTySize;
6268 // If the allocation size is constant, form a constant mul expression
6269 Amt = ConstantInt::get(Type::Int32Ty, Scale);
6270 if (isa<ConstantInt>(NumElements))
6271 Amt = Multiply(cast<ConstantInt>(NumElements), cast<ConstantInt>(Amt));
6272 // otherwise multiply the amount and the number of elements
6273 else if (Scale != 1) {
6274 Instruction *Tmp = BinaryOperator::createMul(Amt, NumElements, "tmp");
6275 Amt = InsertNewInstBefore(Tmp, AI);
6279 if (int Offset = (AllocElTySize*ArrayOffset)/CastElTySize) {
6280 Value *Off = ConstantInt::get(Type::Int32Ty, Offset, true);
6281 Instruction *Tmp = BinaryOperator::createAdd(Amt, Off, "tmp");
6282 Amt = InsertNewInstBefore(Tmp, AI);
6285 AllocationInst *New;
6286 if (isa<MallocInst>(AI))
6287 New = new MallocInst(CastElTy, Amt, AI.getAlignment());
6289 New = new AllocaInst(CastElTy, Amt, AI.getAlignment());
6290 InsertNewInstBefore(New, AI);
6293 // If the allocation has multiple uses, insert a cast and change all things
6294 // that used it to use the new cast. This will also hack on CI, but it will
6296 if (!AI.hasOneUse()) {
6297 AddUsesToWorkList(AI);
6298 // New is the allocation instruction, pointer typed. AI is the original
6299 // allocation instruction, also pointer typed. Thus, cast to use is BitCast.
6300 CastInst *NewCast = new BitCastInst(New, AI.getType(), "tmpcast");
6301 InsertNewInstBefore(NewCast, AI);
6302 AI.replaceAllUsesWith(NewCast);
6304 return ReplaceInstUsesWith(CI, New);
6307 /// CanEvaluateInDifferentType - Return true if we can take the specified value
6308 /// and return it as type Ty without inserting any new casts and without
6309 /// changing the computed value. This is used by code that tries to decide
6310 /// whether promoting or shrinking integer operations to wider or smaller types
6311 /// will allow us to eliminate a truncate or extend.
6313 /// This is a truncation operation if Ty is smaller than V->getType(), or an
6314 /// extension operation if Ty is larger.
6315 static bool CanEvaluateInDifferentType(Value *V, const IntegerType *Ty,
6316 int &NumCastsRemoved) {
6317 // We can always evaluate constants in another type.
6318 if (isa<ConstantInt>(V))
6321 Instruction *I = dyn_cast<Instruction>(V);
6322 if (!I) return false;
6324 const IntegerType *OrigTy = cast<IntegerType>(V->getType());
6326 switch (I->getOpcode()) {
6327 case Instruction::Add:
6328 case Instruction::Sub:
6329 case Instruction::And:
6330 case Instruction::Or:
6331 case Instruction::Xor:
6332 if (!I->hasOneUse()) return false;
6333 // These operators can all arbitrarily be extended or truncated.
6334 return CanEvaluateInDifferentType(I->getOperand(0), Ty, NumCastsRemoved) &&
6335 CanEvaluateInDifferentType(I->getOperand(1), Ty, NumCastsRemoved);
6337 case Instruction::Shl:
6338 if (!I->hasOneUse()) return false;
6339 // If we are truncating the result of this SHL, and if it's a shift of a
6340 // constant amount, we can always perform a SHL in a smaller type.
6341 if (ConstantInt *CI = dyn_cast<ConstantInt>(I->getOperand(1))) {
6342 uint32_t BitWidth = Ty->getBitWidth();
6343 if (BitWidth < OrigTy->getBitWidth() &&
6344 CI->getLimitedValue(BitWidth) < BitWidth)
6345 return CanEvaluateInDifferentType(I->getOperand(0), Ty,NumCastsRemoved);
6348 case Instruction::LShr:
6349 if (!I->hasOneUse()) return false;
6350 // If this is a truncate of a logical shr, we can truncate it to a smaller
6351 // lshr iff we know that the bits we would otherwise be shifting in are
6353 if (ConstantInt *CI = dyn_cast<ConstantInt>(I->getOperand(1))) {
6354 uint32_t OrigBitWidth = OrigTy->getBitWidth();
6355 uint32_t BitWidth = Ty->getBitWidth();
6356 if (BitWidth < OrigBitWidth &&
6357 MaskedValueIsZero(I->getOperand(0),
6358 APInt::getHighBitsSet(OrigBitWidth, OrigBitWidth-BitWidth)) &&
6359 CI->getLimitedValue(BitWidth) < BitWidth) {
6360 return CanEvaluateInDifferentType(I->getOperand(0), Ty,NumCastsRemoved);
6364 case Instruction::Trunc:
6365 case Instruction::ZExt:
6366 case Instruction::SExt:
6367 // If this is a cast from the destination type, we can trivially eliminate
6368 // it, and this will remove a cast overall.
6369 if (I->getOperand(0)->getType() == Ty) {
6370 // If the first operand is itself a cast, and is eliminable, do not count
6371 // this as an eliminable cast. We would prefer to eliminate those two
6373 if (isa<CastInst>(I->getOperand(0)))
6381 // TODO: Can handle more cases here.
6388 /// EvaluateInDifferentType - Given an expression that
6389 /// CanEvaluateInDifferentType returns true for, actually insert the code to
6390 /// evaluate the expression.
6391 Value *InstCombiner::EvaluateInDifferentType(Value *V, const Type *Ty,
6393 if (Constant *C = dyn_cast<Constant>(V))
6394 return ConstantExpr::getIntegerCast(C, Ty, isSigned /*Sext or ZExt*/);
6396 // Otherwise, it must be an instruction.
6397 Instruction *I = cast<Instruction>(V);
6398 Instruction *Res = 0;
6399 switch (I->getOpcode()) {
6400 case Instruction::Add:
6401 case Instruction::Sub:
6402 case Instruction::And:
6403 case Instruction::Or:
6404 case Instruction::Xor:
6405 case Instruction::AShr:
6406 case Instruction::LShr:
6407 case Instruction::Shl: {
6408 Value *LHS = EvaluateInDifferentType(I->getOperand(0), Ty, isSigned);
6409 Value *RHS = EvaluateInDifferentType(I->getOperand(1), Ty, isSigned);
6410 Res = BinaryOperator::create((Instruction::BinaryOps)I->getOpcode(),
6411 LHS, RHS, I->getName());
6414 case Instruction::Trunc:
6415 case Instruction::ZExt:
6416 case Instruction::SExt:
6417 case Instruction::BitCast:
6418 // If the source type of the cast is the type we're trying for then we can
6419 // just return the source. There's no need to insert it because its not new.
6420 if (I->getOperand(0)->getType() == Ty)
6421 return I->getOperand(0);
6423 // Some other kind of cast, which shouldn't happen, so just ..
6426 // TODO: Can handle more cases here.
6427 assert(0 && "Unreachable!");
6431 return InsertNewInstBefore(Res, *I);
6434 /// @brief Implement the transforms common to all CastInst visitors.
6435 Instruction *InstCombiner::commonCastTransforms(CastInst &CI) {
6436 Value *Src = CI.getOperand(0);
6438 // Many cases of "cast of a cast" are eliminable. If it's eliminable we just
6439 // eliminate it now.
6440 if (CastInst *CSrc = dyn_cast<CastInst>(Src)) { // A->B->C cast
6441 if (Instruction::CastOps opc =
6442 isEliminableCastPair(CSrc, CI.getOpcode(), CI.getType(), TD)) {
6443 // The first cast (CSrc) is eliminable so we need to fix up or replace
6444 // the second cast (CI). CSrc will then have a good chance of being dead.
6445 return CastInst::create(opc, CSrc->getOperand(0), CI.getType());
6449 // If we are casting a select then fold the cast into the select
6450 if (SelectInst *SI = dyn_cast<SelectInst>(Src))
6451 if (Instruction *NV = FoldOpIntoSelect(CI, SI, this))
6454 // If we are casting a PHI then fold the cast into the PHI
6455 if (isa<PHINode>(Src))
6456 if (Instruction *NV = FoldOpIntoPhi(CI))
6462 /// @brief Implement the transforms for cast of pointer (bitcast/ptrtoint)
6463 Instruction *InstCombiner::commonPointerCastTransforms(CastInst &CI) {
6464 Value *Src = CI.getOperand(0);
6466 if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Src)) {
6467 // If casting the result of a getelementptr instruction with no offset, turn
6468 // this into a cast of the original pointer!
6469 if (GEP->hasAllZeroIndices()) {
6470 // Changing the cast operand is usually not a good idea but it is safe
6471 // here because the pointer operand is being replaced with another
6472 // pointer operand so the opcode doesn't need to change.
6474 CI.setOperand(0, GEP->getOperand(0));
6478 // If the GEP has a single use, and the base pointer is a bitcast, and the
6479 // GEP computes a constant offset, see if we can convert these three
6480 // instructions into fewer. This typically happens with unions and other
6481 // non-type-safe code.
6482 if (GEP->hasOneUse() && isa<BitCastInst>(GEP->getOperand(0))) {
6483 if (GEP->hasAllConstantIndices()) {
6484 // We are guaranteed to get a constant from EmitGEPOffset.
6485 ConstantInt *OffsetV = cast<ConstantInt>(EmitGEPOffset(GEP, CI, *this));
6486 int64_t Offset = OffsetV->getSExtValue();
6488 // Get the base pointer input of the bitcast, and the type it points to.
6489 Value *OrigBase = cast<BitCastInst>(GEP->getOperand(0))->getOperand(0);
6490 const Type *GEPIdxTy =
6491 cast<PointerType>(OrigBase->getType())->getElementType();
6492 if (GEPIdxTy->isSized()) {
6493 SmallVector<Value*, 8> NewIndices;
6495 // Start with the index over the outer type. Note that the type size
6496 // might be zero (even if the offset isn't zero) if the indexed type
6497 // is something like [0 x {int, int}]
6498 const Type *IntPtrTy = TD->getIntPtrType();
6499 int64_t FirstIdx = 0;
6500 if (int64_t TySize = TD->getTypeSize(GEPIdxTy)) {
6501 FirstIdx = Offset/TySize;
6504 // Handle silly modulus not returning values values [0..TySize).
6508 assert(Offset >= 0);
6510 assert((uint64_t)Offset < (uint64_t)TySize &&"Out of range offset");
6513 NewIndices.push_back(ConstantInt::get(IntPtrTy, FirstIdx));
6515 // Index into the types. If we fail, set OrigBase to null.
6517 if (const StructType *STy = dyn_cast<StructType>(GEPIdxTy)) {
6518 const StructLayout *SL = TD->getStructLayout(STy);
6519 if (Offset < (int64_t)SL->getSizeInBytes()) {
6520 unsigned Elt = SL->getElementContainingOffset(Offset);
6521 NewIndices.push_back(ConstantInt::get(Type::Int32Ty, Elt));
6523 Offset -= SL->getElementOffset(Elt);
6524 GEPIdxTy = STy->getElementType(Elt);
6526 // Otherwise, we can't index into this, bail out.
6530 } else if (isa<ArrayType>(GEPIdxTy) || isa<VectorType>(GEPIdxTy)) {
6531 const SequentialType *STy = cast<SequentialType>(GEPIdxTy);
6532 if (uint64_t EltSize = TD->getTypeSize(STy->getElementType())) {
6533 NewIndices.push_back(ConstantInt::get(IntPtrTy,Offset/EltSize));
6536 NewIndices.push_back(ConstantInt::get(IntPtrTy, 0));
6538 GEPIdxTy = STy->getElementType();
6540 // Otherwise, we can't index into this, bail out.
6546 // If we were able to index down into an element, create the GEP
6547 // and bitcast the result. This eliminates one bitcast, potentially
6549 Instruction *NGEP = new GetElementPtrInst(OrigBase, &NewIndices[0],
6550 NewIndices.size(), "");
6551 InsertNewInstBefore(NGEP, CI);
6552 NGEP->takeName(GEP);
6554 if (isa<BitCastInst>(CI))
6555 return new BitCastInst(NGEP, CI.getType());
6556 assert(isa<PtrToIntInst>(CI));
6557 return new PtrToIntInst(NGEP, CI.getType());
6564 return commonCastTransforms(CI);
6569 /// Only the TRUNC, ZEXT, SEXT, and BITCAST can both operand and result as
6570 /// integer types. This function implements the common transforms for all those
6572 /// @brief Implement the transforms common to CastInst with integer operands
6573 Instruction *InstCombiner::commonIntCastTransforms(CastInst &CI) {
6574 if (Instruction *Result = commonCastTransforms(CI))
6577 Value *Src = CI.getOperand(0);
6578 const Type *SrcTy = Src->getType();
6579 const Type *DestTy = CI.getType();
6580 uint32_t SrcBitSize = SrcTy->getPrimitiveSizeInBits();
6581 uint32_t DestBitSize = DestTy->getPrimitiveSizeInBits();
6583 // See if we can simplify any instructions used by the LHS whose sole
6584 // purpose is to compute bits we don't care about.
6585 APInt KnownZero(DestBitSize, 0), KnownOne(DestBitSize, 0);
6586 if (SimplifyDemandedBits(&CI, APInt::getAllOnesValue(DestBitSize),
6587 KnownZero, KnownOne))
6590 // If the source isn't an instruction or has more than one use then we
6591 // can't do anything more.
6592 Instruction *SrcI = dyn_cast<Instruction>(Src);
6593 if (!SrcI || !Src->hasOneUse())
6596 // Attempt to propagate the cast into the instruction for int->int casts.
6597 int NumCastsRemoved = 0;
6598 if (!isa<BitCastInst>(CI) &&
6599 CanEvaluateInDifferentType(SrcI, cast<IntegerType>(DestTy),
6601 // If this cast is a truncate, evaluting in a different type always
6602 // eliminates the cast, so it is always a win. If this is a noop-cast
6603 // this just removes a noop cast which isn't pointful, but simplifies
6604 // the code. If this is a zero-extension, we need to do an AND to
6605 // maintain the clear top-part of the computation, so we require that
6606 // the input have eliminated at least one cast. If this is a sign
6607 // extension, we insert two new casts (to do the extension) so we
6608 // require that two casts have been eliminated.
6610 switch (CI.getOpcode()) {
6612 // All the others use floating point so we shouldn't actually
6613 // get here because of the check above.
6614 assert(0 && "Unknown cast type");
6615 case Instruction::Trunc:
6618 case Instruction::ZExt:
6619 DoXForm = NumCastsRemoved >= 1;
6621 case Instruction::SExt:
6622 DoXForm = NumCastsRemoved >= 2;
6624 case Instruction::BitCast:
6630 Value *Res = EvaluateInDifferentType(SrcI, DestTy,
6631 CI.getOpcode() == Instruction::SExt);
6632 assert(Res->getType() == DestTy);
6633 switch (CI.getOpcode()) {
6634 default: assert(0 && "Unknown cast type!");
6635 case Instruction::Trunc:
6636 case Instruction::BitCast:
6637 // Just replace this cast with the result.
6638 return ReplaceInstUsesWith(CI, Res);
6639 case Instruction::ZExt: {
6640 // We need to emit an AND to clear the high bits.
6641 assert(SrcBitSize < DestBitSize && "Not a zext?");
6642 Constant *C = ConstantInt::get(APInt::getLowBitsSet(DestBitSize,
6644 return BinaryOperator::createAnd(Res, C);
6646 case Instruction::SExt:
6647 // We need to emit a cast to truncate, then a cast to sext.
6648 return CastInst::create(Instruction::SExt,
6649 InsertCastBefore(Instruction::Trunc, Res, Src->getType(),
6655 Value *Op0 = SrcI->getNumOperands() > 0 ? SrcI->getOperand(0) : 0;
6656 Value *Op1 = SrcI->getNumOperands() > 1 ? SrcI->getOperand(1) : 0;
6658 switch (SrcI->getOpcode()) {
6659 case Instruction::Add:
6660 case Instruction::Mul:
6661 case Instruction::And:
6662 case Instruction::Or:
6663 case Instruction::Xor:
6664 // If we are discarding information, rewrite.
6665 if (DestBitSize <= SrcBitSize && DestBitSize != 1) {
6666 // Don't insert two casts if they cannot be eliminated. We allow
6667 // two casts to be inserted if the sizes are the same. This could
6668 // only be converting signedness, which is a noop.
6669 if (DestBitSize == SrcBitSize ||
6670 !ValueRequiresCast(CI.getOpcode(), Op1, DestTy,TD) ||
6671 !ValueRequiresCast(CI.getOpcode(), Op0, DestTy, TD)) {
6672 Instruction::CastOps opcode = CI.getOpcode();
6673 Value *Op0c = InsertOperandCastBefore(opcode, Op0, DestTy, SrcI);
6674 Value *Op1c = InsertOperandCastBefore(opcode, Op1, DestTy, SrcI);
6675 return BinaryOperator::create(
6676 cast<BinaryOperator>(SrcI)->getOpcode(), Op0c, Op1c);
6680 // cast (xor bool X, true) to int --> xor (cast bool X to int), 1
6681 if (isa<ZExtInst>(CI) && SrcBitSize == 1 &&
6682 SrcI->getOpcode() == Instruction::Xor &&
6683 Op1 == ConstantInt::getTrue() &&
6684 (!Op0->hasOneUse() || !isa<CmpInst>(Op0))) {
6685 Value *New = InsertOperandCastBefore(Instruction::ZExt, Op0, DestTy, &CI);
6686 return BinaryOperator::createXor(New, ConstantInt::get(CI.getType(), 1));
6689 case Instruction::SDiv:
6690 case Instruction::UDiv:
6691 case Instruction::SRem:
6692 case Instruction::URem:
6693 // If we are just changing the sign, rewrite.
6694 if (DestBitSize == SrcBitSize) {
6695 // Don't insert two casts if they cannot be eliminated. We allow
6696 // two casts to be inserted if the sizes are the same. This could
6697 // only be converting signedness, which is a noop.
6698 if (!ValueRequiresCast(CI.getOpcode(), Op1, DestTy, TD) ||
6699 !ValueRequiresCast(CI.getOpcode(), Op0, DestTy, TD)) {
6700 Value *Op0c = InsertOperandCastBefore(Instruction::BitCast,
6702 Value *Op1c = InsertOperandCastBefore(Instruction::BitCast,
6704 return BinaryOperator::create(
6705 cast<BinaryOperator>(SrcI)->getOpcode(), Op0c, Op1c);
6710 case Instruction::Shl:
6711 // Allow changing the sign of the source operand. Do not allow
6712 // changing the size of the shift, UNLESS the shift amount is a
6713 // constant. We must not change variable sized shifts to a smaller
6714 // size, because it is undefined to shift more bits out than exist
6716 if (DestBitSize == SrcBitSize ||
6717 (DestBitSize < SrcBitSize && isa<Constant>(Op1))) {
6718 Instruction::CastOps opcode = (DestBitSize == SrcBitSize ?
6719 Instruction::BitCast : Instruction::Trunc);
6720 Value *Op0c = InsertOperandCastBefore(opcode, Op0, DestTy, SrcI);
6721 Value *Op1c = InsertOperandCastBefore(opcode, Op1, DestTy, SrcI);
6722 return BinaryOperator::createShl(Op0c, Op1c);
6725 case Instruction::AShr:
6726 // If this is a signed shr, and if all bits shifted in are about to be
6727 // truncated off, turn it into an unsigned shr to allow greater
6729 if (DestBitSize < SrcBitSize &&
6730 isa<ConstantInt>(Op1)) {
6731 uint32_t ShiftAmt = cast<ConstantInt>(Op1)->getLimitedValue(SrcBitSize);
6732 if (SrcBitSize > ShiftAmt && SrcBitSize-ShiftAmt >= DestBitSize) {
6733 // Insert the new logical shift right.
6734 return BinaryOperator::createLShr(Op0, Op1);
6742 Instruction *InstCombiner::visitTrunc(TruncInst &CI) {
6743 if (Instruction *Result = commonIntCastTransforms(CI))
6746 Value *Src = CI.getOperand(0);
6747 const Type *Ty = CI.getType();
6748 uint32_t DestBitWidth = Ty->getPrimitiveSizeInBits();
6749 uint32_t SrcBitWidth = cast<IntegerType>(Src->getType())->getBitWidth();
6751 if (Instruction *SrcI = dyn_cast<Instruction>(Src)) {
6752 switch (SrcI->getOpcode()) {
6754 case Instruction::LShr:
6755 // We can shrink lshr to something smaller if we know the bits shifted in
6756 // are already zeros.
6757 if (ConstantInt *ShAmtV = dyn_cast<ConstantInt>(SrcI->getOperand(1))) {
6758 uint32_t ShAmt = ShAmtV->getLimitedValue(SrcBitWidth);
6760 // Get a mask for the bits shifting in.
6761 APInt Mask(APInt::getLowBitsSet(SrcBitWidth, ShAmt).shl(DestBitWidth));
6762 Value* SrcIOp0 = SrcI->getOperand(0);
6763 if (SrcI->hasOneUse() && MaskedValueIsZero(SrcIOp0, Mask)) {
6764 if (ShAmt >= DestBitWidth) // All zeros.
6765 return ReplaceInstUsesWith(CI, Constant::getNullValue(Ty));
6767 // Okay, we can shrink this. Truncate the input, then return a new
6769 Value *V1 = InsertCastBefore(Instruction::Trunc, SrcIOp0, Ty, CI);
6770 Value *V2 = InsertCastBefore(Instruction::Trunc, SrcI->getOperand(1),
6772 return BinaryOperator::createLShr(V1, V2);
6774 } else { // This is a variable shr.
6776 // Turn 'trunc (lshr X, Y) to bool' into '(X & (1 << Y)) != 0'. This is
6777 // more LLVM instructions, but allows '1 << Y' to be hoisted if
6778 // loop-invariant and CSE'd.
6779 if (CI.getType() == Type::Int1Ty && SrcI->hasOneUse()) {
6780 Value *One = ConstantInt::get(SrcI->getType(), 1);
6782 Value *V = InsertNewInstBefore(
6783 BinaryOperator::createShl(One, SrcI->getOperand(1),
6785 V = InsertNewInstBefore(BinaryOperator::createAnd(V,
6786 SrcI->getOperand(0),
6788 Value *Zero = Constant::getNullValue(V->getType());
6789 return new ICmpInst(ICmpInst::ICMP_NE, V, Zero);
6799 Instruction *InstCombiner::visitZExt(ZExtInst &CI) {
6800 // If one of the common conversion will work ..
6801 if (Instruction *Result = commonIntCastTransforms(CI))
6804 Value *Src = CI.getOperand(0);
6806 // If this is a cast of a cast
6807 if (CastInst *CSrc = dyn_cast<CastInst>(Src)) { // A->B->C cast
6808 // If this is a TRUNC followed by a ZEXT then we are dealing with integral
6809 // types and if the sizes are just right we can convert this into a logical
6810 // 'and' which will be much cheaper than the pair of casts.
6811 if (isa<TruncInst>(CSrc)) {
6812 // Get the sizes of the types involved
6813 Value *A = CSrc->getOperand(0);
6814 uint32_t SrcSize = A->getType()->getPrimitiveSizeInBits();
6815 uint32_t MidSize = CSrc->getType()->getPrimitiveSizeInBits();
6816 uint32_t DstSize = CI.getType()->getPrimitiveSizeInBits();
6817 // If we're actually extending zero bits and the trunc is a no-op
6818 if (MidSize < DstSize && SrcSize == DstSize) {
6819 // Replace both of the casts with an And of the type mask.
6820 APInt AndValue(APInt::getLowBitsSet(SrcSize, MidSize));
6821 Constant *AndConst = ConstantInt::get(AndValue);
6823 BinaryOperator::createAnd(CSrc->getOperand(0), AndConst);
6824 // Unfortunately, if the type changed, we need to cast it back.
6825 if (And->getType() != CI.getType()) {
6826 And->setName(CSrc->getName()+".mask");
6827 InsertNewInstBefore(And, CI);
6828 And = CastInst::createIntegerCast(And, CI.getType(), false/*ZExt*/);
6835 if (ICmpInst *ICI = dyn_cast<ICmpInst>(Src)) {
6836 // If we are just checking for a icmp eq of a single bit and zext'ing it
6837 // to an integer, then shift the bit to the appropriate place and then
6838 // cast to integer to avoid the comparison.
6839 if (ConstantInt *Op1C = dyn_cast<ConstantInt>(ICI->getOperand(1))) {
6840 const APInt &Op1CV = Op1C->getValue();
6842 // zext (x <s 0) to i32 --> x>>u31 true if signbit set.
6843 // zext (x >s -1) to i32 --> (x>>u31)^1 true if signbit clear.
6844 if ((ICI->getPredicate() == ICmpInst::ICMP_SLT && Op1CV == 0) ||
6845 (ICI->getPredicate() == ICmpInst::ICMP_SGT &&Op1CV.isAllOnesValue())){
6846 Value *In = ICI->getOperand(0);
6847 Value *Sh = ConstantInt::get(In->getType(),
6848 In->getType()->getPrimitiveSizeInBits()-1);
6849 In = InsertNewInstBefore(BinaryOperator::createLShr(In, Sh,
6850 In->getName()+".lobit"),
6852 if (In->getType() != CI.getType())
6853 In = CastInst::createIntegerCast(In, CI.getType(),
6854 false/*ZExt*/, "tmp", &CI);
6856 if (ICI->getPredicate() == ICmpInst::ICMP_SGT) {
6857 Constant *One = ConstantInt::get(In->getType(), 1);
6858 In = InsertNewInstBefore(BinaryOperator::createXor(In, One,
6859 In->getName()+".not"),
6863 return ReplaceInstUsesWith(CI, In);
6868 // zext (X == 0) to i32 --> X^1 iff X has only the low bit set.
6869 // zext (X == 0) to i32 --> (X>>1)^1 iff X has only the 2nd bit set.
6870 // zext (X == 1) to i32 --> X iff X has only the low bit set.
6871 // zext (X == 2) to i32 --> X>>1 iff X has only the 2nd bit set.
6872 // zext (X != 0) to i32 --> X iff X has only the low bit set.
6873 // zext (X != 0) to i32 --> X>>1 iff X has only the 2nd bit set.
6874 // zext (X != 1) to i32 --> X^1 iff X has only the low bit set.
6875 // zext (X != 2) to i32 --> (X>>1)^1 iff X has only the 2nd bit set.
6876 if ((Op1CV == 0 || Op1CV.isPowerOf2()) &&
6877 // This only works for EQ and NE
6878 ICI->isEquality()) {
6879 // If Op1C some other power of two, convert:
6880 uint32_t BitWidth = Op1C->getType()->getBitWidth();
6881 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
6882 APInt TypeMask(APInt::getAllOnesValue(BitWidth));
6883 ComputeMaskedBits(ICI->getOperand(0), TypeMask, KnownZero, KnownOne);
6885 APInt KnownZeroMask(~KnownZero);
6886 if (KnownZeroMask.isPowerOf2()) { // Exactly 1 possible 1?
6887 bool isNE = ICI->getPredicate() == ICmpInst::ICMP_NE;
6888 if (Op1CV != 0 && (Op1CV != KnownZeroMask)) {
6889 // (X&4) == 2 --> false
6890 // (X&4) != 2 --> true
6891 Constant *Res = ConstantInt::get(Type::Int1Ty, isNE);
6892 Res = ConstantExpr::getZExt(Res, CI.getType());
6893 return ReplaceInstUsesWith(CI, Res);
6896 uint32_t ShiftAmt = KnownZeroMask.logBase2();
6897 Value *In = ICI->getOperand(0);
6899 // Perform a logical shr by shiftamt.
6900 // Insert the shift to put the result in the low bit.
6901 In = InsertNewInstBefore(
6902 BinaryOperator::createLShr(In,
6903 ConstantInt::get(In->getType(), ShiftAmt),
6904 In->getName()+".lobit"), CI);
6907 if ((Op1CV != 0) == isNE) { // Toggle the low bit.
6908 Constant *One = ConstantInt::get(In->getType(), 1);
6909 In = BinaryOperator::createXor(In, One, "tmp");
6910 InsertNewInstBefore(cast<Instruction>(In), CI);
6913 if (CI.getType() == In->getType())
6914 return ReplaceInstUsesWith(CI, In);
6916 return CastInst::createIntegerCast(In, CI.getType(), false/*ZExt*/);
6924 Instruction *InstCombiner::visitSExt(SExtInst &CI) {
6925 if (Instruction *I = commonIntCastTransforms(CI))
6928 Value *Src = CI.getOperand(0);
6930 // sext (x <s 0) -> ashr x, 31 -> all ones if signed
6931 // sext (x >s -1) -> ashr x, 31 -> all ones if not signed
6932 if (ICmpInst *ICI = dyn_cast<ICmpInst>(Src)) {
6933 // If we are just checking for a icmp eq of a single bit and zext'ing it
6934 // to an integer, then shift the bit to the appropriate place and then
6935 // cast to integer to avoid the comparison.
6936 if (ConstantInt *Op1C = dyn_cast<ConstantInt>(ICI->getOperand(1))) {
6937 const APInt &Op1CV = Op1C->getValue();
6939 // sext (x <s 0) to i32 --> x>>s31 true if signbit set.
6940 // sext (x >s -1) to i32 --> (x>>s31)^-1 true if signbit clear.
6941 if ((ICI->getPredicate() == ICmpInst::ICMP_SLT && Op1CV == 0) ||
6942 (ICI->getPredicate() == ICmpInst::ICMP_SGT &&Op1CV.isAllOnesValue())){
6943 Value *In = ICI->getOperand(0);
6944 Value *Sh = ConstantInt::get(In->getType(),
6945 In->getType()->getPrimitiveSizeInBits()-1);
6946 In = InsertNewInstBefore(BinaryOperator::createAShr(In, Sh,
6947 In->getName()+".lobit"),
6949 if (In->getType() != CI.getType())
6950 In = CastInst::createIntegerCast(In, CI.getType(),
6951 true/*SExt*/, "tmp", &CI);
6953 if (ICI->getPredicate() == ICmpInst::ICMP_SGT)
6954 In = InsertNewInstBefore(BinaryOperator::createNot(In,
6955 In->getName()+".not"), CI);
6957 return ReplaceInstUsesWith(CI, In);
6965 Instruction *InstCombiner::visitFPTrunc(CastInst &CI) {
6966 return commonCastTransforms(CI);
6969 Instruction *InstCombiner::visitFPExt(CastInst &CI) {
6970 return commonCastTransforms(CI);
6973 Instruction *InstCombiner::visitFPToUI(CastInst &CI) {
6974 return commonCastTransforms(CI);
6977 Instruction *InstCombiner::visitFPToSI(CastInst &CI) {
6978 return commonCastTransforms(CI);
6981 Instruction *InstCombiner::visitUIToFP(CastInst &CI) {
6982 return commonCastTransforms(CI);
6985 Instruction *InstCombiner::visitSIToFP(CastInst &CI) {
6986 return commonCastTransforms(CI);
6989 Instruction *InstCombiner::visitPtrToInt(CastInst &CI) {
6990 return commonPointerCastTransforms(CI);
6993 Instruction *InstCombiner::visitIntToPtr(CastInst &CI) {
6994 return commonCastTransforms(CI);
6997 Instruction *InstCombiner::visitBitCast(BitCastInst &CI) {
6998 // If the operands are integer typed then apply the integer transforms,
6999 // otherwise just apply the common ones.
7000 Value *Src = CI.getOperand(0);
7001 const Type *SrcTy = Src->getType();
7002 const Type *DestTy = CI.getType();
7004 if (SrcTy->isInteger() && DestTy->isInteger()) {
7005 if (Instruction *Result = commonIntCastTransforms(CI))
7007 } else if (isa<PointerType>(SrcTy)) {
7008 if (Instruction *I = commonPointerCastTransforms(CI))
7011 if (Instruction *Result = commonCastTransforms(CI))
7016 // Get rid of casts from one type to the same type. These are useless and can
7017 // be replaced by the operand.
7018 if (DestTy == Src->getType())
7019 return ReplaceInstUsesWith(CI, Src);
7021 if (const PointerType *DstPTy = dyn_cast<PointerType>(DestTy)) {
7022 const PointerType *SrcPTy = cast<PointerType>(SrcTy);
7023 const Type *DstElTy = DstPTy->getElementType();
7024 const Type *SrcElTy = SrcPTy->getElementType();
7026 // If we are casting a malloc or alloca to a pointer to a type of the same
7027 // size, rewrite the allocation instruction to allocate the "right" type.
7028 if (AllocationInst *AI = dyn_cast<AllocationInst>(Src))
7029 if (Instruction *V = PromoteCastOfAllocation(CI, *AI))
7032 // If the source and destination are pointers, and this cast is equivalent
7033 // to a getelementptr X, 0, 0, 0... turn it into the appropriate gep.
7034 // This can enhance SROA and other transforms that want type-safe pointers.
7035 Constant *ZeroUInt = Constant::getNullValue(Type::Int32Ty);
7036 unsigned NumZeros = 0;
7037 while (SrcElTy != DstElTy &&
7038 isa<CompositeType>(SrcElTy) && !isa<PointerType>(SrcElTy) &&
7039 SrcElTy->getNumContainedTypes() /* not "{}" */) {
7040 SrcElTy = cast<CompositeType>(SrcElTy)->getTypeAtIndex(ZeroUInt);
7044 // If we found a path from the src to dest, create the getelementptr now.
7045 if (SrcElTy == DstElTy) {
7046 SmallVector<Value*, 8> Idxs(NumZeros+1, ZeroUInt);
7047 return new GetElementPtrInst(Src, &Idxs[0], Idxs.size());
7051 if (ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(Src)) {
7052 if (SVI->hasOneUse()) {
7053 // Okay, we have (bitconvert (shuffle ..)). Check to see if this is
7054 // a bitconvert to a vector with the same # elts.
7055 if (isa<VectorType>(DestTy) &&
7056 cast<VectorType>(DestTy)->getNumElements() ==
7057 SVI->getType()->getNumElements()) {
7059 // If either of the operands is a cast from CI.getType(), then
7060 // evaluating the shuffle in the casted destination's type will allow
7061 // us to eliminate at least one cast.
7062 if (((Tmp = dyn_cast<CastInst>(SVI->getOperand(0))) &&
7063 Tmp->getOperand(0)->getType() == DestTy) ||
7064 ((Tmp = dyn_cast<CastInst>(SVI->getOperand(1))) &&
7065 Tmp->getOperand(0)->getType() == DestTy)) {
7066 Value *LHS = InsertOperandCastBefore(Instruction::BitCast,
7067 SVI->getOperand(0), DestTy, &CI);
7068 Value *RHS = InsertOperandCastBefore(Instruction::BitCast,
7069 SVI->getOperand(1), DestTy, &CI);
7070 // Return a new shuffle vector. Use the same element ID's, as we
7071 // know the vector types match #elts.
7072 return new ShuffleVectorInst(LHS, RHS, SVI->getOperand(2));
7080 /// GetSelectFoldableOperands - We want to turn code that looks like this:
7082 /// %D = select %cond, %C, %A
7084 /// %C = select %cond, %B, 0
7087 /// Assuming that the specified instruction is an operand to the select, return
7088 /// a bitmask indicating which operands of this instruction are foldable if they
7089 /// equal the other incoming value of the select.
7091 static unsigned GetSelectFoldableOperands(Instruction *I) {
7092 switch (I->getOpcode()) {
7093 case Instruction::Add:
7094 case Instruction::Mul:
7095 case Instruction::And:
7096 case Instruction::Or:
7097 case Instruction::Xor:
7098 return 3; // Can fold through either operand.
7099 case Instruction::Sub: // Can only fold on the amount subtracted.
7100 case Instruction::Shl: // Can only fold on the shift amount.
7101 case Instruction::LShr:
7102 case Instruction::AShr:
7105 return 0; // Cannot fold
7109 /// GetSelectFoldableConstant - For the same transformation as the previous
7110 /// function, return the identity constant that goes into the select.
7111 static Constant *GetSelectFoldableConstant(Instruction *I) {
7112 switch (I->getOpcode()) {
7113 default: assert(0 && "This cannot happen!"); abort();
7114 case Instruction::Add:
7115 case Instruction::Sub:
7116 case Instruction::Or:
7117 case Instruction::Xor:
7118 case Instruction::Shl:
7119 case Instruction::LShr:
7120 case Instruction::AShr:
7121 return Constant::getNullValue(I->getType());
7122 case Instruction::And:
7123 return Constant::getAllOnesValue(I->getType());
7124 case Instruction::Mul:
7125 return ConstantInt::get(I->getType(), 1);
7129 /// FoldSelectOpOp - Here we have (select c, TI, FI), and we know that TI and FI
7130 /// have the same opcode and only one use each. Try to simplify this.
7131 Instruction *InstCombiner::FoldSelectOpOp(SelectInst &SI, Instruction *TI,
7133 if (TI->getNumOperands() == 1) {
7134 // If this is a non-volatile load or a cast from the same type,
7137 if (TI->getOperand(0)->getType() != FI->getOperand(0)->getType())
7140 return 0; // unknown unary op.
7143 // Fold this by inserting a select from the input values.
7144 SelectInst *NewSI = new SelectInst(SI.getCondition(), TI->getOperand(0),
7145 FI->getOperand(0), SI.getName()+".v");
7146 InsertNewInstBefore(NewSI, SI);
7147 return CastInst::create(Instruction::CastOps(TI->getOpcode()), NewSI,
7151 // Only handle binary operators here.
7152 if (!isa<BinaryOperator>(TI))
7155 // Figure out if the operations have any operands in common.
7156 Value *MatchOp, *OtherOpT, *OtherOpF;
7158 if (TI->getOperand(0) == FI->getOperand(0)) {
7159 MatchOp = TI->getOperand(0);
7160 OtherOpT = TI->getOperand(1);
7161 OtherOpF = FI->getOperand(1);
7162 MatchIsOpZero = true;
7163 } else if (TI->getOperand(1) == FI->getOperand(1)) {
7164 MatchOp = TI->getOperand(1);
7165 OtherOpT = TI->getOperand(0);
7166 OtherOpF = FI->getOperand(0);
7167 MatchIsOpZero = false;
7168 } else if (!TI->isCommutative()) {
7170 } else if (TI->getOperand(0) == FI->getOperand(1)) {
7171 MatchOp = TI->getOperand(0);
7172 OtherOpT = TI->getOperand(1);
7173 OtherOpF = FI->getOperand(0);
7174 MatchIsOpZero = true;
7175 } else if (TI->getOperand(1) == FI->getOperand(0)) {
7176 MatchOp = TI->getOperand(1);
7177 OtherOpT = TI->getOperand(0);
7178 OtherOpF = FI->getOperand(1);
7179 MatchIsOpZero = true;
7184 // If we reach here, they do have operations in common.
7185 SelectInst *NewSI = new SelectInst(SI.getCondition(), OtherOpT,
7186 OtherOpF, SI.getName()+".v");
7187 InsertNewInstBefore(NewSI, SI);
7189 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(TI)) {
7191 return BinaryOperator::create(BO->getOpcode(), MatchOp, NewSI);
7193 return BinaryOperator::create(BO->getOpcode(), NewSI, MatchOp);
7195 assert(0 && "Shouldn't get here");
7199 Instruction *InstCombiner::visitSelectInst(SelectInst &SI) {
7200 Value *CondVal = SI.getCondition();
7201 Value *TrueVal = SI.getTrueValue();
7202 Value *FalseVal = SI.getFalseValue();
7204 // select true, X, Y -> X
7205 // select false, X, Y -> Y
7206 if (ConstantInt *C = dyn_cast<ConstantInt>(CondVal))
7207 return ReplaceInstUsesWith(SI, C->getZExtValue() ? TrueVal : FalseVal);
7209 // select C, X, X -> X
7210 if (TrueVal == FalseVal)
7211 return ReplaceInstUsesWith(SI, TrueVal);
7213 if (isa<UndefValue>(TrueVal)) // select C, undef, X -> X
7214 return ReplaceInstUsesWith(SI, FalseVal);
7215 if (isa<UndefValue>(FalseVal)) // select C, X, undef -> X
7216 return ReplaceInstUsesWith(SI, TrueVal);
7217 if (isa<UndefValue>(CondVal)) { // select undef, X, Y -> X or Y
7218 if (isa<Constant>(TrueVal))
7219 return ReplaceInstUsesWith(SI, TrueVal);
7221 return ReplaceInstUsesWith(SI, FalseVal);
7224 if (SI.getType() == Type::Int1Ty) {
7225 if (ConstantInt *C = dyn_cast<ConstantInt>(TrueVal)) {
7226 if (C->getZExtValue()) {
7227 // Change: A = select B, true, C --> A = or B, C
7228 return BinaryOperator::createOr(CondVal, FalseVal);
7230 // Change: A = select B, false, C --> A = and !B, C
7232 InsertNewInstBefore(BinaryOperator::createNot(CondVal,
7233 "not."+CondVal->getName()), SI);
7234 return BinaryOperator::createAnd(NotCond, FalseVal);
7236 } else if (ConstantInt *C = dyn_cast<ConstantInt>(FalseVal)) {
7237 if (C->getZExtValue() == false) {
7238 // Change: A = select B, C, false --> A = and B, C
7239 return BinaryOperator::createAnd(CondVal, TrueVal);
7241 // Change: A = select B, C, true --> A = or !B, C
7243 InsertNewInstBefore(BinaryOperator::createNot(CondVal,
7244 "not."+CondVal->getName()), SI);
7245 return BinaryOperator::createOr(NotCond, TrueVal);
7250 // Selecting between two integer constants?
7251 if (ConstantInt *TrueValC = dyn_cast<ConstantInt>(TrueVal))
7252 if (ConstantInt *FalseValC = dyn_cast<ConstantInt>(FalseVal)) {
7253 // select C, 1, 0 -> zext C to int
7254 if (FalseValC->isZero() && TrueValC->getValue() == 1) {
7255 return CastInst::create(Instruction::ZExt, CondVal, SI.getType());
7256 } else if (TrueValC->isZero() && FalseValC->getValue() == 1) {
7257 // select C, 0, 1 -> zext !C to int
7259 InsertNewInstBefore(BinaryOperator::createNot(CondVal,
7260 "not."+CondVal->getName()), SI);
7261 return CastInst::create(Instruction::ZExt, NotCond, SI.getType());
7264 // FIXME: Turn select 0/-1 and -1/0 into sext from condition!
7266 if (ICmpInst *IC = dyn_cast<ICmpInst>(SI.getCondition())) {
7268 // (x <s 0) ? -1 : 0 -> ashr x, 31
7269 if (TrueValC->isAllOnesValue() && FalseValC->isZero())
7270 if (ConstantInt *CmpCst = dyn_cast<ConstantInt>(IC->getOperand(1))) {
7271 if (IC->getPredicate() == ICmpInst::ICMP_SLT && CmpCst->isZero()) {
7272 // The comparison constant and the result are not neccessarily the
7273 // same width. Make an all-ones value by inserting a AShr.
7274 Value *X = IC->getOperand(0);
7275 uint32_t Bits = X->getType()->getPrimitiveSizeInBits();
7276 Constant *ShAmt = ConstantInt::get(X->getType(), Bits-1);
7277 Instruction *SRA = BinaryOperator::create(Instruction::AShr, X,
7279 InsertNewInstBefore(SRA, SI);
7281 // Finally, convert to the type of the select RHS. We figure out
7282 // if this requires a SExt, Trunc or BitCast based on the sizes.
7283 Instruction::CastOps opc = Instruction::BitCast;
7284 uint32_t SRASize = SRA->getType()->getPrimitiveSizeInBits();
7285 uint32_t SISize = SI.getType()->getPrimitiveSizeInBits();
7286 if (SRASize < SISize)
7287 opc = Instruction::SExt;
7288 else if (SRASize > SISize)
7289 opc = Instruction::Trunc;
7290 return CastInst::create(opc, SRA, SI.getType());
7295 // If one of the constants is zero (we know they can't both be) and we
7296 // have an icmp instruction with zero, and we have an 'and' with the
7297 // non-constant value, eliminate this whole mess. This corresponds to
7298 // cases like this: ((X & 27) ? 27 : 0)
7299 if (TrueValC->isZero() || FalseValC->isZero())
7300 if (IC->isEquality() && isa<ConstantInt>(IC->getOperand(1)) &&
7301 cast<Constant>(IC->getOperand(1))->isNullValue())
7302 if (Instruction *ICA = dyn_cast<Instruction>(IC->getOperand(0)))
7303 if (ICA->getOpcode() == Instruction::And &&
7304 isa<ConstantInt>(ICA->getOperand(1)) &&
7305 (ICA->getOperand(1) == TrueValC ||
7306 ICA->getOperand(1) == FalseValC) &&
7307 isOneBitSet(cast<ConstantInt>(ICA->getOperand(1)))) {
7308 // Okay, now we know that everything is set up, we just don't
7309 // know whether we have a icmp_ne or icmp_eq and whether the
7310 // true or false val is the zero.
7311 bool ShouldNotVal = !TrueValC->isZero();
7312 ShouldNotVal ^= IC->getPredicate() == ICmpInst::ICMP_NE;
7315 V = InsertNewInstBefore(BinaryOperator::create(
7316 Instruction::Xor, V, ICA->getOperand(1)), SI);
7317 return ReplaceInstUsesWith(SI, V);
7322 // See if we are selecting two values based on a comparison of the two values.
7323 if (FCmpInst *FCI = dyn_cast<FCmpInst>(CondVal)) {
7324 if (FCI->getOperand(0) == TrueVal && FCI->getOperand(1) == FalseVal) {
7325 // Transform (X == Y) ? X : Y -> Y
7326 if (FCI->getPredicate() == FCmpInst::FCMP_OEQ)
7327 return ReplaceInstUsesWith(SI, FalseVal);
7328 // Transform (X != Y) ? X : Y -> X
7329 if (FCI->getPredicate() == FCmpInst::FCMP_ONE)
7330 return ReplaceInstUsesWith(SI, TrueVal);
7331 // NOTE: if we wanted to, this is where to detect MIN/MAX/ABS/etc.
7333 } else if (FCI->getOperand(0) == FalseVal && FCI->getOperand(1) == TrueVal){
7334 // Transform (X == Y) ? Y : X -> X
7335 if (FCI->getPredicate() == FCmpInst::FCMP_OEQ)
7336 return ReplaceInstUsesWith(SI, FalseVal);
7337 // Transform (X != Y) ? Y : X -> Y
7338 if (FCI->getPredicate() == FCmpInst::FCMP_ONE)
7339 return ReplaceInstUsesWith(SI, TrueVal);
7340 // NOTE: if we wanted to, this is where to detect MIN/MAX/ABS/etc.
7344 // See if we are selecting two values based on a comparison of the two values.
7345 if (ICmpInst *ICI = dyn_cast<ICmpInst>(CondVal)) {
7346 if (ICI->getOperand(0) == TrueVal && ICI->getOperand(1) == FalseVal) {
7347 // Transform (X == Y) ? X : Y -> Y
7348 if (ICI->getPredicate() == ICmpInst::ICMP_EQ)
7349 return ReplaceInstUsesWith(SI, FalseVal);
7350 // Transform (X != Y) ? X : Y -> X
7351 if (ICI->getPredicate() == ICmpInst::ICMP_NE)
7352 return ReplaceInstUsesWith(SI, TrueVal);
7353 // NOTE: if we wanted to, this is where to detect MIN/MAX/ABS/etc.
7355 } else if (ICI->getOperand(0) == FalseVal && ICI->getOperand(1) == TrueVal){
7356 // Transform (X == Y) ? Y : X -> X
7357 if (ICI->getPredicate() == ICmpInst::ICMP_EQ)
7358 return ReplaceInstUsesWith(SI, FalseVal);
7359 // Transform (X != Y) ? Y : X -> Y
7360 if (ICI->getPredicate() == ICmpInst::ICMP_NE)
7361 return ReplaceInstUsesWith(SI, TrueVal);
7362 // NOTE: if we wanted to, this is where to detect MIN/MAX/ABS/etc.
7366 if (Instruction *TI = dyn_cast<Instruction>(TrueVal))
7367 if (Instruction *FI = dyn_cast<Instruction>(FalseVal))
7368 if (TI->hasOneUse() && FI->hasOneUse()) {
7369 Instruction *AddOp = 0, *SubOp = 0;
7371 // Turn (select C, (op X, Y), (op X, Z)) -> (op X, (select C, Y, Z))
7372 if (TI->getOpcode() == FI->getOpcode())
7373 if (Instruction *IV = FoldSelectOpOp(SI, TI, FI))
7376 // Turn select C, (X+Y), (X-Y) --> (X+(select C, Y, (-Y))). This is
7377 // even legal for FP.
7378 if (TI->getOpcode() == Instruction::Sub &&
7379 FI->getOpcode() == Instruction::Add) {
7380 AddOp = FI; SubOp = TI;
7381 } else if (FI->getOpcode() == Instruction::Sub &&
7382 TI->getOpcode() == Instruction::Add) {
7383 AddOp = TI; SubOp = FI;
7387 Value *OtherAddOp = 0;
7388 if (SubOp->getOperand(0) == AddOp->getOperand(0)) {
7389 OtherAddOp = AddOp->getOperand(1);
7390 } else if (SubOp->getOperand(0) == AddOp->getOperand(1)) {
7391 OtherAddOp = AddOp->getOperand(0);
7395 // So at this point we know we have (Y -> OtherAddOp):
7396 // select C, (add X, Y), (sub X, Z)
7397 Value *NegVal; // Compute -Z
7398 if (Constant *C = dyn_cast<Constant>(SubOp->getOperand(1))) {
7399 NegVal = ConstantExpr::getNeg(C);
7401 NegVal = InsertNewInstBefore(
7402 BinaryOperator::createNeg(SubOp->getOperand(1), "tmp"), SI);
7405 Value *NewTrueOp = OtherAddOp;
7406 Value *NewFalseOp = NegVal;
7408 std::swap(NewTrueOp, NewFalseOp);
7409 Instruction *NewSel =
7410 new SelectInst(CondVal, NewTrueOp,NewFalseOp,SI.getName()+".p");
7412 NewSel = InsertNewInstBefore(NewSel, SI);
7413 return BinaryOperator::createAdd(SubOp->getOperand(0), NewSel);
7418 // See if we can fold the select into one of our operands.
7419 if (SI.getType()->isInteger()) {
7420 // See the comment above GetSelectFoldableOperands for a description of the
7421 // transformation we are doing here.
7422 if (Instruction *TVI = dyn_cast<Instruction>(TrueVal))
7423 if (TVI->hasOneUse() && TVI->getNumOperands() == 2 &&
7424 !isa<Constant>(FalseVal))
7425 if (unsigned SFO = GetSelectFoldableOperands(TVI)) {
7426 unsigned OpToFold = 0;
7427 if ((SFO & 1) && FalseVal == TVI->getOperand(0)) {
7429 } else if ((SFO & 2) && FalseVal == TVI->getOperand(1)) {
7434 Constant *C = GetSelectFoldableConstant(TVI);
7435 Instruction *NewSel =
7436 new SelectInst(SI.getCondition(), TVI->getOperand(2-OpToFold), C);
7437 InsertNewInstBefore(NewSel, SI);
7438 NewSel->takeName(TVI);
7439 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(TVI))
7440 return BinaryOperator::create(BO->getOpcode(), FalseVal, NewSel);
7442 assert(0 && "Unknown instruction!!");
7447 if (Instruction *FVI = dyn_cast<Instruction>(FalseVal))
7448 if (FVI->hasOneUse() && FVI->getNumOperands() == 2 &&
7449 !isa<Constant>(TrueVal))
7450 if (unsigned SFO = GetSelectFoldableOperands(FVI)) {
7451 unsigned OpToFold = 0;
7452 if ((SFO & 1) && TrueVal == FVI->getOperand(0)) {
7454 } else if ((SFO & 2) && TrueVal == FVI->getOperand(1)) {
7459 Constant *C = GetSelectFoldableConstant(FVI);
7460 Instruction *NewSel =
7461 new SelectInst(SI.getCondition(), C, FVI->getOperand(2-OpToFold));
7462 InsertNewInstBefore(NewSel, SI);
7463 NewSel->takeName(FVI);
7464 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(FVI))
7465 return BinaryOperator::create(BO->getOpcode(), TrueVal, NewSel);
7467 assert(0 && "Unknown instruction!!");
7472 if (BinaryOperator::isNot(CondVal)) {
7473 SI.setOperand(0, BinaryOperator::getNotArgument(CondVal));
7474 SI.setOperand(1, FalseVal);
7475 SI.setOperand(2, TrueVal);
7482 /// GetKnownAlignment - If the specified pointer has an alignment that we can
7483 /// determine, return it, otherwise return 0.
7484 static unsigned GetKnownAlignment(Value *V, TargetData *TD) {
7485 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(V)) {
7486 unsigned Align = GV->getAlignment();
7487 if (Align == 0 && TD)
7488 Align = TD->getPrefTypeAlignment(GV->getType()->getElementType());
7490 } else if (AllocationInst *AI = dyn_cast<AllocationInst>(V)) {
7491 unsigned Align = AI->getAlignment();
7492 if (Align == 0 && TD) {
7493 if (isa<AllocaInst>(AI))
7494 Align = TD->getPrefTypeAlignment(AI->getType()->getElementType());
7495 else if (isa<MallocInst>(AI)) {
7496 // Malloc returns maximally aligned memory.
7497 Align = TD->getABITypeAlignment(AI->getType()->getElementType());
7500 (unsigned)TD->getABITypeAlignment(Type::DoubleTy));
7503 (unsigned)TD->getABITypeAlignment(Type::Int64Ty));
7507 } else if (isa<BitCastInst>(V) ||
7508 (isa<ConstantExpr>(V) &&
7509 cast<ConstantExpr>(V)->getOpcode() == Instruction::BitCast)) {
7510 User *CI = cast<User>(V);
7511 if (isa<PointerType>(CI->getOperand(0)->getType()))
7512 return GetKnownAlignment(CI->getOperand(0), TD);
7514 } else if (User *GEPI = dyn_castGetElementPtr(V)) {
7515 unsigned BaseAlignment = GetKnownAlignment(GEPI->getOperand(0), TD);
7516 if (BaseAlignment == 0) return 0;
7518 // If all indexes are zero, it is just the alignment of the base pointer.
7519 bool AllZeroOperands = true;
7520 for (unsigned i = 1, e = GEPI->getNumOperands(); i != e; ++i)
7521 if (!isa<Constant>(GEPI->getOperand(i)) ||
7522 !cast<Constant>(GEPI->getOperand(i))->isNullValue()) {
7523 AllZeroOperands = false;
7526 if (AllZeroOperands)
7527 return BaseAlignment;
7529 // Otherwise, if the base alignment is >= the alignment we expect for the
7530 // base pointer type, then we know that the resultant pointer is aligned at
7531 // least as much as its type requires.
7534 const Type *BasePtrTy = GEPI->getOperand(0)->getType();
7535 const PointerType *PtrTy = cast<PointerType>(BasePtrTy);
7536 if (TD->getABITypeAlignment(PtrTy->getElementType())
7538 const Type *GEPTy = GEPI->getType();
7539 const PointerType *GEPPtrTy = cast<PointerType>(GEPTy);
7540 return TD->getABITypeAlignment(GEPPtrTy->getElementType());
7548 /// visitCallInst - CallInst simplification. This mostly only handles folding
7549 /// of intrinsic instructions. For normal calls, it allows visitCallSite to do
7550 /// the heavy lifting.
7552 Instruction *InstCombiner::visitCallInst(CallInst &CI) {
7553 IntrinsicInst *II = dyn_cast<IntrinsicInst>(&CI);
7554 if (!II) return visitCallSite(&CI);
7556 // Intrinsics cannot occur in an invoke, so handle them here instead of in
7558 if (MemIntrinsic *MI = dyn_cast<MemIntrinsic>(II)) {
7559 bool Changed = false;
7561 // memmove/cpy/set of zero bytes is a noop.
7562 if (Constant *NumBytes = dyn_cast<Constant>(MI->getLength())) {
7563 if (NumBytes->isNullValue()) return EraseInstFromFunction(CI);
7565 if (ConstantInt *CI = dyn_cast<ConstantInt>(NumBytes))
7566 if (CI->getZExtValue() == 1) {
7567 // Replace the instruction with just byte operations. We would
7568 // transform other cases to loads/stores, but we don't know if
7569 // alignment is sufficient.
7573 // If we have a memmove and the source operation is a constant global,
7574 // then the source and dest pointers can't alias, so we can change this
7575 // into a call to memcpy.
7576 if (MemMoveInst *MMI = dyn_cast<MemMoveInst>(II)) {
7577 if (GlobalVariable *GVSrc = dyn_cast<GlobalVariable>(MMI->getSource()))
7578 if (GVSrc->isConstant()) {
7579 Module *M = CI.getParent()->getParent()->getParent();
7581 if (CI.getCalledFunction()->getFunctionType()->getParamType(2) ==
7583 Name = "llvm.memcpy.i32";
7585 Name = "llvm.memcpy.i64";
7586 Constant *MemCpy = M->getOrInsertFunction(Name,
7587 CI.getCalledFunction()->getFunctionType());
7588 CI.setOperand(0, MemCpy);
7593 // If we can determine a pointer alignment that is bigger than currently
7594 // set, update the alignment.
7595 if (isa<MemCpyInst>(MI) || isa<MemMoveInst>(MI)) {
7596 unsigned Alignment1 = GetKnownAlignment(MI->getOperand(1), TD);
7597 unsigned Alignment2 = GetKnownAlignment(MI->getOperand(2), TD);
7598 unsigned Align = std::min(Alignment1, Alignment2);
7599 if (MI->getAlignment()->getZExtValue() < Align) {
7600 MI->setAlignment(ConstantInt::get(Type::Int32Ty, Align));
7603 } else if (isa<MemSetInst>(MI)) {
7604 unsigned Alignment = GetKnownAlignment(MI->getDest(), TD);
7605 if (MI->getAlignment()->getZExtValue() < Alignment) {
7606 MI->setAlignment(ConstantInt::get(Type::Int32Ty, Alignment));
7611 if (Changed) return II;
7613 switch (II->getIntrinsicID()) {
7615 case Intrinsic::ppc_altivec_lvx:
7616 case Intrinsic::ppc_altivec_lvxl:
7617 case Intrinsic::x86_sse_loadu_ps:
7618 case Intrinsic::x86_sse2_loadu_pd:
7619 case Intrinsic::x86_sse2_loadu_dq:
7620 // Turn PPC lvx -> load if the pointer is known aligned.
7621 // Turn X86 loadups -> load if the pointer is known aligned.
7622 if (GetKnownAlignment(II->getOperand(1), TD) >= 16) {
7623 Value *Ptr = InsertCastBefore(Instruction::BitCast, II->getOperand(1),
7624 PointerType::get(II->getType()), CI);
7625 return new LoadInst(Ptr);
7628 case Intrinsic::ppc_altivec_stvx:
7629 case Intrinsic::ppc_altivec_stvxl:
7630 // Turn stvx -> store if the pointer is known aligned.
7631 if (GetKnownAlignment(II->getOperand(2), TD) >= 16) {
7632 const Type *OpPtrTy = PointerType::get(II->getOperand(1)->getType());
7633 Value *Ptr = InsertCastBefore(Instruction::BitCast, II->getOperand(2),
7635 return new StoreInst(II->getOperand(1), Ptr);
7638 case Intrinsic::x86_sse_storeu_ps:
7639 case Intrinsic::x86_sse2_storeu_pd:
7640 case Intrinsic::x86_sse2_storeu_dq:
7641 case Intrinsic::x86_sse2_storel_dq:
7642 // Turn X86 storeu -> store if the pointer is known aligned.
7643 if (GetKnownAlignment(II->getOperand(1), TD) >= 16) {
7644 const Type *OpPtrTy = PointerType::get(II->getOperand(2)->getType());
7645 Value *Ptr = InsertCastBefore(Instruction::BitCast, II->getOperand(1),
7647 return new StoreInst(II->getOperand(2), Ptr);
7651 case Intrinsic::x86_sse_cvttss2si: {
7652 // These intrinsics only demands the 0th element of its input vector. If
7653 // we can simplify the input based on that, do so now.
7655 if (Value *V = SimplifyDemandedVectorElts(II->getOperand(1), 1,
7657 II->setOperand(1, V);
7663 case Intrinsic::ppc_altivec_vperm:
7664 // Turn vperm(V1,V2,mask) -> shuffle(V1,V2,mask) if mask is a constant.
7665 if (ConstantVector *Mask = dyn_cast<ConstantVector>(II->getOperand(3))) {
7666 assert(Mask->getNumOperands() == 16 && "Bad type for intrinsic!");
7668 // Check that all of the elements are integer constants or undefs.
7669 bool AllEltsOk = true;
7670 for (unsigned i = 0; i != 16; ++i) {
7671 if (!isa<ConstantInt>(Mask->getOperand(i)) &&
7672 !isa<UndefValue>(Mask->getOperand(i))) {
7679 // Cast the input vectors to byte vectors.
7680 Value *Op0 = InsertCastBefore(Instruction::BitCast,
7681 II->getOperand(1), Mask->getType(), CI);
7682 Value *Op1 = InsertCastBefore(Instruction::BitCast,
7683 II->getOperand(2), Mask->getType(), CI);
7684 Value *Result = UndefValue::get(Op0->getType());
7686 // Only extract each element once.
7687 Value *ExtractedElts[32];
7688 memset(ExtractedElts, 0, sizeof(ExtractedElts));
7690 for (unsigned i = 0; i != 16; ++i) {
7691 if (isa<UndefValue>(Mask->getOperand(i)))
7693 unsigned Idx=cast<ConstantInt>(Mask->getOperand(i))->getZExtValue();
7694 Idx &= 31; // Match the hardware behavior.
7696 if (ExtractedElts[Idx] == 0) {
7698 new ExtractElementInst(Idx < 16 ? Op0 : Op1, Idx&15, "tmp");
7699 InsertNewInstBefore(Elt, CI);
7700 ExtractedElts[Idx] = Elt;
7703 // Insert this value into the result vector.
7704 Result = new InsertElementInst(Result, ExtractedElts[Idx], i,"tmp");
7705 InsertNewInstBefore(cast<Instruction>(Result), CI);
7707 return CastInst::create(Instruction::BitCast, Result, CI.getType());
7712 case Intrinsic::stackrestore: {
7713 // If the save is right next to the restore, remove the restore. This can
7714 // happen when variable allocas are DCE'd.
7715 if (IntrinsicInst *SS = dyn_cast<IntrinsicInst>(II->getOperand(1))) {
7716 if (SS->getIntrinsicID() == Intrinsic::stacksave) {
7717 BasicBlock::iterator BI = SS;
7719 return EraseInstFromFunction(CI);
7723 // If the stack restore is in a return/unwind block and if there are no
7724 // allocas or calls between the restore and the return, nuke the restore.
7725 TerminatorInst *TI = II->getParent()->getTerminator();
7726 if (isa<ReturnInst>(TI) || isa<UnwindInst>(TI)) {
7727 BasicBlock::iterator BI = II;
7728 bool CannotRemove = false;
7729 for (++BI; &*BI != TI; ++BI) {
7730 if (isa<AllocaInst>(BI) ||
7731 (isa<CallInst>(BI) && !isa<IntrinsicInst>(BI))) {
7732 CannotRemove = true;
7737 return EraseInstFromFunction(CI);
7744 return visitCallSite(II);
7747 // InvokeInst simplification
7749 Instruction *InstCombiner::visitInvokeInst(InvokeInst &II) {
7750 return visitCallSite(&II);
7753 // visitCallSite - Improvements for call and invoke instructions.
7755 Instruction *InstCombiner::visitCallSite(CallSite CS) {
7756 bool Changed = false;
7758 // If the callee is a constexpr cast of a function, attempt to move the cast
7759 // to the arguments of the call/invoke.
7760 if (transformConstExprCastCall(CS)) return 0;
7762 Value *Callee = CS.getCalledValue();
7764 if (Function *CalleeF = dyn_cast<Function>(Callee))
7765 if (CalleeF->getCallingConv() != CS.getCallingConv()) {
7766 Instruction *OldCall = CS.getInstruction();
7767 // If the call and callee calling conventions don't match, this call must
7768 // be unreachable, as the call is undefined.
7769 new StoreInst(ConstantInt::getTrue(),
7770 UndefValue::get(PointerType::get(Type::Int1Ty)), OldCall);
7771 if (!OldCall->use_empty())
7772 OldCall->replaceAllUsesWith(UndefValue::get(OldCall->getType()));
7773 if (isa<CallInst>(OldCall)) // Not worth removing an invoke here.
7774 return EraseInstFromFunction(*OldCall);
7778 if (isa<ConstantPointerNull>(Callee) || isa<UndefValue>(Callee)) {
7779 // This instruction is not reachable, just remove it. We insert a store to
7780 // undef so that we know that this code is not reachable, despite the fact
7781 // that we can't modify the CFG here.
7782 new StoreInst(ConstantInt::getTrue(),
7783 UndefValue::get(PointerType::get(Type::Int1Ty)),
7784 CS.getInstruction());
7786 if (!CS.getInstruction()->use_empty())
7787 CS.getInstruction()->
7788 replaceAllUsesWith(UndefValue::get(CS.getInstruction()->getType()));
7790 if (InvokeInst *II = dyn_cast<InvokeInst>(CS.getInstruction())) {
7791 // Don't break the CFG, insert a dummy cond branch.
7792 new BranchInst(II->getNormalDest(), II->getUnwindDest(),
7793 ConstantInt::getTrue(), II);
7795 return EraseInstFromFunction(*CS.getInstruction());
7798 const PointerType *PTy = cast<PointerType>(Callee->getType());
7799 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
7800 if (FTy->isVarArg()) {
7801 // See if we can optimize any arguments passed through the varargs area of
7803 for (CallSite::arg_iterator I = CS.arg_begin()+FTy->getNumParams(),
7804 E = CS.arg_end(); I != E; ++I)
7805 if (CastInst *CI = dyn_cast<CastInst>(*I)) {
7806 // If this cast does not effect the value passed through the varargs
7807 // area, we can eliminate the use of the cast.
7808 Value *Op = CI->getOperand(0);
7809 if (CI->isLosslessCast()) {
7816 return Changed ? CS.getInstruction() : 0;
7819 // transformConstExprCastCall - If the callee is a constexpr cast of a function,
7820 // attempt to move the cast to the arguments of the call/invoke.
7822 bool InstCombiner::transformConstExprCastCall(CallSite CS) {
7823 if (!isa<ConstantExpr>(CS.getCalledValue())) return false;
7824 ConstantExpr *CE = cast<ConstantExpr>(CS.getCalledValue());
7825 if (CE->getOpcode() != Instruction::BitCast ||
7826 !isa<Function>(CE->getOperand(0)))
7828 Function *Callee = cast<Function>(CE->getOperand(0));
7829 Instruction *Caller = CS.getInstruction();
7831 // Okay, this is a cast from a function to a different type. Unless doing so
7832 // would cause a type conversion of one of our arguments, change this call to
7833 // be a direct call with arguments casted to the appropriate types.
7835 const FunctionType *FT = Callee->getFunctionType();
7836 const Type *OldRetTy = Caller->getType();
7838 const FunctionType *ActualFT =
7839 cast<FunctionType>(cast<PointerType>(CE->getType())->getElementType());
7841 // If the parameter attributes don't match up, don't do the xform. We don't
7842 // want to lose an sret attribute or something.
7843 if (FT->getParamAttrs() != ActualFT->getParamAttrs())
7846 // Check to see if we are changing the return type...
7847 if (OldRetTy != FT->getReturnType()) {
7848 if (Callee->isDeclaration() && !Caller->use_empty() &&
7849 // Conversion is ok if changing from pointer to int of same size.
7850 !(isa<PointerType>(FT->getReturnType()) &&
7851 TD->getIntPtrType() == OldRetTy))
7852 return false; // Cannot transform this return value.
7854 // If the callsite is an invoke instruction, and the return value is used by
7855 // a PHI node in a successor, we cannot change the return type of the call
7856 // because there is no place to put the cast instruction (without breaking
7857 // the critical edge). Bail out in this case.
7858 if (!Caller->use_empty())
7859 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller))
7860 for (Value::use_iterator UI = II->use_begin(), E = II->use_end();
7862 if (PHINode *PN = dyn_cast<PHINode>(*UI))
7863 if (PN->getParent() == II->getNormalDest() ||
7864 PN->getParent() == II->getUnwindDest())
7868 unsigned NumActualArgs = unsigned(CS.arg_end()-CS.arg_begin());
7869 unsigned NumCommonArgs = std::min(FT->getNumParams(), NumActualArgs);
7871 CallSite::arg_iterator AI = CS.arg_begin();
7872 for (unsigned i = 0, e = NumCommonArgs; i != e; ++i, ++AI) {
7873 const Type *ParamTy = FT->getParamType(i);
7874 const Type *ActTy = (*AI)->getType();
7875 ConstantInt *c = dyn_cast<ConstantInt>(*AI);
7876 //Some conversions are safe even if we do not have a body.
7877 //Either we can cast directly, or we can upconvert the argument
7878 bool isConvertible = ActTy == ParamTy ||
7879 (isa<PointerType>(ParamTy) && isa<PointerType>(ActTy)) ||
7880 (ParamTy->isInteger() && ActTy->isInteger() &&
7881 ParamTy->getPrimitiveSizeInBits() >= ActTy->getPrimitiveSizeInBits()) ||
7882 (c && ParamTy->getPrimitiveSizeInBits() >= ActTy->getPrimitiveSizeInBits()
7883 && c->getValue().isStrictlyPositive());
7884 if (Callee->isDeclaration() && !isConvertible) return false;
7886 // Most other conversions can be done if we have a body, even if these
7887 // lose information, e.g. int->short.
7888 // Some conversions cannot be done at all, e.g. float to pointer.
7889 // Logic here parallels CastInst::getCastOpcode (the design there
7890 // requires legality checks like this be done before calling it).
7891 if (ParamTy->isInteger()) {
7892 if (const VectorType *VActTy = dyn_cast<VectorType>(ActTy)) {
7893 if (VActTy->getBitWidth() != ParamTy->getPrimitiveSizeInBits())
7896 if (!ActTy->isInteger() && !ActTy->isFloatingPoint() &&
7897 !isa<PointerType>(ActTy))
7899 } else if (ParamTy->isFloatingPoint()) {
7900 if (const VectorType *VActTy = dyn_cast<VectorType>(ActTy)) {
7901 if (VActTy->getBitWidth() != ParamTy->getPrimitiveSizeInBits())
7904 if (!ActTy->isInteger() && !ActTy->isFloatingPoint())
7906 } else if (const VectorType *VParamTy = dyn_cast<VectorType>(ParamTy)) {
7907 if (const VectorType *VActTy = dyn_cast<VectorType>(ActTy)) {
7908 if (VActTy->getBitWidth() != VParamTy->getBitWidth())
7911 if (VParamTy->getBitWidth() != ActTy->getPrimitiveSizeInBits())
7913 } else if (isa<PointerType>(ParamTy)) {
7914 if (!ActTy->isInteger() && !isa<PointerType>(ActTy))
7921 if (FT->getNumParams() < NumActualArgs && !FT->isVarArg() &&
7922 Callee->isDeclaration())
7923 return false; // Do not delete arguments unless we have a function body...
7925 // Okay, we decided that this is a safe thing to do: go ahead and start
7926 // inserting cast instructions as necessary...
7927 std::vector<Value*> Args;
7928 Args.reserve(NumActualArgs);
7930 AI = CS.arg_begin();
7931 for (unsigned i = 0; i != NumCommonArgs; ++i, ++AI) {
7932 const Type *ParamTy = FT->getParamType(i);
7933 if ((*AI)->getType() == ParamTy) {
7934 Args.push_back(*AI);
7936 Instruction::CastOps opcode = CastInst::getCastOpcode(*AI,
7937 false, ParamTy, false);
7938 CastInst *NewCast = CastInst::create(opcode, *AI, ParamTy, "tmp");
7939 Args.push_back(InsertNewInstBefore(NewCast, *Caller));
7943 // If the function takes more arguments than the call was taking, add them
7945 for (unsigned i = NumCommonArgs; i != FT->getNumParams(); ++i)
7946 Args.push_back(Constant::getNullValue(FT->getParamType(i)));
7948 // If we are removing arguments to the function, emit an obnoxious warning...
7949 if (FT->getNumParams() < NumActualArgs)
7950 if (!FT->isVarArg()) {
7951 cerr << "WARNING: While resolving call to function '"
7952 << Callee->getName() << "' arguments were dropped!\n";
7954 // Add all of the arguments in their promoted form to the arg list...
7955 for (unsigned i = FT->getNumParams(); i != NumActualArgs; ++i, ++AI) {
7956 const Type *PTy = getPromotedType((*AI)->getType());
7957 if (PTy != (*AI)->getType()) {
7958 // Must promote to pass through va_arg area!
7959 Instruction::CastOps opcode = CastInst::getCastOpcode(*AI, false,
7961 Instruction *Cast = CastInst::create(opcode, *AI, PTy, "tmp");
7962 InsertNewInstBefore(Cast, *Caller);
7963 Args.push_back(Cast);
7965 Args.push_back(*AI);
7970 if (FT->getReturnType() == Type::VoidTy)
7971 Caller->setName(""); // Void type should not have a name.
7974 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
7975 NC = new InvokeInst(Callee, II->getNormalDest(), II->getUnwindDest(),
7976 &Args[0], Args.size(), Caller->getName(), Caller);
7977 cast<InvokeInst>(NC)->setCallingConv(II->getCallingConv());
7979 NC = new CallInst(Callee, &Args[0], Args.size(), Caller->getName(), Caller);
7980 if (cast<CallInst>(Caller)->isTailCall())
7981 cast<CallInst>(NC)->setTailCall();
7982 cast<CallInst>(NC)->setCallingConv(cast<CallInst>(Caller)->getCallingConv());
7985 // Insert a cast of the return type as necessary.
7987 if (Caller->getType() != NV->getType() && !Caller->use_empty()) {
7988 if (NV->getType() != Type::VoidTy) {
7989 const Type *CallerTy = Caller->getType();
7990 Instruction::CastOps opcode = CastInst::getCastOpcode(NC, false,
7992 NV = NC = CastInst::create(opcode, NC, CallerTy, "tmp");
7994 // If this is an invoke instruction, we should insert it after the first
7995 // non-phi, instruction in the normal successor block.
7996 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
7997 BasicBlock::iterator I = II->getNormalDest()->begin();
7998 while (isa<PHINode>(I)) ++I;
7999 InsertNewInstBefore(NC, *I);
8001 // Otherwise, it's a call, just insert cast right after the call instr
8002 InsertNewInstBefore(NC, *Caller);
8004 AddUsersToWorkList(*Caller);
8006 NV = UndefValue::get(Caller->getType());
8010 if (Caller->getType() != Type::VoidTy && !Caller->use_empty())
8011 Caller->replaceAllUsesWith(NV);
8012 Caller->eraseFromParent();
8013 RemoveFromWorkList(Caller);
8017 /// FoldPHIArgBinOpIntoPHI - If we have something like phi [add (a,b), add(c,d)]
8018 /// and if a/b/c/d and the add's all have a single use, turn this into two phi's
8019 /// and a single binop.
8020 Instruction *InstCombiner::FoldPHIArgBinOpIntoPHI(PHINode &PN) {
8021 Instruction *FirstInst = cast<Instruction>(PN.getIncomingValue(0));
8022 assert(isa<BinaryOperator>(FirstInst) || isa<GetElementPtrInst>(FirstInst) ||
8023 isa<CmpInst>(FirstInst));
8024 unsigned Opc = FirstInst->getOpcode();
8025 Value *LHSVal = FirstInst->getOperand(0);
8026 Value *RHSVal = FirstInst->getOperand(1);
8028 const Type *LHSType = LHSVal->getType();
8029 const Type *RHSType = RHSVal->getType();
8031 // Scan to see if all operands are the same opcode, all have one use, and all
8032 // kill their operands (i.e. the operands have one use).
8033 for (unsigned i = 0; i != PN.getNumIncomingValues(); ++i) {
8034 Instruction *I = dyn_cast<Instruction>(PN.getIncomingValue(i));
8035 if (!I || I->getOpcode() != Opc || !I->hasOneUse() ||
8036 // Verify type of the LHS matches so we don't fold cmp's of different
8037 // types or GEP's with different index types.
8038 I->getOperand(0)->getType() != LHSType ||
8039 I->getOperand(1)->getType() != RHSType)
8042 // If they are CmpInst instructions, check their predicates
8043 if (Opc == Instruction::ICmp || Opc == Instruction::FCmp)
8044 if (cast<CmpInst>(I)->getPredicate() !=
8045 cast<CmpInst>(FirstInst)->getPredicate())
8048 // Keep track of which operand needs a phi node.
8049 if (I->getOperand(0) != LHSVal) LHSVal = 0;
8050 if (I->getOperand(1) != RHSVal) RHSVal = 0;
8053 // Otherwise, this is safe to transform, determine if it is profitable.
8055 // If this is a GEP, and if the index (not the pointer) needs a PHI, bail out.
8056 // Indexes are often folded into load/store instructions, so we don't want to
8057 // hide them behind a phi.
8058 if (isa<GetElementPtrInst>(FirstInst) && RHSVal == 0)
8061 Value *InLHS = FirstInst->getOperand(0);
8062 Value *InRHS = FirstInst->getOperand(1);
8063 PHINode *NewLHS = 0, *NewRHS = 0;
8065 NewLHS = new PHINode(LHSType, FirstInst->getOperand(0)->getName()+".pn");
8066 NewLHS->reserveOperandSpace(PN.getNumOperands()/2);
8067 NewLHS->addIncoming(InLHS, PN.getIncomingBlock(0));
8068 InsertNewInstBefore(NewLHS, PN);
8073 NewRHS = new PHINode(RHSType, FirstInst->getOperand(1)->getName()+".pn");
8074 NewRHS->reserveOperandSpace(PN.getNumOperands()/2);
8075 NewRHS->addIncoming(InRHS, PN.getIncomingBlock(0));
8076 InsertNewInstBefore(NewRHS, PN);
8080 // Add all operands to the new PHIs.
8081 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
8083 Value *NewInLHS =cast<Instruction>(PN.getIncomingValue(i))->getOperand(0);
8084 NewLHS->addIncoming(NewInLHS, PN.getIncomingBlock(i));
8087 Value *NewInRHS =cast<Instruction>(PN.getIncomingValue(i))->getOperand(1);
8088 NewRHS->addIncoming(NewInRHS, PN.getIncomingBlock(i));
8092 if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(FirstInst))
8093 return BinaryOperator::create(BinOp->getOpcode(), LHSVal, RHSVal);
8094 else if (CmpInst *CIOp = dyn_cast<CmpInst>(FirstInst))
8095 return CmpInst::create(CIOp->getOpcode(), CIOp->getPredicate(), LHSVal,
8098 assert(isa<GetElementPtrInst>(FirstInst));
8099 return new GetElementPtrInst(LHSVal, RHSVal);
8103 /// isSafeToSinkLoad - Return true if we know that it is safe sink the load out
8104 /// of the block that defines it. This means that it must be obvious the value
8105 /// of the load is not changed from the point of the load to the end of the
8108 /// Finally, it is safe, but not profitable, to sink a load targetting a
8109 /// non-address-taken alloca. Doing so will cause us to not promote the alloca
8111 static bool isSafeToSinkLoad(LoadInst *L) {
8112 BasicBlock::iterator BBI = L, E = L->getParent()->end();
8114 for (++BBI; BBI != E; ++BBI)
8115 if (BBI->mayWriteToMemory())
8118 // Check for non-address taken alloca. If not address-taken already, it isn't
8119 // profitable to do this xform.
8120 if (AllocaInst *AI = dyn_cast<AllocaInst>(L->getOperand(0))) {
8121 bool isAddressTaken = false;
8122 for (Value::use_iterator UI = AI->use_begin(), E = AI->use_end();
8124 if (isa<LoadInst>(UI)) continue;
8125 if (StoreInst *SI = dyn_cast<StoreInst>(*UI)) {
8126 // If storing TO the alloca, then the address isn't taken.
8127 if (SI->getOperand(1) == AI) continue;
8129 isAddressTaken = true;
8133 if (!isAddressTaken)
8141 // FoldPHIArgOpIntoPHI - If all operands to a PHI node are the same "unary"
8142 // operator and they all are only used by the PHI, PHI together their
8143 // inputs, and do the operation once, to the result of the PHI.
8144 Instruction *InstCombiner::FoldPHIArgOpIntoPHI(PHINode &PN) {
8145 Instruction *FirstInst = cast<Instruction>(PN.getIncomingValue(0));
8147 // Scan the instruction, looking for input operations that can be folded away.
8148 // If all input operands to the phi are the same instruction (e.g. a cast from
8149 // the same type or "+42") we can pull the operation through the PHI, reducing
8150 // code size and simplifying code.
8151 Constant *ConstantOp = 0;
8152 const Type *CastSrcTy = 0;
8153 bool isVolatile = false;
8154 if (isa<CastInst>(FirstInst)) {
8155 CastSrcTy = FirstInst->getOperand(0)->getType();
8156 } else if (isa<BinaryOperator>(FirstInst) || isa<CmpInst>(FirstInst)) {
8157 // Can fold binop, compare or shift here if the RHS is a constant,
8158 // otherwise call FoldPHIArgBinOpIntoPHI.
8159 ConstantOp = dyn_cast<Constant>(FirstInst->getOperand(1));
8160 if (ConstantOp == 0)
8161 return FoldPHIArgBinOpIntoPHI(PN);
8162 } else if (LoadInst *LI = dyn_cast<LoadInst>(FirstInst)) {
8163 isVolatile = LI->isVolatile();
8164 // We can't sink the load if the loaded value could be modified between the
8165 // load and the PHI.
8166 if (LI->getParent() != PN.getIncomingBlock(0) ||
8167 !isSafeToSinkLoad(LI))
8169 } else if (isa<GetElementPtrInst>(FirstInst)) {
8170 if (FirstInst->getNumOperands() == 2)
8171 return FoldPHIArgBinOpIntoPHI(PN);
8172 // Can't handle general GEPs yet.
8175 return 0; // Cannot fold this operation.
8178 // Check to see if all arguments are the same operation.
8179 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
8180 if (!isa<Instruction>(PN.getIncomingValue(i))) return 0;
8181 Instruction *I = cast<Instruction>(PN.getIncomingValue(i));
8182 if (!I->hasOneUse() || !I->isSameOperationAs(FirstInst))
8185 if (I->getOperand(0)->getType() != CastSrcTy)
8186 return 0; // Cast operation must match.
8187 } else if (LoadInst *LI = dyn_cast<LoadInst>(I)) {
8188 // We can't sink the load if the loaded value could be modified between
8189 // the load and the PHI.
8190 if (LI->isVolatile() != isVolatile ||
8191 LI->getParent() != PN.getIncomingBlock(i) ||
8192 !isSafeToSinkLoad(LI))
8194 } else if (I->getOperand(1) != ConstantOp) {
8199 // Okay, they are all the same operation. Create a new PHI node of the
8200 // correct type, and PHI together all of the LHS's of the instructions.
8201 PHINode *NewPN = new PHINode(FirstInst->getOperand(0)->getType(),
8202 PN.getName()+".in");
8203 NewPN->reserveOperandSpace(PN.getNumOperands()/2);
8205 Value *InVal = FirstInst->getOperand(0);
8206 NewPN->addIncoming(InVal, PN.getIncomingBlock(0));
8208 // Add all operands to the new PHI.
8209 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
8210 Value *NewInVal = cast<Instruction>(PN.getIncomingValue(i))->getOperand(0);
8211 if (NewInVal != InVal)
8213 NewPN->addIncoming(NewInVal, PN.getIncomingBlock(i));
8218 // The new PHI unions all of the same values together. This is really
8219 // common, so we handle it intelligently here for compile-time speed.
8223 InsertNewInstBefore(NewPN, PN);
8227 // Insert and return the new operation.
8228 if (CastInst* FirstCI = dyn_cast<CastInst>(FirstInst))
8229 return CastInst::create(FirstCI->getOpcode(), PhiVal, PN.getType());
8230 else if (isa<LoadInst>(FirstInst))
8231 return new LoadInst(PhiVal, "", isVolatile);
8232 else if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(FirstInst))
8233 return BinaryOperator::create(BinOp->getOpcode(), PhiVal, ConstantOp);
8234 else if (CmpInst *CIOp = dyn_cast<CmpInst>(FirstInst))
8235 return CmpInst::create(CIOp->getOpcode(), CIOp->getPredicate(),
8236 PhiVal, ConstantOp);
8238 assert(0 && "Unknown operation");
8242 /// DeadPHICycle - Return true if this PHI node is only used by a PHI node cycle
8244 static bool DeadPHICycle(PHINode *PN,
8245 SmallPtrSet<PHINode*, 16> &PotentiallyDeadPHIs) {
8246 if (PN->use_empty()) return true;
8247 if (!PN->hasOneUse()) return false;
8249 // Remember this node, and if we find the cycle, return.
8250 if (!PotentiallyDeadPHIs.insert(PN))
8253 if (PHINode *PU = dyn_cast<PHINode>(PN->use_back()))
8254 return DeadPHICycle(PU, PotentiallyDeadPHIs);
8259 // PHINode simplification
8261 Instruction *InstCombiner::visitPHINode(PHINode &PN) {
8262 // If LCSSA is around, don't mess with Phi nodes
8263 if (MustPreserveLCSSA) return 0;
8265 if (Value *V = PN.hasConstantValue())
8266 return ReplaceInstUsesWith(PN, V);
8268 // If all PHI operands are the same operation, pull them through the PHI,
8269 // reducing code size.
8270 if (isa<Instruction>(PN.getIncomingValue(0)) &&
8271 PN.getIncomingValue(0)->hasOneUse())
8272 if (Instruction *Result = FoldPHIArgOpIntoPHI(PN))
8275 // If this is a trivial cycle in the PHI node graph, remove it. Basically, if
8276 // this PHI only has a single use (a PHI), and if that PHI only has one use (a
8277 // PHI)... break the cycle.
8278 if (PN.hasOneUse()) {
8279 Instruction *PHIUser = cast<Instruction>(PN.use_back());
8280 if (PHINode *PU = dyn_cast<PHINode>(PHIUser)) {
8281 SmallPtrSet<PHINode*, 16> PotentiallyDeadPHIs;
8282 PotentiallyDeadPHIs.insert(&PN);
8283 if (DeadPHICycle(PU, PotentiallyDeadPHIs))
8284 return ReplaceInstUsesWith(PN, UndefValue::get(PN.getType()));
8287 // If this phi has a single use, and if that use just computes a value for
8288 // the next iteration of a loop, delete the phi. This occurs with unused
8289 // induction variables, e.g. "for (int j = 0; ; ++j);". Detecting this
8290 // common case here is good because the only other things that catch this
8291 // are induction variable analysis (sometimes) and ADCE, which is only run
8293 if (PHIUser->hasOneUse() &&
8294 (isa<BinaryOperator>(PHIUser) || isa<GetElementPtrInst>(PHIUser)) &&
8295 PHIUser->use_back() == &PN) {
8296 return ReplaceInstUsesWith(PN, UndefValue::get(PN.getType()));
8303 static Value *InsertCastToIntPtrTy(Value *V, const Type *DTy,
8304 Instruction *InsertPoint,
8306 unsigned PtrSize = DTy->getPrimitiveSizeInBits();
8307 unsigned VTySize = V->getType()->getPrimitiveSizeInBits();
8308 // We must cast correctly to the pointer type. Ensure that we
8309 // sign extend the integer value if it is smaller as this is
8310 // used for address computation.
8311 Instruction::CastOps opcode =
8312 (VTySize < PtrSize ? Instruction::SExt :
8313 (VTySize == PtrSize ? Instruction::BitCast : Instruction::Trunc));
8314 return IC->InsertCastBefore(opcode, V, DTy, *InsertPoint);
8318 Instruction *InstCombiner::visitGetElementPtrInst(GetElementPtrInst &GEP) {
8319 Value *PtrOp = GEP.getOperand(0);
8320 // Is it 'getelementptr %P, i32 0' or 'getelementptr %P'
8321 // If so, eliminate the noop.
8322 if (GEP.getNumOperands() == 1)
8323 return ReplaceInstUsesWith(GEP, PtrOp);
8325 if (isa<UndefValue>(GEP.getOperand(0)))
8326 return ReplaceInstUsesWith(GEP, UndefValue::get(GEP.getType()));
8328 bool HasZeroPointerIndex = false;
8329 if (Constant *C = dyn_cast<Constant>(GEP.getOperand(1)))
8330 HasZeroPointerIndex = C->isNullValue();
8332 if (GEP.getNumOperands() == 2 && HasZeroPointerIndex)
8333 return ReplaceInstUsesWith(GEP, PtrOp);
8335 // Eliminate unneeded casts for indices.
8336 bool MadeChange = false;
8338 gep_type_iterator GTI = gep_type_begin(GEP);
8339 for (unsigned i = 1, e = GEP.getNumOperands(); i != e; ++i, ++GTI) {
8340 if (isa<SequentialType>(*GTI)) {
8341 if (CastInst *CI = dyn_cast<CastInst>(GEP.getOperand(i))) {
8342 if (CI->getOpcode() == Instruction::ZExt ||
8343 CI->getOpcode() == Instruction::SExt) {
8344 const Type *SrcTy = CI->getOperand(0)->getType();
8345 // We can eliminate a cast from i32 to i64 iff the target
8346 // is a 32-bit pointer target.
8347 if (SrcTy->getPrimitiveSizeInBits() >= TD->getPointerSizeInBits()) {
8349 GEP.setOperand(i, CI->getOperand(0));
8353 // If we are using a wider index than needed for this platform, shrink it
8354 // to what we need. If the incoming value needs a cast instruction,
8355 // insert it. This explicit cast can make subsequent optimizations more
8357 Value *Op = GEP.getOperand(i);
8358 if (TD->getTypeSize(Op->getType()) > TD->getPointerSize())
8359 if (Constant *C = dyn_cast<Constant>(Op)) {
8360 GEP.setOperand(i, ConstantExpr::getTrunc(C, TD->getIntPtrType()));
8363 Op = InsertCastBefore(Instruction::Trunc, Op, TD->getIntPtrType(),
8365 GEP.setOperand(i, Op);
8370 if (MadeChange) return &GEP;
8372 // If this GEP instruction doesn't move the pointer, and if the input operand
8373 // is a bitcast of another pointer, just replace the GEP with a bitcast of the
8374 // real input to the dest type.
8375 if (GEP.hasAllZeroIndices() && isa<BitCastInst>(GEP.getOperand(0)))
8376 return new BitCastInst(cast<BitCastInst>(GEP.getOperand(0))->getOperand(0),
8379 // Combine Indices - If the source pointer to this getelementptr instruction
8380 // is a getelementptr instruction, combine the indices of the two
8381 // getelementptr instructions into a single instruction.
8383 SmallVector<Value*, 8> SrcGEPOperands;
8384 if (User *Src = dyn_castGetElementPtr(PtrOp))
8385 SrcGEPOperands.append(Src->op_begin(), Src->op_end());
8387 if (!SrcGEPOperands.empty()) {
8388 // Note that if our source is a gep chain itself that we wait for that
8389 // chain to be resolved before we perform this transformation. This
8390 // avoids us creating a TON of code in some cases.
8392 if (isa<GetElementPtrInst>(SrcGEPOperands[0]) &&
8393 cast<Instruction>(SrcGEPOperands[0])->getNumOperands() == 2)
8394 return 0; // Wait until our source is folded to completion.
8396 SmallVector<Value*, 8> Indices;
8398 // Find out whether the last index in the source GEP is a sequential idx.
8399 bool EndsWithSequential = false;
8400 for (gep_type_iterator I = gep_type_begin(*cast<User>(PtrOp)),
8401 E = gep_type_end(*cast<User>(PtrOp)); I != E; ++I)
8402 EndsWithSequential = !isa<StructType>(*I);
8404 // Can we combine the two pointer arithmetics offsets?
8405 if (EndsWithSequential) {
8406 // Replace: gep (gep %P, long B), long A, ...
8407 // With: T = long A+B; gep %P, T, ...
8409 Value *Sum, *SO1 = SrcGEPOperands.back(), *GO1 = GEP.getOperand(1);
8410 if (SO1 == Constant::getNullValue(SO1->getType())) {
8412 } else if (GO1 == Constant::getNullValue(GO1->getType())) {
8415 // If they aren't the same type, convert both to an integer of the
8416 // target's pointer size.
8417 if (SO1->getType() != GO1->getType()) {
8418 if (Constant *SO1C = dyn_cast<Constant>(SO1)) {
8419 SO1 = ConstantExpr::getIntegerCast(SO1C, GO1->getType(), true);
8420 } else if (Constant *GO1C = dyn_cast<Constant>(GO1)) {
8421 GO1 = ConstantExpr::getIntegerCast(GO1C, SO1->getType(), true);
8423 unsigned PS = TD->getPointerSize();
8424 if (TD->getTypeSize(SO1->getType()) == PS) {
8425 // Convert GO1 to SO1's type.
8426 GO1 = InsertCastToIntPtrTy(GO1, SO1->getType(), &GEP, this);
8428 } else if (TD->getTypeSize(GO1->getType()) == PS) {
8429 // Convert SO1 to GO1's type.
8430 SO1 = InsertCastToIntPtrTy(SO1, GO1->getType(), &GEP, this);
8432 const Type *PT = TD->getIntPtrType();
8433 SO1 = InsertCastToIntPtrTy(SO1, PT, &GEP, this);
8434 GO1 = InsertCastToIntPtrTy(GO1, PT, &GEP, this);
8438 if (isa<Constant>(SO1) && isa<Constant>(GO1))
8439 Sum = ConstantExpr::getAdd(cast<Constant>(SO1), cast<Constant>(GO1));
8441 Sum = BinaryOperator::createAdd(SO1, GO1, PtrOp->getName()+".sum");
8442 InsertNewInstBefore(cast<Instruction>(Sum), GEP);
8446 // Recycle the GEP we already have if possible.
8447 if (SrcGEPOperands.size() == 2) {
8448 GEP.setOperand(0, SrcGEPOperands[0]);
8449 GEP.setOperand(1, Sum);
8452 Indices.insert(Indices.end(), SrcGEPOperands.begin()+1,
8453 SrcGEPOperands.end()-1);
8454 Indices.push_back(Sum);
8455 Indices.insert(Indices.end(), GEP.op_begin()+2, GEP.op_end());
8457 } else if (isa<Constant>(*GEP.idx_begin()) &&
8458 cast<Constant>(*GEP.idx_begin())->isNullValue() &&
8459 SrcGEPOperands.size() != 1) {
8460 // Otherwise we can do the fold if the first index of the GEP is a zero
8461 Indices.insert(Indices.end(), SrcGEPOperands.begin()+1,
8462 SrcGEPOperands.end());
8463 Indices.insert(Indices.end(), GEP.idx_begin()+1, GEP.idx_end());
8466 if (!Indices.empty())
8467 return new GetElementPtrInst(SrcGEPOperands[0], &Indices[0],
8468 Indices.size(), GEP.getName());
8470 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(PtrOp)) {
8471 // GEP of global variable. If all of the indices for this GEP are
8472 // constants, we can promote this to a constexpr instead of an instruction.
8474 // Scan for nonconstants...
8475 SmallVector<Constant*, 8> Indices;
8476 User::op_iterator I = GEP.idx_begin(), E = GEP.idx_end();
8477 for (; I != E && isa<Constant>(*I); ++I)
8478 Indices.push_back(cast<Constant>(*I));
8480 if (I == E) { // If they are all constants...
8481 Constant *CE = ConstantExpr::getGetElementPtr(GV,
8482 &Indices[0],Indices.size());
8484 // Replace all uses of the GEP with the new constexpr...
8485 return ReplaceInstUsesWith(GEP, CE);
8487 } else if (Value *X = getBitCastOperand(PtrOp)) { // Is the operand a cast?
8488 if (!isa<PointerType>(X->getType())) {
8489 // Not interesting. Source pointer must be a cast from pointer.
8490 } else if (HasZeroPointerIndex) {
8491 // transform: GEP (cast [10 x ubyte]* X to [0 x ubyte]*), long 0, ...
8492 // into : GEP [10 x ubyte]* X, long 0, ...
8494 // This occurs when the program declares an array extern like "int X[];"
8496 const PointerType *CPTy = cast<PointerType>(PtrOp->getType());
8497 const PointerType *XTy = cast<PointerType>(X->getType());
8498 if (const ArrayType *XATy =
8499 dyn_cast<ArrayType>(XTy->getElementType()))
8500 if (const ArrayType *CATy =
8501 dyn_cast<ArrayType>(CPTy->getElementType()))
8502 if (CATy->getElementType() == XATy->getElementType()) {
8503 // At this point, we know that the cast source type is a pointer
8504 // to an array of the same type as the destination pointer
8505 // array. Because the array type is never stepped over (there
8506 // is a leading zero) we can fold the cast into this GEP.
8507 GEP.setOperand(0, X);
8510 } else if (GEP.getNumOperands() == 2) {
8511 // Transform things like:
8512 // %t = getelementptr ubyte* cast ([2 x int]* %str to uint*), uint %V
8513 // into: %t1 = getelementptr [2 x int*]* %str, int 0, uint %V; cast
8514 const Type *SrcElTy = cast<PointerType>(X->getType())->getElementType();
8515 const Type *ResElTy=cast<PointerType>(PtrOp->getType())->getElementType();
8516 if (isa<ArrayType>(SrcElTy) &&
8517 TD->getTypeSize(cast<ArrayType>(SrcElTy)->getElementType()) ==
8518 TD->getTypeSize(ResElTy)) {
8519 Value *V = InsertNewInstBefore(
8520 new GetElementPtrInst(X, Constant::getNullValue(Type::Int32Ty),
8521 GEP.getOperand(1), GEP.getName()), GEP);
8522 // V and GEP are both pointer types --> BitCast
8523 return new BitCastInst(V, GEP.getType());
8526 // Transform things like:
8527 // getelementptr sbyte* cast ([100 x double]* X to sbyte*), int %tmp
8528 // (where tmp = 8*tmp2) into:
8529 // getelementptr [100 x double]* %arr, int 0, int %tmp.2
8531 if (isa<ArrayType>(SrcElTy) &&
8532 (ResElTy == Type::Int8Ty || ResElTy == Type::Int8Ty)) {
8533 uint64_t ArrayEltSize =
8534 TD->getTypeSize(cast<ArrayType>(SrcElTy)->getElementType());
8536 // Check to see if "tmp" is a scale by a multiple of ArrayEltSize. We
8537 // allow either a mul, shift, or constant here.
8539 ConstantInt *Scale = 0;
8540 if (ArrayEltSize == 1) {
8541 NewIdx = GEP.getOperand(1);
8542 Scale = ConstantInt::get(NewIdx->getType(), 1);
8543 } else if (ConstantInt *CI = dyn_cast<ConstantInt>(GEP.getOperand(1))) {
8544 NewIdx = ConstantInt::get(CI->getType(), 1);
8546 } else if (Instruction *Inst =dyn_cast<Instruction>(GEP.getOperand(1))){
8547 if (Inst->getOpcode() == Instruction::Shl &&
8548 isa<ConstantInt>(Inst->getOperand(1))) {
8549 ConstantInt *ShAmt = cast<ConstantInt>(Inst->getOperand(1));
8550 uint32_t ShAmtVal = ShAmt->getLimitedValue(64);
8551 Scale = ConstantInt::get(Inst->getType(), 1ULL << ShAmtVal);
8552 NewIdx = Inst->getOperand(0);
8553 } else if (Inst->getOpcode() == Instruction::Mul &&
8554 isa<ConstantInt>(Inst->getOperand(1))) {
8555 Scale = cast<ConstantInt>(Inst->getOperand(1));
8556 NewIdx = Inst->getOperand(0);
8560 // If the index will be to exactly the right offset with the scale taken
8561 // out, perform the transformation.
8562 if (Scale && Scale->getZExtValue() % ArrayEltSize == 0) {
8563 if (isa<ConstantInt>(Scale))
8564 Scale = ConstantInt::get(Scale->getType(),
8565 Scale->getZExtValue() / ArrayEltSize);
8566 if (Scale->getZExtValue() != 1) {
8567 Constant *C = ConstantExpr::getIntegerCast(Scale, NewIdx->getType(),
8569 Instruction *Sc = BinaryOperator::createMul(NewIdx, C, "idxscale");
8570 NewIdx = InsertNewInstBefore(Sc, GEP);
8573 // Insert the new GEP instruction.
8574 Instruction *NewGEP =
8575 new GetElementPtrInst(X, Constant::getNullValue(Type::Int32Ty),
8576 NewIdx, GEP.getName());
8577 NewGEP = InsertNewInstBefore(NewGEP, GEP);
8578 // The NewGEP must be pointer typed, so must the old one -> BitCast
8579 return new BitCastInst(NewGEP, GEP.getType());
8588 Instruction *InstCombiner::visitAllocationInst(AllocationInst &AI) {
8589 // Convert: malloc Ty, C - where C is a constant != 1 into: malloc [C x Ty], 1
8590 if (AI.isArrayAllocation()) // Check C != 1
8591 if (const ConstantInt *C = dyn_cast<ConstantInt>(AI.getArraySize())) {
8593 ArrayType::get(AI.getAllocatedType(), C->getZExtValue());
8594 AllocationInst *New = 0;
8596 // Create and insert the replacement instruction...
8597 if (isa<MallocInst>(AI))
8598 New = new MallocInst(NewTy, 0, AI.getAlignment(), AI.getName());
8600 assert(isa<AllocaInst>(AI) && "Unknown type of allocation inst!");
8601 New = new AllocaInst(NewTy, 0, AI.getAlignment(), AI.getName());
8604 InsertNewInstBefore(New, AI);
8606 // Scan to the end of the allocation instructions, to skip over a block of
8607 // allocas if possible...
8609 BasicBlock::iterator It = New;
8610 while (isa<AllocationInst>(*It)) ++It;
8612 // Now that I is pointing to the first non-allocation-inst in the block,
8613 // insert our getelementptr instruction...
8615 Value *NullIdx = Constant::getNullValue(Type::Int32Ty);
8616 Value *V = new GetElementPtrInst(New, NullIdx, NullIdx,
8617 New->getName()+".sub", It);
8619 // Now make everything use the getelementptr instead of the original
8621 return ReplaceInstUsesWith(AI, V);
8622 } else if (isa<UndefValue>(AI.getArraySize())) {
8623 return ReplaceInstUsesWith(AI, Constant::getNullValue(AI.getType()));
8626 // If alloca'ing a zero byte object, replace the alloca with a null pointer.
8627 // Note that we only do this for alloca's, because malloc should allocate and
8628 // return a unique pointer, even for a zero byte allocation.
8629 if (isa<AllocaInst>(AI) && AI.getAllocatedType()->isSized() &&
8630 TD->getTypeSize(AI.getAllocatedType()) == 0)
8631 return ReplaceInstUsesWith(AI, Constant::getNullValue(AI.getType()));
8636 Instruction *InstCombiner::visitFreeInst(FreeInst &FI) {
8637 Value *Op = FI.getOperand(0);
8639 // free undef -> unreachable.
8640 if (isa<UndefValue>(Op)) {
8641 // Insert a new store to null because we cannot modify the CFG here.
8642 new StoreInst(ConstantInt::getTrue(),
8643 UndefValue::get(PointerType::get(Type::Int1Ty)), &FI);
8644 return EraseInstFromFunction(FI);
8647 // If we have 'free null' delete the instruction. This can happen in stl code
8648 // when lots of inlining happens.
8649 if (isa<ConstantPointerNull>(Op))
8650 return EraseInstFromFunction(FI);
8652 // Change free <ty>* (cast <ty2>* X to <ty>*) into free <ty2>* X
8653 if (BitCastInst *CI = dyn_cast<BitCastInst>(Op)) {
8654 FI.setOperand(0, CI->getOperand(0));
8658 // Change free (gep X, 0,0,0,0) into free(X)
8659 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(Op)) {
8660 if (GEPI->hasAllZeroIndices()) {
8661 AddToWorkList(GEPI);
8662 FI.setOperand(0, GEPI->getOperand(0));
8667 // Change free(malloc) into nothing, if the malloc has a single use.
8668 if (MallocInst *MI = dyn_cast<MallocInst>(Op))
8669 if (MI->hasOneUse()) {
8670 EraseInstFromFunction(FI);
8671 return EraseInstFromFunction(*MI);
8678 /// InstCombineLoadCast - Fold 'load (cast P)' -> cast (load P)' when possible.
8679 static Instruction *InstCombineLoadCast(InstCombiner &IC, LoadInst &LI) {
8680 User *CI = cast<User>(LI.getOperand(0));
8681 Value *CastOp = CI->getOperand(0);
8683 const Type *DestPTy = cast<PointerType>(CI->getType())->getElementType();
8684 if (const PointerType *SrcTy = dyn_cast<PointerType>(CastOp->getType())) {
8685 const Type *SrcPTy = SrcTy->getElementType();
8687 if (DestPTy->isInteger() || isa<PointerType>(DestPTy) ||
8688 isa<VectorType>(DestPTy)) {
8689 // If the source is an array, the code below will not succeed. Check to
8690 // see if a trivial 'gep P, 0, 0' will help matters. Only do this for
8692 if (const ArrayType *ASrcTy = dyn_cast<ArrayType>(SrcPTy))
8693 if (Constant *CSrc = dyn_cast<Constant>(CastOp))
8694 if (ASrcTy->getNumElements() != 0) {
8696 Idxs[0] = Idxs[1] = Constant::getNullValue(Type::Int32Ty);
8697 CastOp = ConstantExpr::getGetElementPtr(CSrc, Idxs, 2);
8698 SrcTy = cast<PointerType>(CastOp->getType());
8699 SrcPTy = SrcTy->getElementType();
8702 if ((SrcPTy->isInteger() || isa<PointerType>(SrcPTy) ||
8703 isa<VectorType>(SrcPTy)) &&
8704 // Do not allow turning this into a load of an integer, which is then
8705 // casted to a pointer, this pessimizes pointer analysis a lot.
8706 (isa<PointerType>(SrcPTy) == isa<PointerType>(LI.getType())) &&
8707 IC.getTargetData().getTypeSizeInBits(SrcPTy) ==
8708 IC.getTargetData().getTypeSizeInBits(DestPTy)) {
8710 // Okay, we are casting from one integer or pointer type to another of
8711 // the same size. Instead of casting the pointer before the load, cast
8712 // the result of the loaded value.
8713 Value *NewLoad = IC.InsertNewInstBefore(new LoadInst(CastOp,
8715 LI.isVolatile()),LI);
8716 // Now cast the result of the load.
8717 return new BitCastInst(NewLoad, LI.getType());
8724 /// isSafeToLoadUnconditionally - Return true if we know that executing a load
8725 /// from this value cannot trap. If it is not obviously safe to load from the
8726 /// specified pointer, we do a quick local scan of the basic block containing
8727 /// ScanFrom, to determine if the address is already accessed.
8728 static bool isSafeToLoadUnconditionally(Value *V, Instruction *ScanFrom) {
8729 // If it is an alloca or global variable, it is always safe to load from.
8730 if (isa<AllocaInst>(V) || isa<GlobalVariable>(V)) return true;
8732 // Otherwise, be a little bit agressive by scanning the local block where we
8733 // want to check to see if the pointer is already being loaded or stored
8734 // from/to. If so, the previous load or store would have already trapped,
8735 // so there is no harm doing an extra load (also, CSE will later eliminate
8736 // the load entirely).
8737 BasicBlock::iterator BBI = ScanFrom, E = ScanFrom->getParent()->begin();
8742 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) {
8743 if (LI->getOperand(0) == V) return true;
8744 } else if (StoreInst *SI = dyn_cast<StoreInst>(BBI))
8745 if (SI->getOperand(1) == V) return true;
8751 Instruction *InstCombiner::visitLoadInst(LoadInst &LI) {
8752 Value *Op = LI.getOperand(0);
8754 // Attempt to improve the alignment.
8755 unsigned KnownAlign = GetKnownAlignment(Op, TD);
8756 if (KnownAlign > LI.getAlignment())
8757 LI.setAlignment(KnownAlign);
8759 // load (cast X) --> cast (load X) iff safe
8760 if (isa<CastInst>(Op))
8761 if (Instruction *Res = InstCombineLoadCast(*this, LI))
8764 // None of the following transforms are legal for volatile loads.
8765 if (LI.isVolatile()) return 0;
8767 if (&LI.getParent()->front() != &LI) {
8768 BasicBlock::iterator BBI = &LI; --BBI;
8769 // If the instruction immediately before this is a store to the same
8770 // address, do a simple form of store->load forwarding.
8771 if (StoreInst *SI = dyn_cast<StoreInst>(BBI))
8772 if (SI->getOperand(1) == LI.getOperand(0))
8773 return ReplaceInstUsesWith(LI, SI->getOperand(0));
8774 if (LoadInst *LIB = dyn_cast<LoadInst>(BBI))
8775 if (LIB->getOperand(0) == LI.getOperand(0))
8776 return ReplaceInstUsesWith(LI, LIB);
8779 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(Op))
8780 if (isa<ConstantPointerNull>(GEPI->getOperand(0))) {
8781 // Insert a new store to null instruction before the load to indicate
8782 // that this code is not reachable. We do this instead of inserting
8783 // an unreachable instruction directly because we cannot modify the
8785 new StoreInst(UndefValue::get(LI.getType()),
8786 Constant::getNullValue(Op->getType()), &LI);
8787 return ReplaceInstUsesWith(LI, UndefValue::get(LI.getType()));
8790 if (Constant *C = dyn_cast<Constant>(Op)) {
8791 // load null/undef -> undef
8792 if ((C->isNullValue() || isa<UndefValue>(C))) {
8793 // Insert a new store to null instruction before the load to indicate that
8794 // this code is not reachable. We do this instead of inserting an
8795 // unreachable instruction directly because we cannot modify the CFG.
8796 new StoreInst(UndefValue::get(LI.getType()),
8797 Constant::getNullValue(Op->getType()), &LI);
8798 return ReplaceInstUsesWith(LI, UndefValue::get(LI.getType()));
8801 // Instcombine load (constant global) into the value loaded.
8802 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(Op))
8803 if (GV->isConstant() && !GV->isDeclaration())
8804 return ReplaceInstUsesWith(LI, GV->getInitializer());
8806 // Instcombine load (constantexpr_GEP global, 0, ...) into the value loaded.
8807 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Op))
8808 if (CE->getOpcode() == Instruction::GetElementPtr) {
8809 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(CE->getOperand(0)))
8810 if (GV->isConstant() && !GV->isDeclaration())
8812 ConstantFoldLoadThroughGEPConstantExpr(GV->getInitializer(), CE))
8813 return ReplaceInstUsesWith(LI, V);
8814 if (CE->getOperand(0)->isNullValue()) {
8815 // Insert a new store to null instruction before the load to indicate
8816 // that this code is not reachable. We do this instead of inserting
8817 // an unreachable instruction directly because we cannot modify the
8819 new StoreInst(UndefValue::get(LI.getType()),
8820 Constant::getNullValue(Op->getType()), &LI);
8821 return ReplaceInstUsesWith(LI, UndefValue::get(LI.getType()));
8824 } else if (CE->isCast()) {
8825 if (Instruction *Res = InstCombineLoadCast(*this, LI))
8830 if (Op->hasOneUse()) {
8831 // Change select and PHI nodes to select values instead of addresses: this
8832 // helps alias analysis out a lot, allows many others simplifications, and
8833 // exposes redundancy in the code.
8835 // Note that we cannot do the transformation unless we know that the
8836 // introduced loads cannot trap! Something like this is valid as long as
8837 // the condition is always false: load (select bool %C, int* null, int* %G),
8838 // but it would not be valid if we transformed it to load from null
8841 if (SelectInst *SI = dyn_cast<SelectInst>(Op)) {
8842 // load (select (Cond, &V1, &V2)) --> select(Cond, load &V1, load &V2).
8843 if (isSafeToLoadUnconditionally(SI->getOperand(1), SI) &&
8844 isSafeToLoadUnconditionally(SI->getOperand(2), SI)) {
8845 Value *V1 = InsertNewInstBefore(new LoadInst(SI->getOperand(1),
8846 SI->getOperand(1)->getName()+".val"), LI);
8847 Value *V2 = InsertNewInstBefore(new LoadInst(SI->getOperand(2),
8848 SI->getOperand(2)->getName()+".val"), LI);
8849 return new SelectInst(SI->getCondition(), V1, V2);
8852 // load (select (cond, null, P)) -> load P
8853 if (Constant *C = dyn_cast<Constant>(SI->getOperand(1)))
8854 if (C->isNullValue()) {
8855 LI.setOperand(0, SI->getOperand(2));
8859 // load (select (cond, P, null)) -> load P
8860 if (Constant *C = dyn_cast<Constant>(SI->getOperand(2)))
8861 if (C->isNullValue()) {
8862 LI.setOperand(0, SI->getOperand(1));
8870 /// InstCombineStoreToCast - Fold store V, (cast P) -> store (cast V), P
8872 static Instruction *InstCombineStoreToCast(InstCombiner &IC, StoreInst &SI) {
8873 User *CI = cast<User>(SI.getOperand(1));
8874 Value *CastOp = CI->getOperand(0);
8876 const Type *DestPTy = cast<PointerType>(CI->getType())->getElementType();
8877 if (const PointerType *SrcTy = dyn_cast<PointerType>(CastOp->getType())) {
8878 const Type *SrcPTy = SrcTy->getElementType();
8880 if (DestPTy->isInteger() || isa<PointerType>(DestPTy)) {
8881 // If the source is an array, the code below will not succeed. Check to
8882 // see if a trivial 'gep P, 0, 0' will help matters. Only do this for
8884 if (const ArrayType *ASrcTy = dyn_cast<ArrayType>(SrcPTy))
8885 if (Constant *CSrc = dyn_cast<Constant>(CastOp))
8886 if (ASrcTy->getNumElements() != 0) {
8888 Idxs[0] = Idxs[1] = Constant::getNullValue(Type::Int32Ty);
8889 CastOp = ConstantExpr::getGetElementPtr(CSrc, Idxs, 2);
8890 SrcTy = cast<PointerType>(CastOp->getType());
8891 SrcPTy = SrcTy->getElementType();
8894 if ((SrcPTy->isInteger() || isa<PointerType>(SrcPTy)) &&
8895 IC.getTargetData().getTypeSizeInBits(SrcPTy) ==
8896 IC.getTargetData().getTypeSizeInBits(DestPTy)) {
8898 // Okay, we are casting from one integer or pointer type to another of
8899 // the same size. Instead of casting the pointer before
8900 // the store, cast the value to be stored.
8902 Value *SIOp0 = SI.getOperand(0);
8903 Instruction::CastOps opcode = Instruction::BitCast;
8904 const Type* CastSrcTy = SIOp0->getType();
8905 const Type* CastDstTy = SrcPTy;
8906 if (isa<PointerType>(CastDstTy)) {
8907 if (CastSrcTy->isInteger())
8908 opcode = Instruction::IntToPtr;
8909 } else if (isa<IntegerType>(CastDstTy)) {
8910 if (isa<PointerType>(SIOp0->getType()))
8911 opcode = Instruction::PtrToInt;
8913 if (Constant *C = dyn_cast<Constant>(SIOp0))
8914 NewCast = ConstantExpr::getCast(opcode, C, CastDstTy);
8916 NewCast = IC.InsertNewInstBefore(
8917 CastInst::create(opcode, SIOp0, CastDstTy, SIOp0->getName()+".c"),
8919 return new StoreInst(NewCast, CastOp);
8926 Instruction *InstCombiner::visitStoreInst(StoreInst &SI) {
8927 Value *Val = SI.getOperand(0);
8928 Value *Ptr = SI.getOperand(1);
8930 if (isa<UndefValue>(Ptr)) { // store X, undef -> noop (even if volatile)
8931 EraseInstFromFunction(SI);
8936 // If the RHS is an alloca with a single use, zapify the store, making the
8938 if (Ptr->hasOneUse()) {
8939 if (isa<AllocaInst>(Ptr)) {
8940 EraseInstFromFunction(SI);
8945 if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Ptr))
8946 if (isa<AllocaInst>(GEP->getOperand(0)) &&
8947 GEP->getOperand(0)->hasOneUse()) {
8948 EraseInstFromFunction(SI);
8954 // Attempt to improve the alignment.
8955 unsigned KnownAlign = GetKnownAlignment(Ptr, TD);
8956 if (KnownAlign > SI.getAlignment())
8957 SI.setAlignment(KnownAlign);
8959 // Do really simple DSE, to catch cases where there are several consequtive
8960 // stores to the same location, separated by a few arithmetic operations. This
8961 // situation often occurs with bitfield accesses.
8962 BasicBlock::iterator BBI = &SI;
8963 for (unsigned ScanInsts = 6; BBI != SI.getParent()->begin() && ScanInsts;
8967 if (StoreInst *PrevSI = dyn_cast<StoreInst>(BBI)) {
8968 // Prev store isn't volatile, and stores to the same location?
8969 if (!PrevSI->isVolatile() && PrevSI->getOperand(1) == SI.getOperand(1)) {
8972 EraseInstFromFunction(*PrevSI);
8978 // If this is a load, we have to stop. However, if the loaded value is from
8979 // the pointer we're loading and is producing the pointer we're storing,
8980 // then *this* store is dead (X = load P; store X -> P).
8981 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) {
8982 if (LI == Val && LI->getOperand(0) == Ptr) {
8983 EraseInstFromFunction(SI);
8987 // Otherwise, this is a load from some other location. Stores before it
8992 // Don't skip over loads or things that can modify memory.
8993 if (BBI->mayWriteToMemory())
8998 if (SI.isVolatile()) return 0; // Don't hack volatile stores.
9000 // store X, null -> turns into 'unreachable' in SimplifyCFG
9001 if (isa<ConstantPointerNull>(Ptr)) {
9002 if (!isa<UndefValue>(Val)) {
9003 SI.setOperand(0, UndefValue::get(Val->getType()));
9004 if (Instruction *U = dyn_cast<Instruction>(Val))
9005 AddToWorkList(U); // Dropped a use.
9008 return 0; // Do not modify these!
9011 // store undef, Ptr -> noop
9012 if (isa<UndefValue>(Val)) {
9013 EraseInstFromFunction(SI);
9018 // If the pointer destination is a cast, see if we can fold the cast into the
9020 if (isa<CastInst>(Ptr))
9021 if (Instruction *Res = InstCombineStoreToCast(*this, SI))
9023 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Ptr))
9025 if (Instruction *Res = InstCombineStoreToCast(*this, SI))
9029 // If this store is the last instruction in the basic block, and if the block
9030 // ends with an unconditional branch, try to move it to the successor block.
9032 if (BranchInst *BI = dyn_cast<BranchInst>(BBI))
9033 if (BI->isUnconditional())
9034 if (SimplifyStoreAtEndOfBlock(SI))
9035 return 0; // xform done!
9040 /// SimplifyStoreAtEndOfBlock - Turn things like:
9041 /// if () { *P = v1; } else { *P = v2 }
9042 /// into a phi node with a store in the successor.
9044 /// Simplify things like:
9045 /// *P = v1; if () { *P = v2; }
9046 /// into a phi node with a store in the successor.
9048 bool InstCombiner::SimplifyStoreAtEndOfBlock(StoreInst &SI) {
9049 BasicBlock *StoreBB = SI.getParent();
9051 // Check to see if the successor block has exactly two incoming edges. If
9052 // so, see if the other predecessor contains a store to the same location.
9053 // if so, insert a PHI node (if needed) and move the stores down.
9054 BasicBlock *DestBB = StoreBB->getTerminator()->getSuccessor(0);
9056 // Determine whether Dest has exactly two predecessors and, if so, compute
9057 // the other predecessor.
9058 pred_iterator PI = pred_begin(DestBB);
9059 BasicBlock *OtherBB = 0;
9063 if (PI == pred_end(DestBB))
9066 if (*PI != StoreBB) {
9071 if (++PI != pred_end(DestBB))
9075 // Verify that the other block ends in a branch and is not otherwise empty.
9076 BasicBlock::iterator BBI = OtherBB->getTerminator();
9077 BranchInst *OtherBr = dyn_cast<BranchInst>(BBI);
9078 if (!OtherBr || BBI == OtherBB->begin())
9081 // If the other block ends in an unconditional branch, check for the 'if then
9082 // else' case. there is an instruction before the branch.
9083 StoreInst *OtherStore = 0;
9084 if (OtherBr->isUnconditional()) {
9085 // If this isn't a store, or isn't a store to the same location, bail out.
9087 OtherStore = dyn_cast<StoreInst>(BBI);
9088 if (!OtherStore || OtherStore->getOperand(1) != SI.getOperand(1))
9091 // Otherwise, the other block ended with a conditional branch. If one of the
9092 // destinations is StoreBB, then we have the if/then case.
9093 if (OtherBr->getSuccessor(0) != StoreBB &&
9094 OtherBr->getSuccessor(1) != StoreBB)
9097 // Okay, we know that OtherBr now goes to Dest and StoreBB, so this is an
9098 // if/then triangle. See if there is a store to the same ptr as SI that
9099 // lives in OtherBB.
9101 // Check to see if we find the matching store.
9102 if ((OtherStore = dyn_cast<StoreInst>(BBI))) {
9103 if (OtherStore->getOperand(1) != SI.getOperand(1))
9107 // If we find something that may be using the stored value, or if we run
9108 // out of instructions, we can't do the xform.
9109 if (isa<LoadInst>(BBI) || BBI->mayWriteToMemory() ||
9110 BBI == OtherBB->begin())
9114 // In order to eliminate the store in OtherBr, we have to
9115 // make sure nothing reads the stored value in StoreBB.
9116 for (BasicBlock::iterator I = StoreBB->begin(); &*I != &SI; ++I) {
9117 // FIXME: This should really be AA driven.
9118 if (isa<LoadInst>(I) || I->mayWriteToMemory())
9123 // Insert a PHI node now if we need it.
9124 Value *MergedVal = OtherStore->getOperand(0);
9125 if (MergedVal != SI.getOperand(0)) {
9126 PHINode *PN = new PHINode(MergedVal->getType(), "storemerge");
9127 PN->reserveOperandSpace(2);
9128 PN->addIncoming(SI.getOperand(0), SI.getParent());
9129 PN->addIncoming(OtherStore->getOperand(0), OtherBB);
9130 MergedVal = InsertNewInstBefore(PN, DestBB->front());
9133 // Advance to a place where it is safe to insert the new store and
9135 BBI = DestBB->begin();
9136 while (isa<PHINode>(BBI)) ++BBI;
9137 InsertNewInstBefore(new StoreInst(MergedVal, SI.getOperand(1),
9138 OtherStore->isVolatile()), *BBI);
9140 // Nuke the old stores.
9141 EraseInstFromFunction(SI);
9142 EraseInstFromFunction(*OtherStore);
9148 Instruction *InstCombiner::visitBranchInst(BranchInst &BI) {
9149 // Change br (not X), label True, label False to: br X, label False, True
9151 BasicBlock *TrueDest;
9152 BasicBlock *FalseDest;
9153 if (match(&BI, m_Br(m_Not(m_Value(X)), TrueDest, FalseDest)) &&
9154 !isa<Constant>(X)) {
9155 // Swap Destinations and condition...
9157 BI.setSuccessor(0, FalseDest);
9158 BI.setSuccessor(1, TrueDest);
9162 // Cannonicalize fcmp_one -> fcmp_oeq
9163 FCmpInst::Predicate FPred; Value *Y;
9164 if (match(&BI, m_Br(m_FCmp(FPred, m_Value(X), m_Value(Y)),
9165 TrueDest, FalseDest)))
9166 if ((FPred == FCmpInst::FCMP_ONE || FPred == FCmpInst::FCMP_OLE ||
9167 FPred == FCmpInst::FCMP_OGE) && BI.getCondition()->hasOneUse()) {
9168 FCmpInst *I = cast<FCmpInst>(BI.getCondition());
9169 FCmpInst::Predicate NewPred = FCmpInst::getInversePredicate(FPred);
9170 Instruction *NewSCC = new FCmpInst(NewPred, X, Y, "", I);
9171 NewSCC->takeName(I);
9172 // Swap Destinations and condition...
9173 BI.setCondition(NewSCC);
9174 BI.setSuccessor(0, FalseDest);
9175 BI.setSuccessor(1, TrueDest);
9176 RemoveFromWorkList(I);
9177 I->eraseFromParent();
9178 AddToWorkList(NewSCC);
9182 // Cannonicalize icmp_ne -> icmp_eq
9183 ICmpInst::Predicate IPred;
9184 if (match(&BI, m_Br(m_ICmp(IPred, m_Value(X), m_Value(Y)),
9185 TrueDest, FalseDest)))
9186 if ((IPred == ICmpInst::ICMP_NE || IPred == ICmpInst::ICMP_ULE ||
9187 IPred == ICmpInst::ICMP_SLE || IPred == ICmpInst::ICMP_UGE ||
9188 IPred == ICmpInst::ICMP_SGE) && BI.getCondition()->hasOneUse()) {
9189 ICmpInst *I = cast<ICmpInst>(BI.getCondition());
9190 ICmpInst::Predicate NewPred = ICmpInst::getInversePredicate(IPred);
9191 Instruction *NewSCC = new ICmpInst(NewPred, X, Y, "", I);
9192 NewSCC->takeName(I);
9193 // Swap Destinations and condition...
9194 BI.setCondition(NewSCC);
9195 BI.setSuccessor(0, FalseDest);
9196 BI.setSuccessor(1, TrueDest);
9197 RemoveFromWorkList(I);
9198 I->eraseFromParent();;
9199 AddToWorkList(NewSCC);
9206 Instruction *InstCombiner::visitSwitchInst(SwitchInst &SI) {
9207 Value *Cond = SI.getCondition();
9208 if (Instruction *I = dyn_cast<Instruction>(Cond)) {
9209 if (I->getOpcode() == Instruction::Add)
9210 if (ConstantInt *AddRHS = dyn_cast<ConstantInt>(I->getOperand(1))) {
9211 // change 'switch (X+4) case 1:' into 'switch (X) case -3'
9212 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2)
9213 SI.setOperand(i,ConstantExpr::getSub(cast<Constant>(SI.getOperand(i)),
9215 SI.setOperand(0, I->getOperand(0));
9223 /// CheapToScalarize - Return true if the value is cheaper to scalarize than it
9224 /// is to leave as a vector operation.
9225 static bool CheapToScalarize(Value *V, bool isConstant) {
9226 if (isa<ConstantAggregateZero>(V))
9228 if (ConstantVector *C = dyn_cast<ConstantVector>(V)) {
9229 if (isConstant) return true;
9230 // If all elts are the same, we can extract.
9231 Constant *Op0 = C->getOperand(0);
9232 for (unsigned i = 1; i < C->getNumOperands(); ++i)
9233 if (C->getOperand(i) != Op0)
9237 Instruction *I = dyn_cast<Instruction>(V);
9238 if (!I) return false;
9240 // Insert element gets simplified to the inserted element or is deleted if
9241 // this is constant idx extract element and its a constant idx insertelt.
9242 if (I->getOpcode() == Instruction::InsertElement && isConstant &&
9243 isa<ConstantInt>(I->getOperand(2)))
9245 if (I->getOpcode() == Instruction::Load && I->hasOneUse())
9247 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(I))
9248 if (BO->hasOneUse() &&
9249 (CheapToScalarize(BO->getOperand(0), isConstant) ||
9250 CheapToScalarize(BO->getOperand(1), isConstant)))
9252 if (CmpInst *CI = dyn_cast<CmpInst>(I))
9253 if (CI->hasOneUse() &&
9254 (CheapToScalarize(CI->getOperand(0), isConstant) ||
9255 CheapToScalarize(CI->getOperand(1), isConstant)))
9261 /// Read and decode a shufflevector mask.
9263 /// It turns undef elements into values that are larger than the number of
9264 /// elements in the input.
9265 static std::vector<unsigned> getShuffleMask(const ShuffleVectorInst *SVI) {
9266 unsigned NElts = SVI->getType()->getNumElements();
9267 if (isa<ConstantAggregateZero>(SVI->getOperand(2)))
9268 return std::vector<unsigned>(NElts, 0);
9269 if (isa<UndefValue>(SVI->getOperand(2)))
9270 return std::vector<unsigned>(NElts, 2*NElts);
9272 std::vector<unsigned> Result;
9273 const ConstantVector *CP = cast<ConstantVector>(SVI->getOperand(2));
9274 for (unsigned i = 0, e = CP->getNumOperands(); i != e; ++i)
9275 if (isa<UndefValue>(CP->getOperand(i)))
9276 Result.push_back(NElts*2); // undef -> 8
9278 Result.push_back(cast<ConstantInt>(CP->getOperand(i))->getZExtValue());
9282 /// FindScalarElement - Given a vector and an element number, see if the scalar
9283 /// value is already around as a register, for example if it were inserted then
9284 /// extracted from the vector.
9285 static Value *FindScalarElement(Value *V, unsigned EltNo) {
9286 assert(isa<VectorType>(V->getType()) && "Not looking at a vector?");
9287 const VectorType *PTy = cast<VectorType>(V->getType());
9288 unsigned Width = PTy->getNumElements();
9289 if (EltNo >= Width) // Out of range access.
9290 return UndefValue::get(PTy->getElementType());
9292 if (isa<UndefValue>(V))
9293 return UndefValue::get(PTy->getElementType());
9294 else if (isa<ConstantAggregateZero>(V))
9295 return Constant::getNullValue(PTy->getElementType());
9296 else if (ConstantVector *CP = dyn_cast<ConstantVector>(V))
9297 return CP->getOperand(EltNo);
9298 else if (InsertElementInst *III = dyn_cast<InsertElementInst>(V)) {
9299 // If this is an insert to a variable element, we don't know what it is.
9300 if (!isa<ConstantInt>(III->getOperand(2)))
9302 unsigned IIElt = cast<ConstantInt>(III->getOperand(2))->getZExtValue();
9304 // If this is an insert to the element we are looking for, return the
9307 return III->getOperand(1);
9309 // Otherwise, the insertelement doesn't modify the value, recurse on its
9311 return FindScalarElement(III->getOperand(0), EltNo);
9312 } else if (ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(V)) {
9313 unsigned InEl = getShuffleMask(SVI)[EltNo];
9315 return FindScalarElement(SVI->getOperand(0), InEl);
9316 else if (InEl < Width*2)
9317 return FindScalarElement(SVI->getOperand(1), InEl - Width);
9319 return UndefValue::get(PTy->getElementType());
9322 // Otherwise, we don't know.
9326 Instruction *InstCombiner::visitExtractElementInst(ExtractElementInst &EI) {
9328 // If vector val is undef, replace extract with scalar undef.
9329 if (isa<UndefValue>(EI.getOperand(0)))
9330 return ReplaceInstUsesWith(EI, UndefValue::get(EI.getType()));
9332 // If vector val is constant 0, replace extract with scalar 0.
9333 if (isa<ConstantAggregateZero>(EI.getOperand(0)))
9334 return ReplaceInstUsesWith(EI, Constant::getNullValue(EI.getType()));
9336 if (ConstantVector *C = dyn_cast<ConstantVector>(EI.getOperand(0))) {
9337 // If vector val is constant with uniform operands, replace EI
9338 // with that operand
9339 Constant *op0 = C->getOperand(0);
9340 for (unsigned i = 1; i < C->getNumOperands(); ++i)
9341 if (C->getOperand(i) != op0) {
9346 return ReplaceInstUsesWith(EI, op0);
9349 // If extracting a specified index from the vector, see if we can recursively
9350 // find a previously computed scalar that was inserted into the vector.
9351 if (ConstantInt *IdxC = dyn_cast<ConstantInt>(EI.getOperand(1))) {
9352 unsigned IndexVal = IdxC->getZExtValue();
9353 unsigned VectorWidth =
9354 cast<VectorType>(EI.getOperand(0)->getType())->getNumElements();
9356 // If this is extracting an invalid index, turn this into undef, to avoid
9357 // crashing the code below.
9358 if (IndexVal >= VectorWidth)
9359 return ReplaceInstUsesWith(EI, UndefValue::get(EI.getType()));
9361 // This instruction only demands the single element from the input vector.
9362 // If the input vector has a single use, simplify it based on this use
9364 if (EI.getOperand(0)->hasOneUse() && VectorWidth != 1) {
9366 if (Value *V = SimplifyDemandedVectorElts(EI.getOperand(0),
9369 EI.setOperand(0, V);
9374 if (Value *Elt = FindScalarElement(EI.getOperand(0), IndexVal))
9375 return ReplaceInstUsesWith(EI, Elt);
9377 // If the this extractelement is directly using a bitcast from a vector of
9378 // the same number of elements, see if we can find the source element from
9379 // it. In this case, we will end up needing to bitcast the scalars.
9380 if (BitCastInst *BCI = dyn_cast<BitCastInst>(EI.getOperand(0))) {
9381 if (const VectorType *VT =
9382 dyn_cast<VectorType>(BCI->getOperand(0)->getType()))
9383 if (VT->getNumElements() == VectorWidth)
9384 if (Value *Elt = FindScalarElement(BCI->getOperand(0), IndexVal))
9385 return new BitCastInst(Elt, EI.getType());
9389 if (Instruction *I = dyn_cast<Instruction>(EI.getOperand(0))) {
9390 if (I->hasOneUse()) {
9391 // Push extractelement into predecessor operation if legal and
9392 // profitable to do so
9393 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(I)) {
9394 bool isConstantElt = isa<ConstantInt>(EI.getOperand(1));
9395 if (CheapToScalarize(BO, isConstantElt)) {
9396 ExtractElementInst *newEI0 =
9397 new ExtractElementInst(BO->getOperand(0), EI.getOperand(1),
9398 EI.getName()+".lhs");
9399 ExtractElementInst *newEI1 =
9400 new ExtractElementInst(BO->getOperand(1), EI.getOperand(1),
9401 EI.getName()+".rhs");
9402 InsertNewInstBefore(newEI0, EI);
9403 InsertNewInstBefore(newEI1, EI);
9404 return BinaryOperator::create(BO->getOpcode(), newEI0, newEI1);
9406 } else if (isa<LoadInst>(I)) {
9407 Value *Ptr = InsertCastBefore(Instruction::BitCast, I->getOperand(0),
9408 PointerType::get(EI.getType()), EI);
9409 GetElementPtrInst *GEP =
9410 new GetElementPtrInst(Ptr, EI.getOperand(1), I->getName() + ".gep");
9411 InsertNewInstBefore(GEP, EI);
9412 return new LoadInst(GEP);
9415 if (InsertElementInst *IE = dyn_cast<InsertElementInst>(I)) {
9416 // Extracting the inserted element?
9417 if (IE->getOperand(2) == EI.getOperand(1))
9418 return ReplaceInstUsesWith(EI, IE->getOperand(1));
9419 // If the inserted and extracted elements are constants, they must not
9420 // be the same value, extract from the pre-inserted value instead.
9421 if (isa<Constant>(IE->getOperand(2)) &&
9422 isa<Constant>(EI.getOperand(1))) {
9423 AddUsesToWorkList(EI);
9424 EI.setOperand(0, IE->getOperand(0));
9427 } else if (ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(I)) {
9428 // If this is extracting an element from a shufflevector, figure out where
9429 // it came from and extract from the appropriate input element instead.
9430 if (ConstantInt *Elt = dyn_cast<ConstantInt>(EI.getOperand(1))) {
9431 unsigned SrcIdx = getShuffleMask(SVI)[Elt->getZExtValue()];
9433 if (SrcIdx < SVI->getType()->getNumElements())
9434 Src = SVI->getOperand(0);
9435 else if (SrcIdx < SVI->getType()->getNumElements()*2) {
9436 SrcIdx -= SVI->getType()->getNumElements();
9437 Src = SVI->getOperand(1);
9439 return ReplaceInstUsesWith(EI, UndefValue::get(EI.getType()));
9441 return new ExtractElementInst(Src, SrcIdx);
9448 /// CollectSingleShuffleElements - If V is a shuffle of values that ONLY returns
9449 /// elements from either LHS or RHS, return the shuffle mask and true.
9450 /// Otherwise, return false.
9451 static bool CollectSingleShuffleElements(Value *V, Value *LHS, Value *RHS,
9452 std::vector<Constant*> &Mask) {
9453 assert(V->getType() == LHS->getType() && V->getType() == RHS->getType() &&
9454 "Invalid CollectSingleShuffleElements");
9455 unsigned NumElts = cast<VectorType>(V->getType())->getNumElements();
9457 if (isa<UndefValue>(V)) {
9458 Mask.assign(NumElts, UndefValue::get(Type::Int32Ty));
9460 } else if (V == LHS) {
9461 for (unsigned i = 0; i != NumElts; ++i)
9462 Mask.push_back(ConstantInt::get(Type::Int32Ty, i));
9464 } else if (V == RHS) {
9465 for (unsigned i = 0; i != NumElts; ++i)
9466 Mask.push_back(ConstantInt::get(Type::Int32Ty, i+NumElts));
9468 } else if (InsertElementInst *IEI = dyn_cast<InsertElementInst>(V)) {
9469 // If this is an insert of an extract from some other vector, include it.
9470 Value *VecOp = IEI->getOperand(0);
9471 Value *ScalarOp = IEI->getOperand(1);
9472 Value *IdxOp = IEI->getOperand(2);
9474 if (!isa<ConstantInt>(IdxOp))
9476 unsigned InsertedIdx = cast<ConstantInt>(IdxOp)->getZExtValue();
9478 if (isa<UndefValue>(ScalarOp)) { // inserting undef into vector.
9479 // Okay, we can handle this if the vector we are insertinting into is
9481 if (CollectSingleShuffleElements(VecOp, LHS, RHS, Mask)) {
9482 // If so, update the mask to reflect the inserted undef.
9483 Mask[InsertedIdx] = UndefValue::get(Type::Int32Ty);
9486 } else if (ExtractElementInst *EI = dyn_cast<ExtractElementInst>(ScalarOp)){
9487 if (isa<ConstantInt>(EI->getOperand(1)) &&
9488 EI->getOperand(0)->getType() == V->getType()) {
9489 unsigned ExtractedIdx =
9490 cast<ConstantInt>(EI->getOperand(1))->getZExtValue();
9492 // This must be extracting from either LHS or RHS.
9493 if (EI->getOperand(0) == LHS || EI->getOperand(0) == RHS) {
9494 // Okay, we can handle this if the vector we are insertinting into is
9496 if (CollectSingleShuffleElements(VecOp, LHS, RHS, Mask)) {
9497 // If so, update the mask to reflect the inserted value.
9498 if (EI->getOperand(0) == LHS) {
9499 Mask[InsertedIdx & (NumElts-1)] =
9500 ConstantInt::get(Type::Int32Ty, ExtractedIdx);
9502 assert(EI->getOperand(0) == RHS);
9503 Mask[InsertedIdx & (NumElts-1)] =
9504 ConstantInt::get(Type::Int32Ty, ExtractedIdx+NumElts);
9513 // TODO: Handle shufflevector here!
9518 /// CollectShuffleElements - We are building a shuffle of V, using RHS as the
9519 /// RHS of the shuffle instruction, if it is not null. Return a shuffle mask
9520 /// that computes V and the LHS value of the shuffle.
9521 static Value *CollectShuffleElements(Value *V, std::vector<Constant*> &Mask,
9523 assert(isa<VectorType>(V->getType()) &&
9524 (RHS == 0 || V->getType() == RHS->getType()) &&
9525 "Invalid shuffle!");
9526 unsigned NumElts = cast<VectorType>(V->getType())->getNumElements();
9528 if (isa<UndefValue>(V)) {
9529 Mask.assign(NumElts, UndefValue::get(Type::Int32Ty));
9531 } else if (isa<ConstantAggregateZero>(V)) {
9532 Mask.assign(NumElts, ConstantInt::get(Type::Int32Ty, 0));
9534 } else if (InsertElementInst *IEI = dyn_cast<InsertElementInst>(V)) {
9535 // If this is an insert of an extract from some other vector, include it.
9536 Value *VecOp = IEI->getOperand(0);
9537 Value *ScalarOp = IEI->getOperand(1);
9538 Value *IdxOp = IEI->getOperand(2);
9540 if (ExtractElementInst *EI = dyn_cast<ExtractElementInst>(ScalarOp)) {
9541 if (isa<ConstantInt>(EI->getOperand(1)) && isa<ConstantInt>(IdxOp) &&
9542 EI->getOperand(0)->getType() == V->getType()) {
9543 unsigned ExtractedIdx =
9544 cast<ConstantInt>(EI->getOperand(1))->getZExtValue();
9545 unsigned InsertedIdx = cast<ConstantInt>(IdxOp)->getZExtValue();
9547 // Either the extracted from or inserted into vector must be RHSVec,
9548 // otherwise we'd end up with a shuffle of three inputs.
9549 if (EI->getOperand(0) == RHS || RHS == 0) {
9550 RHS = EI->getOperand(0);
9551 Value *V = CollectShuffleElements(VecOp, Mask, RHS);
9552 Mask[InsertedIdx & (NumElts-1)] =
9553 ConstantInt::get(Type::Int32Ty, NumElts+ExtractedIdx);
9558 Value *V = CollectShuffleElements(EI->getOperand(0), Mask, RHS);
9559 // Everything but the extracted element is replaced with the RHS.
9560 for (unsigned i = 0; i != NumElts; ++i) {
9561 if (i != InsertedIdx)
9562 Mask[i] = ConstantInt::get(Type::Int32Ty, NumElts+i);
9567 // If this insertelement is a chain that comes from exactly these two
9568 // vectors, return the vector and the effective shuffle.
9569 if (CollectSingleShuffleElements(IEI, EI->getOperand(0), RHS, Mask))
9570 return EI->getOperand(0);
9575 // TODO: Handle shufflevector here!
9577 // Otherwise, can't do anything fancy. Return an identity vector.
9578 for (unsigned i = 0; i != NumElts; ++i)
9579 Mask.push_back(ConstantInt::get(Type::Int32Ty, i));
9583 Instruction *InstCombiner::visitInsertElementInst(InsertElementInst &IE) {
9584 Value *VecOp = IE.getOperand(0);
9585 Value *ScalarOp = IE.getOperand(1);
9586 Value *IdxOp = IE.getOperand(2);
9588 // Inserting an undef or into an undefined place, remove this.
9589 if (isa<UndefValue>(ScalarOp) || isa<UndefValue>(IdxOp))
9590 ReplaceInstUsesWith(IE, VecOp);
9592 // If the inserted element was extracted from some other vector, and if the
9593 // indexes are constant, try to turn this into a shufflevector operation.
9594 if (ExtractElementInst *EI = dyn_cast<ExtractElementInst>(ScalarOp)) {
9595 if (isa<ConstantInt>(EI->getOperand(1)) && isa<ConstantInt>(IdxOp) &&
9596 EI->getOperand(0)->getType() == IE.getType()) {
9597 unsigned NumVectorElts = IE.getType()->getNumElements();
9598 unsigned ExtractedIdx =
9599 cast<ConstantInt>(EI->getOperand(1))->getZExtValue();
9600 unsigned InsertedIdx = cast<ConstantInt>(IdxOp)->getZExtValue();
9602 if (ExtractedIdx >= NumVectorElts) // Out of range extract.
9603 return ReplaceInstUsesWith(IE, VecOp);
9605 if (InsertedIdx >= NumVectorElts) // Out of range insert.
9606 return ReplaceInstUsesWith(IE, UndefValue::get(IE.getType()));
9608 // If we are extracting a value from a vector, then inserting it right
9609 // back into the same place, just use the input vector.
9610 if (EI->getOperand(0) == VecOp && ExtractedIdx == InsertedIdx)
9611 return ReplaceInstUsesWith(IE, VecOp);
9613 // We could theoretically do this for ANY input. However, doing so could
9614 // turn chains of insertelement instructions into a chain of shufflevector
9615 // instructions, and right now we do not merge shufflevectors. As such,
9616 // only do this in a situation where it is clear that there is benefit.
9617 if (isa<UndefValue>(VecOp) || isa<ConstantAggregateZero>(VecOp)) {
9618 // Turn this into shuffle(EIOp0, VecOp, Mask). The result has all of
9619 // the values of VecOp, except then one read from EIOp0.
9620 // Build a new shuffle mask.
9621 std::vector<Constant*> Mask;
9622 if (isa<UndefValue>(VecOp))
9623 Mask.assign(NumVectorElts, UndefValue::get(Type::Int32Ty));
9625 assert(isa<ConstantAggregateZero>(VecOp) && "Unknown thing");
9626 Mask.assign(NumVectorElts, ConstantInt::get(Type::Int32Ty,
9629 Mask[InsertedIdx] = ConstantInt::get(Type::Int32Ty, ExtractedIdx);
9630 return new ShuffleVectorInst(EI->getOperand(0), VecOp,
9631 ConstantVector::get(Mask));
9634 // If this insertelement isn't used by some other insertelement, turn it
9635 // (and any insertelements it points to), into one big shuffle.
9636 if (!IE.hasOneUse() || !isa<InsertElementInst>(IE.use_back())) {
9637 std::vector<Constant*> Mask;
9639 Value *LHS = CollectShuffleElements(&IE, Mask, RHS);
9640 if (RHS == 0) RHS = UndefValue::get(LHS->getType());
9641 // We now have a shuffle of LHS, RHS, Mask.
9642 return new ShuffleVectorInst(LHS, RHS, ConstantVector::get(Mask));
9651 Instruction *InstCombiner::visitShuffleVectorInst(ShuffleVectorInst &SVI) {
9652 Value *LHS = SVI.getOperand(0);
9653 Value *RHS = SVI.getOperand(1);
9654 std::vector<unsigned> Mask = getShuffleMask(&SVI);
9656 bool MadeChange = false;
9658 // Undefined shuffle mask -> undefined value.
9659 if (isa<UndefValue>(SVI.getOperand(2)))
9660 return ReplaceInstUsesWith(SVI, UndefValue::get(SVI.getType()));
9662 // If we have shuffle(x, undef, mask) and any elements of mask refer to
9663 // the undef, change them to undefs.
9664 if (isa<UndefValue>(SVI.getOperand(1))) {
9665 // Scan to see if there are any references to the RHS. If so, replace them
9666 // with undef element refs and set MadeChange to true.
9667 for (unsigned i = 0, e = Mask.size(); i != e; ++i) {
9668 if (Mask[i] >= e && Mask[i] != 2*e) {
9675 // Remap any references to RHS to use LHS.
9676 std::vector<Constant*> Elts;
9677 for (unsigned i = 0, e = Mask.size(); i != e; ++i) {
9679 Elts.push_back(UndefValue::get(Type::Int32Ty));
9681 Elts.push_back(ConstantInt::get(Type::Int32Ty, Mask[i]));
9683 SVI.setOperand(2, ConstantVector::get(Elts));
9687 // Canonicalize shuffle(x ,x,mask) -> shuffle(x, undef,mask')
9688 // Canonicalize shuffle(undef,x,mask) -> shuffle(x, undef,mask').
9689 if (LHS == RHS || isa<UndefValue>(LHS)) {
9690 if (isa<UndefValue>(LHS) && LHS == RHS) {
9691 // shuffle(undef,undef,mask) -> undef.
9692 return ReplaceInstUsesWith(SVI, LHS);
9695 // Remap any references to RHS to use LHS.
9696 std::vector<Constant*> Elts;
9697 for (unsigned i = 0, e = Mask.size(); i != e; ++i) {
9699 Elts.push_back(UndefValue::get(Type::Int32Ty));
9701 if ((Mask[i] >= e && isa<UndefValue>(RHS)) ||
9702 (Mask[i] < e && isa<UndefValue>(LHS)))
9703 Mask[i] = 2*e; // Turn into undef.
9705 Mask[i] &= (e-1); // Force to LHS.
9706 Elts.push_back(ConstantInt::get(Type::Int32Ty, Mask[i]));
9709 SVI.setOperand(0, SVI.getOperand(1));
9710 SVI.setOperand(1, UndefValue::get(RHS->getType()));
9711 SVI.setOperand(2, ConstantVector::get(Elts));
9712 LHS = SVI.getOperand(0);
9713 RHS = SVI.getOperand(1);
9717 // Analyze the shuffle, are the LHS or RHS and identity shuffles?
9718 bool isLHSID = true, isRHSID = true;
9720 for (unsigned i = 0, e = Mask.size(); i != e; ++i) {
9721 if (Mask[i] >= e*2) continue; // Ignore undef values.
9722 // Is this an identity shuffle of the LHS value?
9723 isLHSID &= (Mask[i] == i);
9725 // Is this an identity shuffle of the RHS value?
9726 isRHSID &= (Mask[i]-e == i);
9729 // Eliminate identity shuffles.
9730 if (isLHSID) return ReplaceInstUsesWith(SVI, LHS);
9731 if (isRHSID) return ReplaceInstUsesWith(SVI, RHS);
9733 // If the LHS is a shufflevector itself, see if we can combine it with this
9734 // one without producing an unusual shuffle. Here we are really conservative:
9735 // we are absolutely afraid of producing a shuffle mask not in the input
9736 // program, because the code gen may not be smart enough to turn a merged
9737 // shuffle into two specific shuffles: it may produce worse code. As such,
9738 // we only merge two shuffles if the result is one of the two input shuffle
9739 // masks. In this case, merging the shuffles just removes one instruction,
9740 // which we know is safe. This is good for things like turning:
9741 // (splat(splat)) -> splat.
9742 if (ShuffleVectorInst *LHSSVI = dyn_cast<ShuffleVectorInst>(LHS)) {
9743 if (isa<UndefValue>(RHS)) {
9744 std::vector<unsigned> LHSMask = getShuffleMask(LHSSVI);
9746 std::vector<unsigned> NewMask;
9747 for (unsigned i = 0, e = Mask.size(); i != e; ++i)
9749 NewMask.push_back(2*e);
9751 NewMask.push_back(LHSMask[Mask[i]]);
9753 // If the result mask is equal to the src shuffle or this shuffle mask, do
9755 if (NewMask == LHSMask || NewMask == Mask) {
9756 std::vector<Constant*> Elts;
9757 for (unsigned i = 0, e = NewMask.size(); i != e; ++i) {
9758 if (NewMask[i] >= e*2) {
9759 Elts.push_back(UndefValue::get(Type::Int32Ty));
9761 Elts.push_back(ConstantInt::get(Type::Int32Ty, NewMask[i]));
9764 return new ShuffleVectorInst(LHSSVI->getOperand(0),
9765 LHSSVI->getOperand(1),
9766 ConstantVector::get(Elts));
9771 return MadeChange ? &SVI : 0;
9777 /// TryToSinkInstruction - Try to move the specified instruction from its
9778 /// current block into the beginning of DestBlock, which can only happen if it's
9779 /// safe to move the instruction past all of the instructions between it and the
9780 /// end of its block.
9781 static bool TryToSinkInstruction(Instruction *I, BasicBlock *DestBlock) {
9782 assert(I->hasOneUse() && "Invariants didn't hold!");
9784 // Cannot move control-flow-involving, volatile loads, vaarg, etc.
9785 if (isa<PHINode>(I) || I->mayWriteToMemory()) return false;
9787 // Do not sink alloca instructions out of the entry block.
9788 if (isa<AllocaInst>(I) && I->getParent() ==
9789 &DestBlock->getParent()->getEntryBlock())
9792 // We can only sink load instructions if there is nothing between the load and
9793 // the end of block that could change the value.
9794 if (LoadInst *LI = dyn_cast<LoadInst>(I)) {
9795 for (BasicBlock::iterator Scan = LI, E = LI->getParent()->end();
9797 if (Scan->mayWriteToMemory())
9801 BasicBlock::iterator InsertPos = DestBlock->begin();
9802 while (isa<PHINode>(InsertPos)) ++InsertPos;
9804 I->moveBefore(InsertPos);
9810 /// AddReachableCodeToWorklist - Walk the function in depth-first order, adding
9811 /// all reachable code to the worklist.
9813 /// This has a couple of tricks to make the code faster and more powerful. In
9814 /// particular, we constant fold and DCE instructions as we go, to avoid adding
9815 /// them to the worklist (this significantly speeds up instcombine on code where
9816 /// many instructions are dead or constant). Additionally, if we find a branch
9817 /// whose condition is a known constant, we only visit the reachable successors.
9819 static void AddReachableCodeToWorklist(BasicBlock *BB,
9820 SmallPtrSet<BasicBlock*, 64> &Visited,
9822 const TargetData *TD) {
9823 std::vector<BasicBlock*> Worklist;
9824 Worklist.push_back(BB);
9826 while (!Worklist.empty()) {
9827 BB = Worklist.back();
9828 Worklist.pop_back();
9830 // We have now visited this block! If we've already been here, ignore it.
9831 if (!Visited.insert(BB)) continue;
9833 for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E; ) {
9834 Instruction *Inst = BBI++;
9836 // DCE instruction if trivially dead.
9837 if (isInstructionTriviallyDead(Inst)) {
9839 DOUT << "IC: DCE: " << *Inst;
9840 Inst->eraseFromParent();
9844 // ConstantProp instruction if trivially constant.
9845 if (Constant *C = ConstantFoldInstruction(Inst, TD)) {
9846 DOUT << "IC: ConstFold to: " << *C << " from: " << *Inst;
9847 Inst->replaceAllUsesWith(C);
9849 Inst->eraseFromParent();
9853 IC.AddToWorkList(Inst);
9856 // Recursively visit successors. If this is a branch or switch on a
9857 // constant, only visit the reachable successor.
9858 TerminatorInst *TI = BB->getTerminator();
9859 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
9860 if (BI->isConditional() && isa<ConstantInt>(BI->getCondition())) {
9861 bool CondVal = cast<ConstantInt>(BI->getCondition())->getZExtValue();
9862 Worklist.push_back(BI->getSuccessor(!CondVal));
9865 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) {
9866 if (ConstantInt *Cond = dyn_cast<ConstantInt>(SI->getCondition())) {
9867 // See if this is an explicit destination.
9868 for (unsigned i = 1, e = SI->getNumSuccessors(); i != e; ++i)
9869 if (SI->getCaseValue(i) == Cond) {
9870 Worklist.push_back(SI->getSuccessor(i));
9874 // Otherwise it is the default destination.
9875 Worklist.push_back(SI->getSuccessor(0));
9880 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
9881 Worklist.push_back(TI->getSuccessor(i));
9885 bool InstCombiner::DoOneIteration(Function &F, unsigned Iteration) {
9886 bool Changed = false;
9887 TD = &getAnalysis<TargetData>();
9889 DEBUG(DOUT << "\n\nINSTCOMBINE ITERATION #" << Iteration << " on "
9890 << F.getNameStr() << "\n");
9893 // Do a depth-first traversal of the function, populate the worklist with
9894 // the reachable instructions. Ignore blocks that are not reachable. Keep
9895 // track of which blocks we visit.
9896 SmallPtrSet<BasicBlock*, 64> Visited;
9897 AddReachableCodeToWorklist(F.begin(), Visited, *this, TD);
9899 // Do a quick scan over the function. If we find any blocks that are
9900 // unreachable, remove any instructions inside of them. This prevents
9901 // the instcombine code from having to deal with some bad special cases.
9902 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
9903 if (!Visited.count(BB)) {
9904 Instruction *Term = BB->getTerminator();
9905 while (Term != BB->begin()) { // Remove instrs bottom-up
9906 BasicBlock::iterator I = Term; --I;
9908 DOUT << "IC: DCE: " << *I;
9911 if (!I->use_empty())
9912 I->replaceAllUsesWith(UndefValue::get(I->getType()));
9913 I->eraseFromParent();
9918 while (!Worklist.empty()) {
9919 Instruction *I = RemoveOneFromWorkList();
9920 if (I == 0) continue; // skip null values.
9922 // Check to see if we can DCE the instruction.
9923 if (isInstructionTriviallyDead(I)) {
9924 // Add operands to the worklist.
9925 if (I->getNumOperands() < 4)
9926 AddUsesToWorkList(*I);
9929 DOUT << "IC: DCE: " << *I;
9931 I->eraseFromParent();
9932 RemoveFromWorkList(I);
9936 // Instruction isn't dead, see if we can constant propagate it.
9937 if (Constant *C = ConstantFoldInstruction(I, TD)) {
9938 DOUT << "IC: ConstFold to: " << *C << " from: " << *I;
9940 // Add operands to the worklist.
9941 AddUsesToWorkList(*I);
9942 ReplaceInstUsesWith(*I, C);
9945 I->eraseFromParent();
9946 RemoveFromWorkList(I);
9950 // See if we can trivially sink this instruction to a successor basic block.
9951 if (I->hasOneUse()) {
9952 BasicBlock *BB = I->getParent();
9953 BasicBlock *UserParent = cast<Instruction>(I->use_back())->getParent();
9954 if (UserParent != BB) {
9955 bool UserIsSuccessor = false;
9956 // See if the user is one of our successors.
9957 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI)
9958 if (*SI == UserParent) {
9959 UserIsSuccessor = true;
9963 // If the user is one of our immediate successors, and if that successor
9964 // only has us as a predecessors (we'd have to split the critical edge
9965 // otherwise), we can keep going.
9966 if (UserIsSuccessor && !isa<PHINode>(I->use_back()) &&
9967 next(pred_begin(UserParent)) == pred_end(UserParent))
9968 // Okay, the CFG is simple enough, try to sink this instruction.
9969 Changed |= TryToSinkInstruction(I, UserParent);
9973 // Now that we have an instruction, try combining it to simplify it...
9977 DEBUG(std::ostringstream SS; I->print(SS); OrigI = SS.str(););
9978 if (Instruction *Result = visit(*I)) {
9980 // Should we replace the old instruction with a new one?
9982 DOUT << "IC: Old = " << *I
9983 << " New = " << *Result;
9985 // Everything uses the new instruction now.
9986 I->replaceAllUsesWith(Result);
9988 // Push the new instruction and any users onto the worklist.
9989 AddToWorkList(Result);
9990 AddUsersToWorkList(*Result);
9992 // Move the name to the new instruction first.
9993 Result->takeName(I);
9995 // Insert the new instruction into the basic block...
9996 BasicBlock *InstParent = I->getParent();
9997 BasicBlock::iterator InsertPos = I;
9999 if (!isa<PHINode>(Result)) // If combining a PHI, don't insert
10000 while (isa<PHINode>(InsertPos)) // middle of a block of PHIs.
10003 InstParent->getInstList().insert(InsertPos, Result);
10005 // Make sure that we reprocess all operands now that we reduced their
10007 AddUsesToWorkList(*I);
10009 // Instructions can end up on the worklist more than once. Make sure
10010 // we do not process an instruction that has been deleted.
10011 RemoveFromWorkList(I);
10013 // Erase the old instruction.
10014 InstParent->getInstList().erase(I);
10017 DOUT << "IC: Mod = " << OrigI
10018 << " New = " << *I;
10021 // If the instruction was modified, it's possible that it is now dead.
10022 // if so, remove it.
10023 if (isInstructionTriviallyDead(I)) {
10024 // Make sure we process all operands now that we are reducing their
10026 AddUsesToWorkList(*I);
10028 // Instructions may end up in the worklist more than once. Erase all
10029 // occurrences of this instruction.
10030 RemoveFromWorkList(I);
10031 I->eraseFromParent();
10034 AddUsersToWorkList(*I);
10041 assert(WorklistMap.empty() && "Worklist empty, but map not?");
10046 bool InstCombiner::runOnFunction(Function &F) {
10047 MustPreserveLCSSA = mustPreserveAnalysisID(LCSSAID);
10049 bool EverMadeChange = false;
10051 // Iterate while there is work to do.
10052 unsigned Iteration = 0;
10053 while (DoOneIteration(F, Iteration++))
10054 EverMadeChange = true;
10055 return EverMadeChange;
10058 FunctionPass *llvm::createInstructionCombiningPass() {
10059 return new InstCombiner();