1 //===- InstructionCombining.cpp - Combine multiple instructions -----------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // InstructionCombining - Combine instructions to form fewer, simple
11 // instructions. This pass does not modify the CFG. This pass is where
12 // algebraic simplification happens.
14 // This pass combines things like:
20 // This is a simple worklist driven algorithm.
22 // This pass guarantees that the following canonicalizations are performed on
24 // 1. If a binary operator has a constant operand, it is moved to the RHS
25 // 2. Bitwise operators with constant operands are always grouped so that
26 // shifts are performed first, then or's, then and's, then xor's.
27 // 3. Compare instructions are converted from <,>,<=,>= to ==,!= if possible
28 // 4. All cmp instructions on boolean values are replaced with logical ops
29 // 5. add X, X is represented as (X*2) => (X << 1)
30 // 6. Multiplies with a power-of-two constant argument are transformed into
34 //===----------------------------------------------------------------------===//
36 #define DEBUG_TYPE "instcombine"
37 #include "llvm/Transforms/Scalar.h"
38 #include "llvm/IntrinsicInst.h"
39 #include "llvm/Pass.h"
40 #include "llvm/DerivedTypes.h"
41 #include "llvm/GlobalVariable.h"
42 #include "llvm/Analysis/ConstantFolding.h"
43 #include "llvm/Analysis/ValueTracking.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/ConstantRange.h"
49 #include "llvm/Support/Debug.h"
50 #include "llvm/Support/GetElementPtrTypeIterator.h"
51 #include "llvm/Support/InstVisitor.h"
52 #include "llvm/Support/MathExtras.h"
53 #include "llvm/Support/PatternMatch.h"
54 #include "llvm/Support/Compiler.h"
55 #include "llvm/ADT/DenseMap.h"
56 #include "llvm/ADT/SmallVector.h"
57 #include "llvm/ADT/SmallPtrSet.h"
58 #include "llvm/ADT/Statistic.h"
59 #include "llvm/ADT/STLExtras.h"
64 using namespace llvm::PatternMatch;
66 STATISTIC(NumCombined , "Number of insts combined");
67 STATISTIC(NumConstProp, "Number of constant folds");
68 STATISTIC(NumDeadInst , "Number of dead inst eliminated");
69 STATISTIC(NumDeadStore, "Number of dead stores eliminated");
70 STATISTIC(NumSunkInst , "Number of instructions sunk");
73 class VISIBILITY_HIDDEN InstCombiner
74 : public FunctionPass,
75 public InstVisitor<InstCombiner, Instruction*> {
76 // Worklist of all of the instructions that need to be simplified.
77 SmallVector<Instruction*, 256> Worklist;
78 DenseMap<Instruction*, unsigned> WorklistMap;
80 bool MustPreserveLCSSA;
82 static char ID; // Pass identification, replacement for typeid
83 InstCombiner() : FunctionPass(&ID) {}
85 /// AddToWorkList - Add the specified instruction to the worklist if it
86 /// isn't already in it.
87 void AddToWorkList(Instruction *I) {
88 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second)
89 Worklist.push_back(I);
92 // RemoveFromWorkList - remove I from the worklist if it exists.
93 void RemoveFromWorkList(Instruction *I) {
94 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
95 if (It == WorklistMap.end()) return; // Not in worklist.
97 // Don't bother moving everything down, just null out the slot.
98 Worklist[It->second] = 0;
100 WorklistMap.erase(It);
103 Instruction *RemoveOneFromWorkList() {
104 Instruction *I = Worklist.back();
106 WorklistMap.erase(I);
111 /// AddUsersToWorkList - When an instruction is simplified, add all users of
112 /// the instruction to the work lists because they might get more simplified
115 void AddUsersToWorkList(Value &I) {
116 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
118 AddToWorkList(cast<Instruction>(*UI));
121 /// AddUsesToWorkList - When an instruction is simplified, add operands to
122 /// the work lists because they might get more simplified now.
124 void AddUsesToWorkList(Instruction &I) {
125 for (User::op_iterator i = I.op_begin(), e = I.op_end(); i != e; ++i)
126 if (Instruction *Op = dyn_cast<Instruction>(*i))
130 /// AddSoonDeadInstToWorklist - The specified instruction is about to become
131 /// dead. Add all of its operands to the worklist, turning them into
132 /// undef's to reduce the number of uses of those instructions.
134 /// Return the specified operand before it is turned into an undef.
136 Value *AddSoonDeadInstToWorklist(Instruction &I, unsigned op) {
137 Value *R = I.getOperand(op);
139 for (User::op_iterator i = I.op_begin(), e = I.op_end(); i != e; ++i)
140 if (Instruction *Op = dyn_cast<Instruction>(*i)) {
142 // Set the operand to undef to drop the use.
143 *i = UndefValue::get(Op->getType());
150 virtual bool runOnFunction(Function &F);
152 bool DoOneIteration(Function &F, unsigned ItNum);
154 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
155 AU.addRequired<TargetData>();
156 AU.addPreservedID(LCSSAID);
157 AU.setPreservesCFG();
160 TargetData &getTargetData() const { return *TD; }
162 // Visitation implementation - Implement instruction combining for different
163 // instruction types. The semantics are as follows:
165 // null - No change was made
166 // I - Change was made, I is still valid, I may be dead though
167 // otherwise - Change was made, replace I with returned instruction
169 Instruction *visitAdd(BinaryOperator &I);
170 Instruction *visitSub(BinaryOperator &I);
171 Instruction *visitMul(BinaryOperator &I);
172 Instruction *visitURem(BinaryOperator &I);
173 Instruction *visitSRem(BinaryOperator &I);
174 Instruction *visitFRem(BinaryOperator &I);
175 bool SimplifyDivRemOfSelect(BinaryOperator &I);
176 Instruction *commonRemTransforms(BinaryOperator &I);
177 Instruction *commonIRemTransforms(BinaryOperator &I);
178 Instruction *commonDivTransforms(BinaryOperator &I);
179 Instruction *commonIDivTransforms(BinaryOperator &I);
180 Instruction *visitUDiv(BinaryOperator &I);
181 Instruction *visitSDiv(BinaryOperator &I);
182 Instruction *visitFDiv(BinaryOperator &I);
183 Instruction *FoldAndOfICmps(Instruction &I, ICmpInst *LHS, ICmpInst *RHS);
184 Instruction *visitAnd(BinaryOperator &I);
185 Instruction *FoldOrOfICmps(Instruction &I, ICmpInst *LHS, ICmpInst *RHS);
186 Instruction *FoldOrWithConstants(BinaryOperator &I, Value *Op,
187 Value *A, Value *B, Value *C);
188 Instruction *visitOr (BinaryOperator &I);
189 Instruction *visitXor(BinaryOperator &I);
190 Instruction *visitShl(BinaryOperator &I);
191 Instruction *visitAShr(BinaryOperator &I);
192 Instruction *visitLShr(BinaryOperator &I);
193 Instruction *commonShiftTransforms(BinaryOperator &I);
194 Instruction *FoldFCmp_IntToFP_Cst(FCmpInst &I, Instruction *LHSI,
196 Instruction *visitFCmpInst(FCmpInst &I);
197 Instruction *visitICmpInst(ICmpInst &I);
198 Instruction *visitICmpInstWithCastAndCast(ICmpInst &ICI);
199 Instruction *visitICmpInstWithInstAndIntCst(ICmpInst &ICI,
202 Instruction *FoldICmpDivCst(ICmpInst &ICI, BinaryOperator *DivI,
203 ConstantInt *DivRHS);
205 Instruction *FoldGEPICmp(User *GEPLHS, Value *RHS,
206 ICmpInst::Predicate Cond, Instruction &I);
207 Instruction *FoldShiftByConstant(Value *Op0, ConstantInt *Op1,
209 Instruction *commonCastTransforms(CastInst &CI);
210 Instruction *commonIntCastTransforms(CastInst &CI);
211 Instruction *commonPointerCastTransforms(CastInst &CI);
212 Instruction *visitTrunc(TruncInst &CI);
213 Instruction *visitZExt(ZExtInst &CI);
214 Instruction *visitSExt(SExtInst &CI);
215 Instruction *visitFPTrunc(FPTruncInst &CI);
216 Instruction *visitFPExt(CastInst &CI);
217 Instruction *visitFPToUI(FPToUIInst &FI);
218 Instruction *visitFPToSI(FPToSIInst &FI);
219 Instruction *visitUIToFP(CastInst &CI);
220 Instruction *visitSIToFP(CastInst &CI);
221 Instruction *visitPtrToInt(CastInst &CI);
222 Instruction *visitIntToPtr(IntToPtrInst &CI);
223 Instruction *visitBitCast(BitCastInst &CI);
224 Instruction *FoldSelectOpOp(SelectInst &SI, Instruction *TI,
226 Instruction *visitSelectInst(SelectInst &SI);
227 Instruction *visitSelectInstWithICmp(SelectInst &SI, ICmpInst *ICI);
228 Instruction *visitCallInst(CallInst &CI);
229 Instruction *visitInvokeInst(InvokeInst &II);
230 Instruction *visitPHINode(PHINode &PN);
231 Instruction *visitGetElementPtrInst(GetElementPtrInst &GEP);
232 Instruction *visitAllocationInst(AllocationInst &AI);
233 Instruction *visitFreeInst(FreeInst &FI);
234 Instruction *visitLoadInst(LoadInst &LI);
235 Instruction *visitStoreInst(StoreInst &SI);
236 Instruction *visitBranchInst(BranchInst &BI);
237 Instruction *visitSwitchInst(SwitchInst &SI);
238 Instruction *visitInsertElementInst(InsertElementInst &IE);
239 Instruction *visitExtractElementInst(ExtractElementInst &EI);
240 Instruction *visitShuffleVectorInst(ShuffleVectorInst &SVI);
241 Instruction *visitExtractValueInst(ExtractValueInst &EV);
243 // visitInstruction - Specify what to return for unhandled instructions...
244 Instruction *visitInstruction(Instruction &I) { return 0; }
247 Instruction *visitCallSite(CallSite CS);
248 bool transformConstExprCastCall(CallSite CS);
249 Instruction *transformCallThroughTrampoline(CallSite CS);
250 Instruction *transformZExtICmp(ICmpInst *ICI, Instruction &CI,
251 bool DoXform = true);
252 bool WillNotOverflowSignedAdd(Value *LHS, Value *RHS);
255 // InsertNewInstBefore - insert an instruction New before instruction Old
256 // in the program. Add the new instruction to the worklist.
258 Instruction *InsertNewInstBefore(Instruction *New, Instruction &Old) {
259 assert(New && New->getParent() == 0 &&
260 "New instruction already inserted into a basic block!");
261 BasicBlock *BB = Old.getParent();
262 BB->getInstList().insert(&Old, New); // Insert inst
267 /// InsertCastBefore - Insert a cast of V to TY before the instruction POS.
268 /// This also adds the cast to the worklist. Finally, this returns the
270 Value *InsertCastBefore(Instruction::CastOps opc, Value *V, const Type *Ty,
272 if (V->getType() == Ty) return V;
274 if (Constant *CV = dyn_cast<Constant>(V))
275 return ConstantExpr::getCast(opc, CV, Ty);
277 Instruction *C = CastInst::Create(opc, V, Ty, V->getName(), &Pos);
282 Value *InsertBitCastBefore(Value *V, const Type *Ty, Instruction &Pos) {
283 return InsertCastBefore(Instruction::BitCast, V, Ty, Pos);
287 // ReplaceInstUsesWith - This method is to be used when an instruction is
288 // found to be dead, replacable with another preexisting expression. Here
289 // we add all uses of I to the worklist, replace all uses of I with the new
290 // value, then return I, so that the inst combiner will know that I was
293 Instruction *ReplaceInstUsesWith(Instruction &I, Value *V) {
294 AddUsersToWorkList(I); // Add all modified instrs to worklist
296 I.replaceAllUsesWith(V);
299 // If we are replacing the instruction with itself, this must be in a
300 // segment of unreachable code, so just clobber the instruction.
301 I.replaceAllUsesWith(UndefValue::get(I.getType()));
306 // UpdateValueUsesWith - This method is to be used when an value is
307 // found to be replacable with another preexisting expression or was
308 // updated. Here we add all uses of I to the worklist, replace all uses of
309 // I with the new value (unless the instruction was just updated), then
310 // return true, so that the inst combiner will know that I was modified.
312 bool UpdateValueUsesWith(Value *Old, Value *New) {
313 AddUsersToWorkList(*Old); // Add all modified instrs to worklist
315 Old->replaceAllUsesWith(New);
316 if (Instruction *I = dyn_cast<Instruction>(Old))
318 if (Instruction *I = dyn_cast<Instruction>(New))
323 // EraseInstFromFunction - When dealing with an instruction that has side
324 // effects or produces a void value, we can't rely on DCE to delete the
325 // instruction. Instead, visit methods should return the value returned by
327 Instruction *EraseInstFromFunction(Instruction &I) {
328 assert(I.use_empty() && "Cannot erase instruction that is used!");
329 AddUsesToWorkList(I);
330 RemoveFromWorkList(&I);
332 return 0; // Don't do anything with FI
335 void ComputeMaskedBits(Value *V, const APInt &Mask, APInt &KnownZero,
336 APInt &KnownOne, unsigned Depth = 0) const {
337 return llvm::ComputeMaskedBits(V, Mask, KnownZero, KnownOne, TD, Depth);
340 bool MaskedValueIsZero(Value *V, const APInt &Mask,
341 unsigned Depth = 0) const {
342 return llvm::MaskedValueIsZero(V, Mask, TD, Depth);
344 unsigned ComputeNumSignBits(Value *Op, unsigned Depth = 0) const {
345 return llvm::ComputeNumSignBits(Op, TD, Depth);
350 /// SimplifyCommutative - This performs a few simplifications for
351 /// commutative operators.
352 bool SimplifyCommutative(BinaryOperator &I);
354 /// SimplifyCompare - This reorders the operands of a CmpInst to get them in
355 /// most-complex to least-complex order.
356 bool SimplifyCompare(CmpInst &I);
358 /// SimplifyDemandedBits - Attempts to replace V with a simpler value based
359 /// on the demanded bits.
360 bool SimplifyDemandedBits(Value *V, APInt DemandedMask,
361 APInt& KnownZero, APInt& KnownOne,
364 Value *SimplifyDemandedVectorElts(Value *V, uint64_t DemandedElts,
365 uint64_t &UndefElts, unsigned Depth = 0);
367 // FoldOpIntoPhi - Given a binary operator or cast instruction which has a
368 // PHI node as operand #0, see if we can fold the instruction into the PHI
369 // (which is only possible if all operands to the PHI are constants).
370 Instruction *FoldOpIntoPhi(Instruction &I);
372 // FoldPHIArgOpIntoPHI - If all operands to a PHI node are the same "unary"
373 // operator and they all are only used by the PHI, PHI together their
374 // inputs, and do the operation once, to the result of the PHI.
375 Instruction *FoldPHIArgOpIntoPHI(PHINode &PN);
376 Instruction *FoldPHIArgBinOpIntoPHI(PHINode &PN);
377 Instruction *FoldPHIArgGEPIntoPHI(PHINode &PN);
380 Instruction *OptAndOp(Instruction *Op, ConstantInt *OpRHS,
381 ConstantInt *AndRHS, BinaryOperator &TheAnd);
383 Value *FoldLogicalPlusAnd(Value *LHS, Value *RHS, ConstantInt *Mask,
384 bool isSub, Instruction &I);
385 Instruction *InsertRangeTest(Value *V, Constant *Lo, Constant *Hi,
386 bool isSigned, bool Inside, Instruction &IB);
387 Instruction *PromoteCastOfAllocation(BitCastInst &CI, AllocationInst &AI);
388 Instruction *MatchBSwap(BinaryOperator &I);
389 bool SimplifyStoreAtEndOfBlock(StoreInst &SI);
390 Instruction *SimplifyMemTransfer(MemIntrinsic *MI);
391 Instruction *SimplifyMemSet(MemSetInst *MI);
394 Value *EvaluateInDifferentType(Value *V, const Type *Ty, bool isSigned);
396 bool CanEvaluateInDifferentType(Value *V, const IntegerType *Ty,
398 int &NumCastsRemoved);
399 unsigned GetOrEnforceKnownAlignment(Value *V,
400 unsigned PrefAlign = 0);
405 char InstCombiner::ID = 0;
406 static RegisterPass<InstCombiner>
407 X("instcombine", "Combine redundant instructions");
409 // getComplexity: Assign a complexity or rank value to LLVM Values...
410 // 0 -> undef, 1 -> Const, 2 -> Other, 3 -> Arg, 3 -> Unary, 4 -> OtherInst
411 static unsigned getComplexity(Value *V) {
412 if (isa<Instruction>(V)) {
413 if (BinaryOperator::isNeg(V) || BinaryOperator::isNot(V))
417 if (isa<Argument>(V)) return 3;
418 return isa<Constant>(V) ? (isa<UndefValue>(V) ? 0 : 1) : 2;
421 // isOnlyUse - Return true if this instruction will be deleted if we stop using
423 static bool isOnlyUse(Value *V) {
424 return V->hasOneUse() || isa<Constant>(V);
427 // getPromotedType - Return the specified type promoted as it would be to pass
428 // though a va_arg area...
429 static const Type *getPromotedType(const Type *Ty) {
430 if (const IntegerType* ITy = dyn_cast<IntegerType>(Ty)) {
431 if (ITy->getBitWidth() < 32)
432 return Type::Int32Ty;
437 /// getBitCastOperand - If the specified operand is a CastInst, a constant
438 /// expression bitcast, or a GetElementPtrInst with all zero indices, return the
439 /// operand value, otherwise return null.
440 static Value *getBitCastOperand(Value *V) {
441 if (BitCastInst *I = dyn_cast<BitCastInst>(V))
443 return I->getOperand(0);
444 else if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(V)) {
445 // GetElementPtrInst?
446 if (GEP->hasAllZeroIndices())
447 return GEP->getOperand(0);
448 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) {
449 if (CE->getOpcode() == Instruction::BitCast)
450 // BitCast ConstantExp?
451 return CE->getOperand(0);
452 else if (CE->getOpcode() == Instruction::GetElementPtr) {
453 // GetElementPtr ConstantExp?
454 for (User::op_iterator I = CE->op_begin() + 1, E = CE->op_end();
456 ConstantInt *CI = dyn_cast<ConstantInt>(I);
457 if (!CI || !CI->isZero())
458 // Any non-zero indices? Not cast-like.
461 // All-zero indices? This is just like casting.
462 return CE->getOperand(0);
468 /// This function is a wrapper around CastInst::isEliminableCastPair. It
469 /// simply extracts arguments and returns what that function returns.
470 static Instruction::CastOps
471 isEliminableCastPair(
472 const CastInst *CI, ///< The first cast instruction
473 unsigned opcode, ///< The opcode of the second cast instruction
474 const Type *DstTy, ///< The target type for the second cast instruction
475 TargetData *TD ///< The target data for pointer size
478 const Type *SrcTy = CI->getOperand(0)->getType(); // A from above
479 const Type *MidTy = CI->getType(); // B from above
481 // Get the opcodes of the two Cast instructions
482 Instruction::CastOps firstOp = Instruction::CastOps(CI->getOpcode());
483 Instruction::CastOps secondOp = Instruction::CastOps(opcode);
485 return Instruction::CastOps(
486 CastInst::isEliminableCastPair(firstOp, secondOp, SrcTy, MidTy,
487 DstTy, TD->getIntPtrType()));
490 /// ValueRequiresCast - Return true if the cast from "V to Ty" actually results
491 /// in any code being generated. It does not require codegen if V is simple
492 /// enough or if the cast can be folded into other casts.
493 static bool ValueRequiresCast(Instruction::CastOps opcode, const Value *V,
494 const Type *Ty, TargetData *TD) {
495 if (V->getType() == Ty || isa<Constant>(V)) return false;
497 // If this is another cast that can be eliminated, it isn't codegen either.
498 if (const CastInst *CI = dyn_cast<CastInst>(V))
499 if (isEliminableCastPair(CI, opcode, Ty, TD))
504 // SimplifyCommutative - This performs a few simplifications for commutative
507 // 1. Order operands such that they are listed from right (least complex) to
508 // left (most complex). This puts constants before unary operators before
511 // 2. Transform: (op (op V, C1), C2) ==> (op V, (op C1, C2))
512 // 3. Transform: (op (op V1, C1), (op V2, C2)) ==> (op (op V1, V2), (op C1,C2))
514 bool InstCombiner::SimplifyCommutative(BinaryOperator &I) {
515 bool Changed = false;
516 if (getComplexity(I.getOperand(0)) < getComplexity(I.getOperand(1)))
517 Changed = !I.swapOperands();
519 if (!I.isAssociative()) return Changed;
520 Instruction::BinaryOps Opcode = I.getOpcode();
521 if (BinaryOperator *Op = dyn_cast<BinaryOperator>(I.getOperand(0)))
522 if (Op->getOpcode() == Opcode && isa<Constant>(Op->getOperand(1))) {
523 if (isa<Constant>(I.getOperand(1))) {
524 Constant *Folded = ConstantExpr::get(I.getOpcode(),
525 cast<Constant>(I.getOperand(1)),
526 cast<Constant>(Op->getOperand(1)));
527 I.setOperand(0, Op->getOperand(0));
528 I.setOperand(1, Folded);
530 } else if (BinaryOperator *Op1=dyn_cast<BinaryOperator>(I.getOperand(1)))
531 if (Op1->getOpcode() == Opcode && isa<Constant>(Op1->getOperand(1)) &&
532 isOnlyUse(Op) && isOnlyUse(Op1)) {
533 Constant *C1 = cast<Constant>(Op->getOperand(1));
534 Constant *C2 = cast<Constant>(Op1->getOperand(1));
536 // Fold (op (op V1, C1), (op V2, C2)) ==> (op (op V1, V2), (op C1,C2))
537 Constant *Folded = ConstantExpr::get(I.getOpcode(), C1, C2);
538 Instruction *New = BinaryOperator::Create(Opcode, Op->getOperand(0),
542 I.setOperand(0, New);
543 I.setOperand(1, Folded);
550 /// SimplifyCompare - For a CmpInst this function just orders the operands
551 /// so that theyare listed from right (least complex) to left (most complex).
552 /// This puts constants before unary operators before binary operators.
553 bool InstCombiner::SimplifyCompare(CmpInst &I) {
554 if (getComplexity(I.getOperand(0)) >= getComplexity(I.getOperand(1)))
557 // Compare instructions are not associative so there's nothing else we can do.
561 // dyn_castNegVal - Given a 'sub' instruction, return the RHS of the instruction
562 // if the LHS is a constant zero (which is the 'negate' form).
564 static inline Value *dyn_castNegVal(Value *V) {
565 if (BinaryOperator::isNeg(V))
566 return BinaryOperator::getNegArgument(V);
568 // Constants can be considered to be negated values if they can be folded.
569 if (ConstantInt *C = dyn_cast<ConstantInt>(V))
570 return ConstantExpr::getNeg(C);
572 if (ConstantVector *C = dyn_cast<ConstantVector>(V))
573 if (C->getType()->getElementType()->isInteger())
574 return ConstantExpr::getNeg(C);
579 static inline Value *dyn_castNotVal(Value *V) {
580 if (BinaryOperator::isNot(V))
581 return BinaryOperator::getNotArgument(V);
583 // Constants can be considered to be not'ed values...
584 if (ConstantInt *C = dyn_cast<ConstantInt>(V))
585 return ConstantInt::get(~C->getValue());
589 // dyn_castFoldableMul - If this value is a multiply that can be folded into
590 // other computations (because it has a constant operand), return the
591 // non-constant operand of the multiply, and set CST to point to the multiplier.
592 // Otherwise, return null.
594 static inline Value *dyn_castFoldableMul(Value *V, ConstantInt *&CST) {
595 if (V->hasOneUse() && V->getType()->isInteger())
596 if (Instruction *I = dyn_cast<Instruction>(V)) {
597 if (I->getOpcode() == Instruction::Mul)
598 if ((CST = dyn_cast<ConstantInt>(I->getOperand(1))))
599 return I->getOperand(0);
600 if (I->getOpcode() == Instruction::Shl)
601 if ((CST = dyn_cast<ConstantInt>(I->getOperand(1)))) {
602 // The multiplier is really 1 << CST.
603 uint32_t BitWidth = cast<IntegerType>(V->getType())->getBitWidth();
604 uint32_t CSTVal = CST->getLimitedValue(BitWidth);
605 CST = ConstantInt::get(APInt(BitWidth, 1).shl(CSTVal));
606 return I->getOperand(0);
612 /// dyn_castGetElementPtr - If this is a getelementptr instruction or constant
613 /// expression, return it.
614 static User *dyn_castGetElementPtr(Value *V) {
615 if (isa<GetElementPtrInst>(V)) return cast<User>(V);
616 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V))
617 if (CE->getOpcode() == Instruction::GetElementPtr)
618 return cast<User>(V);
622 /// getOpcode - If this is an Instruction or a ConstantExpr, return the
623 /// opcode value. Otherwise return UserOp1.
624 static unsigned getOpcode(const Value *V) {
625 if (const Instruction *I = dyn_cast<Instruction>(V))
626 return I->getOpcode();
627 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(V))
628 return CE->getOpcode();
629 // Use UserOp1 to mean there's no opcode.
630 return Instruction::UserOp1;
633 /// AddOne - Add one to a ConstantInt
634 static ConstantInt *AddOne(ConstantInt *C) {
635 APInt Val(C->getValue());
636 return ConstantInt::get(++Val);
638 /// SubOne - Subtract one from a ConstantInt
639 static ConstantInt *SubOne(ConstantInt *C) {
640 APInt Val(C->getValue());
641 return ConstantInt::get(--Val);
643 /// Add - Add two ConstantInts together
644 static ConstantInt *Add(ConstantInt *C1, ConstantInt *C2) {
645 return ConstantInt::get(C1->getValue() + C2->getValue());
647 /// And - Bitwise AND two ConstantInts together
648 static ConstantInt *And(ConstantInt *C1, ConstantInt *C2) {
649 return ConstantInt::get(C1->getValue() & C2->getValue());
651 /// Subtract - Subtract one ConstantInt from another
652 static ConstantInt *Subtract(ConstantInt *C1, ConstantInt *C2) {
653 return ConstantInt::get(C1->getValue() - C2->getValue());
655 /// Multiply - Multiply two ConstantInts together
656 static ConstantInt *Multiply(ConstantInt *C1, ConstantInt *C2) {
657 return ConstantInt::get(C1->getValue() * C2->getValue());
659 /// MultiplyOverflows - True if the multiply can not be expressed in an int
661 static bool MultiplyOverflows(ConstantInt *C1, ConstantInt *C2, bool sign) {
662 uint32_t W = C1->getBitWidth();
663 APInt LHSExt = C1->getValue(), RHSExt = C2->getValue();
672 APInt MulExt = LHSExt * RHSExt;
675 APInt Min = APInt::getSignedMinValue(W).sext(W * 2);
676 APInt Max = APInt::getSignedMaxValue(W).sext(W * 2);
677 return MulExt.slt(Min) || MulExt.sgt(Max);
679 return MulExt.ugt(APInt::getLowBitsSet(W * 2, W));
683 /// ShrinkDemandedConstant - Check to see if the specified operand of the
684 /// specified instruction is a constant integer. If so, check to see if there
685 /// are any bits set in the constant that are not demanded. If so, shrink the
686 /// constant and return true.
687 static bool ShrinkDemandedConstant(Instruction *I, unsigned OpNo,
689 assert(I && "No instruction?");
690 assert(OpNo < I->getNumOperands() && "Operand index too large");
692 // If the operand is not a constant integer, nothing to do.
693 ConstantInt *OpC = dyn_cast<ConstantInt>(I->getOperand(OpNo));
694 if (!OpC) return false;
696 // If there are no bits set that aren't demanded, nothing to do.
697 Demanded.zextOrTrunc(OpC->getValue().getBitWidth());
698 if ((~Demanded & OpC->getValue()) == 0)
701 // This instruction is producing bits that are not demanded. Shrink the RHS.
702 Demanded &= OpC->getValue();
703 I->setOperand(OpNo, ConstantInt::get(Demanded));
707 // ComputeSignedMinMaxValuesFromKnownBits - Given a signed integer type and a
708 // set of known zero and one bits, compute the maximum and minimum values that
709 // could have the specified known zero and known one bits, returning them in
711 static void ComputeSignedMinMaxValuesFromKnownBits(const Type *Ty,
712 const APInt& KnownZero,
713 const APInt& KnownOne,
714 APInt& Min, APInt& Max) {
715 uint32_t BitWidth = cast<IntegerType>(Ty)->getBitWidth();
716 assert(KnownZero.getBitWidth() == BitWidth &&
717 KnownOne.getBitWidth() == BitWidth &&
718 Min.getBitWidth() == BitWidth && Max.getBitWidth() == BitWidth &&
719 "Ty, KnownZero, KnownOne and Min, Max must have equal bitwidth.");
720 APInt UnknownBits = ~(KnownZero|KnownOne);
722 // The minimum value is when all unknown bits are zeros, EXCEPT for the sign
723 // bit if it is unknown.
725 Max = KnownOne|UnknownBits;
727 if (UnknownBits[BitWidth-1]) { // Sign bit is unknown
729 Max.clear(BitWidth-1);
733 // ComputeUnsignedMinMaxValuesFromKnownBits - Given an unsigned integer type and
734 // a set of known zero and one bits, compute the maximum and minimum values that
735 // could have the specified known zero and known one bits, returning them in
737 static void ComputeUnsignedMinMaxValuesFromKnownBits(const Type *Ty,
738 const APInt &KnownZero,
739 const APInt &KnownOne,
740 APInt &Min, APInt &Max) {
741 uint32_t BitWidth = cast<IntegerType>(Ty)->getBitWidth(); BitWidth = BitWidth;
742 assert(KnownZero.getBitWidth() == BitWidth &&
743 KnownOne.getBitWidth() == BitWidth &&
744 Min.getBitWidth() == BitWidth && Max.getBitWidth() &&
745 "Ty, KnownZero, KnownOne and Min, Max must have equal bitwidth.");
746 APInt UnknownBits = ~(KnownZero|KnownOne);
748 // The minimum value is when the unknown bits are all zeros.
750 // The maximum value is when the unknown bits are all ones.
751 Max = KnownOne|UnknownBits;
754 /// SimplifyDemandedBits - This function attempts to replace V with a simpler
755 /// value based on the demanded bits. When this function is called, it is known
756 /// that only the bits set in DemandedMask of the result of V are ever used
757 /// downstream. Consequently, depending on the mask and V, it may be possible
758 /// to replace V with a constant or one of its operands. In such cases, this
759 /// function does the replacement and returns true. In all other cases, it
760 /// returns false after analyzing the expression and setting KnownOne and known
761 /// to be one in the expression. KnownZero contains all the bits that are known
762 /// to be zero in the expression. These are provided to potentially allow the
763 /// caller (which might recursively be SimplifyDemandedBits itself) to simplify
764 /// the expression. KnownOne and KnownZero always follow the invariant that
765 /// KnownOne & KnownZero == 0. That is, a bit can't be both 1 and 0. Note that
766 /// the bits in KnownOne and KnownZero may only be accurate for those bits set
767 /// in DemandedMask. Note also that the bitwidth of V, DemandedMask, KnownZero
768 /// and KnownOne must all be the same.
769 bool InstCombiner::SimplifyDemandedBits(Value *V, APInt DemandedMask,
770 APInt& KnownZero, APInt& KnownOne,
772 assert(V != 0 && "Null pointer of Value???");
773 assert(Depth <= 6 && "Limit Search Depth");
774 uint32_t BitWidth = DemandedMask.getBitWidth();
775 const IntegerType *VTy = cast<IntegerType>(V->getType());
776 assert(VTy->getBitWidth() == BitWidth &&
777 KnownZero.getBitWidth() == BitWidth &&
778 KnownOne.getBitWidth() == BitWidth &&
779 "Value *V, DemandedMask, KnownZero and KnownOne \
780 must have same BitWidth");
781 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
782 // We know all of the bits for a constant!
783 KnownOne = CI->getValue() & DemandedMask;
784 KnownZero = ~KnownOne & DemandedMask;
790 if (!V->hasOneUse()) { // Other users may use these bits.
791 if (Depth != 0) { // Not at the root.
792 // Just compute the KnownZero/KnownOne bits to simplify things downstream.
793 ComputeMaskedBits(V, DemandedMask, KnownZero, KnownOne, Depth);
796 // If this is the root being simplified, allow it to have multiple uses,
797 // just set the DemandedMask to all bits.
798 DemandedMask = APInt::getAllOnesValue(BitWidth);
799 } else if (DemandedMask == 0) { // Not demanding any bits from V.
800 if (V != UndefValue::get(VTy))
801 return UpdateValueUsesWith(V, UndefValue::get(VTy));
803 } else if (Depth == 6) { // Limit search depth.
807 Instruction *I = dyn_cast<Instruction>(V);
808 if (!I) return false; // Only analyze instructions.
810 APInt LHSKnownZero(BitWidth, 0), LHSKnownOne(BitWidth, 0);
811 APInt &RHSKnownZero = KnownZero, &RHSKnownOne = KnownOne;
812 switch (I->getOpcode()) {
814 ComputeMaskedBits(V, DemandedMask, RHSKnownZero, RHSKnownOne, Depth);
816 case Instruction::And:
817 // If either the LHS or the RHS are Zero, the result is zero.
818 if (SimplifyDemandedBits(I->getOperand(1), DemandedMask,
819 RHSKnownZero, RHSKnownOne, Depth+1))
821 assert((RHSKnownZero & RHSKnownOne) == 0 &&
822 "Bits known to be one AND zero?");
824 // If something is known zero on the RHS, the bits aren't demanded on the
826 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask & ~RHSKnownZero,
827 LHSKnownZero, LHSKnownOne, Depth+1))
829 assert((LHSKnownZero & LHSKnownOne) == 0 &&
830 "Bits known to be one AND zero?");
832 // If all of the demanded bits are known 1 on one side, return the other.
833 // These bits cannot contribute to the result of the 'and'.
834 if ((DemandedMask & ~LHSKnownZero & RHSKnownOne) ==
835 (DemandedMask & ~LHSKnownZero))
836 return UpdateValueUsesWith(I, I->getOperand(0));
837 if ((DemandedMask & ~RHSKnownZero & LHSKnownOne) ==
838 (DemandedMask & ~RHSKnownZero))
839 return UpdateValueUsesWith(I, I->getOperand(1));
841 // If all of the demanded bits in the inputs are known zeros, return zero.
842 if ((DemandedMask & (RHSKnownZero|LHSKnownZero)) == DemandedMask)
843 return UpdateValueUsesWith(I, Constant::getNullValue(VTy));
845 // If the RHS is a constant, see if we can simplify it.
846 if (ShrinkDemandedConstant(I, 1, DemandedMask & ~LHSKnownZero))
847 return UpdateValueUsesWith(I, I);
849 // Output known-1 bits are only known if set in both the LHS & RHS.
850 RHSKnownOne &= LHSKnownOne;
851 // Output known-0 are known to be clear if zero in either the LHS | RHS.
852 RHSKnownZero |= LHSKnownZero;
854 case Instruction::Or:
855 // If either the LHS or the RHS are One, the result is One.
856 if (SimplifyDemandedBits(I->getOperand(1), DemandedMask,
857 RHSKnownZero, RHSKnownOne, Depth+1))
859 assert((RHSKnownZero & RHSKnownOne) == 0 &&
860 "Bits known to be one AND zero?");
861 // If something is known one on the RHS, the bits aren't demanded on the
863 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask & ~RHSKnownOne,
864 LHSKnownZero, LHSKnownOne, Depth+1))
866 assert((LHSKnownZero & LHSKnownOne) == 0 &&
867 "Bits known to be one AND zero?");
869 // If all of the demanded bits are known zero on one side, return the other.
870 // These bits cannot contribute to the result of the 'or'.
871 if ((DemandedMask & ~LHSKnownOne & RHSKnownZero) ==
872 (DemandedMask & ~LHSKnownOne))
873 return UpdateValueUsesWith(I, I->getOperand(0));
874 if ((DemandedMask & ~RHSKnownOne & LHSKnownZero) ==
875 (DemandedMask & ~RHSKnownOne))
876 return UpdateValueUsesWith(I, I->getOperand(1));
878 // If all of the potentially set bits on one side are known to be set on
879 // the other side, just use the 'other' side.
880 if ((DemandedMask & (~RHSKnownZero) & LHSKnownOne) ==
881 (DemandedMask & (~RHSKnownZero)))
882 return UpdateValueUsesWith(I, I->getOperand(0));
883 if ((DemandedMask & (~LHSKnownZero) & RHSKnownOne) ==
884 (DemandedMask & (~LHSKnownZero)))
885 return UpdateValueUsesWith(I, I->getOperand(1));
887 // If the RHS is a constant, see if we can simplify it.
888 if (ShrinkDemandedConstant(I, 1, DemandedMask))
889 return UpdateValueUsesWith(I, I);
891 // Output known-0 bits are only known if clear in both the LHS & RHS.
892 RHSKnownZero &= LHSKnownZero;
893 // Output known-1 are known to be set if set in either the LHS | RHS.
894 RHSKnownOne |= LHSKnownOne;
896 case Instruction::Xor: {
897 if (SimplifyDemandedBits(I->getOperand(1), DemandedMask,
898 RHSKnownZero, RHSKnownOne, Depth+1))
900 assert((RHSKnownZero & RHSKnownOne) == 0 &&
901 "Bits known to be one AND zero?");
902 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask,
903 LHSKnownZero, LHSKnownOne, Depth+1))
905 assert((LHSKnownZero & LHSKnownOne) == 0 &&
906 "Bits known to be one AND zero?");
908 // If all of the demanded bits are known zero on one side, return the other.
909 // These bits cannot contribute to the result of the 'xor'.
910 if ((DemandedMask & RHSKnownZero) == DemandedMask)
911 return UpdateValueUsesWith(I, I->getOperand(0));
912 if ((DemandedMask & LHSKnownZero) == DemandedMask)
913 return UpdateValueUsesWith(I, I->getOperand(1));
915 // Output known-0 bits are known if clear or set in both the LHS & RHS.
916 APInt KnownZeroOut = (RHSKnownZero & LHSKnownZero) |
917 (RHSKnownOne & LHSKnownOne);
918 // Output known-1 are known to be set if set in only one of the LHS, RHS.
919 APInt KnownOneOut = (RHSKnownZero & LHSKnownOne) |
920 (RHSKnownOne & LHSKnownZero);
922 // If all of the demanded bits are known to be zero on one side or the
923 // other, turn this into an *inclusive* or.
924 // e.g. (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
925 if ((DemandedMask & ~RHSKnownZero & ~LHSKnownZero) == 0) {
927 BinaryOperator::CreateOr(I->getOperand(0), I->getOperand(1),
929 InsertNewInstBefore(Or, *I);
930 return UpdateValueUsesWith(I, Or);
933 // If all of the demanded bits on one side are known, and all of the set
934 // bits on that side are also known to be set on the other side, turn this
935 // into an AND, as we know the bits will be cleared.
936 // e.g. (X | C1) ^ C2 --> (X | C1) & ~C2 iff (C1&C2) == C2
937 if ((DemandedMask & (RHSKnownZero|RHSKnownOne)) == DemandedMask) {
939 if ((RHSKnownOne & LHSKnownOne) == RHSKnownOne) {
940 Constant *AndC = ConstantInt::get(~RHSKnownOne & DemandedMask);
942 BinaryOperator::CreateAnd(I->getOperand(0), AndC, "tmp");
943 InsertNewInstBefore(And, *I);
944 return UpdateValueUsesWith(I, And);
948 // If the RHS is a constant, see if we can simplify it.
949 // FIXME: for XOR, we prefer to force bits to 1 if they will make a -1.
950 if (ShrinkDemandedConstant(I, 1, DemandedMask))
951 return UpdateValueUsesWith(I, I);
953 RHSKnownZero = KnownZeroOut;
954 RHSKnownOne = KnownOneOut;
957 case Instruction::Select:
958 if (SimplifyDemandedBits(I->getOperand(2), DemandedMask,
959 RHSKnownZero, RHSKnownOne, Depth+1))
961 if (SimplifyDemandedBits(I->getOperand(1), DemandedMask,
962 LHSKnownZero, LHSKnownOne, Depth+1))
964 assert((RHSKnownZero & RHSKnownOne) == 0 &&
965 "Bits known to be one AND zero?");
966 assert((LHSKnownZero & LHSKnownOne) == 0 &&
967 "Bits known to be one AND zero?");
969 // If the operands are constants, see if we can simplify them.
970 if (ShrinkDemandedConstant(I, 1, DemandedMask))
971 return UpdateValueUsesWith(I, I);
972 if (ShrinkDemandedConstant(I, 2, DemandedMask))
973 return UpdateValueUsesWith(I, I);
975 // Only known if known in both the LHS and RHS.
976 RHSKnownOne &= LHSKnownOne;
977 RHSKnownZero &= LHSKnownZero;
979 case Instruction::Trunc: {
981 cast<IntegerType>(I->getOperand(0)->getType())->getBitWidth();
982 DemandedMask.zext(truncBf);
983 RHSKnownZero.zext(truncBf);
984 RHSKnownOne.zext(truncBf);
985 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask,
986 RHSKnownZero, RHSKnownOne, Depth+1))
988 DemandedMask.trunc(BitWidth);
989 RHSKnownZero.trunc(BitWidth);
990 RHSKnownOne.trunc(BitWidth);
991 assert((RHSKnownZero & RHSKnownOne) == 0 &&
992 "Bits known to be one AND zero?");
995 case Instruction::BitCast:
996 if (!I->getOperand(0)->getType()->isInteger())
999 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask,
1000 RHSKnownZero, RHSKnownOne, Depth+1))
1002 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1003 "Bits known to be one AND zero?");
1005 case Instruction::ZExt: {
1006 // Compute the bits in the result that are not present in the input.
1007 const IntegerType *SrcTy = cast<IntegerType>(I->getOperand(0)->getType());
1008 uint32_t SrcBitWidth = SrcTy->getBitWidth();
1010 DemandedMask.trunc(SrcBitWidth);
1011 RHSKnownZero.trunc(SrcBitWidth);
1012 RHSKnownOne.trunc(SrcBitWidth);
1013 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask,
1014 RHSKnownZero, RHSKnownOne, Depth+1))
1016 DemandedMask.zext(BitWidth);
1017 RHSKnownZero.zext(BitWidth);
1018 RHSKnownOne.zext(BitWidth);
1019 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1020 "Bits known to be one AND zero?");
1021 // The top bits are known to be zero.
1022 RHSKnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth);
1025 case Instruction::SExt: {
1026 // Compute the bits in the result that are not present in the input.
1027 const IntegerType *SrcTy = cast<IntegerType>(I->getOperand(0)->getType());
1028 uint32_t SrcBitWidth = SrcTy->getBitWidth();
1030 APInt InputDemandedBits = DemandedMask &
1031 APInt::getLowBitsSet(BitWidth, SrcBitWidth);
1033 APInt NewBits(APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth));
1034 // If any of the sign extended bits are demanded, we know that the sign
1036 if ((NewBits & DemandedMask) != 0)
1037 InputDemandedBits.set(SrcBitWidth-1);
1039 InputDemandedBits.trunc(SrcBitWidth);
1040 RHSKnownZero.trunc(SrcBitWidth);
1041 RHSKnownOne.trunc(SrcBitWidth);
1042 if (SimplifyDemandedBits(I->getOperand(0), InputDemandedBits,
1043 RHSKnownZero, RHSKnownOne, Depth+1))
1045 InputDemandedBits.zext(BitWidth);
1046 RHSKnownZero.zext(BitWidth);
1047 RHSKnownOne.zext(BitWidth);
1048 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1049 "Bits known to be one AND zero?");
1051 // If the sign bit of the input is known set or clear, then we know the
1052 // top bits of the result.
1054 // If the input sign bit is known zero, or if the NewBits are not demanded
1055 // convert this into a zero extension.
1056 if (RHSKnownZero[SrcBitWidth-1] || (NewBits & ~DemandedMask) == NewBits)
1058 // Convert to ZExt cast
1059 CastInst *NewCast = new ZExtInst(I->getOperand(0), VTy, I->getName(), I);
1060 return UpdateValueUsesWith(I, NewCast);
1061 } else if (RHSKnownOne[SrcBitWidth-1]) { // Input sign bit known set
1062 RHSKnownOne |= NewBits;
1066 case Instruction::Add: {
1067 // Figure out what the input bits are. If the top bits of the and result
1068 // are not demanded, then the add doesn't demand them from its input
1070 uint32_t NLZ = DemandedMask.countLeadingZeros();
1072 // If there is a constant on the RHS, there are a variety of xformations
1074 if (ConstantInt *RHS = dyn_cast<ConstantInt>(I->getOperand(1))) {
1075 // If null, this should be simplified elsewhere. Some of the xforms here
1076 // won't work if the RHS is zero.
1080 // If the top bit of the output is demanded, demand everything from the
1081 // input. Otherwise, we demand all the input bits except NLZ top bits.
1082 APInt InDemandedBits(APInt::getLowBitsSet(BitWidth, BitWidth - NLZ));
1084 // Find information about known zero/one bits in the input.
1085 if (SimplifyDemandedBits(I->getOperand(0), InDemandedBits,
1086 LHSKnownZero, LHSKnownOne, Depth+1))
1089 // If the RHS of the add has bits set that can't affect the input, reduce
1091 if (ShrinkDemandedConstant(I, 1, InDemandedBits))
1092 return UpdateValueUsesWith(I, I);
1094 // Avoid excess work.
1095 if (LHSKnownZero == 0 && LHSKnownOne == 0)
1098 // Turn it into OR if input bits are zero.
1099 if ((LHSKnownZero & RHS->getValue()) == RHS->getValue()) {
1101 BinaryOperator::CreateOr(I->getOperand(0), I->getOperand(1),
1103 InsertNewInstBefore(Or, *I);
1104 return UpdateValueUsesWith(I, Or);
1107 // We can say something about the output known-zero and known-one bits,
1108 // depending on potential carries from the input constant and the
1109 // unknowns. For example if the LHS is known to have at most the 0x0F0F0
1110 // bits set and the RHS constant is 0x01001, then we know we have a known
1111 // one mask of 0x00001 and a known zero mask of 0xE0F0E.
1113 // To compute this, we first compute the potential carry bits. These are
1114 // the bits which may be modified. I'm not aware of a better way to do
1116 const APInt& RHSVal = RHS->getValue();
1117 APInt CarryBits((~LHSKnownZero + RHSVal) ^ (~LHSKnownZero ^ RHSVal));
1119 // Now that we know which bits have carries, compute the known-1/0 sets.
1121 // Bits are known one if they are known zero in one operand and one in the
1122 // other, and there is no input carry.
1123 RHSKnownOne = ((LHSKnownZero & RHSVal) |
1124 (LHSKnownOne & ~RHSVal)) & ~CarryBits;
1126 // Bits are known zero if they are known zero in both operands and there
1127 // is no input carry.
1128 RHSKnownZero = LHSKnownZero & ~RHSVal & ~CarryBits;
1130 // If the high-bits of this ADD are not demanded, then it does not demand
1131 // the high bits of its LHS or RHS.
1132 if (DemandedMask[BitWidth-1] == 0) {
1133 // Right fill the mask of bits for this ADD to demand the most
1134 // significant bit and all those below it.
1135 APInt DemandedFromOps(APInt::getLowBitsSet(BitWidth, BitWidth-NLZ));
1136 if (SimplifyDemandedBits(I->getOperand(0), DemandedFromOps,
1137 LHSKnownZero, LHSKnownOne, Depth+1))
1139 if (SimplifyDemandedBits(I->getOperand(1), DemandedFromOps,
1140 LHSKnownZero, LHSKnownOne, Depth+1))
1146 case Instruction::Sub:
1147 // If the high-bits of this SUB are not demanded, then it does not demand
1148 // the high bits of its LHS or RHS.
1149 if (DemandedMask[BitWidth-1] == 0) {
1150 // Right fill the mask of bits for this SUB to demand the most
1151 // significant bit and all those below it.
1152 uint32_t NLZ = DemandedMask.countLeadingZeros();
1153 APInt DemandedFromOps(APInt::getLowBitsSet(BitWidth, BitWidth-NLZ));
1154 if (SimplifyDemandedBits(I->getOperand(0), DemandedFromOps,
1155 LHSKnownZero, LHSKnownOne, Depth+1))
1157 if (SimplifyDemandedBits(I->getOperand(1), DemandedFromOps,
1158 LHSKnownZero, LHSKnownOne, Depth+1))
1161 // Otherwise just hand the sub off to ComputeMaskedBits to fill in
1162 // the known zeros and ones.
1163 ComputeMaskedBits(V, DemandedMask, RHSKnownZero, RHSKnownOne, Depth);
1165 case Instruction::Shl:
1166 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
1167 uint64_t ShiftAmt = SA->getLimitedValue(BitWidth);
1168 APInt DemandedMaskIn(DemandedMask.lshr(ShiftAmt));
1169 if (SimplifyDemandedBits(I->getOperand(0), DemandedMaskIn,
1170 RHSKnownZero, RHSKnownOne, Depth+1))
1172 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1173 "Bits known to be one AND zero?");
1174 RHSKnownZero <<= ShiftAmt;
1175 RHSKnownOne <<= ShiftAmt;
1176 // low bits known zero.
1178 RHSKnownZero |= APInt::getLowBitsSet(BitWidth, ShiftAmt);
1181 case Instruction::LShr:
1182 // For a logical shift right
1183 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
1184 uint64_t ShiftAmt = SA->getLimitedValue(BitWidth);
1186 // Unsigned shift right.
1187 APInt DemandedMaskIn(DemandedMask.shl(ShiftAmt));
1188 if (SimplifyDemandedBits(I->getOperand(0), DemandedMaskIn,
1189 RHSKnownZero, RHSKnownOne, Depth+1))
1191 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1192 "Bits known to be one AND zero?");
1193 RHSKnownZero = APIntOps::lshr(RHSKnownZero, ShiftAmt);
1194 RHSKnownOne = APIntOps::lshr(RHSKnownOne, ShiftAmt);
1196 // Compute the new bits that are at the top now.
1197 APInt HighBits(APInt::getHighBitsSet(BitWidth, ShiftAmt));
1198 RHSKnownZero |= HighBits; // high bits known zero.
1202 case Instruction::AShr:
1203 // If this is an arithmetic shift right and only the low-bit is set, we can
1204 // always convert this into a logical shr, even if the shift amount is
1205 // variable. The low bit of the shift cannot be an input sign bit unless
1206 // the shift amount is >= the size of the datatype, which is undefined.
1207 if (DemandedMask == 1) {
1208 // Perform the logical shift right.
1209 Value *NewVal = BinaryOperator::CreateLShr(
1210 I->getOperand(0), I->getOperand(1), I->getName());
1211 InsertNewInstBefore(cast<Instruction>(NewVal), *I);
1212 return UpdateValueUsesWith(I, NewVal);
1215 // If the sign bit is the only bit demanded by this ashr, then there is no
1216 // need to do it, the shift doesn't change the high bit.
1217 if (DemandedMask.isSignBit())
1218 return UpdateValueUsesWith(I, I->getOperand(0));
1220 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
1221 uint32_t ShiftAmt = SA->getLimitedValue(BitWidth);
1223 // Signed shift right.
1224 APInt DemandedMaskIn(DemandedMask.shl(ShiftAmt));
1225 // If any of the "high bits" are demanded, we should set the sign bit as
1227 if (DemandedMask.countLeadingZeros() <= ShiftAmt)
1228 DemandedMaskIn.set(BitWidth-1);
1229 if (SimplifyDemandedBits(I->getOperand(0),
1231 RHSKnownZero, RHSKnownOne, Depth+1))
1233 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1234 "Bits known to be one AND zero?");
1235 // Compute the new bits that are at the top now.
1236 APInt HighBits(APInt::getHighBitsSet(BitWidth, ShiftAmt));
1237 RHSKnownZero = APIntOps::lshr(RHSKnownZero, ShiftAmt);
1238 RHSKnownOne = APIntOps::lshr(RHSKnownOne, ShiftAmt);
1240 // Handle the sign bits.
1241 APInt SignBit(APInt::getSignBit(BitWidth));
1242 // Adjust to where it is now in the mask.
1243 SignBit = APIntOps::lshr(SignBit, ShiftAmt);
1245 // If the input sign bit is known to be zero, or if none of the top bits
1246 // are demanded, turn this into an unsigned shift right.
1247 if (BitWidth <= ShiftAmt || RHSKnownZero[BitWidth-ShiftAmt-1] ||
1248 (HighBits & ~DemandedMask) == HighBits) {
1249 // Perform the logical shift right.
1250 Value *NewVal = BinaryOperator::CreateLShr(
1251 I->getOperand(0), SA, I->getName());
1252 InsertNewInstBefore(cast<Instruction>(NewVal), *I);
1253 return UpdateValueUsesWith(I, NewVal);
1254 } else if ((RHSKnownOne & SignBit) != 0) { // New bits are known one.
1255 RHSKnownOne |= HighBits;
1259 case Instruction::SRem:
1260 if (ConstantInt *Rem = dyn_cast<ConstantInt>(I->getOperand(1))) {
1261 APInt RA = Rem->getValue().abs();
1262 if (RA.isPowerOf2()) {
1263 if (DemandedMask.ule(RA)) // srem won't affect demanded bits
1264 return UpdateValueUsesWith(I, I->getOperand(0));
1266 APInt LowBits = RA - 1;
1267 APInt Mask2 = LowBits | APInt::getSignBit(BitWidth);
1268 if (SimplifyDemandedBits(I->getOperand(0), Mask2,
1269 LHSKnownZero, LHSKnownOne, Depth+1))
1272 if (LHSKnownZero[BitWidth-1] || ((LHSKnownZero & LowBits) == LowBits))
1273 LHSKnownZero |= ~LowBits;
1275 KnownZero |= LHSKnownZero & DemandedMask;
1277 assert((KnownZero & KnownOne) == 0&&"Bits known to be one AND zero?");
1281 case Instruction::URem: {
1282 APInt KnownZero2(BitWidth, 0), KnownOne2(BitWidth, 0);
1283 APInt AllOnes = APInt::getAllOnesValue(BitWidth);
1284 if (SimplifyDemandedBits(I->getOperand(0), AllOnes,
1285 KnownZero2, KnownOne2, Depth+1))
1288 uint32_t Leaders = KnownZero2.countLeadingOnes();
1289 if (SimplifyDemandedBits(I->getOperand(1), AllOnes,
1290 KnownZero2, KnownOne2, Depth+1))
1293 Leaders = std::max(Leaders,
1294 KnownZero2.countLeadingOnes());
1295 KnownZero = APInt::getHighBitsSet(BitWidth, Leaders) & DemandedMask;
1298 case Instruction::Call:
1299 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) {
1300 switch (II->getIntrinsicID()) {
1302 case Intrinsic::bswap: {
1303 // If the only bits demanded come from one byte of the bswap result,
1304 // just shift the input byte into position to eliminate the bswap.
1305 unsigned NLZ = DemandedMask.countLeadingZeros();
1306 unsigned NTZ = DemandedMask.countTrailingZeros();
1308 // Round NTZ down to the next byte. If we have 11 trailing zeros, then
1309 // we need all the bits down to bit 8. Likewise, round NLZ. If we
1310 // have 14 leading zeros, round to 8.
1313 // If we need exactly one byte, we can do this transformation.
1314 if (BitWidth-NLZ-NTZ == 8) {
1315 unsigned ResultBit = NTZ;
1316 unsigned InputBit = BitWidth-NTZ-8;
1318 // Replace this with either a left or right shift to get the byte into
1320 Instruction *NewVal;
1321 if (InputBit > ResultBit)
1322 NewVal = BinaryOperator::CreateLShr(I->getOperand(1),
1323 ConstantInt::get(I->getType(), InputBit-ResultBit));
1325 NewVal = BinaryOperator::CreateShl(I->getOperand(1),
1326 ConstantInt::get(I->getType(), ResultBit-InputBit));
1327 NewVal->takeName(I);
1328 InsertNewInstBefore(NewVal, *I);
1329 return UpdateValueUsesWith(I, NewVal);
1332 // TODO: Could compute known zero/one bits based on the input.
1337 ComputeMaskedBits(V, DemandedMask, RHSKnownZero, RHSKnownOne, Depth);
1341 // If the client is only demanding bits that we know, return the known
1343 if ((DemandedMask & (RHSKnownZero|RHSKnownOne)) == DemandedMask)
1344 return UpdateValueUsesWith(I, ConstantInt::get(RHSKnownOne));
1349 /// SimplifyDemandedVectorElts - The specified value produces a vector with
1350 /// 64 or fewer elements. DemandedElts contains the set of elements that are
1351 /// actually used by the caller. This method analyzes which elements of the
1352 /// operand are undef and returns that information in UndefElts.
1354 /// If the information about demanded elements can be used to simplify the
1355 /// operation, the operation is simplified, then the resultant value is
1356 /// returned. This returns null if no change was made.
1357 Value *InstCombiner::SimplifyDemandedVectorElts(Value *V, uint64_t DemandedElts,
1358 uint64_t &UndefElts,
1360 unsigned VWidth = cast<VectorType>(V->getType())->getNumElements();
1361 assert(VWidth <= 64 && "Vector too wide to analyze!");
1362 uint64_t EltMask = ~0ULL >> (64-VWidth);
1363 assert((DemandedElts & ~EltMask) == 0 && "Invalid DemandedElts!");
1365 if (isa<UndefValue>(V)) {
1366 // If the entire vector is undefined, just return this info.
1367 UndefElts = EltMask;
1369 } else if (DemandedElts == 0) { // If nothing is demanded, provide undef.
1370 UndefElts = EltMask;
1371 return UndefValue::get(V->getType());
1375 if (ConstantVector *CP = dyn_cast<ConstantVector>(V)) {
1376 const Type *EltTy = cast<VectorType>(V->getType())->getElementType();
1377 Constant *Undef = UndefValue::get(EltTy);
1379 std::vector<Constant*> Elts;
1380 for (unsigned i = 0; i != VWidth; ++i)
1381 if (!(DemandedElts & (1ULL << i))) { // If not demanded, set to undef.
1382 Elts.push_back(Undef);
1383 UndefElts |= (1ULL << i);
1384 } else if (isa<UndefValue>(CP->getOperand(i))) { // Already undef.
1385 Elts.push_back(Undef);
1386 UndefElts |= (1ULL << i);
1387 } else { // Otherwise, defined.
1388 Elts.push_back(CP->getOperand(i));
1391 // If we changed the constant, return it.
1392 Constant *NewCP = ConstantVector::get(Elts);
1393 return NewCP != CP ? NewCP : 0;
1394 } else if (isa<ConstantAggregateZero>(V)) {
1395 // Simplify the CAZ to a ConstantVector where the non-demanded elements are
1398 // Check if this is identity. If so, return 0 since we are not simplifying
1400 if (DemandedElts == ((1ULL << VWidth) -1))
1403 const Type *EltTy = cast<VectorType>(V->getType())->getElementType();
1404 Constant *Zero = Constant::getNullValue(EltTy);
1405 Constant *Undef = UndefValue::get(EltTy);
1406 std::vector<Constant*> Elts;
1407 for (unsigned i = 0; i != VWidth; ++i)
1408 Elts.push_back((DemandedElts & (1ULL << i)) ? Zero : Undef);
1409 UndefElts = DemandedElts ^ EltMask;
1410 return ConstantVector::get(Elts);
1413 // Limit search depth.
1417 // If multiple users are using the root value, procede with
1418 // simplification conservatively assuming that all elements
1420 if (!V->hasOneUse()) {
1421 // Quit if we find multiple users of a non-root value though.
1422 // They'll be handled when it's their turn to be visited by
1423 // the main instcombine process.
1425 // TODO: Just compute the UndefElts information recursively.
1428 // Conservatively assume that all elements are needed.
1429 DemandedElts = EltMask;
1432 Instruction *I = dyn_cast<Instruction>(V);
1433 if (!I) return false; // Only analyze instructions.
1435 bool MadeChange = false;
1436 uint64_t UndefElts2;
1438 switch (I->getOpcode()) {
1441 case Instruction::InsertElement: {
1442 // If this is a variable index, we don't know which element it overwrites.
1443 // demand exactly the same input as we produce.
1444 ConstantInt *Idx = dyn_cast<ConstantInt>(I->getOperand(2));
1446 // Note that we can't propagate undef elt info, because we don't know
1447 // which elt is getting updated.
1448 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), DemandedElts,
1449 UndefElts2, Depth+1);
1450 if (TmpV) { I->setOperand(0, TmpV); MadeChange = true; }
1454 // If this is inserting an element that isn't demanded, remove this
1456 unsigned IdxNo = Idx->getZExtValue();
1457 if (IdxNo >= VWidth || (DemandedElts & (1ULL << IdxNo)) == 0)
1458 return AddSoonDeadInstToWorklist(*I, 0);
1460 // Otherwise, the element inserted overwrites whatever was there, so the
1461 // input demanded set is simpler than the output set.
1462 TmpV = SimplifyDemandedVectorElts(I->getOperand(0),
1463 DemandedElts & ~(1ULL << IdxNo),
1464 UndefElts, Depth+1);
1465 if (TmpV) { I->setOperand(0, TmpV); MadeChange = true; }
1467 // The inserted element is defined.
1468 UndefElts &= ~(1ULL << IdxNo);
1471 case Instruction::ShuffleVector: {
1472 ShuffleVectorInst *Shuffle = cast<ShuffleVectorInst>(I);
1473 uint64_t LHSVWidth =
1474 cast<VectorType>(Shuffle->getOperand(0)->getType())->getNumElements();
1475 uint64_t LeftDemanded = 0, RightDemanded = 0;
1476 for (unsigned i = 0; i < VWidth; i++) {
1477 if (DemandedElts & (1ULL << i)) {
1478 unsigned MaskVal = Shuffle->getMaskValue(i);
1479 if (MaskVal != -1u) {
1480 assert(MaskVal < LHSVWidth * 2 &&
1481 "shufflevector mask index out of range!");
1482 if (MaskVal < LHSVWidth)
1483 LeftDemanded |= 1ULL << MaskVal;
1485 RightDemanded |= 1ULL << (MaskVal - LHSVWidth);
1490 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), LeftDemanded,
1491 UndefElts2, Depth+1);
1492 if (TmpV) { I->setOperand(0, TmpV); MadeChange = true; }
1494 uint64_t UndefElts3;
1495 TmpV = SimplifyDemandedVectorElts(I->getOperand(1), RightDemanded,
1496 UndefElts3, Depth+1);
1497 if (TmpV) { I->setOperand(1, TmpV); MadeChange = true; }
1499 bool NewUndefElts = false;
1500 for (unsigned i = 0; i < VWidth; i++) {
1501 unsigned MaskVal = Shuffle->getMaskValue(i);
1502 if (MaskVal == -1u) {
1503 uint64_t NewBit = 1ULL << i;
1504 UndefElts |= NewBit;
1505 } else if (MaskVal < LHSVWidth) {
1506 uint64_t NewBit = ((UndefElts2 >> MaskVal) & 1) << i;
1507 NewUndefElts |= NewBit;
1508 UndefElts |= NewBit;
1510 uint64_t NewBit = ((UndefElts3 >> (MaskVal - LHSVWidth)) & 1) << i;
1511 NewUndefElts |= NewBit;
1512 UndefElts |= NewBit;
1517 // Add additional discovered undefs.
1518 std::vector<Constant*> Elts;
1519 for (unsigned i = 0; i < VWidth; ++i) {
1520 if (UndefElts & (1ULL << i))
1521 Elts.push_back(UndefValue::get(Type::Int32Ty));
1523 Elts.push_back(ConstantInt::get(Type::Int32Ty,
1524 Shuffle->getMaskValue(i)));
1526 I->setOperand(2, ConstantVector::get(Elts));
1531 case Instruction::BitCast: {
1532 // Vector->vector casts only.
1533 const VectorType *VTy = dyn_cast<VectorType>(I->getOperand(0)->getType());
1535 unsigned InVWidth = VTy->getNumElements();
1536 uint64_t InputDemandedElts = 0;
1539 if (VWidth == InVWidth) {
1540 // If we are converting from <4 x i32> -> <4 x f32>, we demand the same
1541 // elements as are demanded of us.
1543 InputDemandedElts = DemandedElts;
1544 } else if (VWidth > InVWidth) {
1548 // If there are more elements in the result than there are in the source,
1549 // then an input element is live if any of the corresponding output
1550 // elements are live.
1551 Ratio = VWidth/InVWidth;
1552 for (unsigned OutIdx = 0; OutIdx != VWidth; ++OutIdx) {
1553 if (DemandedElts & (1ULL << OutIdx))
1554 InputDemandedElts |= 1ULL << (OutIdx/Ratio);
1560 // If there are more elements in the source than there are in the result,
1561 // then an input element is live if the corresponding output element is
1563 Ratio = InVWidth/VWidth;
1564 for (unsigned InIdx = 0; InIdx != InVWidth; ++InIdx)
1565 if (DemandedElts & (1ULL << InIdx/Ratio))
1566 InputDemandedElts |= 1ULL << InIdx;
1569 // div/rem demand all inputs, because they don't want divide by zero.
1570 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), InputDemandedElts,
1571 UndefElts2, Depth+1);
1573 I->setOperand(0, TmpV);
1577 UndefElts = UndefElts2;
1578 if (VWidth > InVWidth) {
1579 assert(0 && "Unimp");
1580 // If there are more elements in the result than there are in the source,
1581 // then an output element is undef if the corresponding input element is
1583 for (unsigned OutIdx = 0; OutIdx != VWidth; ++OutIdx)
1584 if (UndefElts2 & (1ULL << (OutIdx/Ratio)))
1585 UndefElts |= 1ULL << OutIdx;
1586 } else if (VWidth < InVWidth) {
1587 assert(0 && "Unimp");
1588 // If there are more elements in the source than there are in the result,
1589 // then a result element is undef if all of the corresponding input
1590 // elements are undef.
1591 UndefElts = ~0ULL >> (64-VWidth); // Start out all undef.
1592 for (unsigned InIdx = 0; InIdx != InVWidth; ++InIdx)
1593 if ((UndefElts2 & (1ULL << InIdx)) == 0) // Not undef?
1594 UndefElts &= ~(1ULL << (InIdx/Ratio)); // Clear undef bit.
1598 case Instruction::And:
1599 case Instruction::Or:
1600 case Instruction::Xor:
1601 case Instruction::Add:
1602 case Instruction::Sub:
1603 case Instruction::Mul:
1604 // div/rem demand all inputs, because they don't want divide by zero.
1605 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), DemandedElts,
1606 UndefElts, Depth+1);
1607 if (TmpV) { I->setOperand(0, TmpV); MadeChange = true; }
1608 TmpV = SimplifyDemandedVectorElts(I->getOperand(1), DemandedElts,
1609 UndefElts2, Depth+1);
1610 if (TmpV) { I->setOperand(1, TmpV); MadeChange = true; }
1612 // Output elements are undefined if both are undefined. Consider things
1613 // like undef&0. The result is known zero, not undef.
1614 UndefElts &= UndefElts2;
1617 case Instruction::Call: {
1618 IntrinsicInst *II = dyn_cast<IntrinsicInst>(I);
1620 switch (II->getIntrinsicID()) {
1623 // Binary vector operations that work column-wise. A dest element is a
1624 // function of the corresponding input elements from the two inputs.
1625 case Intrinsic::x86_sse_sub_ss:
1626 case Intrinsic::x86_sse_mul_ss:
1627 case Intrinsic::x86_sse_min_ss:
1628 case Intrinsic::x86_sse_max_ss:
1629 case Intrinsic::x86_sse2_sub_sd:
1630 case Intrinsic::x86_sse2_mul_sd:
1631 case Intrinsic::x86_sse2_min_sd:
1632 case Intrinsic::x86_sse2_max_sd:
1633 TmpV = SimplifyDemandedVectorElts(II->getOperand(1), DemandedElts,
1634 UndefElts, Depth+1);
1635 if (TmpV) { II->setOperand(1, TmpV); MadeChange = true; }
1636 TmpV = SimplifyDemandedVectorElts(II->getOperand(2), DemandedElts,
1637 UndefElts2, Depth+1);
1638 if (TmpV) { II->setOperand(2, TmpV); MadeChange = true; }
1640 // If only the low elt is demanded and this is a scalarizable intrinsic,
1641 // scalarize it now.
1642 if (DemandedElts == 1) {
1643 switch (II->getIntrinsicID()) {
1645 case Intrinsic::x86_sse_sub_ss:
1646 case Intrinsic::x86_sse_mul_ss:
1647 case Intrinsic::x86_sse2_sub_sd:
1648 case Intrinsic::x86_sse2_mul_sd:
1649 // TODO: Lower MIN/MAX/ABS/etc
1650 Value *LHS = II->getOperand(1);
1651 Value *RHS = II->getOperand(2);
1652 // Extract the element as scalars.
1653 LHS = InsertNewInstBefore(new ExtractElementInst(LHS, 0U,"tmp"), *II);
1654 RHS = InsertNewInstBefore(new ExtractElementInst(RHS, 0U,"tmp"), *II);
1656 switch (II->getIntrinsicID()) {
1657 default: assert(0 && "Case stmts out of sync!");
1658 case Intrinsic::x86_sse_sub_ss:
1659 case Intrinsic::x86_sse2_sub_sd:
1660 TmpV = InsertNewInstBefore(BinaryOperator::CreateSub(LHS, RHS,
1661 II->getName()), *II);
1663 case Intrinsic::x86_sse_mul_ss:
1664 case Intrinsic::x86_sse2_mul_sd:
1665 TmpV = InsertNewInstBefore(BinaryOperator::CreateMul(LHS, RHS,
1666 II->getName()), *II);
1671 InsertElementInst::Create(UndefValue::get(II->getType()), TmpV, 0U,
1673 InsertNewInstBefore(New, *II);
1674 AddSoonDeadInstToWorklist(*II, 0);
1679 // Output elements are undefined if both are undefined. Consider things
1680 // like undef&0. The result is known zero, not undef.
1681 UndefElts &= UndefElts2;
1687 return MadeChange ? I : 0;
1691 /// AssociativeOpt - Perform an optimization on an associative operator. This
1692 /// function is designed to check a chain of associative operators for a
1693 /// potential to apply a certain optimization. Since the optimization may be
1694 /// applicable if the expression was reassociated, this checks the chain, then
1695 /// reassociates the expression as necessary to expose the optimization
1696 /// opportunity. This makes use of a special Functor, which must define
1697 /// 'shouldApply' and 'apply' methods.
1699 template<typename Functor>
1700 static Instruction *AssociativeOpt(BinaryOperator &Root, const Functor &F) {
1701 unsigned Opcode = Root.getOpcode();
1702 Value *LHS = Root.getOperand(0);
1704 // Quick check, see if the immediate LHS matches...
1705 if (F.shouldApply(LHS))
1706 return F.apply(Root);
1708 // Otherwise, if the LHS is not of the same opcode as the root, return.
1709 Instruction *LHSI = dyn_cast<Instruction>(LHS);
1710 while (LHSI && LHSI->getOpcode() == Opcode && LHSI->hasOneUse()) {
1711 // Should we apply this transform to the RHS?
1712 bool ShouldApply = F.shouldApply(LHSI->getOperand(1));
1714 // If not to the RHS, check to see if we should apply to the LHS...
1715 if (!ShouldApply && F.shouldApply(LHSI->getOperand(0))) {
1716 cast<BinaryOperator>(LHSI)->swapOperands(); // Make the LHS the RHS
1720 // If the functor wants to apply the optimization to the RHS of LHSI,
1721 // reassociate the expression from ((? op A) op B) to (? op (A op B))
1723 // Now all of the instructions are in the current basic block, go ahead
1724 // and perform the reassociation.
1725 Instruction *TmpLHSI = cast<Instruction>(Root.getOperand(0));
1727 // First move the selected RHS to the LHS of the root...
1728 Root.setOperand(0, LHSI->getOperand(1));
1730 // Make what used to be the LHS of the root be the user of the root...
1731 Value *ExtraOperand = TmpLHSI->getOperand(1);
1732 if (&Root == TmpLHSI) {
1733 Root.replaceAllUsesWith(Constant::getNullValue(TmpLHSI->getType()));
1736 Root.replaceAllUsesWith(TmpLHSI); // Users now use TmpLHSI
1737 TmpLHSI->setOperand(1, &Root); // TmpLHSI now uses the root
1738 BasicBlock::iterator ARI = &Root; ++ARI;
1739 TmpLHSI->moveBefore(ARI); // Move TmpLHSI to after Root
1742 // Now propagate the ExtraOperand down the chain of instructions until we
1744 while (TmpLHSI != LHSI) {
1745 Instruction *NextLHSI = cast<Instruction>(TmpLHSI->getOperand(0));
1746 // Move the instruction to immediately before the chain we are
1747 // constructing to avoid breaking dominance properties.
1748 NextLHSI->moveBefore(ARI);
1751 Value *NextOp = NextLHSI->getOperand(1);
1752 NextLHSI->setOperand(1, ExtraOperand);
1754 ExtraOperand = NextOp;
1757 // Now that the instructions are reassociated, have the functor perform
1758 // the transformation...
1759 return F.apply(Root);
1762 LHSI = dyn_cast<Instruction>(LHSI->getOperand(0));
1769 // AddRHS - Implements: X + X --> X << 1
1772 AddRHS(Value *rhs) : RHS(rhs) {}
1773 bool shouldApply(Value *LHS) const { return LHS == RHS; }
1774 Instruction *apply(BinaryOperator &Add) const {
1775 return BinaryOperator::CreateShl(Add.getOperand(0),
1776 ConstantInt::get(Add.getType(), 1));
1780 // AddMaskingAnd - Implements (A & C1)+(B & C2) --> (A & C1)|(B & C2)
1782 struct AddMaskingAnd {
1784 AddMaskingAnd(Constant *c) : C2(c) {}
1785 bool shouldApply(Value *LHS) const {
1787 return match(LHS, m_And(m_Value(), m_ConstantInt(C1))) &&
1788 ConstantExpr::getAnd(C1, C2)->isNullValue();
1790 Instruction *apply(BinaryOperator &Add) const {
1791 return BinaryOperator::CreateOr(Add.getOperand(0), Add.getOperand(1));
1797 static Value *FoldOperationIntoSelectOperand(Instruction &I, Value *SO,
1799 if (CastInst *CI = dyn_cast<CastInst>(&I)) {
1800 return IC->InsertCastBefore(CI->getOpcode(), SO, I.getType(), I);
1803 // Figure out if the constant is the left or the right argument.
1804 bool ConstIsRHS = isa<Constant>(I.getOperand(1));
1805 Constant *ConstOperand = cast<Constant>(I.getOperand(ConstIsRHS));
1807 if (Constant *SOC = dyn_cast<Constant>(SO)) {
1809 return ConstantExpr::get(I.getOpcode(), SOC, ConstOperand);
1810 return ConstantExpr::get(I.getOpcode(), ConstOperand, SOC);
1813 Value *Op0 = SO, *Op1 = ConstOperand;
1815 std::swap(Op0, Op1);
1817 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(&I))
1818 New = BinaryOperator::Create(BO->getOpcode(), Op0, Op1,SO->getName()+".op");
1819 else if (CmpInst *CI = dyn_cast<CmpInst>(&I))
1820 New = CmpInst::Create(CI->getOpcode(), CI->getPredicate(), Op0, Op1,
1821 SO->getName()+".cmp");
1823 assert(0 && "Unknown binary instruction type!");
1826 return IC->InsertNewInstBefore(New, I);
1829 // FoldOpIntoSelect - Given an instruction with a select as one operand and a
1830 // constant as the other operand, try to fold the binary operator into the
1831 // select arguments. This also works for Cast instructions, which obviously do
1832 // not have a second operand.
1833 static Instruction *FoldOpIntoSelect(Instruction &Op, SelectInst *SI,
1835 // Don't modify shared select instructions
1836 if (!SI->hasOneUse()) return 0;
1837 Value *TV = SI->getOperand(1);
1838 Value *FV = SI->getOperand(2);
1840 if (isa<Constant>(TV) || isa<Constant>(FV)) {
1841 // Bool selects with constant operands can be folded to logical ops.
1842 if (SI->getType() == Type::Int1Ty) return 0;
1844 Value *SelectTrueVal = FoldOperationIntoSelectOperand(Op, TV, IC);
1845 Value *SelectFalseVal = FoldOperationIntoSelectOperand(Op, FV, IC);
1847 return SelectInst::Create(SI->getCondition(), SelectTrueVal,
1854 /// FoldOpIntoPhi - Given a binary operator or cast instruction which has a PHI
1855 /// node as operand #0, see if we can fold the instruction into the PHI (which
1856 /// is only possible if all operands to the PHI are constants).
1857 Instruction *InstCombiner::FoldOpIntoPhi(Instruction &I) {
1858 PHINode *PN = cast<PHINode>(I.getOperand(0));
1859 unsigned NumPHIValues = PN->getNumIncomingValues();
1860 if (!PN->hasOneUse() || NumPHIValues == 0) return 0;
1862 // Check to see if all of the operands of the PHI are constants. If there is
1863 // one non-constant value, remember the BB it is. If there is more than one
1864 // or if *it* is a PHI, bail out.
1865 BasicBlock *NonConstBB = 0;
1866 for (unsigned i = 0; i != NumPHIValues; ++i)
1867 if (!isa<Constant>(PN->getIncomingValue(i))) {
1868 if (NonConstBB) return 0; // More than one non-const value.
1869 if (isa<PHINode>(PN->getIncomingValue(i))) return 0; // Itself a phi.
1870 NonConstBB = PN->getIncomingBlock(i);
1872 // If the incoming non-constant value is in I's block, we have an infinite
1874 if (NonConstBB == I.getParent())
1878 // If there is exactly one non-constant value, we can insert a copy of the
1879 // operation in that block. However, if this is a critical edge, we would be
1880 // inserting the computation one some other paths (e.g. inside a loop). Only
1881 // do this if the pred block is unconditionally branching into the phi block.
1883 BranchInst *BI = dyn_cast<BranchInst>(NonConstBB->getTerminator());
1884 if (!BI || !BI->isUnconditional()) return 0;
1887 // Okay, we can do the transformation: create the new PHI node.
1888 PHINode *NewPN = PHINode::Create(I.getType(), "");
1889 NewPN->reserveOperandSpace(PN->getNumOperands()/2);
1890 InsertNewInstBefore(NewPN, *PN);
1891 NewPN->takeName(PN);
1893 // Next, add all of the operands to the PHI.
1894 if (I.getNumOperands() == 2) {
1895 Constant *C = cast<Constant>(I.getOperand(1));
1896 for (unsigned i = 0; i != NumPHIValues; ++i) {
1898 if (Constant *InC = dyn_cast<Constant>(PN->getIncomingValue(i))) {
1899 if (CmpInst *CI = dyn_cast<CmpInst>(&I))
1900 InV = ConstantExpr::getCompare(CI->getPredicate(), InC, C);
1902 InV = ConstantExpr::get(I.getOpcode(), InC, C);
1904 assert(PN->getIncomingBlock(i) == NonConstBB);
1905 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(&I))
1906 InV = BinaryOperator::Create(BO->getOpcode(),
1907 PN->getIncomingValue(i), C, "phitmp",
1908 NonConstBB->getTerminator());
1909 else if (CmpInst *CI = dyn_cast<CmpInst>(&I))
1910 InV = CmpInst::Create(CI->getOpcode(),
1912 PN->getIncomingValue(i), C, "phitmp",
1913 NonConstBB->getTerminator());
1915 assert(0 && "Unknown binop!");
1917 AddToWorkList(cast<Instruction>(InV));
1919 NewPN->addIncoming(InV, PN->getIncomingBlock(i));
1922 CastInst *CI = cast<CastInst>(&I);
1923 const Type *RetTy = CI->getType();
1924 for (unsigned i = 0; i != NumPHIValues; ++i) {
1926 if (Constant *InC = dyn_cast<Constant>(PN->getIncomingValue(i))) {
1927 InV = ConstantExpr::getCast(CI->getOpcode(), InC, RetTy);
1929 assert(PN->getIncomingBlock(i) == NonConstBB);
1930 InV = CastInst::Create(CI->getOpcode(), PN->getIncomingValue(i),
1931 I.getType(), "phitmp",
1932 NonConstBB->getTerminator());
1933 AddToWorkList(cast<Instruction>(InV));
1935 NewPN->addIncoming(InV, PN->getIncomingBlock(i));
1938 return ReplaceInstUsesWith(I, NewPN);
1942 /// WillNotOverflowSignedAdd - Return true if we can prove that:
1943 /// (sext (add LHS, RHS)) === (add (sext LHS), (sext RHS))
1944 /// This basically requires proving that the add in the original type would not
1945 /// overflow to change the sign bit or have a carry out.
1946 bool InstCombiner::WillNotOverflowSignedAdd(Value *LHS, Value *RHS) {
1947 // There are different heuristics we can use for this. Here are some simple
1950 // Add has the property that adding any two 2's complement numbers can only
1951 // have one carry bit which can change a sign. As such, if LHS and RHS each
1952 // have at least two sign bits, we know that the addition of the two values will
1953 // sign extend fine.
1954 if (ComputeNumSignBits(LHS) > 1 && ComputeNumSignBits(RHS) > 1)
1958 // If one of the operands only has one non-zero bit, and if the other operand
1959 // has a known-zero bit in a more significant place than it (not including the
1960 // sign bit) the ripple may go up to and fill the zero, but won't change the
1961 // sign. For example, (X & ~4) + 1.
1969 Instruction *InstCombiner::visitAdd(BinaryOperator &I) {
1970 bool Changed = SimplifyCommutative(I);
1971 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1);
1973 if (Constant *RHSC = dyn_cast<Constant>(RHS)) {
1974 // X + undef -> undef
1975 if (isa<UndefValue>(RHS))
1976 return ReplaceInstUsesWith(I, RHS);
1979 if (!I.getType()->isFPOrFPVector()) { // NOTE: -0 + +0 = +0.
1980 if (RHSC->isNullValue())
1981 return ReplaceInstUsesWith(I, LHS);
1982 } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(RHSC)) {
1983 if (CFP->isExactlyValue(ConstantFP::getNegativeZero
1984 (I.getType())->getValueAPF()))
1985 return ReplaceInstUsesWith(I, LHS);
1988 if (ConstantInt *CI = dyn_cast<ConstantInt>(RHSC)) {
1989 // X + (signbit) --> X ^ signbit
1990 const APInt& Val = CI->getValue();
1991 uint32_t BitWidth = Val.getBitWidth();
1992 if (Val == APInt::getSignBit(BitWidth))
1993 return BinaryOperator::CreateXor(LHS, RHS);
1995 // See if SimplifyDemandedBits can simplify this. This handles stuff like
1996 // (X & 254)+1 -> (X&254)|1
1997 if (!isa<VectorType>(I.getType())) {
1998 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
1999 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
2000 KnownZero, KnownOne))
2004 // zext(i1) - 1 -> select i1, 0, -1
2005 if (ZExtInst *ZI = dyn_cast<ZExtInst>(LHS))
2006 if (CI->isAllOnesValue() &&
2007 ZI->getOperand(0)->getType() == Type::Int1Ty)
2008 return SelectInst::Create(ZI->getOperand(0),
2009 Constant::getNullValue(I.getType()),
2010 ConstantInt::getAllOnesValue(I.getType()));
2013 if (isa<PHINode>(LHS))
2014 if (Instruction *NV = FoldOpIntoPhi(I))
2017 ConstantInt *XorRHS = 0;
2019 if (isa<ConstantInt>(RHSC) &&
2020 match(LHS, m_Xor(m_Value(XorLHS), m_ConstantInt(XorRHS)))) {
2021 uint32_t TySizeBits = I.getType()->getPrimitiveSizeInBits();
2022 const APInt& RHSVal = cast<ConstantInt>(RHSC)->getValue();
2024 uint32_t Size = TySizeBits / 2;
2025 APInt C0080Val(APInt(TySizeBits, 1ULL).shl(Size - 1));
2026 APInt CFF80Val(-C0080Val);
2028 if (TySizeBits > Size) {
2029 // If we have ADD(XOR(AND(X, 0xFF), 0x80), 0xF..F80), it's a sext.
2030 // If we have ADD(XOR(AND(X, 0xFF), 0xF..F80), 0x80), it's a sext.
2031 if ((RHSVal == CFF80Val && XorRHS->getValue() == C0080Val) ||
2032 (RHSVal == C0080Val && XorRHS->getValue() == CFF80Val)) {
2033 // This is a sign extend if the top bits are known zero.
2034 if (!MaskedValueIsZero(XorLHS,
2035 APInt::getHighBitsSet(TySizeBits, TySizeBits - Size)))
2036 Size = 0; // Not a sign ext, but can't be any others either.
2041 C0080Val = APIntOps::lshr(C0080Val, Size);
2042 CFF80Val = APIntOps::ashr(CFF80Val, Size);
2043 } while (Size >= 1);
2045 // FIXME: This shouldn't be necessary. When the backends can handle types
2046 // with funny bit widths then this switch statement should be removed. It
2047 // is just here to get the size of the "middle" type back up to something
2048 // that the back ends can handle.
2049 const Type *MiddleType = 0;
2052 case 32: MiddleType = Type::Int32Ty; break;
2053 case 16: MiddleType = Type::Int16Ty; break;
2054 case 8: MiddleType = Type::Int8Ty; break;
2057 Instruction *NewTrunc = new TruncInst(XorLHS, MiddleType, "sext");
2058 InsertNewInstBefore(NewTrunc, I);
2059 return new SExtInst(NewTrunc, I.getType(), I.getName());
2064 if (I.getType() == Type::Int1Ty)
2065 return BinaryOperator::CreateXor(LHS, RHS);
2068 if (I.getType()->isInteger()) {
2069 if (Instruction *Result = AssociativeOpt(I, AddRHS(RHS))) return Result;
2071 if (Instruction *RHSI = dyn_cast<Instruction>(RHS)) {
2072 if (RHSI->getOpcode() == Instruction::Sub)
2073 if (LHS == RHSI->getOperand(1)) // A + (B - A) --> B
2074 return ReplaceInstUsesWith(I, RHSI->getOperand(0));
2076 if (Instruction *LHSI = dyn_cast<Instruction>(LHS)) {
2077 if (LHSI->getOpcode() == Instruction::Sub)
2078 if (RHS == LHSI->getOperand(1)) // (B - A) + A --> B
2079 return ReplaceInstUsesWith(I, LHSI->getOperand(0));
2084 // -A + -B --> -(A + B)
2085 if (Value *LHSV = dyn_castNegVal(LHS)) {
2086 if (LHS->getType()->isIntOrIntVector()) {
2087 if (Value *RHSV = dyn_castNegVal(RHS)) {
2088 Instruction *NewAdd = BinaryOperator::CreateAdd(LHSV, RHSV, "sum");
2089 InsertNewInstBefore(NewAdd, I);
2090 return BinaryOperator::CreateNeg(NewAdd);
2094 return BinaryOperator::CreateSub(RHS, LHSV);
2098 if (!isa<Constant>(RHS))
2099 if (Value *V = dyn_castNegVal(RHS))
2100 return BinaryOperator::CreateSub(LHS, V);
2104 if (Value *X = dyn_castFoldableMul(LHS, C2)) {
2105 if (X == RHS) // X*C + X --> X * (C+1)
2106 return BinaryOperator::CreateMul(RHS, AddOne(C2));
2108 // X*C1 + X*C2 --> X * (C1+C2)
2110 if (X == dyn_castFoldableMul(RHS, C1))
2111 return BinaryOperator::CreateMul(X, Add(C1, C2));
2114 // X + X*C --> X * (C+1)
2115 if (dyn_castFoldableMul(RHS, C2) == LHS)
2116 return BinaryOperator::CreateMul(LHS, AddOne(C2));
2118 // X + ~X --> -1 since ~X = -X-1
2119 if (dyn_castNotVal(LHS) == RHS || dyn_castNotVal(RHS) == LHS)
2120 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
2123 // (A & C1)+(B & C2) --> (A & C1)|(B & C2) iff C1&C2 == 0
2124 if (match(RHS, m_And(m_Value(), m_ConstantInt(C2))))
2125 if (Instruction *R = AssociativeOpt(I, AddMaskingAnd(C2)))
2128 // A+B --> A|B iff A and B have no bits set in common.
2129 if (const IntegerType *IT = dyn_cast<IntegerType>(I.getType())) {
2130 APInt Mask = APInt::getAllOnesValue(IT->getBitWidth());
2131 APInt LHSKnownOne(IT->getBitWidth(), 0);
2132 APInt LHSKnownZero(IT->getBitWidth(), 0);
2133 ComputeMaskedBits(LHS, Mask, LHSKnownZero, LHSKnownOne);
2134 if (LHSKnownZero != 0) {
2135 APInt RHSKnownOne(IT->getBitWidth(), 0);
2136 APInt RHSKnownZero(IT->getBitWidth(), 0);
2137 ComputeMaskedBits(RHS, Mask, RHSKnownZero, RHSKnownOne);
2139 // No bits in common -> bitwise or.
2140 if ((LHSKnownZero|RHSKnownZero).isAllOnesValue())
2141 return BinaryOperator::CreateOr(LHS, RHS);
2145 // W*X + Y*Z --> W * (X+Z) iff W == Y
2146 if (I.getType()->isIntOrIntVector()) {
2147 Value *W, *X, *Y, *Z;
2148 if (match(LHS, m_Mul(m_Value(W), m_Value(X))) &&
2149 match(RHS, m_Mul(m_Value(Y), m_Value(Z)))) {
2153 } else if (Y == X) {
2155 } else if (X == Z) {
2162 Value *NewAdd = InsertNewInstBefore(BinaryOperator::CreateAdd(X, Z,
2163 LHS->getName()), I);
2164 return BinaryOperator::CreateMul(W, NewAdd);
2169 if (ConstantInt *CRHS = dyn_cast<ConstantInt>(RHS)) {
2171 if (match(LHS, m_Not(m_Value(X)))) // ~X + C --> (C-1) - X
2172 return BinaryOperator::CreateSub(SubOne(CRHS), X);
2174 // (X & FF00) + xx00 -> (X+xx00) & FF00
2175 if (LHS->hasOneUse() && match(LHS, m_And(m_Value(X), m_ConstantInt(C2)))) {
2176 Constant *Anded = And(CRHS, C2);
2177 if (Anded == CRHS) {
2178 // See if all bits from the first bit set in the Add RHS up are included
2179 // in the mask. First, get the rightmost bit.
2180 const APInt& AddRHSV = CRHS->getValue();
2182 // Form a mask of all bits from the lowest bit added through the top.
2183 APInt AddRHSHighBits(~((AddRHSV & -AddRHSV)-1));
2185 // See if the and mask includes all of these bits.
2186 APInt AddRHSHighBitsAnd(AddRHSHighBits & C2->getValue());
2188 if (AddRHSHighBits == AddRHSHighBitsAnd) {
2189 // Okay, the xform is safe. Insert the new add pronto.
2190 Value *NewAdd = InsertNewInstBefore(BinaryOperator::CreateAdd(X, CRHS,
2191 LHS->getName()), I);
2192 return BinaryOperator::CreateAnd(NewAdd, C2);
2197 // Try to fold constant add into select arguments.
2198 if (SelectInst *SI = dyn_cast<SelectInst>(LHS))
2199 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2203 // add (cast *A to intptrtype) B ->
2204 // cast (GEP (cast *A to sbyte*) B) --> intptrtype
2206 CastInst *CI = dyn_cast<CastInst>(LHS);
2209 CI = dyn_cast<CastInst>(RHS);
2212 if (CI && CI->getType()->isSized() &&
2213 (CI->getType()->getPrimitiveSizeInBits() ==
2214 TD->getIntPtrType()->getPrimitiveSizeInBits())
2215 && isa<PointerType>(CI->getOperand(0)->getType())) {
2217 cast<PointerType>(CI->getOperand(0)->getType())->getAddressSpace();
2218 Value *I2 = InsertBitCastBefore(CI->getOperand(0),
2219 PointerType::get(Type::Int8Ty, AS), I);
2220 I2 = InsertNewInstBefore(GetElementPtrInst::Create(I2, Other, "ctg2"), I);
2221 return new PtrToIntInst(I2, CI->getType());
2225 // add (select X 0 (sub n A)) A --> select X A n
2227 SelectInst *SI = dyn_cast<SelectInst>(LHS);
2230 SI = dyn_cast<SelectInst>(RHS);
2233 if (SI && SI->hasOneUse()) {
2234 Value *TV = SI->getTrueValue();
2235 Value *FV = SI->getFalseValue();
2238 // Can we fold the add into the argument of the select?
2239 // We check both true and false select arguments for a matching subtract.
2240 if (match(FV, m_Zero()) && match(TV, m_Sub(m_Value(N), m_Specific(A))))
2241 // Fold the add into the true select value.
2242 return SelectInst::Create(SI->getCondition(), N, A);
2243 if (match(TV, m_Zero()) && match(FV, m_Sub(m_Value(N), m_Specific(A))))
2244 // Fold the add into the false select value.
2245 return SelectInst::Create(SI->getCondition(), A, N);
2249 // Check for X+0.0. Simplify it to X if we know X is not -0.0.
2250 if (ConstantFP *CFP = dyn_cast<ConstantFP>(RHS))
2251 if (CFP->getValueAPF().isPosZero() && CannotBeNegativeZero(LHS))
2252 return ReplaceInstUsesWith(I, LHS);
2254 // Check for (add (sext x), y), see if we can merge this into an
2255 // integer add followed by a sext.
2256 if (SExtInst *LHSConv = dyn_cast<SExtInst>(LHS)) {
2257 // (add (sext x), cst) --> (sext (add x, cst'))
2258 if (ConstantInt *RHSC = dyn_cast<ConstantInt>(RHS)) {
2260 ConstantExpr::getTrunc(RHSC, LHSConv->getOperand(0)->getType());
2261 if (LHSConv->hasOneUse() &&
2262 ConstantExpr::getSExt(CI, I.getType()) == RHSC &&
2263 WillNotOverflowSignedAdd(LHSConv->getOperand(0), CI)) {
2264 // Insert the new, smaller add.
2265 Instruction *NewAdd = BinaryOperator::CreateAdd(LHSConv->getOperand(0),
2267 InsertNewInstBefore(NewAdd, I);
2268 return new SExtInst(NewAdd, I.getType());
2272 // (add (sext x), (sext y)) --> (sext (add int x, y))
2273 if (SExtInst *RHSConv = dyn_cast<SExtInst>(RHS)) {
2274 // Only do this if x/y have the same type, if at last one of them has a
2275 // single use (so we don't increase the number of sexts), and if the
2276 // integer add will not overflow.
2277 if (LHSConv->getOperand(0)->getType()==RHSConv->getOperand(0)->getType()&&
2278 (LHSConv->hasOneUse() || RHSConv->hasOneUse()) &&
2279 WillNotOverflowSignedAdd(LHSConv->getOperand(0),
2280 RHSConv->getOperand(0))) {
2281 // Insert the new integer add.
2282 Instruction *NewAdd = BinaryOperator::CreateAdd(LHSConv->getOperand(0),
2283 RHSConv->getOperand(0),
2285 InsertNewInstBefore(NewAdd, I);
2286 return new SExtInst(NewAdd, I.getType());
2291 // Check for (add double (sitofp x), y), see if we can merge this into an
2292 // integer add followed by a promotion.
2293 if (SIToFPInst *LHSConv = dyn_cast<SIToFPInst>(LHS)) {
2294 // (add double (sitofp x), fpcst) --> (sitofp (add int x, intcst))
2295 // ... if the constant fits in the integer value. This is useful for things
2296 // like (double)(x & 1234) + 4.0 -> (double)((X & 1234)+4) which no longer
2297 // requires a constant pool load, and generally allows the add to be better
2299 if (ConstantFP *CFP = dyn_cast<ConstantFP>(RHS)) {
2301 ConstantExpr::getFPToSI(CFP, LHSConv->getOperand(0)->getType());
2302 if (LHSConv->hasOneUse() &&
2303 ConstantExpr::getSIToFP(CI, I.getType()) == CFP &&
2304 WillNotOverflowSignedAdd(LHSConv->getOperand(0), CI)) {
2305 // Insert the new integer add.
2306 Instruction *NewAdd = BinaryOperator::CreateAdd(LHSConv->getOperand(0),
2308 InsertNewInstBefore(NewAdd, I);
2309 return new SIToFPInst(NewAdd, I.getType());
2313 // (add double (sitofp x), (sitofp y)) --> (sitofp (add int x, y))
2314 if (SIToFPInst *RHSConv = dyn_cast<SIToFPInst>(RHS)) {
2315 // Only do this if x/y have the same type, if at last one of them has a
2316 // single use (so we don't increase the number of int->fp conversions),
2317 // and if the integer add will not overflow.
2318 if (LHSConv->getOperand(0)->getType()==RHSConv->getOperand(0)->getType()&&
2319 (LHSConv->hasOneUse() || RHSConv->hasOneUse()) &&
2320 WillNotOverflowSignedAdd(LHSConv->getOperand(0),
2321 RHSConv->getOperand(0))) {
2322 // Insert the new integer add.
2323 Instruction *NewAdd = BinaryOperator::CreateAdd(LHSConv->getOperand(0),
2324 RHSConv->getOperand(0),
2326 InsertNewInstBefore(NewAdd, I);
2327 return new SIToFPInst(NewAdd, I.getType());
2332 return Changed ? &I : 0;
2335 Instruction *InstCombiner::visitSub(BinaryOperator &I) {
2336 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2338 if (Op0 == Op1 && // sub X, X -> 0
2339 !I.getType()->isFPOrFPVector())
2340 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2342 // If this is a 'B = x-(-A)', change to B = x+A...
2343 if (Value *V = dyn_castNegVal(Op1))
2344 return BinaryOperator::CreateAdd(Op0, V);
2346 if (isa<UndefValue>(Op0))
2347 return ReplaceInstUsesWith(I, Op0); // undef - X -> undef
2348 if (isa<UndefValue>(Op1))
2349 return ReplaceInstUsesWith(I, Op1); // X - undef -> undef
2351 if (ConstantInt *C = dyn_cast<ConstantInt>(Op0)) {
2352 // Replace (-1 - A) with (~A)...
2353 if (C->isAllOnesValue())
2354 return BinaryOperator::CreateNot(Op1);
2356 // C - ~X == X + (1+C)
2358 if (match(Op1, m_Not(m_Value(X))))
2359 return BinaryOperator::CreateAdd(X, AddOne(C));
2361 // -(X >>u 31) -> (X >>s 31)
2362 // -(X >>s 31) -> (X >>u 31)
2364 if (BinaryOperator *SI = dyn_cast<BinaryOperator>(Op1)) {
2365 if (SI->getOpcode() == Instruction::LShr) {
2366 if (ConstantInt *CU = dyn_cast<ConstantInt>(SI->getOperand(1))) {
2367 // Check to see if we are shifting out everything but the sign bit.
2368 if (CU->getLimitedValue(SI->getType()->getPrimitiveSizeInBits()) ==
2369 SI->getType()->getPrimitiveSizeInBits()-1) {
2370 // Ok, the transformation is safe. Insert AShr.
2371 return BinaryOperator::Create(Instruction::AShr,
2372 SI->getOperand(0), CU, SI->getName());
2376 else if (SI->getOpcode() == Instruction::AShr) {
2377 if (ConstantInt *CU = dyn_cast<ConstantInt>(SI->getOperand(1))) {
2378 // Check to see if we are shifting out everything but the sign bit.
2379 if (CU->getLimitedValue(SI->getType()->getPrimitiveSizeInBits()) ==
2380 SI->getType()->getPrimitiveSizeInBits()-1) {
2381 // Ok, the transformation is safe. Insert LShr.
2382 return BinaryOperator::CreateLShr(
2383 SI->getOperand(0), CU, SI->getName());
2390 // Try to fold constant sub into select arguments.
2391 if (SelectInst *SI = dyn_cast<SelectInst>(Op1))
2392 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2396 if (I.getType() == Type::Int1Ty)
2397 return BinaryOperator::CreateXor(Op0, Op1);
2399 if (BinaryOperator *Op1I = dyn_cast<BinaryOperator>(Op1)) {
2400 if (Op1I->getOpcode() == Instruction::Add &&
2401 !Op0->getType()->isFPOrFPVector()) {
2402 if (Op1I->getOperand(0) == Op0) // X-(X+Y) == -Y
2403 return BinaryOperator::CreateNeg(Op1I->getOperand(1), I.getName());
2404 else if (Op1I->getOperand(1) == Op0) // X-(Y+X) == -Y
2405 return BinaryOperator::CreateNeg(Op1I->getOperand(0), I.getName());
2406 else if (ConstantInt *CI1 = dyn_cast<ConstantInt>(I.getOperand(0))) {
2407 if (ConstantInt *CI2 = dyn_cast<ConstantInt>(Op1I->getOperand(1)))
2408 // C1-(X+C2) --> (C1-C2)-X
2409 return BinaryOperator::CreateSub(Subtract(CI1, CI2),
2410 Op1I->getOperand(0));
2414 if (Op1I->hasOneUse()) {
2415 // Replace (x - (y - z)) with (x + (z - y)) if the (y - z) subexpression
2416 // is not used by anyone else...
2418 if (Op1I->getOpcode() == Instruction::Sub &&
2419 !Op1I->getType()->isFPOrFPVector()) {
2420 // Swap the two operands of the subexpr...
2421 Value *IIOp0 = Op1I->getOperand(0), *IIOp1 = Op1I->getOperand(1);
2422 Op1I->setOperand(0, IIOp1);
2423 Op1I->setOperand(1, IIOp0);
2425 // Create the new top level add instruction...
2426 return BinaryOperator::CreateAdd(Op0, Op1);
2429 // Replace (A - (A & B)) with (A & ~B) if this is the only use of (A&B)...
2431 if (Op1I->getOpcode() == Instruction::And &&
2432 (Op1I->getOperand(0) == Op0 || Op1I->getOperand(1) == Op0)) {
2433 Value *OtherOp = Op1I->getOperand(Op1I->getOperand(0) == Op0);
2436 InsertNewInstBefore(BinaryOperator::CreateNot(OtherOp, "B.not"), I);
2437 return BinaryOperator::CreateAnd(Op0, NewNot);
2440 // 0 - (X sdiv C) -> (X sdiv -C)
2441 if (Op1I->getOpcode() == Instruction::SDiv)
2442 if (ConstantInt *CSI = dyn_cast<ConstantInt>(Op0))
2444 if (Constant *DivRHS = dyn_cast<Constant>(Op1I->getOperand(1)))
2445 return BinaryOperator::CreateSDiv(Op1I->getOperand(0),
2446 ConstantExpr::getNeg(DivRHS));
2448 // X - X*C --> X * (1-C)
2449 ConstantInt *C2 = 0;
2450 if (dyn_castFoldableMul(Op1I, C2) == Op0) {
2451 Constant *CP1 = Subtract(ConstantInt::get(I.getType(), 1), C2);
2452 return BinaryOperator::CreateMul(Op0, CP1);
2457 if (!Op0->getType()->isFPOrFPVector())
2458 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0)) {
2459 if (Op0I->getOpcode() == Instruction::Add) {
2460 if (Op0I->getOperand(0) == Op1) // (Y+X)-Y == X
2461 return ReplaceInstUsesWith(I, Op0I->getOperand(1));
2462 else if (Op0I->getOperand(1) == Op1) // (X+Y)-Y == X
2463 return ReplaceInstUsesWith(I, Op0I->getOperand(0));
2464 } else if (Op0I->getOpcode() == Instruction::Sub) {
2465 if (Op0I->getOperand(0) == Op1) // (X-Y)-X == -Y
2466 return BinaryOperator::CreateNeg(Op0I->getOperand(1), I.getName());
2471 if (Value *X = dyn_castFoldableMul(Op0, C1)) {
2472 if (X == Op1) // X*C - X --> X * (C-1)
2473 return BinaryOperator::CreateMul(Op1, SubOne(C1));
2475 ConstantInt *C2; // X*C1 - X*C2 -> X * (C1-C2)
2476 if (X == dyn_castFoldableMul(Op1, C2))
2477 return BinaryOperator::CreateMul(X, Subtract(C1, C2));
2482 /// isSignBitCheck - Given an exploded icmp instruction, return true if the
2483 /// comparison only checks the sign bit. If it only checks the sign bit, set
2484 /// TrueIfSigned if the result of the comparison is true when the input value is
2486 static bool isSignBitCheck(ICmpInst::Predicate pred, ConstantInt *RHS,
2487 bool &TrueIfSigned) {
2489 case ICmpInst::ICMP_SLT: // True if LHS s< 0
2490 TrueIfSigned = true;
2491 return RHS->isZero();
2492 case ICmpInst::ICMP_SLE: // True if LHS s<= RHS and RHS == -1
2493 TrueIfSigned = true;
2494 return RHS->isAllOnesValue();
2495 case ICmpInst::ICMP_SGT: // True if LHS s> -1
2496 TrueIfSigned = false;
2497 return RHS->isAllOnesValue();
2498 case ICmpInst::ICMP_UGT:
2499 // True if LHS u> RHS and RHS == high-bit-mask - 1
2500 TrueIfSigned = true;
2501 return RHS->getValue() ==
2502 APInt::getSignedMaxValue(RHS->getType()->getPrimitiveSizeInBits());
2503 case ICmpInst::ICMP_UGE:
2504 // True if LHS u>= RHS and RHS == high-bit-mask (2^7, 2^15, 2^31, etc)
2505 TrueIfSigned = true;
2506 return RHS->getValue().isSignBit();
2512 Instruction *InstCombiner::visitMul(BinaryOperator &I) {
2513 bool Changed = SimplifyCommutative(I);
2514 Value *Op0 = I.getOperand(0);
2516 if (isa<UndefValue>(I.getOperand(1))) // undef * X -> 0
2517 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2519 // Simplify mul instructions with a constant RHS...
2520 if (Constant *Op1 = dyn_cast<Constant>(I.getOperand(1))) {
2521 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
2523 // ((X << C1)*C2) == (X * (C2 << C1))
2524 if (BinaryOperator *SI = dyn_cast<BinaryOperator>(Op0))
2525 if (SI->getOpcode() == Instruction::Shl)
2526 if (Constant *ShOp = dyn_cast<Constant>(SI->getOperand(1)))
2527 return BinaryOperator::CreateMul(SI->getOperand(0),
2528 ConstantExpr::getShl(CI, ShOp));
2531 return ReplaceInstUsesWith(I, Op1); // X * 0 == 0
2532 if (CI->equalsInt(1)) // X * 1 == X
2533 return ReplaceInstUsesWith(I, Op0);
2534 if (CI->isAllOnesValue()) // X * -1 == 0 - X
2535 return BinaryOperator::CreateNeg(Op0, I.getName());
2537 const APInt& Val = cast<ConstantInt>(CI)->getValue();
2538 if (Val.isPowerOf2()) { // Replace X*(2^C) with X << C
2539 return BinaryOperator::CreateShl(Op0,
2540 ConstantInt::get(Op0->getType(), Val.logBase2()));
2542 } else if (ConstantFP *Op1F = dyn_cast<ConstantFP>(Op1)) {
2543 if (Op1F->isNullValue())
2544 return ReplaceInstUsesWith(I, Op1);
2546 // "In IEEE floating point, x*1 is not equivalent to x for nans. However,
2547 // ANSI says we can drop signals, so we can do this anyway." (from GCC)
2548 if (Op1F->isExactlyValue(1.0))
2549 return ReplaceInstUsesWith(I, Op0); // Eliminate 'mul double %X, 1.0'
2550 } else if (isa<VectorType>(Op1->getType())) {
2551 if (isa<ConstantAggregateZero>(Op1))
2552 return ReplaceInstUsesWith(I, Op1);
2554 if (ConstantVector *Op1V = dyn_cast<ConstantVector>(Op1)) {
2555 if (Op1V->isAllOnesValue()) // X * -1 == 0 - X
2556 return BinaryOperator::CreateNeg(Op0, I.getName());
2558 // As above, vector X*splat(1.0) -> X in all defined cases.
2559 if (Constant *Splat = Op1V->getSplatValue()) {
2560 if (ConstantFP *F = dyn_cast<ConstantFP>(Splat))
2561 if (F->isExactlyValue(1.0))
2562 return ReplaceInstUsesWith(I, Op0);
2563 if (ConstantInt *CI = dyn_cast<ConstantInt>(Splat))
2564 if (CI->equalsInt(1))
2565 return ReplaceInstUsesWith(I, Op0);
2570 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0))
2571 if (Op0I->getOpcode() == Instruction::Add && Op0I->hasOneUse() &&
2572 isa<ConstantInt>(Op0I->getOperand(1)) && isa<ConstantInt>(Op1)) {
2573 // Canonicalize (X+C1)*C2 -> X*C2+C1*C2.
2574 Instruction *Add = BinaryOperator::CreateMul(Op0I->getOperand(0),
2576 InsertNewInstBefore(Add, I);
2577 Value *C1C2 = ConstantExpr::getMul(Op1,
2578 cast<Constant>(Op0I->getOperand(1)));
2579 return BinaryOperator::CreateAdd(Add, C1C2);
2583 // Try to fold constant mul into select arguments.
2584 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
2585 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2588 if (isa<PHINode>(Op0))
2589 if (Instruction *NV = FoldOpIntoPhi(I))
2593 if (Value *Op0v = dyn_castNegVal(Op0)) // -X * -Y = X*Y
2594 if (Value *Op1v = dyn_castNegVal(I.getOperand(1)))
2595 return BinaryOperator::CreateMul(Op0v, Op1v);
2597 // (X / Y) * Y = X - (X % Y)
2598 // (X / Y) * -Y = (X % Y) - X
2600 Value *Op1 = I.getOperand(1);
2601 BinaryOperator *BO = dyn_cast<BinaryOperator>(Op0);
2603 (BO->getOpcode() != Instruction::UDiv &&
2604 BO->getOpcode() != Instruction::SDiv)) {
2606 BO = dyn_cast<BinaryOperator>(I.getOperand(1));
2608 Value *Neg = dyn_castNegVal(Op1);
2609 if (BO && BO->hasOneUse() &&
2610 (BO->getOperand(1) == Op1 || BO->getOperand(1) == Neg) &&
2611 (BO->getOpcode() == Instruction::UDiv ||
2612 BO->getOpcode() == Instruction::SDiv)) {
2613 Value *Op0BO = BO->getOperand(0), *Op1BO = BO->getOperand(1);
2616 if (BO->getOpcode() == Instruction::UDiv)
2617 Rem = BinaryOperator::CreateURem(Op0BO, Op1BO);
2619 Rem = BinaryOperator::CreateSRem(Op0BO, Op1BO);
2621 InsertNewInstBefore(Rem, I);
2625 return BinaryOperator::CreateSub(Op0BO, Rem);
2627 return BinaryOperator::CreateSub(Rem, Op0BO);
2631 if (I.getType() == Type::Int1Ty)
2632 return BinaryOperator::CreateAnd(Op0, I.getOperand(1));
2634 // If one of the operands of the multiply is a cast from a boolean value, then
2635 // we know the bool is either zero or one, so this is a 'masking' multiply.
2636 // See if we can simplify things based on how the boolean was originally
2638 CastInst *BoolCast = 0;
2639 if (ZExtInst *CI = dyn_cast<ZExtInst>(Op0))
2640 if (CI->getOperand(0)->getType() == Type::Int1Ty)
2643 if (ZExtInst *CI = dyn_cast<ZExtInst>(I.getOperand(1)))
2644 if (CI->getOperand(0)->getType() == Type::Int1Ty)
2647 if (ICmpInst *SCI = dyn_cast<ICmpInst>(BoolCast->getOperand(0))) {
2648 Value *SCIOp0 = SCI->getOperand(0), *SCIOp1 = SCI->getOperand(1);
2649 const Type *SCOpTy = SCIOp0->getType();
2652 // If the icmp is true iff the sign bit of X is set, then convert this
2653 // multiply into a shift/and combination.
2654 if (isa<ConstantInt>(SCIOp1) &&
2655 isSignBitCheck(SCI->getPredicate(), cast<ConstantInt>(SCIOp1), TIS) &&
2657 // Shift the X value right to turn it into "all signbits".
2658 Constant *Amt = ConstantInt::get(SCIOp0->getType(),
2659 SCOpTy->getPrimitiveSizeInBits()-1);
2661 InsertNewInstBefore(
2662 BinaryOperator::Create(Instruction::AShr, SCIOp0, Amt,
2663 BoolCast->getOperand(0)->getName()+
2666 // If the multiply type is not the same as the source type, sign extend
2667 // or truncate to the multiply type.
2668 if (I.getType() != V->getType()) {
2669 uint32_t SrcBits = V->getType()->getPrimitiveSizeInBits();
2670 uint32_t DstBits = I.getType()->getPrimitiveSizeInBits();
2671 Instruction::CastOps opcode =
2672 (SrcBits == DstBits ? Instruction::BitCast :
2673 (SrcBits < DstBits ? Instruction::SExt : Instruction::Trunc));
2674 V = InsertCastBefore(opcode, V, I.getType(), I);
2677 Value *OtherOp = Op0 == BoolCast ? I.getOperand(1) : Op0;
2678 return BinaryOperator::CreateAnd(V, OtherOp);
2683 return Changed ? &I : 0;
2686 /// SimplifyDivRemOfSelect - Try to fold a divide or remainder of a select
2688 bool InstCombiner::SimplifyDivRemOfSelect(BinaryOperator &I) {
2689 SelectInst *SI = cast<SelectInst>(I.getOperand(1));
2691 // div/rem X, (Cond ? 0 : Y) -> div/rem X, Y
2692 int NonNullOperand = -1;
2693 if (Constant *ST = dyn_cast<Constant>(SI->getOperand(1)))
2694 if (ST->isNullValue())
2696 // div/rem X, (Cond ? Y : 0) -> div/rem X, Y
2697 if (Constant *ST = dyn_cast<Constant>(SI->getOperand(2)))
2698 if (ST->isNullValue())
2701 if (NonNullOperand == -1)
2704 Value *SelectCond = SI->getOperand(0);
2706 // Change the div/rem to use 'Y' instead of the select.
2707 I.setOperand(1, SI->getOperand(NonNullOperand));
2709 // Okay, we know we replace the operand of the div/rem with 'Y' with no
2710 // problem. However, the select, or the condition of the select may have
2711 // multiple uses. Based on our knowledge that the operand must be non-zero,
2712 // propagate the known value for the select into other uses of it, and
2713 // propagate a known value of the condition into its other users.
2715 // If the select and condition only have a single use, don't bother with this,
2717 if (SI->use_empty() && SelectCond->hasOneUse())
2720 // Scan the current block backward, looking for other uses of SI.
2721 BasicBlock::iterator BBI = &I, BBFront = I.getParent()->begin();
2723 while (BBI != BBFront) {
2725 // If we found a call to a function, we can't assume it will return, so
2726 // information from below it cannot be propagated above it.
2727 if (isa<CallInst>(BBI) && !isa<IntrinsicInst>(BBI))
2730 // Replace uses of the select or its condition with the known values.
2731 for (Instruction::op_iterator I = BBI->op_begin(), E = BBI->op_end();
2734 *I = SI->getOperand(NonNullOperand);
2736 } else if (*I == SelectCond) {
2737 *I = NonNullOperand == 1 ? ConstantInt::getTrue() :
2738 ConstantInt::getFalse();
2743 // If we past the instruction, quit looking for it.
2746 if (&*BBI == SelectCond)
2749 // If we ran out of things to eliminate, break out of the loop.
2750 if (SelectCond == 0 && SI == 0)
2758 /// This function implements the transforms on div instructions that work
2759 /// regardless of the kind of div instruction it is (udiv, sdiv, or fdiv). It is
2760 /// used by the visitors to those instructions.
2761 /// @brief Transforms common to all three div instructions
2762 Instruction *InstCombiner::commonDivTransforms(BinaryOperator &I) {
2763 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2765 // undef / X -> 0 for integer.
2766 // undef / X -> undef for FP (the undef could be a snan).
2767 if (isa<UndefValue>(Op0)) {
2768 if (Op0->getType()->isFPOrFPVector())
2769 return ReplaceInstUsesWith(I, Op0);
2770 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2773 // X / undef -> undef
2774 if (isa<UndefValue>(Op1))
2775 return ReplaceInstUsesWith(I, Op1);
2780 /// This function implements the transforms common to both integer division
2781 /// instructions (udiv and sdiv). It is called by the visitors to those integer
2782 /// division instructions.
2783 /// @brief Common integer divide transforms
2784 Instruction *InstCombiner::commonIDivTransforms(BinaryOperator &I) {
2785 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2787 // (sdiv X, X) --> 1 (udiv X, X) --> 1
2789 if (const VectorType *Ty = dyn_cast<VectorType>(I.getType())) {
2790 ConstantInt *CI = ConstantInt::get(Ty->getElementType(), 1);
2791 std::vector<Constant*> Elts(Ty->getNumElements(), CI);
2792 return ReplaceInstUsesWith(I, ConstantVector::get(Elts));
2795 ConstantInt *CI = ConstantInt::get(I.getType(), 1);
2796 return ReplaceInstUsesWith(I, CI);
2799 if (Instruction *Common = commonDivTransforms(I))
2802 // Handle cases involving: [su]div X, (select Cond, Y, Z)
2803 // This does not apply for fdiv.
2804 if (isa<SelectInst>(Op1) && SimplifyDivRemOfSelect(I))
2807 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
2809 if (RHS->equalsInt(1))
2810 return ReplaceInstUsesWith(I, Op0);
2812 // (X / C1) / C2 -> X / (C1*C2)
2813 if (Instruction *LHS = dyn_cast<Instruction>(Op0))
2814 if (Instruction::BinaryOps(LHS->getOpcode()) == I.getOpcode())
2815 if (ConstantInt *LHSRHS = dyn_cast<ConstantInt>(LHS->getOperand(1))) {
2816 if (MultiplyOverflows(RHS, LHSRHS, I.getOpcode()==Instruction::SDiv))
2817 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2819 return BinaryOperator::Create(I.getOpcode(), LHS->getOperand(0),
2820 Multiply(RHS, LHSRHS));
2823 if (!RHS->isZero()) { // avoid X udiv 0
2824 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
2825 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2827 if (isa<PHINode>(Op0))
2828 if (Instruction *NV = FoldOpIntoPhi(I))
2833 // 0 / X == 0, we don't need to preserve faults!
2834 if (ConstantInt *LHS = dyn_cast<ConstantInt>(Op0))
2835 if (LHS->equalsInt(0))
2836 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2838 // It can't be division by zero, hence it must be division by one.
2839 if (I.getType() == Type::Int1Ty)
2840 return ReplaceInstUsesWith(I, Op0);
2842 if (ConstantVector *Op1V = dyn_cast<ConstantVector>(Op1)) {
2843 if (ConstantInt *X = cast_or_null<ConstantInt>(Op1V->getSplatValue()))
2846 return ReplaceInstUsesWith(I, Op0);
2852 Instruction *InstCombiner::visitUDiv(BinaryOperator &I) {
2853 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2855 // Handle the integer div common cases
2856 if (Instruction *Common = commonIDivTransforms(I))
2859 if (ConstantInt *C = dyn_cast<ConstantInt>(Op1)) {
2860 // X udiv C^2 -> X >> C
2861 // Check to see if this is an unsigned division with an exact power of 2,
2862 // if so, convert to a right shift.
2863 if (C->getValue().isPowerOf2()) // 0 not included in isPowerOf2
2864 return BinaryOperator::CreateLShr(Op0,
2865 ConstantInt::get(Op0->getType(), C->getValue().logBase2()));
2867 // X udiv C, where C >= signbit
2868 if (C->getValue().isNegative()) {
2869 Value *IC = InsertNewInstBefore(new ICmpInst(ICmpInst::ICMP_ULT, Op0, C),
2871 return SelectInst::Create(IC, Constant::getNullValue(I.getType()),
2872 ConstantInt::get(I.getType(), 1));
2876 // X udiv (C1 << N), where C1 is "1<<C2" --> X >> (N+C2)
2877 if (BinaryOperator *RHSI = dyn_cast<BinaryOperator>(I.getOperand(1))) {
2878 if (RHSI->getOpcode() == Instruction::Shl &&
2879 isa<ConstantInt>(RHSI->getOperand(0))) {
2880 const APInt& C1 = cast<ConstantInt>(RHSI->getOperand(0))->getValue();
2881 if (C1.isPowerOf2()) {
2882 Value *N = RHSI->getOperand(1);
2883 const Type *NTy = N->getType();
2884 if (uint32_t C2 = C1.logBase2()) {
2885 Constant *C2V = ConstantInt::get(NTy, C2);
2886 N = InsertNewInstBefore(BinaryOperator::CreateAdd(N, C2V, "tmp"), I);
2888 return BinaryOperator::CreateLShr(Op0, N);
2893 // udiv X, (Select Cond, C1, C2) --> Select Cond, (shr X, C1), (shr X, C2)
2894 // where C1&C2 are powers of two.
2895 if (SelectInst *SI = dyn_cast<SelectInst>(Op1))
2896 if (ConstantInt *STO = dyn_cast<ConstantInt>(SI->getOperand(1)))
2897 if (ConstantInt *SFO = dyn_cast<ConstantInt>(SI->getOperand(2))) {
2898 const APInt &TVA = STO->getValue(), &FVA = SFO->getValue();
2899 if (TVA.isPowerOf2() && FVA.isPowerOf2()) {
2900 // Compute the shift amounts
2901 uint32_t TSA = TVA.logBase2(), FSA = FVA.logBase2();
2902 // Construct the "on true" case of the select
2903 Constant *TC = ConstantInt::get(Op0->getType(), TSA);
2904 Instruction *TSI = BinaryOperator::CreateLShr(
2905 Op0, TC, SI->getName()+".t");
2906 TSI = InsertNewInstBefore(TSI, I);
2908 // Construct the "on false" case of the select
2909 Constant *FC = ConstantInt::get(Op0->getType(), FSA);
2910 Instruction *FSI = BinaryOperator::CreateLShr(
2911 Op0, FC, SI->getName()+".f");
2912 FSI = InsertNewInstBefore(FSI, I);
2914 // construct the select instruction and return it.
2915 return SelectInst::Create(SI->getOperand(0), TSI, FSI, SI->getName());
2921 Instruction *InstCombiner::visitSDiv(BinaryOperator &I) {
2922 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2924 // Handle the integer div common cases
2925 if (Instruction *Common = commonIDivTransforms(I))
2928 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
2930 if (RHS->isAllOnesValue())
2931 return BinaryOperator::CreateNeg(Op0);
2933 // -X/C -> X/-C, if and only if negation doesn't overflow.
2934 if (Value *LHSNeg = dyn_castNegVal(Op0)) {
2935 if (ConstantInt *CI = dyn_cast<ConstantInt>(LHSNeg)) {
2936 Constant *RHSNeg = ConstantExpr::getNeg(RHS);
2937 if (RHS != RHSNeg) { // Check that there is no overflow.
2938 Constant *CINeg = ConstantExpr::getNeg(CI);
2939 if (CI != CINeg) // Check that there is no overflow.
2940 return BinaryOperator::CreateSDiv(LHSNeg, RHSNeg);
2946 // If the sign bits of both operands are zero (i.e. we can prove they are
2947 // unsigned inputs), turn this into a udiv.
2948 if (I.getType()->isInteger()) {
2949 APInt Mask(APInt::getSignBit(I.getType()->getPrimitiveSizeInBits()));
2950 if (MaskedValueIsZero(Op1, Mask) && MaskedValueIsZero(Op0, Mask)) {
2951 // X sdiv Y -> X udiv Y, iff X and Y don't have sign bit set
2952 return BinaryOperator::CreateUDiv(Op0, Op1, I.getName());
2959 Instruction *InstCombiner::visitFDiv(BinaryOperator &I) {
2960 return commonDivTransforms(I);
2963 /// This function implements the transforms on rem instructions that work
2964 /// regardless of the kind of rem instruction it is (urem, srem, or frem). It
2965 /// is used by the visitors to those instructions.
2966 /// @brief Transforms common to all three rem instructions
2967 Instruction *InstCombiner::commonRemTransforms(BinaryOperator &I) {
2968 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2970 // 0 % X == 0 for integer, we don't need to preserve faults!
2971 if (Constant *LHS = dyn_cast<Constant>(Op0))
2972 if (LHS->isNullValue())
2973 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2975 if (isa<UndefValue>(Op0)) { // undef % X -> 0
2976 if (I.getType()->isFPOrFPVector())
2977 return ReplaceInstUsesWith(I, Op0); // X % undef -> undef (could be SNaN)
2978 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2980 if (isa<UndefValue>(Op1))
2981 return ReplaceInstUsesWith(I, Op1); // X % undef -> undef
2983 // Handle cases involving: rem X, (select Cond, Y, Z)
2984 if (isa<SelectInst>(Op1) && SimplifyDivRemOfSelect(I))
2990 /// This function implements the transforms common to both integer remainder
2991 /// instructions (urem and srem). It is called by the visitors to those integer
2992 /// remainder instructions.
2993 /// @brief Common integer remainder transforms
2994 Instruction *InstCombiner::commonIRemTransforms(BinaryOperator &I) {
2995 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2997 if (Instruction *common = commonRemTransforms(I))
3000 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
3001 // X % 0 == undef, we don't need to preserve faults!
3002 if (RHS->equalsInt(0))
3003 return ReplaceInstUsesWith(I, UndefValue::get(I.getType()));
3005 if (RHS->equalsInt(1)) // X % 1 == 0
3006 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
3008 if (Instruction *Op0I = dyn_cast<Instruction>(Op0)) {
3009 if (SelectInst *SI = dyn_cast<SelectInst>(Op0I)) {
3010 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
3012 } else if (isa<PHINode>(Op0I)) {
3013 if (Instruction *NV = FoldOpIntoPhi(I))
3017 // See if we can fold away this rem instruction.
3018 uint32_t BitWidth = cast<IntegerType>(I.getType())->getBitWidth();
3019 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
3020 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
3021 KnownZero, KnownOne))
3029 Instruction *InstCombiner::visitURem(BinaryOperator &I) {
3030 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3032 if (Instruction *common = commonIRemTransforms(I))
3035 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
3036 // X urem C^2 -> X and C
3037 // Check to see if this is an unsigned remainder with an exact power of 2,
3038 // if so, convert to a bitwise and.
3039 if (ConstantInt *C = dyn_cast<ConstantInt>(RHS))
3040 if (C->getValue().isPowerOf2())
3041 return BinaryOperator::CreateAnd(Op0, SubOne(C));
3044 if (Instruction *RHSI = dyn_cast<Instruction>(I.getOperand(1))) {
3045 // Turn A % (C << N), where C is 2^k, into A & ((C << N)-1)
3046 if (RHSI->getOpcode() == Instruction::Shl &&
3047 isa<ConstantInt>(RHSI->getOperand(0))) {
3048 if (cast<ConstantInt>(RHSI->getOperand(0))->getValue().isPowerOf2()) {
3049 Constant *N1 = ConstantInt::getAllOnesValue(I.getType());
3050 Value *Add = InsertNewInstBefore(BinaryOperator::CreateAdd(RHSI, N1,
3052 return BinaryOperator::CreateAnd(Op0, Add);
3057 // urem X, (select Cond, 2^C1, 2^C2) --> select Cond, (and X, C1), (and X, C2)
3058 // where C1&C2 are powers of two.
3059 if (SelectInst *SI = dyn_cast<SelectInst>(Op1)) {
3060 if (ConstantInt *STO = dyn_cast<ConstantInt>(SI->getOperand(1)))
3061 if (ConstantInt *SFO = dyn_cast<ConstantInt>(SI->getOperand(2))) {
3062 // STO == 0 and SFO == 0 handled above.
3063 if ((STO->getValue().isPowerOf2()) &&
3064 (SFO->getValue().isPowerOf2())) {
3065 Value *TrueAnd = InsertNewInstBefore(
3066 BinaryOperator::CreateAnd(Op0, SubOne(STO), SI->getName()+".t"), I);
3067 Value *FalseAnd = InsertNewInstBefore(
3068 BinaryOperator::CreateAnd(Op0, SubOne(SFO), SI->getName()+".f"), I);
3069 return SelectInst::Create(SI->getOperand(0), TrueAnd, FalseAnd);
3077 Instruction *InstCombiner::visitSRem(BinaryOperator &I) {
3078 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3080 // Handle the integer rem common cases
3081 if (Instruction *common = commonIRemTransforms(I))
3084 if (Value *RHSNeg = dyn_castNegVal(Op1))
3085 if (!isa<Constant>(RHSNeg) ||
3086 (isa<ConstantInt>(RHSNeg) &&
3087 cast<ConstantInt>(RHSNeg)->getValue().isStrictlyPositive())) {
3089 AddUsesToWorkList(I);
3090 I.setOperand(1, RHSNeg);
3094 // If the sign bits of both operands are zero (i.e. we can prove they are
3095 // unsigned inputs), turn this into a urem.
3096 if (I.getType()->isInteger()) {
3097 APInt Mask(APInt::getSignBit(I.getType()->getPrimitiveSizeInBits()));
3098 if (MaskedValueIsZero(Op1, Mask) && MaskedValueIsZero(Op0, Mask)) {
3099 // X srem Y -> X urem Y, iff X and Y don't have sign bit set
3100 return BinaryOperator::CreateURem(Op0, Op1, I.getName());
3107 Instruction *InstCombiner::visitFRem(BinaryOperator &I) {
3108 return commonRemTransforms(I);
3111 // isOneBitSet - Return true if there is exactly one bit set in the specified
3113 static bool isOneBitSet(const ConstantInt *CI) {
3114 return CI->getValue().isPowerOf2();
3117 // isHighOnes - Return true if the constant is of the form 1+0+.
3118 // This is the same as lowones(~X).
3119 static bool isHighOnes(const ConstantInt *CI) {
3120 return (~CI->getValue() + 1).isPowerOf2();
3123 /// getICmpCode - Encode a icmp predicate into a three bit mask. These bits
3124 /// are carefully arranged to allow folding of expressions such as:
3126 /// (A < B) | (A > B) --> (A != B)
3128 /// Note that this is only valid if the first and second predicates have the
3129 /// same sign. Is illegal to do: (A u< B) | (A s> B)
3131 /// Three bits are used to represent the condition, as follows:
3136 /// <=> Value Definition
3137 /// 000 0 Always false
3144 /// 111 7 Always true
3146 static unsigned getICmpCode(const ICmpInst *ICI) {
3147 switch (ICI->getPredicate()) {
3149 case ICmpInst::ICMP_UGT: return 1; // 001
3150 case ICmpInst::ICMP_SGT: return 1; // 001
3151 case ICmpInst::ICMP_EQ: return 2; // 010
3152 case ICmpInst::ICMP_UGE: return 3; // 011
3153 case ICmpInst::ICMP_SGE: return 3; // 011
3154 case ICmpInst::ICMP_ULT: return 4; // 100
3155 case ICmpInst::ICMP_SLT: return 4; // 100
3156 case ICmpInst::ICMP_NE: return 5; // 101
3157 case ICmpInst::ICMP_ULE: return 6; // 110
3158 case ICmpInst::ICMP_SLE: return 6; // 110
3161 assert(0 && "Invalid ICmp predicate!");
3166 /// getFCmpCode - Similar to getICmpCode but for FCmpInst. This encodes a fcmp
3167 /// predicate into a three bit mask. It also returns whether it is an ordered
3168 /// predicate by reference.
3169 static unsigned getFCmpCode(FCmpInst::Predicate CC, bool &isOrdered) {
3172 case FCmpInst::FCMP_ORD: isOrdered = true; return 0; // 000
3173 case FCmpInst::FCMP_UNO: return 0; // 000
3174 case FCmpInst::FCMP_OGT: isOrdered = true; return 1; // 001
3175 case FCmpInst::FCMP_UGT: return 1; // 001
3176 case FCmpInst::FCMP_OEQ: isOrdered = true; return 2; // 010
3177 case FCmpInst::FCMP_UEQ: return 2; // 010
3178 case FCmpInst::FCMP_OGE: isOrdered = true; return 3; // 011
3179 case FCmpInst::FCMP_UGE: return 3; // 011
3180 case FCmpInst::FCMP_OLT: isOrdered = true; return 4; // 100
3181 case FCmpInst::FCMP_ULT: return 4; // 100
3182 case FCmpInst::FCMP_ONE: isOrdered = true; return 5; // 101
3183 case FCmpInst::FCMP_UNE: return 5; // 101
3184 case FCmpInst::FCMP_OLE: isOrdered = true; return 6; // 110
3185 case FCmpInst::FCMP_ULE: return 6; // 110
3188 // Not expecting FCMP_FALSE and FCMP_TRUE;
3189 assert(0 && "Unexpected FCmp predicate!");
3194 /// getICmpValue - This is the complement of getICmpCode, which turns an
3195 /// opcode and two operands into either a constant true or false, or a brand
3196 /// new ICmp instruction. The sign is passed in to determine which kind
3197 /// of predicate to use in the new icmp instruction.
3198 static Value *getICmpValue(bool sign, unsigned code, Value *LHS, Value *RHS) {
3200 default: assert(0 && "Illegal ICmp code!");
3201 case 0: return ConstantInt::getFalse();
3204 return new ICmpInst(ICmpInst::ICMP_SGT, LHS, RHS);
3206 return new ICmpInst(ICmpInst::ICMP_UGT, LHS, RHS);
3207 case 2: return new ICmpInst(ICmpInst::ICMP_EQ, LHS, RHS);
3210 return new ICmpInst(ICmpInst::ICMP_SGE, LHS, RHS);
3212 return new ICmpInst(ICmpInst::ICMP_UGE, LHS, RHS);
3215 return new ICmpInst(ICmpInst::ICMP_SLT, LHS, RHS);
3217 return new ICmpInst(ICmpInst::ICMP_ULT, LHS, RHS);
3218 case 5: return new ICmpInst(ICmpInst::ICMP_NE, LHS, RHS);
3221 return new ICmpInst(ICmpInst::ICMP_SLE, LHS, RHS);
3223 return new ICmpInst(ICmpInst::ICMP_ULE, LHS, RHS);
3224 case 7: return ConstantInt::getTrue();
3228 /// getFCmpValue - This is the complement of getFCmpCode, which turns an
3229 /// opcode and two operands into either a FCmp instruction. isordered is passed
3230 /// in to determine which kind of predicate to use in the new fcmp instruction.
3231 static Value *getFCmpValue(bool isordered, unsigned code,
3232 Value *LHS, Value *RHS) {
3234 default: assert(0 && "Illegal FCmp code!");
3237 return new FCmpInst(FCmpInst::FCMP_ORD, LHS, RHS);
3239 return new FCmpInst(FCmpInst::FCMP_UNO, LHS, RHS);
3242 return new FCmpInst(FCmpInst::FCMP_OGT, LHS, RHS);
3244 return new FCmpInst(FCmpInst::FCMP_UGT, LHS, RHS);
3247 return new FCmpInst(FCmpInst::FCMP_OEQ, LHS, RHS);
3249 return new FCmpInst(FCmpInst::FCMP_UEQ, LHS, RHS);
3252 return new FCmpInst(FCmpInst::FCMP_OGE, LHS, RHS);
3254 return new FCmpInst(FCmpInst::FCMP_UGE, LHS, RHS);
3257 return new FCmpInst(FCmpInst::FCMP_OLT, LHS, RHS);
3259 return new FCmpInst(FCmpInst::FCMP_ULT, LHS, RHS);
3262 return new FCmpInst(FCmpInst::FCMP_ONE, LHS, RHS);
3264 return new FCmpInst(FCmpInst::FCMP_UNE, LHS, RHS);
3267 return new FCmpInst(FCmpInst::FCMP_OLE, LHS, RHS);
3269 return new FCmpInst(FCmpInst::FCMP_ULE, LHS, RHS);
3270 case 7: return ConstantInt::getTrue();
3274 /// PredicatesFoldable - Return true if both predicates match sign or if at
3275 /// least one of them is an equality comparison (which is signless).
3276 static bool PredicatesFoldable(ICmpInst::Predicate p1, ICmpInst::Predicate p2) {
3277 return (ICmpInst::isSignedPredicate(p1) == ICmpInst::isSignedPredicate(p2)) ||
3278 (ICmpInst::isSignedPredicate(p1) && ICmpInst::isEquality(p2)) ||
3279 (ICmpInst::isSignedPredicate(p2) && ICmpInst::isEquality(p1));
3283 // FoldICmpLogical - Implements (icmp1 A, B) & (icmp2 A, B) --> (icmp3 A, B)
3284 struct FoldICmpLogical {
3287 ICmpInst::Predicate pred;
3288 FoldICmpLogical(InstCombiner &ic, ICmpInst *ICI)
3289 : IC(ic), LHS(ICI->getOperand(0)), RHS(ICI->getOperand(1)),
3290 pred(ICI->getPredicate()) {}
3291 bool shouldApply(Value *V) const {
3292 if (ICmpInst *ICI = dyn_cast<ICmpInst>(V))
3293 if (PredicatesFoldable(pred, ICI->getPredicate()))
3294 return ((ICI->getOperand(0) == LHS && ICI->getOperand(1) == RHS) ||
3295 (ICI->getOperand(0) == RHS && ICI->getOperand(1) == LHS));
3298 Instruction *apply(Instruction &Log) const {
3299 ICmpInst *ICI = cast<ICmpInst>(Log.getOperand(0));
3300 if (ICI->getOperand(0) != LHS) {
3301 assert(ICI->getOperand(1) == LHS);
3302 ICI->swapOperands(); // Swap the LHS and RHS of the ICmp
3305 ICmpInst *RHSICI = cast<ICmpInst>(Log.getOperand(1));
3306 unsigned LHSCode = getICmpCode(ICI);
3307 unsigned RHSCode = getICmpCode(RHSICI);
3309 switch (Log.getOpcode()) {
3310 case Instruction::And: Code = LHSCode & RHSCode; break;
3311 case Instruction::Or: Code = LHSCode | RHSCode; break;
3312 case Instruction::Xor: Code = LHSCode ^ RHSCode; break;
3313 default: assert(0 && "Illegal logical opcode!"); return 0;
3316 bool isSigned = ICmpInst::isSignedPredicate(RHSICI->getPredicate()) ||
3317 ICmpInst::isSignedPredicate(ICI->getPredicate());
3319 Value *RV = getICmpValue(isSigned, Code, LHS, RHS);
3320 if (Instruction *I = dyn_cast<Instruction>(RV))
3322 // Otherwise, it's a constant boolean value...
3323 return IC.ReplaceInstUsesWith(Log, RV);
3326 } // end anonymous namespace
3328 // OptAndOp - This handles expressions of the form ((val OP C1) & C2). Where
3329 // the Op parameter is 'OP', OpRHS is 'C1', and AndRHS is 'C2'. Op is
3330 // guaranteed to be a binary operator.
3331 Instruction *InstCombiner::OptAndOp(Instruction *Op,
3333 ConstantInt *AndRHS,
3334 BinaryOperator &TheAnd) {
3335 Value *X = Op->getOperand(0);
3336 Constant *Together = 0;
3338 Together = And(AndRHS, OpRHS);
3340 switch (Op->getOpcode()) {
3341 case Instruction::Xor:
3342 if (Op->hasOneUse()) {
3343 // (X ^ C1) & C2 --> (X & C2) ^ (C1&C2)
3344 Instruction *And = BinaryOperator::CreateAnd(X, AndRHS);
3345 InsertNewInstBefore(And, TheAnd);
3347 return BinaryOperator::CreateXor(And, Together);
3350 case Instruction::Or:
3351 if (Together == AndRHS) // (X | C) & C --> C
3352 return ReplaceInstUsesWith(TheAnd, AndRHS);
3354 if (Op->hasOneUse() && Together != OpRHS) {
3355 // (X | C1) & C2 --> (X | (C1&C2)) & C2
3356 Instruction *Or = BinaryOperator::CreateOr(X, Together);
3357 InsertNewInstBefore(Or, TheAnd);
3359 return BinaryOperator::CreateAnd(Or, AndRHS);
3362 case Instruction::Add:
3363 if (Op->hasOneUse()) {
3364 // Adding a one to a single bit bit-field should be turned into an XOR
3365 // of the bit. First thing to check is to see if this AND is with a
3366 // single bit constant.
3367 const APInt& AndRHSV = cast<ConstantInt>(AndRHS)->getValue();
3369 // If there is only one bit set...
3370 if (isOneBitSet(cast<ConstantInt>(AndRHS))) {
3371 // Ok, at this point, we know that we are masking the result of the
3372 // ADD down to exactly one bit. If the constant we are adding has
3373 // no bits set below this bit, then we can eliminate the ADD.
3374 const APInt& AddRHS = cast<ConstantInt>(OpRHS)->getValue();
3376 // Check to see if any bits below the one bit set in AndRHSV are set.
3377 if ((AddRHS & (AndRHSV-1)) == 0) {
3378 // If not, the only thing that can effect the output of the AND is
3379 // the bit specified by AndRHSV. If that bit is set, the effect of
3380 // the XOR is to toggle the bit. If it is clear, then the ADD has
3382 if ((AddRHS & AndRHSV) == 0) { // Bit is not set, noop
3383 TheAnd.setOperand(0, X);
3386 // Pull the XOR out of the AND.
3387 Instruction *NewAnd = BinaryOperator::CreateAnd(X, AndRHS);
3388 InsertNewInstBefore(NewAnd, TheAnd);
3389 NewAnd->takeName(Op);
3390 return BinaryOperator::CreateXor(NewAnd, AndRHS);
3397 case Instruction::Shl: {
3398 // We know that the AND will not produce any of the bits shifted in, so if
3399 // the anded constant includes them, clear them now!
3401 uint32_t BitWidth = AndRHS->getType()->getBitWidth();
3402 uint32_t OpRHSVal = OpRHS->getLimitedValue(BitWidth);
3403 APInt ShlMask(APInt::getHighBitsSet(BitWidth, BitWidth-OpRHSVal));
3404 ConstantInt *CI = ConstantInt::get(AndRHS->getValue() & ShlMask);
3406 if (CI->getValue() == ShlMask) {
3407 // Masking out bits that the shift already masks
3408 return ReplaceInstUsesWith(TheAnd, Op); // No need for the and.
3409 } else if (CI != AndRHS) { // Reducing bits set in and.
3410 TheAnd.setOperand(1, CI);
3415 case Instruction::LShr:
3417 // We know that the AND will not produce any of the bits shifted in, so if
3418 // the anded constant includes them, clear them now! This only applies to
3419 // unsigned shifts, because a signed shr may bring in set bits!
3421 uint32_t BitWidth = AndRHS->getType()->getBitWidth();
3422 uint32_t OpRHSVal = OpRHS->getLimitedValue(BitWidth);
3423 APInt ShrMask(APInt::getLowBitsSet(BitWidth, BitWidth - OpRHSVal));
3424 ConstantInt *CI = ConstantInt::get(AndRHS->getValue() & ShrMask);
3426 if (CI->getValue() == ShrMask) {
3427 // Masking out bits that the shift already masks.
3428 return ReplaceInstUsesWith(TheAnd, Op);
3429 } else if (CI != AndRHS) {
3430 TheAnd.setOperand(1, CI); // Reduce bits set in and cst.
3435 case Instruction::AShr:
3437 // See if this is shifting in some sign extension, then masking it out
3439 if (Op->hasOneUse()) {
3440 uint32_t BitWidth = AndRHS->getType()->getBitWidth();
3441 uint32_t OpRHSVal = OpRHS->getLimitedValue(BitWidth);
3442 APInt ShrMask(APInt::getLowBitsSet(BitWidth, BitWidth - OpRHSVal));
3443 Constant *C = ConstantInt::get(AndRHS->getValue() & ShrMask);
3444 if (C == AndRHS) { // Masking out bits shifted in.
3445 // (Val ashr C1) & C2 -> (Val lshr C1) & C2
3446 // Make the argument unsigned.
3447 Value *ShVal = Op->getOperand(0);
3448 ShVal = InsertNewInstBefore(
3449 BinaryOperator::CreateLShr(ShVal, OpRHS,
3450 Op->getName()), TheAnd);
3451 return BinaryOperator::CreateAnd(ShVal, AndRHS, TheAnd.getName());
3460 /// InsertRangeTest - Emit a computation of: (V >= Lo && V < Hi) if Inside is
3461 /// true, otherwise (V < Lo || V >= Hi). In pratice, we emit the more efficient
3462 /// (V-Lo) <u Hi-Lo. This method expects that Lo <= Hi. isSigned indicates
3463 /// whether to treat the V, Lo and HI as signed or not. IB is the location to
3464 /// insert new instructions.
3465 Instruction *InstCombiner::InsertRangeTest(Value *V, Constant *Lo, Constant *Hi,
3466 bool isSigned, bool Inside,
3468 assert(cast<ConstantInt>(ConstantExpr::getICmp((isSigned ?
3469 ICmpInst::ICMP_SLE:ICmpInst::ICMP_ULE), Lo, Hi))->getZExtValue() &&
3470 "Lo is not <= Hi in range emission code!");
3473 if (Lo == Hi) // Trivially false.
3474 return new ICmpInst(ICmpInst::ICMP_NE, V, V);
3476 // V >= Min && V < Hi --> V < Hi
3477 if (cast<ConstantInt>(Lo)->isMinValue(isSigned)) {
3478 ICmpInst::Predicate pred = (isSigned ?
3479 ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT);
3480 return new ICmpInst(pred, V, Hi);
3483 // Emit V-Lo <u Hi-Lo
3484 Constant *NegLo = ConstantExpr::getNeg(Lo);
3485 Instruction *Add = BinaryOperator::CreateAdd(V, NegLo, V->getName()+".off");
3486 InsertNewInstBefore(Add, IB);
3487 Constant *UpperBound = ConstantExpr::getAdd(NegLo, Hi);
3488 return new ICmpInst(ICmpInst::ICMP_ULT, Add, UpperBound);
3491 if (Lo == Hi) // Trivially true.
3492 return new ICmpInst(ICmpInst::ICMP_EQ, V, V);
3494 // V < Min || V >= Hi -> V > Hi-1
3495 Hi = SubOne(cast<ConstantInt>(Hi));
3496 if (cast<ConstantInt>(Lo)->isMinValue(isSigned)) {
3497 ICmpInst::Predicate pred = (isSigned ?
3498 ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT);
3499 return new ICmpInst(pred, V, Hi);
3502 // Emit V-Lo >u Hi-1-Lo
3503 // Note that Hi has already had one subtracted from it, above.
3504 ConstantInt *NegLo = cast<ConstantInt>(ConstantExpr::getNeg(Lo));
3505 Instruction *Add = BinaryOperator::CreateAdd(V, NegLo, V->getName()+".off");
3506 InsertNewInstBefore(Add, IB);
3507 Constant *LowerBound = ConstantExpr::getAdd(NegLo, Hi);
3508 return new ICmpInst(ICmpInst::ICMP_UGT, Add, LowerBound);
3511 // isRunOfOnes - Returns true iff Val consists of one contiguous run of 1s with
3512 // any number of 0s on either side. The 1s are allowed to wrap from LSB to
3513 // MSB, so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is
3514 // not, since all 1s are not contiguous.
3515 static bool isRunOfOnes(ConstantInt *Val, uint32_t &MB, uint32_t &ME) {
3516 const APInt& V = Val->getValue();
3517 uint32_t BitWidth = Val->getType()->getBitWidth();
3518 if (!APIntOps::isShiftedMask(BitWidth, V)) return false;
3520 // look for the first zero bit after the run of ones
3521 MB = BitWidth - ((V - 1) ^ V).countLeadingZeros();
3522 // look for the first non-zero bit
3523 ME = V.getActiveBits();
3527 /// FoldLogicalPlusAnd - This is part of an expression (LHS +/- RHS) & Mask,
3528 /// where isSub determines whether the operator is a sub. If we can fold one of
3529 /// the following xforms:
3531 /// ((A & N) +/- B) & Mask -> (A +/- B) & Mask iff N&Mask == Mask
3532 /// ((A | N) +/- B) & Mask -> (A +/- B) & Mask iff N&Mask == 0
3533 /// ((A ^ N) +/- B) & Mask -> (A +/- B) & Mask iff N&Mask == 0
3535 /// return (A +/- B).
3537 Value *InstCombiner::FoldLogicalPlusAnd(Value *LHS, Value *RHS,
3538 ConstantInt *Mask, bool isSub,
3540 Instruction *LHSI = dyn_cast<Instruction>(LHS);
3541 if (!LHSI || LHSI->getNumOperands() != 2 ||
3542 !isa<ConstantInt>(LHSI->getOperand(1))) return 0;
3544 ConstantInt *N = cast<ConstantInt>(LHSI->getOperand(1));
3546 switch (LHSI->getOpcode()) {
3548 case Instruction::And:
3549 if (And(N, Mask) == Mask) {
3550 // If the AndRHS is a power of two minus one (0+1+), this is simple.
3551 if ((Mask->getValue().countLeadingZeros() +
3552 Mask->getValue().countPopulation()) ==
3553 Mask->getValue().getBitWidth())
3556 // Otherwise, if Mask is 0+1+0+, and if B is known to have the low 0+
3557 // part, we don't need any explicit masks to take them out of A. If that
3558 // is all N is, ignore it.
3559 uint32_t MB = 0, ME = 0;
3560 if (isRunOfOnes(Mask, MB, ME)) { // begin/end bit of run, inclusive
3561 uint32_t BitWidth = cast<IntegerType>(RHS->getType())->getBitWidth();
3562 APInt Mask(APInt::getLowBitsSet(BitWidth, MB-1));
3563 if (MaskedValueIsZero(RHS, Mask))
3568 case Instruction::Or:
3569 case Instruction::Xor:
3570 // If the AndRHS is a power of two minus one (0+1+), and N&Mask == 0
3571 if ((Mask->getValue().countLeadingZeros() +
3572 Mask->getValue().countPopulation()) == Mask->getValue().getBitWidth()
3573 && And(N, Mask)->isZero())
3580 New = BinaryOperator::CreateSub(LHSI->getOperand(0), RHS, "fold");
3582 New = BinaryOperator::CreateAdd(LHSI->getOperand(0), RHS, "fold");
3583 return InsertNewInstBefore(New, I);
3586 /// FoldAndOfICmps - Fold (icmp)&(icmp) if possible.
3587 Instruction *InstCombiner::FoldAndOfICmps(Instruction &I,
3588 ICmpInst *LHS, ICmpInst *RHS) {
3590 ConstantInt *LHSCst, *RHSCst;
3591 ICmpInst::Predicate LHSCC, RHSCC;
3593 // This only handles icmp of constants: (icmp1 A, C1) & (icmp2 B, C2).
3594 if (!match(LHS, m_ICmp(LHSCC, m_Value(Val), m_ConstantInt(LHSCst))) ||
3595 !match(RHS, m_ICmp(RHSCC, m_Value(Val2), m_ConstantInt(RHSCst))))
3598 // (icmp ult A, C) & (icmp ult B, C) --> (icmp ult (A|B), C)
3599 // where C is a power of 2
3600 if (LHSCst == RHSCst && LHSCC == RHSCC && LHSCC == ICmpInst::ICMP_ULT &&
3601 LHSCst->getValue().isPowerOf2()) {
3602 Instruction *NewOr = BinaryOperator::CreateOr(Val, Val2);
3603 InsertNewInstBefore(NewOr, I);
3604 return new ICmpInst(LHSCC, NewOr, LHSCst);
3607 // From here on, we only handle:
3608 // (icmp1 A, C1) & (icmp2 A, C2) --> something simpler.
3609 if (Val != Val2) return 0;
3611 // ICMP_[US][GL]E X, CST is folded to ICMP_[US][GL]T elsewhere.
3612 if (LHSCC == ICmpInst::ICMP_UGE || LHSCC == ICmpInst::ICMP_ULE ||
3613 RHSCC == ICmpInst::ICMP_UGE || RHSCC == ICmpInst::ICMP_ULE ||
3614 LHSCC == ICmpInst::ICMP_SGE || LHSCC == ICmpInst::ICMP_SLE ||
3615 RHSCC == ICmpInst::ICMP_SGE || RHSCC == ICmpInst::ICMP_SLE)
3618 // We can't fold (ugt x, C) & (sgt x, C2).
3619 if (!PredicatesFoldable(LHSCC, RHSCC))
3622 // Ensure that the larger constant is on the RHS.
3624 if (ICmpInst::isSignedPredicate(LHSCC) ||
3625 (ICmpInst::isEquality(LHSCC) &&
3626 ICmpInst::isSignedPredicate(RHSCC)))
3627 ShouldSwap = LHSCst->getValue().sgt(RHSCst->getValue());
3629 ShouldSwap = LHSCst->getValue().ugt(RHSCst->getValue());
3632 std::swap(LHS, RHS);
3633 std::swap(LHSCst, RHSCst);
3634 std::swap(LHSCC, RHSCC);
3637 // At this point, we know we have have two icmp instructions
3638 // comparing a value against two constants and and'ing the result
3639 // together. Because of the above check, we know that we only have
3640 // icmp eq, icmp ne, icmp [su]lt, and icmp [SU]gt here. We also know
3641 // (from the FoldICmpLogical check above), that the two constants
3642 // are not equal and that the larger constant is on the RHS
3643 assert(LHSCst != RHSCst && "Compares not folded above?");
3646 default: assert(0 && "Unknown integer condition code!");
3647 case ICmpInst::ICMP_EQ:
3649 default: assert(0 && "Unknown integer condition code!");
3650 case ICmpInst::ICMP_EQ: // (X == 13 & X == 15) -> false
3651 case ICmpInst::ICMP_UGT: // (X == 13 & X > 15) -> false
3652 case ICmpInst::ICMP_SGT: // (X == 13 & X > 15) -> false
3653 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
3654 case ICmpInst::ICMP_NE: // (X == 13 & X != 15) -> X == 13
3655 case ICmpInst::ICMP_ULT: // (X == 13 & X < 15) -> X == 13
3656 case ICmpInst::ICMP_SLT: // (X == 13 & X < 15) -> X == 13
3657 return ReplaceInstUsesWith(I, LHS);
3659 case ICmpInst::ICMP_NE:
3661 default: assert(0 && "Unknown integer condition code!");
3662 case ICmpInst::ICMP_ULT:
3663 if (LHSCst == SubOne(RHSCst)) // (X != 13 & X u< 14) -> X < 13
3664 return new ICmpInst(ICmpInst::ICMP_ULT, Val, LHSCst);
3665 break; // (X != 13 & X u< 15) -> no change
3666 case ICmpInst::ICMP_SLT:
3667 if (LHSCst == SubOne(RHSCst)) // (X != 13 & X s< 14) -> X < 13
3668 return new ICmpInst(ICmpInst::ICMP_SLT, Val, LHSCst);
3669 break; // (X != 13 & X s< 15) -> no change
3670 case ICmpInst::ICMP_EQ: // (X != 13 & X == 15) -> X == 15
3671 case ICmpInst::ICMP_UGT: // (X != 13 & X u> 15) -> X u> 15
3672 case ICmpInst::ICMP_SGT: // (X != 13 & X s> 15) -> X s> 15
3673 return ReplaceInstUsesWith(I, RHS);
3674 case ICmpInst::ICMP_NE:
3675 if (LHSCst == SubOne(RHSCst)){// (X != 13 & X != 14) -> X-13 >u 1
3676 Constant *AddCST = ConstantExpr::getNeg(LHSCst);
3677 Instruction *Add = BinaryOperator::CreateAdd(Val, AddCST,
3678 Val->getName()+".off");
3679 InsertNewInstBefore(Add, I);
3680 return new ICmpInst(ICmpInst::ICMP_UGT, Add,
3681 ConstantInt::get(Add->getType(), 1));
3683 break; // (X != 13 & X != 15) -> no change
3686 case ICmpInst::ICMP_ULT:
3688 default: assert(0 && "Unknown integer condition code!");
3689 case ICmpInst::ICMP_EQ: // (X u< 13 & X == 15) -> false
3690 case ICmpInst::ICMP_UGT: // (X u< 13 & X u> 15) -> false
3691 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
3692 case ICmpInst::ICMP_SGT: // (X u< 13 & X s> 15) -> no change
3694 case ICmpInst::ICMP_NE: // (X u< 13 & X != 15) -> X u< 13
3695 case ICmpInst::ICMP_ULT: // (X u< 13 & X u< 15) -> X u< 13
3696 return ReplaceInstUsesWith(I, LHS);
3697 case ICmpInst::ICMP_SLT: // (X u< 13 & X s< 15) -> no change
3701 case ICmpInst::ICMP_SLT:
3703 default: assert(0 && "Unknown integer condition code!");
3704 case ICmpInst::ICMP_EQ: // (X s< 13 & X == 15) -> false
3705 case ICmpInst::ICMP_SGT: // (X s< 13 & X s> 15) -> false
3706 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
3707 case ICmpInst::ICMP_UGT: // (X s< 13 & X u> 15) -> no change
3709 case ICmpInst::ICMP_NE: // (X s< 13 & X != 15) -> X < 13
3710 case ICmpInst::ICMP_SLT: // (X s< 13 & X s< 15) -> X < 13
3711 return ReplaceInstUsesWith(I, LHS);
3712 case ICmpInst::ICMP_ULT: // (X s< 13 & X u< 15) -> no change
3716 case ICmpInst::ICMP_UGT:
3718 default: assert(0 && "Unknown integer condition code!");
3719 case ICmpInst::ICMP_EQ: // (X u> 13 & X == 15) -> X == 15
3720 case ICmpInst::ICMP_UGT: // (X u> 13 & X u> 15) -> X u> 15
3721 return ReplaceInstUsesWith(I, RHS);
3722 case ICmpInst::ICMP_SGT: // (X u> 13 & X s> 15) -> no change
3724 case ICmpInst::ICMP_NE:
3725 if (RHSCst == AddOne(LHSCst)) // (X u> 13 & X != 14) -> X u> 14
3726 return new ICmpInst(LHSCC, Val, RHSCst);
3727 break; // (X u> 13 & X != 15) -> no change
3728 case ICmpInst::ICMP_ULT: // (X u> 13 & X u< 15) -> (X-14) <u 1
3729 return InsertRangeTest(Val, AddOne(LHSCst), RHSCst, false, true, I);
3730 case ICmpInst::ICMP_SLT: // (X u> 13 & X s< 15) -> no change
3734 case ICmpInst::ICMP_SGT:
3736 default: assert(0 && "Unknown integer condition code!");
3737 case ICmpInst::ICMP_EQ: // (X s> 13 & X == 15) -> X == 15
3738 case ICmpInst::ICMP_SGT: // (X s> 13 & X s> 15) -> X s> 15
3739 return ReplaceInstUsesWith(I, RHS);
3740 case ICmpInst::ICMP_UGT: // (X s> 13 & X u> 15) -> no change
3742 case ICmpInst::ICMP_NE:
3743 if (RHSCst == AddOne(LHSCst)) // (X s> 13 & X != 14) -> X s> 14
3744 return new ICmpInst(LHSCC, Val, RHSCst);
3745 break; // (X s> 13 & X != 15) -> no change
3746 case ICmpInst::ICMP_SLT: // (X s> 13 & X s< 15) -> (X-14) s< 1
3747 return InsertRangeTest(Val, AddOne(LHSCst), RHSCst, true, true, I);
3748 case ICmpInst::ICMP_ULT: // (X s> 13 & X u< 15) -> no change
3758 Instruction *InstCombiner::visitAnd(BinaryOperator &I) {
3759 bool Changed = SimplifyCommutative(I);
3760 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3762 if (isa<UndefValue>(Op1)) // X & undef -> 0
3763 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
3767 return ReplaceInstUsesWith(I, Op1);
3769 // See if we can simplify any instructions used by the instruction whose sole
3770 // purpose is to compute bits we don't care about.
3771 if (!isa<VectorType>(I.getType())) {
3772 uint32_t BitWidth = cast<IntegerType>(I.getType())->getBitWidth();
3773 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
3774 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
3775 KnownZero, KnownOne))
3778 if (ConstantVector *CP = dyn_cast<ConstantVector>(Op1)) {
3779 if (CP->isAllOnesValue()) // X & <-1,-1> -> X
3780 return ReplaceInstUsesWith(I, I.getOperand(0));
3781 } else if (isa<ConstantAggregateZero>(Op1)) {
3782 return ReplaceInstUsesWith(I, Op1); // X & <0,0> -> <0,0>
3786 if (ConstantInt *AndRHS = dyn_cast<ConstantInt>(Op1)) {
3787 const APInt& AndRHSMask = AndRHS->getValue();
3788 APInt NotAndRHS(~AndRHSMask);
3790 // Optimize a variety of ((val OP C1) & C2) combinations...
3791 if (isa<BinaryOperator>(Op0)) {
3792 Instruction *Op0I = cast<Instruction>(Op0);
3793 Value *Op0LHS = Op0I->getOperand(0);
3794 Value *Op0RHS = Op0I->getOperand(1);
3795 switch (Op0I->getOpcode()) {
3796 case Instruction::Xor:
3797 case Instruction::Or:
3798 // If the mask is only needed on one incoming arm, push it up.
3799 if (Op0I->hasOneUse()) {
3800 if (MaskedValueIsZero(Op0LHS, NotAndRHS)) {
3801 // Not masking anything out for the LHS, move to RHS.
3802 Instruction *NewRHS = BinaryOperator::CreateAnd(Op0RHS, AndRHS,
3803 Op0RHS->getName()+".masked");
3804 InsertNewInstBefore(NewRHS, I);
3805 return BinaryOperator::Create(
3806 cast<BinaryOperator>(Op0I)->getOpcode(), Op0LHS, NewRHS);
3808 if (!isa<Constant>(Op0RHS) &&
3809 MaskedValueIsZero(Op0RHS, NotAndRHS)) {
3810 // Not masking anything out for the RHS, move to LHS.
3811 Instruction *NewLHS = BinaryOperator::CreateAnd(Op0LHS, AndRHS,
3812 Op0LHS->getName()+".masked");
3813 InsertNewInstBefore(NewLHS, I);
3814 return BinaryOperator::Create(
3815 cast<BinaryOperator>(Op0I)->getOpcode(), NewLHS, Op0RHS);
3820 case Instruction::Add:
3821 // ((A & N) + B) & AndRHS -> (A + B) & AndRHS iff N&AndRHS == AndRHS.
3822 // ((A | N) + B) & AndRHS -> (A + B) & AndRHS iff N&AndRHS == 0
3823 // ((A ^ N) + B) & AndRHS -> (A + B) & AndRHS iff N&AndRHS == 0
3824 if (Value *V = FoldLogicalPlusAnd(Op0LHS, Op0RHS, AndRHS, false, I))
3825 return BinaryOperator::CreateAnd(V, AndRHS);
3826 if (Value *V = FoldLogicalPlusAnd(Op0RHS, Op0LHS, AndRHS, false, I))
3827 return BinaryOperator::CreateAnd(V, AndRHS); // Add commutes
3830 case Instruction::Sub:
3831 // ((A & N) - B) & AndRHS -> (A - B) & AndRHS iff N&AndRHS == AndRHS.
3832 // ((A | N) - B) & AndRHS -> (A - B) & AndRHS iff N&AndRHS == 0
3833 // ((A ^ N) - B) & AndRHS -> (A - B) & AndRHS iff N&AndRHS == 0
3834 if (Value *V = FoldLogicalPlusAnd(Op0LHS, Op0RHS, AndRHS, true, I))
3835 return BinaryOperator::CreateAnd(V, AndRHS);
3837 // (A - N) & AndRHS -> -N & AndRHS iff A&AndRHS==0 and AndRHS
3838 // has 1's for all bits that the subtraction with A might affect.
3839 if (Op0I->hasOneUse()) {
3840 uint32_t BitWidth = AndRHSMask.getBitWidth();
3841 uint32_t Zeros = AndRHSMask.countLeadingZeros();
3842 APInt Mask = APInt::getLowBitsSet(BitWidth, BitWidth - Zeros);
3844 ConstantInt *A = dyn_cast<ConstantInt>(Op0LHS);
3845 if (!(A && A->isZero()) && // avoid infinite recursion.
3846 MaskedValueIsZero(Op0LHS, Mask)) {
3847 Instruction *NewNeg = BinaryOperator::CreateNeg(Op0RHS);
3848 InsertNewInstBefore(NewNeg, I);
3849 return BinaryOperator::CreateAnd(NewNeg, AndRHS);
3854 case Instruction::Shl:
3855 case Instruction::LShr:
3856 // (1 << x) & 1 --> zext(x == 0)
3857 // (1 >> x) & 1 --> zext(x == 0)
3858 if (AndRHSMask == 1 && Op0LHS == AndRHS) {
3859 Instruction *NewICmp = new ICmpInst(ICmpInst::ICMP_EQ, Op0RHS,
3860 Constant::getNullValue(I.getType()));
3861 InsertNewInstBefore(NewICmp, I);
3862 return new ZExtInst(NewICmp, I.getType());
3867 if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1)))
3868 if (Instruction *Res = OptAndOp(Op0I, Op0CI, AndRHS, I))
3870 } else if (CastInst *CI = dyn_cast<CastInst>(Op0)) {
3871 // If this is an integer truncation or change from signed-to-unsigned, and
3872 // if the source is an and/or with immediate, transform it. This
3873 // frequently occurs for bitfield accesses.
3874 if (Instruction *CastOp = dyn_cast<Instruction>(CI->getOperand(0))) {
3875 if ((isa<TruncInst>(CI) || isa<BitCastInst>(CI)) &&
3876 CastOp->getNumOperands() == 2)
3877 if (ConstantInt *AndCI = dyn_cast<ConstantInt>(CastOp->getOperand(1))) {
3878 if (CastOp->getOpcode() == Instruction::And) {
3879 // Change: and (cast (and X, C1) to T), C2
3880 // into : and (cast X to T), trunc_or_bitcast(C1)&C2
3881 // This will fold the two constants together, which may allow
3882 // other simplifications.
3883 Instruction *NewCast = CastInst::CreateTruncOrBitCast(
3884 CastOp->getOperand(0), I.getType(),
3885 CastOp->getName()+".shrunk");
3886 NewCast = InsertNewInstBefore(NewCast, I);
3887 // trunc_or_bitcast(C1)&C2
3888 Constant *C3 = ConstantExpr::getTruncOrBitCast(AndCI,I.getType());
3889 C3 = ConstantExpr::getAnd(C3, AndRHS);
3890 return BinaryOperator::CreateAnd(NewCast, C3);
3891 } else if (CastOp->getOpcode() == Instruction::Or) {
3892 // Change: and (cast (or X, C1) to T), C2
3893 // into : trunc(C1)&C2 iff trunc(C1)&C2 == C2
3894 Constant *C3 = ConstantExpr::getTruncOrBitCast(AndCI,I.getType());
3895 if (ConstantExpr::getAnd(C3, AndRHS) == AndRHS) // trunc(C1)&C2
3896 return ReplaceInstUsesWith(I, AndRHS);
3902 // Try to fold constant and into select arguments.
3903 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
3904 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
3906 if (isa<PHINode>(Op0))
3907 if (Instruction *NV = FoldOpIntoPhi(I))
3911 Value *Op0NotVal = dyn_castNotVal(Op0);
3912 Value *Op1NotVal = dyn_castNotVal(Op1);
3914 if (Op0NotVal == Op1 || Op1NotVal == Op0) // A & ~A == ~A & A == 0
3915 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
3917 // (~A & ~B) == (~(A | B)) - De Morgan's Law
3918 if (Op0NotVal && Op1NotVal && isOnlyUse(Op0) && isOnlyUse(Op1)) {
3919 Instruction *Or = BinaryOperator::CreateOr(Op0NotVal, Op1NotVal,
3920 I.getName()+".demorgan");
3921 InsertNewInstBefore(Or, I);
3922 return BinaryOperator::CreateNot(Or);
3926 Value *A = 0, *B = 0, *C = 0, *D = 0;
3927 if (match(Op0, m_Or(m_Value(A), m_Value(B)))) {
3928 if (A == Op1 || B == Op1) // (A | ?) & A --> A
3929 return ReplaceInstUsesWith(I, Op1);
3931 // (A|B) & ~(A&B) -> A^B
3932 if (match(Op1, m_Not(m_And(m_Value(C), m_Value(D))))) {
3933 if ((A == C && B == D) || (A == D && B == C))
3934 return BinaryOperator::CreateXor(A, B);
3938 if (match(Op1, m_Or(m_Value(A), m_Value(B)))) {
3939 if (A == Op0 || B == Op0) // A & (A | ?) --> A
3940 return ReplaceInstUsesWith(I, Op0);
3942 // ~(A&B) & (A|B) -> A^B
3943 if (match(Op0, m_Not(m_And(m_Value(C), m_Value(D))))) {
3944 if ((A == C && B == D) || (A == D && B == C))
3945 return BinaryOperator::CreateXor(A, B);
3949 if (Op0->hasOneUse() &&
3950 match(Op0, m_Xor(m_Value(A), m_Value(B)))) {
3951 if (A == Op1) { // (A^B)&A -> A&(A^B)
3952 I.swapOperands(); // Simplify below
3953 std::swap(Op0, Op1);
3954 } else if (B == Op1) { // (A^B)&B -> B&(B^A)
3955 cast<BinaryOperator>(Op0)->swapOperands();
3956 I.swapOperands(); // Simplify below
3957 std::swap(Op0, Op1);
3961 if (Op1->hasOneUse() &&
3962 match(Op1, m_Xor(m_Value(A), m_Value(B)))) {
3963 if (B == Op0) { // B&(A^B) -> B&(B^A)
3964 cast<BinaryOperator>(Op1)->swapOperands();
3967 if (A == Op0) { // A&(A^B) -> A & ~B
3968 Instruction *NotB = BinaryOperator::CreateNot(B, "tmp");
3969 InsertNewInstBefore(NotB, I);
3970 return BinaryOperator::CreateAnd(A, NotB);
3974 // (A&((~A)|B)) -> A&B
3975 if (match(Op0, m_Or(m_Not(m_Specific(Op1)), m_Value(A))) ||
3976 match(Op0, m_Or(m_Value(A), m_Not(m_Specific(Op1)))))
3977 return BinaryOperator::CreateAnd(A, Op1);
3978 if (match(Op1, m_Or(m_Not(m_Specific(Op0)), m_Value(A))) ||
3979 match(Op1, m_Or(m_Value(A), m_Not(m_Specific(Op0)))))
3980 return BinaryOperator::CreateAnd(A, Op0);
3983 if (ICmpInst *RHS = dyn_cast<ICmpInst>(Op1)) {
3984 // (icmp1 A, B) & (icmp2 A, B) --> (icmp3 A, B)
3985 if (Instruction *R = AssociativeOpt(I, FoldICmpLogical(*this, RHS)))
3988 if (ICmpInst *LHS = dyn_cast<ICmpInst>(Op0))
3989 if (Instruction *Res = FoldAndOfICmps(I, LHS, RHS))
3993 // fold (and (cast A), (cast B)) -> (cast (and A, B))
3994 if (CastInst *Op0C = dyn_cast<CastInst>(Op0))
3995 if (CastInst *Op1C = dyn_cast<CastInst>(Op1))
3996 if (Op0C->getOpcode() == Op1C->getOpcode()) { // same cast kind ?
3997 const Type *SrcTy = Op0C->getOperand(0)->getType();
3998 if (SrcTy == Op1C->getOperand(0)->getType() && SrcTy->isInteger() &&
3999 // Only do this if the casts both really cause code to be generated.
4000 ValueRequiresCast(Op0C->getOpcode(), Op0C->getOperand(0),
4002 ValueRequiresCast(Op1C->getOpcode(), Op1C->getOperand(0),
4004 Instruction *NewOp = BinaryOperator::CreateAnd(Op0C->getOperand(0),
4005 Op1C->getOperand(0),
4007 InsertNewInstBefore(NewOp, I);
4008 return CastInst::Create(Op0C->getOpcode(), NewOp, I.getType());
4012 // (X >> Z) & (Y >> Z) -> (X&Y) >> Z for all shifts.
4013 if (BinaryOperator *SI1 = dyn_cast<BinaryOperator>(Op1)) {
4014 if (BinaryOperator *SI0 = dyn_cast<BinaryOperator>(Op0))
4015 if (SI0->isShift() && SI0->getOpcode() == SI1->getOpcode() &&
4016 SI0->getOperand(1) == SI1->getOperand(1) &&
4017 (SI0->hasOneUse() || SI1->hasOneUse())) {
4018 Instruction *NewOp =
4019 InsertNewInstBefore(BinaryOperator::CreateAnd(SI0->getOperand(0),
4021 SI0->getName()), I);
4022 return BinaryOperator::Create(SI1->getOpcode(), NewOp,
4023 SI1->getOperand(1));
4027 // If and'ing two fcmp, try combine them into one.
4028 if (FCmpInst *LHS = dyn_cast<FCmpInst>(I.getOperand(0))) {
4029 if (FCmpInst *RHS = dyn_cast<FCmpInst>(I.getOperand(1))) {
4030 if (LHS->getPredicate() == FCmpInst::FCMP_ORD &&
4031 RHS->getPredicate() == FCmpInst::FCMP_ORD) {
4032 // (fcmp ord x, c) & (fcmp ord y, c) -> (fcmp ord x, y)
4033 if (ConstantFP *LHSC = dyn_cast<ConstantFP>(LHS->getOperand(1)))
4034 if (ConstantFP *RHSC = dyn_cast<ConstantFP>(RHS->getOperand(1))) {
4035 // If either of the constants are nans, then the whole thing returns
4037 if (LHSC->getValueAPF().isNaN() || RHSC->getValueAPF().isNaN())
4038 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4039 return new FCmpInst(FCmpInst::FCMP_ORD, LHS->getOperand(0),
4040 RHS->getOperand(0));
4043 Value *Op0LHS, *Op0RHS, *Op1LHS, *Op1RHS;
4044 FCmpInst::Predicate Op0CC, Op1CC;
4045 if (match(Op0, m_FCmp(Op0CC, m_Value(Op0LHS), m_Value(Op0RHS))) &&
4046 match(Op1, m_FCmp(Op1CC, m_Value(Op1LHS), m_Value(Op1RHS)))) {
4047 if (Op0LHS == Op1RHS && Op0RHS == Op1LHS) {
4048 // Swap RHS operands to match LHS.
4049 Op1CC = FCmpInst::getSwappedPredicate(Op1CC);
4050 std::swap(Op1LHS, Op1RHS);
4052 if (Op0LHS == Op1LHS && Op0RHS == Op1RHS) {
4053 // Simplify (fcmp cc0 x, y) & (fcmp cc1 x, y).
4055 return new FCmpInst((FCmpInst::Predicate)Op0CC, Op0LHS, Op0RHS);
4056 else if (Op0CC == FCmpInst::FCMP_FALSE ||
4057 Op1CC == FCmpInst::FCMP_FALSE)
4058 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4059 else if (Op0CC == FCmpInst::FCMP_TRUE)
4060 return ReplaceInstUsesWith(I, Op1);
4061 else if (Op1CC == FCmpInst::FCMP_TRUE)
4062 return ReplaceInstUsesWith(I, Op0);
4065 unsigned Op0Pred = getFCmpCode(Op0CC, Op0Ordered);
4066 unsigned Op1Pred = getFCmpCode(Op1CC, Op1Ordered);
4068 std::swap(Op0, Op1);
4069 std::swap(Op0Pred, Op1Pred);
4070 std::swap(Op0Ordered, Op1Ordered);
4073 // uno && ueq -> uno && (uno || eq) -> ueq
4074 // ord && olt -> ord && (ord && lt) -> olt
4075 if (Op0Ordered == Op1Ordered)
4076 return ReplaceInstUsesWith(I, Op1);
4077 // uno && oeq -> uno && (ord && eq) -> false
4078 // uno && ord -> false
4080 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4081 // ord && ueq -> ord && (uno || eq) -> oeq
4082 return cast<Instruction>(getFCmpValue(true, Op1Pred,
4091 return Changed ? &I : 0;
4094 /// CollectBSwapParts - Analyze the specified subexpression and see if it is
4095 /// capable of providing pieces of a bswap. The subexpression provides pieces
4096 /// of a bswap if it is proven that each of the non-zero bytes in the output of
4097 /// the expression came from the corresponding "byte swapped" byte in some other
4098 /// value. For example, if the current subexpression is "(shl i32 %X, 24)" then
4099 /// we know that the expression deposits the low byte of %X into the high byte
4100 /// of the bswap result and that all other bytes are zero. This expression is
4101 /// accepted, the high byte of ByteValues is set to X to indicate a correct
4104 /// This function returns true if the match was unsuccessful and false if so.
4105 /// On entry to the function the "OverallLeftShift" is a signed integer value
4106 /// indicating the number of bytes that the subexpression is later shifted. For
4107 /// example, if the expression is later right shifted by 16 bits, the
4108 /// OverallLeftShift value would be -2 on entry. This is used to specify which
4109 /// byte of ByteValues is actually being set.
4111 /// Similarly, ByteMask is a bitmask where a bit is clear if its corresponding
4112 /// byte is masked to zero by a user. For example, in (X & 255), X will be
4113 /// processed with a bytemask of 1. Because bytemask is 32-bits, this limits
4114 /// this function to working on up to 32-byte (256 bit) values. ByteMask is
4115 /// always in the local (OverallLeftShift) coordinate space.
4117 static bool CollectBSwapParts(Value *V, int OverallLeftShift, uint32_t ByteMask,
4118 SmallVector<Value*, 8> &ByteValues) {
4119 if (Instruction *I = dyn_cast<Instruction>(V)) {
4120 // If this is an or instruction, it may be an inner node of the bswap.
4121 if (I->getOpcode() == Instruction::Or) {
4122 return CollectBSwapParts(I->getOperand(0), OverallLeftShift, ByteMask,
4124 CollectBSwapParts(I->getOperand(1), OverallLeftShift, ByteMask,
4128 // If this is a logical shift by a constant multiple of 8, recurse with
4129 // OverallLeftShift and ByteMask adjusted.
4130 if (I->isLogicalShift() && isa<ConstantInt>(I->getOperand(1))) {
4132 cast<ConstantInt>(I->getOperand(1))->getLimitedValue(~0U);
4133 // Ensure the shift amount is defined and of a byte value.
4134 if ((ShAmt & 7) || (ShAmt > 8*ByteValues.size()))
4137 unsigned ByteShift = ShAmt >> 3;
4138 if (I->getOpcode() == Instruction::Shl) {
4139 // X << 2 -> collect(X, +2)
4140 OverallLeftShift += ByteShift;
4141 ByteMask >>= ByteShift;
4143 // X >>u 2 -> collect(X, -2)
4144 OverallLeftShift -= ByteShift;
4145 ByteMask <<= ByteShift;
4146 ByteMask &= (~0U >> (32-ByteValues.size()));
4149 if (OverallLeftShift >= (int)ByteValues.size()) return true;
4150 if (OverallLeftShift <= -(int)ByteValues.size()) return true;
4152 return CollectBSwapParts(I->getOperand(0), OverallLeftShift, ByteMask,
4156 // If this is a logical 'and' with a mask that clears bytes, clear the
4157 // corresponding bytes in ByteMask.
4158 if (I->getOpcode() == Instruction::And &&
4159 isa<ConstantInt>(I->getOperand(1))) {
4160 // Scan every byte of the and mask, seeing if the byte is either 0 or 255.
4161 unsigned NumBytes = ByteValues.size();
4162 APInt Byte(I->getType()->getPrimitiveSizeInBits(), 255);
4163 const APInt &AndMask = cast<ConstantInt>(I->getOperand(1))->getValue();
4165 for (unsigned i = 0; i != NumBytes; ++i, Byte <<= 8) {
4166 // If this byte is masked out by a later operation, we don't care what
4168 if ((ByteMask & (1 << i)) == 0)
4171 // If the AndMask is all zeros for this byte, clear the bit.
4172 APInt MaskB = AndMask & Byte;
4174 ByteMask &= ~(1U << i);
4178 // If the AndMask is not all ones for this byte, it's not a bytezap.
4182 // Otherwise, this byte is kept.
4185 return CollectBSwapParts(I->getOperand(0), OverallLeftShift, ByteMask,
4190 // Okay, we got to something that isn't a shift, 'or' or 'and'. This must be
4191 // the input value to the bswap. Some observations: 1) if more than one byte
4192 // is demanded from this input, then it could not be successfully assembled
4193 // into a byteswap. At least one of the two bytes would not be aligned with
4194 // their ultimate destination.
4195 if (!isPowerOf2_32(ByteMask)) return true;
4196 unsigned InputByteNo = CountTrailingZeros_32(ByteMask);
4198 // 2) The input and ultimate destinations must line up: if byte 3 of an i32
4199 // is demanded, it needs to go into byte 0 of the result. This means that the
4200 // byte needs to be shifted until it lands in the right byte bucket. The
4201 // shift amount depends on the position: if the byte is coming from the high
4202 // part of the value (e.g. byte 3) then it must be shifted right. If from the
4203 // low part, it must be shifted left.
4204 unsigned DestByteNo = InputByteNo + OverallLeftShift;
4205 if (InputByteNo < ByteValues.size()/2) {
4206 if (ByteValues.size()-1-DestByteNo != InputByteNo)
4209 if (ByteValues.size()-1-DestByteNo != InputByteNo)
4213 // If the destination byte value is already defined, the values are or'd
4214 // together, which isn't a bswap (unless it's an or of the same bits).
4215 if (ByteValues[DestByteNo] && ByteValues[DestByteNo] != V)
4217 ByteValues[DestByteNo] = V;
4221 /// MatchBSwap - Given an OR instruction, check to see if this is a bswap idiom.
4222 /// If so, insert the new bswap intrinsic and return it.
4223 Instruction *InstCombiner::MatchBSwap(BinaryOperator &I) {
4224 const IntegerType *ITy = dyn_cast<IntegerType>(I.getType());
4225 if (!ITy || ITy->getBitWidth() % 16 ||
4226 // ByteMask only allows up to 32-byte values.
4227 ITy->getBitWidth() > 32*8)
4228 return 0; // Can only bswap pairs of bytes. Can't do vectors.
4230 /// ByteValues - For each byte of the result, we keep track of which value
4231 /// defines each byte.
4232 SmallVector<Value*, 8> ByteValues;
4233 ByteValues.resize(ITy->getBitWidth()/8);
4235 // Try to find all the pieces corresponding to the bswap.
4236 uint32_t ByteMask = ~0U >> (32-ByteValues.size());
4237 if (CollectBSwapParts(&I, 0, ByteMask, ByteValues))
4240 // Check to see if all of the bytes come from the same value.
4241 Value *V = ByteValues[0];
4242 if (V == 0) return 0; // Didn't find a byte? Must be zero.
4244 // Check to make sure that all of the bytes come from the same value.
4245 for (unsigned i = 1, e = ByteValues.size(); i != e; ++i)
4246 if (ByteValues[i] != V)
4248 const Type *Tys[] = { ITy };
4249 Module *M = I.getParent()->getParent()->getParent();
4250 Function *F = Intrinsic::getDeclaration(M, Intrinsic::bswap, Tys, 1);
4251 return CallInst::Create(F, V);
4254 /// MatchSelectFromAndOr - We have an expression of the form (A&C)|(B&D). Check
4255 /// If A is (cond?-1:0) and either B or D is ~(cond?-1,0) or (cond?0,-1), then
4256 /// we can simplify this expression to "cond ? C : D or B".
4257 static Instruction *MatchSelectFromAndOr(Value *A, Value *B,
4258 Value *C, Value *D) {
4259 // If A is not a select of -1/0, this cannot match.
4261 if (!match(A, m_SelectCst(m_Value(Cond), -1, 0)))
4264 // ((cond?-1:0)&C) | (B&(cond?0:-1)) -> cond ? C : B.
4265 if (match(D, m_SelectCst(m_Specific(Cond), 0, -1)))
4266 return SelectInst::Create(Cond, C, B);
4267 if (match(D, m_Not(m_SelectCst(m_Specific(Cond), -1, 0))))
4268 return SelectInst::Create(Cond, C, B);
4269 // ((cond?-1:0)&C) | ((cond?0:-1)&D) -> cond ? C : D.
4270 if (match(B, m_SelectCst(m_Specific(Cond), 0, -1)))
4271 return SelectInst::Create(Cond, C, D);
4272 if (match(B, m_Not(m_SelectCst(m_Specific(Cond), -1, 0))))
4273 return SelectInst::Create(Cond, C, D);
4277 /// FoldOrOfICmps - Fold (icmp)|(icmp) if possible.
4278 Instruction *InstCombiner::FoldOrOfICmps(Instruction &I,
4279 ICmpInst *LHS, ICmpInst *RHS) {
4281 ConstantInt *LHSCst, *RHSCst;
4282 ICmpInst::Predicate LHSCC, RHSCC;
4284 // This only handles icmp of constants: (icmp1 A, C1) | (icmp2 B, C2).
4285 if (!match(LHS, m_ICmp(LHSCC, m_Value(Val), m_ConstantInt(LHSCst))) ||
4286 !match(RHS, m_ICmp(RHSCC, m_Value(Val2), m_ConstantInt(RHSCst))))
4289 // From here on, we only handle:
4290 // (icmp1 A, C1) | (icmp2 A, C2) --> something simpler.
4291 if (Val != Val2) return 0;
4293 // ICMP_[US][GL]E X, CST is folded to ICMP_[US][GL]T elsewhere.
4294 if (LHSCC == ICmpInst::ICMP_UGE || LHSCC == ICmpInst::ICMP_ULE ||
4295 RHSCC == ICmpInst::ICMP_UGE || RHSCC == ICmpInst::ICMP_ULE ||
4296 LHSCC == ICmpInst::ICMP_SGE || LHSCC == ICmpInst::ICMP_SLE ||
4297 RHSCC == ICmpInst::ICMP_SGE || RHSCC == ICmpInst::ICMP_SLE)
4300 // We can't fold (ugt x, C) | (sgt x, C2).
4301 if (!PredicatesFoldable(LHSCC, RHSCC))
4304 // Ensure that the larger constant is on the RHS.
4306 if (ICmpInst::isSignedPredicate(LHSCC) ||
4307 (ICmpInst::isEquality(LHSCC) &&
4308 ICmpInst::isSignedPredicate(RHSCC)))
4309 ShouldSwap = LHSCst->getValue().sgt(RHSCst->getValue());
4311 ShouldSwap = LHSCst->getValue().ugt(RHSCst->getValue());
4314 std::swap(LHS, RHS);
4315 std::swap(LHSCst, RHSCst);
4316 std::swap(LHSCC, RHSCC);
4319 // At this point, we know we have have two icmp instructions
4320 // comparing a value against two constants and or'ing the result
4321 // together. Because of the above check, we know that we only have
4322 // ICMP_EQ, ICMP_NE, ICMP_LT, and ICMP_GT here. We also know (from the
4323 // FoldICmpLogical check above), that the two constants are not
4325 assert(LHSCst != RHSCst && "Compares not folded above?");
4328 default: assert(0 && "Unknown integer condition code!");
4329 case ICmpInst::ICMP_EQ:
4331 default: assert(0 && "Unknown integer condition code!");
4332 case ICmpInst::ICMP_EQ:
4333 if (LHSCst == SubOne(RHSCst)) { // (X == 13 | X == 14) -> X-13 <u 2
4334 Constant *AddCST = ConstantExpr::getNeg(LHSCst);
4335 Instruction *Add = BinaryOperator::CreateAdd(Val, AddCST,
4336 Val->getName()+".off");
4337 InsertNewInstBefore(Add, I);
4338 AddCST = Subtract(AddOne(RHSCst), LHSCst);
4339 return new ICmpInst(ICmpInst::ICMP_ULT, Add, AddCST);
4341 break; // (X == 13 | X == 15) -> no change
4342 case ICmpInst::ICMP_UGT: // (X == 13 | X u> 14) -> no change
4343 case ICmpInst::ICMP_SGT: // (X == 13 | X s> 14) -> no change
4345 case ICmpInst::ICMP_NE: // (X == 13 | X != 15) -> X != 15
4346 case ICmpInst::ICMP_ULT: // (X == 13 | X u< 15) -> X u< 15
4347 case ICmpInst::ICMP_SLT: // (X == 13 | X s< 15) -> X s< 15
4348 return ReplaceInstUsesWith(I, RHS);
4351 case ICmpInst::ICMP_NE:
4353 default: assert(0 && "Unknown integer condition code!");
4354 case ICmpInst::ICMP_EQ: // (X != 13 | X == 15) -> X != 13
4355 case ICmpInst::ICMP_UGT: // (X != 13 | X u> 15) -> X != 13
4356 case ICmpInst::ICMP_SGT: // (X != 13 | X s> 15) -> X != 13
4357 return ReplaceInstUsesWith(I, LHS);
4358 case ICmpInst::ICMP_NE: // (X != 13 | X != 15) -> true
4359 case ICmpInst::ICMP_ULT: // (X != 13 | X u< 15) -> true
4360 case ICmpInst::ICMP_SLT: // (X != 13 | X s< 15) -> true
4361 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4364 case ICmpInst::ICMP_ULT:
4366 default: assert(0 && "Unknown integer condition code!");
4367 case ICmpInst::ICMP_EQ: // (X u< 13 | X == 14) -> no change
4369 case ICmpInst::ICMP_UGT: // (X u< 13 | X u> 15) -> (X-13) u> 2
4370 // If RHSCst is [us]MAXINT, it is always false. Not handling
4371 // this can cause overflow.
4372 if (RHSCst->isMaxValue(false))
4373 return ReplaceInstUsesWith(I, LHS);
4374 return InsertRangeTest(Val, LHSCst, AddOne(RHSCst), false, false, I);
4375 case ICmpInst::ICMP_SGT: // (X u< 13 | X s> 15) -> no change
4377 case ICmpInst::ICMP_NE: // (X u< 13 | X != 15) -> X != 15
4378 case ICmpInst::ICMP_ULT: // (X u< 13 | X u< 15) -> X u< 15
4379 return ReplaceInstUsesWith(I, RHS);
4380 case ICmpInst::ICMP_SLT: // (X u< 13 | X s< 15) -> no change
4384 case ICmpInst::ICMP_SLT:
4386 default: assert(0 && "Unknown integer condition code!");
4387 case ICmpInst::ICMP_EQ: // (X s< 13 | X == 14) -> no change
4389 case ICmpInst::ICMP_SGT: // (X s< 13 | X s> 15) -> (X-13) s> 2
4390 // If RHSCst is [us]MAXINT, it is always false. Not handling
4391 // this can cause overflow.
4392 if (RHSCst->isMaxValue(true))
4393 return ReplaceInstUsesWith(I, LHS);
4394 return InsertRangeTest(Val, LHSCst, AddOne(RHSCst), true, false, I);
4395 case ICmpInst::ICMP_UGT: // (X s< 13 | X u> 15) -> no change
4397 case ICmpInst::ICMP_NE: // (X s< 13 | X != 15) -> X != 15
4398 case ICmpInst::ICMP_SLT: // (X s< 13 | X s< 15) -> X s< 15
4399 return ReplaceInstUsesWith(I, RHS);
4400 case ICmpInst::ICMP_ULT: // (X s< 13 | X u< 15) -> no change
4404 case ICmpInst::ICMP_UGT:
4406 default: assert(0 && "Unknown integer condition code!");
4407 case ICmpInst::ICMP_EQ: // (X u> 13 | X == 15) -> X u> 13
4408 case ICmpInst::ICMP_UGT: // (X u> 13 | X u> 15) -> X u> 13
4409 return ReplaceInstUsesWith(I, LHS);
4410 case ICmpInst::ICMP_SGT: // (X u> 13 | X s> 15) -> no change
4412 case ICmpInst::ICMP_NE: // (X u> 13 | X != 15) -> true
4413 case ICmpInst::ICMP_ULT: // (X u> 13 | X u< 15) -> true
4414 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4415 case ICmpInst::ICMP_SLT: // (X u> 13 | X s< 15) -> no change
4419 case ICmpInst::ICMP_SGT:
4421 default: assert(0 && "Unknown integer condition code!");
4422 case ICmpInst::ICMP_EQ: // (X s> 13 | X == 15) -> X > 13
4423 case ICmpInst::ICMP_SGT: // (X s> 13 | X s> 15) -> X > 13
4424 return ReplaceInstUsesWith(I, LHS);
4425 case ICmpInst::ICMP_UGT: // (X s> 13 | X u> 15) -> no change
4427 case ICmpInst::ICMP_NE: // (X s> 13 | X != 15) -> true
4428 case ICmpInst::ICMP_SLT: // (X s> 13 | X s< 15) -> true
4429 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4430 case ICmpInst::ICMP_ULT: // (X s> 13 | X u< 15) -> no change
4438 /// FoldOrWithConstants - This helper function folds:
4440 /// ((A | B) & C1) | (B & C2)
4446 /// when the XOR of the two constants is "all ones" (-1).
4447 Instruction *InstCombiner::FoldOrWithConstants(BinaryOperator &I, Value *Op,
4448 Value *A, Value *B, Value *C) {
4449 ConstantInt *CI1 = dyn_cast<ConstantInt>(C);
4452 Value *V1 = 0, *C2 = 0;
4453 if (match(Op, m_And(m_Value(V1), m_Value(C2)))) {
4454 ConstantInt *CI2 = dyn_cast<ConstantInt>(C2);
4457 APInt Xor = CI1->getValue() ^ CI2->getValue();
4458 if (Xor.isAllOnesValue()) {
4460 Instruction *NewOp =
4461 InsertNewInstBefore(BinaryOperator::CreateAnd(A, CI1), I);
4462 return BinaryOperator::CreateOr(NewOp, B);
4463 } else if (V1 == A) {
4464 Instruction *NewOp =
4465 InsertNewInstBefore(BinaryOperator::CreateAnd(B, CI1), I);
4466 return BinaryOperator::CreateOr(NewOp, A);
4474 Instruction *InstCombiner::visitOr(BinaryOperator &I) {
4475 bool Changed = SimplifyCommutative(I);
4476 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
4478 if (isa<UndefValue>(Op1)) // X | undef -> -1
4479 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
4483 return ReplaceInstUsesWith(I, Op0);
4485 // See if we can simplify any instructions used by the instruction whose sole
4486 // purpose is to compute bits we don't care about.
4487 if (!isa<VectorType>(I.getType())) {
4488 uint32_t BitWidth = cast<IntegerType>(I.getType())->getBitWidth();
4489 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
4490 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
4491 KnownZero, KnownOne))
4493 } else if (isa<ConstantAggregateZero>(Op1)) {
4494 return ReplaceInstUsesWith(I, Op0); // X | <0,0> -> X
4495 } else if (ConstantVector *CP = dyn_cast<ConstantVector>(Op1)) {
4496 if (CP->isAllOnesValue()) // X | <-1,-1> -> <-1,-1>
4497 return ReplaceInstUsesWith(I, I.getOperand(1));
4503 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
4504 ConstantInt *C1 = 0; Value *X = 0;
4505 // (X & C1) | C2 --> (X | C2) & (C1|C2)
4506 if (match(Op0, m_And(m_Value(X), m_ConstantInt(C1))) && isOnlyUse(Op0)) {
4507 Instruction *Or = BinaryOperator::CreateOr(X, RHS);
4508 InsertNewInstBefore(Or, I);
4510 return BinaryOperator::CreateAnd(Or,
4511 ConstantInt::get(RHS->getValue() | C1->getValue()));
4514 // (X ^ C1) | C2 --> (X | C2) ^ (C1&~C2)
4515 if (match(Op0, m_Xor(m_Value(X), m_ConstantInt(C1))) && isOnlyUse(Op0)) {
4516 Instruction *Or = BinaryOperator::CreateOr(X, RHS);
4517 InsertNewInstBefore(Or, I);
4519 return BinaryOperator::CreateXor(Or,
4520 ConstantInt::get(C1->getValue() & ~RHS->getValue()));
4523 // Try to fold constant and into select arguments.
4524 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
4525 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
4527 if (isa<PHINode>(Op0))
4528 if (Instruction *NV = FoldOpIntoPhi(I))
4532 Value *A = 0, *B = 0;
4533 ConstantInt *C1 = 0, *C2 = 0;
4535 if (match(Op0, m_And(m_Value(A), m_Value(B))))
4536 if (A == Op1 || B == Op1) // (A & ?) | A --> A
4537 return ReplaceInstUsesWith(I, Op1);
4538 if (match(Op1, m_And(m_Value(A), m_Value(B))))
4539 if (A == Op0 || B == Op0) // A | (A & ?) --> A
4540 return ReplaceInstUsesWith(I, Op0);
4542 // (A | B) | C and A | (B | C) -> bswap if possible.
4543 // (A >> B) | (C << D) and (A << B) | (B >> C) -> bswap if possible.
4544 if (match(Op0, m_Or(m_Value(), m_Value())) ||
4545 match(Op1, m_Or(m_Value(), m_Value())) ||
4546 (match(Op0, m_Shift(m_Value(), m_Value())) &&
4547 match(Op1, m_Shift(m_Value(), m_Value())))) {
4548 if (Instruction *BSwap = MatchBSwap(I))
4552 // (X^C)|Y -> (X|Y)^C iff Y&C == 0
4553 if (Op0->hasOneUse() && match(Op0, m_Xor(m_Value(A), m_ConstantInt(C1))) &&
4554 MaskedValueIsZero(Op1, C1->getValue())) {
4555 Instruction *NOr = BinaryOperator::CreateOr(A, Op1);
4556 InsertNewInstBefore(NOr, I);
4558 return BinaryOperator::CreateXor(NOr, C1);
4561 // Y|(X^C) -> (X|Y)^C iff Y&C == 0
4562 if (Op1->hasOneUse() && match(Op1, m_Xor(m_Value(A), m_ConstantInt(C1))) &&
4563 MaskedValueIsZero(Op0, C1->getValue())) {
4564 Instruction *NOr = BinaryOperator::CreateOr(A, Op0);
4565 InsertNewInstBefore(NOr, I);
4567 return BinaryOperator::CreateXor(NOr, C1);
4571 Value *C = 0, *D = 0;
4572 if (match(Op0, m_And(m_Value(A), m_Value(C))) &&
4573 match(Op1, m_And(m_Value(B), m_Value(D)))) {
4574 Value *V1 = 0, *V2 = 0, *V3 = 0;
4575 C1 = dyn_cast<ConstantInt>(C);
4576 C2 = dyn_cast<ConstantInt>(D);
4577 if (C1 && C2) { // (A & C1)|(B & C2)
4578 // If we have: ((V + N) & C1) | (V & C2)
4579 // .. and C2 = ~C1 and C2 is 0+1+ and (N & C2) == 0
4580 // replace with V+N.
4581 if (C1->getValue() == ~C2->getValue()) {
4582 if ((C2->getValue() & (C2->getValue()+1)) == 0 && // C2 == 0+1+
4583 match(A, m_Add(m_Value(V1), m_Value(V2)))) {
4584 // Add commutes, try both ways.
4585 if (V1 == B && MaskedValueIsZero(V2, C2->getValue()))
4586 return ReplaceInstUsesWith(I, A);
4587 if (V2 == B && MaskedValueIsZero(V1, C2->getValue()))
4588 return ReplaceInstUsesWith(I, A);
4590 // Or commutes, try both ways.
4591 if ((C1->getValue() & (C1->getValue()+1)) == 0 &&
4592 match(B, m_Add(m_Value(V1), m_Value(V2)))) {
4593 // Add commutes, try both ways.
4594 if (V1 == A && MaskedValueIsZero(V2, C1->getValue()))
4595 return ReplaceInstUsesWith(I, B);
4596 if (V2 == A && MaskedValueIsZero(V1, C1->getValue()))
4597 return ReplaceInstUsesWith(I, B);
4600 V1 = 0; V2 = 0; V3 = 0;
4603 // Check to see if we have any common things being and'ed. If so, find the
4604 // terms for V1 & (V2|V3).
4605 if (isOnlyUse(Op0) || isOnlyUse(Op1)) {
4606 if (A == B) // (A & C)|(A & D) == A & (C|D)
4607 V1 = A, V2 = C, V3 = D;
4608 else if (A == D) // (A & C)|(B & A) == A & (B|C)
4609 V1 = A, V2 = B, V3 = C;
4610 else if (C == B) // (A & C)|(C & D) == C & (A|D)
4611 V1 = C, V2 = A, V3 = D;
4612 else if (C == D) // (A & C)|(B & C) == C & (A|B)
4613 V1 = C, V2 = A, V3 = B;
4617 InsertNewInstBefore(BinaryOperator::CreateOr(V2, V3, "tmp"), I);
4618 return BinaryOperator::CreateAnd(V1, Or);
4622 // (A & (C0?-1:0)) | (B & ~(C0?-1:0)) -> C0 ? A : B, and commuted variants
4623 if (Instruction *Match = MatchSelectFromAndOr(A, B, C, D))
4625 if (Instruction *Match = MatchSelectFromAndOr(B, A, D, C))
4627 if (Instruction *Match = MatchSelectFromAndOr(C, B, A, D))
4629 if (Instruction *Match = MatchSelectFromAndOr(D, A, B, C))
4632 // ((A&~B)|(~A&B)) -> A^B
4633 if ((match(C, m_Not(m_Specific(D))) &&
4634 match(B, m_Not(m_Specific(A)))))
4635 return BinaryOperator::CreateXor(A, D);
4636 // ((~B&A)|(~A&B)) -> A^B
4637 if ((match(A, m_Not(m_Specific(D))) &&
4638 match(B, m_Not(m_Specific(C)))))
4639 return BinaryOperator::CreateXor(C, D);
4640 // ((A&~B)|(B&~A)) -> A^B
4641 if ((match(C, m_Not(m_Specific(B))) &&
4642 match(D, m_Not(m_Specific(A)))))
4643 return BinaryOperator::CreateXor(A, B);
4644 // ((~B&A)|(B&~A)) -> A^B
4645 if ((match(A, m_Not(m_Specific(B))) &&
4646 match(D, m_Not(m_Specific(C)))))
4647 return BinaryOperator::CreateXor(C, B);
4650 // (X >> Z) | (Y >> Z) -> (X|Y) >> Z for all shifts.
4651 if (BinaryOperator *SI1 = dyn_cast<BinaryOperator>(Op1)) {
4652 if (BinaryOperator *SI0 = dyn_cast<BinaryOperator>(Op0))
4653 if (SI0->isShift() && SI0->getOpcode() == SI1->getOpcode() &&
4654 SI0->getOperand(1) == SI1->getOperand(1) &&
4655 (SI0->hasOneUse() || SI1->hasOneUse())) {
4656 Instruction *NewOp =
4657 InsertNewInstBefore(BinaryOperator::CreateOr(SI0->getOperand(0),
4659 SI0->getName()), I);
4660 return BinaryOperator::Create(SI1->getOpcode(), NewOp,
4661 SI1->getOperand(1));
4665 // ((A|B)&1)|(B&-2) -> (A&1) | B
4666 if (match(Op0, m_And(m_Or(m_Value(A), m_Value(B)), m_Value(C))) ||
4667 match(Op0, m_And(m_Value(C), m_Or(m_Value(A), m_Value(B))))) {
4668 Instruction *Ret = FoldOrWithConstants(I, Op1, A, B, C);
4669 if (Ret) return Ret;
4671 // (B&-2)|((A|B)&1) -> (A&1) | B
4672 if (match(Op1, m_And(m_Or(m_Value(A), m_Value(B)), m_Value(C))) ||
4673 match(Op1, m_And(m_Value(C), m_Or(m_Value(A), m_Value(B))))) {
4674 Instruction *Ret = FoldOrWithConstants(I, Op0, A, B, C);
4675 if (Ret) return Ret;
4678 if (match(Op0, m_Not(m_Value(A)))) { // ~A | Op1
4679 if (A == Op1) // ~A | A == -1
4680 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
4684 // Note, A is still live here!
4685 if (match(Op1, m_Not(m_Value(B)))) { // Op0 | ~B
4687 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
4689 // (~A | ~B) == (~(A & B)) - De Morgan's Law
4690 if (A && isOnlyUse(Op0) && isOnlyUse(Op1)) {
4691 Value *And = InsertNewInstBefore(BinaryOperator::CreateAnd(A, B,
4692 I.getName()+".demorgan"), I);
4693 return BinaryOperator::CreateNot(And);
4697 // (icmp1 A, B) | (icmp2 A, B) --> (icmp3 A, B)
4698 if (ICmpInst *RHS = dyn_cast<ICmpInst>(I.getOperand(1))) {
4699 if (Instruction *R = AssociativeOpt(I, FoldICmpLogical(*this, RHS)))
4702 if (ICmpInst *LHS = dyn_cast<ICmpInst>(I.getOperand(0)))
4703 if (Instruction *Res = FoldOrOfICmps(I, LHS, RHS))
4707 // fold (or (cast A), (cast B)) -> (cast (or A, B))
4708 if (CastInst *Op0C = dyn_cast<CastInst>(Op0)) {
4709 if (CastInst *Op1C = dyn_cast<CastInst>(Op1))
4710 if (Op0C->getOpcode() == Op1C->getOpcode()) {// same cast kind ?
4711 if (!isa<ICmpInst>(Op0C->getOperand(0)) ||
4712 !isa<ICmpInst>(Op1C->getOperand(0))) {
4713 const Type *SrcTy = Op0C->getOperand(0)->getType();
4714 if (SrcTy == Op1C->getOperand(0)->getType() && SrcTy->isInteger() &&
4715 // Only do this if the casts both really cause code to be
4717 ValueRequiresCast(Op0C->getOpcode(), Op0C->getOperand(0),
4719 ValueRequiresCast(Op1C->getOpcode(), Op1C->getOperand(0),
4721 Instruction *NewOp = BinaryOperator::CreateOr(Op0C->getOperand(0),
4722 Op1C->getOperand(0),
4724 InsertNewInstBefore(NewOp, I);
4725 return CastInst::Create(Op0C->getOpcode(), NewOp, I.getType());
4732 // (fcmp uno x, c) | (fcmp uno y, c) -> (fcmp uno x, y)
4733 if (FCmpInst *LHS = dyn_cast<FCmpInst>(I.getOperand(0))) {
4734 if (FCmpInst *RHS = dyn_cast<FCmpInst>(I.getOperand(1))) {
4735 if (LHS->getPredicate() == FCmpInst::FCMP_UNO &&
4736 RHS->getPredicate() == FCmpInst::FCMP_UNO &&
4737 LHS->getOperand(0)->getType() == RHS->getOperand(0)->getType()) {
4738 if (ConstantFP *LHSC = dyn_cast<ConstantFP>(LHS->getOperand(1)))
4739 if (ConstantFP *RHSC = dyn_cast<ConstantFP>(RHS->getOperand(1))) {
4740 // If either of the constants are nans, then the whole thing returns
4742 if (LHSC->getValueAPF().isNaN() || RHSC->getValueAPF().isNaN())
4743 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4745 // Otherwise, no need to compare the two constants, compare the
4747 return new FCmpInst(FCmpInst::FCMP_UNO, LHS->getOperand(0),
4748 RHS->getOperand(0));
4751 Value *Op0LHS, *Op0RHS, *Op1LHS, *Op1RHS;
4752 FCmpInst::Predicate Op0CC, Op1CC;
4753 if (match(Op0, m_FCmp(Op0CC, m_Value(Op0LHS), m_Value(Op0RHS))) &&
4754 match(Op1, m_FCmp(Op1CC, m_Value(Op1LHS), m_Value(Op1RHS)))) {
4755 if (Op0LHS == Op1RHS && Op0RHS == Op1LHS) {
4756 // Swap RHS operands to match LHS.
4757 Op1CC = FCmpInst::getSwappedPredicate(Op1CC);
4758 std::swap(Op1LHS, Op1RHS);
4760 if (Op0LHS == Op1LHS && Op0RHS == Op1RHS) {
4761 // Simplify (fcmp cc0 x, y) | (fcmp cc1 x, y).
4763 return new FCmpInst((FCmpInst::Predicate)Op0CC, Op0LHS, Op0RHS);
4764 else if (Op0CC == FCmpInst::FCMP_TRUE ||
4765 Op1CC == FCmpInst::FCMP_TRUE)
4766 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4767 else if (Op0CC == FCmpInst::FCMP_FALSE)
4768 return ReplaceInstUsesWith(I, Op1);
4769 else if (Op1CC == FCmpInst::FCMP_FALSE)
4770 return ReplaceInstUsesWith(I, Op0);
4773 unsigned Op0Pred = getFCmpCode(Op0CC, Op0Ordered);
4774 unsigned Op1Pred = getFCmpCode(Op1CC, Op1Ordered);
4775 if (Op0Ordered == Op1Ordered) {
4776 // If both are ordered or unordered, return a new fcmp with
4777 // or'ed predicates.
4778 Value *RV = getFCmpValue(Op0Ordered, Op0Pred|Op1Pred,
4780 if (Instruction *I = dyn_cast<Instruction>(RV))
4782 // Otherwise, it's a constant boolean value...
4783 return ReplaceInstUsesWith(I, RV);
4791 return Changed ? &I : 0;
4796 // XorSelf - Implements: X ^ X --> 0
4799 XorSelf(Value *rhs) : RHS(rhs) {}
4800 bool shouldApply(Value *LHS) const { return LHS == RHS; }
4801 Instruction *apply(BinaryOperator &Xor) const {
4808 Instruction *InstCombiner::visitXor(BinaryOperator &I) {
4809 bool Changed = SimplifyCommutative(I);
4810 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
4812 if (isa<UndefValue>(Op1)) {
4813 if (isa<UndefValue>(Op0))
4814 // Handle undef ^ undef -> 0 special case. This is a common
4816 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
4817 return ReplaceInstUsesWith(I, Op1); // X ^ undef -> undef
4820 // xor X, X = 0, even if X is nested in a sequence of Xor's.
4821 if (Instruction *Result = AssociativeOpt(I, XorSelf(Op1))) {
4822 assert(Result == &I && "AssociativeOpt didn't work?"); Result=Result;
4823 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
4826 // See if we can simplify any instructions used by the instruction whose sole
4827 // purpose is to compute bits we don't care about.
4828 if (!isa<VectorType>(I.getType())) {
4829 uint32_t BitWidth = cast<IntegerType>(I.getType())->getBitWidth();
4830 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
4831 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
4832 KnownZero, KnownOne))
4834 } else if (isa<ConstantAggregateZero>(Op1)) {
4835 return ReplaceInstUsesWith(I, Op0); // X ^ <0,0> -> X
4838 // Is this a ~ operation?
4839 if (Value *NotOp = dyn_castNotVal(&I)) {
4840 // ~(~X & Y) --> (X | ~Y) - De Morgan's Law
4841 // ~(~X | Y) === (X & ~Y) - De Morgan's Law
4842 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(NotOp)) {
4843 if (Op0I->getOpcode() == Instruction::And ||
4844 Op0I->getOpcode() == Instruction::Or) {
4845 if (dyn_castNotVal(Op0I->getOperand(1))) Op0I->swapOperands();
4846 if (Value *Op0NotVal = dyn_castNotVal(Op0I->getOperand(0))) {
4848 BinaryOperator::CreateNot(Op0I->getOperand(1),
4849 Op0I->getOperand(1)->getName()+".not");
4850 InsertNewInstBefore(NotY, I);
4851 if (Op0I->getOpcode() == Instruction::And)
4852 return BinaryOperator::CreateOr(Op0NotVal, NotY);
4854 return BinaryOperator::CreateAnd(Op0NotVal, NotY);
4861 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
4862 // xor (cmp A, B), true = not (cmp A, B) = !cmp A, B
4863 if (RHS == ConstantInt::getTrue() && Op0->hasOneUse()) {
4864 if (ICmpInst *ICI = dyn_cast<ICmpInst>(Op0))
4865 return new ICmpInst(ICI->getInversePredicate(),
4866 ICI->getOperand(0), ICI->getOperand(1));
4868 if (FCmpInst *FCI = dyn_cast<FCmpInst>(Op0))
4869 return new FCmpInst(FCI->getInversePredicate(),
4870 FCI->getOperand(0), FCI->getOperand(1));
4873 // fold (xor(zext(cmp)), 1) and (xor(sext(cmp)), -1) to ext(!cmp).
4874 if (CastInst *Op0C = dyn_cast<CastInst>(Op0)) {
4875 if (CmpInst *CI = dyn_cast<CmpInst>(Op0C->getOperand(0))) {
4876 if (CI->hasOneUse() && Op0C->hasOneUse()) {
4877 Instruction::CastOps Opcode = Op0C->getOpcode();
4878 if (Opcode == Instruction::ZExt || Opcode == Instruction::SExt) {
4879 if (RHS == ConstantExpr::getCast(Opcode, ConstantInt::getTrue(),
4880 Op0C->getDestTy())) {
4881 Instruction *NewCI = InsertNewInstBefore(CmpInst::Create(
4882 CI->getOpcode(), CI->getInversePredicate(),
4883 CI->getOperand(0), CI->getOperand(1)), I);
4884 NewCI->takeName(CI);
4885 return CastInst::Create(Opcode, NewCI, Op0C->getType());
4892 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0)) {
4893 // ~(c-X) == X-c-1 == X+(-c-1)
4894 if (Op0I->getOpcode() == Instruction::Sub && RHS->isAllOnesValue())
4895 if (Constant *Op0I0C = dyn_cast<Constant>(Op0I->getOperand(0))) {
4896 Constant *NegOp0I0C = ConstantExpr::getNeg(Op0I0C);
4897 Constant *ConstantRHS = ConstantExpr::getSub(NegOp0I0C,
4898 ConstantInt::get(I.getType(), 1));
4899 return BinaryOperator::CreateAdd(Op0I->getOperand(1), ConstantRHS);
4902 if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1))) {
4903 if (Op0I->getOpcode() == Instruction::Add) {
4904 // ~(X-c) --> (-c-1)-X
4905 if (RHS->isAllOnesValue()) {
4906 Constant *NegOp0CI = ConstantExpr::getNeg(Op0CI);
4907 return BinaryOperator::CreateSub(
4908 ConstantExpr::getSub(NegOp0CI,
4909 ConstantInt::get(I.getType(), 1)),
4910 Op0I->getOperand(0));
4911 } else if (RHS->getValue().isSignBit()) {
4912 // (X + C) ^ signbit -> (X + C + signbit)
4913 Constant *C = ConstantInt::get(RHS->getValue() + Op0CI->getValue());
4914 return BinaryOperator::CreateAdd(Op0I->getOperand(0), C);
4917 } else if (Op0I->getOpcode() == Instruction::Or) {
4918 // (X|C1)^C2 -> X^(C1|C2) iff X&~C1 == 0
4919 if (MaskedValueIsZero(Op0I->getOperand(0), Op0CI->getValue())) {
4920 Constant *NewRHS = ConstantExpr::getOr(Op0CI, RHS);
4921 // Anything in both C1 and C2 is known to be zero, remove it from
4923 Constant *CommonBits = And(Op0CI, RHS);
4924 NewRHS = ConstantExpr::getAnd(NewRHS,
4925 ConstantExpr::getNot(CommonBits));
4926 AddToWorkList(Op0I);
4927 I.setOperand(0, Op0I->getOperand(0));
4928 I.setOperand(1, NewRHS);
4935 // Try to fold constant and into select arguments.
4936 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
4937 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
4939 if (isa<PHINode>(Op0))
4940 if (Instruction *NV = FoldOpIntoPhi(I))
4944 if (Value *X = dyn_castNotVal(Op0)) // ~A ^ A == -1
4946 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
4948 if (Value *X = dyn_castNotVal(Op1)) // A ^ ~A == -1
4950 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
4953 BinaryOperator *Op1I = dyn_cast<BinaryOperator>(Op1);
4956 if (match(Op1I, m_Or(m_Value(A), m_Value(B)))) {
4957 if (A == Op0) { // B^(B|A) == (A|B)^B
4958 Op1I->swapOperands();
4960 std::swap(Op0, Op1);
4961 } else if (B == Op0) { // B^(A|B) == (A|B)^B
4962 I.swapOperands(); // Simplified below.
4963 std::swap(Op0, Op1);
4965 } else if (match(Op1I, m_Xor(m_Specific(Op0), m_Value(B)))) {
4966 return ReplaceInstUsesWith(I, B); // A^(A^B) == B
4967 } else if (match(Op1I, m_Xor(m_Value(A), m_Specific(Op0)))) {
4968 return ReplaceInstUsesWith(I, A); // A^(B^A) == B
4969 } else if (match(Op1I, m_And(m_Value(A), m_Value(B))) && Op1I->hasOneUse()){
4970 if (A == Op0) { // A^(A&B) -> A^(B&A)
4971 Op1I->swapOperands();
4974 if (B == Op0) { // A^(B&A) -> (B&A)^A
4975 I.swapOperands(); // Simplified below.
4976 std::swap(Op0, Op1);
4981 BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0);
4984 if (match(Op0I, m_Or(m_Value(A), m_Value(B))) && Op0I->hasOneUse()) {
4985 if (A == Op1) // (B|A)^B == (A|B)^B
4987 if (B == Op1) { // (A|B)^B == A & ~B
4989 InsertNewInstBefore(BinaryOperator::CreateNot(Op1, "tmp"), I);
4990 return BinaryOperator::CreateAnd(A, NotB);
4992 } else if (match(Op0I, m_Xor(m_Specific(Op1), m_Value(B)))) {
4993 return ReplaceInstUsesWith(I, B); // (A^B)^A == B
4994 } else if (match(Op0I, m_Xor(m_Value(A), m_Specific(Op1)))) {
4995 return ReplaceInstUsesWith(I, A); // (B^A)^A == B
4996 } else if (match(Op0I, m_And(m_Value(A), m_Value(B))) && Op0I->hasOneUse()){
4997 if (A == Op1) // (A&B)^A -> (B&A)^A
4999 if (B == Op1 && // (B&A)^A == ~B & A
5000 !isa<ConstantInt>(Op1)) { // Canonical form is (B&C)^C
5002 InsertNewInstBefore(BinaryOperator::CreateNot(A, "tmp"), I);
5003 return BinaryOperator::CreateAnd(N, Op1);
5008 // (X >> Z) ^ (Y >> Z) -> (X^Y) >> Z for all shifts.
5009 if (Op0I && Op1I && Op0I->isShift() &&
5010 Op0I->getOpcode() == Op1I->getOpcode() &&
5011 Op0I->getOperand(1) == Op1I->getOperand(1) &&
5012 (Op1I->hasOneUse() || Op1I->hasOneUse())) {
5013 Instruction *NewOp =
5014 InsertNewInstBefore(BinaryOperator::CreateXor(Op0I->getOperand(0),
5015 Op1I->getOperand(0),
5016 Op0I->getName()), I);
5017 return BinaryOperator::Create(Op1I->getOpcode(), NewOp,
5018 Op1I->getOperand(1));
5022 Value *A, *B, *C, *D;
5023 // (A & B)^(A | B) -> A ^ B
5024 if (match(Op0I, m_And(m_Value(A), m_Value(B))) &&
5025 match(Op1I, m_Or(m_Value(C), m_Value(D)))) {
5026 if ((A == C && B == D) || (A == D && B == C))
5027 return BinaryOperator::CreateXor(A, B);
5029 // (A | B)^(A & B) -> A ^ B
5030 if (match(Op0I, m_Or(m_Value(A), m_Value(B))) &&
5031 match(Op1I, m_And(m_Value(C), m_Value(D)))) {
5032 if ((A == C && B == D) || (A == D && B == C))
5033 return BinaryOperator::CreateXor(A, B);
5037 if ((Op0I->hasOneUse() || Op1I->hasOneUse()) &&
5038 match(Op0I, m_And(m_Value(A), m_Value(B))) &&
5039 match(Op1I, m_And(m_Value(C), m_Value(D)))) {
5040 // (X & Y)^(X & Y) -> (Y^Z) & X
5041 Value *X = 0, *Y = 0, *Z = 0;
5043 X = A, Y = B, Z = D;
5045 X = A, Y = B, Z = C;
5047 X = B, Y = A, Z = D;
5049 X = B, Y = A, Z = C;
5052 Instruction *NewOp =
5053 InsertNewInstBefore(BinaryOperator::CreateXor(Y, Z, Op0->getName()), I);
5054 return BinaryOperator::CreateAnd(NewOp, X);
5059 // (icmp1 A, B) ^ (icmp2 A, B) --> (icmp3 A, B)
5060 if (ICmpInst *RHS = dyn_cast<ICmpInst>(I.getOperand(1)))
5061 if (Instruction *R = AssociativeOpt(I, FoldICmpLogical(*this, RHS)))
5064 // fold (xor (cast A), (cast B)) -> (cast (xor A, B))
5065 if (CastInst *Op0C = dyn_cast<CastInst>(Op0)) {
5066 if (CastInst *Op1C = dyn_cast<CastInst>(Op1))
5067 if (Op0C->getOpcode() == Op1C->getOpcode()) { // same cast kind?
5068 const Type *SrcTy = Op0C->getOperand(0)->getType();
5069 if (SrcTy == Op1C->getOperand(0)->getType() && SrcTy->isInteger() &&
5070 // Only do this if the casts both really cause code to be generated.
5071 ValueRequiresCast(Op0C->getOpcode(), Op0C->getOperand(0),
5073 ValueRequiresCast(Op1C->getOpcode(), Op1C->getOperand(0),
5075 Instruction *NewOp = BinaryOperator::CreateXor(Op0C->getOperand(0),
5076 Op1C->getOperand(0),
5078 InsertNewInstBefore(NewOp, I);
5079 return CastInst::Create(Op0C->getOpcode(), NewOp, I.getType());
5084 return Changed ? &I : 0;
5087 /// AddWithOverflow - Compute Result = In1+In2, returning true if the result
5088 /// overflowed for this type.
5089 static bool AddWithOverflow(ConstantInt *&Result, ConstantInt *In1,
5090 ConstantInt *In2, bool IsSigned = false) {
5091 Result = cast<ConstantInt>(Add(In1, In2));
5094 if (In2->getValue().isNegative())
5095 return Result->getValue().sgt(In1->getValue());
5097 return Result->getValue().slt(In1->getValue());
5099 return Result->getValue().ult(In1->getValue());
5102 /// SubWithOverflow - Compute Result = In1-In2, returning true if the result
5103 /// overflowed for this type.
5104 static bool SubWithOverflow(ConstantInt *&Result, ConstantInt *In1,
5105 ConstantInt *In2, bool IsSigned = false) {
5106 Result = cast<ConstantInt>(Subtract(In1, In2));
5109 if (In2->getValue().isNegative())
5110 return Result->getValue().slt(In1->getValue());
5112 return Result->getValue().sgt(In1->getValue());
5114 return Result->getValue().ugt(In1->getValue());
5117 /// EmitGEPOffset - Given a getelementptr instruction/constantexpr, emit the
5118 /// code necessary to compute the offset from the base pointer (without adding
5119 /// in the base pointer). Return the result as a signed integer of intptr size.
5120 static Value *EmitGEPOffset(User *GEP, Instruction &I, InstCombiner &IC) {
5121 TargetData &TD = IC.getTargetData();
5122 gep_type_iterator GTI = gep_type_begin(GEP);
5123 const Type *IntPtrTy = TD.getIntPtrType();
5124 Value *Result = Constant::getNullValue(IntPtrTy);
5126 // Build a mask for high order bits.
5127 unsigned IntPtrWidth = TD.getPointerSizeInBits();
5128 uint64_t PtrSizeMask = ~0ULL >> (64-IntPtrWidth);
5130 for (User::op_iterator i = GEP->op_begin() + 1, e = GEP->op_end(); i != e;
5133 uint64_t Size = TD.getABITypeSize(GTI.getIndexedType()) & PtrSizeMask;
5134 if (ConstantInt *OpC = dyn_cast<ConstantInt>(Op)) {
5135 if (OpC->isZero()) continue;
5137 // Handle a struct index, which adds its field offset to the pointer.
5138 if (const StructType *STy = dyn_cast<StructType>(*GTI)) {
5139 Size = TD.getStructLayout(STy)->getElementOffset(OpC->getZExtValue());
5141 if (ConstantInt *RC = dyn_cast<ConstantInt>(Result))
5142 Result = ConstantInt::get(RC->getValue() + APInt(IntPtrWidth, Size));
5144 Result = IC.InsertNewInstBefore(
5145 BinaryOperator::CreateAdd(Result,
5146 ConstantInt::get(IntPtrTy, Size),
5147 GEP->getName()+".offs"), I);
5151 Constant *Scale = ConstantInt::get(IntPtrTy, Size);
5152 Constant *OC = ConstantExpr::getIntegerCast(OpC, IntPtrTy, true /*SExt*/);
5153 Scale = ConstantExpr::getMul(OC, Scale);
5154 if (Constant *RC = dyn_cast<Constant>(Result))
5155 Result = ConstantExpr::getAdd(RC, Scale);
5157 // Emit an add instruction.
5158 Result = IC.InsertNewInstBefore(
5159 BinaryOperator::CreateAdd(Result, Scale,
5160 GEP->getName()+".offs"), I);
5164 // Convert to correct type.
5165 if (Op->getType() != IntPtrTy) {
5166 if (Constant *OpC = dyn_cast<Constant>(Op))
5167 Op = ConstantExpr::getSExt(OpC, IntPtrTy);
5169 Op = IC.InsertNewInstBefore(new SExtInst(Op, IntPtrTy,
5170 Op->getName()+".c"), I);
5173 Constant *Scale = ConstantInt::get(IntPtrTy, Size);
5174 if (Constant *OpC = dyn_cast<Constant>(Op))
5175 Op = ConstantExpr::getMul(OpC, Scale);
5176 else // We'll let instcombine(mul) convert this to a shl if possible.
5177 Op = IC.InsertNewInstBefore(BinaryOperator::CreateMul(Op, Scale,
5178 GEP->getName()+".idx"), I);
5181 // Emit an add instruction.
5182 if (isa<Constant>(Op) && isa<Constant>(Result))
5183 Result = ConstantExpr::getAdd(cast<Constant>(Op),
5184 cast<Constant>(Result));
5186 Result = IC.InsertNewInstBefore(BinaryOperator::CreateAdd(Op, Result,
5187 GEP->getName()+".offs"), I);
5193 /// EvaluateGEPOffsetExpression - Return an value that can be used to compare of
5194 /// the *offset* implied by GEP to zero. For example, if we have &A[i], we want
5195 /// to return 'i' for "icmp ne i, 0". Note that, in general, indices can be
5196 /// complex, and scales are involved. The above expression would also be legal
5197 /// to codegen as "icmp ne (i*4), 0" (assuming A is a pointer to i32). This
5198 /// later form is less amenable to optimization though, and we are allowed to
5199 /// generate the first by knowing that pointer arithmetic doesn't overflow.
5201 /// If we can't emit an optimized form for this expression, this returns null.
5203 static Value *EvaluateGEPOffsetExpression(User *GEP, Instruction &I,
5205 TargetData &TD = IC.getTargetData();
5206 gep_type_iterator GTI = gep_type_begin(GEP);
5208 // Check to see if this gep only has a single variable index. If so, and if
5209 // any constant indices are a multiple of its scale, then we can compute this
5210 // in terms of the scale of the variable index. For example, if the GEP
5211 // implies an offset of "12 + i*4", then we can codegen this as "3 + i",
5212 // because the expression will cross zero at the same point.
5213 unsigned i, e = GEP->getNumOperands();
5215 for (i = 1; i != e; ++i, ++GTI) {
5216 if (ConstantInt *CI = dyn_cast<ConstantInt>(GEP->getOperand(i))) {
5217 // Compute the aggregate offset of constant indices.
5218 if (CI->isZero()) continue;
5220 // Handle a struct index, which adds its field offset to the pointer.
5221 if (const StructType *STy = dyn_cast<StructType>(*GTI)) {
5222 Offset += TD.getStructLayout(STy)->getElementOffset(CI->getZExtValue());
5224 uint64_t Size = TD.getABITypeSize(GTI.getIndexedType());
5225 Offset += Size*CI->getSExtValue();
5228 // Found our variable index.
5233 // If there are no variable indices, we must have a constant offset, just
5234 // evaluate it the general way.
5235 if (i == e) return 0;
5237 Value *VariableIdx = GEP->getOperand(i);
5238 // Determine the scale factor of the variable element. For example, this is
5239 // 4 if the variable index is into an array of i32.
5240 uint64_t VariableScale = TD.getABITypeSize(GTI.getIndexedType());
5242 // Verify that there are no other variable indices. If so, emit the hard way.
5243 for (++i, ++GTI; i != e; ++i, ++GTI) {
5244 ConstantInt *CI = dyn_cast<ConstantInt>(GEP->getOperand(i));
5247 // Compute the aggregate offset of constant indices.
5248 if (CI->isZero()) continue;
5250 // Handle a struct index, which adds its field offset to the pointer.
5251 if (const StructType *STy = dyn_cast<StructType>(*GTI)) {
5252 Offset += TD.getStructLayout(STy)->getElementOffset(CI->getZExtValue());
5254 uint64_t Size = TD.getABITypeSize(GTI.getIndexedType());
5255 Offset += Size*CI->getSExtValue();
5259 // Okay, we know we have a single variable index, which must be a
5260 // pointer/array/vector index. If there is no offset, life is simple, return
5262 unsigned IntPtrWidth = TD.getPointerSizeInBits();
5264 // Cast to intptrty in case a truncation occurs. If an extension is needed,
5265 // we don't need to bother extending: the extension won't affect where the
5266 // computation crosses zero.
5267 if (VariableIdx->getType()->getPrimitiveSizeInBits() > IntPtrWidth)
5268 VariableIdx = new TruncInst(VariableIdx, TD.getIntPtrType(),
5269 VariableIdx->getNameStart(), &I);
5273 // Otherwise, there is an index. The computation we will do will be modulo
5274 // the pointer size, so get it.
5275 uint64_t PtrSizeMask = ~0ULL >> (64-IntPtrWidth);
5277 Offset &= PtrSizeMask;
5278 VariableScale &= PtrSizeMask;
5280 // To do this transformation, any constant index must be a multiple of the
5281 // variable scale factor. For example, we can evaluate "12 + 4*i" as "3 + i",
5282 // but we can't evaluate "10 + 3*i" in terms of i. Check that the offset is a
5283 // multiple of the variable scale.
5284 int64_t NewOffs = Offset / (int64_t)VariableScale;
5285 if (Offset != NewOffs*(int64_t)VariableScale)
5288 // Okay, we can do this evaluation. Start by converting the index to intptr.
5289 const Type *IntPtrTy = TD.getIntPtrType();
5290 if (VariableIdx->getType() != IntPtrTy)
5291 VariableIdx = CastInst::CreateIntegerCast(VariableIdx, IntPtrTy,
5293 VariableIdx->getNameStart(), &I);
5294 Constant *OffsetVal = ConstantInt::get(IntPtrTy, NewOffs);
5295 return BinaryOperator::CreateAdd(VariableIdx, OffsetVal, "offset", &I);
5299 /// FoldGEPICmp - Fold comparisons between a GEP instruction and something
5300 /// else. At this point we know that the GEP is on the LHS of the comparison.
5301 Instruction *InstCombiner::FoldGEPICmp(User *GEPLHS, Value *RHS,
5302 ICmpInst::Predicate Cond,
5304 assert(dyn_castGetElementPtr(GEPLHS) && "LHS is not a getelementptr!");
5306 // Look through bitcasts.
5307 if (BitCastInst *BCI = dyn_cast<BitCastInst>(RHS))
5308 RHS = BCI->getOperand(0);
5310 Value *PtrBase = GEPLHS->getOperand(0);
5311 if (PtrBase == RHS) {
5312 // ((gep Ptr, OFFSET) cmp Ptr) ---> (OFFSET cmp 0).
5313 // This transformation (ignoring the base and scales) is valid because we
5314 // know pointers can't overflow. See if we can output an optimized form.
5315 Value *Offset = EvaluateGEPOffsetExpression(GEPLHS, I, *this);
5317 // If not, synthesize the offset the hard way.
5319 Offset = EmitGEPOffset(GEPLHS, I, *this);
5320 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), Offset,
5321 Constant::getNullValue(Offset->getType()));
5322 } else if (User *GEPRHS = dyn_castGetElementPtr(RHS)) {
5323 // If the base pointers are different, but the indices are the same, just
5324 // compare the base pointer.
5325 if (PtrBase != GEPRHS->getOperand(0)) {
5326 bool IndicesTheSame = GEPLHS->getNumOperands()==GEPRHS->getNumOperands();
5327 IndicesTheSame &= GEPLHS->getOperand(0)->getType() ==
5328 GEPRHS->getOperand(0)->getType();
5330 for (unsigned i = 1, e = GEPLHS->getNumOperands(); i != e; ++i)
5331 if (GEPLHS->getOperand(i) != GEPRHS->getOperand(i)) {
5332 IndicesTheSame = false;
5336 // If all indices are the same, just compare the base pointers.
5338 return new ICmpInst(ICmpInst::getSignedPredicate(Cond),
5339 GEPLHS->getOperand(0), GEPRHS->getOperand(0));
5341 // Otherwise, the base pointers are different and the indices are
5342 // different, bail out.
5346 // If one of the GEPs has all zero indices, recurse.
5347 bool AllZeros = true;
5348 for (unsigned i = 1, e = GEPLHS->getNumOperands(); i != e; ++i)
5349 if (!isa<Constant>(GEPLHS->getOperand(i)) ||
5350 !cast<Constant>(GEPLHS->getOperand(i))->isNullValue()) {
5355 return FoldGEPICmp(GEPRHS, GEPLHS->getOperand(0),
5356 ICmpInst::getSwappedPredicate(Cond), I);
5358 // If the other GEP has all zero indices, recurse.
5360 for (unsigned i = 1, e = GEPRHS->getNumOperands(); i != e; ++i)
5361 if (!isa<Constant>(GEPRHS->getOperand(i)) ||
5362 !cast<Constant>(GEPRHS->getOperand(i))->isNullValue()) {
5367 return FoldGEPICmp(GEPLHS, GEPRHS->getOperand(0), Cond, I);
5369 if (GEPLHS->getNumOperands() == GEPRHS->getNumOperands()) {
5370 // If the GEPs only differ by one index, compare it.
5371 unsigned NumDifferences = 0; // Keep track of # differences.
5372 unsigned DiffOperand = 0; // The operand that differs.
5373 for (unsigned i = 1, e = GEPRHS->getNumOperands(); i != e; ++i)
5374 if (GEPLHS->getOperand(i) != GEPRHS->getOperand(i)) {
5375 if (GEPLHS->getOperand(i)->getType()->getPrimitiveSizeInBits() !=
5376 GEPRHS->getOperand(i)->getType()->getPrimitiveSizeInBits()) {
5377 // Irreconcilable differences.
5381 if (NumDifferences++) break;
5386 if (NumDifferences == 0) // SAME GEP?
5387 return ReplaceInstUsesWith(I, // No comparison is needed here.
5388 ConstantInt::get(Type::Int1Ty,
5389 ICmpInst::isTrueWhenEqual(Cond)));
5391 else if (NumDifferences == 1) {
5392 Value *LHSV = GEPLHS->getOperand(DiffOperand);
5393 Value *RHSV = GEPRHS->getOperand(DiffOperand);
5394 // Make sure we do a signed comparison here.
5395 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), LHSV, RHSV);
5399 // Only lower this if the icmp is the only user of the GEP or if we expect
5400 // the result to fold to a constant!
5401 if ((isa<ConstantExpr>(GEPLHS) || GEPLHS->hasOneUse()) &&
5402 (isa<ConstantExpr>(GEPRHS) || GEPRHS->hasOneUse())) {
5403 // ((gep Ptr, OFFSET1) cmp (gep Ptr, OFFSET2) ---> (OFFSET1 cmp OFFSET2)
5404 Value *L = EmitGEPOffset(GEPLHS, I, *this);
5405 Value *R = EmitGEPOffset(GEPRHS, I, *this);
5406 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), L, R);
5412 /// FoldFCmp_IntToFP_Cst - Fold fcmp ([us]itofp x, cst) if possible.
5414 Instruction *InstCombiner::FoldFCmp_IntToFP_Cst(FCmpInst &I,
5417 if (!isa<ConstantFP>(RHSC)) return 0;
5418 const APFloat &RHS = cast<ConstantFP>(RHSC)->getValueAPF();
5420 // Get the width of the mantissa. We don't want to hack on conversions that
5421 // might lose information from the integer, e.g. "i64 -> float"
5422 int MantissaWidth = LHSI->getType()->getFPMantissaWidth();
5423 if (MantissaWidth == -1) return 0; // Unknown.
5425 // Check to see that the input is converted from an integer type that is small
5426 // enough that preserves all bits. TODO: check here for "known" sign bits.
5427 // This would allow us to handle (fptosi (x >>s 62) to float) if x is i64 f.e.
5428 unsigned InputSize = LHSI->getOperand(0)->getType()->getPrimitiveSizeInBits();
5430 // If this is a uitofp instruction, we need an extra bit to hold the sign.
5431 bool LHSUnsigned = isa<UIToFPInst>(LHSI);
5435 // If the conversion would lose info, don't hack on this.
5436 if ((int)InputSize > MantissaWidth)
5439 // Otherwise, we can potentially simplify the comparison. We know that it
5440 // will always come through as an integer value and we know the constant is
5441 // not a NAN (it would have been previously simplified).
5442 assert(!RHS.isNaN() && "NaN comparison not already folded!");
5444 ICmpInst::Predicate Pred;
5445 switch (I.getPredicate()) {
5446 default: assert(0 && "Unexpected predicate!");
5447 case FCmpInst::FCMP_UEQ:
5448 case FCmpInst::FCMP_OEQ:
5449 Pred = ICmpInst::ICMP_EQ;
5451 case FCmpInst::FCMP_UGT:
5452 case FCmpInst::FCMP_OGT:
5453 Pred = LHSUnsigned ? ICmpInst::ICMP_UGT : ICmpInst::ICMP_SGT;
5455 case FCmpInst::FCMP_UGE:
5456 case FCmpInst::FCMP_OGE:
5457 Pred = LHSUnsigned ? ICmpInst::ICMP_UGE : ICmpInst::ICMP_SGE;
5459 case FCmpInst::FCMP_ULT:
5460 case FCmpInst::FCMP_OLT:
5461 Pred = LHSUnsigned ? ICmpInst::ICMP_ULT : ICmpInst::ICMP_SLT;
5463 case FCmpInst::FCMP_ULE:
5464 case FCmpInst::FCMP_OLE:
5465 Pred = LHSUnsigned ? ICmpInst::ICMP_ULE : ICmpInst::ICMP_SLE;
5467 case FCmpInst::FCMP_UNE:
5468 case FCmpInst::FCMP_ONE:
5469 Pred = ICmpInst::ICMP_NE;
5471 case FCmpInst::FCMP_ORD:
5472 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5473 case FCmpInst::FCMP_UNO:
5474 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5477 const IntegerType *IntTy = cast<IntegerType>(LHSI->getOperand(0)->getType());
5479 // Now we know that the APFloat is a normal number, zero or inf.
5481 // See if the FP constant is too large for the integer. For example,
5482 // comparing an i8 to 300.0.
5483 unsigned IntWidth = IntTy->getPrimitiveSizeInBits();
5486 // If the RHS value is > SignedMax, fold the comparison. This handles +INF
5487 // and large values.
5488 APFloat SMax(RHS.getSemantics(), APFloat::fcZero, false);
5489 SMax.convertFromAPInt(APInt::getSignedMaxValue(IntWidth), true,
5490 APFloat::rmNearestTiesToEven);
5491 if (SMax.compare(RHS) == APFloat::cmpLessThan) { // smax < 13123.0
5492 if (Pred == ICmpInst::ICMP_NE || Pred == ICmpInst::ICMP_SLT ||
5493 Pred == ICmpInst::ICMP_SLE)
5494 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5495 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5498 // If the RHS value is > UnsignedMax, fold the comparison. This handles
5499 // +INF and large values.
5500 APFloat UMax(RHS.getSemantics(), APFloat::fcZero, false);
5501 UMax.convertFromAPInt(APInt::getMaxValue(IntWidth), false,
5502 APFloat::rmNearestTiesToEven);
5503 if (UMax.compare(RHS) == APFloat::cmpLessThan) { // umax < 13123.0
5504 if (Pred == ICmpInst::ICMP_NE || Pred == ICmpInst::ICMP_ULT ||
5505 Pred == ICmpInst::ICMP_ULE)
5506 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5507 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5512 // See if the RHS value is < SignedMin.
5513 APFloat SMin(RHS.getSemantics(), APFloat::fcZero, false);
5514 SMin.convertFromAPInt(APInt::getSignedMinValue(IntWidth), true,
5515 APFloat::rmNearestTiesToEven);
5516 if (SMin.compare(RHS) == APFloat::cmpGreaterThan) { // smin > 12312.0
5517 if (Pred == ICmpInst::ICMP_NE || Pred == ICmpInst::ICMP_SGT ||
5518 Pred == ICmpInst::ICMP_SGE)
5519 return ReplaceInstUsesWith(I,ConstantInt::getTrue());
5520 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5524 // Okay, now we know that the FP constant fits in the range [SMIN, SMAX] or
5525 // [0, UMAX], but it may still be fractional. See if it is fractional by
5526 // casting the FP value to the integer value and back, checking for equality.
5527 // Don't do this for zero, because -0.0 is not fractional.
5528 Constant *RHSInt = ConstantExpr::getFPToSI(RHSC, IntTy);
5529 if (!RHS.isZero() &&
5530 ConstantExpr::getSIToFP(RHSInt, RHSC->getType()) != RHSC) {
5531 // If we had a comparison against a fractional value, we have to adjust the
5532 // compare predicate and sometimes the value. RHSC is rounded towards zero
5535 default: assert(0 && "Unexpected integer comparison!");
5536 case ICmpInst::ICMP_NE: // (float)int != 4.4 --> true
5537 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5538 case ICmpInst::ICMP_EQ: // (float)int == 4.4 --> false
5539 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5540 case ICmpInst::ICMP_ULE:
5541 // (float)int <= 4.4 --> int <= 4
5542 // (float)int <= -4.4 --> false
5543 if (RHS.isNegative())
5544 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5546 case ICmpInst::ICMP_SLE:
5547 // (float)int <= 4.4 --> int <= 4
5548 // (float)int <= -4.4 --> int < -4
5549 if (RHS.isNegative())
5550 Pred = ICmpInst::ICMP_SLT;
5552 case ICmpInst::ICMP_ULT:
5553 // (float)int < -4.4 --> false
5554 // (float)int < 4.4 --> int <= 4
5555 if (RHS.isNegative())
5556 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5557 Pred = ICmpInst::ICMP_ULE;
5559 case ICmpInst::ICMP_SLT:
5560 // (float)int < -4.4 --> int < -4
5561 // (float)int < 4.4 --> int <= 4
5562 if (!RHS.isNegative())
5563 Pred = ICmpInst::ICMP_SLE;
5565 case ICmpInst::ICMP_UGT:
5566 // (float)int > 4.4 --> int > 4
5567 // (float)int > -4.4 --> true
5568 if (RHS.isNegative())
5569 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5571 case ICmpInst::ICMP_SGT:
5572 // (float)int > 4.4 --> int > 4
5573 // (float)int > -4.4 --> int >= -4
5574 if (RHS.isNegative())
5575 Pred = ICmpInst::ICMP_SGE;
5577 case ICmpInst::ICMP_UGE:
5578 // (float)int >= -4.4 --> true
5579 // (float)int >= 4.4 --> int > 4
5580 if (!RHS.isNegative())
5581 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5582 Pred = ICmpInst::ICMP_UGT;
5584 case ICmpInst::ICMP_SGE:
5585 // (float)int >= -4.4 --> int >= -4
5586 // (float)int >= 4.4 --> int > 4
5587 if (!RHS.isNegative())
5588 Pred = ICmpInst::ICMP_SGT;
5593 // Lower this FP comparison into an appropriate integer version of the
5595 return new ICmpInst(Pred, LHSI->getOperand(0), RHSInt);
5598 Instruction *InstCombiner::visitFCmpInst(FCmpInst &I) {
5599 bool Changed = SimplifyCompare(I);
5600 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
5602 // Fold trivial predicates.
5603 if (I.getPredicate() == FCmpInst::FCMP_FALSE)
5604 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5605 if (I.getPredicate() == FCmpInst::FCMP_TRUE)
5606 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5608 // Simplify 'fcmp pred X, X'
5610 switch (I.getPredicate()) {
5611 default: assert(0 && "Unknown predicate!");
5612 case FCmpInst::FCMP_UEQ: // True if unordered or equal
5613 case FCmpInst::FCMP_UGE: // True if unordered, greater than, or equal
5614 case FCmpInst::FCMP_ULE: // True if unordered, less than, or equal
5615 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5616 case FCmpInst::FCMP_OGT: // True if ordered and greater than
5617 case FCmpInst::FCMP_OLT: // True if ordered and less than
5618 case FCmpInst::FCMP_ONE: // True if ordered and operands are unequal
5619 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5621 case FCmpInst::FCMP_UNO: // True if unordered: isnan(X) | isnan(Y)
5622 case FCmpInst::FCMP_ULT: // True if unordered or less than
5623 case FCmpInst::FCMP_UGT: // True if unordered or greater than
5624 case FCmpInst::FCMP_UNE: // True if unordered or not equal
5625 // Canonicalize these to be 'fcmp uno %X, 0.0'.
5626 I.setPredicate(FCmpInst::FCMP_UNO);
5627 I.setOperand(1, Constant::getNullValue(Op0->getType()));
5630 case FCmpInst::FCMP_ORD: // True if ordered (no nans)
5631 case FCmpInst::FCMP_OEQ: // True if ordered and equal
5632 case FCmpInst::FCMP_OGE: // True if ordered and greater than or equal
5633 case FCmpInst::FCMP_OLE: // True if ordered and less than or equal
5634 // Canonicalize these to be 'fcmp ord %X, 0.0'.
5635 I.setPredicate(FCmpInst::FCMP_ORD);
5636 I.setOperand(1, Constant::getNullValue(Op0->getType()));
5641 if (isa<UndefValue>(Op1)) // fcmp pred X, undef -> undef
5642 return ReplaceInstUsesWith(I, UndefValue::get(Type::Int1Ty));
5644 // Handle fcmp with constant RHS
5645 if (Constant *RHSC = dyn_cast<Constant>(Op1)) {
5646 // If the constant is a nan, see if we can fold the comparison based on it.
5647 if (ConstantFP *CFP = dyn_cast<ConstantFP>(RHSC)) {
5648 if (CFP->getValueAPF().isNaN()) {
5649 if (FCmpInst::isOrdered(I.getPredicate())) // True if ordered and...
5650 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5651 assert(FCmpInst::isUnordered(I.getPredicate()) &&
5652 "Comparison must be either ordered or unordered!");
5653 // True if unordered.
5654 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5658 if (Instruction *LHSI = dyn_cast<Instruction>(Op0))
5659 switch (LHSI->getOpcode()) {
5660 case Instruction::PHI:
5661 // Only fold fcmp into the PHI if the phi and fcmp are in the same
5662 // block. If in the same block, we're encouraging jump threading. If
5663 // not, we are just pessimizing the code by making an i1 phi.
5664 if (LHSI->getParent() == I.getParent())
5665 if (Instruction *NV = FoldOpIntoPhi(I))
5668 case Instruction::SIToFP:
5669 case Instruction::UIToFP:
5670 if (Instruction *NV = FoldFCmp_IntToFP_Cst(I, LHSI, RHSC))
5673 case Instruction::Select:
5674 // If either operand of the select is a constant, we can fold the
5675 // comparison into the select arms, which will cause one to be
5676 // constant folded and the select turned into a bitwise or.
5677 Value *Op1 = 0, *Op2 = 0;
5678 if (LHSI->hasOneUse()) {
5679 if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(1))) {
5680 // Fold the known value into the constant operand.
5681 Op1 = ConstantExpr::getCompare(I.getPredicate(), C, RHSC);
5682 // Insert a new FCmp of the other select operand.
5683 Op2 = InsertNewInstBefore(new FCmpInst(I.getPredicate(),
5684 LHSI->getOperand(2), RHSC,
5686 } else if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(2))) {
5687 // Fold the known value into the constant operand.
5688 Op2 = ConstantExpr::getCompare(I.getPredicate(), C, RHSC);
5689 // Insert a new FCmp of the other select operand.
5690 Op1 = InsertNewInstBefore(new FCmpInst(I.getPredicate(),
5691 LHSI->getOperand(1), RHSC,
5697 return SelectInst::Create(LHSI->getOperand(0), Op1, Op2);
5702 return Changed ? &I : 0;
5705 Instruction *InstCombiner::visitICmpInst(ICmpInst &I) {
5706 bool Changed = SimplifyCompare(I);
5707 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
5708 const Type *Ty = Op0->getType();
5712 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty,
5713 I.isTrueWhenEqual()));
5715 if (isa<UndefValue>(Op1)) // X icmp undef -> undef
5716 return ReplaceInstUsesWith(I, UndefValue::get(Type::Int1Ty));
5718 // icmp <global/alloca*/null>, <global/alloca*/null> - Global/Stack value
5719 // addresses never equal each other! We already know that Op0 != Op1.
5720 if ((isa<GlobalValue>(Op0) || isa<AllocaInst>(Op0) ||
5721 isa<ConstantPointerNull>(Op0)) &&
5722 (isa<GlobalValue>(Op1) || isa<AllocaInst>(Op1) ||
5723 isa<ConstantPointerNull>(Op1)))
5724 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty,
5725 !I.isTrueWhenEqual()));
5727 // icmp's with boolean values can always be turned into bitwise operations
5728 if (Ty == Type::Int1Ty) {
5729 switch (I.getPredicate()) {
5730 default: assert(0 && "Invalid icmp instruction!");
5731 case ICmpInst::ICMP_EQ: { // icmp eq i1 A, B -> ~(A^B)
5732 Instruction *Xor = BinaryOperator::CreateXor(Op0, Op1, I.getName()+"tmp");
5733 InsertNewInstBefore(Xor, I);
5734 return BinaryOperator::CreateNot(Xor);
5736 case ICmpInst::ICMP_NE: // icmp eq i1 A, B -> A^B
5737 return BinaryOperator::CreateXor(Op0, Op1);
5739 case ICmpInst::ICMP_UGT:
5740 std::swap(Op0, Op1); // Change icmp ugt -> icmp ult
5742 case ICmpInst::ICMP_ULT:{ // icmp ult i1 A, B -> ~A & B
5743 Instruction *Not = BinaryOperator::CreateNot(Op0, I.getName()+"tmp");
5744 InsertNewInstBefore(Not, I);
5745 return BinaryOperator::CreateAnd(Not, Op1);
5747 case ICmpInst::ICMP_SGT:
5748 std::swap(Op0, Op1); // Change icmp sgt -> icmp slt
5750 case ICmpInst::ICMP_SLT: { // icmp slt i1 A, B -> A & ~B
5751 Instruction *Not = BinaryOperator::CreateNot(Op1, I.getName()+"tmp");
5752 InsertNewInstBefore(Not, I);
5753 return BinaryOperator::CreateAnd(Not, Op0);
5755 case ICmpInst::ICMP_UGE:
5756 std::swap(Op0, Op1); // Change icmp uge -> icmp ule
5758 case ICmpInst::ICMP_ULE: { // icmp ule i1 A, B -> ~A | B
5759 Instruction *Not = BinaryOperator::CreateNot(Op0, I.getName()+"tmp");
5760 InsertNewInstBefore(Not, I);
5761 return BinaryOperator::CreateOr(Not, Op1);
5763 case ICmpInst::ICMP_SGE:
5764 std::swap(Op0, Op1); // Change icmp sge -> icmp sle
5766 case ICmpInst::ICMP_SLE: { // icmp sle i1 A, B -> A | ~B
5767 Instruction *Not = BinaryOperator::CreateNot(Op1, I.getName()+"tmp");
5768 InsertNewInstBefore(Not, I);
5769 return BinaryOperator::CreateOr(Not, Op0);
5774 // See if we are doing a comparison with a constant.
5775 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
5778 // (icmp ne/eq (sub A B) 0) -> (icmp ne/eq A, B)
5779 if (I.isEquality() && CI->isNullValue() &&
5780 match(Op0, m_Sub(m_Value(A), m_Value(B)))) {
5781 // (icmp cond A B) if cond is equality
5782 return new ICmpInst(I.getPredicate(), A, B);
5785 // If we have an icmp le or icmp ge instruction, turn it into the
5786 // appropriate icmp lt or icmp gt instruction. This allows us to rely on
5787 // them being folded in the code below.
5788 switch (I.getPredicate()) {
5790 case ICmpInst::ICMP_ULE:
5791 if (CI->isMaxValue(false)) // A <=u MAX -> TRUE
5792 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5793 return new ICmpInst(ICmpInst::ICMP_ULT, Op0, AddOne(CI));
5794 case ICmpInst::ICMP_SLE:
5795 if (CI->isMaxValue(true)) // A <=s MAX -> TRUE
5796 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5797 return new ICmpInst(ICmpInst::ICMP_SLT, Op0, AddOne(CI));
5798 case ICmpInst::ICMP_UGE:
5799 if (CI->isMinValue(false)) // A >=u MIN -> TRUE
5800 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5801 return new ICmpInst( ICmpInst::ICMP_UGT, Op0, SubOne(CI));
5802 case ICmpInst::ICMP_SGE:
5803 if (CI->isMinValue(true)) // A >=s MIN -> TRUE
5804 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5805 return new ICmpInst(ICmpInst::ICMP_SGT, Op0, SubOne(CI));
5808 // See if we can fold the comparison based on range information we can get
5809 // by checking whether bits are known to be zero or one in the input.
5810 uint32_t BitWidth = cast<IntegerType>(Ty)->getBitWidth();
5811 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
5813 // If this comparison is a normal comparison, it demands all
5814 // bits, if it is a sign bit comparison, it only demands the sign bit.
5816 bool isSignBit = isSignBitCheck(I.getPredicate(), CI, UnusedBit);
5818 if (SimplifyDemandedBits(Op0,
5819 isSignBit ? APInt::getSignBit(BitWidth)
5820 : APInt::getAllOnesValue(BitWidth),
5821 KnownZero, KnownOne, 0))
5824 // Given the known and unknown bits, compute a range that the LHS could be
5825 // in. Compute the Min, Max and RHS values based on the known bits. For the
5826 // EQ and NE we use unsigned values.
5827 APInt Min(BitWidth, 0), Max(BitWidth, 0);
5828 if (ICmpInst::isSignedPredicate(I.getPredicate()))
5829 ComputeSignedMinMaxValuesFromKnownBits(Ty, KnownZero, KnownOne, Min, Max);
5831 ComputeUnsignedMinMaxValuesFromKnownBits(Ty, KnownZero, KnownOne,Min,Max);
5833 // If Min and Max are known to be the same, then SimplifyDemandedBits
5834 // figured out that the LHS is a constant. Just constant fold this now so
5835 // that code below can assume that Min != Max.
5837 return ReplaceInstUsesWith(I, ConstantExpr::getICmp(I.getPredicate(),
5838 ConstantInt::get(Min),
5841 // Based on the range information we know about the LHS, see if we can
5842 // simplify this comparison. For example, (x&4) < 8 is always true.
5843 const APInt &RHSVal = CI->getValue();
5844 switch (I.getPredicate()) { // LE/GE have been folded already.
5845 default: assert(0 && "Unknown icmp opcode!");
5846 case ICmpInst::ICMP_EQ:
5847 if (Max.ult(RHSVal) || Min.ugt(RHSVal))
5848 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5850 case ICmpInst::ICMP_NE:
5851 if (Max.ult(RHSVal) || Min.ugt(RHSVal))
5852 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5854 case ICmpInst::ICMP_ULT:
5855 if (Max.ult(RHSVal)) // A <u C -> true iff max(A) < C
5856 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5857 if (Min.uge(RHSVal)) // A <u C -> false iff min(A) >= C
5858 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5859 if (RHSVal == Max) // A <u MAX -> A != MAX
5860 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
5861 if (RHSVal == Min+1) // A <u MIN+1 -> A == MIN
5862 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, SubOne(CI));
5864 // (x <u 2147483648) -> (x >s -1) -> true if sign bit clear
5865 if (CI->isMinValue(true))
5866 return new ICmpInst(ICmpInst::ICMP_SGT, Op0,
5867 ConstantInt::getAllOnesValue(Op0->getType()));
5869 case ICmpInst::ICMP_UGT:
5870 if (Min.ugt(RHSVal)) // A >u C -> true iff min(A) > C
5871 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5872 if (Max.ule(RHSVal)) // A >u C -> false iff max(A) <= C
5873 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5875 if (RHSVal == Min) // A >u MIN -> A != MIN
5876 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
5877 if (RHSVal == Max-1) // A >u MAX-1 -> A == MAX
5878 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, AddOne(CI));
5880 // (x >u 2147483647) -> (x <s 0) -> true if sign bit set
5881 if (CI->isMaxValue(true))
5882 return new ICmpInst(ICmpInst::ICMP_SLT, Op0,
5883 ConstantInt::getNullValue(Op0->getType()));
5885 case ICmpInst::ICMP_SLT:
5886 if (Max.slt(RHSVal)) // A <s C -> true iff max(A) < C
5887 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5888 if (Min.sge(RHSVal)) // A <s C -> false iff min(A) >= C
5889 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5890 if (RHSVal == Max) // A <s MAX -> A != MAX
5891 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
5892 if (RHSVal == Min+1) // A <s MIN+1 -> A == MIN
5893 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, SubOne(CI));
5895 case ICmpInst::ICMP_SGT:
5896 if (Min.sgt(RHSVal)) // A >s C -> true iff min(A) > C
5897 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5898 if (Max.sle(RHSVal)) // A >s C -> false iff max(A) <= C
5899 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5901 if (RHSVal == Min) // A >s MIN -> A != MIN
5902 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
5903 if (RHSVal == Max-1) // A >s MAX-1 -> A == MAX
5904 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, AddOne(CI));
5909 // Test if the ICmpInst instruction is used exclusively by a select as
5910 // part of a minimum or maximum operation. If so, refrain from doing
5911 // any other folding. This helps out other analyses which understand
5912 // non-obfuscated minimum and maximum idioms, such as ScalarEvolution
5913 // and CodeGen. And in this case, at least one of the comparison
5914 // operands has at least one user besides the compare (the select),
5915 // which would often largely negate the benefit of folding anyway.
5917 if (SelectInst *SI = dyn_cast<SelectInst>(*I.use_begin()))
5918 if ((SI->getOperand(1) == Op0 && SI->getOperand(2) == Op1) ||
5919 (SI->getOperand(2) == Op0 && SI->getOperand(1) == Op1))
5922 // See if we are doing a comparison between a constant and an instruction that
5923 // can be folded into the comparison.
5924 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
5925 // Since the RHS is a ConstantInt (CI), if the left hand side is an
5926 // instruction, see if that instruction also has constants so that the
5927 // instruction can be folded into the icmp
5928 if (Instruction *LHSI = dyn_cast<Instruction>(Op0))
5929 if (Instruction *Res = visitICmpInstWithInstAndIntCst(I, LHSI, CI))
5933 // Handle icmp with constant (but not simple integer constant) RHS
5934 if (Constant *RHSC = dyn_cast<Constant>(Op1)) {
5935 if (Instruction *LHSI = dyn_cast<Instruction>(Op0))
5936 switch (LHSI->getOpcode()) {
5937 case Instruction::GetElementPtr:
5938 if (RHSC->isNullValue()) {
5939 // icmp pred GEP (P, int 0, int 0, int 0), null -> icmp pred P, null
5940 bool isAllZeros = true;
5941 for (unsigned i = 1, e = LHSI->getNumOperands(); i != e; ++i)
5942 if (!isa<Constant>(LHSI->getOperand(i)) ||
5943 !cast<Constant>(LHSI->getOperand(i))->isNullValue()) {
5948 return new ICmpInst(I.getPredicate(), LHSI->getOperand(0),
5949 Constant::getNullValue(LHSI->getOperand(0)->getType()));
5953 case Instruction::PHI:
5954 // Only fold icmp into the PHI if the phi and fcmp are in the same
5955 // block. If in the same block, we're encouraging jump threading. If
5956 // not, we are just pessimizing the code by making an i1 phi.
5957 if (LHSI->getParent() == I.getParent())
5958 if (Instruction *NV = FoldOpIntoPhi(I))
5961 case Instruction::Select: {
5962 // If either operand of the select is a constant, we can fold the
5963 // comparison into the select arms, which will cause one to be
5964 // constant folded and the select turned into a bitwise or.
5965 Value *Op1 = 0, *Op2 = 0;
5966 if (LHSI->hasOneUse()) {
5967 if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(1))) {
5968 // Fold the known value into the constant operand.
5969 Op1 = ConstantExpr::getICmp(I.getPredicate(), C, RHSC);
5970 // Insert a new ICmp of the other select operand.
5971 Op2 = InsertNewInstBefore(new ICmpInst(I.getPredicate(),
5972 LHSI->getOperand(2), RHSC,
5974 } else if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(2))) {
5975 // Fold the known value into the constant operand.
5976 Op2 = ConstantExpr::getICmp(I.getPredicate(), C, RHSC);
5977 // Insert a new ICmp of the other select operand.
5978 Op1 = InsertNewInstBefore(new ICmpInst(I.getPredicate(),
5979 LHSI->getOperand(1), RHSC,
5985 return SelectInst::Create(LHSI->getOperand(0), Op1, Op2);
5988 case Instruction::Malloc:
5989 // If we have (malloc != null), and if the malloc has a single use, we
5990 // can assume it is successful and remove the malloc.
5991 if (LHSI->hasOneUse() && isa<ConstantPointerNull>(RHSC)) {
5992 AddToWorkList(LHSI);
5993 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty,
5994 !I.isTrueWhenEqual()));
6000 // If we can optimize a 'icmp GEP, P' or 'icmp P, GEP', do so now.
6001 if (User *GEP = dyn_castGetElementPtr(Op0))
6002 if (Instruction *NI = FoldGEPICmp(GEP, Op1, I.getPredicate(), I))
6004 if (User *GEP = dyn_castGetElementPtr(Op1))
6005 if (Instruction *NI = FoldGEPICmp(GEP, Op0,
6006 ICmpInst::getSwappedPredicate(I.getPredicate()), I))
6009 // Test to see if the operands of the icmp are casted versions of other
6010 // values. If the ptr->ptr cast can be stripped off both arguments, we do so
6012 if (BitCastInst *CI = dyn_cast<BitCastInst>(Op0)) {
6013 if (isa<PointerType>(Op0->getType()) &&
6014 (isa<Constant>(Op1) || isa<BitCastInst>(Op1))) {
6015 // We keep moving the cast from the left operand over to the right
6016 // operand, where it can often be eliminated completely.
6017 Op0 = CI->getOperand(0);
6019 // If operand #1 is a bitcast instruction, it must also be a ptr->ptr cast
6020 // so eliminate it as well.
6021 if (BitCastInst *CI2 = dyn_cast<BitCastInst>(Op1))
6022 Op1 = CI2->getOperand(0);
6024 // If Op1 is a constant, we can fold the cast into the constant.
6025 if (Op0->getType() != Op1->getType()) {
6026 if (Constant *Op1C = dyn_cast<Constant>(Op1)) {
6027 Op1 = ConstantExpr::getBitCast(Op1C, Op0->getType());
6029 // Otherwise, cast the RHS right before the icmp
6030 Op1 = InsertBitCastBefore(Op1, Op0->getType(), I);
6033 return new ICmpInst(I.getPredicate(), Op0, Op1);
6037 if (isa<CastInst>(Op0)) {
6038 // Handle the special case of: icmp (cast bool to X), <cst>
6039 // This comes up when you have code like
6042 // For generality, we handle any zero-extension of any operand comparison
6043 // with a constant or another cast from the same type.
6044 if (isa<ConstantInt>(Op1) || isa<CastInst>(Op1))
6045 if (Instruction *R = visitICmpInstWithCastAndCast(I))
6049 // See if it's the same type of instruction on the left and right.
6050 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0)) {
6051 if (BinaryOperator *Op1I = dyn_cast<BinaryOperator>(Op1)) {
6052 if (Op0I->getOpcode() == Op1I->getOpcode() && Op0I->hasOneUse() &&
6053 Op1I->hasOneUse() && Op0I->getOperand(1) == Op1I->getOperand(1) &&
6055 switch (Op0I->getOpcode()) {
6057 case Instruction::Add:
6058 case Instruction::Sub:
6059 case Instruction::Xor:
6060 // a+x icmp eq/ne b+x --> a icmp b
6061 return new ICmpInst(I.getPredicate(), Op0I->getOperand(0),
6062 Op1I->getOperand(0));
6064 case Instruction::Mul:
6065 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op0I->getOperand(1))) {
6066 // a * Cst icmp eq/ne b * Cst --> a & Mask icmp b & Mask
6067 // Mask = -1 >> count-trailing-zeros(Cst).
6068 if (!CI->isZero() && !CI->isOne()) {
6069 const APInt &AP = CI->getValue();
6070 ConstantInt *Mask = ConstantInt::get(
6071 APInt::getLowBitsSet(AP.getBitWidth(),
6073 AP.countTrailingZeros()));
6074 Instruction *And1 = BinaryOperator::CreateAnd(Op0I->getOperand(0),
6076 Instruction *And2 = BinaryOperator::CreateAnd(Op1I->getOperand(0),
6078 InsertNewInstBefore(And1, I);
6079 InsertNewInstBefore(And2, I);
6080 return new ICmpInst(I.getPredicate(), And1, And2);
6089 // ~x < ~y --> y < x
6091 if (match(Op0, m_Not(m_Value(A))) &&
6092 match(Op1, m_Not(m_Value(B))))
6093 return new ICmpInst(I.getPredicate(), B, A);
6096 if (I.isEquality()) {
6097 Value *A, *B, *C, *D;
6099 // -x == -y --> x == y
6100 if (match(Op0, m_Neg(m_Value(A))) &&
6101 match(Op1, m_Neg(m_Value(B))))
6102 return new ICmpInst(I.getPredicate(), A, B);
6104 if (match(Op0, m_Xor(m_Value(A), m_Value(B)))) {
6105 if (A == Op1 || B == Op1) { // (A^B) == A -> B == 0
6106 Value *OtherVal = A == Op1 ? B : A;
6107 return new ICmpInst(I.getPredicate(), OtherVal,
6108 Constant::getNullValue(A->getType()));
6111 if (match(Op1, m_Xor(m_Value(C), m_Value(D)))) {
6112 // A^c1 == C^c2 --> A == C^(c1^c2)
6113 ConstantInt *C1, *C2;
6114 if (match(B, m_ConstantInt(C1)) &&
6115 match(D, m_ConstantInt(C2)) && Op1->hasOneUse()) {
6116 Constant *NC = ConstantInt::get(C1->getValue() ^ C2->getValue());
6117 Instruction *Xor = BinaryOperator::CreateXor(C, NC, "tmp");
6118 return new ICmpInst(I.getPredicate(), A,
6119 InsertNewInstBefore(Xor, I));
6122 // A^B == A^D -> B == D
6123 if (A == C) return new ICmpInst(I.getPredicate(), B, D);
6124 if (A == D) return new ICmpInst(I.getPredicate(), B, C);
6125 if (B == C) return new ICmpInst(I.getPredicate(), A, D);
6126 if (B == D) return new ICmpInst(I.getPredicate(), A, C);
6130 if (match(Op1, m_Xor(m_Value(A), m_Value(B))) &&
6131 (A == Op0 || B == Op0)) {
6132 // A == (A^B) -> B == 0
6133 Value *OtherVal = A == Op0 ? B : A;
6134 return new ICmpInst(I.getPredicate(), OtherVal,
6135 Constant::getNullValue(A->getType()));
6138 // (A-B) == A -> B == 0
6139 if (match(Op0, m_Sub(m_Specific(Op1), m_Value(B))))
6140 return new ICmpInst(I.getPredicate(), B,
6141 Constant::getNullValue(B->getType()));
6143 // A == (A-B) -> B == 0
6144 if (match(Op1, m_Sub(m_Specific(Op0), m_Value(B))))
6145 return new ICmpInst(I.getPredicate(), B,
6146 Constant::getNullValue(B->getType()));
6148 // (X&Z) == (Y&Z) -> (X^Y) & Z == 0
6149 if (Op0->hasOneUse() && Op1->hasOneUse() &&
6150 match(Op0, m_And(m_Value(A), m_Value(B))) &&
6151 match(Op1, m_And(m_Value(C), m_Value(D)))) {
6152 Value *X = 0, *Y = 0, *Z = 0;
6155 X = B; Y = D; Z = A;
6156 } else if (A == D) {
6157 X = B; Y = C; Z = A;
6158 } else if (B == C) {
6159 X = A; Y = D; Z = B;
6160 } else if (B == D) {
6161 X = A; Y = C; Z = B;
6164 if (X) { // Build (X^Y) & Z
6165 Op1 = InsertNewInstBefore(BinaryOperator::CreateXor(X, Y, "tmp"), I);
6166 Op1 = InsertNewInstBefore(BinaryOperator::CreateAnd(Op1, Z, "tmp"), I);
6167 I.setOperand(0, Op1);
6168 I.setOperand(1, Constant::getNullValue(Op1->getType()));
6173 return Changed ? &I : 0;
6177 /// FoldICmpDivCst - Fold "icmp pred, ([su]div X, DivRHS), CmpRHS" where DivRHS
6178 /// and CmpRHS are both known to be integer constants.
6179 Instruction *InstCombiner::FoldICmpDivCst(ICmpInst &ICI, BinaryOperator *DivI,
6180 ConstantInt *DivRHS) {
6181 ConstantInt *CmpRHS = cast<ConstantInt>(ICI.getOperand(1));
6182 const APInt &CmpRHSV = CmpRHS->getValue();
6184 // FIXME: If the operand types don't match the type of the divide
6185 // then don't attempt this transform. The code below doesn't have the
6186 // logic to deal with a signed divide and an unsigned compare (and
6187 // vice versa). This is because (x /s C1) <s C2 produces different
6188 // results than (x /s C1) <u C2 or (x /u C1) <s C2 or even
6189 // (x /u C1) <u C2. Simply casting the operands and result won't
6190 // work. :( The if statement below tests that condition and bails
6192 bool DivIsSigned = DivI->getOpcode() == Instruction::SDiv;
6193 if (!ICI.isEquality() && DivIsSigned != ICI.isSignedPredicate())
6195 if (DivRHS->isZero())
6196 return 0; // The ProdOV computation fails on divide by zero.
6197 if (DivIsSigned && DivRHS->isAllOnesValue())
6198 return 0; // The overflow computation also screws up here
6199 if (DivRHS->isOne())
6200 return 0; // Not worth bothering, and eliminates some funny cases
6203 // Compute Prod = CI * DivRHS. We are essentially solving an equation
6204 // of form X/C1=C2. We solve for X by multiplying C1 (DivRHS) and
6205 // C2 (CI). By solving for X we can turn this into a range check
6206 // instead of computing a divide.
6207 ConstantInt *Prod = Multiply(CmpRHS, DivRHS);
6209 // Determine if the product overflows by seeing if the product is
6210 // not equal to the divide. Make sure we do the same kind of divide
6211 // as in the LHS instruction that we're folding.
6212 bool ProdOV = (DivIsSigned ? ConstantExpr::getSDiv(Prod, DivRHS) :
6213 ConstantExpr::getUDiv(Prod, DivRHS)) != CmpRHS;
6215 // Get the ICmp opcode
6216 ICmpInst::Predicate Pred = ICI.getPredicate();
6218 // Figure out the interval that is being checked. For example, a comparison
6219 // like "X /u 5 == 0" is really checking that X is in the interval [0, 5).
6220 // Compute this interval based on the constants involved and the signedness of
6221 // the compare/divide. This computes a half-open interval, keeping track of
6222 // whether either value in the interval overflows. After analysis each
6223 // overflow variable is set to 0 if it's corresponding bound variable is valid
6224 // -1 if overflowed off the bottom end, or +1 if overflowed off the top end.
6225 int LoOverflow = 0, HiOverflow = 0;
6226 ConstantInt *LoBound = 0, *HiBound = 0;
6228 if (!DivIsSigned) { // udiv
6229 // e.g. X/5 op 3 --> [15, 20)
6231 HiOverflow = LoOverflow = ProdOV;
6233 HiOverflow = AddWithOverflow(HiBound, LoBound, DivRHS, false);
6234 } else if (DivRHS->getValue().isStrictlyPositive()) { // Divisor is > 0.
6235 if (CmpRHSV == 0) { // (X / pos) op 0
6236 // Can't overflow. e.g. X/2 op 0 --> [-1, 2)
6237 LoBound = cast<ConstantInt>(ConstantExpr::getNeg(SubOne(DivRHS)));
6239 } else if (CmpRHSV.isStrictlyPositive()) { // (X / pos) op pos
6240 LoBound = Prod; // e.g. X/5 op 3 --> [15, 20)
6241 HiOverflow = LoOverflow = ProdOV;
6243 HiOverflow = AddWithOverflow(HiBound, Prod, DivRHS, true);
6244 } else { // (X / pos) op neg
6245 // e.g. X/5 op -3 --> [-15-4, -15+1) --> [-19, -14)
6246 HiBound = AddOne(Prod);
6247 LoOverflow = HiOverflow = ProdOV ? -1 : 0;
6249 ConstantInt* DivNeg = cast<ConstantInt>(ConstantExpr::getNeg(DivRHS));
6250 LoOverflow = AddWithOverflow(LoBound, HiBound, DivNeg,
6254 } else if (DivRHS->getValue().isNegative()) { // Divisor is < 0.
6255 if (CmpRHSV == 0) { // (X / neg) op 0
6256 // e.g. X/-5 op 0 --> [-4, 5)
6257 LoBound = AddOne(DivRHS);
6258 HiBound = cast<ConstantInt>(ConstantExpr::getNeg(DivRHS));
6259 if (HiBound == DivRHS) { // -INTMIN = INTMIN
6260 HiOverflow = 1; // [INTMIN+1, overflow)
6261 HiBound = 0; // e.g. X/INTMIN = 0 --> X > INTMIN
6263 } else if (CmpRHSV.isStrictlyPositive()) { // (X / neg) op pos
6264 // e.g. X/-5 op 3 --> [-19, -14)
6265 HiBound = AddOne(Prod);
6266 HiOverflow = LoOverflow = ProdOV ? -1 : 0;
6268 LoOverflow = AddWithOverflow(LoBound, HiBound, DivRHS, true) ? -1 : 0;
6269 } else { // (X / neg) op neg
6270 LoBound = Prod; // e.g. X/-5 op -3 --> [15, 20)
6271 LoOverflow = HiOverflow = ProdOV;
6273 HiOverflow = SubWithOverflow(HiBound, Prod, DivRHS, true);
6276 // Dividing by a negative swaps the condition. LT <-> GT
6277 Pred = ICmpInst::getSwappedPredicate(Pred);
6280 Value *X = DivI->getOperand(0);
6282 default: assert(0 && "Unhandled icmp opcode!");
6283 case ICmpInst::ICMP_EQ:
6284 if (LoOverflow && HiOverflow)
6285 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
6286 else if (HiOverflow)
6287 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SGE :
6288 ICmpInst::ICMP_UGE, X, LoBound);
6289 else if (LoOverflow)
6290 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SLT :
6291 ICmpInst::ICMP_ULT, X, HiBound);
6293 return InsertRangeTest(X, LoBound, HiBound, DivIsSigned, true, ICI);
6294 case ICmpInst::ICMP_NE:
6295 if (LoOverflow && HiOverflow)
6296 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
6297 else if (HiOverflow)
6298 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SLT :
6299 ICmpInst::ICMP_ULT, X, LoBound);
6300 else if (LoOverflow)
6301 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SGE :
6302 ICmpInst::ICMP_UGE, X, HiBound);
6304 return InsertRangeTest(X, LoBound, HiBound, DivIsSigned, false, ICI);
6305 case ICmpInst::ICMP_ULT:
6306 case ICmpInst::ICMP_SLT:
6307 if (LoOverflow == +1) // Low bound is greater than input range.
6308 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
6309 if (LoOverflow == -1) // Low bound is less than input range.
6310 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
6311 return new ICmpInst(Pred, X, LoBound);
6312 case ICmpInst::ICMP_UGT:
6313 case ICmpInst::ICMP_SGT:
6314 if (HiOverflow == +1) // High bound greater than input range.
6315 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
6316 else if (HiOverflow == -1) // High bound less than input range.
6317 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
6318 if (Pred == ICmpInst::ICMP_UGT)
6319 return new ICmpInst(ICmpInst::ICMP_UGE, X, HiBound);
6321 return new ICmpInst(ICmpInst::ICMP_SGE, X, HiBound);
6326 /// visitICmpInstWithInstAndIntCst - Handle "icmp (instr, intcst)".
6328 Instruction *InstCombiner::visitICmpInstWithInstAndIntCst(ICmpInst &ICI,
6331 const APInt &RHSV = RHS->getValue();
6333 switch (LHSI->getOpcode()) {
6334 case Instruction::Xor: // (icmp pred (xor X, XorCST), CI)
6335 if (ConstantInt *XorCST = dyn_cast<ConstantInt>(LHSI->getOperand(1))) {
6336 // If this is a comparison that tests the signbit (X < 0) or (x > -1),
6338 if ((ICI.getPredicate() == ICmpInst::ICMP_SLT && RHSV == 0) ||
6339 (ICI.getPredicate() == ICmpInst::ICMP_SGT && RHSV.isAllOnesValue())) {
6340 Value *CompareVal = LHSI->getOperand(0);
6342 // If the sign bit of the XorCST is not set, there is no change to
6343 // the operation, just stop using the Xor.
6344 if (!XorCST->getValue().isNegative()) {
6345 ICI.setOperand(0, CompareVal);
6346 AddToWorkList(LHSI);
6350 // Was the old condition true if the operand is positive?
6351 bool isTrueIfPositive = ICI.getPredicate() == ICmpInst::ICMP_SGT;
6353 // If so, the new one isn't.
6354 isTrueIfPositive ^= true;
6356 if (isTrueIfPositive)
6357 return new ICmpInst(ICmpInst::ICMP_SGT, CompareVal, SubOne(RHS));
6359 return new ICmpInst(ICmpInst::ICMP_SLT, CompareVal, AddOne(RHS));
6363 case Instruction::And: // (icmp pred (and X, AndCST), RHS)
6364 if (LHSI->hasOneUse() && isa<ConstantInt>(LHSI->getOperand(1)) &&
6365 LHSI->getOperand(0)->hasOneUse()) {
6366 ConstantInt *AndCST = cast<ConstantInt>(LHSI->getOperand(1));
6368 // If the LHS is an AND of a truncating cast, we can widen the
6369 // and/compare to be the input width without changing the value
6370 // produced, eliminating a cast.
6371 if (TruncInst *Cast = dyn_cast<TruncInst>(LHSI->getOperand(0))) {
6372 // We can do this transformation if either the AND constant does not
6373 // have its sign bit set or if it is an equality comparison.
6374 // Extending a relational comparison when we're checking the sign
6375 // bit would not work.
6376 if (Cast->hasOneUse() &&
6377 (ICI.isEquality() ||
6378 (AndCST->getValue().isNonNegative() && RHSV.isNonNegative()))) {
6380 cast<IntegerType>(Cast->getOperand(0)->getType())->getBitWidth();
6381 APInt NewCST = AndCST->getValue();
6382 NewCST.zext(BitWidth);
6384 NewCI.zext(BitWidth);
6385 Instruction *NewAnd =
6386 BinaryOperator::CreateAnd(Cast->getOperand(0),
6387 ConstantInt::get(NewCST),LHSI->getName());
6388 InsertNewInstBefore(NewAnd, ICI);
6389 return new ICmpInst(ICI.getPredicate(), NewAnd,
6390 ConstantInt::get(NewCI));
6394 // If this is: (X >> C1) & C2 != C3 (where any shift and any compare
6395 // could exist), turn it into (X & (C2 << C1)) != (C3 << C1). This
6396 // happens a LOT in code produced by the C front-end, for bitfield
6398 BinaryOperator *Shift = dyn_cast<BinaryOperator>(LHSI->getOperand(0));
6399 if (Shift && !Shift->isShift())
6403 ShAmt = Shift ? dyn_cast<ConstantInt>(Shift->getOperand(1)) : 0;
6404 const Type *Ty = Shift ? Shift->getType() : 0; // Type of the shift.
6405 const Type *AndTy = AndCST->getType(); // Type of the and.
6407 // We can fold this as long as we can't shift unknown bits
6408 // into the mask. This can only happen with signed shift
6409 // rights, as they sign-extend.
6411 bool CanFold = Shift->isLogicalShift();
6413 // To test for the bad case of the signed shr, see if any
6414 // of the bits shifted in could be tested after the mask.
6415 uint32_t TyBits = Ty->getPrimitiveSizeInBits();
6416 int ShAmtVal = TyBits - ShAmt->getLimitedValue(TyBits);
6418 uint32_t BitWidth = AndTy->getPrimitiveSizeInBits();
6419 if ((APInt::getHighBitsSet(BitWidth, BitWidth-ShAmtVal) &
6420 AndCST->getValue()) == 0)
6426 if (Shift->getOpcode() == Instruction::Shl)
6427 NewCst = ConstantExpr::getLShr(RHS, ShAmt);
6429 NewCst = ConstantExpr::getShl(RHS, ShAmt);
6431 // Check to see if we are shifting out any of the bits being
6433 if (ConstantExpr::get(Shift->getOpcode(), NewCst, ShAmt) != RHS) {
6434 // If we shifted bits out, the fold is not going to work out.
6435 // As a special case, check to see if this means that the
6436 // result is always true or false now.
6437 if (ICI.getPredicate() == ICmpInst::ICMP_EQ)
6438 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
6439 if (ICI.getPredicate() == ICmpInst::ICMP_NE)
6440 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
6442 ICI.setOperand(1, NewCst);
6443 Constant *NewAndCST;
6444 if (Shift->getOpcode() == Instruction::Shl)
6445 NewAndCST = ConstantExpr::getLShr(AndCST, ShAmt);
6447 NewAndCST = ConstantExpr::getShl(AndCST, ShAmt);
6448 LHSI->setOperand(1, NewAndCST);
6449 LHSI->setOperand(0, Shift->getOperand(0));
6450 AddToWorkList(Shift); // Shift is dead.
6451 AddUsesToWorkList(ICI);
6457 // Turn ((X >> Y) & C) == 0 into (X & (C << Y)) == 0. The later is
6458 // preferable because it allows the C<<Y expression to be hoisted out
6459 // of a loop if Y is invariant and X is not.
6460 if (Shift && Shift->hasOneUse() && RHSV == 0 &&
6461 ICI.isEquality() && !Shift->isArithmeticShift() &&
6462 isa<Instruction>(Shift->getOperand(0))) {
6465 if (Shift->getOpcode() == Instruction::LShr) {
6466 NS = BinaryOperator::CreateShl(AndCST,
6467 Shift->getOperand(1), "tmp");
6469 // Insert a logical shift.
6470 NS = BinaryOperator::CreateLShr(AndCST,
6471 Shift->getOperand(1), "tmp");
6473 InsertNewInstBefore(cast<Instruction>(NS), ICI);
6475 // Compute X & (C << Y).
6476 Instruction *NewAnd =
6477 BinaryOperator::CreateAnd(Shift->getOperand(0), NS, LHSI->getName());
6478 InsertNewInstBefore(NewAnd, ICI);
6480 ICI.setOperand(0, NewAnd);
6486 case Instruction::Shl: { // (icmp pred (shl X, ShAmt), CI)
6487 ConstantInt *ShAmt = dyn_cast<ConstantInt>(LHSI->getOperand(1));
6490 uint32_t TypeBits = RHSV.getBitWidth();
6492 // Check that the shift amount is in range. If not, don't perform
6493 // undefined shifts. When the shift is visited it will be
6495 if (ShAmt->uge(TypeBits))
6498 if (ICI.isEquality()) {
6499 // If we are comparing against bits always shifted out, the
6500 // comparison cannot succeed.
6502 ConstantExpr::getShl(ConstantExpr::getLShr(RHS, ShAmt), ShAmt);
6503 if (Comp != RHS) {// Comparing against a bit that we know is zero.
6504 bool IsICMP_NE = ICI.getPredicate() == ICmpInst::ICMP_NE;
6505 Constant *Cst = ConstantInt::get(Type::Int1Ty, IsICMP_NE);
6506 return ReplaceInstUsesWith(ICI, Cst);
6509 if (LHSI->hasOneUse()) {
6510 // Otherwise strength reduce the shift into an and.
6511 uint32_t ShAmtVal = (uint32_t)ShAmt->getLimitedValue(TypeBits);
6513 ConstantInt::get(APInt::getLowBitsSet(TypeBits, TypeBits-ShAmtVal));
6516 BinaryOperator::CreateAnd(LHSI->getOperand(0),
6517 Mask, LHSI->getName()+".mask");
6518 Value *And = InsertNewInstBefore(AndI, ICI);
6519 return new ICmpInst(ICI.getPredicate(), And,
6520 ConstantInt::get(RHSV.lshr(ShAmtVal)));
6524 // Otherwise, if this is a comparison of the sign bit, simplify to and/test.
6525 bool TrueIfSigned = false;
6526 if (LHSI->hasOneUse() &&
6527 isSignBitCheck(ICI.getPredicate(), RHS, TrueIfSigned)) {
6528 // (X << 31) <s 0 --> (X&1) != 0
6529 Constant *Mask = ConstantInt::get(APInt(TypeBits, 1) <<
6530 (TypeBits-ShAmt->getZExtValue()-1));
6532 BinaryOperator::CreateAnd(LHSI->getOperand(0),
6533 Mask, LHSI->getName()+".mask");
6534 Value *And = InsertNewInstBefore(AndI, ICI);
6536 return new ICmpInst(TrueIfSigned ? ICmpInst::ICMP_NE : ICmpInst::ICMP_EQ,
6537 And, Constant::getNullValue(And->getType()));
6542 case Instruction::LShr: // (icmp pred (shr X, ShAmt), CI)
6543 case Instruction::AShr: {
6544 // Only handle equality comparisons of shift-by-constant.
6545 ConstantInt *ShAmt = dyn_cast<ConstantInt>(LHSI->getOperand(1));
6546 if (!ShAmt || !ICI.isEquality()) break;
6548 // Check that the shift amount is in range. If not, don't perform
6549 // undefined shifts. When the shift is visited it will be
6551 uint32_t TypeBits = RHSV.getBitWidth();
6552 if (ShAmt->uge(TypeBits))
6555 uint32_t ShAmtVal = (uint32_t)ShAmt->getLimitedValue(TypeBits);
6557 // If we are comparing against bits always shifted out, the
6558 // comparison cannot succeed.
6559 APInt Comp = RHSV << ShAmtVal;
6560 if (LHSI->getOpcode() == Instruction::LShr)
6561 Comp = Comp.lshr(ShAmtVal);
6563 Comp = Comp.ashr(ShAmtVal);
6565 if (Comp != RHSV) { // Comparing against a bit that we know is zero.
6566 bool IsICMP_NE = ICI.getPredicate() == ICmpInst::ICMP_NE;
6567 Constant *Cst = ConstantInt::get(Type::Int1Ty, IsICMP_NE);
6568 return ReplaceInstUsesWith(ICI, Cst);
6571 // Otherwise, check to see if the bits shifted out are known to be zero.
6572 // If so, we can compare against the unshifted value:
6573 // (X & 4) >> 1 == 2 --> (X & 4) == 4.
6574 if (LHSI->hasOneUse() &&
6575 MaskedValueIsZero(LHSI->getOperand(0),
6576 APInt::getLowBitsSet(Comp.getBitWidth(), ShAmtVal))) {
6577 return new ICmpInst(ICI.getPredicate(), LHSI->getOperand(0),
6578 ConstantExpr::getShl(RHS, ShAmt));
6581 if (LHSI->hasOneUse()) {
6582 // Otherwise strength reduce the shift into an and.
6583 APInt Val(APInt::getHighBitsSet(TypeBits, TypeBits - ShAmtVal));
6584 Constant *Mask = ConstantInt::get(Val);
6587 BinaryOperator::CreateAnd(LHSI->getOperand(0),
6588 Mask, LHSI->getName()+".mask");
6589 Value *And = InsertNewInstBefore(AndI, ICI);
6590 return new ICmpInst(ICI.getPredicate(), And,
6591 ConstantExpr::getShl(RHS, ShAmt));
6596 case Instruction::SDiv:
6597 case Instruction::UDiv:
6598 // Fold: icmp pred ([us]div X, C1), C2 -> range test
6599 // Fold this div into the comparison, producing a range check.
6600 // Determine, based on the divide type, what the range is being
6601 // checked. If there is an overflow on the low or high side, remember
6602 // it, otherwise compute the range [low, hi) bounding the new value.
6603 // See: InsertRangeTest above for the kinds of replacements possible.
6604 if (ConstantInt *DivRHS = dyn_cast<ConstantInt>(LHSI->getOperand(1)))
6605 if (Instruction *R = FoldICmpDivCst(ICI, cast<BinaryOperator>(LHSI),
6610 case Instruction::Add:
6611 // Fold: icmp pred (add, X, C1), C2
6613 if (!ICI.isEquality()) {
6614 ConstantInt *LHSC = dyn_cast<ConstantInt>(LHSI->getOperand(1));
6616 const APInt &LHSV = LHSC->getValue();
6618 ConstantRange CR = ICI.makeConstantRange(ICI.getPredicate(), RHSV)
6621 if (ICI.isSignedPredicate()) {
6622 if (CR.getLower().isSignBit()) {
6623 return new ICmpInst(ICmpInst::ICMP_SLT, LHSI->getOperand(0),
6624 ConstantInt::get(CR.getUpper()));
6625 } else if (CR.getUpper().isSignBit()) {
6626 return new ICmpInst(ICmpInst::ICMP_SGE, LHSI->getOperand(0),
6627 ConstantInt::get(CR.getLower()));
6630 if (CR.getLower().isMinValue()) {
6631 return new ICmpInst(ICmpInst::ICMP_ULT, LHSI->getOperand(0),
6632 ConstantInt::get(CR.getUpper()));
6633 } else if (CR.getUpper().isMinValue()) {
6634 return new ICmpInst(ICmpInst::ICMP_UGE, LHSI->getOperand(0),
6635 ConstantInt::get(CR.getLower()));
6642 // Simplify icmp_eq and icmp_ne instructions with integer constant RHS.
6643 if (ICI.isEquality()) {
6644 bool isICMP_NE = ICI.getPredicate() == ICmpInst::ICMP_NE;
6646 // If the first operand is (add|sub|and|or|xor|rem) with a constant, and
6647 // the second operand is a constant, simplify a bit.
6648 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(LHSI)) {
6649 switch (BO->getOpcode()) {
6650 case Instruction::SRem:
6651 // If we have a signed (X % (2^c)) == 0, turn it into an unsigned one.
6652 if (RHSV == 0 && isa<ConstantInt>(BO->getOperand(1)) &&BO->hasOneUse()){
6653 const APInt &V = cast<ConstantInt>(BO->getOperand(1))->getValue();
6654 if (V.sgt(APInt(V.getBitWidth(), 1)) && V.isPowerOf2()) {
6655 Instruction *NewRem =
6656 BinaryOperator::CreateURem(BO->getOperand(0), BO->getOperand(1),
6658 InsertNewInstBefore(NewRem, ICI);
6659 return new ICmpInst(ICI.getPredicate(), NewRem,
6660 Constant::getNullValue(BO->getType()));
6664 case Instruction::Add:
6665 // Replace ((add A, B) != C) with (A != C-B) if B & C are constants.
6666 if (ConstantInt *BOp1C = dyn_cast<ConstantInt>(BO->getOperand(1))) {
6667 if (BO->hasOneUse())
6668 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
6669 Subtract(RHS, BOp1C));
6670 } else if (RHSV == 0) {
6671 // Replace ((add A, B) != 0) with (A != -B) if A or B is
6672 // efficiently invertible, or if the add has just this one use.
6673 Value *BOp0 = BO->getOperand(0), *BOp1 = BO->getOperand(1);
6675 if (Value *NegVal = dyn_castNegVal(BOp1))
6676 return new ICmpInst(ICI.getPredicate(), BOp0, NegVal);
6677 else if (Value *NegVal = dyn_castNegVal(BOp0))
6678 return new ICmpInst(ICI.getPredicate(), NegVal, BOp1);
6679 else if (BO->hasOneUse()) {
6680 Instruction *Neg = BinaryOperator::CreateNeg(BOp1);
6681 InsertNewInstBefore(Neg, ICI);
6683 return new ICmpInst(ICI.getPredicate(), BOp0, Neg);
6687 case Instruction::Xor:
6688 // For the xor case, we can xor two constants together, eliminating
6689 // the explicit xor.
6690 if (Constant *BOC = dyn_cast<Constant>(BO->getOperand(1)))
6691 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
6692 ConstantExpr::getXor(RHS, BOC));
6695 case Instruction::Sub:
6696 // Replace (([sub|xor] A, B) != 0) with (A != B)
6698 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
6702 case Instruction::Or:
6703 // If bits are being or'd in that are not present in the constant we
6704 // are comparing against, then the comparison could never succeed!
6705 if (Constant *BOC = dyn_cast<Constant>(BO->getOperand(1))) {
6706 Constant *NotCI = ConstantExpr::getNot(RHS);
6707 if (!ConstantExpr::getAnd(BOC, NotCI)->isNullValue())
6708 return ReplaceInstUsesWith(ICI, ConstantInt::get(Type::Int1Ty,
6713 case Instruction::And:
6714 if (ConstantInt *BOC = dyn_cast<ConstantInt>(BO->getOperand(1))) {
6715 // If bits are being compared against that are and'd out, then the
6716 // comparison can never succeed!
6717 if ((RHSV & ~BOC->getValue()) != 0)
6718 return ReplaceInstUsesWith(ICI, ConstantInt::get(Type::Int1Ty,
6721 // If we have ((X & C) == C), turn it into ((X & C) != 0).
6722 if (RHS == BOC && RHSV.isPowerOf2())
6723 return new ICmpInst(isICMP_NE ? ICmpInst::ICMP_EQ :
6724 ICmpInst::ICMP_NE, LHSI,
6725 Constant::getNullValue(RHS->getType()));
6727 // Replace (and X, (1 << size(X)-1) != 0) with x s< 0
6728 if (BOC->getValue().isSignBit()) {
6729 Value *X = BO->getOperand(0);
6730 Constant *Zero = Constant::getNullValue(X->getType());
6731 ICmpInst::Predicate pred = isICMP_NE ?
6732 ICmpInst::ICMP_SLT : ICmpInst::ICMP_SGE;
6733 return new ICmpInst(pred, X, Zero);
6736 // ((X & ~7) == 0) --> X < 8
6737 if (RHSV == 0 && isHighOnes(BOC)) {
6738 Value *X = BO->getOperand(0);
6739 Constant *NegX = ConstantExpr::getNeg(BOC);
6740 ICmpInst::Predicate pred = isICMP_NE ?
6741 ICmpInst::ICMP_UGE : ICmpInst::ICMP_ULT;
6742 return new ICmpInst(pred, X, NegX);
6747 } else if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(LHSI)) {
6748 // Handle icmp {eq|ne} <intrinsic>, intcst.
6749 if (II->getIntrinsicID() == Intrinsic::bswap) {
6751 ICI.setOperand(0, II->getOperand(1));
6752 ICI.setOperand(1, ConstantInt::get(RHSV.byteSwap()));
6756 } else { // Not a ICMP_EQ/ICMP_NE
6757 // If the LHS is a cast from an integral value of the same size,
6758 // then since we know the RHS is a constant, try to simlify.
6759 if (CastInst *Cast = dyn_cast<CastInst>(LHSI)) {
6760 Value *CastOp = Cast->getOperand(0);
6761 const Type *SrcTy = CastOp->getType();
6762 uint32_t SrcTySize = SrcTy->getPrimitiveSizeInBits();
6763 if (SrcTy->isInteger() &&
6764 SrcTySize == Cast->getType()->getPrimitiveSizeInBits()) {
6765 // If this is an unsigned comparison, try to make the comparison use
6766 // smaller constant values.
6767 if (ICI.getPredicate() == ICmpInst::ICMP_ULT && RHSV.isSignBit()) {
6768 // X u< 128 => X s> -1
6769 return new ICmpInst(ICmpInst::ICMP_SGT, CastOp,
6770 ConstantInt::get(APInt::getAllOnesValue(SrcTySize)));
6771 } else if (ICI.getPredicate() == ICmpInst::ICMP_UGT &&
6772 RHSV == APInt::getSignedMaxValue(SrcTySize)) {
6773 // X u> 127 => X s< 0
6774 return new ICmpInst(ICmpInst::ICMP_SLT, CastOp,
6775 Constant::getNullValue(SrcTy));
6783 /// visitICmpInstWithCastAndCast - Handle icmp (cast x to y), (cast/cst).
6784 /// We only handle extending casts so far.
6786 Instruction *InstCombiner::visitICmpInstWithCastAndCast(ICmpInst &ICI) {
6787 const CastInst *LHSCI = cast<CastInst>(ICI.getOperand(0));
6788 Value *LHSCIOp = LHSCI->getOperand(0);
6789 const Type *SrcTy = LHSCIOp->getType();
6790 const Type *DestTy = LHSCI->getType();
6793 // Turn icmp (ptrtoint x), (ptrtoint/c) into a compare of the input if the
6794 // integer type is the same size as the pointer type.
6795 if (LHSCI->getOpcode() == Instruction::PtrToInt &&
6796 getTargetData().getPointerSizeInBits() ==
6797 cast<IntegerType>(DestTy)->getBitWidth()) {
6799 if (Constant *RHSC = dyn_cast<Constant>(ICI.getOperand(1))) {
6800 RHSOp = ConstantExpr::getIntToPtr(RHSC, SrcTy);
6801 } else if (PtrToIntInst *RHSC = dyn_cast<PtrToIntInst>(ICI.getOperand(1))) {
6802 RHSOp = RHSC->getOperand(0);
6803 // If the pointer types don't match, insert a bitcast.
6804 if (LHSCIOp->getType() != RHSOp->getType())
6805 RHSOp = InsertBitCastBefore(RHSOp, LHSCIOp->getType(), ICI);
6809 return new ICmpInst(ICI.getPredicate(), LHSCIOp, RHSOp);
6812 // The code below only handles extension cast instructions, so far.
6814 if (LHSCI->getOpcode() != Instruction::ZExt &&
6815 LHSCI->getOpcode() != Instruction::SExt)
6818 bool isSignedExt = LHSCI->getOpcode() == Instruction::SExt;
6819 bool isSignedCmp = ICI.isSignedPredicate();
6821 if (CastInst *CI = dyn_cast<CastInst>(ICI.getOperand(1))) {
6822 // Not an extension from the same type?
6823 RHSCIOp = CI->getOperand(0);
6824 if (RHSCIOp->getType() != LHSCIOp->getType())
6827 // If the signedness of the two casts doesn't agree (i.e. one is a sext
6828 // and the other is a zext), then we can't handle this.
6829 if (CI->getOpcode() != LHSCI->getOpcode())
6832 // Deal with equality cases early.
6833 if (ICI.isEquality())
6834 return new ICmpInst(ICI.getPredicate(), LHSCIOp, RHSCIOp);
6836 // A signed comparison of sign extended values simplifies into a
6837 // signed comparison.
6838 if (isSignedCmp && isSignedExt)
6839 return new ICmpInst(ICI.getPredicate(), LHSCIOp, RHSCIOp);
6841 // The other three cases all fold into an unsigned comparison.
6842 return new ICmpInst(ICI.getUnsignedPredicate(), LHSCIOp, RHSCIOp);
6845 // If we aren't dealing with a constant on the RHS, exit early
6846 ConstantInt *CI = dyn_cast<ConstantInt>(ICI.getOperand(1));
6850 // Compute the constant that would happen if we truncated to SrcTy then
6851 // reextended to DestTy.
6852 Constant *Res1 = ConstantExpr::getTrunc(CI, SrcTy);
6853 Constant *Res2 = ConstantExpr::getCast(LHSCI->getOpcode(), Res1, DestTy);
6855 // If the re-extended constant didn't change...
6857 // Make sure that sign of the Cmp and the sign of the Cast are the same.
6858 // For example, we might have:
6859 // %A = sext short %X to uint
6860 // %B = icmp ugt uint %A, 1330
6861 // It is incorrect to transform this into
6862 // %B = icmp ugt short %X, 1330
6863 // because %A may have negative value.
6865 // However, we allow this when the compare is EQ/NE, because they are
6867 if (isSignedExt == isSignedCmp || ICI.isEquality())
6868 return new ICmpInst(ICI.getPredicate(), LHSCIOp, Res1);
6872 // The re-extended constant changed so the constant cannot be represented
6873 // in the shorter type. Consequently, we cannot emit a simple comparison.
6875 // First, handle some easy cases. We know the result cannot be equal at this
6876 // point so handle the ICI.isEquality() cases
6877 if (ICI.getPredicate() == ICmpInst::ICMP_EQ)
6878 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
6879 if (ICI.getPredicate() == ICmpInst::ICMP_NE)
6880 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
6882 // Evaluate the comparison for LT (we invert for GT below). LE and GE cases
6883 // should have been folded away previously and not enter in here.
6886 // We're performing a signed comparison.
6887 if (cast<ConstantInt>(CI)->getValue().isNegative())
6888 Result = ConstantInt::getFalse(); // X < (small) --> false
6890 Result = ConstantInt::getTrue(); // X < (large) --> true
6892 // We're performing an unsigned comparison.
6894 // We're performing an unsigned comp with a sign extended value.
6895 // This is true if the input is >= 0. [aka >s -1]
6896 Constant *NegOne = ConstantInt::getAllOnesValue(SrcTy);
6897 Result = InsertNewInstBefore(new ICmpInst(ICmpInst::ICMP_SGT, LHSCIOp,
6898 NegOne, ICI.getName()), ICI);
6900 // Unsigned extend & unsigned compare -> always true.
6901 Result = ConstantInt::getTrue();
6905 // Finally, return the value computed.
6906 if (ICI.getPredicate() == ICmpInst::ICMP_ULT ||
6907 ICI.getPredicate() == ICmpInst::ICMP_SLT)
6908 return ReplaceInstUsesWith(ICI, Result);
6910 assert((ICI.getPredicate()==ICmpInst::ICMP_UGT ||
6911 ICI.getPredicate()==ICmpInst::ICMP_SGT) &&
6912 "ICmp should be folded!");
6913 if (Constant *CI = dyn_cast<Constant>(Result))
6914 return ReplaceInstUsesWith(ICI, ConstantExpr::getNot(CI));
6915 return BinaryOperator::CreateNot(Result);
6918 Instruction *InstCombiner::visitShl(BinaryOperator &I) {
6919 return commonShiftTransforms(I);
6922 Instruction *InstCombiner::visitLShr(BinaryOperator &I) {
6923 return commonShiftTransforms(I);
6926 Instruction *InstCombiner::visitAShr(BinaryOperator &I) {
6927 if (Instruction *R = commonShiftTransforms(I))
6930 Value *Op0 = I.getOperand(0);
6932 // ashr int -1, X = -1 (for any arithmetic shift rights of ~0)
6933 if (ConstantInt *CSI = dyn_cast<ConstantInt>(Op0))
6934 if (CSI->isAllOnesValue())
6935 return ReplaceInstUsesWith(I, CSI);
6937 // See if we can turn a signed shr into an unsigned shr.
6938 if (!isa<VectorType>(I.getType()) &&
6939 MaskedValueIsZero(Op0,
6940 APInt::getSignBit(I.getType()->getPrimitiveSizeInBits())))
6941 return BinaryOperator::CreateLShr(Op0, I.getOperand(1));
6946 Instruction *InstCombiner::commonShiftTransforms(BinaryOperator &I) {
6947 assert(I.getOperand(1)->getType() == I.getOperand(0)->getType());
6948 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
6950 // shl X, 0 == X and shr X, 0 == X
6951 // shl 0, X == 0 and shr 0, X == 0
6952 if (Op1 == Constant::getNullValue(Op1->getType()) ||
6953 Op0 == Constant::getNullValue(Op0->getType()))
6954 return ReplaceInstUsesWith(I, Op0);
6956 if (isa<UndefValue>(Op0)) {
6957 if (I.getOpcode() == Instruction::AShr) // undef >>s X -> undef
6958 return ReplaceInstUsesWith(I, Op0);
6959 else // undef << X -> 0, undef >>u X -> 0
6960 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
6962 if (isa<UndefValue>(Op1)) {
6963 if (I.getOpcode() == Instruction::AShr) // X >>s undef -> X
6964 return ReplaceInstUsesWith(I, Op0);
6965 else // X << undef, X >>u undef -> 0
6966 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
6969 // Try to fold constant and into select arguments.
6970 if (isa<Constant>(Op0))
6971 if (SelectInst *SI = dyn_cast<SelectInst>(Op1))
6972 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
6975 if (ConstantInt *CUI = dyn_cast<ConstantInt>(Op1))
6976 if (Instruction *Res = FoldShiftByConstant(Op0, CUI, I))
6981 Instruction *InstCombiner::FoldShiftByConstant(Value *Op0, ConstantInt *Op1,
6982 BinaryOperator &I) {
6983 bool isLeftShift = I.getOpcode() == Instruction::Shl;
6985 // See if we can simplify any instructions used by the instruction whose sole
6986 // purpose is to compute bits we don't care about.
6987 uint32_t TypeBits = Op0->getType()->getPrimitiveSizeInBits();
6988 APInt KnownZero(TypeBits, 0), KnownOne(TypeBits, 0);
6989 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(TypeBits),
6990 KnownZero, KnownOne))
6993 // shl uint X, 32 = 0 and shr ubyte Y, 9 = 0, ... just don't eliminate shr
6994 // of a signed value.
6996 if (Op1->uge(TypeBits)) {
6997 if (I.getOpcode() != Instruction::AShr)
6998 return ReplaceInstUsesWith(I, Constant::getNullValue(Op0->getType()));
7000 I.setOperand(1, ConstantInt::get(I.getType(), TypeBits-1));
7005 // ((X*C1) << C2) == (X * (C1 << C2))
7006 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(Op0))
7007 if (BO->getOpcode() == Instruction::Mul && isLeftShift)
7008 if (Constant *BOOp = dyn_cast<Constant>(BO->getOperand(1)))
7009 return BinaryOperator::CreateMul(BO->getOperand(0),
7010 ConstantExpr::getShl(BOOp, Op1));
7012 // Try to fold constant and into select arguments.
7013 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
7014 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
7016 if (isa<PHINode>(Op0))
7017 if (Instruction *NV = FoldOpIntoPhi(I))
7020 // Fold shift2(trunc(shift1(x,c1)), c2) -> trunc(shift2(shift1(x,c1),c2))
7021 if (TruncInst *TI = dyn_cast<TruncInst>(Op0)) {
7022 Instruction *TrOp = dyn_cast<Instruction>(TI->getOperand(0));
7023 // If 'shift2' is an ashr, we would have to get the sign bit into a funny
7024 // place. Don't try to do this transformation in this case. Also, we
7025 // require that the input operand is a shift-by-constant so that we have
7026 // confidence that the shifts will get folded together. We could do this
7027 // xform in more cases, but it is unlikely to be profitable.
7028 if (TrOp && I.isLogicalShift() && TrOp->isShift() &&
7029 isa<ConstantInt>(TrOp->getOperand(1))) {
7030 // Okay, we'll do this xform. Make the shift of shift.
7031 Constant *ShAmt = ConstantExpr::getZExt(Op1, TrOp->getType());
7032 Instruction *NSh = BinaryOperator::Create(I.getOpcode(), TrOp, ShAmt,
7034 InsertNewInstBefore(NSh, I); // (shift2 (shift1 & 0x00FF), c2)
7036 // For logical shifts, the truncation has the effect of making the high
7037 // part of the register be zeros. Emulate this by inserting an AND to
7038 // clear the top bits as needed. This 'and' will usually be zapped by
7039 // other xforms later if dead.
7040 unsigned SrcSize = TrOp->getType()->getPrimitiveSizeInBits();
7041 unsigned DstSize = TI->getType()->getPrimitiveSizeInBits();
7042 APInt MaskV(APInt::getLowBitsSet(SrcSize, DstSize));
7044 // The mask we constructed says what the trunc would do if occurring
7045 // between the shifts. We want to know the effect *after* the second
7046 // shift. We know that it is a logical shift by a constant, so adjust the
7047 // mask as appropriate.
7048 if (I.getOpcode() == Instruction::Shl)
7049 MaskV <<= Op1->getZExtValue();
7051 assert(I.getOpcode() == Instruction::LShr && "Unknown logical shift");
7052 MaskV = MaskV.lshr(Op1->getZExtValue());
7055 Instruction *And = BinaryOperator::CreateAnd(NSh, ConstantInt::get(MaskV),
7057 InsertNewInstBefore(And, I); // shift1 & 0x00FF
7059 // Return the value truncated to the interesting size.
7060 return new TruncInst(And, I.getType());
7064 if (Op0->hasOneUse()) {
7065 if (BinaryOperator *Op0BO = dyn_cast<BinaryOperator>(Op0)) {
7066 // Turn ((X >> C) + Y) << C -> (X + (Y << C)) & (~0 << C)
7069 switch (Op0BO->getOpcode()) {
7071 case Instruction::Add:
7072 case Instruction::And:
7073 case Instruction::Or:
7074 case Instruction::Xor: {
7075 // These operators commute.
7076 // Turn (Y + (X >> C)) << C -> (X + (Y << C)) & (~0 << C)
7077 if (isLeftShift && Op0BO->getOperand(1)->hasOneUse() &&
7078 match(Op0BO->getOperand(1), m_Shr(m_Value(V1), m_Specific(Op1)))){
7079 Instruction *YS = BinaryOperator::CreateShl(
7080 Op0BO->getOperand(0), Op1,
7082 InsertNewInstBefore(YS, I); // (Y << C)
7084 BinaryOperator::Create(Op0BO->getOpcode(), YS, V1,
7085 Op0BO->getOperand(1)->getName());
7086 InsertNewInstBefore(X, I); // (X + (Y << C))
7087 uint32_t Op1Val = Op1->getLimitedValue(TypeBits);
7088 return BinaryOperator::CreateAnd(X, ConstantInt::get(
7089 APInt::getHighBitsSet(TypeBits, TypeBits-Op1Val)));
7092 // Turn (Y + ((X >> C) & CC)) << C -> ((X & (CC << C)) + (Y << C))
7093 Value *Op0BOOp1 = Op0BO->getOperand(1);
7094 if (isLeftShift && Op0BOOp1->hasOneUse() &&
7096 m_And(m_Shr(m_Value(V1), m_Specific(Op1)),
7097 m_ConstantInt(CC))) &&
7098 cast<BinaryOperator>(Op0BOOp1)->getOperand(0)->hasOneUse()) {
7099 Instruction *YS = BinaryOperator::CreateShl(
7100 Op0BO->getOperand(0), Op1,
7102 InsertNewInstBefore(YS, I); // (Y << C)
7104 BinaryOperator::CreateAnd(V1, ConstantExpr::getShl(CC, Op1),
7105 V1->getName()+".mask");
7106 InsertNewInstBefore(XM, I); // X & (CC << C)
7108 return BinaryOperator::Create(Op0BO->getOpcode(), YS, XM);
7113 case Instruction::Sub: {
7114 // Turn ((X >> C) + Y) << C -> (X + (Y << C)) & (~0 << C)
7115 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() &&
7116 match(Op0BO->getOperand(0), m_Shr(m_Value(V1), m_Specific(Op1)))){
7117 Instruction *YS = BinaryOperator::CreateShl(
7118 Op0BO->getOperand(1), Op1,
7120 InsertNewInstBefore(YS, I); // (Y << C)
7122 BinaryOperator::Create(Op0BO->getOpcode(), V1, YS,
7123 Op0BO->getOperand(0)->getName());
7124 InsertNewInstBefore(X, I); // (X + (Y << C))
7125 uint32_t Op1Val = Op1->getLimitedValue(TypeBits);
7126 return BinaryOperator::CreateAnd(X, ConstantInt::get(
7127 APInt::getHighBitsSet(TypeBits, TypeBits-Op1Val)));
7130 // Turn (((X >> C)&CC) + Y) << C -> (X + (Y << C)) & (CC << C)
7131 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() &&
7132 match(Op0BO->getOperand(0),
7133 m_And(m_Shr(m_Value(V1), m_Value(V2)),
7134 m_ConstantInt(CC))) && V2 == Op1 &&
7135 cast<BinaryOperator>(Op0BO->getOperand(0))
7136 ->getOperand(0)->hasOneUse()) {
7137 Instruction *YS = BinaryOperator::CreateShl(
7138 Op0BO->getOperand(1), Op1,
7140 InsertNewInstBefore(YS, I); // (Y << C)
7142 BinaryOperator::CreateAnd(V1, ConstantExpr::getShl(CC, Op1),
7143 V1->getName()+".mask");
7144 InsertNewInstBefore(XM, I); // X & (CC << C)
7146 return BinaryOperator::Create(Op0BO->getOpcode(), XM, YS);
7154 // If the operand is an bitwise operator with a constant RHS, and the
7155 // shift is the only use, we can pull it out of the shift.
7156 if (ConstantInt *Op0C = dyn_cast<ConstantInt>(Op0BO->getOperand(1))) {
7157 bool isValid = true; // Valid only for And, Or, Xor
7158 bool highBitSet = false; // Transform if high bit of constant set?
7160 switch (Op0BO->getOpcode()) {
7161 default: isValid = false; break; // Do not perform transform!
7162 case Instruction::Add:
7163 isValid = isLeftShift;
7165 case Instruction::Or:
7166 case Instruction::Xor:
7169 case Instruction::And:
7174 // If this is a signed shift right, and the high bit is modified
7175 // by the logical operation, do not perform the transformation.
7176 // The highBitSet boolean indicates the value of the high bit of
7177 // the constant which would cause it to be modified for this
7180 if (isValid && I.getOpcode() == Instruction::AShr)
7181 isValid = Op0C->getValue()[TypeBits-1] == highBitSet;
7184 Constant *NewRHS = ConstantExpr::get(I.getOpcode(), Op0C, Op1);
7186 Instruction *NewShift =
7187 BinaryOperator::Create(I.getOpcode(), Op0BO->getOperand(0), Op1);
7188 InsertNewInstBefore(NewShift, I);
7189 NewShift->takeName(Op0BO);
7191 return BinaryOperator::Create(Op0BO->getOpcode(), NewShift,
7198 // Find out if this is a shift of a shift by a constant.
7199 BinaryOperator *ShiftOp = dyn_cast<BinaryOperator>(Op0);
7200 if (ShiftOp && !ShiftOp->isShift())
7203 if (ShiftOp && isa<ConstantInt>(ShiftOp->getOperand(1))) {
7204 ConstantInt *ShiftAmt1C = cast<ConstantInt>(ShiftOp->getOperand(1));
7205 uint32_t ShiftAmt1 = ShiftAmt1C->getLimitedValue(TypeBits);
7206 uint32_t ShiftAmt2 = Op1->getLimitedValue(TypeBits);
7207 assert(ShiftAmt2 != 0 && "Should have been simplified earlier");
7208 if (ShiftAmt1 == 0) return 0; // Will be simplified in the future.
7209 Value *X = ShiftOp->getOperand(0);
7211 uint32_t AmtSum = ShiftAmt1+ShiftAmt2; // Fold into one big shift.
7212 if (AmtSum > TypeBits)
7215 const IntegerType *Ty = cast<IntegerType>(I.getType());
7217 // Check for (X << c1) << c2 and (X >> c1) >> c2
7218 if (I.getOpcode() == ShiftOp->getOpcode()) {
7219 return BinaryOperator::Create(I.getOpcode(), X,
7220 ConstantInt::get(Ty, AmtSum));
7221 } else if (ShiftOp->getOpcode() == Instruction::LShr &&
7222 I.getOpcode() == Instruction::AShr) {
7223 // ((X >>u C1) >>s C2) -> (X >>u (C1+C2)) since C1 != 0.
7224 return BinaryOperator::CreateLShr(X, ConstantInt::get(Ty, AmtSum));
7225 } else if (ShiftOp->getOpcode() == Instruction::AShr &&
7226 I.getOpcode() == Instruction::LShr) {
7227 // ((X >>s C1) >>u C2) -> ((X >>s (C1+C2)) & mask) since C1 != 0.
7228 Instruction *Shift =
7229 BinaryOperator::CreateAShr(X, ConstantInt::get(Ty, AmtSum));
7230 InsertNewInstBefore(Shift, I);
7232 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt2));
7233 return BinaryOperator::CreateAnd(Shift, ConstantInt::get(Mask));
7236 // Okay, if we get here, one shift must be left, and the other shift must be
7237 // right. See if the amounts are equal.
7238 if (ShiftAmt1 == ShiftAmt2) {
7239 // If we have ((X >>? C) << C), turn this into X & (-1 << C).
7240 if (I.getOpcode() == Instruction::Shl) {
7241 APInt Mask(APInt::getHighBitsSet(TypeBits, TypeBits - ShiftAmt1));
7242 return BinaryOperator::CreateAnd(X, ConstantInt::get(Mask));
7244 // If we have ((X << C) >>u C), turn this into X & (-1 >>u C).
7245 if (I.getOpcode() == Instruction::LShr) {
7246 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt1));
7247 return BinaryOperator::CreateAnd(X, ConstantInt::get(Mask));
7249 // We can simplify ((X << C) >>s C) into a trunc + sext.
7250 // NOTE: we could do this for any C, but that would make 'unusual' integer
7251 // types. For now, just stick to ones well-supported by the code
7253 const Type *SExtType = 0;
7254 switch (Ty->getBitWidth() - ShiftAmt1) {
7261 SExtType = IntegerType::get(Ty->getBitWidth() - ShiftAmt1);
7266 Instruction *NewTrunc = new TruncInst(X, SExtType, "sext");
7267 InsertNewInstBefore(NewTrunc, I);
7268 return new SExtInst(NewTrunc, Ty);
7270 // Otherwise, we can't handle it yet.
7271 } else if (ShiftAmt1 < ShiftAmt2) {
7272 uint32_t ShiftDiff = ShiftAmt2-ShiftAmt1;
7274 // (X >>? C1) << C2 --> X << (C2-C1) & (-1 << C2)
7275 if (I.getOpcode() == Instruction::Shl) {
7276 assert(ShiftOp->getOpcode() == Instruction::LShr ||
7277 ShiftOp->getOpcode() == Instruction::AShr);
7278 Instruction *Shift =
7279 BinaryOperator::CreateShl(X, ConstantInt::get(Ty, ShiftDiff));
7280 InsertNewInstBefore(Shift, I);
7282 APInt Mask(APInt::getHighBitsSet(TypeBits, TypeBits - ShiftAmt2));
7283 return BinaryOperator::CreateAnd(Shift, ConstantInt::get(Mask));
7286 // (X << C1) >>u C2 --> X >>u (C2-C1) & (-1 >> C2)
7287 if (I.getOpcode() == Instruction::LShr) {
7288 assert(ShiftOp->getOpcode() == Instruction::Shl);
7289 Instruction *Shift =
7290 BinaryOperator::CreateLShr(X, ConstantInt::get(Ty, ShiftDiff));
7291 InsertNewInstBefore(Shift, I);
7293 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt2));
7294 return BinaryOperator::CreateAnd(Shift, ConstantInt::get(Mask));
7297 // We can't handle (X << C1) >>s C2, it shifts arbitrary bits in.
7299 assert(ShiftAmt2 < ShiftAmt1);
7300 uint32_t ShiftDiff = ShiftAmt1-ShiftAmt2;
7302 // (X >>? C1) << C2 --> X >>? (C1-C2) & (-1 << C2)
7303 if (I.getOpcode() == Instruction::Shl) {
7304 assert(ShiftOp->getOpcode() == Instruction::LShr ||
7305 ShiftOp->getOpcode() == Instruction::AShr);
7306 Instruction *Shift =
7307 BinaryOperator::Create(ShiftOp->getOpcode(), X,
7308 ConstantInt::get(Ty, ShiftDiff));
7309 InsertNewInstBefore(Shift, I);
7311 APInt Mask(APInt::getHighBitsSet(TypeBits, TypeBits - ShiftAmt2));
7312 return BinaryOperator::CreateAnd(Shift, ConstantInt::get(Mask));
7315 // (X << C1) >>u C2 --> X << (C1-C2) & (-1 >> C2)
7316 if (I.getOpcode() == Instruction::LShr) {
7317 assert(ShiftOp->getOpcode() == Instruction::Shl);
7318 Instruction *Shift =
7319 BinaryOperator::CreateShl(X, ConstantInt::get(Ty, ShiftDiff));
7320 InsertNewInstBefore(Shift, I);
7322 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt2));
7323 return BinaryOperator::CreateAnd(Shift, ConstantInt::get(Mask));
7326 // We can't handle (X << C1) >>a C2, it shifts arbitrary bits in.
7333 /// DecomposeSimpleLinearExpr - Analyze 'Val', seeing if it is a simple linear
7334 /// expression. If so, decompose it, returning some value X, such that Val is
7337 static Value *DecomposeSimpleLinearExpr(Value *Val, unsigned &Scale,
7339 assert(Val->getType() == Type::Int32Ty && "Unexpected allocation size type!");
7340 if (ConstantInt *CI = dyn_cast<ConstantInt>(Val)) {
7341 Offset = CI->getZExtValue();
7343 return ConstantInt::get(Type::Int32Ty, 0);
7344 } else if (BinaryOperator *I = dyn_cast<BinaryOperator>(Val)) {
7345 if (ConstantInt *RHS = dyn_cast<ConstantInt>(I->getOperand(1))) {
7346 if (I->getOpcode() == Instruction::Shl) {
7347 // This is a value scaled by '1 << the shift amt'.
7348 Scale = 1U << RHS->getZExtValue();
7350 return I->getOperand(0);
7351 } else if (I->getOpcode() == Instruction::Mul) {
7352 // This value is scaled by 'RHS'.
7353 Scale = RHS->getZExtValue();
7355 return I->getOperand(0);
7356 } else if (I->getOpcode() == Instruction::Add) {
7357 // We have X+C. Check to see if we really have (X*C2)+C1,
7358 // where C1 is divisible by C2.
7361 DecomposeSimpleLinearExpr(I->getOperand(0), SubScale, Offset);
7362 Offset += RHS->getZExtValue();
7369 // Otherwise, we can't look past this.
7376 /// PromoteCastOfAllocation - If we find a cast of an allocation instruction,
7377 /// try to eliminate the cast by moving the type information into the alloc.
7378 Instruction *InstCombiner::PromoteCastOfAllocation(BitCastInst &CI,
7379 AllocationInst &AI) {
7380 const PointerType *PTy = cast<PointerType>(CI.getType());
7382 // Remove any uses of AI that are dead.
7383 assert(!CI.use_empty() && "Dead instructions should be removed earlier!");
7385 for (Value::use_iterator UI = AI.use_begin(), E = AI.use_end(); UI != E; ) {
7386 Instruction *User = cast<Instruction>(*UI++);
7387 if (isInstructionTriviallyDead(User)) {
7388 while (UI != E && *UI == User)
7389 ++UI; // If this instruction uses AI more than once, don't break UI.
7392 DOUT << "IC: DCE: " << *User;
7393 EraseInstFromFunction(*User);
7397 // Get the type really allocated and the type casted to.
7398 const Type *AllocElTy = AI.getAllocatedType();
7399 const Type *CastElTy = PTy->getElementType();
7400 if (!AllocElTy->isSized() || !CastElTy->isSized()) return 0;
7402 unsigned AllocElTyAlign = TD->getABITypeAlignment(AllocElTy);
7403 unsigned CastElTyAlign = TD->getABITypeAlignment(CastElTy);
7404 if (CastElTyAlign < AllocElTyAlign) return 0;
7406 // If the allocation has multiple uses, only promote it if we are strictly
7407 // increasing the alignment of the resultant allocation. If we keep it the
7408 // same, we open the door to infinite loops of various kinds.
7409 if (!AI.hasOneUse() && CastElTyAlign == AllocElTyAlign) return 0;
7411 uint64_t AllocElTySize = TD->getABITypeSize(AllocElTy);
7412 uint64_t CastElTySize = TD->getABITypeSize(CastElTy);
7413 if (CastElTySize == 0 || AllocElTySize == 0) return 0;
7415 // See if we can satisfy the modulus by pulling a scale out of the array
7417 unsigned ArraySizeScale;
7419 Value *NumElements = // See if the array size is a decomposable linear expr.
7420 DecomposeSimpleLinearExpr(AI.getOperand(0), ArraySizeScale, ArrayOffset);
7422 // If we can now satisfy the modulus, by using a non-1 scale, we really can
7424 if ((AllocElTySize*ArraySizeScale) % CastElTySize != 0 ||
7425 (AllocElTySize*ArrayOffset ) % CastElTySize != 0) return 0;
7427 unsigned Scale = (AllocElTySize*ArraySizeScale)/CastElTySize;
7432 // If the allocation size is constant, form a constant mul expression
7433 Amt = ConstantInt::get(Type::Int32Ty, Scale);
7434 if (isa<ConstantInt>(NumElements))
7435 Amt = Multiply(cast<ConstantInt>(NumElements), cast<ConstantInt>(Amt));
7436 // otherwise multiply the amount and the number of elements
7437 else if (Scale != 1) {
7438 Instruction *Tmp = BinaryOperator::CreateMul(Amt, NumElements, "tmp");
7439 Amt = InsertNewInstBefore(Tmp, AI);
7443 if (int Offset = (AllocElTySize*ArrayOffset)/CastElTySize) {
7444 Value *Off = ConstantInt::get(Type::Int32Ty, Offset, true);
7445 Instruction *Tmp = BinaryOperator::CreateAdd(Amt, Off, "tmp");
7446 Amt = InsertNewInstBefore(Tmp, AI);
7449 AllocationInst *New;
7450 if (isa<MallocInst>(AI))
7451 New = new MallocInst(CastElTy, Amt, AI.getAlignment());
7453 New = new AllocaInst(CastElTy, Amt, AI.getAlignment());
7454 InsertNewInstBefore(New, AI);
7457 // If the allocation has multiple uses, insert a cast and change all things
7458 // that used it to use the new cast. This will also hack on CI, but it will
7460 if (!AI.hasOneUse()) {
7461 AddUsesToWorkList(AI);
7462 // New is the allocation instruction, pointer typed. AI is the original
7463 // allocation instruction, also pointer typed. Thus, cast to use is BitCast.
7464 CastInst *NewCast = new BitCastInst(New, AI.getType(), "tmpcast");
7465 InsertNewInstBefore(NewCast, AI);
7466 AI.replaceAllUsesWith(NewCast);
7468 return ReplaceInstUsesWith(CI, New);
7471 /// CanEvaluateInDifferentType - Return true if we can take the specified value
7472 /// and return it as type Ty without inserting any new casts and without
7473 /// changing the computed value. This is used by code that tries to decide
7474 /// whether promoting or shrinking integer operations to wider or smaller types
7475 /// will allow us to eliminate a truncate or extend.
7477 /// This is a truncation operation if Ty is smaller than V->getType(), or an
7478 /// extension operation if Ty is larger.
7480 /// If CastOpc is a truncation, then Ty will be a type smaller than V. We
7481 /// should return true if trunc(V) can be computed by computing V in the smaller
7482 /// type. If V is an instruction, then trunc(inst(x,y)) can be computed as
7483 /// inst(trunc(x),trunc(y)), which only makes sense if x and y can be
7484 /// efficiently truncated.
7486 /// If CastOpc is a sext or zext, we are asking if the low bits of the value can
7487 /// bit computed in a larger type, which is then and'd or sext_in_reg'd to get
7488 /// the final result.
7489 bool InstCombiner::CanEvaluateInDifferentType(Value *V, const IntegerType *Ty,
7491 int &NumCastsRemoved) {
7492 // We can always evaluate constants in another type.
7493 if (isa<ConstantInt>(V))
7496 Instruction *I = dyn_cast<Instruction>(V);
7497 if (!I) return false;
7499 const IntegerType *OrigTy = cast<IntegerType>(V->getType());
7501 // If this is an extension or truncate, we can often eliminate it.
7502 if (isa<TruncInst>(I) || isa<ZExtInst>(I) || isa<SExtInst>(I)) {
7503 // If this is a cast from the destination type, we can trivially eliminate
7504 // it, and this will remove a cast overall.
7505 if (I->getOperand(0)->getType() == Ty) {
7506 // If the first operand is itself a cast, and is eliminable, do not count
7507 // this as an eliminable cast. We would prefer to eliminate those two
7509 if (!isa<CastInst>(I->getOperand(0)) && I->hasOneUse())
7515 // We can't extend or shrink something that has multiple uses: doing so would
7516 // require duplicating the instruction in general, which isn't profitable.
7517 if (!I->hasOneUse()) return false;
7519 switch (I->getOpcode()) {
7520 case Instruction::Add:
7521 case Instruction::Sub:
7522 case Instruction::Mul:
7523 case Instruction::And:
7524 case Instruction::Or:
7525 case Instruction::Xor:
7526 // These operators can all arbitrarily be extended or truncated.
7527 return CanEvaluateInDifferentType(I->getOperand(0), Ty, CastOpc,
7529 CanEvaluateInDifferentType(I->getOperand(1), Ty, CastOpc,
7532 case Instruction::Shl:
7533 // If we are truncating the result of this SHL, and if it's a shift of a
7534 // constant amount, we can always perform a SHL in a smaller type.
7535 if (ConstantInt *CI = dyn_cast<ConstantInt>(I->getOperand(1))) {
7536 uint32_t BitWidth = Ty->getBitWidth();
7537 if (BitWidth < OrigTy->getBitWidth() &&
7538 CI->getLimitedValue(BitWidth) < BitWidth)
7539 return CanEvaluateInDifferentType(I->getOperand(0), Ty, CastOpc,
7543 case Instruction::LShr:
7544 // If this is a truncate of a logical shr, we can truncate it to a smaller
7545 // lshr iff we know that the bits we would otherwise be shifting in are
7547 if (ConstantInt *CI = dyn_cast<ConstantInt>(I->getOperand(1))) {
7548 uint32_t OrigBitWidth = OrigTy->getBitWidth();
7549 uint32_t BitWidth = Ty->getBitWidth();
7550 if (BitWidth < OrigBitWidth &&
7551 MaskedValueIsZero(I->getOperand(0),
7552 APInt::getHighBitsSet(OrigBitWidth, OrigBitWidth-BitWidth)) &&
7553 CI->getLimitedValue(BitWidth) < BitWidth) {
7554 return CanEvaluateInDifferentType(I->getOperand(0), Ty, CastOpc,
7559 case Instruction::ZExt:
7560 case Instruction::SExt:
7561 case Instruction::Trunc:
7562 // If this is the same kind of case as our original (e.g. zext+zext), we
7563 // can safely replace it. Note that replacing it does not reduce the number
7564 // of casts in the input.
7565 if (I->getOpcode() == CastOpc)
7568 case Instruction::Select: {
7569 SelectInst *SI = cast<SelectInst>(I);
7570 return CanEvaluateInDifferentType(SI->getTrueValue(), Ty, CastOpc,
7572 CanEvaluateInDifferentType(SI->getFalseValue(), Ty, CastOpc,
7575 case Instruction::PHI: {
7576 // We can change a phi if we can change all operands.
7577 PHINode *PN = cast<PHINode>(I);
7578 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
7579 if (!CanEvaluateInDifferentType(PN->getIncomingValue(i), Ty, CastOpc,
7585 // TODO: Can handle more cases here.
7592 /// EvaluateInDifferentType - Given an expression that
7593 /// CanEvaluateInDifferentType returns true for, actually insert the code to
7594 /// evaluate the expression.
7595 Value *InstCombiner::EvaluateInDifferentType(Value *V, const Type *Ty,
7597 if (Constant *C = dyn_cast<Constant>(V))
7598 return ConstantExpr::getIntegerCast(C, Ty, isSigned /*Sext or ZExt*/);
7600 // Otherwise, it must be an instruction.
7601 Instruction *I = cast<Instruction>(V);
7602 Instruction *Res = 0;
7603 switch (I->getOpcode()) {
7604 case Instruction::Add:
7605 case Instruction::Sub:
7606 case Instruction::Mul:
7607 case Instruction::And:
7608 case Instruction::Or:
7609 case Instruction::Xor:
7610 case Instruction::AShr:
7611 case Instruction::LShr:
7612 case Instruction::Shl: {
7613 Value *LHS = EvaluateInDifferentType(I->getOperand(0), Ty, isSigned);
7614 Value *RHS = EvaluateInDifferentType(I->getOperand(1), Ty, isSigned);
7615 Res = BinaryOperator::Create((Instruction::BinaryOps)I->getOpcode(),
7619 case Instruction::Trunc:
7620 case Instruction::ZExt:
7621 case Instruction::SExt:
7622 // If the source type of the cast is the type we're trying for then we can
7623 // just return the source. There's no need to insert it because it is not
7625 if (I->getOperand(0)->getType() == Ty)
7626 return I->getOperand(0);
7628 // Otherwise, must be the same type of cast, so just reinsert a new one.
7629 Res = CastInst::Create(cast<CastInst>(I)->getOpcode(), I->getOperand(0),
7632 case Instruction::Select: {
7633 Value *True = EvaluateInDifferentType(I->getOperand(1), Ty, isSigned);
7634 Value *False = EvaluateInDifferentType(I->getOperand(2), Ty, isSigned);
7635 Res = SelectInst::Create(I->getOperand(0), True, False);
7638 case Instruction::PHI: {
7639 PHINode *OPN = cast<PHINode>(I);
7640 PHINode *NPN = PHINode::Create(Ty);
7641 for (unsigned i = 0, e = OPN->getNumIncomingValues(); i != e; ++i) {
7642 Value *V =EvaluateInDifferentType(OPN->getIncomingValue(i), Ty, isSigned);
7643 NPN->addIncoming(V, OPN->getIncomingBlock(i));
7649 // TODO: Can handle more cases here.
7650 assert(0 && "Unreachable!");
7655 return InsertNewInstBefore(Res, *I);
7658 /// @brief Implement the transforms common to all CastInst visitors.
7659 Instruction *InstCombiner::commonCastTransforms(CastInst &CI) {
7660 Value *Src = CI.getOperand(0);
7662 // Many cases of "cast of a cast" are eliminable. If it's eliminable we just
7663 // eliminate it now.
7664 if (CastInst *CSrc = dyn_cast<CastInst>(Src)) { // A->B->C cast
7665 if (Instruction::CastOps opc =
7666 isEliminableCastPair(CSrc, CI.getOpcode(), CI.getType(), TD)) {
7667 // The first cast (CSrc) is eliminable so we need to fix up or replace
7668 // the second cast (CI). CSrc will then have a good chance of being dead.
7669 return CastInst::Create(opc, CSrc->getOperand(0), CI.getType());
7673 // If we are casting a select then fold the cast into the select
7674 if (SelectInst *SI = dyn_cast<SelectInst>(Src))
7675 if (Instruction *NV = FoldOpIntoSelect(CI, SI, this))
7678 // If we are casting a PHI then fold the cast into the PHI
7679 if (isa<PHINode>(Src))
7680 if (Instruction *NV = FoldOpIntoPhi(CI))
7686 /// @brief Implement the transforms for cast of pointer (bitcast/ptrtoint)
7687 Instruction *InstCombiner::commonPointerCastTransforms(CastInst &CI) {
7688 Value *Src = CI.getOperand(0);
7690 if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Src)) {
7691 // If casting the result of a getelementptr instruction with no offset, turn
7692 // this into a cast of the original pointer!
7693 if (GEP->hasAllZeroIndices()) {
7694 // Changing the cast operand is usually not a good idea but it is safe
7695 // here because the pointer operand is being replaced with another
7696 // pointer operand so the opcode doesn't need to change.
7698 CI.setOperand(0, GEP->getOperand(0));
7702 // If the GEP has a single use, and the base pointer is a bitcast, and the
7703 // GEP computes a constant offset, see if we can convert these three
7704 // instructions into fewer. This typically happens with unions and other
7705 // non-type-safe code.
7706 if (GEP->hasOneUse() && isa<BitCastInst>(GEP->getOperand(0))) {
7707 if (GEP->hasAllConstantIndices()) {
7708 // We are guaranteed to get a constant from EmitGEPOffset.
7709 ConstantInt *OffsetV = cast<ConstantInt>(EmitGEPOffset(GEP, CI, *this));
7710 int64_t Offset = OffsetV->getSExtValue();
7712 // Get the base pointer input of the bitcast, and the type it points to.
7713 Value *OrigBase = cast<BitCastInst>(GEP->getOperand(0))->getOperand(0);
7714 const Type *GEPIdxTy =
7715 cast<PointerType>(OrigBase->getType())->getElementType();
7716 if (GEPIdxTy->isSized()) {
7717 SmallVector<Value*, 8> NewIndices;
7719 // Start with the index over the outer type. Note that the type size
7720 // might be zero (even if the offset isn't zero) if the indexed type
7721 // is something like [0 x {int, int}]
7722 const Type *IntPtrTy = TD->getIntPtrType();
7723 int64_t FirstIdx = 0;
7724 if (int64_t TySize = TD->getABITypeSize(GEPIdxTy)) {
7725 FirstIdx = Offset/TySize;
7728 // Handle silly modulus not returning values values [0..TySize).
7732 assert(Offset >= 0);
7734 assert((uint64_t)Offset < (uint64_t)TySize &&"Out of range offset");
7737 NewIndices.push_back(ConstantInt::get(IntPtrTy, FirstIdx));
7739 // Index into the types. If we fail, set OrigBase to null.
7741 if (const StructType *STy = dyn_cast<StructType>(GEPIdxTy)) {
7742 const StructLayout *SL = TD->getStructLayout(STy);
7743 if (Offset < (int64_t)SL->getSizeInBytes()) {
7744 unsigned Elt = SL->getElementContainingOffset(Offset);
7745 NewIndices.push_back(ConstantInt::get(Type::Int32Ty, Elt));
7747 Offset -= SL->getElementOffset(Elt);
7748 GEPIdxTy = STy->getElementType(Elt);
7750 // Otherwise, we can't index into this, bail out.
7754 } else if (isa<ArrayType>(GEPIdxTy) || isa<VectorType>(GEPIdxTy)) {
7755 const SequentialType *STy = cast<SequentialType>(GEPIdxTy);
7756 if (uint64_t EltSize = TD->getABITypeSize(STy->getElementType())){
7757 NewIndices.push_back(ConstantInt::get(IntPtrTy,Offset/EltSize));
7760 NewIndices.push_back(ConstantInt::get(IntPtrTy, 0));
7762 GEPIdxTy = STy->getElementType();
7764 // Otherwise, we can't index into this, bail out.
7770 // If we were able to index down into an element, create the GEP
7771 // and bitcast the result. This eliminates one bitcast, potentially
7773 Instruction *NGEP = GetElementPtrInst::Create(OrigBase,
7775 NewIndices.end(), "");
7776 InsertNewInstBefore(NGEP, CI);
7777 NGEP->takeName(GEP);
7779 if (isa<BitCastInst>(CI))
7780 return new BitCastInst(NGEP, CI.getType());
7781 assert(isa<PtrToIntInst>(CI));
7782 return new PtrToIntInst(NGEP, CI.getType());
7789 return commonCastTransforms(CI);
7794 /// Only the TRUNC, ZEXT, SEXT, and BITCAST can both operand and result as
7795 /// integer types. This function implements the common transforms for all those
7797 /// @brief Implement the transforms common to CastInst with integer operands
7798 Instruction *InstCombiner::commonIntCastTransforms(CastInst &CI) {
7799 if (Instruction *Result = commonCastTransforms(CI))
7802 Value *Src = CI.getOperand(0);
7803 const Type *SrcTy = Src->getType();
7804 const Type *DestTy = CI.getType();
7805 uint32_t SrcBitSize = SrcTy->getPrimitiveSizeInBits();
7806 uint32_t DestBitSize = DestTy->getPrimitiveSizeInBits();
7808 // See if we can simplify any instructions used by the LHS whose sole
7809 // purpose is to compute bits we don't care about.
7810 APInt KnownZero(DestBitSize, 0), KnownOne(DestBitSize, 0);
7811 if (SimplifyDemandedBits(&CI, APInt::getAllOnesValue(DestBitSize),
7812 KnownZero, KnownOne))
7815 // If the source isn't an instruction or has more than one use then we
7816 // can't do anything more.
7817 Instruction *SrcI = dyn_cast<Instruction>(Src);
7818 if (!SrcI || !Src->hasOneUse())
7821 // Attempt to propagate the cast into the instruction for int->int casts.
7822 int NumCastsRemoved = 0;
7823 if (!isa<BitCastInst>(CI) &&
7824 CanEvaluateInDifferentType(SrcI, cast<IntegerType>(DestTy),
7825 CI.getOpcode(), NumCastsRemoved)) {
7826 // If this cast is a truncate, evaluting in a different type always
7827 // eliminates the cast, so it is always a win. If this is a zero-extension,
7828 // we need to do an AND to maintain the clear top-part of the computation,
7829 // so we require that the input have eliminated at least one cast. If this
7830 // is a sign extension, we insert two new casts (to do the extension) so we
7831 // require that two casts have been eliminated.
7833 switch (CI.getOpcode()) {
7835 // All the others use floating point so we shouldn't actually
7836 // get here because of the check above.
7837 assert(0 && "Unknown cast type");
7838 case Instruction::Trunc:
7841 case Instruction::ZExt:
7842 DoXForm = NumCastsRemoved >= 1;
7844 case Instruction::SExt:
7845 DoXForm = NumCastsRemoved >= 2;
7850 Value *Res = EvaluateInDifferentType(SrcI, DestTy,
7851 CI.getOpcode() == Instruction::SExt);
7852 assert(Res->getType() == DestTy);
7853 switch (CI.getOpcode()) {
7854 default: assert(0 && "Unknown cast type!");
7855 case Instruction::Trunc:
7856 case Instruction::BitCast:
7857 // Just replace this cast with the result.
7858 return ReplaceInstUsesWith(CI, Res);
7859 case Instruction::ZExt: {
7860 // We need to emit an AND to clear the high bits.
7861 assert(SrcBitSize < DestBitSize && "Not a zext?");
7862 Constant *C = ConstantInt::get(APInt::getLowBitsSet(DestBitSize,
7864 return BinaryOperator::CreateAnd(Res, C);
7866 case Instruction::SExt:
7867 // We need to emit a cast to truncate, then a cast to sext.
7868 return CastInst::Create(Instruction::SExt,
7869 InsertCastBefore(Instruction::Trunc, Res, Src->getType(),
7875 Value *Op0 = SrcI->getNumOperands() > 0 ? SrcI->getOperand(0) : 0;
7876 Value *Op1 = SrcI->getNumOperands() > 1 ? SrcI->getOperand(1) : 0;
7878 switch (SrcI->getOpcode()) {
7879 case Instruction::Add:
7880 case Instruction::Mul:
7881 case Instruction::And:
7882 case Instruction::Or:
7883 case Instruction::Xor:
7884 // If we are discarding information, rewrite.
7885 if (DestBitSize <= SrcBitSize && DestBitSize != 1) {
7886 // Don't insert two casts if they cannot be eliminated. We allow
7887 // two casts to be inserted if the sizes are the same. This could
7888 // only be converting signedness, which is a noop.
7889 if (DestBitSize == SrcBitSize ||
7890 !ValueRequiresCast(CI.getOpcode(), Op1, DestTy,TD) ||
7891 !ValueRequiresCast(CI.getOpcode(), Op0, DestTy, TD)) {
7892 Instruction::CastOps opcode = CI.getOpcode();
7893 Value *Op0c = InsertCastBefore(opcode, Op0, DestTy, *SrcI);
7894 Value *Op1c = InsertCastBefore(opcode, Op1, DestTy, *SrcI);
7895 return BinaryOperator::Create(
7896 cast<BinaryOperator>(SrcI)->getOpcode(), Op0c, Op1c);
7900 // cast (xor bool X, true) to int --> xor (cast bool X to int), 1
7901 if (isa<ZExtInst>(CI) && SrcBitSize == 1 &&
7902 SrcI->getOpcode() == Instruction::Xor &&
7903 Op1 == ConstantInt::getTrue() &&
7904 (!Op0->hasOneUse() || !isa<CmpInst>(Op0))) {
7905 Value *New = InsertCastBefore(Instruction::ZExt, Op0, DestTy, CI);
7906 return BinaryOperator::CreateXor(New, ConstantInt::get(CI.getType(), 1));
7909 case Instruction::SDiv:
7910 case Instruction::UDiv:
7911 case Instruction::SRem:
7912 case Instruction::URem:
7913 // If we are just changing the sign, rewrite.
7914 if (DestBitSize == SrcBitSize) {
7915 // Don't insert two casts if they cannot be eliminated. We allow
7916 // two casts to be inserted if the sizes are the same. This could
7917 // only be converting signedness, which is a noop.
7918 if (!ValueRequiresCast(CI.getOpcode(), Op1, DestTy, TD) ||
7919 !ValueRequiresCast(CI.getOpcode(), Op0, DestTy, TD)) {
7920 Value *Op0c = InsertCastBefore(Instruction::BitCast,
7921 Op0, DestTy, *SrcI);
7922 Value *Op1c = InsertCastBefore(Instruction::BitCast,
7923 Op1, DestTy, *SrcI);
7924 return BinaryOperator::Create(
7925 cast<BinaryOperator>(SrcI)->getOpcode(), Op0c, Op1c);
7930 case Instruction::Shl:
7931 // Allow changing the sign of the source operand. Do not allow
7932 // changing the size of the shift, UNLESS the shift amount is a
7933 // constant. We must not change variable sized shifts to a smaller
7934 // size, because it is undefined to shift more bits out than exist
7936 if (DestBitSize == SrcBitSize ||
7937 (DestBitSize < SrcBitSize && isa<Constant>(Op1))) {
7938 Instruction::CastOps opcode = (DestBitSize == SrcBitSize ?
7939 Instruction::BitCast : Instruction::Trunc);
7940 Value *Op0c = InsertCastBefore(opcode, Op0, DestTy, *SrcI);
7941 Value *Op1c = InsertCastBefore(opcode, Op1, DestTy, *SrcI);
7942 return BinaryOperator::CreateShl(Op0c, Op1c);
7945 case Instruction::AShr:
7946 // If this is a signed shr, and if all bits shifted in are about to be
7947 // truncated off, turn it into an unsigned shr to allow greater
7949 if (DestBitSize < SrcBitSize &&
7950 isa<ConstantInt>(Op1)) {
7951 uint32_t ShiftAmt = cast<ConstantInt>(Op1)->getLimitedValue(SrcBitSize);
7952 if (SrcBitSize > ShiftAmt && SrcBitSize-ShiftAmt >= DestBitSize) {
7953 // Insert the new logical shift right.
7954 return BinaryOperator::CreateLShr(Op0, Op1);
7962 Instruction *InstCombiner::visitTrunc(TruncInst &CI) {
7963 if (Instruction *Result = commonIntCastTransforms(CI))
7966 Value *Src = CI.getOperand(0);
7967 const Type *Ty = CI.getType();
7968 uint32_t DestBitWidth = Ty->getPrimitiveSizeInBits();
7969 uint32_t SrcBitWidth = cast<IntegerType>(Src->getType())->getBitWidth();
7971 if (Instruction *SrcI = dyn_cast<Instruction>(Src)) {
7972 switch (SrcI->getOpcode()) {
7974 case Instruction::LShr:
7975 // We can shrink lshr to something smaller if we know the bits shifted in
7976 // are already zeros.
7977 if (ConstantInt *ShAmtV = dyn_cast<ConstantInt>(SrcI->getOperand(1))) {
7978 uint32_t ShAmt = ShAmtV->getLimitedValue(SrcBitWidth);
7980 // Get a mask for the bits shifting in.
7981 APInt Mask(APInt::getLowBitsSet(SrcBitWidth, ShAmt).shl(DestBitWidth));
7982 Value* SrcIOp0 = SrcI->getOperand(0);
7983 if (SrcI->hasOneUse() && MaskedValueIsZero(SrcIOp0, Mask)) {
7984 if (ShAmt >= DestBitWidth) // All zeros.
7985 return ReplaceInstUsesWith(CI, Constant::getNullValue(Ty));
7987 // Okay, we can shrink this. Truncate the input, then return a new
7989 Value *V1 = InsertCastBefore(Instruction::Trunc, SrcIOp0, Ty, CI);
7990 Value *V2 = InsertCastBefore(Instruction::Trunc, SrcI->getOperand(1),
7992 return BinaryOperator::CreateLShr(V1, V2);
7994 } else { // This is a variable shr.
7996 // Turn 'trunc (lshr X, Y) to bool' into '(X & (1 << Y)) != 0'. This is
7997 // more LLVM instructions, but allows '1 << Y' to be hoisted if
7998 // loop-invariant and CSE'd.
7999 if (CI.getType() == Type::Int1Ty && SrcI->hasOneUse()) {
8000 Value *One = ConstantInt::get(SrcI->getType(), 1);
8002 Value *V = InsertNewInstBefore(
8003 BinaryOperator::CreateShl(One, SrcI->getOperand(1),
8005 V = InsertNewInstBefore(BinaryOperator::CreateAnd(V,
8006 SrcI->getOperand(0),
8008 Value *Zero = Constant::getNullValue(V->getType());
8009 return new ICmpInst(ICmpInst::ICMP_NE, V, Zero);
8019 /// transformZExtICmp - Transform (zext icmp) to bitwise / integer operations
8020 /// in order to eliminate the icmp.
8021 Instruction *InstCombiner::transformZExtICmp(ICmpInst *ICI, Instruction &CI,
8023 // If we are just checking for a icmp eq of a single bit and zext'ing it
8024 // to an integer, then shift the bit to the appropriate place and then
8025 // cast to integer to avoid the comparison.
8026 if (ConstantInt *Op1C = dyn_cast<ConstantInt>(ICI->getOperand(1))) {
8027 const APInt &Op1CV = Op1C->getValue();
8029 // zext (x <s 0) to i32 --> x>>u31 true if signbit set.
8030 // zext (x >s -1) to i32 --> (x>>u31)^1 true if signbit clear.
8031 if ((ICI->getPredicate() == ICmpInst::ICMP_SLT && Op1CV == 0) ||
8032 (ICI->getPredicate() == ICmpInst::ICMP_SGT &&Op1CV.isAllOnesValue())) {
8033 if (!DoXform) return ICI;
8035 Value *In = ICI->getOperand(0);
8036 Value *Sh = ConstantInt::get(In->getType(),
8037 In->getType()->getPrimitiveSizeInBits()-1);
8038 In = InsertNewInstBefore(BinaryOperator::CreateLShr(In, Sh,
8039 In->getName()+".lobit"),
8041 if (In->getType() != CI.getType())
8042 In = CastInst::CreateIntegerCast(In, CI.getType(),
8043 false/*ZExt*/, "tmp", &CI);
8045 if (ICI->getPredicate() == ICmpInst::ICMP_SGT) {
8046 Constant *One = ConstantInt::get(In->getType(), 1);
8047 In = InsertNewInstBefore(BinaryOperator::CreateXor(In, One,
8048 In->getName()+".not"),
8052 return ReplaceInstUsesWith(CI, In);
8057 // zext (X == 0) to i32 --> X^1 iff X has only the low bit set.
8058 // zext (X == 0) to i32 --> (X>>1)^1 iff X has only the 2nd bit set.
8059 // zext (X == 1) to i32 --> X iff X has only the low bit set.
8060 // zext (X == 2) to i32 --> X>>1 iff X has only the 2nd bit set.
8061 // zext (X != 0) to i32 --> X iff X has only the low bit set.
8062 // zext (X != 0) to i32 --> X>>1 iff X has only the 2nd bit set.
8063 // zext (X != 1) to i32 --> X^1 iff X has only the low bit set.
8064 // zext (X != 2) to i32 --> (X>>1)^1 iff X has only the 2nd bit set.
8065 if ((Op1CV == 0 || Op1CV.isPowerOf2()) &&
8066 // This only works for EQ and NE
8067 ICI->isEquality()) {
8068 // If Op1C some other power of two, convert:
8069 uint32_t BitWidth = Op1C->getType()->getBitWidth();
8070 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
8071 APInt TypeMask(APInt::getAllOnesValue(BitWidth));
8072 ComputeMaskedBits(ICI->getOperand(0), TypeMask, KnownZero, KnownOne);
8074 APInt KnownZeroMask(~KnownZero);
8075 if (KnownZeroMask.isPowerOf2()) { // Exactly 1 possible 1?
8076 if (!DoXform) return ICI;
8078 bool isNE = ICI->getPredicate() == ICmpInst::ICMP_NE;
8079 if (Op1CV != 0 && (Op1CV != KnownZeroMask)) {
8080 // (X&4) == 2 --> false
8081 // (X&4) != 2 --> true
8082 Constant *Res = ConstantInt::get(Type::Int1Ty, isNE);
8083 Res = ConstantExpr::getZExt(Res, CI.getType());
8084 return ReplaceInstUsesWith(CI, Res);
8087 uint32_t ShiftAmt = KnownZeroMask.logBase2();
8088 Value *In = ICI->getOperand(0);
8090 // Perform a logical shr by shiftamt.
8091 // Insert the shift to put the result in the low bit.
8092 In = InsertNewInstBefore(BinaryOperator::CreateLShr(In,
8093 ConstantInt::get(In->getType(), ShiftAmt),
8094 In->getName()+".lobit"), CI);
8097 if ((Op1CV != 0) == isNE) { // Toggle the low bit.
8098 Constant *One = ConstantInt::get(In->getType(), 1);
8099 In = BinaryOperator::CreateXor(In, One, "tmp");
8100 InsertNewInstBefore(cast<Instruction>(In), CI);
8103 if (CI.getType() == In->getType())
8104 return ReplaceInstUsesWith(CI, In);
8106 return CastInst::CreateIntegerCast(In, CI.getType(), false/*ZExt*/);
8114 Instruction *InstCombiner::visitZExt(ZExtInst &CI) {
8115 // If one of the common conversion will work ..
8116 if (Instruction *Result = commonIntCastTransforms(CI))
8119 Value *Src = CI.getOperand(0);
8121 // If this is a cast of a cast
8122 if (CastInst *CSrc = dyn_cast<CastInst>(Src)) { // A->B->C cast
8123 // If this is a TRUNC followed by a ZEXT then we are dealing with integral
8124 // types and if the sizes are just right we can convert this into a logical
8125 // 'and' which will be much cheaper than the pair of casts.
8126 if (isa<TruncInst>(CSrc)) {
8127 // Get the sizes of the types involved
8128 Value *A = CSrc->getOperand(0);
8129 uint32_t SrcSize = A->getType()->getPrimitiveSizeInBits();
8130 uint32_t MidSize = CSrc->getType()->getPrimitiveSizeInBits();
8131 uint32_t DstSize = CI.getType()->getPrimitiveSizeInBits();
8132 // If we're actually extending zero bits and the trunc is a no-op
8133 if (MidSize < DstSize && SrcSize == DstSize) {
8134 // Replace both of the casts with an And of the type mask.
8135 APInt AndValue(APInt::getLowBitsSet(SrcSize, MidSize));
8136 Constant *AndConst = ConstantInt::get(AndValue);
8138 BinaryOperator::CreateAnd(CSrc->getOperand(0), AndConst);
8139 // Unfortunately, if the type changed, we need to cast it back.
8140 if (And->getType() != CI.getType()) {
8141 And->setName(CSrc->getName()+".mask");
8142 InsertNewInstBefore(And, CI);
8143 And = CastInst::CreateIntegerCast(And, CI.getType(), false/*ZExt*/);
8150 if (ICmpInst *ICI = dyn_cast<ICmpInst>(Src))
8151 return transformZExtICmp(ICI, CI);
8153 BinaryOperator *SrcI = dyn_cast<BinaryOperator>(Src);
8154 if (SrcI && SrcI->getOpcode() == Instruction::Or) {
8155 // zext (or icmp, icmp) --> or (zext icmp), (zext icmp) if at least one
8156 // of the (zext icmp) will be transformed.
8157 ICmpInst *LHS = dyn_cast<ICmpInst>(SrcI->getOperand(0));
8158 ICmpInst *RHS = dyn_cast<ICmpInst>(SrcI->getOperand(1));
8159 if (LHS && RHS && LHS->hasOneUse() && RHS->hasOneUse() &&
8160 (transformZExtICmp(LHS, CI, false) ||
8161 transformZExtICmp(RHS, CI, false))) {
8162 Value *LCast = InsertCastBefore(Instruction::ZExt, LHS, CI.getType(), CI);
8163 Value *RCast = InsertCastBefore(Instruction::ZExt, RHS, CI.getType(), CI);
8164 return BinaryOperator::Create(Instruction::Or, LCast, RCast);
8171 Instruction *InstCombiner::visitSExt(SExtInst &CI) {
8172 if (Instruction *I = commonIntCastTransforms(CI))
8175 Value *Src = CI.getOperand(0);
8177 // Canonicalize sign-extend from i1 to a select.
8178 if (Src->getType() == Type::Int1Ty)
8179 return SelectInst::Create(Src,
8180 ConstantInt::getAllOnesValue(CI.getType()),
8181 Constant::getNullValue(CI.getType()));
8183 // See if the value being truncated is already sign extended. If so, just
8184 // eliminate the trunc/sext pair.
8185 if (getOpcode(Src) == Instruction::Trunc) {
8186 Value *Op = cast<User>(Src)->getOperand(0);
8187 unsigned OpBits = cast<IntegerType>(Op->getType())->getBitWidth();
8188 unsigned MidBits = cast<IntegerType>(Src->getType())->getBitWidth();
8189 unsigned DestBits = cast<IntegerType>(CI.getType())->getBitWidth();
8190 unsigned NumSignBits = ComputeNumSignBits(Op);
8192 if (OpBits == DestBits) {
8193 // Op is i32, Mid is i8, and Dest is i32. If Op has more than 24 sign
8194 // bits, it is already ready.
8195 if (NumSignBits > DestBits-MidBits)
8196 return ReplaceInstUsesWith(CI, Op);
8197 } else if (OpBits < DestBits) {
8198 // Op is i32, Mid is i8, and Dest is i64. If Op has more than 24 sign
8199 // bits, just sext from i32.
8200 if (NumSignBits > OpBits-MidBits)
8201 return new SExtInst(Op, CI.getType(), "tmp");
8203 // Op is i64, Mid is i8, and Dest is i32. If Op has more than 56 sign
8204 // bits, just truncate to i32.
8205 if (NumSignBits > OpBits-MidBits)
8206 return new TruncInst(Op, CI.getType(), "tmp");
8210 // If the input is a shl/ashr pair of a same constant, then this is a sign
8211 // extension from a smaller value. If we could trust arbitrary bitwidth
8212 // integers, we could turn this into a truncate to the smaller bit and then
8213 // use a sext for the whole extension. Since we don't, look deeper and check
8214 // for a truncate. If the source and dest are the same type, eliminate the
8215 // trunc and extend and just do shifts. For example, turn:
8216 // %a = trunc i32 %i to i8
8217 // %b = shl i8 %a, 6
8218 // %c = ashr i8 %b, 6
8219 // %d = sext i8 %c to i32
8221 // %a = shl i32 %i, 30
8222 // %d = ashr i32 %a, 30
8224 ConstantInt *BA = 0, *CA = 0;
8225 if (match(Src, m_AShr(m_Shl(m_Value(A), m_ConstantInt(BA)),
8226 m_ConstantInt(CA))) &&
8227 BA == CA && isa<TruncInst>(A)) {
8228 Value *I = cast<TruncInst>(A)->getOperand(0);
8229 if (I->getType() == CI.getType()) {
8230 unsigned MidSize = Src->getType()->getPrimitiveSizeInBits();
8231 unsigned SrcDstSize = CI.getType()->getPrimitiveSizeInBits();
8232 unsigned ShAmt = CA->getZExtValue()+SrcDstSize-MidSize;
8233 Constant *ShAmtV = ConstantInt::get(CI.getType(), ShAmt);
8234 I = InsertNewInstBefore(BinaryOperator::CreateShl(I, ShAmtV,
8236 return BinaryOperator::CreateAShr(I, ShAmtV);
8243 /// FitsInFPType - Return a Constant* for the specified FP constant if it fits
8244 /// in the specified FP type without changing its value.
8245 static Constant *FitsInFPType(ConstantFP *CFP, const fltSemantics &Sem) {
8247 APFloat F = CFP->getValueAPF();
8248 (void)F.convert(Sem, APFloat::rmNearestTiesToEven, &losesInfo);
8250 return ConstantFP::get(F);
8254 /// LookThroughFPExtensions - If this is an fp extension instruction, look
8255 /// through it until we get the source value.
8256 static Value *LookThroughFPExtensions(Value *V) {
8257 if (Instruction *I = dyn_cast<Instruction>(V))
8258 if (I->getOpcode() == Instruction::FPExt)
8259 return LookThroughFPExtensions(I->getOperand(0));
8261 // If this value is a constant, return the constant in the smallest FP type
8262 // that can accurately represent it. This allows us to turn
8263 // (float)((double)X+2.0) into x+2.0f.
8264 if (ConstantFP *CFP = dyn_cast<ConstantFP>(V)) {
8265 if (CFP->getType() == Type::PPC_FP128Ty)
8266 return V; // No constant folding of this.
8267 // See if the value can be truncated to float and then reextended.
8268 if (Value *V = FitsInFPType(CFP, APFloat::IEEEsingle))
8270 if (CFP->getType() == Type::DoubleTy)
8271 return V; // Won't shrink.
8272 if (Value *V = FitsInFPType(CFP, APFloat::IEEEdouble))
8274 // Don't try to shrink to various long double types.
8280 Instruction *InstCombiner::visitFPTrunc(FPTruncInst &CI) {
8281 if (Instruction *I = commonCastTransforms(CI))
8284 // If we have fptrunc(add (fpextend x), (fpextend y)), where x and y are
8285 // smaller than the destination type, we can eliminate the truncate by doing
8286 // the add as the smaller type. This applies to add/sub/mul/div as well as
8287 // many builtins (sqrt, etc).
8288 BinaryOperator *OpI = dyn_cast<BinaryOperator>(CI.getOperand(0));
8289 if (OpI && OpI->hasOneUse()) {
8290 switch (OpI->getOpcode()) {
8292 case Instruction::Add:
8293 case Instruction::Sub:
8294 case Instruction::Mul:
8295 case Instruction::FDiv:
8296 case Instruction::FRem:
8297 const Type *SrcTy = OpI->getType();
8298 Value *LHSTrunc = LookThroughFPExtensions(OpI->getOperand(0));
8299 Value *RHSTrunc = LookThroughFPExtensions(OpI->getOperand(1));
8300 if (LHSTrunc->getType() != SrcTy &&
8301 RHSTrunc->getType() != SrcTy) {
8302 unsigned DstSize = CI.getType()->getPrimitiveSizeInBits();
8303 // If the source types were both smaller than the destination type of
8304 // the cast, do this xform.
8305 if (LHSTrunc->getType()->getPrimitiveSizeInBits() <= DstSize &&
8306 RHSTrunc->getType()->getPrimitiveSizeInBits() <= DstSize) {
8307 LHSTrunc = InsertCastBefore(Instruction::FPExt, LHSTrunc,
8309 RHSTrunc = InsertCastBefore(Instruction::FPExt, RHSTrunc,
8311 return BinaryOperator::Create(OpI->getOpcode(), LHSTrunc, RHSTrunc);
8320 Instruction *InstCombiner::visitFPExt(CastInst &CI) {
8321 return commonCastTransforms(CI);
8324 Instruction *InstCombiner::visitFPToUI(FPToUIInst &FI) {
8325 Instruction *OpI = dyn_cast<Instruction>(FI.getOperand(0));
8327 return commonCastTransforms(FI);
8329 // fptoui(uitofp(X)) --> X
8330 // fptoui(sitofp(X)) --> X
8331 // This is safe if the intermediate type has enough bits in its mantissa to
8332 // accurately represent all values of X. For example, do not do this with
8333 // i64->float->i64. This is also safe for sitofp case, because any negative
8334 // 'X' value would cause an undefined result for the fptoui.
8335 if ((isa<UIToFPInst>(OpI) || isa<SIToFPInst>(OpI)) &&
8336 OpI->getOperand(0)->getType() == FI.getType() &&
8337 (int)FI.getType()->getPrimitiveSizeInBits() < /*extra bit for sign */
8338 OpI->getType()->getFPMantissaWidth())
8339 return ReplaceInstUsesWith(FI, OpI->getOperand(0));
8341 return commonCastTransforms(FI);
8344 Instruction *InstCombiner::visitFPToSI(FPToSIInst &FI) {
8345 Instruction *OpI = dyn_cast<Instruction>(FI.getOperand(0));
8347 return commonCastTransforms(FI);
8349 // fptosi(sitofp(X)) --> X
8350 // fptosi(uitofp(X)) --> X
8351 // This is safe if the intermediate type has enough bits in its mantissa to
8352 // accurately represent all values of X. For example, do not do this with
8353 // i64->float->i64. This is also safe for sitofp case, because any negative
8354 // 'X' value would cause an undefined result for the fptoui.
8355 if ((isa<UIToFPInst>(OpI) || isa<SIToFPInst>(OpI)) &&
8356 OpI->getOperand(0)->getType() == FI.getType() &&
8357 (int)FI.getType()->getPrimitiveSizeInBits() <=
8358 OpI->getType()->getFPMantissaWidth())
8359 return ReplaceInstUsesWith(FI, OpI->getOperand(0));
8361 return commonCastTransforms(FI);
8364 Instruction *InstCombiner::visitUIToFP(CastInst &CI) {
8365 return commonCastTransforms(CI);
8368 Instruction *InstCombiner::visitSIToFP(CastInst &CI) {
8369 return commonCastTransforms(CI);
8372 Instruction *InstCombiner::visitPtrToInt(CastInst &CI) {
8373 return commonPointerCastTransforms(CI);
8376 Instruction *InstCombiner::visitIntToPtr(IntToPtrInst &CI) {
8377 if (Instruction *I = commonCastTransforms(CI))
8380 const Type *DestPointee = cast<PointerType>(CI.getType())->getElementType();
8381 if (!DestPointee->isSized()) return 0;
8383 // If this is inttoptr(add (ptrtoint x), cst), try to turn this into a GEP.
8386 if (match(CI.getOperand(0), m_Add(m_Cast<PtrToIntInst>(m_Value(X)),
8387 m_ConstantInt(Cst)))) {
8388 // If the source and destination operands have the same type, see if this
8389 // is a single-index GEP.
8390 if (X->getType() == CI.getType()) {
8391 // Get the size of the pointee type.
8392 uint64_t Size = TD->getABITypeSize(DestPointee);
8394 // Convert the constant to intptr type.
8395 APInt Offset = Cst->getValue();
8396 Offset.sextOrTrunc(TD->getPointerSizeInBits());
8398 // If Offset is evenly divisible by Size, we can do this xform.
8399 if (Size && !APIntOps::srem(Offset, APInt(Offset.getBitWidth(), Size))){
8400 Offset = APIntOps::sdiv(Offset, APInt(Offset.getBitWidth(), Size));
8401 return GetElementPtrInst::Create(X, ConstantInt::get(Offset));
8404 // TODO: Could handle other cases, e.g. where add is indexing into field of
8406 } else if (CI.getOperand(0)->hasOneUse() &&
8407 match(CI.getOperand(0), m_Add(m_Value(X), m_ConstantInt(Cst)))) {
8408 // Otherwise, if this is inttoptr(add x, cst), try to turn this into an
8409 // "inttoptr+GEP" instead of "add+intptr".
8411 // Get the size of the pointee type.
8412 uint64_t Size = TD->getABITypeSize(DestPointee);
8414 // Convert the constant to intptr type.
8415 APInt Offset = Cst->getValue();
8416 Offset.sextOrTrunc(TD->getPointerSizeInBits());
8418 // If Offset is evenly divisible by Size, we can do this xform.
8419 if (Size && !APIntOps::srem(Offset, APInt(Offset.getBitWidth(), Size))){
8420 Offset = APIntOps::sdiv(Offset, APInt(Offset.getBitWidth(), Size));
8422 Instruction *P = InsertNewInstBefore(new IntToPtrInst(X, CI.getType(),
8424 return GetElementPtrInst::Create(P, ConstantInt::get(Offset), "tmp");
8430 Instruction *InstCombiner::visitBitCast(BitCastInst &CI) {
8431 // If the operands are integer typed then apply the integer transforms,
8432 // otherwise just apply the common ones.
8433 Value *Src = CI.getOperand(0);
8434 const Type *SrcTy = Src->getType();
8435 const Type *DestTy = CI.getType();
8437 if (SrcTy->isInteger() && DestTy->isInteger()) {
8438 if (Instruction *Result = commonIntCastTransforms(CI))
8440 } else if (isa<PointerType>(SrcTy)) {
8441 if (Instruction *I = commonPointerCastTransforms(CI))
8444 if (Instruction *Result = commonCastTransforms(CI))
8449 // Get rid of casts from one type to the same type. These are useless and can
8450 // be replaced by the operand.
8451 if (DestTy == Src->getType())
8452 return ReplaceInstUsesWith(CI, Src);
8454 if (const PointerType *DstPTy = dyn_cast<PointerType>(DestTy)) {
8455 const PointerType *SrcPTy = cast<PointerType>(SrcTy);
8456 const Type *DstElTy = DstPTy->getElementType();
8457 const Type *SrcElTy = SrcPTy->getElementType();
8459 // If the address spaces don't match, don't eliminate the bitcast, which is
8460 // required for changing types.
8461 if (SrcPTy->getAddressSpace() != DstPTy->getAddressSpace())
8464 // If we are casting a malloc or alloca to a pointer to a type of the same
8465 // size, rewrite the allocation instruction to allocate the "right" type.
8466 if (AllocationInst *AI = dyn_cast<AllocationInst>(Src))
8467 if (Instruction *V = PromoteCastOfAllocation(CI, *AI))
8470 // If the source and destination are pointers, and this cast is equivalent
8471 // to a getelementptr X, 0, 0, 0... turn it into the appropriate gep.
8472 // This can enhance SROA and other transforms that want type-safe pointers.
8473 Constant *ZeroUInt = Constant::getNullValue(Type::Int32Ty);
8474 unsigned NumZeros = 0;
8475 while (SrcElTy != DstElTy &&
8476 isa<CompositeType>(SrcElTy) && !isa<PointerType>(SrcElTy) &&
8477 SrcElTy->getNumContainedTypes() /* not "{}" */) {
8478 SrcElTy = cast<CompositeType>(SrcElTy)->getTypeAtIndex(ZeroUInt);
8482 // If we found a path from the src to dest, create the getelementptr now.
8483 if (SrcElTy == DstElTy) {
8484 SmallVector<Value*, 8> Idxs(NumZeros+1, ZeroUInt);
8485 return GetElementPtrInst::Create(Src, Idxs.begin(), Idxs.end(), "",
8486 ((Instruction*) NULL));
8490 if (ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(Src)) {
8491 if (SVI->hasOneUse()) {
8492 // Okay, we have (bitconvert (shuffle ..)). Check to see if this is
8493 // a bitconvert to a vector with the same # elts.
8494 if (isa<VectorType>(DestTy) &&
8495 cast<VectorType>(DestTy)->getNumElements() ==
8496 SVI->getType()->getNumElements() &&
8497 SVI->getType()->getNumElements() ==
8498 cast<VectorType>(SVI->getOperand(0)->getType())->getNumElements()) {
8500 // If either of the operands is a cast from CI.getType(), then
8501 // evaluating the shuffle in the casted destination's type will allow
8502 // us to eliminate at least one cast.
8503 if (((Tmp = dyn_cast<CastInst>(SVI->getOperand(0))) &&
8504 Tmp->getOperand(0)->getType() == DestTy) ||
8505 ((Tmp = dyn_cast<CastInst>(SVI->getOperand(1))) &&
8506 Tmp->getOperand(0)->getType() == DestTy)) {
8507 Value *LHS = InsertCastBefore(Instruction::BitCast,
8508 SVI->getOperand(0), DestTy, CI);
8509 Value *RHS = InsertCastBefore(Instruction::BitCast,
8510 SVI->getOperand(1), DestTy, CI);
8511 // Return a new shuffle vector. Use the same element ID's, as we
8512 // know the vector types match #elts.
8513 return new ShuffleVectorInst(LHS, RHS, SVI->getOperand(2));
8521 /// GetSelectFoldableOperands - We want to turn code that looks like this:
8523 /// %D = select %cond, %C, %A
8525 /// %C = select %cond, %B, 0
8528 /// Assuming that the specified instruction is an operand to the select, return
8529 /// a bitmask indicating which operands of this instruction are foldable if they
8530 /// equal the other incoming value of the select.
8532 static unsigned GetSelectFoldableOperands(Instruction *I) {
8533 switch (I->getOpcode()) {
8534 case Instruction::Add:
8535 case Instruction::Mul:
8536 case Instruction::And:
8537 case Instruction::Or:
8538 case Instruction::Xor:
8539 return 3; // Can fold through either operand.
8540 case Instruction::Sub: // Can only fold on the amount subtracted.
8541 case Instruction::Shl: // Can only fold on the shift amount.
8542 case Instruction::LShr:
8543 case Instruction::AShr:
8546 return 0; // Cannot fold
8550 /// GetSelectFoldableConstant - For the same transformation as the previous
8551 /// function, return the identity constant that goes into the select.
8552 static Constant *GetSelectFoldableConstant(Instruction *I) {
8553 switch (I->getOpcode()) {
8554 default: assert(0 && "This cannot happen!"); abort();
8555 case Instruction::Add:
8556 case Instruction::Sub:
8557 case Instruction::Or:
8558 case Instruction::Xor:
8559 case Instruction::Shl:
8560 case Instruction::LShr:
8561 case Instruction::AShr:
8562 return Constant::getNullValue(I->getType());
8563 case Instruction::And:
8564 return Constant::getAllOnesValue(I->getType());
8565 case Instruction::Mul:
8566 return ConstantInt::get(I->getType(), 1);
8570 /// FoldSelectOpOp - Here we have (select c, TI, FI), and we know that TI and FI
8571 /// have the same opcode and only one use each. Try to simplify this.
8572 Instruction *InstCombiner::FoldSelectOpOp(SelectInst &SI, Instruction *TI,
8574 if (TI->getNumOperands() == 1) {
8575 // If this is a non-volatile load or a cast from the same type,
8578 if (TI->getOperand(0)->getType() != FI->getOperand(0)->getType())
8581 return 0; // unknown unary op.
8584 // Fold this by inserting a select from the input values.
8585 SelectInst *NewSI = SelectInst::Create(SI.getCondition(), TI->getOperand(0),
8586 FI->getOperand(0), SI.getName()+".v");
8587 InsertNewInstBefore(NewSI, SI);
8588 return CastInst::Create(Instruction::CastOps(TI->getOpcode()), NewSI,
8592 // Only handle binary operators here.
8593 if (!isa<BinaryOperator>(TI))
8596 // Figure out if the operations have any operands in common.
8597 Value *MatchOp, *OtherOpT, *OtherOpF;
8599 if (TI->getOperand(0) == FI->getOperand(0)) {
8600 MatchOp = TI->getOperand(0);
8601 OtherOpT = TI->getOperand(1);
8602 OtherOpF = FI->getOperand(1);
8603 MatchIsOpZero = true;
8604 } else if (TI->getOperand(1) == FI->getOperand(1)) {
8605 MatchOp = TI->getOperand(1);
8606 OtherOpT = TI->getOperand(0);
8607 OtherOpF = FI->getOperand(0);
8608 MatchIsOpZero = false;
8609 } else if (!TI->isCommutative()) {
8611 } else if (TI->getOperand(0) == FI->getOperand(1)) {
8612 MatchOp = TI->getOperand(0);
8613 OtherOpT = TI->getOperand(1);
8614 OtherOpF = FI->getOperand(0);
8615 MatchIsOpZero = true;
8616 } else if (TI->getOperand(1) == FI->getOperand(0)) {
8617 MatchOp = TI->getOperand(1);
8618 OtherOpT = TI->getOperand(0);
8619 OtherOpF = FI->getOperand(1);
8620 MatchIsOpZero = true;
8625 // If we reach here, they do have operations in common.
8626 SelectInst *NewSI = SelectInst::Create(SI.getCondition(), OtherOpT,
8627 OtherOpF, SI.getName()+".v");
8628 InsertNewInstBefore(NewSI, SI);
8630 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(TI)) {
8632 return BinaryOperator::Create(BO->getOpcode(), MatchOp, NewSI);
8634 return BinaryOperator::Create(BO->getOpcode(), NewSI, MatchOp);
8636 assert(0 && "Shouldn't get here");
8640 /// visitSelectInstWithICmp - Visit a SelectInst that has an
8641 /// ICmpInst as its first operand.
8643 Instruction *InstCombiner::visitSelectInstWithICmp(SelectInst &SI,
8645 bool Changed = false;
8646 ICmpInst::Predicate Pred = ICI->getPredicate();
8647 Value *CmpLHS = ICI->getOperand(0);
8648 Value *CmpRHS = ICI->getOperand(1);
8649 Value *TrueVal = SI.getTrueValue();
8650 Value *FalseVal = SI.getFalseValue();
8652 // Check cases where the comparison is with a constant that
8653 // can be adjusted to fit the min/max idiom. We may edit ICI in
8654 // place here, so make sure the select is the only user.
8655 if (ICI->hasOneUse())
8656 if (ConstantInt *CI = dyn_cast<ConstantInt>(CmpRHS)) {
8659 case ICmpInst::ICMP_ULT:
8660 case ICmpInst::ICMP_SLT: {
8661 // X < MIN ? T : F --> F
8662 if (CI->isMinValue(Pred == ICmpInst::ICMP_SLT))
8663 return ReplaceInstUsesWith(SI, FalseVal);
8664 // X < C ? X : C-1 --> X > C-1 ? C-1 : X
8665 Constant *AdjustedRHS = SubOne(CI);
8666 if ((CmpLHS == TrueVal && AdjustedRHS == FalseVal) ||
8667 (CmpLHS == FalseVal && AdjustedRHS == TrueVal)) {
8668 Pred = ICmpInst::getSwappedPredicate(Pred);
8669 CmpRHS = AdjustedRHS;
8670 std::swap(FalseVal, TrueVal);
8671 ICI->setPredicate(Pred);
8672 ICI->setOperand(1, CmpRHS);
8673 SI.setOperand(1, TrueVal);
8674 SI.setOperand(2, FalseVal);
8679 case ICmpInst::ICMP_UGT:
8680 case ICmpInst::ICMP_SGT: {
8681 // X > MAX ? T : F --> F
8682 if (CI->isMaxValue(Pred == ICmpInst::ICMP_SGT))
8683 return ReplaceInstUsesWith(SI, FalseVal);
8684 // X > C ? X : C+1 --> X < C+1 ? C+1 : X
8685 Constant *AdjustedRHS = AddOne(CI);
8686 if ((CmpLHS == TrueVal && AdjustedRHS == FalseVal) ||
8687 (CmpLHS == FalseVal && AdjustedRHS == TrueVal)) {
8688 Pred = ICmpInst::getSwappedPredicate(Pred);
8689 CmpRHS = AdjustedRHS;
8690 std::swap(FalseVal, TrueVal);
8691 ICI->setPredicate(Pred);
8692 ICI->setOperand(1, CmpRHS);
8693 SI.setOperand(1, TrueVal);
8694 SI.setOperand(2, FalseVal);
8701 // (x <s 0) ? -1 : 0 -> ashr x, 31 -> all ones if signed
8702 // (x >s -1) ? -1 : 0 -> ashr x, 31 -> all ones if not signed
8703 CmpInst::Predicate Pred = CmpInst::BAD_ICMP_PREDICATE;
8704 if (match(TrueVal, m_ConstantInt(-1)) &&
8705 match(FalseVal, m_ConstantInt(0)))
8706 Pred = ICI->getPredicate();
8707 else if (match(TrueVal, m_ConstantInt(0)) &&
8708 match(FalseVal, m_ConstantInt(-1)))
8709 Pred = CmpInst::getInversePredicate(ICI->getPredicate());
8711 if (Pred != CmpInst::BAD_ICMP_PREDICATE) {
8712 // If we are just checking for a icmp eq of a single bit and zext'ing it
8713 // to an integer, then shift the bit to the appropriate place and then
8714 // cast to integer to avoid the comparison.
8715 const APInt &Op1CV = CI->getValue();
8717 // sext (x <s 0) to i32 --> x>>s31 true if signbit set.
8718 // sext (x >s -1) to i32 --> (x>>s31)^-1 true if signbit clear.
8719 if ((Pred == ICmpInst::ICMP_SLT && Op1CV == 0) ||
8720 (Pred == ICmpInst::ICMP_SGT && Op1CV.isAllOnesValue())) {
8721 Value *In = ICI->getOperand(0);
8722 Value *Sh = ConstantInt::get(In->getType(),
8723 In->getType()->getPrimitiveSizeInBits()-1);
8724 In = InsertNewInstBefore(BinaryOperator::CreateAShr(In, Sh,
8725 In->getName()+".lobit"),
8727 if (In->getType() != SI.getType())
8728 In = CastInst::CreateIntegerCast(In, SI.getType(),
8729 true/*SExt*/, "tmp", ICI);
8731 if (Pred == ICmpInst::ICMP_SGT)
8732 In = InsertNewInstBefore(BinaryOperator::CreateNot(In,
8733 In->getName()+".not"), *ICI);
8735 return ReplaceInstUsesWith(SI, In);
8740 if (CmpLHS == TrueVal && CmpRHS == FalseVal) {
8741 // Transform (X == Y) ? X : Y -> Y
8742 if (Pred == ICmpInst::ICMP_EQ)
8743 return ReplaceInstUsesWith(SI, FalseVal);
8744 // Transform (X != Y) ? X : Y -> X
8745 if (Pred == ICmpInst::ICMP_NE)
8746 return ReplaceInstUsesWith(SI, TrueVal);
8747 /// NOTE: if we wanted to, this is where to detect integer MIN/MAX
8749 } else if (CmpLHS == FalseVal && CmpRHS == TrueVal) {
8750 // Transform (X == Y) ? Y : X -> X
8751 if (Pred == ICmpInst::ICMP_EQ)
8752 return ReplaceInstUsesWith(SI, FalseVal);
8753 // Transform (X != Y) ? Y : X -> Y
8754 if (Pred == ICmpInst::ICMP_NE)
8755 return ReplaceInstUsesWith(SI, TrueVal);
8756 /// NOTE: if we wanted to, this is where to detect integer MIN/MAX
8759 /// NOTE: if we wanted to, this is where to detect integer ABS
8761 return Changed ? &SI : 0;
8764 Instruction *InstCombiner::visitSelectInst(SelectInst &SI) {
8765 Value *CondVal = SI.getCondition();
8766 Value *TrueVal = SI.getTrueValue();
8767 Value *FalseVal = SI.getFalseValue();
8769 // select true, X, Y -> X
8770 // select false, X, Y -> Y
8771 if (ConstantInt *C = dyn_cast<ConstantInt>(CondVal))
8772 return ReplaceInstUsesWith(SI, C->getZExtValue() ? TrueVal : FalseVal);
8774 // select C, X, X -> X
8775 if (TrueVal == FalseVal)
8776 return ReplaceInstUsesWith(SI, TrueVal);
8778 if (isa<UndefValue>(TrueVal)) // select C, undef, X -> X
8779 return ReplaceInstUsesWith(SI, FalseVal);
8780 if (isa<UndefValue>(FalseVal)) // select C, X, undef -> X
8781 return ReplaceInstUsesWith(SI, TrueVal);
8782 if (isa<UndefValue>(CondVal)) { // select undef, X, Y -> X or Y
8783 if (isa<Constant>(TrueVal))
8784 return ReplaceInstUsesWith(SI, TrueVal);
8786 return ReplaceInstUsesWith(SI, FalseVal);
8789 if (SI.getType() == Type::Int1Ty) {
8790 if (ConstantInt *C = dyn_cast<ConstantInt>(TrueVal)) {
8791 if (C->getZExtValue()) {
8792 // Change: A = select B, true, C --> A = or B, C
8793 return BinaryOperator::CreateOr(CondVal, FalseVal);
8795 // Change: A = select B, false, C --> A = and !B, C
8797 InsertNewInstBefore(BinaryOperator::CreateNot(CondVal,
8798 "not."+CondVal->getName()), SI);
8799 return BinaryOperator::CreateAnd(NotCond, FalseVal);
8801 } else if (ConstantInt *C = dyn_cast<ConstantInt>(FalseVal)) {
8802 if (C->getZExtValue() == false) {
8803 // Change: A = select B, C, false --> A = and B, C
8804 return BinaryOperator::CreateAnd(CondVal, TrueVal);
8806 // Change: A = select B, C, true --> A = or !B, C
8808 InsertNewInstBefore(BinaryOperator::CreateNot(CondVal,
8809 "not."+CondVal->getName()), SI);
8810 return BinaryOperator::CreateOr(NotCond, TrueVal);
8814 // select a, b, a -> a&b
8815 // select a, a, b -> a|b
8816 if (CondVal == TrueVal)
8817 return BinaryOperator::CreateOr(CondVal, FalseVal);
8818 else if (CondVal == FalseVal)
8819 return BinaryOperator::CreateAnd(CondVal, TrueVal);
8822 // Selecting between two integer constants?
8823 if (ConstantInt *TrueValC = dyn_cast<ConstantInt>(TrueVal))
8824 if (ConstantInt *FalseValC = dyn_cast<ConstantInt>(FalseVal)) {
8825 // select C, 1, 0 -> zext C to int
8826 if (FalseValC->isZero() && TrueValC->getValue() == 1) {
8827 return CastInst::Create(Instruction::ZExt, CondVal, SI.getType());
8828 } else if (TrueValC->isZero() && FalseValC->getValue() == 1) {
8829 // select C, 0, 1 -> zext !C to int
8831 InsertNewInstBefore(BinaryOperator::CreateNot(CondVal,
8832 "not."+CondVal->getName()), SI);
8833 return CastInst::Create(Instruction::ZExt, NotCond, SI.getType());
8836 if (ICmpInst *IC = dyn_cast<ICmpInst>(SI.getCondition())) {
8838 // (x <s 0) ? -1 : 0 -> ashr x, 31
8839 if (TrueValC->isAllOnesValue() && FalseValC->isZero())
8840 if (ConstantInt *CmpCst = dyn_cast<ConstantInt>(IC->getOperand(1))) {
8841 if (IC->getPredicate() == ICmpInst::ICMP_SLT && CmpCst->isZero()) {
8842 // The comparison constant and the result are not neccessarily the
8843 // same width. Make an all-ones value by inserting a AShr.
8844 Value *X = IC->getOperand(0);
8845 uint32_t Bits = X->getType()->getPrimitiveSizeInBits();
8846 Constant *ShAmt = ConstantInt::get(X->getType(), Bits-1);
8847 Instruction *SRA = BinaryOperator::Create(Instruction::AShr, X,
8849 InsertNewInstBefore(SRA, SI);
8851 // Then cast to the appropriate width.
8852 return CastInst::CreateIntegerCast(SRA, SI.getType(), true);
8857 // If one of the constants is zero (we know they can't both be) and we
8858 // have an icmp instruction with zero, and we have an 'and' with the
8859 // non-constant value, eliminate this whole mess. This corresponds to
8860 // cases like this: ((X & 27) ? 27 : 0)
8861 if (TrueValC->isZero() || FalseValC->isZero())
8862 if (IC->isEquality() && isa<ConstantInt>(IC->getOperand(1)) &&
8863 cast<Constant>(IC->getOperand(1))->isNullValue())
8864 if (Instruction *ICA = dyn_cast<Instruction>(IC->getOperand(0)))
8865 if (ICA->getOpcode() == Instruction::And &&
8866 isa<ConstantInt>(ICA->getOperand(1)) &&
8867 (ICA->getOperand(1) == TrueValC ||
8868 ICA->getOperand(1) == FalseValC) &&
8869 isOneBitSet(cast<ConstantInt>(ICA->getOperand(1)))) {
8870 // Okay, now we know that everything is set up, we just don't
8871 // know whether we have a icmp_ne or icmp_eq and whether the
8872 // true or false val is the zero.
8873 bool ShouldNotVal = !TrueValC->isZero();
8874 ShouldNotVal ^= IC->getPredicate() == ICmpInst::ICMP_NE;
8877 V = InsertNewInstBefore(BinaryOperator::Create(
8878 Instruction::Xor, V, ICA->getOperand(1)), SI);
8879 return ReplaceInstUsesWith(SI, V);
8884 // See if we are selecting two values based on a comparison of the two values.
8885 if (FCmpInst *FCI = dyn_cast<FCmpInst>(CondVal)) {
8886 if (FCI->getOperand(0) == TrueVal && FCI->getOperand(1) == FalseVal) {
8887 // Transform (X == Y) ? X : Y -> Y
8888 if (FCI->getPredicate() == FCmpInst::FCMP_OEQ) {
8889 // This is not safe in general for floating point:
8890 // consider X== -0, Y== +0.
8891 // It becomes safe if either operand is a nonzero constant.
8892 ConstantFP *CFPt, *CFPf;
8893 if (((CFPt = dyn_cast<ConstantFP>(TrueVal)) &&
8894 !CFPt->getValueAPF().isZero()) ||
8895 ((CFPf = dyn_cast<ConstantFP>(FalseVal)) &&
8896 !CFPf->getValueAPF().isZero()))
8897 return ReplaceInstUsesWith(SI, FalseVal);
8899 // Transform (X != Y) ? X : Y -> X
8900 if (FCI->getPredicate() == FCmpInst::FCMP_ONE)
8901 return ReplaceInstUsesWith(SI, TrueVal);
8902 // NOTE: if we wanted to, this is where to detect MIN/MAX
8904 } else if (FCI->getOperand(0) == FalseVal && FCI->getOperand(1) == TrueVal){
8905 // Transform (X == Y) ? Y : X -> X
8906 if (FCI->getPredicate() == FCmpInst::FCMP_OEQ) {
8907 // This is not safe in general for floating point:
8908 // consider X== -0, Y== +0.
8909 // It becomes safe if either operand is a nonzero constant.
8910 ConstantFP *CFPt, *CFPf;
8911 if (((CFPt = dyn_cast<ConstantFP>(TrueVal)) &&
8912 !CFPt->getValueAPF().isZero()) ||
8913 ((CFPf = dyn_cast<ConstantFP>(FalseVal)) &&
8914 !CFPf->getValueAPF().isZero()))
8915 return ReplaceInstUsesWith(SI, FalseVal);
8917 // Transform (X != Y) ? Y : X -> Y
8918 if (FCI->getPredicate() == FCmpInst::FCMP_ONE)
8919 return ReplaceInstUsesWith(SI, TrueVal);
8920 // NOTE: if we wanted to, this is where to detect MIN/MAX
8922 // NOTE: if we wanted to, this is where to detect ABS
8925 // See if we are selecting two values based on a comparison of the two values.
8926 if (ICmpInst *ICI = dyn_cast<ICmpInst>(CondVal))
8927 if (Instruction *Result = visitSelectInstWithICmp(SI, ICI))
8930 if (Instruction *TI = dyn_cast<Instruction>(TrueVal))
8931 if (Instruction *FI = dyn_cast<Instruction>(FalseVal))
8932 if (TI->hasOneUse() && FI->hasOneUse()) {
8933 Instruction *AddOp = 0, *SubOp = 0;
8935 // Turn (select C, (op X, Y), (op X, Z)) -> (op X, (select C, Y, Z))
8936 if (TI->getOpcode() == FI->getOpcode())
8937 if (Instruction *IV = FoldSelectOpOp(SI, TI, FI))
8940 // Turn select C, (X+Y), (X-Y) --> (X+(select C, Y, (-Y))). This is
8941 // even legal for FP.
8942 if (TI->getOpcode() == Instruction::Sub &&
8943 FI->getOpcode() == Instruction::Add) {
8944 AddOp = FI; SubOp = TI;
8945 } else if (FI->getOpcode() == Instruction::Sub &&
8946 TI->getOpcode() == Instruction::Add) {
8947 AddOp = TI; SubOp = FI;
8951 Value *OtherAddOp = 0;
8952 if (SubOp->getOperand(0) == AddOp->getOperand(0)) {
8953 OtherAddOp = AddOp->getOperand(1);
8954 } else if (SubOp->getOperand(0) == AddOp->getOperand(1)) {
8955 OtherAddOp = AddOp->getOperand(0);
8959 // So at this point we know we have (Y -> OtherAddOp):
8960 // select C, (add X, Y), (sub X, Z)
8961 Value *NegVal; // Compute -Z
8962 if (Constant *C = dyn_cast<Constant>(SubOp->getOperand(1))) {
8963 NegVal = ConstantExpr::getNeg(C);
8965 NegVal = InsertNewInstBefore(
8966 BinaryOperator::CreateNeg(SubOp->getOperand(1), "tmp"), SI);
8969 Value *NewTrueOp = OtherAddOp;
8970 Value *NewFalseOp = NegVal;
8972 std::swap(NewTrueOp, NewFalseOp);
8973 Instruction *NewSel =
8974 SelectInst::Create(CondVal, NewTrueOp,
8975 NewFalseOp, SI.getName() + ".p");
8977 NewSel = InsertNewInstBefore(NewSel, SI);
8978 return BinaryOperator::CreateAdd(SubOp->getOperand(0), NewSel);
8983 // See if we can fold the select into one of our operands.
8984 if (SI.getType()->isInteger()) {
8985 // See the comment above GetSelectFoldableOperands for a description of the
8986 // transformation we are doing here.
8987 if (Instruction *TVI = dyn_cast<Instruction>(TrueVal))
8988 if (TVI->hasOneUse() && TVI->getNumOperands() == 2 &&
8989 !isa<Constant>(FalseVal))
8990 if (unsigned SFO = GetSelectFoldableOperands(TVI)) {
8991 unsigned OpToFold = 0;
8992 if ((SFO & 1) && FalseVal == TVI->getOperand(0)) {
8994 } else if ((SFO & 2) && FalseVal == TVI->getOperand(1)) {
8999 Constant *C = GetSelectFoldableConstant(TVI);
9000 Instruction *NewSel =
9001 SelectInst::Create(SI.getCondition(),
9002 TVI->getOperand(2-OpToFold), C);
9003 InsertNewInstBefore(NewSel, SI);
9004 NewSel->takeName(TVI);
9005 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(TVI))
9006 return BinaryOperator::Create(BO->getOpcode(), FalseVal, NewSel);
9008 assert(0 && "Unknown instruction!!");
9013 if (Instruction *FVI = dyn_cast<Instruction>(FalseVal))
9014 if (FVI->hasOneUse() && FVI->getNumOperands() == 2 &&
9015 !isa<Constant>(TrueVal))
9016 if (unsigned SFO = GetSelectFoldableOperands(FVI)) {
9017 unsigned OpToFold = 0;
9018 if ((SFO & 1) && TrueVal == FVI->getOperand(0)) {
9020 } else if ((SFO & 2) && TrueVal == FVI->getOperand(1)) {
9025 Constant *C = GetSelectFoldableConstant(FVI);
9026 Instruction *NewSel =
9027 SelectInst::Create(SI.getCondition(), C,
9028 FVI->getOperand(2-OpToFold));
9029 InsertNewInstBefore(NewSel, SI);
9030 NewSel->takeName(FVI);
9031 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(FVI))
9032 return BinaryOperator::Create(BO->getOpcode(), TrueVal, NewSel);
9034 assert(0 && "Unknown instruction!!");
9039 if (BinaryOperator::isNot(CondVal)) {
9040 SI.setOperand(0, BinaryOperator::getNotArgument(CondVal));
9041 SI.setOperand(1, FalseVal);
9042 SI.setOperand(2, TrueVal);
9049 /// EnforceKnownAlignment - If the specified pointer points to an object that
9050 /// we control, modify the object's alignment to PrefAlign. This isn't
9051 /// often possible though. If alignment is important, a more reliable approach
9052 /// is to simply align all global variables and allocation instructions to
9053 /// their preferred alignment from the beginning.
9055 static unsigned EnforceKnownAlignment(Value *V,
9056 unsigned Align, unsigned PrefAlign) {
9058 User *U = dyn_cast<User>(V);
9059 if (!U) return Align;
9061 switch (getOpcode(U)) {
9063 case Instruction::BitCast:
9064 return EnforceKnownAlignment(U->getOperand(0), Align, PrefAlign);
9065 case Instruction::GetElementPtr: {
9066 // If all indexes are zero, it is just the alignment of the base pointer.
9067 bool AllZeroOperands = true;
9068 for (User::op_iterator i = U->op_begin() + 1, e = U->op_end(); i != e; ++i)
9069 if (!isa<Constant>(*i) ||
9070 !cast<Constant>(*i)->isNullValue()) {
9071 AllZeroOperands = false;
9075 if (AllZeroOperands) {
9076 // Treat this like a bitcast.
9077 return EnforceKnownAlignment(U->getOperand(0), Align, PrefAlign);
9083 if (GlobalValue *GV = dyn_cast<GlobalValue>(V)) {
9084 // If there is a large requested alignment and we can, bump up the alignment
9086 if (!GV->isDeclaration()) {
9087 GV->setAlignment(PrefAlign);
9090 } else if (AllocationInst *AI = dyn_cast<AllocationInst>(V)) {
9091 // If there is a requested alignment and if this is an alloca, round up. We
9092 // don't do this for malloc, because some systems can't respect the request.
9093 if (isa<AllocaInst>(AI)) {
9094 AI->setAlignment(PrefAlign);
9102 /// GetOrEnforceKnownAlignment - If the specified pointer has an alignment that
9103 /// we can determine, return it, otherwise return 0. If PrefAlign is specified,
9104 /// and it is more than the alignment of the ultimate object, see if we can
9105 /// increase the alignment of the ultimate object, making this check succeed.
9106 unsigned InstCombiner::GetOrEnforceKnownAlignment(Value *V,
9107 unsigned PrefAlign) {
9108 unsigned BitWidth = TD ? TD->getTypeSizeInBits(V->getType()) :
9109 sizeof(PrefAlign) * CHAR_BIT;
9110 APInt Mask = APInt::getAllOnesValue(BitWidth);
9111 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
9112 ComputeMaskedBits(V, Mask, KnownZero, KnownOne);
9113 unsigned TrailZ = KnownZero.countTrailingOnes();
9114 unsigned Align = 1u << std::min(BitWidth - 1, TrailZ);
9116 if (PrefAlign > Align)
9117 Align = EnforceKnownAlignment(V, Align, PrefAlign);
9119 // We don't need to make any adjustment.
9123 Instruction *InstCombiner::SimplifyMemTransfer(MemIntrinsic *MI) {
9124 unsigned DstAlign = GetOrEnforceKnownAlignment(MI->getOperand(1));
9125 unsigned SrcAlign = GetOrEnforceKnownAlignment(MI->getOperand(2));
9126 unsigned MinAlign = std::min(DstAlign, SrcAlign);
9127 unsigned CopyAlign = MI->getAlignment()->getZExtValue();
9129 if (CopyAlign < MinAlign) {
9130 MI->setAlignment(ConstantInt::get(Type::Int32Ty, MinAlign));
9134 // If MemCpyInst length is 1/2/4/8 bytes then replace memcpy with
9136 ConstantInt *MemOpLength = dyn_cast<ConstantInt>(MI->getOperand(3));
9137 if (MemOpLength == 0) return 0;
9139 // Source and destination pointer types are always "i8*" for intrinsic. See
9140 // if the size is something we can handle with a single primitive load/store.
9141 // A single load+store correctly handles overlapping memory in the memmove
9143 unsigned Size = MemOpLength->getZExtValue();
9144 if (Size == 0) return MI; // Delete this mem transfer.
9146 if (Size > 8 || (Size&(Size-1)))
9147 return 0; // If not 1/2/4/8 bytes, exit.
9149 // Use an integer load+store unless we can find something better.
9150 Type *NewPtrTy = PointerType::getUnqual(IntegerType::get(Size<<3));
9152 // Memcpy forces the use of i8* for the source and destination. That means
9153 // that if you're using memcpy to move one double around, you'll get a cast
9154 // from double* to i8*. We'd much rather use a double load+store rather than
9155 // an i64 load+store, here because this improves the odds that the source or
9156 // dest address will be promotable. See if we can find a better type than the
9157 // integer datatype.
9158 if (Value *Op = getBitCastOperand(MI->getOperand(1))) {
9159 const Type *SrcETy = cast<PointerType>(Op->getType())->getElementType();
9160 if (SrcETy->isSized() && TD->getTypeStoreSize(SrcETy) == Size) {
9161 // The SrcETy might be something like {{{double}}} or [1 x double]. Rip
9162 // down through these levels if so.
9163 while (!SrcETy->isSingleValueType()) {
9164 if (const StructType *STy = dyn_cast<StructType>(SrcETy)) {
9165 if (STy->getNumElements() == 1)
9166 SrcETy = STy->getElementType(0);
9169 } else if (const ArrayType *ATy = dyn_cast<ArrayType>(SrcETy)) {
9170 if (ATy->getNumElements() == 1)
9171 SrcETy = ATy->getElementType();
9178 if (SrcETy->isSingleValueType())
9179 NewPtrTy = PointerType::getUnqual(SrcETy);
9184 // If the memcpy/memmove provides better alignment info than we can
9186 SrcAlign = std::max(SrcAlign, CopyAlign);
9187 DstAlign = std::max(DstAlign, CopyAlign);
9189 Value *Src = InsertBitCastBefore(MI->getOperand(2), NewPtrTy, *MI);
9190 Value *Dest = InsertBitCastBefore(MI->getOperand(1), NewPtrTy, *MI);
9191 Instruction *L = new LoadInst(Src, "tmp", false, SrcAlign);
9192 InsertNewInstBefore(L, *MI);
9193 InsertNewInstBefore(new StoreInst(L, Dest, false, DstAlign), *MI);
9195 // Set the size of the copy to 0, it will be deleted on the next iteration.
9196 MI->setOperand(3, Constant::getNullValue(MemOpLength->getType()));
9200 Instruction *InstCombiner::SimplifyMemSet(MemSetInst *MI) {
9201 unsigned Alignment = GetOrEnforceKnownAlignment(MI->getDest());
9202 if (MI->getAlignment()->getZExtValue() < Alignment) {
9203 MI->setAlignment(ConstantInt::get(Type::Int32Ty, Alignment));
9207 // Extract the length and alignment and fill if they are constant.
9208 ConstantInt *LenC = dyn_cast<ConstantInt>(MI->getLength());
9209 ConstantInt *FillC = dyn_cast<ConstantInt>(MI->getValue());
9210 if (!LenC || !FillC || FillC->getType() != Type::Int8Ty)
9212 uint64_t Len = LenC->getZExtValue();
9213 Alignment = MI->getAlignment()->getZExtValue();
9215 // If the length is zero, this is a no-op
9216 if (Len == 0) return MI; // memset(d,c,0,a) -> noop
9218 // memset(s,c,n) -> store s, c (for n=1,2,4,8)
9219 if (Len <= 8 && isPowerOf2_32((uint32_t)Len)) {
9220 const Type *ITy = IntegerType::get(Len*8); // n=1 -> i8.
9222 Value *Dest = MI->getDest();
9223 Dest = InsertBitCastBefore(Dest, PointerType::getUnqual(ITy), *MI);
9225 // Alignment 0 is identity for alignment 1 for memset, but not store.
9226 if (Alignment == 0) Alignment = 1;
9228 // Extract the fill value and store.
9229 uint64_t Fill = FillC->getZExtValue()*0x0101010101010101ULL;
9230 InsertNewInstBefore(new StoreInst(ConstantInt::get(ITy, Fill), Dest, false,
9233 // Set the size of the copy to 0, it will be deleted on the next iteration.
9234 MI->setLength(Constant::getNullValue(LenC->getType()));
9242 /// visitCallInst - CallInst simplification. This mostly only handles folding
9243 /// of intrinsic instructions. For normal calls, it allows visitCallSite to do
9244 /// the heavy lifting.
9246 Instruction *InstCombiner::visitCallInst(CallInst &CI) {
9247 IntrinsicInst *II = dyn_cast<IntrinsicInst>(&CI);
9248 if (!II) return visitCallSite(&CI);
9250 // Intrinsics cannot occur in an invoke, so handle them here instead of in
9252 if (MemIntrinsic *MI = dyn_cast<MemIntrinsic>(II)) {
9253 bool Changed = false;
9255 // memmove/cpy/set of zero bytes is a noop.
9256 if (Constant *NumBytes = dyn_cast<Constant>(MI->getLength())) {
9257 if (NumBytes->isNullValue()) return EraseInstFromFunction(CI);
9259 if (ConstantInt *CI = dyn_cast<ConstantInt>(NumBytes))
9260 if (CI->getZExtValue() == 1) {
9261 // Replace the instruction with just byte operations. We would
9262 // transform other cases to loads/stores, but we don't know if
9263 // alignment is sufficient.
9267 // If we have a memmove and the source operation is a constant global,
9268 // then the source and dest pointers can't alias, so we can change this
9269 // into a call to memcpy.
9270 if (MemMoveInst *MMI = dyn_cast<MemMoveInst>(MI)) {
9271 if (GlobalVariable *GVSrc = dyn_cast<GlobalVariable>(MMI->getSource()))
9272 if (GVSrc->isConstant()) {
9273 Module *M = CI.getParent()->getParent()->getParent();
9274 Intrinsic::ID MemCpyID = Intrinsic::memcpy;
9276 Tys[0] = CI.getOperand(3)->getType();
9278 Intrinsic::getDeclaration(M, MemCpyID, Tys, 1));
9282 // memmove(x,x,size) -> noop.
9283 if (MMI->getSource() == MMI->getDest())
9284 return EraseInstFromFunction(CI);
9287 // If we can determine a pointer alignment that is bigger than currently
9288 // set, update the alignment.
9289 if (isa<MemCpyInst>(MI) || isa<MemMoveInst>(MI)) {
9290 if (Instruction *I = SimplifyMemTransfer(MI))
9292 } else if (MemSetInst *MSI = dyn_cast<MemSetInst>(MI)) {
9293 if (Instruction *I = SimplifyMemSet(MSI))
9297 if (Changed) return II;
9300 switch (II->getIntrinsicID()) {
9302 case Intrinsic::bswap:
9303 // bswap(bswap(x)) -> x
9304 if (IntrinsicInst *Operand = dyn_cast<IntrinsicInst>(II->getOperand(1)))
9305 if (Operand->getIntrinsicID() == Intrinsic::bswap)
9306 return ReplaceInstUsesWith(CI, Operand->getOperand(1));
9308 case Intrinsic::ppc_altivec_lvx:
9309 case Intrinsic::ppc_altivec_lvxl:
9310 case Intrinsic::x86_sse_loadu_ps:
9311 case Intrinsic::x86_sse2_loadu_pd:
9312 case Intrinsic::x86_sse2_loadu_dq:
9313 // Turn PPC lvx -> load if the pointer is known aligned.
9314 // Turn X86 loadups -> load if the pointer is known aligned.
9315 if (GetOrEnforceKnownAlignment(II->getOperand(1), 16) >= 16) {
9316 Value *Ptr = InsertBitCastBefore(II->getOperand(1),
9317 PointerType::getUnqual(II->getType()),
9319 return new LoadInst(Ptr);
9322 case Intrinsic::ppc_altivec_stvx:
9323 case Intrinsic::ppc_altivec_stvxl:
9324 // Turn stvx -> store if the pointer is known aligned.
9325 if (GetOrEnforceKnownAlignment(II->getOperand(2), 16) >= 16) {
9326 const Type *OpPtrTy =
9327 PointerType::getUnqual(II->getOperand(1)->getType());
9328 Value *Ptr = InsertBitCastBefore(II->getOperand(2), OpPtrTy, CI);
9329 return new StoreInst(II->getOperand(1), Ptr);
9332 case Intrinsic::x86_sse_storeu_ps:
9333 case Intrinsic::x86_sse2_storeu_pd:
9334 case Intrinsic::x86_sse2_storeu_dq:
9335 // Turn X86 storeu -> store if the pointer is known aligned.
9336 if (GetOrEnforceKnownAlignment(II->getOperand(1), 16) >= 16) {
9337 const Type *OpPtrTy =
9338 PointerType::getUnqual(II->getOperand(2)->getType());
9339 Value *Ptr = InsertBitCastBefore(II->getOperand(1), OpPtrTy, CI);
9340 return new StoreInst(II->getOperand(2), Ptr);
9344 case Intrinsic::x86_sse_cvttss2si: {
9345 // These intrinsics only demands the 0th element of its input vector. If
9346 // we can simplify the input based on that, do so now.
9348 if (Value *V = SimplifyDemandedVectorElts(II->getOperand(1), 1,
9350 II->setOperand(1, V);
9356 case Intrinsic::ppc_altivec_vperm:
9357 // Turn vperm(V1,V2,mask) -> shuffle(V1,V2,mask) if mask is a constant.
9358 if (ConstantVector *Mask = dyn_cast<ConstantVector>(II->getOperand(3))) {
9359 assert(Mask->getNumOperands() == 16 && "Bad type for intrinsic!");
9361 // Check that all of the elements are integer constants or undefs.
9362 bool AllEltsOk = true;
9363 for (unsigned i = 0; i != 16; ++i) {
9364 if (!isa<ConstantInt>(Mask->getOperand(i)) &&
9365 !isa<UndefValue>(Mask->getOperand(i))) {
9372 // Cast the input vectors to byte vectors.
9373 Value *Op0 =InsertBitCastBefore(II->getOperand(1),Mask->getType(),CI);
9374 Value *Op1 =InsertBitCastBefore(II->getOperand(2),Mask->getType(),CI);
9375 Value *Result = UndefValue::get(Op0->getType());
9377 // Only extract each element once.
9378 Value *ExtractedElts[32];
9379 memset(ExtractedElts, 0, sizeof(ExtractedElts));
9381 for (unsigned i = 0; i != 16; ++i) {
9382 if (isa<UndefValue>(Mask->getOperand(i)))
9384 unsigned Idx=cast<ConstantInt>(Mask->getOperand(i))->getZExtValue();
9385 Idx &= 31; // Match the hardware behavior.
9387 if (ExtractedElts[Idx] == 0) {
9389 new ExtractElementInst(Idx < 16 ? Op0 : Op1, Idx&15, "tmp");
9390 InsertNewInstBefore(Elt, CI);
9391 ExtractedElts[Idx] = Elt;
9394 // Insert this value into the result vector.
9395 Result = InsertElementInst::Create(Result, ExtractedElts[Idx],
9397 InsertNewInstBefore(cast<Instruction>(Result), CI);
9399 return CastInst::Create(Instruction::BitCast, Result, CI.getType());
9404 case Intrinsic::stackrestore: {
9405 // If the save is right next to the restore, remove the restore. This can
9406 // happen when variable allocas are DCE'd.
9407 if (IntrinsicInst *SS = dyn_cast<IntrinsicInst>(II->getOperand(1))) {
9408 if (SS->getIntrinsicID() == Intrinsic::stacksave) {
9409 BasicBlock::iterator BI = SS;
9411 return EraseInstFromFunction(CI);
9415 // Scan down this block to see if there is another stack restore in the
9416 // same block without an intervening call/alloca.
9417 BasicBlock::iterator BI = II;
9418 TerminatorInst *TI = II->getParent()->getTerminator();
9419 bool CannotRemove = false;
9420 for (++BI; &*BI != TI; ++BI) {
9421 if (isa<AllocaInst>(BI)) {
9422 CannotRemove = true;
9425 if (CallInst *BCI = dyn_cast<CallInst>(BI)) {
9426 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(BCI)) {
9427 // If there is a stackrestore below this one, remove this one.
9428 if (II->getIntrinsicID() == Intrinsic::stackrestore)
9429 return EraseInstFromFunction(CI);
9430 // Otherwise, ignore the intrinsic.
9432 // If we found a non-intrinsic call, we can't remove the stack
9434 CannotRemove = true;
9440 // If the stack restore is in a return/unwind block and if there are no
9441 // allocas or calls between the restore and the return, nuke the restore.
9442 if (!CannotRemove && (isa<ReturnInst>(TI) || isa<UnwindInst>(TI)))
9443 return EraseInstFromFunction(CI);
9448 return visitCallSite(II);
9451 // InvokeInst simplification
9453 Instruction *InstCombiner::visitInvokeInst(InvokeInst &II) {
9454 return visitCallSite(&II);
9457 /// isSafeToEliminateVarargsCast - If this cast does not affect the value
9458 /// passed through the varargs area, we can eliminate the use of the cast.
9459 static bool isSafeToEliminateVarargsCast(const CallSite CS,
9460 const CastInst * const CI,
9461 const TargetData * const TD,
9463 if (!CI->isLosslessCast())
9466 // The size of ByVal arguments is derived from the type, so we
9467 // can't change to a type with a different size. If the size were
9468 // passed explicitly we could avoid this check.
9469 if (!CS.paramHasAttr(ix, Attribute::ByVal))
9473 cast<PointerType>(CI->getOperand(0)->getType())->getElementType();
9474 const Type* DstTy = cast<PointerType>(CI->getType())->getElementType();
9475 if (!SrcTy->isSized() || !DstTy->isSized())
9477 if (TD->getABITypeSize(SrcTy) != TD->getABITypeSize(DstTy))
9482 // visitCallSite - Improvements for call and invoke instructions.
9484 Instruction *InstCombiner::visitCallSite(CallSite CS) {
9485 bool Changed = false;
9487 // If the callee is a constexpr cast of a function, attempt to move the cast
9488 // to the arguments of the call/invoke.
9489 if (transformConstExprCastCall(CS)) return 0;
9491 Value *Callee = CS.getCalledValue();
9493 if (Function *CalleeF = dyn_cast<Function>(Callee))
9494 if (CalleeF->getCallingConv() != CS.getCallingConv()) {
9495 Instruction *OldCall = CS.getInstruction();
9496 // If the call and callee calling conventions don't match, this call must
9497 // be unreachable, as the call is undefined.
9498 new StoreInst(ConstantInt::getTrue(),
9499 UndefValue::get(PointerType::getUnqual(Type::Int1Ty)),
9501 if (!OldCall->use_empty())
9502 OldCall->replaceAllUsesWith(UndefValue::get(OldCall->getType()));
9503 if (isa<CallInst>(OldCall)) // Not worth removing an invoke here.
9504 return EraseInstFromFunction(*OldCall);
9508 if (isa<ConstantPointerNull>(Callee) || isa<UndefValue>(Callee)) {
9509 // This instruction is not reachable, just remove it. We insert a store to
9510 // undef so that we know that this code is not reachable, despite the fact
9511 // that we can't modify the CFG here.
9512 new StoreInst(ConstantInt::getTrue(),
9513 UndefValue::get(PointerType::getUnqual(Type::Int1Ty)),
9514 CS.getInstruction());
9516 if (!CS.getInstruction()->use_empty())
9517 CS.getInstruction()->
9518 replaceAllUsesWith(UndefValue::get(CS.getInstruction()->getType()));
9520 if (InvokeInst *II = dyn_cast<InvokeInst>(CS.getInstruction())) {
9521 // Don't break the CFG, insert a dummy cond branch.
9522 BranchInst::Create(II->getNormalDest(), II->getUnwindDest(),
9523 ConstantInt::getTrue(), II);
9525 return EraseInstFromFunction(*CS.getInstruction());
9528 if (BitCastInst *BC = dyn_cast<BitCastInst>(Callee))
9529 if (IntrinsicInst *In = dyn_cast<IntrinsicInst>(BC->getOperand(0)))
9530 if (In->getIntrinsicID() == Intrinsic::init_trampoline)
9531 return transformCallThroughTrampoline(CS);
9533 const PointerType *PTy = cast<PointerType>(Callee->getType());
9534 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
9535 if (FTy->isVarArg()) {
9536 int ix = FTy->getNumParams() + (isa<InvokeInst>(Callee) ? 3 : 1);
9537 // See if we can optimize any arguments passed through the varargs area of
9539 for (CallSite::arg_iterator I = CS.arg_begin()+FTy->getNumParams(),
9540 E = CS.arg_end(); I != E; ++I, ++ix) {
9541 CastInst *CI = dyn_cast<CastInst>(*I);
9542 if (CI && isSafeToEliminateVarargsCast(CS, CI, TD, ix)) {
9543 *I = CI->getOperand(0);
9549 if (isa<InlineAsm>(Callee) && !CS.doesNotThrow()) {
9550 // Inline asm calls cannot throw - mark them 'nounwind'.
9551 CS.setDoesNotThrow();
9555 return Changed ? CS.getInstruction() : 0;
9558 // transformConstExprCastCall - If the callee is a constexpr cast of a function,
9559 // attempt to move the cast to the arguments of the call/invoke.
9561 bool InstCombiner::transformConstExprCastCall(CallSite CS) {
9562 if (!isa<ConstantExpr>(CS.getCalledValue())) return false;
9563 ConstantExpr *CE = cast<ConstantExpr>(CS.getCalledValue());
9564 if (CE->getOpcode() != Instruction::BitCast ||
9565 !isa<Function>(CE->getOperand(0)))
9567 Function *Callee = cast<Function>(CE->getOperand(0));
9568 Instruction *Caller = CS.getInstruction();
9569 const AttrListPtr &CallerPAL = CS.getAttributes();
9571 // Okay, this is a cast from a function to a different type. Unless doing so
9572 // would cause a type conversion of one of our arguments, change this call to
9573 // be a direct call with arguments casted to the appropriate types.
9575 const FunctionType *FT = Callee->getFunctionType();
9576 const Type *OldRetTy = Caller->getType();
9577 const Type *NewRetTy = FT->getReturnType();
9579 if (isa<StructType>(NewRetTy))
9580 return false; // TODO: Handle multiple return values.
9582 // Check to see if we are changing the return type...
9583 if (OldRetTy != NewRetTy) {
9584 if (Callee->isDeclaration() &&
9585 // Conversion is ok if changing from one pointer type to another or from
9586 // a pointer to an integer of the same size.
9587 !((isa<PointerType>(OldRetTy) || OldRetTy == TD->getIntPtrType()) &&
9588 (isa<PointerType>(NewRetTy) || NewRetTy == TD->getIntPtrType())))
9589 return false; // Cannot transform this return value.
9591 if (!Caller->use_empty() &&
9592 // void -> non-void is handled specially
9593 NewRetTy != Type::VoidTy && !CastInst::isCastable(NewRetTy, OldRetTy))
9594 return false; // Cannot transform this return value.
9596 if (!CallerPAL.isEmpty() && !Caller->use_empty()) {
9597 Attributes RAttrs = CallerPAL.getRetAttributes();
9598 if (RAttrs & Attribute::typeIncompatible(NewRetTy))
9599 return false; // Attribute not compatible with transformed value.
9602 // If the callsite is an invoke instruction, and the return value is used by
9603 // a PHI node in a successor, we cannot change the return type of the call
9604 // because there is no place to put the cast instruction (without breaking
9605 // the critical edge). Bail out in this case.
9606 if (!Caller->use_empty())
9607 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller))
9608 for (Value::use_iterator UI = II->use_begin(), E = II->use_end();
9610 if (PHINode *PN = dyn_cast<PHINode>(*UI))
9611 if (PN->getParent() == II->getNormalDest() ||
9612 PN->getParent() == II->getUnwindDest())
9616 unsigned NumActualArgs = unsigned(CS.arg_end()-CS.arg_begin());
9617 unsigned NumCommonArgs = std::min(FT->getNumParams(), NumActualArgs);
9619 CallSite::arg_iterator AI = CS.arg_begin();
9620 for (unsigned i = 0, e = NumCommonArgs; i != e; ++i, ++AI) {
9621 const Type *ParamTy = FT->getParamType(i);
9622 const Type *ActTy = (*AI)->getType();
9624 if (!CastInst::isCastable(ActTy, ParamTy))
9625 return false; // Cannot transform this parameter value.
9627 if (CallerPAL.getParamAttributes(i + 1)
9628 & Attribute::typeIncompatible(ParamTy))
9629 return false; // Attribute not compatible with transformed value.
9631 // Converting from one pointer type to another or between a pointer and an
9632 // integer of the same size is safe even if we do not have a body.
9633 bool isConvertible = ActTy == ParamTy ||
9634 ((isa<PointerType>(ParamTy) || ParamTy == TD->getIntPtrType()) &&
9635 (isa<PointerType>(ActTy) || ActTy == TD->getIntPtrType()));
9636 if (Callee->isDeclaration() && !isConvertible) return false;
9639 if (FT->getNumParams() < NumActualArgs && !FT->isVarArg() &&
9640 Callee->isDeclaration())
9641 return false; // Do not delete arguments unless we have a function body.
9643 if (FT->getNumParams() < NumActualArgs && FT->isVarArg() &&
9644 !CallerPAL.isEmpty())
9645 // In this case we have more arguments than the new function type, but we
9646 // won't be dropping them. Check that these extra arguments have attributes
9647 // that are compatible with being a vararg call argument.
9648 for (unsigned i = CallerPAL.getNumSlots(); i; --i) {
9649 if (CallerPAL.getSlot(i - 1).Index <= FT->getNumParams())
9651 Attributes PAttrs = CallerPAL.getSlot(i - 1).Attrs;
9652 if (PAttrs & Attribute::VarArgsIncompatible)
9656 // Okay, we decided that this is a safe thing to do: go ahead and start
9657 // inserting cast instructions as necessary...
9658 std::vector<Value*> Args;
9659 Args.reserve(NumActualArgs);
9660 SmallVector<AttributeWithIndex, 8> attrVec;
9661 attrVec.reserve(NumCommonArgs);
9663 // Get any return attributes.
9664 Attributes RAttrs = CallerPAL.getRetAttributes();
9666 // If the return value is not being used, the type may not be compatible
9667 // with the existing attributes. Wipe out any problematic attributes.
9668 RAttrs &= ~Attribute::typeIncompatible(NewRetTy);
9670 // Add the new return attributes.
9672 attrVec.push_back(AttributeWithIndex::get(0, RAttrs));
9674 AI = CS.arg_begin();
9675 for (unsigned i = 0; i != NumCommonArgs; ++i, ++AI) {
9676 const Type *ParamTy = FT->getParamType(i);
9677 if ((*AI)->getType() == ParamTy) {
9678 Args.push_back(*AI);
9680 Instruction::CastOps opcode = CastInst::getCastOpcode(*AI,
9681 false, ParamTy, false);
9682 CastInst *NewCast = CastInst::Create(opcode, *AI, ParamTy, "tmp");
9683 Args.push_back(InsertNewInstBefore(NewCast, *Caller));
9686 // Add any parameter attributes.
9687 if (Attributes PAttrs = CallerPAL.getParamAttributes(i + 1))
9688 attrVec.push_back(AttributeWithIndex::get(i + 1, PAttrs));
9691 // If the function takes more arguments than the call was taking, add them
9693 for (unsigned i = NumCommonArgs; i != FT->getNumParams(); ++i)
9694 Args.push_back(Constant::getNullValue(FT->getParamType(i)));
9696 // If we are removing arguments to the function, emit an obnoxious warning...
9697 if (FT->getNumParams() < NumActualArgs) {
9698 if (!FT->isVarArg()) {
9699 cerr << "WARNING: While resolving call to function '"
9700 << Callee->getName() << "' arguments were dropped!\n";
9702 // Add all of the arguments in their promoted form to the arg list...
9703 for (unsigned i = FT->getNumParams(); i != NumActualArgs; ++i, ++AI) {
9704 const Type *PTy = getPromotedType((*AI)->getType());
9705 if (PTy != (*AI)->getType()) {
9706 // Must promote to pass through va_arg area!
9707 Instruction::CastOps opcode = CastInst::getCastOpcode(*AI, false,
9709 Instruction *Cast = CastInst::Create(opcode, *AI, PTy, "tmp");
9710 InsertNewInstBefore(Cast, *Caller);
9711 Args.push_back(Cast);
9713 Args.push_back(*AI);
9716 // Add any parameter attributes.
9717 if (Attributes PAttrs = CallerPAL.getParamAttributes(i + 1))
9718 attrVec.push_back(AttributeWithIndex::get(i + 1, PAttrs));
9723 if (Attributes FnAttrs = CallerPAL.getFnAttributes())
9724 attrVec.push_back(AttributeWithIndex::get(~0, FnAttrs));
9726 if (NewRetTy == Type::VoidTy)
9727 Caller->setName(""); // Void type should not have a name.
9729 const AttrListPtr &NewCallerPAL = AttrListPtr::get(attrVec.begin(),attrVec.end());
9732 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
9733 NC = InvokeInst::Create(Callee, II->getNormalDest(), II->getUnwindDest(),
9734 Args.begin(), Args.end(),
9735 Caller->getName(), Caller);
9736 cast<InvokeInst>(NC)->setCallingConv(II->getCallingConv());
9737 cast<InvokeInst>(NC)->setAttributes(NewCallerPAL);
9739 NC = CallInst::Create(Callee, Args.begin(), Args.end(),
9740 Caller->getName(), Caller);
9741 CallInst *CI = cast<CallInst>(Caller);
9742 if (CI->isTailCall())
9743 cast<CallInst>(NC)->setTailCall();
9744 cast<CallInst>(NC)->setCallingConv(CI->getCallingConv());
9745 cast<CallInst>(NC)->setAttributes(NewCallerPAL);
9748 // Insert a cast of the return type as necessary.
9750 if (OldRetTy != NV->getType() && !Caller->use_empty()) {
9751 if (NV->getType() != Type::VoidTy) {
9752 Instruction::CastOps opcode = CastInst::getCastOpcode(NC, false,
9754 NV = NC = CastInst::Create(opcode, NC, OldRetTy, "tmp");
9756 // If this is an invoke instruction, we should insert it after the first
9757 // non-phi, instruction in the normal successor block.
9758 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
9759 BasicBlock::iterator I = II->getNormalDest()->getFirstNonPHI();
9760 InsertNewInstBefore(NC, *I);
9762 // Otherwise, it's a call, just insert cast right after the call instr
9763 InsertNewInstBefore(NC, *Caller);
9765 AddUsersToWorkList(*Caller);
9767 NV = UndefValue::get(Caller->getType());
9771 if (Caller->getType() != Type::VoidTy && !Caller->use_empty())
9772 Caller->replaceAllUsesWith(NV);
9773 Caller->eraseFromParent();
9774 RemoveFromWorkList(Caller);
9778 // transformCallThroughTrampoline - Turn a call to a function created by the
9779 // init_trampoline intrinsic into a direct call to the underlying function.
9781 Instruction *InstCombiner::transformCallThroughTrampoline(CallSite CS) {
9782 Value *Callee = CS.getCalledValue();
9783 const PointerType *PTy = cast<PointerType>(Callee->getType());
9784 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
9785 const AttrListPtr &Attrs = CS.getAttributes();
9787 // If the call already has the 'nest' attribute somewhere then give up -
9788 // otherwise 'nest' would occur twice after splicing in the chain.
9789 if (Attrs.hasAttrSomewhere(Attribute::Nest))
9792 IntrinsicInst *Tramp =
9793 cast<IntrinsicInst>(cast<BitCastInst>(Callee)->getOperand(0));
9795 Function *NestF = cast<Function>(Tramp->getOperand(2)->stripPointerCasts());
9796 const PointerType *NestFPTy = cast<PointerType>(NestF->getType());
9797 const FunctionType *NestFTy = cast<FunctionType>(NestFPTy->getElementType());
9799 const AttrListPtr &NestAttrs = NestF->getAttributes();
9800 if (!NestAttrs.isEmpty()) {
9801 unsigned NestIdx = 1;
9802 const Type *NestTy = 0;
9803 Attributes NestAttr = Attribute::None;
9805 // Look for a parameter marked with the 'nest' attribute.
9806 for (FunctionType::param_iterator I = NestFTy->param_begin(),
9807 E = NestFTy->param_end(); I != E; ++NestIdx, ++I)
9808 if (NestAttrs.paramHasAttr(NestIdx, Attribute::Nest)) {
9809 // Record the parameter type and any other attributes.
9811 NestAttr = NestAttrs.getParamAttributes(NestIdx);
9816 Instruction *Caller = CS.getInstruction();
9817 std::vector<Value*> NewArgs;
9818 NewArgs.reserve(unsigned(CS.arg_end()-CS.arg_begin())+1);
9820 SmallVector<AttributeWithIndex, 8> NewAttrs;
9821 NewAttrs.reserve(Attrs.getNumSlots() + 1);
9823 // Insert the nest argument into the call argument list, which may
9824 // mean appending it. Likewise for attributes.
9826 // Add any result attributes.
9827 if (Attributes Attr = Attrs.getRetAttributes())
9828 NewAttrs.push_back(AttributeWithIndex::get(0, Attr));
9832 CallSite::arg_iterator I = CS.arg_begin(), E = CS.arg_end();
9834 if (Idx == NestIdx) {
9835 // Add the chain argument and attributes.
9836 Value *NestVal = Tramp->getOperand(3);
9837 if (NestVal->getType() != NestTy)
9838 NestVal = new BitCastInst(NestVal, NestTy, "nest", Caller);
9839 NewArgs.push_back(NestVal);
9840 NewAttrs.push_back(AttributeWithIndex::get(NestIdx, NestAttr));
9846 // Add the original argument and attributes.
9847 NewArgs.push_back(*I);
9848 if (Attributes Attr = Attrs.getParamAttributes(Idx))
9850 (AttributeWithIndex::get(Idx + (Idx >= NestIdx), Attr));
9856 // Add any function attributes.
9857 if (Attributes Attr = Attrs.getFnAttributes())
9858 NewAttrs.push_back(AttributeWithIndex::get(~0, Attr));
9860 // The trampoline may have been bitcast to a bogus type (FTy).
9861 // Handle this by synthesizing a new function type, equal to FTy
9862 // with the chain parameter inserted.
9864 std::vector<const Type*> NewTypes;
9865 NewTypes.reserve(FTy->getNumParams()+1);
9867 // Insert the chain's type into the list of parameter types, which may
9868 // mean appending it.
9871 FunctionType::param_iterator I = FTy->param_begin(),
9872 E = FTy->param_end();
9876 // Add the chain's type.
9877 NewTypes.push_back(NestTy);
9882 // Add the original type.
9883 NewTypes.push_back(*I);
9889 // Replace the trampoline call with a direct call. Let the generic
9890 // code sort out any function type mismatches.
9891 FunctionType *NewFTy =
9892 FunctionType::get(FTy->getReturnType(), NewTypes, FTy->isVarArg());
9893 Constant *NewCallee = NestF->getType() == PointerType::getUnqual(NewFTy) ?
9894 NestF : ConstantExpr::getBitCast(NestF, PointerType::getUnqual(NewFTy));
9895 const AttrListPtr &NewPAL = AttrListPtr::get(NewAttrs.begin(),NewAttrs.end());
9897 Instruction *NewCaller;
9898 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
9899 NewCaller = InvokeInst::Create(NewCallee,
9900 II->getNormalDest(), II->getUnwindDest(),
9901 NewArgs.begin(), NewArgs.end(),
9902 Caller->getName(), Caller);
9903 cast<InvokeInst>(NewCaller)->setCallingConv(II->getCallingConv());
9904 cast<InvokeInst>(NewCaller)->setAttributes(NewPAL);
9906 NewCaller = CallInst::Create(NewCallee, NewArgs.begin(), NewArgs.end(),
9907 Caller->getName(), Caller);
9908 if (cast<CallInst>(Caller)->isTailCall())
9909 cast<CallInst>(NewCaller)->setTailCall();
9910 cast<CallInst>(NewCaller)->
9911 setCallingConv(cast<CallInst>(Caller)->getCallingConv());
9912 cast<CallInst>(NewCaller)->setAttributes(NewPAL);
9914 if (Caller->getType() != Type::VoidTy && !Caller->use_empty())
9915 Caller->replaceAllUsesWith(NewCaller);
9916 Caller->eraseFromParent();
9917 RemoveFromWorkList(Caller);
9922 // Replace the trampoline call with a direct call. Since there is no 'nest'
9923 // parameter, there is no need to adjust the argument list. Let the generic
9924 // code sort out any function type mismatches.
9925 Constant *NewCallee =
9926 NestF->getType() == PTy ? NestF : ConstantExpr::getBitCast(NestF, PTy);
9927 CS.setCalledFunction(NewCallee);
9928 return CS.getInstruction();
9931 /// FoldPHIArgBinOpIntoPHI - If we have something like phi [add (a,b), add(c,d)]
9932 /// and if a/b/c/d and the add's all have a single use, turn this into two phi's
9933 /// and a single binop.
9934 Instruction *InstCombiner::FoldPHIArgBinOpIntoPHI(PHINode &PN) {
9935 Instruction *FirstInst = cast<Instruction>(PN.getIncomingValue(0));
9936 assert(isa<BinaryOperator>(FirstInst) || isa<CmpInst>(FirstInst));
9937 unsigned Opc = FirstInst->getOpcode();
9938 Value *LHSVal = FirstInst->getOperand(0);
9939 Value *RHSVal = FirstInst->getOperand(1);
9941 const Type *LHSType = LHSVal->getType();
9942 const Type *RHSType = RHSVal->getType();
9944 // Scan to see if all operands are the same opcode, all have one use, and all
9945 // kill their operands (i.e. the operands have one use).
9946 for (unsigned i = 1; i != PN.getNumIncomingValues(); ++i) {
9947 Instruction *I = dyn_cast<Instruction>(PN.getIncomingValue(i));
9948 if (!I || I->getOpcode() != Opc || !I->hasOneUse() ||
9949 // Verify type of the LHS matches so we don't fold cmp's of different
9950 // types or GEP's with different index types.
9951 I->getOperand(0)->getType() != LHSType ||
9952 I->getOperand(1)->getType() != RHSType)
9955 // If they are CmpInst instructions, check their predicates
9956 if (Opc == Instruction::ICmp || Opc == Instruction::FCmp)
9957 if (cast<CmpInst>(I)->getPredicate() !=
9958 cast<CmpInst>(FirstInst)->getPredicate())
9961 // Keep track of which operand needs a phi node.
9962 if (I->getOperand(0) != LHSVal) LHSVal = 0;
9963 if (I->getOperand(1) != RHSVal) RHSVal = 0;
9966 // Otherwise, this is safe to transform!
9968 Value *InLHS = FirstInst->getOperand(0);
9969 Value *InRHS = FirstInst->getOperand(1);
9970 PHINode *NewLHS = 0, *NewRHS = 0;
9972 NewLHS = PHINode::Create(LHSType,
9973 FirstInst->getOperand(0)->getName() + ".pn");
9974 NewLHS->reserveOperandSpace(PN.getNumOperands()/2);
9975 NewLHS->addIncoming(InLHS, PN.getIncomingBlock(0));
9976 InsertNewInstBefore(NewLHS, PN);
9981 NewRHS = PHINode::Create(RHSType,
9982 FirstInst->getOperand(1)->getName() + ".pn");
9983 NewRHS->reserveOperandSpace(PN.getNumOperands()/2);
9984 NewRHS->addIncoming(InRHS, PN.getIncomingBlock(0));
9985 InsertNewInstBefore(NewRHS, PN);
9989 // Add all operands to the new PHIs.
9990 if (NewLHS || NewRHS) {
9991 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
9992 Instruction *InInst = cast<Instruction>(PN.getIncomingValue(i));
9994 Value *NewInLHS = InInst->getOperand(0);
9995 NewLHS->addIncoming(NewInLHS, PN.getIncomingBlock(i));
9998 Value *NewInRHS = InInst->getOperand(1);
9999 NewRHS->addIncoming(NewInRHS, PN.getIncomingBlock(i));
10004 if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(FirstInst))
10005 return BinaryOperator::Create(BinOp->getOpcode(), LHSVal, RHSVal);
10006 CmpInst *CIOp = cast<CmpInst>(FirstInst);
10007 return CmpInst::Create(CIOp->getOpcode(), CIOp->getPredicate(), LHSVal,
10011 Instruction *InstCombiner::FoldPHIArgGEPIntoPHI(PHINode &PN) {
10012 GetElementPtrInst *FirstInst =cast<GetElementPtrInst>(PN.getIncomingValue(0));
10014 SmallVector<Value*, 16> FixedOperands(FirstInst->op_begin(),
10015 FirstInst->op_end());
10017 // Scan to see if all operands are the same opcode, all have one use, and all
10018 // kill their operands (i.e. the operands have one use).
10019 for (unsigned i = 1; i != PN.getNumIncomingValues(); ++i) {
10020 GetElementPtrInst *GEP= dyn_cast<GetElementPtrInst>(PN.getIncomingValue(i));
10021 if (!GEP || !GEP->hasOneUse() || GEP->getType() != FirstInst->getType() ||
10022 GEP->getNumOperands() != FirstInst->getNumOperands())
10025 // Compare the operand lists.
10026 for (unsigned op = 0, e = FirstInst->getNumOperands(); op != e; ++op) {
10027 if (FirstInst->getOperand(op) == GEP->getOperand(op))
10030 // Don't merge two GEPs when two operands differ (introducing phi nodes)
10031 // if one of the PHIs has a constant for the index. The index may be
10032 // substantially cheaper to compute for the constants, so making it a
10033 // variable index could pessimize the path. This also handles the case
10034 // for struct indices, which must always be constant.
10035 if (isa<ConstantInt>(FirstInst->getOperand(op)) ||
10036 isa<ConstantInt>(GEP->getOperand(op)))
10039 if (FirstInst->getOperand(op)->getType() !=GEP->getOperand(op)->getType())
10041 FixedOperands[op] = 0; // Needs a PHI.
10045 // Otherwise, this is safe to transform. Insert PHI nodes for each operand
10046 // that is variable.
10047 SmallVector<PHINode*, 16> OperandPhis(FixedOperands.size());
10049 bool HasAnyPHIs = false;
10050 for (unsigned i = 0, e = FixedOperands.size(); i != e; ++i) {
10051 if (FixedOperands[i]) continue; // operand doesn't need a phi.
10052 Value *FirstOp = FirstInst->getOperand(i);
10053 PHINode *NewPN = PHINode::Create(FirstOp->getType(),
10054 FirstOp->getName()+".pn");
10055 InsertNewInstBefore(NewPN, PN);
10057 NewPN->reserveOperandSpace(e);
10058 NewPN->addIncoming(FirstOp, PN.getIncomingBlock(0));
10059 OperandPhis[i] = NewPN;
10060 FixedOperands[i] = NewPN;
10065 // Add all operands to the new PHIs.
10067 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
10068 GetElementPtrInst *InGEP =cast<GetElementPtrInst>(PN.getIncomingValue(i));
10069 BasicBlock *InBB = PN.getIncomingBlock(i);
10071 for (unsigned op = 0, e = OperandPhis.size(); op != e; ++op)
10072 if (PHINode *OpPhi = OperandPhis[op])
10073 OpPhi->addIncoming(InGEP->getOperand(op), InBB);
10077 Value *Base = FixedOperands[0];
10078 return GetElementPtrInst::Create(Base, FixedOperands.begin()+1,
10079 FixedOperands.end());
10083 /// isSafeToSinkLoad - Return true if we know that it is safe sink the load out
10084 /// of the block that defines it. This means that it must be obvious the value
10085 /// of the load is not changed from the point of the load to the end of the
10086 /// block it is in.
10088 /// Finally, it is safe, but not profitable, to sink a load targetting a
10089 /// non-address-taken alloca. Doing so will cause us to not promote the alloca
10091 static bool isSafeToSinkLoad(LoadInst *L) {
10092 BasicBlock::iterator BBI = L, E = L->getParent()->end();
10094 for (++BBI; BBI != E; ++BBI)
10095 if (BBI->mayWriteToMemory())
10098 // Check for non-address taken alloca. If not address-taken already, it isn't
10099 // profitable to do this xform.
10100 if (AllocaInst *AI = dyn_cast<AllocaInst>(L->getOperand(0))) {
10101 bool isAddressTaken = false;
10102 for (Value::use_iterator UI = AI->use_begin(), E = AI->use_end();
10104 if (isa<LoadInst>(UI)) continue;
10105 if (StoreInst *SI = dyn_cast<StoreInst>(*UI)) {
10106 // If storing TO the alloca, then the address isn't taken.
10107 if (SI->getOperand(1) == AI) continue;
10109 isAddressTaken = true;
10113 if (!isAddressTaken)
10121 // FoldPHIArgOpIntoPHI - If all operands to a PHI node are the same "unary"
10122 // operator and they all are only used by the PHI, PHI together their
10123 // inputs, and do the operation once, to the result of the PHI.
10124 Instruction *InstCombiner::FoldPHIArgOpIntoPHI(PHINode &PN) {
10125 Instruction *FirstInst = cast<Instruction>(PN.getIncomingValue(0));
10127 // Scan the instruction, looking for input operations that can be folded away.
10128 // If all input operands to the phi are the same instruction (e.g. a cast from
10129 // the same type or "+42") we can pull the operation through the PHI, reducing
10130 // code size and simplifying code.
10131 Constant *ConstantOp = 0;
10132 const Type *CastSrcTy = 0;
10133 bool isVolatile = false;
10134 if (isa<CastInst>(FirstInst)) {
10135 CastSrcTy = FirstInst->getOperand(0)->getType();
10136 } else if (isa<BinaryOperator>(FirstInst) || isa<CmpInst>(FirstInst)) {
10137 // Can fold binop, compare or shift here if the RHS is a constant,
10138 // otherwise call FoldPHIArgBinOpIntoPHI.
10139 ConstantOp = dyn_cast<Constant>(FirstInst->getOperand(1));
10140 if (ConstantOp == 0)
10141 return FoldPHIArgBinOpIntoPHI(PN);
10142 } else if (LoadInst *LI = dyn_cast<LoadInst>(FirstInst)) {
10143 isVolatile = LI->isVolatile();
10144 // We can't sink the load if the loaded value could be modified between the
10145 // load and the PHI.
10146 if (LI->getParent() != PN.getIncomingBlock(0) ||
10147 !isSafeToSinkLoad(LI))
10150 // If the PHI is of volatile loads and the load block has multiple
10151 // successors, sinking it would remove a load of the volatile value from
10152 // the path through the other successor.
10154 LI->getParent()->getTerminator()->getNumSuccessors() != 1)
10157 } else if (isa<GetElementPtrInst>(FirstInst)) {
10158 return FoldPHIArgGEPIntoPHI(PN);
10160 return 0; // Cannot fold this operation.
10163 // Check to see if all arguments are the same operation.
10164 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
10165 if (!isa<Instruction>(PN.getIncomingValue(i))) return 0;
10166 Instruction *I = cast<Instruction>(PN.getIncomingValue(i));
10167 if (!I->hasOneUse() || !I->isSameOperationAs(FirstInst))
10170 if (I->getOperand(0)->getType() != CastSrcTy)
10171 return 0; // Cast operation must match.
10172 } else if (LoadInst *LI = dyn_cast<LoadInst>(I)) {
10173 // We can't sink the load if the loaded value could be modified between
10174 // the load and the PHI.
10175 if (LI->isVolatile() != isVolatile ||
10176 LI->getParent() != PN.getIncomingBlock(i) ||
10177 !isSafeToSinkLoad(LI))
10180 // If the PHI is of volatile loads and the load block has multiple
10181 // successors, sinking it would remove a load of the volatile value from
10182 // the path through the other successor.
10184 LI->getParent()->getTerminator()->getNumSuccessors() != 1)
10188 } else if (I->getOperand(1) != ConstantOp) {
10193 // Okay, they are all the same operation. Create a new PHI node of the
10194 // correct type, and PHI together all of the LHS's of the instructions.
10195 PHINode *NewPN = PHINode::Create(FirstInst->getOperand(0)->getType(),
10196 PN.getName()+".in");
10197 NewPN->reserveOperandSpace(PN.getNumOperands()/2);
10199 Value *InVal = FirstInst->getOperand(0);
10200 NewPN->addIncoming(InVal, PN.getIncomingBlock(0));
10202 // Add all operands to the new PHI.
10203 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
10204 Value *NewInVal = cast<Instruction>(PN.getIncomingValue(i))->getOperand(0);
10205 if (NewInVal != InVal)
10207 NewPN->addIncoming(NewInVal, PN.getIncomingBlock(i));
10212 // The new PHI unions all of the same values together. This is really
10213 // common, so we handle it intelligently here for compile-time speed.
10217 InsertNewInstBefore(NewPN, PN);
10221 // Insert and return the new operation.
10222 if (CastInst* FirstCI = dyn_cast<CastInst>(FirstInst))
10223 return CastInst::Create(FirstCI->getOpcode(), PhiVal, PN.getType());
10224 if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(FirstInst))
10225 return BinaryOperator::Create(BinOp->getOpcode(), PhiVal, ConstantOp);
10226 if (CmpInst *CIOp = dyn_cast<CmpInst>(FirstInst))
10227 return CmpInst::Create(CIOp->getOpcode(), CIOp->getPredicate(),
10228 PhiVal, ConstantOp);
10229 assert(isa<LoadInst>(FirstInst) && "Unknown operation");
10231 // If this was a volatile load that we are merging, make sure to loop through
10232 // and mark all the input loads as non-volatile. If we don't do this, we will
10233 // insert a new volatile load and the old ones will not be deletable.
10235 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
10236 cast<LoadInst>(PN.getIncomingValue(i))->setVolatile(false);
10238 return new LoadInst(PhiVal, "", isVolatile);
10241 /// DeadPHICycle - Return true if this PHI node is only used by a PHI node cycle
10243 static bool DeadPHICycle(PHINode *PN,
10244 SmallPtrSet<PHINode*, 16> &PotentiallyDeadPHIs) {
10245 if (PN->use_empty()) return true;
10246 if (!PN->hasOneUse()) return false;
10248 // Remember this node, and if we find the cycle, return.
10249 if (!PotentiallyDeadPHIs.insert(PN))
10252 // Don't scan crazily complex things.
10253 if (PotentiallyDeadPHIs.size() == 16)
10256 if (PHINode *PU = dyn_cast<PHINode>(PN->use_back()))
10257 return DeadPHICycle(PU, PotentiallyDeadPHIs);
10262 /// PHIsEqualValue - Return true if this phi node is always equal to
10263 /// NonPhiInVal. This happens with mutually cyclic phi nodes like:
10264 /// z = some value; x = phi (y, z); y = phi (x, z)
10265 static bool PHIsEqualValue(PHINode *PN, Value *NonPhiInVal,
10266 SmallPtrSet<PHINode*, 16> &ValueEqualPHIs) {
10267 // See if we already saw this PHI node.
10268 if (!ValueEqualPHIs.insert(PN))
10271 // Don't scan crazily complex things.
10272 if (ValueEqualPHIs.size() == 16)
10275 // Scan the operands to see if they are either phi nodes or are equal to
10277 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
10278 Value *Op = PN->getIncomingValue(i);
10279 if (PHINode *OpPN = dyn_cast<PHINode>(Op)) {
10280 if (!PHIsEqualValue(OpPN, NonPhiInVal, ValueEqualPHIs))
10282 } else if (Op != NonPhiInVal)
10290 // PHINode simplification
10292 Instruction *InstCombiner::visitPHINode(PHINode &PN) {
10293 // If LCSSA is around, don't mess with Phi nodes
10294 if (MustPreserveLCSSA) return 0;
10296 if (Value *V = PN.hasConstantValue())
10297 return ReplaceInstUsesWith(PN, V);
10299 // If all PHI operands are the same operation, pull them through the PHI,
10300 // reducing code size.
10301 if (isa<Instruction>(PN.getIncomingValue(0)) &&
10302 isa<Instruction>(PN.getIncomingValue(1)) &&
10303 cast<Instruction>(PN.getIncomingValue(0))->getOpcode() ==
10304 cast<Instruction>(PN.getIncomingValue(1))->getOpcode() &&
10305 // FIXME: The hasOneUse check will fail for PHIs that use the value more
10306 // than themselves more than once.
10307 PN.getIncomingValue(0)->hasOneUse())
10308 if (Instruction *Result = FoldPHIArgOpIntoPHI(PN))
10311 // If this is a trivial cycle in the PHI node graph, remove it. Basically, if
10312 // this PHI only has a single use (a PHI), and if that PHI only has one use (a
10313 // PHI)... break the cycle.
10314 if (PN.hasOneUse()) {
10315 Instruction *PHIUser = cast<Instruction>(PN.use_back());
10316 if (PHINode *PU = dyn_cast<PHINode>(PHIUser)) {
10317 SmallPtrSet<PHINode*, 16> PotentiallyDeadPHIs;
10318 PotentiallyDeadPHIs.insert(&PN);
10319 if (DeadPHICycle(PU, PotentiallyDeadPHIs))
10320 return ReplaceInstUsesWith(PN, UndefValue::get(PN.getType()));
10323 // If this phi has a single use, and if that use just computes a value for
10324 // the next iteration of a loop, delete the phi. This occurs with unused
10325 // induction variables, e.g. "for (int j = 0; ; ++j);". Detecting this
10326 // common case here is good because the only other things that catch this
10327 // are induction variable analysis (sometimes) and ADCE, which is only run
10329 if (PHIUser->hasOneUse() &&
10330 (isa<BinaryOperator>(PHIUser) || isa<GetElementPtrInst>(PHIUser)) &&
10331 PHIUser->use_back() == &PN) {
10332 return ReplaceInstUsesWith(PN, UndefValue::get(PN.getType()));
10336 // We sometimes end up with phi cycles that non-obviously end up being the
10337 // same value, for example:
10338 // z = some value; x = phi (y, z); y = phi (x, z)
10339 // where the phi nodes don't necessarily need to be in the same block. Do a
10340 // quick check to see if the PHI node only contains a single non-phi value, if
10341 // so, scan to see if the phi cycle is actually equal to that value.
10343 unsigned InValNo = 0, NumOperandVals = PN.getNumIncomingValues();
10344 // Scan for the first non-phi operand.
10345 while (InValNo != NumOperandVals &&
10346 isa<PHINode>(PN.getIncomingValue(InValNo)))
10349 if (InValNo != NumOperandVals) {
10350 Value *NonPhiInVal = PN.getOperand(InValNo);
10352 // Scan the rest of the operands to see if there are any conflicts, if so
10353 // there is no need to recursively scan other phis.
10354 for (++InValNo; InValNo != NumOperandVals; ++InValNo) {
10355 Value *OpVal = PN.getIncomingValue(InValNo);
10356 if (OpVal != NonPhiInVal && !isa<PHINode>(OpVal))
10360 // If we scanned over all operands, then we have one unique value plus
10361 // phi values. Scan PHI nodes to see if they all merge in each other or
10363 if (InValNo == NumOperandVals) {
10364 SmallPtrSet<PHINode*, 16> ValueEqualPHIs;
10365 if (PHIsEqualValue(&PN, NonPhiInVal, ValueEqualPHIs))
10366 return ReplaceInstUsesWith(PN, NonPhiInVal);
10373 static Value *InsertCastToIntPtrTy(Value *V, const Type *DTy,
10374 Instruction *InsertPoint,
10375 InstCombiner *IC) {
10376 unsigned PtrSize = DTy->getPrimitiveSizeInBits();
10377 unsigned VTySize = V->getType()->getPrimitiveSizeInBits();
10378 // We must cast correctly to the pointer type. Ensure that we
10379 // sign extend the integer value if it is smaller as this is
10380 // used for address computation.
10381 Instruction::CastOps opcode =
10382 (VTySize < PtrSize ? Instruction::SExt :
10383 (VTySize == PtrSize ? Instruction::BitCast : Instruction::Trunc));
10384 return IC->InsertCastBefore(opcode, V, DTy, *InsertPoint);
10388 Instruction *InstCombiner::visitGetElementPtrInst(GetElementPtrInst &GEP) {
10389 Value *PtrOp = GEP.getOperand(0);
10390 // Is it 'getelementptr %P, i32 0' or 'getelementptr %P'
10391 // If so, eliminate the noop.
10392 if (GEP.getNumOperands() == 1)
10393 return ReplaceInstUsesWith(GEP, PtrOp);
10395 if (isa<UndefValue>(GEP.getOperand(0)))
10396 return ReplaceInstUsesWith(GEP, UndefValue::get(GEP.getType()));
10398 bool HasZeroPointerIndex = false;
10399 if (Constant *C = dyn_cast<Constant>(GEP.getOperand(1)))
10400 HasZeroPointerIndex = C->isNullValue();
10402 if (GEP.getNumOperands() == 2 && HasZeroPointerIndex)
10403 return ReplaceInstUsesWith(GEP, PtrOp);
10405 // Eliminate unneeded casts for indices.
10406 bool MadeChange = false;
10408 gep_type_iterator GTI = gep_type_begin(GEP);
10409 for (User::op_iterator i = GEP.op_begin() + 1, e = GEP.op_end();
10410 i != e; ++i, ++GTI) {
10411 if (isa<SequentialType>(*GTI)) {
10412 if (CastInst *CI = dyn_cast<CastInst>(*i)) {
10413 if (CI->getOpcode() == Instruction::ZExt ||
10414 CI->getOpcode() == Instruction::SExt) {
10415 const Type *SrcTy = CI->getOperand(0)->getType();
10416 // We can eliminate a cast from i32 to i64 iff the target
10417 // is a 32-bit pointer target.
10418 if (SrcTy->getPrimitiveSizeInBits() >= TD->getPointerSizeInBits()) {
10420 *i = CI->getOperand(0);
10424 // If we are using a wider index than needed for this platform, shrink it
10425 // to what we need. If narrower, sign-extend it to what we need.
10426 // If the incoming value needs a cast instruction,
10427 // insert it. This explicit cast can make subsequent optimizations more
10430 if (TD->getTypeSizeInBits(Op->getType()) > TD->getPointerSizeInBits()) {
10431 if (Constant *C = dyn_cast<Constant>(Op)) {
10432 *i = ConstantExpr::getTrunc(C, TD->getIntPtrType());
10435 Op = InsertCastBefore(Instruction::Trunc, Op, TD->getIntPtrType(),
10440 } else if (TD->getTypeSizeInBits(Op->getType()) < TD->getPointerSizeInBits()) {
10441 if (Constant *C = dyn_cast<Constant>(Op)) {
10442 *i = ConstantExpr::getSExt(C, TD->getIntPtrType());
10445 Op = InsertCastBefore(Instruction::SExt, Op, TD->getIntPtrType(),
10453 if (MadeChange) return &GEP;
10455 // If this GEP instruction doesn't move the pointer, and if the input operand
10456 // is a bitcast of another pointer, just replace the GEP with a bitcast of the
10457 // real input to the dest type.
10458 if (GEP.hasAllZeroIndices()) {
10459 if (BitCastInst *BCI = dyn_cast<BitCastInst>(GEP.getOperand(0))) {
10460 // If the bitcast is of an allocation, and the allocation will be
10461 // converted to match the type of the cast, don't touch this.
10462 if (isa<AllocationInst>(BCI->getOperand(0))) {
10463 // See if the bitcast simplifies, if so, don't nuke this GEP yet.
10464 if (Instruction *I = visitBitCast(*BCI)) {
10467 BCI->getParent()->getInstList().insert(BCI, I);
10468 ReplaceInstUsesWith(*BCI, I);
10473 return new BitCastInst(BCI->getOperand(0), GEP.getType());
10477 // Combine Indices - If the source pointer to this getelementptr instruction
10478 // is a getelementptr instruction, combine the indices of the two
10479 // getelementptr instructions into a single instruction.
10481 SmallVector<Value*, 8> SrcGEPOperands;
10482 if (User *Src = dyn_castGetElementPtr(PtrOp))
10483 SrcGEPOperands.append(Src->op_begin(), Src->op_end());
10485 if (!SrcGEPOperands.empty()) {
10486 // Note that if our source is a gep chain itself that we wait for that
10487 // chain to be resolved before we perform this transformation. This
10488 // avoids us creating a TON of code in some cases.
10490 if (isa<GetElementPtrInst>(SrcGEPOperands[0]) &&
10491 cast<Instruction>(SrcGEPOperands[0])->getNumOperands() == 2)
10492 return 0; // Wait until our source is folded to completion.
10494 SmallVector<Value*, 8> Indices;
10496 // Find out whether the last index in the source GEP is a sequential idx.
10497 bool EndsWithSequential = false;
10498 for (gep_type_iterator I = gep_type_begin(*cast<User>(PtrOp)),
10499 E = gep_type_end(*cast<User>(PtrOp)); I != E; ++I)
10500 EndsWithSequential = !isa<StructType>(*I);
10502 // Can we combine the two pointer arithmetics offsets?
10503 if (EndsWithSequential) {
10504 // Replace: gep (gep %P, long B), long A, ...
10505 // With: T = long A+B; gep %P, T, ...
10507 Value *Sum, *SO1 = SrcGEPOperands.back(), *GO1 = GEP.getOperand(1);
10508 if (SO1 == Constant::getNullValue(SO1->getType())) {
10510 } else if (GO1 == Constant::getNullValue(GO1->getType())) {
10513 // If they aren't the same type, convert both to an integer of the
10514 // target's pointer size.
10515 if (SO1->getType() != GO1->getType()) {
10516 if (Constant *SO1C = dyn_cast<Constant>(SO1)) {
10517 SO1 = ConstantExpr::getIntegerCast(SO1C, GO1->getType(), true);
10518 } else if (Constant *GO1C = dyn_cast<Constant>(GO1)) {
10519 GO1 = ConstantExpr::getIntegerCast(GO1C, SO1->getType(), true);
10521 unsigned PS = TD->getPointerSizeInBits();
10522 if (TD->getTypeSizeInBits(SO1->getType()) == PS) {
10523 // Convert GO1 to SO1's type.
10524 GO1 = InsertCastToIntPtrTy(GO1, SO1->getType(), &GEP, this);
10526 } else if (TD->getTypeSizeInBits(GO1->getType()) == PS) {
10527 // Convert SO1 to GO1's type.
10528 SO1 = InsertCastToIntPtrTy(SO1, GO1->getType(), &GEP, this);
10530 const Type *PT = TD->getIntPtrType();
10531 SO1 = InsertCastToIntPtrTy(SO1, PT, &GEP, this);
10532 GO1 = InsertCastToIntPtrTy(GO1, PT, &GEP, this);
10536 if (isa<Constant>(SO1) && isa<Constant>(GO1))
10537 Sum = ConstantExpr::getAdd(cast<Constant>(SO1), cast<Constant>(GO1));
10539 Sum = BinaryOperator::CreateAdd(SO1, GO1, PtrOp->getName()+".sum");
10540 InsertNewInstBefore(cast<Instruction>(Sum), GEP);
10544 // Recycle the GEP we already have if possible.
10545 if (SrcGEPOperands.size() == 2) {
10546 GEP.setOperand(0, SrcGEPOperands[0]);
10547 GEP.setOperand(1, Sum);
10550 Indices.insert(Indices.end(), SrcGEPOperands.begin()+1,
10551 SrcGEPOperands.end()-1);
10552 Indices.push_back(Sum);
10553 Indices.insert(Indices.end(), GEP.op_begin()+2, GEP.op_end());
10555 } else if (isa<Constant>(*GEP.idx_begin()) &&
10556 cast<Constant>(*GEP.idx_begin())->isNullValue() &&
10557 SrcGEPOperands.size() != 1) {
10558 // Otherwise we can do the fold if the first index of the GEP is a zero
10559 Indices.insert(Indices.end(), SrcGEPOperands.begin()+1,
10560 SrcGEPOperands.end());
10561 Indices.insert(Indices.end(), GEP.idx_begin()+1, GEP.idx_end());
10564 if (!Indices.empty())
10565 return GetElementPtrInst::Create(SrcGEPOperands[0], Indices.begin(),
10566 Indices.end(), GEP.getName());
10568 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(PtrOp)) {
10569 // GEP of global variable. If all of the indices for this GEP are
10570 // constants, we can promote this to a constexpr instead of an instruction.
10572 // Scan for nonconstants...
10573 SmallVector<Constant*, 8> Indices;
10574 User::op_iterator I = GEP.idx_begin(), E = GEP.idx_end();
10575 for (; I != E && isa<Constant>(*I); ++I)
10576 Indices.push_back(cast<Constant>(*I));
10578 if (I == E) { // If they are all constants...
10579 Constant *CE = ConstantExpr::getGetElementPtr(GV,
10580 &Indices[0],Indices.size());
10582 // Replace all uses of the GEP with the new constexpr...
10583 return ReplaceInstUsesWith(GEP, CE);
10585 } else if (Value *X = getBitCastOperand(PtrOp)) { // Is the operand a cast?
10586 if (!isa<PointerType>(X->getType())) {
10587 // Not interesting. Source pointer must be a cast from pointer.
10588 } else if (HasZeroPointerIndex) {
10589 // transform: GEP (bitcast [10 x i8]* X to [0 x i8]*), i32 0, ...
10590 // into : GEP [10 x i8]* X, i32 0, ...
10592 // This occurs when the program declares an array extern like "int X[];"
10594 const PointerType *CPTy = cast<PointerType>(PtrOp->getType());
10595 const PointerType *XTy = cast<PointerType>(X->getType());
10596 if (const ArrayType *XATy =
10597 dyn_cast<ArrayType>(XTy->getElementType()))
10598 if (const ArrayType *CATy =
10599 dyn_cast<ArrayType>(CPTy->getElementType()))
10600 if (CATy->getElementType() == XATy->getElementType()) {
10601 // At this point, we know that the cast source type is a pointer
10602 // to an array of the same type as the destination pointer
10603 // array. Because the array type is never stepped over (there
10604 // is a leading zero) we can fold the cast into this GEP.
10605 GEP.setOperand(0, X);
10608 } else if (GEP.getNumOperands() == 2) {
10609 // Transform things like:
10610 // %t = getelementptr i32* bitcast ([2 x i32]* %str to i32*), i32 %V
10611 // into: %t1 = getelementptr [2 x i32]* %str, i32 0, i32 %V; bitcast
10612 const Type *SrcElTy = cast<PointerType>(X->getType())->getElementType();
10613 const Type *ResElTy=cast<PointerType>(PtrOp->getType())->getElementType();
10614 if (isa<ArrayType>(SrcElTy) &&
10615 TD->getABITypeSize(cast<ArrayType>(SrcElTy)->getElementType()) ==
10616 TD->getABITypeSize(ResElTy)) {
10618 Idx[0] = Constant::getNullValue(Type::Int32Ty);
10619 Idx[1] = GEP.getOperand(1);
10620 Value *V = InsertNewInstBefore(
10621 GetElementPtrInst::Create(X, Idx, Idx + 2, GEP.getName()), GEP);
10622 // V and GEP are both pointer types --> BitCast
10623 return new BitCastInst(V, GEP.getType());
10626 // Transform things like:
10627 // getelementptr i8* bitcast ([100 x double]* X to i8*), i32 %tmp
10628 // (where tmp = 8*tmp2) into:
10629 // getelementptr [100 x double]* %arr, i32 0, i32 %tmp2; bitcast
10631 if (isa<ArrayType>(SrcElTy) && ResElTy == Type::Int8Ty) {
10632 uint64_t ArrayEltSize =
10633 TD->getABITypeSize(cast<ArrayType>(SrcElTy)->getElementType());
10635 // Check to see if "tmp" is a scale by a multiple of ArrayEltSize. We
10636 // allow either a mul, shift, or constant here.
10638 ConstantInt *Scale = 0;
10639 if (ArrayEltSize == 1) {
10640 NewIdx = GEP.getOperand(1);
10641 Scale = ConstantInt::get(NewIdx->getType(), 1);
10642 } else if (ConstantInt *CI = dyn_cast<ConstantInt>(GEP.getOperand(1))) {
10643 NewIdx = ConstantInt::get(CI->getType(), 1);
10645 } else if (Instruction *Inst =dyn_cast<Instruction>(GEP.getOperand(1))){
10646 if (Inst->getOpcode() == Instruction::Shl &&
10647 isa<ConstantInt>(Inst->getOperand(1))) {
10648 ConstantInt *ShAmt = cast<ConstantInt>(Inst->getOperand(1));
10649 uint32_t ShAmtVal = ShAmt->getLimitedValue(64);
10650 Scale = ConstantInt::get(Inst->getType(), 1ULL << ShAmtVal);
10651 NewIdx = Inst->getOperand(0);
10652 } else if (Inst->getOpcode() == Instruction::Mul &&
10653 isa<ConstantInt>(Inst->getOperand(1))) {
10654 Scale = cast<ConstantInt>(Inst->getOperand(1));
10655 NewIdx = Inst->getOperand(0);
10659 // If the index will be to exactly the right offset with the scale taken
10660 // out, perform the transformation. Note, we don't know whether Scale is
10661 // signed or not. We'll use unsigned version of division/modulo
10662 // operation after making sure Scale doesn't have the sign bit set.
10663 if (Scale && Scale->getSExtValue() >= 0LL &&
10664 Scale->getZExtValue() % ArrayEltSize == 0) {
10665 Scale = ConstantInt::get(Scale->getType(),
10666 Scale->getZExtValue() / ArrayEltSize);
10667 if (Scale->getZExtValue() != 1) {
10668 Constant *C = ConstantExpr::getIntegerCast(Scale, NewIdx->getType(),
10670 Instruction *Sc = BinaryOperator::CreateMul(NewIdx, C, "idxscale");
10671 NewIdx = InsertNewInstBefore(Sc, GEP);
10674 // Insert the new GEP instruction.
10676 Idx[0] = Constant::getNullValue(Type::Int32Ty);
10678 Instruction *NewGEP =
10679 GetElementPtrInst::Create(X, Idx, Idx + 2, GEP.getName());
10680 NewGEP = InsertNewInstBefore(NewGEP, GEP);
10681 // The NewGEP must be pointer typed, so must the old one -> BitCast
10682 return new BitCastInst(NewGEP, GEP.getType());
10691 Instruction *InstCombiner::visitAllocationInst(AllocationInst &AI) {
10692 // Convert: malloc Ty, C - where C is a constant != 1 into: malloc [C x Ty], 1
10693 if (AI.isArrayAllocation()) { // Check C != 1
10694 if (const ConstantInt *C = dyn_cast<ConstantInt>(AI.getArraySize())) {
10695 const Type *NewTy =
10696 ArrayType::get(AI.getAllocatedType(), C->getZExtValue());
10697 AllocationInst *New = 0;
10699 // Create and insert the replacement instruction...
10700 if (isa<MallocInst>(AI))
10701 New = new MallocInst(NewTy, 0, AI.getAlignment(), AI.getName());
10703 assert(isa<AllocaInst>(AI) && "Unknown type of allocation inst!");
10704 New = new AllocaInst(NewTy, 0, AI.getAlignment(), AI.getName());
10707 InsertNewInstBefore(New, AI);
10709 // Scan to the end of the allocation instructions, to skip over a block of
10710 // allocas if possible...
10712 BasicBlock::iterator It = New;
10713 while (isa<AllocationInst>(*It)) ++It;
10715 // Now that I is pointing to the first non-allocation-inst in the block,
10716 // insert our getelementptr instruction...
10718 Value *NullIdx = Constant::getNullValue(Type::Int32Ty);
10722 Value *V = GetElementPtrInst::Create(New, Idx, Idx + 2,
10723 New->getName()+".sub", It);
10725 // Now make everything use the getelementptr instead of the original
10727 return ReplaceInstUsesWith(AI, V);
10728 } else if (isa<UndefValue>(AI.getArraySize())) {
10729 return ReplaceInstUsesWith(AI, Constant::getNullValue(AI.getType()));
10733 // If alloca'ing a zero byte object, replace the alloca with a null pointer.
10734 // Note that we only do this for alloca's, because malloc should allocate and
10735 // return a unique pointer, even for a zero byte allocation.
10736 if (isa<AllocaInst>(AI) && AI.getAllocatedType()->isSized() &&
10737 TD->getABITypeSize(AI.getAllocatedType()) == 0)
10738 return ReplaceInstUsesWith(AI, Constant::getNullValue(AI.getType()));
10743 Instruction *InstCombiner::visitFreeInst(FreeInst &FI) {
10744 Value *Op = FI.getOperand(0);
10746 // free undef -> unreachable.
10747 if (isa<UndefValue>(Op)) {
10748 // Insert a new store to null because we cannot modify the CFG here.
10749 new StoreInst(ConstantInt::getTrue(),
10750 UndefValue::get(PointerType::getUnqual(Type::Int1Ty)), &FI);
10751 return EraseInstFromFunction(FI);
10754 // If we have 'free null' delete the instruction. This can happen in stl code
10755 // when lots of inlining happens.
10756 if (isa<ConstantPointerNull>(Op))
10757 return EraseInstFromFunction(FI);
10759 // Change free <ty>* (cast <ty2>* X to <ty>*) into free <ty2>* X
10760 if (BitCastInst *CI = dyn_cast<BitCastInst>(Op)) {
10761 FI.setOperand(0, CI->getOperand(0));
10765 // Change free (gep X, 0,0,0,0) into free(X)
10766 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(Op)) {
10767 if (GEPI->hasAllZeroIndices()) {
10768 AddToWorkList(GEPI);
10769 FI.setOperand(0, GEPI->getOperand(0));
10774 // Change free(malloc) into nothing, if the malloc has a single use.
10775 if (MallocInst *MI = dyn_cast<MallocInst>(Op))
10776 if (MI->hasOneUse()) {
10777 EraseInstFromFunction(FI);
10778 return EraseInstFromFunction(*MI);
10785 /// InstCombineLoadCast - Fold 'load (cast P)' -> cast (load P)' when possible.
10786 static Instruction *InstCombineLoadCast(InstCombiner &IC, LoadInst &LI,
10787 const TargetData *TD) {
10788 User *CI = cast<User>(LI.getOperand(0));
10789 Value *CastOp = CI->getOperand(0);
10791 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(CI)) {
10792 // Instead of loading constant c string, use corresponding integer value
10793 // directly if string length is small enough.
10795 if (GetConstantStringInfo(CE->getOperand(0), Str) && !Str.empty()) {
10796 unsigned len = Str.length();
10797 const Type *Ty = cast<PointerType>(CE->getType())->getElementType();
10798 unsigned numBits = Ty->getPrimitiveSizeInBits();
10799 // Replace LI with immediate integer store.
10800 if ((numBits >> 3) == len + 1) {
10801 APInt StrVal(numBits, 0);
10802 APInt SingleChar(numBits, 0);
10803 if (TD->isLittleEndian()) {
10804 for (signed i = len-1; i >= 0; i--) {
10805 SingleChar = (uint64_t) Str[i];
10806 StrVal = (StrVal << 8) | SingleChar;
10809 for (unsigned i = 0; i < len; i++) {
10810 SingleChar = (uint64_t) Str[i];
10811 StrVal = (StrVal << 8) | SingleChar;
10813 // Append NULL at the end.
10815 StrVal = (StrVal << 8) | SingleChar;
10817 Value *NL = ConstantInt::get(StrVal);
10818 return IC.ReplaceInstUsesWith(LI, NL);
10823 const Type *DestPTy = cast<PointerType>(CI->getType())->getElementType();
10824 if (const PointerType *SrcTy = dyn_cast<PointerType>(CastOp->getType())) {
10825 const Type *SrcPTy = SrcTy->getElementType();
10827 if (DestPTy->isInteger() || isa<PointerType>(DestPTy) ||
10828 isa<VectorType>(DestPTy)) {
10829 // If the source is an array, the code below will not succeed. Check to
10830 // see if a trivial 'gep P, 0, 0' will help matters. Only do this for
10832 if (const ArrayType *ASrcTy = dyn_cast<ArrayType>(SrcPTy))
10833 if (Constant *CSrc = dyn_cast<Constant>(CastOp))
10834 if (ASrcTy->getNumElements() != 0) {
10836 Idxs[0] = Idxs[1] = Constant::getNullValue(Type::Int32Ty);
10837 CastOp = ConstantExpr::getGetElementPtr(CSrc, Idxs, 2);
10838 SrcTy = cast<PointerType>(CastOp->getType());
10839 SrcPTy = SrcTy->getElementType();
10842 if ((SrcPTy->isInteger() || isa<PointerType>(SrcPTy) ||
10843 isa<VectorType>(SrcPTy)) &&
10844 // Do not allow turning this into a load of an integer, which is then
10845 // casted to a pointer, this pessimizes pointer analysis a lot.
10846 (isa<PointerType>(SrcPTy) == isa<PointerType>(LI.getType())) &&
10847 IC.getTargetData().getTypeSizeInBits(SrcPTy) ==
10848 IC.getTargetData().getTypeSizeInBits(DestPTy)) {
10850 // Okay, we are casting from one integer or pointer type to another of
10851 // the same size. Instead of casting the pointer before the load, cast
10852 // the result of the loaded value.
10853 Value *NewLoad = IC.InsertNewInstBefore(new LoadInst(CastOp,
10855 LI.isVolatile()),LI);
10856 // Now cast the result of the load.
10857 return new BitCastInst(NewLoad, LI.getType());
10864 /// isSafeToLoadUnconditionally - Return true if we know that executing a load
10865 /// from this value cannot trap. If it is not obviously safe to load from the
10866 /// specified pointer, we do a quick local scan of the basic block containing
10867 /// ScanFrom, to determine if the address is already accessed.
10868 static bool isSafeToLoadUnconditionally(Value *V, Instruction *ScanFrom) {
10869 // If it is an alloca it is always safe to load from.
10870 if (isa<AllocaInst>(V)) return true;
10872 // If it is a global variable it is mostly safe to load from.
10873 if (const GlobalValue *GV = dyn_cast<GlobalVariable>(V))
10874 // Don't try to evaluate aliases. External weak GV can be null.
10875 return !isa<GlobalAlias>(GV) && !GV->hasExternalWeakLinkage();
10877 // Otherwise, be a little bit agressive by scanning the local block where we
10878 // want to check to see if the pointer is already being loaded or stored
10879 // from/to. If so, the previous load or store would have already trapped,
10880 // so there is no harm doing an extra load (also, CSE will later eliminate
10881 // the load entirely).
10882 BasicBlock::iterator BBI = ScanFrom, E = ScanFrom->getParent()->begin();
10887 // If we see a free or a call (which might do a free) the pointer could be
10889 if (isa<FreeInst>(BBI) || isa<CallInst>(BBI))
10892 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) {
10893 if (LI->getOperand(0) == V) return true;
10894 } else if (StoreInst *SI = dyn_cast<StoreInst>(BBI)) {
10895 if (SI->getOperand(1) == V) return true;
10902 Instruction *InstCombiner::visitLoadInst(LoadInst &LI) {
10903 Value *Op = LI.getOperand(0);
10905 // Attempt to improve the alignment.
10906 unsigned KnownAlign = GetOrEnforceKnownAlignment(Op);
10908 (LI.getAlignment() == 0 ? TD->getABITypeAlignment(LI.getType()) :
10909 LI.getAlignment()))
10910 LI.setAlignment(KnownAlign);
10912 // load (cast X) --> cast (load X) iff safe
10913 if (isa<CastInst>(Op))
10914 if (Instruction *Res = InstCombineLoadCast(*this, LI, TD))
10917 // None of the following transforms are legal for volatile loads.
10918 if (LI.isVolatile()) return 0;
10920 // Do really simple store-to-load forwarding and load CSE, to catch cases
10921 // where there are several consequtive memory accesses to the same location,
10922 // separated by a few arithmetic operations.
10923 BasicBlock::iterator BBI = &LI;
10924 if (Value *AvailableVal = FindAvailableLoadedValue(Op, LI.getParent(), BBI,6))
10925 return ReplaceInstUsesWith(LI, AvailableVal);
10927 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(Op)) {
10928 const Value *GEPI0 = GEPI->getOperand(0);
10929 // TODO: Consider a target hook for valid address spaces for this xform.
10930 if (isa<ConstantPointerNull>(GEPI0) &&
10931 cast<PointerType>(GEPI0->getType())->getAddressSpace() == 0) {
10932 // Insert a new store to null instruction before the load to indicate
10933 // that this code is not reachable. We do this instead of inserting
10934 // an unreachable instruction directly because we cannot modify the
10936 new StoreInst(UndefValue::get(LI.getType()),
10937 Constant::getNullValue(Op->getType()), &LI);
10938 return ReplaceInstUsesWith(LI, UndefValue::get(LI.getType()));
10942 if (Constant *C = dyn_cast<Constant>(Op)) {
10943 // load null/undef -> undef
10944 // TODO: Consider a target hook for valid address spaces for this xform.
10945 if (isa<UndefValue>(C) || (C->isNullValue() &&
10946 cast<PointerType>(Op->getType())->getAddressSpace() == 0)) {
10947 // Insert a new store to null instruction before the load to indicate that
10948 // this code is not reachable. We do this instead of inserting an
10949 // unreachable instruction directly because we cannot modify the CFG.
10950 new StoreInst(UndefValue::get(LI.getType()),
10951 Constant::getNullValue(Op->getType()), &LI);
10952 return ReplaceInstUsesWith(LI, UndefValue::get(LI.getType()));
10955 // Instcombine load (constant global) into the value loaded.
10956 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(Op))
10957 if (GV->isConstant() && !GV->isDeclaration())
10958 return ReplaceInstUsesWith(LI, GV->getInitializer());
10960 // Instcombine load (constantexpr_GEP global, 0, ...) into the value loaded.
10961 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Op)) {
10962 if (CE->getOpcode() == Instruction::GetElementPtr) {
10963 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(CE->getOperand(0)))
10964 if (GV->isConstant() && !GV->isDeclaration())
10966 ConstantFoldLoadThroughGEPConstantExpr(GV->getInitializer(), CE))
10967 return ReplaceInstUsesWith(LI, V);
10968 if (CE->getOperand(0)->isNullValue()) {
10969 // Insert a new store to null instruction before the load to indicate
10970 // that this code is not reachable. We do this instead of inserting
10971 // an unreachable instruction directly because we cannot modify the
10973 new StoreInst(UndefValue::get(LI.getType()),
10974 Constant::getNullValue(Op->getType()), &LI);
10975 return ReplaceInstUsesWith(LI, UndefValue::get(LI.getType()));
10978 } else if (CE->isCast()) {
10979 if (Instruction *Res = InstCombineLoadCast(*this, LI, TD))
10985 // If this load comes from anywhere in a constant global, and if the global
10986 // is all undef or zero, we know what it loads.
10987 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(Op->getUnderlyingObject())){
10988 if (GV->isConstant() && GV->hasInitializer()) {
10989 if (GV->getInitializer()->isNullValue())
10990 return ReplaceInstUsesWith(LI, Constant::getNullValue(LI.getType()));
10991 else if (isa<UndefValue>(GV->getInitializer()))
10992 return ReplaceInstUsesWith(LI, UndefValue::get(LI.getType()));
10996 if (Op->hasOneUse()) {
10997 // Change select and PHI nodes to select values instead of addresses: this
10998 // helps alias analysis out a lot, allows many others simplifications, and
10999 // exposes redundancy in the code.
11001 // Note that we cannot do the transformation unless we know that the
11002 // introduced loads cannot trap! Something like this is valid as long as
11003 // the condition is always false: load (select bool %C, int* null, int* %G),
11004 // but it would not be valid if we transformed it to load from null
11005 // unconditionally.
11007 if (SelectInst *SI = dyn_cast<SelectInst>(Op)) {
11008 // load (select (Cond, &V1, &V2)) --> select(Cond, load &V1, load &V2).
11009 if (isSafeToLoadUnconditionally(SI->getOperand(1), SI) &&
11010 isSafeToLoadUnconditionally(SI->getOperand(2), SI)) {
11011 Value *V1 = InsertNewInstBefore(new LoadInst(SI->getOperand(1),
11012 SI->getOperand(1)->getName()+".val"), LI);
11013 Value *V2 = InsertNewInstBefore(new LoadInst(SI->getOperand(2),
11014 SI->getOperand(2)->getName()+".val"), LI);
11015 return SelectInst::Create(SI->getCondition(), V1, V2);
11018 // load (select (cond, null, P)) -> load P
11019 if (Constant *C = dyn_cast<Constant>(SI->getOperand(1)))
11020 if (C->isNullValue()) {
11021 LI.setOperand(0, SI->getOperand(2));
11025 // load (select (cond, P, null)) -> load P
11026 if (Constant *C = dyn_cast<Constant>(SI->getOperand(2)))
11027 if (C->isNullValue()) {
11028 LI.setOperand(0, SI->getOperand(1));
11036 /// InstCombineStoreToCast - Fold store V, (cast P) -> store (cast V), P
11038 static Instruction *InstCombineStoreToCast(InstCombiner &IC, StoreInst &SI) {
11039 User *CI = cast<User>(SI.getOperand(1));
11040 Value *CastOp = CI->getOperand(0);
11042 const Type *DestPTy = cast<PointerType>(CI->getType())->getElementType();
11043 if (const PointerType *SrcTy = dyn_cast<PointerType>(CastOp->getType())) {
11044 const Type *SrcPTy = SrcTy->getElementType();
11046 if (DestPTy->isInteger() || isa<PointerType>(DestPTy)) {
11047 // If the source is an array, the code below will not succeed. Check to
11048 // see if a trivial 'gep P, 0, 0' will help matters. Only do this for
11050 if (const ArrayType *ASrcTy = dyn_cast<ArrayType>(SrcPTy))
11051 if (Constant *CSrc = dyn_cast<Constant>(CastOp))
11052 if (ASrcTy->getNumElements() != 0) {
11054 Idxs[0] = Idxs[1] = Constant::getNullValue(Type::Int32Ty);
11055 CastOp = ConstantExpr::getGetElementPtr(CSrc, Idxs, 2);
11056 SrcTy = cast<PointerType>(CastOp->getType());
11057 SrcPTy = SrcTy->getElementType();
11060 if ((SrcPTy->isInteger() || isa<PointerType>(SrcPTy)) &&
11061 IC.getTargetData().getTypeSizeInBits(SrcPTy) ==
11062 IC.getTargetData().getTypeSizeInBits(DestPTy)) {
11064 // Okay, we are casting from one integer or pointer type to another of
11065 // the same size. Instead of casting the pointer before
11066 // the store, cast the value to be stored.
11068 Value *SIOp0 = SI.getOperand(0);
11069 Instruction::CastOps opcode = Instruction::BitCast;
11070 const Type* CastSrcTy = SIOp0->getType();
11071 const Type* CastDstTy = SrcPTy;
11072 if (isa<PointerType>(CastDstTy)) {
11073 if (CastSrcTy->isInteger())
11074 opcode = Instruction::IntToPtr;
11075 } else if (isa<IntegerType>(CastDstTy)) {
11076 if (isa<PointerType>(SIOp0->getType()))
11077 opcode = Instruction::PtrToInt;
11079 if (Constant *C = dyn_cast<Constant>(SIOp0))
11080 NewCast = ConstantExpr::getCast(opcode, C, CastDstTy);
11082 NewCast = IC.InsertNewInstBefore(
11083 CastInst::Create(opcode, SIOp0, CastDstTy, SIOp0->getName()+".c"),
11085 return new StoreInst(NewCast, CastOp);
11092 /// equivalentAddressValues - Test if A and B will obviously have the same
11093 /// value. This includes recognizing that %t0 and %t1 will have the same
11094 /// value in code like this:
11095 /// %t0 = getelementptr @a, 0, 3
11096 /// store i32 0, i32* %t0
11097 /// %t1 = getelementptr @a, 0, 3
11098 /// %t2 = load i32* %t1
11100 static bool equivalentAddressValues(Value *A, Value *B) {
11101 // Test if the values are trivially equivalent.
11102 if (A == B) return true;
11104 // Test if the values come form identical arithmetic instructions.
11105 if (isa<BinaryOperator>(A) ||
11106 isa<CastInst>(A) ||
11108 isa<GetElementPtrInst>(A))
11109 if (Instruction *BI = dyn_cast<Instruction>(B))
11110 if (cast<Instruction>(A)->isIdenticalTo(BI))
11113 // Otherwise they may not be equivalent.
11117 Instruction *InstCombiner::visitStoreInst(StoreInst &SI) {
11118 Value *Val = SI.getOperand(0);
11119 Value *Ptr = SI.getOperand(1);
11121 if (isa<UndefValue>(Ptr)) { // store X, undef -> noop (even if volatile)
11122 EraseInstFromFunction(SI);
11127 // If the RHS is an alloca with a single use, zapify the store, making the
11129 if (Ptr->hasOneUse() && !SI.isVolatile()) {
11130 if (isa<AllocaInst>(Ptr)) {
11131 EraseInstFromFunction(SI);
11136 if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Ptr))
11137 if (isa<AllocaInst>(GEP->getOperand(0)) &&
11138 GEP->getOperand(0)->hasOneUse()) {
11139 EraseInstFromFunction(SI);
11145 // Attempt to improve the alignment.
11146 unsigned KnownAlign = GetOrEnforceKnownAlignment(Ptr);
11148 (SI.getAlignment() == 0 ? TD->getABITypeAlignment(Val->getType()) :
11149 SI.getAlignment()))
11150 SI.setAlignment(KnownAlign);
11152 // Do really simple DSE, to catch cases where there are several consequtive
11153 // stores to the same location, separated by a few arithmetic operations. This
11154 // situation often occurs with bitfield accesses.
11155 BasicBlock::iterator BBI = &SI;
11156 for (unsigned ScanInsts = 6; BBI != SI.getParent()->begin() && ScanInsts;
11160 if (StoreInst *PrevSI = dyn_cast<StoreInst>(BBI)) {
11161 // Prev store isn't volatile, and stores to the same location?
11162 if (!PrevSI->isVolatile() &&equivalentAddressValues(PrevSI->getOperand(1),
11163 SI.getOperand(1))) {
11166 EraseInstFromFunction(*PrevSI);
11172 // If this is a load, we have to stop. However, if the loaded value is from
11173 // the pointer we're loading and is producing the pointer we're storing,
11174 // then *this* store is dead (X = load P; store X -> P).
11175 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) {
11176 if (LI == Val && equivalentAddressValues(LI->getOperand(0), Ptr) &&
11177 !SI.isVolatile()) {
11178 EraseInstFromFunction(SI);
11182 // Otherwise, this is a load from some other location. Stores before it
11183 // may not be dead.
11187 // Don't skip over loads or things that can modify memory.
11188 if (BBI->mayWriteToMemory() || BBI->mayReadFromMemory())
11193 if (SI.isVolatile()) return 0; // Don't hack volatile stores.
11195 // store X, null -> turns into 'unreachable' in SimplifyCFG
11196 if (isa<ConstantPointerNull>(Ptr)) {
11197 if (!isa<UndefValue>(Val)) {
11198 SI.setOperand(0, UndefValue::get(Val->getType()));
11199 if (Instruction *U = dyn_cast<Instruction>(Val))
11200 AddToWorkList(U); // Dropped a use.
11203 return 0; // Do not modify these!
11206 // store undef, Ptr -> noop
11207 if (isa<UndefValue>(Val)) {
11208 EraseInstFromFunction(SI);
11213 // If the pointer destination is a cast, see if we can fold the cast into the
11215 if (isa<CastInst>(Ptr))
11216 if (Instruction *Res = InstCombineStoreToCast(*this, SI))
11218 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Ptr))
11220 if (Instruction *Res = InstCombineStoreToCast(*this, SI))
11224 // If this store is the last instruction in the basic block, and if the block
11225 // ends with an unconditional branch, try to move it to the successor block.
11227 if (BranchInst *BI = dyn_cast<BranchInst>(BBI))
11228 if (BI->isUnconditional())
11229 if (SimplifyStoreAtEndOfBlock(SI))
11230 return 0; // xform done!
11235 /// SimplifyStoreAtEndOfBlock - Turn things like:
11236 /// if () { *P = v1; } else { *P = v2 }
11237 /// into a phi node with a store in the successor.
11239 /// Simplify things like:
11240 /// *P = v1; if () { *P = v2; }
11241 /// into a phi node with a store in the successor.
11243 bool InstCombiner::SimplifyStoreAtEndOfBlock(StoreInst &SI) {
11244 BasicBlock *StoreBB = SI.getParent();
11246 // Check to see if the successor block has exactly two incoming edges. If
11247 // so, see if the other predecessor contains a store to the same location.
11248 // if so, insert a PHI node (if needed) and move the stores down.
11249 BasicBlock *DestBB = StoreBB->getTerminator()->getSuccessor(0);
11251 // Determine whether Dest has exactly two predecessors and, if so, compute
11252 // the other predecessor.
11253 pred_iterator PI = pred_begin(DestBB);
11254 BasicBlock *OtherBB = 0;
11255 if (*PI != StoreBB)
11258 if (PI == pred_end(DestBB))
11261 if (*PI != StoreBB) {
11266 if (++PI != pred_end(DestBB))
11269 // Bail out if all the relevant blocks aren't distinct (this can happen,
11270 // for example, if SI is in an infinite loop)
11271 if (StoreBB == DestBB || OtherBB == DestBB)
11274 // Verify that the other block ends in a branch and is not otherwise empty.
11275 BasicBlock::iterator BBI = OtherBB->getTerminator();
11276 BranchInst *OtherBr = dyn_cast<BranchInst>(BBI);
11277 if (!OtherBr || BBI == OtherBB->begin())
11280 // If the other block ends in an unconditional branch, check for the 'if then
11281 // else' case. there is an instruction before the branch.
11282 StoreInst *OtherStore = 0;
11283 if (OtherBr->isUnconditional()) {
11284 // If this isn't a store, or isn't a store to the same location, bail out.
11286 OtherStore = dyn_cast<StoreInst>(BBI);
11287 if (!OtherStore || OtherStore->getOperand(1) != SI.getOperand(1))
11290 // Otherwise, the other block ended with a conditional branch. If one of the
11291 // destinations is StoreBB, then we have the if/then case.
11292 if (OtherBr->getSuccessor(0) != StoreBB &&
11293 OtherBr->getSuccessor(1) != StoreBB)
11296 // Okay, we know that OtherBr now goes to Dest and StoreBB, so this is an
11297 // if/then triangle. See if there is a store to the same ptr as SI that
11298 // lives in OtherBB.
11300 // Check to see if we find the matching store.
11301 if ((OtherStore = dyn_cast<StoreInst>(BBI))) {
11302 if (OtherStore->getOperand(1) != SI.getOperand(1))
11306 // If we find something that may be using or overwriting the stored
11307 // value, or if we run out of instructions, we can't do the xform.
11308 if (BBI->mayReadFromMemory() || BBI->mayWriteToMemory() ||
11309 BBI == OtherBB->begin())
11313 // In order to eliminate the store in OtherBr, we have to
11314 // make sure nothing reads or overwrites the stored value in
11316 for (BasicBlock::iterator I = StoreBB->begin(); &*I != &SI; ++I) {
11317 // FIXME: This should really be AA driven.
11318 if (I->mayReadFromMemory() || I->mayWriteToMemory())
11323 // Insert a PHI node now if we need it.
11324 Value *MergedVal = OtherStore->getOperand(0);
11325 if (MergedVal != SI.getOperand(0)) {
11326 PHINode *PN = PHINode::Create(MergedVal->getType(), "storemerge");
11327 PN->reserveOperandSpace(2);
11328 PN->addIncoming(SI.getOperand(0), SI.getParent());
11329 PN->addIncoming(OtherStore->getOperand(0), OtherBB);
11330 MergedVal = InsertNewInstBefore(PN, DestBB->front());
11333 // Advance to a place where it is safe to insert the new store and
11335 BBI = DestBB->getFirstNonPHI();
11336 InsertNewInstBefore(new StoreInst(MergedVal, SI.getOperand(1),
11337 OtherStore->isVolatile()), *BBI);
11339 // Nuke the old stores.
11340 EraseInstFromFunction(SI);
11341 EraseInstFromFunction(*OtherStore);
11347 Instruction *InstCombiner::visitBranchInst(BranchInst &BI) {
11348 // Change br (not X), label True, label False to: br X, label False, True
11350 BasicBlock *TrueDest;
11351 BasicBlock *FalseDest;
11352 if (match(&BI, m_Br(m_Not(m_Value(X)), TrueDest, FalseDest)) &&
11353 !isa<Constant>(X)) {
11354 // Swap Destinations and condition...
11355 BI.setCondition(X);
11356 BI.setSuccessor(0, FalseDest);
11357 BI.setSuccessor(1, TrueDest);
11361 // Cannonicalize fcmp_one -> fcmp_oeq
11362 FCmpInst::Predicate FPred; Value *Y;
11363 if (match(&BI, m_Br(m_FCmp(FPred, m_Value(X), m_Value(Y)),
11364 TrueDest, FalseDest)))
11365 if ((FPred == FCmpInst::FCMP_ONE || FPred == FCmpInst::FCMP_OLE ||
11366 FPred == FCmpInst::FCMP_OGE) && BI.getCondition()->hasOneUse()) {
11367 FCmpInst *I = cast<FCmpInst>(BI.getCondition());
11368 FCmpInst::Predicate NewPred = FCmpInst::getInversePredicate(FPred);
11369 Instruction *NewSCC = new FCmpInst(NewPred, X, Y, "", I);
11370 NewSCC->takeName(I);
11371 // Swap Destinations and condition...
11372 BI.setCondition(NewSCC);
11373 BI.setSuccessor(0, FalseDest);
11374 BI.setSuccessor(1, TrueDest);
11375 RemoveFromWorkList(I);
11376 I->eraseFromParent();
11377 AddToWorkList(NewSCC);
11381 // Cannonicalize icmp_ne -> icmp_eq
11382 ICmpInst::Predicate IPred;
11383 if (match(&BI, m_Br(m_ICmp(IPred, m_Value(X), m_Value(Y)),
11384 TrueDest, FalseDest)))
11385 if ((IPred == ICmpInst::ICMP_NE || IPred == ICmpInst::ICMP_ULE ||
11386 IPred == ICmpInst::ICMP_SLE || IPred == ICmpInst::ICMP_UGE ||
11387 IPred == ICmpInst::ICMP_SGE) && BI.getCondition()->hasOneUse()) {
11388 ICmpInst *I = cast<ICmpInst>(BI.getCondition());
11389 ICmpInst::Predicate NewPred = ICmpInst::getInversePredicate(IPred);
11390 Instruction *NewSCC = new ICmpInst(NewPred, X, Y, "", I);
11391 NewSCC->takeName(I);
11392 // Swap Destinations and condition...
11393 BI.setCondition(NewSCC);
11394 BI.setSuccessor(0, FalseDest);
11395 BI.setSuccessor(1, TrueDest);
11396 RemoveFromWorkList(I);
11397 I->eraseFromParent();;
11398 AddToWorkList(NewSCC);
11405 Instruction *InstCombiner::visitSwitchInst(SwitchInst &SI) {
11406 Value *Cond = SI.getCondition();
11407 if (Instruction *I = dyn_cast<Instruction>(Cond)) {
11408 if (I->getOpcode() == Instruction::Add)
11409 if (ConstantInt *AddRHS = dyn_cast<ConstantInt>(I->getOperand(1))) {
11410 // change 'switch (X+4) case 1:' into 'switch (X) case -3'
11411 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2)
11412 SI.setOperand(i,ConstantExpr::getSub(cast<Constant>(SI.getOperand(i)),
11414 SI.setOperand(0, I->getOperand(0));
11422 Instruction *InstCombiner::visitExtractValueInst(ExtractValueInst &EV) {
11423 Value *Agg = EV.getAggregateOperand();
11425 if (!EV.hasIndices())
11426 return ReplaceInstUsesWith(EV, Agg);
11428 if (Constant *C = dyn_cast<Constant>(Agg)) {
11429 if (isa<UndefValue>(C))
11430 return ReplaceInstUsesWith(EV, UndefValue::get(EV.getType()));
11432 if (isa<ConstantAggregateZero>(C))
11433 return ReplaceInstUsesWith(EV, Constant::getNullValue(EV.getType()));
11435 if (isa<ConstantArray>(C) || isa<ConstantStruct>(C)) {
11436 // Extract the element indexed by the first index out of the constant
11437 Value *V = C->getOperand(*EV.idx_begin());
11438 if (EV.getNumIndices() > 1)
11439 // Extract the remaining indices out of the constant indexed by the
11441 return ExtractValueInst::Create(V, EV.idx_begin() + 1, EV.idx_end());
11443 return ReplaceInstUsesWith(EV, V);
11445 return 0; // Can't handle other constants
11447 if (InsertValueInst *IV = dyn_cast<InsertValueInst>(Agg)) {
11448 // We're extracting from an insertvalue instruction, compare the indices
11449 const unsigned *exti, *exte, *insi, *inse;
11450 for (exti = EV.idx_begin(), insi = IV->idx_begin(),
11451 exte = EV.idx_end(), inse = IV->idx_end();
11452 exti != exte && insi != inse;
11454 if (*insi != *exti)
11455 // The insert and extract both reference distinctly different elements.
11456 // This means the extract is not influenced by the insert, and we can
11457 // replace the aggregate operand of the extract with the aggregate
11458 // operand of the insert. i.e., replace
11459 // %I = insertvalue { i32, { i32 } } %A, { i32 } { i32 42 }, 1
11460 // %E = extractvalue { i32, { i32 } } %I, 0
11462 // %E = extractvalue { i32, { i32 } } %A, 0
11463 return ExtractValueInst::Create(IV->getAggregateOperand(),
11464 EV.idx_begin(), EV.idx_end());
11466 if (exti == exte && insi == inse)
11467 // Both iterators are at the end: Index lists are identical. Replace
11468 // %B = insertvalue { i32, { i32 } } %A, i32 42, 1, 0
11469 // %C = extractvalue { i32, { i32 } } %B, 1, 0
11471 return ReplaceInstUsesWith(EV, IV->getInsertedValueOperand());
11472 if (exti == exte) {
11473 // The extract list is a prefix of the insert list. i.e. replace
11474 // %I = insertvalue { i32, { i32 } } %A, i32 42, 1, 0
11475 // %E = extractvalue { i32, { i32 } } %I, 1
11477 // %X = extractvalue { i32, { i32 } } %A, 1
11478 // %E = insertvalue { i32 } %X, i32 42, 0
11479 // by switching the order of the insert and extract (though the
11480 // insertvalue should be left in, since it may have other uses).
11481 Value *NewEV = InsertNewInstBefore(
11482 ExtractValueInst::Create(IV->getAggregateOperand(),
11483 EV.idx_begin(), EV.idx_end()),
11485 return InsertValueInst::Create(NewEV, IV->getInsertedValueOperand(),
11489 // The insert list is a prefix of the extract list
11490 // We can simply remove the common indices from the extract and make it
11491 // operate on the inserted value instead of the insertvalue result.
11493 // %I = insertvalue { i32, { i32 } } %A, { i32 } { i32 42 }, 1
11494 // %E = extractvalue { i32, { i32 } } %I, 1, 0
11496 // %E extractvalue { i32 } { i32 42 }, 0
11497 return ExtractValueInst::Create(IV->getInsertedValueOperand(),
11500 // Can't simplify extracts from other values. Note that nested extracts are
11501 // already simplified implicitely by the above (extract ( extract (insert) )
11502 // will be translated into extract ( insert ( extract ) ) first and then just
11503 // the value inserted, if appropriate).
11507 /// CheapToScalarize - Return true if the value is cheaper to scalarize than it
11508 /// is to leave as a vector operation.
11509 static bool CheapToScalarize(Value *V, bool isConstant) {
11510 if (isa<ConstantAggregateZero>(V))
11512 if (ConstantVector *C = dyn_cast<ConstantVector>(V)) {
11513 if (isConstant) return true;
11514 // If all elts are the same, we can extract.
11515 Constant *Op0 = C->getOperand(0);
11516 for (unsigned i = 1; i < C->getNumOperands(); ++i)
11517 if (C->getOperand(i) != Op0)
11521 Instruction *I = dyn_cast<Instruction>(V);
11522 if (!I) return false;
11524 // Insert element gets simplified to the inserted element or is deleted if
11525 // this is constant idx extract element and its a constant idx insertelt.
11526 if (I->getOpcode() == Instruction::InsertElement && isConstant &&
11527 isa<ConstantInt>(I->getOperand(2)))
11529 if (I->getOpcode() == Instruction::Load && I->hasOneUse())
11531 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(I))
11532 if (BO->hasOneUse() &&
11533 (CheapToScalarize(BO->getOperand(0), isConstant) ||
11534 CheapToScalarize(BO->getOperand(1), isConstant)))
11536 if (CmpInst *CI = dyn_cast<CmpInst>(I))
11537 if (CI->hasOneUse() &&
11538 (CheapToScalarize(CI->getOperand(0), isConstant) ||
11539 CheapToScalarize(CI->getOperand(1), isConstant)))
11545 /// Read and decode a shufflevector mask.
11547 /// It turns undef elements into values that are larger than the number of
11548 /// elements in the input.
11549 static std::vector<unsigned> getShuffleMask(const ShuffleVectorInst *SVI) {
11550 unsigned NElts = SVI->getType()->getNumElements();
11551 if (isa<ConstantAggregateZero>(SVI->getOperand(2)))
11552 return std::vector<unsigned>(NElts, 0);
11553 if (isa<UndefValue>(SVI->getOperand(2)))
11554 return std::vector<unsigned>(NElts, 2*NElts);
11556 std::vector<unsigned> Result;
11557 const ConstantVector *CP = cast<ConstantVector>(SVI->getOperand(2));
11558 for (User::const_op_iterator i = CP->op_begin(), e = CP->op_end(); i!=e; ++i)
11559 if (isa<UndefValue>(*i))
11560 Result.push_back(NElts*2); // undef -> 8
11562 Result.push_back(cast<ConstantInt>(*i)->getZExtValue());
11566 /// FindScalarElement - Given a vector and an element number, see if the scalar
11567 /// value is already around as a register, for example if it were inserted then
11568 /// extracted from the vector.
11569 static Value *FindScalarElement(Value *V, unsigned EltNo) {
11570 assert(isa<VectorType>(V->getType()) && "Not looking at a vector?");
11571 const VectorType *PTy = cast<VectorType>(V->getType());
11572 unsigned Width = PTy->getNumElements();
11573 if (EltNo >= Width) // Out of range access.
11574 return UndefValue::get(PTy->getElementType());
11576 if (isa<UndefValue>(V))
11577 return UndefValue::get(PTy->getElementType());
11578 else if (isa<ConstantAggregateZero>(V))
11579 return Constant::getNullValue(PTy->getElementType());
11580 else if (ConstantVector *CP = dyn_cast<ConstantVector>(V))
11581 return CP->getOperand(EltNo);
11582 else if (InsertElementInst *III = dyn_cast<InsertElementInst>(V)) {
11583 // If this is an insert to a variable element, we don't know what it is.
11584 if (!isa<ConstantInt>(III->getOperand(2)))
11586 unsigned IIElt = cast<ConstantInt>(III->getOperand(2))->getZExtValue();
11588 // If this is an insert to the element we are looking for, return the
11590 if (EltNo == IIElt)
11591 return III->getOperand(1);
11593 // Otherwise, the insertelement doesn't modify the value, recurse on its
11595 return FindScalarElement(III->getOperand(0), EltNo);
11596 } else if (ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(V)) {
11597 unsigned LHSWidth =
11598 cast<VectorType>(SVI->getOperand(0)->getType())->getNumElements();
11599 unsigned InEl = getShuffleMask(SVI)[EltNo];
11600 if (InEl < LHSWidth)
11601 return FindScalarElement(SVI->getOperand(0), InEl);
11602 else if (InEl < LHSWidth*2)
11603 return FindScalarElement(SVI->getOperand(1), InEl - LHSWidth);
11605 return UndefValue::get(PTy->getElementType());
11608 // Otherwise, we don't know.
11612 Instruction *InstCombiner::visitExtractElementInst(ExtractElementInst &EI) {
11613 // If vector val is undef, replace extract with scalar undef.
11614 if (isa<UndefValue>(EI.getOperand(0)))
11615 return ReplaceInstUsesWith(EI, UndefValue::get(EI.getType()));
11617 // If vector val is constant 0, replace extract with scalar 0.
11618 if (isa<ConstantAggregateZero>(EI.getOperand(0)))
11619 return ReplaceInstUsesWith(EI, Constant::getNullValue(EI.getType()));
11621 if (ConstantVector *C = dyn_cast<ConstantVector>(EI.getOperand(0))) {
11622 // If vector val is constant with all elements the same, replace EI with
11623 // that element. When the elements are not identical, we cannot replace yet
11624 // (we do that below, but only when the index is constant).
11625 Constant *op0 = C->getOperand(0);
11626 for (unsigned i = 1; i < C->getNumOperands(); ++i)
11627 if (C->getOperand(i) != op0) {
11632 return ReplaceInstUsesWith(EI, op0);
11635 // If extracting a specified index from the vector, see if we can recursively
11636 // find a previously computed scalar that was inserted into the vector.
11637 if (ConstantInt *IdxC = dyn_cast<ConstantInt>(EI.getOperand(1))) {
11638 unsigned IndexVal = IdxC->getZExtValue();
11639 unsigned VectorWidth =
11640 cast<VectorType>(EI.getOperand(0)->getType())->getNumElements();
11642 // If this is extracting an invalid index, turn this into undef, to avoid
11643 // crashing the code below.
11644 if (IndexVal >= VectorWidth)
11645 return ReplaceInstUsesWith(EI, UndefValue::get(EI.getType()));
11647 // This instruction only demands the single element from the input vector.
11648 // If the input vector has a single use, simplify it based on this use
11650 if (EI.getOperand(0)->hasOneUse() && VectorWidth != 1) {
11651 uint64_t UndefElts;
11652 if (Value *V = SimplifyDemandedVectorElts(EI.getOperand(0),
11655 EI.setOperand(0, V);
11660 if (Value *Elt = FindScalarElement(EI.getOperand(0), IndexVal))
11661 return ReplaceInstUsesWith(EI, Elt);
11663 // If the this extractelement is directly using a bitcast from a vector of
11664 // the same number of elements, see if we can find the source element from
11665 // it. In this case, we will end up needing to bitcast the scalars.
11666 if (BitCastInst *BCI = dyn_cast<BitCastInst>(EI.getOperand(0))) {
11667 if (const VectorType *VT =
11668 dyn_cast<VectorType>(BCI->getOperand(0)->getType()))
11669 if (VT->getNumElements() == VectorWidth)
11670 if (Value *Elt = FindScalarElement(BCI->getOperand(0), IndexVal))
11671 return new BitCastInst(Elt, EI.getType());
11675 if (Instruction *I = dyn_cast<Instruction>(EI.getOperand(0))) {
11676 if (I->hasOneUse()) {
11677 // Push extractelement into predecessor operation if legal and
11678 // profitable to do so
11679 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(I)) {
11680 bool isConstantElt = isa<ConstantInt>(EI.getOperand(1));
11681 if (CheapToScalarize(BO, isConstantElt)) {
11682 ExtractElementInst *newEI0 =
11683 new ExtractElementInst(BO->getOperand(0), EI.getOperand(1),
11684 EI.getName()+".lhs");
11685 ExtractElementInst *newEI1 =
11686 new ExtractElementInst(BO->getOperand(1), EI.getOperand(1),
11687 EI.getName()+".rhs");
11688 InsertNewInstBefore(newEI0, EI);
11689 InsertNewInstBefore(newEI1, EI);
11690 return BinaryOperator::Create(BO->getOpcode(), newEI0, newEI1);
11692 } else if (isa<LoadInst>(I)) {
11694 cast<PointerType>(I->getOperand(0)->getType())->getAddressSpace();
11695 Value *Ptr = InsertBitCastBefore(I->getOperand(0),
11696 PointerType::get(EI.getType(), AS),EI);
11697 GetElementPtrInst *GEP =
11698 GetElementPtrInst::Create(Ptr, EI.getOperand(1), I->getName()+".gep");
11699 InsertNewInstBefore(GEP, EI);
11700 return new LoadInst(GEP);
11703 if (InsertElementInst *IE = dyn_cast<InsertElementInst>(I)) {
11704 // Extracting the inserted element?
11705 if (IE->getOperand(2) == EI.getOperand(1))
11706 return ReplaceInstUsesWith(EI, IE->getOperand(1));
11707 // If the inserted and extracted elements are constants, they must not
11708 // be the same value, extract from the pre-inserted value instead.
11709 if (isa<Constant>(IE->getOperand(2)) &&
11710 isa<Constant>(EI.getOperand(1))) {
11711 AddUsesToWorkList(EI);
11712 EI.setOperand(0, IE->getOperand(0));
11715 } else if (ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(I)) {
11716 // If this is extracting an element from a shufflevector, figure out where
11717 // it came from and extract from the appropriate input element instead.
11718 if (ConstantInt *Elt = dyn_cast<ConstantInt>(EI.getOperand(1))) {
11719 unsigned SrcIdx = getShuffleMask(SVI)[Elt->getZExtValue()];
11721 unsigned LHSWidth =
11722 cast<VectorType>(SVI->getOperand(0)->getType())->getNumElements();
11724 if (SrcIdx < LHSWidth)
11725 Src = SVI->getOperand(0);
11726 else if (SrcIdx < LHSWidth*2) {
11727 SrcIdx -= LHSWidth;
11728 Src = SVI->getOperand(1);
11730 return ReplaceInstUsesWith(EI, UndefValue::get(EI.getType()));
11732 return new ExtractElementInst(Src, SrcIdx);
11739 /// CollectSingleShuffleElements - If V is a shuffle of values that ONLY returns
11740 /// elements from either LHS or RHS, return the shuffle mask and true.
11741 /// Otherwise, return false.
11742 static bool CollectSingleShuffleElements(Value *V, Value *LHS, Value *RHS,
11743 std::vector<Constant*> &Mask) {
11744 assert(V->getType() == LHS->getType() && V->getType() == RHS->getType() &&
11745 "Invalid CollectSingleShuffleElements");
11746 unsigned NumElts = cast<VectorType>(V->getType())->getNumElements();
11748 if (isa<UndefValue>(V)) {
11749 Mask.assign(NumElts, UndefValue::get(Type::Int32Ty));
11751 } else if (V == LHS) {
11752 for (unsigned i = 0; i != NumElts; ++i)
11753 Mask.push_back(ConstantInt::get(Type::Int32Ty, i));
11755 } else if (V == RHS) {
11756 for (unsigned i = 0; i != NumElts; ++i)
11757 Mask.push_back(ConstantInt::get(Type::Int32Ty, i+NumElts));
11759 } else if (InsertElementInst *IEI = dyn_cast<InsertElementInst>(V)) {
11760 // If this is an insert of an extract from some other vector, include it.
11761 Value *VecOp = IEI->getOperand(0);
11762 Value *ScalarOp = IEI->getOperand(1);
11763 Value *IdxOp = IEI->getOperand(2);
11765 if (!isa<ConstantInt>(IdxOp))
11767 unsigned InsertedIdx = cast<ConstantInt>(IdxOp)->getZExtValue();
11769 if (isa<UndefValue>(ScalarOp)) { // inserting undef into vector.
11770 // Okay, we can handle this if the vector we are insertinting into is
11771 // transitively ok.
11772 if (CollectSingleShuffleElements(VecOp, LHS, RHS, Mask)) {
11773 // If so, update the mask to reflect the inserted undef.
11774 Mask[InsertedIdx] = UndefValue::get(Type::Int32Ty);
11777 } else if (ExtractElementInst *EI = dyn_cast<ExtractElementInst>(ScalarOp)){
11778 if (isa<ConstantInt>(EI->getOperand(1)) &&
11779 EI->getOperand(0)->getType() == V->getType()) {
11780 unsigned ExtractedIdx =
11781 cast<ConstantInt>(EI->getOperand(1))->getZExtValue();
11783 // This must be extracting from either LHS or RHS.
11784 if (EI->getOperand(0) == LHS || EI->getOperand(0) == RHS) {
11785 // Okay, we can handle this if the vector we are insertinting into is
11786 // transitively ok.
11787 if (CollectSingleShuffleElements(VecOp, LHS, RHS, Mask)) {
11788 // If so, update the mask to reflect the inserted value.
11789 if (EI->getOperand(0) == LHS) {
11790 Mask[InsertedIdx % NumElts] =
11791 ConstantInt::get(Type::Int32Ty, ExtractedIdx);
11793 assert(EI->getOperand(0) == RHS);
11794 Mask[InsertedIdx % NumElts] =
11795 ConstantInt::get(Type::Int32Ty, ExtractedIdx+NumElts);
11804 // TODO: Handle shufflevector here!
11809 /// CollectShuffleElements - We are building a shuffle of V, using RHS as the
11810 /// RHS of the shuffle instruction, if it is not null. Return a shuffle mask
11811 /// that computes V and the LHS value of the shuffle.
11812 static Value *CollectShuffleElements(Value *V, std::vector<Constant*> &Mask,
11814 assert(isa<VectorType>(V->getType()) &&
11815 (RHS == 0 || V->getType() == RHS->getType()) &&
11816 "Invalid shuffle!");
11817 unsigned NumElts = cast<VectorType>(V->getType())->getNumElements();
11819 if (isa<UndefValue>(V)) {
11820 Mask.assign(NumElts, UndefValue::get(Type::Int32Ty));
11822 } else if (isa<ConstantAggregateZero>(V)) {
11823 Mask.assign(NumElts, ConstantInt::get(Type::Int32Ty, 0));
11825 } else if (InsertElementInst *IEI = dyn_cast<InsertElementInst>(V)) {
11826 // If this is an insert of an extract from some other vector, include it.
11827 Value *VecOp = IEI->getOperand(0);
11828 Value *ScalarOp = IEI->getOperand(1);
11829 Value *IdxOp = IEI->getOperand(2);
11831 if (ExtractElementInst *EI = dyn_cast<ExtractElementInst>(ScalarOp)) {
11832 if (isa<ConstantInt>(EI->getOperand(1)) && isa<ConstantInt>(IdxOp) &&
11833 EI->getOperand(0)->getType() == V->getType()) {
11834 unsigned ExtractedIdx =
11835 cast<ConstantInt>(EI->getOperand(1))->getZExtValue();
11836 unsigned InsertedIdx = cast<ConstantInt>(IdxOp)->getZExtValue();
11838 // Either the extracted from or inserted into vector must be RHSVec,
11839 // otherwise we'd end up with a shuffle of three inputs.
11840 if (EI->getOperand(0) == RHS || RHS == 0) {
11841 RHS = EI->getOperand(0);
11842 Value *V = CollectShuffleElements(VecOp, Mask, RHS);
11843 Mask[InsertedIdx % NumElts] =
11844 ConstantInt::get(Type::Int32Ty, NumElts+ExtractedIdx);
11848 if (VecOp == RHS) {
11849 Value *V = CollectShuffleElements(EI->getOperand(0), Mask, RHS);
11850 // Everything but the extracted element is replaced with the RHS.
11851 for (unsigned i = 0; i != NumElts; ++i) {
11852 if (i != InsertedIdx)
11853 Mask[i] = ConstantInt::get(Type::Int32Ty, NumElts+i);
11858 // If this insertelement is a chain that comes from exactly these two
11859 // vectors, return the vector and the effective shuffle.
11860 if (CollectSingleShuffleElements(IEI, EI->getOperand(0), RHS, Mask))
11861 return EI->getOperand(0);
11866 // TODO: Handle shufflevector here!
11868 // Otherwise, can't do anything fancy. Return an identity vector.
11869 for (unsigned i = 0; i != NumElts; ++i)
11870 Mask.push_back(ConstantInt::get(Type::Int32Ty, i));
11874 Instruction *InstCombiner::visitInsertElementInst(InsertElementInst &IE) {
11875 Value *VecOp = IE.getOperand(0);
11876 Value *ScalarOp = IE.getOperand(1);
11877 Value *IdxOp = IE.getOperand(2);
11879 // Inserting an undef or into an undefined place, remove this.
11880 if (isa<UndefValue>(ScalarOp) || isa<UndefValue>(IdxOp))
11881 ReplaceInstUsesWith(IE, VecOp);
11883 // If the inserted element was extracted from some other vector, and if the
11884 // indexes are constant, try to turn this into a shufflevector operation.
11885 if (ExtractElementInst *EI = dyn_cast<ExtractElementInst>(ScalarOp)) {
11886 if (isa<ConstantInt>(EI->getOperand(1)) && isa<ConstantInt>(IdxOp) &&
11887 EI->getOperand(0)->getType() == IE.getType()) {
11888 unsigned NumVectorElts = IE.getType()->getNumElements();
11889 unsigned ExtractedIdx =
11890 cast<ConstantInt>(EI->getOperand(1))->getZExtValue();
11891 unsigned InsertedIdx = cast<ConstantInt>(IdxOp)->getZExtValue();
11893 if (ExtractedIdx >= NumVectorElts) // Out of range extract.
11894 return ReplaceInstUsesWith(IE, VecOp);
11896 if (InsertedIdx >= NumVectorElts) // Out of range insert.
11897 return ReplaceInstUsesWith(IE, UndefValue::get(IE.getType()));
11899 // If we are extracting a value from a vector, then inserting it right
11900 // back into the same place, just use the input vector.
11901 if (EI->getOperand(0) == VecOp && ExtractedIdx == InsertedIdx)
11902 return ReplaceInstUsesWith(IE, VecOp);
11904 // We could theoretically do this for ANY input. However, doing so could
11905 // turn chains of insertelement instructions into a chain of shufflevector
11906 // instructions, and right now we do not merge shufflevectors. As such,
11907 // only do this in a situation where it is clear that there is benefit.
11908 if (isa<UndefValue>(VecOp) || isa<ConstantAggregateZero>(VecOp)) {
11909 // Turn this into shuffle(EIOp0, VecOp, Mask). The result has all of
11910 // the values of VecOp, except then one read from EIOp0.
11911 // Build a new shuffle mask.
11912 std::vector<Constant*> Mask;
11913 if (isa<UndefValue>(VecOp))
11914 Mask.assign(NumVectorElts, UndefValue::get(Type::Int32Ty));
11916 assert(isa<ConstantAggregateZero>(VecOp) && "Unknown thing");
11917 Mask.assign(NumVectorElts, ConstantInt::get(Type::Int32Ty,
11920 Mask[InsertedIdx] = ConstantInt::get(Type::Int32Ty, ExtractedIdx);
11921 return new ShuffleVectorInst(EI->getOperand(0), VecOp,
11922 ConstantVector::get(Mask));
11925 // If this insertelement isn't used by some other insertelement, turn it
11926 // (and any insertelements it points to), into one big shuffle.
11927 if (!IE.hasOneUse() || !isa<InsertElementInst>(IE.use_back())) {
11928 std::vector<Constant*> Mask;
11930 Value *LHS = CollectShuffleElements(&IE, Mask, RHS);
11931 if (RHS == 0) RHS = UndefValue::get(LHS->getType());
11932 // We now have a shuffle of LHS, RHS, Mask.
11933 return new ShuffleVectorInst(LHS, RHS, ConstantVector::get(Mask));
11942 Instruction *InstCombiner::visitShuffleVectorInst(ShuffleVectorInst &SVI) {
11943 Value *LHS = SVI.getOperand(0);
11944 Value *RHS = SVI.getOperand(1);
11945 std::vector<unsigned> Mask = getShuffleMask(&SVI);
11947 bool MadeChange = false;
11949 // Undefined shuffle mask -> undefined value.
11950 if (isa<UndefValue>(SVI.getOperand(2)))
11951 return ReplaceInstUsesWith(SVI, UndefValue::get(SVI.getType()));
11953 uint64_t UndefElts;
11954 unsigned VWidth = cast<VectorType>(SVI.getType())->getNumElements();
11956 if (VWidth != cast<VectorType>(LHS->getType())->getNumElements())
11959 uint64_t AllOnesEltMask = ~0ULL >> (64-VWidth);
11960 if (VWidth <= 64 &&
11961 SimplifyDemandedVectorElts(&SVI, AllOnesEltMask, UndefElts)) {
11962 LHS = SVI.getOperand(0);
11963 RHS = SVI.getOperand(1);
11967 // Canonicalize shuffle(x ,x,mask) -> shuffle(x, undef,mask')
11968 // Canonicalize shuffle(undef,x,mask) -> shuffle(x, undef,mask').
11969 if (LHS == RHS || isa<UndefValue>(LHS)) {
11970 if (isa<UndefValue>(LHS) && LHS == RHS) {
11971 // shuffle(undef,undef,mask) -> undef.
11972 return ReplaceInstUsesWith(SVI, LHS);
11975 // Remap any references to RHS to use LHS.
11976 std::vector<Constant*> Elts;
11977 for (unsigned i = 0, e = Mask.size(); i != e; ++i) {
11978 if (Mask[i] >= 2*e)
11979 Elts.push_back(UndefValue::get(Type::Int32Ty));
11981 if ((Mask[i] >= e && isa<UndefValue>(RHS)) ||
11982 (Mask[i] < e && isa<UndefValue>(LHS))) {
11983 Mask[i] = 2*e; // Turn into undef.
11984 Elts.push_back(UndefValue::get(Type::Int32Ty));
11986 Mask[i] = Mask[i] % e; // Force to LHS.
11987 Elts.push_back(ConstantInt::get(Type::Int32Ty, Mask[i]));
11991 SVI.setOperand(0, SVI.getOperand(1));
11992 SVI.setOperand(1, UndefValue::get(RHS->getType()));
11993 SVI.setOperand(2, ConstantVector::get(Elts));
11994 LHS = SVI.getOperand(0);
11995 RHS = SVI.getOperand(1);
11999 // Analyze the shuffle, are the LHS or RHS and identity shuffles?
12000 bool isLHSID = true, isRHSID = true;
12002 for (unsigned i = 0, e = Mask.size(); i != e; ++i) {
12003 if (Mask[i] >= e*2) continue; // Ignore undef values.
12004 // Is this an identity shuffle of the LHS value?
12005 isLHSID &= (Mask[i] == i);
12007 // Is this an identity shuffle of the RHS value?
12008 isRHSID &= (Mask[i]-e == i);
12011 // Eliminate identity shuffles.
12012 if (isLHSID) return ReplaceInstUsesWith(SVI, LHS);
12013 if (isRHSID) return ReplaceInstUsesWith(SVI, RHS);
12015 // If the LHS is a shufflevector itself, see if we can combine it with this
12016 // one without producing an unusual shuffle. Here we are really conservative:
12017 // we are absolutely afraid of producing a shuffle mask not in the input
12018 // program, because the code gen may not be smart enough to turn a merged
12019 // shuffle into two specific shuffles: it may produce worse code. As such,
12020 // we only merge two shuffles if the result is one of the two input shuffle
12021 // masks. In this case, merging the shuffles just removes one instruction,
12022 // which we know is safe. This is good for things like turning:
12023 // (splat(splat)) -> splat.
12024 if (ShuffleVectorInst *LHSSVI = dyn_cast<ShuffleVectorInst>(LHS)) {
12025 if (isa<UndefValue>(RHS)) {
12026 std::vector<unsigned> LHSMask = getShuffleMask(LHSSVI);
12028 std::vector<unsigned> NewMask;
12029 for (unsigned i = 0, e = Mask.size(); i != e; ++i)
12030 if (Mask[i] >= 2*e)
12031 NewMask.push_back(2*e);
12033 NewMask.push_back(LHSMask[Mask[i]]);
12035 // If the result mask is equal to the src shuffle or this shuffle mask, do
12036 // the replacement.
12037 if (NewMask == LHSMask || NewMask == Mask) {
12038 std::vector<Constant*> Elts;
12039 for (unsigned i = 0, e = NewMask.size(); i != e; ++i) {
12040 if (NewMask[i] >= e*2) {
12041 Elts.push_back(UndefValue::get(Type::Int32Ty));
12043 Elts.push_back(ConstantInt::get(Type::Int32Ty, NewMask[i]));
12046 return new ShuffleVectorInst(LHSSVI->getOperand(0),
12047 LHSSVI->getOperand(1),
12048 ConstantVector::get(Elts));
12053 return MadeChange ? &SVI : 0;
12059 /// TryToSinkInstruction - Try to move the specified instruction from its
12060 /// current block into the beginning of DestBlock, which can only happen if it's
12061 /// safe to move the instruction past all of the instructions between it and the
12062 /// end of its block.
12063 static bool TryToSinkInstruction(Instruction *I, BasicBlock *DestBlock) {
12064 assert(I->hasOneUse() && "Invariants didn't hold!");
12066 // Cannot move control-flow-involving, volatile loads, vaarg, etc.
12067 if (isa<PHINode>(I) || I->mayWriteToMemory() || isa<TerminatorInst>(I))
12070 // Do not sink alloca instructions out of the entry block.
12071 if (isa<AllocaInst>(I) && I->getParent() ==
12072 &DestBlock->getParent()->getEntryBlock())
12075 // We can only sink load instructions if there is nothing between the load and
12076 // the end of block that could change the value.
12077 if (I->mayReadFromMemory()) {
12078 for (BasicBlock::iterator Scan = I, E = I->getParent()->end();
12080 if (Scan->mayWriteToMemory())
12084 BasicBlock::iterator InsertPos = DestBlock->getFirstNonPHI();
12086 I->moveBefore(InsertPos);
12092 /// AddReachableCodeToWorklist - Walk the function in depth-first order, adding
12093 /// all reachable code to the worklist.
12095 /// This has a couple of tricks to make the code faster and more powerful. In
12096 /// particular, we constant fold and DCE instructions as we go, to avoid adding
12097 /// them to the worklist (this significantly speeds up instcombine on code where
12098 /// many instructions are dead or constant). Additionally, if we find a branch
12099 /// whose condition is a known constant, we only visit the reachable successors.
12101 static void AddReachableCodeToWorklist(BasicBlock *BB,
12102 SmallPtrSet<BasicBlock*, 64> &Visited,
12104 const TargetData *TD) {
12105 SmallVector<BasicBlock*, 256> Worklist;
12106 Worklist.push_back(BB);
12108 while (!Worklist.empty()) {
12109 BB = Worklist.back();
12110 Worklist.pop_back();
12112 // We have now visited this block! If we've already been here, ignore it.
12113 if (!Visited.insert(BB)) continue;
12115 DbgInfoIntrinsic *DBI_Prev = NULL;
12116 for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E; ) {
12117 Instruction *Inst = BBI++;
12119 // DCE instruction if trivially dead.
12120 if (isInstructionTriviallyDead(Inst)) {
12122 DOUT << "IC: DCE: " << *Inst;
12123 Inst->eraseFromParent();
12127 // ConstantProp instruction if trivially constant.
12128 if (Constant *C = ConstantFoldInstruction(Inst, TD)) {
12129 DOUT << "IC: ConstFold to: " << *C << " from: " << *Inst;
12130 Inst->replaceAllUsesWith(C);
12132 Inst->eraseFromParent();
12136 // If there are two consecutive llvm.dbg.stoppoint calls then
12137 // it is likely that the optimizer deleted code in between these
12139 DbgInfoIntrinsic *DBI_Next = dyn_cast<DbgInfoIntrinsic>(Inst);
12142 && DBI_Prev->getIntrinsicID() == llvm::Intrinsic::dbg_stoppoint
12143 && DBI_Next->getIntrinsicID() == llvm::Intrinsic::dbg_stoppoint) {
12144 IC.RemoveFromWorkList(DBI_Prev);
12145 DBI_Prev->eraseFromParent();
12147 DBI_Prev = DBI_Next;
12150 IC.AddToWorkList(Inst);
12153 // Recursively visit successors. If this is a branch or switch on a
12154 // constant, only visit the reachable successor.
12155 TerminatorInst *TI = BB->getTerminator();
12156 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
12157 if (BI->isConditional() && isa<ConstantInt>(BI->getCondition())) {
12158 bool CondVal = cast<ConstantInt>(BI->getCondition())->getZExtValue();
12159 BasicBlock *ReachableBB = BI->getSuccessor(!CondVal);
12160 Worklist.push_back(ReachableBB);
12163 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) {
12164 if (ConstantInt *Cond = dyn_cast<ConstantInt>(SI->getCondition())) {
12165 // See if this is an explicit destination.
12166 for (unsigned i = 1, e = SI->getNumSuccessors(); i != e; ++i)
12167 if (SI->getCaseValue(i) == Cond) {
12168 BasicBlock *ReachableBB = SI->getSuccessor(i);
12169 Worklist.push_back(ReachableBB);
12173 // Otherwise it is the default destination.
12174 Worklist.push_back(SI->getSuccessor(0));
12179 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
12180 Worklist.push_back(TI->getSuccessor(i));
12184 bool InstCombiner::DoOneIteration(Function &F, unsigned Iteration) {
12185 bool Changed = false;
12186 TD = &getAnalysis<TargetData>();
12188 DEBUG(DOUT << "\n\nINSTCOMBINE ITERATION #" << Iteration << " on "
12189 << F.getNameStr() << "\n");
12192 // Do a depth-first traversal of the function, populate the worklist with
12193 // the reachable instructions. Ignore blocks that are not reachable. Keep
12194 // track of which blocks we visit.
12195 SmallPtrSet<BasicBlock*, 64> Visited;
12196 AddReachableCodeToWorklist(F.begin(), Visited, *this, TD);
12198 // Do a quick scan over the function. If we find any blocks that are
12199 // unreachable, remove any instructions inside of them. This prevents
12200 // the instcombine code from having to deal with some bad special cases.
12201 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
12202 if (!Visited.count(BB)) {
12203 Instruction *Term = BB->getTerminator();
12204 while (Term != BB->begin()) { // Remove instrs bottom-up
12205 BasicBlock::iterator I = Term; --I;
12207 DOUT << "IC: DCE: " << *I;
12210 if (!I->use_empty())
12211 I->replaceAllUsesWith(UndefValue::get(I->getType()));
12212 I->eraseFromParent();
12217 while (!Worklist.empty()) {
12218 Instruction *I = RemoveOneFromWorkList();
12219 if (I == 0) continue; // skip null values.
12221 // Check to see if we can DCE the instruction.
12222 if (isInstructionTriviallyDead(I)) {
12223 // Add operands to the worklist.
12224 if (I->getNumOperands() < 4)
12225 AddUsesToWorkList(*I);
12228 DOUT << "IC: DCE: " << *I;
12230 I->eraseFromParent();
12231 RemoveFromWorkList(I);
12235 // Instruction isn't dead, see if we can constant propagate it.
12236 if (Constant *C = ConstantFoldInstruction(I, TD)) {
12237 DOUT << "IC: ConstFold to: " << *C << " from: " << *I;
12239 // Add operands to the worklist.
12240 AddUsesToWorkList(*I);
12241 ReplaceInstUsesWith(*I, C);
12244 I->eraseFromParent();
12245 RemoveFromWorkList(I);
12249 if (TD && I->getType()->getTypeID() == Type::VoidTyID) {
12250 // See if we can constant fold its operands.
12251 for (User::op_iterator i = I->op_begin(), e = I->op_end(); i != e; ++i) {
12252 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(i)) {
12253 if (Constant *NewC = ConstantFoldConstantExpression(CE, TD))
12259 // See if we can trivially sink this instruction to a successor basic block.
12260 if (I->hasOneUse()) {
12261 BasicBlock *BB = I->getParent();
12262 BasicBlock *UserParent = cast<Instruction>(I->use_back())->getParent();
12263 if (UserParent != BB) {
12264 bool UserIsSuccessor = false;
12265 // See if the user is one of our successors.
12266 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI)
12267 if (*SI == UserParent) {
12268 UserIsSuccessor = true;
12272 // If the user is one of our immediate successors, and if that successor
12273 // only has us as a predecessors (we'd have to split the critical edge
12274 // otherwise), we can keep going.
12275 if (UserIsSuccessor && !isa<PHINode>(I->use_back()) &&
12276 next(pred_begin(UserParent)) == pred_end(UserParent))
12277 // Okay, the CFG is simple enough, try to sink this instruction.
12278 Changed |= TryToSinkInstruction(I, UserParent);
12282 // Now that we have an instruction, try combining it to simplify it...
12286 DEBUG(std::ostringstream SS; I->print(SS); OrigI = SS.str(););
12287 if (Instruction *Result = visit(*I)) {
12289 // Should we replace the old instruction with a new one?
12291 DOUT << "IC: Old = " << *I
12292 << " New = " << *Result;
12294 // Everything uses the new instruction now.
12295 I->replaceAllUsesWith(Result);
12297 // Push the new instruction and any users onto the worklist.
12298 AddToWorkList(Result);
12299 AddUsersToWorkList(*Result);
12301 // Move the name to the new instruction first.
12302 Result->takeName(I);
12304 // Insert the new instruction into the basic block...
12305 BasicBlock *InstParent = I->getParent();
12306 BasicBlock::iterator InsertPos = I;
12308 if (!isa<PHINode>(Result)) // If combining a PHI, don't insert
12309 while (isa<PHINode>(InsertPos)) // middle of a block of PHIs.
12312 InstParent->getInstList().insert(InsertPos, Result);
12314 // Make sure that we reprocess all operands now that we reduced their
12316 AddUsesToWorkList(*I);
12318 // Instructions can end up on the worklist more than once. Make sure
12319 // we do not process an instruction that has been deleted.
12320 RemoveFromWorkList(I);
12322 // Erase the old instruction.
12323 InstParent->getInstList().erase(I);
12326 DOUT << "IC: Mod = " << OrigI
12327 << " New = " << *I;
12330 // If the instruction was modified, it's possible that it is now dead.
12331 // if so, remove it.
12332 if (isInstructionTriviallyDead(I)) {
12333 // Make sure we process all operands now that we are reducing their
12335 AddUsesToWorkList(*I);
12337 // Instructions may end up in the worklist more than once. Erase all
12338 // occurrences of this instruction.
12339 RemoveFromWorkList(I);
12340 I->eraseFromParent();
12343 AddUsersToWorkList(*I);
12350 assert(WorklistMap.empty() && "Worklist empty, but map not?");
12352 // Do an explicit clear, this shrinks the map if needed.
12353 WorklistMap.clear();
12358 bool InstCombiner::runOnFunction(Function &F) {
12359 MustPreserveLCSSA = mustPreserveAnalysisID(LCSSAID);
12361 bool EverMadeChange = false;
12363 // Iterate while there is work to do.
12364 unsigned Iteration = 0;
12365 while (DoOneIteration(F, Iteration++))
12366 EverMadeChange = true;
12367 return EverMadeChange;
12370 FunctionPass *llvm::createInstructionCombiningPass() {
12371 return new InstCombiner();