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/ParameterAttributes.h"
43 #include "llvm/Analysis/ConstantFolding.h"
44 #include "llvm/Target/TargetData.h"
45 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
46 #include "llvm/Transforms/Utils/Local.h"
47 #include "llvm/Support/CallSite.h"
48 #include "llvm/Support/Debug.h"
49 #include "llvm/Support/GetElementPtrTypeIterator.h"
50 #include "llvm/Support/InstVisitor.h"
51 #include "llvm/Support/MathExtras.h"
52 #include "llvm/Support/PatternMatch.h"
53 #include "llvm/Support/Compiler.h"
54 #include "llvm/ADT/DenseMap.h"
55 #include "llvm/ADT/SmallVector.h"
56 #include "llvm/ADT/SmallPtrSet.h"
57 #include "llvm/ADT/Statistic.h"
58 #include "llvm/ADT/STLExtras.h"
62 using namespace llvm::PatternMatch;
64 STATISTIC(NumCombined , "Number of insts combined");
65 STATISTIC(NumConstProp, "Number of constant folds");
66 STATISTIC(NumDeadInst , "Number of dead inst eliminated");
67 STATISTIC(NumDeadStore, "Number of dead stores eliminated");
68 STATISTIC(NumSunkInst , "Number of instructions sunk");
71 class VISIBILITY_HIDDEN InstCombiner
72 : public FunctionPass,
73 public InstVisitor<InstCombiner, Instruction*> {
74 // Worklist of all of the instructions that need to be simplified.
75 std::vector<Instruction*> Worklist;
76 DenseMap<Instruction*, unsigned> WorklistMap;
78 bool MustPreserveLCSSA;
80 static char ID; // Pass identification, replacement for typeid
81 InstCombiner() : FunctionPass((intptr_t)&ID) {}
83 /// AddToWorkList - Add the specified instruction to the worklist if it
84 /// isn't already in it.
85 void AddToWorkList(Instruction *I) {
86 if (WorklistMap.insert(std::make_pair(I, Worklist.size())))
87 Worklist.push_back(I);
90 // RemoveFromWorkList - remove I from the worklist if it exists.
91 void RemoveFromWorkList(Instruction *I) {
92 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
93 if (It == WorklistMap.end()) return; // Not in worklist.
95 // Don't bother moving everything down, just null out the slot.
96 Worklist[It->second] = 0;
98 WorklistMap.erase(It);
101 Instruction *RemoveOneFromWorkList() {
102 Instruction *I = Worklist.back();
104 WorklistMap.erase(I);
109 /// AddUsersToWorkList - When an instruction is simplified, add all users of
110 /// the instruction to the work lists because they might get more simplified
113 void AddUsersToWorkList(Value &I) {
114 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
116 AddToWorkList(cast<Instruction>(*UI));
119 /// AddUsesToWorkList - When an instruction is simplified, add operands to
120 /// the work lists because they might get more simplified now.
122 void AddUsesToWorkList(Instruction &I) {
123 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
124 if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i)))
128 /// AddSoonDeadInstToWorklist - The specified instruction is about to become
129 /// dead. Add all of its operands to the worklist, turning them into
130 /// undef's to reduce the number of uses of those instructions.
132 /// Return the specified operand before it is turned into an undef.
134 Value *AddSoonDeadInstToWorklist(Instruction &I, unsigned op) {
135 Value *R = I.getOperand(op);
137 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
138 if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) {
140 // Set the operand to undef to drop the use.
141 I.setOperand(i, UndefValue::get(Op->getType()));
148 virtual bool runOnFunction(Function &F);
150 bool DoOneIteration(Function &F, unsigned ItNum);
152 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
153 AU.addRequired<TargetData>();
154 AU.addPreservedID(LCSSAID);
155 AU.setPreservesCFG();
158 TargetData &getTargetData() const { return *TD; }
160 // Visitation implementation - Implement instruction combining for different
161 // instruction types. The semantics are as follows:
163 // null - No change was made
164 // I - Change was made, I is still valid, I may be dead though
165 // otherwise - Change was made, replace I with returned instruction
167 Instruction *visitAdd(BinaryOperator &I);
168 Instruction *visitSub(BinaryOperator &I);
169 Instruction *visitMul(BinaryOperator &I);
170 Instruction *visitURem(BinaryOperator &I);
171 Instruction *visitSRem(BinaryOperator &I);
172 Instruction *visitFRem(BinaryOperator &I);
173 Instruction *commonRemTransforms(BinaryOperator &I);
174 Instruction *commonIRemTransforms(BinaryOperator &I);
175 Instruction *commonDivTransforms(BinaryOperator &I);
176 Instruction *commonIDivTransforms(BinaryOperator &I);
177 Instruction *visitUDiv(BinaryOperator &I);
178 Instruction *visitSDiv(BinaryOperator &I);
179 Instruction *visitFDiv(BinaryOperator &I);
180 Instruction *visitAnd(BinaryOperator &I);
181 Instruction *visitOr (BinaryOperator &I);
182 Instruction *visitXor(BinaryOperator &I);
183 Instruction *visitShl(BinaryOperator &I);
184 Instruction *visitAShr(BinaryOperator &I);
185 Instruction *visitLShr(BinaryOperator &I);
186 Instruction *commonShiftTransforms(BinaryOperator &I);
187 Instruction *visitFCmpInst(FCmpInst &I);
188 Instruction *visitICmpInst(ICmpInst &I);
189 Instruction *visitICmpInstWithCastAndCast(ICmpInst &ICI);
190 Instruction *visitICmpInstWithInstAndIntCst(ICmpInst &ICI,
193 Instruction *FoldICmpDivCst(ICmpInst &ICI, BinaryOperator *DivI,
194 ConstantInt *DivRHS);
196 Instruction *FoldGEPICmp(User *GEPLHS, Value *RHS,
197 ICmpInst::Predicate Cond, Instruction &I);
198 Instruction *FoldShiftByConstant(Value *Op0, ConstantInt *Op1,
200 Instruction *commonCastTransforms(CastInst &CI);
201 Instruction *commonIntCastTransforms(CastInst &CI);
202 Instruction *commonPointerCastTransforms(CastInst &CI);
203 Instruction *visitTrunc(TruncInst &CI);
204 Instruction *visitZExt(ZExtInst &CI);
205 Instruction *visitSExt(SExtInst &CI);
206 Instruction *visitFPTrunc(CastInst &CI);
207 Instruction *visitFPExt(CastInst &CI);
208 Instruction *visitFPToUI(CastInst &CI);
209 Instruction *visitFPToSI(CastInst &CI);
210 Instruction *visitUIToFP(CastInst &CI);
211 Instruction *visitSIToFP(CastInst &CI);
212 Instruction *visitPtrToInt(CastInst &CI);
213 Instruction *visitIntToPtr(CastInst &CI);
214 Instruction *visitBitCast(BitCastInst &CI);
215 Instruction *FoldSelectOpOp(SelectInst &SI, Instruction *TI,
217 Instruction *visitSelectInst(SelectInst &CI);
218 Instruction *visitCallInst(CallInst &CI);
219 Instruction *visitInvokeInst(InvokeInst &II);
220 Instruction *visitPHINode(PHINode &PN);
221 Instruction *visitGetElementPtrInst(GetElementPtrInst &GEP);
222 Instruction *visitAllocationInst(AllocationInst &AI);
223 Instruction *visitFreeInst(FreeInst &FI);
224 Instruction *visitLoadInst(LoadInst &LI);
225 Instruction *visitStoreInst(StoreInst &SI);
226 Instruction *visitBranchInst(BranchInst &BI);
227 Instruction *visitSwitchInst(SwitchInst &SI);
228 Instruction *visitInsertElementInst(InsertElementInst &IE);
229 Instruction *visitExtractElementInst(ExtractElementInst &EI);
230 Instruction *visitShuffleVectorInst(ShuffleVectorInst &SVI);
232 // visitInstruction - Specify what to return for unhandled instructions...
233 Instruction *visitInstruction(Instruction &I) { return 0; }
236 Instruction *visitCallSite(CallSite CS);
237 bool transformConstExprCastCall(CallSite CS);
238 Instruction *transformCallThroughTrampoline(CallSite CS);
241 // InsertNewInstBefore - insert an instruction New before instruction Old
242 // in the program. Add the new instruction to the worklist.
244 Instruction *InsertNewInstBefore(Instruction *New, Instruction &Old) {
245 assert(New && New->getParent() == 0 &&
246 "New instruction already inserted into a basic block!");
247 BasicBlock *BB = Old.getParent();
248 BB->getInstList().insert(&Old, New); // Insert inst
253 /// InsertCastBefore - Insert a cast of V to TY before the instruction POS.
254 /// This also adds the cast to the worklist. Finally, this returns the
256 Value *InsertCastBefore(Instruction::CastOps opc, Value *V, const Type *Ty,
258 if (V->getType() == Ty) return V;
260 if (Constant *CV = dyn_cast<Constant>(V))
261 return ConstantExpr::getCast(opc, CV, Ty);
263 Instruction *C = CastInst::create(opc, V, Ty, V->getName(), &Pos);
268 // ReplaceInstUsesWith - This method is to be used when an instruction is
269 // found to be dead, replacable with another preexisting expression. Here
270 // we add all uses of I to the worklist, replace all uses of I with the new
271 // value, then return I, so that the inst combiner will know that I was
274 Instruction *ReplaceInstUsesWith(Instruction &I, Value *V) {
275 AddUsersToWorkList(I); // Add all modified instrs to worklist
277 I.replaceAllUsesWith(V);
280 // If we are replacing the instruction with itself, this must be in a
281 // segment of unreachable code, so just clobber the instruction.
282 I.replaceAllUsesWith(UndefValue::get(I.getType()));
287 // UpdateValueUsesWith - This method is to be used when an value is
288 // found to be replacable with another preexisting expression or was
289 // updated. Here we add all uses of I to the worklist, replace all uses of
290 // I with the new value (unless the instruction was just updated), then
291 // return true, so that the inst combiner will know that I was modified.
293 bool UpdateValueUsesWith(Value *Old, Value *New) {
294 AddUsersToWorkList(*Old); // Add all modified instrs to worklist
296 Old->replaceAllUsesWith(New);
297 if (Instruction *I = dyn_cast<Instruction>(Old))
299 if (Instruction *I = dyn_cast<Instruction>(New))
304 // EraseInstFromFunction - When dealing with an instruction that has side
305 // effects or produces a void value, we can't rely on DCE to delete the
306 // instruction. Instead, visit methods should return the value returned by
308 Instruction *EraseInstFromFunction(Instruction &I) {
309 assert(I.use_empty() && "Cannot erase instruction that is used!");
310 AddUsesToWorkList(I);
311 RemoveFromWorkList(&I);
313 return 0; // Don't do anything with FI
317 /// InsertOperandCastBefore - This inserts a cast of V to DestTy before the
318 /// InsertBefore instruction. This is specialized a bit to avoid inserting
319 /// casts that are known to not do anything...
321 Value *InsertOperandCastBefore(Instruction::CastOps opcode,
322 Value *V, const Type *DestTy,
323 Instruction *InsertBefore);
325 /// SimplifyCommutative - This performs a few simplifications for
326 /// commutative operators.
327 bool SimplifyCommutative(BinaryOperator &I);
329 /// SimplifyCompare - This reorders the operands of a CmpInst to get them in
330 /// most-complex to least-complex order.
331 bool SimplifyCompare(CmpInst &I);
333 /// SimplifyDemandedBits - Attempts to replace V with a simpler value based
334 /// on the demanded bits.
335 bool SimplifyDemandedBits(Value *V, APInt DemandedMask,
336 APInt& KnownZero, APInt& KnownOne,
339 Value *SimplifyDemandedVectorElts(Value *V, uint64_t DemandedElts,
340 uint64_t &UndefElts, unsigned Depth = 0);
342 // FoldOpIntoPhi - Given a binary operator or cast instruction which has a
343 // PHI node as operand #0, see if we can fold the instruction into the PHI
344 // (which is only possible if all operands to the PHI are constants).
345 Instruction *FoldOpIntoPhi(Instruction &I);
347 // FoldPHIArgOpIntoPHI - If all operands to a PHI node are the same "unary"
348 // operator and they all are only used by the PHI, PHI together their
349 // inputs, and do the operation once, to the result of the PHI.
350 Instruction *FoldPHIArgOpIntoPHI(PHINode &PN);
351 Instruction *FoldPHIArgBinOpIntoPHI(PHINode &PN);
354 Instruction *OptAndOp(Instruction *Op, ConstantInt *OpRHS,
355 ConstantInt *AndRHS, BinaryOperator &TheAnd);
357 Value *FoldLogicalPlusAnd(Value *LHS, Value *RHS, ConstantInt *Mask,
358 bool isSub, Instruction &I);
359 Instruction *InsertRangeTest(Value *V, Constant *Lo, Constant *Hi,
360 bool isSigned, bool Inside, Instruction &IB);
361 Instruction *PromoteCastOfAllocation(BitCastInst &CI, AllocationInst &AI);
362 Instruction *MatchBSwap(BinaryOperator &I);
363 bool SimplifyStoreAtEndOfBlock(StoreInst &SI);
365 Value *EvaluateInDifferentType(Value *V, const Type *Ty, bool isSigned);
368 char InstCombiner::ID = 0;
369 RegisterPass<InstCombiner> X("instcombine", "Combine redundant instructions");
372 // getComplexity: Assign a complexity or rank value to LLVM Values...
373 // 0 -> undef, 1 -> Const, 2 -> Other, 3 -> Arg, 3 -> Unary, 4 -> OtherInst
374 static unsigned getComplexity(Value *V) {
375 if (isa<Instruction>(V)) {
376 if (BinaryOperator::isNeg(V) || BinaryOperator::isNot(V))
380 if (isa<Argument>(V)) return 3;
381 return isa<Constant>(V) ? (isa<UndefValue>(V) ? 0 : 1) : 2;
384 // isOnlyUse - Return true if this instruction will be deleted if we stop using
386 static bool isOnlyUse(Value *V) {
387 return V->hasOneUse() || isa<Constant>(V);
390 // getPromotedType - Return the specified type promoted as it would be to pass
391 // though a va_arg area...
392 static const Type *getPromotedType(const Type *Ty) {
393 if (const IntegerType* ITy = dyn_cast<IntegerType>(Ty)) {
394 if (ITy->getBitWidth() < 32)
395 return Type::Int32Ty;
400 /// getBitCastOperand - If the specified operand is a CastInst or a constant
401 /// expression bitcast, return the operand value, otherwise return null.
402 static Value *getBitCastOperand(Value *V) {
403 if (BitCastInst *I = dyn_cast<BitCastInst>(V))
404 return I->getOperand(0);
405 else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V))
406 if (CE->getOpcode() == Instruction::BitCast)
407 return CE->getOperand(0);
411 /// This function is a wrapper around CastInst::isEliminableCastPair. It
412 /// simply extracts arguments and returns what that function returns.
413 static Instruction::CastOps
414 isEliminableCastPair(
415 const CastInst *CI, ///< The first cast instruction
416 unsigned opcode, ///< The opcode of the second cast instruction
417 const Type *DstTy, ///< The target type for the second cast instruction
418 TargetData *TD ///< The target data for pointer size
421 const Type *SrcTy = CI->getOperand(0)->getType(); // A from above
422 const Type *MidTy = CI->getType(); // B from above
424 // Get the opcodes of the two Cast instructions
425 Instruction::CastOps firstOp = Instruction::CastOps(CI->getOpcode());
426 Instruction::CastOps secondOp = Instruction::CastOps(opcode);
428 return Instruction::CastOps(
429 CastInst::isEliminableCastPair(firstOp, secondOp, SrcTy, MidTy,
430 DstTy, TD->getIntPtrType()));
433 /// ValueRequiresCast - Return true if the cast from "V to Ty" actually results
434 /// in any code being generated. It does not require codegen if V is simple
435 /// enough or if the cast can be folded into other casts.
436 static bool ValueRequiresCast(Instruction::CastOps opcode, const Value *V,
437 const Type *Ty, TargetData *TD) {
438 if (V->getType() == Ty || isa<Constant>(V)) return false;
440 // If this is another cast that can be eliminated, it isn't codegen either.
441 if (const CastInst *CI = dyn_cast<CastInst>(V))
442 if (isEliminableCastPair(CI, opcode, Ty, TD))
447 /// InsertOperandCastBefore - This inserts a cast of V to DestTy before the
448 /// InsertBefore instruction. This is specialized a bit to avoid inserting
449 /// casts that are known to not do anything...
451 Value *InstCombiner::InsertOperandCastBefore(Instruction::CastOps opcode,
452 Value *V, const Type *DestTy,
453 Instruction *InsertBefore) {
454 if (V->getType() == DestTy) return V;
455 if (Constant *C = dyn_cast<Constant>(V))
456 return ConstantExpr::getCast(opcode, C, DestTy);
458 return InsertCastBefore(opcode, V, DestTy, *InsertBefore);
461 // SimplifyCommutative - This performs a few simplifications for commutative
464 // 1. Order operands such that they are listed from right (least complex) to
465 // left (most complex). This puts constants before unary operators before
468 // 2. Transform: (op (op V, C1), C2) ==> (op V, (op C1, C2))
469 // 3. Transform: (op (op V1, C1), (op V2, C2)) ==> (op (op V1, V2), (op C1,C2))
471 bool InstCombiner::SimplifyCommutative(BinaryOperator &I) {
472 bool Changed = false;
473 if (getComplexity(I.getOperand(0)) < getComplexity(I.getOperand(1)))
474 Changed = !I.swapOperands();
476 if (!I.isAssociative()) return Changed;
477 Instruction::BinaryOps Opcode = I.getOpcode();
478 if (BinaryOperator *Op = dyn_cast<BinaryOperator>(I.getOperand(0)))
479 if (Op->getOpcode() == Opcode && isa<Constant>(Op->getOperand(1))) {
480 if (isa<Constant>(I.getOperand(1))) {
481 Constant *Folded = ConstantExpr::get(I.getOpcode(),
482 cast<Constant>(I.getOperand(1)),
483 cast<Constant>(Op->getOperand(1)));
484 I.setOperand(0, Op->getOperand(0));
485 I.setOperand(1, Folded);
487 } else if (BinaryOperator *Op1=dyn_cast<BinaryOperator>(I.getOperand(1)))
488 if (Op1->getOpcode() == Opcode && isa<Constant>(Op1->getOperand(1)) &&
489 isOnlyUse(Op) && isOnlyUse(Op1)) {
490 Constant *C1 = cast<Constant>(Op->getOperand(1));
491 Constant *C2 = cast<Constant>(Op1->getOperand(1));
493 // Fold (op (op V1, C1), (op V2, C2)) ==> (op (op V1, V2), (op C1,C2))
494 Constant *Folded = ConstantExpr::get(I.getOpcode(), C1, C2);
495 Instruction *New = BinaryOperator::create(Opcode, Op->getOperand(0),
499 I.setOperand(0, New);
500 I.setOperand(1, Folded);
507 /// SimplifyCompare - For a CmpInst this function just orders the operands
508 /// so that theyare listed from right (least complex) to left (most complex).
509 /// This puts constants before unary operators before binary operators.
510 bool InstCombiner::SimplifyCompare(CmpInst &I) {
511 if (getComplexity(I.getOperand(0)) >= getComplexity(I.getOperand(1)))
514 // Compare instructions are not associative so there's nothing else we can do.
518 // dyn_castNegVal - Given a 'sub' instruction, return the RHS of the instruction
519 // if the LHS is a constant zero (which is the 'negate' form).
521 static inline Value *dyn_castNegVal(Value *V) {
522 if (BinaryOperator::isNeg(V))
523 return BinaryOperator::getNegArgument(V);
525 // Constants can be considered to be negated values if they can be folded.
526 if (ConstantInt *C = dyn_cast<ConstantInt>(V))
527 return ConstantExpr::getNeg(C);
531 static inline Value *dyn_castNotVal(Value *V) {
532 if (BinaryOperator::isNot(V))
533 return BinaryOperator::getNotArgument(V);
535 // Constants can be considered to be not'ed values...
536 if (ConstantInt *C = dyn_cast<ConstantInt>(V))
537 return ConstantInt::get(~C->getValue());
541 // dyn_castFoldableMul - If this value is a multiply that can be folded into
542 // other computations (because it has a constant operand), return the
543 // non-constant operand of the multiply, and set CST to point to the multiplier.
544 // Otherwise, return null.
546 static inline Value *dyn_castFoldableMul(Value *V, ConstantInt *&CST) {
547 if (V->hasOneUse() && V->getType()->isInteger())
548 if (Instruction *I = dyn_cast<Instruction>(V)) {
549 if (I->getOpcode() == Instruction::Mul)
550 if ((CST = dyn_cast<ConstantInt>(I->getOperand(1))))
551 return I->getOperand(0);
552 if (I->getOpcode() == Instruction::Shl)
553 if ((CST = dyn_cast<ConstantInt>(I->getOperand(1)))) {
554 // The multiplier is really 1 << CST.
555 uint32_t BitWidth = cast<IntegerType>(V->getType())->getBitWidth();
556 uint32_t CSTVal = CST->getLimitedValue(BitWidth);
557 CST = ConstantInt::get(APInt(BitWidth, 1).shl(CSTVal));
558 return I->getOperand(0);
564 /// dyn_castGetElementPtr - If this is a getelementptr instruction or constant
565 /// expression, return it.
566 static User *dyn_castGetElementPtr(Value *V) {
567 if (isa<GetElementPtrInst>(V)) return cast<User>(V);
568 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V))
569 if (CE->getOpcode() == Instruction::GetElementPtr)
570 return cast<User>(V);
574 /// AddOne - Add one to a ConstantInt
575 static ConstantInt *AddOne(ConstantInt *C) {
576 APInt Val(C->getValue());
577 return ConstantInt::get(++Val);
579 /// SubOne - Subtract one from a ConstantInt
580 static ConstantInt *SubOne(ConstantInt *C) {
581 APInt Val(C->getValue());
582 return ConstantInt::get(--Val);
584 /// Add - Add two ConstantInts together
585 static ConstantInt *Add(ConstantInt *C1, ConstantInt *C2) {
586 return ConstantInt::get(C1->getValue() + C2->getValue());
588 /// And - Bitwise AND two ConstantInts together
589 static ConstantInt *And(ConstantInt *C1, ConstantInt *C2) {
590 return ConstantInt::get(C1->getValue() & C2->getValue());
592 /// Subtract - Subtract one ConstantInt from another
593 static ConstantInt *Subtract(ConstantInt *C1, ConstantInt *C2) {
594 return ConstantInt::get(C1->getValue() - C2->getValue());
596 /// Multiply - Multiply two ConstantInts together
597 static ConstantInt *Multiply(ConstantInt *C1, ConstantInt *C2) {
598 return ConstantInt::get(C1->getValue() * C2->getValue());
601 /// ComputeMaskedBits - Determine which of the bits specified in Mask are
602 /// known to be either zero or one and return them in the KnownZero/KnownOne
603 /// bit sets. This code only analyzes bits in Mask, in order to short-circuit
605 /// NOTE: we cannot consider 'undef' to be "IsZero" here. The problem is that
606 /// we cannot optimize based on the assumption that it is zero without changing
607 /// it to be an explicit zero. If we don't change it to zero, other code could
608 /// optimized based on the contradictory assumption that it is non-zero.
609 /// Because instcombine aggressively folds operations with undef args anyway,
610 /// this won't lose us code quality.
611 static void ComputeMaskedBits(Value *V, const APInt &Mask, APInt& KnownZero,
612 APInt& KnownOne, unsigned Depth = 0) {
613 assert(V && "No Value?");
614 assert(Depth <= 6 && "Limit Search Depth");
615 uint32_t BitWidth = Mask.getBitWidth();
616 assert(cast<IntegerType>(V->getType())->getBitWidth() == BitWidth &&
617 KnownZero.getBitWidth() == BitWidth &&
618 KnownOne.getBitWidth() == BitWidth &&
619 "V, Mask, KnownOne and KnownZero should have same BitWidth");
620 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
621 // We know all of the bits for a constant!
622 KnownOne = CI->getValue() & Mask;
623 KnownZero = ~KnownOne & Mask;
627 if (Depth == 6 || Mask == 0)
628 return; // Limit search depth.
630 Instruction *I = dyn_cast<Instruction>(V);
633 KnownZero.clear(); KnownOne.clear(); // Don't know anything.
634 APInt KnownZero2(KnownZero), KnownOne2(KnownOne);
636 switch (I->getOpcode()) {
637 case Instruction::And: {
638 // If either the LHS or the RHS are Zero, the result is zero.
639 ComputeMaskedBits(I->getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
640 APInt Mask2(Mask & ~KnownZero);
641 ComputeMaskedBits(I->getOperand(0), Mask2, KnownZero2, KnownOne2, Depth+1);
642 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
643 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
645 // Output known-1 bits are only known if set in both the LHS & RHS.
646 KnownOne &= KnownOne2;
647 // Output known-0 are known to be clear if zero in either the LHS | RHS.
648 KnownZero |= KnownZero2;
651 case Instruction::Or: {
652 ComputeMaskedBits(I->getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
653 APInt Mask2(Mask & ~KnownOne);
654 ComputeMaskedBits(I->getOperand(0), Mask2, KnownZero2, KnownOne2, Depth+1);
655 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
656 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
658 // Output known-0 bits are only known if clear in both the LHS & RHS.
659 KnownZero &= KnownZero2;
660 // Output known-1 are known to be set if set in either the LHS | RHS.
661 KnownOne |= KnownOne2;
664 case Instruction::Xor: {
665 ComputeMaskedBits(I->getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
666 ComputeMaskedBits(I->getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
667 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
668 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
670 // Output known-0 bits are known if clear or set in both the LHS & RHS.
671 APInt KnownZeroOut = (KnownZero & KnownZero2) | (KnownOne & KnownOne2);
672 // Output known-1 are known to be set if set in only one of the LHS, RHS.
673 KnownOne = (KnownZero & KnownOne2) | (KnownOne & KnownZero2);
674 KnownZero = KnownZeroOut;
677 case Instruction::Select:
678 ComputeMaskedBits(I->getOperand(2), Mask, KnownZero, KnownOne, Depth+1);
679 ComputeMaskedBits(I->getOperand(1), Mask, KnownZero2, KnownOne2, Depth+1);
680 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
681 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
683 // Only known if known in both the LHS and RHS.
684 KnownOne &= KnownOne2;
685 KnownZero &= KnownZero2;
687 case Instruction::FPTrunc:
688 case Instruction::FPExt:
689 case Instruction::FPToUI:
690 case Instruction::FPToSI:
691 case Instruction::SIToFP:
692 case Instruction::PtrToInt:
693 case Instruction::UIToFP:
694 case Instruction::IntToPtr:
695 return; // Can't work with floating point or pointers
696 case Instruction::Trunc: {
697 // All these have integer operands
698 uint32_t SrcBitWidth =
699 cast<IntegerType>(I->getOperand(0)->getType())->getBitWidth();
701 MaskIn.zext(SrcBitWidth);
702 KnownZero.zext(SrcBitWidth);
703 KnownOne.zext(SrcBitWidth);
704 ComputeMaskedBits(I->getOperand(0), MaskIn, KnownZero, KnownOne, Depth+1);
705 KnownZero.trunc(BitWidth);
706 KnownOne.trunc(BitWidth);
709 case Instruction::BitCast: {
710 const Type *SrcTy = I->getOperand(0)->getType();
711 if (SrcTy->isInteger()) {
712 ComputeMaskedBits(I->getOperand(0), Mask, KnownZero, KnownOne, Depth+1);
717 case Instruction::ZExt: {
718 // Compute the bits in the result that are not present in the input.
719 const IntegerType *SrcTy = cast<IntegerType>(I->getOperand(0)->getType());
720 uint32_t SrcBitWidth = SrcTy->getBitWidth();
723 MaskIn.trunc(SrcBitWidth);
724 KnownZero.trunc(SrcBitWidth);
725 KnownOne.trunc(SrcBitWidth);
726 ComputeMaskedBits(I->getOperand(0), MaskIn, KnownZero, KnownOne, Depth+1);
727 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
728 // The top bits are known to be zero.
729 KnownZero.zext(BitWidth);
730 KnownOne.zext(BitWidth);
731 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth);
734 case Instruction::SExt: {
735 // Compute the bits in the result that are not present in the input.
736 const IntegerType *SrcTy = cast<IntegerType>(I->getOperand(0)->getType());
737 uint32_t SrcBitWidth = SrcTy->getBitWidth();
740 MaskIn.trunc(SrcBitWidth);
741 KnownZero.trunc(SrcBitWidth);
742 KnownOne.trunc(SrcBitWidth);
743 ComputeMaskedBits(I->getOperand(0), MaskIn, KnownZero, KnownOne, Depth+1);
744 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
745 KnownZero.zext(BitWidth);
746 KnownOne.zext(BitWidth);
748 // If the sign bit of the input is known set or clear, then we know the
749 // top bits of the result.
750 if (KnownZero[SrcBitWidth-1]) // Input sign bit known zero
751 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth);
752 else if (KnownOne[SrcBitWidth-1]) // Input sign bit known set
753 KnownOne |= APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth);
756 case Instruction::Shl:
757 // (shl X, C1) & C2 == 0 iff (X & C2 >>u C1) == 0
758 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
759 uint64_t ShiftAmt = SA->getLimitedValue(BitWidth);
760 APInt Mask2(Mask.lshr(ShiftAmt));
761 ComputeMaskedBits(I->getOperand(0), Mask2, KnownZero, KnownOne, Depth+1);
762 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
763 KnownZero <<= ShiftAmt;
764 KnownOne <<= ShiftAmt;
765 KnownZero |= APInt::getLowBitsSet(BitWidth, ShiftAmt); // low bits known 0
769 case Instruction::LShr:
770 // (ushr X, C1) & C2 == 0 iff (-1 >> C1) & C2 == 0
771 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
772 // Compute the new bits that are at the top now.
773 uint64_t ShiftAmt = SA->getLimitedValue(BitWidth);
775 // Unsigned shift right.
776 APInt Mask2(Mask.shl(ShiftAmt));
777 ComputeMaskedBits(I->getOperand(0), Mask2, KnownZero,KnownOne,Depth+1);
778 assert((KnownZero & KnownOne) == 0&&"Bits known to be one AND zero?");
779 KnownZero = APIntOps::lshr(KnownZero, ShiftAmt);
780 KnownOne = APIntOps::lshr(KnownOne, ShiftAmt);
781 // high bits known zero.
782 KnownZero |= APInt::getHighBitsSet(BitWidth, ShiftAmt);
786 case Instruction::AShr:
787 // (ashr X, C1) & C2 == 0 iff (-1 >> C1) & C2 == 0
788 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
789 // Compute the new bits that are at the top now.
790 uint64_t ShiftAmt = SA->getLimitedValue(BitWidth);
792 // Signed shift right.
793 APInt Mask2(Mask.shl(ShiftAmt));
794 ComputeMaskedBits(I->getOperand(0), Mask2, KnownZero,KnownOne,Depth+1);
795 assert((KnownZero & KnownOne) == 0&&"Bits known to be one AND zero?");
796 KnownZero = APIntOps::lshr(KnownZero, ShiftAmt);
797 KnownOne = APIntOps::lshr(KnownOne, ShiftAmt);
799 APInt HighBits(APInt::getHighBitsSet(BitWidth, ShiftAmt));
800 if (KnownZero[BitWidth-ShiftAmt-1]) // New bits are known zero.
801 KnownZero |= HighBits;
802 else if (KnownOne[BitWidth-ShiftAmt-1]) // New bits are known one.
803 KnownOne |= HighBits;
810 /// MaskedValueIsZero - Return true if 'V & Mask' is known to be zero. We use
811 /// this predicate to simplify operations downstream. Mask is known to be zero
812 /// for bits that V cannot have.
813 static bool MaskedValueIsZero(Value *V, const APInt& Mask, unsigned Depth = 0) {
814 APInt KnownZero(Mask.getBitWidth(), 0), KnownOne(Mask.getBitWidth(), 0);
815 ComputeMaskedBits(V, Mask, KnownZero, KnownOne, Depth);
816 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
817 return (KnownZero & Mask) == Mask;
820 /// ShrinkDemandedConstant - Check to see if the specified operand of the
821 /// specified instruction is a constant integer. If so, check to see if there
822 /// are any bits set in the constant that are not demanded. If so, shrink the
823 /// constant and return true.
824 static bool ShrinkDemandedConstant(Instruction *I, unsigned OpNo,
826 assert(I && "No instruction?");
827 assert(OpNo < I->getNumOperands() && "Operand index too large");
829 // If the operand is not a constant integer, nothing to do.
830 ConstantInt *OpC = dyn_cast<ConstantInt>(I->getOperand(OpNo));
831 if (!OpC) return false;
833 // If there are no bits set that aren't demanded, nothing to do.
834 Demanded.zextOrTrunc(OpC->getValue().getBitWidth());
835 if ((~Demanded & OpC->getValue()) == 0)
838 // This instruction is producing bits that are not demanded. Shrink the RHS.
839 Demanded &= OpC->getValue();
840 I->setOperand(OpNo, ConstantInt::get(Demanded));
844 // ComputeSignedMinMaxValuesFromKnownBits - Given a signed integer type and a
845 // set of known zero and one bits, compute the maximum and minimum values that
846 // could have the specified known zero and known one bits, returning them in
848 static void ComputeSignedMinMaxValuesFromKnownBits(const Type *Ty,
849 const APInt& KnownZero,
850 const APInt& KnownOne,
851 APInt& Min, APInt& Max) {
852 uint32_t BitWidth = cast<IntegerType>(Ty)->getBitWidth();
853 assert(KnownZero.getBitWidth() == BitWidth &&
854 KnownOne.getBitWidth() == BitWidth &&
855 Min.getBitWidth() == BitWidth && Max.getBitWidth() == BitWidth &&
856 "Ty, KnownZero, KnownOne and Min, Max must have equal bitwidth.");
857 APInt UnknownBits = ~(KnownZero|KnownOne);
859 // The minimum value is when all unknown bits are zeros, EXCEPT for the sign
860 // bit if it is unknown.
862 Max = KnownOne|UnknownBits;
864 if (UnknownBits[BitWidth-1]) { // Sign bit is unknown
866 Max.clear(BitWidth-1);
870 // ComputeUnsignedMinMaxValuesFromKnownBits - Given an unsigned integer type and
871 // a set of known zero and one bits, compute the maximum and minimum values that
872 // could have the specified known zero and known one bits, returning them in
874 static void ComputeUnsignedMinMaxValuesFromKnownBits(const Type *Ty,
875 const APInt &KnownZero,
876 const APInt &KnownOne,
877 APInt &Min, APInt &Max) {
878 uint32_t BitWidth = cast<IntegerType>(Ty)->getBitWidth(); BitWidth = BitWidth;
879 assert(KnownZero.getBitWidth() == BitWidth &&
880 KnownOne.getBitWidth() == BitWidth &&
881 Min.getBitWidth() == BitWidth && Max.getBitWidth() &&
882 "Ty, KnownZero, KnownOne and Min, Max must have equal bitwidth.");
883 APInt UnknownBits = ~(KnownZero|KnownOne);
885 // The minimum value is when the unknown bits are all zeros.
887 // The maximum value is when the unknown bits are all ones.
888 Max = KnownOne|UnknownBits;
891 /// SimplifyDemandedBits - This function attempts to replace V with a simpler
892 /// value based on the demanded bits. When this function is called, it is known
893 /// that only the bits set in DemandedMask of the result of V are ever used
894 /// downstream. Consequently, depending on the mask and V, it may be possible
895 /// to replace V with a constant or one of its operands. In such cases, this
896 /// function does the replacement and returns true. In all other cases, it
897 /// returns false after analyzing the expression and setting KnownOne and known
898 /// to be one in the expression. KnownZero contains all the bits that are known
899 /// to be zero in the expression. These are provided to potentially allow the
900 /// caller (which might recursively be SimplifyDemandedBits itself) to simplify
901 /// the expression. KnownOne and KnownZero always follow the invariant that
902 /// KnownOne & KnownZero == 0. That is, a bit can't be both 1 and 0. Note that
903 /// the bits in KnownOne and KnownZero may only be accurate for those bits set
904 /// in DemandedMask. Note also that the bitwidth of V, DemandedMask, KnownZero
905 /// and KnownOne must all be the same.
906 bool InstCombiner::SimplifyDemandedBits(Value *V, APInt DemandedMask,
907 APInt& KnownZero, APInt& KnownOne,
909 assert(V != 0 && "Null pointer of Value???");
910 assert(Depth <= 6 && "Limit Search Depth");
911 uint32_t BitWidth = DemandedMask.getBitWidth();
912 const IntegerType *VTy = cast<IntegerType>(V->getType());
913 assert(VTy->getBitWidth() == BitWidth &&
914 KnownZero.getBitWidth() == BitWidth &&
915 KnownOne.getBitWidth() == BitWidth &&
916 "Value *V, DemandedMask, KnownZero and KnownOne \
917 must have same BitWidth");
918 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
919 // We know all of the bits for a constant!
920 KnownOne = CI->getValue() & DemandedMask;
921 KnownZero = ~KnownOne & DemandedMask;
927 if (!V->hasOneUse()) { // Other users may use these bits.
928 if (Depth != 0) { // Not at the root.
929 // Just compute the KnownZero/KnownOne bits to simplify things downstream.
930 ComputeMaskedBits(V, DemandedMask, KnownZero, KnownOne, Depth);
933 // If this is the root being simplified, allow it to have multiple uses,
934 // just set the DemandedMask to all bits.
935 DemandedMask = APInt::getAllOnesValue(BitWidth);
936 } else if (DemandedMask == 0) { // Not demanding any bits from V.
937 if (V != UndefValue::get(VTy))
938 return UpdateValueUsesWith(V, UndefValue::get(VTy));
940 } else if (Depth == 6) { // Limit search depth.
944 Instruction *I = dyn_cast<Instruction>(V);
945 if (!I) return false; // Only analyze instructions.
947 APInt LHSKnownZero(BitWidth, 0), LHSKnownOne(BitWidth, 0);
948 APInt &RHSKnownZero = KnownZero, &RHSKnownOne = KnownOne;
949 switch (I->getOpcode()) {
951 case Instruction::And:
952 // If either the LHS or the RHS are Zero, the result is zero.
953 if (SimplifyDemandedBits(I->getOperand(1), DemandedMask,
954 RHSKnownZero, RHSKnownOne, Depth+1))
956 assert((RHSKnownZero & RHSKnownOne) == 0 &&
957 "Bits known to be one AND zero?");
959 // If something is known zero on the RHS, the bits aren't demanded on the
961 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask & ~RHSKnownZero,
962 LHSKnownZero, LHSKnownOne, Depth+1))
964 assert((LHSKnownZero & LHSKnownOne) == 0 &&
965 "Bits known to be one AND zero?");
967 // If all of the demanded bits are known 1 on one side, return the other.
968 // These bits cannot contribute to the result of the 'and'.
969 if ((DemandedMask & ~LHSKnownZero & RHSKnownOne) ==
970 (DemandedMask & ~LHSKnownZero))
971 return UpdateValueUsesWith(I, I->getOperand(0));
972 if ((DemandedMask & ~RHSKnownZero & LHSKnownOne) ==
973 (DemandedMask & ~RHSKnownZero))
974 return UpdateValueUsesWith(I, I->getOperand(1));
976 // If all of the demanded bits in the inputs are known zeros, return zero.
977 if ((DemandedMask & (RHSKnownZero|LHSKnownZero)) == DemandedMask)
978 return UpdateValueUsesWith(I, Constant::getNullValue(VTy));
980 // If the RHS is a constant, see if we can simplify it.
981 if (ShrinkDemandedConstant(I, 1, DemandedMask & ~LHSKnownZero))
982 return UpdateValueUsesWith(I, I);
984 // Output known-1 bits are only known if set in both the LHS & RHS.
985 RHSKnownOne &= LHSKnownOne;
986 // Output known-0 are known to be clear if zero in either the LHS | RHS.
987 RHSKnownZero |= LHSKnownZero;
989 case Instruction::Or:
990 // If either the LHS or the RHS are One, the result is One.
991 if (SimplifyDemandedBits(I->getOperand(1), DemandedMask,
992 RHSKnownZero, RHSKnownOne, Depth+1))
994 assert((RHSKnownZero & RHSKnownOne) == 0 &&
995 "Bits known to be one AND zero?");
996 // If something is known one on the RHS, the bits aren't demanded on the
998 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask & ~RHSKnownOne,
999 LHSKnownZero, LHSKnownOne, Depth+1))
1001 assert((LHSKnownZero & LHSKnownOne) == 0 &&
1002 "Bits known to be one AND zero?");
1004 // If all of the demanded bits are known zero on one side, return the other.
1005 // These bits cannot contribute to the result of the 'or'.
1006 if ((DemandedMask & ~LHSKnownOne & RHSKnownZero) ==
1007 (DemandedMask & ~LHSKnownOne))
1008 return UpdateValueUsesWith(I, I->getOperand(0));
1009 if ((DemandedMask & ~RHSKnownOne & LHSKnownZero) ==
1010 (DemandedMask & ~RHSKnownOne))
1011 return UpdateValueUsesWith(I, I->getOperand(1));
1013 // If all of the potentially set bits on one side are known to be set on
1014 // the other side, just use the 'other' side.
1015 if ((DemandedMask & (~RHSKnownZero) & LHSKnownOne) ==
1016 (DemandedMask & (~RHSKnownZero)))
1017 return UpdateValueUsesWith(I, I->getOperand(0));
1018 if ((DemandedMask & (~LHSKnownZero) & RHSKnownOne) ==
1019 (DemandedMask & (~LHSKnownZero)))
1020 return UpdateValueUsesWith(I, I->getOperand(1));
1022 // If the RHS is a constant, see if we can simplify it.
1023 if (ShrinkDemandedConstant(I, 1, DemandedMask))
1024 return UpdateValueUsesWith(I, I);
1026 // Output known-0 bits are only known if clear in both the LHS & RHS.
1027 RHSKnownZero &= LHSKnownZero;
1028 // Output known-1 are known to be set if set in either the LHS | RHS.
1029 RHSKnownOne |= LHSKnownOne;
1031 case Instruction::Xor: {
1032 if (SimplifyDemandedBits(I->getOperand(1), DemandedMask,
1033 RHSKnownZero, RHSKnownOne, Depth+1))
1035 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1036 "Bits known to be one AND zero?");
1037 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask,
1038 LHSKnownZero, LHSKnownOne, Depth+1))
1040 assert((LHSKnownZero & LHSKnownOne) == 0 &&
1041 "Bits known to be one AND zero?");
1043 // If all of the demanded bits are known zero on one side, return the other.
1044 // These bits cannot contribute to the result of the 'xor'.
1045 if ((DemandedMask & RHSKnownZero) == DemandedMask)
1046 return UpdateValueUsesWith(I, I->getOperand(0));
1047 if ((DemandedMask & LHSKnownZero) == DemandedMask)
1048 return UpdateValueUsesWith(I, I->getOperand(1));
1050 // Output known-0 bits are known if clear or set in both the LHS & RHS.
1051 APInt KnownZeroOut = (RHSKnownZero & LHSKnownZero) |
1052 (RHSKnownOne & LHSKnownOne);
1053 // Output known-1 are known to be set if set in only one of the LHS, RHS.
1054 APInt KnownOneOut = (RHSKnownZero & LHSKnownOne) |
1055 (RHSKnownOne & LHSKnownZero);
1057 // If all of the demanded bits are known to be zero on one side or the
1058 // other, turn this into an *inclusive* or.
1059 // e.g. (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
1060 if ((DemandedMask & ~RHSKnownZero & ~LHSKnownZero) == 0) {
1062 BinaryOperator::createOr(I->getOperand(0), I->getOperand(1),
1064 InsertNewInstBefore(Or, *I);
1065 return UpdateValueUsesWith(I, Or);
1068 // If all of the demanded bits on one side are known, and all of the set
1069 // bits on that side are also known to be set on the other side, turn this
1070 // into an AND, as we know the bits will be cleared.
1071 // e.g. (X | C1) ^ C2 --> (X | C1) & ~C2 iff (C1&C2) == C2
1072 if ((DemandedMask & (RHSKnownZero|RHSKnownOne)) == DemandedMask) {
1074 if ((RHSKnownOne & LHSKnownOne) == RHSKnownOne) {
1075 Constant *AndC = ConstantInt::get(~RHSKnownOne & DemandedMask);
1077 BinaryOperator::createAnd(I->getOperand(0), AndC, "tmp");
1078 InsertNewInstBefore(And, *I);
1079 return UpdateValueUsesWith(I, And);
1083 // If the RHS is a constant, see if we can simplify it.
1084 // FIXME: for XOR, we prefer to force bits to 1 if they will make a -1.
1085 if (ShrinkDemandedConstant(I, 1, DemandedMask))
1086 return UpdateValueUsesWith(I, I);
1088 RHSKnownZero = KnownZeroOut;
1089 RHSKnownOne = KnownOneOut;
1092 case Instruction::Select:
1093 if (SimplifyDemandedBits(I->getOperand(2), DemandedMask,
1094 RHSKnownZero, RHSKnownOne, Depth+1))
1096 if (SimplifyDemandedBits(I->getOperand(1), DemandedMask,
1097 LHSKnownZero, LHSKnownOne, Depth+1))
1099 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1100 "Bits known to be one AND zero?");
1101 assert((LHSKnownZero & LHSKnownOne) == 0 &&
1102 "Bits known to be one AND zero?");
1104 // If the operands are constants, see if we can simplify them.
1105 if (ShrinkDemandedConstant(I, 1, DemandedMask))
1106 return UpdateValueUsesWith(I, I);
1107 if (ShrinkDemandedConstant(I, 2, DemandedMask))
1108 return UpdateValueUsesWith(I, I);
1110 // Only known if known in both the LHS and RHS.
1111 RHSKnownOne &= LHSKnownOne;
1112 RHSKnownZero &= LHSKnownZero;
1114 case Instruction::Trunc: {
1116 cast<IntegerType>(I->getOperand(0)->getType())->getBitWidth();
1117 DemandedMask.zext(truncBf);
1118 RHSKnownZero.zext(truncBf);
1119 RHSKnownOne.zext(truncBf);
1120 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask,
1121 RHSKnownZero, RHSKnownOne, Depth+1))
1123 DemandedMask.trunc(BitWidth);
1124 RHSKnownZero.trunc(BitWidth);
1125 RHSKnownOne.trunc(BitWidth);
1126 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1127 "Bits known to be one AND zero?");
1130 case Instruction::BitCast:
1131 if (!I->getOperand(0)->getType()->isInteger())
1134 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask,
1135 RHSKnownZero, RHSKnownOne, Depth+1))
1137 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1138 "Bits known to be one AND zero?");
1140 case Instruction::ZExt: {
1141 // Compute the bits in the result that are not present in the input.
1142 const IntegerType *SrcTy = cast<IntegerType>(I->getOperand(0)->getType());
1143 uint32_t SrcBitWidth = SrcTy->getBitWidth();
1145 DemandedMask.trunc(SrcBitWidth);
1146 RHSKnownZero.trunc(SrcBitWidth);
1147 RHSKnownOne.trunc(SrcBitWidth);
1148 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask,
1149 RHSKnownZero, RHSKnownOne, Depth+1))
1151 DemandedMask.zext(BitWidth);
1152 RHSKnownZero.zext(BitWidth);
1153 RHSKnownOne.zext(BitWidth);
1154 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1155 "Bits known to be one AND zero?");
1156 // The top bits are known to be zero.
1157 RHSKnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth);
1160 case Instruction::SExt: {
1161 // Compute the bits in the result that are not present in the input.
1162 const IntegerType *SrcTy = cast<IntegerType>(I->getOperand(0)->getType());
1163 uint32_t SrcBitWidth = SrcTy->getBitWidth();
1165 APInt InputDemandedBits = DemandedMask &
1166 APInt::getLowBitsSet(BitWidth, SrcBitWidth);
1168 APInt NewBits(APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth));
1169 // If any of the sign extended bits are demanded, we know that the sign
1171 if ((NewBits & DemandedMask) != 0)
1172 InputDemandedBits.set(SrcBitWidth-1);
1174 InputDemandedBits.trunc(SrcBitWidth);
1175 RHSKnownZero.trunc(SrcBitWidth);
1176 RHSKnownOne.trunc(SrcBitWidth);
1177 if (SimplifyDemandedBits(I->getOperand(0), InputDemandedBits,
1178 RHSKnownZero, RHSKnownOne, Depth+1))
1180 InputDemandedBits.zext(BitWidth);
1181 RHSKnownZero.zext(BitWidth);
1182 RHSKnownOne.zext(BitWidth);
1183 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1184 "Bits known to be one AND zero?");
1186 // If the sign bit of the input is known set or clear, then we know the
1187 // top bits of the result.
1189 // If the input sign bit is known zero, or if the NewBits are not demanded
1190 // convert this into a zero extension.
1191 if (RHSKnownZero[SrcBitWidth-1] || (NewBits & ~DemandedMask) == NewBits)
1193 // Convert to ZExt cast
1194 CastInst *NewCast = new ZExtInst(I->getOperand(0), VTy, I->getName(), I);
1195 return UpdateValueUsesWith(I, NewCast);
1196 } else if (RHSKnownOne[SrcBitWidth-1]) { // Input sign bit known set
1197 RHSKnownOne |= NewBits;
1201 case Instruction::Add: {
1202 // Figure out what the input bits are. If the top bits of the and result
1203 // are not demanded, then the add doesn't demand them from its input
1205 uint32_t NLZ = DemandedMask.countLeadingZeros();
1207 // If there is a constant on the RHS, there are a variety of xformations
1209 if (ConstantInt *RHS = dyn_cast<ConstantInt>(I->getOperand(1))) {
1210 // If null, this should be simplified elsewhere. Some of the xforms here
1211 // won't work if the RHS is zero.
1215 // If the top bit of the output is demanded, demand everything from the
1216 // input. Otherwise, we demand all the input bits except NLZ top bits.
1217 APInt InDemandedBits(APInt::getLowBitsSet(BitWidth, BitWidth - NLZ));
1219 // Find information about known zero/one bits in the input.
1220 if (SimplifyDemandedBits(I->getOperand(0), InDemandedBits,
1221 LHSKnownZero, LHSKnownOne, Depth+1))
1224 // If the RHS of the add has bits set that can't affect the input, reduce
1226 if (ShrinkDemandedConstant(I, 1, InDemandedBits))
1227 return UpdateValueUsesWith(I, I);
1229 // Avoid excess work.
1230 if (LHSKnownZero == 0 && LHSKnownOne == 0)
1233 // Turn it into OR if input bits are zero.
1234 if ((LHSKnownZero & RHS->getValue()) == RHS->getValue()) {
1236 BinaryOperator::createOr(I->getOperand(0), I->getOperand(1),
1238 InsertNewInstBefore(Or, *I);
1239 return UpdateValueUsesWith(I, Or);
1242 // We can say something about the output known-zero and known-one bits,
1243 // depending on potential carries from the input constant and the
1244 // unknowns. For example if the LHS is known to have at most the 0x0F0F0
1245 // bits set and the RHS constant is 0x01001, then we know we have a known
1246 // one mask of 0x00001 and a known zero mask of 0xE0F0E.
1248 // To compute this, we first compute the potential carry bits. These are
1249 // the bits which may be modified. I'm not aware of a better way to do
1251 const APInt& RHSVal = RHS->getValue();
1252 APInt CarryBits((~LHSKnownZero + RHSVal) ^ (~LHSKnownZero ^ RHSVal));
1254 // Now that we know which bits have carries, compute the known-1/0 sets.
1256 // Bits are known one if they are known zero in one operand and one in the
1257 // other, and there is no input carry.
1258 RHSKnownOne = ((LHSKnownZero & RHSVal) |
1259 (LHSKnownOne & ~RHSVal)) & ~CarryBits;
1261 // Bits are known zero if they are known zero in both operands and there
1262 // is no input carry.
1263 RHSKnownZero = LHSKnownZero & ~RHSVal & ~CarryBits;
1265 // If the high-bits of this ADD are not demanded, then it does not demand
1266 // the high bits of its LHS or RHS.
1267 if (DemandedMask[BitWidth-1] == 0) {
1268 // Right fill the mask of bits for this ADD to demand the most
1269 // significant bit and all those below it.
1270 APInt DemandedFromOps(APInt::getLowBitsSet(BitWidth, BitWidth-NLZ));
1271 if (SimplifyDemandedBits(I->getOperand(0), DemandedFromOps,
1272 LHSKnownZero, LHSKnownOne, Depth+1))
1274 if (SimplifyDemandedBits(I->getOperand(1), DemandedFromOps,
1275 LHSKnownZero, LHSKnownOne, Depth+1))
1281 case Instruction::Sub:
1282 // If the high-bits of this SUB are not demanded, then it does not demand
1283 // the high bits of its LHS or RHS.
1284 if (DemandedMask[BitWidth-1] == 0) {
1285 // Right fill the mask of bits for this SUB to demand the most
1286 // significant bit and all those below it.
1287 uint32_t NLZ = DemandedMask.countLeadingZeros();
1288 APInt DemandedFromOps(APInt::getLowBitsSet(BitWidth, BitWidth-NLZ));
1289 if (SimplifyDemandedBits(I->getOperand(0), DemandedFromOps,
1290 LHSKnownZero, LHSKnownOne, Depth+1))
1292 if (SimplifyDemandedBits(I->getOperand(1), DemandedFromOps,
1293 LHSKnownZero, LHSKnownOne, Depth+1))
1297 case Instruction::Shl:
1298 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
1299 uint64_t ShiftAmt = SA->getLimitedValue(BitWidth);
1300 APInt DemandedMaskIn(DemandedMask.lshr(ShiftAmt));
1301 if (SimplifyDemandedBits(I->getOperand(0), DemandedMaskIn,
1302 RHSKnownZero, RHSKnownOne, Depth+1))
1304 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1305 "Bits known to be one AND zero?");
1306 RHSKnownZero <<= ShiftAmt;
1307 RHSKnownOne <<= ShiftAmt;
1308 // low bits known zero.
1310 RHSKnownZero |= APInt::getLowBitsSet(BitWidth, ShiftAmt);
1313 case Instruction::LShr:
1314 // For a logical shift right
1315 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
1316 uint64_t ShiftAmt = SA->getLimitedValue(BitWidth);
1318 // Unsigned shift right.
1319 APInt DemandedMaskIn(DemandedMask.shl(ShiftAmt));
1320 if (SimplifyDemandedBits(I->getOperand(0), DemandedMaskIn,
1321 RHSKnownZero, RHSKnownOne, Depth+1))
1323 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1324 "Bits known to be one AND zero?");
1325 RHSKnownZero = APIntOps::lshr(RHSKnownZero, ShiftAmt);
1326 RHSKnownOne = APIntOps::lshr(RHSKnownOne, ShiftAmt);
1328 // Compute the new bits that are at the top now.
1329 APInt HighBits(APInt::getHighBitsSet(BitWidth, ShiftAmt));
1330 RHSKnownZero |= HighBits; // high bits known zero.
1334 case Instruction::AShr:
1335 // If this is an arithmetic shift right and only the low-bit is set, we can
1336 // always convert this into a logical shr, even if the shift amount is
1337 // variable. The low bit of the shift cannot be an input sign bit unless
1338 // the shift amount is >= the size of the datatype, which is undefined.
1339 if (DemandedMask == 1) {
1340 // Perform the logical shift right.
1341 Value *NewVal = BinaryOperator::createLShr(
1342 I->getOperand(0), I->getOperand(1), I->getName());
1343 InsertNewInstBefore(cast<Instruction>(NewVal), *I);
1344 return UpdateValueUsesWith(I, NewVal);
1347 // If the sign bit is the only bit demanded by this ashr, then there is no
1348 // need to do it, the shift doesn't change the high bit.
1349 if (DemandedMask.isSignBit())
1350 return UpdateValueUsesWith(I, I->getOperand(0));
1352 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
1353 uint32_t ShiftAmt = SA->getLimitedValue(BitWidth);
1355 // Signed shift right.
1356 APInt DemandedMaskIn(DemandedMask.shl(ShiftAmt));
1357 // If any of the "high bits" are demanded, we should set the sign bit as
1359 if (DemandedMask.countLeadingZeros() <= ShiftAmt)
1360 DemandedMaskIn.set(BitWidth-1);
1361 if (SimplifyDemandedBits(I->getOperand(0),
1363 RHSKnownZero, RHSKnownOne, Depth+1))
1365 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1366 "Bits known to be one AND zero?");
1367 // Compute the new bits that are at the top now.
1368 APInt HighBits(APInt::getHighBitsSet(BitWidth, ShiftAmt));
1369 RHSKnownZero = APIntOps::lshr(RHSKnownZero, ShiftAmt);
1370 RHSKnownOne = APIntOps::lshr(RHSKnownOne, ShiftAmt);
1372 // Handle the sign bits.
1373 APInt SignBit(APInt::getSignBit(BitWidth));
1374 // Adjust to where it is now in the mask.
1375 SignBit = APIntOps::lshr(SignBit, ShiftAmt);
1377 // If the input sign bit is known to be zero, or if none of the top bits
1378 // are demanded, turn this into an unsigned shift right.
1379 if (RHSKnownZero[BitWidth-ShiftAmt-1] ||
1380 (HighBits & ~DemandedMask) == HighBits) {
1381 // Perform the logical shift right.
1382 Value *NewVal = BinaryOperator::createLShr(
1383 I->getOperand(0), SA, I->getName());
1384 InsertNewInstBefore(cast<Instruction>(NewVal), *I);
1385 return UpdateValueUsesWith(I, NewVal);
1386 } else if ((RHSKnownOne & SignBit) != 0) { // New bits are known one.
1387 RHSKnownOne |= HighBits;
1393 // If the client is only demanding bits that we know, return the known
1395 if ((DemandedMask & (RHSKnownZero|RHSKnownOne)) == DemandedMask)
1396 return UpdateValueUsesWith(I, ConstantInt::get(RHSKnownOne));
1401 /// SimplifyDemandedVectorElts - The specified value producecs a vector with
1402 /// 64 or fewer elements. DemandedElts contains the set of elements that are
1403 /// actually used by the caller. This method analyzes which elements of the
1404 /// operand are undef and returns that information in UndefElts.
1406 /// If the information about demanded elements can be used to simplify the
1407 /// operation, the operation is simplified, then the resultant value is
1408 /// returned. This returns null if no change was made.
1409 Value *InstCombiner::SimplifyDemandedVectorElts(Value *V, uint64_t DemandedElts,
1410 uint64_t &UndefElts,
1412 unsigned VWidth = cast<VectorType>(V->getType())->getNumElements();
1413 assert(VWidth <= 64 && "Vector too wide to analyze!");
1414 uint64_t EltMask = ~0ULL >> (64-VWidth);
1415 assert(DemandedElts != EltMask && (DemandedElts & ~EltMask) == 0 &&
1416 "Invalid DemandedElts!");
1418 if (isa<UndefValue>(V)) {
1419 // If the entire vector is undefined, just return this info.
1420 UndefElts = EltMask;
1422 } else if (DemandedElts == 0) { // If nothing is demanded, provide undef.
1423 UndefElts = EltMask;
1424 return UndefValue::get(V->getType());
1428 if (ConstantVector *CP = dyn_cast<ConstantVector>(V)) {
1429 const Type *EltTy = cast<VectorType>(V->getType())->getElementType();
1430 Constant *Undef = UndefValue::get(EltTy);
1432 std::vector<Constant*> Elts;
1433 for (unsigned i = 0; i != VWidth; ++i)
1434 if (!(DemandedElts & (1ULL << i))) { // If not demanded, set to undef.
1435 Elts.push_back(Undef);
1436 UndefElts |= (1ULL << i);
1437 } else if (isa<UndefValue>(CP->getOperand(i))) { // Already undef.
1438 Elts.push_back(Undef);
1439 UndefElts |= (1ULL << i);
1440 } else { // Otherwise, defined.
1441 Elts.push_back(CP->getOperand(i));
1444 // If we changed the constant, return it.
1445 Constant *NewCP = ConstantVector::get(Elts);
1446 return NewCP != CP ? NewCP : 0;
1447 } else if (isa<ConstantAggregateZero>(V)) {
1448 // Simplify the CAZ to a ConstantVector where the non-demanded elements are
1450 const Type *EltTy = cast<VectorType>(V->getType())->getElementType();
1451 Constant *Zero = Constant::getNullValue(EltTy);
1452 Constant *Undef = UndefValue::get(EltTy);
1453 std::vector<Constant*> Elts;
1454 for (unsigned i = 0; i != VWidth; ++i)
1455 Elts.push_back((DemandedElts & (1ULL << i)) ? Zero : Undef);
1456 UndefElts = DemandedElts ^ EltMask;
1457 return ConstantVector::get(Elts);
1460 if (!V->hasOneUse()) { // Other users may use these bits.
1461 if (Depth != 0) { // Not at the root.
1462 // TODO: Just compute the UndefElts information recursively.
1466 } else if (Depth == 10) { // Limit search depth.
1470 Instruction *I = dyn_cast<Instruction>(V);
1471 if (!I) return false; // Only analyze instructions.
1473 bool MadeChange = false;
1474 uint64_t UndefElts2;
1476 switch (I->getOpcode()) {
1479 case Instruction::InsertElement: {
1480 // If this is a variable index, we don't know which element it overwrites.
1481 // demand exactly the same input as we produce.
1482 ConstantInt *Idx = dyn_cast<ConstantInt>(I->getOperand(2));
1484 // Note that we can't propagate undef elt info, because we don't know
1485 // which elt is getting updated.
1486 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), DemandedElts,
1487 UndefElts2, Depth+1);
1488 if (TmpV) { I->setOperand(0, TmpV); MadeChange = true; }
1492 // If this is inserting an element that isn't demanded, remove this
1494 unsigned IdxNo = Idx->getZExtValue();
1495 if (IdxNo >= VWidth || (DemandedElts & (1ULL << IdxNo)) == 0)
1496 return AddSoonDeadInstToWorklist(*I, 0);
1498 // Otherwise, the element inserted overwrites whatever was there, so the
1499 // input demanded set is simpler than the output set.
1500 TmpV = SimplifyDemandedVectorElts(I->getOperand(0),
1501 DemandedElts & ~(1ULL << IdxNo),
1502 UndefElts, Depth+1);
1503 if (TmpV) { I->setOperand(0, TmpV); MadeChange = true; }
1505 // The inserted element is defined.
1506 UndefElts |= 1ULL << IdxNo;
1509 case Instruction::BitCast: {
1510 // Vector->vector casts only.
1511 const VectorType *VTy = dyn_cast<VectorType>(I->getOperand(0)->getType());
1513 unsigned InVWidth = VTy->getNumElements();
1514 uint64_t InputDemandedElts = 0;
1517 if (VWidth == InVWidth) {
1518 // If we are converting from <4 x i32> -> <4 x f32>, we demand the same
1519 // elements as are demanded of us.
1521 InputDemandedElts = DemandedElts;
1522 } else if (VWidth > InVWidth) {
1526 // If there are more elements in the result than there are in the source,
1527 // then an input element is live if any of the corresponding output
1528 // elements are live.
1529 Ratio = VWidth/InVWidth;
1530 for (unsigned OutIdx = 0; OutIdx != VWidth; ++OutIdx) {
1531 if (DemandedElts & (1ULL << OutIdx))
1532 InputDemandedElts |= 1ULL << (OutIdx/Ratio);
1538 // If there are more elements in the source than there are in the result,
1539 // then an input element is live if the corresponding output element is
1541 Ratio = InVWidth/VWidth;
1542 for (unsigned InIdx = 0; InIdx != InVWidth; ++InIdx)
1543 if (DemandedElts & (1ULL << InIdx/Ratio))
1544 InputDemandedElts |= 1ULL << InIdx;
1547 // div/rem demand all inputs, because they don't want divide by zero.
1548 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), InputDemandedElts,
1549 UndefElts2, Depth+1);
1551 I->setOperand(0, TmpV);
1555 UndefElts = UndefElts2;
1556 if (VWidth > InVWidth) {
1557 assert(0 && "Unimp");
1558 // If there are more elements in the result than there are in the source,
1559 // then an output element is undef if the corresponding input element is
1561 for (unsigned OutIdx = 0; OutIdx != VWidth; ++OutIdx)
1562 if (UndefElts2 & (1ULL << (OutIdx/Ratio)))
1563 UndefElts |= 1ULL << OutIdx;
1564 } else if (VWidth < InVWidth) {
1565 assert(0 && "Unimp");
1566 // If there are more elements in the source than there are in the result,
1567 // then a result element is undef if all of the corresponding input
1568 // elements are undef.
1569 UndefElts = ~0ULL >> (64-VWidth); // Start out all undef.
1570 for (unsigned InIdx = 0; InIdx != InVWidth; ++InIdx)
1571 if ((UndefElts2 & (1ULL << InIdx)) == 0) // Not undef?
1572 UndefElts &= ~(1ULL << (InIdx/Ratio)); // Clear undef bit.
1576 case Instruction::And:
1577 case Instruction::Or:
1578 case Instruction::Xor:
1579 case Instruction::Add:
1580 case Instruction::Sub:
1581 case Instruction::Mul:
1582 // div/rem demand all inputs, because they don't want divide by zero.
1583 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), DemandedElts,
1584 UndefElts, Depth+1);
1585 if (TmpV) { I->setOperand(0, TmpV); MadeChange = true; }
1586 TmpV = SimplifyDemandedVectorElts(I->getOperand(1), DemandedElts,
1587 UndefElts2, Depth+1);
1588 if (TmpV) { I->setOperand(1, TmpV); MadeChange = true; }
1590 // Output elements are undefined if both are undefined. Consider things
1591 // like undef&0. The result is known zero, not undef.
1592 UndefElts &= UndefElts2;
1595 case Instruction::Call: {
1596 IntrinsicInst *II = dyn_cast<IntrinsicInst>(I);
1598 switch (II->getIntrinsicID()) {
1601 // Binary vector operations that work column-wise. A dest element is a
1602 // function of the corresponding input elements from the two inputs.
1603 case Intrinsic::x86_sse_sub_ss:
1604 case Intrinsic::x86_sse_mul_ss:
1605 case Intrinsic::x86_sse_min_ss:
1606 case Intrinsic::x86_sse_max_ss:
1607 case Intrinsic::x86_sse2_sub_sd:
1608 case Intrinsic::x86_sse2_mul_sd:
1609 case Intrinsic::x86_sse2_min_sd:
1610 case Intrinsic::x86_sse2_max_sd:
1611 TmpV = SimplifyDemandedVectorElts(II->getOperand(1), DemandedElts,
1612 UndefElts, Depth+1);
1613 if (TmpV) { II->setOperand(1, TmpV); MadeChange = true; }
1614 TmpV = SimplifyDemandedVectorElts(II->getOperand(2), DemandedElts,
1615 UndefElts2, Depth+1);
1616 if (TmpV) { II->setOperand(2, TmpV); MadeChange = true; }
1618 // If only the low elt is demanded and this is a scalarizable intrinsic,
1619 // scalarize it now.
1620 if (DemandedElts == 1) {
1621 switch (II->getIntrinsicID()) {
1623 case Intrinsic::x86_sse_sub_ss:
1624 case Intrinsic::x86_sse_mul_ss:
1625 case Intrinsic::x86_sse2_sub_sd:
1626 case Intrinsic::x86_sse2_mul_sd:
1627 // TODO: Lower MIN/MAX/ABS/etc
1628 Value *LHS = II->getOperand(1);
1629 Value *RHS = II->getOperand(2);
1630 // Extract the element as scalars.
1631 LHS = InsertNewInstBefore(new ExtractElementInst(LHS, 0U,"tmp"), *II);
1632 RHS = InsertNewInstBefore(new ExtractElementInst(RHS, 0U,"tmp"), *II);
1634 switch (II->getIntrinsicID()) {
1635 default: assert(0 && "Case stmts out of sync!");
1636 case Intrinsic::x86_sse_sub_ss:
1637 case Intrinsic::x86_sse2_sub_sd:
1638 TmpV = InsertNewInstBefore(BinaryOperator::createSub(LHS, RHS,
1639 II->getName()), *II);
1641 case Intrinsic::x86_sse_mul_ss:
1642 case Intrinsic::x86_sse2_mul_sd:
1643 TmpV = InsertNewInstBefore(BinaryOperator::createMul(LHS, RHS,
1644 II->getName()), *II);
1649 new InsertElementInst(UndefValue::get(II->getType()), TmpV, 0U,
1651 InsertNewInstBefore(New, *II);
1652 AddSoonDeadInstToWorklist(*II, 0);
1657 // Output elements are undefined if both are undefined. Consider things
1658 // like undef&0. The result is known zero, not undef.
1659 UndefElts &= UndefElts2;
1665 return MadeChange ? I : 0;
1668 /// @returns true if the specified compare predicate is
1669 /// true when both operands are equal...
1670 /// @brief Determine if the icmp Predicate is true when both operands are equal
1671 static bool isTrueWhenEqual(ICmpInst::Predicate pred) {
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 /// @returns true if the specified compare instruction is
1678 /// true when both operands are equal...
1679 /// @brief Determine if the ICmpInst returns true when both operands are equal
1680 static bool isTrueWhenEqual(ICmpInst &ICI) {
1681 return isTrueWhenEqual(ICI.getPredicate());
1684 /// AssociativeOpt - Perform an optimization on an associative operator. This
1685 /// function is designed to check a chain of associative operators for a
1686 /// potential to apply a certain optimization. Since the optimization may be
1687 /// applicable if the expression was reassociated, this checks the chain, then
1688 /// reassociates the expression as necessary to expose the optimization
1689 /// opportunity. This makes use of a special Functor, which must define
1690 /// 'shouldApply' and 'apply' methods.
1692 template<typename Functor>
1693 Instruction *AssociativeOpt(BinaryOperator &Root, const Functor &F) {
1694 unsigned Opcode = Root.getOpcode();
1695 Value *LHS = Root.getOperand(0);
1697 // Quick check, see if the immediate LHS matches...
1698 if (F.shouldApply(LHS))
1699 return F.apply(Root);
1701 // Otherwise, if the LHS is not of the same opcode as the root, return.
1702 Instruction *LHSI = dyn_cast<Instruction>(LHS);
1703 while (LHSI && LHSI->getOpcode() == Opcode && LHSI->hasOneUse()) {
1704 // Should we apply this transform to the RHS?
1705 bool ShouldApply = F.shouldApply(LHSI->getOperand(1));
1707 // If not to the RHS, check to see if we should apply to the LHS...
1708 if (!ShouldApply && F.shouldApply(LHSI->getOperand(0))) {
1709 cast<BinaryOperator>(LHSI)->swapOperands(); // Make the LHS the RHS
1713 // If the functor wants to apply the optimization to the RHS of LHSI,
1714 // reassociate the expression from ((? op A) op B) to (? op (A op B))
1716 BasicBlock *BB = Root.getParent();
1718 // Now all of the instructions are in the current basic block, go ahead
1719 // and perform the reassociation.
1720 Instruction *TmpLHSI = cast<Instruction>(Root.getOperand(0));
1722 // First move the selected RHS to the LHS of the root...
1723 Root.setOperand(0, LHSI->getOperand(1));
1725 // Make what used to be the LHS of the root be the user of the root...
1726 Value *ExtraOperand = TmpLHSI->getOperand(1);
1727 if (&Root == TmpLHSI) {
1728 Root.replaceAllUsesWith(Constant::getNullValue(TmpLHSI->getType()));
1731 Root.replaceAllUsesWith(TmpLHSI); // Users now use TmpLHSI
1732 TmpLHSI->setOperand(1, &Root); // TmpLHSI now uses the root
1733 TmpLHSI->getParent()->getInstList().remove(TmpLHSI);
1734 BasicBlock::iterator ARI = &Root; ++ARI;
1735 BB->getInstList().insert(ARI, TmpLHSI); // Move TmpLHSI to after Root
1738 // Now propagate the ExtraOperand down the chain of instructions until we
1740 while (TmpLHSI != LHSI) {
1741 Instruction *NextLHSI = cast<Instruction>(TmpLHSI->getOperand(0));
1742 // Move the instruction to immediately before the chain we are
1743 // constructing to avoid breaking dominance properties.
1744 NextLHSI->getParent()->getInstList().remove(NextLHSI);
1745 BB->getInstList().insert(ARI, NextLHSI);
1748 Value *NextOp = NextLHSI->getOperand(1);
1749 NextLHSI->setOperand(1, ExtraOperand);
1751 ExtraOperand = NextOp;
1754 // Now that the instructions are reassociated, have the functor perform
1755 // the transformation...
1756 return F.apply(Root);
1759 LHSI = dyn_cast<Instruction>(LHSI->getOperand(0));
1765 // AddRHS - Implements: X + X --> X << 1
1768 AddRHS(Value *rhs) : RHS(rhs) {}
1769 bool shouldApply(Value *LHS) const { return LHS == RHS; }
1770 Instruction *apply(BinaryOperator &Add) const {
1771 return BinaryOperator::createShl(Add.getOperand(0),
1772 ConstantInt::get(Add.getType(), 1));
1776 // AddMaskingAnd - Implements (A & C1)+(B & C2) --> (A & C1)|(B & C2)
1778 struct AddMaskingAnd {
1780 AddMaskingAnd(Constant *c) : C2(c) {}
1781 bool shouldApply(Value *LHS) const {
1783 return match(LHS, m_And(m_Value(), m_ConstantInt(C1))) &&
1784 ConstantExpr::getAnd(C1, C2)->isNullValue();
1786 Instruction *apply(BinaryOperator &Add) const {
1787 return BinaryOperator::createOr(Add.getOperand(0), Add.getOperand(1));
1791 static Value *FoldOperationIntoSelectOperand(Instruction &I, Value *SO,
1793 if (CastInst *CI = dyn_cast<CastInst>(&I)) {
1794 if (Constant *SOC = dyn_cast<Constant>(SO))
1795 return ConstantExpr::getCast(CI->getOpcode(), SOC, I.getType());
1797 return IC->InsertNewInstBefore(CastInst::create(
1798 CI->getOpcode(), SO, I.getType(), SO->getName() + ".cast"), I);
1801 // Figure out if the constant is the left or the right argument.
1802 bool ConstIsRHS = isa<Constant>(I.getOperand(1));
1803 Constant *ConstOperand = cast<Constant>(I.getOperand(ConstIsRHS));
1805 if (Constant *SOC = dyn_cast<Constant>(SO)) {
1807 return ConstantExpr::get(I.getOpcode(), SOC, ConstOperand);
1808 return ConstantExpr::get(I.getOpcode(), ConstOperand, SOC);
1811 Value *Op0 = SO, *Op1 = ConstOperand;
1813 std::swap(Op0, Op1);
1815 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(&I))
1816 New = BinaryOperator::create(BO->getOpcode(), Op0, Op1,SO->getName()+".op");
1817 else if (CmpInst *CI = dyn_cast<CmpInst>(&I))
1818 New = CmpInst::create(CI->getOpcode(), CI->getPredicate(), Op0, Op1,
1819 SO->getName()+".cmp");
1821 assert(0 && "Unknown binary instruction type!");
1824 return IC->InsertNewInstBefore(New, I);
1827 // FoldOpIntoSelect - Given an instruction with a select as one operand and a
1828 // constant as the other operand, try to fold the binary operator into the
1829 // select arguments. This also works for Cast instructions, which obviously do
1830 // not have a second operand.
1831 static Instruction *FoldOpIntoSelect(Instruction &Op, SelectInst *SI,
1833 // Don't modify shared select instructions
1834 if (!SI->hasOneUse()) return 0;
1835 Value *TV = SI->getOperand(1);
1836 Value *FV = SI->getOperand(2);
1838 if (isa<Constant>(TV) || isa<Constant>(FV)) {
1839 // Bool selects with constant operands can be folded to logical ops.
1840 if (SI->getType() == Type::Int1Ty) return 0;
1842 Value *SelectTrueVal = FoldOperationIntoSelectOperand(Op, TV, IC);
1843 Value *SelectFalseVal = FoldOperationIntoSelectOperand(Op, FV, IC);
1845 return new SelectInst(SI->getCondition(), SelectTrueVal,
1852 /// FoldOpIntoPhi - Given a binary operator or cast instruction which has a PHI
1853 /// node as operand #0, see if we can fold the instruction into the PHI (which
1854 /// is only possible if all operands to the PHI are constants).
1855 Instruction *InstCombiner::FoldOpIntoPhi(Instruction &I) {
1856 PHINode *PN = cast<PHINode>(I.getOperand(0));
1857 unsigned NumPHIValues = PN->getNumIncomingValues();
1858 if (!PN->hasOneUse() || NumPHIValues == 0) return 0;
1860 // Check to see if all of the operands of the PHI are constants. If there is
1861 // one non-constant value, remember the BB it is. If there is more than one
1862 // or if *it* is a PHI, bail out.
1863 BasicBlock *NonConstBB = 0;
1864 for (unsigned i = 0; i != NumPHIValues; ++i)
1865 if (!isa<Constant>(PN->getIncomingValue(i))) {
1866 if (NonConstBB) return 0; // More than one non-const value.
1867 if (isa<PHINode>(PN->getIncomingValue(i))) return 0; // Itself a phi.
1868 NonConstBB = PN->getIncomingBlock(i);
1870 // If the incoming non-constant value is in I's block, we have an infinite
1872 if (NonConstBB == I.getParent())
1876 // If there is exactly one non-constant value, we can insert a copy of the
1877 // operation in that block. However, if this is a critical edge, we would be
1878 // inserting the computation one some other paths (e.g. inside a loop). Only
1879 // do this if the pred block is unconditionally branching into the phi block.
1881 BranchInst *BI = dyn_cast<BranchInst>(NonConstBB->getTerminator());
1882 if (!BI || !BI->isUnconditional()) return 0;
1885 // Okay, we can do the transformation: create the new PHI node.
1886 PHINode *NewPN = new PHINode(I.getType(), "");
1887 NewPN->reserveOperandSpace(PN->getNumOperands()/2);
1888 InsertNewInstBefore(NewPN, *PN);
1889 NewPN->takeName(PN);
1891 // Next, add all of the operands to the PHI.
1892 if (I.getNumOperands() == 2) {
1893 Constant *C = cast<Constant>(I.getOperand(1));
1894 for (unsigned i = 0; i != NumPHIValues; ++i) {
1896 if (Constant *InC = dyn_cast<Constant>(PN->getIncomingValue(i))) {
1897 if (CmpInst *CI = dyn_cast<CmpInst>(&I))
1898 InV = ConstantExpr::getCompare(CI->getPredicate(), InC, C);
1900 InV = ConstantExpr::get(I.getOpcode(), InC, C);
1902 assert(PN->getIncomingBlock(i) == NonConstBB);
1903 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(&I))
1904 InV = BinaryOperator::create(BO->getOpcode(),
1905 PN->getIncomingValue(i), C, "phitmp",
1906 NonConstBB->getTerminator());
1907 else if (CmpInst *CI = dyn_cast<CmpInst>(&I))
1908 InV = CmpInst::create(CI->getOpcode(),
1910 PN->getIncomingValue(i), C, "phitmp",
1911 NonConstBB->getTerminator());
1913 assert(0 && "Unknown binop!");
1915 AddToWorkList(cast<Instruction>(InV));
1917 NewPN->addIncoming(InV, PN->getIncomingBlock(i));
1920 CastInst *CI = cast<CastInst>(&I);
1921 const Type *RetTy = CI->getType();
1922 for (unsigned i = 0; i != NumPHIValues; ++i) {
1924 if (Constant *InC = dyn_cast<Constant>(PN->getIncomingValue(i))) {
1925 InV = ConstantExpr::getCast(CI->getOpcode(), InC, RetTy);
1927 assert(PN->getIncomingBlock(i) == NonConstBB);
1928 InV = CastInst::create(CI->getOpcode(), PN->getIncomingValue(i),
1929 I.getType(), "phitmp",
1930 NonConstBB->getTerminator());
1931 AddToWorkList(cast<Instruction>(InV));
1933 NewPN->addIncoming(InV, PN->getIncomingBlock(i));
1936 return ReplaceInstUsesWith(I, NewPN);
1939 Instruction *InstCombiner::visitAdd(BinaryOperator &I) {
1940 bool Changed = SimplifyCommutative(I);
1941 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1);
1943 if (Constant *RHSC = dyn_cast<Constant>(RHS)) {
1944 // X + undef -> undef
1945 if (isa<UndefValue>(RHS))
1946 return ReplaceInstUsesWith(I, RHS);
1949 if (!I.getType()->isFPOrFPVector()) { // NOTE: -0 + +0 = +0.
1950 if (RHSC->isNullValue())
1951 return ReplaceInstUsesWith(I, LHS);
1952 } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(RHSC)) {
1953 if (CFP->isExactlyValue(ConstantFP::getNegativeZero
1954 (I.getType())->getValueAPF()))
1955 return ReplaceInstUsesWith(I, LHS);
1958 if (ConstantInt *CI = dyn_cast<ConstantInt>(RHSC)) {
1959 // X + (signbit) --> X ^ signbit
1960 const APInt& Val = CI->getValue();
1961 uint32_t BitWidth = Val.getBitWidth();
1962 if (Val == APInt::getSignBit(BitWidth))
1963 return BinaryOperator::createXor(LHS, RHS);
1965 // See if SimplifyDemandedBits can simplify this. This handles stuff like
1966 // (X & 254)+1 -> (X&254)|1
1967 if (!isa<VectorType>(I.getType())) {
1968 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
1969 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
1970 KnownZero, KnownOne))
1975 if (isa<PHINode>(LHS))
1976 if (Instruction *NV = FoldOpIntoPhi(I))
1979 ConstantInt *XorRHS = 0;
1981 if (isa<ConstantInt>(RHSC) &&
1982 match(LHS, m_Xor(m_Value(XorLHS), m_ConstantInt(XorRHS)))) {
1983 uint32_t TySizeBits = I.getType()->getPrimitiveSizeInBits();
1984 const APInt& RHSVal = cast<ConstantInt>(RHSC)->getValue();
1986 uint32_t Size = TySizeBits / 2;
1987 APInt C0080Val(APInt(TySizeBits, 1ULL).shl(Size - 1));
1988 APInt CFF80Val(-C0080Val);
1990 if (TySizeBits > Size) {
1991 // If we have ADD(XOR(AND(X, 0xFF), 0x80), 0xF..F80), it's a sext.
1992 // If we have ADD(XOR(AND(X, 0xFF), 0xF..F80), 0x80), it's a sext.
1993 if ((RHSVal == CFF80Val && XorRHS->getValue() == C0080Val) ||
1994 (RHSVal == C0080Val && XorRHS->getValue() == CFF80Val)) {
1995 // This is a sign extend if the top bits are known zero.
1996 if (!MaskedValueIsZero(XorLHS,
1997 APInt::getHighBitsSet(TySizeBits, TySizeBits - Size)))
1998 Size = 0; // Not a sign ext, but can't be any others either.
2003 C0080Val = APIntOps::lshr(C0080Val, Size);
2004 CFF80Val = APIntOps::ashr(CFF80Val, Size);
2005 } while (Size >= 1);
2007 // FIXME: This shouldn't be necessary. When the backends can handle types
2008 // with funny bit widths then this whole cascade of if statements should
2009 // be removed. It is just here to get the size of the "middle" type back
2010 // up to something that the back ends can handle.
2011 const Type *MiddleType = 0;
2014 case 32: MiddleType = Type::Int32Ty; break;
2015 case 16: MiddleType = Type::Int16Ty; break;
2016 case 8: MiddleType = Type::Int8Ty; break;
2019 Instruction *NewTrunc = new TruncInst(XorLHS, MiddleType, "sext");
2020 InsertNewInstBefore(NewTrunc, I);
2021 return new SExtInst(NewTrunc, I.getType(), I.getName());
2027 if (I.getType()->isInteger() && I.getType() != Type::Int1Ty) {
2028 if (Instruction *Result = AssociativeOpt(I, AddRHS(RHS))) return Result;
2030 if (Instruction *RHSI = dyn_cast<Instruction>(RHS)) {
2031 if (RHSI->getOpcode() == Instruction::Sub)
2032 if (LHS == RHSI->getOperand(1)) // A + (B - A) --> B
2033 return ReplaceInstUsesWith(I, RHSI->getOperand(0));
2035 if (Instruction *LHSI = dyn_cast<Instruction>(LHS)) {
2036 if (LHSI->getOpcode() == Instruction::Sub)
2037 if (RHS == LHSI->getOperand(1)) // (B - A) + A --> B
2038 return ReplaceInstUsesWith(I, LHSI->getOperand(0));
2043 if (Value *V = dyn_castNegVal(LHS))
2044 return BinaryOperator::createSub(RHS, V);
2047 if (!isa<Constant>(RHS))
2048 if (Value *V = dyn_castNegVal(RHS))
2049 return BinaryOperator::createSub(LHS, V);
2053 if (Value *X = dyn_castFoldableMul(LHS, C2)) {
2054 if (X == RHS) // X*C + X --> X * (C+1)
2055 return BinaryOperator::createMul(RHS, AddOne(C2));
2057 // X*C1 + X*C2 --> X * (C1+C2)
2059 if (X == dyn_castFoldableMul(RHS, C1))
2060 return BinaryOperator::createMul(X, Add(C1, C2));
2063 // X + X*C --> X * (C+1)
2064 if (dyn_castFoldableMul(RHS, C2) == LHS)
2065 return BinaryOperator::createMul(LHS, AddOne(C2));
2067 // X + ~X --> -1 since ~X = -X-1
2068 if (dyn_castNotVal(LHS) == RHS || dyn_castNotVal(RHS) == LHS)
2069 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
2072 // (A & C1)+(B & C2) --> (A & C1)|(B & C2) iff C1&C2 == 0
2073 if (match(RHS, m_And(m_Value(), m_ConstantInt(C2))))
2074 if (Instruction *R = AssociativeOpt(I, AddMaskingAnd(C2)))
2077 if (ConstantInt *CRHS = dyn_cast<ConstantInt>(RHS)) {
2079 if (match(LHS, m_Not(m_Value(X)))) // ~X + C --> (C-1) - X
2080 return BinaryOperator::createSub(SubOne(CRHS), X);
2082 // (X & FF00) + xx00 -> (X+xx00) & FF00
2083 if (LHS->hasOneUse() && match(LHS, m_And(m_Value(X), m_ConstantInt(C2)))) {
2084 Constant *Anded = And(CRHS, C2);
2085 if (Anded == CRHS) {
2086 // See if all bits from the first bit set in the Add RHS up are included
2087 // in the mask. First, get the rightmost bit.
2088 const APInt& AddRHSV = CRHS->getValue();
2090 // Form a mask of all bits from the lowest bit added through the top.
2091 APInt AddRHSHighBits(~((AddRHSV & -AddRHSV)-1));
2093 // See if the and mask includes all of these bits.
2094 APInt AddRHSHighBitsAnd(AddRHSHighBits & C2->getValue());
2096 if (AddRHSHighBits == AddRHSHighBitsAnd) {
2097 // Okay, the xform is safe. Insert the new add pronto.
2098 Value *NewAdd = InsertNewInstBefore(BinaryOperator::createAdd(X, CRHS,
2099 LHS->getName()), I);
2100 return BinaryOperator::createAnd(NewAdd, C2);
2105 // Try to fold constant add into select arguments.
2106 if (SelectInst *SI = dyn_cast<SelectInst>(LHS))
2107 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2111 // add (cast *A to intptrtype) B ->
2112 // cast (GEP (cast *A to sbyte*) B) ->
2115 CastInst *CI = dyn_cast<CastInst>(LHS);
2118 CI = dyn_cast<CastInst>(RHS);
2121 if (CI && CI->getType()->isSized() &&
2122 (CI->getType()->getPrimitiveSizeInBits() ==
2123 TD->getIntPtrType()->getPrimitiveSizeInBits())
2124 && isa<PointerType>(CI->getOperand(0)->getType())) {
2126 cast<PointerType>(CI->getOperand(0)->getType())->getAddressSpace();
2127 Value *I2 = InsertCastBefore(Instruction::BitCast, CI->getOperand(0),
2128 PointerType::get(Type::Int8Ty, AS), I);
2129 I2 = InsertNewInstBefore(new GetElementPtrInst(I2, Other, "ctg2"), I);
2130 return new PtrToIntInst(I2, CI->getType());
2134 // add (select X 0 (sub n A)) A ->
2137 SelectInst *SI = dyn_cast<SelectInst>(LHS);
2140 SI = dyn_cast<SelectInst>(RHS);
2144 Value *TV = SI->getTrueValue();
2145 Value *FV = SI->getFalseValue();
2148 // Can we fold the add into the argument of the select?
2149 // We check both true and false select arguments for a matching subtract.
2150 ConstantInt *C1, *C2;
2151 if (match(FV, m_ConstantInt(C1)) && C1->getValue() == 0 &&
2152 match(TV, m_Sub(m_ConstantInt(C2), m_Value(A))) &&
2154 // We managed to fold the add into the true select value,
2155 // picking up a simplified condition, if available.
2156 return new SelectInst(SI->getCondition(), C2, A);
2157 } else if (match(TV, m_ConstantInt(C1)) && C1->getValue() == 0 &&
2158 match(FV, m_Sub(m_ConstantInt(C2), m_Value(A))) &&
2160 // We managed to fold the add into the false select value,
2161 // picking up a simplified condition, if available.
2162 return new SelectInst(SI->getCondition(), A, C2);
2167 return Changed ? &I : 0;
2170 // isSignBit - Return true if the value represented by the constant only has the
2171 // highest order bit set.
2172 static bool isSignBit(ConstantInt *CI) {
2173 uint32_t NumBits = CI->getType()->getPrimitiveSizeInBits();
2174 return CI->getValue() == APInt::getSignBit(NumBits);
2177 Instruction *InstCombiner::visitSub(BinaryOperator &I) {
2178 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2180 if (Op0 == Op1) // sub X, X -> 0
2181 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2183 // If this is a 'B = x-(-A)', change to B = x+A...
2184 if (Value *V = dyn_castNegVal(Op1))
2185 return BinaryOperator::createAdd(Op0, V);
2187 if (isa<UndefValue>(Op0))
2188 return ReplaceInstUsesWith(I, Op0); // undef - X -> undef
2189 if (isa<UndefValue>(Op1))
2190 return ReplaceInstUsesWith(I, Op1); // X - undef -> undef
2192 if (ConstantInt *C = dyn_cast<ConstantInt>(Op0)) {
2193 // Replace (-1 - A) with (~A)...
2194 if (C->isAllOnesValue())
2195 return BinaryOperator::createNot(Op1);
2197 // C - ~X == X + (1+C)
2199 if (match(Op1, m_Not(m_Value(X))))
2200 return BinaryOperator::createAdd(X, AddOne(C));
2202 // -(X >>u 31) -> (X >>s 31)
2203 // -(X >>s 31) -> (X >>u 31)
2205 if (BinaryOperator *SI = dyn_cast<BinaryOperator>(Op1))
2206 if (SI->getOpcode() == Instruction::LShr) {
2207 if (ConstantInt *CU = dyn_cast<ConstantInt>(SI->getOperand(1))) {
2208 // Check to see if we are shifting out everything but the sign bit.
2209 if (CU->getLimitedValue(SI->getType()->getPrimitiveSizeInBits()) ==
2210 SI->getType()->getPrimitiveSizeInBits()-1) {
2211 // Ok, the transformation is safe. Insert AShr.
2212 return BinaryOperator::create(Instruction::AShr,
2213 SI->getOperand(0), CU, SI->getName());
2217 else if (SI->getOpcode() == Instruction::AShr) {
2218 if (ConstantInt *CU = dyn_cast<ConstantInt>(SI->getOperand(1))) {
2219 // Check to see if we are shifting out everything but the sign bit.
2220 if (CU->getLimitedValue(SI->getType()->getPrimitiveSizeInBits()) ==
2221 SI->getType()->getPrimitiveSizeInBits()-1) {
2222 // Ok, the transformation is safe. Insert LShr.
2223 return BinaryOperator::createLShr(
2224 SI->getOperand(0), CU, SI->getName());
2230 // Try to fold constant sub into select arguments.
2231 if (SelectInst *SI = dyn_cast<SelectInst>(Op1))
2232 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2235 if (isa<PHINode>(Op0))
2236 if (Instruction *NV = FoldOpIntoPhi(I))
2240 if (BinaryOperator *Op1I = dyn_cast<BinaryOperator>(Op1)) {
2241 if (Op1I->getOpcode() == Instruction::Add &&
2242 !Op0->getType()->isFPOrFPVector()) {
2243 if (Op1I->getOperand(0) == Op0) // X-(X+Y) == -Y
2244 return BinaryOperator::createNeg(Op1I->getOperand(1), I.getName());
2245 else if (Op1I->getOperand(1) == Op0) // X-(Y+X) == -Y
2246 return BinaryOperator::createNeg(Op1I->getOperand(0), I.getName());
2247 else if (ConstantInt *CI1 = dyn_cast<ConstantInt>(I.getOperand(0))) {
2248 if (ConstantInt *CI2 = dyn_cast<ConstantInt>(Op1I->getOperand(1)))
2249 // C1-(X+C2) --> (C1-C2)-X
2250 return BinaryOperator::createSub(Subtract(CI1, CI2),
2251 Op1I->getOperand(0));
2255 if (Op1I->hasOneUse()) {
2256 // Replace (x - (y - z)) with (x + (z - y)) if the (y - z) subexpression
2257 // is not used by anyone else...
2259 if (Op1I->getOpcode() == Instruction::Sub &&
2260 !Op1I->getType()->isFPOrFPVector()) {
2261 // Swap the two operands of the subexpr...
2262 Value *IIOp0 = Op1I->getOperand(0), *IIOp1 = Op1I->getOperand(1);
2263 Op1I->setOperand(0, IIOp1);
2264 Op1I->setOperand(1, IIOp0);
2266 // Create the new top level add instruction...
2267 return BinaryOperator::createAdd(Op0, Op1);
2270 // Replace (A - (A & B)) with (A & ~B) if this is the only use of (A&B)...
2272 if (Op1I->getOpcode() == Instruction::And &&
2273 (Op1I->getOperand(0) == Op0 || Op1I->getOperand(1) == Op0)) {
2274 Value *OtherOp = Op1I->getOperand(Op1I->getOperand(0) == Op0);
2277 InsertNewInstBefore(BinaryOperator::createNot(OtherOp, "B.not"), I);
2278 return BinaryOperator::createAnd(Op0, NewNot);
2281 // 0 - (X sdiv C) -> (X sdiv -C)
2282 if (Op1I->getOpcode() == Instruction::SDiv)
2283 if (ConstantInt *CSI = dyn_cast<ConstantInt>(Op0))
2285 if (Constant *DivRHS = dyn_cast<Constant>(Op1I->getOperand(1)))
2286 return BinaryOperator::createSDiv(Op1I->getOperand(0),
2287 ConstantExpr::getNeg(DivRHS));
2289 // X - X*C --> X * (1-C)
2290 ConstantInt *C2 = 0;
2291 if (dyn_castFoldableMul(Op1I, C2) == Op0) {
2292 Constant *CP1 = Subtract(ConstantInt::get(I.getType(), 1), C2);
2293 return BinaryOperator::createMul(Op0, CP1);
2296 // X - ((X / Y) * Y) --> X % Y
2297 if (Op1I->getOpcode() == Instruction::Mul)
2298 if (Instruction *I = dyn_cast<Instruction>(Op1I->getOperand(0)))
2299 if (Op0 == I->getOperand(0) &&
2300 Op1I->getOperand(1) == I->getOperand(1)) {
2301 if (I->getOpcode() == Instruction::SDiv)
2302 return BinaryOperator::createSRem(Op0, Op1I->getOperand(1));
2303 if (I->getOpcode() == Instruction::UDiv)
2304 return BinaryOperator::createURem(Op0, Op1I->getOperand(1));
2309 if (!Op0->getType()->isFPOrFPVector())
2310 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0))
2311 if (Op0I->getOpcode() == Instruction::Add) {
2312 if (Op0I->getOperand(0) == Op1) // (Y+X)-Y == X
2313 return ReplaceInstUsesWith(I, Op0I->getOperand(1));
2314 else if (Op0I->getOperand(1) == Op1) // (X+Y)-Y == X
2315 return ReplaceInstUsesWith(I, Op0I->getOperand(0));
2316 } else if (Op0I->getOpcode() == Instruction::Sub) {
2317 if (Op0I->getOperand(0) == Op1) // (X-Y)-X == -Y
2318 return BinaryOperator::createNeg(Op0I->getOperand(1), I.getName());
2322 if (Value *X = dyn_castFoldableMul(Op0, C1)) {
2323 if (X == Op1) // X*C - X --> X * (C-1)
2324 return BinaryOperator::createMul(Op1, SubOne(C1));
2326 ConstantInt *C2; // X*C1 - X*C2 -> X * (C1-C2)
2327 if (X == dyn_castFoldableMul(Op1, C2))
2328 return BinaryOperator::createMul(Op1, Subtract(C1, C2));
2333 /// isSignBitCheck - Given an exploded icmp instruction, return true if the
2334 /// comparison only checks the sign bit. If it only checks the sign bit, set
2335 /// TrueIfSigned if the result of the comparison is true when the input value is
2337 static bool isSignBitCheck(ICmpInst::Predicate pred, ConstantInt *RHS,
2338 bool &TrueIfSigned) {
2340 case ICmpInst::ICMP_SLT: // True if LHS s< 0
2341 TrueIfSigned = true;
2342 return RHS->isZero();
2343 case ICmpInst::ICMP_SLE: // True if LHS s<= RHS and RHS == -1
2344 TrueIfSigned = true;
2345 return RHS->isAllOnesValue();
2346 case ICmpInst::ICMP_SGT: // True if LHS s> -1
2347 TrueIfSigned = false;
2348 return RHS->isAllOnesValue();
2349 case ICmpInst::ICMP_UGT:
2350 // True if LHS u> RHS and RHS == high-bit-mask - 1
2351 TrueIfSigned = true;
2352 return RHS->getValue() ==
2353 APInt::getSignedMaxValue(RHS->getType()->getPrimitiveSizeInBits());
2354 case ICmpInst::ICMP_UGE:
2355 // True if LHS u>= RHS and RHS == high-bit-mask (2^7, 2^15, 2^31, etc)
2356 TrueIfSigned = true;
2357 return RHS->getValue() ==
2358 APInt::getSignBit(RHS->getType()->getPrimitiveSizeInBits());
2364 Instruction *InstCombiner::visitMul(BinaryOperator &I) {
2365 bool Changed = SimplifyCommutative(I);
2366 Value *Op0 = I.getOperand(0);
2368 if (isa<UndefValue>(I.getOperand(1))) // undef * X -> 0
2369 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2371 // Simplify mul instructions with a constant RHS...
2372 if (Constant *Op1 = dyn_cast<Constant>(I.getOperand(1))) {
2373 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
2375 // ((X << C1)*C2) == (X * (C2 << C1))
2376 if (BinaryOperator *SI = dyn_cast<BinaryOperator>(Op0))
2377 if (SI->getOpcode() == Instruction::Shl)
2378 if (Constant *ShOp = dyn_cast<Constant>(SI->getOperand(1)))
2379 return BinaryOperator::createMul(SI->getOperand(0),
2380 ConstantExpr::getShl(CI, ShOp));
2383 return ReplaceInstUsesWith(I, Op1); // X * 0 == 0
2384 if (CI->equalsInt(1)) // X * 1 == X
2385 return ReplaceInstUsesWith(I, Op0);
2386 if (CI->isAllOnesValue()) // X * -1 == 0 - X
2387 return BinaryOperator::createNeg(Op0, I.getName());
2389 const APInt& Val = cast<ConstantInt>(CI)->getValue();
2390 if (Val.isPowerOf2()) { // Replace X*(2^C) with X << C
2391 return BinaryOperator::createShl(Op0,
2392 ConstantInt::get(Op0->getType(), Val.logBase2()));
2394 } else if (ConstantFP *Op1F = dyn_cast<ConstantFP>(Op1)) {
2395 if (Op1F->isNullValue())
2396 return ReplaceInstUsesWith(I, Op1);
2398 // "In IEEE floating point, x*1 is not equivalent to x for nans. However,
2399 // ANSI says we can drop signals, so we can do this anyway." (from GCC)
2400 // We need a better interface for long double here.
2401 if (Op1->getType() == Type::FloatTy || Op1->getType() == Type::DoubleTy)
2402 if (Op1F->isExactlyValue(1.0))
2403 return ReplaceInstUsesWith(I, Op0); // Eliminate 'mul double %X, 1.0'
2406 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0))
2407 if (Op0I->getOpcode() == Instruction::Add && Op0I->hasOneUse() &&
2408 isa<ConstantInt>(Op0I->getOperand(1))) {
2409 // Canonicalize (X+C1)*C2 -> X*C2+C1*C2.
2410 Instruction *Add = BinaryOperator::createMul(Op0I->getOperand(0),
2412 InsertNewInstBefore(Add, I);
2413 Value *C1C2 = ConstantExpr::getMul(Op1,
2414 cast<Constant>(Op0I->getOperand(1)));
2415 return BinaryOperator::createAdd(Add, C1C2);
2419 // Try to fold constant mul into select arguments.
2420 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
2421 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2424 if (isa<PHINode>(Op0))
2425 if (Instruction *NV = FoldOpIntoPhi(I))
2429 if (Value *Op0v = dyn_castNegVal(Op0)) // -X * -Y = X*Y
2430 if (Value *Op1v = dyn_castNegVal(I.getOperand(1)))
2431 return BinaryOperator::createMul(Op0v, Op1v);
2433 // If one of the operands of the multiply is a cast from a boolean value, then
2434 // we know the bool is either zero or one, so this is a 'masking' multiply.
2435 // See if we can simplify things based on how the boolean was originally
2437 CastInst *BoolCast = 0;
2438 if (ZExtInst *CI = dyn_cast<ZExtInst>(I.getOperand(0)))
2439 if (CI->getOperand(0)->getType() == Type::Int1Ty)
2442 if (ZExtInst *CI = dyn_cast<ZExtInst>(I.getOperand(1)))
2443 if (CI->getOperand(0)->getType() == Type::Int1Ty)
2446 if (ICmpInst *SCI = dyn_cast<ICmpInst>(BoolCast->getOperand(0))) {
2447 Value *SCIOp0 = SCI->getOperand(0), *SCIOp1 = SCI->getOperand(1);
2448 const Type *SCOpTy = SCIOp0->getType();
2451 // If the icmp is true iff the sign bit of X is set, then convert this
2452 // multiply into a shift/and combination.
2453 if (isa<ConstantInt>(SCIOp1) &&
2454 isSignBitCheck(SCI->getPredicate(), cast<ConstantInt>(SCIOp1), TIS) &&
2456 // Shift the X value right to turn it into "all signbits".
2457 Constant *Amt = ConstantInt::get(SCIOp0->getType(),
2458 SCOpTy->getPrimitiveSizeInBits()-1);
2460 InsertNewInstBefore(
2461 BinaryOperator::create(Instruction::AShr, SCIOp0, Amt,
2462 BoolCast->getOperand(0)->getName()+
2465 // If the multiply type is not the same as the source type, sign extend
2466 // or truncate to the multiply type.
2467 if (I.getType() != V->getType()) {
2468 uint32_t SrcBits = V->getType()->getPrimitiveSizeInBits();
2469 uint32_t DstBits = I.getType()->getPrimitiveSizeInBits();
2470 Instruction::CastOps opcode =
2471 (SrcBits == DstBits ? Instruction::BitCast :
2472 (SrcBits < DstBits ? Instruction::SExt : Instruction::Trunc));
2473 V = InsertCastBefore(opcode, V, I.getType(), I);
2476 Value *OtherOp = Op0 == BoolCast ? I.getOperand(1) : Op0;
2477 return BinaryOperator::createAnd(V, OtherOp);
2482 return Changed ? &I : 0;
2485 /// This function implements the transforms on div instructions that work
2486 /// regardless of the kind of div instruction it is (udiv, sdiv, or fdiv). It is
2487 /// used by the visitors to those instructions.
2488 /// @brief Transforms common to all three div instructions
2489 Instruction *InstCombiner::commonDivTransforms(BinaryOperator &I) {
2490 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2493 if (isa<UndefValue>(Op0))
2494 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2496 // X / undef -> undef
2497 if (isa<UndefValue>(Op1))
2498 return ReplaceInstUsesWith(I, Op1);
2500 // Handle cases involving: div X, (select Cond, Y, Z)
2501 if (SelectInst *SI = dyn_cast<SelectInst>(Op1)) {
2502 // div X, (Cond ? 0 : Y) -> div X, Y. If the div and the select are in the
2503 // same basic block, then we replace the select with Y, and the condition
2504 // of the select with false (if the cond value is in the same BB). If the
2505 // select has uses other than the div, this allows them to be simplified
2506 // also. Note that div X, Y is just as good as div X, 0 (undef)
2507 if (Constant *ST = dyn_cast<Constant>(SI->getOperand(1)))
2508 if (ST->isNullValue()) {
2509 Instruction *CondI = dyn_cast<Instruction>(SI->getOperand(0));
2510 if (CondI && CondI->getParent() == I.getParent())
2511 UpdateValueUsesWith(CondI, ConstantInt::getFalse());
2512 else if (I.getParent() != SI->getParent() || SI->hasOneUse())
2513 I.setOperand(1, SI->getOperand(2));
2515 UpdateValueUsesWith(SI, SI->getOperand(2));
2519 // Likewise for: div X, (Cond ? Y : 0) -> div X, Y
2520 if (Constant *ST = dyn_cast<Constant>(SI->getOperand(2)))
2521 if (ST->isNullValue()) {
2522 Instruction *CondI = dyn_cast<Instruction>(SI->getOperand(0));
2523 if (CondI && CondI->getParent() == I.getParent())
2524 UpdateValueUsesWith(CondI, ConstantInt::getTrue());
2525 else if (I.getParent() != SI->getParent() || SI->hasOneUse())
2526 I.setOperand(1, SI->getOperand(1));
2528 UpdateValueUsesWith(SI, SI->getOperand(1));
2536 /// This function implements the transforms common to both integer division
2537 /// instructions (udiv and sdiv). It is called by the visitors to those integer
2538 /// division instructions.
2539 /// @brief Common integer divide transforms
2540 Instruction *InstCombiner::commonIDivTransforms(BinaryOperator &I) {
2541 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2543 if (Instruction *Common = commonDivTransforms(I))
2546 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
2548 if (RHS->equalsInt(1))
2549 return ReplaceInstUsesWith(I, Op0);
2551 // (X / C1) / C2 -> X / (C1*C2)
2552 if (Instruction *LHS = dyn_cast<Instruction>(Op0))
2553 if (Instruction::BinaryOps(LHS->getOpcode()) == I.getOpcode())
2554 if (ConstantInt *LHSRHS = dyn_cast<ConstantInt>(LHS->getOperand(1))) {
2555 return BinaryOperator::create(I.getOpcode(), LHS->getOperand(0),
2556 Multiply(RHS, LHSRHS));
2559 if (!RHS->isZero()) { // avoid X udiv 0
2560 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
2561 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2563 if (isa<PHINode>(Op0))
2564 if (Instruction *NV = FoldOpIntoPhi(I))
2569 // 0 / X == 0, we don't need to preserve faults!
2570 if (ConstantInt *LHS = dyn_cast<ConstantInt>(Op0))
2571 if (LHS->equalsInt(0))
2572 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2577 Instruction *InstCombiner::visitUDiv(BinaryOperator &I) {
2578 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2580 // Handle the integer div common cases
2581 if (Instruction *Common = commonIDivTransforms(I))
2584 // X udiv C^2 -> X >> C
2585 // Check to see if this is an unsigned division with an exact power of 2,
2586 // if so, convert to a right shift.
2587 if (ConstantInt *C = dyn_cast<ConstantInt>(Op1)) {
2588 if (C->getValue().isPowerOf2()) // 0 not included in isPowerOf2
2589 return BinaryOperator::createLShr(Op0,
2590 ConstantInt::get(Op0->getType(), C->getValue().logBase2()));
2593 // X udiv (C1 << N), where C1 is "1<<C2" --> X >> (N+C2)
2594 if (BinaryOperator *RHSI = dyn_cast<BinaryOperator>(I.getOperand(1))) {
2595 if (RHSI->getOpcode() == Instruction::Shl &&
2596 isa<ConstantInt>(RHSI->getOperand(0))) {
2597 const APInt& C1 = cast<ConstantInt>(RHSI->getOperand(0))->getValue();
2598 if (C1.isPowerOf2()) {
2599 Value *N = RHSI->getOperand(1);
2600 const Type *NTy = N->getType();
2601 if (uint32_t C2 = C1.logBase2()) {
2602 Constant *C2V = ConstantInt::get(NTy, C2);
2603 N = InsertNewInstBefore(BinaryOperator::createAdd(N, C2V, "tmp"), I);
2605 return BinaryOperator::createLShr(Op0, N);
2610 // udiv X, (Select Cond, C1, C2) --> Select Cond, (shr X, C1), (shr X, C2)
2611 // where C1&C2 are powers of two.
2612 if (SelectInst *SI = dyn_cast<SelectInst>(Op1))
2613 if (ConstantInt *STO = dyn_cast<ConstantInt>(SI->getOperand(1)))
2614 if (ConstantInt *SFO = dyn_cast<ConstantInt>(SI->getOperand(2))) {
2615 const APInt &TVA = STO->getValue(), &FVA = SFO->getValue();
2616 if (TVA.isPowerOf2() && FVA.isPowerOf2()) {
2617 // Compute the shift amounts
2618 uint32_t TSA = TVA.logBase2(), FSA = FVA.logBase2();
2619 // Construct the "on true" case of the select
2620 Constant *TC = ConstantInt::get(Op0->getType(), TSA);
2621 Instruction *TSI = BinaryOperator::createLShr(
2622 Op0, TC, SI->getName()+".t");
2623 TSI = InsertNewInstBefore(TSI, I);
2625 // Construct the "on false" case of the select
2626 Constant *FC = ConstantInt::get(Op0->getType(), FSA);
2627 Instruction *FSI = BinaryOperator::createLShr(
2628 Op0, FC, SI->getName()+".f");
2629 FSI = InsertNewInstBefore(FSI, I);
2631 // construct the select instruction and return it.
2632 return new SelectInst(SI->getOperand(0), TSI, FSI, SI->getName());
2638 Instruction *InstCombiner::visitSDiv(BinaryOperator &I) {
2639 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2641 // Handle the integer div common cases
2642 if (Instruction *Common = commonIDivTransforms(I))
2645 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
2647 if (RHS->isAllOnesValue())
2648 return BinaryOperator::createNeg(Op0);
2651 if (Value *LHSNeg = dyn_castNegVal(Op0))
2652 return BinaryOperator::createSDiv(LHSNeg, ConstantExpr::getNeg(RHS));
2655 // If the sign bits of both operands are zero (i.e. we can prove they are
2656 // unsigned inputs), turn this into a udiv.
2657 if (I.getType()->isInteger()) {
2658 APInt Mask(APInt::getSignBit(I.getType()->getPrimitiveSizeInBits()));
2659 if (MaskedValueIsZero(Op1, Mask) && MaskedValueIsZero(Op0, Mask)) {
2660 // X sdiv Y -> X udiv Y, iff X and Y don't have sign bit set
2661 return BinaryOperator::createUDiv(Op0, Op1, I.getName());
2668 Instruction *InstCombiner::visitFDiv(BinaryOperator &I) {
2669 return commonDivTransforms(I);
2672 /// GetFactor - If we can prove that the specified value is at least a multiple
2673 /// of some factor, return that factor.
2674 static Constant *GetFactor(Value *V) {
2675 if (ConstantInt *CI = dyn_cast<ConstantInt>(V))
2678 // Unless we can be tricky, we know this is a multiple of 1.
2679 Constant *Result = ConstantInt::get(V->getType(), 1);
2681 Instruction *I = dyn_cast<Instruction>(V);
2682 if (!I) return Result;
2684 if (I->getOpcode() == Instruction::Mul) {
2685 // Handle multiplies by a constant, etc.
2686 return ConstantExpr::getMul(GetFactor(I->getOperand(0)),
2687 GetFactor(I->getOperand(1)));
2688 } else if (I->getOpcode() == Instruction::Shl) {
2689 // (X<<C) -> X * (1 << C)
2690 if (Constant *ShRHS = dyn_cast<Constant>(I->getOperand(1))) {
2691 ShRHS = ConstantExpr::getShl(Result, ShRHS);
2692 return ConstantExpr::getMul(GetFactor(I->getOperand(0)), ShRHS);
2694 } else if (I->getOpcode() == Instruction::And) {
2695 if (ConstantInt *RHS = dyn_cast<ConstantInt>(I->getOperand(1))) {
2696 // X & 0xFFF0 is known to be a multiple of 16.
2697 uint32_t Zeros = RHS->getValue().countTrailingZeros();
2698 if (Zeros != V->getType()->getPrimitiveSizeInBits())// don't shift by "32"
2699 return ConstantExpr::getShl(Result,
2700 ConstantInt::get(Result->getType(), Zeros));
2702 } else if (CastInst *CI = dyn_cast<CastInst>(I)) {
2703 // Only handle int->int casts.
2704 if (!CI->isIntegerCast())
2706 Value *Op = CI->getOperand(0);
2707 return ConstantExpr::getCast(CI->getOpcode(), GetFactor(Op), V->getType());
2712 /// This function implements the transforms on rem instructions that work
2713 /// regardless of the kind of rem instruction it is (urem, srem, or frem). It
2714 /// is used by the visitors to those instructions.
2715 /// @brief Transforms common to all three rem instructions
2716 Instruction *InstCombiner::commonRemTransforms(BinaryOperator &I) {
2717 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2719 // 0 % X == 0, we don't need to preserve faults!
2720 if (Constant *LHS = dyn_cast<Constant>(Op0))
2721 if (LHS->isNullValue())
2722 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2724 if (isa<UndefValue>(Op0)) // undef % X -> 0
2725 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2726 if (isa<UndefValue>(Op1))
2727 return ReplaceInstUsesWith(I, Op1); // X % undef -> undef
2729 // Handle cases involving: rem X, (select Cond, Y, Z)
2730 if (SelectInst *SI = dyn_cast<SelectInst>(Op1)) {
2731 // rem X, (Cond ? 0 : Y) -> rem X, Y. If the rem and the select are in
2732 // the same basic block, then we replace the select with Y, and the
2733 // condition of the select with false (if the cond value is in the same
2734 // BB). If the select has uses other than the div, this allows them to be
2736 if (Constant *ST = dyn_cast<Constant>(SI->getOperand(1)))
2737 if (ST->isNullValue()) {
2738 Instruction *CondI = dyn_cast<Instruction>(SI->getOperand(0));
2739 if (CondI && CondI->getParent() == I.getParent())
2740 UpdateValueUsesWith(CondI, ConstantInt::getFalse());
2741 else if (I.getParent() != SI->getParent() || SI->hasOneUse())
2742 I.setOperand(1, SI->getOperand(2));
2744 UpdateValueUsesWith(SI, SI->getOperand(2));
2747 // Likewise for: rem X, (Cond ? Y : 0) -> rem X, Y
2748 if (Constant *ST = dyn_cast<Constant>(SI->getOperand(2)))
2749 if (ST->isNullValue()) {
2750 Instruction *CondI = dyn_cast<Instruction>(SI->getOperand(0));
2751 if (CondI && CondI->getParent() == I.getParent())
2752 UpdateValueUsesWith(CondI, ConstantInt::getTrue());
2753 else if (I.getParent() != SI->getParent() || SI->hasOneUse())
2754 I.setOperand(1, SI->getOperand(1));
2756 UpdateValueUsesWith(SI, SI->getOperand(1));
2764 /// This function implements the transforms common to both integer remainder
2765 /// instructions (urem and srem). It is called by the visitors to those integer
2766 /// remainder instructions.
2767 /// @brief Common integer remainder transforms
2768 Instruction *InstCombiner::commonIRemTransforms(BinaryOperator &I) {
2769 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2771 if (Instruction *common = commonRemTransforms(I))
2774 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
2775 // X % 0 == undef, we don't need to preserve faults!
2776 if (RHS->equalsInt(0))
2777 return ReplaceInstUsesWith(I, UndefValue::get(I.getType()));
2779 if (RHS->equalsInt(1)) // X % 1 == 0
2780 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2782 if (Instruction *Op0I = dyn_cast<Instruction>(Op0)) {
2783 if (SelectInst *SI = dyn_cast<SelectInst>(Op0I)) {
2784 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2786 } else if (isa<PHINode>(Op0I)) {
2787 if (Instruction *NV = FoldOpIntoPhi(I))
2790 // (X * C1) % C2 --> 0 iff C1 % C2 == 0
2791 if (ConstantExpr::getSRem(GetFactor(Op0I), RHS)->isNullValue())
2792 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2799 Instruction *InstCombiner::visitURem(BinaryOperator &I) {
2800 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2802 if (Instruction *common = commonIRemTransforms(I))
2805 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
2806 // X urem C^2 -> X and C
2807 // Check to see if this is an unsigned remainder with an exact power of 2,
2808 // if so, convert to a bitwise and.
2809 if (ConstantInt *C = dyn_cast<ConstantInt>(RHS))
2810 if (C->getValue().isPowerOf2())
2811 return BinaryOperator::createAnd(Op0, SubOne(C));
2814 if (Instruction *RHSI = dyn_cast<Instruction>(I.getOperand(1))) {
2815 // Turn A % (C << N), where C is 2^k, into A & ((C << N)-1)
2816 if (RHSI->getOpcode() == Instruction::Shl &&
2817 isa<ConstantInt>(RHSI->getOperand(0))) {
2818 if (cast<ConstantInt>(RHSI->getOperand(0))->getValue().isPowerOf2()) {
2819 Constant *N1 = ConstantInt::getAllOnesValue(I.getType());
2820 Value *Add = InsertNewInstBefore(BinaryOperator::createAdd(RHSI, N1,
2822 return BinaryOperator::createAnd(Op0, Add);
2827 // urem X, (select Cond, 2^C1, 2^C2) --> select Cond, (and X, C1), (and X, C2)
2828 // where C1&C2 are powers of two.
2829 if (SelectInst *SI = dyn_cast<SelectInst>(Op1)) {
2830 if (ConstantInt *STO = dyn_cast<ConstantInt>(SI->getOperand(1)))
2831 if (ConstantInt *SFO = dyn_cast<ConstantInt>(SI->getOperand(2))) {
2832 // STO == 0 and SFO == 0 handled above.
2833 if ((STO->getValue().isPowerOf2()) &&
2834 (SFO->getValue().isPowerOf2())) {
2835 Value *TrueAnd = InsertNewInstBefore(
2836 BinaryOperator::createAnd(Op0, SubOne(STO), SI->getName()+".t"), I);
2837 Value *FalseAnd = InsertNewInstBefore(
2838 BinaryOperator::createAnd(Op0, SubOne(SFO), SI->getName()+".f"), I);
2839 return new SelectInst(SI->getOperand(0), TrueAnd, FalseAnd);
2847 Instruction *InstCombiner::visitSRem(BinaryOperator &I) {
2848 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2850 // Handle the integer rem common cases
2851 if (Instruction *common = commonIRemTransforms(I))
2854 if (Value *RHSNeg = dyn_castNegVal(Op1))
2855 if (!isa<ConstantInt>(RHSNeg) ||
2856 cast<ConstantInt>(RHSNeg)->getValue().isStrictlyPositive()) {
2858 AddUsesToWorkList(I);
2859 I.setOperand(1, RHSNeg);
2863 // If the sign bits of both operands are zero (i.e. we can prove they are
2864 // unsigned inputs), turn this into a urem.
2865 if (I.getType()->isInteger()) {
2866 APInt Mask(APInt::getSignBit(I.getType()->getPrimitiveSizeInBits()));
2867 if (MaskedValueIsZero(Op1, Mask) && MaskedValueIsZero(Op0, Mask)) {
2868 // X srem Y -> X urem Y, iff X and Y don't have sign bit set
2869 return BinaryOperator::createURem(Op0, Op1, I.getName());
2876 Instruction *InstCombiner::visitFRem(BinaryOperator &I) {
2877 return commonRemTransforms(I);
2880 // isMaxValueMinusOne - return true if this is Max-1
2881 static bool isMaxValueMinusOne(const ConstantInt *C, bool isSigned) {
2882 uint32_t TypeBits = C->getType()->getPrimitiveSizeInBits();
2884 return C->getValue() == APInt::getAllOnesValue(TypeBits) - 1;
2885 return C->getValue() == APInt::getSignedMaxValue(TypeBits)-1;
2888 // isMinValuePlusOne - return true if this is Min+1
2889 static bool isMinValuePlusOne(const ConstantInt *C, bool isSigned) {
2891 return C->getValue() == 1; // unsigned
2893 // Calculate 1111111111000000000000
2894 uint32_t TypeBits = C->getType()->getPrimitiveSizeInBits();
2895 return C->getValue() == APInt::getSignedMinValue(TypeBits)+1;
2898 // isOneBitSet - Return true if there is exactly one bit set in the specified
2900 static bool isOneBitSet(const ConstantInt *CI) {
2901 return CI->getValue().isPowerOf2();
2904 // isHighOnes - Return true if the constant is of the form 1+0+.
2905 // This is the same as lowones(~X).
2906 static bool isHighOnes(const ConstantInt *CI) {
2907 return (~CI->getValue() + 1).isPowerOf2();
2910 /// getICmpCode - Encode a icmp predicate into a three bit mask. These bits
2911 /// are carefully arranged to allow folding of expressions such as:
2913 /// (A < B) | (A > B) --> (A != B)
2915 /// Note that this is only valid if the first and second predicates have the
2916 /// same sign. Is illegal to do: (A u< B) | (A s> B)
2918 /// Three bits are used to represent the condition, as follows:
2923 /// <=> Value Definition
2924 /// 000 0 Always false
2931 /// 111 7 Always true
2933 static unsigned getICmpCode(const ICmpInst *ICI) {
2934 switch (ICI->getPredicate()) {
2936 case ICmpInst::ICMP_UGT: return 1; // 001
2937 case ICmpInst::ICMP_SGT: return 1; // 001
2938 case ICmpInst::ICMP_EQ: return 2; // 010
2939 case ICmpInst::ICMP_UGE: return 3; // 011
2940 case ICmpInst::ICMP_SGE: return 3; // 011
2941 case ICmpInst::ICMP_ULT: return 4; // 100
2942 case ICmpInst::ICMP_SLT: return 4; // 100
2943 case ICmpInst::ICMP_NE: return 5; // 101
2944 case ICmpInst::ICMP_ULE: return 6; // 110
2945 case ICmpInst::ICMP_SLE: return 6; // 110
2948 assert(0 && "Invalid ICmp predicate!");
2953 /// getICmpValue - This is the complement of getICmpCode, which turns an
2954 /// opcode and two operands into either a constant true or false, or a brand
2955 /// new ICmp instruction. The sign is passed in to determine which kind
2956 /// of predicate to use in new icmp instructions.
2957 static Value *getICmpValue(bool sign, unsigned code, Value *LHS, Value *RHS) {
2959 default: assert(0 && "Illegal ICmp code!");
2960 case 0: return ConstantInt::getFalse();
2963 return new ICmpInst(ICmpInst::ICMP_SGT, LHS, RHS);
2965 return new ICmpInst(ICmpInst::ICMP_UGT, LHS, RHS);
2966 case 2: return new ICmpInst(ICmpInst::ICMP_EQ, LHS, RHS);
2969 return new ICmpInst(ICmpInst::ICMP_SGE, LHS, RHS);
2971 return new ICmpInst(ICmpInst::ICMP_UGE, LHS, RHS);
2974 return new ICmpInst(ICmpInst::ICMP_SLT, LHS, RHS);
2976 return new ICmpInst(ICmpInst::ICMP_ULT, LHS, RHS);
2977 case 5: return new ICmpInst(ICmpInst::ICMP_NE, LHS, RHS);
2980 return new ICmpInst(ICmpInst::ICMP_SLE, LHS, RHS);
2982 return new ICmpInst(ICmpInst::ICMP_ULE, LHS, RHS);
2983 case 7: return ConstantInt::getTrue();
2987 static bool PredicatesFoldable(ICmpInst::Predicate p1, ICmpInst::Predicate p2) {
2988 return (ICmpInst::isSignedPredicate(p1) == ICmpInst::isSignedPredicate(p2)) ||
2989 (ICmpInst::isSignedPredicate(p1) &&
2990 (p2 == ICmpInst::ICMP_EQ || p2 == ICmpInst::ICMP_NE)) ||
2991 (ICmpInst::isSignedPredicate(p2) &&
2992 (p1 == ICmpInst::ICMP_EQ || p1 == ICmpInst::ICMP_NE));
2996 // FoldICmpLogical - Implements (icmp1 A, B) & (icmp2 A, B) --> (icmp3 A, B)
2997 struct FoldICmpLogical {
3000 ICmpInst::Predicate pred;
3001 FoldICmpLogical(InstCombiner &ic, ICmpInst *ICI)
3002 : IC(ic), LHS(ICI->getOperand(0)), RHS(ICI->getOperand(1)),
3003 pred(ICI->getPredicate()) {}
3004 bool shouldApply(Value *V) const {
3005 if (ICmpInst *ICI = dyn_cast<ICmpInst>(V))
3006 if (PredicatesFoldable(pred, ICI->getPredicate()))
3007 return (ICI->getOperand(0) == LHS && ICI->getOperand(1) == RHS ||
3008 ICI->getOperand(0) == RHS && ICI->getOperand(1) == LHS);
3011 Instruction *apply(Instruction &Log) const {
3012 ICmpInst *ICI = cast<ICmpInst>(Log.getOperand(0));
3013 if (ICI->getOperand(0) != LHS) {
3014 assert(ICI->getOperand(1) == LHS);
3015 ICI->swapOperands(); // Swap the LHS and RHS of the ICmp
3018 ICmpInst *RHSICI = cast<ICmpInst>(Log.getOperand(1));
3019 unsigned LHSCode = getICmpCode(ICI);
3020 unsigned RHSCode = getICmpCode(RHSICI);
3022 switch (Log.getOpcode()) {
3023 case Instruction::And: Code = LHSCode & RHSCode; break;
3024 case Instruction::Or: Code = LHSCode | RHSCode; break;
3025 case Instruction::Xor: Code = LHSCode ^ RHSCode; break;
3026 default: assert(0 && "Illegal logical opcode!"); return 0;
3029 bool isSigned = ICmpInst::isSignedPredicate(RHSICI->getPredicate()) ||
3030 ICmpInst::isSignedPredicate(ICI->getPredicate());
3032 Value *RV = getICmpValue(isSigned, Code, LHS, RHS);
3033 if (Instruction *I = dyn_cast<Instruction>(RV))
3035 // Otherwise, it's a constant boolean value...
3036 return IC.ReplaceInstUsesWith(Log, RV);
3039 } // end anonymous namespace
3041 // OptAndOp - This handles expressions of the form ((val OP C1) & C2). Where
3042 // the Op parameter is 'OP', OpRHS is 'C1', and AndRHS is 'C2'. Op is
3043 // guaranteed to be a binary operator.
3044 Instruction *InstCombiner::OptAndOp(Instruction *Op,
3046 ConstantInt *AndRHS,
3047 BinaryOperator &TheAnd) {
3048 Value *X = Op->getOperand(0);
3049 Constant *Together = 0;
3051 Together = And(AndRHS, OpRHS);
3053 switch (Op->getOpcode()) {
3054 case Instruction::Xor:
3055 if (Op->hasOneUse()) {
3056 // (X ^ C1) & C2 --> (X & C2) ^ (C1&C2)
3057 Instruction *And = BinaryOperator::createAnd(X, AndRHS);
3058 InsertNewInstBefore(And, TheAnd);
3060 return BinaryOperator::createXor(And, Together);
3063 case Instruction::Or:
3064 if (Together == AndRHS) // (X | C) & C --> C
3065 return ReplaceInstUsesWith(TheAnd, AndRHS);
3067 if (Op->hasOneUse() && Together != OpRHS) {
3068 // (X | C1) & C2 --> (X | (C1&C2)) & C2
3069 Instruction *Or = BinaryOperator::createOr(X, Together);
3070 InsertNewInstBefore(Or, TheAnd);
3072 return BinaryOperator::createAnd(Or, AndRHS);
3075 case Instruction::Add:
3076 if (Op->hasOneUse()) {
3077 // Adding a one to a single bit bit-field should be turned into an XOR
3078 // of the bit. First thing to check is to see if this AND is with a
3079 // single bit constant.
3080 const APInt& AndRHSV = cast<ConstantInt>(AndRHS)->getValue();
3082 // If there is only one bit set...
3083 if (isOneBitSet(cast<ConstantInt>(AndRHS))) {
3084 // Ok, at this point, we know that we are masking the result of the
3085 // ADD down to exactly one bit. If the constant we are adding has
3086 // no bits set below this bit, then we can eliminate the ADD.
3087 const APInt& AddRHS = cast<ConstantInt>(OpRHS)->getValue();
3089 // Check to see if any bits below the one bit set in AndRHSV are set.
3090 if ((AddRHS & (AndRHSV-1)) == 0) {
3091 // If not, the only thing that can effect the output of the AND is
3092 // the bit specified by AndRHSV. If that bit is set, the effect of
3093 // the XOR is to toggle the bit. If it is clear, then the ADD has
3095 if ((AddRHS & AndRHSV) == 0) { // Bit is not set, noop
3096 TheAnd.setOperand(0, X);
3099 // Pull the XOR out of the AND.
3100 Instruction *NewAnd = BinaryOperator::createAnd(X, AndRHS);
3101 InsertNewInstBefore(NewAnd, TheAnd);
3102 NewAnd->takeName(Op);
3103 return BinaryOperator::createXor(NewAnd, AndRHS);
3110 case Instruction::Shl: {
3111 // We know that the AND will not produce any of the bits shifted in, so if
3112 // the anded constant includes them, clear them now!
3114 uint32_t BitWidth = AndRHS->getType()->getBitWidth();
3115 uint32_t OpRHSVal = OpRHS->getLimitedValue(BitWidth);
3116 APInt ShlMask(APInt::getHighBitsSet(BitWidth, BitWidth-OpRHSVal));
3117 ConstantInt *CI = ConstantInt::get(AndRHS->getValue() & ShlMask);
3119 if (CI->getValue() == ShlMask) {
3120 // Masking out bits that the shift already masks
3121 return ReplaceInstUsesWith(TheAnd, Op); // No need for the and.
3122 } else if (CI != AndRHS) { // Reducing bits set in and.
3123 TheAnd.setOperand(1, CI);
3128 case Instruction::LShr:
3130 // We know that the AND will not produce any of the bits shifted in, so if
3131 // the anded constant includes them, clear them now! This only applies to
3132 // unsigned shifts, because a signed shr may bring in set bits!
3134 uint32_t BitWidth = AndRHS->getType()->getBitWidth();
3135 uint32_t OpRHSVal = OpRHS->getLimitedValue(BitWidth);
3136 APInt ShrMask(APInt::getLowBitsSet(BitWidth, BitWidth - OpRHSVal));
3137 ConstantInt *CI = ConstantInt::get(AndRHS->getValue() & ShrMask);
3139 if (CI->getValue() == ShrMask) {
3140 // Masking out bits that the shift already masks.
3141 return ReplaceInstUsesWith(TheAnd, Op);
3142 } else if (CI != AndRHS) {
3143 TheAnd.setOperand(1, CI); // Reduce bits set in and cst.
3148 case Instruction::AShr:
3150 // See if this is shifting in some sign extension, then masking it out
3152 if (Op->hasOneUse()) {
3153 uint32_t BitWidth = AndRHS->getType()->getBitWidth();
3154 uint32_t OpRHSVal = OpRHS->getLimitedValue(BitWidth);
3155 APInt ShrMask(APInt::getLowBitsSet(BitWidth, BitWidth - OpRHSVal));
3156 Constant *C = ConstantInt::get(AndRHS->getValue() & ShrMask);
3157 if (C == AndRHS) { // Masking out bits shifted in.
3158 // (Val ashr C1) & C2 -> (Val lshr C1) & C2
3159 // Make the argument unsigned.
3160 Value *ShVal = Op->getOperand(0);
3161 ShVal = InsertNewInstBefore(
3162 BinaryOperator::createLShr(ShVal, OpRHS,
3163 Op->getName()), TheAnd);
3164 return BinaryOperator::createAnd(ShVal, AndRHS, TheAnd.getName());
3173 /// InsertRangeTest - Emit a computation of: (V >= Lo && V < Hi) if Inside is
3174 /// true, otherwise (V < Lo || V >= Hi). In pratice, we emit the more efficient
3175 /// (V-Lo) <u Hi-Lo. This method expects that Lo <= Hi. isSigned indicates
3176 /// whether to treat the V, Lo and HI as signed or not. IB is the location to
3177 /// insert new instructions.
3178 Instruction *InstCombiner::InsertRangeTest(Value *V, Constant *Lo, Constant *Hi,
3179 bool isSigned, bool Inside,
3181 assert(cast<ConstantInt>(ConstantExpr::getICmp((isSigned ?
3182 ICmpInst::ICMP_SLE:ICmpInst::ICMP_ULE), Lo, Hi))->getZExtValue() &&
3183 "Lo is not <= Hi in range emission code!");
3186 if (Lo == Hi) // Trivially false.
3187 return new ICmpInst(ICmpInst::ICMP_NE, V, V);
3189 // V >= Min && V < Hi --> V < Hi
3190 if (cast<ConstantInt>(Lo)->isMinValue(isSigned)) {
3191 ICmpInst::Predicate pred = (isSigned ?
3192 ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT);
3193 return new ICmpInst(pred, V, Hi);
3196 // Emit V-Lo <u Hi-Lo
3197 Constant *NegLo = ConstantExpr::getNeg(Lo);
3198 Instruction *Add = BinaryOperator::createAdd(V, NegLo, V->getName()+".off");
3199 InsertNewInstBefore(Add, IB);
3200 Constant *UpperBound = ConstantExpr::getAdd(NegLo, Hi);
3201 return new ICmpInst(ICmpInst::ICMP_ULT, Add, UpperBound);
3204 if (Lo == Hi) // Trivially true.
3205 return new ICmpInst(ICmpInst::ICMP_EQ, V, V);
3207 // V < Min || V >= Hi -> V > Hi-1
3208 Hi = SubOne(cast<ConstantInt>(Hi));
3209 if (cast<ConstantInt>(Lo)->isMinValue(isSigned)) {
3210 ICmpInst::Predicate pred = (isSigned ?
3211 ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT);
3212 return new ICmpInst(pred, V, Hi);
3215 // Emit V-Lo >u Hi-1-Lo
3216 // Note that Hi has already had one subtracted from it, above.
3217 ConstantInt *NegLo = cast<ConstantInt>(ConstantExpr::getNeg(Lo));
3218 Instruction *Add = BinaryOperator::createAdd(V, NegLo, V->getName()+".off");
3219 InsertNewInstBefore(Add, IB);
3220 Constant *LowerBound = ConstantExpr::getAdd(NegLo, Hi);
3221 return new ICmpInst(ICmpInst::ICMP_UGT, Add, LowerBound);
3224 // isRunOfOnes - Returns true iff Val consists of one contiguous run of 1s with
3225 // any number of 0s on either side. The 1s are allowed to wrap from LSB to
3226 // MSB, so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is
3227 // not, since all 1s are not contiguous.
3228 static bool isRunOfOnes(ConstantInt *Val, uint32_t &MB, uint32_t &ME) {
3229 const APInt& V = Val->getValue();
3230 uint32_t BitWidth = Val->getType()->getBitWidth();
3231 if (!APIntOps::isShiftedMask(BitWidth, V)) return false;
3233 // look for the first zero bit after the run of ones
3234 MB = BitWidth - ((V - 1) ^ V).countLeadingZeros();
3235 // look for the first non-zero bit
3236 ME = V.getActiveBits();
3240 /// FoldLogicalPlusAnd - This is part of an expression (LHS +/- RHS) & Mask,
3241 /// where isSub determines whether the operator is a sub. If we can fold one of
3242 /// the following xforms:
3244 /// ((A & N) +/- B) & Mask -> (A +/- B) & Mask iff N&Mask == Mask
3245 /// ((A | N) +/- B) & Mask -> (A +/- B) & Mask iff N&Mask == 0
3246 /// ((A ^ N) +/- B) & Mask -> (A +/- B) & Mask iff N&Mask == 0
3248 /// return (A +/- B).
3250 Value *InstCombiner::FoldLogicalPlusAnd(Value *LHS, Value *RHS,
3251 ConstantInt *Mask, bool isSub,
3253 Instruction *LHSI = dyn_cast<Instruction>(LHS);
3254 if (!LHSI || LHSI->getNumOperands() != 2 ||
3255 !isa<ConstantInt>(LHSI->getOperand(1))) return 0;
3257 ConstantInt *N = cast<ConstantInt>(LHSI->getOperand(1));
3259 switch (LHSI->getOpcode()) {
3261 case Instruction::And:
3262 if (And(N, Mask) == Mask) {
3263 // If the AndRHS is a power of two minus one (0+1+), this is simple.
3264 if ((Mask->getValue().countLeadingZeros() +
3265 Mask->getValue().countPopulation()) ==
3266 Mask->getValue().getBitWidth())
3269 // Otherwise, if Mask is 0+1+0+, and if B is known to have the low 0+
3270 // part, we don't need any explicit masks to take them out of A. If that
3271 // is all N is, ignore it.
3272 uint32_t MB = 0, ME = 0;
3273 if (isRunOfOnes(Mask, MB, ME)) { // begin/end bit of run, inclusive
3274 uint32_t BitWidth = cast<IntegerType>(RHS->getType())->getBitWidth();
3275 APInt Mask(APInt::getLowBitsSet(BitWidth, MB-1));
3276 if (MaskedValueIsZero(RHS, Mask))
3281 case Instruction::Or:
3282 case Instruction::Xor:
3283 // If the AndRHS is a power of two minus one (0+1+), and N&Mask == 0
3284 if ((Mask->getValue().countLeadingZeros() +
3285 Mask->getValue().countPopulation()) == Mask->getValue().getBitWidth()
3286 && And(N, Mask)->isZero())
3293 New = BinaryOperator::createSub(LHSI->getOperand(0), RHS, "fold");
3295 New = BinaryOperator::createAdd(LHSI->getOperand(0), RHS, "fold");
3296 return InsertNewInstBefore(New, I);
3299 Instruction *InstCombiner::visitAnd(BinaryOperator &I) {
3300 bool Changed = SimplifyCommutative(I);
3301 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3303 if (isa<UndefValue>(Op1)) // X & undef -> 0
3304 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
3308 return ReplaceInstUsesWith(I, Op1);
3310 // See if we can simplify any instructions used by the instruction whose sole
3311 // purpose is to compute bits we don't care about.
3312 if (!isa<VectorType>(I.getType())) {
3313 uint32_t BitWidth = cast<IntegerType>(I.getType())->getBitWidth();
3314 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
3315 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
3316 KnownZero, KnownOne))
3319 if (ConstantVector *CP = dyn_cast<ConstantVector>(Op1)) {
3320 if (CP->isAllOnesValue()) // X & <-1,-1> -> X
3321 return ReplaceInstUsesWith(I, I.getOperand(0));
3322 } else if (isa<ConstantAggregateZero>(Op1)) {
3323 return ReplaceInstUsesWith(I, Op1); // X & <0,0> -> <0,0>
3327 if (ConstantInt *AndRHS = dyn_cast<ConstantInt>(Op1)) {
3328 const APInt& AndRHSMask = AndRHS->getValue();
3329 APInt NotAndRHS(~AndRHSMask);
3331 // Optimize a variety of ((val OP C1) & C2) combinations...
3332 if (isa<BinaryOperator>(Op0)) {
3333 Instruction *Op0I = cast<Instruction>(Op0);
3334 Value *Op0LHS = Op0I->getOperand(0);
3335 Value *Op0RHS = Op0I->getOperand(1);
3336 switch (Op0I->getOpcode()) {
3337 case Instruction::Xor:
3338 case Instruction::Or:
3339 // If the mask is only needed on one incoming arm, push it up.
3340 if (Op0I->hasOneUse()) {
3341 if (MaskedValueIsZero(Op0LHS, NotAndRHS)) {
3342 // Not masking anything out for the LHS, move to RHS.
3343 Instruction *NewRHS = BinaryOperator::createAnd(Op0RHS, AndRHS,
3344 Op0RHS->getName()+".masked");
3345 InsertNewInstBefore(NewRHS, I);
3346 return BinaryOperator::create(
3347 cast<BinaryOperator>(Op0I)->getOpcode(), Op0LHS, NewRHS);
3349 if (!isa<Constant>(Op0RHS) &&
3350 MaskedValueIsZero(Op0RHS, NotAndRHS)) {
3351 // Not masking anything out for the RHS, move to LHS.
3352 Instruction *NewLHS = BinaryOperator::createAnd(Op0LHS, AndRHS,
3353 Op0LHS->getName()+".masked");
3354 InsertNewInstBefore(NewLHS, I);
3355 return BinaryOperator::create(
3356 cast<BinaryOperator>(Op0I)->getOpcode(), NewLHS, Op0RHS);
3361 case Instruction::Add:
3362 // ((A & N) + B) & AndRHS -> (A + B) & AndRHS iff N&AndRHS == AndRHS.
3363 // ((A | N) + B) & AndRHS -> (A + B) & AndRHS iff N&AndRHS == 0
3364 // ((A ^ N) + B) & AndRHS -> (A + B) & AndRHS iff N&AndRHS == 0
3365 if (Value *V = FoldLogicalPlusAnd(Op0LHS, Op0RHS, AndRHS, false, I))
3366 return BinaryOperator::createAnd(V, AndRHS);
3367 if (Value *V = FoldLogicalPlusAnd(Op0RHS, Op0LHS, AndRHS, false, I))
3368 return BinaryOperator::createAnd(V, AndRHS); // Add commutes
3371 case Instruction::Sub:
3372 // ((A & N) - B) & AndRHS -> (A - B) & AndRHS iff N&AndRHS == AndRHS.
3373 // ((A | N) - B) & AndRHS -> (A - B) & AndRHS iff N&AndRHS == 0
3374 // ((A ^ N) - B) & AndRHS -> (A - B) & AndRHS iff N&AndRHS == 0
3375 if (Value *V = FoldLogicalPlusAnd(Op0LHS, Op0RHS, AndRHS, true, I))
3376 return BinaryOperator::createAnd(V, AndRHS);
3380 if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1)))
3381 if (Instruction *Res = OptAndOp(Op0I, Op0CI, AndRHS, I))
3383 } else if (CastInst *CI = dyn_cast<CastInst>(Op0)) {
3384 // If this is an integer truncation or change from signed-to-unsigned, and
3385 // if the source is an and/or with immediate, transform it. This
3386 // frequently occurs for bitfield accesses.
3387 if (Instruction *CastOp = dyn_cast<Instruction>(CI->getOperand(0))) {
3388 if ((isa<TruncInst>(CI) || isa<BitCastInst>(CI)) &&
3389 CastOp->getNumOperands() == 2)
3390 if (ConstantInt *AndCI = dyn_cast<ConstantInt>(CastOp->getOperand(1)))
3391 if (CastOp->getOpcode() == Instruction::And) {
3392 // Change: and (cast (and X, C1) to T), C2
3393 // into : and (cast X to T), trunc_or_bitcast(C1)&C2
3394 // This will fold the two constants together, which may allow
3395 // other simplifications.
3396 Instruction *NewCast = CastInst::createTruncOrBitCast(
3397 CastOp->getOperand(0), I.getType(),
3398 CastOp->getName()+".shrunk");
3399 NewCast = InsertNewInstBefore(NewCast, I);
3400 // trunc_or_bitcast(C1)&C2
3401 Constant *C3 = ConstantExpr::getTruncOrBitCast(AndCI,I.getType());
3402 C3 = ConstantExpr::getAnd(C3, AndRHS);
3403 return BinaryOperator::createAnd(NewCast, C3);
3404 } else if (CastOp->getOpcode() == Instruction::Or) {
3405 // Change: and (cast (or X, C1) to T), C2
3406 // into : trunc(C1)&C2 iff trunc(C1)&C2 == C2
3407 Constant *C3 = ConstantExpr::getTruncOrBitCast(AndCI,I.getType());
3408 if (ConstantExpr::getAnd(C3, AndRHS) == AndRHS) // trunc(C1)&C2
3409 return ReplaceInstUsesWith(I, AndRHS);
3414 // Try to fold constant and into select arguments.
3415 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
3416 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
3418 if (isa<PHINode>(Op0))
3419 if (Instruction *NV = FoldOpIntoPhi(I))
3423 Value *Op0NotVal = dyn_castNotVal(Op0);
3424 Value *Op1NotVal = dyn_castNotVal(Op1);
3426 if (Op0NotVal == Op1 || Op1NotVal == Op0) // A & ~A == ~A & A == 0
3427 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
3429 // (~A & ~B) == (~(A | B)) - De Morgan's Law
3430 if (Op0NotVal && Op1NotVal && isOnlyUse(Op0) && isOnlyUse(Op1)) {
3431 Instruction *Or = BinaryOperator::createOr(Op0NotVal, Op1NotVal,
3432 I.getName()+".demorgan");
3433 InsertNewInstBefore(Or, I);
3434 return BinaryOperator::createNot(Or);
3438 Value *A = 0, *B = 0, *C = 0, *D = 0;
3439 if (match(Op0, m_Or(m_Value(A), m_Value(B)))) {
3440 if (A == Op1 || B == Op1) // (A | ?) & A --> A
3441 return ReplaceInstUsesWith(I, Op1);
3443 // (A|B) & ~(A&B) -> A^B
3444 if (match(Op1, m_Not(m_And(m_Value(C), m_Value(D))))) {
3445 if ((A == C && B == D) || (A == D && B == C))
3446 return BinaryOperator::createXor(A, B);
3450 if (match(Op1, m_Or(m_Value(A), m_Value(B)))) {
3451 if (A == Op0 || B == Op0) // A & (A | ?) --> A
3452 return ReplaceInstUsesWith(I, Op0);
3454 // ~(A&B) & (A|B) -> A^B
3455 if (match(Op0, m_Not(m_And(m_Value(C), m_Value(D))))) {
3456 if ((A == C && B == D) || (A == D && B == C))
3457 return BinaryOperator::createXor(A, B);
3461 if (Op0->hasOneUse() &&
3462 match(Op0, m_Xor(m_Value(A), m_Value(B)))) {
3463 if (A == Op1) { // (A^B)&A -> A&(A^B)
3464 I.swapOperands(); // Simplify below
3465 std::swap(Op0, Op1);
3466 } else if (B == Op1) { // (A^B)&B -> B&(B^A)
3467 cast<BinaryOperator>(Op0)->swapOperands();
3468 I.swapOperands(); // Simplify below
3469 std::swap(Op0, Op1);
3472 if (Op1->hasOneUse() &&
3473 match(Op1, m_Xor(m_Value(A), m_Value(B)))) {
3474 if (B == Op0) { // B&(A^B) -> B&(B^A)
3475 cast<BinaryOperator>(Op1)->swapOperands();
3478 if (A == Op0) { // A&(A^B) -> A & ~B
3479 Instruction *NotB = BinaryOperator::createNot(B, "tmp");
3480 InsertNewInstBefore(NotB, I);
3481 return BinaryOperator::createAnd(A, NotB);
3486 if (ICmpInst *RHS = dyn_cast<ICmpInst>(Op1)) {
3487 // (icmp1 A, B) & (icmp2 A, B) --> (icmp3 A, B)
3488 if (Instruction *R = AssociativeOpt(I, FoldICmpLogical(*this, RHS)))
3491 Value *LHSVal, *RHSVal;
3492 ConstantInt *LHSCst, *RHSCst;
3493 ICmpInst::Predicate LHSCC, RHSCC;
3494 if (match(Op0, m_ICmp(LHSCC, m_Value(LHSVal), m_ConstantInt(LHSCst))))
3495 if (match(RHS, m_ICmp(RHSCC, m_Value(RHSVal), m_ConstantInt(RHSCst))))
3496 if (LHSVal == RHSVal && // Found (X icmp C1) & (X icmp C2)
3497 // ICMP_[GL]E X, CST is folded to ICMP_[GL]T elsewhere.
3498 LHSCC != ICmpInst::ICMP_UGE && LHSCC != ICmpInst::ICMP_ULE &&
3499 RHSCC != ICmpInst::ICMP_UGE && RHSCC != ICmpInst::ICMP_ULE &&
3500 LHSCC != ICmpInst::ICMP_SGE && LHSCC != ICmpInst::ICMP_SLE &&
3501 RHSCC != ICmpInst::ICMP_SGE && RHSCC != ICmpInst::ICMP_SLE &&
3503 // Don't try to fold ICMP_SLT + ICMP_ULT.
3504 (ICmpInst::isEquality(LHSCC) || ICmpInst::isEquality(RHSCC) ||
3505 ICmpInst::isSignedPredicate(LHSCC) ==
3506 ICmpInst::isSignedPredicate(RHSCC))) {
3507 // Ensure that the larger constant is on the RHS.
3508 ICmpInst::Predicate GT = ICmpInst::isSignedPredicate(LHSCC) ?
3509 ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT;
3510 Constant *Cmp = ConstantExpr::getICmp(GT, LHSCst, RHSCst);
3511 ICmpInst *LHS = cast<ICmpInst>(Op0);
3512 if (cast<ConstantInt>(Cmp)->getZExtValue()) {
3513 std::swap(LHS, RHS);
3514 std::swap(LHSCst, RHSCst);
3515 std::swap(LHSCC, RHSCC);
3518 // At this point, we know we have have two icmp instructions
3519 // comparing a value against two constants and and'ing the result
3520 // together. Because of the above check, we know that we only have
3521 // icmp eq, icmp ne, icmp [su]lt, and icmp [SU]gt here. We also know
3522 // (from the FoldICmpLogical check above), that the two constants
3523 // are not equal and that the larger constant is on the RHS
3524 assert(LHSCst != RHSCst && "Compares not folded above?");
3527 default: assert(0 && "Unknown integer condition code!");
3528 case ICmpInst::ICMP_EQ:
3530 default: assert(0 && "Unknown integer condition code!");
3531 case ICmpInst::ICMP_EQ: // (X == 13 & X == 15) -> false
3532 case ICmpInst::ICMP_UGT: // (X == 13 & X > 15) -> false
3533 case ICmpInst::ICMP_SGT: // (X == 13 & X > 15) -> false
3534 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
3535 case ICmpInst::ICMP_NE: // (X == 13 & X != 15) -> X == 13
3536 case ICmpInst::ICMP_ULT: // (X == 13 & X < 15) -> X == 13
3537 case ICmpInst::ICMP_SLT: // (X == 13 & X < 15) -> X == 13
3538 return ReplaceInstUsesWith(I, LHS);
3540 case ICmpInst::ICMP_NE:
3542 default: assert(0 && "Unknown integer condition code!");
3543 case ICmpInst::ICMP_ULT:
3544 if (LHSCst == SubOne(RHSCst)) // (X != 13 & X u< 14) -> X < 13
3545 return new ICmpInst(ICmpInst::ICMP_ULT, LHSVal, LHSCst);
3546 break; // (X != 13 & X u< 15) -> no change
3547 case ICmpInst::ICMP_SLT:
3548 if (LHSCst == SubOne(RHSCst)) // (X != 13 & X s< 14) -> X < 13
3549 return new ICmpInst(ICmpInst::ICMP_SLT, LHSVal, LHSCst);
3550 break; // (X != 13 & X s< 15) -> no change
3551 case ICmpInst::ICMP_EQ: // (X != 13 & X == 15) -> X == 15
3552 case ICmpInst::ICMP_UGT: // (X != 13 & X u> 15) -> X u> 15
3553 case ICmpInst::ICMP_SGT: // (X != 13 & X s> 15) -> X s> 15
3554 return ReplaceInstUsesWith(I, RHS);
3555 case ICmpInst::ICMP_NE:
3556 if (LHSCst == SubOne(RHSCst)){// (X != 13 & X != 14) -> X-13 >u 1
3557 Constant *AddCST = ConstantExpr::getNeg(LHSCst);
3558 Instruction *Add = BinaryOperator::createAdd(LHSVal, AddCST,
3559 LHSVal->getName()+".off");
3560 InsertNewInstBefore(Add, I);
3561 return new ICmpInst(ICmpInst::ICMP_UGT, Add,
3562 ConstantInt::get(Add->getType(), 1));
3564 break; // (X != 13 & X != 15) -> no change
3567 case ICmpInst::ICMP_ULT:
3569 default: assert(0 && "Unknown integer condition code!");
3570 case ICmpInst::ICMP_EQ: // (X u< 13 & X == 15) -> false
3571 case ICmpInst::ICMP_UGT: // (X u< 13 & X u> 15) -> false
3572 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
3573 case ICmpInst::ICMP_SGT: // (X u< 13 & X s> 15) -> no change
3575 case ICmpInst::ICMP_NE: // (X u< 13 & X != 15) -> X u< 13
3576 case ICmpInst::ICMP_ULT: // (X u< 13 & X u< 15) -> X u< 13
3577 return ReplaceInstUsesWith(I, LHS);
3578 case ICmpInst::ICMP_SLT: // (X u< 13 & X s< 15) -> no change
3582 case ICmpInst::ICMP_SLT:
3584 default: assert(0 && "Unknown integer condition code!");
3585 case ICmpInst::ICMP_EQ: // (X s< 13 & X == 15) -> false
3586 case ICmpInst::ICMP_SGT: // (X s< 13 & X s> 15) -> false
3587 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
3588 case ICmpInst::ICMP_UGT: // (X s< 13 & X u> 15) -> no change
3590 case ICmpInst::ICMP_NE: // (X s< 13 & X != 15) -> X < 13
3591 case ICmpInst::ICMP_SLT: // (X s< 13 & X s< 15) -> X < 13
3592 return ReplaceInstUsesWith(I, LHS);
3593 case ICmpInst::ICMP_ULT: // (X s< 13 & X u< 15) -> no change
3597 case ICmpInst::ICMP_UGT:
3599 default: assert(0 && "Unknown integer condition code!");
3600 case ICmpInst::ICMP_EQ: // (X u> 13 & X == 15) -> X > 13
3601 return ReplaceInstUsesWith(I, LHS);
3602 case ICmpInst::ICMP_UGT: // (X u> 13 & X u> 15) -> X u> 15
3603 return ReplaceInstUsesWith(I, RHS);
3604 case ICmpInst::ICMP_SGT: // (X u> 13 & X s> 15) -> no change
3606 case ICmpInst::ICMP_NE:
3607 if (RHSCst == AddOne(LHSCst)) // (X u> 13 & X != 14) -> X u> 14
3608 return new ICmpInst(LHSCC, LHSVal, RHSCst);
3609 break; // (X u> 13 & X != 15) -> no change
3610 case ICmpInst::ICMP_ULT: // (X u> 13 & X u< 15) ->(X-14) <u 1
3611 return InsertRangeTest(LHSVal, AddOne(LHSCst), RHSCst, false,
3613 case ICmpInst::ICMP_SLT: // (X u> 13 & X s< 15) -> no change
3617 case ICmpInst::ICMP_SGT:
3619 default: assert(0 && "Unknown integer condition code!");
3620 case ICmpInst::ICMP_EQ: // (X s> 13 & X == 15) -> X == 15
3621 case ICmpInst::ICMP_SGT: // (X s> 13 & X s> 15) -> X s> 15
3622 return ReplaceInstUsesWith(I, RHS);
3623 case ICmpInst::ICMP_UGT: // (X s> 13 & X u> 15) -> no change
3625 case ICmpInst::ICMP_NE:
3626 if (RHSCst == AddOne(LHSCst)) // (X s> 13 & X != 14) -> X s> 14
3627 return new ICmpInst(LHSCC, LHSVal, RHSCst);
3628 break; // (X s> 13 & X != 15) -> no change
3629 case ICmpInst::ICMP_SLT: // (X s> 13 & X s< 15) ->(X-14) s< 1
3630 return InsertRangeTest(LHSVal, AddOne(LHSCst), RHSCst, true,
3632 case ICmpInst::ICMP_ULT: // (X s> 13 & X u< 15) -> no change
3640 // fold (and (cast A), (cast B)) -> (cast (and A, B))
3641 if (CastInst *Op0C = dyn_cast<CastInst>(Op0))
3642 if (CastInst *Op1C = dyn_cast<CastInst>(Op1))
3643 if (Op0C->getOpcode() == Op1C->getOpcode()) { // same cast kind ?
3644 const Type *SrcTy = Op0C->getOperand(0)->getType();
3645 if (SrcTy == Op1C->getOperand(0)->getType() && SrcTy->isInteger() &&
3646 // Only do this if the casts both really cause code to be generated.
3647 ValueRequiresCast(Op0C->getOpcode(), Op0C->getOperand(0),
3649 ValueRequiresCast(Op1C->getOpcode(), Op1C->getOperand(0),
3651 Instruction *NewOp = BinaryOperator::createAnd(Op0C->getOperand(0),
3652 Op1C->getOperand(0),
3654 InsertNewInstBefore(NewOp, I);
3655 return CastInst::create(Op0C->getOpcode(), NewOp, I.getType());
3659 // (X >> Z) & (Y >> Z) -> (X&Y) >> Z for all shifts.
3660 if (BinaryOperator *SI1 = dyn_cast<BinaryOperator>(Op1)) {
3661 if (BinaryOperator *SI0 = dyn_cast<BinaryOperator>(Op0))
3662 if (SI0->isShift() && SI0->getOpcode() == SI1->getOpcode() &&
3663 SI0->getOperand(1) == SI1->getOperand(1) &&
3664 (SI0->hasOneUse() || SI1->hasOneUse())) {
3665 Instruction *NewOp =
3666 InsertNewInstBefore(BinaryOperator::createAnd(SI0->getOperand(0),
3668 SI0->getName()), I);
3669 return BinaryOperator::create(SI1->getOpcode(), NewOp,
3670 SI1->getOperand(1));
3674 // (fcmp ord x, c) & (fcmp ord y, c) -> (fcmp ord x, y)
3675 if (FCmpInst *LHS = dyn_cast<FCmpInst>(I.getOperand(0))) {
3676 if (FCmpInst *RHS = dyn_cast<FCmpInst>(I.getOperand(1))) {
3677 if (LHS->getPredicate() == FCmpInst::FCMP_ORD &&
3678 RHS->getPredicate() == FCmpInst::FCMP_ORD)
3679 if (ConstantFP *LHSC = dyn_cast<ConstantFP>(LHS->getOperand(1)))
3680 if (ConstantFP *RHSC = dyn_cast<ConstantFP>(RHS->getOperand(1))) {
3681 // If either of the constants are nans, then the whole thing returns
3683 if (LHSC->getValueAPF().isNaN() || RHSC->getValueAPF().isNaN())
3684 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
3685 return new FCmpInst(FCmpInst::FCMP_ORD, LHS->getOperand(0),
3686 RHS->getOperand(0));
3691 return Changed ? &I : 0;
3694 /// CollectBSwapParts - Look to see if the specified value defines a single byte
3695 /// in the result. If it does, and if the specified byte hasn't been filled in
3696 /// yet, fill it in and return false.
3697 static bool CollectBSwapParts(Value *V, SmallVector<Value*, 8> &ByteValues) {
3698 Instruction *I = dyn_cast<Instruction>(V);
3699 if (I == 0) return true;
3701 // If this is an or instruction, it is an inner node of the bswap.
3702 if (I->getOpcode() == Instruction::Or)
3703 return CollectBSwapParts(I->getOperand(0), ByteValues) ||
3704 CollectBSwapParts(I->getOperand(1), ByteValues);
3706 uint32_t BitWidth = I->getType()->getPrimitiveSizeInBits();
3707 // If this is a shift by a constant int, and it is "24", then its operand
3708 // defines a byte. We only handle unsigned types here.
3709 if (I->isShift() && isa<ConstantInt>(I->getOperand(1))) {
3710 // Not shifting the entire input by N-1 bytes?
3711 if (cast<ConstantInt>(I->getOperand(1))->getLimitedValue(BitWidth) !=
3712 8*(ByteValues.size()-1))
3716 if (I->getOpcode() == Instruction::Shl) {
3717 // X << 24 defines the top byte with the lowest of the input bytes.
3718 DestNo = ByteValues.size()-1;
3720 // X >>u 24 defines the low byte with the highest of the input bytes.
3724 // If the destination byte value is already defined, the values are or'd
3725 // together, which isn't a bswap (unless it's an or of the same bits).
3726 if (ByteValues[DestNo] && ByteValues[DestNo] != I->getOperand(0))
3728 ByteValues[DestNo] = I->getOperand(0);
3732 // Otherwise, we can only handle and(shift X, imm), imm). Bail out of if we
3734 Value *Shift = 0, *ShiftLHS = 0;
3735 ConstantInt *AndAmt = 0, *ShiftAmt = 0;
3736 if (!match(I, m_And(m_Value(Shift), m_ConstantInt(AndAmt))) ||
3737 !match(Shift, m_Shift(m_Value(ShiftLHS), m_ConstantInt(ShiftAmt))))
3739 Instruction *SI = cast<Instruction>(Shift);
3741 // Make sure that the shift amount is by a multiple of 8 and isn't too big.
3742 if (ShiftAmt->getLimitedValue(BitWidth) & 7 ||
3743 ShiftAmt->getLimitedValue(BitWidth) > 8*ByteValues.size())
3746 // Turn 0xFF -> 0, 0xFF00 -> 1, 0xFF0000 -> 2, etc.
3748 if (AndAmt->getValue().getActiveBits() > 64)
3750 uint64_t AndAmtVal = AndAmt->getZExtValue();
3751 for (DestByte = 0; DestByte != ByteValues.size(); ++DestByte)
3752 if (AndAmtVal == uint64_t(0xFF) << 8*DestByte)
3754 // Unknown mask for bswap.
3755 if (DestByte == ByteValues.size()) return true;
3757 unsigned ShiftBytes = ShiftAmt->getZExtValue()/8;
3759 if (SI->getOpcode() == Instruction::Shl)
3760 SrcByte = DestByte - ShiftBytes;
3762 SrcByte = DestByte + ShiftBytes;
3764 // If the SrcByte isn't a bswapped value from the DestByte, reject it.
3765 if (SrcByte != ByteValues.size()-DestByte-1)
3768 // If the destination byte value is already defined, the values are or'd
3769 // together, which isn't a bswap (unless it's an or of the same bits).
3770 if (ByteValues[DestByte] && ByteValues[DestByte] != SI->getOperand(0))
3772 ByteValues[DestByte] = SI->getOperand(0);
3776 /// MatchBSwap - Given an OR instruction, check to see if this is a bswap idiom.
3777 /// If so, insert the new bswap intrinsic and return it.
3778 Instruction *InstCombiner::MatchBSwap(BinaryOperator &I) {
3779 const IntegerType *ITy = dyn_cast<IntegerType>(I.getType());
3780 if (!ITy || ITy->getBitWidth() % 16)
3781 return 0; // Can only bswap pairs of bytes. Can't do vectors.
3783 /// ByteValues - For each byte of the result, we keep track of which value
3784 /// defines each byte.
3785 SmallVector<Value*, 8> ByteValues;
3786 ByteValues.resize(ITy->getBitWidth()/8);
3788 // Try to find all the pieces corresponding to the bswap.
3789 if (CollectBSwapParts(I.getOperand(0), ByteValues) ||
3790 CollectBSwapParts(I.getOperand(1), ByteValues))
3793 // Check to see if all of the bytes come from the same value.
3794 Value *V = ByteValues[0];
3795 if (V == 0) return 0; // Didn't find a byte? Must be zero.
3797 // Check to make sure that all of the bytes come from the same value.
3798 for (unsigned i = 1, e = ByteValues.size(); i != e; ++i)
3799 if (ByteValues[i] != V)
3801 const Type *Tys[] = { ITy };
3802 Module *M = I.getParent()->getParent()->getParent();
3803 Function *F = Intrinsic::getDeclaration(M, Intrinsic::bswap, Tys, 1);
3804 return new CallInst(F, V);
3808 Instruction *InstCombiner::visitOr(BinaryOperator &I) {
3809 bool Changed = SimplifyCommutative(I);
3810 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3812 if (isa<UndefValue>(Op1)) // X | undef -> -1
3813 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
3817 return ReplaceInstUsesWith(I, Op0);
3819 // See if we can simplify any instructions used by the instruction whose sole
3820 // purpose is to compute bits we don't care about.
3821 if (!isa<VectorType>(I.getType())) {
3822 uint32_t BitWidth = cast<IntegerType>(I.getType())->getBitWidth();
3823 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
3824 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
3825 KnownZero, KnownOne))
3827 } else if (isa<ConstantAggregateZero>(Op1)) {
3828 return ReplaceInstUsesWith(I, Op0); // X | <0,0> -> X
3829 } else if (ConstantVector *CP = dyn_cast<ConstantVector>(Op1)) {
3830 if (CP->isAllOnesValue()) // X | <-1,-1> -> <-1,-1>
3831 return ReplaceInstUsesWith(I, I.getOperand(1));
3837 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
3838 ConstantInt *C1 = 0; Value *X = 0;
3839 // (X & C1) | C2 --> (X | C2) & (C1|C2)
3840 if (match(Op0, m_And(m_Value(X), m_ConstantInt(C1))) && isOnlyUse(Op0)) {
3841 Instruction *Or = BinaryOperator::createOr(X, RHS);
3842 InsertNewInstBefore(Or, I);
3844 return BinaryOperator::createAnd(Or,
3845 ConstantInt::get(RHS->getValue() | C1->getValue()));
3848 // (X ^ C1) | C2 --> (X | C2) ^ (C1&~C2)
3849 if (match(Op0, m_Xor(m_Value(X), m_ConstantInt(C1))) && isOnlyUse(Op0)) {
3850 Instruction *Or = BinaryOperator::createOr(X, RHS);
3851 InsertNewInstBefore(Or, I);
3853 return BinaryOperator::createXor(Or,
3854 ConstantInt::get(C1->getValue() & ~RHS->getValue()));
3857 // Try to fold constant and into select arguments.
3858 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
3859 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
3861 if (isa<PHINode>(Op0))
3862 if (Instruction *NV = FoldOpIntoPhi(I))
3866 Value *A = 0, *B = 0;
3867 ConstantInt *C1 = 0, *C2 = 0;
3869 if (match(Op0, m_And(m_Value(A), m_Value(B))))
3870 if (A == Op1 || B == Op1) // (A & ?) | A --> A
3871 return ReplaceInstUsesWith(I, Op1);
3872 if (match(Op1, m_And(m_Value(A), m_Value(B))))
3873 if (A == Op0 || B == Op0) // A | (A & ?) --> A
3874 return ReplaceInstUsesWith(I, Op0);
3876 // (A | B) | C and A | (B | C) -> bswap if possible.
3877 // (A >> B) | (C << D) and (A << B) | (B >> C) -> bswap if possible.
3878 if (match(Op0, m_Or(m_Value(), m_Value())) ||
3879 match(Op1, m_Or(m_Value(), m_Value())) ||
3880 (match(Op0, m_Shift(m_Value(), m_Value())) &&
3881 match(Op1, m_Shift(m_Value(), m_Value())))) {
3882 if (Instruction *BSwap = MatchBSwap(I))
3886 // (X^C)|Y -> (X|Y)^C iff Y&C == 0
3887 if (Op0->hasOneUse() && match(Op0, m_Xor(m_Value(A), m_ConstantInt(C1))) &&
3888 MaskedValueIsZero(Op1, C1->getValue())) {
3889 Instruction *NOr = BinaryOperator::createOr(A, Op1);
3890 InsertNewInstBefore(NOr, I);
3892 return BinaryOperator::createXor(NOr, C1);
3895 // Y|(X^C) -> (X|Y)^C iff Y&C == 0
3896 if (Op1->hasOneUse() && match(Op1, m_Xor(m_Value(A), m_ConstantInt(C1))) &&
3897 MaskedValueIsZero(Op0, C1->getValue())) {
3898 Instruction *NOr = BinaryOperator::createOr(A, Op0);
3899 InsertNewInstBefore(NOr, I);
3901 return BinaryOperator::createXor(NOr, C1);
3905 Value *C = 0, *D = 0;
3906 if (match(Op0, m_And(m_Value(A), m_Value(C))) &&
3907 match(Op1, m_And(m_Value(B), m_Value(D)))) {
3908 Value *V1 = 0, *V2 = 0, *V3 = 0;
3909 C1 = dyn_cast<ConstantInt>(C);
3910 C2 = dyn_cast<ConstantInt>(D);
3911 if (C1 && C2) { // (A & C1)|(B & C2)
3912 // If we have: ((V + N) & C1) | (V & C2)
3913 // .. and C2 = ~C1 and C2 is 0+1+ and (N & C2) == 0
3914 // replace with V+N.
3915 if (C1->getValue() == ~C2->getValue()) {
3916 if ((C2->getValue() & (C2->getValue()+1)) == 0 && // C2 == 0+1+
3917 match(A, m_Add(m_Value(V1), m_Value(V2)))) {
3918 // Add commutes, try both ways.
3919 if (V1 == B && MaskedValueIsZero(V2, C2->getValue()))
3920 return ReplaceInstUsesWith(I, A);
3921 if (V2 == B && MaskedValueIsZero(V1, C2->getValue()))
3922 return ReplaceInstUsesWith(I, A);
3924 // Or commutes, try both ways.
3925 if ((C1->getValue() & (C1->getValue()+1)) == 0 &&
3926 match(B, m_Add(m_Value(V1), m_Value(V2)))) {
3927 // Add commutes, try both ways.
3928 if (V1 == A && MaskedValueIsZero(V2, C1->getValue()))
3929 return ReplaceInstUsesWith(I, B);
3930 if (V2 == A && MaskedValueIsZero(V1, C1->getValue()))
3931 return ReplaceInstUsesWith(I, B);
3934 V1 = 0; V2 = 0; V3 = 0;
3937 // Check to see if we have any common things being and'ed. If so, find the
3938 // terms for V1 & (V2|V3).
3939 if (isOnlyUse(Op0) || isOnlyUse(Op1)) {
3940 if (A == B) // (A & C)|(A & D) == A & (C|D)
3941 V1 = A, V2 = C, V3 = D;
3942 else if (A == D) // (A & C)|(B & A) == A & (B|C)
3943 V1 = A, V2 = B, V3 = C;
3944 else if (C == B) // (A & C)|(C & D) == C & (A|D)
3945 V1 = C, V2 = A, V3 = D;
3946 else if (C == D) // (A & C)|(B & C) == C & (A|B)
3947 V1 = C, V2 = A, V3 = B;
3951 InsertNewInstBefore(BinaryOperator::createOr(V2, V3, "tmp"), I);
3952 return BinaryOperator::createAnd(V1, Or);
3957 // (X >> Z) | (Y >> Z) -> (X|Y) >> Z for all shifts.
3958 if (BinaryOperator *SI1 = dyn_cast<BinaryOperator>(Op1)) {
3959 if (BinaryOperator *SI0 = dyn_cast<BinaryOperator>(Op0))
3960 if (SI0->isShift() && SI0->getOpcode() == SI1->getOpcode() &&
3961 SI0->getOperand(1) == SI1->getOperand(1) &&
3962 (SI0->hasOneUse() || SI1->hasOneUse())) {
3963 Instruction *NewOp =
3964 InsertNewInstBefore(BinaryOperator::createOr(SI0->getOperand(0),
3966 SI0->getName()), I);
3967 return BinaryOperator::create(SI1->getOpcode(), NewOp,
3968 SI1->getOperand(1));
3972 if (match(Op0, m_Not(m_Value(A)))) { // ~A | Op1
3973 if (A == Op1) // ~A | A == -1
3974 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
3978 // Note, A is still live here!
3979 if (match(Op1, m_Not(m_Value(B)))) { // Op0 | ~B
3981 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
3983 // (~A | ~B) == (~(A & B)) - De Morgan's Law
3984 if (A && isOnlyUse(Op0) && isOnlyUse(Op1)) {
3985 Value *And = InsertNewInstBefore(BinaryOperator::createAnd(A, B,
3986 I.getName()+".demorgan"), I);
3987 return BinaryOperator::createNot(And);
3991 // (icmp1 A, B) | (icmp2 A, B) --> (icmp3 A, B)
3992 if (ICmpInst *RHS = dyn_cast<ICmpInst>(I.getOperand(1))) {
3993 if (Instruction *R = AssociativeOpt(I, FoldICmpLogical(*this, RHS)))
3996 Value *LHSVal, *RHSVal;
3997 ConstantInt *LHSCst, *RHSCst;
3998 ICmpInst::Predicate LHSCC, RHSCC;
3999 if (match(Op0, m_ICmp(LHSCC, m_Value(LHSVal), m_ConstantInt(LHSCst))))
4000 if (match(RHS, m_ICmp(RHSCC, m_Value(RHSVal), m_ConstantInt(RHSCst))))
4001 if (LHSVal == RHSVal && // Found (X icmp C1) | (X icmp C2)
4002 // icmp [us][gl]e x, cst is folded to icmp [us][gl]t elsewhere.
4003 LHSCC != ICmpInst::ICMP_UGE && LHSCC != ICmpInst::ICMP_ULE &&
4004 RHSCC != ICmpInst::ICMP_UGE && RHSCC != ICmpInst::ICMP_ULE &&
4005 LHSCC != ICmpInst::ICMP_SGE && LHSCC != ICmpInst::ICMP_SLE &&
4006 RHSCC != ICmpInst::ICMP_SGE && RHSCC != ICmpInst::ICMP_SLE &&
4007 // We can't fold (ugt x, C) | (sgt x, C2).
4008 PredicatesFoldable(LHSCC, RHSCC)) {
4009 // Ensure that the larger constant is on the RHS.
4010 ICmpInst *LHS = cast<ICmpInst>(Op0);
4012 if (ICmpInst::isSignedPredicate(LHSCC))
4013 NeedsSwap = LHSCst->getValue().sgt(RHSCst->getValue());
4015 NeedsSwap = LHSCst->getValue().ugt(RHSCst->getValue());
4018 std::swap(LHS, RHS);
4019 std::swap(LHSCst, RHSCst);
4020 std::swap(LHSCC, RHSCC);
4023 // At this point, we know we have have two icmp instructions
4024 // comparing a value against two constants and or'ing the result
4025 // together. Because of the above check, we know that we only have
4026 // ICMP_EQ, ICMP_NE, ICMP_LT, and ICMP_GT here. We also know (from the
4027 // FoldICmpLogical check above), that the two constants are not
4029 assert(LHSCst != RHSCst && "Compares not folded above?");
4032 default: assert(0 && "Unknown integer condition code!");
4033 case ICmpInst::ICMP_EQ:
4035 default: assert(0 && "Unknown integer condition code!");
4036 case ICmpInst::ICMP_EQ:
4037 if (LHSCst == SubOne(RHSCst)) {// (X == 13 | X == 14) -> X-13 <u 2
4038 Constant *AddCST = ConstantExpr::getNeg(LHSCst);
4039 Instruction *Add = BinaryOperator::createAdd(LHSVal, AddCST,
4040 LHSVal->getName()+".off");
4041 InsertNewInstBefore(Add, I);
4042 AddCST = Subtract(AddOne(RHSCst), LHSCst);
4043 return new ICmpInst(ICmpInst::ICMP_ULT, Add, AddCST);
4045 break; // (X == 13 | X == 15) -> no change
4046 case ICmpInst::ICMP_UGT: // (X == 13 | X u> 14) -> no change
4047 case ICmpInst::ICMP_SGT: // (X == 13 | X s> 14) -> no change
4049 case ICmpInst::ICMP_NE: // (X == 13 | X != 15) -> X != 15
4050 case ICmpInst::ICMP_ULT: // (X == 13 | X u< 15) -> X u< 15
4051 case ICmpInst::ICMP_SLT: // (X == 13 | X s< 15) -> X s< 15
4052 return ReplaceInstUsesWith(I, RHS);
4055 case ICmpInst::ICMP_NE:
4057 default: assert(0 && "Unknown integer condition code!");
4058 case ICmpInst::ICMP_EQ: // (X != 13 | X == 15) -> X != 13
4059 case ICmpInst::ICMP_UGT: // (X != 13 | X u> 15) -> X != 13
4060 case ICmpInst::ICMP_SGT: // (X != 13 | X s> 15) -> X != 13
4061 return ReplaceInstUsesWith(I, LHS);
4062 case ICmpInst::ICMP_NE: // (X != 13 | X != 15) -> true
4063 case ICmpInst::ICMP_ULT: // (X != 13 | X u< 15) -> true
4064 case ICmpInst::ICMP_SLT: // (X != 13 | X s< 15) -> true
4065 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4068 case ICmpInst::ICMP_ULT:
4070 default: assert(0 && "Unknown integer condition code!");
4071 case ICmpInst::ICMP_EQ: // (X u< 13 | X == 14) -> no change
4073 case ICmpInst::ICMP_UGT: // (X u< 13 | X u> 15) ->(X-13) u> 2
4074 // If RHSCst is [us]MAXINT, it is always false. Not handling
4075 // this can cause overflow.
4076 if (RHSCst->isMaxValue(false))
4077 return ReplaceInstUsesWith(I, LHS);
4078 return InsertRangeTest(LHSVal, LHSCst, AddOne(RHSCst), false,
4080 case ICmpInst::ICMP_SGT: // (X u< 13 | X s> 15) -> no change
4082 case ICmpInst::ICMP_NE: // (X u< 13 | X != 15) -> X != 15
4083 case ICmpInst::ICMP_ULT: // (X u< 13 | X u< 15) -> X u< 15
4084 return ReplaceInstUsesWith(I, RHS);
4085 case ICmpInst::ICMP_SLT: // (X u< 13 | X s< 15) -> no change
4089 case ICmpInst::ICMP_SLT:
4091 default: assert(0 && "Unknown integer condition code!");
4092 case ICmpInst::ICMP_EQ: // (X s< 13 | X == 14) -> no change
4094 case ICmpInst::ICMP_SGT: // (X s< 13 | X s> 15) ->(X-13) s> 2
4095 // If RHSCst is [us]MAXINT, it is always false. Not handling
4096 // this can cause overflow.
4097 if (RHSCst->isMaxValue(true))
4098 return ReplaceInstUsesWith(I, LHS);
4099 return InsertRangeTest(LHSVal, LHSCst, AddOne(RHSCst), true,
4101 case ICmpInst::ICMP_UGT: // (X s< 13 | X u> 15) -> no change
4103 case ICmpInst::ICMP_NE: // (X s< 13 | X != 15) -> X != 15
4104 case ICmpInst::ICMP_SLT: // (X s< 13 | X s< 15) -> X s< 15
4105 return ReplaceInstUsesWith(I, RHS);
4106 case ICmpInst::ICMP_ULT: // (X s< 13 | X u< 15) -> no change
4110 case ICmpInst::ICMP_UGT:
4112 default: assert(0 && "Unknown integer condition code!");
4113 case ICmpInst::ICMP_EQ: // (X u> 13 | X == 15) -> X u> 13
4114 case ICmpInst::ICMP_UGT: // (X u> 13 | X u> 15) -> X u> 13
4115 return ReplaceInstUsesWith(I, LHS);
4116 case ICmpInst::ICMP_SGT: // (X u> 13 | X s> 15) -> no change
4118 case ICmpInst::ICMP_NE: // (X u> 13 | X != 15) -> true
4119 case ICmpInst::ICMP_ULT: // (X u> 13 | X u< 15) -> true
4120 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4121 case ICmpInst::ICMP_SLT: // (X u> 13 | X s< 15) -> no change
4125 case ICmpInst::ICMP_SGT:
4127 default: assert(0 && "Unknown integer condition code!");
4128 case ICmpInst::ICMP_EQ: // (X s> 13 | X == 15) -> X > 13
4129 case ICmpInst::ICMP_SGT: // (X s> 13 | X s> 15) -> X > 13
4130 return ReplaceInstUsesWith(I, LHS);
4131 case ICmpInst::ICMP_UGT: // (X s> 13 | X u> 15) -> no change
4133 case ICmpInst::ICMP_NE: // (X s> 13 | X != 15) -> true
4134 case ICmpInst::ICMP_SLT: // (X s> 13 | X s< 15) -> true
4135 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4136 case ICmpInst::ICMP_ULT: // (X s> 13 | X u< 15) -> no change
4144 // fold (or (cast A), (cast B)) -> (cast (or A, B))
4145 if (CastInst *Op0C = dyn_cast<CastInst>(Op0)) {
4146 if (CastInst *Op1C = dyn_cast<CastInst>(Op1))
4147 if (Op0C->getOpcode() == Op1C->getOpcode()) {// same cast kind ?
4148 const Type *SrcTy = Op0C->getOperand(0)->getType();
4149 if (SrcTy == Op1C->getOperand(0)->getType() && SrcTy->isInteger() &&
4150 // Only do this if the casts both really cause code to be generated.
4151 ValueRequiresCast(Op0C->getOpcode(), Op0C->getOperand(0),
4153 ValueRequiresCast(Op1C->getOpcode(), Op1C->getOperand(0),
4155 Instruction *NewOp = BinaryOperator::createOr(Op0C->getOperand(0),
4156 Op1C->getOperand(0),
4158 InsertNewInstBefore(NewOp, I);
4159 return CastInst::create(Op0C->getOpcode(), NewOp, I.getType());
4165 // (fcmp uno x, c) | (fcmp uno y, c) -> (fcmp uno x, y)
4166 if (FCmpInst *LHS = dyn_cast<FCmpInst>(I.getOperand(0))) {
4167 if (FCmpInst *RHS = dyn_cast<FCmpInst>(I.getOperand(1))) {
4168 if (LHS->getPredicate() == FCmpInst::FCMP_UNO &&
4169 RHS->getPredicate() == FCmpInst::FCMP_UNO)
4170 if (ConstantFP *LHSC = dyn_cast<ConstantFP>(LHS->getOperand(1)))
4171 if (ConstantFP *RHSC = dyn_cast<ConstantFP>(RHS->getOperand(1))) {
4172 // If either of the constants are nans, then the whole thing returns
4174 if (LHSC->getValueAPF().isNaN() || RHSC->getValueAPF().isNaN())
4175 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4177 // Otherwise, no need to compare the two constants, compare the
4179 return new FCmpInst(FCmpInst::FCMP_UNO, LHS->getOperand(0),
4180 RHS->getOperand(0));
4185 return Changed ? &I : 0;
4188 // XorSelf - Implements: X ^ X --> 0
4191 XorSelf(Value *rhs) : RHS(rhs) {}
4192 bool shouldApply(Value *LHS) const { return LHS == RHS; }
4193 Instruction *apply(BinaryOperator &Xor) const {
4199 Instruction *InstCombiner::visitXor(BinaryOperator &I) {
4200 bool Changed = SimplifyCommutative(I);
4201 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
4203 if (isa<UndefValue>(Op1))
4204 return ReplaceInstUsesWith(I, Op1); // X ^ undef -> undef
4206 // xor X, X = 0, even if X is nested in a sequence of Xor's.
4207 if (Instruction *Result = AssociativeOpt(I, XorSelf(Op1))) {
4208 assert(Result == &I && "AssociativeOpt didn't work?"); Result=Result;
4209 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
4212 // See if we can simplify any instructions used by the instruction whose sole
4213 // purpose is to compute bits we don't care about.
4214 if (!isa<VectorType>(I.getType())) {
4215 uint32_t BitWidth = cast<IntegerType>(I.getType())->getBitWidth();
4216 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
4217 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
4218 KnownZero, KnownOne))
4220 } else if (isa<ConstantAggregateZero>(Op1)) {
4221 return ReplaceInstUsesWith(I, Op0); // X ^ <0,0> -> X
4224 // Is this a ~ operation?
4225 if (Value *NotOp = dyn_castNotVal(&I)) {
4226 // ~(~X & Y) --> (X | ~Y) - De Morgan's Law
4227 // ~(~X | Y) === (X & ~Y) - De Morgan's Law
4228 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(NotOp)) {
4229 if (Op0I->getOpcode() == Instruction::And ||
4230 Op0I->getOpcode() == Instruction::Or) {
4231 if (dyn_castNotVal(Op0I->getOperand(1))) Op0I->swapOperands();
4232 if (Value *Op0NotVal = dyn_castNotVal(Op0I->getOperand(0))) {
4234 BinaryOperator::createNot(Op0I->getOperand(1),
4235 Op0I->getOperand(1)->getName()+".not");
4236 InsertNewInstBefore(NotY, I);
4237 if (Op0I->getOpcode() == Instruction::And)
4238 return BinaryOperator::createOr(Op0NotVal, NotY);
4240 return BinaryOperator::createAnd(Op0NotVal, NotY);
4247 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
4248 // xor (cmp A, B), true = not (cmp A, B) = !cmp A, B
4249 if (RHS == ConstantInt::getTrue() && Op0->hasOneUse()) {
4250 if (ICmpInst *ICI = dyn_cast<ICmpInst>(Op0))
4251 return new ICmpInst(ICI->getInversePredicate(),
4252 ICI->getOperand(0), ICI->getOperand(1));
4254 if (FCmpInst *FCI = dyn_cast<FCmpInst>(Op0))
4255 return new FCmpInst(FCI->getInversePredicate(),
4256 FCI->getOperand(0), FCI->getOperand(1));
4259 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0)) {
4260 // ~(c-X) == X-c-1 == X+(-c-1)
4261 if (Op0I->getOpcode() == Instruction::Sub && RHS->isAllOnesValue())
4262 if (Constant *Op0I0C = dyn_cast<Constant>(Op0I->getOperand(0))) {
4263 Constant *NegOp0I0C = ConstantExpr::getNeg(Op0I0C);
4264 Constant *ConstantRHS = ConstantExpr::getSub(NegOp0I0C,
4265 ConstantInt::get(I.getType(), 1));
4266 return BinaryOperator::createAdd(Op0I->getOperand(1), ConstantRHS);
4269 if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1)))
4270 if (Op0I->getOpcode() == Instruction::Add) {
4271 // ~(X-c) --> (-c-1)-X
4272 if (RHS->isAllOnesValue()) {
4273 Constant *NegOp0CI = ConstantExpr::getNeg(Op0CI);
4274 return BinaryOperator::createSub(
4275 ConstantExpr::getSub(NegOp0CI,
4276 ConstantInt::get(I.getType(), 1)),
4277 Op0I->getOperand(0));
4278 } else if (RHS->getValue().isSignBit()) {
4279 // (X + C) ^ signbit -> (X + C + signbit)
4280 Constant *C = ConstantInt::get(RHS->getValue() + Op0CI->getValue());
4281 return BinaryOperator::createAdd(Op0I->getOperand(0), C);
4284 } else if (Op0I->getOpcode() == Instruction::Or) {
4285 // (X|C1)^C2 -> X^(C1|C2) iff X&~C1 == 0
4286 if (MaskedValueIsZero(Op0I->getOperand(0), Op0CI->getValue())) {
4287 Constant *NewRHS = ConstantExpr::getOr(Op0CI, RHS);
4288 // Anything in both C1 and C2 is known to be zero, remove it from
4290 Constant *CommonBits = And(Op0CI, RHS);
4291 NewRHS = ConstantExpr::getAnd(NewRHS,
4292 ConstantExpr::getNot(CommonBits));
4293 AddToWorkList(Op0I);
4294 I.setOperand(0, Op0I->getOperand(0));
4295 I.setOperand(1, NewRHS);
4301 // Try to fold constant and into select arguments.
4302 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
4303 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
4305 if (isa<PHINode>(Op0))
4306 if (Instruction *NV = FoldOpIntoPhi(I))
4310 if (Value *X = dyn_castNotVal(Op0)) // ~A ^ A == -1
4312 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
4314 if (Value *X = dyn_castNotVal(Op1)) // A ^ ~A == -1
4316 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
4319 BinaryOperator *Op1I = dyn_cast<BinaryOperator>(Op1);
4322 if (match(Op1I, m_Or(m_Value(A), m_Value(B)))) {
4323 if (A == Op0) { // B^(B|A) == (A|B)^B
4324 Op1I->swapOperands();
4326 std::swap(Op0, Op1);
4327 } else if (B == Op0) { // B^(A|B) == (A|B)^B
4328 I.swapOperands(); // Simplified below.
4329 std::swap(Op0, Op1);
4331 } else if (match(Op1I, m_Xor(m_Value(A), m_Value(B)))) {
4332 if (Op0 == A) // A^(A^B) == B
4333 return ReplaceInstUsesWith(I, B);
4334 else if (Op0 == B) // A^(B^A) == B
4335 return ReplaceInstUsesWith(I, A);
4336 } else if (match(Op1I, m_And(m_Value(A), m_Value(B))) && Op1I->hasOneUse()){
4337 if (A == Op0) { // A^(A&B) -> A^(B&A)
4338 Op1I->swapOperands();
4341 if (B == Op0) { // A^(B&A) -> (B&A)^A
4342 I.swapOperands(); // Simplified below.
4343 std::swap(Op0, Op1);
4348 BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0);
4351 if (match(Op0I, m_Or(m_Value(A), m_Value(B))) && Op0I->hasOneUse()) {
4352 if (A == Op1) // (B|A)^B == (A|B)^B
4354 if (B == Op1) { // (A|B)^B == A & ~B
4356 InsertNewInstBefore(BinaryOperator::createNot(Op1, "tmp"), I);
4357 return BinaryOperator::createAnd(A, NotB);
4359 } else if (match(Op0I, m_Xor(m_Value(A), m_Value(B)))) {
4360 if (Op1 == A) // (A^B)^A == B
4361 return ReplaceInstUsesWith(I, B);
4362 else if (Op1 == B) // (B^A)^A == B
4363 return ReplaceInstUsesWith(I, A);
4364 } else if (match(Op0I, m_And(m_Value(A), m_Value(B))) && Op0I->hasOneUse()){
4365 if (A == Op1) // (A&B)^A -> (B&A)^A
4367 if (B == Op1 && // (B&A)^A == ~B & A
4368 !isa<ConstantInt>(Op1)) { // Canonical form is (B&C)^C
4370 InsertNewInstBefore(BinaryOperator::createNot(A, "tmp"), I);
4371 return BinaryOperator::createAnd(N, Op1);
4376 // (X >> Z) ^ (Y >> Z) -> (X^Y) >> Z for all shifts.
4377 if (Op0I && Op1I && Op0I->isShift() &&
4378 Op0I->getOpcode() == Op1I->getOpcode() &&
4379 Op0I->getOperand(1) == Op1I->getOperand(1) &&
4380 (Op1I->hasOneUse() || Op1I->hasOneUse())) {
4381 Instruction *NewOp =
4382 InsertNewInstBefore(BinaryOperator::createXor(Op0I->getOperand(0),
4383 Op1I->getOperand(0),
4384 Op0I->getName()), I);
4385 return BinaryOperator::create(Op1I->getOpcode(), NewOp,
4386 Op1I->getOperand(1));
4390 Value *A, *B, *C, *D;
4391 // (A & B)^(A | B) -> A ^ B
4392 if (match(Op0I, m_And(m_Value(A), m_Value(B))) &&
4393 match(Op1I, m_Or(m_Value(C), m_Value(D)))) {
4394 if ((A == C && B == D) || (A == D && B == C))
4395 return BinaryOperator::createXor(A, B);
4397 // (A | B)^(A & B) -> A ^ B
4398 if (match(Op0I, m_Or(m_Value(A), m_Value(B))) &&
4399 match(Op1I, m_And(m_Value(C), m_Value(D)))) {
4400 if ((A == C && B == D) || (A == D && B == C))
4401 return BinaryOperator::createXor(A, B);
4405 if ((Op0I->hasOneUse() || Op1I->hasOneUse()) &&
4406 match(Op0I, m_And(m_Value(A), m_Value(B))) &&
4407 match(Op1I, m_And(m_Value(C), m_Value(D)))) {
4408 // (X & Y)^(X & Y) -> (Y^Z) & X
4409 Value *X = 0, *Y = 0, *Z = 0;
4411 X = A, Y = B, Z = D;
4413 X = A, Y = B, Z = C;
4415 X = B, Y = A, Z = D;
4417 X = B, Y = A, Z = C;
4420 Instruction *NewOp =
4421 InsertNewInstBefore(BinaryOperator::createXor(Y, Z, Op0->getName()), I);
4422 return BinaryOperator::createAnd(NewOp, X);
4427 // (icmp1 A, B) ^ (icmp2 A, B) --> (icmp3 A, B)
4428 if (ICmpInst *RHS = dyn_cast<ICmpInst>(I.getOperand(1)))
4429 if (Instruction *R = AssociativeOpt(I, FoldICmpLogical(*this, RHS)))
4432 // fold (xor (cast A), (cast B)) -> (cast (xor A, B))
4433 if (CastInst *Op0C = dyn_cast<CastInst>(Op0)) {
4434 if (CastInst *Op1C = dyn_cast<CastInst>(Op1))
4435 if (Op0C->getOpcode() == Op1C->getOpcode()) { // same cast kind?
4436 const Type *SrcTy = Op0C->getOperand(0)->getType();
4437 if (SrcTy == Op1C->getOperand(0)->getType() && SrcTy->isInteger() &&
4438 // Only do this if the casts both really cause code to be generated.
4439 ValueRequiresCast(Op0C->getOpcode(), Op0C->getOperand(0),
4441 ValueRequiresCast(Op1C->getOpcode(), Op1C->getOperand(0),
4443 Instruction *NewOp = BinaryOperator::createXor(Op0C->getOperand(0),
4444 Op1C->getOperand(0),
4446 InsertNewInstBefore(NewOp, I);
4447 return CastInst::create(Op0C->getOpcode(), NewOp, I.getType());
4451 return Changed ? &I : 0;
4454 /// AddWithOverflow - Compute Result = In1+In2, returning true if the result
4455 /// overflowed for this type.
4456 static bool AddWithOverflow(ConstantInt *&Result, ConstantInt *In1,
4457 ConstantInt *In2, bool IsSigned = false) {
4458 Result = cast<ConstantInt>(Add(In1, In2));
4461 if (In2->getValue().isNegative())
4462 return Result->getValue().sgt(In1->getValue());
4464 return Result->getValue().slt(In1->getValue());
4466 return Result->getValue().ult(In1->getValue());
4469 /// EmitGEPOffset - Given a getelementptr instruction/constantexpr, emit the
4470 /// code necessary to compute the offset from the base pointer (without adding
4471 /// in the base pointer). Return the result as a signed integer of intptr size.
4472 static Value *EmitGEPOffset(User *GEP, Instruction &I, InstCombiner &IC) {
4473 TargetData &TD = IC.getTargetData();
4474 gep_type_iterator GTI = gep_type_begin(GEP);
4475 const Type *IntPtrTy = TD.getIntPtrType();
4476 Value *Result = Constant::getNullValue(IntPtrTy);
4478 // Build a mask for high order bits.
4479 unsigned IntPtrWidth = TD.getPointerSize()*8;
4480 uint64_t PtrSizeMask = ~0ULL >> (64-IntPtrWidth);
4482 for (unsigned i = 1, e = GEP->getNumOperands(); i != e; ++i, ++GTI) {
4483 Value *Op = GEP->getOperand(i);
4484 uint64_t Size = TD.getABITypeSize(GTI.getIndexedType()) & PtrSizeMask;
4485 if (ConstantInt *OpC = dyn_cast<ConstantInt>(Op)) {
4486 if (OpC->isZero()) continue;
4488 // Handle a struct index, which adds its field offset to the pointer.
4489 if (const StructType *STy = dyn_cast<StructType>(*GTI)) {
4490 Size = TD.getStructLayout(STy)->getElementOffset(OpC->getZExtValue());
4492 if (ConstantInt *RC = dyn_cast<ConstantInt>(Result))
4493 Result = ConstantInt::get(RC->getValue() + APInt(IntPtrWidth, Size));
4495 Result = IC.InsertNewInstBefore(
4496 BinaryOperator::createAdd(Result,
4497 ConstantInt::get(IntPtrTy, Size),
4498 GEP->getName()+".offs"), I);
4502 Constant *Scale = ConstantInt::get(IntPtrTy, Size);
4503 Constant *OC = ConstantExpr::getIntegerCast(OpC, IntPtrTy, true /*SExt*/);
4504 Scale = ConstantExpr::getMul(OC, Scale);
4505 if (Constant *RC = dyn_cast<Constant>(Result))
4506 Result = ConstantExpr::getAdd(RC, Scale);
4508 // Emit an add instruction.
4509 Result = IC.InsertNewInstBefore(
4510 BinaryOperator::createAdd(Result, Scale,
4511 GEP->getName()+".offs"), I);
4515 // Convert to correct type.
4516 if (Op->getType() != IntPtrTy) {
4517 if (Constant *OpC = dyn_cast<Constant>(Op))
4518 Op = ConstantExpr::getSExt(OpC, IntPtrTy);
4520 Op = IC.InsertNewInstBefore(new SExtInst(Op, IntPtrTy,
4521 Op->getName()+".c"), I);
4524 Constant *Scale = ConstantInt::get(IntPtrTy, Size);
4525 if (Constant *OpC = dyn_cast<Constant>(Op))
4526 Op = ConstantExpr::getMul(OpC, Scale);
4527 else // We'll let instcombine(mul) convert this to a shl if possible.
4528 Op = IC.InsertNewInstBefore(BinaryOperator::createMul(Op, Scale,
4529 GEP->getName()+".idx"), I);
4532 // Emit an add instruction.
4533 if (isa<Constant>(Op) && isa<Constant>(Result))
4534 Result = ConstantExpr::getAdd(cast<Constant>(Op),
4535 cast<Constant>(Result));
4537 Result = IC.InsertNewInstBefore(BinaryOperator::createAdd(Op, Result,
4538 GEP->getName()+".offs"), I);
4543 /// FoldGEPICmp - Fold comparisons between a GEP instruction and something
4544 /// else. At this point we know that the GEP is on the LHS of the comparison.
4545 Instruction *InstCombiner::FoldGEPICmp(User *GEPLHS, Value *RHS,
4546 ICmpInst::Predicate Cond,
4548 assert(dyn_castGetElementPtr(GEPLHS) && "LHS is not a getelementptr!");
4550 if (CastInst *CI = dyn_cast<CastInst>(RHS))
4551 if (isa<PointerType>(CI->getOperand(0)->getType()))
4552 RHS = CI->getOperand(0);
4554 Value *PtrBase = GEPLHS->getOperand(0);
4555 if (PtrBase == RHS) {
4556 // As an optimization, we don't actually have to compute the actual value of
4557 // OFFSET if this is a icmp_eq or icmp_ne comparison, just return whether
4558 // each index is zero or not.
4559 if (Cond == ICmpInst::ICMP_EQ || Cond == ICmpInst::ICMP_NE) {
4560 Instruction *InVal = 0;
4561 gep_type_iterator GTI = gep_type_begin(GEPLHS);
4562 for (unsigned i = 1, e = GEPLHS->getNumOperands(); i != e; ++i, ++GTI) {
4564 if (Constant *C = dyn_cast<Constant>(GEPLHS->getOperand(i))) {
4565 if (isa<UndefValue>(C)) // undef index -> undef.
4566 return ReplaceInstUsesWith(I, UndefValue::get(I.getType()));
4567 if (C->isNullValue())
4569 else if (TD->getABITypeSize(GTI.getIndexedType()) == 0) {
4570 EmitIt = false; // This is indexing into a zero sized array?
4571 } else if (isa<ConstantInt>(C))
4572 return ReplaceInstUsesWith(I, // No comparison is needed here.
4573 ConstantInt::get(Type::Int1Ty,
4574 Cond == ICmpInst::ICMP_NE));
4579 new ICmpInst(Cond, GEPLHS->getOperand(i),
4580 Constant::getNullValue(GEPLHS->getOperand(i)->getType()));
4584 InVal = InsertNewInstBefore(InVal, I);
4585 InsertNewInstBefore(Comp, I);
4586 if (Cond == ICmpInst::ICMP_NE) // True if any are unequal
4587 InVal = BinaryOperator::createOr(InVal, Comp);
4588 else // True if all are equal
4589 InVal = BinaryOperator::createAnd(InVal, Comp);
4597 // No comparison is needed here, all indexes = 0
4598 ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty,
4599 Cond == ICmpInst::ICMP_EQ));
4602 // Only lower this if the icmp is the only user of the GEP or if we expect
4603 // the result to fold to a constant!
4604 if (isa<ConstantExpr>(GEPLHS) || GEPLHS->hasOneUse()) {
4605 // ((gep Ptr, OFFSET) cmp Ptr) ---> (OFFSET cmp 0).
4606 Value *Offset = EmitGEPOffset(GEPLHS, I, *this);
4607 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), Offset,
4608 Constant::getNullValue(Offset->getType()));
4610 } else if (User *GEPRHS = dyn_castGetElementPtr(RHS)) {
4611 // If the base pointers are different, but the indices are the same, just
4612 // compare the base pointer.
4613 if (PtrBase != GEPRHS->getOperand(0)) {
4614 bool IndicesTheSame = GEPLHS->getNumOperands()==GEPRHS->getNumOperands();
4615 IndicesTheSame &= GEPLHS->getOperand(0)->getType() ==
4616 GEPRHS->getOperand(0)->getType();
4618 for (unsigned i = 1, e = GEPLHS->getNumOperands(); i != e; ++i)
4619 if (GEPLHS->getOperand(i) != GEPRHS->getOperand(i)) {
4620 IndicesTheSame = false;
4624 // If all indices are the same, just compare the base pointers.
4626 return new ICmpInst(ICmpInst::getSignedPredicate(Cond),
4627 GEPLHS->getOperand(0), GEPRHS->getOperand(0));
4629 // Otherwise, the base pointers are different and the indices are
4630 // different, bail out.
4634 // If one of the GEPs has all zero indices, recurse.
4635 bool AllZeros = true;
4636 for (unsigned i = 1, e = GEPLHS->getNumOperands(); i != e; ++i)
4637 if (!isa<Constant>(GEPLHS->getOperand(i)) ||
4638 !cast<Constant>(GEPLHS->getOperand(i))->isNullValue()) {
4643 return FoldGEPICmp(GEPRHS, GEPLHS->getOperand(0),
4644 ICmpInst::getSwappedPredicate(Cond), I);
4646 // If the other GEP has all zero indices, recurse.
4648 for (unsigned i = 1, e = GEPRHS->getNumOperands(); i != e; ++i)
4649 if (!isa<Constant>(GEPRHS->getOperand(i)) ||
4650 !cast<Constant>(GEPRHS->getOperand(i))->isNullValue()) {
4655 return FoldGEPICmp(GEPLHS, GEPRHS->getOperand(0), Cond, I);
4657 if (GEPLHS->getNumOperands() == GEPRHS->getNumOperands()) {
4658 // If the GEPs only differ by one index, compare it.
4659 unsigned NumDifferences = 0; // Keep track of # differences.
4660 unsigned DiffOperand = 0; // The operand that differs.
4661 for (unsigned i = 1, e = GEPRHS->getNumOperands(); i != e; ++i)
4662 if (GEPLHS->getOperand(i) != GEPRHS->getOperand(i)) {
4663 if (GEPLHS->getOperand(i)->getType()->getPrimitiveSizeInBits() !=
4664 GEPRHS->getOperand(i)->getType()->getPrimitiveSizeInBits()) {
4665 // Irreconcilable differences.
4669 if (NumDifferences++) break;
4674 if (NumDifferences == 0) // SAME GEP?
4675 return ReplaceInstUsesWith(I, // No comparison is needed here.
4676 ConstantInt::get(Type::Int1Ty,
4677 isTrueWhenEqual(Cond)));
4679 else if (NumDifferences == 1) {
4680 Value *LHSV = GEPLHS->getOperand(DiffOperand);
4681 Value *RHSV = GEPRHS->getOperand(DiffOperand);
4682 // Make sure we do a signed comparison here.
4683 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), LHSV, RHSV);
4687 // Only lower this if the icmp is the only user of the GEP or if we expect
4688 // the result to fold to a constant!
4689 if ((isa<ConstantExpr>(GEPLHS) || GEPLHS->hasOneUse()) &&
4690 (isa<ConstantExpr>(GEPRHS) || GEPRHS->hasOneUse())) {
4691 // ((gep Ptr, OFFSET1) cmp (gep Ptr, OFFSET2) ---> (OFFSET1 cmp OFFSET2)
4692 Value *L = EmitGEPOffset(GEPLHS, I, *this);
4693 Value *R = EmitGEPOffset(GEPRHS, I, *this);
4694 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), L, R);
4700 Instruction *InstCombiner::visitFCmpInst(FCmpInst &I) {
4701 bool Changed = SimplifyCompare(I);
4702 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
4704 // Fold trivial predicates.
4705 if (I.getPredicate() == FCmpInst::FCMP_FALSE)
4706 return ReplaceInstUsesWith(I, Constant::getNullValue(Type::Int1Ty));
4707 if (I.getPredicate() == FCmpInst::FCMP_TRUE)
4708 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 1));
4710 // Simplify 'fcmp pred X, X'
4712 switch (I.getPredicate()) {
4713 default: assert(0 && "Unknown predicate!");
4714 case FCmpInst::FCMP_UEQ: // True if unordered or equal
4715 case FCmpInst::FCMP_UGE: // True if unordered, greater than, or equal
4716 case FCmpInst::FCMP_ULE: // True if unordered, less than, or equal
4717 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 1));
4718 case FCmpInst::FCMP_OGT: // True if ordered and greater than
4719 case FCmpInst::FCMP_OLT: // True if ordered and less than
4720 case FCmpInst::FCMP_ONE: // True if ordered and operands are unequal
4721 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 0));
4723 case FCmpInst::FCMP_UNO: // True if unordered: isnan(X) | isnan(Y)
4724 case FCmpInst::FCMP_ULT: // True if unordered or less than
4725 case FCmpInst::FCMP_UGT: // True if unordered or greater than
4726 case FCmpInst::FCMP_UNE: // True if unordered or not equal
4727 // Canonicalize these to be 'fcmp uno %X, 0.0'.
4728 I.setPredicate(FCmpInst::FCMP_UNO);
4729 I.setOperand(1, Constant::getNullValue(Op0->getType()));
4732 case FCmpInst::FCMP_ORD: // True if ordered (no nans)
4733 case FCmpInst::FCMP_OEQ: // True if ordered and equal
4734 case FCmpInst::FCMP_OGE: // True if ordered and greater than or equal
4735 case FCmpInst::FCMP_OLE: // True if ordered and less than or equal
4736 // Canonicalize these to be 'fcmp ord %X, 0.0'.
4737 I.setPredicate(FCmpInst::FCMP_ORD);
4738 I.setOperand(1, Constant::getNullValue(Op0->getType()));
4743 if (isa<UndefValue>(Op1)) // fcmp pred X, undef -> undef
4744 return ReplaceInstUsesWith(I, UndefValue::get(Type::Int1Ty));
4746 // Handle fcmp with constant RHS
4747 if (Constant *RHSC = dyn_cast<Constant>(Op1)) {
4748 if (Instruction *LHSI = dyn_cast<Instruction>(Op0))
4749 switch (LHSI->getOpcode()) {
4750 case Instruction::PHI:
4751 if (Instruction *NV = FoldOpIntoPhi(I))
4754 case Instruction::Select:
4755 // If either operand of the select is a constant, we can fold the
4756 // comparison into the select arms, which will cause one to be
4757 // constant folded and the select turned into a bitwise or.
4758 Value *Op1 = 0, *Op2 = 0;
4759 if (LHSI->hasOneUse()) {
4760 if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(1))) {
4761 // Fold the known value into the constant operand.
4762 Op1 = ConstantExpr::getCompare(I.getPredicate(), C, RHSC);
4763 // Insert a new FCmp of the other select operand.
4764 Op2 = InsertNewInstBefore(new FCmpInst(I.getPredicate(),
4765 LHSI->getOperand(2), RHSC,
4767 } else if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(2))) {
4768 // Fold the known value into the constant operand.
4769 Op2 = ConstantExpr::getCompare(I.getPredicate(), C, RHSC);
4770 // Insert a new FCmp of the other select operand.
4771 Op1 = InsertNewInstBefore(new FCmpInst(I.getPredicate(),
4772 LHSI->getOperand(1), RHSC,
4778 return new SelectInst(LHSI->getOperand(0), Op1, Op2);
4783 return Changed ? &I : 0;
4786 Instruction *InstCombiner::visitICmpInst(ICmpInst &I) {
4787 bool Changed = SimplifyCompare(I);
4788 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
4789 const Type *Ty = Op0->getType();
4793 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty,
4794 isTrueWhenEqual(I)));
4796 if (isa<UndefValue>(Op1)) // X icmp undef -> undef
4797 return ReplaceInstUsesWith(I, UndefValue::get(Type::Int1Ty));
4799 // icmp <global/alloca*/null>, <global/alloca*/null> - Global/Stack value
4800 // addresses never equal each other! We already know that Op0 != Op1.
4801 if ((isa<GlobalValue>(Op0) || isa<AllocaInst>(Op0) ||
4802 isa<ConstantPointerNull>(Op0)) &&
4803 (isa<GlobalValue>(Op1) || isa<AllocaInst>(Op1) ||
4804 isa<ConstantPointerNull>(Op1)))
4805 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty,
4806 !isTrueWhenEqual(I)));
4808 // icmp's with boolean values can always be turned into bitwise operations
4809 if (Ty == Type::Int1Ty) {
4810 switch (I.getPredicate()) {
4811 default: assert(0 && "Invalid icmp instruction!");
4812 case ICmpInst::ICMP_EQ: { // icmp eq bool %A, %B -> ~(A^B)
4813 Instruction *Xor = BinaryOperator::createXor(Op0, Op1, I.getName()+"tmp");
4814 InsertNewInstBefore(Xor, I);
4815 return BinaryOperator::createNot(Xor);
4817 case ICmpInst::ICMP_NE: // icmp eq bool %A, %B -> A^B
4818 return BinaryOperator::createXor(Op0, Op1);
4820 case ICmpInst::ICMP_UGT:
4821 case ICmpInst::ICMP_SGT:
4822 std::swap(Op0, Op1); // Change icmp gt -> icmp lt
4824 case ICmpInst::ICMP_ULT:
4825 case ICmpInst::ICMP_SLT: { // icmp lt bool A, B -> ~X & Y
4826 Instruction *Not = BinaryOperator::createNot(Op0, I.getName()+"tmp");
4827 InsertNewInstBefore(Not, I);
4828 return BinaryOperator::createAnd(Not, Op1);
4830 case ICmpInst::ICMP_UGE:
4831 case ICmpInst::ICMP_SGE:
4832 std::swap(Op0, Op1); // Change icmp ge -> icmp le
4834 case ICmpInst::ICMP_ULE:
4835 case ICmpInst::ICMP_SLE: { // icmp le bool %A, %B -> ~A | B
4836 Instruction *Not = BinaryOperator::createNot(Op0, I.getName()+"tmp");
4837 InsertNewInstBefore(Not, I);
4838 return BinaryOperator::createOr(Not, Op1);
4843 // See if we are doing a comparison between a constant and an instruction that
4844 // can be folded into the comparison.
4845 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
4846 switch (I.getPredicate()) {
4848 case ICmpInst::ICMP_ULT: // A <u MIN -> FALSE
4849 if (CI->isMinValue(false))
4850 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4851 if (CI->isMaxValue(false)) // A <u MAX -> A != MAX
4852 return new ICmpInst(ICmpInst::ICMP_NE, Op0,Op1);
4853 if (isMinValuePlusOne(CI,false)) // A <u MIN+1 -> A == MIN
4854 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, SubOne(CI));
4855 // (x <u 2147483648) -> (x >s -1) -> true if sign bit clear
4856 if (CI->isMinValue(true))
4857 return new ICmpInst(ICmpInst::ICMP_SGT, Op0,
4858 ConstantInt::getAllOnesValue(Op0->getType()));
4862 case ICmpInst::ICMP_SLT:
4863 if (CI->isMinValue(true)) // A <s MIN -> FALSE
4864 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4865 if (CI->isMaxValue(true)) // A <s MAX -> A != MAX
4866 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
4867 if (isMinValuePlusOne(CI,true)) // A <s MIN+1 -> A == MIN
4868 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, SubOne(CI));
4871 case ICmpInst::ICMP_UGT:
4872 if (CI->isMaxValue(false)) // A >u MAX -> FALSE
4873 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4874 if (CI->isMinValue(false)) // A >u MIN -> A != MIN
4875 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
4876 if (isMaxValueMinusOne(CI, false)) // A >u MAX-1 -> A == MAX
4877 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, AddOne(CI));
4879 // (x >u 2147483647) -> (x <s 0) -> true if sign bit set
4880 if (CI->isMaxValue(true))
4881 return new ICmpInst(ICmpInst::ICMP_SLT, Op0,
4882 ConstantInt::getNullValue(Op0->getType()));
4885 case ICmpInst::ICMP_SGT:
4886 if (CI->isMaxValue(true)) // A >s MAX -> FALSE
4887 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4888 if (CI->isMinValue(true)) // A >s MIN -> A != MIN
4889 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
4890 if (isMaxValueMinusOne(CI, true)) // A >s MAX-1 -> A == MAX
4891 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, AddOne(CI));
4894 case ICmpInst::ICMP_ULE:
4895 if (CI->isMaxValue(false)) // A <=u MAX -> TRUE
4896 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4897 if (CI->isMinValue(false)) // A <=u MIN -> A == MIN
4898 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, Op1);
4899 if (isMaxValueMinusOne(CI,false)) // A <=u MAX-1 -> A != MAX
4900 return new ICmpInst(ICmpInst::ICMP_NE, Op0, AddOne(CI));
4903 case ICmpInst::ICMP_SLE:
4904 if (CI->isMaxValue(true)) // A <=s MAX -> TRUE
4905 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4906 if (CI->isMinValue(true)) // A <=s MIN -> A == MIN
4907 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, Op1);
4908 if (isMaxValueMinusOne(CI,true)) // A <=s MAX-1 -> A != MAX
4909 return new ICmpInst(ICmpInst::ICMP_NE, Op0, AddOne(CI));
4912 case ICmpInst::ICMP_UGE:
4913 if (CI->isMinValue(false)) // A >=u MIN -> TRUE
4914 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4915 if (CI->isMaxValue(false)) // A >=u MAX -> A == MAX
4916 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, Op1);
4917 if (isMinValuePlusOne(CI,false)) // A >=u MIN-1 -> A != MIN
4918 return new ICmpInst(ICmpInst::ICMP_NE, Op0, SubOne(CI));
4921 case ICmpInst::ICMP_SGE:
4922 if (CI->isMinValue(true)) // A >=s MIN -> TRUE
4923 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4924 if (CI->isMaxValue(true)) // A >=s MAX -> A == MAX
4925 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, Op1);
4926 if (isMinValuePlusOne(CI,true)) // A >=s MIN-1 -> A != MIN
4927 return new ICmpInst(ICmpInst::ICMP_NE, Op0, SubOne(CI));
4931 // If we still have a icmp le or icmp ge instruction, turn it into the
4932 // appropriate icmp lt or icmp gt instruction. Since the border cases have
4933 // already been handled above, this requires little checking.
4935 switch (I.getPredicate()) {
4937 case ICmpInst::ICMP_ULE:
4938 return new ICmpInst(ICmpInst::ICMP_ULT, Op0, AddOne(CI));
4939 case ICmpInst::ICMP_SLE:
4940 return new ICmpInst(ICmpInst::ICMP_SLT, Op0, AddOne(CI));
4941 case ICmpInst::ICMP_UGE:
4942 return new ICmpInst( ICmpInst::ICMP_UGT, Op0, SubOne(CI));
4943 case ICmpInst::ICMP_SGE:
4944 return new ICmpInst(ICmpInst::ICMP_SGT, Op0, SubOne(CI));
4947 // See if we can fold the comparison based on bits known to be zero or one
4948 // in the input. If this comparison is a normal comparison, it demands all
4949 // bits, if it is a sign bit comparison, it only demands the sign bit.
4952 bool isSignBit = isSignBitCheck(I.getPredicate(), CI, UnusedBit);
4954 uint32_t BitWidth = cast<IntegerType>(Ty)->getBitWidth();
4955 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
4956 if (SimplifyDemandedBits(Op0,
4957 isSignBit ? APInt::getSignBit(BitWidth)
4958 : APInt::getAllOnesValue(BitWidth),
4959 KnownZero, KnownOne, 0))
4962 // Given the known and unknown bits, compute a range that the LHS could be
4964 if ((KnownOne | KnownZero) != 0) {
4965 // Compute the Min, Max and RHS values based on the known bits. For the
4966 // EQ and NE we use unsigned values.
4967 APInt Min(BitWidth, 0), Max(BitWidth, 0);
4968 const APInt& RHSVal = CI->getValue();
4969 if (ICmpInst::isSignedPredicate(I.getPredicate())) {
4970 ComputeSignedMinMaxValuesFromKnownBits(Ty, KnownZero, KnownOne, Min,
4973 ComputeUnsignedMinMaxValuesFromKnownBits(Ty, KnownZero, KnownOne, Min,
4976 switch (I.getPredicate()) { // LE/GE have been folded already.
4977 default: assert(0 && "Unknown icmp opcode!");
4978 case ICmpInst::ICMP_EQ:
4979 if (Max.ult(RHSVal) || Min.ugt(RHSVal))
4980 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4982 case ICmpInst::ICMP_NE:
4983 if (Max.ult(RHSVal) || Min.ugt(RHSVal))
4984 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4986 case ICmpInst::ICMP_ULT:
4987 if (Max.ult(RHSVal))
4988 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4989 if (Min.uge(RHSVal))
4990 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4992 case ICmpInst::ICMP_UGT:
4993 if (Min.ugt(RHSVal))
4994 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4995 if (Max.ule(RHSVal))
4996 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4998 case ICmpInst::ICMP_SLT:
4999 if (Max.slt(RHSVal))
5000 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5001 if (Min.sgt(RHSVal))
5002 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5004 case ICmpInst::ICMP_SGT:
5005 if (Min.sgt(RHSVal))
5006 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5007 if (Max.sle(RHSVal))
5008 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5013 // Since the RHS is a ConstantInt (CI), if the left hand side is an
5014 // instruction, see if that instruction also has constants so that the
5015 // instruction can be folded into the icmp
5016 if (Instruction *LHSI = dyn_cast<Instruction>(Op0))
5017 if (Instruction *Res = visitICmpInstWithInstAndIntCst(I, LHSI, CI))
5021 // Handle icmp with constant (but not simple integer constant) RHS
5022 if (Constant *RHSC = dyn_cast<Constant>(Op1)) {
5023 if (Instruction *LHSI = dyn_cast<Instruction>(Op0))
5024 switch (LHSI->getOpcode()) {
5025 case Instruction::GetElementPtr:
5026 if (RHSC->isNullValue()) {
5027 // icmp pred GEP (P, int 0, int 0, int 0), null -> icmp pred P, null
5028 bool isAllZeros = true;
5029 for (unsigned i = 1, e = LHSI->getNumOperands(); i != e; ++i)
5030 if (!isa<Constant>(LHSI->getOperand(i)) ||
5031 !cast<Constant>(LHSI->getOperand(i))->isNullValue()) {
5036 return new ICmpInst(I.getPredicate(), LHSI->getOperand(0),
5037 Constant::getNullValue(LHSI->getOperand(0)->getType()));
5041 case Instruction::PHI:
5042 if (Instruction *NV = FoldOpIntoPhi(I))
5045 case Instruction::Select: {
5046 // If either operand of the select is a constant, we can fold the
5047 // comparison into the select arms, which will cause one to be
5048 // constant folded and the select turned into a bitwise or.
5049 Value *Op1 = 0, *Op2 = 0;
5050 if (LHSI->hasOneUse()) {
5051 if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(1))) {
5052 // Fold the known value into the constant operand.
5053 Op1 = ConstantExpr::getICmp(I.getPredicate(), C, RHSC);
5054 // Insert a new ICmp of the other select operand.
5055 Op2 = InsertNewInstBefore(new ICmpInst(I.getPredicate(),
5056 LHSI->getOperand(2), RHSC,
5058 } else if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(2))) {
5059 // Fold the known value into the constant operand.
5060 Op2 = ConstantExpr::getICmp(I.getPredicate(), C, RHSC);
5061 // Insert a new ICmp of the other select operand.
5062 Op1 = InsertNewInstBefore(new ICmpInst(I.getPredicate(),
5063 LHSI->getOperand(1), RHSC,
5069 return new SelectInst(LHSI->getOperand(0), Op1, Op2);
5072 case Instruction::Malloc:
5073 // If we have (malloc != null), and if the malloc has a single use, we
5074 // can assume it is successful and remove the malloc.
5075 if (LHSI->hasOneUse() && isa<ConstantPointerNull>(RHSC)) {
5076 AddToWorkList(LHSI);
5077 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty,
5078 !isTrueWhenEqual(I)));
5084 // If we can optimize a 'icmp GEP, P' or 'icmp P, GEP', do so now.
5085 if (User *GEP = dyn_castGetElementPtr(Op0))
5086 if (Instruction *NI = FoldGEPICmp(GEP, Op1, I.getPredicate(), I))
5088 if (User *GEP = dyn_castGetElementPtr(Op1))
5089 if (Instruction *NI = FoldGEPICmp(GEP, Op0,
5090 ICmpInst::getSwappedPredicate(I.getPredicate()), I))
5093 // Test to see if the operands of the icmp are casted versions of other
5094 // values. If the ptr->ptr cast can be stripped off both arguments, we do so
5096 if (BitCastInst *CI = dyn_cast<BitCastInst>(Op0)) {
5097 if (isa<PointerType>(Op0->getType()) &&
5098 (isa<Constant>(Op1) || isa<BitCastInst>(Op1))) {
5099 // We keep moving the cast from the left operand over to the right
5100 // operand, where it can often be eliminated completely.
5101 Op0 = CI->getOperand(0);
5103 // If operand #1 is a bitcast instruction, it must also be a ptr->ptr cast
5104 // so eliminate it as well.
5105 if (BitCastInst *CI2 = dyn_cast<BitCastInst>(Op1))
5106 Op1 = CI2->getOperand(0);
5108 // If Op1 is a constant, we can fold the cast into the constant.
5109 if (Op0->getType() != Op1->getType())
5110 if (Constant *Op1C = dyn_cast<Constant>(Op1)) {
5111 Op1 = ConstantExpr::getBitCast(Op1C, Op0->getType());
5113 // Otherwise, cast the RHS right before the icmp
5114 Op1 = InsertCastBefore(Instruction::BitCast, Op1, Op0->getType(), I);
5116 return new ICmpInst(I.getPredicate(), Op0, Op1);
5120 if (isa<CastInst>(Op0)) {
5121 // Handle the special case of: icmp (cast bool to X), <cst>
5122 // This comes up when you have code like
5125 // For generality, we handle any zero-extension of any operand comparison
5126 // with a constant or another cast from the same type.
5127 if (isa<ConstantInt>(Op1) || isa<CastInst>(Op1))
5128 if (Instruction *R = visitICmpInstWithCastAndCast(I))
5132 if (I.isEquality()) {
5133 Value *A, *B, *C, *D;
5134 if (match(Op0, m_Xor(m_Value(A), m_Value(B)))) {
5135 if (A == Op1 || B == Op1) { // (A^B) == A -> B == 0
5136 Value *OtherVal = A == Op1 ? B : A;
5137 return new ICmpInst(I.getPredicate(), OtherVal,
5138 Constant::getNullValue(A->getType()));
5141 if (match(Op1, m_Xor(m_Value(C), m_Value(D)))) {
5142 // A^c1 == C^c2 --> A == C^(c1^c2)
5143 if (ConstantInt *C1 = dyn_cast<ConstantInt>(B))
5144 if (ConstantInt *C2 = dyn_cast<ConstantInt>(D))
5145 if (Op1->hasOneUse()) {
5146 Constant *NC = ConstantInt::get(C1->getValue() ^ C2->getValue());
5147 Instruction *Xor = BinaryOperator::createXor(C, NC, "tmp");
5148 return new ICmpInst(I.getPredicate(), A,
5149 InsertNewInstBefore(Xor, I));
5152 // A^B == A^D -> B == D
5153 if (A == C) return new ICmpInst(I.getPredicate(), B, D);
5154 if (A == D) return new ICmpInst(I.getPredicate(), B, C);
5155 if (B == C) return new ICmpInst(I.getPredicate(), A, D);
5156 if (B == D) return new ICmpInst(I.getPredicate(), A, C);
5160 if (match(Op1, m_Xor(m_Value(A), m_Value(B))) &&
5161 (A == Op0 || B == Op0)) {
5162 // A == (A^B) -> B == 0
5163 Value *OtherVal = A == Op0 ? B : A;
5164 return new ICmpInst(I.getPredicate(), OtherVal,
5165 Constant::getNullValue(A->getType()));
5167 if (match(Op0, m_Sub(m_Value(A), m_Value(B))) && A == Op1) {
5168 // (A-B) == A -> B == 0
5169 return new ICmpInst(I.getPredicate(), B,
5170 Constant::getNullValue(B->getType()));
5172 if (match(Op1, m_Sub(m_Value(A), m_Value(B))) && A == Op0) {
5173 // A == (A-B) -> B == 0
5174 return new ICmpInst(I.getPredicate(), B,
5175 Constant::getNullValue(B->getType()));
5178 // (X&Z) == (Y&Z) -> (X^Y) & Z == 0
5179 if (Op0->hasOneUse() && Op1->hasOneUse() &&
5180 match(Op0, m_And(m_Value(A), m_Value(B))) &&
5181 match(Op1, m_And(m_Value(C), m_Value(D)))) {
5182 Value *X = 0, *Y = 0, *Z = 0;
5185 X = B; Y = D; Z = A;
5186 } else if (A == D) {
5187 X = B; Y = C; Z = A;
5188 } else if (B == C) {
5189 X = A; Y = D; Z = B;
5190 } else if (B == D) {
5191 X = A; Y = C; Z = B;
5194 if (X) { // Build (X^Y) & Z
5195 Op1 = InsertNewInstBefore(BinaryOperator::createXor(X, Y, "tmp"), I);
5196 Op1 = InsertNewInstBefore(BinaryOperator::createAnd(Op1, Z, "tmp"), I);
5197 I.setOperand(0, Op1);
5198 I.setOperand(1, Constant::getNullValue(Op1->getType()));
5203 return Changed ? &I : 0;
5207 /// FoldICmpDivCst - Fold "icmp pred, ([su]div X, DivRHS), CmpRHS" where DivRHS
5208 /// and CmpRHS are both known to be integer constants.
5209 Instruction *InstCombiner::FoldICmpDivCst(ICmpInst &ICI, BinaryOperator *DivI,
5210 ConstantInt *DivRHS) {
5211 ConstantInt *CmpRHS = cast<ConstantInt>(ICI.getOperand(1));
5212 const APInt &CmpRHSV = CmpRHS->getValue();
5214 // FIXME: If the operand types don't match the type of the divide
5215 // then don't attempt this transform. The code below doesn't have the
5216 // logic to deal with a signed divide and an unsigned compare (and
5217 // vice versa). This is because (x /s C1) <s C2 produces different
5218 // results than (x /s C1) <u C2 or (x /u C1) <s C2 or even
5219 // (x /u C1) <u C2. Simply casting the operands and result won't
5220 // work. :( The if statement below tests that condition and bails
5222 bool DivIsSigned = DivI->getOpcode() == Instruction::SDiv;
5223 if (!ICI.isEquality() && DivIsSigned != ICI.isSignedPredicate())
5225 if (DivRHS->isZero())
5226 return 0; // The ProdOV computation fails on divide by zero.
5228 // Compute Prod = CI * DivRHS. We are essentially solving an equation
5229 // of form X/C1=C2. We solve for X by multiplying C1 (DivRHS) and
5230 // C2 (CI). By solving for X we can turn this into a range check
5231 // instead of computing a divide.
5232 ConstantInt *Prod = Multiply(CmpRHS, DivRHS);
5234 // Determine if the product overflows by seeing if the product is
5235 // not equal to the divide. Make sure we do the same kind of divide
5236 // as in the LHS instruction that we're folding.
5237 bool ProdOV = (DivIsSigned ? ConstantExpr::getSDiv(Prod, DivRHS) :
5238 ConstantExpr::getUDiv(Prod, DivRHS)) != CmpRHS;
5240 // Get the ICmp opcode
5241 ICmpInst::Predicate Pred = ICI.getPredicate();
5243 // Figure out the interval that is being checked. For example, a comparison
5244 // like "X /u 5 == 0" is really checking that X is in the interval [0, 5).
5245 // Compute this interval based on the constants involved and the signedness of
5246 // the compare/divide. This computes a half-open interval, keeping track of
5247 // whether either value in the interval overflows. After analysis each
5248 // overflow variable is set to 0 if it's corresponding bound variable is valid
5249 // -1 if overflowed off the bottom end, or +1 if overflowed off the top end.
5250 int LoOverflow = 0, HiOverflow = 0;
5251 ConstantInt *LoBound = 0, *HiBound = 0;
5254 if (!DivIsSigned) { // udiv
5255 // e.g. X/5 op 3 --> [15, 20)
5257 HiOverflow = LoOverflow = ProdOV;
5259 HiOverflow = AddWithOverflow(HiBound, LoBound, DivRHS, false);
5260 } else if (DivRHS->getValue().isPositive()) { // Divisor is > 0.
5261 if (CmpRHSV == 0) { // (X / pos) op 0
5262 // Can't overflow. e.g. X/2 op 0 --> [-1, 2)
5263 LoBound = cast<ConstantInt>(ConstantExpr::getNeg(SubOne(DivRHS)));
5265 } else if (CmpRHSV.isPositive()) { // (X / pos) op pos
5266 LoBound = Prod; // e.g. X/5 op 3 --> [15, 20)
5267 HiOverflow = LoOverflow = ProdOV;
5269 HiOverflow = AddWithOverflow(HiBound, Prod, DivRHS, true);
5270 } else { // (X / pos) op neg
5271 // e.g. X/5 op -3 --> [-15-4, -15+1) --> [-19, -14)
5272 Constant *DivRHSH = ConstantExpr::getNeg(SubOne(DivRHS));
5273 LoOverflow = AddWithOverflow(LoBound, Prod,
5274 cast<ConstantInt>(DivRHSH), true) ? -1 : 0;
5275 HiBound = AddOne(Prod);
5276 HiOverflow = ProdOV ? -1 : 0;
5278 } else { // Divisor is < 0.
5279 if (CmpRHSV == 0) { // (X / neg) op 0
5280 // e.g. X/-5 op 0 --> [-4, 5)
5281 LoBound = AddOne(DivRHS);
5282 HiBound = cast<ConstantInt>(ConstantExpr::getNeg(DivRHS));
5283 if (HiBound == DivRHS) { // -INTMIN = INTMIN
5284 HiOverflow = 1; // [INTMIN+1, overflow)
5285 HiBound = 0; // e.g. X/INTMIN = 0 --> X > INTMIN
5287 } else if (CmpRHSV.isPositive()) { // (X / neg) op pos
5288 // e.g. X/-5 op 3 --> [-19, -14)
5289 HiOverflow = LoOverflow = ProdOV ? -1 : 0;
5291 LoOverflow = AddWithOverflow(LoBound, Prod, AddOne(DivRHS), true) ?-1:0;
5292 HiBound = AddOne(Prod);
5293 } else { // (X / neg) op neg
5294 // e.g. X/-5 op -3 --> [15, 20)
5296 LoOverflow = HiOverflow = ProdOV ? 1 : 0;
5297 HiBound = Subtract(Prod, DivRHS);
5300 // Dividing by a negative swaps the condition. LT <-> GT
5301 Pred = ICmpInst::getSwappedPredicate(Pred);
5304 Value *X = DivI->getOperand(0);
5306 default: assert(0 && "Unhandled icmp opcode!");
5307 case ICmpInst::ICMP_EQ:
5308 if (LoOverflow && HiOverflow)
5309 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
5310 else if (HiOverflow)
5311 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SGE :
5312 ICmpInst::ICMP_UGE, X, LoBound);
5313 else if (LoOverflow)
5314 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SLT :
5315 ICmpInst::ICMP_ULT, X, HiBound);
5317 return InsertRangeTest(X, LoBound, HiBound, DivIsSigned, true, ICI);
5318 case ICmpInst::ICMP_NE:
5319 if (LoOverflow && HiOverflow)
5320 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
5321 else if (HiOverflow)
5322 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SLT :
5323 ICmpInst::ICMP_ULT, X, LoBound);
5324 else if (LoOverflow)
5325 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SGE :
5326 ICmpInst::ICMP_UGE, X, HiBound);
5328 return InsertRangeTest(X, LoBound, HiBound, DivIsSigned, false, ICI);
5329 case ICmpInst::ICMP_ULT:
5330 case ICmpInst::ICMP_SLT:
5331 if (LoOverflow == +1) // Low bound is greater than input range.
5332 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
5333 if (LoOverflow == -1) // Low bound is less than input range.
5334 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
5335 return new ICmpInst(Pred, X, LoBound);
5336 case ICmpInst::ICMP_UGT:
5337 case ICmpInst::ICMP_SGT:
5338 if (HiOverflow == +1) // High bound greater than input range.
5339 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
5340 else if (HiOverflow == -1) // High bound less than input range.
5341 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
5342 if (Pred == ICmpInst::ICMP_UGT)
5343 return new ICmpInst(ICmpInst::ICMP_UGE, X, HiBound);
5345 return new ICmpInst(ICmpInst::ICMP_SGE, X, HiBound);
5350 /// visitICmpInstWithInstAndIntCst - Handle "icmp (instr, intcst)".
5352 Instruction *InstCombiner::visitICmpInstWithInstAndIntCst(ICmpInst &ICI,
5355 const APInt &RHSV = RHS->getValue();
5357 switch (LHSI->getOpcode()) {
5358 case Instruction::Xor: // (icmp pred (xor X, XorCST), CI)
5359 if (ConstantInt *XorCST = dyn_cast<ConstantInt>(LHSI->getOperand(1))) {
5360 // If this is a comparison that tests the signbit (X < 0) or (x > -1),
5362 if (ICI.getPredicate() == ICmpInst::ICMP_SLT && RHSV == 0 ||
5363 ICI.getPredicate() == ICmpInst::ICMP_SGT && RHSV.isAllOnesValue()) {
5364 Value *CompareVal = LHSI->getOperand(0);
5366 // If the sign bit of the XorCST is not set, there is no change to
5367 // the operation, just stop using the Xor.
5368 if (!XorCST->getValue().isNegative()) {
5369 ICI.setOperand(0, CompareVal);
5370 AddToWorkList(LHSI);
5374 // Was the old condition true if the operand is positive?
5375 bool isTrueIfPositive = ICI.getPredicate() == ICmpInst::ICMP_SGT;
5377 // If so, the new one isn't.
5378 isTrueIfPositive ^= true;
5380 if (isTrueIfPositive)
5381 return new ICmpInst(ICmpInst::ICMP_SGT, CompareVal, SubOne(RHS));
5383 return new ICmpInst(ICmpInst::ICMP_SLT, CompareVal, AddOne(RHS));
5387 case Instruction::And: // (icmp pred (and X, AndCST), RHS)
5388 if (LHSI->hasOneUse() && isa<ConstantInt>(LHSI->getOperand(1)) &&
5389 LHSI->getOperand(0)->hasOneUse()) {
5390 ConstantInt *AndCST = cast<ConstantInt>(LHSI->getOperand(1));
5392 // If the LHS is an AND of a truncating cast, we can widen the
5393 // and/compare to be the input width without changing the value
5394 // produced, eliminating a cast.
5395 if (TruncInst *Cast = dyn_cast<TruncInst>(LHSI->getOperand(0))) {
5396 // We can do this transformation if either the AND constant does not
5397 // have its sign bit set or if it is an equality comparison.
5398 // Extending a relational comparison when we're checking the sign
5399 // bit would not work.
5400 if (Cast->hasOneUse() &&
5401 (ICI.isEquality() || AndCST->getValue().isPositive() &&
5402 RHSV.isPositive())) {
5404 cast<IntegerType>(Cast->getOperand(0)->getType())->getBitWidth();
5405 APInt NewCST = AndCST->getValue();
5406 NewCST.zext(BitWidth);
5408 NewCI.zext(BitWidth);
5409 Instruction *NewAnd =
5410 BinaryOperator::createAnd(Cast->getOperand(0),
5411 ConstantInt::get(NewCST),LHSI->getName());
5412 InsertNewInstBefore(NewAnd, ICI);
5413 return new ICmpInst(ICI.getPredicate(), NewAnd,
5414 ConstantInt::get(NewCI));
5418 // If this is: (X >> C1) & C2 != C3 (where any shift and any compare
5419 // could exist), turn it into (X & (C2 << C1)) != (C3 << C1). This
5420 // happens a LOT in code produced by the C front-end, for bitfield
5422 BinaryOperator *Shift = dyn_cast<BinaryOperator>(LHSI->getOperand(0));
5423 if (Shift && !Shift->isShift())
5427 ShAmt = Shift ? dyn_cast<ConstantInt>(Shift->getOperand(1)) : 0;
5428 const Type *Ty = Shift ? Shift->getType() : 0; // Type of the shift.
5429 const Type *AndTy = AndCST->getType(); // Type of the and.
5431 // We can fold this as long as we can't shift unknown bits
5432 // into the mask. This can only happen with signed shift
5433 // rights, as they sign-extend.
5435 bool CanFold = Shift->isLogicalShift();
5437 // To test for the bad case of the signed shr, see if any
5438 // of the bits shifted in could be tested after the mask.
5439 uint32_t TyBits = Ty->getPrimitiveSizeInBits();
5440 int ShAmtVal = TyBits - ShAmt->getLimitedValue(TyBits);
5442 uint32_t BitWidth = AndTy->getPrimitiveSizeInBits();
5443 if ((APInt::getHighBitsSet(BitWidth, BitWidth-ShAmtVal) &
5444 AndCST->getValue()) == 0)
5450 if (Shift->getOpcode() == Instruction::Shl)
5451 NewCst = ConstantExpr::getLShr(RHS, ShAmt);
5453 NewCst = ConstantExpr::getShl(RHS, ShAmt);
5455 // Check to see if we are shifting out any of the bits being
5457 if (ConstantExpr::get(Shift->getOpcode(), NewCst, ShAmt) != RHS) {
5458 // If we shifted bits out, the fold is not going to work out.
5459 // As a special case, check to see if this means that the
5460 // result is always true or false now.
5461 if (ICI.getPredicate() == ICmpInst::ICMP_EQ)
5462 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
5463 if (ICI.getPredicate() == ICmpInst::ICMP_NE)
5464 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
5466 ICI.setOperand(1, NewCst);
5467 Constant *NewAndCST;
5468 if (Shift->getOpcode() == Instruction::Shl)
5469 NewAndCST = ConstantExpr::getLShr(AndCST, ShAmt);
5471 NewAndCST = ConstantExpr::getShl(AndCST, ShAmt);
5472 LHSI->setOperand(1, NewAndCST);
5473 LHSI->setOperand(0, Shift->getOperand(0));
5474 AddToWorkList(Shift); // Shift is dead.
5475 AddUsesToWorkList(ICI);
5481 // Turn ((X >> Y) & C) == 0 into (X & (C << Y)) == 0. The later is
5482 // preferable because it allows the C<<Y expression to be hoisted out
5483 // of a loop if Y is invariant and X is not.
5484 if (Shift && Shift->hasOneUse() && RHSV == 0 &&
5485 ICI.isEquality() && !Shift->isArithmeticShift() &&
5486 isa<Instruction>(Shift->getOperand(0))) {
5489 if (Shift->getOpcode() == Instruction::LShr) {
5490 NS = BinaryOperator::createShl(AndCST,
5491 Shift->getOperand(1), "tmp");
5493 // Insert a logical shift.
5494 NS = BinaryOperator::createLShr(AndCST,
5495 Shift->getOperand(1), "tmp");
5497 InsertNewInstBefore(cast<Instruction>(NS), ICI);
5499 // Compute X & (C << Y).
5500 Instruction *NewAnd =
5501 BinaryOperator::createAnd(Shift->getOperand(0), NS, LHSI->getName());
5502 InsertNewInstBefore(NewAnd, ICI);
5504 ICI.setOperand(0, NewAnd);
5510 case Instruction::Shl: { // (icmp pred (shl X, ShAmt), CI)
5511 ConstantInt *ShAmt = dyn_cast<ConstantInt>(LHSI->getOperand(1));
5514 uint32_t TypeBits = RHSV.getBitWidth();
5516 // Check that the shift amount is in range. If not, don't perform
5517 // undefined shifts. When the shift is visited it will be
5519 if (ShAmt->uge(TypeBits))
5522 if (ICI.isEquality()) {
5523 // If we are comparing against bits always shifted out, the
5524 // comparison cannot succeed.
5526 ConstantExpr::getShl(ConstantExpr::getLShr(RHS, ShAmt), ShAmt);
5527 if (Comp != RHS) {// Comparing against a bit that we know is zero.
5528 bool IsICMP_NE = ICI.getPredicate() == ICmpInst::ICMP_NE;
5529 Constant *Cst = ConstantInt::get(Type::Int1Ty, IsICMP_NE);
5530 return ReplaceInstUsesWith(ICI, Cst);
5533 if (LHSI->hasOneUse()) {
5534 // Otherwise strength reduce the shift into an and.
5535 uint32_t ShAmtVal = (uint32_t)ShAmt->getLimitedValue(TypeBits);
5537 ConstantInt::get(APInt::getLowBitsSet(TypeBits, TypeBits-ShAmtVal));
5540 BinaryOperator::createAnd(LHSI->getOperand(0),
5541 Mask, LHSI->getName()+".mask");
5542 Value *And = InsertNewInstBefore(AndI, ICI);
5543 return new ICmpInst(ICI.getPredicate(), And,
5544 ConstantInt::get(RHSV.lshr(ShAmtVal)));
5548 // Otherwise, if this is a comparison of the sign bit, simplify to and/test.
5549 bool TrueIfSigned = false;
5550 if (LHSI->hasOneUse() &&
5551 isSignBitCheck(ICI.getPredicate(), RHS, TrueIfSigned)) {
5552 // (X << 31) <s 0 --> (X&1) != 0
5553 Constant *Mask = ConstantInt::get(APInt(TypeBits, 1) <<
5554 (TypeBits-ShAmt->getZExtValue()-1));
5556 BinaryOperator::createAnd(LHSI->getOperand(0),
5557 Mask, LHSI->getName()+".mask");
5558 Value *And = InsertNewInstBefore(AndI, ICI);
5560 return new ICmpInst(TrueIfSigned ? ICmpInst::ICMP_NE : ICmpInst::ICMP_EQ,
5561 And, Constant::getNullValue(And->getType()));
5566 case Instruction::LShr: // (icmp pred (shr X, ShAmt), CI)
5567 case Instruction::AShr: {
5568 ConstantInt *ShAmt = dyn_cast<ConstantInt>(LHSI->getOperand(1));
5571 if (ICI.isEquality()) {
5572 // Check that the shift amount is in range. If not, don't perform
5573 // undefined shifts. When the shift is visited it will be
5575 uint32_t TypeBits = RHSV.getBitWidth();
5576 if (ShAmt->uge(TypeBits))
5578 uint32_t ShAmtVal = (uint32_t)ShAmt->getLimitedValue(TypeBits);
5580 // If we are comparing against bits always shifted out, the
5581 // comparison cannot succeed.
5582 APInt Comp = RHSV << ShAmtVal;
5583 if (LHSI->getOpcode() == Instruction::LShr)
5584 Comp = Comp.lshr(ShAmtVal);
5586 Comp = Comp.ashr(ShAmtVal);
5588 if (Comp != RHSV) { // Comparing against a bit that we know is zero.
5589 bool IsICMP_NE = ICI.getPredicate() == ICmpInst::ICMP_NE;
5590 Constant *Cst = ConstantInt::get(Type::Int1Ty, IsICMP_NE);
5591 return ReplaceInstUsesWith(ICI, Cst);
5594 if (LHSI->hasOneUse() || RHSV == 0) {
5595 // Otherwise strength reduce the shift into an and.
5596 APInt Val(APInt::getHighBitsSet(TypeBits, TypeBits - ShAmtVal));
5597 Constant *Mask = ConstantInt::get(Val);
5600 BinaryOperator::createAnd(LHSI->getOperand(0),
5601 Mask, LHSI->getName()+".mask");
5602 Value *And = InsertNewInstBefore(AndI, ICI);
5603 return new ICmpInst(ICI.getPredicate(), And,
5604 ConstantExpr::getShl(RHS, ShAmt));
5610 case Instruction::SDiv:
5611 case Instruction::UDiv:
5612 // Fold: icmp pred ([us]div X, C1), C2 -> range test
5613 // Fold this div into the comparison, producing a range check.
5614 // Determine, based on the divide type, what the range is being
5615 // checked. If there is an overflow on the low or high side, remember
5616 // it, otherwise compute the range [low, hi) bounding the new value.
5617 // See: InsertRangeTest above for the kinds of replacements possible.
5618 if (ConstantInt *DivRHS = dyn_cast<ConstantInt>(LHSI->getOperand(1)))
5619 if (Instruction *R = FoldICmpDivCst(ICI, cast<BinaryOperator>(LHSI),
5625 // Simplify icmp_eq and icmp_ne instructions with integer constant RHS.
5626 if (ICI.isEquality()) {
5627 bool isICMP_NE = ICI.getPredicate() == ICmpInst::ICMP_NE;
5629 // If the first operand is (add|sub|and|or|xor|rem) with a constant, and
5630 // the second operand is a constant, simplify a bit.
5631 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(LHSI)) {
5632 switch (BO->getOpcode()) {
5633 case Instruction::SRem:
5634 // If we have a signed (X % (2^c)) == 0, turn it into an unsigned one.
5635 if (RHSV == 0 && isa<ConstantInt>(BO->getOperand(1)) &&BO->hasOneUse()){
5636 const APInt &V = cast<ConstantInt>(BO->getOperand(1))->getValue();
5637 if (V.sgt(APInt(V.getBitWidth(), 1)) && V.isPowerOf2()) {
5638 Instruction *NewRem =
5639 BinaryOperator::createURem(BO->getOperand(0), BO->getOperand(1),
5641 InsertNewInstBefore(NewRem, ICI);
5642 return new ICmpInst(ICI.getPredicate(), NewRem,
5643 Constant::getNullValue(BO->getType()));
5647 case Instruction::Add:
5648 // Replace ((add A, B) != C) with (A != C-B) if B & C are constants.
5649 if (ConstantInt *BOp1C = dyn_cast<ConstantInt>(BO->getOperand(1))) {
5650 if (BO->hasOneUse())
5651 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
5652 Subtract(RHS, BOp1C));
5653 } else if (RHSV == 0) {
5654 // Replace ((add A, B) != 0) with (A != -B) if A or B is
5655 // efficiently invertible, or if the add has just this one use.
5656 Value *BOp0 = BO->getOperand(0), *BOp1 = BO->getOperand(1);
5658 if (Value *NegVal = dyn_castNegVal(BOp1))
5659 return new ICmpInst(ICI.getPredicate(), BOp0, NegVal);
5660 else if (Value *NegVal = dyn_castNegVal(BOp0))
5661 return new ICmpInst(ICI.getPredicate(), NegVal, BOp1);
5662 else if (BO->hasOneUse()) {
5663 Instruction *Neg = BinaryOperator::createNeg(BOp1);
5664 InsertNewInstBefore(Neg, ICI);
5666 return new ICmpInst(ICI.getPredicate(), BOp0, Neg);
5670 case Instruction::Xor:
5671 // For the xor case, we can xor two constants together, eliminating
5672 // the explicit xor.
5673 if (Constant *BOC = dyn_cast<Constant>(BO->getOperand(1)))
5674 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
5675 ConstantExpr::getXor(RHS, BOC));
5678 case Instruction::Sub:
5679 // Replace (([sub|xor] A, B) != 0) with (A != B)
5681 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
5685 case Instruction::Or:
5686 // If bits are being or'd in that are not present in the constant we
5687 // are comparing against, then the comparison could never succeed!
5688 if (Constant *BOC = dyn_cast<Constant>(BO->getOperand(1))) {
5689 Constant *NotCI = ConstantExpr::getNot(RHS);
5690 if (!ConstantExpr::getAnd(BOC, NotCI)->isNullValue())
5691 return ReplaceInstUsesWith(ICI, ConstantInt::get(Type::Int1Ty,
5696 case Instruction::And:
5697 if (ConstantInt *BOC = dyn_cast<ConstantInt>(BO->getOperand(1))) {
5698 // If bits are being compared against that are and'd out, then the
5699 // comparison can never succeed!
5700 if ((RHSV & ~BOC->getValue()) != 0)
5701 return ReplaceInstUsesWith(ICI, ConstantInt::get(Type::Int1Ty,
5704 // If we have ((X & C) == C), turn it into ((X & C) != 0).
5705 if (RHS == BOC && RHSV.isPowerOf2())
5706 return new ICmpInst(isICMP_NE ? ICmpInst::ICMP_EQ :
5707 ICmpInst::ICMP_NE, LHSI,
5708 Constant::getNullValue(RHS->getType()));
5710 // Replace (and X, (1 << size(X)-1) != 0) with x s< 0
5711 if (isSignBit(BOC)) {
5712 Value *X = BO->getOperand(0);
5713 Constant *Zero = Constant::getNullValue(X->getType());
5714 ICmpInst::Predicate pred = isICMP_NE ?
5715 ICmpInst::ICMP_SLT : ICmpInst::ICMP_SGE;
5716 return new ICmpInst(pred, X, Zero);
5719 // ((X & ~7) == 0) --> X < 8
5720 if (RHSV == 0 && isHighOnes(BOC)) {
5721 Value *X = BO->getOperand(0);
5722 Constant *NegX = ConstantExpr::getNeg(BOC);
5723 ICmpInst::Predicate pred = isICMP_NE ?
5724 ICmpInst::ICMP_UGE : ICmpInst::ICMP_ULT;
5725 return new ICmpInst(pred, X, NegX);
5730 } else if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(LHSI)) {
5731 // Handle icmp {eq|ne} <intrinsic>, intcst.
5732 if (II->getIntrinsicID() == Intrinsic::bswap) {
5734 ICI.setOperand(0, II->getOperand(1));
5735 ICI.setOperand(1, ConstantInt::get(RHSV.byteSwap()));
5739 } else { // Not a ICMP_EQ/ICMP_NE
5740 // If the LHS is a cast from an integral value of the same size,
5741 // then since we know the RHS is a constant, try to simlify.
5742 if (CastInst *Cast = dyn_cast<CastInst>(LHSI)) {
5743 Value *CastOp = Cast->getOperand(0);
5744 const Type *SrcTy = CastOp->getType();
5745 uint32_t SrcTySize = SrcTy->getPrimitiveSizeInBits();
5746 if (SrcTy->isInteger() &&
5747 SrcTySize == Cast->getType()->getPrimitiveSizeInBits()) {
5748 // If this is an unsigned comparison, try to make the comparison use
5749 // smaller constant values.
5750 if (ICI.getPredicate() == ICmpInst::ICMP_ULT && RHSV.isSignBit()) {
5751 // X u< 128 => X s> -1
5752 return new ICmpInst(ICmpInst::ICMP_SGT, CastOp,
5753 ConstantInt::get(APInt::getAllOnesValue(SrcTySize)));
5754 } else if (ICI.getPredicate() == ICmpInst::ICMP_UGT &&
5755 RHSV == APInt::getSignedMaxValue(SrcTySize)) {
5756 // X u> 127 => X s< 0
5757 return new ICmpInst(ICmpInst::ICMP_SLT, CastOp,
5758 Constant::getNullValue(SrcTy));
5766 /// visitICmpInstWithCastAndCast - Handle icmp (cast x to y), (cast/cst).
5767 /// We only handle extending casts so far.
5769 Instruction *InstCombiner::visitICmpInstWithCastAndCast(ICmpInst &ICI) {
5770 const CastInst *LHSCI = cast<CastInst>(ICI.getOperand(0));
5771 Value *LHSCIOp = LHSCI->getOperand(0);
5772 const Type *SrcTy = LHSCIOp->getType();
5773 const Type *DestTy = LHSCI->getType();
5776 // Turn icmp (ptrtoint x), (ptrtoint/c) into a compare of the input if the
5777 // integer type is the same size as the pointer type.
5778 if (LHSCI->getOpcode() == Instruction::PtrToInt &&
5779 getTargetData().getPointerSizeInBits() ==
5780 cast<IntegerType>(DestTy)->getBitWidth()) {
5782 if (Constant *RHSC = dyn_cast<Constant>(ICI.getOperand(1))) {
5783 RHSOp = ConstantExpr::getIntToPtr(RHSC, SrcTy);
5784 } else if (PtrToIntInst *RHSC = dyn_cast<PtrToIntInst>(ICI.getOperand(1))) {
5785 RHSOp = RHSC->getOperand(0);
5786 // If the pointer types don't match, insert a bitcast.
5787 if (LHSCIOp->getType() != RHSOp->getType())
5788 RHSOp = InsertCastBefore(Instruction::BitCast, RHSOp,
5789 LHSCIOp->getType(), ICI);
5793 return new ICmpInst(ICI.getPredicate(), LHSCIOp, RHSOp);
5796 // The code below only handles extension cast instructions, so far.
5798 if (LHSCI->getOpcode() != Instruction::ZExt &&
5799 LHSCI->getOpcode() != Instruction::SExt)
5802 bool isSignedExt = LHSCI->getOpcode() == Instruction::SExt;
5803 bool isSignedCmp = ICI.isSignedPredicate();
5805 if (CastInst *CI = dyn_cast<CastInst>(ICI.getOperand(1))) {
5806 // Not an extension from the same type?
5807 RHSCIOp = CI->getOperand(0);
5808 if (RHSCIOp->getType() != LHSCIOp->getType())
5811 // If the signedness of the two compares doesn't agree (i.e. one is a sext
5812 // and the other is a zext), then we can't handle this.
5813 if (CI->getOpcode() != LHSCI->getOpcode())
5816 // Likewise, if the signedness of the [sz]exts and the compare don't match,
5817 // then we can't handle this.
5818 if (isSignedExt != isSignedCmp && !ICI.isEquality())
5821 // Okay, just insert a compare of the reduced operands now!
5822 return new ICmpInst(ICI.getPredicate(), LHSCIOp, RHSCIOp);
5825 // If we aren't dealing with a constant on the RHS, exit early
5826 ConstantInt *CI = dyn_cast<ConstantInt>(ICI.getOperand(1));
5830 // Compute the constant that would happen if we truncated to SrcTy then
5831 // reextended to DestTy.
5832 Constant *Res1 = ConstantExpr::getTrunc(CI, SrcTy);
5833 Constant *Res2 = ConstantExpr::getCast(LHSCI->getOpcode(), Res1, DestTy);
5835 // If the re-extended constant didn't change...
5837 // Make sure that sign of the Cmp and the sign of the Cast are the same.
5838 // For example, we might have:
5839 // %A = sext short %X to uint
5840 // %B = icmp ugt uint %A, 1330
5841 // It is incorrect to transform this into
5842 // %B = icmp ugt short %X, 1330
5843 // because %A may have negative value.
5845 // However, it is OK if SrcTy is bool (See cast-set.ll testcase)
5846 // OR operation is EQ/NE.
5847 if (isSignedExt == isSignedCmp || SrcTy == Type::Int1Ty || ICI.isEquality())
5848 return new ICmpInst(ICI.getPredicate(), LHSCIOp, Res1);
5853 // The re-extended constant changed so the constant cannot be represented
5854 // in the shorter type. Consequently, we cannot emit a simple comparison.
5856 // First, handle some easy cases. We know the result cannot be equal at this
5857 // point so handle the ICI.isEquality() cases
5858 if (ICI.getPredicate() == ICmpInst::ICMP_EQ)
5859 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
5860 if (ICI.getPredicate() == ICmpInst::ICMP_NE)
5861 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
5863 // Evaluate the comparison for LT (we invert for GT below). LE and GE cases
5864 // should have been folded away previously and not enter in here.
5867 // We're performing a signed comparison.
5868 if (cast<ConstantInt>(CI)->getValue().isNegative())
5869 Result = ConstantInt::getFalse(); // X < (small) --> false
5871 Result = ConstantInt::getTrue(); // X < (large) --> true
5873 // We're performing an unsigned comparison.
5875 // We're performing an unsigned comp with a sign extended value.
5876 // This is true if the input is >= 0. [aka >s -1]
5877 Constant *NegOne = ConstantInt::getAllOnesValue(SrcTy);
5878 Result = InsertNewInstBefore(new ICmpInst(ICmpInst::ICMP_SGT, LHSCIOp,
5879 NegOne, ICI.getName()), ICI);
5881 // Unsigned extend & unsigned compare -> always true.
5882 Result = ConstantInt::getTrue();
5886 // Finally, return the value computed.
5887 if (ICI.getPredicate() == ICmpInst::ICMP_ULT ||
5888 ICI.getPredicate() == ICmpInst::ICMP_SLT) {
5889 return ReplaceInstUsesWith(ICI, Result);
5891 assert((ICI.getPredicate()==ICmpInst::ICMP_UGT ||
5892 ICI.getPredicate()==ICmpInst::ICMP_SGT) &&
5893 "ICmp should be folded!");
5894 if (Constant *CI = dyn_cast<Constant>(Result))
5895 return ReplaceInstUsesWith(ICI, ConstantExpr::getNot(CI));
5897 return BinaryOperator::createNot(Result);
5901 Instruction *InstCombiner::visitShl(BinaryOperator &I) {
5902 return commonShiftTransforms(I);
5905 Instruction *InstCombiner::visitLShr(BinaryOperator &I) {
5906 return commonShiftTransforms(I);
5909 Instruction *InstCombiner::visitAShr(BinaryOperator &I) {
5910 if (Instruction *R = commonShiftTransforms(I))
5913 Value *Op0 = I.getOperand(0);
5915 // ashr int -1, X = -1 (for any arithmetic shift rights of ~0)
5916 if (ConstantInt *CSI = dyn_cast<ConstantInt>(Op0))
5917 if (CSI->isAllOnesValue())
5918 return ReplaceInstUsesWith(I, CSI);
5920 // See if we can turn a signed shr into an unsigned shr.
5921 if (MaskedValueIsZero(Op0,
5922 APInt::getSignBit(I.getType()->getPrimitiveSizeInBits())))
5923 return BinaryOperator::createLShr(Op0, I.getOperand(1));
5928 Instruction *InstCombiner::commonShiftTransforms(BinaryOperator &I) {
5929 assert(I.getOperand(1)->getType() == I.getOperand(0)->getType());
5930 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
5932 // shl X, 0 == X and shr X, 0 == X
5933 // shl 0, X == 0 and shr 0, X == 0
5934 if (Op1 == Constant::getNullValue(Op1->getType()) ||
5935 Op0 == Constant::getNullValue(Op0->getType()))
5936 return ReplaceInstUsesWith(I, Op0);
5938 if (isa<UndefValue>(Op0)) {
5939 if (I.getOpcode() == Instruction::AShr) // undef >>s X -> undef
5940 return ReplaceInstUsesWith(I, Op0);
5941 else // undef << X -> 0, undef >>u X -> 0
5942 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
5944 if (isa<UndefValue>(Op1)) {
5945 if (I.getOpcode() == Instruction::AShr) // X >>s undef -> X
5946 return ReplaceInstUsesWith(I, Op0);
5947 else // X << undef, X >>u undef -> 0
5948 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
5951 // Try to fold constant and into select arguments.
5952 if (isa<Constant>(Op0))
5953 if (SelectInst *SI = dyn_cast<SelectInst>(Op1))
5954 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
5957 if (ConstantInt *CUI = dyn_cast<ConstantInt>(Op1))
5958 if (Instruction *Res = FoldShiftByConstant(Op0, CUI, I))
5963 Instruction *InstCombiner::FoldShiftByConstant(Value *Op0, ConstantInt *Op1,
5964 BinaryOperator &I) {
5965 bool isLeftShift = I.getOpcode() == Instruction::Shl;
5967 // See if we can simplify any instructions used by the instruction whose sole
5968 // purpose is to compute bits we don't care about.
5969 uint32_t TypeBits = Op0->getType()->getPrimitiveSizeInBits();
5970 APInt KnownZero(TypeBits, 0), KnownOne(TypeBits, 0);
5971 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(TypeBits),
5972 KnownZero, KnownOne))
5975 // shl uint X, 32 = 0 and shr ubyte Y, 9 = 0, ... just don't eliminate shr
5976 // of a signed value.
5978 if (Op1->uge(TypeBits)) {
5979 if (I.getOpcode() != Instruction::AShr)
5980 return ReplaceInstUsesWith(I, Constant::getNullValue(Op0->getType()));
5982 I.setOperand(1, ConstantInt::get(I.getType(), TypeBits-1));
5987 // ((X*C1) << C2) == (X * (C1 << C2))
5988 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(Op0))
5989 if (BO->getOpcode() == Instruction::Mul && isLeftShift)
5990 if (Constant *BOOp = dyn_cast<Constant>(BO->getOperand(1)))
5991 return BinaryOperator::createMul(BO->getOperand(0),
5992 ConstantExpr::getShl(BOOp, Op1));
5994 // Try to fold constant and into select arguments.
5995 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
5996 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
5998 if (isa<PHINode>(Op0))
5999 if (Instruction *NV = FoldOpIntoPhi(I))
6002 if (Op0->hasOneUse()) {
6003 if (BinaryOperator *Op0BO = dyn_cast<BinaryOperator>(Op0)) {
6004 // Turn ((X >> C) + Y) << C -> (X + (Y << C)) & (~0 << C)
6007 switch (Op0BO->getOpcode()) {
6009 case Instruction::Add:
6010 case Instruction::And:
6011 case Instruction::Or:
6012 case Instruction::Xor: {
6013 // These operators commute.
6014 // Turn (Y + (X >> C)) << C -> (X + (Y << C)) & (~0 << C)
6015 if (isLeftShift && Op0BO->getOperand(1)->hasOneUse() &&
6016 match(Op0BO->getOperand(1),
6017 m_Shr(m_Value(V1), m_ConstantInt(CC))) && CC == Op1) {
6018 Instruction *YS = BinaryOperator::createShl(
6019 Op0BO->getOperand(0), Op1,
6021 InsertNewInstBefore(YS, I); // (Y << C)
6023 BinaryOperator::create(Op0BO->getOpcode(), YS, V1,
6024 Op0BO->getOperand(1)->getName());
6025 InsertNewInstBefore(X, I); // (X + (Y << C))
6026 uint32_t Op1Val = Op1->getLimitedValue(TypeBits);
6027 return BinaryOperator::createAnd(X, ConstantInt::get(
6028 APInt::getHighBitsSet(TypeBits, TypeBits-Op1Val)));
6031 // Turn (Y + ((X >> C) & CC)) << C -> ((X & (CC << C)) + (Y << C))
6032 Value *Op0BOOp1 = Op0BO->getOperand(1);
6033 if (isLeftShift && Op0BOOp1->hasOneUse() &&
6035 m_And(m_Shr(m_Value(V1), m_Value(V2)),m_ConstantInt(CC))) &&
6036 cast<BinaryOperator>(Op0BOOp1)->getOperand(0)->hasOneUse() &&
6038 Instruction *YS = BinaryOperator::createShl(
6039 Op0BO->getOperand(0), Op1,
6041 InsertNewInstBefore(YS, I); // (Y << C)
6043 BinaryOperator::createAnd(V1, ConstantExpr::getShl(CC, Op1),
6044 V1->getName()+".mask");
6045 InsertNewInstBefore(XM, I); // X & (CC << C)
6047 return BinaryOperator::create(Op0BO->getOpcode(), YS, XM);
6052 case Instruction::Sub: {
6053 // Turn ((X >> C) + Y) << C -> (X + (Y << C)) & (~0 << C)
6054 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() &&
6055 match(Op0BO->getOperand(0),
6056 m_Shr(m_Value(V1), m_ConstantInt(CC))) && CC == Op1) {
6057 Instruction *YS = BinaryOperator::createShl(
6058 Op0BO->getOperand(1), Op1,
6060 InsertNewInstBefore(YS, I); // (Y << C)
6062 BinaryOperator::create(Op0BO->getOpcode(), V1, YS,
6063 Op0BO->getOperand(0)->getName());
6064 InsertNewInstBefore(X, I); // (X + (Y << C))
6065 uint32_t Op1Val = Op1->getLimitedValue(TypeBits);
6066 return BinaryOperator::createAnd(X, ConstantInt::get(
6067 APInt::getHighBitsSet(TypeBits, TypeBits-Op1Val)));
6070 // Turn (((X >> C)&CC) + Y) << C -> (X + (Y << C)) & (CC << C)
6071 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() &&
6072 match(Op0BO->getOperand(0),
6073 m_And(m_Shr(m_Value(V1), m_Value(V2)),
6074 m_ConstantInt(CC))) && V2 == Op1 &&
6075 cast<BinaryOperator>(Op0BO->getOperand(0))
6076 ->getOperand(0)->hasOneUse()) {
6077 Instruction *YS = BinaryOperator::createShl(
6078 Op0BO->getOperand(1), Op1,
6080 InsertNewInstBefore(YS, I); // (Y << C)
6082 BinaryOperator::createAnd(V1, ConstantExpr::getShl(CC, Op1),
6083 V1->getName()+".mask");
6084 InsertNewInstBefore(XM, I); // X & (CC << C)
6086 return BinaryOperator::create(Op0BO->getOpcode(), XM, YS);
6094 // If the operand is an bitwise operator with a constant RHS, and the
6095 // shift is the only use, we can pull it out of the shift.
6096 if (ConstantInt *Op0C = dyn_cast<ConstantInt>(Op0BO->getOperand(1))) {
6097 bool isValid = true; // Valid only for And, Or, Xor
6098 bool highBitSet = false; // Transform if high bit of constant set?
6100 switch (Op0BO->getOpcode()) {
6101 default: isValid = false; break; // Do not perform transform!
6102 case Instruction::Add:
6103 isValid = isLeftShift;
6105 case Instruction::Or:
6106 case Instruction::Xor:
6109 case Instruction::And:
6114 // If this is a signed shift right, and the high bit is modified
6115 // by the logical operation, do not perform the transformation.
6116 // The highBitSet boolean indicates the value of the high bit of
6117 // the constant which would cause it to be modified for this
6120 if (isValid && I.getOpcode() == Instruction::AShr)
6121 isValid = Op0C->getValue()[TypeBits-1] == highBitSet;
6124 Constant *NewRHS = ConstantExpr::get(I.getOpcode(), Op0C, Op1);
6126 Instruction *NewShift =
6127 BinaryOperator::create(I.getOpcode(), Op0BO->getOperand(0), Op1);
6128 InsertNewInstBefore(NewShift, I);
6129 NewShift->takeName(Op0BO);
6131 return BinaryOperator::create(Op0BO->getOpcode(), NewShift,
6138 // Find out if this is a shift of a shift by a constant.
6139 BinaryOperator *ShiftOp = dyn_cast<BinaryOperator>(Op0);
6140 if (ShiftOp && !ShiftOp->isShift())
6143 if (ShiftOp && isa<ConstantInt>(ShiftOp->getOperand(1))) {
6144 ConstantInt *ShiftAmt1C = cast<ConstantInt>(ShiftOp->getOperand(1));
6145 uint32_t ShiftAmt1 = ShiftAmt1C->getLimitedValue(TypeBits);
6146 uint32_t ShiftAmt2 = Op1->getLimitedValue(TypeBits);
6147 assert(ShiftAmt2 != 0 && "Should have been simplified earlier");
6148 if (ShiftAmt1 == 0) return 0; // Will be simplified in the future.
6149 Value *X = ShiftOp->getOperand(0);
6151 uint32_t AmtSum = ShiftAmt1+ShiftAmt2; // Fold into one big shift.
6152 if (AmtSum > TypeBits)
6155 const IntegerType *Ty = cast<IntegerType>(I.getType());
6157 // Check for (X << c1) << c2 and (X >> c1) >> c2
6158 if (I.getOpcode() == ShiftOp->getOpcode()) {
6159 return BinaryOperator::create(I.getOpcode(), X,
6160 ConstantInt::get(Ty, AmtSum));
6161 } else if (ShiftOp->getOpcode() == Instruction::LShr &&
6162 I.getOpcode() == Instruction::AShr) {
6163 // ((X >>u C1) >>s C2) -> (X >>u (C1+C2)) since C1 != 0.
6164 return BinaryOperator::createLShr(X, ConstantInt::get(Ty, AmtSum));
6165 } else if (ShiftOp->getOpcode() == Instruction::AShr &&
6166 I.getOpcode() == Instruction::LShr) {
6167 // ((X >>s C1) >>u C2) -> ((X >>s (C1+C2)) & mask) since C1 != 0.
6168 Instruction *Shift =
6169 BinaryOperator::createAShr(X, ConstantInt::get(Ty, AmtSum));
6170 InsertNewInstBefore(Shift, I);
6172 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt2));
6173 return BinaryOperator::createAnd(Shift, ConstantInt::get(Mask));
6176 // Okay, if we get here, one shift must be left, and the other shift must be
6177 // right. See if the amounts are equal.
6178 if (ShiftAmt1 == ShiftAmt2) {
6179 // If we have ((X >>? C) << C), turn this into X & (-1 << C).
6180 if (I.getOpcode() == Instruction::Shl) {
6181 APInt Mask(APInt::getHighBitsSet(TypeBits, TypeBits - ShiftAmt1));
6182 return BinaryOperator::createAnd(X, ConstantInt::get(Mask));
6184 // If we have ((X << C) >>u C), turn this into X & (-1 >>u C).
6185 if (I.getOpcode() == Instruction::LShr) {
6186 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt1));
6187 return BinaryOperator::createAnd(X, ConstantInt::get(Mask));
6189 // We can simplify ((X << C) >>s C) into a trunc + sext.
6190 // NOTE: we could do this for any C, but that would make 'unusual' integer
6191 // types. For now, just stick to ones well-supported by the code
6193 const Type *SExtType = 0;
6194 switch (Ty->getBitWidth() - ShiftAmt1) {
6201 SExtType = IntegerType::get(Ty->getBitWidth() - ShiftAmt1);
6206 Instruction *NewTrunc = new TruncInst(X, SExtType, "sext");
6207 InsertNewInstBefore(NewTrunc, I);
6208 return new SExtInst(NewTrunc, Ty);
6210 // Otherwise, we can't handle it yet.
6211 } else if (ShiftAmt1 < ShiftAmt2) {
6212 uint32_t ShiftDiff = ShiftAmt2-ShiftAmt1;
6214 // (X >>? C1) << C2 --> X << (C2-C1) & (-1 << C2)
6215 if (I.getOpcode() == Instruction::Shl) {
6216 assert(ShiftOp->getOpcode() == Instruction::LShr ||
6217 ShiftOp->getOpcode() == Instruction::AShr);
6218 Instruction *Shift =
6219 BinaryOperator::createShl(X, ConstantInt::get(Ty, ShiftDiff));
6220 InsertNewInstBefore(Shift, I);
6222 APInt Mask(APInt::getHighBitsSet(TypeBits, TypeBits - ShiftAmt2));
6223 return BinaryOperator::createAnd(Shift, ConstantInt::get(Mask));
6226 // (X << C1) >>u C2 --> X >>u (C2-C1) & (-1 >> C2)
6227 if (I.getOpcode() == Instruction::LShr) {
6228 assert(ShiftOp->getOpcode() == Instruction::Shl);
6229 Instruction *Shift =
6230 BinaryOperator::createLShr(X, ConstantInt::get(Ty, ShiftDiff));
6231 InsertNewInstBefore(Shift, I);
6233 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt2));
6234 return BinaryOperator::createAnd(Shift, ConstantInt::get(Mask));
6237 // We can't handle (X << C1) >>s C2, it shifts arbitrary bits in.
6239 assert(ShiftAmt2 < ShiftAmt1);
6240 uint32_t ShiftDiff = ShiftAmt1-ShiftAmt2;
6242 // (X >>? C1) << C2 --> X >>? (C1-C2) & (-1 << C2)
6243 if (I.getOpcode() == Instruction::Shl) {
6244 assert(ShiftOp->getOpcode() == Instruction::LShr ||
6245 ShiftOp->getOpcode() == Instruction::AShr);
6246 Instruction *Shift =
6247 BinaryOperator::create(ShiftOp->getOpcode(), X,
6248 ConstantInt::get(Ty, ShiftDiff));
6249 InsertNewInstBefore(Shift, I);
6251 APInt Mask(APInt::getHighBitsSet(TypeBits, TypeBits - ShiftAmt2));
6252 return BinaryOperator::createAnd(Shift, ConstantInt::get(Mask));
6255 // (X << C1) >>u C2 --> X << (C1-C2) & (-1 >> C2)
6256 if (I.getOpcode() == Instruction::LShr) {
6257 assert(ShiftOp->getOpcode() == Instruction::Shl);
6258 Instruction *Shift =
6259 BinaryOperator::createShl(X, ConstantInt::get(Ty, ShiftDiff));
6260 InsertNewInstBefore(Shift, I);
6262 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt2));
6263 return BinaryOperator::createAnd(Shift, ConstantInt::get(Mask));
6266 // We can't handle (X << C1) >>a C2, it shifts arbitrary bits in.
6273 /// DecomposeSimpleLinearExpr - Analyze 'Val', seeing if it is a simple linear
6274 /// expression. If so, decompose it, returning some value X, such that Val is
6277 static Value *DecomposeSimpleLinearExpr(Value *Val, unsigned &Scale,
6279 assert(Val->getType() == Type::Int32Ty && "Unexpected allocation size type!");
6280 if (ConstantInt *CI = dyn_cast<ConstantInt>(Val)) {
6281 Offset = CI->getZExtValue();
6283 return ConstantInt::get(Type::Int32Ty, 0);
6284 } else if (BinaryOperator *I = dyn_cast<BinaryOperator>(Val)) {
6285 if (ConstantInt *RHS = dyn_cast<ConstantInt>(I->getOperand(1))) {
6286 if (I->getOpcode() == Instruction::Shl) {
6287 // This is a value scaled by '1 << the shift amt'.
6288 Scale = 1U << RHS->getZExtValue();
6290 return I->getOperand(0);
6291 } else if (I->getOpcode() == Instruction::Mul) {
6292 // This value is scaled by 'RHS'.
6293 Scale = RHS->getZExtValue();
6295 return I->getOperand(0);
6296 } else if (I->getOpcode() == Instruction::Add) {
6297 // We have X+C. Check to see if we really have (X*C2)+C1,
6298 // where C1 is divisible by C2.
6301 DecomposeSimpleLinearExpr(I->getOperand(0), SubScale, Offset);
6302 Offset += RHS->getZExtValue();
6309 // Otherwise, we can't look past this.
6316 /// PromoteCastOfAllocation - If we find a cast of an allocation instruction,
6317 /// try to eliminate the cast by moving the type information into the alloc.
6318 Instruction *InstCombiner::PromoteCastOfAllocation(BitCastInst &CI,
6319 AllocationInst &AI) {
6320 const PointerType *PTy = cast<PointerType>(CI.getType());
6322 // Remove any uses of AI that are dead.
6323 assert(!CI.use_empty() && "Dead instructions should be removed earlier!");
6325 for (Value::use_iterator UI = AI.use_begin(), E = AI.use_end(); UI != E; ) {
6326 Instruction *User = cast<Instruction>(*UI++);
6327 if (isInstructionTriviallyDead(User)) {
6328 while (UI != E && *UI == User)
6329 ++UI; // If this instruction uses AI more than once, don't break UI.
6332 DOUT << "IC: DCE: " << *User;
6333 EraseInstFromFunction(*User);
6337 // Get the type really allocated and the type casted to.
6338 const Type *AllocElTy = AI.getAllocatedType();
6339 const Type *CastElTy = PTy->getElementType();
6340 if (!AllocElTy->isSized() || !CastElTy->isSized()) return 0;
6342 unsigned AllocElTyAlign = TD->getABITypeAlignment(AllocElTy);
6343 unsigned CastElTyAlign = TD->getABITypeAlignment(CastElTy);
6344 if (CastElTyAlign < AllocElTyAlign) return 0;
6346 // If the allocation has multiple uses, only promote it if we are strictly
6347 // increasing the alignment of the resultant allocation. If we keep it the
6348 // same, we open the door to infinite loops of various kinds.
6349 if (!AI.hasOneUse() && CastElTyAlign == AllocElTyAlign) return 0;
6351 uint64_t AllocElTySize = TD->getABITypeSize(AllocElTy);
6352 uint64_t CastElTySize = TD->getABITypeSize(CastElTy);
6353 if (CastElTySize == 0 || AllocElTySize == 0) return 0;
6355 // See if we can satisfy the modulus by pulling a scale out of the array
6357 unsigned ArraySizeScale;
6359 Value *NumElements = // See if the array size is a decomposable linear expr.
6360 DecomposeSimpleLinearExpr(AI.getOperand(0), ArraySizeScale, ArrayOffset);
6362 // If we can now satisfy the modulus, by using a non-1 scale, we really can
6364 if ((AllocElTySize*ArraySizeScale) % CastElTySize != 0 ||
6365 (AllocElTySize*ArrayOffset ) % CastElTySize != 0) return 0;
6367 unsigned Scale = (AllocElTySize*ArraySizeScale)/CastElTySize;
6372 // If the allocation size is constant, form a constant mul expression
6373 Amt = ConstantInt::get(Type::Int32Ty, Scale);
6374 if (isa<ConstantInt>(NumElements))
6375 Amt = Multiply(cast<ConstantInt>(NumElements), cast<ConstantInt>(Amt));
6376 // otherwise multiply the amount and the number of elements
6377 else if (Scale != 1) {
6378 Instruction *Tmp = BinaryOperator::createMul(Amt, NumElements, "tmp");
6379 Amt = InsertNewInstBefore(Tmp, AI);
6383 if (int Offset = (AllocElTySize*ArrayOffset)/CastElTySize) {
6384 Value *Off = ConstantInt::get(Type::Int32Ty, Offset, true);
6385 Instruction *Tmp = BinaryOperator::createAdd(Amt, Off, "tmp");
6386 Amt = InsertNewInstBefore(Tmp, AI);
6389 AllocationInst *New;
6390 if (isa<MallocInst>(AI))
6391 New = new MallocInst(CastElTy, Amt, AI.getAlignment());
6393 New = new AllocaInst(CastElTy, Amt, AI.getAlignment());
6394 InsertNewInstBefore(New, AI);
6397 // If the allocation has multiple uses, insert a cast and change all things
6398 // that used it to use the new cast. This will also hack on CI, but it will
6400 if (!AI.hasOneUse()) {
6401 AddUsesToWorkList(AI);
6402 // New is the allocation instruction, pointer typed. AI is the original
6403 // allocation instruction, also pointer typed. Thus, cast to use is BitCast.
6404 CastInst *NewCast = new BitCastInst(New, AI.getType(), "tmpcast");
6405 InsertNewInstBefore(NewCast, AI);
6406 AI.replaceAllUsesWith(NewCast);
6408 return ReplaceInstUsesWith(CI, New);
6411 /// CanEvaluateInDifferentType - Return true if we can take the specified value
6412 /// and return it as type Ty without inserting any new casts and without
6413 /// changing the computed value. This is used by code that tries to decide
6414 /// whether promoting or shrinking integer operations to wider or smaller types
6415 /// will allow us to eliminate a truncate or extend.
6417 /// This is a truncation operation if Ty is smaller than V->getType(), or an
6418 /// extension operation if Ty is larger.
6419 static bool CanEvaluateInDifferentType(Value *V, const IntegerType *Ty,
6420 unsigned CastOpc, int &NumCastsRemoved) {
6421 // We can always evaluate constants in another type.
6422 if (isa<ConstantInt>(V))
6425 Instruction *I = dyn_cast<Instruction>(V);
6426 if (!I) return false;
6428 const IntegerType *OrigTy = cast<IntegerType>(V->getType());
6430 // If this is an extension or truncate, we can often eliminate it.
6431 if (isa<TruncInst>(I) || isa<ZExtInst>(I) || isa<SExtInst>(I)) {
6432 // If this is a cast from the destination type, we can trivially eliminate
6433 // it, and this will remove a cast overall.
6434 if (I->getOperand(0)->getType() == Ty) {
6435 // If the first operand is itself a cast, and is eliminable, do not count
6436 // this as an eliminable cast. We would prefer to eliminate those two
6438 if (!isa<CastInst>(I->getOperand(0)))
6444 // We can't extend or shrink something that has multiple uses: doing so would
6445 // require duplicating the instruction in general, which isn't profitable.
6446 if (!I->hasOneUse()) return false;
6448 switch (I->getOpcode()) {
6449 case Instruction::Add:
6450 case Instruction::Sub:
6451 case Instruction::And:
6452 case Instruction::Or:
6453 case Instruction::Xor:
6454 // These operators can all arbitrarily be extended or truncated.
6455 return CanEvaluateInDifferentType(I->getOperand(0), Ty, CastOpc,
6457 CanEvaluateInDifferentType(I->getOperand(1), Ty, CastOpc,
6460 case Instruction::Shl:
6461 // If we are truncating the result of this SHL, and if it's a shift of a
6462 // constant amount, we can always perform a SHL in a smaller type.
6463 if (ConstantInt *CI = dyn_cast<ConstantInt>(I->getOperand(1))) {
6464 uint32_t BitWidth = Ty->getBitWidth();
6465 if (BitWidth < OrigTy->getBitWidth() &&
6466 CI->getLimitedValue(BitWidth) < BitWidth)
6467 return CanEvaluateInDifferentType(I->getOperand(0), Ty, CastOpc,
6471 case Instruction::LShr:
6472 // If this is a truncate of a logical shr, we can truncate it to a smaller
6473 // lshr iff we know that the bits we would otherwise be shifting in are
6475 if (ConstantInt *CI = dyn_cast<ConstantInt>(I->getOperand(1))) {
6476 uint32_t OrigBitWidth = OrigTy->getBitWidth();
6477 uint32_t BitWidth = Ty->getBitWidth();
6478 if (BitWidth < OrigBitWidth &&
6479 MaskedValueIsZero(I->getOperand(0),
6480 APInt::getHighBitsSet(OrigBitWidth, OrigBitWidth-BitWidth)) &&
6481 CI->getLimitedValue(BitWidth) < BitWidth) {
6482 return CanEvaluateInDifferentType(I->getOperand(0), Ty, CastOpc,
6487 case Instruction::ZExt:
6488 case Instruction::SExt:
6489 case Instruction::Trunc:
6490 // If this is the same kind of case as our original (e.g. zext+zext), we
6491 // can safely replace it. Note that replacing it does not reduce the number
6492 // of casts in the input.
6493 if (I->getOpcode() == CastOpc)
6498 // TODO: Can handle more cases here.
6505 /// EvaluateInDifferentType - Given an expression that
6506 /// CanEvaluateInDifferentType returns true for, actually insert the code to
6507 /// evaluate the expression.
6508 Value *InstCombiner::EvaluateInDifferentType(Value *V, const Type *Ty,
6510 if (Constant *C = dyn_cast<Constant>(V))
6511 return ConstantExpr::getIntegerCast(C, Ty, isSigned /*Sext or ZExt*/);
6513 // Otherwise, it must be an instruction.
6514 Instruction *I = cast<Instruction>(V);
6515 Instruction *Res = 0;
6516 switch (I->getOpcode()) {
6517 case Instruction::Add:
6518 case Instruction::Sub:
6519 case Instruction::And:
6520 case Instruction::Or:
6521 case Instruction::Xor:
6522 case Instruction::AShr:
6523 case Instruction::LShr:
6524 case Instruction::Shl: {
6525 Value *LHS = EvaluateInDifferentType(I->getOperand(0), Ty, isSigned);
6526 Value *RHS = EvaluateInDifferentType(I->getOperand(1), Ty, isSigned);
6527 Res = BinaryOperator::create((Instruction::BinaryOps)I->getOpcode(),
6528 LHS, RHS, I->getName());
6531 case Instruction::Trunc:
6532 case Instruction::ZExt:
6533 case Instruction::SExt:
6534 // If the source type of the cast is the type we're trying for then we can
6535 // just return the source. There's no need to insert it because it is not
6537 if (I->getOperand(0)->getType() == Ty)
6538 return I->getOperand(0);
6540 // Otherwise, must be the same type of case, so just reinsert a new one.
6541 Res = CastInst::create(cast<CastInst>(I)->getOpcode(), I->getOperand(0),
6545 // TODO: Can handle more cases here.
6546 assert(0 && "Unreachable!");
6550 return InsertNewInstBefore(Res, *I);
6553 /// @brief Implement the transforms common to all CastInst visitors.
6554 Instruction *InstCombiner::commonCastTransforms(CastInst &CI) {
6555 Value *Src = CI.getOperand(0);
6557 // Many cases of "cast of a cast" are eliminable. If it's eliminable we just
6558 // eliminate it now.
6559 if (CastInst *CSrc = dyn_cast<CastInst>(Src)) { // A->B->C cast
6560 if (Instruction::CastOps opc =
6561 isEliminableCastPair(CSrc, CI.getOpcode(), CI.getType(), TD)) {
6562 // The first cast (CSrc) is eliminable so we need to fix up or replace
6563 // the second cast (CI). CSrc will then have a good chance of being dead.
6564 return CastInst::create(opc, CSrc->getOperand(0), CI.getType());
6568 // If we are casting a select then fold the cast into the select
6569 if (SelectInst *SI = dyn_cast<SelectInst>(Src))
6570 if (Instruction *NV = FoldOpIntoSelect(CI, SI, this))
6573 // If we are casting a PHI then fold the cast into the PHI
6574 if (isa<PHINode>(Src))
6575 if (Instruction *NV = FoldOpIntoPhi(CI))
6581 /// @brief Implement the transforms for cast of pointer (bitcast/ptrtoint)
6582 Instruction *InstCombiner::commonPointerCastTransforms(CastInst &CI) {
6583 Value *Src = CI.getOperand(0);
6585 if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Src)) {
6586 // If casting the result of a getelementptr instruction with no offset, turn
6587 // this into a cast of the original pointer!
6588 if (GEP->hasAllZeroIndices()) {
6589 // Changing the cast operand is usually not a good idea but it is safe
6590 // here because the pointer operand is being replaced with another
6591 // pointer operand so the opcode doesn't need to change.
6593 CI.setOperand(0, GEP->getOperand(0));
6597 // If the GEP has a single use, and the base pointer is a bitcast, and the
6598 // GEP computes a constant offset, see if we can convert these three
6599 // instructions into fewer. This typically happens with unions and other
6600 // non-type-safe code.
6601 if (GEP->hasOneUse() && isa<BitCastInst>(GEP->getOperand(0))) {
6602 if (GEP->hasAllConstantIndices()) {
6603 // We are guaranteed to get a constant from EmitGEPOffset.
6604 ConstantInt *OffsetV = cast<ConstantInt>(EmitGEPOffset(GEP, CI, *this));
6605 int64_t Offset = OffsetV->getSExtValue();
6607 // Get the base pointer input of the bitcast, and the type it points to.
6608 Value *OrigBase = cast<BitCastInst>(GEP->getOperand(0))->getOperand(0);
6609 const Type *GEPIdxTy =
6610 cast<PointerType>(OrigBase->getType())->getElementType();
6611 if (GEPIdxTy->isSized()) {
6612 SmallVector<Value*, 8> NewIndices;
6614 // Start with the index over the outer type. Note that the type size
6615 // might be zero (even if the offset isn't zero) if the indexed type
6616 // is something like [0 x {int, int}]
6617 const Type *IntPtrTy = TD->getIntPtrType();
6618 int64_t FirstIdx = 0;
6619 if (int64_t TySize = TD->getABITypeSize(GEPIdxTy)) {
6620 FirstIdx = Offset/TySize;
6623 // Handle silly modulus not returning values values [0..TySize).
6627 assert(Offset >= 0);
6629 assert((uint64_t)Offset < (uint64_t)TySize &&"Out of range offset");
6632 NewIndices.push_back(ConstantInt::get(IntPtrTy, FirstIdx));
6634 // Index into the types. If we fail, set OrigBase to null.
6636 if (const StructType *STy = dyn_cast<StructType>(GEPIdxTy)) {
6637 const StructLayout *SL = TD->getStructLayout(STy);
6638 if (Offset < (int64_t)SL->getSizeInBytes()) {
6639 unsigned Elt = SL->getElementContainingOffset(Offset);
6640 NewIndices.push_back(ConstantInt::get(Type::Int32Ty, Elt));
6642 Offset -= SL->getElementOffset(Elt);
6643 GEPIdxTy = STy->getElementType(Elt);
6645 // Otherwise, we can't index into this, bail out.
6649 } else if (isa<ArrayType>(GEPIdxTy) || isa<VectorType>(GEPIdxTy)) {
6650 const SequentialType *STy = cast<SequentialType>(GEPIdxTy);
6651 if (uint64_t EltSize = TD->getABITypeSize(STy->getElementType())){
6652 NewIndices.push_back(ConstantInt::get(IntPtrTy,Offset/EltSize));
6655 NewIndices.push_back(ConstantInt::get(IntPtrTy, 0));
6657 GEPIdxTy = STy->getElementType();
6659 // Otherwise, we can't index into this, bail out.
6665 // If we were able to index down into an element, create the GEP
6666 // and bitcast the result. This eliminates one bitcast, potentially
6668 Instruction *NGEP = new GetElementPtrInst(OrigBase,
6670 NewIndices.end(), "");
6671 InsertNewInstBefore(NGEP, CI);
6672 NGEP->takeName(GEP);
6674 if (isa<BitCastInst>(CI))
6675 return new BitCastInst(NGEP, CI.getType());
6676 assert(isa<PtrToIntInst>(CI));
6677 return new PtrToIntInst(NGEP, CI.getType());
6684 return commonCastTransforms(CI);
6689 /// Only the TRUNC, ZEXT, SEXT, and BITCAST can both operand and result as
6690 /// integer types. This function implements the common transforms for all those
6692 /// @brief Implement the transforms common to CastInst with integer operands
6693 Instruction *InstCombiner::commonIntCastTransforms(CastInst &CI) {
6694 if (Instruction *Result = commonCastTransforms(CI))
6697 Value *Src = CI.getOperand(0);
6698 const Type *SrcTy = Src->getType();
6699 const Type *DestTy = CI.getType();
6700 uint32_t SrcBitSize = SrcTy->getPrimitiveSizeInBits();
6701 uint32_t DestBitSize = DestTy->getPrimitiveSizeInBits();
6703 // See if we can simplify any instructions used by the LHS whose sole
6704 // purpose is to compute bits we don't care about.
6705 APInt KnownZero(DestBitSize, 0), KnownOne(DestBitSize, 0);
6706 if (SimplifyDemandedBits(&CI, APInt::getAllOnesValue(DestBitSize),
6707 KnownZero, KnownOne))
6710 // If the source isn't an instruction or has more than one use then we
6711 // can't do anything more.
6712 Instruction *SrcI = dyn_cast<Instruction>(Src);
6713 if (!SrcI || !Src->hasOneUse())
6716 // Attempt to propagate the cast into the instruction for int->int casts.
6717 int NumCastsRemoved = 0;
6718 if (!isa<BitCastInst>(CI) &&
6719 CanEvaluateInDifferentType(SrcI, cast<IntegerType>(DestTy),
6720 CI.getOpcode(), NumCastsRemoved)) {
6721 // If this cast is a truncate, evaluting in a different type always
6722 // eliminates the cast, so it is always a win. If this is a zero-extension,
6723 // we need to do an AND to maintain the clear top-part of the computation,
6724 // so we require that the input have eliminated at least one cast. If this
6725 // is a sign extension, we insert two new casts (to do the extension) so we
6726 // require that two casts have been eliminated.
6728 switch (CI.getOpcode()) {
6730 // All the others use floating point so we shouldn't actually
6731 // get here because of the check above.
6732 assert(0 && "Unknown cast type");
6733 case Instruction::Trunc:
6736 case Instruction::ZExt:
6737 DoXForm = NumCastsRemoved >= 1;
6739 case Instruction::SExt:
6740 DoXForm = NumCastsRemoved >= 2;
6745 Value *Res = EvaluateInDifferentType(SrcI, DestTy,
6746 CI.getOpcode() == Instruction::SExt);
6747 assert(Res->getType() == DestTy);
6748 switch (CI.getOpcode()) {
6749 default: assert(0 && "Unknown cast type!");
6750 case Instruction::Trunc:
6751 case Instruction::BitCast:
6752 // Just replace this cast with the result.
6753 return ReplaceInstUsesWith(CI, Res);
6754 case Instruction::ZExt: {
6755 // We need to emit an AND to clear the high bits.
6756 assert(SrcBitSize < DestBitSize && "Not a zext?");
6757 Constant *C = ConstantInt::get(APInt::getLowBitsSet(DestBitSize,
6759 return BinaryOperator::createAnd(Res, C);
6761 case Instruction::SExt:
6762 // We need to emit a cast to truncate, then a cast to sext.
6763 return CastInst::create(Instruction::SExt,
6764 InsertCastBefore(Instruction::Trunc, Res, Src->getType(),
6770 Value *Op0 = SrcI->getNumOperands() > 0 ? SrcI->getOperand(0) : 0;
6771 Value *Op1 = SrcI->getNumOperands() > 1 ? SrcI->getOperand(1) : 0;
6773 switch (SrcI->getOpcode()) {
6774 case Instruction::Add:
6775 case Instruction::Mul:
6776 case Instruction::And:
6777 case Instruction::Or:
6778 case Instruction::Xor:
6779 // If we are discarding information, rewrite.
6780 if (DestBitSize <= SrcBitSize && DestBitSize != 1) {
6781 // Don't insert two casts if they cannot be eliminated. We allow
6782 // two casts to be inserted if the sizes are the same. This could
6783 // only be converting signedness, which is a noop.
6784 if (DestBitSize == SrcBitSize ||
6785 !ValueRequiresCast(CI.getOpcode(), Op1, DestTy,TD) ||
6786 !ValueRequiresCast(CI.getOpcode(), Op0, DestTy, TD)) {
6787 Instruction::CastOps opcode = CI.getOpcode();
6788 Value *Op0c = InsertOperandCastBefore(opcode, Op0, DestTy, SrcI);
6789 Value *Op1c = InsertOperandCastBefore(opcode, Op1, DestTy, SrcI);
6790 return BinaryOperator::create(
6791 cast<BinaryOperator>(SrcI)->getOpcode(), Op0c, Op1c);
6795 // cast (xor bool X, true) to int --> xor (cast bool X to int), 1
6796 if (isa<ZExtInst>(CI) && SrcBitSize == 1 &&
6797 SrcI->getOpcode() == Instruction::Xor &&
6798 Op1 == ConstantInt::getTrue() &&
6799 (!Op0->hasOneUse() || !isa<CmpInst>(Op0))) {
6800 Value *New = InsertOperandCastBefore(Instruction::ZExt, Op0, DestTy, &CI);
6801 return BinaryOperator::createXor(New, ConstantInt::get(CI.getType(), 1));
6804 case Instruction::SDiv:
6805 case Instruction::UDiv:
6806 case Instruction::SRem:
6807 case Instruction::URem:
6808 // If we are just changing the sign, rewrite.
6809 if (DestBitSize == SrcBitSize) {
6810 // Don't insert two casts if they cannot be eliminated. We allow
6811 // two casts to be inserted if the sizes are the same. This could
6812 // only be converting signedness, which is a noop.
6813 if (!ValueRequiresCast(CI.getOpcode(), Op1, DestTy, TD) ||
6814 !ValueRequiresCast(CI.getOpcode(), Op0, DestTy, TD)) {
6815 Value *Op0c = InsertOperandCastBefore(Instruction::BitCast,
6817 Value *Op1c = InsertOperandCastBefore(Instruction::BitCast,
6819 return BinaryOperator::create(
6820 cast<BinaryOperator>(SrcI)->getOpcode(), Op0c, Op1c);
6825 case Instruction::Shl:
6826 // Allow changing the sign of the source operand. Do not allow
6827 // changing the size of the shift, UNLESS the shift amount is a
6828 // constant. We must not change variable sized shifts to a smaller
6829 // size, because it is undefined to shift more bits out than exist
6831 if (DestBitSize == SrcBitSize ||
6832 (DestBitSize < SrcBitSize && isa<Constant>(Op1))) {
6833 Instruction::CastOps opcode = (DestBitSize == SrcBitSize ?
6834 Instruction::BitCast : Instruction::Trunc);
6835 Value *Op0c = InsertOperandCastBefore(opcode, Op0, DestTy, SrcI);
6836 Value *Op1c = InsertOperandCastBefore(opcode, Op1, DestTy, SrcI);
6837 return BinaryOperator::createShl(Op0c, Op1c);
6840 case Instruction::AShr:
6841 // If this is a signed shr, and if all bits shifted in are about to be
6842 // truncated off, turn it into an unsigned shr to allow greater
6844 if (DestBitSize < SrcBitSize &&
6845 isa<ConstantInt>(Op1)) {
6846 uint32_t ShiftAmt = cast<ConstantInt>(Op1)->getLimitedValue(SrcBitSize);
6847 if (SrcBitSize > ShiftAmt && SrcBitSize-ShiftAmt >= DestBitSize) {
6848 // Insert the new logical shift right.
6849 return BinaryOperator::createLShr(Op0, Op1);
6857 Instruction *InstCombiner::visitTrunc(TruncInst &CI) {
6858 if (Instruction *Result = commonIntCastTransforms(CI))
6861 Value *Src = CI.getOperand(0);
6862 const Type *Ty = CI.getType();
6863 uint32_t DestBitWidth = Ty->getPrimitiveSizeInBits();
6864 uint32_t SrcBitWidth = cast<IntegerType>(Src->getType())->getBitWidth();
6866 if (Instruction *SrcI = dyn_cast<Instruction>(Src)) {
6867 switch (SrcI->getOpcode()) {
6869 case Instruction::LShr:
6870 // We can shrink lshr to something smaller if we know the bits shifted in
6871 // are already zeros.
6872 if (ConstantInt *ShAmtV = dyn_cast<ConstantInt>(SrcI->getOperand(1))) {
6873 uint32_t ShAmt = ShAmtV->getLimitedValue(SrcBitWidth);
6875 // Get a mask for the bits shifting in.
6876 APInt Mask(APInt::getLowBitsSet(SrcBitWidth, ShAmt).shl(DestBitWidth));
6877 Value* SrcIOp0 = SrcI->getOperand(0);
6878 if (SrcI->hasOneUse() && MaskedValueIsZero(SrcIOp0, Mask)) {
6879 if (ShAmt >= DestBitWidth) // All zeros.
6880 return ReplaceInstUsesWith(CI, Constant::getNullValue(Ty));
6882 // Okay, we can shrink this. Truncate the input, then return a new
6884 Value *V1 = InsertCastBefore(Instruction::Trunc, SrcIOp0, Ty, CI);
6885 Value *V2 = InsertCastBefore(Instruction::Trunc, SrcI->getOperand(1),
6887 return BinaryOperator::createLShr(V1, V2);
6889 } else { // This is a variable shr.
6891 // Turn 'trunc (lshr X, Y) to bool' into '(X & (1 << Y)) != 0'. This is
6892 // more LLVM instructions, but allows '1 << Y' to be hoisted if
6893 // loop-invariant and CSE'd.
6894 if (CI.getType() == Type::Int1Ty && SrcI->hasOneUse()) {
6895 Value *One = ConstantInt::get(SrcI->getType(), 1);
6897 Value *V = InsertNewInstBefore(
6898 BinaryOperator::createShl(One, SrcI->getOperand(1),
6900 V = InsertNewInstBefore(BinaryOperator::createAnd(V,
6901 SrcI->getOperand(0),
6903 Value *Zero = Constant::getNullValue(V->getType());
6904 return new ICmpInst(ICmpInst::ICMP_NE, V, Zero);
6914 Instruction *InstCombiner::visitZExt(ZExtInst &CI) {
6915 // If one of the common conversion will work ..
6916 if (Instruction *Result = commonIntCastTransforms(CI))
6919 Value *Src = CI.getOperand(0);
6921 // If this is a cast of a cast
6922 if (CastInst *CSrc = dyn_cast<CastInst>(Src)) { // A->B->C cast
6923 // If this is a TRUNC followed by a ZEXT then we are dealing with integral
6924 // types and if the sizes are just right we can convert this into a logical
6925 // 'and' which will be much cheaper than the pair of casts.
6926 if (isa<TruncInst>(CSrc)) {
6927 // Get the sizes of the types involved
6928 Value *A = CSrc->getOperand(0);
6929 uint32_t SrcSize = A->getType()->getPrimitiveSizeInBits();
6930 uint32_t MidSize = CSrc->getType()->getPrimitiveSizeInBits();
6931 uint32_t DstSize = CI.getType()->getPrimitiveSizeInBits();
6932 // If we're actually extending zero bits and the trunc is a no-op
6933 if (MidSize < DstSize && SrcSize == DstSize) {
6934 // Replace both of the casts with an And of the type mask.
6935 APInt AndValue(APInt::getLowBitsSet(SrcSize, MidSize));
6936 Constant *AndConst = ConstantInt::get(AndValue);
6938 BinaryOperator::createAnd(CSrc->getOperand(0), AndConst);
6939 // Unfortunately, if the type changed, we need to cast it back.
6940 if (And->getType() != CI.getType()) {
6941 And->setName(CSrc->getName()+".mask");
6942 InsertNewInstBefore(And, CI);
6943 And = CastInst::createIntegerCast(And, CI.getType(), false/*ZExt*/);
6950 if (ICmpInst *ICI = dyn_cast<ICmpInst>(Src)) {
6951 // If we are just checking for a icmp eq of a single bit and zext'ing it
6952 // to an integer, then shift the bit to the appropriate place and then
6953 // cast to integer to avoid the comparison.
6954 if (ConstantInt *Op1C = dyn_cast<ConstantInt>(ICI->getOperand(1))) {
6955 const APInt &Op1CV = Op1C->getValue();
6957 // zext (x <s 0) to i32 --> x>>u31 true if signbit set.
6958 // zext (x >s -1) to i32 --> (x>>u31)^1 true if signbit clear.
6959 if ((ICI->getPredicate() == ICmpInst::ICMP_SLT && Op1CV == 0) ||
6960 (ICI->getPredicate() == ICmpInst::ICMP_SGT &&Op1CV.isAllOnesValue())){
6961 Value *In = ICI->getOperand(0);
6962 Value *Sh = ConstantInt::get(In->getType(),
6963 In->getType()->getPrimitiveSizeInBits()-1);
6964 In = InsertNewInstBefore(BinaryOperator::createLShr(In, Sh,
6965 In->getName()+".lobit"),
6967 if (In->getType() != CI.getType())
6968 In = CastInst::createIntegerCast(In, CI.getType(),
6969 false/*ZExt*/, "tmp", &CI);
6971 if (ICI->getPredicate() == ICmpInst::ICMP_SGT) {
6972 Constant *One = ConstantInt::get(In->getType(), 1);
6973 In = InsertNewInstBefore(BinaryOperator::createXor(In, One,
6974 In->getName()+".not"),
6978 return ReplaceInstUsesWith(CI, In);
6983 // zext (X == 0) to i32 --> X^1 iff X has only the low bit set.
6984 // zext (X == 0) to i32 --> (X>>1)^1 iff X has only the 2nd bit set.
6985 // zext (X == 1) to i32 --> X iff X has only the low bit set.
6986 // zext (X == 2) to i32 --> X>>1 iff X has only the 2nd bit set.
6987 // zext (X != 0) to i32 --> X iff X has only the low bit set.
6988 // zext (X != 0) to i32 --> X>>1 iff X has only the 2nd bit set.
6989 // zext (X != 1) to i32 --> X^1 iff X has only the low bit set.
6990 // zext (X != 2) to i32 --> (X>>1)^1 iff X has only the 2nd bit set.
6991 if ((Op1CV == 0 || Op1CV.isPowerOf2()) &&
6992 // This only works for EQ and NE
6993 ICI->isEquality()) {
6994 // If Op1C some other power of two, convert:
6995 uint32_t BitWidth = Op1C->getType()->getBitWidth();
6996 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
6997 APInt TypeMask(APInt::getAllOnesValue(BitWidth));
6998 ComputeMaskedBits(ICI->getOperand(0), TypeMask, KnownZero, KnownOne);
7000 APInt KnownZeroMask(~KnownZero);
7001 if (KnownZeroMask.isPowerOf2()) { // Exactly 1 possible 1?
7002 bool isNE = ICI->getPredicate() == ICmpInst::ICMP_NE;
7003 if (Op1CV != 0 && (Op1CV != KnownZeroMask)) {
7004 // (X&4) == 2 --> false
7005 // (X&4) != 2 --> true
7006 Constant *Res = ConstantInt::get(Type::Int1Ty, isNE);
7007 Res = ConstantExpr::getZExt(Res, CI.getType());
7008 return ReplaceInstUsesWith(CI, Res);
7011 uint32_t ShiftAmt = KnownZeroMask.logBase2();
7012 Value *In = ICI->getOperand(0);
7014 // Perform a logical shr by shiftamt.
7015 // Insert the shift to put the result in the low bit.
7016 In = InsertNewInstBefore(
7017 BinaryOperator::createLShr(In,
7018 ConstantInt::get(In->getType(), ShiftAmt),
7019 In->getName()+".lobit"), CI);
7022 if ((Op1CV != 0) == isNE) { // Toggle the low bit.
7023 Constant *One = ConstantInt::get(In->getType(), 1);
7024 In = BinaryOperator::createXor(In, One, "tmp");
7025 InsertNewInstBefore(cast<Instruction>(In), CI);
7028 if (CI.getType() == In->getType())
7029 return ReplaceInstUsesWith(CI, In);
7031 return CastInst::createIntegerCast(In, CI.getType(), false/*ZExt*/);
7039 Instruction *InstCombiner::visitSExt(SExtInst &CI) {
7040 if (Instruction *I = commonIntCastTransforms(CI))
7043 Value *Src = CI.getOperand(0);
7045 // sext (x <s 0) -> ashr x, 31 -> all ones if signed
7046 // sext (x >s -1) -> ashr x, 31 -> all ones if not signed
7047 if (ICmpInst *ICI = dyn_cast<ICmpInst>(Src)) {
7048 // If we are just checking for a icmp eq of a single bit and zext'ing it
7049 // to an integer, then shift the bit to the appropriate place and then
7050 // cast to integer to avoid the comparison.
7051 if (ConstantInt *Op1C = dyn_cast<ConstantInt>(ICI->getOperand(1))) {
7052 const APInt &Op1CV = Op1C->getValue();
7054 // sext (x <s 0) to i32 --> x>>s31 true if signbit set.
7055 // sext (x >s -1) to i32 --> (x>>s31)^-1 true if signbit clear.
7056 if ((ICI->getPredicate() == ICmpInst::ICMP_SLT && Op1CV == 0) ||
7057 (ICI->getPredicate() == ICmpInst::ICMP_SGT &&Op1CV.isAllOnesValue())){
7058 Value *In = ICI->getOperand(0);
7059 Value *Sh = ConstantInt::get(In->getType(),
7060 In->getType()->getPrimitiveSizeInBits()-1);
7061 In = InsertNewInstBefore(BinaryOperator::createAShr(In, Sh,
7062 In->getName()+".lobit"),
7064 if (In->getType() != CI.getType())
7065 In = CastInst::createIntegerCast(In, CI.getType(),
7066 true/*SExt*/, "tmp", &CI);
7068 if (ICI->getPredicate() == ICmpInst::ICMP_SGT)
7069 In = InsertNewInstBefore(BinaryOperator::createNot(In,
7070 In->getName()+".not"), CI);
7072 return ReplaceInstUsesWith(CI, In);
7080 Instruction *InstCombiner::visitFPTrunc(CastInst &CI) {
7081 return commonCastTransforms(CI);
7084 Instruction *InstCombiner::visitFPExt(CastInst &CI) {
7085 return commonCastTransforms(CI);
7088 Instruction *InstCombiner::visitFPToUI(CastInst &CI) {
7089 return commonCastTransforms(CI);
7092 Instruction *InstCombiner::visitFPToSI(CastInst &CI) {
7093 return commonCastTransforms(CI);
7096 Instruction *InstCombiner::visitUIToFP(CastInst &CI) {
7097 return commonCastTransforms(CI);
7100 Instruction *InstCombiner::visitSIToFP(CastInst &CI) {
7101 return commonCastTransforms(CI);
7104 Instruction *InstCombiner::visitPtrToInt(CastInst &CI) {
7105 return commonPointerCastTransforms(CI);
7108 Instruction *InstCombiner::visitIntToPtr(CastInst &CI) {
7109 return commonCastTransforms(CI);
7112 Instruction *InstCombiner::visitBitCast(BitCastInst &CI) {
7113 // If the operands are integer typed then apply the integer transforms,
7114 // otherwise just apply the common ones.
7115 Value *Src = CI.getOperand(0);
7116 const Type *SrcTy = Src->getType();
7117 const Type *DestTy = CI.getType();
7119 if (SrcTy->isInteger() && DestTy->isInteger()) {
7120 if (Instruction *Result = commonIntCastTransforms(CI))
7122 } else if (isa<PointerType>(SrcTy)) {
7123 if (Instruction *I = commonPointerCastTransforms(CI))
7126 if (Instruction *Result = commonCastTransforms(CI))
7131 // Get rid of casts from one type to the same type. These are useless and can
7132 // be replaced by the operand.
7133 if (DestTy == Src->getType())
7134 return ReplaceInstUsesWith(CI, Src);
7136 if (const PointerType *DstPTy = dyn_cast<PointerType>(DestTy)) {
7137 const PointerType *SrcPTy = cast<PointerType>(SrcTy);
7138 const Type *DstElTy = DstPTy->getElementType();
7139 const Type *SrcElTy = SrcPTy->getElementType();
7141 // If we are casting a malloc or alloca to a pointer to a type of the same
7142 // size, rewrite the allocation instruction to allocate the "right" type.
7143 if (AllocationInst *AI = dyn_cast<AllocationInst>(Src))
7144 if (Instruction *V = PromoteCastOfAllocation(CI, *AI))
7147 // If the source and destination are pointers, and this cast is equivalent
7148 // to a getelementptr X, 0, 0, 0... turn it into the appropriate gep.
7149 // This can enhance SROA and other transforms that want type-safe pointers.
7150 Constant *ZeroUInt = Constant::getNullValue(Type::Int32Ty);
7151 unsigned NumZeros = 0;
7152 while (SrcElTy != DstElTy &&
7153 isa<CompositeType>(SrcElTy) && !isa<PointerType>(SrcElTy) &&
7154 SrcElTy->getNumContainedTypes() /* not "{}" */) {
7155 SrcElTy = cast<CompositeType>(SrcElTy)->getTypeAtIndex(ZeroUInt);
7159 // If we found a path from the src to dest, create the getelementptr now.
7160 if (SrcElTy == DstElTy) {
7161 SmallVector<Value*, 8> Idxs(NumZeros+1, ZeroUInt);
7162 return new GetElementPtrInst(Src, Idxs.begin(), Idxs.end(), "",
7163 ((Instruction*) NULL));
7167 if (ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(Src)) {
7168 if (SVI->hasOneUse()) {
7169 // Okay, we have (bitconvert (shuffle ..)). Check to see if this is
7170 // a bitconvert to a vector with the same # elts.
7171 if (isa<VectorType>(DestTy) &&
7172 cast<VectorType>(DestTy)->getNumElements() ==
7173 SVI->getType()->getNumElements()) {
7175 // If either of the operands is a cast from CI.getType(), then
7176 // evaluating the shuffle in the casted destination's type will allow
7177 // us to eliminate at least one cast.
7178 if (((Tmp = dyn_cast<CastInst>(SVI->getOperand(0))) &&
7179 Tmp->getOperand(0)->getType() == DestTy) ||
7180 ((Tmp = dyn_cast<CastInst>(SVI->getOperand(1))) &&
7181 Tmp->getOperand(0)->getType() == DestTy)) {
7182 Value *LHS = InsertOperandCastBefore(Instruction::BitCast,
7183 SVI->getOperand(0), DestTy, &CI);
7184 Value *RHS = InsertOperandCastBefore(Instruction::BitCast,
7185 SVI->getOperand(1), DestTy, &CI);
7186 // Return a new shuffle vector. Use the same element ID's, as we
7187 // know the vector types match #elts.
7188 return new ShuffleVectorInst(LHS, RHS, SVI->getOperand(2));
7196 /// GetSelectFoldableOperands - We want to turn code that looks like this:
7198 /// %D = select %cond, %C, %A
7200 /// %C = select %cond, %B, 0
7203 /// Assuming that the specified instruction is an operand to the select, return
7204 /// a bitmask indicating which operands of this instruction are foldable if they
7205 /// equal the other incoming value of the select.
7207 static unsigned GetSelectFoldableOperands(Instruction *I) {
7208 switch (I->getOpcode()) {
7209 case Instruction::Add:
7210 case Instruction::Mul:
7211 case Instruction::And:
7212 case Instruction::Or:
7213 case Instruction::Xor:
7214 return 3; // Can fold through either operand.
7215 case Instruction::Sub: // Can only fold on the amount subtracted.
7216 case Instruction::Shl: // Can only fold on the shift amount.
7217 case Instruction::LShr:
7218 case Instruction::AShr:
7221 return 0; // Cannot fold
7225 /// GetSelectFoldableConstant - For the same transformation as the previous
7226 /// function, return the identity constant that goes into the select.
7227 static Constant *GetSelectFoldableConstant(Instruction *I) {
7228 switch (I->getOpcode()) {
7229 default: assert(0 && "This cannot happen!"); abort();
7230 case Instruction::Add:
7231 case Instruction::Sub:
7232 case Instruction::Or:
7233 case Instruction::Xor:
7234 case Instruction::Shl:
7235 case Instruction::LShr:
7236 case Instruction::AShr:
7237 return Constant::getNullValue(I->getType());
7238 case Instruction::And:
7239 return Constant::getAllOnesValue(I->getType());
7240 case Instruction::Mul:
7241 return ConstantInt::get(I->getType(), 1);
7245 /// FoldSelectOpOp - Here we have (select c, TI, FI), and we know that TI and FI
7246 /// have the same opcode and only one use each. Try to simplify this.
7247 Instruction *InstCombiner::FoldSelectOpOp(SelectInst &SI, Instruction *TI,
7249 if (TI->getNumOperands() == 1) {
7250 // If this is a non-volatile load or a cast from the same type,
7253 if (TI->getOperand(0)->getType() != FI->getOperand(0)->getType())
7256 return 0; // unknown unary op.
7259 // Fold this by inserting a select from the input values.
7260 SelectInst *NewSI = new SelectInst(SI.getCondition(), TI->getOperand(0),
7261 FI->getOperand(0), SI.getName()+".v");
7262 InsertNewInstBefore(NewSI, SI);
7263 return CastInst::create(Instruction::CastOps(TI->getOpcode()), NewSI,
7267 // Only handle binary operators here.
7268 if (!isa<BinaryOperator>(TI))
7271 // Figure out if the operations have any operands in common.
7272 Value *MatchOp, *OtherOpT, *OtherOpF;
7274 if (TI->getOperand(0) == FI->getOperand(0)) {
7275 MatchOp = TI->getOperand(0);
7276 OtherOpT = TI->getOperand(1);
7277 OtherOpF = FI->getOperand(1);
7278 MatchIsOpZero = true;
7279 } else if (TI->getOperand(1) == FI->getOperand(1)) {
7280 MatchOp = TI->getOperand(1);
7281 OtherOpT = TI->getOperand(0);
7282 OtherOpF = FI->getOperand(0);
7283 MatchIsOpZero = false;
7284 } else if (!TI->isCommutative()) {
7286 } else if (TI->getOperand(0) == FI->getOperand(1)) {
7287 MatchOp = TI->getOperand(0);
7288 OtherOpT = TI->getOperand(1);
7289 OtherOpF = FI->getOperand(0);
7290 MatchIsOpZero = true;
7291 } else if (TI->getOperand(1) == FI->getOperand(0)) {
7292 MatchOp = TI->getOperand(1);
7293 OtherOpT = TI->getOperand(0);
7294 OtherOpF = FI->getOperand(1);
7295 MatchIsOpZero = true;
7300 // If we reach here, they do have operations in common.
7301 SelectInst *NewSI = new SelectInst(SI.getCondition(), OtherOpT,
7302 OtherOpF, SI.getName()+".v");
7303 InsertNewInstBefore(NewSI, SI);
7305 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(TI)) {
7307 return BinaryOperator::create(BO->getOpcode(), MatchOp, NewSI);
7309 return BinaryOperator::create(BO->getOpcode(), NewSI, MatchOp);
7311 assert(0 && "Shouldn't get here");
7315 Instruction *InstCombiner::visitSelectInst(SelectInst &SI) {
7316 Value *CondVal = SI.getCondition();
7317 Value *TrueVal = SI.getTrueValue();
7318 Value *FalseVal = SI.getFalseValue();
7320 // select true, X, Y -> X
7321 // select false, X, Y -> Y
7322 if (ConstantInt *C = dyn_cast<ConstantInt>(CondVal))
7323 return ReplaceInstUsesWith(SI, C->getZExtValue() ? TrueVal : FalseVal);
7325 // select C, X, X -> X
7326 if (TrueVal == FalseVal)
7327 return ReplaceInstUsesWith(SI, TrueVal);
7329 if (isa<UndefValue>(TrueVal)) // select C, undef, X -> X
7330 return ReplaceInstUsesWith(SI, FalseVal);
7331 if (isa<UndefValue>(FalseVal)) // select C, X, undef -> X
7332 return ReplaceInstUsesWith(SI, TrueVal);
7333 if (isa<UndefValue>(CondVal)) { // select undef, X, Y -> X or Y
7334 if (isa<Constant>(TrueVal))
7335 return ReplaceInstUsesWith(SI, TrueVal);
7337 return ReplaceInstUsesWith(SI, FalseVal);
7340 if (SI.getType() == Type::Int1Ty) {
7341 if (ConstantInt *C = dyn_cast<ConstantInt>(TrueVal)) {
7342 if (C->getZExtValue()) {
7343 // Change: A = select B, true, C --> A = or B, C
7344 return BinaryOperator::createOr(CondVal, FalseVal);
7346 // Change: A = select B, false, C --> A = and !B, C
7348 InsertNewInstBefore(BinaryOperator::createNot(CondVal,
7349 "not."+CondVal->getName()), SI);
7350 return BinaryOperator::createAnd(NotCond, FalseVal);
7352 } else if (ConstantInt *C = dyn_cast<ConstantInt>(FalseVal)) {
7353 if (C->getZExtValue() == false) {
7354 // Change: A = select B, C, false --> A = and B, C
7355 return BinaryOperator::createAnd(CondVal, TrueVal);
7357 // Change: A = select B, C, true --> A = or !B, C
7359 InsertNewInstBefore(BinaryOperator::createNot(CondVal,
7360 "not."+CondVal->getName()), SI);
7361 return BinaryOperator::createOr(NotCond, TrueVal);
7365 // select a, b, a -> a&b
7366 // select a, a, b -> a|b
7367 if (CondVal == TrueVal)
7368 return BinaryOperator::createOr(CondVal, FalseVal);
7369 else if (CondVal == FalseVal)
7370 return BinaryOperator::createAnd(CondVal, TrueVal);
7373 // Selecting between two integer constants?
7374 if (ConstantInt *TrueValC = dyn_cast<ConstantInt>(TrueVal))
7375 if (ConstantInt *FalseValC = dyn_cast<ConstantInt>(FalseVal)) {
7376 // select C, 1, 0 -> zext C to int
7377 if (FalseValC->isZero() && TrueValC->getValue() == 1) {
7378 return CastInst::create(Instruction::ZExt, CondVal, SI.getType());
7379 } else if (TrueValC->isZero() && FalseValC->getValue() == 1) {
7380 // select C, 0, 1 -> zext !C to int
7382 InsertNewInstBefore(BinaryOperator::createNot(CondVal,
7383 "not."+CondVal->getName()), SI);
7384 return CastInst::create(Instruction::ZExt, NotCond, SI.getType());
7387 // FIXME: Turn select 0/-1 and -1/0 into sext from condition!
7389 if (ICmpInst *IC = dyn_cast<ICmpInst>(SI.getCondition())) {
7391 // (x <s 0) ? -1 : 0 -> ashr x, 31
7392 if (TrueValC->isAllOnesValue() && FalseValC->isZero())
7393 if (ConstantInt *CmpCst = dyn_cast<ConstantInt>(IC->getOperand(1))) {
7394 if (IC->getPredicate() == ICmpInst::ICMP_SLT && CmpCst->isZero()) {
7395 // The comparison constant and the result are not neccessarily the
7396 // same width. Make an all-ones value by inserting a AShr.
7397 Value *X = IC->getOperand(0);
7398 uint32_t Bits = X->getType()->getPrimitiveSizeInBits();
7399 Constant *ShAmt = ConstantInt::get(X->getType(), Bits-1);
7400 Instruction *SRA = BinaryOperator::create(Instruction::AShr, X,
7402 InsertNewInstBefore(SRA, SI);
7404 // Finally, convert to the type of the select RHS. We figure out
7405 // if this requires a SExt, Trunc or BitCast based on the sizes.
7406 Instruction::CastOps opc = Instruction::BitCast;
7407 uint32_t SRASize = SRA->getType()->getPrimitiveSizeInBits();
7408 uint32_t SISize = SI.getType()->getPrimitiveSizeInBits();
7409 if (SRASize < SISize)
7410 opc = Instruction::SExt;
7411 else if (SRASize > SISize)
7412 opc = Instruction::Trunc;
7413 return CastInst::create(opc, SRA, SI.getType());
7418 // If one of the constants is zero (we know they can't both be) and we
7419 // have an icmp instruction with zero, and we have an 'and' with the
7420 // non-constant value, eliminate this whole mess. This corresponds to
7421 // cases like this: ((X & 27) ? 27 : 0)
7422 if (TrueValC->isZero() || FalseValC->isZero())
7423 if (IC->isEquality() && isa<ConstantInt>(IC->getOperand(1)) &&
7424 cast<Constant>(IC->getOperand(1))->isNullValue())
7425 if (Instruction *ICA = dyn_cast<Instruction>(IC->getOperand(0)))
7426 if (ICA->getOpcode() == Instruction::And &&
7427 isa<ConstantInt>(ICA->getOperand(1)) &&
7428 (ICA->getOperand(1) == TrueValC ||
7429 ICA->getOperand(1) == FalseValC) &&
7430 isOneBitSet(cast<ConstantInt>(ICA->getOperand(1)))) {
7431 // Okay, now we know that everything is set up, we just don't
7432 // know whether we have a icmp_ne or icmp_eq and whether the
7433 // true or false val is the zero.
7434 bool ShouldNotVal = !TrueValC->isZero();
7435 ShouldNotVal ^= IC->getPredicate() == ICmpInst::ICMP_NE;
7438 V = InsertNewInstBefore(BinaryOperator::create(
7439 Instruction::Xor, V, ICA->getOperand(1)), SI);
7440 return ReplaceInstUsesWith(SI, V);
7445 // See if we are selecting two values based on a comparison of the two values.
7446 if (FCmpInst *FCI = dyn_cast<FCmpInst>(CondVal)) {
7447 if (FCI->getOperand(0) == TrueVal && FCI->getOperand(1) == FalseVal) {
7448 // Transform (X == Y) ? X : Y -> Y
7449 if (FCI->getPredicate() == FCmpInst::FCMP_OEQ) {
7450 // This is not safe in general for floating point:
7451 // consider X== -0, Y== +0.
7452 // It becomes safe if either operand is a nonzero constant.
7453 ConstantFP *CFPt, *CFPf;
7454 if (((CFPt = dyn_cast<ConstantFP>(TrueVal)) &&
7455 !CFPt->getValueAPF().isZero()) ||
7456 ((CFPf = dyn_cast<ConstantFP>(FalseVal)) &&
7457 !CFPf->getValueAPF().isZero()))
7458 return ReplaceInstUsesWith(SI, FalseVal);
7460 // Transform (X != Y) ? X : Y -> X
7461 if (FCI->getPredicate() == FCmpInst::FCMP_ONE)
7462 return ReplaceInstUsesWith(SI, TrueVal);
7463 // NOTE: if we wanted to, this is where to detect MIN/MAX/ABS/etc.
7465 } else if (FCI->getOperand(0) == FalseVal && FCI->getOperand(1) == TrueVal){
7466 // Transform (X == Y) ? Y : X -> X
7467 if (FCI->getPredicate() == FCmpInst::FCMP_OEQ) {
7468 // This is not safe in general for floating point:
7469 // consider X== -0, Y== +0.
7470 // It becomes safe if either operand is a nonzero constant.
7471 ConstantFP *CFPt, *CFPf;
7472 if (((CFPt = dyn_cast<ConstantFP>(TrueVal)) &&
7473 !CFPt->getValueAPF().isZero()) ||
7474 ((CFPf = dyn_cast<ConstantFP>(FalseVal)) &&
7475 !CFPf->getValueAPF().isZero()))
7476 return ReplaceInstUsesWith(SI, FalseVal);
7478 // Transform (X != Y) ? Y : X -> Y
7479 if (FCI->getPredicate() == FCmpInst::FCMP_ONE)
7480 return ReplaceInstUsesWith(SI, TrueVal);
7481 // NOTE: if we wanted to, this is where to detect MIN/MAX/ABS/etc.
7485 // See if we are selecting two values based on a comparison of the two values.
7486 if (ICmpInst *ICI = dyn_cast<ICmpInst>(CondVal)) {
7487 if (ICI->getOperand(0) == TrueVal && ICI->getOperand(1) == FalseVal) {
7488 // Transform (X == Y) ? X : Y -> Y
7489 if (ICI->getPredicate() == ICmpInst::ICMP_EQ)
7490 return ReplaceInstUsesWith(SI, FalseVal);
7491 // Transform (X != Y) ? X : Y -> X
7492 if (ICI->getPredicate() == ICmpInst::ICMP_NE)
7493 return ReplaceInstUsesWith(SI, TrueVal);
7494 // NOTE: if we wanted to, this is where to detect MIN/MAX/ABS/etc.
7496 } else if (ICI->getOperand(0) == FalseVal && ICI->getOperand(1) == TrueVal){
7497 // Transform (X == Y) ? Y : X -> X
7498 if (ICI->getPredicate() == ICmpInst::ICMP_EQ)
7499 return ReplaceInstUsesWith(SI, FalseVal);
7500 // Transform (X != Y) ? Y : X -> Y
7501 if (ICI->getPredicate() == ICmpInst::ICMP_NE)
7502 return ReplaceInstUsesWith(SI, TrueVal);
7503 // NOTE: if we wanted to, this is where to detect MIN/MAX/ABS/etc.
7507 if (Instruction *TI = dyn_cast<Instruction>(TrueVal))
7508 if (Instruction *FI = dyn_cast<Instruction>(FalseVal))
7509 if (TI->hasOneUse() && FI->hasOneUse()) {
7510 Instruction *AddOp = 0, *SubOp = 0;
7512 // Turn (select C, (op X, Y), (op X, Z)) -> (op X, (select C, Y, Z))
7513 if (TI->getOpcode() == FI->getOpcode())
7514 if (Instruction *IV = FoldSelectOpOp(SI, TI, FI))
7517 // Turn select C, (X+Y), (X-Y) --> (X+(select C, Y, (-Y))). This is
7518 // even legal for FP.
7519 if (TI->getOpcode() == Instruction::Sub &&
7520 FI->getOpcode() == Instruction::Add) {
7521 AddOp = FI; SubOp = TI;
7522 } else if (FI->getOpcode() == Instruction::Sub &&
7523 TI->getOpcode() == Instruction::Add) {
7524 AddOp = TI; SubOp = FI;
7528 Value *OtherAddOp = 0;
7529 if (SubOp->getOperand(0) == AddOp->getOperand(0)) {
7530 OtherAddOp = AddOp->getOperand(1);
7531 } else if (SubOp->getOperand(0) == AddOp->getOperand(1)) {
7532 OtherAddOp = AddOp->getOperand(0);
7536 // So at this point we know we have (Y -> OtherAddOp):
7537 // select C, (add X, Y), (sub X, Z)
7538 Value *NegVal; // Compute -Z
7539 if (Constant *C = dyn_cast<Constant>(SubOp->getOperand(1))) {
7540 NegVal = ConstantExpr::getNeg(C);
7542 NegVal = InsertNewInstBefore(
7543 BinaryOperator::createNeg(SubOp->getOperand(1), "tmp"), SI);
7546 Value *NewTrueOp = OtherAddOp;
7547 Value *NewFalseOp = NegVal;
7549 std::swap(NewTrueOp, NewFalseOp);
7550 Instruction *NewSel =
7551 new SelectInst(CondVal, NewTrueOp,NewFalseOp,SI.getName()+".p");
7553 NewSel = InsertNewInstBefore(NewSel, SI);
7554 return BinaryOperator::createAdd(SubOp->getOperand(0), NewSel);
7559 // See if we can fold the select into one of our operands.
7560 if (SI.getType()->isInteger()) {
7561 // See the comment above GetSelectFoldableOperands for a description of the
7562 // transformation we are doing here.
7563 if (Instruction *TVI = dyn_cast<Instruction>(TrueVal))
7564 if (TVI->hasOneUse() && TVI->getNumOperands() == 2 &&
7565 !isa<Constant>(FalseVal))
7566 if (unsigned SFO = GetSelectFoldableOperands(TVI)) {
7567 unsigned OpToFold = 0;
7568 if ((SFO & 1) && FalseVal == TVI->getOperand(0)) {
7570 } else if ((SFO & 2) && FalseVal == TVI->getOperand(1)) {
7575 Constant *C = GetSelectFoldableConstant(TVI);
7576 Instruction *NewSel =
7577 new SelectInst(SI.getCondition(), TVI->getOperand(2-OpToFold), C);
7578 InsertNewInstBefore(NewSel, SI);
7579 NewSel->takeName(TVI);
7580 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(TVI))
7581 return BinaryOperator::create(BO->getOpcode(), FalseVal, NewSel);
7583 assert(0 && "Unknown instruction!!");
7588 if (Instruction *FVI = dyn_cast<Instruction>(FalseVal))
7589 if (FVI->hasOneUse() && FVI->getNumOperands() == 2 &&
7590 !isa<Constant>(TrueVal))
7591 if (unsigned SFO = GetSelectFoldableOperands(FVI)) {
7592 unsigned OpToFold = 0;
7593 if ((SFO & 1) && TrueVal == FVI->getOperand(0)) {
7595 } else if ((SFO & 2) && TrueVal == FVI->getOperand(1)) {
7600 Constant *C = GetSelectFoldableConstant(FVI);
7601 Instruction *NewSel =
7602 new SelectInst(SI.getCondition(), C, FVI->getOperand(2-OpToFold));
7603 InsertNewInstBefore(NewSel, SI);
7604 NewSel->takeName(FVI);
7605 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(FVI))
7606 return BinaryOperator::create(BO->getOpcode(), TrueVal, NewSel);
7608 assert(0 && "Unknown instruction!!");
7613 if (BinaryOperator::isNot(CondVal)) {
7614 SI.setOperand(0, BinaryOperator::getNotArgument(CondVal));
7615 SI.setOperand(1, FalseVal);
7616 SI.setOperand(2, TrueVal);
7623 /// GetOrEnforceKnownAlignment - If the specified pointer has an alignment that
7624 /// we can determine, return it, otherwise return 0. If PrefAlign is specified,
7625 /// and it is more than the alignment of the ultimate object, see if we can
7626 /// increase the alignment of the ultimate object, making this check succeed.
7627 static unsigned GetOrEnforceKnownAlignment(Value *V, TargetData *TD,
7628 unsigned PrefAlign = 0) {
7629 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(V)) {
7630 unsigned Align = GV->getAlignment();
7631 if (Align == 0 && TD && GV->getType()->getElementType()->isSized())
7632 Align = TD->getPrefTypeAlignment(GV->getType()->getElementType());
7634 // If there is a large requested alignment and we can, bump up the alignment
7636 if (PrefAlign > Align && GV->hasInitializer()) {
7637 GV->setAlignment(PrefAlign);
7641 } else if (AllocationInst *AI = dyn_cast<AllocationInst>(V)) {
7642 unsigned Align = AI->getAlignment();
7643 if (Align == 0 && TD) {
7644 if (isa<AllocaInst>(AI))
7645 Align = TD->getPrefTypeAlignment(AI->getType()->getElementType());
7646 else if (isa<MallocInst>(AI)) {
7647 // Malloc returns maximally aligned memory.
7648 Align = TD->getABITypeAlignment(AI->getType()->getElementType());
7651 (unsigned)TD->getABITypeAlignment(Type::DoubleTy));
7654 (unsigned)TD->getABITypeAlignment(Type::Int64Ty));
7658 // If there is a requested alignment and if this is an alloca, round up. We
7659 // don't do this for malloc, because some systems can't respect the request.
7660 if (PrefAlign > Align && isa<AllocaInst>(AI)) {
7661 AI->setAlignment(PrefAlign);
7665 } else if (isa<BitCastInst>(V) ||
7666 (isa<ConstantExpr>(V) &&
7667 cast<ConstantExpr>(V)->getOpcode() == Instruction::BitCast)) {
7668 return GetOrEnforceKnownAlignment(cast<User>(V)->getOperand(0),
7670 } else if (User *GEPI = dyn_castGetElementPtr(V)) {
7671 // If all indexes are zero, it is just the alignment of the base pointer.
7672 bool AllZeroOperands = true;
7673 for (unsigned i = 1, e = GEPI->getNumOperands(); i != e; ++i)
7674 if (!isa<Constant>(GEPI->getOperand(i)) ||
7675 !cast<Constant>(GEPI->getOperand(i))->isNullValue()) {
7676 AllZeroOperands = false;
7680 if (AllZeroOperands) {
7681 // Treat this like a bitcast.
7682 return GetOrEnforceKnownAlignment(GEPI->getOperand(0), TD, PrefAlign);
7685 unsigned BaseAlignment = GetOrEnforceKnownAlignment(GEPI->getOperand(0),TD);
7686 if (BaseAlignment == 0) return 0;
7688 // Otherwise, if the base alignment is >= the alignment we expect for the
7689 // base pointer type, then we know that the resultant pointer is aligned at
7690 // least as much as its type requires.
7693 const Type *BasePtrTy = GEPI->getOperand(0)->getType();
7694 const PointerType *PtrTy = cast<PointerType>(BasePtrTy);
7695 unsigned Align = TD->getABITypeAlignment(PtrTy->getElementType());
7696 if (Align <= BaseAlignment) {
7697 const Type *GEPTy = GEPI->getType();
7698 const PointerType *GEPPtrTy = cast<PointerType>(GEPTy);
7699 Align = std::min(Align, (unsigned)
7700 TD->getABITypeAlignment(GEPPtrTy->getElementType()));
7709 /// visitCallInst - CallInst simplification. This mostly only handles folding
7710 /// of intrinsic instructions. For normal calls, it allows visitCallSite to do
7711 /// the heavy lifting.
7713 Instruction *InstCombiner::visitCallInst(CallInst &CI) {
7714 IntrinsicInst *II = dyn_cast<IntrinsicInst>(&CI);
7715 if (!II) return visitCallSite(&CI);
7717 // Intrinsics cannot occur in an invoke, so handle them here instead of in
7719 if (MemIntrinsic *MI = dyn_cast<MemIntrinsic>(II)) {
7720 bool Changed = false;
7722 // memmove/cpy/set of zero bytes is a noop.
7723 if (Constant *NumBytes = dyn_cast<Constant>(MI->getLength())) {
7724 if (NumBytes->isNullValue()) return EraseInstFromFunction(CI);
7726 if (ConstantInt *CI = dyn_cast<ConstantInt>(NumBytes))
7727 if (CI->getZExtValue() == 1) {
7728 // Replace the instruction with just byte operations. We would
7729 // transform other cases to loads/stores, but we don't know if
7730 // alignment is sufficient.
7734 // If we have a memmove and the source operation is a constant global,
7735 // then the source and dest pointers can't alias, so we can change this
7736 // into a call to memcpy.
7737 if (MemMoveInst *MMI = dyn_cast<MemMoveInst>(II)) {
7738 if (GlobalVariable *GVSrc = dyn_cast<GlobalVariable>(MMI->getSource()))
7739 if (GVSrc->isConstant()) {
7740 Module *M = CI.getParent()->getParent()->getParent();
7742 if (CI.getCalledFunction()->getFunctionType()->getParamType(2) ==
7744 Name = "llvm.memcpy.i32";
7746 Name = "llvm.memcpy.i64";
7747 Constant *MemCpy = M->getOrInsertFunction(Name,
7748 CI.getCalledFunction()->getFunctionType());
7749 CI.setOperand(0, MemCpy);
7754 // If we can determine a pointer alignment that is bigger than currently
7755 // set, update the alignment.
7756 if (isa<MemCpyInst>(MI) || isa<MemMoveInst>(MI)) {
7757 unsigned Alignment1 = GetOrEnforceKnownAlignment(MI->getOperand(1), TD);
7758 unsigned Alignment2 = GetOrEnforceKnownAlignment(MI->getOperand(2), TD);
7759 unsigned Align = std::min(Alignment1, Alignment2);
7760 if (MI->getAlignment()->getZExtValue() < Align) {
7761 MI->setAlignment(ConstantInt::get(Type::Int32Ty, Align));
7765 // If MemCpyInst length is 1/2/4/8 bytes then replace memcpy with
7767 ConstantInt *MemOpLength = dyn_cast<ConstantInt>(CI.getOperand(3));
7769 unsigned Size = MemOpLength->getZExtValue();
7770 unsigned Align = cast<ConstantInt>(CI.getOperand(4))->getZExtValue();
7771 PointerType *NewPtrTy = NULL;
7772 // Destination pointer type is always i8 *
7773 // If Size is 8 then use Int64Ty
7774 // If Size is 4 then use Int32Ty
7775 // If Size is 2 then use Int16Ty
7776 // If Size is 1 then use Int8Ty
7777 if (Size && Size <=8 && !(Size&(Size-1)))
7778 NewPtrTy = PointerType::getUnqual(IntegerType::get(Size<<3));
7781 Value *Src = InsertCastBefore(Instruction::BitCast, CI.getOperand(2),
7783 Value *Dest = InsertCastBefore(Instruction::BitCast, CI.getOperand(1),
7785 Value *L = new LoadInst(Src, "tmp", false, Align, &CI);
7786 Value *NS = new StoreInst(L, Dest, false, Align, &CI);
7787 CI.replaceAllUsesWith(NS);
7789 return EraseInstFromFunction(CI);
7792 } else if (isa<MemSetInst>(MI)) {
7793 unsigned Alignment = GetOrEnforceKnownAlignment(MI->getDest(), TD);
7794 if (MI->getAlignment()->getZExtValue() < Alignment) {
7795 MI->setAlignment(ConstantInt::get(Type::Int32Ty, Alignment));
7800 if (Changed) return II;
7802 switch (II->getIntrinsicID()) {
7804 case Intrinsic::ppc_altivec_lvx:
7805 case Intrinsic::ppc_altivec_lvxl:
7806 case Intrinsic::x86_sse_loadu_ps:
7807 case Intrinsic::x86_sse2_loadu_pd:
7808 case Intrinsic::x86_sse2_loadu_dq:
7809 // Turn PPC lvx -> load if the pointer is known aligned.
7810 // Turn X86 loadups -> load if the pointer is known aligned.
7811 if (GetOrEnforceKnownAlignment(II->getOperand(1), TD, 16) >= 16) {
7813 InsertCastBefore(Instruction::BitCast, II->getOperand(1),
7814 PointerType::getUnqual(II->getType()), CI);
7815 return new LoadInst(Ptr);
7818 case Intrinsic::ppc_altivec_stvx:
7819 case Intrinsic::ppc_altivec_stvxl:
7820 // Turn stvx -> store if the pointer is known aligned.
7821 if (GetOrEnforceKnownAlignment(II->getOperand(2), TD, 16) >= 16) {
7822 const Type *OpPtrTy =
7823 PointerType::getUnqual(II->getOperand(1)->getType());
7824 Value *Ptr = InsertCastBefore(Instruction::BitCast, II->getOperand(2),
7826 return new StoreInst(II->getOperand(1), Ptr);
7829 case Intrinsic::x86_sse_storeu_ps:
7830 case Intrinsic::x86_sse2_storeu_pd:
7831 case Intrinsic::x86_sse2_storeu_dq:
7832 case Intrinsic::x86_sse2_storel_dq:
7833 // Turn X86 storeu -> store if the pointer is known aligned.
7834 if (GetOrEnforceKnownAlignment(II->getOperand(1), TD, 16) >= 16) {
7835 const Type *OpPtrTy =
7836 PointerType::getUnqual(II->getOperand(2)->getType());
7837 Value *Ptr = InsertCastBefore(Instruction::BitCast, II->getOperand(1),
7839 return new StoreInst(II->getOperand(2), Ptr);
7843 case Intrinsic::x86_sse_cvttss2si: {
7844 // These intrinsics only demands the 0th element of its input vector. If
7845 // we can simplify the input based on that, do so now.
7847 if (Value *V = SimplifyDemandedVectorElts(II->getOperand(1), 1,
7849 II->setOperand(1, V);
7855 case Intrinsic::ppc_altivec_vperm:
7856 // Turn vperm(V1,V2,mask) -> shuffle(V1,V2,mask) if mask is a constant.
7857 if (ConstantVector *Mask = dyn_cast<ConstantVector>(II->getOperand(3))) {
7858 assert(Mask->getNumOperands() == 16 && "Bad type for intrinsic!");
7860 // Check that all of the elements are integer constants or undefs.
7861 bool AllEltsOk = true;
7862 for (unsigned i = 0; i != 16; ++i) {
7863 if (!isa<ConstantInt>(Mask->getOperand(i)) &&
7864 !isa<UndefValue>(Mask->getOperand(i))) {
7871 // Cast the input vectors to byte vectors.
7872 Value *Op0 = InsertCastBefore(Instruction::BitCast,
7873 II->getOperand(1), Mask->getType(), CI);
7874 Value *Op1 = InsertCastBefore(Instruction::BitCast,
7875 II->getOperand(2), Mask->getType(), CI);
7876 Value *Result = UndefValue::get(Op0->getType());
7878 // Only extract each element once.
7879 Value *ExtractedElts[32];
7880 memset(ExtractedElts, 0, sizeof(ExtractedElts));
7882 for (unsigned i = 0; i != 16; ++i) {
7883 if (isa<UndefValue>(Mask->getOperand(i)))
7885 unsigned Idx=cast<ConstantInt>(Mask->getOperand(i))->getZExtValue();
7886 Idx &= 31; // Match the hardware behavior.
7888 if (ExtractedElts[Idx] == 0) {
7890 new ExtractElementInst(Idx < 16 ? Op0 : Op1, Idx&15, "tmp");
7891 InsertNewInstBefore(Elt, CI);
7892 ExtractedElts[Idx] = Elt;
7895 // Insert this value into the result vector.
7896 Result = new InsertElementInst(Result, ExtractedElts[Idx], i,"tmp");
7897 InsertNewInstBefore(cast<Instruction>(Result), CI);
7899 return CastInst::create(Instruction::BitCast, Result, CI.getType());
7904 case Intrinsic::stackrestore: {
7905 // If the save is right next to the restore, remove the restore. This can
7906 // happen when variable allocas are DCE'd.
7907 if (IntrinsicInst *SS = dyn_cast<IntrinsicInst>(II->getOperand(1))) {
7908 if (SS->getIntrinsicID() == Intrinsic::stacksave) {
7909 BasicBlock::iterator BI = SS;
7911 return EraseInstFromFunction(CI);
7915 // If the stack restore is in a return/unwind block and if there are no
7916 // allocas or calls between the restore and the return, nuke the restore.
7917 TerminatorInst *TI = II->getParent()->getTerminator();
7918 if (isa<ReturnInst>(TI) || isa<UnwindInst>(TI)) {
7919 BasicBlock::iterator BI = II;
7920 bool CannotRemove = false;
7921 for (++BI; &*BI != TI; ++BI) {
7922 if (isa<AllocaInst>(BI) ||
7923 (isa<CallInst>(BI) && !isa<IntrinsicInst>(BI))) {
7924 CannotRemove = true;
7929 return EraseInstFromFunction(CI);
7936 return visitCallSite(II);
7939 // InvokeInst simplification
7941 Instruction *InstCombiner::visitInvokeInst(InvokeInst &II) {
7942 return visitCallSite(&II);
7945 // visitCallSite - Improvements for call and invoke instructions.
7947 Instruction *InstCombiner::visitCallSite(CallSite CS) {
7948 bool Changed = false;
7950 // If the callee is a constexpr cast of a function, attempt to move the cast
7951 // to the arguments of the call/invoke.
7952 if (transformConstExprCastCall(CS)) return 0;
7954 Value *Callee = CS.getCalledValue();
7956 if (Function *CalleeF = dyn_cast<Function>(Callee))
7957 if (CalleeF->getCallingConv() != CS.getCallingConv()) {
7958 Instruction *OldCall = CS.getInstruction();
7959 // If the call and callee calling conventions don't match, this call must
7960 // be unreachable, as the call is undefined.
7961 new StoreInst(ConstantInt::getTrue(),
7962 UndefValue::get(PointerType::getUnqual(Type::Int1Ty)),
7964 if (!OldCall->use_empty())
7965 OldCall->replaceAllUsesWith(UndefValue::get(OldCall->getType()));
7966 if (isa<CallInst>(OldCall)) // Not worth removing an invoke here.
7967 return EraseInstFromFunction(*OldCall);
7971 if (isa<ConstantPointerNull>(Callee) || isa<UndefValue>(Callee)) {
7972 // This instruction is not reachable, just remove it. We insert a store to
7973 // undef so that we know that this code is not reachable, despite the fact
7974 // that we can't modify the CFG here.
7975 new StoreInst(ConstantInt::getTrue(),
7976 UndefValue::get(PointerType::getUnqual(Type::Int1Ty)),
7977 CS.getInstruction());
7979 if (!CS.getInstruction()->use_empty())
7980 CS.getInstruction()->
7981 replaceAllUsesWith(UndefValue::get(CS.getInstruction()->getType()));
7983 if (InvokeInst *II = dyn_cast<InvokeInst>(CS.getInstruction())) {
7984 // Don't break the CFG, insert a dummy cond branch.
7985 new BranchInst(II->getNormalDest(), II->getUnwindDest(),
7986 ConstantInt::getTrue(), II);
7988 return EraseInstFromFunction(*CS.getInstruction());
7991 if (BitCastInst *BC = dyn_cast<BitCastInst>(Callee))
7992 if (IntrinsicInst *In = dyn_cast<IntrinsicInst>(BC->getOperand(0)))
7993 if (In->getIntrinsicID() == Intrinsic::init_trampoline)
7994 return transformCallThroughTrampoline(CS);
7996 const PointerType *PTy = cast<PointerType>(Callee->getType());
7997 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
7998 if (FTy->isVarArg()) {
7999 // See if we can optimize any arguments passed through the varargs area of
8001 for (CallSite::arg_iterator I = CS.arg_begin()+FTy->getNumParams(),
8002 E = CS.arg_end(); I != E; ++I)
8003 if (CastInst *CI = dyn_cast<CastInst>(*I)) {
8004 // If this cast does not effect the value passed through the varargs
8005 // area, we can eliminate the use of the cast.
8006 Value *Op = CI->getOperand(0);
8007 if (CI->isLosslessCast()) {
8014 if (isa<InlineAsm>(Callee) && !CS.paramHasAttr(0, ParamAttr::NoUnwind)) {
8015 // Inline asm calls cannot throw - mark them 'nounwind'.
8016 const ParamAttrsList *PAL = CS.getParamAttrs();
8017 uint16_t RAttributes = PAL ? PAL->getParamAttrs(0) : 0;
8018 RAttributes |= ParamAttr::NoUnwind;
8020 ParamAttrsVector modVec;
8021 modVec.push_back(ParamAttrsWithIndex::get(0, RAttributes));
8022 PAL = ParamAttrsList::getModified(PAL, modVec);
8023 CS.setParamAttrs(PAL);
8027 return Changed ? CS.getInstruction() : 0;
8030 // transformConstExprCastCall - If the callee is a constexpr cast of a function,
8031 // attempt to move the cast to the arguments of the call/invoke.
8033 bool InstCombiner::transformConstExprCastCall(CallSite CS) {
8034 if (!isa<ConstantExpr>(CS.getCalledValue())) return false;
8035 ConstantExpr *CE = cast<ConstantExpr>(CS.getCalledValue());
8036 if (CE->getOpcode() != Instruction::BitCast ||
8037 !isa<Function>(CE->getOperand(0)))
8039 Function *Callee = cast<Function>(CE->getOperand(0));
8040 Instruction *Caller = CS.getInstruction();
8042 // Okay, this is a cast from a function to a different type. Unless doing so
8043 // would cause a type conversion of one of our arguments, change this call to
8044 // be a direct call with arguments casted to the appropriate types.
8046 const FunctionType *FT = Callee->getFunctionType();
8047 const Type *OldRetTy = Caller->getType();
8049 const ParamAttrsList* CallerPAL = 0;
8050 if (CallInst *CallerCI = dyn_cast<CallInst>(Caller))
8051 CallerPAL = CallerCI->getParamAttrs();
8052 else if (InvokeInst *CallerII = dyn_cast<InvokeInst>(Caller))
8053 CallerPAL = CallerII->getParamAttrs();
8055 // If the parameter attributes are not compatible, don't do the xform. We
8056 // don't want to lose an sret attribute or something.
8057 if (!ParamAttrsList::areCompatible(CallerPAL, Callee->getParamAttrs()))
8060 // Check to see if we are changing the return type...
8061 if (OldRetTy != FT->getReturnType()) {
8062 if (Callee->isDeclaration() && !Caller->use_empty() &&
8063 // Conversion is ok if changing from pointer to int of same size.
8064 !(isa<PointerType>(FT->getReturnType()) &&
8065 TD->getIntPtrType() == OldRetTy))
8066 return false; // Cannot transform this return value.
8068 // If the callsite is an invoke instruction, and the return value is used by
8069 // a PHI node in a successor, we cannot change the return type of the call
8070 // because there is no place to put the cast instruction (without breaking
8071 // the critical edge). Bail out in this case.
8072 if (!Caller->use_empty())
8073 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller))
8074 for (Value::use_iterator UI = II->use_begin(), E = II->use_end();
8076 if (PHINode *PN = dyn_cast<PHINode>(*UI))
8077 if (PN->getParent() == II->getNormalDest() ||
8078 PN->getParent() == II->getUnwindDest())
8082 unsigned NumActualArgs = unsigned(CS.arg_end()-CS.arg_begin());
8083 unsigned NumCommonArgs = std::min(FT->getNumParams(), NumActualArgs);
8085 CallSite::arg_iterator AI = CS.arg_begin();
8086 for (unsigned i = 0, e = NumCommonArgs; i != e; ++i, ++AI) {
8087 const Type *ParamTy = FT->getParamType(i);
8088 const Type *ActTy = (*AI)->getType();
8089 ConstantInt *c = dyn_cast<ConstantInt>(*AI);
8090 //Some conversions are safe even if we do not have a body.
8091 //Either we can cast directly, or we can upconvert the argument
8092 bool isConvertible = ActTy == ParamTy ||
8093 (isa<PointerType>(ParamTy) && isa<PointerType>(ActTy)) ||
8094 (ParamTy->isInteger() && ActTy->isInteger() &&
8095 ParamTy->getPrimitiveSizeInBits() >= ActTy->getPrimitiveSizeInBits()) ||
8096 (c && ParamTy->getPrimitiveSizeInBits() >= ActTy->getPrimitiveSizeInBits()
8097 && c->getValue().isStrictlyPositive());
8098 if (Callee->isDeclaration() && !isConvertible) return false;
8100 // Most other conversions can be done if we have a body, even if these
8101 // lose information, e.g. int->short.
8102 // Some conversions cannot be done at all, e.g. float to pointer.
8103 // Logic here parallels CastInst::getCastOpcode (the design there
8104 // requires legality checks like this be done before calling it).
8105 if (ParamTy->isInteger()) {
8106 if (const VectorType *VActTy = dyn_cast<VectorType>(ActTy)) {
8107 if (VActTy->getBitWidth() != ParamTy->getPrimitiveSizeInBits())
8110 if (!ActTy->isInteger() && !ActTy->isFloatingPoint() &&
8111 !isa<PointerType>(ActTy))
8113 } else if (ParamTy->isFloatingPoint()) {
8114 if (const VectorType *VActTy = dyn_cast<VectorType>(ActTy)) {
8115 if (VActTy->getBitWidth() != ParamTy->getPrimitiveSizeInBits())
8118 if (!ActTy->isInteger() && !ActTy->isFloatingPoint())
8120 } else if (const VectorType *VParamTy = dyn_cast<VectorType>(ParamTy)) {
8121 if (const VectorType *VActTy = dyn_cast<VectorType>(ActTy)) {
8122 if (VActTy->getBitWidth() != VParamTy->getBitWidth())
8125 if (VParamTy->getBitWidth() != ActTy->getPrimitiveSizeInBits())
8127 } else if (isa<PointerType>(ParamTy)) {
8128 if (!ActTy->isInteger() && !isa<PointerType>(ActTy))
8135 if (FT->getNumParams() < NumActualArgs && !FT->isVarArg() &&
8136 Callee->isDeclaration())
8137 return false; // Do not delete arguments unless we have a function body...
8139 // Okay, we decided that this is a safe thing to do: go ahead and start
8140 // inserting cast instructions as necessary...
8141 std::vector<Value*> Args;
8142 Args.reserve(NumActualArgs);
8144 AI = CS.arg_begin();
8145 for (unsigned i = 0; i != NumCommonArgs; ++i, ++AI) {
8146 const Type *ParamTy = FT->getParamType(i);
8147 if ((*AI)->getType() == ParamTy) {
8148 Args.push_back(*AI);
8150 Instruction::CastOps opcode = CastInst::getCastOpcode(*AI,
8151 false, ParamTy, false);
8152 CastInst *NewCast = CastInst::create(opcode, *AI, ParamTy, "tmp");
8153 Args.push_back(InsertNewInstBefore(NewCast, *Caller));
8157 // If the function takes more arguments than the call was taking, add them
8159 for (unsigned i = NumCommonArgs; i != FT->getNumParams(); ++i)
8160 Args.push_back(Constant::getNullValue(FT->getParamType(i)));
8162 // If we are removing arguments to the function, emit an obnoxious warning...
8163 if (FT->getNumParams() < NumActualArgs)
8164 if (!FT->isVarArg()) {
8165 cerr << "WARNING: While resolving call to function '"
8166 << Callee->getName() << "' arguments were dropped!\n";
8168 // Add all of the arguments in their promoted form to the arg list...
8169 for (unsigned i = FT->getNumParams(); i != NumActualArgs; ++i, ++AI) {
8170 const Type *PTy = getPromotedType((*AI)->getType());
8171 if (PTy != (*AI)->getType()) {
8172 // Must promote to pass through va_arg area!
8173 Instruction::CastOps opcode = CastInst::getCastOpcode(*AI, false,
8175 Instruction *Cast = CastInst::create(opcode, *AI, PTy, "tmp");
8176 InsertNewInstBefore(Cast, *Caller);
8177 Args.push_back(Cast);
8179 Args.push_back(*AI);
8184 if (FT->getReturnType() == Type::VoidTy)
8185 Caller->setName(""); // Void type should not have a name.
8188 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
8189 NC = new InvokeInst(Callee, II->getNormalDest(), II->getUnwindDest(),
8190 Args.begin(), Args.end(), Caller->getName(), Caller);
8191 cast<InvokeInst>(NC)->setCallingConv(II->getCallingConv());
8192 cast<InvokeInst>(NC)->setParamAttrs(CallerPAL);
8194 NC = new CallInst(Callee, Args.begin(), Args.end(),
8195 Caller->getName(), Caller);
8196 CallInst *CI = cast<CallInst>(Caller);
8197 if (CI->isTailCall())
8198 cast<CallInst>(NC)->setTailCall();
8199 cast<CallInst>(NC)->setCallingConv(CI->getCallingConv());
8200 cast<CallInst>(NC)->setParamAttrs(CallerPAL);
8203 // Insert a cast of the return type as necessary.
8205 if (Caller->getType() != NV->getType() && !Caller->use_empty()) {
8206 if (NV->getType() != Type::VoidTy) {
8207 const Type *CallerTy = Caller->getType();
8208 Instruction::CastOps opcode = CastInst::getCastOpcode(NC, false,
8210 NV = NC = CastInst::create(opcode, NC, CallerTy, "tmp");
8212 // If this is an invoke instruction, we should insert it after the first
8213 // non-phi, instruction in the normal successor block.
8214 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
8215 BasicBlock::iterator I = II->getNormalDest()->begin();
8216 while (isa<PHINode>(I)) ++I;
8217 InsertNewInstBefore(NC, *I);
8219 // Otherwise, it's a call, just insert cast right after the call instr
8220 InsertNewInstBefore(NC, *Caller);
8222 AddUsersToWorkList(*Caller);
8224 NV = UndefValue::get(Caller->getType());
8228 if (Caller->getType() != Type::VoidTy && !Caller->use_empty())
8229 Caller->replaceAllUsesWith(NV);
8230 Caller->eraseFromParent();
8231 RemoveFromWorkList(Caller);
8235 // transformCallThroughTrampoline - Turn a call to a function created by the
8236 // init_trampoline intrinsic into a direct call to the underlying function.
8238 Instruction *InstCombiner::transformCallThroughTrampoline(CallSite CS) {
8239 Value *Callee = CS.getCalledValue();
8240 const PointerType *PTy = cast<PointerType>(Callee->getType());
8241 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
8243 IntrinsicInst *Tramp =
8244 cast<IntrinsicInst>(cast<BitCastInst>(Callee)->getOperand(0));
8247 cast<Function>(IntrinsicInst::StripPointerCasts(Tramp->getOperand(2)));
8248 const PointerType *NestFPTy = cast<PointerType>(NestF->getType());
8249 const FunctionType *NestFTy = cast<FunctionType>(NestFPTy->getElementType());
8251 if (const ParamAttrsList *NestAttrs = NestF->getParamAttrs()) {
8252 unsigned NestIdx = 1;
8253 const Type *NestTy = 0;
8254 uint16_t NestAttr = 0;
8256 // Look for a parameter marked with the 'nest' attribute.
8257 for (FunctionType::param_iterator I = NestFTy->param_begin(),
8258 E = NestFTy->param_end(); I != E; ++NestIdx, ++I)
8259 if (NestAttrs->paramHasAttr(NestIdx, ParamAttr::Nest)) {
8260 // Record the parameter type and any other attributes.
8262 NestAttr = NestAttrs->getParamAttrs(NestIdx);
8267 Instruction *Caller = CS.getInstruction();
8268 std::vector<Value*> NewArgs;
8269 NewArgs.reserve(unsigned(CS.arg_end()-CS.arg_begin())+1);
8271 // Insert the nest argument into the call argument list, which may
8272 // mean appending it.
8275 CallSite::arg_iterator I = CS.arg_begin(), E = CS.arg_end();
8277 if (Idx == NestIdx) {
8278 // Add the chain argument.
8279 Value *NestVal = Tramp->getOperand(3);
8280 if (NestVal->getType() != NestTy)
8281 NestVal = new BitCastInst(NestVal, NestTy, "nest", Caller);
8282 NewArgs.push_back(NestVal);
8288 // Add the original argument.
8289 NewArgs.push_back(*I);
8295 // The trampoline may have been bitcast to a bogus type (FTy).
8296 // Handle this by synthesizing a new function type, equal to FTy
8297 // with the chain parameter inserted. Likewise for attributes.
8299 const ParamAttrsList *Attrs = CS.getParamAttrs();
8300 std::vector<const Type*> NewTypes;
8301 ParamAttrsVector NewAttrs;
8302 NewTypes.reserve(FTy->getNumParams()+1);
8304 // Add any function result attributes.
8305 uint16_t Attr = Attrs ? Attrs->getParamAttrs(0) : 0;
8307 NewAttrs.push_back (ParamAttrsWithIndex::get(0, Attr));
8309 // Insert the chain's type into the list of parameter types, which may
8310 // mean appending it. Likewise for the chain's attributes.
8313 FunctionType::param_iterator I = FTy->param_begin(),
8314 E = FTy->param_end();
8317 if (Idx == NestIdx) {
8318 // Add the chain's type and attributes.
8319 NewTypes.push_back(NestTy);
8320 NewAttrs.push_back(ParamAttrsWithIndex::get(NestIdx, NestAttr));
8326 // Add the original type and attributes.
8327 NewTypes.push_back(*I);
8328 Attr = Attrs ? Attrs->getParamAttrs(Idx) : 0;
8331 (ParamAttrsWithIndex::get(Idx + (Idx >= NestIdx), Attr));
8337 // Replace the trampoline call with a direct call. Let the generic
8338 // code sort out any function type mismatches.
8339 FunctionType *NewFTy =
8340 FunctionType::get(FTy->getReturnType(), NewTypes, FTy->isVarArg());
8341 Constant *NewCallee = NestF->getType() == PointerType::getUnqual(NewFTy) ?
8342 NestF : ConstantExpr::getBitCast(NestF, PointerType::getUnqual(NewFTy));
8343 const ParamAttrsList *NewPAL = ParamAttrsList::get(NewAttrs);
8345 Instruction *NewCaller;
8346 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
8347 NewCaller = new InvokeInst(NewCallee,
8348 II->getNormalDest(), II->getUnwindDest(),
8349 NewArgs.begin(), NewArgs.end(),
8350 Caller->getName(), Caller);
8351 cast<InvokeInst>(NewCaller)->setCallingConv(II->getCallingConv());
8352 cast<InvokeInst>(NewCaller)->setParamAttrs(NewPAL);
8354 NewCaller = new CallInst(NewCallee, NewArgs.begin(), NewArgs.end(),
8355 Caller->getName(), Caller);
8356 if (cast<CallInst>(Caller)->isTailCall())
8357 cast<CallInst>(NewCaller)->setTailCall();
8358 cast<CallInst>(NewCaller)->
8359 setCallingConv(cast<CallInst>(Caller)->getCallingConv());
8360 cast<CallInst>(NewCaller)->setParamAttrs(NewPAL);
8362 if (Caller->getType() != Type::VoidTy && !Caller->use_empty())
8363 Caller->replaceAllUsesWith(NewCaller);
8364 Caller->eraseFromParent();
8365 RemoveFromWorkList(Caller);
8370 // Replace the trampoline call with a direct call. Since there is no 'nest'
8371 // parameter, there is no need to adjust the argument list. Let the generic
8372 // code sort out any function type mismatches.
8373 Constant *NewCallee =
8374 NestF->getType() == PTy ? NestF : ConstantExpr::getBitCast(NestF, PTy);
8375 CS.setCalledFunction(NewCallee);
8376 return CS.getInstruction();
8379 /// FoldPHIArgBinOpIntoPHI - If we have something like phi [add (a,b), add(c,d)]
8380 /// and if a/b/c/d and the add's all have a single use, turn this into two phi's
8381 /// and a single binop.
8382 Instruction *InstCombiner::FoldPHIArgBinOpIntoPHI(PHINode &PN) {
8383 Instruction *FirstInst = cast<Instruction>(PN.getIncomingValue(0));
8384 assert(isa<BinaryOperator>(FirstInst) || isa<GetElementPtrInst>(FirstInst) ||
8385 isa<CmpInst>(FirstInst));
8386 unsigned Opc = FirstInst->getOpcode();
8387 Value *LHSVal = FirstInst->getOperand(0);
8388 Value *RHSVal = FirstInst->getOperand(1);
8390 const Type *LHSType = LHSVal->getType();
8391 const Type *RHSType = RHSVal->getType();
8393 // Scan to see if all operands are the same opcode, all have one use, and all
8394 // kill their operands (i.e. the operands have one use).
8395 for (unsigned i = 0; i != PN.getNumIncomingValues(); ++i) {
8396 Instruction *I = dyn_cast<Instruction>(PN.getIncomingValue(i));
8397 if (!I || I->getOpcode() != Opc || !I->hasOneUse() ||
8398 // Verify type of the LHS matches so we don't fold cmp's of different
8399 // types or GEP's with different index types.
8400 I->getOperand(0)->getType() != LHSType ||
8401 I->getOperand(1)->getType() != RHSType)
8404 // If they are CmpInst instructions, check their predicates
8405 if (Opc == Instruction::ICmp || Opc == Instruction::FCmp)
8406 if (cast<CmpInst>(I)->getPredicate() !=
8407 cast<CmpInst>(FirstInst)->getPredicate())
8410 // Keep track of which operand needs a phi node.
8411 if (I->getOperand(0) != LHSVal) LHSVal = 0;
8412 if (I->getOperand(1) != RHSVal) RHSVal = 0;
8415 // Otherwise, this is safe to transform, determine if it is profitable.
8417 // If this is a GEP, and if the index (not the pointer) needs a PHI, bail out.
8418 // Indexes are often folded into load/store instructions, so we don't want to
8419 // hide them behind a phi.
8420 if (isa<GetElementPtrInst>(FirstInst) && RHSVal == 0)
8423 Value *InLHS = FirstInst->getOperand(0);
8424 Value *InRHS = FirstInst->getOperand(1);
8425 PHINode *NewLHS = 0, *NewRHS = 0;
8427 NewLHS = new PHINode(LHSType, FirstInst->getOperand(0)->getName()+".pn");
8428 NewLHS->reserveOperandSpace(PN.getNumOperands()/2);
8429 NewLHS->addIncoming(InLHS, PN.getIncomingBlock(0));
8430 InsertNewInstBefore(NewLHS, PN);
8435 NewRHS = new PHINode(RHSType, FirstInst->getOperand(1)->getName()+".pn");
8436 NewRHS->reserveOperandSpace(PN.getNumOperands()/2);
8437 NewRHS->addIncoming(InRHS, PN.getIncomingBlock(0));
8438 InsertNewInstBefore(NewRHS, PN);
8442 // Add all operands to the new PHIs.
8443 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
8445 Value *NewInLHS =cast<Instruction>(PN.getIncomingValue(i))->getOperand(0);
8446 NewLHS->addIncoming(NewInLHS, PN.getIncomingBlock(i));
8449 Value *NewInRHS =cast<Instruction>(PN.getIncomingValue(i))->getOperand(1);
8450 NewRHS->addIncoming(NewInRHS, PN.getIncomingBlock(i));
8454 if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(FirstInst))
8455 return BinaryOperator::create(BinOp->getOpcode(), LHSVal, RHSVal);
8456 else if (CmpInst *CIOp = dyn_cast<CmpInst>(FirstInst))
8457 return CmpInst::create(CIOp->getOpcode(), CIOp->getPredicate(), LHSVal,
8460 assert(isa<GetElementPtrInst>(FirstInst));
8461 return new GetElementPtrInst(LHSVal, RHSVal);
8465 /// isSafeToSinkLoad - Return true if we know that it is safe sink the load out
8466 /// of the block that defines it. This means that it must be obvious the value
8467 /// of the load is not changed from the point of the load to the end of the
8470 /// Finally, it is safe, but not profitable, to sink a load targetting a
8471 /// non-address-taken alloca. Doing so will cause us to not promote the alloca
8473 static bool isSafeToSinkLoad(LoadInst *L) {
8474 BasicBlock::iterator BBI = L, E = L->getParent()->end();
8476 for (++BBI; BBI != E; ++BBI)
8477 if (BBI->mayWriteToMemory())
8480 // Check for non-address taken alloca. If not address-taken already, it isn't
8481 // profitable to do this xform.
8482 if (AllocaInst *AI = dyn_cast<AllocaInst>(L->getOperand(0))) {
8483 bool isAddressTaken = false;
8484 for (Value::use_iterator UI = AI->use_begin(), E = AI->use_end();
8486 if (isa<LoadInst>(UI)) continue;
8487 if (StoreInst *SI = dyn_cast<StoreInst>(*UI)) {
8488 // If storing TO the alloca, then the address isn't taken.
8489 if (SI->getOperand(1) == AI) continue;
8491 isAddressTaken = true;
8495 if (!isAddressTaken)
8503 // FoldPHIArgOpIntoPHI - If all operands to a PHI node are the same "unary"
8504 // operator and they all are only used by the PHI, PHI together their
8505 // inputs, and do the operation once, to the result of the PHI.
8506 Instruction *InstCombiner::FoldPHIArgOpIntoPHI(PHINode &PN) {
8507 Instruction *FirstInst = cast<Instruction>(PN.getIncomingValue(0));
8509 // Scan the instruction, looking for input operations that can be folded away.
8510 // If all input operands to the phi are the same instruction (e.g. a cast from
8511 // the same type or "+42") we can pull the operation through the PHI, reducing
8512 // code size and simplifying code.
8513 Constant *ConstantOp = 0;
8514 const Type *CastSrcTy = 0;
8515 bool isVolatile = false;
8516 if (isa<CastInst>(FirstInst)) {
8517 CastSrcTy = FirstInst->getOperand(0)->getType();
8518 } else if (isa<BinaryOperator>(FirstInst) || isa<CmpInst>(FirstInst)) {
8519 // Can fold binop, compare or shift here if the RHS is a constant,
8520 // otherwise call FoldPHIArgBinOpIntoPHI.
8521 ConstantOp = dyn_cast<Constant>(FirstInst->getOperand(1));
8522 if (ConstantOp == 0)
8523 return FoldPHIArgBinOpIntoPHI(PN);
8524 } else if (LoadInst *LI = dyn_cast<LoadInst>(FirstInst)) {
8525 isVolatile = LI->isVolatile();
8526 // We can't sink the load if the loaded value could be modified between the
8527 // load and the PHI.
8528 if (LI->getParent() != PN.getIncomingBlock(0) ||
8529 !isSafeToSinkLoad(LI))
8531 } else if (isa<GetElementPtrInst>(FirstInst)) {
8532 if (FirstInst->getNumOperands() == 2)
8533 return FoldPHIArgBinOpIntoPHI(PN);
8534 // Can't handle general GEPs yet.
8537 return 0; // Cannot fold this operation.
8540 // Check to see if all arguments are the same operation.
8541 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
8542 if (!isa<Instruction>(PN.getIncomingValue(i))) return 0;
8543 Instruction *I = cast<Instruction>(PN.getIncomingValue(i));
8544 if (!I->hasOneUse() || !I->isSameOperationAs(FirstInst))
8547 if (I->getOperand(0)->getType() != CastSrcTy)
8548 return 0; // Cast operation must match.
8549 } else if (LoadInst *LI = dyn_cast<LoadInst>(I)) {
8550 // We can't sink the load if the loaded value could be modified between
8551 // the load and the PHI.
8552 if (LI->isVolatile() != isVolatile ||
8553 LI->getParent() != PN.getIncomingBlock(i) ||
8554 !isSafeToSinkLoad(LI))
8556 } else if (I->getOperand(1) != ConstantOp) {
8561 // Okay, they are all the same operation. Create a new PHI node of the
8562 // correct type, and PHI together all of the LHS's of the instructions.
8563 PHINode *NewPN = new PHINode(FirstInst->getOperand(0)->getType(),
8564 PN.getName()+".in");
8565 NewPN->reserveOperandSpace(PN.getNumOperands()/2);
8567 Value *InVal = FirstInst->getOperand(0);
8568 NewPN->addIncoming(InVal, PN.getIncomingBlock(0));
8570 // Add all operands to the new PHI.
8571 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
8572 Value *NewInVal = cast<Instruction>(PN.getIncomingValue(i))->getOperand(0);
8573 if (NewInVal != InVal)
8575 NewPN->addIncoming(NewInVal, PN.getIncomingBlock(i));
8580 // The new PHI unions all of the same values together. This is really
8581 // common, so we handle it intelligently here for compile-time speed.
8585 InsertNewInstBefore(NewPN, PN);
8589 // Insert and return the new operation.
8590 if (CastInst* FirstCI = dyn_cast<CastInst>(FirstInst))
8591 return CastInst::create(FirstCI->getOpcode(), PhiVal, PN.getType());
8592 else if (isa<LoadInst>(FirstInst))
8593 return new LoadInst(PhiVal, "", isVolatile);
8594 else if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(FirstInst))
8595 return BinaryOperator::create(BinOp->getOpcode(), PhiVal, ConstantOp);
8596 else if (CmpInst *CIOp = dyn_cast<CmpInst>(FirstInst))
8597 return CmpInst::create(CIOp->getOpcode(), CIOp->getPredicate(),
8598 PhiVal, ConstantOp);
8600 assert(0 && "Unknown operation");
8604 /// DeadPHICycle - Return true if this PHI node is only used by a PHI node cycle
8606 static bool DeadPHICycle(PHINode *PN,
8607 SmallPtrSet<PHINode*, 16> &PotentiallyDeadPHIs) {
8608 if (PN->use_empty()) return true;
8609 if (!PN->hasOneUse()) return false;
8611 // Remember this node, and if we find the cycle, return.
8612 if (!PotentiallyDeadPHIs.insert(PN))
8615 // Don't scan crazily complex things.
8616 if (PotentiallyDeadPHIs.size() == 16)
8619 if (PHINode *PU = dyn_cast<PHINode>(PN->use_back()))
8620 return DeadPHICycle(PU, PotentiallyDeadPHIs);
8625 /// PHIsEqualValue - Return true if this phi node is always equal to
8626 /// NonPhiInVal. This happens with mutually cyclic phi nodes like:
8627 /// z = some value; x = phi (y, z); y = phi (x, z)
8628 static bool PHIsEqualValue(PHINode *PN, Value *NonPhiInVal,
8629 SmallPtrSet<PHINode*, 16> &ValueEqualPHIs) {
8630 // See if we already saw this PHI node.
8631 if (!ValueEqualPHIs.insert(PN))
8634 // Don't scan crazily complex things.
8635 if (ValueEqualPHIs.size() == 16)
8638 // Scan the operands to see if they are either phi nodes or are equal to
8640 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
8641 Value *Op = PN->getIncomingValue(i);
8642 if (PHINode *OpPN = dyn_cast<PHINode>(Op)) {
8643 if (!PHIsEqualValue(OpPN, NonPhiInVal, ValueEqualPHIs))
8645 } else if (Op != NonPhiInVal)
8653 // PHINode simplification
8655 Instruction *InstCombiner::visitPHINode(PHINode &PN) {
8656 // If LCSSA is around, don't mess with Phi nodes
8657 if (MustPreserveLCSSA) return 0;
8659 if (Value *V = PN.hasConstantValue())
8660 return ReplaceInstUsesWith(PN, V);
8662 // If all PHI operands are the same operation, pull them through the PHI,
8663 // reducing code size.
8664 if (isa<Instruction>(PN.getIncomingValue(0)) &&
8665 PN.getIncomingValue(0)->hasOneUse())
8666 if (Instruction *Result = FoldPHIArgOpIntoPHI(PN))
8669 // If this is a trivial cycle in the PHI node graph, remove it. Basically, if
8670 // this PHI only has a single use (a PHI), and if that PHI only has one use (a
8671 // PHI)... break the cycle.
8672 if (PN.hasOneUse()) {
8673 Instruction *PHIUser = cast<Instruction>(PN.use_back());
8674 if (PHINode *PU = dyn_cast<PHINode>(PHIUser)) {
8675 SmallPtrSet<PHINode*, 16> PotentiallyDeadPHIs;
8676 PotentiallyDeadPHIs.insert(&PN);
8677 if (DeadPHICycle(PU, PotentiallyDeadPHIs))
8678 return ReplaceInstUsesWith(PN, UndefValue::get(PN.getType()));
8681 // If this phi has a single use, and if that use just computes a value for
8682 // the next iteration of a loop, delete the phi. This occurs with unused
8683 // induction variables, e.g. "for (int j = 0; ; ++j);". Detecting this
8684 // common case here is good because the only other things that catch this
8685 // are induction variable analysis (sometimes) and ADCE, which is only run
8687 if (PHIUser->hasOneUse() &&
8688 (isa<BinaryOperator>(PHIUser) || isa<GetElementPtrInst>(PHIUser)) &&
8689 PHIUser->use_back() == &PN) {
8690 return ReplaceInstUsesWith(PN, UndefValue::get(PN.getType()));
8694 // We sometimes end up with phi cycles that non-obviously end up being the
8695 // same value, for example:
8696 // z = some value; x = phi (y, z); y = phi (x, z)
8697 // where the phi nodes don't necessarily need to be in the same block. Do a
8698 // quick check to see if the PHI node only contains a single non-phi value, if
8699 // so, scan to see if the phi cycle is actually equal to that value.
8701 unsigned InValNo = 0, NumOperandVals = PN.getNumIncomingValues();
8702 // Scan for the first non-phi operand.
8703 while (InValNo != NumOperandVals &&
8704 isa<PHINode>(PN.getIncomingValue(InValNo)))
8707 if (InValNo != NumOperandVals) {
8708 Value *NonPhiInVal = PN.getOperand(InValNo);
8710 // Scan the rest of the operands to see if there are any conflicts, if so
8711 // there is no need to recursively scan other phis.
8712 for (++InValNo; InValNo != NumOperandVals; ++InValNo) {
8713 Value *OpVal = PN.getIncomingValue(InValNo);
8714 if (OpVal != NonPhiInVal && !isa<PHINode>(OpVal))
8718 // If we scanned over all operands, then we have one unique value plus
8719 // phi values. Scan PHI nodes to see if they all merge in each other or
8721 if (InValNo == NumOperandVals) {
8722 SmallPtrSet<PHINode*, 16> ValueEqualPHIs;
8723 if (PHIsEqualValue(&PN, NonPhiInVal, ValueEqualPHIs))
8724 return ReplaceInstUsesWith(PN, NonPhiInVal);
8731 static Value *InsertCastToIntPtrTy(Value *V, const Type *DTy,
8732 Instruction *InsertPoint,
8734 unsigned PtrSize = DTy->getPrimitiveSizeInBits();
8735 unsigned VTySize = V->getType()->getPrimitiveSizeInBits();
8736 // We must cast correctly to the pointer type. Ensure that we
8737 // sign extend the integer value if it is smaller as this is
8738 // used for address computation.
8739 Instruction::CastOps opcode =
8740 (VTySize < PtrSize ? Instruction::SExt :
8741 (VTySize == PtrSize ? Instruction::BitCast : Instruction::Trunc));
8742 return IC->InsertCastBefore(opcode, V, DTy, *InsertPoint);
8746 Instruction *InstCombiner::visitGetElementPtrInst(GetElementPtrInst &GEP) {
8747 Value *PtrOp = GEP.getOperand(0);
8748 // Is it 'getelementptr %P, i32 0' or 'getelementptr %P'
8749 // If so, eliminate the noop.
8750 if (GEP.getNumOperands() == 1)
8751 return ReplaceInstUsesWith(GEP, PtrOp);
8753 if (isa<UndefValue>(GEP.getOperand(0)))
8754 return ReplaceInstUsesWith(GEP, UndefValue::get(GEP.getType()));
8756 bool HasZeroPointerIndex = false;
8757 if (Constant *C = dyn_cast<Constant>(GEP.getOperand(1)))
8758 HasZeroPointerIndex = C->isNullValue();
8760 if (GEP.getNumOperands() == 2 && HasZeroPointerIndex)
8761 return ReplaceInstUsesWith(GEP, PtrOp);
8763 // Eliminate unneeded casts for indices.
8764 bool MadeChange = false;
8766 gep_type_iterator GTI = gep_type_begin(GEP);
8767 for (unsigned i = 1, e = GEP.getNumOperands(); i != e; ++i, ++GTI) {
8768 if (isa<SequentialType>(*GTI)) {
8769 if (CastInst *CI = dyn_cast<CastInst>(GEP.getOperand(i))) {
8770 if (CI->getOpcode() == Instruction::ZExt ||
8771 CI->getOpcode() == Instruction::SExt) {
8772 const Type *SrcTy = CI->getOperand(0)->getType();
8773 // We can eliminate a cast from i32 to i64 iff the target
8774 // is a 32-bit pointer target.
8775 if (SrcTy->getPrimitiveSizeInBits() >= TD->getPointerSizeInBits()) {
8777 GEP.setOperand(i, CI->getOperand(0));
8781 // If we are using a wider index than needed for this platform, shrink it
8782 // to what we need. If the incoming value needs a cast instruction,
8783 // insert it. This explicit cast can make subsequent optimizations more
8785 Value *Op = GEP.getOperand(i);
8786 if (TD->getTypeSizeInBits(Op->getType()) > TD->getPointerSizeInBits())
8787 if (Constant *C = dyn_cast<Constant>(Op)) {
8788 GEP.setOperand(i, ConstantExpr::getTrunc(C, TD->getIntPtrType()));
8791 Op = InsertCastBefore(Instruction::Trunc, Op, TD->getIntPtrType(),
8793 GEP.setOperand(i, Op);
8798 if (MadeChange) return &GEP;
8800 // If this GEP instruction doesn't move the pointer, and if the input operand
8801 // is a bitcast of another pointer, just replace the GEP with a bitcast of the
8802 // real input to the dest type.
8803 if (GEP.hasAllZeroIndices()) {
8804 if (BitCastInst *BCI = dyn_cast<BitCastInst>(GEP.getOperand(0))) {
8805 // If the bitcast is of an allocation, and the allocation will be
8806 // converted to match the type of the cast, don't touch this.
8807 if (isa<AllocationInst>(BCI->getOperand(0))) {
8808 // See if the bitcast simplifies, if so, don't nuke this GEP yet.
8809 if (Instruction *I = visitBitCast(*BCI)) {
8812 BCI->getParent()->getInstList().insert(BCI, I);
8813 ReplaceInstUsesWith(*BCI, I);
8818 return new BitCastInst(BCI->getOperand(0), GEP.getType());
8822 // Combine Indices - If the source pointer to this getelementptr instruction
8823 // is a getelementptr instruction, combine the indices of the two
8824 // getelementptr instructions into a single instruction.
8826 SmallVector<Value*, 8> SrcGEPOperands;
8827 if (User *Src = dyn_castGetElementPtr(PtrOp))
8828 SrcGEPOperands.append(Src->op_begin(), Src->op_end());
8830 if (!SrcGEPOperands.empty()) {
8831 // Note that if our source is a gep chain itself that we wait for that
8832 // chain to be resolved before we perform this transformation. This
8833 // avoids us creating a TON of code in some cases.
8835 if (isa<GetElementPtrInst>(SrcGEPOperands[0]) &&
8836 cast<Instruction>(SrcGEPOperands[0])->getNumOperands() == 2)
8837 return 0; // Wait until our source is folded to completion.
8839 SmallVector<Value*, 8> Indices;
8841 // Find out whether the last index in the source GEP is a sequential idx.
8842 bool EndsWithSequential = false;
8843 for (gep_type_iterator I = gep_type_begin(*cast<User>(PtrOp)),
8844 E = gep_type_end(*cast<User>(PtrOp)); I != E; ++I)
8845 EndsWithSequential = !isa<StructType>(*I);
8847 // Can we combine the two pointer arithmetics offsets?
8848 if (EndsWithSequential) {
8849 // Replace: gep (gep %P, long B), long A, ...
8850 // With: T = long A+B; gep %P, T, ...
8852 Value *Sum, *SO1 = SrcGEPOperands.back(), *GO1 = GEP.getOperand(1);
8853 if (SO1 == Constant::getNullValue(SO1->getType())) {
8855 } else if (GO1 == Constant::getNullValue(GO1->getType())) {
8858 // If they aren't the same type, convert both to an integer of the
8859 // target's pointer size.
8860 if (SO1->getType() != GO1->getType()) {
8861 if (Constant *SO1C = dyn_cast<Constant>(SO1)) {
8862 SO1 = ConstantExpr::getIntegerCast(SO1C, GO1->getType(), true);
8863 } else if (Constant *GO1C = dyn_cast<Constant>(GO1)) {
8864 GO1 = ConstantExpr::getIntegerCast(GO1C, SO1->getType(), true);
8866 unsigned PS = TD->getPointerSizeInBits();
8867 if (TD->getTypeSizeInBits(SO1->getType()) == PS) {
8868 // Convert GO1 to SO1's type.
8869 GO1 = InsertCastToIntPtrTy(GO1, SO1->getType(), &GEP, this);
8871 } else if (TD->getTypeSizeInBits(GO1->getType()) == PS) {
8872 // Convert SO1 to GO1's type.
8873 SO1 = InsertCastToIntPtrTy(SO1, GO1->getType(), &GEP, this);
8875 const Type *PT = TD->getIntPtrType();
8876 SO1 = InsertCastToIntPtrTy(SO1, PT, &GEP, this);
8877 GO1 = InsertCastToIntPtrTy(GO1, PT, &GEP, this);
8881 if (isa<Constant>(SO1) && isa<Constant>(GO1))
8882 Sum = ConstantExpr::getAdd(cast<Constant>(SO1), cast<Constant>(GO1));
8884 Sum = BinaryOperator::createAdd(SO1, GO1, PtrOp->getName()+".sum");
8885 InsertNewInstBefore(cast<Instruction>(Sum), GEP);
8889 // Recycle the GEP we already have if possible.
8890 if (SrcGEPOperands.size() == 2) {
8891 GEP.setOperand(0, SrcGEPOperands[0]);
8892 GEP.setOperand(1, Sum);
8895 Indices.insert(Indices.end(), SrcGEPOperands.begin()+1,
8896 SrcGEPOperands.end()-1);
8897 Indices.push_back(Sum);
8898 Indices.insert(Indices.end(), GEP.op_begin()+2, GEP.op_end());
8900 } else if (isa<Constant>(*GEP.idx_begin()) &&
8901 cast<Constant>(*GEP.idx_begin())->isNullValue() &&
8902 SrcGEPOperands.size() != 1) {
8903 // Otherwise we can do the fold if the first index of the GEP is a zero
8904 Indices.insert(Indices.end(), SrcGEPOperands.begin()+1,
8905 SrcGEPOperands.end());
8906 Indices.insert(Indices.end(), GEP.idx_begin()+1, GEP.idx_end());
8909 if (!Indices.empty())
8910 return new GetElementPtrInst(SrcGEPOperands[0], Indices.begin(),
8911 Indices.end(), GEP.getName());
8913 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(PtrOp)) {
8914 // GEP of global variable. If all of the indices for this GEP are
8915 // constants, we can promote this to a constexpr instead of an instruction.
8917 // Scan for nonconstants...
8918 SmallVector<Constant*, 8> Indices;
8919 User::op_iterator I = GEP.idx_begin(), E = GEP.idx_end();
8920 for (; I != E && isa<Constant>(*I); ++I)
8921 Indices.push_back(cast<Constant>(*I));
8923 if (I == E) { // If they are all constants...
8924 Constant *CE = ConstantExpr::getGetElementPtr(GV,
8925 &Indices[0],Indices.size());
8927 // Replace all uses of the GEP with the new constexpr...
8928 return ReplaceInstUsesWith(GEP, CE);
8930 } else if (Value *X = getBitCastOperand(PtrOp)) { // Is the operand a cast?
8931 if (!isa<PointerType>(X->getType())) {
8932 // Not interesting. Source pointer must be a cast from pointer.
8933 } else if (HasZeroPointerIndex) {
8934 // transform: GEP (bitcast [10 x i8]* X to [0 x i8]*), i32 0, ...
8935 // into : GEP [10 x i8]* X, i32 0, ...
8937 // This occurs when the program declares an array extern like "int X[];"
8939 const PointerType *CPTy = cast<PointerType>(PtrOp->getType());
8940 const PointerType *XTy = cast<PointerType>(X->getType());
8941 if (const ArrayType *XATy =
8942 dyn_cast<ArrayType>(XTy->getElementType()))
8943 if (const ArrayType *CATy =
8944 dyn_cast<ArrayType>(CPTy->getElementType()))
8945 if (CATy->getElementType() == XATy->getElementType()) {
8946 // At this point, we know that the cast source type is a pointer
8947 // to an array of the same type as the destination pointer
8948 // array. Because the array type is never stepped over (there
8949 // is a leading zero) we can fold the cast into this GEP.
8950 GEP.setOperand(0, X);
8953 } else if (GEP.getNumOperands() == 2) {
8954 // Transform things like:
8955 // %t = getelementptr i32* bitcast ([2 x i32]* %str to i32*), i32 %V
8956 // into: %t1 = getelementptr [2 x i32]* %str, i32 0, i32 %V; bitcast
8957 const Type *SrcElTy = cast<PointerType>(X->getType())->getElementType();
8958 const Type *ResElTy=cast<PointerType>(PtrOp->getType())->getElementType();
8959 if (isa<ArrayType>(SrcElTy) &&
8960 TD->getABITypeSize(cast<ArrayType>(SrcElTy)->getElementType()) ==
8961 TD->getABITypeSize(ResElTy)) {
8963 Idx[0] = Constant::getNullValue(Type::Int32Ty);
8964 Idx[1] = GEP.getOperand(1);
8965 Value *V = InsertNewInstBefore(
8966 new GetElementPtrInst(X, Idx, Idx + 2, GEP.getName()), GEP);
8967 // V and GEP are both pointer types --> BitCast
8968 return new BitCastInst(V, GEP.getType());
8971 // Transform things like:
8972 // getelementptr i8* bitcast ([100 x double]* X to i8*), i32 %tmp
8973 // (where tmp = 8*tmp2) into:
8974 // getelementptr [100 x double]* %arr, i32 0, i32 %tmp2; bitcast
8976 if (isa<ArrayType>(SrcElTy) && ResElTy == Type::Int8Ty) {
8977 uint64_t ArrayEltSize =
8978 TD->getABITypeSize(cast<ArrayType>(SrcElTy)->getElementType());
8980 // Check to see if "tmp" is a scale by a multiple of ArrayEltSize. We
8981 // allow either a mul, shift, or constant here.
8983 ConstantInt *Scale = 0;
8984 if (ArrayEltSize == 1) {
8985 NewIdx = GEP.getOperand(1);
8986 Scale = ConstantInt::get(NewIdx->getType(), 1);
8987 } else if (ConstantInt *CI = dyn_cast<ConstantInt>(GEP.getOperand(1))) {
8988 NewIdx = ConstantInt::get(CI->getType(), 1);
8990 } else if (Instruction *Inst =dyn_cast<Instruction>(GEP.getOperand(1))){
8991 if (Inst->getOpcode() == Instruction::Shl &&
8992 isa<ConstantInt>(Inst->getOperand(1))) {
8993 ConstantInt *ShAmt = cast<ConstantInt>(Inst->getOperand(1));
8994 uint32_t ShAmtVal = ShAmt->getLimitedValue(64);
8995 Scale = ConstantInt::get(Inst->getType(), 1ULL << ShAmtVal);
8996 NewIdx = Inst->getOperand(0);
8997 } else if (Inst->getOpcode() == Instruction::Mul &&
8998 isa<ConstantInt>(Inst->getOperand(1))) {
8999 Scale = cast<ConstantInt>(Inst->getOperand(1));
9000 NewIdx = Inst->getOperand(0);
9004 // If the index will be to exactly the right offset with the scale taken
9005 // out, perform the transformation. Note, we don't know whether Scale is
9006 // signed or not. We'll use unsigned version of division/modulo
9007 // operation after making sure Scale doesn't have the sign bit set.
9008 if (Scale && Scale->getSExtValue() >= 0LL &&
9009 Scale->getZExtValue() % ArrayEltSize == 0) {
9010 Scale = ConstantInt::get(Scale->getType(),
9011 Scale->getZExtValue() / ArrayEltSize);
9012 if (Scale->getZExtValue() != 1) {
9013 Constant *C = ConstantExpr::getIntegerCast(Scale, NewIdx->getType(),
9015 Instruction *Sc = BinaryOperator::createMul(NewIdx, C, "idxscale");
9016 NewIdx = InsertNewInstBefore(Sc, GEP);
9019 // Insert the new GEP instruction.
9021 Idx[0] = Constant::getNullValue(Type::Int32Ty);
9023 Instruction *NewGEP =
9024 new GetElementPtrInst(X, Idx, Idx + 2, GEP.getName());
9025 NewGEP = InsertNewInstBefore(NewGEP, GEP);
9026 // The NewGEP must be pointer typed, so must the old one -> BitCast
9027 return new BitCastInst(NewGEP, GEP.getType());
9036 Instruction *InstCombiner::visitAllocationInst(AllocationInst &AI) {
9037 // Convert: malloc Ty, C - where C is a constant != 1 into: malloc [C x Ty], 1
9038 if (AI.isArrayAllocation()) // Check C != 1
9039 if (const ConstantInt *C = dyn_cast<ConstantInt>(AI.getArraySize())) {
9041 ArrayType::get(AI.getAllocatedType(), C->getZExtValue());
9042 AllocationInst *New = 0;
9044 // Create and insert the replacement instruction...
9045 if (isa<MallocInst>(AI))
9046 New = new MallocInst(NewTy, 0, AI.getAlignment(), AI.getName());
9048 assert(isa<AllocaInst>(AI) && "Unknown type of allocation inst!");
9049 New = new AllocaInst(NewTy, 0, AI.getAlignment(), AI.getName());
9052 InsertNewInstBefore(New, AI);
9054 // Scan to the end of the allocation instructions, to skip over a block of
9055 // allocas if possible...
9057 BasicBlock::iterator It = New;
9058 while (isa<AllocationInst>(*It)) ++It;
9060 // Now that I is pointing to the first non-allocation-inst in the block,
9061 // insert our getelementptr instruction...
9063 Value *NullIdx = Constant::getNullValue(Type::Int32Ty);
9067 Value *V = new GetElementPtrInst(New, Idx, Idx + 2,
9068 New->getName()+".sub", It);
9070 // Now make everything use the getelementptr instead of the original
9072 return ReplaceInstUsesWith(AI, V);
9073 } else if (isa<UndefValue>(AI.getArraySize())) {
9074 return ReplaceInstUsesWith(AI, Constant::getNullValue(AI.getType()));
9077 // If alloca'ing a zero byte object, replace the alloca with a null pointer.
9078 // Note that we only do this for alloca's, because malloc should allocate and
9079 // return a unique pointer, even for a zero byte allocation.
9080 if (isa<AllocaInst>(AI) && AI.getAllocatedType()->isSized() &&
9081 TD->getABITypeSize(AI.getAllocatedType()) == 0)
9082 return ReplaceInstUsesWith(AI, Constant::getNullValue(AI.getType()));
9087 Instruction *InstCombiner::visitFreeInst(FreeInst &FI) {
9088 Value *Op = FI.getOperand(0);
9090 // free undef -> unreachable.
9091 if (isa<UndefValue>(Op)) {
9092 // Insert a new store to null because we cannot modify the CFG here.
9093 new StoreInst(ConstantInt::getTrue(),
9094 UndefValue::get(PointerType::getUnqual(Type::Int1Ty)), &FI);
9095 return EraseInstFromFunction(FI);
9098 // If we have 'free null' delete the instruction. This can happen in stl code
9099 // when lots of inlining happens.
9100 if (isa<ConstantPointerNull>(Op))
9101 return EraseInstFromFunction(FI);
9103 // Change free <ty>* (cast <ty2>* X to <ty>*) into free <ty2>* X
9104 if (BitCastInst *CI = dyn_cast<BitCastInst>(Op)) {
9105 FI.setOperand(0, CI->getOperand(0));
9109 // Change free (gep X, 0,0,0,0) into free(X)
9110 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(Op)) {
9111 if (GEPI->hasAllZeroIndices()) {
9112 AddToWorkList(GEPI);
9113 FI.setOperand(0, GEPI->getOperand(0));
9118 // Change free(malloc) into nothing, if the malloc has a single use.
9119 if (MallocInst *MI = dyn_cast<MallocInst>(Op))
9120 if (MI->hasOneUse()) {
9121 EraseInstFromFunction(FI);
9122 return EraseInstFromFunction(*MI);
9129 /// InstCombineLoadCast - Fold 'load (cast P)' -> cast (load P)' when possible.
9130 static Instruction *InstCombineLoadCast(InstCombiner &IC, LoadInst &LI,
9131 const TargetData *TD) {
9132 User *CI = cast<User>(LI.getOperand(0));
9133 Value *CastOp = CI->getOperand(0);
9135 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(CI)) {
9136 // Instead of loading constant c string, use corresponding integer value
9137 // directly if string length is small enough.
9138 const std::string &Str = CE->getOperand(0)->getStringValue();
9140 unsigned len = Str.length();
9141 const Type *Ty = cast<PointerType>(CE->getType())->getElementType();
9142 unsigned numBits = Ty->getPrimitiveSizeInBits();
9143 // Replace LI with immediate integer store.
9144 if ((numBits >> 3) == len + 1) {
9145 APInt StrVal(numBits, 0);
9146 APInt SingleChar(numBits, 0);
9147 if (TD->isLittleEndian()) {
9148 for (signed i = len-1; i >= 0; i--) {
9149 SingleChar = (uint64_t) Str[i];
9150 StrVal = (StrVal << 8) | SingleChar;
9153 for (unsigned i = 0; i < len; i++) {
9154 SingleChar = (uint64_t) Str[i];
9155 StrVal = (StrVal << 8) | SingleChar;
9157 // Append NULL at the end.
9159 StrVal = (StrVal << 8) | SingleChar;
9161 Value *NL = ConstantInt::get(StrVal);
9162 return IC.ReplaceInstUsesWith(LI, NL);
9167 const Type *DestPTy = cast<PointerType>(CI->getType())->getElementType();
9168 if (const PointerType *SrcTy = dyn_cast<PointerType>(CastOp->getType())) {
9169 const Type *SrcPTy = SrcTy->getElementType();
9171 if (DestPTy->isInteger() || isa<PointerType>(DestPTy) ||
9172 isa<VectorType>(DestPTy)) {
9173 // If the source is an array, the code below will not succeed. Check to
9174 // see if a trivial 'gep P, 0, 0' will help matters. Only do this for
9176 if (const ArrayType *ASrcTy = dyn_cast<ArrayType>(SrcPTy))
9177 if (Constant *CSrc = dyn_cast<Constant>(CastOp))
9178 if (ASrcTy->getNumElements() != 0) {
9180 Idxs[0] = Idxs[1] = Constant::getNullValue(Type::Int32Ty);
9181 CastOp = ConstantExpr::getGetElementPtr(CSrc, Idxs, 2);
9182 SrcTy = cast<PointerType>(CastOp->getType());
9183 SrcPTy = SrcTy->getElementType();
9186 if ((SrcPTy->isInteger() || isa<PointerType>(SrcPTy) ||
9187 isa<VectorType>(SrcPTy)) &&
9188 // Do not allow turning this into a load of an integer, which is then
9189 // casted to a pointer, this pessimizes pointer analysis a lot.
9190 (isa<PointerType>(SrcPTy) == isa<PointerType>(LI.getType())) &&
9191 IC.getTargetData().getTypeSizeInBits(SrcPTy) ==
9192 IC.getTargetData().getTypeSizeInBits(DestPTy)) {
9194 // Okay, we are casting from one integer or pointer type to another of
9195 // the same size. Instead of casting the pointer before the load, cast
9196 // the result of the loaded value.
9197 Value *NewLoad = IC.InsertNewInstBefore(new LoadInst(CastOp,
9199 LI.isVolatile()),LI);
9200 // Now cast the result of the load.
9201 return new BitCastInst(NewLoad, LI.getType());
9208 /// isSafeToLoadUnconditionally - Return true if we know that executing a load
9209 /// from this value cannot trap. If it is not obviously safe to load from the
9210 /// specified pointer, we do a quick local scan of the basic block containing
9211 /// ScanFrom, to determine if the address is already accessed.
9212 static bool isSafeToLoadUnconditionally(Value *V, Instruction *ScanFrom) {
9213 // If it is an alloca it is always safe to load from.
9214 if (isa<AllocaInst>(V)) return true;
9216 // If it is a global variable it is mostly safe to load from.
9217 if (const GlobalValue *GV = dyn_cast<GlobalVariable>(V))
9218 // Don't try to evaluate aliases. External weak GV can be null.
9219 return !isa<GlobalAlias>(GV) && !GV->hasExternalWeakLinkage();
9221 // Otherwise, be a little bit agressive by scanning the local block where we
9222 // want to check to see if the pointer is already being loaded or stored
9223 // from/to. If so, the previous load or store would have already trapped,
9224 // so there is no harm doing an extra load (also, CSE will later eliminate
9225 // the load entirely).
9226 BasicBlock::iterator BBI = ScanFrom, E = ScanFrom->getParent()->begin();
9231 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) {
9232 if (LI->getOperand(0) == V) return true;
9233 } else if (StoreInst *SI = dyn_cast<StoreInst>(BBI))
9234 if (SI->getOperand(1) == V) return true;
9240 /// GetUnderlyingObject - Trace through a series of getelementptrs and bitcasts
9241 /// until we find the underlying object a pointer is referring to or something
9242 /// we don't understand. Note that the returned pointer may be offset from the
9243 /// input, because we ignore GEP indices.
9244 static Value *GetUnderlyingObject(Value *Ptr) {
9246 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Ptr)) {
9247 if (CE->getOpcode() == Instruction::BitCast ||
9248 CE->getOpcode() == Instruction::GetElementPtr)
9249 Ptr = CE->getOperand(0);
9252 } else if (BitCastInst *BCI = dyn_cast<BitCastInst>(Ptr)) {
9253 Ptr = BCI->getOperand(0);
9254 } else if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Ptr)) {
9255 Ptr = GEP->getOperand(0);
9262 Instruction *InstCombiner::visitLoadInst(LoadInst &LI) {
9263 Value *Op = LI.getOperand(0);
9265 // Attempt to improve the alignment.
9266 unsigned KnownAlign = GetOrEnforceKnownAlignment(Op, TD);
9267 if (KnownAlign > LI.getAlignment())
9268 LI.setAlignment(KnownAlign);
9270 // load (cast X) --> cast (load X) iff safe
9271 if (isa<CastInst>(Op))
9272 if (Instruction *Res = InstCombineLoadCast(*this, LI, TD))
9275 // None of the following transforms are legal for volatile loads.
9276 if (LI.isVolatile()) return 0;
9278 if (&LI.getParent()->front() != &LI) {
9279 BasicBlock::iterator BBI = &LI; --BBI;
9280 // If the instruction immediately before this is a store to the same
9281 // address, do a simple form of store->load forwarding.
9282 if (StoreInst *SI = dyn_cast<StoreInst>(BBI))
9283 if (SI->getOperand(1) == LI.getOperand(0))
9284 return ReplaceInstUsesWith(LI, SI->getOperand(0));
9285 if (LoadInst *LIB = dyn_cast<LoadInst>(BBI))
9286 if (LIB->getOperand(0) == LI.getOperand(0))
9287 return ReplaceInstUsesWith(LI, LIB);
9290 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(Op))
9291 if (isa<ConstantPointerNull>(GEPI->getOperand(0))) {
9292 // Insert a new store to null instruction before the load to indicate
9293 // that this code is not reachable. We do this instead of inserting
9294 // an unreachable instruction directly because we cannot modify the
9296 new StoreInst(UndefValue::get(LI.getType()),
9297 Constant::getNullValue(Op->getType()), &LI);
9298 return ReplaceInstUsesWith(LI, UndefValue::get(LI.getType()));
9301 if (Constant *C = dyn_cast<Constant>(Op)) {
9302 // load null/undef -> undef
9303 if ((C->isNullValue() || isa<UndefValue>(C))) {
9304 // Insert a new store to null instruction before the load to indicate that
9305 // this code is not reachable. We do this instead of inserting an
9306 // unreachable instruction directly because we cannot modify the CFG.
9307 new StoreInst(UndefValue::get(LI.getType()),
9308 Constant::getNullValue(Op->getType()), &LI);
9309 return ReplaceInstUsesWith(LI, UndefValue::get(LI.getType()));
9312 // Instcombine load (constant global) into the value loaded.
9313 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(Op))
9314 if (GV->isConstant() && !GV->isDeclaration())
9315 return ReplaceInstUsesWith(LI, GV->getInitializer());
9317 // Instcombine load (constantexpr_GEP global, 0, ...) into the value loaded.
9318 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Op))
9319 if (CE->getOpcode() == Instruction::GetElementPtr) {
9320 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(CE->getOperand(0)))
9321 if (GV->isConstant() && !GV->isDeclaration())
9323 ConstantFoldLoadThroughGEPConstantExpr(GV->getInitializer(), CE))
9324 return ReplaceInstUsesWith(LI, V);
9325 if (CE->getOperand(0)->isNullValue()) {
9326 // Insert a new store to null instruction before the load to indicate
9327 // that this code is not reachable. We do this instead of inserting
9328 // an unreachable instruction directly because we cannot modify the
9330 new StoreInst(UndefValue::get(LI.getType()),
9331 Constant::getNullValue(Op->getType()), &LI);
9332 return ReplaceInstUsesWith(LI, UndefValue::get(LI.getType()));
9335 } else if (CE->isCast()) {
9336 if (Instruction *Res = InstCombineLoadCast(*this, LI, TD))
9341 // If this load comes from anywhere in a constant global, and if the global
9342 // is all undef or zero, we know what it loads.
9343 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(GetUnderlyingObject(Op))) {
9344 if (GV->isConstant() && GV->hasInitializer()) {
9345 if (GV->getInitializer()->isNullValue())
9346 return ReplaceInstUsesWith(LI, Constant::getNullValue(LI.getType()));
9347 else if (isa<UndefValue>(GV->getInitializer()))
9348 return ReplaceInstUsesWith(LI, UndefValue::get(LI.getType()));
9352 if (Op->hasOneUse()) {
9353 // Change select and PHI nodes to select values instead of addresses: this
9354 // helps alias analysis out a lot, allows many others simplifications, and
9355 // exposes redundancy in the code.
9357 // Note that we cannot do the transformation unless we know that the
9358 // introduced loads cannot trap! Something like this is valid as long as
9359 // the condition is always false: load (select bool %C, int* null, int* %G),
9360 // but it would not be valid if we transformed it to load from null
9363 if (SelectInst *SI = dyn_cast<SelectInst>(Op)) {
9364 // load (select (Cond, &V1, &V2)) --> select(Cond, load &V1, load &V2).
9365 if (isSafeToLoadUnconditionally(SI->getOperand(1), SI) &&
9366 isSafeToLoadUnconditionally(SI->getOperand(2), SI)) {
9367 Value *V1 = InsertNewInstBefore(new LoadInst(SI->getOperand(1),
9368 SI->getOperand(1)->getName()+".val"), LI);
9369 Value *V2 = InsertNewInstBefore(new LoadInst(SI->getOperand(2),
9370 SI->getOperand(2)->getName()+".val"), LI);
9371 return new SelectInst(SI->getCondition(), V1, V2);
9374 // load (select (cond, null, P)) -> load P
9375 if (Constant *C = dyn_cast<Constant>(SI->getOperand(1)))
9376 if (C->isNullValue()) {
9377 LI.setOperand(0, SI->getOperand(2));
9381 // load (select (cond, P, null)) -> load P
9382 if (Constant *C = dyn_cast<Constant>(SI->getOperand(2)))
9383 if (C->isNullValue()) {
9384 LI.setOperand(0, SI->getOperand(1));
9392 /// InstCombineStoreToCast - Fold store V, (cast P) -> store (cast V), P
9394 static Instruction *InstCombineStoreToCast(InstCombiner &IC, StoreInst &SI) {
9395 User *CI = cast<User>(SI.getOperand(1));
9396 Value *CastOp = CI->getOperand(0);
9398 const Type *DestPTy = cast<PointerType>(CI->getType())->getElementType();
9399 if (const PointerType *SrcTy = dyn_cast<PointerType>(CastOp->getType())) {
9400 const Type *SrcPTy = SrcTy->getElementType();
9402 if (DestPTy->isInteger() || isa<PointerType>(DestPTy)) {
9403 // If the source is an array, the code below will not succeed. Check to
9404 // see if a trivial 'gep P, 0, 0' will help matters. Only do this for
9406 if (const ArrayType *ASrcTy = dyn_cast<ArrayType>(SrcPTy))
9407 if (Constant *CSrc = dyn_cast<Constant>(CastOp))
9408 if (ASrcTy->getNumElements() != 0) {
9410 Idxs[0] = Idxs[1] = Constant::getNullValue(Type::Int32Ty);
9411 CastOp = ConstantExpr::getGetElementPtr(CSrc, Idxs, 2);
9412 SrcTy = cast<PointerType>(CastOp->getType());
9413 SrcPTy = SrcTy->getElementType();
9416 if ((SrcPTy->isInteger() || isa<PointerType>(SrcPTy)) &&
9417 IC.getTargetData().getTypeSizeInBits(SrcPTy) ==
9418 IC.getTargetData().getTypeSizeInBits(DestPTy)) {
9420 // Okay, we are casting from one integer or pointer type to another of
9421 // the same size. Instead of casting the pointer before
9422 // the store, cast the value to be stored.
9424 Value *SIOp0 = SI.getOperand(0);
9425 Instruction::CastOps opcode = Instruction::BitCast;
9426 const Type* CastSrcTy = SIOp0->getType();
9427 const Type* CastDstTy = SrcPTy;
9428 if (isa<PointerType>(CastDstTy)) {
9429 if (CastSrcTy->isInteger())
9430 opcode = Instruction::IntToPtr;
9431 } else if (isa<IntegerType>(CastDstTy)) {
9432 if (isa<PointerType>(SIOp0->getType()))
9433 opcode = Instruction::PtrToInt;
9435 if (Constant *C = dyn_cast<Constant>(SIOp0))
9436 NewCast = ConstantExpr::getCast(opcode, C, CastDstTy);
9438 NewCast = IC.InsertNewInstBefore(
9439 CastInst::create(opcode, SIOp0, CastDstTy, SIOp0->getName()+".c"),
9441 return new StoreInst(NewCast, CastOp);
9448 Instruction *InstCombiner::visitStoreInst(StoreInst &SI) {
9449 Value *Val = SI.getOperand(0);
9450 Value *Ptr = SI.getOperand(1);
9452 if (isa<UndefValue>(Ptr)) { // store X, undef -> noop (even if volatile)
9453 EraseInstFromFunction(SI);
9458 // If the RHS is an alloca with a single use, zapify the store, making the
9460 if (Ptr->hasOneUse()) {
9461 if (isa<AllocaInst>(Ptr)) {
9462 EraseInstFromFunction(SI);
9467 if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Ptr))
9468 if (isa<AllocaInst>(GEP->getOperand(0)) &&
9469 GEP->getOperand(0)->hasOneUse()) {
9470 EraseInstFromFunction(SI);
9476 // Attempt to improve the alignment.
9477 unsigned KnownAlign = GetOrEnforceKnownAlignment(Ptr, TD);
9478 if (KnownAlign > SI.getAlignment())
9479 SI.setAlignment(KnownAlign);
9481 // Do really simple DSE, to catch cases where there are several consequtive
9482 // stores to the same location, separated by a few arithmetic operations. This
9483 // situation often occurs with bitfield accesses.
9484 BasicBlock::iterator BBI = &SI;
9485 for (unsigned ScanInsts = 6; BBI != SI.getParent()->begin() && ScanInsts;
9489 if (StoreInst *PrevSI = dyn_cast<StoreInst>(BBI)) {
9490 // Prev store isn't volatile, and stores to the same location?
9491 if (!PrevSI->isVolatile() && PrevSI->getOperand(1) == SI.getOperand(1)) {
9494 EraseInstFromFunction(*PrevSI);
9500 // If this is a load, we have to stop. However, if the loaded value is from
9501 // the pointer we're loading and is producing the pointer we're storing,
9502 // then *this* store is dead (X = load P; store X -> P).
9503 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) {
9504 if (LI == Val && LI->getOperand(0) == Ptr && !SI.isVolatile()) {
9505 EraseInstFromFunction(SI);
9509 // Otherwise, this is a load from some other location. Stores before it
9514 // Don't skip over loads or things that can modify memory.
9515 if (BBI->mayWriteToMemory())
9520 if (SI.isVolatile()) return 0; // Don't hack volatile stores.
9522 // store X, null -> turns into 'unreachable' in SimplifyCFG
9523 if (isa<ConstantPointerNull>(Ptr)) {
9524 if (!isa<UndefValue>(Val)) {
9525 SI.setOperand(0, UndefValue::get(Val->getType()));
9526 if (Instruction *U = dyn_cast<Instruction>(Val))
9527 AddToWorkList(U); // Dropped a use.
9530 return 0; // Do not modify these!
9533 // store undef, Ptr -> noop
9534 if (isa<UndefValue>(Val)) {
9535 EraseInstFromFunction(SI);
9540 // If the pointer destination is a cast, see if we can fold the cast into the
9542 if (isa<CastInst>(Ptr))
9543 if (Instruction *Res = InstCombineStoreToCast(*this, SI))
9545 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Ptr))
9547 if (Instruction *Res = InstCombineStoreToCast(*this, SI))
9551 // If this store is the last instruction in the basic block, and if the block
9552 // ends with an unconditional branch, try to move it to the successor block.
9554 if (BranchInst *BI = dyn_cast<BranchInst>(BBI))
9555 if (BI->isUnconditional())
9556 if (SimplifyStoreAtEndOfBlock(SI))
9557 return 0; // xform done!
9562 /// SimplifyStoreAtEndOfBlock - Turn things like:
9563 /// if () { *P = v1; } else { *P = v2 }
9564 /// into a phi node with a store in the successor.
9566 /// Simplify things like:
9567 /// *P = v1; if () { *P = v2; }
9568 /// into a phi node with a store in the successor.
9570 bool InstCombiner::SimplifyStoreAtEndOfBlock(StoreInst &SI) {
9571 BasicBlock *StoreBB = SI.getParent();
9573 // Check to see if the successor block has exactly two incoming edges. If
9574 // so, see if the other predecessor contains a store to the same location.
9575 // if so, insert a PHI node (if needed) and move the stores down.
9576 BasicBlock *DestBB = StoreBB->getTerminator()->getSuccessor(0);
9578 // Determine whether Dest has exactly two predecessors and, if so, compute
9579 // the other predecessor.
9580 pred_iterator PI = pred_begin(DestBB);
9581 BasicBlock *OtherBB = 0;
9585 if (PI == pred_end(DestBB))
9588 if (*PI != StoreBB) {
9593 if (++PI != pred_end(DestBB))
9597 // Verify that the other block ends in a branch and is not otherwise empty.
9598 BasicBlock::iterator BBI = OtherBB->getTerminator();
9599 BranchInst *OtherBr = dyn_cast<BranchInst>(BBI);
9600 if (!OtherBr || BBI == OtherBB->begin())
9603 // If the other block ends in an unconditional branch, check for the 'if then
9604 // else' case. there is an instruction before the branch.
9605 StoreInst *OtherStore = 0;
9606 if (OtherBr->isUnconditional()) {
9607 // If this isn't a store, or isn't a store to the same location, bail out.
9609 OtherStore = dyn_cast<StoreInst>(BBI);
9610 if (!OtherStore || OtherStore->getOperand(1) != SI.getOperand(1))
9613 // Otherwise, the other block ended with a conditional branch. If one of the
9614 // destinations is StoreBB, then we have the if/then case.
9615 if (OtherBr->getSuccessor(0) != StoreBB &&
9616 OtherBr->getSuccessor(1) != StoreBB)
9619 // Okay, we know that OtherBr now goes to Dest and StoreBB, so this is an
9620 // if/then triangle. See if there is a store to the same ptr as SI that
9621 // lives in OtherBB.
9623 // Check to see if we find the matching store.
9624 if ((OtherStore = dyn_cast<StoreInst>(BBI))) {
9625 if (OtherStore->getOperand(1) != SI.getOperand(1))
9629 // If we find something that may be using the stored value, or if we run
9630 // out of instructions, we can't do the xform.
9631 if (isa<LoadInst>(BBI) || BBI->mayWriteToMemory() ||
9632 BBI == OtherBB->begin())
9636 // In order to eliminate the store in OtherBr, we have to
9637 // make sure nothing reads the stored value in StoreBB.
9638 for (BasicBlock::iterator I = StoreBB->begin(); &*I != &SI; ++I) {
9639 // FIXME: This should really be AA driven.
9640 if (isa<LoadInst>(I) || I->mayWriteToMemory())
9645 // Insert a PHI node now if we need it.
9646 Value *MergedVal = OtherStore->getOperand(0);
9647 if (MergedVal != SI.getOperand(0)) {
9648 PHINode *PN = new PHINode(MergedVal->getType(), "storemerge");
9649 PN->reserveOperandSpace(2);
9650 PN->addIncoming(SI.getOperand(0), SI.getParent());
9651 PN->addIncoming(OtherStore->getOperand(0), OtherBB);
9652 MergedVal = InsertNewInstBefore(PN, DestBB->front());
9655 // Advance to a place where it is safe to insert the new store and
9657 BBI = DestBB->begin();
9658 while (isa<PHINode>(BBI)) ++BBI;
9659 InsertNewInstBefore(new StoreInst(MergedVal, SI.getOperand(1),
9660 OtherStore->isVolatile()), *BBI);
9662 // Nuke the old stores.
9663 EraseInstFromFunction(SI);
9664 EraseInstFromFunction(*OtherStore);
9670 Instruction *InstCombiner::visitBranchInst(BranchInst &BI) {
9671 // Change br (not X), label True, label False to: br X, label False, True
9673 BasicBlock *TrueDest;
9674 BasicBlock *FalseDest;
9675 if (match(&BI, m_Br(m_Not(m_Value(X)), TrueDest, FalseDest)) &&
9676 !isa<Constant>(X)) {
9677 // Swap Destinations and condition...
9679 BI.setSuccessor(0, FalseDest);
9680 BI.setSuccessor(1, TrueDest);
9684 // Cannonicalize fcmp_one -> fcmp_oeq
9685 FCmpInst::Predicate FPred; Value *Y;
9686 if (match(&BI, m_Br(m_FCmp(FPred, m_Value(X), m_Value(Y)),
9687 TrueDest, FalseDest)))
9688 if ((FPred == FCmpInst::FCMP_ONE || FPred == FCmpInst::FCMP_OLE ||
9689 FPred == FCmpInst::FCMP_OGE) && BI.getCondition()->hasOneUse()) {
9690 FCmpInst *I = cast<FCmpInst>(BI.getCondition());
9691 FCmpInst::Predicate NewPred = FCmpInst::getInversePredicate(FPred);
9692 Instruction *NewSCC = new FCmpInst(NewPred, X, Y, "", I);
9693 NewSCC->takeName(I);
9694 // Swap Destinations and condition...
9695 BI.setCondition(NewSCC);
9696 BI.setSuccessor(0, FalseDest);
9697 BI.setSuccessor(1, TrueDest);
9698 RemoveFromWorkList(I);
9699 I->eraseFromParent();
9700 AddToWorkList(NewSCC);
9704 // Cannonicalize icmp_ne -> icmp_eq
9705 ICmpInst::Predicate IPred;
9706 if (match(&BI, m_Br(m_ICmp(IPred, m_Value(X), m_Value(Y)),
9707 TrueDest, FalseDest)))
9708 if ((IPred == ICmpInst::ICMP_NE || IPred == ICmpInst::ICMP_ULE ||
9709 IPred == ICmpInst::ICMP_SLE || IPred == ICmpInst::ICMP_UGE ||
9710 IPred == ICmpInst::ICMP_SGE) && BI.getCondition()->hasOneUse()) {
9711 ICmpInst *I = cast<ICmpInst>(BI.getCondition());
9712 ICmpInst::Predicate NewPred = ICmpInst::getInversePredicate(IPred);
9713 Instruction *NewSCC = new ICmpInst(NewPred, X, Y, "", I);
9714 NewSCC->takeName(I);
9715 // Swap Destinations and condition...
9716 BI.setCondition(NewSCC);
9717 BI.setSuccessor(0, FalseDest);
9718 BI.setSuccessor(1, TrueDest);
9719 RemoveFromWorkList(I);
9720 I->eraseFromParent();;
9721 AddToWorkList(NewSCC);
9728 Instruction *InstCombiner::visitSwitchInst(SwitchInst &SI) {
9729 Value *Cond = SI.getCondition();
9730 if (Instruction *I = dyn_cast<Instruction>(Cond)) {
9731 if (I->getOpcode() == Instruction::Add)
9732 if (ConstantInt *AddRHS = dyn_cast<ConstantInt>(I->getOperand(1))) {
9733 // change 'switch (X+4) case 1:' into 'switch (X) case -3'
9734 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2)
9735 SI.setOperand(i,ConstantExpr::getSub(cast<Constant>(SI.getOperand(i)),
9737 SI.setOperand(0, I->getOperand(0));
9745 /// CheapToScalarize - Return true if the value is cheaper to scalarize than it
9746 /// is to leave as a vector operation.
9747 static bool CheapToScalarize(Value *V, bool isConstant) {
9748 if (isa<ConstantAggregateZero>(V))
9750 if (ConstantVector *C = dyn_cast<ConstantVector>(V)) {
9751 if (isConstant) return true;
9752 // If all elts are the same, we can extract.
9753 Constant *Op0 = C->getOperand(0);
9754 for (unsigned i = 1; i < C->getNumOperands(); ++i)
9755 if (C->getOperand(i) != Op0)
9759 Instruction *I = dyn_cast<Instruction>(V);
9760 if (!I) return false;
9762 // Insert element gets simplified to the inserted element or is deleted if
9763 // this is constant idx extract element and its a constant idx insertelt.
9764 if (I->getOpcode() == Instruction::InsertElement && isConstant &&
9765 isa<ConstantInt>(I->getOperand(2)))
9767 if (I->getOpcode() == Instruction::Load && I->hasOneUse())
9769 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(I))
9770 if (BO->hasOneUse() &&
9771 (CheapToScalarize(BO->getOperand(0), isConstant) ||
9772 CheapToScalarize(BO->getOperand(1), isConstant)))
9774 if (CmpInst *CI = dyn_cast<CmpInst>(I))
9775 if (CI->hasOneUse() &&
9776 (CheapToScalarize(CI->getOperand(0), isConstant) ||
9777 CheapToScalarize(CI->getOperand(1), isConstant)))
9783 /// Read and decode a shufflevector mask.
9785 /// It turns undef elements into values that are larger than the number of
9786 /// elements in the input.
9787 static std::vector<unsigned> getShuffleMask(const ShuffleVectorInst *SVI) {
9788 unsigned NElts = SVI->getType()->getNumElements();
9789 if (isa<ConstantAggregateZero>(SVI->getOperand(2)))
9790 return std::vector<unsigned>(NElts, 0);
9791 if (isa<UndefValue>(SVI->getOperand(2)))
9792 return std::vector<unsigned>(NElts, 2*NElts);
9794 std::vector<unsigned> Result;
9795 const ConstantVector *CP = cast<ConstantVector>(SVI->getOperand(2));
9796 for (unsigned i = 0, e = CP->getNumOperands(); i != e; ++i)
9797 if (isa<UndefValue>(CP->getOperand(i)))
9798 Result.push_back(NElts*2); // undef -> 8
9800 Result.push_back(cast<ConstantInt>(CP->getOperand(i))->getZExtValue());
9804 /// FindScalarElement - Given a vector and an element number, see if the scalar
9805 /// value is already around as a register, for example if it were inserted then
9806 /// extracted from the vector.
9807 static Value *FindScalarElement(Value *V, unsigned EltNo) {
9808 assert(isa<VectorType>(V->getType()) && "Not looking at a vector?");
9809 const VectorType *PTy = cast<VectorType>(V->getType());
9810 unsigned Width = PTy->getNumElements();
9811 if (EltNo >= Width) // Out of range access.
9812 return UndefValue::get(PTy->getElementType());
9814 if (isa<UndefValue>(V))
9815 return UndefValue::get(PTy->getElementType());
9816 else if (isa<ConstantAggregateZero>(V))
9817 return Constant::getNullValue(PTy->getElementType());
9818 else if (ConstantVector *CP = dyn_cast<ConstantVector>(V))
9819 return CP->getOperand(EltNo);
9820 else if (InsertElementInst *III = dyn_cast<InsertElementInst>(V)) {
9821 // If this is an insert to a variable element, we don't know what it is.
9822 if (!isa<ConstantInt>(III->getOperand(2)))
9824 unsigned IIElt = cast<ConstantInt>(III->getOperand(2))->getZExtValue();
9826 // If this is an insert to the element we are looking for, return the
9829 return III->getOperand(1);
9831 // Otherwise, the insertelement doesn't modify the value, recurse on its
9833 return FindScalarElement(III->getOperand(0), EltNo);
9834 } else if (ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(V)) {
9835 unsigned InEl = getShuffleMask(SVI)[EltNo];
9837 return FindScalarElement(SVI->getOperand(0), InEl);
9838 else if (InEl < Width*2)
9839 return FindScalarElement(SVI->getOperand(1), InEl - Width);
9841 return UndefValue::get(PTy->getElementType());
9844 // Otherwise, we don't know.
9848 Instruction *InstCombiner::visitExtractElementInst(ExtractElementInst &EI) {
9850 // If vector val is undef, replace extract with scalar undef.
9851 if (isa<UndefValue>(EI.getOperand(0)))
9852 return ReplaceInstUsesWith(EI, UndefValue::get(EI.getType()));
9854 // If vector val is constant 0, replace extract with scalar 0.
9855 if (isa<ConstantAggregateZero>(EI.getOperand(0)))
9856 return ReplaceInstUsesWith(EI, Constant::getNullValue(EI.getType()));
9858 if (ConstantVector *C = dyn_cast<ConstantVector>(EI.getOperand(0))) {
9859 // If vector val is constant with uniform operands, replace EI
9860 // with that operand
9861 Constant *op0 = C->getOperand(0);
9862 for (unsigned i = 1; i < C->getNumOperands(); ++i)
9863 if (C->getOperand(i) != op0) {
9868 return ReplaceInstUsesWith(EI, op0);
9871 // If extracting a specified index from the vector, see if we can recursively
9872 // find a previously computed scalar that was inserted into the vector.
9873 if (ConstantInt *IdxC = dyn_cast<ConstantInt>(EI.getOperand(1))) {
9874 unsigned IndexVal = IdxC->getZExtValue();
9875 unsigned VectorWidth =
9876 cast<VectorType>(EI.getOperand(0)->getType())->getNumElements();
9878 // If this is extracting an invalid index, turn this into undef, to avoid
9879 // crashing the code below.
9880 if (IndexVal >= VectorWidth)
9881 return ReplaceInstUsesWith(EI, UndefValue::get(EI.getType()));
9883 // This instruction only demands the single element from the input vector.
9884 // If the input vector has a single use, simplify it based on this use
9886 if (EI.getOperand(0)->hasOneUse() && VectorWidth != 1) {
9888 if (Value *V = SimplifyDemandedVectorElts(EI.getOperand(0),
9891 EI.setOperand(0, V);
9896 if (Value *Elt = FindScalarElement(EI.getOperand(0), IndexVal))
9897 return ReplaceInstUsesWith(EI, Elt);
9899 // If the this extractelement is directly using a bitcast from a vector of
9900 // the same number of elements, see if we can find the source element from
9901 // it. In this case, we will end up needing to bitcast the scalars.
9902 if (BitCastInst *BCI = dyn_cast<BitCastInst>(EI.getOperand(0))) {
9903 if (const VectorType *VT =
9904 dyn_cast<VectorType>(BCI->getOperand(0)->getType()))
9905 if (VT->getNumElements() == VectorWidth)
9906 if (Value *Elt = FindScalarElement(BCI->getOperand(0), IndexVal))
9907 return new BitCastInst(Elt, EI.getType());
9911 if (Instruction *I = dyn_cast<Instruction>(EI.getOperand(0))) {
9912 if (I->hasOneUse()) {
9913 // Push extractelement into predecessor operation if legal and
9914 // profitable to do so
9915 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(I)) {
9916 bool isConstantElt = isa<ConstantInt>(EI.getOperand(1));
9917 if (CheapToScalarize(BO, isConstantElt)) {
9918 ExtractElementInst *newEI0 =
9919 new ExtractElementInst(BO->getOperand(0), EI.getOperand(1),
9920 EI.getName()+".lhs");
9921 ExtractElementInst *newEI1 =
9922 new ExtractElementInst(BO->getOperand(1), EI.getOperand(1),
9923 EI.getName()+".rhs");
9924 InsertNewInstBefore(newEI0, EI);
9925 InsertNewInstBefore(newEI1, EI);
9926 return BinaryOperator::create(BO->getOpcode(), newEI0, newEI1);
9928 } else if (isa<LoadInst>(I)) {
9930 cast<PointerType>(I->getOperand(0)->getType())->getAddressSpace();
9931 Value *Ptr = InsertCastBefore(Instruction::BitCast, I->getOperand(0),
9932 PointerType::get(EI.getType(), AS), EI);
9933 GetElementPtrInst *GEP =
9934 new GetElementPtrInst(Ptr, EI.getOperand(1), I->getName() + ".gep");
9935 InsertNewInstBefore(GEP, EI);
9936 return new LoadInst(GEP);
9939 if (InsertElementInst *IE = dyn_cast<InsertElementInst>(I)) {
9940 // Extracting the inserted element?
9941 if (IE->getOperand(2) == EI.getOperand(1))
9942 return ReplaceInstUsesWith(EI, IE->getOperand(1));
9943 // If the inserted and extracted elements are constants, they must not
9944 // be the same value, extract from the pre-inserted value instead.
9945 if (isa<Constant>(IE->getOperand(2)) &&
9946 isa<Constant>(EI.getOperand(1))) {
9947 AddUsesToWorkList(EI);
9948 EI.setOperand(0, IE->getOperand(0));
9951 } else if (ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(I)) {
9952 // If this is extracting an element from a shufflevector, figure out where
9953 // it came from and extract from the appropriate input element instead.
9954 if (ConstantInt *Elt = dyn_cast<ConstantInt>(EI.getOperand(1))) {
9955 unsigned SrcIdx = getShuffleMask(SVI)[Elt->getZExtValue()];
9957 if (SrcIdx < SVI->getType()->getNumElements())
9958 Src = SVI->getOperand(0);
9959 else if (SrcIdx < SVI->getType()->getNumElements()*2) {
9960 SrcIdx -= SVI->getType()->getNumElements();
9961 Src = SVI->getOperand(1);
9963 return ReplaceInstUsesWith(EI, UndefValue::get(EI.getType()));
9965 return new ExtractElementInst(Src, SrcIdx);
9972 /// CollectSingleShuffleElements - If V is a shuffle of values that ONLY returns
9973 /// elements from either LHS or RHS, return the shuffle mask and true.
9974 /// Otherwise, return false.
9975 static bool CollectSingleShuffleElements(Value *V, Value *LHS, Value *RHS,
9976 std::vector<Constant*> &Mask) {
9977 assert(V->getType() == LHS->getType() && V->getType() == RHS->getType() &&
9978 "Invalid CollectSingleShuffleElements");
9979 unsigned NumElts = cast<VectorType>(V->getType())->getNumElements();
9981 if (isa<UndefValue>(V)) {
9982 Mask.assign(NumElts, UndefValue::get(Type::Int32Ty));
9984 } else if (V == LHS) {
9985 for (unsigned i = 0; i != NumElts; ++i)
9986 Mask.push_back(ConstantInt::get(Type::Int32Ty, i));
9988 } else if (V == RHS) {
9989 for (unsigned i = 0; i != NumElts; ++i)
9990 Mask.push_back(ConstantInt::get(Type::Int32Ty, i+NumElts));
9992 } else if (InsertElementInst *IEI = dyn_cast<InsertElementInst>(V)) {
9993 // If this is an insert of an extract from some other vector, include it.
9994 Value *VecOp = IEI->getOperand(0);
9995 Value *ScalarOp = IEI->getOperand(1);
9996 Value *IdxOp = IEI->getOperand(2);
9998 if (!isa<ConstantInt>(IdxOp))
10000 unsigned InsertedIdx = cast<ConstantInt>(IdxOp)->getZExtValue();
10002 if (isa<UndefValue>(ScalarOp)) { // inserting undef into vector.
10003 // Okay, we can handle this if the vector we are insertinting into is
10004 // transitively ok.
10005 if (CollectSingleShuffleElements(VecOp, LHS, RHS, Mask)) {
10006 // If so, update the mask to reflect the inserted undef.
10007 Mask[InsertedIdx] = UndefValue::get(Type::Int32Ty);
10010 } else if (ExtractElementInst *EI = dyn_cast<ExtractElementInst>(ScalarOp)){
10011 if (isa<ConstantInt>(EI->getOperand(1)) &&
10012 EI->getOperand(0)->getType() == V->getType()) {
10013 unsigned ExtractedIdx =
10014 cast<ConstantInt>(EI->getOperand(1))->getZExtValue();
10016 // This must be extracting from either LHS or RHS.
10017 if (EI->getOperand(0) == LHS || EI->getOperand(0) == RHS) {
10018 // Okay, we can handle this if the vector we are insertinting into is
10019 // transitively ok.
10020 if (CollectSingleShuffleElements(VecOp, LHS, RHS, Mask)) {
10021 // If so, update the mask to reflect the inserted value.
10022 if (EI->getOperand(0) == LHS) {
10023 Mask[InsertedIdx & (NumElts-1)] =
10024 ConstantInt::get(Type::Int32Ty, ExtractedIdx);
10026 assert(EI->getOperand(0) == RHS);
10027 Mask[InsertedIdx & (NumElts-1)] =
10028 ConstantInt::get(Type::Int32Ty, ExtractedIdx+NumElts);
10037 // TODO: Handle shufflevector here!
10042 /// CollectShuffleElements - We are building a shuffle of V, using RHS as the
10043 /// RHS of the shuffle instruction, if it is not null. Return a shuffle mask
10044 /// that computes V and the LHS value of the shuffle.
10045 static Value *CollectShuffleElements(Value *V, std::vector<Constant*> &Mask,
10047 assert(isa<VectorType>(V->getType()) &&
10048 (RHS == 0 || V->getType() == RHS->getType()) &&
10049 "Invalid shuffle!");
10050 unsigned NumElts = cast<VectorType>(V->getType())->getNumElements();
10052 if (isa<UndefValue>(V)) {
10053 Mask.assign(NumElts, UndefValue::get(Type::Int32Ty));
10055 } else if (isa<ConstantAggregateZero>(V)) {
10056 Mask.assign(NumElts, ConstantInt::get(Type::Int32Ty, 0));
10058 } else if (InsertElementInst *IEI = dyn_cast<InsertElementInst>(V)) {
10059 // If this is an insert of an extract from some other vector, include it.
10060 Value *VecOp = IEI->getOperand(0);
10061 Value *ScalarOp = IEI->getOperand(1);
10062 Value *IdxOp = IEI->getOperand(2);
10064 if (ExtractElementInst *EI = dyn_cast<ExtractElementInst>(ScalarOp)) {
10065 if (isa<ConstantInt>(EI->getOperand(1)) && isa<ConstantInt>(IdxOp) &&
10066 EI->getOperand(0)->getType() == V->getType()) {
10067 unsigned ExtractedIdx =
10068 cast<ConstantInt>(EI->getOperand(1))->getZExtValue();
10069 unsigned InsertedIdx = cast<ConstantInt>(IdxOp)->getZExtValue();
10071 // Either the extracted from or inserted into vector must be RHSVec,
10072 // otherwise we'd end up with a shuffle of three inputs.
10073 if (EI->getOperand(0) == RHS || RHS == 0) {
10074 RHS = EI->getOperand(0);
10075 Value *V = CollectShuffleElements(VecOp, Mask, RHS);
10076 Mask[InsertedIdx & (NumElts-1)] =
10077 ConstantInt::get(Type::Int32Ty, NumElts+ExtractedIdx);
10081 if (VecOp == RHS) {
10082 Value *V = CollectShuffleElements(EI->getOperand(0), Mask, RHS);
10083 // Everything but the extracted element is replaced with the RHS.
10084 for (unsigned i = 0; i != NumElts; ++i) {
10085 if (i != InsertedIdx)
10086 Mask[i] = ConstantInt::get(Type::Int32Ty, NumElts+i);
10091 // If this insertelement is a chain that comes from exactly these two
10092 // vectors, return the vector and the effective shuffle.
10093 if (CollectSingleShuffleElements(IEI, EI->getOperand(0), RHS, Mask))
10094 return EI->getOperand(0);
10099 // TODO: Handle shufflevector here!
10101 // Otherwise, can't do anything fancy. Return an identity vector.
10102 for (unsigned i = 0; i != NumElts; ++i)
10103 Mask.push_back(ConstantInt::get(Type::Int32Ty, i));
10107 Instruction *InstCombiner::visitInsertElementInst(InsertElementInst &IE) {
10108 Value *VecOp = IE.getOperand(0);
10109 Value *ScalarOp = IE.getOperand(1);
10110 Value *IdxOp = IE.getOperand(2);
10112 // Inserting an undef or into an undefined place, remove this.
10113 if (isa<UndefValue>(ScalarOp) || isa<UndefValue>(IdxOp))
10114 ReplaceInstUsesWith(IE, VecOp);
10116 // If the inserted element was extracted from some other vector, and if the
10117 // indexes are constant, try to turn this into a shufflevector operation.
10118 if (ExtractElementInst *EI = dyn_cast<ExtractElementInst>(ScalarOp)) {
10119 if (isa<ConstantInt>(EI->getOperand(1)) && isa<ConstantInt>(IdxOp) &&
10120 EI->getOperand(0)->getType() == IE.getType()) {
10121 unsigned NumVectorElts = IE.getType()->getNumElements();
10122 unsigned ExtractedIdx =
10123 cast<ConstantInt>(EI->getOperand(1))->getZExtValue();
10124 unsigned InsertedIdx = cast<ConstantInt>(IdxOp)->getZExtValue();
10126 if (ExtractedIdx >= NumVectorElts) // Out of range extract.
10127 return ReplaceInstUsesWith(IE, VecOp);
10129 if (InsertedIdx >= NumVectorElts) // Out of range insert.
10130 return ReplaceInstUsesWith(IE, UndefValue::get(IE.getType()));
10132 // If we are extracting a value from a vector, then inserting it right
10133 // back into the same place, just use the input vector.
10134 if (EI->getOperand(0) == VecOp && ExtractedIdx == InsertedIdx)
10135 return ReplaceInstUsesWith(IE, VecOp);
10137 // We could theoretically do this for ANY input. However, doing so could
10138 // turn chains of insertelement instructions into a chain of shufflevector
10139 // instructions, and right now we do not merge shufflevectors. As such,
10140 // only do this in a situation where it is clear that there is benefit.
10141 if (isa<UndefValue>(VecOp) || isa<ConstantAggregateZero>(VecOp)) {
10142 // Turn this into shuffle(EIOp0, VecOp, Mask). The result has all of
10143 // the values of VecOp, except then one read from EIOp0.
10144 // Build a new shuffle mask.
10145 std::vector<Constant*> Mask;
10146 if (isa<UndefValue>(VecOp))
10147 Mask.assign(NumVectorElts, UndefValue::get(Type::Int32Ty));
10149 assert(isa<ConstantAggregateZero>(VecOp) && "Unknown thing");
10150 Mask.assign(NumVectorElts, ConstantInt::get(Type::Int32Ty,
10153 Mask[InsertedIdx] = ConstantInt::get(Type::Int32Ty, ExtractedIdx);
10154 return new ShuffleVectorInst(EI->getOperand(0), VecOp,
10155 ConstantVector::get(Mask));
10158 // If this insertelement isn't used by some other insertelement, turn it
10159 // (and any insertelements it points to), into one big shuffle.
10160 if (!IE.hasOneUse() || !isa<InsertElementInst>(IE.use_back())) {
10161 std::vector<Constant*> Mask;
10163 Value *LHS = CollectShuffleElements(&IE, Mask, RHS);
10164 if (RHS == 0) RHS = UndefValue::get(LHS->getType());
10165 // We now have a shuffle of LHS, RHS, Mask.
10166 return new ShuffleVectorInst(LHS, RHS, ConstantVector::get(Mask));
10175 Instruction *InstCombiner::visitShuffleVectorInst(ShuffleVectorInst &SVI) {
10176 Value *LHS = SVI.getOperand(0);
10177 Value *RHS = SVI.getOperand(1);
10178 std::vector<unsigned> Mask = getShuffleMask(&SVI);
10180 bool MadeChange = false;
10182 // Undefined shuffle mask -> undefined value.
10183 if (isa<UndefValue>(SVI.getOperand(2)))
10184 return ReplaceInstUsesWith(SVI, UndefValue::get(SVI.getType()));
10186 // If we have shuffle(x, undef, mask) and any elements of mask refer to
10187 // the undef, change them to undefs.
10188 if (isa<UndefValue>(SVI.getOperand(1))) {
10189 // Scan to see if there are any references to the RHS. If so, replace them
10190 // with undef element refs and set MadeChange to true.
10191 for (unsigned i = 0, e = Mask.size(); i != e; ++i) {
10192 if (Mask[i] >= e && Mask[i] != 2*e) {
10199 // Remap any references to RHS to use LHS.
10200 std::vector<Constant*> Elts;
10201 for (unsigned i = 0, e = Mask.size(); i != e; ++i) {
10202 if (Mask[i] == 2*e)
10203 Elts.push_back(UndefValue::get(Type::Int32Ty));
10205 Elts.push_back(ConstantInt::get(Type::Int32Ty, Mask[i]));
10207 SVI.setOperand(2, ConstantVector::get(Elts));
10211 // Canonicalize shuffle(x ,x,mask) -> shuffle(x, undef,mask')
10212 // Canonicalize shuffle(undef,x,mask) -> shuffle(x, undef,mask').
10213 if (LHS == RHS || isa<UndefValue>(LHS)) {
10214 if (isa<UndefValue>(LHS) && LHS == RHS) {
10215 // shuffle(undef,undef,mask) -> undef.
10216 return ReplaceInstUsesWith(SVI, LHS);
10219 // Remap any references to RHS to use LHS.
10220 std::vector<Constant*> Elts;
10221 for (unsigned i = 0, e = Mask.size(); i != e; ++i) {
10222 if (Mask[i] >= 2*e)
10223 Elts.push_back(UndefValue::get(Type::Int32Ty));
10225 if ((Mask[i] >= e && isa<UndefValue>(RHS)) ||
10226 (Mask[i] < e && isa<UndefValue>(LHS)))
10227 Mask[i] = 2*e; // Turn into undef.
10229 Mask[i] &= (e-1); // Force to LHS.
10230 Elts.push_back(ConstantInt::get(Type::Int32Ty, Mask[i]));
10233 SVI.setOperand(0, SVI.getOperand(1));
10234 SVI.setOperand(1, UndefValue::get(RHS->getType()));
10235 SVI.setOperand(2, ConstantVector::get(Elts));
10236 LHS = SVI.getOperand(0);
10237 RHS = SVI.getOperand(1);
10241 // Analyze the shuffle, are the LHS or RHS and identity shuffles?
10242 bool isLHSID = true, isRHSID = true;
10244 for (unsigned i = 0, e = Mask.size(); i != e; ++i) {
10245 if (Mask[i] >= e*2) continue; // Ignore undef values.
10246 // Is this an identity shuffle of the LHS value?
10247 isLHSID &= (Mask[i] == i);
10249 // Is this an identity shuffle of the RHS value?
10250 isRHSID &= (Mask[i]-e == i);
10253 // Eliminate identity shuffles.
10254 if (isLHSID) return ReplaceInstUsesWith(SVI, LHS);
10255 if (isRHSID) return ReplaceInstUsesWith(SVI, RHS);
10257 // If the LHS is a shufflevector itself, see if we can combine it with this
10258 // one without producing an unusual shuffle. Here we are really conservative:
10259 // we are absolutely afraid of producing a shuffle mask not in the input
10260 // program, because the code gen may not be smart enough to turn a merged
10261 // shuffle into two specific shuffles: it may produce worse code. As such,
10262 // we only merge two shuffles if the result is one of the two input shuffle
10263 // masks. In this case, merging the shuffles just removes one instruction,
10264 // which we know is safe. This is good for things like turning:
10265 // (splat(splat)) -> splat.
10266 if (ShuffleVectorInst *LHSSVI = dyn_cast<ShuffleVectorInst>(LHS)) {
10267 if (isa<UndefValue>(RHS)) {
10268 std::vector<unsigned> LHSMask = getShuffleMask(LHSSVI);
10270 std::vector<unsigned> NewMask;
10271 for (unsigned i = 0, e = Mask.size(); i != e; ++i)
10272 if (Mask[i] >= 2*e)
10273 NewMask.push_back(2*e);
10275 NewMask.push_back(LHSMask[Mask[i]]);
10277 // If the result mask is equal to the src shuffle or this shuffle mask, do
10278 // the replacement.
10279 if (NewMask == LHSMask || NewMask == Mask) {
10280 std::vector<Constant*> Elts;
10281 for (unsigned i = 0, e = NewMask.size(); i != e; ++i) {
10282 if (NewMask[i] >= e*2) {
10283 Elts.push_back(UndefValue::get(Type::Int32Ty));
10285 Elts.push_back(ConstantInt::get(Type::Int32Ty, NewMask[i]));
10288 return new ShuffleVectorInst(LHSSVI->getOperand(0),
10289 LHSSVI->getOperand(1),
10290 ConstantVector::get(Elts));
10295 return MadeChange ? &SVI : 0;
10301 /// TryToSinkInstruction - Try to move the specified instruction from its
10302 /// current block into the beginning of DestBlock, which can only happen if it's
10303 /// safe to move the instruction past all of the instructions between it and the
10304 /// end of its block.
10305 static bool TryToSinkInstruction(Instruction *I, BasicBlock *DestBlock) {
10306 assert(I->hasOneUse() && "Invariants didn't hold!");
10308 // Cannot move control-flow-involving, volatile loads, vaarg, etc.
10309 if (isa<PHINode>(I) || I->mayWriteToMemory()) return false;
10311 // Do not sink alloca instructions out of the entry block.
10312 if (isa<AllocaInst>(I) && I->getParent() ==
10313 &DestBlock->getParent()->getEntryBlock())
10316 // We can only sink load instructions if there is nothing between the load and
10317 // the end of block that could change the value.
10318 if (LoadInst *LI = dyn_cast<LoadInst>(I)) {
10319 for (BasicBlock::iterator Scan = LI, E = LI->getParent()->end();
10321 if (Scan->mayWriteToMemory())
10325 BasicBlock::iterator InsertPos = DestBlock->begin();
10326 while (isa<PHINode>(InsertPos)) ++InsertPos;
10328 I->moveBefore(InsertPos);
10334 /// AddReachableCodeToWorklist - Walk the function in depth-first order, adding
10335 /// all reachable code to the worklist.
10337 /// This has a couple of tricks to make the code faster and more powerful. In
10338 /// particular, we constant fold and DCE instructions as we go, to avoid adding
10339 /// them to the worklist (this significantly speeds up instcombine on code where
10340 /// many instructions are dead or constant). Additionally, if we find a branch
10341 /// whose condition is a known constant, we only visit the reachable successors.
10343 static void AddReachableCodeToWorklist(BasicBlock *BB,
10344 SmallPtrSet<BasicBlock*, 64> &Visited,
10346 const TargetData *TD) {
10347 std::vector<BasicBlock*> Worklist;
10348 Worklist.push_back(BB);
10350 while (!Worklist.empty()) {
10351 BB = Worklist.back();
10352 Worklist.pop_back();
10354 // We have now visited this block! If we've already been here, ignore it.
10355 if (!Visited.insert(BB)) continue;
10357 for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E; ) {
10358 Instruction *Inst = BBI++;
10360 // DCE instruction if trivially dead.
10361 if (isInstructionTriviallyDead(Inst)) {
10363 DOUT << "IC: DCE: " << *Inst;
10364 Inst->eraseFromParent();
10368 // ConstantProp instruction if trivially constant.
10369 if (Constant *C = ConstantFoldInstruction(Inst, TD)) {
10370 DOUT << "IC: ConstFold to: " << *C << " from: " << *Inst;
10371 Inst->replaceAllUsesWith(C);
10373 Inst->eraseFromParent();
10377 IC.AddToWorkList(Inst);
10380 // Recursively visit successors. If this is a branch or switch on a
10381 // constant, only visit the reachable successor.
10382 TerminatorInst *TI = BB->getTerminator();
10383 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
10384 if (BI->isConditional() && isa<ConstantInt>(BI->getCondition())) {
10385 bool CondVal = cast<ConstantInt>(BI->getCondition())->getZExtValue();
10386 Worklist.push_back(BI->getSuccessor(!CondVal));
10389 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) {
10390 if (ConstantInt *Cond = dyn_cast<ConstantInt>(SI->getCondition())) {
10391 // See if this is an explicit destination.
10392 for (unsigned i = 1, e = SI->getNumSuccessors(); i != e; ++i)
10393 if (SI->getCaseValue(i) == Cond) {
10394 Worklist.push_back(SI->getSuccessor(i));
10398 // Otherwise it is the default destination.
10399 Worklist.push_back(SI->getSuccessor(0));
10404 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
10405 Worklist.push_back(TI->getSuccessor(i));
10409 bool InstCombiner::DoOneIteration(Function &F, unsigned Iteration) {
10410 bool Changed = false;
10411 TD = &getAnalysis<TargetData>();
10413 DEBUG(DOUT << "\n\nINSTCOMBINE ITERATION #" << Iteration << " on "
10414 << F.getNameStr() << "\n");
10417 // Do a depth-first traversal of the function, populate the worklist with
10418 // the reachable instructions. Ignore blocks that are not reachable. Keep
10419 // track of which blocks we visit.
10420 SmallPtrSet<BasicBlock*, 64> Visited;
10421 AddReachableCodeToWorklist(F.begin(), Visited, *this, TD);
10423 // Do a quick scan over the function. If we find any blocks that are
10424 // unreachable, remove any instructions inside of them. This prevents
10425 // the instcombine code from having to deal with some bad special cases.
10426 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
10427 if (!Visited.count(BB)) {
10428 Instruction *Term = BB->getTerminator();
10429 while (Term != BB->begin()) { // Remove instrs bottom-up
10430 BasicBlock::iterator I = Term; --I;
10432 DOUT << "IC: DCE: " << *I;
10435 if (!I->use_empty())
10436 I->replaceAllUsesWith(UndefValue::get(I->getType()));
10437 I->eraseFromParent();
10442 while (!Worklist.empty()) {
10443 Instruction *I = RemoveOneFromWorkList();
10444 if (I == 0) continue; // skip null values.
10446 // Check to see if we can DCE the instruction.
10447 if (isInstructionTriviallyDead(I)) {
10448 // Add operands to the worklist.
10449 if (I->getNumOperands() < 4)
10450 AddUsesToWorkList(*I);
10453 DOUT << "IC: DCE: " << *I;
10455 I->eraseFromParent();
10456 RemoveFromWorkList(I);
10460 // Instruction isn't dead, see if we can constant propagate it.
10461 if (Constant *C = ConstantFoldInstruction(I, TD)) {
10462 DOUT << "IC: ConstFold to: " << *C << " from: " << *I;
10464 // Add operands to the worklist.
10465 AddUsesToWorkList(*I);
10466 ReplaceInstUsesWith(*I, C);
10469 I->eraseFromParent();
10470 RemoveFromWorkList(I);
10474 // See if we can trivially sink this instruction to a successor basic block.
10475 if (I->hasOneUse()) {
10476 BasicBlock *BB = I->getParent();
10477 BasicBlock *UserParent = cast<Instruction>(I->use_back())->getParent();
10478 if (UserParent != BB) {
10479 bool UserIsSuccessor = false;
10480 // See if the user is one of our successors.
10481 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI)
10482 if (*SI == UserParent) {
10483 UserIsSuccessor = true;
10487 // If the user is one of our immediate successors, and if that successor
10488 // only has us as a predecessors (we'd have to split the critical edge
10489 // otherwise), we can keep going.
10490 if (UserIsSuccessor && !isa<PHINode>(I->use_back()) &&
10491 next(pred_begin(UserParent)) == pred_end(UserParent))
10492 // Okay, the CFG is simple enough, try to sink this instruction.
10493 Changed |= TryToSinkInstruction(I, UserParent);
10497 // Now that we have an instruction, try combining it to simplify it...
10501 DEBUG(std::ostringstream SS; I->print(SS); OrigI = SS.str(););
10502 if (Instruction *Result = visit(*I)) {
10504 // Should we replace the old instruction with a new one?
10506 DOUT << "IC: Old = " << *I
10507 << " New = " << *Result;
10509 // Everything uses the new instruction now.
10510 I->replaceAllUsesWith(Result);
10512 // Push the new instruction and any users onto the worklist.
10513 AddToWorkList(Result);
10514 AddUsersToWorkList(*Result);
10516 // Move the name to the new instruction first.
10517 Result->takeName(I);
10519 // Insert the new instruction into the basic block...
10520 BasicBlock *InstParent = I->getParent();
10521 BasicBlock::iterator InsertPos = I;
10523 if (!isa<PHINode>(Result)) // If combining a PHI, don't insert
10524 while (isa<PHINode>(InsertPos)) // middle of a block of PHIs.
10527 InstParent->getInstList().insert(InsertPos, Result);
10529 // Make sure that we reprocess all operands now that we reduced their
10531 AddUsesToWorkList(*I);
10533 // Instructions can end up on the worklist more than once. Make sure
10534 // we do not process an instruction that has been deleted.
10535 RemoveFromWorkList(I);
10537 // Erase the old instruction.
10538 InstParent->getInstList().erase(I);
10541 DOUT << "IC: Mod = " << OrigI
10542 << " New = " << *I;
10545 // If the instruction was modified, it's possible that it is now dead.
10546 // if so, remove it.
10547 if (isInstructionTriviallyDead(I)) {
10548 // Make sure we process all operands now that we are reducing their
10550 AddUsesToWorkList(*I);
10552 // Instructions may end up in the worklist more than once. Erase all
10553 // occurrences of this instruction.
10554 RemoveFromWorkList(I);
10555 I->eraseFromParent();
10558 AddUsersToWorkList(*I);
10565 assert(WorklistMap.empty() && "Worklist empty, but map not?");
10567 // Do an explicit clear, this shrinks the map if needed.
10568 WorklistMap.clear();
10573 bool InstCombiner::runOnFunction(Function &F) {
10574 MustPreserveLCSSA = mustPreserveAnalysisID(LCSSAID);
10576 bool EverMadeChange = false;
10578 // Iterate while there is work to do.
10579 unsigned Iteration = 0;
10580 while (DoOneIteration(F, Iteration++))
10581 EverMadeChange = true;
10582 return EverMadeChange;
10585 FunctionPass *llvm::createInstructionCombiningPass() {
10586 return new InstCombiner();