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 *visitAnd(BinaryOperator &I);
184 Instruction *visitOr (BinaryOperator &I);
185 Instruction *visitXor(BinaryOperator &I);
186 Instruction *visitShl(BinaryOperator &I);
187 Instruction *visitAShr(BinaryOperator &I);
188 Instruction *visitLShr(BinaryOperator &I);
189 Instruction *commonShiftTransforms(BinaryOperator &I);
190 Instruction *FoldFCmp_IntToFP_Cst(FCmpInst &I, Instruction *LHSI,
192 Instruction *visitFCmpInst(FCmpInst &I);
193 Instruction *visitICmpInst(ICmpInst &I);
194 Instruction *visitICmpInstWithCastAndCast(ICmpInst &ICI);
195 Instruction *visitICmpInstWithInstAndIntCst(ICmpInst &ICI,
198 Instruction *FoldICmpDivCst(ICmpInst &ICI, BinaryOperator *DivI,
199 ConstantInt *DivRHS);
201 Instruction *FoldGEPICmp(User *GEPLHS, Value *RHS,
202 ICmpInst::Predicate Cond, Instruction &I);
203 Instruction *FoldShiftByConstant(Value *Op0, ConstantInt *Op1,
205 Instruction *commonCastTransforms(CastInst &CI);
206 Instruction *commonIntCastTransforms(CastInst &CI);
207 Instruction *commonPointerCastTransforms(CastInst &CI);
208 Instruction *visitTrunc(TruncInst &CI);
209 Instruction *visitZExt(ZExtInst &CI);
210 Instruction *visitSExt(SExtInst &CI);
211 Instruction *visitFPTrunc(FPTruncInst &CI);
212 Instruction *visitFPExt(CastInst &CI);
213 Instruction *visitFPToUI(FPToUIInst &FI);
214 Instruction *visitFPToSI(FPToSIInst &FI);
215 Instruction *visitUIToFP(CastInst &CI);
216 Instruction *visitSIToFP(CastInst &CI);
217 Instruction *visitPtrToInt(CastInst &CI);
218 Instruction *visitIntToPtr(IntToPtrInst &CI);
219 Instruction *visitBitCast(BitCastInst &CI);
220 Instruction *FoldSelectOpOp(SelectInst &SI, Instruction *TI,
222 Instruction *visitSelectInst(SelectInst &SI);
223 Instruction *visitSelectInstWithICmp(SelectInst &SI, ICmpInst *ICI);
224 Instruction *visitCallInst(CallInst &CI);
225 Instruction *visitInvokeInst(InvokeInst &II);
226 Instruction *visitPHINode(PHINode &PN);
227 Instruction *visitGetElementPtrInst(GetElementPtrInst &GEP);
228 Instruction *visitAllocationInst(AllocationInst &AI);
229 Instruction *visitFreeInst(FreeInst &FI);
230 Instruction *visitLoadInst(LoadInst &LI);
231 Instruction *visitStoreInst(StoreInst &SI);
232 Instruction *visitBranchInst(BranchInst &BI);
233 Instruction *visitSwitchInst(SwitchInst &SI);
234 Instruction *visitInsertElementInst(InsertElementInst &IE);
235 Instruction *visitExtractElementInst(ExtractElementInst &EI);
236 Instruction *visitShuffleVectorInst(ShuffleVectorInst &SVI);
237 Instruction *visitExtractValueInst(ExtractValueInst &EV);
239 // visitInstruction - Specify what to return for unhandled instructions...
240 Instruction *visitInstruction(Instruction &I) { return 0; }
243 Instruction *visitCallSite(CallSite CS);
244 bool transformConstExprCastCall(CallSite CS);
245 Instruction *transformCallThroughTrampoline(CallSite CS);
246 Instruction *transformZExtICmp(ICmpInst *ICI, Instruction &CI,
247 bool DoXform = true);
248 bool WillNotOverflowSignedAdd(Value *LHS, Value *RHS);
251 // InsertNewInstBefore - insert an instruction New before instruction Old
252 // in the program. Add the new instruction to the worklist.
254 Instruction *InsertNewInstBefore(Instruction *New, Instruction &Old) {
255 assert(New && New->getParent() == 0 &&
256 "New instruction already inserted into a basic block!");
257 BasicBlock *BB = Old.getParent();
258 BB->getInstList().insert(&Old, New); // Insert inst
263 /// InsertCastBefore - Insert a cast of V to TY before the instruction POS.
264 /// This also adds the cast to the worklist. Finally, this returns the
266 Value *InsertCastBefore(Instruction::CastOps opc, Value *V, const Type *Ty,
268 if (V->getType() == Ty) return V;
270 if (Constant *CV = dyn_cast<Constant>(V))
271 return ConstantExpr::getCast(opc, CV, Ty);
273 Instruction *C = CastInst::Create(opc, V, Ty, V->getName(), &Pos);
278 Value *InsertBitCastBefore(Value *V, const Type *Ty, Instruction &Pos) {
279 return InsertCastBefore(Instruction::BitCast, V, Ty, Pos);
283 // ReplaceInstUsesWith - This method is to be used when an instruction is
284 // found to be dead, replacable with another preexisting expression. Here
285 // we add all uses of I to the worklist, replace all uses of I with the new
286 // value, then return I, so that the inst combiner will know that I was
289 Instruction *ReplaceInstUsesWith(Instruction &I, Value *V) {
290 AddUsersToWorkList(I); // Add all modified instrs to worklist
292 I.replaceAllUsesWith(V);
295 // If we are replacing the instruction with itself, this must be in a
296 // segment of unreachable code, so just clobber the instruction.
297 I.replaceAllUsesWith(UndefValue::get(I.getType()));
302 // UpdateValueUsesWith - This method is to be used when an value is
303 // found to be replacable with another preexisting expression or was
304 // updated. Here we add all uses of I to the worklist, replace all uses of
305 // I with the new value (unless the instruction was just updated), then
306 // return true, so that the inst combiner will know that I was modified.
308 bool UpdateValueUsesWith(Value *Old, Value *New) {
309 AddUsersToWorkList(*Old); // Add all modified instrs to worklist
311 Old->replaceAllUsesWith(New);
312 if (Instruction *I = dyn_cast<Instruction>(Old))
314 if (Instruction *I = dyn_cast<Instruction>(New))
319 // EraseInstFromFunction - When dealing with an instruction that has side
320 // effects or produces a void value, we can't rely on DCE to delete the
321 // instruction. Instead, visit methods should return the value returned by
323 Instruction *EraseInstFromFunction(Instruction &I) {
324 assert(I.use_empty() && "Cannot erase instruction that is used!");
325 AddUsesToWorkList(I);
326 RemoveFromWorkList(&I);
328 return 0; // Don't do anything with FI
331 void ComputeMaskedBits(Value *V, const APInt &Mask, APInt &KnownZero,
332 APInt &KnownOne, unsigned Depth = 0) const {
333 return llvm::ComputeMaskedBits(V, Mask, KnownZero, KnownOne, TD, Depth);
336 bool MaskedValueIsZero(Value *V, const APInt &Mask,
337 unsigned Depth = 0) const {
338 return llvm::MaskedValueIsZero(V, Mask, TD, Depth);
340 unsigned ComputeNumSignBits(Value *Op, unsigned Depth = 0) const {
341 return llvm::ComputeNumSignBits(Op, TD, Depth);
345 /// InsertOperandCastBefore - This inserts a cast of V to DestTy before the
346 /// InsertBefore instruction. This is specialized a bit to avoid inserting
347 /// casts that are known to not do anything...
349 Value *InsertOperandCastBefore(Instruction::CastOps opcode,
350 Value *V, const Type *DestTy,
351 Instruction *InsertBefore);
353 /// SimplifyCommutative - This performs a few simplifications for
354 /// commutative operators.
355 bool SimplifyCommutative(BinaryOperator &I);
357 /// SimplifyCompare - This reorders the operands of a CmpInst to get them in
358 /// most-complex to least-complex order.
359 bool SimplifyCompare(CmpInst &I);
361 /// SimplifyDemandedBits - Attempts to replace V with a simpler value based
362 /// on the demanded bits.
363 bool SimplifyDemandedBits(Value *V, APInt DemandedMask,
364 APInt& KnownZero, APInt& KnownOne,
367 Value *SimplifyDemandedVectorElts(Value *V, uint64_t DemandedElts,
368 uint64_t &UndefElts, unsigned Depth = 0);
370 // FoldOpIntoPhi - Given a binary operator or cast instruction which has a
371 // PHI node as operand #0, see if we can fold the instruction into the PHI
372 // (which is only possible if all operands to the PHI are constants).
373 Instruction *FoldOpIntoPhi(Instruction &I);
375 // FoldPHIArgOpIntoPHI - If all operands to a PHI node are the same "unary"
376 // operator and they all are only used by the PHI, PHI together their
377 // inputs, and do the operation once, to the result of the PHI.
378 Instruction *FoldPHIArgOpIntoPHI(PHINode &PN);
379 Instruction *FoldPHIArgBinOpIntoPHI(PHINode &PN);
382 Instruction *OptAndOp(Instruction *Op, ConstantInt *OpRHS,
383 ConstantInt *AndRHS, BinaryOperator &TheAnd);
385 Value *FoldLogicalPlusAnd(Value *LHS, Value *RHS, ConstantInt *Mask,
386 bool isSub, Instruction &I);
387 Instruction *InsertRangeTest(Value *V, Constant *Lo, Constant *Hi,
388 bool isSigned, bool Inside, Instruction &IB);
389 Instruction *PromoteCastOfAllocation(BitCastInst &CI, AllocationInst &AI);
390 Instruction *MatchBSwap(BinaryOperator &I);
391 bool SimplifyStoreAtEndOfBlock(StoreInst &SI);
392 Instruction *SimplifyMemTransfer(MemIntrinsic *MI);
393 Instruction *SimplifyMemSet(MemSetInst *MI);
396 Value *EvaluateInDifferentType(Value *V, const Type *Ty, bool isSigned);
398 bool CanEvaluateInDifferentType(Value *V, const IntegerType *Ty,
400 int &NumCastsRemoved);
401 unsigned GetOrEnforceKnownAlignment(Value *V,
402 unsigned PrefAlign = 0);
407 char InstCombiner::ID = 0;
408 static RegisterPass<InstCombiner>
409 X("instcombine", "Combine redundant instructions");
411 // getComplexity: Assign a complexity or rank value to LLVM Values...
412 // 0 -> undef, 1 -> Const, 2 -> Other, 3 -> Arg, 3 -> Unary, 4 -> OtherInst
413 static unsigned getComplexity(Value *V) {
414 if (isa<Instruction>(V)) {
415 if (BinaryOperator::isNeg(V) || BinaryOperator::isNot(V))
419 if (isa<Argument>(V)) return 3;
420 return isa<Constant>(V) ? (isa<UndefValue>(V) ? 0 : 1) : 2;
423 // isOnlyUse - Return true if this instruction will be deleted if we stop using
425 static bool isOnlyUse(Value *V) {
426 return V->hasOneUse() || isa<Constant>(V);
429 // getPromotedType - Return the specified type promoted as it would be to pass
430 // though a va_arg area...
431 static const Type *getPromotedType(const Type *Ty) {
432 if (const IntegerType* ITy = dyn_cast<IntegerType>(Ty)) {
433 if (ITy->getBitWidth() < 32)
434 return Type::Int32Ty;
439 /// getBitCastOperand - If the specified operand is a CastInst, a constant
440 /// expression bitcast, or a GetElementPtrInst with all zero indices, return the
441 /// operand value, otherwise return null.
442 static Value *getBitCastOperand(Value *V) {
443 if (BitCastInst *I = dyn_cast<BitCastInst>(V))
445 return I->getOperand(0);
446 else if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(V)) {
447 // GetElementPtrInst?
448 if (GEP->hasAllZeroIndices())
449 return GEP->getOperand(0);
450 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) {
451 if (CE->getOpcode() == Instruction::BitCast)
452 // BitCast ConstantExp?
453 return CE->getOperand(0);
454 else if (CE->getOpcode() == Instruction::GetElementPtr) {
455 // GetElementPtr ConstantExp?
456 for (User::op_iterator I = CE->op_begin() + 1, E = CE->op_end();
458 ConstantInt *CI = dyn_cast<ConstantInt>(I);
459 if (!CI || !CI->isZero())
460 // Any non-zero indices? Not cast-like.
463 // All-zero indices? This is just like casting.
464 return CE->getOperand(0);
470 /// This function is a wrapper around CastInst::isEliminableCastPair. It
471 /// simply extracts arguments and returns what that function returns.
472 static Instruction::CastOps
473 isEliminableCastPair(
474 const CastInst *CI, ///< The first cast instruction
475 unsigned opcode, ///< The opcode of the second cast instruction
476 const Type *DstTy, ///< The target type for the second cast instruction
477 TargetData *TD ///< The target data for pointer size
480 const Type *SrcTy = CI->getOperand(0)->getType(); // A from above
481 const Type *MidTy = CI->getType(); // B from above
483 // Get the opcodes of the two Cast instructions
484 Instruction::CastOps firstOp = Instruction::CastOps(CI->getOpcode());
485 Instruction::CastOps secondOp = Instruction::CastOps(opcode);
487 return Instruction::CastOps(
488 CastInst::isEliminableCastPair(firstOp, secondOp, SrcTy, MidTy,
489 DstTy, TD->getIntPtrType()));
492 /// ValueRequiresCast - Return true if the cast from "V to Ty" actually results
493 /// in any code being generated. It does not require codegen if V is simple
494 /// enough or if the cast can be folded into other casts.
495 static bool ValueRequiresCast(Instruction::CastOps opcode, const Value *V,
496 const Type *Ty, TargetData *TD) {
497 if (V->getType() == Ty || isa<Constant>(V)) return false;
499 // If this is another cast that can be eliminated, it isn't codegen either.
500 if (const CastInst *CI = dyn_cast<CastInst>(V))
501 if (isEliminableCastPair(CI, opcode, Ty, TD))
506 /// InsertOperandCastBefore - This inserts a cast of V to DestTy before the
507 /// InsertBefore instruction. This is specialized a bit to avoid inserting
508 /// casts that are known to not do anything...
510 Value *InstCombiner::InsertOperandCastBefore(Instruction::CastOps opcode,
511 Value *V, const Type *DestTy,
512 Instruction *InsertBefore) {
513 if (V->getType() == DestTy) return V;
514 if (Constant *C = dyn_cast<Constant>(V))
515 return ConstantExpr::getCast(opcode, C, DestTy);
517 return InsertCastBefore(opcode, V, DestTy, *InsertBefore);
520 // SimplifyCommutative - This performs a few simplifications for commutative
523 // 1. Order operands such that they are listed from right (least complex) to
524 // left (most complex). This puts constants before unary operators before
527 // 2. Transform: (op (op V, C1), C2) ==> (op V, (op C1, C2))
528 // 3. Transform: (op (op V1, C1), (op V2, C2)) ==> (op (op V1, V2), (op C1,C2))
530 bool InstCombiner::SimplifyCommutative(BinaryOperator &I) {
531 bool Changed = false;
532 if (getComplexity(I.getOperand(0)) < getComplexity(I.getOperand(1)))
533 Changed = !I.swapOperands();
535 if (!I.isAssociative()) return Changed;
536 Instruction::BinaryOps Opcode = I.getOpcode();
537 if (BinaryOperator *Op = dyn_cast<BinaryOperator>(I.getOperand(0)))
538 if (Op->getOpcode() == Opcode && isa<Constant>(Op->getOperand(1))) {
539 if (isa<Constant>(I.getOperand(1))) {
540 Constant *Folded = ConstantExpr::get(I.getOpcode(),
541 cast<Constant>(I.getOperand(1)),
542 cast<Constant>(Op->getOperand(1)));
543 I.setOperand(0, Op->getOperand(0));
544 I.setOperand(1, Folded);
546 } else if (BinaryOperator *Op1=dyn_cast<BinaryOperator>(I.getOperand(1)))
547 if (Op1->getOpcode() == Opcode && isa<Constant>(Op1->getOperand(1)) &&
548 isOnlyUse(Op) && isOnlyUse(Op1)) {
549 Constant *C1 = cast<Constant>(Op->getOperand(1));
550 Constant *C2 = cast<Constant>(Op1->getOperand(1));
552 // Fold (op (op V1, C1), (op V2, C2)) ==> (op (op V1, V2), (op C1,C2))
553 Constant *Folded = ConstantExpr::get(I.getOpcode(), C1, C2);
554 Instruction *New = BinaryOperator::Create(Opcode, Op->getOperand(0),
558 I.setOperand(0, New);
559 I.setOperand(1, Folded);
566 /// SimplifyCompare - For a CmpInst this function just orders the operands
567 /// so that theyare listed from right (least complex) to left (most complex).
568 /// This puts constants before unary operators before binary operators.
569 bool InstCombiner::SimplifyCompare(CmpInst &I) {
570 if (getComplexity(I.getOperand(0)) >= getComplexity(I.getOperand(1)))
573 // Compare instructions are not associative so there's nothing else we can do.
577 // dyn_castNegVal - Given a 'sub' instruction, return the RHS of the instruction
578 // if the LHS is a constant zero (which is the 'negate' form).
580 static inline Value *dyn_castNegVal(Value *V) {
581 if (BinaryOperator::isNeg(V))
582 return BinaryOperator::getNegArgument(V);
584 // Constants can be considered to be negated values if they can be folded.
585 if (ConstantInt *C = dyn_cast<ConstantInt>(V))
586 return ConstantExpr::getNeg(C);
588 if (ConstantVector *C = dyn_cast<ConstantVector>(V))
589 if (C->getType()->getElementType()->isInteger())
590 return ConstantExpr::getNeg(C);
595 static inline Value *dyn_castNotVal(Value *V) {
596 if (BinaryOperator::isNot(V))
597 return BinaryOperator::getNotArgument(V);
599 // Constants can be considered to be not'ed values...
600 if (ConstantInt *C = dyn_cast<ConstantInt>(V))
601 return ConstantInt::get(~C->getValue());
605 // dyn_castFoldableMul - If this value is a multiply that can be folded into
606 // other computations (because it has a constant operand), return the
607 // non-constant operand of the multiply, and set CST to point to the multiplier.
608 // Otherwise, return null.
610 static inline Value *dyn_castFoldableMul(Value *V, ConstantInt *&CST) {
611 if (V->hasOneUse() && V->getType()->isInteger())
612 if (Instruction *I = dyn_cast<Instruction>(V)) {
613 if (I->getOpcode() == Instruction::Mul)
614 if ((CST = dyn_cast<ConstantInt>(I->getOperand(1))))
615 return I->getOperand(0);
616 if (I->getOpcode() == Instruction::Shl)
617 if ((CST = dyn_cast<ConstantInt>(I->getOperand(1)))) {
618 // The multiplier is really 1 << CST.
619 uint32_t BitWidth = cast<IntegerType>(V->getType())->getBitWidth();
620 uint32_t CSTVal = CST->getLimitedValue(BitWidth);
621 CST = ConstantInt::get(APInt(BitWidth, 1).shl(CSTVal));
622 return I->getOperand(0);
628 /// dyn_castGetElementPtr - If this is a getelementptr instruction or constant
629 /// expression, return it.
630 static User *dyn_castGetElementPtr(Value *V) {
631 if (isa<GetElementPtrInst>(V)) return cast<User>(V);
632 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V))
633 if (CE->getOpcode() == Instruction::GetElementPtr)
634 return cast<User>(V);
638 /// getOpcode - If this is an Instruction or a ConstantExpr, return the
639 /// opcode value. Otherwise return UserOp1.
640 static unsigned getOpcode(const Value *V) {
641 if (const Instruction *I = dyn_cast<Instruction>(V))
642 return I->getOpcode();
643 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(V))
644 return CE->getOpcode();
645 // Use UserOp1 to mean there's no opcode.
646 return Instruction::UserOp1;
649 /// AddOne - Add one to a ConstantInt
650 static ConstantInt *AddOne(ConstantInt *C) {
651 APInt Val(C->getValue());
652 return ConstantInt::get(++Val);
654 /// SubOne - Subtract one from a ConstantInt
655 static ConstantInt *SubOne(ConstantInt *C) {
656 APInt Val(C->getValue());
657 return ConstantInt::get(--Val);
659 /// Add - Add two ConstantInts together
660 static ConstantInt *Add(ConstantInt *C1, ConstantInt *C2) {
661 return ConstantInt::get(C1->getValue() + C2->getValue());
663 /// And - Bitwise AND two ConstantInts together
664 static ConstantInt *And(ConstantInt *C1, ConstantInt *C2) {
665 return ConstantInt::get(C1->getValue() & C2->getValue());
667 /// Subtract - Subtract one ConstantInt from another
668 static ConstantInt *Subtract(ConstantInt *C1, ConstantInt *C2) {
669 return ConstantInt::get(C1->getValue() - C2->getValue());
671 /// Multiply - Multiply two ConstantInts together
672 static ConstantInt *Multiply(ConstantInt *C1, ConstantInt *C2) {
673 return ConstantInt::get(C1->getValue() * C2->getValue());
675 /// MultiplyOverflows - True if the multiply can not be expressed in an int
677 static bool MultiplyOverflows(ConstantInt *C1, ConstantInt *C2, bool sign) {
678 uint32_t W = C1->getBitWidth();
679 APInt LHSExt = C1->getValue(), RHSExt = C2->getValue();
688 APInt MulExt = LHSExt * RHSExt;
691 APInt Min = APInt::getSignedMinValue(W).sext(W * 2);
692 APInt Max = APInt::getSignedMaxValue(W).sext(W * 2);
693 return MulExt.slt(Min) || MulExt.sgt(Max);
695 return MulExt.ugt(APInt::getLowBitsSet(W * 2, W));
699 /// ShrinkDemandedConstant - Check to see if the specified operand of the
700 /// specified instruction is a constant integer. If so, check to see if there
701 /// are any bits set in the constant that are not demanded. If so, shrink the
702 /// constant and return true.
703 static bool ShrinkDemandedConstant(Instruction *I, unsigned OpNo,
705 assert(I && "No instruction?");
706 assert(OpNo < I->getNumOperands() && "Operand index too large");
708 // If the operand is not a constant integer, nothing to do.
709 ConstantInt *OpC = dyn_cast<ConstantInt>(I->getOperand(OpNo));
710 if (!OpC) return false;
712 // If there are no bits set that aren't demanded, nothing to do.
713 Demanded.zextOrTrunc(OpC->getValue().getBitWidth());
714 if ((~Demanded & OpC->getValue()) == 0)
717 // This instruction is producing bits that are not demanded. Shrink the RHS.
718 Demanded &= OpC->getValue();
719 I->setOperand(OpNo, ConstantInt::get(Demanded));
723 // ComputeSignedMinMaxValuesFromKnownBits - Given a signed integer type and a
724 // set of known zero and one bits, compute the maximum and minimum values that
725 // could have the specified known zero and known one bits, returning them in
727 static void ComputeSignedMinMaxValuesFromKnownBits(const Type *Ty,
728 const APInt& KnownZero,
729 const APInt& KnownOne,
730 APInt& Min, APInt& Max) {
731 uint32_t BitWidth = cast<IntegerType>(Ty)->getBitWidth();
732 assert(KnownZero.getBitWidth() == BitWidth &&
733 KnownOne.getBitWidth() == BitWidth &&
734 Min.getBitWidth() == BitWidth && Max.getBitWidth() == BitWidth &&
735 "Ty, KnownZero, KnownOne and Min, Max must have equal bitwidth.");
736 APInt UnknownBits = ~(KnownZero|KnownOne);
738 // The minimum value is when all unknown bits are zeros, EXCEPT for the sign
739 // bit if it is unknown.
741 Max = KnownOne|UnknownBits;
743 if (UnknownBits[BitWidth-1]) { // Sign bit is unknown
745 Max.clear(BitWidth-1);
749 // ComputeUnsignedMinMaxValuesFromKnownBits - Given an unsigned integer type and
750 // a set of known zero and one bits, compute the maximum and minimum values that
751 // could have the specified known zero and known one bits, returning them in
753 static void ComputeUnsignedMinMaxValuesFromKnownBits(const Type *Ty,
754 const APInt &KnownZero,
755 const APInt &KnownOne,
756 APInt &Min, APInt &Max) {
757 uint32_t BitWidth = cast<IntegerType>(Ty)->getBitWidth(); BitWidth = BitWidth;
758 assert(KnownZero.getBitWidth() == BitWidth &&
759 KnownOne.getBitWidth() == BitWidth &&
760 Min.getBitWidth() == BitWidth && Max.getBitWidth() &&
761 "Ty, KnownZero, KnownOne and Min, Max must have equal bitwidth.");
762 APInt UnknownBits = ~(KnownZero|KnownOne);
764 // The minimum value is when the unknown bits are all zeros.
766 // The maximum value is when the unknown bits are all ones.
767 Max = KnownOne|UnknownBits;
770 /// SimplifyDemandedBits - This function attempts to replace V with a simpler
771 /// value based on the demanded bits. When this function is called, it is known
772 /// that only the bits set in DemandedMask of the result of V are ever used
773 /// downstream. Consequently, depending on the mask and V, it may be possible
774 /// to replace V with a constant or one of its operands. In such cases, this
775 /// function does the replacement and returns true. In all other cases, it
776 /// returns false after analyzing the expression and setting KnownOne and known
777 /// to be one in the expression. KnownZero contains all the bits that are known
778 /// to be zero in the expression. These are provided to potentially allow the
779 /// caller (which might recursively be SimplifyDemandedBits itself) to simplify
780 /// the expression. KnownOne and KnownZero always follow the invariant that
781 /// KnownOne & KnownZero == 0. That is, a bit can't be both 1 and 0. Note that
782 /// the bits in KnownOne and KnownZero may only be accurate for those bits set
783 /// in DemandedMask. Note also that the bitwidth of V, DemandedMask, KnownZero
784 /// and KnownOne must all be the same.
785 bool InstCombiner::SimplifyDemandedBits(Value *V, APInt DemandedMask,
786 APInt& KnownZero, APInt& KnownOne,
788 assert(V != 0 && "Null pointer of Value???");
789 assert(Depth <= 6 && "Limit Search Depth");
790 uint32_t BitWidth = DemandedMask.getBitWidth();
791 const IntegerType *VTy = cast<IntegerType>(V->getType());
792 assert(VTy->getBitWidth() == BitWidth &&
793 KnownZero.getBitWidth() == BitWidth &&
794 KnownOne.getBitWidth() == BitWidth &&
795 "Value *V, DemandedMask, KnownZero and KnownOne \
796 must have same BitWidth");
797 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
798 // We know all of the bits for a constant!
799 KnownOne = CI->getValue() & DemandedMask;
800 KnownZero = ~KnownOne & DemandedMask;
806 if (!V->hasOneUse()) { // Other users may use these bits.
807 if (Depth != 0) { // Not at the root.
808 // Just compute the KnownZero/KnownOne bits to simplify things downstream.
809 ComputeMaskedBits(V, DemandedMask, KnownZero, KnownOne, Depth);
812 // If this is the root being simplified, allow it to have multiple uses,
813 // just set the DemandedMask to all bits.
814 DemandedMask = APInt::getAllOnesValue(BitWidth);
815 } else if (DemandedMask == 0) { // Not demanding any bits from V.
816 if (V != UndefValue::get(VTy))
817 return UpdateValueUsesWith(V, UndefValue::get(VTy));
819 } else if (Depth == 6) { // Limit search depth.
823 Instruction *I = dyn_cast<Instruction>(V);
824 if (!I) return false; // Only analyze instructions.
826 APInt LHSKnownZero(BitWidth, 0), LHSKnownOne(BitWidth, 0);
827 APInt &RHSKnownZero = KnownZero, &RHSKnownOne = KnownOne;
828 switch (I->getOpcode()) {
830 ComputeMaskedBits(V, DemandedMask, RHSKnownZero, RHSKnownOne, Depth);
832 case Instruction::And:
833 // If either the LHS or the RHS are Zero, the result is zero.
834 if (SimplifyDemandedBits(I->getOperand(1), DemandedMask,
835 RHSKnownZero, RHSKnownOne, Depth+1))
837 assert((RHSKnownZero & RHSKnownOne) == 0 &&
838 "Bits known to be one AND zero?");
840 // If something is known zero on the RHS, the bits aren't demanded on the
842 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask & ~RHSKnownZero,
843 LHSKnownZero, LHSKnownOne, Depth+1))
845 assert((LHSKnownZero & LHSKnownOne) == 0 &&
846 "Bits known to be one AND zero?");
848 // If all of the demanded bits are known 1 on one side, return the other.
849 // These bits cannot contribute to the result of the 'and'.
850 if ((DemandedMask & ~LHSKnownZero & RHSKnownOne) ==
851 (DemandedMask & ~LHSKnownZero))
852 return UpdateValueUsesWith(I, I->getOperand(0));
853 if ((DemandedMask & ~RHSKnownZero & LHSKnownOne) ==
854 (DemandedMask & ~RHSKnownZero))
855 return UpdateValueUsesWith(I, I->getOperand(1));
857 // If all of the demanded bits in the inputs are known zeros, return zero.
858 if ((DemandedMask & (RHSKnownZero|LHSKnownZero)) == DemandedMask)
859 return UpdateValueUsesWith(I, Constant::getNullValue(VTy));
861 // If the RHS is a constant, see if we can simplify it.
862 if (ShrinkDemandedConstant(I, 1, DemandedMask & ~LHSKnownZero))
863 return UpdateValueUsesWith(I, I);
865 // Output known-1 bits are only known if set in both the LHS & RHS.
866 RHSKnownOne &= LHSKnownOne;
867 // Output known-0 are known to be clear if zero in either the LHS | RHS.
868 RHSKnownZero |= LHSKnownZero;
870 case Instruction::Or:
871 // If either the LHS or the RHS are One, the result is One.
872 if (SimplifyDemandedBits(I->getOperand(1), DemandedMask,
873 RHSKnownZero, RHSKnownOne, Depth+1))
875 assert((RHSKnownZero & RHSKnownOne) == 0 &&
876 "Bits known to be one AND zero?");
877 // If something is known one on the RHS, the bits aren't demanded on the
879 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask & ~RHSKnownOne,
880 LHSKnownZero, LHSKnownOne, Depth+1))
882 assert((LHSKnownZero & LHSKnownOne) == 0 &&
883 "Bits known to be one AND zero?");
885 // If all of the demanded bits are known zero on one side, return the other.
886 // These bits cannot contribute to the result of the 'or'.
887 if ((DemandedMask & ~LHSKnownOne & RHSKnownZero) ==
888 (DemandedMask & ~LHSKnownOne))
889 return UpdateValueUsesWith(I, I->getOperand(0));
890 if ((DemandedMask & ~RHSKnownOne & LHSKnownZero) ==
891 (DemandedMask & ~RHSKnownOne))
892 return UpdateValueUsesWith(I, I->getOperand(1));
894 // If all of the potentially set bits on one side are known to be set on
895 // the other side, just use the 'other' side.
896 if ((DemandedMask & (~RHSKnownZero) & LHSKnownOne) ==
897 (DemandedMask & (~RHSKnownZero)))
898 return UpdateValueUsesWith(I, I->getOperand(0));
899 if ((DemandedMask & (~LHSKnownZero) & RHSKnownOne) ==
900 (DemandedMask & (~LHSKnownZero)))
901 return UpdateValueUsesWith(I, I->getOperand(1));
903 // If the RHS is a constant, see if we can simplify it.
904 if (ShrinkDemandedConstant(I, 1, DemandedMask))
905 return UpdateValueUsesWith(I, I);
907 // Output known-0 bits are only known if clear in both the LHS & RHS.
908 RHSKnownZero &= LHSKnownZero;
909 // Output known-1 are known to be set if set in either the LHS | RHS.
910 RHSKnownOne |= LHSKnownOne;
912 case Instruction::Xor: {
913 if (SimplifyDemandedBits(I->getOperand(1), DemandedMask,
914 RHSKnownZero, RHSKnownOne, Depth+1))
916 assert((RHSKnownZero & RHSKnownOne) == 0 &&
917 "Bits known to be one AND zero?");
918 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask,
919 LHSKnownZero, LHSKnownOne, Depth+1))
921 assert((LHSKnownZero & LHSKnownOne) == 0 &&
922 "Bits known to be one AND zero?");
924 // If all of the demanded bits are known zero on one side, return the other.
925 // These bits cannot contribute to the result of the 'xor'.
926 if ((DemandedMask & RHSKnownZero) == DemandedMask)
927 return UpdateValueUsesWith(I, I->getOperand(0));
928 if ((DemandedMask & LHSKnownZero) == DemandedMask)
929 return UpdateValueUsesWith(I, I->getOperand(1));
931 // Output known-0 bits are known if clear or set in both the LHS & RHS.
932 APInt KnownZeroOut = (RHSKnownZero & LHSKnownZero) |
933 (RHSKnownOne & LHSKnownOne);
934 // Output known-1 are known to be set if set in only one of the LHS, RHS.
935 APInt KnownOneOut = (RHSKnownZero & LHSKnownOne) |
936 (RHSKnownOne & LHSKnownZero);
938 // If all of the demanded bits are known to be zero on one side or the
939 // other, turn this into an *inclusive* or.
940 // e.g. (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
941 if ((DemandedMask & ~RHSKnownZero & ~LHSKnownZero) == 0) {
943 BinaryOperator::CreateOr(I->getOperand(0), I->getOperand(1),
945 InsertNewInstBefore(Or, *I);
946 return UpdateValueUsesWith(I, Or);
949 // If all of the demanded bits on one side are known, and all of the set
950 // bits on that side are also known to be set on the other side, turn this
951 // into an AND, as we know the bits will be cleared.
952 // e.g. (X | C1) ^ C2 --> (X | C1) & ~C2 iff (C1&C2) == C2
953 if ((DemandedMask & (RHSKnownZero|RHSKnownOne)) == DemandedMask) {
955 if ((RHSKnownOne & LHSKnownOne) == RHSKnownOne) {
956 Constant *AndC = ConstantInt::get(~RHSKnownOne & DemandedMask);
958 BinaryOperator::CreateAnd(I->getOperand(0), AndC, "tmp");
959 InsertNewInstBefore(And, *I);
960 return UpdateValueUsesWith(I, And);
964 // If the RHS is a constant, see if we can simplify it.
965 // FIXME: for XOR, we prefer to force bits to 1 if they will make a -1.
966 if (ShrinkDemandedConstant(I, 1, DemandedMask))
967 return UpdateValueUsesWith(I, I);
969 RHSKnownZero = KnownZeroOut;
970 RHSKnownOne = KnownOneOut;
973 case Instruction::Select:
974 if (SimplifyDemandedBits(I->getOperand(2), DemandedMask,
975 RHSKnownZero, RHSKnownOne, Depth+1))
977 if (SimplifyDemandedBits(I->getOperand(1), DemandedMask,
978 LHSKnownZero, LHSKnownOne, Depth+1))
980 assert((RHSKnownZero & RHSKnownOne) == 0 &&
981 "Bits known to be one AND zero?");
982 assert((LHSKnownZero & LHSKnownOne) == 0 &&
983 "Bits known to be one AND zero?");
985 // If the operands are constants, see if we can simplify them.
986 if (ShrinkDemandedConstant(I, 1, DemandedMask))
987 return UpdateValueUsesWith(I, I);
988 if (ShrinkDemandedConstant(I, 2, DemandedMask))
989 return UpdateValueUsesWith(I, I);
991 // Only known if known in both the LHS and RHS.
992 RHSKnownOne &= LHSKnownOne;
993 RHSKnownZero &= LHSKnownZero;
995 case Instruction::Trunc: {
997 cast<IntegerType>(I->getOperand(0)->getType())->getBitWidth();
998 DemandedMask.zext(truncBf);
999 RHSKnownZero.zext(truncBf);
1000 RHSKnownOne.zext(truncBf);
1001 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask,
1002 RHSKnownZero, RHSKnownOne, Depth+1))
1004 DemandedMask.trunc(BitWidth);
1005 RHSKnownZero.trunc(BitWidth);
1006 RHSKnownOne.trunc(BitWidth);
1007 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1008 "Bits known to be one AND zero?");
1011 case Instruction::BitCast:
1012 if (!I->getOperand(0)->getType()->isInteger())
1015 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask,
1016 RHSKnownZero, RHSKnownOne, Depth+1))
1018 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1019 "Bits known to be one AND zero?");
1021 case Instruction::ZExt: {
1022 // Compute the bits in the result that are not present in the input.
1023 const IntegerType *SrcTy = cast<IntegerType>(I->getOperand(0)->getType());
1024 uint32_t SrcBitWidth = SrcTy->getBitWidth();
1026 DemandedMask.trunc(SrcBitWidth);
1027 RHSKnownZero.trunc(SrcBitWidth);
1028 RHSKnownOne.trunc(SrcBitWidth);
1029 if (SimplifyDemandedBits(I->getOperand(0), DemandedMask,
1030 RHSKnownZero, RHSKnownOne, Depth+1))
1032 DemandedMask.zext(BitWidth);
1033 RHSKnownZero.zext(BitWidth);
1034 RHSKnownOne.zext(BitWidth);
1035 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1036 "Bits known to be one AND zero?");
1037 // The top bits are known to be zero.
1038 RHSKnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth);
1041 case Instruction::SExt: {
1042 // Compute the bits in the result that are not present in the input.
1043 const IntegerType *SrcTy = cast<IntegerType>(I->getOperand(0)->getType());
1044 uint32_t SrcBitWidth = SrcTy->getBitWidth();
1046 APInt InputDemandedBits = DemandedMask &
1047 APInt::getLowBitsSet(BitWidth, SrcBitWidth);
1049 APInt NewBits(APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth));
1050 // If any of the sign extended bits are demanded, we know that the sign
1052 if ((NewBits & DemandedMask) != 0)
1053 InputDemandedBits.set(SrcBitWidth-1);
1055 InputDemandedBits.trunc(SrcBitWidth);
1056 RHSKnownZero.trunc(SrcBitWidth);
1057 RHSKnownOne.trunc(SrcBitWidth);
1058 if (SimplifyDemandedBits(I->getOperand(0), InputDemandedBits,
1059 RHSKnownZero, RHSKnownOne, Depth+1))
1061 InputDemandedBits.zext(BitWidth);
1062 RHSKnownZero.zext(BitWidth);
1063 RHSKnownOne.zext(BitWidth);
1064 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1065 "Bits known to be one AND zero?");
1067 // If the sign bit of the input is known set or clear, then we know the
1068 // top bits of the result.
1070 // If the input sign bit is known zero, or if the NewBits are not demanded
1071 // convert this into a zero extension.
1072 if (RHSKnownZero[SrcBitWidth-1] || (NewBits & ~DemandedMask) == NewBits)
1074 // Convert to ZExt cast
1075 CastInst *NewCast = new ZExtInst(I->getOperand(0), VTy, I->getName(), I);
1076 return UpdateValueUsesWith(I, NewCast);
1077 } else if (RHSKnownOne[SrcBitWidth-1]) { // Input sign bit known set
1078 RHSKnownOne |= NewBits;
1082 case Instruction::Add: {
1083 // Figure out what the input bits are. If the top bits of the and result
1084 // are not demanded, then the add doesn't demand them from its input
1086 uint32_t NLZ = DemandedMask.countLeadingZeros();
1088 // If there is a constant on the RHS, there are a variety of xformations
1090 if (ConstantInt *RHS = dyn_cast<ConstantInt>(I->getOperand(1))) {
1091 // If null, this should be simplified elsewhere. Some of the xforms here
1092 // won't work if the RHS is zero.
1096 // If the top bit of the output is demanded, demand everything from the
1097 // input. Otherwise, we demand all the input bits except NLZ top bits.
1098 APInt InDemandedBits(APInt::getLowBitsSet(BitWidth, BitWidth - NLZ));
1100 // Find information about known zero/one bits in the input.
1101 if (SimplifyDemandedBits(I->getOperand(0), InDemandedBits,
1102 LHSKnownZero, LHSKnownOne, Depth+1))
1105 // If the RHS of the add has bits set that can't affect the input, reduce
1107 if (ShrinkDemandedConstant(I, 1, InDemandedBits))
1108 return UpdateValueUsesWith(I, I);
1110 // Avoid excess work.
1111 if (LHSKnownZero == 0 && LHSKnownOne == 0)
1114 // Turn it into OR if input bits are zero.
1115 if ((LHSKnownZero & RHS->getValue()) == RHS->getValue()) {
1117 BinaryOperator::CreateOr(I->getOperand(0), I->getOperand(1),
1119 InsertNewInstBefore(Or, *I);
1120 return UpdateValueUsesWith(I, Or);
1123 // We can say something about the output known-zero and known-one bits,
1124 // depending on potential carries from the input constant and the
1125 // unknowns. For example if the LHS is known to have at most the 0x0F0F0
1126 // bits set and the RHS constant is 0x01001, then we know we have a known
1127 // one mask of 0x00001 and a known zero mask of 0xE0F0E.
1129 // To compute this, we first compute the potential carry bits. These are
1130 // the bits which may be modified. I'm not aware of a better way to do
1132 const APInt& RHSVal = RHS->getValue();
1133 APInt CarryBits((~LHSKnownZero + RHSVal) ^ (~LHSKnownZero ^ RHSVal));
1135 // Now that we know which bits have carries, compute the known-1/0 sets.
1137 // Bits are known one if they are known zero in one operand and one in the
1138 // other, and there is no input carry.
1139 RHSKnownOne = ((LHSKnownZero & RHSVal) |
1140 (LHSKnownOne & ~RHSVal)) & ~CarryBits;
1142 // Bits are known zero if they are known zero in both operands and there
1143 // is no input carry.
1144 RHSKnownZero = LHSKnownZero & ~RHSVal & ~CarryBits;
1146 // If the high-bits of this ADD are not demanded, then it does not demand
1147 // the high bits of its LHS or RHS.
1148 if (DemandedMask[BitWidth-1] == 0) {
1149 // Right fill the mask of bits for this ADD to demand the most
1150 // significant bit and all those below it.
1151 APInt DemandedFromOps(APInt::getLowBitsSet(BitWidth, BitWidth-NLZ));
1152 if (SimplifyDemandedBits(I->getOperand(0), DemandedFromOps,
1153 LHSKnownZero, LHSKnownOne, Depth+1))
1155 if (SimplifyDemandedBits(I->getOperand(1), DemandedFromOps,
1156 LHSKnownZero, LHSKnownOne, Depth+1))
1162 case Instruction::Sub:
1163 // If the high-bits of this SUB are not demanded, then it does not demand
1164 // the high bits of its LHS or RHS.
1165 if (DemandedMask[BitWidth-1] == 0) {
1166 // Right fill the mask of bits for this SUB to demand the most
1167 // significant bit and all those below it.
1168 uint32_t NLZ = DemandedMask.countLeadingZeros();
1169 APInt DemandedFromOps(APInt::getLowBitsSet(BitWidth, BitWidth-NLZ));
1170 if (SimplifyDemandedBits(I->getOperand(0), DemandedFromOps,
1171 LHSKnownZero, LHSKnownOne, Depth+1))
1173 if (SimplifyDemandedBits(I->getOperand(1), DemandedFromOps,
1174 LHSKnownZero, LHSKnownOne, Depth+1))
1177 // Otherwise just hand the sub off to ComputeMaskedBits to fill in
1178 // the known zeros and ones.
1179 ComputeMaskedBits(V, DemandedMask, RHSKnownZero, RHSKnownOne, Depth);
1181 case Instruction::Shl:
1182 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
1183 uint64_t ShiftAmt = SA->getLimitedValue(BitWidth);
1184 APInt DemandedMaskIn(DemandedMask.lshr(ShiftAmt));
1185 if (SimplifyDemandedBits(I->getOperand(0), DemandedMaskIn,
1186 RHSKnownZero, RHSKnownOne, Depth+1))
1188 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1189 "Bits known to be one AND zero?");
1190 RHSKnownZero <<= ShiftAmt;
1191 RHSKnownOne <<= ShiftAmt;
1192 // low bits known zero.
1194 RHSKnownZero |= APInt::getLowBitsSet(BitWidth, ShiftAmt);
1197 case Instruction::LShr:
1198 // For a logical shift right
1199 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
1200 uint64_t ShiftAmt = SA->getLimitedValue(BitWidth);
1202 // Unsigned shift right.
1203 APInt DemandedMaskIn(DemandedMask.shl(ShiftAmt));
1204 if (SimplifyDemandedBits(I->getOperand(0), DemandedMaskIn,
1205 RHSKnownZero, RHSKnownOne, Depth+1))
1207 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1208 "Bits known to be one AND zero?");
1209 RHSKnownZero = APIntOps::lshr(RHSKnownZero, ShiftAmt);
1210 RHSKnownOne = APIntOps::lshr(RHSKnownOne, ShiftAmt);
1212 // Compute the new bits that are at the top now.
1213 APInt HighBits(APInt::getHighBitsSet(BitWidth, ShiftAmt));
1214 RHSKnownZero |= HighBits; // high bits known zero.
1218 case Instruction::AShr:
1219 // If this is an arithmetic shift right and only the low-bit is set, we can
1220 // always convert this into a logical shr, even if the shift amount is
1221 // variable. The low bit of the shift cannot be an input sign bit unless
1222 // the shift amount is >= the size of the datatype, which is undefined.
1223 if (DemandedMask == 1) {
1224 // Perform the logical shift right.
1225 Value *NewVal = BinaryOperator::CreateLShr(
1226 I->getOperand(0), I->getOperand(1), I->getName());
1227 InsertNewInstBefore(cast<Instruction>(NewVal), *I);
1228 return UpdateValueUsesWith(I, NewVal);
1231 // If the sign bit is the only bit demanded by this ashr, then there is no
1232 // need to do it, the shift doesn't change the high bit.
1233 if (DemandedMask.isSignBit())
1234 return UpdateValueUsesWith(I, I->getOperand(0));
1236 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
1237 uint32_t ShiftAmt = SA->getLimitedValue(BitWidth);
1239 // Signed shift right.
1240 APInt DemandedMaskIn(DemandedMask.shl(ShiftAmt));
1241 // If any of the "high bits" are demanded, we should set the sign bit as
1243 if (DemandedMask.countLeadingZeros() <= ShiftAmt)
1244 DemandedMaskIn.set(BitWidth-1);
1245 if (SimplifyDemandedBits(I->getOperand(0),
1247 RHSKnownZero, RHSKnownOne, Depth+1))
1249 assert((RHSKnownZero & RHSKnownOne) == 0 &&
1250 "Bits known to be one AND zero?");
1251 // Compute the new bits that are at the top now.
1252 APInt HighBits(APInt::getHighBitsSet(BitWidth, ShiftAmt));
1253 RHSKnownZero = APIntOps::lshr(RHSKnownZero, ShiftAmt);
1254 RHSKnownOne = APIntOps::lshr(RHSKnownOne, ShiftAmt);
1256 // Handle the sign bits.
1257 APInt SignBit(APInt::getSignBit(BitWidth));
1258 // Adjust to where it is now in the mask.
1259 SignBit = APIntOps::lshr(SignBit, ShiftAmt);
1261 // If the input sign bit is known to be zero, or if none of the top bits
1262 // are demanded, turn this into an unsigned shift right.
1263 if (BitWidth <= ShiftAmt || RHSKnownZero[BitWidth-ShiftAmt-1] ||
1264 (HighBits & ~DemandedMask) == HighBits) {
1265 // Perform the logical shift right.
1266 Value *NewVal = BinaryOperator::CreateLShr(
1267 I->getOperand(0), SA, I->getName());
1268 InsertNewInstBefore(cast<Instruction>(NewVal), *I);
1269 return UpdateValueUsesWith(I, NewVal);
1270 } else if ((RHSKnownOne & SignBit) != 0) { // New bits are known one.
1271 RHSKnownOne |= HighBits;
1275 case Instruction::SRem:
1276 if (ConstantInt *Rem = dyn_cast<ConstantInt>(I->getOperand(1))) {
1277 APInt RA = Rem->getValue().abs();
1278 if (RA.isPowerOf2()) {
1279 if (DemandedMask.ule(RA)) // srem won't affect demanded bits
1280 return UpdateValueUsesWith(I, I->getOperand(0));
1282 APInt LowBits = RA - 1;
1283 APInt Mask2 = LowBits | APInt::getSignBit(BitWidth);
1284 if (SimplifyDemandedBits(I->getOperand(0), Mask2,
1285 LHSKnownZero, LHSKnownOne, Depth+1))
1288 if (LHSKnownZero[BitWidth-1] || ((LHSKnownZero & LowBits) == LowBits))
1289 LHSKnownZero |= ~LowBits;
1291 KnownZero |= LHSKnownZero & DemandedMask;
1293 assert((KnownZero & KnownOne) == 0&&"Bits known to be one AND zero?");
1297 case Instruction::URem: {
1298 APInt KnownZero2(BitWidth, 0), KnownOne2(BitWidth, 0);
1299 APInt AllOnes = APInt::getAllOnesValue(BitWidth);
1300 if (SimplifyDemandedBits(I->getOperand(0), AllOnes,
1301 KnownZero2, KnownOne2, Depth+1))
1304 uint32_t Leaders = KnownZero2.countLeadingOnes();
1305 if (SimplifyDemandedBits(I->getOperand(1), AllOnes,
1306 KnownZero2, KnownOne2, Depth+1))
1309 Leaders = std::max(Leaders,
1310 KnownZero2.countLeadingOnes());
1311 KnownZero = APInt::getHighBitsSet(BitWidth, Leaders) & DemandedMask;
1314 case Instruction::Call:
1315 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) {
1316 switch (II->getIntrinsicID()) {
1318 case Intrinsic::bswap: {
1319 // If the only bits demanded come from one byte of the bswap result,
1320 // just shift the input byte into position to eliminate the bswap.
1321 unsigned NLZ = DemandedMask.countLeadingZeros();
1322 unsigned NTZ = DemandedMask.countTrailingZeros();
1324 // Round NTZ down to the next byte. If we have 11 trailing zeros, then
1325 // we need all the bits down to bit 8. Likewise, round NLZ. If we
1326 // have 14 leading zeros, round to 8.
1329 // If we need exactly one byte, we can do this transformation.
1330 if (BitWidth-NLZ-NTZ == 8) {
1331 unsigned ResultBit = NTZ;
1332 unsigned InputBit = BitWidth-NTZ-8;
1334 // Replace this with either a left or right shift to get the byte into
1336 Instruction *NewVal;
1337 if (InputBit > ResultBit)
1338 NewVal = BinaryOperator::CreateLShr(I->getOperand(1),
1339 ConstantInt::get(I->getType(), InputBit-ResultBit));
1341 NewVal = BinaryOperator::CreateShl(I->getOperand(1),
1342 ConstantInt::get(I->getType(), ResultBit-InputBit));
1343 NewVal->takeName(I);
1344 InsertNewInstBefore(NewVal, *I);
1345 return UpdateValueUsesWith(I, NewVal);
1348 // TODO: Could compute known zero/one bits based on the input.
1353 ComputeMaskedBits(V, DemandedMask, RHSKnownZero, RHSKnownOne, Depth);
1357 // If the client is only demanding bits that we know, return the known
1359 if ((DemandedMask & (RHSKnownZero|RHSKnownOne)) == DemandedMask)
1360 return UpdateValueUsesWith(I, ConstantInt::get(RHSKnownOne));
1365 /// SimplifyDemandedVectorElts - The specified value produces a vector with
1366 /// 64 or fewer elements. DemandedElts contains the set of elements that are
1367 /// actually used by the caller. This method analyzes which elements of the
1368 /// operand are undef and returns that information in UndefElts.
1370 /// If the information about demanded elements can be used to simplify the
1371 /// operation, the operation is simplified, then the resultant value is
1372 /// returned. This returns null if no change was made.
1373 Value *InstCombiner::SimplifyDemandedVectorElts(Value *V, uint64_t DemandedElts,
1374 uint64_t &UndefElts,
1376 unsigned VWidth = cast<VectorType>(V->getType())->getNumElements();
1377 assert(VWidth <= 64 && "Vector too wide to analyze!");
1378 uint64_t EltMask = ~0ULL >> (64-VWidth);
1379 assert((DemandedElts & ~EltMask) == 0 && "Invalid DemandedElts!");
1381 if (isa<UndefValue>(V)) {
1382 // If the entire vector is undefined, just return this info.
1383 UndefElts = EltMask;
1385 } else if (DemandedElts == 0) { // If nothing is demanded, provide undef.
1386 UndefElts = EltMask;
1387 return UndefValue::get(V->getType());
1391 if (ConstantVector *CP = dyn_cast<ConstantVector>(V)) {
1392 const Type *EltTy = cast<VectorType>(V->getType())->getElementType();
1393 Constant *Undef = UndefValue::get(EltTy);
1395 std::vector<Constant*> Elts;
1396 for (unsigned i = 0; i != VWidth; ++i)
1397 if (!(DemandedElts & (1ULL << i))) { // If not demanded, set to undef.
1398 Elts.push_back(Undef);
1399 UndefElts |= (1ULL << i);
1400 } else if (isa<UndefValue>(CP->getOperand(i))) { // Already undef.
1401 Elts.push_back(Undef);
1402 UndefElts |= (1ULL << i);
1403 } else { // Otherwise, defined.
1404 Elts.push_back(CP->getOperand(i));
1407 // If we changed the constant, return it.
1408 Constant *NewCP = ConstantVector::get(Elts);
1409 return NewCP != CP ? NewCP : 0;
1410 } else if (isa<ConstantAggregateZero>(V)) {
1411 // Simplify the CAZ to a ConstantVector where the non-demanded elements are
1414 // Check if this is identity. If so, return 0 since we are not simplifying
1416 if (DemandedElts == ((1ULL << VWidth) -1))
1419 const Type *EltTy = cast<VectorType>(V->getType())->getElementType();
1420 Constant *Zero = Constant::getNullValue(EltTy);
1421 Constant *Undef = UndefValue::get(EltTy);
1422 std::vector<Constant*> Elts;
1423 for (unsigned i = 0; i != VWidth; ++i)
1424 Elts.push_back((DemandedElts & (1ULL << i)) ? Zero : Undef);
1425 UndefElts = DemandedElts ^ EltMask;
1426 return ConstantVector::get(Elts);
1429 // Limit search depth.
1433 // If multiple users are using the root value, procede with
1434 // simplification conservatively assuming that all elements
1436 if (!V->hasOneUse()) {
1437 // Quit if we find multiple users of a non-root value though.
1438 // They'll be handled when it's their turn to be visited by
1439 // the main instcombine process.
1441 // TODO: Just compute the UndefElts information recursively.
1444 // Conservatively assume that all elements are needed.
1445 DemandedElts = EltMask;
1448 Instruction *I = dyn_cast<Instruction>(V);
1449 if (!I) return false; // Only analyze instructions.
1451 bool MadeChange = false;
1452 uint64_t UndefElts2;
1454 switch (I->getOpcode()) {
1457 case Instruction::InsertElement: {
1458 // If this is a variable index, we don't know which element it overwrites.
1459 // demand exactly the same input as we produce.
1460 ConstantInt *Idx = dyn_cast<ConstantInt>(I->getOperand(2));
1462 // Note that we can't propagate undef elt info, because we don't know
1463 // which elt is getting updated.
1464 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), DemandedElts,
1465 UndefElts2, Depth+1);
1466 if (TmpV) { I->setOperand(0, TmpV); MadeChange = true; }
1470 // If this is inserting an element that isn't demanded, remove this
1472 unsigned IdxNo = Idx->getZExtValue();
1473 if (IdxNo >= VWidth || (DemandedElts & (1ULL << IdxNo)) == 0)
1474 return AddSoonDeadInstToWorklist(*I, 0);
1476 // Otherwise, the element inserted overwrites whatever was there, so the
1477 // input demanded set is simpler than the output set.
1478 TmpV = SimplifyDemandedVectorElts(I->getOperand(0),
1479 DemandedElts & ~(1ULL << IdxNo),
1480 UndefElts, Depth+1);
1481 if (TmpV) { I->setOperand(0, TmpV); MadeChange = true; }
1483 // The inserted element is defined.
1484 UndefElts &= ~(1ULL << IdxNo);
1487 case Instruction::ShuffleVector: {
1488 ShuffleVectorInst *Shuffle = cast<ShuffleVectorInst>(I);
1489 uint64_t LHSVWidth =
1490 cast<VectorType>(Shuffle->getOperand(0)->getType())->getNumElements();
1491 uint64_t LeftDemanded = 0, RightDemanded = 0;
1492 for (unsigned i = 0; i < VWidth; i++) {
1493 if (DemandedElts & (1ULL << i)) {
1494 unsigned MaskVal = Shuffle->getMaskValue(i);
1495 if (MaskVal != -1u) {
1496 assert(MaskVal < LHSVWidth * 2 &&
1497 "shufflevector mask index out of range!");
1498 if (MaskVal < LHSVWidth)
1499 LeftDemanded |= 1ULL << MaskVal;
1501 RightDemanded |= 1ULL << (MaskVal - LHSVWidth);
1506 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), LeftDemanded,
1507 UndefElts2, Depth+1);
1508 if (TmpV) { I->setOperand(0, TmpV); MadeChange = true; }
1510 uint64_t UndefElts3;
1511 TmpV = SimplifyDemandedVectorElts(I->getOperand(1), RightDemanded,
1512 UndefElts3, Depth+1);
1513 if (TmpV) { I->setOperand(1, TmpV); MadeChange = true; }
1515 bool NewUndefElts = false;
1516 for (unsigned i = 0; i < VWidth; i++) {
1517 unsigned MaskVal = Shuffle->getMaskValue(i);
1518 if (MaskVal == -1u) {
1519 uint64_t NewBit = 1ULL << i;
1520 UndefElts |= NewBit;
1521 } else if (MaskVal < LHSVWidth) {
1522 uint64_t NewBit = ((UndefElts2 >> MaskVal) & 1) << i;
1523 NewUndefElts |= NewBit;
1524 UndefElts |= NewBit;
1526 uint64_t NewBit = ((UndefElts3 >> (MaskVal - LHSVWidth)) & 1) << i;
1527 NewUndefElts |= NewBit;
1528 UndefElts |= NewBit;
1533 // Add additional discovered undefs.
1534 std::vector<Constant*> Elts;
1535 for (unsigned i = 0; i < VWidth; ++i) {
1536 if (UndefElts & (1ULL << i))
1537 Elts.push_back(UndefValue::get(Type::Int32Ty));
1539 Elts.push_back(ConstantInt::get(Type::Int32Ty,
1540 Shuffle->getMaskValue(i)));
1542 I->setOperand(2, ConstantVector::get(Elts));
1547 case Instruction::BitCast: {
1548 // Vector->vector casts only.
1549 const VectorType *VTy = dyn_cast<VectorType>(I->getOperand(0)->getType());
1551 unsigned InVWidth = VTy->getNumElements();
1552 uint64_t InputDemandedElts = 0;
1555 if (VWidth == InVWidth) {
1556 // If we are converting from <4 x i32> -> <4 x f32>, we demand the same
1557 // elements as are demanded of us.
1559 InputDemandedElts = DemandedElts;
1560 } else if (VWidth > InVWidth) {
1564 // If there are more elements in the result than there are in the source,
1565 // then an input element is live if any of the corresponding output
1566 // elements are live.
1567 Ratio = VWidth/InVWidth;
1568 for (unsigned OutIdx = 0; OutIdx != VWidth; ++OutIdx) {
1569 if (DemandedElts & (1ULL << OutIdx))
1570 InputDemandedElts |= 1ULL << (OutIdx/Ratio);
1576 // If there are more elements in the source than there are in the result,
1577 // then an input element is live if the corresponding output element is
1579 Ratio = InVWidth/VWidth;
1580 for (unsigned InIdx = 0; InIdx != InVWidth; ++InIdx)
1581 if (DemandedElts & (1ULL << InIdx/Ratio))
1582 InputDemandedElts |= 1ULL << InIdx;
1585 // div/rem demand all inputs, because they don't want divide by zero.
1586 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), InputDemandedElts,
1587 UndefElts2, Depth+1);
1589 I->setOperand(0, TmpV);
1593 UndefElts = UndefElts2;
1594 if (VWidth > InVWidth) {
1595 assert(0 && "Unimp");
1596 // If there are more elements in the result than there are in the source,
1597 // then an output element is undef if the corresponding input element is
1599 for (unsigned OutIdx = 0; OutIdx != VWidth; ++OutIdx)
1600 if (UndefElts2 & (1ULL << (OutIdx/Ratio)))
1601 UndefElts |= 1ULL << OutIdx;
1602 } else if (VWidth < InVWidth) {
1603 assert(0 && "Unimp");
1604 // If there are more elements in the source than there are in the result,
1605 // then a result element is undef if all of the corresponding input
1606 // elements are undef.
1607 UndefElts = ~0ULL >> (64-VWidth); // Start out all undef.
1608 for (unsigned InIdx = 0; InIdx != InVWidth; ++InIdx)
1609 if ((UndefElts2 & (1ULL << InIdx)) == 0) // Not undef?
1610 UndefElts &= ~(1ULL << (InIdx/Ratio)); // Clear undef bit.
1614 case Instruction::And:
1615 case Instruction::Or:
1616 case Instruction::Xor:
1617 case Instruction::Add:
1618 case Instruction::Sub:
1619 case Instruction::Mul:
1620 // div/rem demand all inputs, because they don't want divide by zero.
1621 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), DemandedElts,
1622 UndefElts, Depth+1);
1623 if (TmpV) { I->setOperand(0, TmpV); MadeChange = true; }
1624 TmpV = SimplifyDemandedVectorElts(I->getOperand(1), DemandedElts,
1625 UndefElts2, Depth+1);
1626 if (TmpV) { I->setOperand(1, TmpV); MadeChange = true; }
1628 // Output elements are undefined if both are undefined. Consider things
1629 // like undef&0. The result is known zero, not undef.
1630 UndefElts &= UndefElts2;
1633 case Instruction::Call: {
1634 IntrinsicInst *II = dyn_cast<IntrinsicInst>(I);
1636 switch (II->getIntrinsicID()) {
1639 // Binary vector operations that work column-wise. A dest element is a
1640 // function of the corresponding input elements from the two inputs.
1641 case Intrinsic::x86_sse_sub_ss:
1642 case Intrinsic::x86_sse_mul_ss:
1643 case Intrinsic::x86_sse_min_ss:
1644 case Intrinsic::x86_sse_max_ss:
1645 case Intrinsic::x86_sse2_sub_sd:
1646 case Intrinsic::x86_sse2_mul_sd:
1647 case Intrinsic::x86_sse2_min_sd:
1648 case Intrinsic::x86_sse2_max_sd:
1649 TmpV = SimplifyDemandedVectorElts(II->getOperand(1), DemandedElts,
1650 UndefElts, Depth+1);
1651 if (TmpV) { II->setOperand(1, TmpV); MadeChange = true; }
1652 TmpV = SimplifyDemandedVectorElts(II->getOperand(2), DemandedElts,
1653 UndefElts2, Depth+1);
1654 if (TmpV) { II->setOperand(2, TmpV); MadeChange = true; }
1656 // If only the low elt is demanded and this is a scalarizable intrinsic,
1657 // scalarize it now.
1658 if (DemandedElts == 1) {
1659 switch (II->getIntrinsicID()) {
1661 case Intrinsic::x86_sse_sub_ss:
1662 case Intrinsic::x86_sse_mul_ss:
1663 case Intrinsic::x86_sse2_sub_sd:
1664 case Intrinsic::x86_sse2_mul_sd:
1665 // TODO: Lower MIN/MAX/ABS/etc
1666 Value *LHS = II->getOperand(1);
1667 Value *RHS = II->getOperand(2);
1668 // Extract the element as scalars.
1669 LHS = InsertNewInstBefore(new ExtractElementInst(LHS, 0U,"tmp"), *II);
1670 RHS = InsertNewInstBefore(new ExtractElementInst(RHS, 0U,"tmp"), *II);
1672 switch (II->getIntrinsicID()) {
1673 default: assert(0 && "Case stmts out of sync!");
1674 case Intrinsic::x86_sse_sub_ss:
1675 case Intrinsic::x86_sse2_sub_sd:
1676 TmpV = InsertNewInstBefore(BinaryOperator::CreateSub(LHS, RHS,
1677 II->getName()), *II);
1679 case Intrinsic::x86_sse_mul_ss:
1680 case Intrinsic::x86_sse2_mul_sd:
1681 TmpV = InsertNewInstBefore(BinaryOperator::CreateMul(LHS, RHS,
1682 II->getName()), *II);
1687 InsertElementInst::Create(UndefValue::get(II->getType()), TmpV, 0U,
1689 InsertNewInstBefore(New, *II);
1690 AddSoonDeadInstToWorklist(*II, 0);
1695 // Output elements are undefined if both are undefined. Consider things
1696 // like undef&0. The result is known zero, not undef.
1697 UndefElts &= UndefElts2;
1703 return MadeChange ? I : 0;
1707 /// AssociativeOpt - Perform an optimization on an associative operator. This
1708 /// function is designed to check a chain of associative operators for a
1709 /// potential to apply a certain optimization. Since the optimization may be
1710 /// applicable if the expression was reassociated, this checks the chain, then
1711 /// reassociates the expression as necessary to expose the optimization
1712 /// opportunity. This makes use of a special Functor, which must define
1713 /// 'shouldApply' and 'apply' methods.
1715 template<typename Functor>
1716 static Instruction *AssociativeOpt(BinaryOperator &Root, const Functor &F) {
1717 unsigned Opcode = Root.getOpcode();
1718 Value *LHS = Root.getOperand(0);
1720 // Quick check, see if the immediate LHS matches...
1721 if (F.shouldApply(LHS))
1722 return F.apply(Root);
1724 // Otherwise, if the LHS is not of the same opcode as the root, return.
1725 Instruction *LHSI = dyn_cast<Instruction>(LHS);
1726 while (LHSI && LHSI->getOpcode() == Opcode && LHSI->hasOneUse()) {
1727 // Should we apply this transform to the RHS?
1728 bool ShouldApply = F.shouldApply(LHSI->getOperand(1));
1730 // If not to the RHS, check to see if we should apply to the LHS...
1731 if (!ShouldApply && F.shouldApply(LHSI->getOperand(0))) {
1732 cast<BinaryOperator>(LHSI)->swapOperands(); // Make the LHS the RHS
1736 // If the functor wants to apply the optimization to the RHS of LHSI,
1737 // reassociate the expression from ((? op A) op B) to (? op (A op B))
1739 // Now all of the instructions are in the current basic block, go ahead
1740 // and perform the reassociation.
1741 Instruction *TmpLHSI = cast<Instruction>(Root.getOperand(0));
1743 // First move the selected RHS to the LHS of the root...
1744 Root.setOperand(0, LHSI->getOperand(1));
1746 // Make what used to be the LHS of the root be the user of the root...
1747 Value *ExtraOperand = TmpLHSI->getOperand(1);
1748 if (&Root == TmpLHSI) {
1749 Root.replaceAllUsesWith(Constant::getNullValue(TmpLHSI->getType()));
1752 Root.replaceAllUsesWith(TmpLHSI); // Users now use TmpLHSI
1753 TmpLHSI->setOperand(1, &Root); // TmpLHSI now uses the root
1754 BasicBlock::iterator ARI = &Root; ++ARI;
1755 TmpLHSI->moveBefore(ARI); // Move TmpLHSI to after Root
1758 // Now propagate the ExtraOperand down the chain of instructions until we
1760 while (TmpLHSI != LHSI) {
1761 Instruction *NextLHSI = cast<Instruction>(TmpLHSI->getOperand(0));
1762 // Move the instruction to immediately before the chain we are
1763 // constructing to avoid breaking dominance properties.
1764 NextLHSI->moveBefore(ARI);
1767 Value *NextOp = NextLHSI->getOperand(1);
1768 NextLHSI->setOperand(1, ExtraOperand);
1770 ExtraOperand = NextOp;
1773 // Now that the instructions are reassociated, have the functor perform
1774 // the transformation...
1775 return F.apply(Root);
1778 LHSI = dyn_cast<Instruction>(LHSI->getOperand(0));
1785 // AddRHS - Implements: X + X --> X << 1
1788 AddRHS(Value *rhs) : RHS(rhs) {}
1789 bool shouldApply(Value *LHS) const { return LHS == RHS; }
1790 Instruction *apply(BinaryOperator &Add) const {
1791 return BinaryOperator::CreateShl(Add.getOperand(0),
1792 ConstantInt::get(Add.getType(), 1));
1796 // AddMaskingAnd - Implements (A & C1)+(B & C2) --> (A & C1)|(B & C2)
1798 struct AddMaskingAnd {
1800 AddMaskingAnd(Constant *c) : C2(c) {}
1801 bool shouldApply(Value *LHS) const {
1803 return match(LHS, m_And(m_Value(), m_ConstantInt(C1))) &&
1804 ConstantExpr::getAnd(C1, C2)->isNullValue();
1806 Instruction *apply(BinaryOperator &Add) const {
1807 return BinaryOperator::CreateOr(Add.getOperand(0), Add.getOperand(1));
1813 static Value *FoldOperationIntoSelectOperand(Instruction &I, Value *SO,
1815 if (CastInst *CI = dyn_cast<CastInst>(&I)) {
1816 if (Constant *SOC = dyn_cast<Constant>(SO))
1817 return ConstantExpr::getCast(CI->getOpcode(), SOC, I.getType());
1819 return IC->InsertNewInstBefore(CastInst::Create(
1820 CI->getOpcode(), SO, I.getType(), SO->getName() + ".cast"), I);
1823 // Figure out if the constant is the left or the right argument.
1824 bool ConstIsRHS = isa<Constant>(I.getOperand(1));
1825 Constant *ConstOperand = cast<Constant>(I.getOperand(ConstIsRHS));
1827 if (Constant *SOC = dyn_cast<Constant>(SO)) {
1829 return ConstantExpr::get(I.getOpcode(), SOC, ConstOperand);
1830 return ConstantExpr::get(I.getOpcode(), ConstOperand, SOC);
1833 Value *Op0 = SO, *Op1 = ConstOperand;
1835 std::swap(Op0, Op1);
1837 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(&I))
1838 New = BinaryOperator::Create(BO->getOpcode(), Op0, Op1,SO->getName()+".op");
1839 else if (CmpInst *CI = dyn_cast<CmpInst>(&I))
1840 New = CmpInst::Create(CI->getOpcode(), CI->getPredicate(), Op0, Op1,
1841 SO->getName()+".cmp");
1843 assert(0 && "Unknown binary instruction type!");
1846 return IC->InsertNewInstBefore(New, I);
1849 // FoldOpIntoSelect - Given an instruction with a select as one operand and a
1850 // constant as the other operand, try to fold the binary operator into the
1851 // select arguments. This also works for Cast instructions, which obviously do
1852 // not have a second operand.
1853 static Instruction *FoldOpIntoSelect(Instruction &Op, SelectInst *SI,
1855 // Don't modify shared select instructions
1856 if (!SI->hasOneUse()) return 0;
1857 Value *TV = SI->getOperand(1);
1858 Value *FV = SI->getOperand(2);
1860 if (isa<Constant>(TV) || isa<Constant>(FV)) {
1861 // Bool selects with constant operands can be folded to logical ops.
1862 if (SI->getType() == Type::Int1Ty) return 0;
1864 Value *SelectTrueVal = FoldOperationIntoSelectOperand(Op, TV, IC);
1865 Value *SelectFalseVal = FoldOperationIntoSelectOperand(Op, FV, IC);
1867 return SelectInst::Create(SI->getCondition(), SelectTrueVal,
1874 /// FoldOpIntoPhi - Given a binary operator or cast instruction which has a PHI
1875 /// node as operand #0, see if we can fold the instruction into the PHI (which
1876 /// is only possible if all operands to the PHI are constants).
1877 Instruction *InstCombiner::FoldOpIntoPhi(Instruction &I) {
1878 PHINode *PN = cast<PHINode>(I.getOperand(0));
1879 unsigned NumPHIValues = PN->getNumIncomingValues();
1880 if (!PN->hasOneUse() || NumPHIValues == 0) return 0;
1882 // Check to see if all of the operands of the PHI are constants. If there is
1883 // one non-constant value, remember the BB it is. If there is more than one
1884 // or if *it* is a PHI, bail out.
1885 BasicBlock *NonConstBB = 0;
1886 for (unsigned i = 0; i != NumPHIValues; ++i)
1887 if (!isa<Constant>(PN->getIncomingValue(i))) {
1888 if (NonConstBB) return 0; // More than one non-const value.
1889 if (isa<PHINode>(PN->getIncomingValue(i))) return 0; // Itself a phi.
1890 NonConstBB = PN->getIncomingBlock(i);
1892 // If the incoming non-constant value is in I's block, we have an infinite
1894 if (NonConstBB == I.getParent())
1898 // If there is exactly one non-constant value, we can insert a copy of the
1899 // operation in that block. However, if this is a critical edge, we would be
1900 // inserting the computation one some other paths (e.g. inside a loop). Only
1901 // do this if the pred block is unconditionally branching into the phi block.
1903 BranchInst *BI = dyn_cast<BranchInst>(NonConstBB->getTerminator());
1904 if (!BI || !BI->isUnconditional()) return 0;
1907 // Okay, we can do the transformation: create the new PHI node.
1908 PHINode *NewPN = PHINode::Create(I.getType(), "");
1909 NewPN->reserveOperandSpace(PN->getNumOperands()/2);
1910 InsertNewInstBefore(NewPN, *PN);
1911 NewPN->takeName(PN);
1913 // Next, add all of the operands to the PHI.
1914 if (I.getNumOperands() == 2) {
1915 Constant *C = cast<Constant>(I.getOperand(1));
1916 for (unsigned i = 0; i != NumPHIValues; ++i) {
1918 if (Constant *InC = dyn_cast<Constant>(PN->getIncomingValue(i))) {
1919 if (CmpInst *CI = dyn_cast<CmpInst>(&I))
1920 InV = ConstantExpr::getCompare(CI->getPredicate(), InC, C);
1922 InV = ConstantExpr::get(I.getOpcode(), InC, C);
1924 assert(PN->getIncomingBlock(i) == NonConstBB);
1925 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(&I))
1926 InV = BinaryOperator::Create(BO->getOpcode(),
1927 PN->getIncomingValue(i), C, "phitmp",
1928 NonConstBB->getTerminator());
1929 else if (CmpInst *CI = dyn_cast<CmpInst>(&I))
1930 InV = CmpInst::Create(CI->getOpcode(),
1932 PN->getIncomingValue(i), C, "phitmp",
1933 NonConstBB->getTerminator());
1935 assert(0 && "Unknown binop!");
1937 AddToWorkList(cast<Instruction>(InV));
1939 NewPN->addIncoming(InV, PN->getIncomingBlock(i));
1942 CastInst *CI = cast<CastInst>(&I);
1943 const Type *RetTy = CI->getType();
1944 for (unsigned i = 0; i != NumPHIValues; ++i) {
1946 if (Constant *InC = dyn_cast<Constant>(PN->getIncomingValue(i))) {
1947 InV = ConstantExpr::getCast(CI->getOpcode(), InC, RetTy);
1949 assert(PN->getIncomingBlock(i) == NonConstBB);
1950 InV = CastInst::Create(CI->getOpcode(), PN->getIncomingValue(i),
1951 I.getType(), "phitmp",
1952 NonConstBB->getTerminator());
1953 AddToWorkList(cast<Instruction>(InV));
1955 NewPN->addIncoming(InV, PN->getIncomingBlock(i));
1958 return ReplaceInstUsesWith(I, NewPN);
1962 /// WillNotOverflowSignedAdd - Return true if we can prove that:
1963 /// (sext (add LHS, RHS)) === (add (sext LHS), (sext RHS))
1964 /// This basically requires proving that the add in the original type would not
1965 /// overflow to change the sign bit or have a carry out.
1966 bool InstCombiner::WillNotOverflowSignedAdd(Value *LHS, Value *RHS) {
1967 // There are different heuristics we can use for this. Here are some simple
1970 // Add has the property that adding any two 2's complement numbers can only
1971 // have one carry bit which can change a sign. As such, if LHS and RHS each
1972 // have at least two sign bits, we know that the addition of the two values will
1973 // sign extend fine.
1974 if (ComputeNumSignBits(LHS) > 1 && ComputeNumSignBits(RHS) > 1)
1978 // If one of the operands only has one non-zero bit, and if the other operand
1979 // has a known-zero bit in a more significant place than it (not including the
1980 // sign bit) the ripple may go up to and fill the zero, but won't change the
1981 // sign. For example, (X & ~4) + 1.
1989 Instruction *InstCombiner::visitAdd(BinaryOperator &I) {
1990 bool Changed = SimplifyCommutative(I);
1991 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1);
1993 if (Constant *RHSC = dyn_cast<Constant>(RHS)) {
1994 // X + undef -> undef
1995 if (isa<UndefValue>(RHS))
1996 return ReplaceInstUsesWith(I, RHS);
1999 if (!I.getType()->isFPOrFPVector()) { // NOTE: -0 + +0 = +0.
2000 if (RHSC->isNullValue())
2001 return ReplaceInstUsesWith(I, LHS);
2002 } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(RHSC)) {
2003 if (CFP->isExactlyValue(ConstantFP::getNegativeZero
2004 (I.getType())->getValueAPF()))
2005 return ReplaceInstUsesWith(I, LHS);
2008 if (ConstantInt *CI = dyn_cast<ConstantInt>(RHSC)) {
2009 // X + (signbit) --> X ^ signbit
2010 const APInt& Val = CI->getValue();
2011 uint32_t BitWidth = Val.getBitWidth();
2012 if (Val == APInt::getSignBit(BitWidth))
2013 return BinaryOperator::CreateXor(LHS, RHS);
2015 // See if SimplifyDemandedBits can simplify this. This handles stuff like
2016 // (X & 254)+1 -> (X&254)|1
2017 if (!isa<VectorType>(I.getType())) {
2018 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
2019 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
2020 KnownZero, KnownOne))
2024 // zext(i1) - 1 -> select i1, 0, -1
2025 if (ZExtInst *ZI = dyn_cast<ZExtInst>(LHS))
2026 if (CI->isAllOnesValue() &&
2027 ZI->getOperand(0)->getType() == Type::Int1Ty)
2028 return SelectInst::Create(ZI->getOperand(0),
2029 Constant::getNullValue(I.getType()),
2030 ConstantInt::getAllOnesValue(I.getType()));
2033 if (isa<PHINode>(LHS))
2034 if (Instruction *NV = FoldOpIntoPhi(I))
2037 ConstantInt *XorRHS = 0;
2039 if (isa<ConstantInt>(RHSC) &&
2040 match(LHS, m_Xor(m_Value(XorLHS), m_ConstantInt(XorRHS)))) {
2041 uint32_t TySizeBits = I.getType()->getPrimitiveSizeInBits();
2042 const APInt& RHSVal = cast<ConstantInt>(RHSC)->getValue();
2044 uint32_t Size = TySizeBits / 2;
2045 APInt C0080Val(APInt(TySizeBits, 1ULL).shl(Size - 1));
2046 APInt CFF80Val(-C0080Val);
2048 if (TySizeBits > Size) {
2049 // If we have ADD(XOR(AND(X, 0xFF), 0x80), 0xF..F80), it's a sext.
2050 // If we have ADD(XOR(AND(X, 0xFF), 0xF..F80), 0x80), it's a sext.
2051 if ((RHSVal == CFF80Val && XorRHS->getValue() == C0080Val) ||
2052 (RHSVal == C0080Val && XorRHS->getValue() == CFF80Val)) {
2053 // This is a sign extend if the top bits are known zero.
2054 if (!MaskedValueIsZero(XorLHS,
2055 APInt::getHighBitsSet(TySizeBits, TySizeBits - Size)))
2056 Size = 0; // Not a sign ext, but can't be any others either.
2061 C0080Val = APIntOps::lshr(C0080Val, Size);
2062 CFF80Val = APIntOps::ashr(CFF80Val, Size);
2063 } while (Size >= 1);
2065 // FIXME: This shouldn't be necessary. When the backends can handle types
2066 // with funny bit widths then this switch statement should be removed. It
2067 // is just here to get the size of the "middle" type back up to something
2068 // that the back ends can handle.
2069 const Type *MiddleType = 0;
2072 case 32: MiddleType = Type::Int32Ty; break;
2073 case 16: MiddleType = Type::Int16Ty; break;
2074 case 8: MiddleType = Type::Int8Ty; break;
2077 Instruction *NewTrunc = new TruncInst(XorLHS, MiddleType, "sext");
2078 InsertNewInstBefore(NewTrunc, I);
2079 return new SExtInst(NewTrunc, I.getType(), I.getName());
2084 if (I.getType() == Type::Int1Ty)
2085 return BinaryOperator::CreateXor(LHS, RHS);
2088 if (I.getType()->isInteger()) {
2089 if (Instruction *Result = AssociativeOpt(I, AddRHS(RHS))) return Result;
2091 if (Instruction *RHSI = dyn_cast<Instruction>(RHS)) {
2092 if (RHSI->getOpcode() == Instruction::Sub)
2093 if (LHS == RHSI->getOperand(1)) // A + (B - A) --> B
2094 return ReplaceInstUsesWith(I, RHSI->getOperand(0));
2096 if (Instruction *LHSI = dyn_cast<Instruction>(LHS)) {
2097 if (LHSI->getOpcode() == Instruction::Sub)
2098 if (RHS == LHSI->getOperand(1)) // (B - A) + A --> B
2099 return ReplaceInstUsesWith(I, LHSI->getOperand(0));
2104 // -A + -B --> -(A + B)
2105 if (Value *LHSV = dyn_castNegVal(LHS)) {
2106 if (LHS->getType()->isIntOrIntVector()) {
2107 if (Value *RHSV = dyn_castNegVal(RHS)) {
2108 Instruction *NewAdd = BinaryOperator::CreateAdd(LHSV, RHSV, "sum");
2109 InsertNewInstBefore(NewAdd, I);
2110 return BinaryOperator::CreateNeg(NewAdd);
2114 return BinaryOperator::CreateSub(RHS, LHSV);
2118 if (!isa<Constant>(RHS))
2119 if (Value *V = dyn_castNegVal(RHS))
2120 return BinaryOperator::CreateSub(LHS, V);
2124 if (Value *X = dyn_castFoldableMul(LHS, C2)) {
2125 if (X == RHS) // X*C + X --> X * (C+1)
2126 return BinaryOperator::CreateMul(RHS, AddOne(C2));
2128 // X*C1 + X*C2 --> X * (C1+C2)
2130 if (X == dyn_castFoldableMul(RHS, C1))
2131 return BinaryOperator::CreateMul(X, Add(C1, C2));
2134 // X + X*C --> X * (C+1)
2135 if (dyn_castFoldableMul(RHS, C2) == LHS)
2136 return BinaryOperator::CreateMul(LHS, AddOne(C2));
2138 // X + ~X --> -1 since ~X = -X-1
2139 if (dyn_castNotVal(LHS) == RHS || dyn_castNotVal(RHS) == LHS)
2140 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
2143 // (A & C1)+(B & C2) --> (A & C1)|(B & C2) iff C1&C2 == 0
2144 if (match(RHS, m_And(m_Value(), m_ConstantInt(C2))))
2145 if (Instruction *R = AssociativeOpt(I, AddMaskingAnd(C2)))
2148 // A+B --> A|B iff A and B have no bits set in common.
2149 if (const IntegerType *IT = dyn_cast<IntegerType>(I.getType())) {
2150 APInt Mask = APInt::getAllOnesValue(IT->getBitWidth());
2151 APInt LHSKnownOne(IT->getBitWidth(), 0);
2152 APInt LHSKnownZero(IT->getBitWidth(), 0);
2153 ComputeMaskedBits(LHS, Mask, LHSKnownZero, LHSKnownOne);
2154 if (LHSKnownZero != 0) {
2155 APInt RHSKnownOne(IT->getBitWidth(), 0);
2156 APInt RHSKnownZero(IT->getBitWidth(), 0);
2157 ComputeMaskedBits(RHS, Mask, RHSKnownZero, RHSKnownOne);
2159 // No bits in common -> bitwise or.
2160 if ((LHSKnownZero|RHSKnownZero).isAllOnesValue())
2161 return BinaryOperator::CreateOr(LHS, RHS);
2165 // W*X + Y*Z --> W * (X+Z) iff W == Y
2166 if (I.getType()->isIntOrIntVector()) {
2167 Value *W, *X, *Y, *Z;
2168 if (match(LHS, m_Mul(m_Value(W), m_Value(X))) &&
2169 match(RHS, m_Mul(m_Value(Y), m_Value(Z)))) {
2173 } else if (Y == X) {
2175 } else if (X == Z) {
2182 Value *NewAdd = InsertNewInstBefore(BinaryOperator::CreateAdd(X, Z,
2183 LHS->getName()), I);
2184 return BinaryOperator::CreateMul(W, NewAdd);
2189 if (ConstantInt *CRHS = dyn_cast<ConstantInt>(RHS)) {
2191 if (match(LHS, m_Not(m_Value(X)))) // ~X + C --> (C-1) - X
2192 return BinaryOperator::CreateSub(SubOne(CRHS), X);
2194 // (X & FF00) + xx00 -> (X+xx00) & FF00
2195 if (LHS->hasOneUse() && match(LHS, m_And(m_Value(X), m_ConstantInt(C2)))) {
2196 Constant *Anded = And(CRHS, C2);
2197 if (Anded == CRHS) {
2198 // See if all bits from the first bit set in the Add RHS up are included
2199 // in the mask. First, get the rightmost bit.
2200 const APInt& AddRHSV = CRHS->getValue();
2202 // Form a mask of all bits from the lowest bit added through the top.
2203 APInt AddRHSHighBits(~((AddRHSV & -AddRHSV)-1));
2205 // See if the and mask includes all of these bits.
2206 APInt AddRHSHighBitsAnd(AddRHSHighBits & C2->getValue());
2208 if (AddRHSHighBits == AddRHSHighBitsAnd) {
2209 // Okay, the xform is safe. Insert the new add pronto.
2210 Value *NewAdd = InsertNewInstBefore(BinaryOperator::CreateAdd(X, CRHS,
2211 LHS->getName()), I);
2212 return BinaryOperator::CreateAnd(NewAdd, C2);
2217 // Try to fold constant add into select arguments.
2218 if (SelectInst *SI = dyn_cast<SelectInst>(LHS))
2219 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2223 // add (cast *A to intptrtype) B ->
2224 // cast (GEP (cast *A to sbyte*) B) --> intptrtype
2226 CastInst *CI = dyn_cast<CastInst>(LHS);
2229 CI = dyn_cast<CastInst>(RHS);
2232 if (CI && CI->getType()->isSized() &&
2233 (CI->getType()->getPrimitiveSizeInBits() ==
2234 TD->getIntPtrType()->getPrimitiveSizeInBits())
2235 && isa<PointerType>(CI->getOperand(0)->getType())) {
2237 cast<PointerType>(CI->getOperand(0)->getType())->getAddressSpace();
2238 Value *I2 = InsertBitCastBefore(CI->getOperand(0),
2239 PointerType::get(Type::Int8Ty, AS), I);
2240 I2 = InsertNewInstBefore(GetElementPtrInst::Create(I2, Other, "ctg2"), I);
2241 return new PtrToIntInst(I2, CI->getType());
2245 // add (select X 0 (sub n A)) A --> select X A n
2247 SelectInst *SI = dyn_cast<SelectInst>(LHS);
2250 SI = dyn_cast<SelectInst>(RHS);
2253 if (SI && SI->hasOneUse()) {
2254 Value *TV = SI->getTrueValue();
2255 Value *FV = SI->getFalseValue();
2258 // Can we fold the add into the argument of the select?
2259 // We check both true and false select arguments for a matching subtract.
2260 if (match(FV, m_Zero()) && match(TV, m_Sub(m_Value(N), m_Value(A))) &&
2261 A == Other) // Fold the add into the true select value.
2262 return SelectInst::Create(SI->getCondition(), N, A);
2263 if (match(TV, m_Zero()) && match(FV, m_Sub(m_Value(N), m_Value(A))) &&
2264 A == Other) // Fold the add into the false select value.
2265 return SelectInst::Create(SI->getCondition(), A, N);
2269 // Check for X+0.0. Simplify it to X if we know X is not -0.0.
2270 if (ConstantFP *CFP = dyn_cast<ConstantFP>(RHS))
2271 if (CFP->getValueAPF().isPosZero() && CannotBeNegativeZero(LHS))
2272 return ReplaceInstUsesWith(I, LHS);
2274 // Check for (add (sext x), y), see if we can merge this into an
2275 // integer add followed by a sext.
2276 if (SExtInst *LHSConv = dyn_cast<SExtInst>(LHS)) {
2277 // (add (sext x), cst) --> (sext (add x, cst'))
2278 if (ConstantInt *RHSC = dyn_cast<ConstantInt>(RHS)) {
2280 ConstantExpr::getTrunc(RHSC, LHSConv->getOperand(0)->getType());
2281 if (LHSConv->hasOneUse() &&
2282 ConstantExpr::getSExt(CI, I.getType()) == RHSC &&
2283 WillNotOverflowSignedAdd(LHSConv->getOperand(0), CI)) {
2284 // Insert the new, smaller add.
2285 Instruction *NewAdd = BinaryOperator::CreateAdd(LHSConv->getOperand(0),
2287 InsertNewInstBefore(NewAdd, I);
2288 return new SExtInst(NewAdd, I.getType());
2292 // (add (sext x), (sext y)) --> (sext (add int x, y))
2293 if (SExtInst *RHSConv = dyn_cast<SExtInst>(RHS)) {
2294 // Only do this if x/y have the same type, if at last one of them has a
2295 // single use (so we don't increase the number of sexts), and if the
2296 // integer add will not overflow.
2297 if (LHSConv->getOperand(0)->getType()==RHSConv->getOperand(0)->getType()&&
2298 (LHSConv->hasOneUse() || RHSConv->hasOneUse()) &&
2299 WillNotOverflowSignedAdd(LHSConv->getOperand(0),
2300 RHSConv->getOperand(0))) {
2301 // Insert the new integer add.
2302 Instruction *NewAdd = BinaryOperator::CreateAdd(LHSConv->getOperand(0),
2303 RHSConv->getOperand(0),
2305 InsertNewInstBefore(NewAdd, I);
2306 return new SExtInst(NewAdd, I.getType());
2311 // Check for (add double (sitofp x), y), see if we can merge this into an
2312 // integer add followed by a promotion.
2313 if (SIToFPInst *LHSConv = dyn_cast<SIToFPInst>(LHS)) {
2314 // (add double (sitofp x), fpcst) --> (sitofp (add int x, intcst))
2315 // ... if the constant fits in the integer value. This is useful for things
2316 // like (double)(x & 1234) + 4.0 -> (double)((X & 1234)+4) which no longer
2317 // requires a constant pool load, and generally allows the add to be better
2319 if (ConstantFP *CFP = dyn_cast<ConstantFP>(RHS)) {
2321 ConstantExpr::getFPToSI(CFP, LHSConv->getOperand(0)->getType());
2322 if (LHSConv->hasOneUse() &&
2323 ConstantExpr::getSIToFP(CI, I.getType()) == CFP &&
2324 WillNotOverflowSignedAdd(LHSConv->getOperand(0), CI)) {
2325 // Insert the new integer add.
2326 Instruction *NewAdd = BinaryOperator::CreateAdd(LHSConv->getOperand(0),
2328 InsertNewInstBefore(NewAdd, I);
2329 return new SIToFPInst(NewAdd, I.getType());
2333 // (add double (sitofp x), (sitofp y)) --> (sitofp (add int x, y))
2334 if (SIToFPInst *RHSConv = dyn_cast<SIToFPInst>(RHS)) {
2335 // Only do this if x/y have the same type, if at last one of them has a
2336 // single use (so we don't increase the number of int->fp conversions),
2337 // and if the integer add will not overflow.
2338 if (LHSConv->getOperand(0)->getType()==RHSConv->getOperand(0)->getType()&&
2339 (LHSConv->hasOneUse() || RHSConv->hasOneUse()) &&
2340 WillNotOverflowSignedAdd(LHSConv->getOperand(0),
2341 RHSConv->getOperand(0))) {
2342 // Insert the new integer add.
2343 Instruction *NewAdd = BinaryOperator::CreateAdd(LHSConv->getOperand(0),
2344 RHSConv->getOperand(0),
2346 InsertNewInstBefore(NewAdd, I);
2347 return new SIToFPInst(NewAdd, I.getType());
2352 return Changed ? &I : 0;
2355 Instruction *InstCombiner::visitSub(BinaryOperator &I) {
2356 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2358 if (Op0 == Op1 && // sub X, X -> 0
2359 !I.getType()->isFPOrFPVector())
2360 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2362 // If this is a 'B = x-(-A)', change to B = x+A...
2363 if (Value *V = dyn_castNegVal(Op1))
2364 return BinaryOperator::CreateAdd(Op0, V);
2366 if (isa<UndefValue>(Op0))
2367 return ReplaceInstUsesWith(I, Op0); // undef - X -> undef
2368 if (isa<UndefValue>(Op1))
2369 return ReplaceInstUsesWith(I, Op1); // X - undef -> undef
2371 if (ConstantInt *C = dyn_cast<ConstantInt>(Op0)) {
2372 // Replace (-1 - A) with (~A)...
2373 if (C->isAllOnesValue())
2374 return BinaryOperator::CreateNot(Op1);
2376 // C - ~X == X + (1+C)
2378 if (match(Op1, m_Not(m_Value(X))))
2379 return BinaryOperator::CreateAdd(X, AddOne(C));
2381 // -(X >>u 31) -> (X >>s 31)
2382 // -(X >>s 31) -> (X >>u 31)
2384 if (BinaryOperator *SI = dyn_cast<BinaryOperator>(Op1)) {
2385 if (SI->getOpcode() == Instruction::LShr) {
2386 if (ConstantInt *CU = dyn_cast<ConstantInt>(SI->getOperand(1))) {
2387 // Check to see if we are shifting out everything but the sign bit.
2388 if (CU->getLimitedValue(SI->getType()->getPrimitiveSizeInBits()) ==
2389 SI->getType()->getPrimitiveSizeInBits()-1) {
2390 // Ok, the transformation is safe. Insert AShr.
2391 return BinaryOperator::Create(Instruction::AShr,
2392 SI->getOperand(0), CU, SI->getName());
2396 else if (SI->getOpcode() == Instruction::AShr) {
2397 if (ConstantInt *CU = dyn_cast<ConstantInt>(SI->getOperand(1))) {
2398 // Check to see if we are shifting out everything but the sign bit.
2399 if (CU->getLimitedValue(SI->getType()->getPrimitiveSizeInBits()) ==
2400 SI->getType()->getPrimitiveSizeInBits()-1) {
2401 // Ok, the transformation is safe. Insert LShr.
2402 return BinaryOperator::CreateLShr(
2403 SI->getOperand(0), CU, SI->getName());
2410 // Try to fold constant sub into select arguments.
2411 if (SelectInst *SI = dyn_cast<SelectInst>(Op1))
2412 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2415 if (isa<PHINode>(Op0))
2416 if (Instruction *NV = FoldOpIntoPhi(I))
2420 if (I.getType() == Type::Int1Ty)
2421 return BinaryOperator::CreateXor(Op0, Op1);
2423 if (BinaryOperator *Op1I = dyn_cast<BinaryOperator>(Op1)) {
2424 if (Op1I->getOpcode() == Instruction::Add &&
2425 !Op0->getType()->isFPOrFPVector()) {
2426 if (Op1I->getOperand(0) == Op0) // X-(X+Y) == -Y
2427 return BinaryOperator::CreateNeg(Op1I->getOperand(1), I.getName());
2428 else if (Op1I->getOperand(1) == Op0) // X-(Y+X) == -Y
2429 return BinaryOperator::CreateNeg(Op1I->getOperand(0), I.getName());
2430 else if (ConstantInt *CI1 = dyn_cast<ConstantInt>(I.getOperand(0))) {
2431 if (ConstantInt *CI2 = dyn_cast<ConstantInt>(Op1I->getOperand(1)))
2432 // C1-(X+C2) --> (C1-C2)-X
2433 return BinaryOperator::CreateSub(Subtract(CI1, CI2),
2434 Op1I->getOperand(0));
2438 if (Op1I->hasOneUse()) {
2439 // Replace (x - (y - z)) with (x + (z - y)) if the (y - z) subexpression
2440 // is not used by anyone else...
2442 if (Op1I->getOpcode() == Instruction::Sub &&
2443 !Op1I->getType()->isFPOrFPVector()) {
2444 // Swap the two operands of the subexpr...
2445 Value *IIOp0 = Op1I->getOperand(0), *IIOp1 = Op1I->getOperand(1);
2446 Op1I->setOperand(0, IIOp1);
2447 Op1I->setOperand(1, IIOp0);
2449 // Create the new top level add instruction...
2450 return BinaryOperator::CreateAdd(Op0, Op1);
2453 // Replace (A - (A & B)) with (A & ~B) if this is the only use of (A&B)...
2455 if (Op1I->getOpcode() == Instruction::And &&
2456 (Op1I->getOperand(0) == Op0 || Op1I->getOperand(1) == Op0)) {
2457 Value *OtherOp = Op1I->getOperand(Op1I->getOperand(0) == Op0);
2460 InsertNewInstBefore(BinaryOperator::CreateNot(OtherOp, "B.not"), I);
2461 return BinaryOperator::CreateAnd(Op0, NewNot);
2464 // 0 - (X sdiv C) -> (X sdiv -C)
2465 if (Op1I->getOpcode() == Instruction::SDiv)
2466 if (ConstantInt *CSI = dyn_cast<ConstantInt>(Op0))
2468 if (Constant *DivRHS = dyn_cast<Constant>(Op1I->getOperand(1)))
2469 return BinaryOperator::CreateSDiv(Op1I->getOperand(0),
2470 ConstantExpr::getNeg(DivRHS));
2472 // X - X*C --> X * (1-C)
2473 ConstantInt *C2 = 0;
2474 if (dyn_castFoldableMul(Op1I, C2) == Op0) {
2475 Constant *CP1 = Subtract(ConstantInt::get(I.getType(), 1), C2);
2476 return BinaryOperator::CreateMul(Op0, CP1);
2479 // X - ((X / Y) * Y) --> X % Y
2480 if (Op1I->getOpcode() == Instruction::Mul)
2481 if (Instruction *I = dyn_cast<Instruction>(Op1I->getOperand(0)))
2482 if (Op0 == I->getOperand(0) &&
2483 Op1I->getOperand(1) == I->getOperand(1)) {
2484 if (I->getOpcode() == Instruction::SDiv)
2485 return BinaryOperator::CreateSRem(Op0, Op1I->getOperand(1));
2486 if (I->getOpcode() == Instruction::UDiv)
2487 return BinaryOperator::CreateURem(Op0, Op1I->getOperand(1));
2492 if (!Op0->getType()->isFPOrFPVector())
2493 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0)) {
2494 if (Op0I->getOpcode() == Instruction::Add) {
2495 if (Op0I->getOperand(0) == Op1) // (Y+X)-Y == X
2496 return ReplaceInstUsesWith(I, Op0I->getOperand(1));
2497 else if (Op0I->getOperand(1) == Op1) // (X+Y)-Y == X
2498 return ReplaceInstUsesWith(I, Op0I->getOperand(0));
2499 } else if (Op0I->getOpcode() == Instruction::Sub) {
2500 if (Op0I->getOperand(0) == Op1) // (X-Y)-X == -Y
2501 return BinaryOperator::CreateNeg(Op0I->getOperand(1), I.getName());
2506 if (Value *X = dyn_castFoldableMul(Op0, C1)) {
2507 if (X == Op1) // X*C - X --> X * (C-1)
2508 return BinaryOperator::CreateMul(Op1, SubOne(C1));
2510 ConstantInt *C2; // X*C1 - X*C2 -> X * (C1-C2)
2511 if (X == dyn_castFoldableMul(Op1, C2))
2512 return BinaryOperator::CreateMul(X, Subtract(C1, C2));
2517 /// isSignBitCheck - Given an exploded icmp instruction, return true if the
2518 /// comparison only checks the sign bit. If it only checks the sign bit, set
2519 /// TrueIfSigned if the result of the comparison is true when the input value is
2521 static bool isSignBitCheck(ICmpInst::Predicate pred, ConstantInt *RHS,
2522 bool &TrueIfSigned) {
2524 case ICmpInst::ICMP_SLT: // True if LHS s< 0
2525 TrueIfSigned = true;
2526 return RHS->isZero();
2527 case ICmpInst::ICMP_SLE: // True if LHS s<= RHS and RHS == -1
2528 TrueIfSigned = true;
2529 return RHS->isAllOnesValue();
2530 case ICmpInst::ICMP_SGT: // True if LHS s> -1
2531 TrueIfSigned = false;
2532 return RHS->isAllOnesValue();
2533 case ICmpInst::ICMP_UGT:
2534 // True if LHS u> RHS and RHS == high-bit-mask - 1
2535 TrueIfSigned = true;
2536 return RHS->getValue() ==
2537 APInt::getSignedMaxValue(RHS->getType()->getPrimitiveSizeInBits());
2538 case ICmpInst::ICMP_UGE:
2539 // True if LHS u>= RHS and RHS == high-bit-mask (2^7, 2^15, 2^31, etc)
2540 TrueIfSigned = true;
2541 return RHS->getValue().isSignBit();
2547 Instruction *InstCombiner::visitMul(BinaryOperator &I) {
2548 bool Changed = SimplifyCommutative(I);
2549 Value *Op0 = I.getOperand(0);
2551 if (isa<UndefValue>(I.getOperand(1))) // undef * X -> 0
2552 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2554 // Simplify mul instructions with a constant RHS...
2555 if (Constant *Op1 = dyn_cast<Constant>(I.getOperand(1))) {
2556 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
2558 // ((X << C1)*C2) == (X * (C2 << C1))
2559 if (BinaryOperator *SI = dyn_cast<BinaryOperator>(Op0))
2560 if (SI->getOpcode() == Instruction::Shl)
2561 if (Constant *ShOp = dyn_cast<Constant>(SI->getOperand(1)))
2562 return BinaryOperator::CreateMul(SI->getOperand(0),
2563 ConstantExpr::getShl(CI, ShOp));
2566 return ReplaceInstUsesWith(I, Op1); // X * 0 == 0
2567 if (CI->equalsInt(1)) // X * 1 == X
2568 return ReplaceInstUsesWith(I, Op0);
2569 if (CI->isAllOnesValue()) // X * -1 == 0 - X
2570 return BinaryOperator::CreateNeg(Op0, I.getName());
2572 const APInt& Val = cast<ConstantInt>(CI)->getValue();
2573 if (Val.isPowerOf2()) { // Replace X*(2^C) with X << C
2574 return BinaryOperator::CreateShl(Op0,
2575 ConstantInt::get(Op0->getType(), Val.logBase2()));
2577 } else if (ConstantFP *Op1F = dyn_cast<ConstantFP>(Op1)) {
2578 if (Op1F->isNullValue())
2579 return ReplaceInstUsesWith(I, Op1);
2581 // "In IEEE floating point, x*1 is not equivalent to x for nans. However,
2582 // ANSI says we can drop signals, so we can do this anyway." (from GCC)
2583 if (Op1F->isExactlyValue(1.0))
2584 return ReplaceInstUsesWith(I, Op0); // Eliminate 'mul double %X, 1.0'
2585 } else if (isa<VectorType>(Op1->getType())) {
2586 if (isa<ConstantAggregateZero>(Op1))
2587 return ReplaceInstUsesWith(I, Op1);
2589 // As above, vector X*splat(1.0) -> X in all defined cases.
2590 if (ConstantVector *Op1V = dyn_cast<ConstantVector>(Op1))
2591 if (ConstantFP *F = dyn_cast_or_null<ConstantFP>(Op1V->getSplatValue()))
2592 if (F->isExactlyValue(1.0))
2593 return ReplaceInstUsesWith(I, Op0);
2596 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0))
2597 if (Op0I->getOpcode() == Instruction::Add && Op0I->hasOneUse() &&
2598 isa<ConstantInt>(Op0I->getOperand(1)) && isa<ConstantInt>(Op1)) {
2599 // Canonicalize (X+C1)*C2 -> X*C2+C1*C2.
2600 Instruction *Add = BinaryOperator::CreateMul(Op0I->getOperand(0),
2602 InsertNewInstBefore(Add, I);
2603 Value *C1C2 = ConstantExpr::getMul(Op1,
2604 cast<Constant>(Op0I->getOperand(1)));
2605 return BinaryOperator::CreateAdd(Add, C1C2);
2609 // Try to fold constant mul into select arguments.
2610 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
2611 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2614 if (isa<PHINode>(Op0))
2615 if (Instruction *NV = FoldOpIntoPhi(I))
2619 if (Value *Op0v = dyn_castNegVal(Op0)) // -X * -Y = X*Y
2620 if (Value *Op1v = dyn_castNegVal(I.getOperand(1)))
2621 return BinaryOperator::CreateMul(Op0v, Op1v);
2623 if (I.getType() == Type::Int1Ty)
2624 return BinaryOperator::CreateAnd(Op0, I.getOperand(1));
2626 // If one of the operands of the multiply is a cast from a boolean value, then
2627 // we know the bool is either zero or one, so this is a 'masking' multiply.
2628 // See if we can simplify things based on how the boolean was originally
2630 CastInst *BoolCast = 0;
2631 if (ZExtInst *CI = dyn_cast<ZExtInst>(Op0))
2632 if (CI->getOperand(0)->getType() == Type::Int1Ty)
2635 if (ZExtInst *CI = dyn_cast<ZExtInst>(I.getOperand(1)))
2636 if (CI->getOperand(0)->getType() == Type::Int1Ty)
2639 if (ICmpInst *SCI = dyn_cast<ICmpInst>(BoolCast->getOperand(0))) {
2640 Value *SCIOp0 = SCI->getOperand(0), *SCIOp1 = SCI->getOperand(1);
2641 const Type *SCOpTy = SCIOp0->getType();
2644 // If the icmp is true iff the sign bit of X is set, then convert this
2645 // multiply into a shift/and combination.
2646 if (isa<ConstantInt>(SCIOp1) &&
2647 isSignBitCheck(SCI->getPredicate(), cast<ConstantInt>(SCIOp1), TIS) &&
2649 // Shift the X value right to turn it into "all signbits".
2650 Constant *Amt = ConstantInt::get(SCIOp0->getType(),
2651 SCOpTy->getPrimitiveSizeInBits()-1);
2653 InsertNewInstBefore(
2654 BinaryOperator::Create(Instruction::AShr, SCIOp0, Amt,
2655 BoolCast->getOperand(0)->getName()+
2658 // If the multiply type is not the same as the source type, sign extend
2659 // or truncate to the multiply type.
2660 if (I.getType() != V->getType()) {
2661 uint32_t SrcBits = V->getType()->getPrimitiveSizeInBits();
2662 uint32_t DstBits = I.getType()->getPrimitiveSizeInBits();
2663 Instruction::CastOps opcode =
2664 (SrcBits == DstBits ? Instruction::BitCast :
2665 (SrcBits < DstBits ? Instruction::SExt : Instruction::Trunc));
2666 V = InsertCastBefore(opcode, V, I.getType(), I);
2669 Value *OtherOp = Op0 == BoolCast ? I.getOperand(1) : Op0;
2670 return BinaryOperator::CreateAnd(V, OtherOp);
2675 return Changed ? &I : 0;
2678 /// SimplifyDivRemOfSelect - Try to fold a divide or remainder of a select
2680 bool InstCombiner::SimplifyDivRemOfSelect(BinaryOperator &I) {
2681 SelectInst *SI = cast<SelectInst>(I.getOperand(1));
2683 // div/rem X, (Cond ? 0 : Y) -> div/rem X, Y
2684 int NonNullOperand = -1;
2685 if (Constant *ST = dyn_cast<Constant>(SI->getOperand(1)))
2686 if (ST->isNullValue())
2688 // div/rem X, (Cond ? Y : 0) -> div/rem X, Y
2689 if (Constant *ST = dyn_cast<Constant>(SI->getOperand(2)))
2690 if (ST->isNullValue())
2693 if (NonNullOperand == -1)
2696 Value *SelectCond = SI->getOperand(0);
2698 // Change the div/rem to use 'Y' instead of the select.
2699 I.setOperand(1, SI->getOperand(NonNullOperand));
2701 // Okay, we know we replace the operand of the div/rem with 'Y' with no
2702 // problem. However, the select, or the condition of the select may have
2703 // multiple uses. Based on our knowledge that the operand must be non-zero,
2704 // propagate the known value for the select into other uses of it, and
2705 // propagate a known value of the condition into its other users.
2707 // If the select and condition only have a single use, don't bother with this,
2709 if (SI->use_empty() && SelectCond->hasOneUse())
2712 // Scan the current block backward, looking for other uses of SI.
2713 BasicBlock::iterator BBI = &I, BBFront = I.getParent()->begin();
2715 while (BBI != BBFront) {
2717 // If we found a call to a function, we can't assume it will return, so
2718 // information from below it cannot be propagated above it.
2719 if (isa<CallInst>(BBI) && !isa<IntrinsicInst>(BBI))
2722 // Replace uses of the select or its condition with the known values.
2723 for (Instruction::op_iterator I = BBI->op_begin(), E = BBI->op_end();
2726 *I = SI->getOperand(NonNullOperand);
2728 } else if (*I == SelectCond) {
2729 *I = NonNullOperand == 1 ? ConstantInt::getTrue() :
2730 ConstantInt::getFalse();
2735 // If we past the instruction, quit looking for it.
2738 if (&*BBI == SelectCond)
2741 // If we ran out of things to eliminate, break out of the loop.
2742 if (SelectCond == 0 && SI == 0)
2750 /// This function implements the transforms on div instructions that work
2751 /// regardless of the kind of div instruction it is (udiv, sdiv, or fdiv). It is
2752 /// used by the visitors to those instructions.
2753 /// @brief Transforms common to all three div instructions
2754 Instruction *InstCombiner::commonDivTransforms(BinaryOperator &I) {
2755 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2757 // undef / X -> 0 for integer.
2758 // undef / X -> undef for FP (the undef could be a snan).
2759 if (isa<UndefValue>(Op0)) {
2760 if (Op0->getType()->isFPOrFPVector())
2761 return ReplaceInstUsesWith(I, Op0);
2762 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2765 // X / undef -> undef
2766 if (isa<UndefValue>(Op1))
2767 return ReplaceInstUsesWith(I, Op1);
2772 /// This function implements the transforms common to both integer division
2773 /// instructions (udiv and sdiv). It is called by the visitors to those integer
2774 /// division instructions.
2775 /// @brief Common integer divide transforms
2776 Instruction *InstCombiner::commonIDivTransforms(BinaryOperator &I) {
2777 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2779 // (sdiv X, X) --> 1 (udiv X, X) --> 1
2781 if (const VectorType *Ty = dyn_cast<VectorType>(I.getType())) {
2782 ConstantInt *CI = ConstantInt::get(Ty->getElementType(), 1);
2783 std::vector<Constant*> Elts(Ty->getNumElements(), CI);
2784 return ReplaceInstUsesWith(I, ConstantVector::get(Elts));
2787 ConstantInt *CI = ConstantInt::get(I.getType(), 1);
2788 return ReplaceInstUsesWith(I, CI);
2791 if (Instruction *Common = commonDivTransforms(I))
2794 // Handle cases involving: [su]div X, (select Cond, Y, Z)
2795 // This does not apply for fdiv.
2796 if (isa<SelectInst>(Op1) && SimplifyDivRemOfSelect(I))
2799 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
2801 if (RHS->equalsInt(1))
2802 return ReplaceInstUsesWith(I, Op0);
2804 // (X / C1) / C2 -> X / (C1*C2)
2805 if (Instruction *LHS = dyn_cast<Instruction>(Op0))
2806 if (Instruction::BinaryOps(LHS->getOpcode()) == I.getOpcode())
2807 if (ConstantInt *LHSRHS = dyn_cast<ConstantInt>(LHS->getOperand(1))) {
2808 if (MultiplyOverflows(RHS, LHSRHS, I.getOpcode()==Instruction::SDiv))
2809 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2811 return BinaryOperator::Create(I.getOpcode(), LHS->getOperand(0),
2812 Multiply(RHS, LHSRHS));
2815 if (!RHS->isZero()) { // avoid X udiv 0
2816 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
2817 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2819 if (isa<PHINode>(Op0))
2820 if (Instruction *NV = FoldOpIntoPhi(I))
2825 // 0 / X == 0, we don't need to preserve faults!
2826 if (ConstantInt *LHS = dyn_cast<ConstantInt>(Op0))
2827 if (LHS->equalsInt(0))
2828 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2830 // It can't be division by zero, hence it must be division by one.
2831 if (I.getType() == Type::Int1Ty)
2832 return ReplaceInstUsesWith(I, Op0);
2837 Instruction *InstCombiner::visitUDiv(BinaryOperator &I) {
2838 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2840 // Handle the integer div common cases
2841 if (Instruction *Common = commonIDivTransforms(I))
2844 // X udiv C^2 -> X >> C
2845 // Check to see if this is an unsigned division with an exact power of 2,
2846 // if so, convert to a right shift.
2847 if (ConstantInt *C = dyn_cast<ConstantInt>(Op1)) {
2848 if (C->getValue().isPowerOf2()) // 0 not included in isPowerOf2
2849 return BinaryOperator::CreateLShr(Op0,
2850 ConstantInt::get(Op0->getType(), C->getValue().logBase2()));
2853 // X udiv (C1 << N), where C1 is "1<<C2" --> X >> (N+C2)
2854 if (BinaryOperator *RHSI = dyn_cast<BinaryOperator>(I.getOperand(1))) {
2855 if (RHSI->getOpcode() == Instruction::Shl &&
2856 isa<ConstantInt>(RHSI->getOperand(0))) {
2857 const APInt& C1 = cast<ConstantInt>(RHSI->getOperand(0))->getValue();
2858 if (C1.isPowerOf2()) {
2859 Value *N = RHSI->getOperand(1);
2860 const Type *NTy = N->getType();
2861 if (uint32_t C2 = C1.logBase2()) {
2862 Constant *C2V = ConstantInt::get(NTy, C2);
2863 N = InsertNewInstBefore(BinaryOperator::CreateAdd(N, C2V, "tmp"), I);
2865 return BinaryOperator::CreateLShr(Op0, N);
2870 // udiv X, (Select Cond, C1, C2) --> Select Cond, (shr X, C1), (shr X, C2)
2871 // where C1&C2 are powers of two.
2872 if (SelectInst *SI = dyn_cast<SelectInst>(Op1))
2873 if (ConstantInt *STO = dyn_cast<ConstantInt>(SI->getOperand(1)))
2874 if (ConstantInt *SFO = dyn_cast<ConstantInt>(SI->getOperand(2))) {
2875 const APInt &TVA = STO->getValue(), &FVA = SFO->getValue();
2876 if (TVA.isPowerOf2() && FVA.isPowerOf2()) {
2877 // Compute the shift amounts
2878 uint32_t TSA = TVA.logBase2(), FSA = FVA.logBase2();
2879 // Construct the "on true" case of the select
2880 Constant *TC = ConstantInt::get(Op0->getType(), TSA);
2881 Instruction *TSI = BinaryOperator::CreateLShr(
2882 Op0, TC, SI->getName()+".t");
2883 TSI = InsertNewInstBefore(TSI, I);
2885 // Construct the "on false" case of the select
2886 Constant *FC = ConstantInt::get(Op0->getType(), FSA);
2887 Instruction *FSI = BinaryOperator::CreateLShr(
2888 Op0, FC, SI->getName()+".f");
2889 FSI = InsertNewInstBefore(FSI, I);
2891 // construct the select instruction and return it.
2892 return SelectInst::Create(SI->getOperand(0), TSI, FSI, SI->getName());
2898 Instruction *InstCombiner::visitSDiv(BinaryOperator &I) {
2899 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2901 // Handle the integer div common cases
2902 if (Instruction *Common = commonIDivTransforms(I))
2905 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
2907 if (RHS->isAllOnesValue())
2908 return BinaryOperator::CreateNeg(Op0);
2911 if (Value *LHSNeg = dyn_castNegVal(Op0))
2912 return BinaryOperator::CreateSDiv(LHSNeg, ConstantExpr::getNeg(RHS));
2915 // If the sign bits of both operands are zero (i.e. we can prove they are
2916 // unsigned inputs), turn this into a udiv.
2917 if (I.getType()->isInteger()) {
2918 APInt Mask(APInt::getSignBit(I.getType()->getPrimitiveSizeInBits()));
2919 if (MaskedValueIsZero(Op1, Mask) && MaskedValueIsZero(Op0, Mask)) {
2920 // X sdiv Y -> X udiv Y, iff X and Y don't have sign bit set
2921 return BinaryOperator::CreateUDiv(Op0, Op1, I.getName());
2928 Instruction *InstCombiner::visitFDiv(BinaryOperator &I) {
2929 return commonDivTransforms(I);
2932 /// This function implements the transforms on rem instructions that work
2933 /// regardless of the kind of rem instruction it is (urem, srem, or frem). It
2934 /// is used by the visitors to those instructions.
2935 /// @brief Transforms common to all three rem instructions
2936 Instruction *InstCombiner::commonRemTransforms(BinaryOperator &I) {
2937 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2939 // 0 % X == 0 for integer, we don't need to preserve faults!
2940 if (Constant *LHS = dyn_cast<Constant>(Op0))
2941 if (LHS->isNullValue())
2942 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2944 if (isa<UndefValue>(Op0)) { // undef % X -> 0
2945 if (I.getType()->isFPOrFPVector())
2946 return ReplaceInstUsesWith(I, Op0); // X % undef -> undef (could be SNaN)
2947 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2949 if (isa<UndefValue>(Op1))
2950 return ReplaceInstUsesWith(I, Op1); // X % undef -> undef
2952 // Handle cases involving: rem X, (select Cond, Y, Z)
2953 if (isa<SelectInst>(Op1) && SimplifyDivRemOfSelect(I))
2959 /// This function implements the transforms common to both integer remainder
2960 /// instructions (urem and srem). It is called by the visitors to those integer
2961 /// remainder instructions.
2962 /// @brief Common integer remainder transforms
2963 Instruction *InstCombiner::commonIRemTransforms(BinaryOperator &I) {
2964 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2966 if (Instruction *common = commonRemTransforms(I))
2969 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
2970 // X % 0 == undef, we don't need to preserve faults!
2971 if (RHS->equalsInt(0))
2972 return ReplaceInstUsesWith(I, UndefValue::get(I.getType()));
2974 if (RHS->equalsInt(1)) // X % 1 == 0
2975 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2977 if (Instruction *Op0I = dyn_cast<Instruction>(Op0)) {
2978 if (SelectInst *SI = dyn_cast<SelectInst>(Op0I)) {
2979 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2981 } else if (isa<PHINode>(Op0I)) {
2982 if (Instruction *NV = FoldOpIntoPhi(I))
2986 // See if we can fold away this rem instruction.
2987 uint32_t BitWidth = cast<IntegerType>(I.getType())->getBitWidth();
2988 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
2989 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
2990 KnownZero, KnownOne))
2998 Instruction *InstCombiner::visitURem(BinaryOperator &I) {
2999 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3001 if (Instruction *common = commonIRemTransforms(I))
3004 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
3005 // X urem C^2 -> X and C
3006 // Check to see if this is an unsigned remainder with an exact power of 2,
3007 // if so, convert to a bitwise and.
3008 if (ConstantInt *C = dyn_cast<ConstantInt>(RHS))
3009 if (C->getValue().isPowerOf2())
3010 return BinaryOperator::CreateAnd(Op0, SubOne(C));
3013 if (Instruction *RHSI = dyn_cast<Instruction>(I.getOperand(1))) {
3014 // Turn A % (C << N), where C is 2^k, into A & ((C << N)-1)
3015 if (RHSI->getOpcode() == Instruction::Shl &&
3016 isa<ConstantInt>(RHSI->getOperand(0))) {
3017 if (cast<ConstantInt>(RHSI->getOperand(0))->getValue().isPowerOf2()) {
3018 Constant *N1 = ConstantInt::getAllOnesValue(I.getType());
3019 Value *Add = InsertNewInstBefore(BinaryOperator::CreateAdd(RHSI, N1,
3021 return BinaryOperator::CreateAnd(Op0, Add);
3026 // urem X, (select Cond, 2^C1, 2^C2) --> select Cond, (and X, C1), (and X, C2)
3027 // where C1&C2 are powers of two.
3028 if (SelectInst *SI = dyn_cast<SelectInst>(Op1)) {
3029 if (ConstantInt *STO = dyn_cast<ConstantInt>(SI->getOperand(1)))
3030 if (ConstantInt *SFO = dyn_cast<ConstantInt>(SI->getOperand(2))) {
3031 // STO == 0 and SFO == 0 handled above.
3032 if ((STO->getValue().isPowerOf2()) &&
3033 (SFO->getValue().isPowerOf2())) {
3034 Value *TrueAnd = InsertNewInstBefore(
3035 BinaryOperator::CreateAnd(Op0, SubOne(STO), SI->getName()+".t"), I);
3036 Value *FalseAnd = InsertNewInstBefore(
3037 BinaryOperator::CreateAnd(Op0, SubOne(SFO), SI->getName()+".f"), I);
3038 return SelectInst::Create(SI->getOperand(0), TrueAnd, FalseAnd);
3046 Instruction *InstCombiner::visitSRem(BinaryOperator &I) {
3047 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3049 // Handle the integer rem common cases
3050 if (Instruction *common = commonIRemTransforms(I))
3053 if (Value *RHSNeg = dyn_castNegVal(Op1))
3054 if (!isa<Constant>(RHSNeg) ||
3055 (isa<ConstantInt>(RHSNeg) &&
3056 cast<ConstantInt>(RHSNeg)->getValue().isStrictlyPositive())) {
3058 AddUsesToWorkList(I);
3059 I.setOperand(1, RHSNeg);
3063 // If the sign bits of both operands are zero (i.e. we can prove they are
3064 // unsigned inputs), turn this into a urem.
3065 if (I.getType()->isInteger()) {
3066 APInt Mask(APInt::getSignBit(I.getType()->getPrimitiveSizeInBits()));
3067 if (MaskedValueIsZero(Op1, Mask) && MaskedValueIsZero(Op0, Mask)) {
3068 // X srem Y -> X urem Y, iff X and Y don't have sign bit set
3069 return BinaryOperator::CreateURem(Op0, Op1, I.getName());
3076 Instruction *InstCombiner::visitFRem(BinaryOperator &I) {
3077 return commonRemTransforms(I);
3080 // isOneBitSet - Return true if there is exactly one bit set in the specified
3082 static bool isOneBitSet(const ConstantInt *CI) {
3083 return CI->getValue().isPowerOf2();
3086 // isHighOnes - Return true if the constant is of the form 1+0+.
3087 // This is the same as lowones(~X).
3088 static bool isHighOnes(const ConstantInt *CI) {
3089 return (~CI->getValue() + 1).isPowerOf2();
3092 /// getICmpCode - Encode a icmp predicate into a three bit mask. These bits
3093 /// are carefully arranged to allow folding of expressions such as:
3095 /// (A < B) | (A > B) --> (A != B)
3097 /// Note that this is only valid if the first and second predicates have the
3098 /// same sign. Is illegal to do: (A u< B) | (A s> B)
3100 /// Three bits are used to represent the condition, as follows:
3105 /// <=> Value Definition
3106 /// 000 0 Always false
3113 /// 111 7 Always true
3115 static unsigned getICmpCode(const ICmpInst *ICI) {
3116 switch (ICI->getPredicate()) {
3118 case ICmpInst::ICMP_UGT: return 1; // 001
3119 case ICmpInst::ICMP_SGT: return 1; // 001
3120 case ICmpInst::ICMP_EQ: return 2; // 010
3121 case ICmpInst::ICMP_UGE: return 3; // 011
3122 case ICmpInst::ICMP_SGE: return 3; // 011
3123 case ICmpInst::ICMP_ULT: return 4; // 100
3124 case ICmpInst::ICMP_SLT: return 4; // 100
3125 case ICmpInst::ICMP_NE: return 5; // 101
3126 case ICmpInst::ICMP_ULE: return 6; // 110
3127 case ICmpInst::ICMP_SLE: return 6; // 110
3130 assert(0 && "Invalid ICmp predicate!");
3135 /// getFCmpCode - Similar to getICmpCode but for FCmpInst. This encodes a fcmp
3136 /// predicate into a three bit mask. It also returns whether it is an ordered
3137 /// predicate by reference.
3138 static unsigned getFCmpCode(FCmpInst::Predicate CC, bool &isOrdered) {
3141 case FCmpInst::FCMP_ORD: isOrdered = true; return 0; // 000
3142 case FCmpInst::FCMP_UNO: return 0; // 000
3143 case FCmpInst::FCMP_OGT: isOrdered = true; return 1; // 001
3144 case FCmpInst::FCMP_UGT: return 1; // 001
3145 case FCmpInst::FCMP_OEQ: isOrdered = true; return 2; // 010
3146 case FCmpInst::FCMP_UEQ: return 2; // 010
3147 case FCmpInst::FCMP_OGE: isOrdered = true; return 3; // 011
3148 case FCmpInst::FCMP_UGE: return 3; // 011
3149 case FCmpInst::FCMP_OLT: isOrdered = true; return 4; // 100
3150 case FCmpInst::FCMP_ULT: return 4; // 100
3151 case FCmpInst::FCMP_ONE: isOrdered = true; return 5; // 101
3152 case FCmpInst::FCMP_UNE: return 5; // 101
3153 case FCmpInst::FCMP_OLE: isOrdered = true; return 6; // 110
3154 case FCmpInst::FCMP_ULE: return 6; // 110
3157 // Not expecting FCMP_FALSE and FCMP_TRUE;
3158 assert(0 && "Unexpected FCmp predicate!");
3163 /// getICmpValue - This is the complement of getICmpCode, which turns an
3164 /// opcode and two operands into either a constant true or false, or a brand
3165 /// new ICmp instruction. The sign is passed in to determine which kind
3166 /// of predicate to use in the new icmp instruction.
3167 static Value *getICmpValue(bool sign, unsigned code, Value *LHS, Value *RHS) {
3169 default: assert(0 && "Illegal ICmp code!");
3170 case 0: return ConstantInt::getFalse();
3173 return new ICmpInst(ICmpInst::ICMP_SGT, LHS, RHS);
3175 return new ICmpInst(ICmpInst::ICMP_UGT, LHS, RHS);
3176 case 2: return new ICmpInst(ICmpInst::ICMP_EQ, LHS, RHS);
3179 return new ICmpInst(ICmpInst::ICMP_SGE, LHS, RHS);
3181 return new ICmpInst(ICmpInst::ICMP_UGE, LHS, RHS);
3184 return new ICmpInst(ICmpInst::ICMP_SLT, LHS, RHS);
3186 return new ICmpInst(ICmpInst::ICMP_ULT, LHS, RHS);
3187 case 5: return new ICmpInst(ICmpInst::ICMP_NE, LHS, RHS);
3190 return new ICmpInst(ICmpInst::ICMP_SLE, LHS, RHS);
3192 return new ICmpInst(ICmpInst::ICMP_ULE, LHS, RHS);
3193 case 7: return ConstantInt::getTrue();
3197 /// getFCmpValue - This is the complement of getFCmpCode, which turns an
3198 /// opcode and two operands into either a FCmp instruction. isordered is passed
3199 /// in to determine which kind of predicate to use in the new fcmp instruction.
3200 static Value *getFCmpValue(bool isordered, unsigned code,
3201 Value *LHS, Value *RHS) {
3203 default: assert(0 && "Illegal FCmp code!");
3206 return new FCmpInst(FCmpInst::FCMP_ORD, LHS, RHS);
3208 return new FCmpInst(FCmpInst::FCMP_UNO, LHS, RHS);
3211 return new FCmpInst(FCmpInst::FCMP_OGT, LHS, RHS);
3213 return new FCmpInst(FCmpInst::FCMP_UGT, LHS, RHS);
3216 return new FCmpInst(FCmpInst::FCMP_OEQ, LHS, RHS);
3218 return new FCmpInst(FCmpInst::FCMP_UEQ, LHS, RHS);
3221 return new FCmpInst(FCmpInst::FCMP_OGE, LHS, RHS);
3223 return new FCmpInst(FCmpInst::FCMP_UGE, LHS, RHS);
3226 return new FCmpInst(FCmpInst::FCMP_OLT, LHS, RHS);
3228 return new FCmpInst(FCmpInst::FCMP_ULT, LHS, RHS);
3231 return new FCmpInst(FCmpInst::FCMP_ONE, LHS, RHS);
3233 return new FCmpInst(FCmpInst::FCMP_UNE, LHS, RHS);
3236 return new FCmpInst(FCmpInst::FCMP_OLE, LHS, RHS);
3238 return new FCmpInst(FCmpInst::FCMP_ULE, LHS, RHS);
3239 case 7: return ConstantInt::getTrue();
3244 static bool PredicatesFoldable(ICmpInst::Predicate p1, ICmpInst::Predicate p2) {
3245 return (ICmpInst::isSignedPredicate(p1) == ICmpInst::isSignedPredicate(p2)) ||
3246 (ICmpInst::isSignedPredicate(p1) &&
3247 (p2 == ICmpInst::ICMP_EQ || p2 == ICmpInst::ICMP_NE)) ||
3248 (ICmpInst::isSignedPredicate(p2) &&
3249 (p1 == ICmpInst::ICMP_EQ || p1 == ICmpInst::ICMP_NE));
3253 // FoldICmpLogical - Implements (icmp1 A, B) & (icmp2 A, B) --> (icmp3 A, B)
3254 struct FoldICmpLogical {
3257 ICmpInst::Predicate pred;
3258 FoldICmpLogical(InstCombiner &ic, ICmpInst *ICI)
3259 : IC(ic), LHS(ICI->getOperand(0)), RHS(ICI->getOperand(1)),
3260 pred(ICI->getPredicate()) {}
3261 bool shouldApply(Value *V) const {
3262 if (ICmpInst *ICI = dyn_cast<ICmpInst>(V))
3263 if (PredicatesFoldable(pred, ICI->getPredicate()))
3264 return ((ICI->getOperand(0) == LHS && ICI->getOperand(1) == RHS) ||
3265 (ICI->getOperand(0) == RHS && ICI->getOperand(1) == LHS));
3268 Instruction *apply(Instruction &Log) const {
3269 ICmpInst *ICI = cast<ICmpInst>(Log.getOperand(0));
3270 if (ICI->getOperand(0) != LHS) {
3271 assert(ICI->getOperand(1) == LHS);
3272 ICI->swapOperands(); // Swap the LHS and RHS of the ICmp
3275 ICmpInst *RHSICI = cast<ICmpInst>(Log.getOperand(1));
3276 unsigned LHSCode = getICmpCode(ICI);
3277 unsigned RHSCode = getICmpCode(RHSICI);
3279 switch (Log.getOpcode()) {
3280 case Instruction::And: Code = LHSCode & RHSCode; break;
3281 case Instruction::Or: Code = LHSCode | RHSCode; break;
3282 case Instruction::Xor: Code = LHSCode ^ RHSCode; break;
3283 default: assert(0 && "Illegal logical opcode!"); return 0;
3286 bool isSigned = ICmpInst::isSignedPredicate(RHSICI->getPredicate()) ||
3287 ICmpInst::isSignedPredicate(ICI->getPredicate());
3289 Value *RV = getICmpValue(isSigned, Code, LHS, RHS);
3290 if (Instruction *I = dyn_cast<Instruction>(RV))
3292 // Otherwise, it's a constant boolean value...
3293 return IC.ReplaceInstUsesWith(Log, RV);
3296 } // end anonymous namespace
3298 // OptAndOp - This handles expressions of the form ((val OP C1) & C2). Where
3299 // the Op parameter is 'OP', OpRHS is 'C1', and AndRHS is 'C2'. Op is
3300 // guaranteed to be a binary operator.
3301 Instruction *InstCombiner::OptAndOp(Instruction *Op,
3303 ConstantInt *AndRHS,
3304 BinaryOperator &TheAnd) {
3305 Value *X = Op->getOperand(0);
3306 Constant *Together = 0;
3308 Together = And(AndRHS, OpRHS);
3310 switch (Op->getOpcode()) {
3311 case Instruction::Xor:
3312 if (Op->hasOneUse()) {
3313 // (X ^ C1) & C2 --> (X & C2) ^ (C1&C2)
3314 Instruction *And = BinaryOperator::CreateAnd(X, AndRHS);
3315 InsertNewInstBefore(And, TheAnd);
3317 return BinaryOperator::CreateXor(And, Together);
3320 case Instruction::Or:
3321 if (Together == AndRHS) // (X | C) & C --> C
3322 return ReplaceInstUsesWith(TheAnd, AndRHS);
3324 if (Op->hasOneUse() && Together != OpRHS) {
3325 // (X | C1) & C2 --> (X | (C1&C2)) & C2
3326 Instruction *Or = BinaryOperator::CreateOr(X, Together);
3327 InsertNewInstBefore(Or, TheAnd);
3329 return BinaryOperator::CreateAnd(Or, AndRHS);
3332 case Instruction::Add:
3333 if (Op->hasOneUse()) {
3334 // Adding a one to a single bit bit-field should be turned into an XOR
3335 // of the bit. First thing to check is to see if this AND is with a
3336 // single bit constant.
3337 const APInt& AndRHSV = cast<ConstantInt>(AndRHS)->getValue();
3339 // If there is only one bit set...
3340 if (isOneBitSet(cast<ConstantInt>(AndRHS))) {
3341 // Ok, at this point, we know that we are masking the result of the
3342 // ADD down to exactly one bit. If the constant we are adding has
3343 // no bits set below this bit, then we can eliminate the ADD.
3344 const APInt& AddRHS = cast<ConstantInt>(OpRHS)->getValue();
3346 // Check to see if any bits below the one bit set in AndRHSV are set.
3347 if ((AddRHS & (AndRHSV-1)) == 0) {
3348 // If not, the only thing that can effect the output of the AND is
3349 // the bit specified by AndRHSV. If that bit is set, the effect of
3350 // the XOR is to toggle the bit. If it is clear, then the ADD has
3352 if ((AddRHS & AndRHSV) == 0) { // Bit is not set, noop
3353 TheAnd.setOperand(0, X);
3356 // Pull the XOR out of the AND.
3357 Instruction *NewAnd = BinaryOperator::CreateAnd(X, AndRHS);
3358 InsertNewInstBefore(NewAnd, TheAnd);
3359 NewAnd->takeName(Op);
3360 return BinaryOperator::CreateXor(NewAnd, AndRHS);
3367 case Instruction::Shl: {
3368 // We know that the AND will not produce any of the bits shifted in, so if
3369 // the anded constant includes them, clear them now!
3371 uint32_t BitWidth = AndRHS->getType()->getBitWidth();
3372 uint32_t OpRHSVal = OpRHS->getLimitedValue(BitWidth);
3373 APInt ShlMask(APInt::getHighBitsSet(BitWidth, BitWidth-OpRHSVal));
3374 ConstantInt *CI = ConstantInt::get(AndRHS->getValue() & ShlMask);
3376 if (CI->getValue() == ShlMask) {
3377 // Masking out bits that the shift already masks
3378 return ReplaceInstUsesWith(TheAnd, Op); // No need for the and.
3379 } else if (CI != AndRHS) { // Reducing bits set in and.
3380 TheAnd.setOperand(1, CI);
3385 case Instruction::LShr:
3387 // We know that the AND will not produce any of the bits shifted in, so if
3388 // the anded constant includes them, clear them now! This only applies to
3389 // unsigned shifts, because a signed shr may bring in set bits!
3391 uint32_t BitWidth = AndRHS->getType()->getBitWidth();
3392 uint32_t OpRHSVal = OpRHS->getLimitedValue(BitWidth);
3393 APInt ShrMask(APInt::getLowBitsSet(BitWidth, BitWidth - OpRHSVal));
3394 ConstantInt *CI = ConstantInt::get(AndRHS->getValue() & ShrMask);
3396 if (CI->getValue() == ShrMask) {
3397 // Masking out bits that the shift already masks.
3398 return ReplaceInstUsesWith(TheAnd, Op);
3399 } else if (CI != AndRHS) {
3400 TheAnd.setOperand(1, CI); // Reduce bits set in and cst.
3405 case Instruction::AShr:
3407 // See if this is shifting in some sign extension, then masking it out
3409 if (Op->hasOneUse()) {
3410 uint32_t BitWidth = AndRHS->getType()->getBitWidth();
3411 uint32_t OpRHSVal = OpRHS->getLimitedValue(BitWidth);
3412 APInt ShrMask(APInt::getLowBitsSet(BitWidth, BitWidth - OpRHSVal));
3413 Constant *C = ConstantInt::get(AndRHS->getValue() & ShrMask);
3414 if (C == AndRHS) { // Masking out bits shifted in.
3415 // (Val ashr C1) & C2 -> (Val lshr C1) & C2
3416 // Make the argument unsigned.
3417 Value *ShVal = Op->getOperand(0);
3418 ShVal = InsertNewInstBefore(
3419 BinaryOperator::CreateLShr(ShVal, OpRHS,
3420 Op->getName()), TheAnd);
3421 return BinaryOperator::CreateAnd(ShVal, AndRHS, TheAnd.getName());
3430 /// InsertRangeTest - Emit a computation of: (V >= Lo && V < Hi) if Inside is
3431 /// true, otherwise (V < Lo || V >= Hi). In pratice, we emit the more efficient
3432 /// (V-Lo) <u Hi-Lo. This method expects that Lo <= Hi. isSigned indicates
3433 /// whether to treat the V, Lo and HI as signed or not. IB is the location to
3434 /// insert new instructions.
3435 Instruction *InstCombiner::InsertRangeTest(Value *V, Constant *Lo, Constant *Hi,
3436 bool isSigned, bool Inside,
3438 assert(cast<ConstantInt>(ConstantExpr::getICmp((isSigned ?
3439 ICmpInst::ICMP_SLE:ICmpInst::ICMP_ULE), Lo, Hi))->getZExtValue() &&
3440 "Lo is not <= Hi in range emission code!");
3443 if (Lo == Hi) // Trivially false.
3444 return new ICmpInst(ICmpInst::ICMP_NE, V, V);
3446 // V >= Min && V < Hi --> V < Hi
3447 if (cast<ConstantInt>(Lo)->isMinValue(isSigned)) {
3448 ICmpInst::Predicate pred = (isSigned ?
3449 ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT);
3450 return new ICmpInst(pred, V, Hi);
3453 // Emit V-Lo <u Hi-Lo
3454 Constant *NegLo = ConstantExpr::getNeg(Lo);
3455 Instruction *Add = BinaryOperator::CreateAdd(V, NegLo, V->getName()+".off");
3456 InsertNewInstBefore(Add, IB);
3457 Constant *UpperBound = ConstantExpr::getAdd(NegLo, Hi);
3458 return new ICmpInst(ICmpInst::ICMP_ULT, Add, UpperBound);
3461 if (Lo == Hi) // Trivially true.
3462 return new ICmpInst(ICmpInst::ICMP_EQ, V, V);
3464 // V < Min || V >= Hi -> V > Hi-1
3465 Hi = SubOne(cast<ConstantInt>(Hi));
3466 if (cast<ConstantInt>(Lo)->isMinValue(isSigned)) {
3467 ICmpInst::Predicate pred = (isSigned ?
3468 ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT);
3469 return new ICmpInst(pred, V, Hi);
3472 // Emit V-Lo >u Hi-1-Lo
3473 // Note that Hi has already had one subtracted from it, above.
3474 ConstantInt *NegLo = cast<ConstantInt>(ConstantExpr::getNeg(Lo));
3475 Instruction *Add = BinaryOperator::CreateAdd(V, NegLo, V->getName()+".off");
3476 InsertNewInstBefore(Add, IB);
3477 Constant *LowerBound = ConstantExpr::getAdd(NegLo, Hi);
3478 return new ICmpInst(ICmpInst::ICMP_UGT, Add, LowerBound);
3481 // isRunOfOnes - Returns true iff Val consists of one contiguous run of 1s with
3482 // any number of 0s on either side. The 1s are allowed to wrap from LSB to
3483 // MSB, so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is
3484 // not, since all 1s are not contiguous.
3485 static bool isRunOfOnes(ConstantInt *Val, uint32_t &MB, uint32_t &ME) {
3486 const APInt& V = Val->getValue();
3487 uint32_t BitWidth = Val->getType()->getBitWidth();
3488 if (!APIntOps::isShiftedMask(BitWidth, V)) return false;
3490 // look for the first zero bit after the run of ones
3491 MB = BitWidth - ((V - 1) ^ V).countLeadingZeros();
3492 // look for the first non-zero bit
3493 ME = V.getActiveBits();
3497 /// FoldLogicalPlusAnd - This is part of an expression (LHS +/- RHS) & Mask,
3498 /// where isSub determines whether the operator is a sub. If we can fold one of
3499 /// the following xforms:
3501 /// ((A & N) +/- B) & Mask -> (A +/- B) & Mask iff N&Mask == Mask
3502 /// ((A | N) +/- B) & Mask -> (A +/- B) & Mask iff N&Mask == 0
3503 /// ((A ^ N) +/- B) & Mask -> (A +/- B) & Mask iff N&Mask == 0
3505 /// return (A +/- B).
3507 Value *InstCombiner::FoldLogicalPlusAnd(Value *LHS, Value *RHS,
3508 ConstantInt *Mask, bool isSub,
3510 Instruction *LHSI = dyn_cast<Instruction>(LHS);
3511 if (!LHSI || LHSI->getNumOperands() != 2 ||
3512 !isa<ConstantInt>(LHSI->getOperand(1))) return 0;
3514 ConstantInt *N = cast<ConstantInt>(LHSI->getOperand(1));
3516 switch (LHSI->getOpcode()) {
3518 case Instruction::And:
3519 if (And(N, Mask) == Mask) {
3520 // If the AndRHS is a power of two minus one (0+1+), this is simple.
3521 if ((Mask->getValue().countLeadingZeros() +
3522 Mask->getValue().countPopulation()) ==
3523 Mask->getValue().getBitWidth())
3526 // Otherwise, if Mask is 0+1+0+, and if B is known to have the low 0+
3527 // part, we don't need any explicit masks to take them out of A. If that
3528 // is all N is, ignore it.
3529 uint32_t MB = 0, ME = 0;
3530 if (isRunOfOnes(Mask, MB, ME)) { // begin/end bit of run, inclusive
3531 uint32_t BitWidth = cast<IntegerType>(RHS->getType())->getBitWidth();
3532 APInt Mask(APInt::getLowBitsSet(BitWidth, MB-1));
3533 if (MaskedValueIsZero(RHS, Mask))
3538 case Instruction::Or:
3539 case Instruction::Xor:
3540 // If the AndRHS is a power of two minus one (0+1+), and N&Mask == 0
3541 if ((Mask->getValue().countLeadingZeros() +
3542 Mask->getValue().countPopulation()) == Mask->getValue().getBitWidth()
3543 && And(N, Mask)->isZero())
3550 New = BinaryOperator::CreateSub(LHSI->getOperand(0), RHS, "fold");
3552 New = BinaryOperator::CreateAdd(LHSI->getOperand(0), RHS, "fold");
3553 return InsertNewInstBefore(New, I);
3556 Instruction *InstCombiner::visitAnd(BinaryOperator &I) {
3557 bool Changed = SimplifyCommutative(I);
3558 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3560 if (isa<UndefValue>(Op1)) // X & undef -> 0
3561 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
3565 return ReplaceInstUsesWith(I, Op1);
3567 // See if we can simplify any instructions used by the instruction whose sole
3568 // purpose is to compute bits we don't care about.
3569 if (!isa<VectorType>(I.getType())) {
3570 uint32_t BitWidth = cast<IntegerType>(I.getType())->getBitWidth();
3571 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
3572 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
3573 KnownZero, KnownOne))
3576 if (ConstantVector *CP = dyn_cast<ConstantVector>(Op1)) {
3577 if (CP->isAllOnesValue()) // X & <-1,-1> -> X
3578 return ReplaceInstUsesWith(I, I.getOperand(0));
3579 } else if (isa<ConstantAggregateZero>(Op1)) {
3580 return ReplaceInstUsesWith(I, Op1); // X & <0,0> -> <0,0>
3584 if (ConstantInt *AndRHS = dyn_cast<ConstantInt>(Op1)) {
3585 const APInt& AndRHSMask = AndRHS->getValue();
3586 APInt NotAndRHS(~AndRHSMask);
3588 // Optimize a variety of ((val OP C1) & C2) combinations...
3589 if (isa<BinaryOperator>(Op0)) {
3590 Instruction *Op0I = cast<Instruction>(Op0);
3591 Value *Op0LHS = Op0I->getOperand(0);
3592 Value *Op0RHS = Op0I->getOperand(1);
3593 switch (Op0I->getOpcode()) {
3594 case Instruction::Xor:
3595 case Instruction::Or:
3596 // If the mask is only needed on one incoming arm, push it up.
3597 if (Op0I->hasOneUse()) {
3598 if (MaskedValueIsZero(Op0LHS, NotAndRHS)) {
3599 // Not masking anything out for the LHS, move to RHS.
3600 Instruction *NewRHS = BinaryOperator::CreateAnd(Op0RHS, AndRHS,
3601 Op0RHS->getName()+".masked");
3602 InsertNewInstBefore(NewRHS, I);
3603 return BinaryOperator::Create(
3604 cast<BinaryOperator>(Op0I)->getOpcode(), Op0LHS, NewRHS);
3606 if (!isa<Constant>(Op0RHS) &&
3607 MaskedValueIsZero(Op0RHS, NotAndRHS)) {
3608 // Not masking anything out for the RHS, move to LHS.
3609 Instruction *NewLHS = BinaryOperator::CreateAnd(Op0LHS, AndRHS,
3610 Op0LHS->getName()+".masked");
3611 InsertNewInstBefore(NewLHS, I);
3612 return BinaryOperator::Create(
3613 cast<BinaryOperator>(Op0I)->getOpcode(), NewLHS, Op0RHS);
3618 case Instruction::Add:
3619 // ((A & N) + B) & AndRHS -> (A + B) & AndRHS iff N&AndRHS == AndRHS.
3620 // ((A | N) + B) & AndRHS -> (A + B) & AndRHS iff N&AndRHS == 0
3621 // ((A ^ N) + B) & AndRHS -> (A + B) & AndRHS iff N&AndRHS == 0
3622 if (Value *V = FoldLogicalPlusAnd(Op0LHS, Op0RHS, AndRHS, false, I))
3623 return BinaryOperator::CreateAnd(V, AndRHS);
3624 if (Value *V = FoldLogicalPlusAnd(Op0RHS, Op0LHS, AndRHS, false, I))
3625 return BinaryOperator::CreateAnd(V, AndRHS); // Add commutes
3628 case Instruction::Sub:
3629 // ((A & N) - B) & AndRHS -> (A - B) & AndRHS iff N&AndRHS == AndRHS.
3630 // ((A | N) - B) & AndRHS -> (A - B) & AndRHS iff N&AndRHS == 0
3631 // ((A ^ N) - B) & AndRHS -> (A - B) & AndRHS iff N&AndRHS == 0
3632 if (Value *V = FoldLogicalPlusAnd(Op0LHS, Op0RHS, AndRHS, true, I))
3633 return BinaryOperator::CreateAnd(V, AndRHS);
3635 // (A - N) & AndRHS -> -N & AndRHS iff A&AndRHS==0 and AndRHS
3636 // has 1's for all bits that the subtraction with A might affect.
3637 if (Op0I->hasOneUse()) {
3638 uint32_t BitWidth = AndRHSMask.getBitWidth();
3639 uint32_t Zeros = AndRHSMask.countLeadingZeros();
3640 APInt Mask = APInt::getLowBitsSet(BitWidth, BitWidth - Zeros);
3642 ConstantInt *A = dyn_cast<ConstantInt>(Op0LHS);
3643 if (!(A && A->isZero()) && // avoid infinite recursion.
3644 MaskedValueIsZero(Op0LHS, Mask)) {
3645 Instruction *NewNeg = BinaryOperator::CreateNeg(Op0RHS);
3646 InsertNewInstBefore(NewNeg, I);
3647 return BinaryOperator::CreateAnd(NewNeg, AndRHS);
3652 case Instruction::Shl:
3653 case Instruction::LShr:
3654 // (1 << x) & 1 --> zext(x == 0)
3655 // (1 >> x) & 1 --> zext(x == 0)
3656 if (AndRHSMask == 1 && Op0LHS == AndRHS) {
3657 Instruction *NewICmp = new ICmpInst(ICmpInst::ICMP_EQ, Op0RHS,
3658 Constant::getNullValue(I.getType()));
3659 InsertNewInstBefore(NewICmp, I);
3660 return new ZExtInst(NewICmp, I.getType());
3665 if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1)))
3666 if (Instruction *Res = OptAndOp(Op0I, Op0CI, AndRHS, I))
3668 } else if (CastInst *CI = dyn_cast<CastInst>(Op0)) {
3669 // If this is an integer truncation or change from signed-to-unsigned, and
3670 // if the source is an and/or with immediate, transform it. This
3671 // frequently occurs for bitfield accesses.
3672 if (Instruction *CastOp = dyn_cast<Instruction>(CI->getOperand(0))) {
3673 if ((isa<TruncInst>(CI) || isa<BitCastInst>(CI)) &&
3674 CastOp->getNumOperands() == 2)
3675 if (ConstantInt *AndCI = dyn_cast<ConstantInt>(CastOp->getOperand(1))) {
3676 if (CastOp->getOpcode() == Instruction::And) {
3677 // Change: and (cast (and X, C1) to T), C2
3678 // into : and (cast X to T), trunc_or_bitcast(C1)&C2
3679 // This will fold the two constants together, which may allow
3680 // other simplifications.
3681 Instruction *NewCast = CastInst::CreateTruncOrBitCast(
3682 CastOp->getOperand(0), I.getType(),
3683 CastOp->getName()+".shrunk");
3684 NewCast = InsertNewInstBefore(NewCast, I);
3685 // trunc_or_bitcast(C1)&C2
3686 Constant *C3 = ConstantExpr::getTruncOrBitCast(AndCI,I.getType());
3687 C3 = ConstantExpr::getAnd(C3, AndRHS);
3688 return BinaryOperator::CreateAnd(NewCast, C3);
3689 } else if (CastOp->getOpcode() == Instruction::Or) {
3690 // Change: and (cast (or X, C1) to T), C2
3691 // into : trunc(C1)&C2 iff trunc(C1)&C2 == C2
3692 Constant *C3 = ConstantExpr::getTruncOrBitCast(AndCI,I.getType());
3693 if (ConstantExpr::getAnd(C3, AndRHS) == AndRHS) // trunc(C1)&C2
3694 return ReplaceInstUsesWith(I, AndRHS);
3700 // Try to fold constant and into select arguments.
3701 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
3702 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
3704 if (isa<PHINode>(Op0))
3705 if (Instruction *NV = FoldOpIntoPhi(I))
3709 Value *Op0NotVal = dyn_castNotVal(Op0);
3710 Value *Op1NotVal = dyn_castNotVal(Op1);
3712 if (Op0NotVal == Op1 || Op1NotVal == Op0) // A & ~A == ~A & A == 0
3713 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
3715 // (~A & ~B) == (~(A | B)) - De Morgan's Law
3716 if (Op0NotVal && Op1NotVal && isOnlyUse(Op0) && isOnlyUse(Op1)) {
3717 Instruction *Or = BinaryOperator::CreateOr(Op0NotVal, Op1NotVal,
3718 I.getName()+".demorgan");
3719 InsertNewInstBefore(Or, I);
3720 return BinaryOperator::CreateNot(Or);
3724 Value *A = 0, *B = 0, *C = 0, *D = 0;
3725 if (match(Op0, m_Or(m_Value(A), m_Value(B)))) {
3726 if (A == Op1 || B == Op1) // (A | ?) & A --> A
3727 return ReplaceInstUsesWith(I, Op1);
3729 // (A|B) & ~(A&B) -> A^B
3730 if (match(Op1, m_Not(m_And(m_Value(C), m_Value(D))))) {
3731 if ((A == C && B == D) || (A == D && B == C))
3732 return BinaryOperator::CreateXor(A, B);
3736 if (match(Op1, m_Or(m_Value(A), m_Value(B)))) {
3737 if (A == Op0 || B == Op0) // A & (A | ?) --> A
3738 return ReplaceInstUsesWith(I, Op0);
3740 // ~(A&B) & (A|B) -> A^B
3741 if (match(Op0, m_Not(m_And(m_Value(C), m_Value(D))))) {
3742 if ((A == C && B == D) || (A == D && B == C))
3743 return BinaryOperator::CreateXor(A, B);
3747 if (Op0->hasOneUse() &&
3748 match(Op0, m_Xor(m_Value(A), m_Value(B)))) {
3749 if (A == Op1) { // (A^B)&A -> A&(A^B)
3750 I.swapOperands(); // Simplify below
3751 std::swap(Op0, Op1);
3752 } else if (B == Op1) { // (A^B)&B -> B&(B^A)
3753 cast<BinaryOperator>(Op0)->swapOperands();
3754 I.swapOperands(); // Simplify below
3755 std::swap(Op0, Op1);
3758 if (Op1->hasOneUse() &&
3759 match(Op1, m_Xor(m_Value(A), m_Value(B)))) {
3760 if (B == Op0) { // B&(A^B) -> B&(B^A)
3761 cast<BinaryOperator>(Op1)->swapOperands();
3764 if (A == Op0) { // A&(A^B) -> A & ~B
3765 Instruction *NotB = BinaryOperator::CreateNot(B, "tmp");
3766 InsertNewInstBefore(NotB, I);
3767 return BinaryOperator::CreateAnd(A, NotB);
3772 { // (icmp ult A, C) & (icmp ult B, C) --> (icmp ult (A|B), C)
3773 // where C is a power of 2
3775 ConstantInt *C1, *C2;
3776 ICmpInst::Predicate LHSCC = ICmpInst::BAD_ICMP_PREDICATE;
3777 ICmpInst::Predicate RHSCC = ICmpInst::BAD_ICMP_PREDICATE;
3778 if (match(&I, m_And(m_ICmp(LHSCC, m_Value(A), m_ConstantInt(C1)),
3779 m_ICmp(RHSCC, m_Value(B), m_ConstantInt(C2)))))
3780 if (C1 == C2 && LHSCC == RHSCC && LHSCC == ICmpInst::ICMP_ULT &&
3781 C1->getValue().isPowerOf2()) {
3782 Instruction *NewOr = BinaryOperator::CreateOr(A, B);
3783 InsertNewInstBefore(NewOr, I);
3784 return new ICmpInst(LHSCC, NewOr, C1);
3788 if (ICmpInst *RHS = dyn_cast<ICmpInst>(Op1)) {
3789 // (icmp1 A, B) & (icmp2 A, B) --> (icmp3 A, B)
3790 if (Instruction *R = AssociativeOpt(I, FoldICmpLogical(*this, RHS)))
3793 Value *LHSVal, *RHSVal;
3794 ConstantInt *LHSCst, *RHSCst;
3795 ICmpInst::Predicate LHSCC, RHSCC;
3796 if (match(Op0, m_ICmp(LHSCC, m_Value(LHSVal), m_ConstantInt(LHSCst))))
3797 if (match(RHS, m_ICmp(RHSCC, m_Value(RHSVal), m_ConstantInt(RHSCst))))
3798 if (LHSVal == RHSVal && // Found (X icmp C1) & (X icmp C2)
3799 // ICMP_[GL]E X, CST is folded to ICMP_[GL]T elsewhere.
3800 LHSCC != ICmpInst::ICMP_UGE && LHSCC != ICmpInst::ICMP_ULE &&
3801 RHSCC != ICmpInst::ICMP_UGE && RHSCC != ICmpInst::ICMP_ULE &&
3802 LHSCC != ICmpInst::ICMP_SGE && LHSCC != ICmpInst::ICMP_SLE &&
3803 RHSCC != ICmpInst::ICMP_SGE && RHSCC != ICmpInst::ICMP_SLE &&
3805 // Don't try to fold ICMP_SLT + ICMP_ULT.
3806 (ICmpInst::isEquality(LHSCC) || ICmpInst::isEquality(RHSCC) ||
3807 ICmpInst::isSignedPredicate(LHSCC) ==
3808 ICmpInst::isSignedPredicate(RHSCC))) {
3809 // Ensure that the larger constant is on the RHS.
3810 ICmpInst::Predicate GT;
3811 if (ICmpInst::isSignedPredicate(LHSCC) ||
3812 (ICmpInst::isEquality(LHSCC) &&
3813 ICmpInst::isSignedPredicate(RHSCC)))
3814 GT = ICmpInst::ICMP_SGT;
3816 GT = ICmpInst::ICMP_UGT;
3818 Constant *Cmp = ConstantExpr::getICmp(GT, LHSCst, RHSCst);
3819 ICmpInst *LHS = cast<ICmpInst>(Op0);
3820 if (cast<ConstantInt>(Cmp)->getZExtValue()) {
3821 std::swap(LHS, RHS);
3822 std::swap(LHSCst, RHSCst);
3823 std::swap(LHSCC, RHSCC);
3826 // At this point, we know we have have two icmp instructions
3827 // comparing a value against two constants and and'ing the result
3828 // together. Because of the above check, we know that we only have
3829 // icmp eq, icmp ne, icmp [su]lt, and icmp [SU]gt here. We also know
3830 // (from the FoldICmpLogical check above), that the two constants
3831 // are not equal and that the larger constant is on the RHS
3832 assert(LHSCst != RHSCst && "Compares not folded above?");
3835 default: assert(0 && "Unknown integer condition code!");
3836 case ICmpInst::ICMP_EQ:
3838 default: assert(0 && "Unknown integer condition code!");
3839 case ICmpInst::ICMP_EQ: // (X == 13 & X == 15) -> false
3840 case ICmpInst::ICMP_UGT: // (X == 13 & X > 15) -> false
3841 case ICmpInst::ICMP_SGT: // (X == 13 & X > 15) -> false
3842 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
3843 case ICmpInst::ICMP_NE: // (X == 13 & X != 15) -> X == 13
3844 case ICmpInst::ICMP_ULT: // (X == 13 & X < 15) -> X == 13
3845 case ICmpInst::ICMP_SLT: // (X == 13 & X < 15) -> X == 13
3846 return ReplaceInstUsesWith(I, LHS);
3848 case ICmpInst::ICMP_NE:
3850 default: assert(0 && "Unknown integer condition code!");
3851 case ICmpInst::ICMP_ULT:
3852 if (LHSCst == SubOne(RHSCst)) // (X != 13 & X u< 14) -> X < 13
3853 return new ICmpInst(ICmpInst::ICMP_ULT, LHSVal, LHSCst);
3854 break; // (X != 13 & X u< 15) -> no change
3855 case ICmpInst::ICMP_SLT:
3856 if (LHSCst == SubOne(RHSCst)) // (X != 13 & X s< 14) -> X < 13
3857 return new ICmpInst(ICmpInst::ICMP_SLT, LHSVal, LHSCst);
3858 break; // (X != 13 & X s< 15) -> no change
3859 case ICmpInst::ICMP_EQ: // (X != 13 & X == 15) -> X == 15
3860 case ICmpInst::ICMP_UGT: // (X != 13 & X u> 15) -> X u> 15
3861 case ICmpInst::ICMP_SGT: // (X != 13 & X s> 15) -> X s> 15
3862 return ReplaceInstUsesWith(I, RHS);
3863 case ICmpInst::ICMP_NE:
3864 if (LHSCst == SubOne(RHSCst)){// (X != 13 & X != 14) -> X-13 >u 1
3865 Constant *AddCST = ConstantExpr::getNeg(LHSCst);
3866 Instruction *Add = BinaryOperator::CreateAdd(LHSVal, AddCST,
3867 LHSVal->getName()+".off");
3868 InsertNewInstBefore(Add, I);
3869 return new ICmpInst(ICmpInst::ICMP_UGT, Add,
3870 ConstantInt::get(Add->getType(), 1));
3872 break; // (X != 13 & X != 15) -> no change
3875 case ICmpInst::ICMP_ULT:
3877 default: assert(0 && "Unknown integer condition code!");
3878 case ICmpInst::ICMP_EQ: // (X u< 13 & X == 15) -> false
3879 case ICmpInst::ICMP_UGT: // (X u< 13 & X u> 15) -> false
3880 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
3881 case ICmpInst::ICMP_SGT: // (X u< 13 & X s> 15) -> no change
3883 case ICmpInst::ICMP_NE: // (X u< 13 & X != 15) -> X u< 13
3884 case ICmpInst::ICMP_ULT: // (X u< 13 & X u< 15) -> X u< 13
3885 return ReplaceInstUsesWith(I, LHS);
3886 case ICmpInst::ICMP_SLT: // (X u< 13 & X s< 15) -> no change
3890 case ICmpInst::ICMP_SLT:
3892 default: assert(0 && "Unknown integer condition code!");
3893 case ICmpInst::ICMP_EQ: // (X s< 13 & X == 15) -> false
3894 case ICmpInst::ICMP_SGT: // (X s< 13 & X s> 15) -> false
3895 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
3896 case ICmpInst::ICMP_UGT: // (X s< 13 & X u> 15) -> no change
3898 case ICmpInst::ICMP_NE: // (X s< 13 & X != 15) -> X < 13
3899 case ICmpInst::ICMP_SLT: // (X s< 13 & X s< 15) -> X < 13
3900 return ReplaceInstUsesWith(I, LHS);
3901 case ICmpInst::ICMP_ULT: // (X s< 13 & X u< 15) -> no change
3905 case ICmpInst::ICMP_UGT:
3907 default: assert(0 && "Unknown integer condition code!");
3908 case ICmpInst::ICMP_EQ: // (X u> 13 & X == 15) -> X == 15
3909 case ICmpInst::ICMP_UGT: // (X u> 13 & X u> 15) -> X u> 15
3910 return ReplaceInstUsesWith(I, RHS);
3911 case ICmpInst::ICMP_SGT: // (X u> 13 & X s> 15) -> no change
3913 case ICmpInst::ICMP_NE:
3914 if (RHSCst == AddOne(LHSCst)) // (X u> 13 & X != 14) -> X u> 14
3915 return new ICmpInst(LHSCC, LHSVal, RHSCst);
3916 break; // (X u> 13 & X != 15) -> no change
3917 case ICmpInst::ICMP_ULT: // (X u> 13 & X u< 15) ->(X-14) <u 1
3918 return InsertRangeTest(LHSVal, AddOne(LHSCst), RHSCst, false,
3920 case ICmpInst::ICMP_SLT: // (X u> 13 & X s< 15) -> no change
3924 case ICmpInst::ICMP_SGT:
3926 default: assert(0 && "Unknown integer condition code!");
3927 case ICmpInst::ICMP_EQ: // (X s> 13 & X == 15) -> X == 15
3928 case ICmpInst::ICMP_SGT: // (X s> 13 & X s> 15) -> X s> 15
3929 return ReplaceInstUsesWith(I, RHS);
3930 case ICmpInst::ICMP_UGT: // (X s> 13 & X u> 15) -> no change
3932 case ICmpInst::ICMP_NE:
3933 if (RHSCst == AddOne(LHSCst)) // (X s> 13 & X != 14) -> X s> 14
3934 return new ICmpInst(LHSCC, LHSVal, RHSCst);
3935 break; // (X s> 13 & X != 15) -> no change
3936 case ICmpInst::ICMP_SLT: // (X s> 13 & X s< 15) ->(X-14) s< 1
3937 return InsertRangeTest(LHSVal, AddOne(LHSCst), RHSCst, true,
3939 case ICmpInst::ICMP_ULT: // (X s> 13 & X u< 15) -> no change
3947 // fold (and (cast A), (cast B)) -> (cast (and A, B))
3948 if (CastInst *Op0C = dyn_cast<CastInst>(Op0))
3949 if (CastInst *Op1C = dyn_cast<CastInst>(Op1))
3950 if (Op0C->getOpcode() == Op1C->getOpcode()) { // same cast kind ?
3951 const Type *SrcTy = Op0C->getOperand(0)->getType();
3952 if (SrcTy == Op1C->getOperand(0)->getType() && SrcTy->isInteger() &&
3953 // Only do this if the casts both really cause code to be generated.
3954 ValueRequiresCast(Op0C->getOpcode(), Op0C->getOperand(0),
3956 ValueRequiresCast(Op1C->getOpcode(), Op1C->getOperand(0),
3958 Instruction *NewOp = BinaryOperator::CreateAnd(Op0C->getOperand(0),
3959 Op1C->getOperand(0),
3961 InsertNewInstBefore(NewOp, I);
3962 return CastInst::Create(Op0C->getOpcode(), NewOp, I.getType());
3966 // (X >> Z) & (Y >> Z) -> (X&Y) >> Z for all shifts.
3967 if (BinaryOperator *SI1 = dyn_cast<BinaryOperator>(Op1)) {
3968 if (BinaryOperator *SI0 = dyn_cast<BinaryOperator>(Op0))
3969 if (SI0->isShift() && SI0->getOpcode() == SI1->getOpcode() &&
3970 SI0->getOperand(1) == SI1->getOperand(1) &&
3971 (SI0->hasOneUse() || SI1->hasOneUse())) {
3972 Instruction *NewOp =
3973 InsertNewInstBefore(BinaryOperator::CreateAnd(SI0->getOperand(0),
3975 SI0->getName()), I);
3976 return BinaryOperator::Create(SI1->getOpcode(), NewOp,
3977 SI1->getOperand(1));
3981 // If and'ing two fcmp, try combine them into one.
3982 if (FCmpInst *LHS = dyn_cast<FCmpInst>(I.getOperand(0))) {
3983 if (FCmpInst *RHS = dyn_cast<FCmpInst>(I.getOperand(1))) {
3984 if (LHS->getPredicate() == FCmpInst::FCMP_ORD &&
3985 RHS->getPredicate() == FCmpInst::FCMP_ORD) {
3986 // (fcmp ord x, c) & (fcmp ord y, c) -> (fcmp ord x, y)
3987 if (ConstantFP *LHSC = dyn_cast<ConstantFP>(LHS->getOperand(1)))
3988 if (ConstantFP *RHSC = dyn_cast<ConstantFP>(RHS->getOperand(1))) {
3989 // If either of the constants are nans, then the whole thing returns
3991 if (LHSC->getValueAPF().isNaN() || RHSC->getValueAPF().isNaN())
3992 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
3993 return new FCmpInst(FCmpInst::FCMP_ORD, LHS->getOperand(0),
3994 RHS->getOperand(0));
3997 Value *Op0LHS, *Op0RHS, *Op1LHS, *Op1RHS;
3998 FCmpInst::Predicate Op0CC, Op1CC;
3999 if (match(Op0, m_FCmp(Op0CC, m_Value(Op0LHS), m_Value(Op0RHS))) &&
4000 match(Op1, m_FCmp(Op1CC, m_Value(Op1LHS), m_Value(Op1RHS)))) {
4001 if (Op0LHS == Op1RHS && Op0RHS == Op1LHS) {
4002 // Swap RHS operands to match LHS.
4003 Op1CC = FCmpInst::getSwappedPredicate(Op1CC);
4004 std::swap(Op1LHS, Op1RHS);
4006 if (Op0LHS == Op1LHS && Op0RHS == Op1RHS) {
4007 // Simplify (fcmp cc0 x, y) & (fcmp cc1 x, y).
4009 return new FCmpInst((FCmpInst::Predicate)Op0CC, Op0LHS, Op0RHS);
4010 else if (Op0CC == FCmpInst::FCMP_FALSE ||
4011 Op1CC == FCmpInst::FCMP_FALSE)
4012 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4013 else if (Op0CC == FCmpInst::FCMP_TRUE)
4014 return ReplaceInstUsesWith(I, Op1);
4015 else if (Op1CC == FCmpInst::FCMP_TRUE)
4016 return ReplaceInstUsesWith(I, Op0);
4019 unsigned Op0Pred = getFCmpCode(Op0CC, Op0Ordered);
4020 unsigned Op1Pred = getFCmpCode(Op1CC, Op1Ordered);
4022 std::swap(Op0, Op1);
4023 std::swap(Op0Pred, Op1Pred);
4024 std::swap(Op0Ordered, Op1Ordered);
4027 // uno && ueq -> uno && (uno || eq) -> ueq
4028 // ord && olt -> ord && (ord && lt) -> olt
4029 if (Op0Ordered == Op1Ordered)
4030 return ReplaceInstUsesWith(I, Op1);
4031 // uno && oeq -> uno && (ord && eq) -> false
4032 // uno && ord -> false
4034 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
4035 // ord && ueq -> ord && (uno || eq) -> oeq
4036 return cast<Instruction>(getFCmpValue(true, Op1Pred,
4045 return Changed ? &I : 0;
4048 /// CollectBSwapParts - Analyze the specified subexpression and see if it is
4049 /// capable of providing pieces of a bswap. The subexpression provides pieces
4050 /// of a bswap if it is proven that each of the non-zero bytes in the output of
4051 /// the expression came from the corresponding "byte swapped" byte in some other
4052 /// value. For example, if the current subexpression is "(shl i32 %X, 24)" then
4053 /// we know that the expression deposits the low byte of %X into the high byte
4054 /// of the bswap result and that all other bytes are zero. This expression is
4055 /// accepted, the high byte of ByteValues is set to X to indicate a correct
4058 /// This function returns true if the match was unsuccessful and false if so.
4059 /// On entry to the function the "OverallLeftShift" is a signed integer value
4060 /// indicating the number of bytes that the subexpression is later shifted. For
4061 /// example, if the expression is later right shifted by 16 bits, the
4062 /// OverallLeftShift value would be -2 on entry. This is used to specify which
4063 /// byte of ByteValues is actually being set.
4065 /// Similarly, ByteMask is a bitmask where a bit is clear if its corresponding
4066 /// byte is masked to zero by a user. For example, in (X & 255), X will be
4067 /// processed with a bytemask of 1. Because bytemask is 32-bits, this limits
4068 /// this function to working on up to 32-byte (256 bit) values. ByteMask is
4069 /// always in the local (OverallLeftShift) coordinate space.
4071 static bool CollectBSwapParts(Value *V, int OverallLeftShift, uint32_t ByteMask,
4072 SmallVector<Value*, 8> &ByteValues) {
4073 if (Instruction *I = dyn_cast<Instruction>(V)) {
4074 // If this is an or instruction, it may be an inner node of the bswap.
4075 if (I->getOpcode() == Instruction::Or) {
4076 return CollectBSwapParts(I->getOperand(0), OverallLeftShift, ByteMask,
4078 CollectBSwapParts(I->getOperand(1), OverallLeftShift, ByteMask,
4082 // If this is a logical shift by a constant multiple of 8, recurse with
4083 // OverallLeftShift and ByteMask adjusted.
4084 if (I->isLogicalShift() && isa<ConstantInt>(I->getOperand(1))) {
4086 cast<ConstantInt>(I->getOperand(1))->getLimitedValue(~0U);
4087 // Ensure the shift amount is defined and of a byte value.
4088 if ((ShAmt & 7) || (ShAmt > 8*ByteValues.size()))
4091 unsigned ByteShift = ShAmt >> 3;
4092 if (I->getOpcode() == Instruction::Shl) {
4093 // X << 2 -> collect(X, +2)
4094 OverallLeftShift += ByteShift;
4095 ByteMask >>= ByteShift;
4097 // X >>u 2 -> collect(X, -2)
4098 OverallLeftShift -= ByteShift;
4099 ByteMask <<= ByteShift;
4100 ByteMask &= (~0U >> (32-ByteValues.size()));
4103 if (OverallLeftShift >= (int)ByteValues.size()) return true;
4104 if (OverallLeftShift <= -(int)ByteValues.size()) return true;
4106 return CollectBSwapParts(I->getOperand(0), OverallLeftShift, ByteMask,
4110 // If this is a logical 'and' with a mask that clears bytes, clear the
4111 // corresponding bytes in ByteMask.
4112 if (I->getOpcode() == Instruction::And &&
4113 isa<ConstantInt>(I->getOperand(1))) {
4114 // Scan every byte of the and mask, seeing if the byte is either 0 or 255.
4115 unsigned NumBytes = ByteValues.size();
4116 APInt Byte(I->getType()->getPrimitiveSizeInBits(), 255);
4117 const APInt &AndMask = cast<ConstantInt>(I->getOperand(1))->getValue();
4119 for (unsigned i = 0; i != NumBytes; ++i, Byte <<= 8) {
4120 // If this byte is masked out by a later operation, we don't care what
4122 if ((ByteMask & (1 << i)) == 0)
4125 // If the AndMask is all zeros for this byte, clear the bit.
4126 APInt MaskB = AndMask & Byte;
4128 ByteMask &= ~(1U << i);
4132 // If the AndMask is not all ones for this byte, it's not a bytezap.
4136 // Otherwise, this byte is kept.
4139 return CollectBSwapParts(I->getOperand(0), OverallLeftShift, ByteMask,
4144 // Okay, we got to something that isn't a shift, 'or' or 'and'. This must be
4145 // the input value to the bswap. Some observations: 1) if more than one byte
4146 // is demanded from this input, then it could not be successfully assembled
4147 // into a byteswap. At least one of the two bytes would not be aligned with
4148 // their ultimate destination.
4149 if (!isPowerOf2_32(ByteMask)) return true;
4150 unsigned InputByteNo = CountTrailingZeros_32(ByteMask);
4152 // 2) The input and ultimate destinations must line up: if byte 3 of an i32
4153 // is demanded, it needs to go into byte 0 of the result. This means that the
4154 // byte needs to be shifted until it lands in the right byte bucket. The
4155 // shift amount depends on the position: if the byte is coming from the high
4156 // part of the value (e.g. byte 3) then it must be shifted right. If from the
4157 // low part, it must be shifted left.
4158 unsigned DestByteNo = InputByteNo + OverallLeftShift;
4159 if (InputByteNo < ByteValues.size()/2) {
4160 if (ByteValues.size()-1-DestByteNo != InputByteNo)
4163 if (ByteValues.size()-1-DestByteNo != InputByteNo)
4167 // If the destination byte value is already defined, the values are or'd
4168 // together, which isn't a bswap (unless it's an or of the same bits).
4169 if (ByteValues[DestByteNo] && ByteValues[DestByteNo] != V)
4171 ByteValues[DestByteNo] = V;
4175 /// MatchBSwap - Given an OR instruction, check to see if this is a bswap idiom.
4176 /// If so, insert the new bswap intrinsic and return it.
4177 Instruction *InstCombiner::MatchBSwap(BinaryOperator &I) {
4178 const IntegerType *ITy = dyn_cast<IntegerType>(I.getType());
4179 if (!ITy || ITy->getBitWidth() % 16 ||
4180 // ByteMask only allows up to 32-byte values.
4181 ITy->getBitWidth() > 32*8)
4182 return 0; // Can only bswap pairs of bytes. Can't do vectors.
4184 /// ByteValues - For each byte of the result, we keep track of which value
4185 /// defines each byte.
4186 SmallVector<Value*, 8> ByteValues;
4187 ByteValues.resize(ITy->getBitWidth()/8);
4189 // Try to find all the pieces corresponding to the bswap.
4190 uint32_t ByteMask = ~0U >> (32-ByteValues.size());
4191 if (CollectBSwapParts(&I, 0, ByteMask, ByteValues))
4194 // Check to see if all of the bytes come from the same value.
4195 Value *V = ByteValues[0];
4196 if (V == 0) return 0; // Didn't find a byte? Must be zero.
4198 // Check to make sure that all of the bytes come from the same value.
4199 for (unsigned i = 1, e = ByteValues.size(); i != e; ++i)
4200 if (ByteValues[i] != V)
4202 const Type *Tys[] = { ITy };
4203 Module *M = I.getParent()->getParent()->getParent();
4204 Function *F = Intrinsic::getDeclaration(M, Intrinsic::bswap, Tys, 1);
4205 return CallInst::Create(F, V);
4208 /// MatchSelectFromAndOr - We have an expression of the form (A&C)|(B&D). Check
4209 /// If A is (cond?-1:0) and either B or D is ~(cond?-1,0) or (cond?0,-1), then
4210 /// we can simplify this expression to "cond ? C : D or B".
4211 static Instruction *MatchSelectFromAndOr(Value *A, Value *B,
4212 Value *C, Value *D) {
4213 // If A is not a select of constants, this can't match.
4214 Value *Cond = 0, *Cond2 = 0;
4215 ConstantInt *C1, *C2;
4216 if (!match(A, m_Select(m_Value(Cond), m_ConstantInt(C1), m_ConstantInt(C2))))
4219 #define SELECT_MATCH(Val, I1, I2) \
4220 m_Select(m_Value(Val), m_ConstantInt(I1), m_ConstantInt(I2))
4222 // Handle "cond ? -1 : 0".
4223 if (C1->isAllOnesValue() && C2->isZero()) {
4224 // ((cond?-1:0)&C) | (B&(cond?0:-1)) -> cond ? C : B.
4225 if (match(D, SELECT_MATCH(Cond2, 0, -1)) && Cond2 == Cond)
4226 return SelectInst::Create(Cond, C, B);
4227 if (match(D, m_Not(SELECT_MATCH(Cond2, -1, 0))) && Cond2 == Cond)
4228 return SelectInst::Create(Cond, C, B);
4229 // ((cond?-1:0)&C) | ((cond?0:-1)&D) -> cond ? C : D.
4230 if (match(B, SELECT_MATCH(Cond2, 0, -1)) && Cond2 == Cond)
4231 return SelectInst::Create(Cond, C, D);
4232 if (match(B, m_Not(SELECT_MATCH(Cond2, -1, 0))) && Cond2 == Cond)
4233 return SelectInst::Create(Cond, C, D);
4240 Instruction *InstCombiner::visitOr(BinaryOperator &I) {
4241 bool Changed = SimplifyCommutative(I);
4242 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
4244 if (isa<UndefValue>(Op1)) // X | undef -> -1
4245 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
4249 return ReplaceInstUsesWith(I, Op0);
4251 // See if we can simplify any instructions used by the instruction whose sole
4252 // purpose is to compute bits we don't care about.
4253 if (!isa<VectorType>(I.getType())) {
4254 uint32_t BitWidth = cast<IntegerType>(I.getType())->getBitWidth();
4255 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
4256 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
4257 KnownZero, KnownOne))
4259 } else if (isa<ConstantAggregateZero>(Op1)) {
4260 return ReplaceInstUsesWith(I, Op0); // X | <0,0> -> X
4261 } else if (ConstantVector *CP = dyn_cast<ConstantVector>(Op1)) {
4262 if (CP->isAllOnesValue()) // X | <-1,-1> -> <-1,-1>
4263 return ReplaceInstUsesWith(I, I.getOperand(1));
4269 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
4270 ConstantInt *C1 = 0; Value *X = 0;
4271 // (X & C1) | C2 --> (X | C2) & (C1|C2)
4272 if (match(Op0, m_And(m_Value(X), m_ConstantInt(C1))) && isOnlyUse(Op0)) {
4273 Instruction *Or = BinaryOperator::CreateOr(X, RHS);
4274 InsertNewInstBefore(Or, I);
4276 return BinaryOperator::CreateAnd(Or,
4277 ConstantInt::get(RHS->getValue() | C1->getValue()));
4280 // (X ^ C1) | C2 --> (X | C2) ^ (C1&~C2)
4281 if (match(Op0, m_Xor(m_Value(X), m_ConstantInt(C1))) && isOnlyUse(Op0)) {
4282 Instruction *Or = BinaryOperator::CreateOr(X, RHS);
4283 InsertNewInstBefore(Or, I);
4285 return BinaryOperator::CreateXor(Or,
4286 ConstantInt::get(C1->getValue() & ~RHS->getValue()));
4289 // Try to fold constant and into select arguments.
4290 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
4291 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
4293 if (isa<PHINode>(Op0))
4294 if (Instruction *NV = FoldOpIntoPhi(I))
4298 Value *A = 0, *B = 0;
4299 ConstantInt *C1 = 0, *C2 = 0;
4301 if (match(Op0, m_And(m_Value(A), m_Value(B))))
4302 if (A == Op1 || B == Op1) // (A & ?) | A --> A
4303 return ReplaceInstUsesWith(I, Op1);
4304 if (match(Op1, m_And(m_Value(A), m_Value(B))))
4305 if (A == Op0 || B == Op0) // A | (A & ?) --> A
4306 return ReplaceInstUsesWith(I, Op0);
4308 // (A | B) | C and A | (B | C) -> bswap if possible.
4309 // (A >> B) | (C << D) and (A << B) | (B >> C) -> bswap if possible.
4310 if (match(Op0, m_Or(m_Value(), m_Value())) ||
4311 match(Op1, m_Or(m_Value(), m_Value())) ||
4312 (match(Op0, m_Shift(m_Value(), m_Value())) &&
4313 match(Op1, m_Shift(m_Value(), m_Value())))) {
4314 if (Instruction *BSwap = MatchBSwap(I))
4318 // (X^C)|Y -> (X|Y)^C iff Y&C == 0
4319 if (Op0->hasOneUse() && match(Op0, m_Xor(m_Value(A), m_ConstantInt(C1))) &&
4320 MaskedValueIsZero(Op1, C1->getValue())) {
4321 Instruction *NOr = BinaryOperator::CreateOr(A, Op1);
4322 InsertNewInstBefore(NOr, I);
4324 return BinaryOperator::CreateXor(NOr, C1);
4327 // Y|(X^C) -> (X|Y)^C iff Y&C == 0
4328 if (Op1->hasOneUse() && match(Op1, m_Xor(m_Value(A), m_ConstantInt(C1))) &&
4329 MaskedValueIsZero(Op0, C1->getValue())) {
4330 Instruction *NOr = BinaryOperator::CreateOr(A, Op0);
4331 InsertNewInstBefore(NOr, I);
4333 return BinaryOperator::CreateXor(NOr, C1);
4337 Value *C = 0, *D = 0;
4338 if (match(Op0, m_And(m_Value(A), m_Value(C))) &&
4339 match(Op1, m_And(m_Value(B), m_Value(D)))) {
4340 Value *V1 = 0, *V2 = 0, *V3 = 0;
4341 C1 = dyn_cast<ConstantInt>(C);
4342 C2 = dyn_cast<ConstantInt>(D);
4343 if (C1 && C2) { // (A & C1)|(B & C2)
4344 // If we have: ((V + N) & C1) | (V & C2)
4345 // .. and C2 = ~C1 and C2 is 0+1+ and (N & C2) == 0
4346 // replace with V+N.
4347 if (C1->getValue() == ~C2->getValue()) {
4348 if ((C2->getValue() & (C2->getValue()+1)) == 0 && // C2 == 0+1+
4349 match(A, m_Add(m_Value(V1), m_Value(V2)))) {
4350 // Add commutes, try both ways.
4351 if (V1 == B && MaskedValueIsZero(V2, C2->getValue()))
4352 return ReplaceInstUsesWith(I, A);
4353 if (V2 == B && MaskedValueIsZero(V1, C2->getValue()))
4354 return ReplaceInstUsesWith(I, A);
4356 // Or commutes, try both ways.
4357 if ((C1->getValue() & (C1->getValue()+1)) == 0 &&
4358 match(B, m_Add(m_Value(V1), m_Value(V2)))) {
4359 // Add commutes, try both ways.
4360 if (V1 == A && MaskedValueIsZero(V2, C1->getValue()))
4361 return ReplaceInstUsesWith(I, B);
4362 if (V2 == A && MaskedValueIsZero(V1, C1->getValue()))
4363 return ReplaceInstUsesWith(I, B);
4366 V1 = 0; V2 = 0; V3 = 0;
4369 // Check to see if we have any common things being and'ed. If so, find the
4370 // terms for V1 & (V2|V3).
4371 if (isOnlyUse(Op0) || isOnlyUse(Op1)) {
4372 if (A == B) // (A & C)|(A & D) == A & (C|D)
4373 V1 = A, V2 = C, V3 = D;
4374 else if (A == D) // (A & C)|(B & A) == A & (B|C)
4375 V1 = A, V2 = B, V3 = C;
4376 else if (C == B) // (A & C)|(C & D) == C & (A|D)
4377 V1 = C, V2 = A, V3 = D;
4378 else if (C == D) // (A & C)|(B & C) == C & (A|B)
4379 V1 = C, V2 = A, V3 = B;
4383 InsertNewInstBefore(BinaryOperator::CreateOr(V2, V3, "tmp"), I);
4384 return BinaryOperator::CreateAnd(V1, Or);
4388 // (A & (C0?-1:0)) | (B & ~(C0?-1:0)) -> C0 ? A : B, and commuted variants
4389 if (Instruction *Match = MatchSelectFromAndOr(A, B, C, D))
4391 if (Instruction *Match = MatchSelectFromAndOr(B, A, D, C))
4393 if (Instruction *Match = MatchSelectFromAndOr(C, B, A, D))
4395 if (Instruction *Match = MatchSelectFromAndOr(D, A, B, C))
4399 // (X >> Z) | (Y >> Z) -> (X|Y) >> Z for all shifts.
4400 if (BinaryOperator *SI1 = dyn_cast<BinaryOperator>(Op1)) {
4401 if (BinaryOperator *SI0 = dyn_cast<BinaryOperator>(Op0))
4402 if (SI0->isShift() && SI0->getOpcode() == SI1->getOpcode() &&
4403 SI0->getOperand(1) == SI1->getOperand(1) &&
4404 (SI0->hasOneUse() || SI1->hasOneUse())) {
4405 Instruction *NewOp =
4406 InsertNewInstBefore(BinaryOperator::CreateOr(SI0->getOperand(0),
4408 SI0->getName()), I);
4409 return BinaryOperator::Create(SI1->getOpcode(), NewOp,
4410 SI1->getOperand(1));
4414 if (match(Op0, m_Not(m_Value(A)))) { // ~A | Op1
4415 if (A == Op1) // ~A | A == -1
4416 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
4420 // Note, A is still live here!
4421 if (match(Op1, m_Not(m_Value(B)))) { // Op0 | ~B
4423 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
4425 // (~A | ~B) == (~(A & B)) - De Morgan's Law
4426 if (A && isOnlyUse(Op0) && isOnlyUse(Op1)) {
4427 Value *And = InsertNewInstBefore(BinaryOperator::CreateAnd(A, B,
4428 I.getName()+".demorgan"), I);
4429 return BinaryOperator::CreateNot(And);
4433 // (icmp1 A, B) | (icmp2 A, B) --> (icmp3 A, B)
4434 if (ICmpInst *RHS = dyn_cast<ICmpInst>(I.getOperand(1))) {
4435 if (Instruction *R = AssociativeOpt(I, FoldICmpLogical(*this, RHS)))
4438 Value *LHSVal, *RHSVal;
4439 ConstantInt *LHSCst, *RHSCst;
4440 ICmpInst::Predicate LHSCC, RHSCC;
4441 if (match(Op0, m_ICmp(LHSCC, m_Value(LHSVal), m_ConstantInt(LHSCst))))
4442 if (match(RHS, m_ICmp(RHSCC, m_Value(RHSVal), m_ConstantInt(RHSCst))))
4443 if (LHSVal == RHSVal && // Found (X icmp C1) | (X icmp C2)
4444 // icmp [us][gl]e x, cst is folded to icmp [us][gl]t elsewhere.
4445 LHSCC != ICmpInst::ICMP_UGE && LHSCC != ICmpInst::ICMP_ULE &&
4446 RHSCC != ICmpInst::ICMP_UGE && RHSCC != ICmpInst::ICMP_ULE &&
4447 LHSCC != ICmpInst::ICMP_SGE && LHSCC != ICmpInst::ICMP_SLE &&
4448 RHSCC != ICmpInst::ICMP_SGE && RHSCC != ICmpInst::ICMP_SLE &&
4449 // We can't fold (ugt x, C) | (sgt x, C2).
4450 PredicatesFoldable(LHSCC, RHSCC)) {
4451 // Ensure that the larger constant is on the RHS.
4452 ICmpInst *LHS = cast<ICmpInst>(Op0);
4454 if (ICmpInst::isEquality(LHSCC) ? ICmpInst::isSignedPredicate(RHSCC)
4455 : ICmpInst::isSignedPredicate(LHSCC))
4456 NeedsSwap = LHSCst->getValue().sgt(RHSCst->getValue());
4458 NeedsSwap = LHSCst->getValue().ugt(RHSCst->getValue());
4461 std::swap(LHS, RHS);
4462 std::swap(LHSCst, RHSCst);
4463 std::swap(LHSCC, RHSCC);
4466 // At this point, we know we have have two icmp instructions
4467 // comparing a value against two constants and or'ing the result
4468 // together. Because of the above check, we know that we only have
4469 // ICMP_EQ, ICMP_NE, ICMP_LT, and ICMP_GT here. We also know (from the
4470 // FoldICmpLogical check above), that the two constants are not
4472 assert(LHSCst != RHSCst && "Compares not folded above?");
4475 default: assert(0 && "Unknown integer condition code!");
4476 case ICmpInst::ICMP_EQ:
4478 default: assert(0 && "Unknown integer condition code!");
4479 case ICmpInst::ICMP_EQ:
4480 if (LHSCst == SubOne(RHSCst)) {// (X == 13 | X == 14) -> X-13 <u 2
4481 Constant *AddCST = ConstantExpr::getNeg(LHSCst);
4482 Instruction *Add = BinaryOperator::CreateAdd(LHSVal, AddCST,
4483 LHSVal->getName()+".off");
4484 InsertNewInstBefore(Add, I);
4485 AddCST = Subtract(AddOne(RHSCst), LHSCst);
4486 return new ICmpInst(ICmpInst::ICMP_ULT, Add, AddCST);
4488 break; // (X == 13 | X == 15) -> no change
4489 case ICmpInst::ICMP_UGT: // (X == 13 | X u> 14) -> no change
4490 case ICmpInst::ICMP_SGT: // (X == 13 | X s> 14) -> no change
4492 case ICmpInst::ICMP_NE: // (X == 13 | X != 15) -> X != 15
4493 case ICmpInst::ICMP_ULT: // (X == 13 | X u< 15) -> X u< 15
4494 case ICmpInst::ICMP_SLT: // (X == 13 | X s< 15) -> X s< 15
4495 return ReplaceInstUsesWith(I, RHS);
4498 case ICmpInst::ICMP_NE:
4500 default: assert(0 && "Unknown integer condition code!");
4501 case ICmpInst::ICMP_EQ: // (X != 13 | X == 15) -> X != 13
4502 case ICmpInst::ICMP_UGT: // (X != 13 | X u> 15) -> X != 13
4503 case ICmpInst::ICMP_SGT: // (X != 13 | X s> 15) -> X != 13
4504 return ReplaceInstUsesWith(I, LHS);
4505 case ICmpInst::ICMP_NE: // (X != 13 | X != 15) -> true
4506 case ICmpInst::ICMP_ULT: // (X != 13 | X u< 15) -> true
4507 case ICmpInst::ICMP_SLT: // (X != 13 | X s< 15) -> true
4508 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4511 case ICmpInst::ICMP_ULT:
4513 default: assert(0 && "Unknown integer condition code!");
4514 case ICmpInst::ICMP_EQ: // (X u< 13 | X == 14) -> no change
4516 case ICmpInst::ICMP_UGT: // (X u< 13 | X u> 15) ->(X-13) u> 2
4517 // If RHSCst is [us]MAXINT, it is always false. Not handling
4518 // this can cause overflow.
4519 if (RHSCst->isMaxValue(false))
4520 return ReplaceInstUsesWith(I, LHS);
4521 return InsertRangeTest(LHSVal, LHSCst, AddOne(RHSCst), false,
4523 case ICmpInst::ICMP_SGT: // (X u< 13 | X s> 15) -> no change
4525 case ICmpInst::ICMP_NE: // (X u< 13 | X != 15) -> X != 15
4526 case ICmpInst::ICMP_ULT: // (X u< 13 | X u< 15) -> X u< 15
4527 return ReplaceInstUsesWith(I, RHS);
4528 case ICmpInst::ICMP_SLT: // (X u< 13 | X s< 15) -> no change
4532 case ICmpInst::ICMP_SLT:
4534 default: assert(0 && "Unknown integer condition code!");
4535 case ICmpInst::ICMP_EQ: // (X s< 13 | X == 14) -> no change
4537 case ICmpInst::ICMP_SGT: // (X s< 13 | X s> 15) ->(X-13) s> 2
4538 // If RHSCst is [us]MAXINT, it is always false. Not handling
4539 // this can cause overflow.
4540 if (RHSCst->isMaxValue(true))
4541 return ReplaceInstUsesWith(I, LHS);
4542 return InsertRangeTest(LHSVal, LHSCst, AddOne(RHSCst), true,
4544 case ICmpInst::ICMP_UGT: // (X s< 13 | X u> 15) -> no change
4546 case ICmpInst::ICMP_NE: // (X s< 13 | X != 15) -> X != 15
4547 case ICmpInst::ICMP_SLT: // (X s< 13 | X s< 15) -> X s< 15
4548 return ReplaceInstUsesWith(I, RHS);
4549 case ICmpInst::ICMP_ULT: // (X s< 13 | X u< 15) -> no change
4553 case ICmpInst::ICMP_UGT:
4555 default: assert(0 && "Unknown integer condition code!");
4556 case ICmpInst::ICMP_EQ: // (X u> 13 | X == 15) -> X u> 13
4557 case ICmpInst::ICMP_UGT: // (X u> 13 | X u> 15) -> X u> 13
4558 return ReplaceInstUsesWith(I, LHS);
4559 case ICmpInst::ICMP_SGT: // (X u> 13 | X s> 15) -> no change
4561 case ICmpInst::ICMP_NE: // (X u> 13 | X != 15) -> true
4562 case ICmpInst::ICMP_ULT: // (X u> 13 | X u< 15) -> true
4563 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4564 case ICmpInst::ICMP_SLT: // (X u> 13 | X s< 15) -> no change
4568 case ICmpInst::ICMP_SGT:
4570 default: assert(0 && "Unknown integer condition code!");
4571 case ICmpInst::ICMP_EQ: // (X s> 13 | X == 15) -> X > 13
4572 case ICmpInst::ICMP_SGT: // (X s> 13 | X s> 15) -> X > 13
4573 return ReplaceInstUsesWith(I, LHS);
4574 case ICmpInst::ICMP_UGT: // (X s> 13 | X u> 15) -> no change
4576 case ICmpInst::ICMP_NE: // (X s> 13 | X != 15) -> true
4577 case ICmpInst::ICMP_SLT: // (X s> 13 | X s< 15) -> true
4578 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4579 case ICmpInst::ICMP_ULT: // (X s> 13 | X u< 15) -> no change
4587 // fold (or (cast A), (cast B)) -> (cast (or A, B))
4588 if (CastInst *Op0C = dyn_cast<CastInst>(Op0)) {
4589 if (CastInst *Op1C = dyn_cast<CastInst>(Op1))
4590 if (Op0C->getOpcode() == Op1C->getOpcode()) {// same cast kind ?
4591 if (!isa<ICmpInst>(Op0C->getOperand(0)) ||
4592 !isa<ICmpInst>(Op1C->getOperand(0))) {
4593 const Type *SrcTy = Op0C->getOperand(0)->getType();
4594 if (SrcTy == Op1C->getOperand(0)->getType() && SrcTy->isInteger() &&
4595 // Only do this if the casts both really cause code to be
4597 ValueRequiresCast(Op0C->getOpcode(), Op0C->getOperand(0),
4599 ValueRequiresCast(Op1C->getOpcode(), Op1C->getOperand(0),
4601 Instruction *NewOp = BinaryOperator::CreateOr(Op0C->getOperand(0),
4602 Op1C->getOperand(0),
4604 InsertNewInstBefore(NewOp, I);
4605 return CastInst::Create(Op0C->getOpcode(), NewOp, I.getType());
4612 // (fcmp uno x, c) | (fcmp uno y, c) -> (fcmp uno x, y)
4613 if (FCmpInst *LHS = dyn_cast<FCmpInst>(I.getOperand(0))) {
4614 if (FCmpInst *RHS = dyn_cast<FCmpInst>(I.getOperand(1))) {
4615 if (LHS->getPredicate() == FCmpInst::FCMP_UNO &&
4616 RHS->getPredicate() == FCmpInst::FCMP_UNO &&
4617 LHS->getOperand(0)->getType() == RHS->getOperand(0)->getType()) {
4618 if (ConstantFP *LHSC = dyn_cast<ConstantFP>(LHS->getOperand(1)))
4619 if (ConstantFP *RHSC = dyn_cast<ConstantFP>(RHS->getOperand(1))) {
4620 // If either of the constants are nans, then the whole thing returns
4622 if (LHSC->getValueAPF().isNaN() || RHSC->getValueAPF().isNaN())
4623 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4625 // Otherwise, no need to compare the two constants, compare the
4627 return new FCmpInst(FCmpInst::FCMP_UNO, LHS->getOperand(0),
4628 RHS->getOperand(0));
4631 Value *Op0LHS, *Op0RHS, *Op1LHS, *Op1RHS;
4632 FCmpInst::Predicate Op0CC, Op1CC;
4633 if (match(Op0, m_FCmp(Op0CC, m_Value(Op0LHS), m_Value(Op0RHS))) &&
4634 match(Op1, m_FCmp(Op1CC, m_Value(Op1LHS), m_Value(Op1RHS)))) {
4635 if (Op0LHS == Op1RHS && Op0RHS == Op1LHS) {
4636 // Swap RHS operands to match LHS.
4637 Op1CC = FCmpInst::getSwappedPredicate(Op1CC);
4638 std::swap(Op1LHS, Op1RHS);
4640 if (Op0LHS == Op1LHS && Op0RHS == Op1RHS) {
4641 // Simplify (fcmp cc0 x, y) | (fcmp cc1 x, y).
4643 return new FCmpInst((FCmpInst::Predicate)Op0CC, Op0LHS, Op0RHS);
4644 else if (Op0CC == FCmpInst::FCMP_TRUE ||
4645 Op1CC == FCmpInst::FCMP_TRUE)
4646 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
4647 else if (Op0CC == FCmpInst::FCMP_FALSE)
4648 return ReplaceInstUsesWith(I, Op1);
4649 else if (Op1CC == FCmpInst::FCMP_FALSE)
4650 return ReplaceInstUsesWith(I, Op0);
4653 unsigned Op0Pred = getFCmpCode(Op0CC, Op0Ordered);
4654 unsigned Op1Pred = getFCmpCode(Op1CC, Op1Ordered);
4655 if (Op0Ordered == Op1Ordered) {
4656 // If both are ordered or unordered, return a new fcmp with
4657 // or'ed predicates.
4658 Value *RV = getFCmpValue(Op0Ordered, Op0Pred|Op1Pred,
4660 if (Instruction *I = dyn_cast<Instruction>(RV))
4662 // Otherwise, it's a constant boolean value...
4663 return ReplaceInstUsesWith(I, RV);
4671 return Changed ? &I : 0;
4676 // XorSelf - Implements: X ^ X --> 0
4679 XorSelf(Value *rhs) : RHS(rhs) {}
4680 bool shouldApply(Value *LHS) const { return LHS == RHS; }
4681 Instruction *apply(BinaryOperator &Xor) const {
4688 Instruction *InstCombiner::visitXor(BinaryOperator &I) {
4689 bool Changed = SimplifyCommutative(I);
4690 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
4692 if (isa<UndefValue>(Op1)) {
4693 if (isa<UndefValue>(Op0))
4694 // Handle undef ^ undef -> 0 special case. This is a common
4696 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
4697 return ReplaceInstUsesWith(I, Op1); // X ^ undef -> undef
4700 // xor X, X = 0, even if X is nested in a sequence of Xor's.
4701 if (Instruction *Result = AssociativeOpt(I, XorSelf(Op1))) {
4702 assert(Result == &I && "AssociativeOpt didn't work?"); Result=Result;
4703 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
4706 // See if we can simplify any instructions used by the instruction whose sole
4707 // purpose is to compute bits we don't care about.
4708 if (!isa<VectorType>(I.getType())) {
4709 uint32_t BitWidth = cast<IntegerType>(I.getType())->getBitWidth();
4710 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
4711 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(BitWidth),
4712 KnownZero, KnownOne))
4714 } else if (isa<ConstantAggregateZero>(Op1)) {
4715 return ReplaceInstUsesWith(I, Op0); // X ^ <0,0> -> X
4718 // Is this a ~ operation?
4719 if (Value *NotOp = dyn_castNotVal(&I)) {
4720 // ~(~X & Y) --> (X | ~Y) - De Morgan's Law
4721 // ~(~X | Y) === (X & ~Y) - De Morgan's Law
4722 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(NotOp)) {
4723 if (Op0I->getOpcode() == Instruction::And ||
4724 Op0I->getOpcode() == Instruction::Or) {
4725 if (dyn_castNotVal(Op0I->getOperand(1))) Op0I->swapOperands();
4726 if (Value *Op0NotVal = dyn_castNotVal(Op0I->getOperand(0))) {
4728 BinaryOperator::CreateNot(Op0I->getOperand(1),
4729 Op0I->getOperand(1)->getName()+".not");
4730 InsertNewInstBefore(NotY, I);
4731 if (Op0I->getOpcode() == Instruction::And)
4732 return BinaryOperator::CreateOr(Op0NotVal, NotY);
4734 return BinaryOperator::CreateAnd(Op0NotVal, NotY);
4741 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
4742 // xor (cmp A, B), true = not (cmp A, B) = !cmp A, B
4743 if (RHS == ConstantInt::getTrue() && Op0->hasOneUse()) {
4744 if (ICmpInst *ICI = dyn_cast<ICmpInst>(Op0))
4745 return new ICmpInst(ICI->getInversePredicate(),
4746 ICI->getOperand(0), ICI->getOperand(1));
4748 if (FCmpInst *FCI = dyn_cast<FCmpInst>(Op0))
4749 return new FCmpInst(FCI->getInversePredicate(),
4750 FCI->getOperand(0), FCI->getOperand(1));
4753 // fold (xor(zext(cmp)), 1) and (xor(sext(cmp)), -1) to ext(!cmp).
4754 if (CastInst *Op0C = dyn_cast<CastInst>(Op0)) {
4755 if (CmpInst *CI = dyn_cast<CmpInst>(Op0C->getOperand(0))) {
4756 if (CI->hasOneUse() && Op0C->hasOneUse()) {
4757 Instruction::CastOps Opcode = Op0C->getOpcode();
4758 if (Opcode == Instruction::ZExt || Opcode == Instruction::SExt) {
4759 if (RHS == ConstantExpr::getCast(Opcode, ConstantInt::getTrue(),
4760 Op0C->getDestTy())) {
4761 Instruction *NewCI = InsertNewInstBefore(CmpInst::Create(
4762 CI->getOpcode(), CI->getInversePredicate(),
4763 CI->getOperand(0), CI->getOperand(1)), I);
4764 NewCI->takeName(CI);
4765 return CastInst::Create(Opcode, NewCI, Op0C->getType());
4772 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0)) {
4773 // ~(c-X) == X-c-1 == X+(-c-1)
4774 if (Op0I->getOpcode() == Instruction::Sub && RHS->isAllOnesValue())
4775 if (Constant *Op0I0C = dyn_cast<Constant>(Op0I->getOperand(0))) {
4776 Constant *NegOp0I0C = ConstantExpr::getNeg(Op0I0C);
4777 Constant *ConstantRHS = ConstantExpr::getSub(NegOp0I0C,
4778 ConstantInt::get(I.getType(), 1));
4779 return BinaryOperator::CreateAdd(Op0I->getOperand(1), ConstantRHS);
4782 if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1))) {
4783 if (Op0I->getOpcode() == Instruction::Add) {
4784 // ~(X-c) --> (-c-1)-X
4785 if (RHS->isAllOnesValue()) {
4786 Constant *NegOp0CI = ConstantExpr::getNeg(Op0CI);
4787 return BinaryOperator::CreateSub(
4788 ConstantExpr::getSub(NegOp0CI,
4789 ConstantInt::get(I.getType(), 1)),
4790 Op0I->getOperand(0));
4791 } else if (RHS->getValue().isSignBit()) {
4792 // (X + C) ^ signbit -> (X + C + signbit)
4793 Constant *C = ConstantInt::get(RHS->getValue() + Op0CI->getValue());
4794 return BinaryOperator::CreateAdd(Op0I->getOperand(0), C);
4797 } else if (Op0I->getOpcode() == Instruction::Or) {
4798 // (X|C1)^C2 -> X^(C1|C2) iff X&~C1 == 0
4799 if (MaskedValueIsZero(Op0I->getOperand(0), Op0CI->getValue())) {
4800 Constant *NewRHS = ConstantExpr::getOr(Op0CI, RHS);
4801 // Anything in both C1 and C2 is known to be zero, remove it from
4803 Constant *CommonBits = And(Op0CI, RHS);
4804 NewRHS = ConstantExpr::getAnd(NewRHS,
4805 ConstantExpr::getNot(CommonBits));
4806 AddToWorkList(Op0I);
4807 I.setOperand(0, Op0I->getOperand(0));
4808 I.setOperand(1, NewRHS);
4815 // Try to fold constant and into select arguments.
4816 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
4817 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
4819 if (isa<PHINode>(Op0))
4820 if (Instruction *NV = FoldOpIntoPhi(I))
4824 if (Value *X = dyn_castNotVal(Op0)) // ~A ^ A == -1
4826 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
4828 if (Value *X = dyn_castNotVal(Op1)) // A ^ ~A == -1
4830 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
4833 BinaryOperator *Op1I = dyn_cast<BinaryOperator>(Op1);
4836 if (match(Op1I, m_Or(m_Value(A), m_Value(B)))) {
4837 if (A == Op0) { // B^(B|A) == (A|B)^B
4838 Op1I->swapOperands();
4840 std::swap(Op0, Op1);
4841 } else if (B == Op0) { // B^(A|B) == (A|B)^B
4842 I.swapOperands(); // Simplified below.
4843 std::swap(Op0, Op1);
4845 } else if (match(Op1I, m_Xor(m_Value(A), m_Value(B)))) {
4846 if (Op0 == A) // A^(A^B) == B
4847 return ReplaceInstUsesWith(I, B);
4848 else if (Op0 == B) // A^(B^A) == B
4849 return ReplaceInstUsesWith(I, A);
4850 } else if (match(Op1I, m_And(m_Value(A), m_Value(B))) && Op1I->hasOneUse()){
4851 if (A == Op0) { // A^(A&B) -> A^(B&A)
4852 Op1I->swapOperands();
4855 if (B == Op0) { // A^(B&A) -> (B&A)^A
4856 I.swapOperands(); // Simplified below.
4857 std::swap(Op0, Op1);
4862 BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0);
4865 if (match(Op0I, m_Or(m_Value(A), m_Value(B))) && Op0I->hasOneUse()) {
4866 if (A == Op1) // (B|A)^B == (A|B)^B
4868 if (B == Op1) { // (A|B)^B == A & ~B
4870 InsertNewInstBefore(BinaryOperator::CreateNot(Op1, "tmp"), I);
4871 return BinaryOperator::CreateAnd(A, NotB);
4873 } else if (match(Op0I, m_Xor(m_Value(A), m_Value(B)))) {
4874 if (Op1 == A) // (A^B)^A == B
4875 return ReplaceInstUsesWith(I, B);
4876 else if (Op1 == B) // (B^A)^A == B
4877 return ReplaceInstUsesWith(I, A);
4878 } else if (match(Op0I, m_And(m_Value(A), m_Value(B))) && Op0I->hasOneUse()){
4879 if (A == Op1) // (A&B)^A -> (B&A)^A
4881 if (B == Op1 && // (B&A)^A == ~B & A
4882 !isa<ConstantInt>(Op1)) { // Canonical form is (B&C)^C
4884 InsertNewInstBefore(BinaryOperator::CreateNot(A, "tmp"), I);
4885 return BinaryOperator::CreateAnd(N, Op1);
4890 // (X >> Z) ^ (Y >> Z) -> (X^Y) >> Z for all shifts.
4891 if (Op0I && Op1I && Op0I->isShift() &&
4892 Op0I->getOpcode() == Op1I->getOpcode() &&
4893 Op0I->getOperand(1) == Op1I->getOperand(1) &&
4894 (Op1I->hasOneUse() || Op1I->hasOneUse())) {
4895 Instruction *NewOp =
4896 InsertNewInstBefore(BinaryOperator::CreateXor(Op0I->getOperand(0),
4897 Op1I->getOperand(0),
4898 Op0I->getName()), I);
4899 return BinaryOperator::Create(Op1I->getOpcode(), NewOp,
4900 Op1I->getOperand(1));
4904 Value *A, *B, *C, *D;
4905 // (A & B)^(A | B) -> A ^ B
4906 if (match(Op0I, m_And(m_Value(A), m_Value(B))) &&
4907 match(Op1I, m_Or(m_Value(C), m_Value(D)))) {
4908 if ((A == C && B == D) || (A == D && B == C))
4909 return BinaryOperator::CreateXor(A, B);
4911 // (A | B)^(A & B) -> A ^ B
4912 if (match(Op0I, m_Or(m_Value(A), m_Value(B))) &&
4913 match(Op1I, m_And(m_Value(C), m_Value(D)))) {
4914 if ((A == C && B == D) || (A == D && B == C))
4915 return BinaryOperator::CreateXor(A, B);
4919 if ((Op0I->hasOneUse() || Op1I->hasOneUse()) &&
4920 match(Op0I, m_And(m_Value(A), m_Value(B))) &&
4921 match(Op1I, m_And(m_Value(C), m_Value(D)))) {
4922 // (X & Y)^(X & Y) -> (Y^Z) & X
4923 Value *X = 0, *Y = 0, *Z = 0;
4925 X = A, Y = B, Z = D;
4927 X = A, Y = B, Z = C;
4929 X = B, Y = A, Z = D;
4931 X = B, Y = A, Z = C;
4934 Instruction *NewOp =
4935 InsertNewInstBefore(BinaryOperator::CreateXor(Y, Z, Op0->getName()), I);
4936 return BinaryOperator::CreateAnd(NewOp, X);
4941 // (icmp1 A, B) ^ (icmp2 A, B) --> (icmp3 A, B)
4942 if (ICmpInst *RHS = dyn_cast<ICmpInst>(I.getOperand(1)))
4943 if (Instruction *R = AssociativeOpt(I, FoldICmpLogical(*this, RHS)))
4946 // fold (xor (cast A), (cast B)) -> (cast (xor A, B))
4947 if (CastInst *Op0C = dyn_cast<CastInst>(Op0)) {
4948 if (CastInst *Op1C = dyn_cast<CastInst>(Op1))
4949 if (Op0C->getOpcode() == Op1C->getOpcode()) { // same cast kind?
4950 const Type *SrcTy = Op0C->getOperand(0)->getType();
4951 if (SrcTy == Op1C->getOperand(0)->getType() && SrcTy->isInteger() &&
4952 // Only do this if the casts both really cause code to be generated.
4953 ValueRequiresCast(Op0C->getOpcode(), Op0C->getOperand(0),
4955 ValueRequiresCast(Op1C->getOpcode(), Op1C->getOperand(0),
4957 Instruction *NewOp = BinaryOperator::CreateXor(Op0C->getOperand(0),
4958 Op1C->getOperand(0),
4960 InsertNewInstBefore(NewOp, I);
4961 return CastInst::Create(Op0C->getOpcode(), NewOp, I.getType());
4966 return Changed ? &I : 0;
4969 /// AddWithOverflow - Compute Result = In1+In2, returning true if the result
4970 /// overflowed for this type.
4971 static bool AddWithOverflow(ConstantInt *&Result, ConstantInt *In1,
4972 ConstantInt *In2, bool IsSigned = false) {
4973 Result = cast<ConstantInt>(Add(In1, In2));
4976 if (In2->getValue().isNegative())
4977 return Result->getValue().sgt(In1->getValue());
4979 return Result->getValue().slt(In1->getValue());
4981 return Result->getValue().ult(In1->getValue());
4984 /// SubWithOverflow - Compute Result = In1-In2, returning true if the result
4985 /// overflowed for this type.
4986 static bool SubWithOverflow(ConstantInt *&Result, ConstantInt *In1,
4987 ConstantInt *In2, bool IsSigned = false) {
4988 Result = cast<ConstantInt>(Subtract(In1, In2));
4991 if (In2->getValue().isNegative())
4992 return Result->getValue().slt(In1->getValue());
4994 return Result->getValue().sgt(In1->getValue());
4996 return Result->getValue().ugt(In1->getValue());
4999 /// EmitGEPOffset - Given a getelementptr instruction/constantexpr, emit the
5000 /// code necessary to compute the offset from the base pointer (without adding
5001 /// in the base pointer). Return the result as a signed integer of intptr size.
5002 static Value *EmitGEPOffset(User *GEP, Instruction &I, InstCombiner &IC) {
5003 TargetData &TD = IC.getTargetData();
5004 gep_type_iterator GTI = gep_type_begin(GEP);
5005 const Type *IntPtrTy = TD.getIntPtrType();
5006 Value *Result = Constant::getNullValue(IntPtrTy);
5008 // Build a mask for high order bits.
5009 unsigned IntPtrWidth = TD.getPointerSizeInBits();
5010 uint64_t PtrSizeMask = ~0ULL >> (64-IntPtrWidth);
5012 for (User::op_iterator i = GEP->op_begin() + 1, e = GEP->op_end(); i != e;
5015 uint64_t Size = TD.getABITypeSize(GTI.getIndexedType()) & PtrSizeMask;
5016 if (ConstantInt *OpC = dyn_cast<ConstantInt>(Op)) {
5017 if (OpC->isZero()) continue;
5019 // Handle a struct index, which adds its field offset to the pointer.
5020 if (const StructType *STy = dyn_cast<StructType>(*GTI)) {
5021 Size = TD.getStructLayout(STy)->getElementOffset(OpC->getZExtValue());
5023 if (ConstantInt *RC = dyn_cast<ConstantInt>(Result))
5024 Result = ConstantInt::get(RC->getValue() + APInt(IntPtrWidth, Size));
5026 Result = IC.InsertNewInstBefore(
5027 BinaryOperator::CreateAdd(Result,
5028 ConstantInt::get(IntPtrTy, Size),
5029 GEP->getName()+".offs"), I);
5033 Constant *Scale = ConstantInt::get(IntPtrTy, Size);
5034 Constant *OC = ConstantExpr::getIntegerCast(OpC, IntPtrTy, true /*SExt*/);
5035 Scale = ConstantExpr::getMul(OC, Scale);
5036 if (Constant *RC = dyn_cast<Constant>(Result))
5037 Result = ConstantExpr::getAdd(RC, Scale);
5039 // Emit an add instruction.
5040 Result = IC.InsertNewInstBefore(
5041 BinaryOperator::CreateAdd(Result, Scale,
5042 GEP->getName()+".offs"), I);
5046 // Convert to correct type.
5047 if (Op->getType() != IntPtrTy) {
5048 if (Constant *OpC = dyn_cast<Constant>(Op))
5049 Op = ConstantExpr::getSExt(OpC, IntPtrTy);
5051 Op = IC.InsertNewInstBefore(new SExtInst(Op, IntPtrTy,
5052 Op->getName()+".c"), I);
5055 Constant *Scale = ConstantInt::get(IntPtrTy, Size);
5056 if (Constant *OpC = dyn_cast<Constant>(Op))
5057 Op = ConstantExpr::getMul(OpC, Scale);
5058 else // We'll let instcombine(mul) convert this to a shl if possible.
5059 Op = IC.InsertNewInstBefore(BinaryOperator::CreateMul(Op, Scale,
5060 GEP->getName()+".idx"), I);
5063 // Emit an add instruction.
5064 if (isa<Constant>(Op) && isa<Constant>(Result))
5065 Result = ConstantExpr::getAdd(cast<Constant>(Op),
5066 cast<Constant>(Result));
5068 Result = IC.InsertNewInstBefore(BinaryOperator::CreateAdd(Op, Result,
5069 GEP->getName()+".offs"), I);
5075 /// EvaluateGEPOffsetExpression - Return an value that can be used to compare of
5076 /// the *offset* implied by GEP to zero. For example, if we have &A[i], we want
5077 /// to return 'i' for "icmp ne i, 0". Note that, in general, indices can be
5078 /// complex, and scales are involved. The above expression would also be legal
5079 /// to codegen as "icmp ne (i*4), 0" (assuming A is a pointer to i32). This
5080 /// later form is less amenable to optimization though, and we are allowed to
5081 /// generate the first by knowing that pointer arithmetic doesn't overflow.
5083 /// If we can't emit an optimized form for this expression, this returns null.
5085 static Value *EvaluateGEPOffsetExpression(User *GEP, Instruction &I,
5087 TargetData &TD = IC.getTargetData();
5088 gep_type_iterator GTI = gep_type_begin(GEP);
5090 // Check to see if this gep only has a single variable index. If so, and if
5091 // any constant indices are a multiple of its scale, then we can compute this
5092 // in terms of the scale of the variable index. For example, if the GEP
5093 // implies an offset of "12 + i*4", then we can codegen this as "3 + i",
5094 // because the expression will cross zero at the same point.
5095 unsigned i, e = GEP->getNumOperands();
5097 for (i = 1; i != e; ++i, ++GTI) {
5098 if (ConstantInt *CI = dyn_cast<ConstantInt>(GEP->getOperand(i))) {
5099 // Compute the aggregate offset of constant indices.
5100 if (CI->isZero()) continue;
5102 // Handle a struct index, which adds its field offset to the pointer.
5103 if (const StructType *STy = dyn_cast<StructType>(*GTI)) {
5104 Offset += TD.getStructLayout(STy)->getElementOffset(CI->getZExtValue());
5106 uint64_t Size = TD.getABITypeSize(GTI.getIndexedType());
5107 Offset += Size*CI->getSExtValue();
5110 // Found our variable index.
5115 // If there are no variable indices, we must have a constant offset, just
5116 // evaluate it the general way.
5117 if (i == e) return 0;
5119 Value *VariableIdx = GEP->getOperand(i);
5120 // Determine the scale factor of the variable element. For example, this is
5121 // 4 if the variable index is into an array of i32.
5122 uint64_t VariableScale = TD.getABITypeSize(GTI.getIndexedType());
5124 // Verify that there are no other variable indices. If so, emit the hard way.
5125 for (++i, ++GTI; i != e; ++i, ++GTI) {
5126 ConstantInt *CI = dyn_cast<ConstantInt>(GEP->getOperand(i));
5129 // Compute the aggregate offset of constant indices.
5130 if (CI->isZero()) continue;
5132 // Handle a struct index, which adds its field offset to the pointer.
5133 if (const StructType *STy = dyn_cast<StructType>(*GTI)) {
5134 Offset += TD.getStructLayout(STy)->getElementOffset(CI->getZExtValue());
5136 uint64_t Size = TD.getABITypeSize(GTI.getIndexedType());
5137 Offset += Size*CI->getSExtValue();
5141 // Okay, we know we have a single variable index, which must be a
5142 // pointer/array/vector index. If there is no offset, life is simple, return
5144 unsigned IntPtrWidth = TD.getPointerSizeInBits();
5146 // Cast to intptrty in case a truncation occurs. If an extension is needed,
5147 // we don't need to bother extending: the extension won't affect where the
5148 // computation crosses zero.
5149 if (VariableIdx->getType()->getPrimitiveSizeInBits() > IntPtrWidth)
5150 VariableIdx = new TruncInst(VariableIdx, TD.getIntPtrType(),
5151 VariableIdx->getNameStart(), &I);
5155 // Otherwise, there is an index. The computation we will do will be modulo
5156 // the pointer size, so get it.
5157 uint64_t PtrSizeMask = ~0ULL >> (64-IntPtrWidth);
5159 Offset &= PtrSizeMask;
5160 VariableScale &= PtrSizeMask;
5162 // To do this transformation, any constant index must be a multiple of the
5163 // variable scale factor. For example, we can evaluate "12 + 4*i" as "3 + i",
5164 // but we can't evaluate "10 + 3*i" in terms of i. Check that the offset is a
5165 // multiple of the variable scale.
5166 int64_t NewOffs = Offset / (int64_t)VariableScale;
5167 if (Offset != NewOffs*(int64_t)VariableScale)
5170 // Okay, we can do this evaluation. Start by converting the index to intptr.
5171 const Type *IntPtrTy = TD.getIntPtrType();
5172 if (VariableIdx->getType() != IntPtrTy)
5173 VariableIdx = CastInst::CreateIntegerCast(VariableIdx, IntPtrTy,
5175 VariableIdx->getNameStart(), &I);
5176 Constant *OffsetVal = ConstantInt::get(IntPtrTy, NewOffs);
5177 return BinaryOperator::CreateAdd(VariableIdx, OffsetVal, "offset", &I);
5181 /// FoldGEPICmp - Fold comparisons between a GEP instruction and something
5182 /// else. At this point we know that the GEP is on the LHS of the comparison.
5183 Instruction *InstCombiner::FoldGEPICmp(User *GEPLHS, Value *RHS,
5184 ICmpInst::Predicate Cond,
5186 assert(dyn_castGetElementPtr(GEPLHS) && "LHS is not a getelementptr!");
5188 // Look through bitcasts.
5189 if (BitCastInst *BCI = dyn_cast<BitCastInst>(RHS))
5190 RHS = BCI->getOperand(0);
5192 Value *PtrBase = GEPLHS->getOperand(0);
5193 if (PtrBase == RHS) {
5194 // ((gep Ptr, OFFSET) cmp Ptr) ---> (OFFSET cmp 0).
5195 // This transformation (ignoring the base and scales) is valid because we
5196 // know pointers can't overflow. See if we can output an optimized form.
5197 Value *Offset = EvaluateGEPOffsetExpression(GEPLHS, I, *this);
5199 // If not, synthesize the offset the hard way.
5201 Offset = EmitGEPOffset(GEPLHS, I, *this);
5202 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), Offset,
5203 Constant::getNullValue(Offset->getType()));
5204 } else if (User *GEPRHS = dyn_castGetElementPtr(RHS)) {
5205 // If the base pointers are different, but the indices are the same, just
5206 // compare the base pointer.
5207 if (PtrBase != GEPRHS->getOperand(0)) {
5208 bool IndicesTheSame = GEPLHS->getNumOperands()==GEPRHS->getNumOperands();
5209 IndicesTheSame &= GEPLHS->getOperand(0)->getType() ==
5210 GEPRHS->getOperand(0)->getType();
5212 for (unsigned i = 1, e = GEPLHS->getNumOperands(); i != e; ++i)
5213 if (GEPLHS->getOperand(i) != GEPRHS->getOperand(i)) {
5214 IndicesTheSame = false;
5218 // If all indices are the same, just compare the base pointers.
5220 return new ICmpInst(ICmpInst::getSignedPredicate(Cond),
5221 GEPLHS->getOperand(0), GEPRHS->getOperand(0));
5223 // Otherwise, the base pointers are different and the indices are
5224 // different, bail out.
5228 // If one of the GEPs has all zero indices, recurse.
5229 bool AllZeros = true;
5230 for (unsigned i = 1, e = GEPLHS->getNumOperands(); i != e; ++i)
5231 if (!isa<Constant>(GEPLHS->getOperand(i)) ||
5232 !cast<Constant>(GEPLHS->getOperand(i))->isNullValue()) {
5237 return FoldGEPICmp(GEPRHS, GEPLHS->getOperand(0),
5238 ICmpInst::getSwappedPredicate(Cond), I);
5240 // If the other GEP has all zero indices, recurse.
5242 for (unsigned i = 1, e = GEPRHS->getNumOperands(); i != e; ++i)
5243 if (!isa<Constant>(GEPRHS->getOperand(i)) ||
5244 !cast<Constant>(GEPRHS->getOperand(i))->isNullValue()) {
5249 return FoldGEPICmp(GEPLHS, GEPRHS->getOperand(0), Cond, I);
5251 if (GEPLHS->getNumOperands() == GEPRHS->getNumOperands()) {
5252 // If the GEPs only differ by one index, compare it.
5253 unsigned NumDifferences = 0; // Keep track of # differences.
5254 unsigned DiffOperand = 0; // The operand that differs.
5255 for (unsigned i = 1, e = GEPRHS->getNumOperands(); i != e; ++i)
5256 if (GEPLHS->getOperand(i) != GEPRHS->getOperand(i)) {
5257 if (GEPLHS->getOperand(i)->getType()->getPrimitiveSizeInBits() !=
5258 GEPRHS->getOperand(i)->getType()->getPrimitiveSizeInBits()) {
5259 // Irreconcilable differences.
5263 if (NumDifferences++) break;
5268 if (NumDifferences == 0) // SAME GEP?
5269 return ReplaceInstUsesWith(I, // No comparison is needed here.
5270 ConstantInt::get(Type::Int1Ty,
5271 ICmpInst::isTrueWhenEqual(Cond)));
5273 else if (NumDifferences == 1) {
5274 Value *LHSV = GEPLHS->getOperand(DiffOperand);
5275 Value *RHSV = GEPRHS->getOperand(DiffOperand);
5276 // Make sure we do a signed comparison here.
5277 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), LHSV, RHSV);
5281 // Only lower this if the icmp is the only user of the GEP or if we expect
5282 // the result to fold to a constant!
5283 if ((isa<ConstantExpr>(GEPLHS) || GEPLHS->hasOneUse()) &&
5284 (isa<ConstantExpr>(GEPRHS) || GEPRHS->hasOneUse())) {
5285 // ((gep Ptr, OFFSET1) cmp (gep Ptr, OFFSET2) ---> (OFFSET1 cmp OFFSET2)
5286 Value *L = EmitGEPOffset(GEPLHS, I, *this);
5287 Value *R = EmitGEPOffset(GEPRHS, I, *this);
5288 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), L, R);
5294 /// FoldFCmp_IntToFP_Cst - Fold fcmp ([us]itofp x, cst) if possible.
5296 Instruction *InstCombiner::FoldFCmp_IntToFP_Cst(FCmpInst &I,
5299 if (!isa<ConstantFP>(RHSC)) return 0;
5300 const APFloat &RHS = cast<ConstantFP>(RHSC)->getValueAPF();
5302 // Get the width of the mantissa. We don't want to hack on conversions that
5303 // might lose information from the integer, e.g. "i64 -> float"
5304 int MantissaWidth = LHSI->getType()->getFPMantissaWidth();
5305 if (MantissaWidth == -1) return 0; // Unknown.
5307 // Check to see that the input is converted from an integer type that is small
5308 // enough that preserves all bits. TODO: check here for "known" sign bits.
5309 // This would allow us to handle (fptosi (x >>s 62) to float) if x is i64 f.e.
5310 unsigned InputSize = LHSI->getOperand(0)->getType()->getPrimitiveSizeInBits();
5312 // If this is a uitofp instruction, we need an extra bit to hold the sign.
5313 bool LHSUnsigned = isa<UIToFPInst>(LHSI);
5317 // If the conversion would lose info, don't hack on this.
5318 if ((int)InputSize > MantissaWidth)
5321 // Otherwise, we can potentially simplify the comparison. We know that it
5322 // will always come through as an integer value and we know the constant is
5323 // not a NAN (it would have been previously simplified).
5324 assert(!RHS.isNaN() && "NaN comparison not already folded!");
5326 ICmpInst::Predicate Pred;
5327 switch (I.getPredicate()) {
5328 default: assert(0 && "Unexpected predicate!");
5329 case FCmpInst::FCMP_UEQ:
5330 case FCmpInst::FCMP_OEQ:
5331 Pred = ICmpInst::ICMP_EQ;
5333 case FCmpInst::FCMP_UGT:
5334 case FCmpInst::FCMP_OGT:
5335 Pred = LHSUnsigned ? ICmpInst::ICMP_UGT : ICmpInst::ICMP_SGT;
5337 case FCmpInst::FCMP_UGE:
5338 case FCmpInst::FCMP_OGE:
5339 Pred = LHSUnsigned ? ICmpInst::ICMP_UGE : ICmpInst::ICMP_SGE;
5341 case FCmpInst::FCMP_ULT:
5342 case FCmpInst::FCMP_OLT:
5343 Pred = LHSUnsigned ? ICmpInst::ICMP_ULT : ICmpInst::ICMP_SLT;
5345 case FCmpInst::FCMP_ULE:
5346 case FCmpInst::FCMP_OLE:
5347 Pred = LHSUnsigned ? ICmpInst::ICMP_ULE : ICmpInst::ICMP_SLE;
5349 case FCmpInst::FCMP_UNE:
5350 case FCmpInst::FCMP_ONE:
5351 Pred = ICmpInst::ICMP_NE;
5353 case FCmpInst::FCMP_ORD:
5354 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 1));
5355 case FCmpInst::FCMP_UNO:
5356 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 0));
5359 const IntegerType *IntTy = cast<IntegerType>(LHSI->getOperand(0)->getType());
5361 // Now we know that the APFloat is a normal number, zero or inf.
5363 // See if the FP constant is too large for the integer. For example,
5364 // comparing an i8 to 300.0.
5365 unsigned IntWidth = IntTy->getPrimitiveSizeInBits();
5368 // If the RHS value is > SignedMax, fold the comparison. This handles +INF
5369 // and large values.
5370 APFloat SMax(RHS.getSemantics(), APFloat::fcZero, false);
5371 SMax.convertFromAPInt(APInt::getSignedMaxValue(IntWidth), true,
5372 APFloat::rmNearestTiesToEven);
5373 if (SMax.compare(RHS) == APFloat::cmpLessThan) { // smax < 13123.0
5374 if (Pred == ICmpInst::ICMP_NE || Pred == ICmpInst::ICMP_SLT ||
5375 Pred == ICmpInst::ICMP_SLE)
5376 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 1));
5377 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 0));
5380 // If the RHS value is > UnsignedMax, fold the comparison. This handles
5381 // +INF and large values.
5382 APFloat UMax(RHS.getSemantics(), APFloat::fcZero, false);
5383 UMax.convertFromAPInt(APInt::getMaxValue(IntWidth), false,
5384 APFloat::rmNearestTiesToEven);
5385 if (UMax.compare(RHS) == APFloat::cmpLessThan) { // umax < 13123.0
5386 if (Pred == ICmpInst::ICMP_NE || Pred == ICmpInst::ICMP_ULT ||
5387 Pred == ICmpInst::ICMP_ULE)
5388 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 1));
5389 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 0));
5394 // See if the RHS value is < SignedMin.
5395 APFloat SMin(RHS.getSemantics(), APFloat::fcZero, false);
5396 SMin.convertFromAPInt(APInt::getSignedMinValue(IntWidth), true,
5397 APFloat::rmNearestTiesToEven);
5398 if (SMin.compare(RHS) == APFloat::cmpGreaterThan) { // smin > 12312.0
5399 if (Pred == ICmpInst::ICMP_NE || Pred == ICmpInst::ICMP_SGT ||
5400 Pred == ICmpInst::ICMP_SGE)
5401 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 1));
5402 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 0));
5406 // Okay, now we know that the FP constant fits in the range [SMIN, SMAX] or
5407 // [0, UMAX], but it may still be fractional. See if it is fractional by
5408 // casting the FP value to the integer value and back, checking for equality.
5409 // Don't do this for zero, because -0.0 is not fractional.
5410 Constant *RHSInt = ConstantExpr::getFPToSI(RHSC, IntTy);
5411 if (!RHS.isZero() &&
5412 ConstantExpr::getSIToFP(RHSInt, RHSC->getType()) != RHSC) {
5413 // If we had a comparison against a fractional value, we have to adjust the
5414 // compare predicate and sometimes the value. RHSC is rounded towards zero
5417 default: assert(0 && "Unexpected integer comparison!");
5418 case ICmpInst::ICMP_NE: // (float)int != 4.4 --> true
5419 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 1));
5420 case ICmpInst::ICMP_EQ: // (float)int == 4.4 --> false
5421 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 0));
5422 case ICmpInst::ICMP_ULE:
5423 // (float)int <= 4.4 --> int <= 4
5424 // (float)int <= -4.4 --> false
5425 if (RHS.isNegative())
5426 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 0));
5428 case ICmpInst::ICMP_SLE:
5429 // (float)int <= 4.4 --> int <= 4
5430 // (float)int <= -4.4 --> int < -4
5431 if (RHS.isNegative())
5432 Pred = ICmpInst::ICMP_SLT;
5434 case ICmpInst::ICMP_ULT:
5435 // (float)int < -4.4 --> false
5436 // (float)int < 4.4 --> int <= 4
5437 if (RHS.isNegative())
5438 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 0));
5439 Pred = ICmpInst::ICMP_ULE;
5441 case ICmpInst::ICMP_SLT:
5442 // (float)int < -4.4 --> int < -4
5443 // (float)int < 4.4 --> int <= 4
5444 if (!RHS.isNegative())
5445 Pred = ICmpInst::ICMP_SLE;
5447 case ICmpInst::ICMP_UGT:
5448 // (float)int > 4.4 --> int > 4
5449 // (float)int > -4.4 --> true
5450 if (RHS.isNegative())
5451 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 1));
5453 case ICmpInst::ICMP_SGT:
5454 // (float)int > 4.4 --> int > 4
5455 // (float)int > -4.4 --> int >= -4
5456 if (RHS.isNegative())
5457 Pred = ICmpInst::ICMP_SGE;
5459 case ICmpInst::ICMP_UGE:
5460 // (float)int >= -4.4 --> true
5461 // (float)int >= 4.4 --> int > 4
5462 if (!RHS.isNegative())
5463 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 1));
5464 Pred = ICmpInst::ICMP_UGT;
5466 case ICmpInst::ICMP_SGE:
5467 // (float)int >= -4.4 --> int >= -4
5468 // (float)int >= 4.4 --> int > 4
5469 if (!RHS.isNegative())
5470 Pred = ICmpInst::ICMP_SGT;
5475 // Lower this FP comparison into an appropriate integer version of the
5477 return new ICmpInst(Pred, LHSI->getOperand(0), RHSInt);
5480 Instruction *InstCombiner::visitFCmpInst(FCmpInst &I) {
5481 bool Changed = SimplifyCompare(I);
5482 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
5484 // Fold trivial predicates.
5485 if (I.getPredicate() == FCmpInst::FCMP_FALSE)
5486 return ReplaceInstUsesWith(I, Constant::getNullValue(Type::Int1Ty));
5487 if (I.getPredicate() == FCmpInst::FCMP_TRUE)
5488 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 1));
5490 // Simplify 'fcmp pred X, X'
5492 switch (I.getPredicate()) {
5493 default: assert(0 && "Unknown predicate!");
5494 case FCmpInst::FCMP_UEQ: // True if unordered or equal
5495 case FCmpInst::FCMP_UGE: // True if unordered, greater than, or equal
5496 case FCmpInst::FCMP_ULE: // True if unordered, less than, or equal
5497 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 1));
5498 case FCmpInst::FCMP_OGT: // True if ordered and greater than
5499 case FCmpInst::FCMP_OLT: // True if ordered and less than
5500 case FCmpInst::FCMP_ONE: // True if ordered and operands are unequal
5501 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 0));
5503 case FCmpInst::FCMP_UNO: // True if unordered: isnan(X) | isnan(Y)
5504 case FCmpInst::FCMP_ULT: // True if unordered or less than
5505 case FCmpInst::FCMP_UGT: // True if unordered or greater than
5506 case FCmpInst::FCMP_UNE: // True if unordered or not equal
5507 // Canonicalize these to be 'fcmp uno %X, 0.0'.
5508 I.setPredicate(FCmpInst::FCMP_UNO);
5509 I.setOperand(1, Constant::getNullValue(Op0->getType()));
5512 case FCmpInst::FCMP_ORD: // True if ordered (no nans)
5513 case FCmpInst::FCMP_OEQ: // True if ordered and equal
5514 case FCmpInst::FCMP_OGE: // True if ordered and greater than or equal
5515 case FCmpInst::FCMP_OLE: // True if ordered and less than or equal
5516 // Canonicalize these to be 'fcmp ord %X, 0.0'.
5517 I.setPredicate(FCmpInst::FCMP_ORD);
5518 I.setOperand(1, Constant::getNullValue(Op0->getType()));
5523 if (isa<UndefValue>(Op1)) // fcmp pred X, undef -> undef
5524 return ReplaceInstUsesWith(I, UndefValue::get(Type::Int1Ty));
5526 // Handle fcmp with constant RHS
5527 if (Constant *RHSC = dyn_cast<Constant>(Op1)) {
5528 // If the constant is a nan, see if we can fold the comparison based on it.
5529 if (ConstantFP *CFP = dyn_cast<ConstantFP>(RHSC)) {
5530 if (CFP->getValueAPF().isNaN()) {
5531 if (FCmpInst::isOrdered(I.getPredicate())) // True if ordered and...
5532 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 0));
5533 assert(FCmpInst::isUnordered(I.getPredicate()) &&
5534 "Comparison must be either ordered or unordered!");
5535 // True if unordered.
5536 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty, 1));
5540 if (Instruction *LHSI = dyn_cast<Instruction>(Op0))
5541 switch (LHSI->getOpcode()) {
5542 case Instruction::PHI:
5543 // Only fold fcmp into the PHI if the phi and fcmp are in the same
5544 // block. If in the same block, we're encouraging jump threading. If
5545 // not, we are just pessimizing the code by making an i1 phi.
5546 if (LHSI->getParent() == I.getParent())
5547 if (Instruction *NV = FoldOpIntoPhi(I))
5550 case Instruction::SIToFP:
5551 case Instruction::UIToFP:
5552 if (Instruction *NV = FoldFCmp_IntToFP_Cst(I, LHSI, RHSC))
5555 case Instruction::Select:
5556 // If either operand of the select is a constant, we can fold the
5557 // comparison into the select arms, which will cause one to be
5558 // constant folded and the select turned into a bitwise or.
5559 Value *Op1 = 0, *Op2 = 0;
5560 if (LHSI->hasOneUse()) {
5561 if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(1))) {
5562 // Fold the known value into the constant operand.
5563 Op1 = ConstantExpr::getCompare(I.getPredicate(), C, RHSC);
5564 // Insert a new FCmp of the other select operand.
5565 Op2 = InsertNewInstBefore(new FCmpInst(I.getPredicate(),
5566 LHSI->getOperand(2), RHSC,
5568 } else if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(2))) {
5569 // Fold the known value into the constant operand.
5570 Op2 = ConstantExpr::getCompare(I.getPredicate(), C, RHSC);
5571 // Insert a new FCmp of the other select operand.
5572 Op1 = InsertNewInstBefore(new FCmpInst(I.getPredicate(),
5573 LHSI->getOperand(1), RHSC,
5579 return SelectInst::Create(LHSI->getOperand(0), Op1, Op2);
5584 return Changed ? &I : 0;
5587 Instruction *InstCombiner::visitICmpInst(ICmpInst &I) {
5588 bool Changed = SimplifyCompare(I);
5589 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
5590 const Type *Ty = Op0->getType();
5594 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty,
5595 I.isTrueWhenEqual()));
5597 if (isa<UndefValue>(Op1)) // X icmp undef -> undef
5598 return ReplaceInstUsesWith(I, UndefValue::get(Type::Int1Ty));
5600 // icmp <global/alloca*/null>, <global/alloca*/null> - Global/Stack value
5601 // addresses never equal each other! We already know that Op0 != Op1.
5602 if ((isa<GlobalValue>(Op0) || isa<AllocaInst>(Op0) ||
5603 isa<ConstantPointerNull>(Op0)) &&
5604 (isa<GlobalValue>(Op1) || isa<AllocaInst>(Op1) ||
5605 isa<ConstantPointerNull>(Op1)))
5606 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty,
5607 !I.isTrueWhenEqual()));
5609 // icmp's with boolean values can always be turned into bitwise operations
5610 if (Ty == Type::Int1Ty) {
5611 switch (I.getPredicate()) {
5612 default: assert(0 && "Invalid icmp instruction!");
5613 case ICmpInst::ICMP_EQ: { // icmp eq i1 A, B -> ~(A^B)
5614 Instruction *Xor = BinaryOperator::CreateXor(Op0, Op1, I.getName()+"tmp");
5615 InsertNewInstBefore(Xor, I);
5616 return BinaryOperator::CreateNot(Xor);
5618 case ICmpInst::ICMP_NE: // icmp eq i1 A, B -> A^B
5619 return BinaryOperator::CreateXor(Op0, Op1);
5621 case ICmpInst::ICMP_UGT:
5622 std::swap(Op0, Op1); // Change icmp ugt -> icmp ult
5624 case ICmpInst::ICMP_ULT:{ // icmp ult i1 A, B -> ~A & B
5625 Instruction *Not = BinaryOperator::CreateNot(Op0, I.getName()+"tmp");
5626 InsertNewInstBefore(Not, I);
5627 return BinaryOperator::CreateAnd(Not, Op1);
5629 case ICmpInst::ICMP_SGT:
5630 std::swap(Op0, Op1); // Change icmp sgt -> icmp slt
5632 case ICmpInst::ICMP_SLT: { // icmp slt i1 A, B -> A & ~B
5633 Instruction *Not = BinaryOperator::CreateNot(Op1, I.getName()+"tmp");
5634 InsertNewInstBefore(Not, I);
5635 return BinaryOperator::CreateAnd(Not, Op0);
5637 case ICmpInst::ICMP_UGE:
5638 std::swap(Op0, Op1); // Change icmp uge -> icmp ule
5640 case ICmpInst::ICMP_ULE: { // icmp ule i1 A, B -> ~A | B
5641 Instruction *Not = BinaryOperator::CreateNot(Op0, I.getName()+"tmp");
5642 InsertNewInstBefore(Not, I);
5643 return BinaryOperator::CreateOr(Not, Op1);
5645 case ICmpInst::ICMP_SGE:
5646 std::swap(Op0, Op1); // Change icmp sge -> icmp sle
5648 case ICmpInst::ICMP_SLE: { // icmp sle i1 A, B -> A | ~B
5649 Instruction *Not = BinaryOperator::CreateNot(Op1, I.getName()+"tmp");
5650 InsertNewInstBefore(Not, I);
5651 return BinaryOperator::CreateOr(Not, Op0);
5656 // See if we are doing a comparison with a constant.
5657 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
5660 // (icmp ne/eq (sub A B) 0) -> (icmp ne/eq A, B)
5661 if (I.isEquality() && CI->isNullValue() &&
5662 match(Op0, m_Sub(m_Value(A), m_Value(B)))) {
5663 // (icmp cond A B) if cond is equality
5664 return new ICmpInst(I.getPredicate(), A, B);
5667 // If we have an icmp le or icmp ge instruction, turn it into the
5668 // appropriate icmp lt or icmp gt instruction. This allows us to rely on
5669 // them being folded in the code below.
5670 switch (I.getPredicate()) {
5672 case ICmpInst::ICMP_ULE:
5673 if (CI->isMaxValue(false)) // A <=u MAX -> TRUE
5674 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5675 return new ICmpInst(ICmpInst::ICMP_ULT, Op0, AddOne(CI));
5676 case ICmpInst::ICMP_SLE:
5677 if (CI->isMaxValue(true)) // A <=s MAX -> TRUE
5678 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5679 return new ICmpInst(ICmpInst::ICMP_SLT, Op0, AddOne(CI));
5680 case ICmpInst::ICMP_UGE:
5681 if (CI->isMinValue(false)) // A >=u MIN -> TRUE
5682 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5683 return new ICmpInst( ICmpInst::ICMP_UGT, Op0, SubOne(CI));
5684 case ICmpInst::ICMP_SGE:
5685 if (CI->isMinValue(true)) // A >=s MIN -> TRUE
5686 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5687 return new ICmpInst(ICmpInst::ICMP_SGT, Op0, SubOne(CI));
5690 // See if we can fold the comparison based on range information we can get
5691 // by checking whether bits are known to be zero or one in the input.
5692 uint32_t BitWidth = cast<IntegerType>(Ty)->getBitWidth();
5693 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
5695 // If this comparison is a normal comparison, it demands all
5696 // bits, if it is a sign bit comparison, it only demands the sign bit.
5698 bool isSignBit = isSignBitCheck(I.getPredicate(), CI, UnusedBit);
5700 if (SimplifyDemandedBits(Op0,
5701 isSignBit ? APInt::getSignBit(BitWidth)
5702 : APInt::getAllOnesValue(BitWidth),
5703 KnownZero, KnownOne, 0))
5706 // Given the known and unknown bits, compute a range that the LHS could be
5707 // in. Compute the Min, Max and RHS values based on the known bits. For the
5708 // EQ and NE we use unsigned values.
5709 APInt Min(BitWidth, 0), Max(BitWidth, 0);
5710 if (ICmpInst::isSignedPredicate(I.getPredicate()))
5711 ComputeSignedMinMaxValuesFromKnownBits(Ty, KnownZero, KnownOne, Min, Max);
5713 ComputeUnsignedMinMaxValuesFromKnownBits(Ty, KnownZero, KnownOne,Min,Max);
5715 // If Min and Max are known to be the same, then SimplifyDemandedBits
5716 // figured out that the LHS is a constant. Just constant fold this now so
5717 // that code below can assume that Min != Max.
5719 return ReplaceInstUsesWith(I, ConstantExpr::getICmp(I.getPredicate(),
5720 ConstantInt::get(Min),
5723 // Based on the range information we know about the LHS, see if we can
5724 // simplify this comparison. For example, (x&4) < 8 is always true.
5725 const APInt &RHSVal = CI->getValue();
5726 switch (I.getPredicate()) { // LE/GE have been folded already.
5727 default: assert(0 && "Unknown icmp opcode!");
5728 case ICmpInst::ICMP_EQ:
5729 if (Max.ult(RHSVal) || Min.ugt(RHSVal))
5730 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5732 case ICmpInst::ICMP_NE:
5733 if (Max.ult(RHSVal) || Min.ugt(RHSVal))
5734 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5736 case ICmpInst::ICMP_ULT:
5737 if (Max.ult(RHSVal)) // A <u C -> true iff max(A) < C
5738 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5739 if (Min.uge(RHSVal)) // A <u C -> false iff min(A) >= C
5740 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5741 if (RHSVal == Max) // A <u MAX -> A != MAX
5742 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
5743 if (RHSVal == Min+1) // A <u MIN+1 -> A == MIN
5744 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, SubOne(CI));
5746 // (x <u 2147483648) -> (x >s -1) -> true if sign bit clear
5747 if (CI->isMinValue(true))
5748 return new ICmpInst(ICmpInst::ICMP_SGT, Op0,
5749 ConstantInt::getAllOnesValue(Op0->getType()));
5751 case ICmpInst::ICMP_UGT:
5752 if (Min.ugt(RHSVal)) // A >u C -> true iff min(A) > C
5753 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5754 if (Max.ule(RHSVal)) // A >u C -> false iff max(A) <= C
5755 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5757 if (RHSVal == Min) // A >u MIN -> A != MIN
5758 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
5759 if (RHSVal == Max-1) // A >u MAX-1 -> A == MAX
5760 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, AddOne(CI));
5762 // (x >u 2147483647) -> (x <s 0) -> true if sign bit set
5763 if (CI->isMaxValue(true))
5764 return new ICmpInst(ICmpInst::ICMP_SLT, Op0,
5765 ConstantInt::getNullValue(Op0->getType()));
5767 case ICmpInst::ICMP_SLT:
5768 if (Max.slt(RHSVal)) // A <s C -> true iff max(A) < C
5769 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5770 if (Min.sge(RHSVal)) // A <s C -> false iff min(A) >= C
5771 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5772 if (RHSVal == Max) // A <s MAX -> A != MAX
5773 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
5774 if (RHSVal == Min+1) // A <s MIN+1 -> A == MIN
5775 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, SubOne(CI));
5777 case ICmpInst::ICMP_SGT:
5778 if (Min.sgt(RHSVal)) // A >s C -> true iff min(A) > C
5779 return ReplaceInstUsesWith(I, ConstantInt::getTrue());
5780 if (Max.sle(RHSVal)) // A >s C -> false iff max(A) <= C
5781 return ReplaceInstUsesWith(I, ConstantInt::getFalse());
5783 if (RHSVal == Min) // A >s MIN -> A != MIN
5784 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
5785 if (RHSVal == Max-1) // A >s MAX-1 -> A == MAX
5786 return new ICmpInst(ICmpInst::ICMP_EQ, Op0, AddOne(CI));
5791 // Test if the ICmpInst instruction is used exclusively by a select as
5792 // part of a minimum or maximum operation. If so, refrain from doing
5793 // any other folding. This helps out other analyses which understand
5794 // non-obfuscated minimum and maximum idioms, such as ScalarEvolution
5795 // and CodeGen. And in this case, at least one of the comparison
5796 // operands has at least one user besides the compare (the select),
5797 // which would often largely negate the benefit of folding anyway.
5799 if (SelectInst *SI = dyn_cast<SelectInst>(*I.use_begin()))
5800 if ((SI->getOperand(1) == Op0 && SI->getOperand(2) == Op1) ||
5801 (SI->getOperand(2) == Op0 && SI->getOperand(1) == Op1))
5804 // See if we are doing a comparison between a constant and an instruction that
5805 // can be folded into the comparison.
5806 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
5807 // Since the RHS is a ConstantInt (CI), if the left hand side is an
5808 // instruction, see if that instruction also has constants so that the
5809 // instruction can be folded into the icmp
5810 if (Instruction *LHSI = dyn_cast<Instruction>(Op0))
5811 if (Instruction *Res = visitICmpInstWithInstAndIntCst(I, LHSI, CI))
5815 // Handle icmp with constant (but not simple integer constant) RHS
5816 if (Constant *RHSC = dyn_cast<Constant>(Op1)) {
5817 if (Instruction *LHSI = dyn_cast<Instruction>(Op0))
5818 switch (LHSI->getOpcode()) {
5819 case Instruction::GetElementPtr:
5820 if (RHSC->isNullValue()) {
5821 // icmp pred GEP (P, int 0, int 0, int 0), null -> icmp pred P, null
5822 bool isAllZeros = true;
5823 for (unsigned i = 1, e = LHSI->getNumOperands(); i != e; ++i)
5824 if (!isa<Constant>(LHSI->getOperand(i)) ||
5825 !cast<Constant>(LHSI->getOperand(i))->isNullValue()) {
5830 return new ICmpInst(I.getPredicate(), LHSI->getOperand(0),
5831 Constant::getNullValue(LHSI->getOperand(0)->getType()));
5835 case Instruction::PHI:
5836 // Only fold icmp into the PHI if the phi and fcmp are in the same
5837 // block. If in the same block, we're encouraging jump threading. If
5838 // not, we are just pessimizing the code by making an i1 phi.
5839 if (LHSI->getParent() == I.getParent())
5840 if (Instruction *NV = FoldOpIntoPhi(I))
5843 case Instruction::Select: {
5844 // If either operand of the select is a constant, we can fold the
5845 // comparison into the select arms, which will cause one to be
5846 // constant folded and the select turned into a bitwise or.
5847 Value *Op1 = 0, *Op2 = 0;
5848 if (LHSI->hasOneUse()) {
5849 if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(1))) {
5850 // Fold the known value into the constant operand.
5851 Op1 = ConstantExpr::getICmp(I.getPredicate(), C, RHSC);
5852 // Insert a new ICmp of the other select operand.
5853 Op2 = InsertNewInstBefore(new ICmpInst(I.getPredicate(),
5854 LHSI->getOperand(2), RHSC,
5856 } else if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(2))) {
5857 // Fold the known value into the constant operand.
5858 Op2 = ConstantExpr::getICmp(I.getPredicate(), C, RHSC);
5859 // Insert a new ICmp of the other select operand.
5860 Op1 = InsertNewInstBefore(new ICmpInst(I.getPredicate(),
5861 LHSI->getOperand(1), RHSC,
5867 return SelectInst::Create(LHSI->getOperand(0), Op1, Op2);
5870 case Instruction::Malloc:
5871 // If we have (malloc != null), and if the malloc has a single use, we
5872 // can assume it is successful and remove the malloc.
5873 if (LHSI->hasOneUse() && isa<ConstantPointerNull>(RHSC)) {
5874 AddToWorkList(LHSI);
5875 return ReplaceInstUsesWith(I, ConstantInt::get(Type::Int1Ty,
5876 !I.isTrueWhenEqual()));
5882 // If we can optimize a 'icmp GEP, P' or 'icmp P, GEP', do so now.
5883 if (User *GEP = dyn_castGetElementPtr(Op0))
5884 if (Instruction *NI = FoldGEPICmp(GEP, Op1, I.getPredicate(), I))
5886 if (User *GEP = dyn_castGetElementPtr(Op1))
5887 if (Instruction *NI = FoldGEPICmp(GEP, Op0,
5888 ICmpInst::getSwappedPredicate(I.getPredicate()), I))
5891 // Test to see if the operands of the icmp are casted versions of other
5892 // values. If the ptr->ptr cast can be stripped off both arguments, we do so
5894 if (BitCastInst *CI = dyn_cast<BitCastInst>(Op0)) {
5895 if (isa<PointerType>(Op0->getType()) &&
5896 (isa<Constant>(Op1) || isa<BitCastInst>(Op1))) {
5897 // We keep moving the cast from the left operand over to the right
5898 // operand, where it can often be eliminated completely.
5899 Op0 = CI->getOperand(0);
5901 // If operand #1 is a bitcast instruction, it must also be a ptr->ptr cast
5902 // so eliminate it as well.
5903 if (BitCastInst *CI2 = dyn_cast<BitCastInst>(Op1))
5904 Op1 = CI2->getOperand(0);
5906 // If Op1 is a constant, we can fold the cast into the constant.
5907 if (Op0->getType() != Op1->getType()) {
5908 if (Constant *Op1C = dyn_cast<Constant>(Op1)) {
5909 Op1 = ConstantExpr::getBitCast(Op1C, Op0->getType());
5911 // Otherwise, cast the RHS right before the icmp
5912 Op1 = InsertBitCastBefore(Op1, Op0->getType(), I);
5915 return new ICmpInst(I.getPredicate(), Op0, Op1);
5919 if (isa<CastInst>(Op0)) {
5920 // Handle the special case of: icmp (cast bool to X), <cst>
5921 // This comes up when you have code like
5924 // For generality, we handle any zero-extension of any operand comparison
5925 // with a constant or another cast from the same type.
5926 if (isa<ConstantInt>(Op1) || isa<CastInst>(Op1))
5927 if (Instruction *R = visitICmpInstWithCastAndCast(I))
5931 // See if it's the same type of instruction on the left and right.
5932 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0)) {
5933 if (BinaryOperator *Op1I = dyn_cast<BinaryOperator>(Op1)) {
5934 if (Op0I->getOpcode() == Op1I->getOpcode() && Op0I->hasOneUse() &&
5935 Op1I->hasOneUse() && Op0I->getOperand(1) == Op1I->getOperand(1) &&
5937 switch (Op0I->getOpcode()) {
5939 case Instruction::Add:
5940 case Instruction::Sub:
5941 case Instruction::Xor:
5942 // a+x icmp eq/ne b+x --> a icmp b
5943 return new ICmpInst(I.getPredicate(), Op0I->getOperand(0),
5944 Op1I->getOperand(0));
5946 case Instruction::Mul:
5947 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op0I->getOperand(1))) {
5948 // a * Cst icmp eq/ne b * Cst --> a & Mask icmp b & Mask
5949 // Mask = -1 >> count-trailing-zeros(Cst).
5950 if (!CI->isZero() && !CI->isOne()) {
5951 const APInt &AP = CI->getValue();
5952 ConstantInt *Mask = ConstantInt::get(
5953 APInt::getLowBitsSet(AP.getBitWidth(),
5955 AP.countTrailingZeros()));
5956 Instruction *And1 = BinaryOperator::CreateAnd(Op0I->getOperand(0),
5958 Instruction *And2 = BinaryOperator::CreateAnd(Op1I->getOperand(0),
5960 InsertNewInstBefore(And1, I);
5961 InsertNewInstBefore(And2, I);
5962 return new ICmpInst(I.getPredicate(), And1, And2);
5971 // ~x < ~y --> y < x
5973 if (match(Op0, m_Not(m_Value(A))) &&
5974 match(Op1, m_Not(m_Value(B))))
5975 return new ICmpInst(I.getPredicate(), B, A);
5978 if (I.isEquality()) {
5979 Value *A, *B, *C, *D;
5981 // -x == -y --> x == y
5982 if (match(Op0, m_Neg(m_Value(A))) &&
5983 match(Op1, m_Neg(m_Value(B))))
5984 return new ICmpInst(I.getPredicate(), A, B);
5986 if (match(Op0, m_Xor(m_Value(A), m_Value(B)))) {
5987 if (A == Op1 || B == Op1) { // (A^B) == A -> B == 0
5988 Value *OtherVal = A == Op1 ? B : A;
5989 return new ICmpInst(I.getPredicate(), OtherVal,
5990 Constant::getNullValue(A->getType()));
5993 if (match(Op1, m_Xor(m_Value(C), m_Value(D)))) {
5994 // A^c1 == C^c2 --> A == C^(c1^c2)
5995 if (ConstantInt *C1 = dyn_cast<ConstantInt>(B))
5996 if (ConstantInt *C2 = dyn_cast<ConstantInt>(D))
5997 if (Op1->hasOneUse()) {
5998 Constant *NC = ConstantInt::get(C1->getValue() ^ C2->getValue());
5999 Instruction *Xor = BinaryOperator::CreateXor(C, NC, "tmp");
6000 return new ICmpInst(I.getPredicate(), A,
6001 InsertNewInstBefore(Xor, I));
6004 // A^B == A^D -> B == D
6005 if (A == C) return new ICmpInst(I.getPredicate(), B, D);
6006 if (A == D) return new ICmpInst(I.getPredicate(), B, C);
6007 if (B == C) return new ICmpInst(I.getPredicate(), A, D);
6008 if (B == D) return new ICmpInst(I.getPredicate(), A, C);
6012 if (match(Op1, m_Xor(m_Value(A), m_Value(B))) &&
6013 (A == Op0 || B == Op0)) {
6014 // A == (A^B) -> B == 0
6015 Value *OtherVal = A == Op0 ? B : A;
6016 return new ICmpInst(I.getPredicate(), OtherVal,
6017 Constant::getNullValue(A->getType()));
6019 if (match(Op0, m_Sub(m_Value(A), m_Value(B))) && A == Op1) {
6020 // (A-B) == A -> B == 0
6021 return new ICmpInst(I.getPredicate(), B,
6022 Constant::getNullValue(B->getType()));
6024 if (match(Op1, m_Sub(m_Value(A), m_Value(B))) && A == Op0) {
6025 // A == (A-B) -> B == 0
6026 return new ICmpInst(I.getPredicate(), B,
6027 Constant::getNullValue(B->getType()));
6030 // (X&Z) == (Y&Z) -> (X^Y) & Z == 0
6031 if (Op0->hasOneUse() && Op1->hasOneUse() &&
6032 match(Op0, m_And(m_Value(A), m_Value(B))) &&
6033 match(Op1, m_And(m_Value(C), m_Value(D)))) {
6034 Value *X = 0, *Y = 0, *Z = 0;
6037 X = B; Y = D; Z = A;
6038 } else if (A == D) {
6039 X = B; Y = C; Z = A;
6040 } else if (B == C) {
6041 X = A; Y = D; Z = B;
6042 } else if (B == D) {
6043 X = A; Y = C; Z = B;
6046 if (X) { // Build (X^Y) & Z
6047 Op1 = InsertNewInstBefore(BinaryOperator::CreateXor(X, Y, "tmp"), I);
6048 Op1 = InsertNewInstBefore(BinaryOperator::CreateAnd(Op1, Z, "tmp"), I);
6049 I.setOperand(0, Op1);
6050 I.setOperand(1, Constant::getNullValue(Op1->getType()));
6055 return Changed ? &I : 0;
6059 /// FoldICmpDivCst - Fold "icmp pred, ([su]div X, DivRHS), CmpRHS" where DivRHS
6060 /// and CmpRHS are both known to be integer constants.
6061 Instruction *InstCombiner::FoldICmpDivCst(ICmpInst &ICI, BinaryOperator *DivI,
6062 ConstantInt *DivRHS) {
6063 ConstantInt *CmpRHS = cast<ConstantInt>(ICI.getOperand(1));
6064 const APInt &CmpRHSV = CmpRHS->getValue();
6066 // FIXME: If the operand types don't match the type of the divide
6067 // then don't attempt this transform. The code below doesn't have the
6068 // logic to deal with a signed divide and an unsigned compare (and
6069 // vice versa). This is because (x /s C1) <s C2 produces different
6070 // results than (x /s C1) <u C2 or (x /u C1) <s C2 or even
6071 // (x /u C1) <u C2. Simply casting the operands and result won't
6072 // work. :( The if statement below tests that condition and bails
6074 bool DivIsSigned = DivI->getOpcode() == Instruction::SDiv;
6075 if (!ICI.isEquality() && DivIsSigned != ICI.isSignedPredicate())
6077 if (DivRHS->isZero())
6078 return 0; // The ProdOV computation fails on divide by zero.
6079 if (DivIsSigned && DivRHS->isAllOnesValue())
6080 return 0; // The overflow computation also screws up here
6081 if (DivRHS->isOne())
6082 return 0; // Not worth bothering, and eliminates some funny cases
6085 // Compute Prod = CI * DivRHS. We are essentially solving an equation
6086 // of form X/C1=C2. We solve for X by multiplying C1 (DivRHS) and
6087 // C2 (CI). By solving for X we can turn this into a range check
6088 // instead of computing a divide.
6089 ConstantInt *Prod = Multiply(CmpRHS, DivRHS);
6091 // Determine if the product overflows by seeing if the product is
6092 // not equal to the divide. Make sure we do the same kind of divide
6093 // as in the LHS instruction that we're folding.
6094 bool ProdOV = (DivIsSigned ? ConstantExpr::getSDiv(Prod, DivRHS) :
6095 ConstantExpr::getUDiv(Prod, DivRHS)) != CmpRHS;
6097 // Get the ICmp opcode
6098 ICmpInst::Predicate Pred = ICI.getPredicate();
6100 // Figure out the interval that is being checked. For example, a comparison
6101 // like "X /u 5 == 0" is really checking that X is in the interval [0, 5).
6102 // Compute this interval based on the constants involved and the signedness of
6103 // the compare/divide. This computes a half-open interval, keeping track of
6104 // whether either value in the interval overflows. After analysis each
6105 // overflow variable is set to 0 if it's corresponding bound variable is valid
6106 // -1 if overflowed off the bottom end, or +1 if overflowed off the top end.
6107 int LoOverflow = 0, HiOverflow = 0;
6108 ConstantInt *LoBound = 0, *HiBound = 0;
6110 if (!DivIsSigned) { // udiv
6111 // e.g. X/5 op 3 --> [15, 20)
6113 HiOverflow = LoOverflow = ProdOV;
6115 HiOverflow = AddWithOverflow(HiBound, LoBound, DivRHS, false);
6116 } else if (DivRHS->getValue().isStrictlyPositive()) { // Divisor is > 0.
6117 if (CmpRHSV == 0) { // (X / pos) op 0
6118 // Can't overflow. e.g. X/2 op 0 --> [-1, 2)
6119 LoBound = cast<ConstantInt>(ConstantExpr::getNeg(SubOne(DivRHS)));
6121 } else if (CmpRHSV.isStrictlyPositive()) { // (X / pos) op pos
6122 LoBound = Prod; // e.g. X/5 op 3 --> [15, 20)
6123 HiOverflow = LoOverflow = ProdOV;
6125 HiOverflow = AddWithOverflow(HiBound, Prod, DivRHS, true);
6126 } else { // (X / pos) op neg
6127 // e.g. X/5 op -3 --> [-15-4, -15+1) --> [-19, -14)
6128 HiBound = AddOne(Prod);
6129 LoOverflow = HiOverflow = ProdOV ? -1 : 0;
6131 ConstantInt* DivNeg = cast<ConstantInt>(ConstantExpr::getNeg(DivRHS));
6132 LoOverflow = AddWithOverflow(LoBound, HiBound, DivNeg,
6136 } else if (DivRHS->getValue().isNegative()) { // Divisor is < 0.
6137 if (CmpRHSV == 0) { // (X / neg) op 0
6138 // e.g. X/-5 op 0 --> [-4, 5)
6139 LoBound = AddOne(DivRHS);
6140 HiBound = cast<ConstantInt>(ConstantExpr::getNeg(DivRHS));
6141 if (HiBound == DivRHS) { // -INTMIN = INTMIN
6142 HiOverflow = 1; // [INTMIN+1, overflow)
6143 HiBound = 0; // e.g. X/INTMIN = 0 --> X > INTMIN
6145 } else if (CmpRHSV.isStrictlyPositive()) { // (X / neg) op pos
6146 // e.g. X/-5 op 3 --> [-19, -14)
6147 HiBound = AddOne(Prod);
6148 HiOverflow = LoOverflow = ProdOV ? -1 : 0;
6150 LoOverflow = AddWithOverflow(LoBound, HiBound, DivRHS, true) ? -1 : 0;
6151 } else { // (X / neg) op neg
6152 LoBound = Prod; // e.g. X/-5 op -3 --> [15, 20)
6153 LoOverflow = HiOverflow = ProdOV;
6155 HiOverflow = SubWithOverflow(HiBound, Prod, DivRHS, true);
6158 // Dividing by a negative swaps the condition. LT <-> GT
6159 Pred = ICmpInst::getSwappedPredicate(Pred);
6162 Value *X = DivI->getOperand(0);
6164 default: assert(0 && "Unhandled icmp opcode!");
6165 case ICmpInst::ICMP_EQ:
6166 if (LoOverflow && HiOverflow)
6167 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
6168 else if (HiOverflow)
6169 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SGE :
6170 ICmpInst::ICMP_UGE, X, LoBound);
6171 else if (LoOverflow)
6172 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SLT :
6173 ICmpInst::ICMP_ULT, X, HiBound);
6175 return InsertRangeTest(X, LoBound, HiBound, DivIsSigned, true, ICI);
6176 case ICmpInst::ICMP_NE:
6177 if (LoOverflow && HiOverflow)
6178 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
6179 else if (HiOverflow)
6180 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SLT :
6181 ICmpInst::ICMP_ULT, X, LoBound);
6182 else if (LoOverflow)
6183 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SGE :
6184 ICmpInst::ICMP_UGE, X, HiBound);
6186 return InsertRangeTest(X, LoBound, HiBound, DivIsSigned, false, ICI);
6187 case ICmpInst::ICMP_ULT:
6188 case ICmpInst::ICMP_SLT:
6189 if (LoOverflow == +1) // Low bound is greater than input range.
6190 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
6191 if (LoOverflow == -1) // Low bound is less than input range.
6192 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
6193 return new ICmpInst(Pred, X, LoBound);
6194 case ICmpInst::ICMP_UGT:
6195 case ICmpInst::ICMP_SGT:
6196 if (HiOverflow == +1) // High bound greater than input range.
6197 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
6198 else if (HiOverflow == -1) // High bound less than input range.
6199 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
6200 if (Pred == ICmpInst::ICMP_UGT)
6201 return new ICmpInst(ICmpInst::ICMP_UGE, X, HiBound);
6203 return new ICmpInst(ICmpInst::ICMP_SGE, X, HiBound);
6208 /// visitICmpInstWithInstAndIntCst - Handle "icmp (instr, intcst)".
6210 Instruction *InstCombiner::visitICmpInstWithInstAndIntCst(ICmpInst &ICI,
6213 const APInt &RHSV = RHS->getValue();
6215 switch (LHSI->getOpcode()) {
6216 case Instruction::Xor: // (icmp pred (xor X, XorCST), CI)
6217 if (ConstantInt *XorCST = dyn_cast<ConstantInt>(LHSI->getOperand(1))) {
6218 // If this is a comparison that tests the signbit (X < 0) or (x > -1),
6220 if ((ICI.getPredicate() == ICmpInst::ICMP_SLT && RHSV == 0) ||
6221 (ICI.getPredicate() == ICmpInst::ICMP_SGT && RHSV.isAllOnesValue())) {
6222 Value *CompareVal = LHSI->getOperand(0);
6224 // If the sign bit of the XorCST is not set, there is no change to
6225 // the operation, just stop using the Xor.
6226 if (!XorCST->getValue().isNegative()) {
6227 ICI.setOperand(0, CompareVal);
6228 AddToWorkList(LHSI);
6232 // Was the old condition true if the operand is positive?
6233 bool isTrueIfPositive = ICI.getPredicate() == ICmpInst::ICMP_SGT;
6235 // If so, the new one isn't.
6236 isTrueIfPositive ^= true;
6238 if (isTrueIfPositive)
6239 return new ICmpInst(ICmpInst::ICMP_SGT, CompareVal, SubOne(RHS));
6241 return new ICmpInst(ICmpInst::ICMP_SLT, CompareVal, AddOne(RHS));
6245 case Instruction::And: // (icmp pred (and X, AndCST), RHS)
6246 if (LHSI->hasOneUse() && isa<ConstantInt>(LHSI->getOperand(1)) &&
6247 LHSI->getOperand(0)->hasOneUse()) {
6248 ConstantInt *AndCST = cast<ConstantInt>(LHSI->getOperand(1));
6250 // If the LHS is an AND of a truncating cast, we can widen the
6251 // and/compare to be the input width without changing the value
6252 // produced, eliminating a cast.
6253 if (TruncInst *Cast = dyn_cast<TruncInst>(LHSI->getOperand(0))) {
6254 // We can do this transformation if either the AND constant does not
6255 // have its sign bit set or if it is an equality comparison.
6256 // Extending a relational comparison when we're checking the sign
6257 // bit would not work.
6258 if (Cast->hasOneUse() &&
6259 (ICI.isEquality() ||
6260 (AndCST->getValue().isNonNegative() && RHSV.isNonNegative()))) {
6262 cast<IntegerType>(Cast->getOperand(0)->getType())->getBitWidth();
6263 APInt NewCST = AndCST->getValue();
6264 NewCST.zext(BitWidth);
6266 NewCI.zext(BitWidth);
6267 Instruction *NewAnd =
6268 BinaryOperator::CreateAnd(Cast->getOperand(0),
6269 ConstantInt::get(NewCST),LHSI->getName());
6270 InsertNewInstBefore(NewAnd, ICI);
6271 return new ICmpInst(ICI.getPredicate(), NewAnd,
6272 ConstantInt::get(NewCI));
6276 // If this is: (X >> C1) & C2 != C3 (where any shift and any compare
6277 // could exist), turn it into (X & (C2 << C1)) != (C3 << C1). This
6278 // happens a LOT in code produced by the C front-end, for bitfield
6280 BinaryOperator *Shift = dyn_cast<BinaryOperator>(LHSI->getOperand(0));
6281 if (Shift && !Shift->isShift())
6285 ShAmt = Shift ? dyn_cast<ConstantInt>(Shift->getOperand(1)) : 0;
6286 const Type *Ty = Shift ? Shift->getType() : 0; // Type of the shift.
6287 const Type *AndTy = AndCST->getType(); // Type of the and.
6289 // We can fold this as long as we can't shift unknown bits
6290 // into the mask. This can only happen with signed shift
6291 // rights, as they sign-extend.
6293 bool CanFold = Shift->isLogicalShift();
6295 // To test for the bad case of the signed shr, see if any
6296 // of the bits shifted in could be tested after the mask.
6297 uint32_t TyBits = Ty->getPrimitiveSizeInBits();
6298 int ShAmtVal = TyBits - ShAmt->getLimitedValue(TyBits);
6300 uint32_t BitWidth = AndTy->getPrimitiveSizeInBits();
6301 if ((APInt::getHighBitsSet(BitWidth, BitWidth-ShAmtVal) &
6302 AndCST->getValue()) == 0)
6308 if (Shift->getOpcode() == Instruction::Shl)
6309 NewCst = ConstantExpr::getLShr(RHS, ShAmt);
6311 NewCst = ConstantExpr::getShl(RHS, ShAmt);
6313 // Check to see if we are shifting out any of the bits being
6315 if (ConstantExpr::get(Shift->getOpcode(), NewCst, ShAmt) != RHS) {
6316 // If we shifted bits out, the fold is not going to work out.
6317 // As a special case, check to see if this means that the
6318 // result is always true or false now.
6319 if (ICI.getPredicate() == ICmpInst::ICMP_EQ)
6320 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
6321 if (ICI.getPredicate() == ICmpInst::ICMP_NE)
6322 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
6324 ICI.setOperand(1, NewCst);
6325 Constant *NewAndCST;
6326 if (Shift->getOpcode() == Instruction::Shl)
6327 NewAndCST = ConstantExpr::getLShr(AndCST, ShAmt);
6329 NewAndCST = ConstantExpr::getShl(AndCST, ShAmt);
6330 LHSI->setOperand(1, NewAndCST);
6331 LHSI->setOperand(0, Shift->getOperand(0));
6332 AddToWorkList(Shift); // Shift is dead.
6333 AddUsesToWorkList(ICI);
6339 // Turn ((X >> Y) & C) == 0 into (X & (C << Y)) == 0. The later is
6340 // preferable because it allows the C<<Y expression to be hoisted out
6341 // of a loop if Y is invariant and X is not.
6342 if (Shift && Shift->hasOneUse() && RHSV == 0 &&
6343 ICI.isEquality() && !Shift->isArithmeticShift() &&
6344 isa<Instruction>(Shift->getOperand(0))) {
6347 if (Shift->getOpcode() == Instruction::LShr) {
6348 NS = BinaryOperator::CreateShl(AndCST,
6349 Shift->getOperand(1), "tmp");
6351 // Insert a logical shift.
6352 NS = BinaryOperator::CreateLShr(AndCST,
6353 Shift->getOperand(1), "tmp");
6355 InsertNewInstBefore(cast<Instruction>(NS), ICI);
6357 // Compute X & (C << Y).
6358 Instruction *NewAnd =
6359 BinaryOperator::CreateAnd(Shift->getOperand(0), NS, LHSI->getName());
6360 InsertNewInstBefore(NewAnd, ICI);
6362 ICI.setOperand(0, NewAnd);
6368 case Instruction::Shl: { // (icmp pred (shl X, ShAmt), CI)
6369 ConstantInt *ShAmt = dyn_cast<ConstantInt>(LHSI->getOperand(1));
6372 uint32_t TypeBits = RHSV.getBitWidth();
6374 // Check that the shift amount is in range. If not, don't perform
6375 // undefined shifts. When the shift is visited it will be
6377 if (ShAmt->uge(TypeBits))
6380 if (ICI.isEquality()) {
6381 // If we are comparing against bits always shifted out, the
6382 // comparison cannot succeed.
6384 ConstantExpr::getShl(ConstantExpr::getLShr(RHS, ShAmt), ShAmt);
6385 if (Comp != RHS) {// Comparing against a bit that we know is zero.
6386 bool IsICMP_NE = ICI.getPredicate() == ICmpInst::ICMP_NE;
6387 Constant *Cst = ConstantInt::get(Type::Int1Ty, IsICMP_NE);
6388 return ReplaceInstUsesWith(ICI, Cst);
6391 if (LHSI->hasOneUse()) {
6392 // Otherwise strength reduce the shift into an and.
6393 uint32_t ShAmtVal = (uint32_t)ShAmt->getLimitedValue(TypeBits);
6395 ConstantInt::get(APInt::getLowBitsSet(TypeBits, TypeBits-ShAmtVal));
6398 BinaryOperator::CreateAnd(LHSI->getOperand(0),
6399 Mask, LHSI->getName()+".mask");
6400 Value *And = InsertNewInstBefore(AndI, ICI);
6401 return new ICmpInst(ICI.getPredicate(), And,
6402 ConstantInt::get(RHSV.lshr(ShAmtVal)));
6406 // Otherwise, if this is a comparison of the sign bit, simplify to and/test.
6407 bool TrueIfSigned = false;
6408 if (LHSI->hasOneUse() &&
6409 isSignBitCheck(ICI.getPredicate(), RHS, TrueIfSigned)) {
6410 // (X << 31) <s 0 --> (X&1) != 0
6411 Constant *Mask = ConstantInt::get(APInt(TypeBits, 1) <<
6412 (TypeBits-ShAmt->getZExtValue()-1));
6414 BinaryOperator::CreateAnd(LHSI->getOperand(0),
6415 Mask, LHSI->getName()+".mask");
6416 Value *And = InsertNewInstBefore(AndI, ICI);
6418 return new ICmpInst(TrueIfSigned ? ICmpInst::ICMP_NE : ICmpInst::ICMP_EQ,
6419 And, Constant::getNullValue(And->getType()));
6424 case Instruction::LShr: // (icmp pred (shr X, ShAmt), CI)
6425 case Instruction::AShr: {
6426 // Only handle equality comparisons of shift-by-constant.
6427 ConstantInt *ShAmt = dyn_cast<ConstantInt>(LHSI->getOperand(1));
6428 if (!ShAmt || !ICI.isEquality()) break;
6430 // Check that the shift amount is in range. If not, don't perform
6431 // undefined shifts. When the shift is visited it will be
6433 uint32_t TypeBits = RHSV.getBitWidth();
6434 if (ShAmt->uge(TypeBits))
6437 uint32_t ShAmtVal = (uint32_t)ShAmt->getLimitedValue(TypeBits);
6439 // If we are comparing against bits always shifted out, the
6440 // comparison cannot succeed.
6441 APInt Comp = RHSV << ShAmtVal;
6442 if (LHSI->getOpcode() == Instruction::LShr)
6443 Comp = Comp.lshr(ShAmtVal);
6445 Comp = Comp.ashr(ShAmtVal);
6447 if (Comp != RHSV) { // Comparing against a bit that we know is zero.
6448 bool IsICMP_NE = ICI.getPredicate() == ICmpInst::ICMP_NE;
6449 Constant *Cst = ConstantInt::get(Type::Int1Ty, IsICMP_NE);
6450 return ReplaceInstUsesWith(ICI, Cst);
6453 // Otherwise, check to see if the bits shifted out are known to be zero.
6454 // If so, we can compare against the unshifted value:
6455 // (X & 4) >> 1 == 2 --> (X & 4) == 4.
6456 if (LHSI->hasOneUse() &&
6457 MaskedValueIsZero(LHSI->getOperand(0),
6458 APInt::getLowBitsSet(Comp.getBitWidth(), ShAmtVal))) {
6459 return new ICmpInst(ICI.getPredicate(), LHSI->getOperand(0),
6460 ConstantExpr::getShl(RHS, ShAmt));
6463 if (LHSI->hasOneUse()) {
6464 // Otherwise strength reduce the shift into an and.
6465 APInt Val(APInt::getHighBitsSet(TypeBits, TypeBits - ShAmtVal));
6466 Constant *Mask = ConstantInt::get(Val);
6469 BinaryOperator::CreateAnd(LHSI->getOperand(0),
6470 Mask, LHSI->getName()+".mask");
6471 Value *And = InsertNewInstBefore(AndI, ICI);
6472 return new ICmpInst(ICI.getPredicate(), And,
6473 ConstantExpr::getShl(RHS, ShAmt));
6478 case Instruction::SDiv:
6479 case Instruction::UDiv:
6480 // Fold: icmp pred ([us]div X, C1), C2 -> range test
6481 // Fold this div into the comparison, producing a range check.
6482 // Determine, based on the divide type, what the range is being
6483 // checked. If there is an overflow on the low or high side, remember
6484 // it, otherwise compute the range [low, hi) bounding the new value.
6485 // See: InsertRangeTest above for the kinds of replacements possible.
6486 if (ConstantInt *DivRHS = dyn_cast<ConstantInt>(LHSI->getOperand(1)))
6487 if (Instruction *R = FoldICmpDivCst(ICI, cast<BinaryOperator>(LHSI),
6492 case Instruction::Add:
6493 // Fold: icmp pred (add, X, C1), C2
6495 if (!ICI.isEquality()) {
6496 ConstantInt *LHSC = dyn_cast<ConstantInt>(LHSI->getOperand(1));
6498 const APInt &LHSV = LHSC->getValue();
6500 ConstantRange CR = ICI.makeConstantRange(ICI.getPredicate(), RHSV)
6503 if (ICI.isSignedPredicate()) {
6504 if (CR.getLower().isSignBit()) {
6505 return new ICmpInst(ICmpInst::ICMP_SLT, LHSI->getOperand(0),
6506 ConstantInt::get(CR.getUpper()));
6507 } else if (CR.getUpper().isSignBit()) {
6508 return new ICmpInst(ICmpInst::ICMP_SGE, LHSI->getOperand(0),
6509 ConstantInt::get(CR.getLower()));
6512 if (CR.getLower().isMinValue()) {
6513 return new ICmpInst(ICmpInst::ICMP_ULT, LHSI->getOperand(0),
6514 ConstantInt::get(CR.getUpper()));
6515 } else if (CR.getUpper().isMinValue()) {
6516 return new ICmpInst(ICmpInst::ICMP_UGE, LHSI->getOperand(0),
6517 ConstantInt::get(CR.getLower()));
6524 // Simplify icmp_eq and icmp_ne instructions with integer constant RHS.
6525 if (ICI.isEquality()) {
6526 bool isICMP_NE = ICI.getPredicate() == ICmpInst::ICMP_NE;
6528 // If the first operand is (add|sub|and|or|xor|rem) with a constant, and
6529 // the second operand is a constant, simplify a bit.
6530 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(LHSI)) {
6531 switch (BO->getOpcode()) {
6532 case Instruction::SRem:
6533 // If we have a signed (X % (2^c)) == 0, turn it into an unsigned one.
6534 if (RHSV == 0 && isa<ConstantInt>(BO->getOperand(1)) &&BO->hasOneUse()){
6535 const APInt &V = cast<ConstantInt>(BO->getOperand(1))->getValue();
6536 if (V.sgt(APInt(V.getBitWidth(), 1)) && V.isPowerOf2()) {
6537 Instruction *NewRem =
6538 BinaryOperator::CreateURem(BO->getOperand(0), BO->getOperand(1),
6540 InsertNewInstBefore(NewRem, ICI);
6541 return new ICmpInst(ICI.getPredicate(), NewRem,
6542 Constant::getNullValue(BO->getType()));
6546 case Instruction::Add:
6547 // Replace ((add A, B) != C) with (A != C-B) if B & C are constants.
6548 if (ConstantInt *BOp1C = dyn_cast<ConstantInt>(BO->getOperand(1))) {
6549 if (BO->hasOneUse())
6550 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
6551 Subtract(RHS, BOp1C));
6552 } else if (RHSV == 0) {
6553 // Replace ((add A, B) != 0) with (A != -B) if A or B is
6554 // efficiently invertible, or if the add has just this one use.
6555 Value *BOp0 = BO->getOperand(0), *BOp1 = BO->getOperand(1);
6557 if (Value *NegVal = dyn_castNegVal(BOp1))
6558 return new ICmpInst(ICI.getPredicate(), BOp0, NegVal);
6559 else if (Value *NegVal = dyn_castNegVal(BOp0))
6560 return new ICmpInst(ICI.getPredicate(), NegVal, BOp1);
6561 else if (BO->hasOneUse()) {
6562 Instruction *Neg = BinaryOperator::CreateNeg(BOp1);
6563 InsertNewInstBefore(Neg, ICI);
6565 return new ICmpInst(ICI.getPredicate(), BOp0, Neg);
6569 case Instruction::Xor:
6570 // For the xor case, we can xor two constants together, eliminating
6571 // the explicit xor.
6572 if (Constant *BOC = dyn_cast<Constant>(BO->getOperand(1)))
6573 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
6574 ConstantExpr::getXor(RHS, BOC));
6577 case Instruction::Sub:
6578 // Replace (([sub|xor] A, B) != 0) with (A != B)
6580 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
6584 case Instruction::Or:
6585 // If bits are being or'd in that are not present in the constant we
6586 // are comparing against, then the comparison could never succeed!
6587 if (Constant *BOC = dyn_cast<Constant>(BO->getOperand(1))) {
6588 Constant *NotCI = ConstantExpr::getNot(RHS);
6589 if (!ConstantExpr::getAnd(BOC, NotCI)->isNullValue())
6590 return ReplaceInstUsesWith(ICI, ConstantInt::get(Type::Int1Ty,
6595 case Instruction::And:
6596 if (ConstantInt *BOC = dyn_cast<ConstantInt>(BO->getOperand(1))) {
6597 // If bits are being compared against that are and'd out, then the
6598 // comparison can never succeed!
6599 if ((RHSV & ~BOC->getValue()) != 0)
6600 return ReplaceInstUsesWith(ICI, ConstantInt::get(Type::Int1Ty,
6603 // If we have ((X & C) == C), turn it into ((X & C) != 0).
6604 if (RHS == BOC && RHSV.isPowerOf2())
6605 return new ICmpInst(isICMP_NE ? ICmpInst::ICMP_EQ :
6606 ICmpInst::ICMP_NE, LHSI,
6607 Constant::getNullValue(RHS->getType()));
6609 // Replace (and X, (1 << size(X)-1) != 0) with x s< 0
6610 if (BOC->getValue().isSignBit()) {
6611 Value *X = BO->getOperand(0);
6612 Constant *Zero = Constant::getNullValue(X->getType());
6613 ICmpInst::Predicate pred = isICMP_NE ?
6614 ICmpInst::ICMP_SLT : ICmpInst::ICMP_SGE;
6615 return new ICmpInst(pred, X, Zero);
6618 // ((X & ~7) == 0) --> X < 8
6619 if (RHSV == 0 && isHighOnes(BOC)) {
6620 Value *X = BO->getOperand(0);
6621 Constant *NegX = ConstantExpr::getNeg(BOC);
6622 ICmpInst::Predicate pred = isICMP_NE ?
6623 ICmpInst::ICMP_UGE : ICmpInst::ICMP_ULT;
6624 return new ICmpInst(pred, X, NegX);
6629 } else if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(LHSI)) {
6630 // Handle icmp {eq|ne} <intrinsic>, intcst.
6631 if (II->getIntrinsicID() == Intrinsic::bswap) {
6633 ICI.setOperand(0, II->getOperand(1));
6634 ICI.setOperand(1, ConstantInt::get(RHSV.byteSwap()));
6638 } else { // Not a ICMP_EQ/ICMP_NE
6639 // If the LHS is a cast from an integral value of the same size,
6640 // then since we know the RHS is a constant, try to simlify.
6641 if (CastInst *Cast = dyn_cast<CastInst>(LHSI)) {
6642 Value *CastOp = Cast->getOperand(0);
6643 const Type *SrcTy = CastOp->getType();
6644 uint32_t SrcTySize = SrcTy->getPrimitiveSizeInBits();
6645 if (SrcTy->isInteger() &&
6646 SrcTySize == Cast->getType()->getPrimitiveSizeInBits()) {
6647 // If this is an unsigned comparison, try to make the comparison use
6648 // smaller constant values.
6649 if (ICI.getPredicate() == ICmpInst::ICMP_ULT && RHSV.isSignBit()) {
6650 // X u< 128 => X s> -1
6651 return new ICmpInst(ICmpInst::ICMP_SGT, CastOp,
6652 ConstantInt::get(APInt::getAllOnesValue(SrcTySize)));
6653 } else if (ICI.getPredicate() == ICmpInst::ICMP_UGT &&
6654 RHSV == APInt::getSignedMaxValue(SrcTySize)) {
6655 // X u> 127 => X s< 0
6656 return new ICmpInst(ICmpInst::ICMP_SLT, CastOp,
6657 Constant::getNullValue(SrcTy));
6665 /// visitICmpInstWithCastAndCast - Handle icmp (cast x to y), (cast/cst).
6666 /// We only handle extending casts so far.
6668 Instruction *InstCombiner::visitICmpInstWithCastAndCast(ICmpInst &ICI) {
6669 const CastInst *LHSCI = cast<CastInst>(ICI.getOperand(0));
6670 Value *LHSCIOp = LHSCI->getOperand(0);
6671 const Type *SrcTy = LHSCIOp->getType();
6672 const Type *DestTy = LHSCI->getType();
6675 // Turn icmp (ptrtoint x), (ptrtoint/c) into a compare of the input if the
6676 // integer type is the same size as the pointer type.
6677 if (LHSCI->getOpcode() == Instruction::PtrToInt &&
6678 getTargetData().getPointerSizeInBits() ==
6679 cast<IntegerType>(DestTy)->getBitWidth()) {
6681 if (Constant *RHSC = dyn_cast<Constant>(ICI.getOperand(1))) {
6682 RHSOp = ConstantExpr::getIntToPtr(RHSC, SrcTy);
6683 } else if (PtrToIntInst *RHSC = dyn_cast<PtrToIntInst>(ICI.getOperand(1))) {
6684 RHSOp = RHSC->getOperand(0);
6685 // If the pointer types don't match, insert a bitcast.
6686 if (LHSCIOp->getType() != RHSOp->getType())
6687 RHSOp = InsertBitCastBefore(RHSOp, LHSCIOp->getType(), ICI);
6691 return new ICmpInst(ICI.getPredicate(), LHSCIOp, RHSOp);
6694 // The code below only handles extension cast instructions, so far.
6696 if (LHSCI->getOpcode() != Instruction::ZExt &&
6697 LHSCI->getOpcode() != Instruction::SExt)
6700 bool isSignedExt = LHSCI->getOpcode() == Instruction::SExt;
6701 bool isSignedCmp = ICI.isSignedPredicate();
6703 if (CastInst *CI = dyn_cast<CastInst>(ICI.getOperand(1))) {
6704 // Not an extension from the same type?
6705 RHSCIOp = CI->getOperand(0);
6706 if (RHSCIOp->getType() != LHSCIOp->getType())
6709 // If the signedness of the two casts doesn't agree (i.e. one is a sext
6710 // and the other is a zext), then we can't handle this.
6711 if (CI->getOpcode() != LHSCI->getOpcode())
6714 // Deal with equality cases early.
6715 if (ICI.isEquality())
6716 return new ICmpInst(ICI.getPredicate(), LHSCIOp, RHSCIOp);
6718 // A signed comparison of sign extended values simplifies into a
6719 // signed comparison.
6720 if (isSignedCmp && isSignedExt)
6721 return new ICmpInst(ICI.getPredicate(), LHSCIOp, RHSCIOp);
6723 // The other three cases all fold into an unsigned comparison.
6724 return new ICmpInst(ICI.getUnsignedPredicate(), LHSCIOp, RHSCIOp);
6727 // If we aren't dealing with a constant on the RHS, exit early
6728 ConstantInt *CI = dyn_cast<ConstantInt>(ICI.getOperand(1));
6732 // Compute the constant that would happen if we truncated to SrcTy then
6733 // reextended to DestTy.
6734 Constant *Res1 = ConstantExpr::getTrunc(CI, SrcTy);
6735 Constant *Res2 = ConstantExpr::getCast(LHSCI->getOpcode(), Res1, DestTy);
6737 // If the re-extended constant didn't change...
6739 // Make sure that sign of the Cmp and the sign of the Cast are the same.
6740 // For example, we might have:
6741 // %A = sext short %X to uint
6742 // %B = icmp ugt uint %A, 1330
6743 // It is incorrect to transform this into
6744 // %B = icmp ugt short %X, 1330
6745 // because %A may have negative value.
6747 // However, we allow this when the compare is EQ/NE, because they are
6749 if (isSignedExt == isSignedCmp || ICI.isEquality())
6750 return new ICmpInst(ICI.getPredicate(), LHSCIOp, Res1);
6754 // The re-extended constant changed so the constant cannot be represented
6755 // in the shorter type. Consequently, we cannot emit a simple comparison.
6757 // First, handle some easy cases. We know the result cannot be equal at this
6758 // point so handle the ICI.isEquality() cases
6759 if (ICI.getPredicate() == ICmpInst::ICMP_EQ)
6760 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse());
6761 if (ICI.getPredicate() == ICmpInst::ICMP_NE)
6762 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue());
6764 // Evaluate the comparison for LT (we invert for GT below). LE and GE cases
6765 // should have been folded away previously and not enter in here.
6768 // We're performing a signed comparison.
6769 if (cast<ConstantInt>(CI)->getValue().isNegative())
6770 Result = ConstantInt::getFalse(); // X < (small) --> false
6772 Result = ConstantInt::getTrue(); // X < (large) --> true
6774 // We're performing an unsigned comparison.
6776 // We're performing an unsigned comp with a sign extended value.
6777 // This is true if the input is >= 0. [aka >s -1]
6778 Constant *NegOne = ConstantInt::getAllOnesValue(SrcTy);
6779 Result = InsertNewInstBefore(new ICmpInst(ICmpInst::ICMP_SGT, LHSCIOp,
6780 NegOne, ICI.getName()), ICI);
6782 // Unsigned extend & unsigned compare -> always true.
6783 Result = ConstantInt::getTrue();
6787 // Finally, return the value computed.
6788 if (ICI.getPredicate() == ICmpInst::ICMP_ULT ||
6789 ICI.getPredicate() == ICmpInst::ICMP_SLT)
6790 return ReplaceInstUsesWith(ICI, Result);
6792 assert((ICI.getPredicate()==ICmpInst::ICMP_UGT ||
6793 ICI.getPredicate()==ICmpInst::ICMP_SGT) &&
6794 "ICmp should be folded!");
6795 if (Constant *CI = dyn_cast<Constant>(Result))
6796 return ReplaceInstUsesWith(ICI, ConstantExpr::getNot(CI));
6797 return BinaryOperator::CreateNot(Result);
6800 Instruction *InstCombiner::visitShl(BinaryOperator &I) {
6801 return commonShiftTransforms(I);
6804 Instruction *InstCombiner::visitLShr(BinaryOperator &I) {
6805 return commonShiftTransforms(I);
6808 Instruction *InstCombiner::visitAShr(BinaryOperator &I) {
6809 if (Instruction *R = commonShiftTransforms(I))
6812 Value *Op0 = I.getOperand(0);
6814 // ashr int -1, X = -1 (for any arithmetic shift rights of ~0)
6815 if (ConstantInt *CSI = dyn_cast<ConstantInt>(Op0))
6816 if (CSI->isAllOnesValue())
6817 return ReplaceInstUsesWith(I, CSI);
6819 // See if we can turn a signed shr into an unsigned shr.
6820 if (!isa<VectorType>(I.getType()) &&
6821 MaskedValueIsZero(Op0,
6822 APInt::getSignBit(I.getType()->getPrimitiveSizeInBits())))
6823 return BinaryOperator::CreateLShr(Op0, I.getOperand(1));
6828 Instruction *InstCombiner::commonShiftTransforms(BinaryOperator &I) {
6829 assert(I.getOperand(1)->getType() == I.getOperand(0)->getType());
6830 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
6832 // shl X, 0 == X and shr X, 0 == X
6833 // shl 0, X == 0 and shr 0, X == 0
6834 if (Op1 == Constant::getNullValue(Op1->getType()) ||
6835 Op0 == Constant::getNullValue(Op0->getType()))
6836 return ReplaceInstUsesWith(I, Op0);
6838 if (isa<UndefValue>(Op0)) {
6839 if (I.getOpcode() == Instruction::AShr) // undef >>s X -> undef
6840 return ReplaceInstUsesWith(I, Op0);
6841 else // undef << X -> 0, undef >>u X -> 0
6842 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
6844 if (isa<UndefValue>(Op1)) {
6845 if (I.getOpcode() == Instruction::AShr) // X >>s undef -> X
6846 return ReplaceInstUsesWith(I, Op0);
6847 else // X << undef, X >>u undef -> 0
6848 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
6851 // Try to fold constant and into select arguments.
6852 if (isa<Constant>(Op0))
6853 if (SelectInst *SI = dyn_cast<SelectInst>(Op1))
6854 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
6857 if (ConstantInt *CUI = dyn_cast<ConstantInt>(Op1))
6858 if (Instruction *Res = FoldShiftByConstant(Op0, CUI, I))
6863 Instruction *InstCombiner::FoldShiftByConstant(Value *Op0, ConstantInt *Op1,
6864 BinaryOperator &I) {
6865 bool isLeftShift = I.getOpcode() == Instruction::Shl;
6867 // See if we can simplify any instructions used by the instruction whose sole
6868 // purpose is to compute bits we don't care about.
6869 uint32_t TypeBits = Op0->getType()->getPrimitiveSizeInBits();
6870 APInt KnownZero(TypeBits, 0), KnownOne(TypeBits, 0);
6871 if (SimplifyDemandedBits(&I, APInt::getAllOnesValue(TypeBits),
6872 KnownZero, KnownOne))
6875 // shl uint X, 32 = 0 and shr ubyte Y, 9 = 0, ... just don't eliminate shr
6876 // of a signed value.
6878 if (Op1->uge(TypeBits)) {
6879 if (I.getOpcode() != Instruction::AShr)
6880 return ReplaceInstUsesWith(I, Constant::getNullValue(Op0->getType()));
6882 I.setOperand(1, ConstantInt::get(I.getType(), TypeBits-1));
6887 // ((X*C1) << C2) == (X * (C1 << C2))
6888 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(Op0))
6889 if (BO->getOpcode() == Instruction::Mul && isLeftShift)
6890 if (Constant *BOOp = dyn_cast<Constant>(BO->getOperand(1)))
6891 return BinaryOperator::CreateMul(BO->getOperand(0),
6892 ConstantExpr::getShl(BOOp, Op1));
6894 // Try to fold constant and into select arguments.
6895 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
6896 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
6898 if (isa<PHINode>(Op0))
6899 if (Instruction *NV = FoldOpIntoPhi(I))
6902 // Fold shift2(trunc(shift1(x,c1)), c2) -> trunc(shift2(shift1(x,c1),c2))
6903 if (TruncInst *TI = dyn_cast<TruncInst>(Op0)) {
6904 Instruction *TrOp = dyn_cast<Instruction>(TI->getOperand(0));
6905 // If 'shift2' is an ashr, we would have to get the sign bit into a funny
6906 // place. Don't try to do this transformation in this case. Also, we
6907 // require that the input operand is a shift-by-constant so that we have
6908 // confidence that the shifts will get folded together. We could do this
6909 // xform in more cases, but it is unlikely to be profitable.
6910 if (TrOp && I.isLogicalShift() && TrOp->isShift() &&
6911 isa<ConstantInt>(TrOp->getOperand(1))) {
6912 // Okay, we'll do this xform. Make the shift of shift.
6913 Constant *ShAmt = ConstantExpr::getZExt(Op1, TrOp->getType());
6914 Instruction *NSh = BinaryOperator::Create(I.getOpcode(), TrOp, ShAmt,
6916 InsertNewInstBefore(NSh, I); // (shift2 (shift1 & 0x00FF), c2)
6918 // For logical shifts, the truncation has the effect of making the high
6919 // part of the register be zeros. Emulate this by inserting an AND to
6920 // clear the top bits as needed. This 'and' will usually be zapped by
6921 // other xforms later if dead.
6922 unsigned SrcSize = TrOp->getType()->getPrimitiveSizeInBits();
6923 unsigned DstSize = TI->getType()->getPrimitiveSizeInBits();
6924 APInt MaskV(APInt::getLowBitsSet(SrcSize, DstSize));
6926 // The mask we constructed says what the trunc would do if occurring
6927 // between the shifts. We want to know the effect *after* the second
6928 // shift. We know that it is a logical shift by a constant, so adjust the
6929 // mask as appropriate.
6930 if (I.getOpcode() == Instruction::Shl)
6931 MaskV <<= Op1->getZExtValue();
6933 assert(I.getOpcode() == Instruction::LShr && "Unknown logical shift");
6934 MaskV = MaskV.lshr(Op1->getZExtValue());
6937 Instruction *And = BinaryOperator::CreateAnd(NSh, ConstantInt::get(MaskV),
6939 InsertNewInstBefore(And, I); // shift1 & 0x00FF
6941 // Return the value truncated to the interesting size.
6942 return new TruncInst(And, I.getType());
6946 if (Op0->hasOneUse()) {
6947 if (BinaryOperator *Op0BO = dyn_cast<BinaryOperator>(Op0)) {
6948 // Turn ((X >> C) + Y) << C -> (X + (Y << C)) & (~0 << C)
6951 switch (Op0BO->getOpcode()) {
6953 case Instruction::Add:
6954 case Instruction::And:
6955 case Instruction::Or:
6956 case Instruction::Xor: {
6957 // These operators commute.
6958 // Turn (Y + (X >> C)) << C -> (X + (Y << C)) & (~0 << C)
6959 if (isLeftShift && Op0BO->getOperand(1)->hasOneUse() &&
6960 match(Op0BO->getOperand(1),
6961 m_Shr(m_Value(V1), m_ConstantInt(CC))) && CC == Op1) {
6962 Instruction *YS = BinaryOperator::CreateShl(
6963 Op0BO->getOperand(0), Op1,
6965 InsertNewInstBefore(YS, I); // (Y << C)
6967 BinaryOperator::Create(Op0BO->getOpcode(), YS, V1,
6968 Op0BO->getOperand(1)->getName());
6969 InsertNewInstBefore(X, I); // (X + (Y << C))
6970 uint32_t Op1Val = Op1->getLimitedValue(TypeBits);
6971 return BinaryOperator::CreateAnd(X, ConstantInt::get(
6972 APInt::getHighBitsSet(TypeBits, TypeBits-Op1Val)));
6975 // Turn (Y + ((X >> C) & CC)) << C -> ((X & (CC << C)) + (Y << C))
6976 Value *Op0BOOp1 = Op0BO->getOperand(1);
6977 if (isLeftShift && Op0BOOp1->hasOneUse() &&
6979 m_And(m_Shr(m_Value(V1), m_Value(V2)),m_ConstantInt(CC))) &&
6980 cast<BinaryOperator>(Op0BOOp1)->getOperand(0)->hasOneUse() &&
6982 Instruction *YS = BinaryOperator::CreateShl(
6983 Op0BO->getOperand(0), Op1,
6985 InsertNewInstBefore(YS, I); // (Y << C)
6987 BinaryOperator::CreateAnd(V1, ConstantExpr::getShl(CC, Op1),
6988 V1->getName()+".mask");
6989 InsertNewInstBefore(XM, I); // X & (CC << C)
6991 return BinaryOperator::Create(Op0BO->getOpcode(), YS, XM);
6996 case Instruction::Sub: {
6997 // Turn ((X >> C) + Y) << C -> (X + (Y << C)) & (~0 << C)
6998 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() &&
6999 match(Op0BO->getOperand(0),
7000 m_Shr(m_Value(V1), m_ConstantInt(CC))) && CC == Op1) {
7001 Instruction *YS = BinaryOperator::CreateShl(
7002 Op0BO->getOperand(1), Op1,
7004 InsertNewInstBefore(YS, I); // (Y << C)
7006 BinaryOperator::Create(Op0BO->getOpcode(), V1, YS,
7007 Op0BO->getOperand(0)->getName());
7008 InsertNewInstBefore(X, I); // (X + (Y << C))
7009 uint32_t Op1Val = Op1->getLimitedValue(TypeBits);
7010 return BinaryOperator::CreateAnd(X, ConstantInt::get(
7011 APInt::getHighBitsSet(TypeBits, TypeBits-Op1Val)));
7014 // Turn (((X >> C)&CC) + Y) << C -> (X + (Y << C)) & (CC << C)
7015 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() &&
7016 match(Op0BO->getOperand(0),
7017 m_And(m_Shr(m_Value(V1), m_Value(V2)),
7018 m_ConstantInt(CC))) && V2 == Op1 &&
7019 cast<BinaryOperator>(Op0BO->getOperand(0))
7020 ->getOperand(0)->hasOneUse()) {
7021 Instruction *YS = BinaryOperator::CreateShl(
7022 Op0BO->getOperand(1), Op1,
7024 InsertNewInstBefore(YS, I); // (Y << C)
7026 BinaryOperator::CreateAnd(V1, ConstantExpr::getShl(CC, Op1),
7027 V1->getName()+".mask");
7028 InsertNewInstBefore(XM, I); // X & (CC << C)
7030 return BinaryOperator::Create(Op0BO->getOpcode(), XM, YS);
7038 // If the operand is an bitwise operator with a constant RHS, and the
7039 // shift is the only use, we can pull it out of the shift.
7040 if (ConstantInt *Op0C = dyn_cast<ConstantInt>(Op0BO->getOperand(1))) {
7041 bool isValid = true; // Valid only for And, Or, Xor
7042 bool highBitSet = false; // Transform if high bit of constant set?
7044 switch (Op0BO->getOpcode()) {
7045 default: isValid = false; break; // Do not perform transform!
7046 case Instruction::Add:
7047 isValid = isLeftShift;
7049 case Instruction::Or:
7050 case Instruction::Xor:
7053 case Instruction::And:
7058 // If this is a signed shift right, and the high bit is modified
7059 // by the logical operation, do not perform the transformation.
7060 // The highBitSet boolean indicates the value of the high bit of
7061 // the constant which would cause it to be modified for this
7064 if (isValid && I.getOpcode() == Instruction::AShr)
7065 isValid = Op0C->getValue()[TypeBits-1] == highBitSet;
7068 Constant *NewRHS = ConstantExpr::get(I.getOpcode(), Op0C, Op1);
7070 Instruction *NewShift =
7071 BinaryOperator::Create(I.getOpcode(), Op0BO->getOperand(0), Op1);
7072 InsertNewInstBefore(NewShift, I);
7073 NewShift->takeName(Op0BO);
7075 return BinaryOperator::Create(Op0BO->getOpcode(), NewShift,
7082 // Find out if this is a shift of a shift by a constant.
7083 BinaryOperator *ShiftOp = dyn_cast<BinaryOperator>(Op0);
7084 if (ShiftOp && !ShiftOp->isShift())
7087 if (ShiftOp && isa<ConstantInt>(ShiftOp->getOperand(1))) {
7088 ConstantInt *ShiftAmt1C = cast<ConstantInt>(ShiftOp->getOperand(1));
7089 uint32_t ShiftAmt1 = ShiftAmt1C->getLimitedValue(TypeBits);
7090 uint32_t ShiftAmt2 = Op1->getLimitedValue(TypeBits);
7091 assert(ShiftAmt2 != 0 && "Should have been simplified earlier");
7092 if (ShiftAmt1 == 0) return 0; // Will be simplified in the future.
7093 Value *X = ShiftOp->getOperand(0);
7095 uint32_t AmtSum = ShiftAmt1+ShiftAmt2; // Fold into one big shift.
7096 if (AmtSum > TypeBits)
7099 const IntegerType *Ty = cast<IntegerType>(I.getType());
7101 // Check for (X << c1) << c2 and (X >> c1) >> c2
7102 if (I.getOpcode() == ShiftOp->getOpcode()) {
7103 return BinaryOperator::Create(I.getOpcode(), X,
7104 ConstantInt::get(Ty, AmtSum));
7105 } else if (ShiftOp->getOpcode() == Instruction::LShr &&
7106 I.getOpcode() == Instruction::AShr) {
7107 // ((X >>u C1) >>s C2) -> (X >>u (C1+C2)) since C1 != 0.
7108 return BinaryOperator::CreateLShr(X, ConstantInt::get(Ty, AmtSum));
7109 } else if (ShiftOp->getOpcode() == Instruction::AShr &&
7110 I.getOpcode() == Instruction::LShr) {
7111 // ((X >>s C1) >>u C2) -> ((X >>s (C1+C2)) & mask) since C1 != 0.
7112 Instruction *Shift =
7113 BinaryOperator::CreateAShr(X, ConstantInt::get(Ty, AmtSum));
7114 InsertNewInstBefore(Shift, I);
7116 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt2));
7117 return BinaryOperator::CreateAnd(Shift, ConstantInt::get(Mask));
7120 // Okay, if we get here, one shift must be left, and the other shift must be
7121 // right. See if the amounts are equal.
7122 if (ShiftAmt1 == ShiftAmt2) {
7123 // If we have ((X >>? C) << C), turn this into X & (-1 << C).
7124 if (I.getOpcode() == Instruction::Shl) {
7125 APInt Mask(APInt::getHighBitsSet(TypeBits, TypeBits - ShiftAmt1));
7126 return BinaryOperator::CreateAnd(X, ConstantInt::get(Mask));
7128 // If we have ((X << C) >>u C), turn this into X & (-1 >>u C).
7129 if (I.getOpcode() == Instruction::LShr) {
7130 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt1));
7131 return BinaryOperator::CreateAnd(X, ConstantInt::get(Mask));
7133 // We can simplify ((X << C) >>s C) into a trunc + sext.
7134 // NOTE: we could do this for any C, but that would make 'unusual' integer
7135 // types. For now, just stick to ones well-supported by the code
7137 const Type *SExtType = 0;
7138 switch (Ty->getBitWidth() - ShiftAmt1) {
7145 SExtType = IntegerType::get(Ty->getBitWidth() - ShiftAmt1);
7150 Instruction *NewTrunc = new TruncInst(X, SExtType, "sext");
7151 InsertNewInstBefore(NewTrunc, I);
7152 return new SExtInst(NewTrunc, Ty);
7154 // Otherwise, we can't handle it yet.
7155 } else if (ShiftAmt1 < ShiftAmt2) {
7156 uint32_t ShiftDiff = ShiftAmt2-ShiftAmt1;
7158 // (X >>? C1) << C2 --> X << (C2-C1) & (-1 << C2)
7159 if (I.getOpcode() == Instruction::Shl) {
7160 assert(ShiftOp->getOpcode() == Instruction::LShr ||
7161 ShiftOp->getOpcode() == Instruction::AShr);
7162 Instruction *Shift =
7163 BinaryOperator::CreateShl(X, ConstantInt::get(Ty, ShiftDiff));
7164 InsertNewInstBefore(Shift, I);
7166 APInt Mask(APInt::getHighBitsSet(TypeBits, TypeBits - ShiftAmt2));
7167 return BinaryOperator::CreateAnd(Shift, ConstantInt::get(Mask));
7170 // (X << C1) >>u C2 --> X >>u (C2-C1) & (-1 >> C2)
7171 if (I.getOpcode() == Instruction::LShr) {
7172 assert(ShiftOp->getOpcode() == Instruction::Shl);
7173 Instruction *Shift =
7174 BinaryOperator::CreateLShr(X, ConstantInt::get(Ty, ShiftDiff));
7175 InsertNewInstBefore(Shift, I);
7177 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt2));
7178 return BinaryOperator::CreateAnd(Shift, ConstantInt::get(Mask));
7181 // We can't handle (X << C1) >>s C2, it shifts arbitrary bits in.
7183 assert(ShiftAmt2 < ShiftAmt1);
7184 uint32_t ShiftDiff = ShiftAmt1-ShiftAmt2;
7186 // (X >>? C1) << C2 --> X >>? (C1-C2) & (-1 << C2)
7187 if (I.getOpcode() == Instruction::Shl) {
7188 assert(ShiftOp->getOpcode() == Instruction::LShr ||
7189 ShiftOp->getOpcode() == Instruction::AShr);
7190 Instruction *Shift =
7191 BinaryOperator::Create(ShiftOp->getOpcode(), X,
7192 ConstantInt::get(Ty, ShiftDiff));
7193 InsertNewInstBefore(Shift, I);
7195 APInt Mask(APInt::getHighBitsSet(TypeBits, TypeBits - ShiftAmt2));
7196 return BinaryOperator::CreateAnd(Shift, ConstantInt::get(Mask));
7199 // (X << C1) >>u C2 --> X << (C1-C2) & (-1 >> C2)
7200 if (I.getOpcode() == Instruction::LShr) {
7201 assert(ShiftOp->getOpcode() == Instruction::Shl);
7202 Instruction *Shift =
7203 BinaryOperator::CreateShl(X, ConstantInt::get(Ty, ShiftDiff));
7204 InsertNewInstBefore(Shift, I);
7206 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt2));
7207 return BinaryOperator::CreateAnd(Shift, ConstantInt::get(Mask));
7210 // We can't handle (X << C1) >>a C2, it shifts arbitrary bits in.
7217 /// DecomposeSimpleLinearExpr - Analyze 'Val', seeing if it is a simple linear
7218 /// expression. If so, decompose it, returning some value X, such that Val is
7221 static Value *DecomposeSimpleLinearExpr(Value *Val, unsigned &Scale,
7223 assert(Val->getType() == Type::Int32Ty && "Unexpected allocation size type!");
7224 if (ConstantInt *CI = dyn_cast<ConstantInt>(Val)) {
7225 Offset = CI->getZExtValue();
7227 return ConstantInt::get(Type::Int32Ty, 0);
7228 } else if (BinaryOperator *I = dyn_cast<BinaryOperator>(Val)) {
7229 if (ConstantInt *RHS = dyn_cast<ConstantInt>(I->getOperand(1))) {
7230 if (I->getOpcode() == Instruction::Shl) {
7231 // This is a value scaled by '1 << the shift amt'.
7232 Scale = 1U << RHS->getZExtValue();
7234 return I->getOperand(0);
7235 } else if (I->getOpcode() == Instruction::Mul) {
7236 // This value is scaled by 'RHS'.
7237 Scale = RHS->getZExtValue();
7239 return I->getOperand(0);
7240 } else if (I->getOpcode() == Instruction::Add) {
7241 // We have X+C. Check to see if we really have (X*C2)+C1,
7242 // where C1 is divisible by C2.
7245 DecomposeSimpleLinearExpr(I->getOperand(0), SubScale, Offset);
7246 Offset += RHS->getZExtValue();
7253 // Otherwise, we can't look past this.
7260 /// PromoteCastOfAllocation - If we find a cast of an allocation instruction,
7261 /// try to eliminate the cast by moving the type information into the alloc.
7262 Instruction *InstCombiner::PromoteCastOfAllocation(BitCastInst &CI,
7263 AllocationInst &AI) {
7264 const PointerType *PTy = cast<PointerType>(CI.getType());
7266 // Remove any uses of AI that are dead.
7267 assert(!CI.use_empty() && "Dead instructions should be removed earlier!");
7269 for (Value::use_iterator UI = AI.use_begin(), E = AI.use_end(); UI != E; ) {
7270 Instruction *User = cast<Instruction>(*UI++);
7271 if (isInstructionTriviallyDead(User)) {
7272 while (UI != E && *UI == User)
7273 ++UI; // If this instruction uses AI more than once, don't break UI.
7276 DOUT << "IC: DCE: " << *User;
7277 EraseInstFromFunction(*User);
7281 // Get the type really allocated and the type casted to.
7282 const Type *AllocElTy = AI.getAllocatedType();
7283 const Type *CastElTy = PTy->getElementType();
7284 if (!AllocElTy->isSized() || !CastElTy->isSized()) return 0;
7286 unsigned AllocElTyAlign = TD->getABITypeAlignment(AllocElTy);
7287 unsigned CastElTyAlign = TD->getABITypeAlignment(CastElTy);
7288 if (CastElTyAlign < AllocElTyAlign) return 0;
7290 // If the allocation has multiple uses, only promote it if we are strictly
7291 // increasing the alignment of the resultant allocation. If we keep it the
7292 // same, we open the door to infinite loops of various kinds.
7293 if (!AI.hasOneUse() && CastElTyAlign == AllocElTyAlign) return 0;
7295 uint64_t AllocElTySize = TD->getABITypeSize(AllocElTy);
7296 uint64_t CastElTySize = TD->getABITypeSize(CastElTy);
7297 if (CastElTySize == 0 || AllocElTySize == 0) return 0;
7299 // See if we can satisfy the modulus by pulling a scale out of the array
7301 unsigned ArraySizeScale;
7303 Value *NumElements = // See if the array size is a decomposable linear expr.
7304 DecomposeSimpleLinearExpr(AI.getOperand(0), ArraySizeScale, ArrayOffset);
7306 // If we can now satisfy the modulus, by using a non-1 scale, we really can
7308 if ((AllocElTySize*ArraySizeScale) % CastElTySize != 0 ||
7309 (AllocElTySize*ArrayOffset ) % CastElTySize != 0) return 0;
7311 unsigned Scale = (AllocElTySize*ArraySizeScale)/CastElTySize;
7316 // If the allocation size is constant, form a constant mul expression
7317 Amt = ConstantInt::get(Type::Int32Ty, Scale);
7318 if (isa<ConstantInt>(NumElements))
7319 Amt = Multiply(cast<ConstantInt>(NumElements), cast<ConstantInt>(Amt));
7320 // otherwise multiply the amount and the number of elements
7321 else if (Scale != 1) {
7322 Instruction *Tmp = BinaryOperator::CreateMul(Amt, NumElements, "tmp");
7323 Amt = InsertNewInstBefore(Tmp, AI);
7327 if (int Offset = (AllocElTySize*ArrayOffset)/CastElTySize) {
7328 Value *Off = ConstantInt::get(Type::Int32Ty, Offset, true);
7329 Instruction *Tmp = BinaryOperator::CreateAdd(Amt, Off, "tmp");
7330 Amt = InsertNewInstBefore(Tmp, AI);
7333 AllocationInst *New;
7334 if (isa<MallocInst>(AI))
7335 New = new MallocInst(CastElTy, Amt, AI.getAlignment());
7337 New = new AllocaInst(CastElTy, Amt, AI.getAlignment());
7338 InsertNewInstBefore(New, AI);
7341 // If the allocation has multiple uses, insert a cast and change all things
7342 // that used it to use the new cast. This will also hack on CI, but it will
7344 if (!AI.hasOneUse()) {
7345 AddUsesToWorkList(AI);
7346 // New is the allocation instruction, pointer typed. AI is the original
7347 // allocation instruction, also pointer typed. Thus, cast to use is BitCast.
7348 CastInst *NewCast = new BitCastInst(New, AI.getType(), "tmpcast");
7349 InsertNewInstBefore(NewCast, AI);
7350 AI.replaceAllUsesWith(NewCast);
7352 return ReplaceInstUsesWith(CI, New);
7355 /// CanEvaluateInDifferentType - Return true if we can take the specified value
7356 /// and return it as type Ty without inserting any new casts and without
7357 /// changing the computed value. This is used by code that tries to decide
7358 /// whether promoting or shrinking integer operations to wider or smaller types
7359 /// will allow us to eliminate a truncate or extend.
7361 /// This is a truncation operation if Ty is smaller than V->getType(), or an
7362 /// extension operation if Ty is larger.
7364 /// If CastOpc is a truncation, then Ty will be a type smaller than V. We
7365 /// should return true if trunc(V) can be computed by computing V in the smaller
7366 /// type. If V is an instruction, then trunc(inst(x,y)) can be computed as
7367 /// inst(trunc(x),trunc(y)), which only makes sense if x and y can be
7368 /// efficiently truncated.
7370 /// If CastOpc is a sext or zext, we are asking if the low bits of the value can
7371 /// bit computed in a larger type, which is then and'd or sext_in_reg'd to get
7372 /// the final result.
7373 bool InstCombiner::CanEvaluateInDifferentType(Value *V, const IntegerType *Ty,
7375 int &NumCastsRemoved) {
7376 // We can always evaluate constants in another type.
7377 if (isa<ConstantInt>(V))
7380 Instruction *I = dyn_cast<Instruction>(V);
7381 if (!I) return false;
7383 const IntegerType *OrigTy = cast<IntegerType>(V->getType());
7385 // If this is an extension or truncate, we can often eliminate it.
7386 if (isa<TruncInst>(I) || isa<ZExtInst>(I) || isa<SExtInst>(I)) {
7387 // If this is a cast from the destination type, we can trivially eliminate
7388 // it, and this will remove a cast overall.
7389 if (I->getOperand(0)->getType() == Ty) {
7390 // If the first operand is itself a cast, and is eliminable, do not count
7391 // this as an eliminable cast. We would prefer to eliminate those two
7393 if (!isa<CastInst>(I->getOperand(0)) && I->hasOneUse())
7399 // We can't extend or shrink something that has multiple uses: doing so would
7400 // require duplicating the instruction in general, which isn't profitable.
7401 if (!I->hasOneUse()) return false;
7403 switch (I->getOpcode()) {
7404 case Instruction::Add:
7405 case Instruction::Sub:
7406 case Instruction::Mul:
7407 case Instruction::And:
7408 case Instruction::Or:
7409 case Instruction::Xor:
7410 // These operators can all arbitrarily be extended or truncated.
7411 return CanEvaluateInDifferentType(I->getOperand(0), Ty, CastOpc,
7413 CanEvaluateInDifferentType(I->getOperand(1), Ty, CastOpc,
7416 case Instruction::Shl:
7417 // If we are truncating the result of this SHL, and if it's a shift of a
7418 // constant amount, we can always perform a SHL in a smaller type.
7419 if (ConstantInt *CI = dyn_cast<ConstantInt>(I->getOperand(1))) {
7420 uint32_t BitWidth = Ty->getBitWidth();
7421 if (BitWidth < OrigTy->getBitWidth() &&
7422 CI->getLimitedValue(BitWidth) < BitWidth)
7423 return CanEvaluateInDifferentType(I->getOperand(0), Ty, CastOpc,
7427 case Instruction::LShr:
7428 // If this is a truncate of a logical shr, we can truncate it to a smaller
7429 // lshr iff we know that the bits we would otherwise be shifting in are
7431 if (ConstantInt *CI = dyn_cast<ConstantInt>(I->getOperand(1))) {
7432 uint32_t OrigBitWidth = OrigTy->getBitWidth();
7433 uint32_t BitWidth = Ty->getBitWidth();
7434 if (BitWidth < OrigBitWidth &&
7435 MaskedValueIsZero(I->getOperand(0),
7436 APInt::getHighBitsSet(OrigBitWidth, OrigBitWidth-BitWidth)) &&
7437 CI->getLimitedValue(BitWidth) < BitWidth) {
7438 return CanEvaluateInDifferentType(I->getOperand(0), Ty, CastOpc,
7443 case Instruction::ZExt:
7444 case Instruction::SExt:
7445 case Instruction::Trunc:
7446 // If this is the same kind of case as our original (e.g. zext+zext), we
7447 // can safely replace it. Note that replacing it does not reduce the number
7448 // of casts in the input.
7449 if (I->getOpcode() == CastOpc)
7452 case Instruction::Select: {
7453 SelectInst *SI = cast<SelectInst>(I);
7454 return CanEvaluateInDifferentType(SI->getTrueValue(), Ty, CastOpc,
7456 CanEvaluateInDifferentType(SI->getFalseValue(), Ty, CastOpc,
7459 case Instruction::PHI: {
7460 // We can change a phi if we can change all operands.
7461 PHINode *PN = cast<PHINode>(I);
7462 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
7463 if (!CanEvaluateInDifferentType(PN->getIncomingValue(i), Ty, CastOpc,
7469 // TODO: Can handle more cases here.
7476 /// EvaluateInDifferentType - Given an expression that
7477 /// CanEvaluateInDifferentType returns true for, actually insert the code to
7478 /// evaluate the expression.
7479 Value *InstCombiner::EvaluateInDifferentType(Value *V, const Type *Ty,
7481 if (Constant *C = dyn_cast<Constant>(V))
7482 return ConstantExpr::getIntegerCast(C, Ty, isSigned /*Sext or ZExt*/);
7484 // Otherwise, it must be an instruction.
7485 Instruction *I = cast<Instruction>(V);
7486 Instruction *Res = 0;
7487 switch (I->getOpcode()) {
7488 case Instruction::Add:
7489 case Instruction::Sub:
7490 case Instruction::Mul:
7491 case Instruction::And:
7492 case Instruction::Or:
7493 case Instruction::Xor:
7494 case Instruction::AShr:
7495 case Instruction::LShr:
7496 case Instruction::Shl: {
7497 Value *LHS = EvaluateInDifferentType(I->getOperand(0), Ty, isSigned);
7498 Value *RHS = EvaluateInDifferentType(I->getOperand(1), Ty, isSigned);
7499 Res = BinaryOperator::Create((Instruction::BinaryOps)I->getOpcode(),
7503 case Instruction::Trunc:
7504 case Instruction::ZExt:
7505 case Instruction::SExt:
7506 // If the source type of the cast is the type we're trying for then we can
7507 // just return the source. There's no need to insert it because it is not
7509 if (I->getOperand(0)->getType() == Ty)
7510 return I->getOperand(0);
7512 // Otherwise, must be the same type of cast, so just reinsert a new one.
7513 Res = CastInst::Create(cast<CastInst>(I)->getOpcode(), I->getOperand(0),
7516 case Instruction::Select: {
7517 Value *True = EvaluateInDifferentType(I->getOperand(1), Ty, isSigned);
7518 Value *False = EvaluateInDifferentType(I->getOperand(2), Ty, isSigned);
7519 Res = SelectInst::Create(I->getOperand(0), True, False);
7522 case Instruction::PHI: {
7523 PHINode *OPN = cast<PHINode>(I);
7524 PHINode *NPN = PHINode::Create(Ty);
7525 for (unsigned i = 0, e = OPN->getNumIncomingValues(); i != e; ++i) {
7526 Value *V =EvaluateInDifferentType(OPN->getIncomingValue(i), Ty, isSigned);
7527 NPN->addIncoming(V, OPN->getIncomingBlock(i));
7533 // TODO: Can handle more cases here.
7534 assert(0 && "Unreachable!");
7539 return InsertNewInstBefore(Res, *I);
7542 /// @brief Implement the transforms common to all CastInst visitors.
7543 Instruction *InstCombiner::commonCastTransforms(CastInst &CI) {
7544 Value *Src = CI.getOperand(0);
7546 // Many cases of "cast of a cast" are eliminable. If it's eliminable we just
7547 // eliminate it now.
7548 if (CastInst *CSrc = dyn_cast<CastInst>(Src)) { // A->B->C cast
7549 if (Instruction::CastOps opc =
7550 isEliminableCastPair(CSrc, CI.getOpcode(), CI.getType(), TD)) {
7551 // The first cast (CSrc) is eliminable so we need to fix up or replace
7552 // the second cast (CI). CSrc will then have a good chance of being dead.
7553 return CastInst::Create(opc, CSrc->getOperand(0), CI.getType());
7557 // If we are casting a select then fold the cast into the select
7558 if (SelectInst *SI = dyn_cast<SelectInst>(Src))
7559 if (Instruction *NV = FoldOpIntoSelect(CI, SI, this))
7562 // If we are casting a PHI then fold the cast into the PHI
7563 if (isa<PHINode>(Src))
7564 if (Instruction *NV = FoldOpIntoPhi(CI))
7570 /// @brief Implement the transforms for cast of pointer (bitcast/ptrtoint)
7571 Instruction *InstCombiner::commonPointerCastTransforms(CastInst &CI) {
7572 Value *Src = CI.getOperand(0);
7574 if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Src)) {
7575 // If casting the result of a getelementptr instruction with no offset, turn
7576 // this into a cast of the original pointer!
7577 if (GEP->hasAllZeroIndices()) {
7578 // Changing the cast operand is usually not a good idea but it is safe
7579 // here because the pointer operand is being replaced with another
7580 // pointer operand so the opcode doesn't need to change.
7582 CI.setOperand(0, GEP->getOperand(0));
7586 // If the GEP has a single use, and the base pointer is a bitcast, and the
7587 // GEP computes a constant offset, see if we can convert these three
7588 // instructions into fewer. This typically happens with unions and other
7589 // non-type-safe code.
7590 if (GEP->hasOneUse() && isa<BitCastInst>(GEP->getOperand(0))) {
7591 if (GEP->hasAllConstantIndices()) {
7592 // We are guaranteed to get a constant from EmitGEPOffset.
7593 ConstantInt *OffsetV = cast<ConstantInt>(EmitGEPOffset(GEP, CI, *this));
7594 int64_t Offset = OffsetV->getSExtValue();
7596 // Get the base pointer input of the bitcast, and the type it points to.
7597 Value *OrigBase = cast<BitCastInst>(GEP->getOperand(0))->getOperand(0);
7598 const Type *GEPIdxTy =
7599 cast<PointerType>(OrigBase->getType())->getElementType();
7600 if (GEPIdxTy->isSized()) {
7601 SmallVector<Value*, 8> NewIndices;
7603 // Start with the index over the outer type. Note that the type size
7604 // might be zero (even if the offset isn't zero) if the indexed type
7605 // is something like [0 x {int, int}]
7606 const Type *IntPtrTy = TD->getIntPtrType();
7607 int64_t FirstIdx = 0;
7608 if (int64_t TySize = TD->getABITypeSize(GEPIdxTy)) {
7609 FirstIdx = Offset/TySize;
7612 // Handle silly modulus not returning values values [0..TySize).
7616 assert(Offset >= 0);
7618 assert((uint64_t)Offset < (uint64_t)TySize &&"Out of range offset");
7621 NewIndices.push_back(ConstantInt::get(IntPtrTy, FirstIdx));
7623 // Index into the types. If we fail, set OrigBase to null.
7625 if (const StructType *STy = dyn_cast<StructType>(GEPIdxTy)) {
7626 const StructLayout *SL = TD->getStructLayout(STy);
7627 if (Offset < (int64_t)SL->getSizeInBytes()) {
7628 unsigned Elt = SL->getElementContainingOffset(Offset);
7629 NewIndices.push_back(ConstantInt::get(Type::Int32Ty, Elt));
7631 Offset -= SL->getElementOffset(Elt);
7632 GEPIdxTy = STy->getElementType(Elt);
7634 // Otherwise, we can't index into this, bail out.
7638 } else if (isa<ArrayType>(GEPIdxTy) || isa<VectorType>(GEPIdxTy)) {
7639 const SequentialType *STy = cast<SequentialType>(GEPIdxTy);
7640 if (uint64_t EltSize = TD->getABITypeSize(STy->getElementType())){
7641 NewIndices.push_back(ConstantInt::get(IntPtrTy,Offset/EltSize));
7644 NewIndices.push_back(ConstantInt::get(IntPtrTy, 0));
7646 GEPIdxTy = STy->getElementType();
7648 // Otherwise, we can't index into this, bail out.
7654 // If we were able to index down into an element, create the GEP
7655 // and bitcast the result. This eliminates one bitcast, potentially
7657 Instruction *NGEP = GetElementPtrInst::Create(OrigBase,
7659 NewIndices.end(), "");
7660 InsertNewInstBefore(NGEP, CI);
7661 NGEP->takeName(GEP);
7663 if (isa<BitCastInst>(CI))
7664 return new BitCastInst(NGEP, CI.getType());
7665 assert(isa<PtrToIntInst>(CI));
7666 return new PtrToIntInst(NGEP, CI.getType());
7673 return commonCastTransforms(CI);
7678 /// Only the TRUNC, ZEXT, SEXT, and BITCAST can both operand and result as
7679 /// integer types. This function implements the common transforms for all those
7681 /// @brief Implement the transforms common to CastInst with integer operands
7682 Instruction *InstCombiner::commonIntCastTransforms(CastInst &CI) {
7683 if (Instruction *Result = commonCastTransforms(CI))
7686 Value *Src = CI.getOperand(0);
7687 const Type *SrcTy = Src->getType();
7688 const Type *DestTy = CI.getType();
7689 uint32_t SrcBitSize = SrcTy->getPrimitiveSizeInBits();
7690 uint32_t DestBitSize = DestTy->getPrimitiveSizeInBits();
7692 // See if we can simplify any instructions used by the LHS whose sole
7693 // purpose is to compute bits we don't care about.
7694 APInt KnownZero(DestBitSize, 0), KnownOne(DestBitSize, 0);
7695 if (SimplifyDemandedBits(&CI, APInt::getAllOnesValue(DestBitSize),
7696 KnownZero, KnownOne))
7699 // If the source isn't an instruction or has more than one use then we
7700 // can't do anything more.
7701 Instruction *SrcI = dyn_cast<Instruction>(Src);
7702 if (!SrcI || !Src->hasOneUse())
7705 // Attempt to propagate the cast into the instruction for int->int casts.
7706 int NumCastsRemoved = 0;
7707 if (!isa<BitCastInst>(CI) &&
7708 CanEvaluateInDifferentType(SrcI, cast<IntegerType>(DestTy),
7709 CI.getOpcode(), NumCastsRemoved)) {
7710 // If this cast is a truncate, evaluting in a different type always
7711 // eliminates the cast, so it is always a win. If this is a zero-extension,
7712 // we need to do an AND to maintain the clear top-part of the computation,
7713 // so we require that the input have eliminated at least one cast. If this
7714 // is a sign extension, we insert two new casts (to do the extension) so we
7715 // require that two casts have been eliminated.
7717 switch (CI.getOpcode()) {
7719 // All the others use floating point so we shouldn't actually
7720 // get here because of the check above.
7721 assert(0 && "Unknown cast type");
7722 case Instruction::Trunc:
7725 case Instruction::ZExt:
7726 DoXForm = NumCastsRemoved >= 1;
7728 case Instruction::SExt:
7729 DoXForm = NumCastsRemoved >= 2;
7734 Value *Res = EvaluateInDifferentType(SrcI, DestTy,
7735 CI.getOpcode() == Instruction::SExt);
7736 assert(Res->getType() == DestTy);
7737 switch (CI.getOpcode()) {
7738 default: assert(0 && "Unknown cast type!");
7739 case Instruction::Trunc:
7740 case Instruction::BitCast:
7741 // Just replace this cast with the result.
7742 return ReplaceInstUsesWith(CI, Res);
7743 case Instruction::ZExt: {
7744 // We need to emit an AND to clear the high bits.
7745 assert(SrcBitSize < DestBitSize && "Not a zext?");
7746 Constant *C = ConstantInt::get(APInt::getLowBitsSet(DestBitSize,
7748 return BinaryOperator::CreateAnd(Res, C);
7750 case Instruction::SExt:
7751 // We need to emit a cast to truncate, then a cast to sext.
7752 return CastInst::Create(Instruction::SExt,
7753 InsertCastBefore(Instruction::Trunc, Res, Src->getType(),
7759 Value *Op0 = SrcI->getNumOperands() > 0 ? SrcI->getOperand(0) : 0;
7760 Value *Op1 = SrcI->getNumOperands() > 1 ? SrcI->getOperand(1) : 0;
7762 switch (SrcI->getOpcode()) {
7763 case Instruction::Add:
7764 case Instruction::Mul:
7765 case Instruction::And:
7766 case Instruction::Or:
7767 case Instruction::Xor:
7768 // If we are discarding information, rewrite.
7769 if (DestBitSize <= SrcBitSize && DestBitSize != 1) {
7770 // Don't insert two casts if they cannot be eliminated. We allow
7771 // two casts to be inserted if the sizes are the same. This could
7772 // only be converting signedness, which is a noop.
7773 if (DestBitSize == SrcBitSize ||
7774 !ValueRequiresCast(CI.getOpcode(), Op1, DestTy,TD) ||
7775 !ValueRequiresCast(CI.getOpcode(), Op0, DestTy, TD)) {
7776 Instruction::CastOps opcode = CI.getOpcode();
7777 Value *Op0c = InsertOperandCastBefore(opcode, Op0, DestTy, SrcI);
7778 Value *Op1c = InsertOperandCastBefore(opcode, Op1, DestTy, SrcI);
7779 return BinaryOperator::Create(
7780 cast<BinaryOperator>(SrcI)->getOpcode(), Op0c, Op1c);
7784 // cast (xor bool X, true) to int --> xor (cast bool X to int), 1
7785 if (isa<ZExtInst>(CI) && SrcBitSize == 1 &&
7786 SrcI->getOpcode() == Instruction::Xor &&
7787 Op1 == ConstantInt::getTrue() &&
7788 (!Op0->hasOneUse() || !isa<CmpInst>(Op0))) {
7789 Value *New = InsertOperandCastBefore(Instruction::ZExt, Op0, DestTy, &CI);
7790 return BinaryOperator::CreateXor(New, ConstantInt::get(CI.getType(), 1));
7793 case Instruction::SDiv:
7794 case Instruction::UDiv:
7795 case Instruction::SRem:
7796 case Instruction::URem:
7797 // If we are just changing the sign, rewrite.
7798 if (DestBitSize == SrcBitSize) {
7799 // Don't insert two casts if they cannot be eliminated. We allow
7800 // two casts to be inserted if the sizes are the same. This could
7801 // only be converting signedness, which is a noop.
7802 if (!ValueRequiresCast(CI.getOpcode(), Op1, DestTy, TD) ||
7803 !ValueRequiresCast(CI.getOpcode(), Op0, DestTy, TD)) {
7804 Value *Op0c = InsertOperandCastBefore(Instruction::BitCast,
7806 Value *Op1c = InsertOperandCastBefore(Instruction::BitCast,
7808 return BinaryOperator::Create(
7809 cast<BinaryOperator>(SrcI)->getOpcode(), Op0c, Op1c);
7814 case Instruction::Shl:
7815 // Allow changing the sign of the source operand. Do not allow
7816 // changing the size of the shift, UNLESS the shift amount is a
7817 // constant. We must not change variable sized shifts to a smaller
7818 // size, because it is undefined to shift more bits out than exist
7820 if (DestBitSize == SrcBitSize ||
7821 (DestBitSize < SrcBitSize && isa<Constant>(Op1))) {
7822 Instruction::CastOps opcode = (DestBitSize == SrcBitSize ?
7823 Instruction::BitCast : Instruction::Trunc);
7824 Value *Op0c = InsertOperandCastBefore(opcode, Op0, DestTy, SrcI);
7825 Value *Op1c = InsertOperandCastBefore(opcode, Op1, DestTy, SrcI);
7826 return BinaryOperator::CreateShl(Op0c, Op1c);
7829 case Instruction::AShr:
7830 // If this is a signed shr, and if all bits shifted in are about to be
7831 // truncated off, turn it into an unsigned shr to allow greater
7833 if (DestBitSize < SrcBitSize &&
7834 isa<ConstantInt>(Op1)) {
7835 uint32_t ShiftAmt = cast<ConstantInt>(Op1)->getLimitedValue(SrcBitSize);
7836 if (SrcBitSize > ShiftAmt && SrcBitSize-ShiftAmt >= DestBitSize) {
7837 // Insert the new logical shift right.
7838 return BinaryOperator::CreateLShr(Op0, Op1);
7846 Instruction *InstCombiner::visitTrunc(TruncInst &CI) {
7847 if (Instruction *Result = commonIntCastTransforms(CI))
7850 Value *Src = CI.getOperand(0);
7851 const Type *Ty = CI.getType();
7852 uint32_t DestBitWidth = Ty->getPrimitiveSizeInBits();
7853 uint32_t SrcBitWidth = cast<IntegerType>(Src->getType())->getBitWidth();
7855 if (Instruction *SrcI = dyn_cast<Instruction>(Src)) {
7856 switch (SrcI->getOpcode()) {
7858 case Instruction::LShr:
7859 // We can shrink lshr to something smaller if we know the bits shifted in
7860 // are already zeros.
7861 if (ConstantInt *ShAmtV = dyn_cast<ConstantInt>(SrcI->getOperand(1))) {
7862 uint32_t ShAmt = ShAmtV->getLimitedValue(SrcBitWidth);
7864 // Get a mask for the bits shifting in.
7865 APInt Mask(APInt::getLowBitsSet(SrcBitWidth, ShAmt).shl(DestBitWidth));
7866 Value* SrcIOp0 = SrcI->getOperand(0);
7867 if (SrcI->hasOneUse() && MaskedValueIsZero(SrcIOp0, Mask)) {
7868 if (ShAmt >= DestBitWidth) // All zeros.
7869 return ReplaceInstUsesWith(CI, Constant::getNullValue(Ty));
7871 // Okay, we can shrink this. Truncate the input, then return a new
7873 Value *V1 = InsertCastBefore(Instruction::Trunc, SrcIOp0, Ty, CI);
7874 Value *V2 = InsertCastBefore(Instruction::Trunc, SrcI->getOperand(1),
7876 return BinaryOperator::CreateLShr(V1, V2);
7878 } else { // This is a variable shr.
7880 // Turn 'trunc (lshr X, Y) to bool' into '(X & (1 << Y)) != 0'. This is
7881 // more LLVM instructions, but allows '1 << Y' to be hoisted if
7882 // loop-invariant and CSE'd.
7883 if (CI.getType() == Type::Int1Ty && SrcI->hasOneUse()) {
7884 Value *One = ConstantInt::get(SrcI->getType(), 1);
7886 Value *V = InsertNewInstBefore(
7887 BinaryOperator::CreateShl(One, SrcI->getOperand(1),
7889 V = InsertNewInstBefore(BinaryOperator::CreateAnd(V,
7890 SrcI->getOperand(0),
7892 Value *Zero = Constant::getNullValue(V->getType());
7893 return new ICmpInst(ICmpInst::ICMP_NE, V, Zero);
7903 /// transformZExtICmp - Transform (zext icmp) to bitwise / integer operations
7904 /// in order to eliminate the icmp.
7905 Instruction *InstCombiner::transformZExtICmp(ICmpInst *ICI, Instruction &CI,
7907 // If we are just checking for a icmp eq of a single bit and zext'ing it
7908 // to an integer, then shift the bit to the appropriate place and then
7909 // cast to integer to avoid the comparison.
7910 if (ConstantInt *Op1C = dyn_cast<ConstantInt>(ICI->getOperand(1))) {
7911 const APInt &Op1CV = Op1C->getValue();
7913 // zext (x <s 0) to i32 --> x>>u31 true if signbit set.
7914 // zext (x >s -1) to i32 --> (x>>u31)^1 true if signbit clear.
7915 if ((ICI->getPredicate() == ICmpInst::ICMP_SLT && Op1CV == 0) ||
7916 (ICI->getPredicate() == ICmpInst::ICMP_SGT &&Op1CV.isAllOnesValue())) {
7917 if (!DoXform) return ICI;
7919 Value *In = ICI->getOperand(0);
7920 Value *Sh = ConstantInt::get(In->getType(),
7921 In->getType()->getPrimitiveSizeInBits()-1);
7922 In = InsertNewInstBefore(BinaryOperator::CreateLShr(In, Sh,
7923 In->getName()+".lobit"),
7925 if (In->getType() != CI.getType())
7926 In = CastInst::CreateIntegerCast(In, CI.getType(),
7927 false/*ZExt*/, "tmp", &CI);
7929 if (ICI->getPredicate() == ICmpInst::ICMP_SGT) {
7930 Constant *One = ConstantInt::get(In->getType(), 1);
7931 In = InsertNewInstBefore(BinaryOperator::CreateXor(In, One,
7932 In->getName()+".not"),
7936 return ReplaceInstUsesWith(CI, In);
7941 // zext (X == 0) to i32 --> X^1 iff X has only the low bit set.
7942 // zext (X == 0) to i32 --> (X>>1)^1 iff X has only the 2nd bit set.
7943 // zext (X == 1) to i32 --> X iff X has only the low bit set.
7944 // zext (X == 2) to i32 --> X>>1 iff X has only the 2nd bit set.
7945 // zext (X != 0) to i32 --> X iff X has only the low bit set.
7946 // zext (X != 0) to i32 --> X>>1 iff X has only the 2nd bit set.
7947 // zext (X != 1) to i32 --> X^1 iff X has only the low bit set.
7948 // zext (X != 2) to i32 --> (X>>1)^1 iff X has only the 2nd bit set.
7949 if ((Op1CV == 0 || Op1CV.isPowerOf2()) &&
7950 // This only works for EQ and NE
7951 ICI->isEquality()) {
7952 // If Op1C some other power of two, convert:
7953 uint32_t BitWidth = Op1C->getType()->getBitWidth();
7954 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
7955 APInt TypeMask(APInt::getAllOnesValue(BitWidth));
7956 ComputeMaskedBits(ICI->getOperand(0), TypeMask, KnownZero, KnownOne);
7958 APInt KnownZeroMask(~KnownZero);
7959 if (KnownZeroMask.isPowerOf2()) { // Exactly 1 possible 1?
7960 if (!DoXform) return ICI;
7962 bool isNE = ICI->getPredicate() == ICmpInst::ICMP_NE;
7963 if (Op1CV != 0 && (Op1CV != KnownZeroMask)) {
7964 // (X&4) == 2 --> false
7965 // (X&4) != 2 --> true
7966 Constant *Res = ConstantInt::get(Type::Int1Ty, isNE);
7967 Res = ConstantExpr::getZExt(Res, CI.getType());
7968 return ReplaceInstUsesWith(CI, Res);
7971 uint32_t ShiftAmt = KnownZeroMask.logBase2();
7972 Value *In = ICI->getOperand(0);
7974 // Perform a logical shr by shiftamt.
7975 // Insert the shift to put the result in the low bit.
7976 In = InsertNewInstBefore(BinaryOperator::CreateLShr(In,
7977 ConstantInt::get(In->getType(), ShiftAmt),
7978 In->getName()+".lobit"), CI);
7981 if ((Op1CV != 0) == isNE) { // Toggle the low bit.
7982 Constant *One = ConstantInt::get(In->getType(), 1);
7983 In = BinaryOperator::CreateXor(In, One, "tmp");
7984 InsertNewInstBefore(cast<Instruction>(In), CI);
7987 if (CI.getType() == In->getType())
7988 return ReplaceInstUsesWith(CI, In);
7990 return CastInst::CreateIntegerCast(In, CI.getType(), false/*ZExt*/);
7998 Instruction *InstCombiner::visitZExt(ZExtInst &CI) {
7999 // If one of the common conversion will work ..
8000 if (Instruction *Result = commonIntCastTransforms(CI))
8003 Value *Src = CI.getOperand(0);
8005 // If this is a cast of a cast
8006 if (CastInst *CSrc = dyn_cast<CastInst>(Src)) { // A->B->C cast
8007 // If this is a TRUNC followed by a ZEXT then we are dealing with integral
8008 // types and if the sizes are just right we can convert this into a logical
8009 // 'and' which will be much cheaper than the pair of casts.
8010 if (isa<TruncInst>(CSrc)) {
8011 // Get the sizes of the types involved
8012 Value *A = CSrc->getOperand(0);
8013 uint32_t SrcSize = A->getType()->getPrimitiveSizeInBits();
8014 uint32_t MidSize = CSrc->getType()->getPrimitiveSizeInBits();
8015 uint32_t DstSize = CI.getType()->getPrimitiveSizeInBits();
8016 // If we're actually extending zero bits and the trunc is a no-op
8017 if (MidSize < DstSize && SrcSize == DstSize) {
8018 // Replace both of the casts with an And of the type mask.
8019 APInt AndValue(APInt::getLowBitsSet(SrcSize, MidSize));
8020 Constant *AndConst = ConstantInt::get(AndValue);
8022 BinaryOperator::CreateAnd(CSrc->getOperand(0), AndConst);
8023 // Unfortunately, if the type changed, we need to cast it back.
8024 if (And->getType() != CI.getType()) {
8025 And->setName(CSrc->getName()+".mask");
8026 InsertNewInstBefore(And, CI);
8027 And = CastInst::CreateIntegerCast(And, CI.getType(), false/*ZExt*/);
8034 if (ICmpInst *ICI = dyn_cast<ICmpInst>(Src))
8035 return transformZExtICmp(ICI, CI);
8037 BinaryOperator *SrcI = dyn_cast<BinaryOperator>(Src);
8038 if (SrcI && SrcI->getOpcode() == Instruction::Or) {
8039 // zext (or icmp, icmp) --> or (zext icmp), (zext icmp) if at least one
8040 // of the (zext icmp) will be transformed.
8041 ICmpInst *LHS = dyn_cast<ICmpInst>(SrcI->getOperand(0));
8042 ICmpInst *RHS = dyn_cast<ICmpInst>(SrcI->getOperand(1));
8043 if (LHS && RHS && LHS->hasOneUse() && RHS->hasOneUse() &&
8044 (transformZExtICmp(LHS, CI, false) ||
8045 transformZExtICmp(RHS, CI, false))) {
8046 Value *LCast = InsertCastBefore(Instruction::ZExt, LHS, CI.getType(), CI);
8047 Value *RCast = InsertCastBefore(Instruction::ZExt, RHS, CI.getType(), CI);
8048 return BinaryOperator::Create(Instruction::Or, LCast, RCast);
8055 Instruction *InstCombiner::visitSExt(SExtInst &CI) {
8056 if (Instruction *I = commonIntCastTransforms(CI))
8059 Value *Src = CI.getOperand(0);
8061 // Canonicalize sign-extend from i1 to a select.
8062 if (Src->getType() == Type::Int1Ty)
8063 return SelectInst::Create(Src,
8064 ConstantInt::getAllOnesValue(CI.getType()),
8065 Constant::getNullValue(CI.getType()));
8067 // See if the value being truncated is already sign extended. If so, just
8068 // eliminate the trunc/sext pair.
8069 if (getOpcode(Src) == Instruction::Trunc) {
8070 Value *Op = cast<User>(Src)->getOperand(0);
8071 unsigned OpBits = cast<IntegerType>(Op->getType())->getBitWidth();
8072 unsigned MidBits = cast<IntegerType>(Src->getType())->getBitWidth();
8073 unsigned DestBits = cast<IntegerType>(CI.getType())->getBitWidth();
8074 unsigned NumSignBits = ComputeNumSignBits(Op);
8076 if (OpBits == DestBits) {
8077 // Op is i32, Mid is i8, and Dest is i32. If Op has more than 24 sign
8078 // bits, it is already ready.
8079 if (NumSignBits > DestBits-MidBits)
8080 return ReplaceInstUsesWith(CI, Op);
8081 } else if (OpBits < DestBits) {
8082 // Op is i32, Mid is i8, and Dest is i64. If Op has more than 24 sign
8083 // bits, just sext from i32.
8084 if (NumSignBits > OpBits-MidBits)
8085 return new SExtInst(Op, CI.getType(), "tmp");
8087 // Op is i64, Mid is i8, and Dest is i32. If Op has more than 56 sign
8088 // bits, just truncate to i32.
8089 if (NumSignBits > OpBits-MidBits)
8090 return new TruncInst(Op, CI.getType(), "tmp");
8094 // If the input is a shl/ashr pair of a same constant, then this is a sign
8095 // extension from a smaller value. If we could trust arbitrary bitwidth
8096 // integers, we could turn this into a truncate to the smaller bit and then
8097 // use a sext for the whole extension. Since we don't, look deeper and check
8098 // for a truncate. If the source and dest are the same type, eliminate the
8099 // trunc and extend and just do shifts. For example, turn:
8100 // %a = trunc i32 %i to i8
8101 // %b = shl i8 %a, 6
8102 // %c = ashr i8 %b, 6
8103 // %d = sext i8 %c to i32
8105 // %a = shl i32 %i, 30
8106 // %d = ashr i32 %a, 30
8108 ConstantInt *BA = 0, *CA = 0;
8109 if (match(Src, m_AShr(m_Shl(m_Value(A), m_ConstantInt(BA)),
8110 m_ConstantInt(CA))) &&
8111 BA == CA && isa<TruncInst>(A)) {
8112 Value *I = cast<TruncInst>(A)->getOperand(0);
8113 if (I->getType() == CI.getType()) {
8114 unsigned MidSize = Src->getType()->getPrimitiveSizeInBits();
8115 unsigned SrcDstSize = CI.getType()->getPrimitiveSizeInBits();
8116 unsigned ShAmt = CA->getZExtValue()+SrcDstSize-MidSize;
8117 Constant *ShAmtV = ConstantInt::get(CI.getType(), ShAmt);
8118 I = InsertNewInstBefore(BinaryOperator::CreateShl(I, ShAmtV,
8120 return BinaryOperator::CreateAShr(I, ShAmtV);
8127 /// FitsInFPType - Return a Constant* for the specified FP constant if it fits
8128 /// in the specified FP type without changing its value.
8129 static Constant *FitsInFPType(ConstantFP *CFP, const fltSemantics &Sem) {
8131 APFloat F = CFP->getValueAPF();
8132 (void)F.convert(Sem, APFloat::rmNearestTiesToEven, &losesInfo);
8134 return ConstantFP::get(F);
8138 /// LookThroughFPExtensions - If this is an fp extension instruction, look
8139 /// through it until we get the source value.
8140 static Value *LookThroughFPExtensions(Value *V) {
8141 if (Instruction *I = dyn_cast<Instruction>(V))
8142 if (I->getOpcode() == Instruction::FPExt)
8143 return LookThroughFPExtensions(I->getOperand(0));
8145 // If this value is a constant, return the constant in the smallest FP type
8146 // that can accurately represent it. This allows us to turn
8147 // (float)((double)X+2.0) into x+2.0f.
8148 if (ConstantFP *CFP = dyn_cast<ConstantFP>(V)) {
8149 if (CFP->getType() == Type::PPC_FP128Ty)
8150 return V; // No constant folding of this.
8151 // See if the value can be truncated to float and then reextended.
8152 if (Value *V = FitsInFPType(CFP, APFloat::IEEEsingle))
8154 if (CFP->getType() == Type::DoubleTy)
8155 return V; // Won't shrink.
8156 if (Value *V = FitsInFPType(CFP, APFloat::IEEEdouble))
8158 // Don't try to shrink to various long double types.
8164 Instruction *InstCombiner::visitFPTrunc(FPTruncInst &CI) {
8165 if (Instruction *I = commonCastTransforms(CI))
8168 // If we have fptrunc(add (fpextend x), (fpextend y)), where x and y are
8169 // smaller than the destination type, we can eliminate the truncate by doing
8170 // the add as the smaller type. This applies to add/sub/mul/div as well as
8171 // many builtins (sqrt, etc).
8172 BinaryOperator *OpI = dyn_cast<BinaryOperator>(CI.getOperand(0));
8173 if (OpI && OpI->hasOneUse()) {
8174 switch (OpI->getOpcode()) {
8176 case Instruction::Add:
8177 case Instruction::Sub:
8178 case Instruction::Mul:
8179 case Instruction::FDiv:
8180 case Instruction::FRem:
8181 const Type *SrcTy = OpI->getType();
8182 Value *LHSTrunc = LookThroughFPExtensions(OpI->getOperand(0));
8183 Value *RHSTrunc = LookThroughFPExtensions(OpI->getOperand(1));
8184 if (LHSTrunc->getType() != SrcTy &&
8185 RHSTrunc->getType() != SrcTy) {
8186 unsigned DstSize = CI.getType()->getPrimitiveSizeInBits();
8187 // If the source types were both smaller than the destination type of
8188 // the cast, do this xform.
8189 if (LHSTrunc->getType()->getPrimitiveSizeInBits() <= DstSize &&
8190 RHSTrunc->getType()->getPrimitiveSizeInBits() <= DstSize) {
8191 LHSTrunc = InsertCastBefore(Instruction::FPExt, LHSTrunc,
8193 RHSTrunc = InsertCastBefore(Instruction::FPExt, RHSTrunc,
8195 return BinaryOperator::Create(OpI->getOpcode(), LHSTrunc, RHSTrunc);
8204 Instruction *InstCombiner::visitFPExt(CastInst &CI) {
8205 return commonCastTransforms(CI);
8208 Instruction *InstCombiner::visitFPToUI(FPToUIInst &FI) {
8209 Instruction *OpI = dyn_cast<Instruction>(FI.getOperand(0));
8211 return commonCastTransforms(FI);
8213 // fptoui(uitofp(X)) --> X
8214 // fptoui(sitofp(X)) --> X
8215 // This is safe if the intermediate type has enough bits in its mantissa to
8216 // accurately represent all values of X. For example, do not do this with
8217 // i64->float->i64. This is also safe for sitofp case, because any negative
8218 // 'X' value would cause an undefined result for the fptoui.
8219 if ((isa<UIToFPInst>(OpI) || isa<SIToFPInst>(OpI)) &&
8220 OpI->getOperand(0)->getType() == FI.getType() &&
8221 (int)FI.getType()->getPrimitiveSizeInBits() < /*extra bit for sign */
8222 OpI->getType()->getFPMantissaWidth())
8223 return ReplaceInstUsesWith(FI, OpI->getOperand(0));
8225 return commonCastTransforms(FI);
8228 Instruction *InstCombiner::visitFPToSI(FPToSIInst &FI) {
8229 Instruction *OpI = dyn_cast<Instruction>(FI.getOperand(0));
8231 return commonCastTransforms(FI);
8233 // fptosi(sitofp(X)) --> X
8234 // fptosi(uitofp(X)) --> X
8235 // This is safe if the intermediate type has enough bits in its mantissa to
8236 // accurately represent all values of X. For example, do not do this with
8237 // i64->float->i64. This is also safe for sitofp case, because any negative
8238 // 'X' value would cause an undefined result for the fptoui.
8239 if ((isa<UIToFPInst>(OpI) || isa<SIToFPInst>(OpI)) &&
8240 OpI->getOperand(0)->getType() == FI.getType() &&
8241 (int)FI.getType()->getPrimitiveSizeInBits() <=
8242 OpI->getType()->getFPMantissaWidth())
8243 return ReplaceInstUsesWith(FI, OpI->getOperand(0));
8245 return commonCastTransforms(FI);
8248 Instruction *InstCombiner::visitUIToFP(CastInst &CI) {
8249 return commonCastTransforms(CI);
8252 Instruction *InstCombiner::visitSIToFP(CastInst &CI) {
8253 return commonCastTransforms(CI);
8256 Instruction *InstCombiner::visitPtrToInt(CastInst &CI) {
8257 return commonPointerCastTransforms(CI);
8260 Instruction *InstCombiner::visitIntToPtr(IntToPtrInst &CI) {
8261 if (Instruction *I = commonCastTransforms(CI))
8264 const Type *DestPointee = cast<PointerType>(CI.getType())->getElementType();
8265 if (!DestPointee->isSized()) return 0;
8267 // If this is inttoptr(add (ptrtoint x), cst), try to turn this into a GEP.
8270 if (match(CI.getOperand(0), m_Add(m_Cast<PtrToIntInst>(m_Value(X)),
8271 m_ConstantInt(Cst)))) {
8272 // If the source and destination operands have the same type, see if this
8273 // is a single-index GEP.
8274 if (X->getType() == CI.getType()) {
8275 // Get the size of the pointee type.
8276 uint64_t Size = TD->getABITypeSize(DestPointee);
8278 // Convert the constant to intptr type.
8279 APInt Offset = Cst->getValue();
8280 Offset.sextOrTrunc(TD->getPointerSizeInBits());
8282 // If Offset is evenly divisible by Size, we can do this xform.
8283 if (Size && !APIntOps::srem(Offset, APInt(Offset.getBitWidth(), Size))){
8284 Offset = APIntOps::sdiv(Offset, APInt(Offset.getBitWidth(), Size));
8285 return GetElementPtrInst::Create(X, ConstantInt::get(Offset));
8288 // TODO: Could handle other cases, e.g. where add is indexing into field of
8290 } else if (CI.getOperand(0)->hasOneUse() &&
8291 match(CI.getOperand(0), m_Add(m_Value(X), m_ConstantInt(Cst)))) {
8292 // Otherwise, if this is inttoptr(add x, cst), try to turn this into an
8293 // "inttoptr+GEP" instead of "add+intptr".
8295 // Get the size of the pointee type.
8296 uint64_t Size = TD->getABITypeSize(DestPointee);
8298 // Convert the constant to intptr type.
8299 APInt Offset = Cst->getValue();
8300 Offset.sextOrTrunc(TD->getPointerSizeInBits());
8302 // If Offset is evenly divisible by Size, we can do this xform.
8303 if (Size && !APIntOps::srem(Offset, APInt(Offset.getBitWidth(), Size))){
8304 Offset = APIntOps::sdiv(Offset, APInt(Offset.getBitWidth(), Size));
8306 Instruction *P = InsertNewInstBefore(new IntToPtrInst(X, CI.getType(),
8308 return GetElementPtrInst::Create(P, ConstantInt::get(Offset), "tmp");
8314 Instruction *InstCombiner::visitBitCast(BitCastInst &CI) {
8315 // If the operands are integer typed then apply the integer transforms,
8316 // otherwise just apply the common ones.
8317 Value *Src = CI.getOperand(0);
8318 const Type *SrcTy = Src->getType();
8319 const Type *DestTy = CI.getType();
8321 if (SrcTy->isInteger() && DestTy->isInteger()) {
8322 if (Instruction *Result = commonIntCastTransforms(CI))
8324 } else if (isa<PointerType>(SrcTy)) {
8325 if (Instruction *I = commonPointerCastTransforms(CI))
8328 if (Instruction *Result = commonCastTransforms(CI))
8333 // Get rid of casts from one type to the same type. These are useless and can
8334 // be replaced by the operand.
8335 if (DestTy == Src->getType())
8336 return ReplaceInstUsesWith(CI, Src);
8338 if (const PointerType *DstPTy = dyn_cast<PointerType>(DestTy)) {
8339 const PointerType *SrcPTy = cast<PointerType>(SrcTy);
8340 const Type *DstElTy = DstPTy->getElementType();
8341 const Type *SrcElTy = SrcPTy->getElementType();
8343 // If the address spaces don't match, don't eliminate the bitcast, which is
8344 // required for changing types.
8345 if (SrcPTy->getAddressSpace() != DstPTy->getAddressSpace())
8348 // If we are casting a malloc or alloca to a pointer to a type of the same
8349 // size, rewrite the allocation instruction to allocate the "right" type.
8350 if (AllocationInst *AI = dyn_cast<AllocationInst>(Src))
8351 if (Instruction *V = PromoteCastOfAllocation(CI, *AI))
8354 // If the source and destination are pointers, and this cast is equivalent
8355 // to a getelementptr X, 0, 0, 0... turn it into the appropriate gep.
8356 // This can enhance SROA and other transforms that want type-safe pointers.
8357 Constant *ZeroUInt = Constant::getNullValue(Type::Int32Ty);
8358 unsigned NumZeros = 0;
8359 while (SrcElTy != DstElTy &&
8360 isa<CompositeType>(SrcElTy) && !isa<PointerType>(SrcElTy) &&
8361 SrcElTy->getNumContainedTypes() /* not "{}" */) {
8362 SrcElTy = cast<CompositeType>(SrcElTy)->getTypeAtIndex(ZeroUInt);
8366 // If we found a path from the src to dest, create the getelementptr now.
8367 if (SrcElTy == DstElTy) {
8368 SmallVector<Value*, 8> Idxs(NumZeros+1, ZeroUInt);
8369 return GetElementPtrInst::Create(Src, Idxs.begin(), Idxs.end(), "",
8370 ((Instruction*) NULL));
8374 if (ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(Src)) {
8375 if (SVI->hasOneUse()) {
8376 // Okay, we have (bitconvert (shuffle ..)). Check to see if this is
8377 // a bitconvert to a vector with the same # elts.
8378 if (isa<VectorType>(DestTy) &&
8379 cast<VectorType>(DestTy)->getNumElements() ==
8380 SVI->getType()->getNumElements() &&
8381 SVI->getType()->getNumElements() ==
8382 cast<VectorType>(SVI->getOperand(0)->getType())->getNumElements()) {
8384 // If either of the operands is a cast from CI.getType(), then
8385 // evaluating the shuffle in the casted destination's type will allow
8386 // us to eliminate at least one cast.
8387 if (((Tmp = dyn_cast<CastInst>(SVI->getOperand(0))) &&
8388 Tmp->getOperand(0)->getType() == DestTy) ||
8389 ((Tmp = dyn_cast<CastInst>(SVI->getOperand(1))) &&
8390 Tmp->getOperand(0)->getType() == DestTy)) {
8391 Value *LHS = InsertOperandCastBefore(Instruction::BitCast,
8392 SVI->getOperand(0), DestTy, &CI);
8393 Value *RHS = InsertOperandCastBefore(Instruction::BitCast,
8394 SVI->getOperand(1), DestTy, &CI);
8395 // Return a new shuffle vector. Use the same element ID's, as we
8396 // know the vector types match #elts.
8397 return new ShuffleVectorInst(LHS, RHS, SVI->getOperand(2));
8405 /// GetSelectFoldableOperands - We want to turn code that looks like this:
8407 /// %D = select %cond, %C, %A
8409 /// %C = select %cond, %B, 0
8412 /// Assuming that the specified instruction is an operand to the select, return
8413 /// a bitmask indicating which operands of this instruction are foldable if they
8414 /// equal the other incoming value of the select.
8416 static unsigned GetSelectFoldableOperands(Instruction *I) {
8417 switch (I->getOpcode()) {
8418 case Instruction::Add:
8419 case Instruction::Mul:
8420 case Instruction::And:
8421 case Instruction::Or:
8422 case Instruction::Xor:
8423 return 3; // Can fold through either operand.
8424 case Instruction::Sub: // Can only fold on the amount subtracted.
8425 case Instruction::Shl: // Can only fold on the shift amount.
8426 case Instruction::LShr:
8427 case Instruction::AShr:
8430 return 0; // Cannot fold
8434 /// GetSelectFoldableConstant - For the same transformation as the previous
8435 /// function, return the identity constant that goes into the select.
8436 static Constant *GetSelectFoldableConstant(Instruction *I) {
8437 switch (I->getOpcode()) {
8438 default: assert(0 && "This cannot happen!"); abort();
8439 case Instruction::Add:
8440 case Instruction::Sub:
8441 case Instruction::Or:
8442 case Instruction::Xor:
8443 case Instruction::Shl:
8444 case Instruction::LShr:
8445 case Instruction::AShr:
8446 return Constant::getNullValue(I->getType());
8447 case Instruction::And:
8448 return Constant::getAllOnesValue(I->getType());
8449 case Instruction::Mul:
8450 return ConstantInt::get(I->getType(), 1);
8454 /// FoldSelectOpOp - Here we have (select c, TI, FI), and we know that TI and FI
8455 /// have the same opcode and only one use each. Try to simplify this.
8456 Instruction *InstCombiner::FoldSelectOpOp(SelectInst &SI, Instruction *TI,
8458 if (TI->getNumOperands() == 1) {
8459 // If this is a non-volatile load or a cast from the same type,
8462 if (TI->getOperand(0)->getType() != FI->getOperand(0)->getType())
8465 return 0; // unknown unary op.
8468 // Fold this by inserting a select from the input values.
8469 SelectInst *NewSI = SelectInst::Create(SI.getCondition(), TI->getOperand(0),
8470 FI->getOperand(0), SI.getName()+".v");
8471 InsertNewInstBefore(NewSI, SI);
8472 return CastInst::Create(Instruction::CastOps(TI->getOpcode()), NewSI,
8476 // Only handle binary operators here.
8477 if (!isa<BinaryOperator>(TI))
8480 // Figure out if the operations have any operands in common.
8481 Value *MatchOp, *OtherOpT, *OtherOpF;
8483 if (TI->getOperand(0) == FI->getOperand(0)) {
8484 MatchOp = TI->getOperand(0);
8485 OtherOpT = TI->getOperand(1);
8486 OtherOpF = FI->getOperand(1);
8487 MatchIsOpZero = true;
8488 } else if (TI->getOperand(1) == FI->getOperand(1)) {
8489 MatchOp = TI->getOperand(1);
8490 OtherOpT = TI->getOperand(0);
8491 OtherOpF = FI->getOperand(0);
8492 MatchIsOpZero = false;
8493 } else if (!TI->isCommutative()) {
8495 } else if (TI->getOperand(0) == FI->getOperand(1)) {
8496 MatchOp = TI->getOperand(0);
8497 OtherOpT = TI->getOperand(1);
8498 OtherOpF = FI->getOperand(0);
8499 MatchIsOpZero = true;
8500 } else if (TI->getOperand(1) == FI->getOperand(0)) {
8501 MatchOp = TI->getOperand(1);
8502 OtherOpT = TI->getOperand(0);
8503 OtherOpF = FI->getOperand(1);
8504 MatchIsOpZero = true;
8509 // If we reach here, they do have operations in common.
8510 SelectInst *NewSI = SelectInst::Create(SI.getCondition(), OtherOpT,
8511 OtherOpF, SI.getName()+".v");
8512 InsertNewInstBefore(NewSI, SI);
8514 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(TI)) {
8516 return BinaryOperator::Create(BO->getOpcode(), MatchOp, NewSI);
8518 return BinaryOperator::Create(BO->getOpcode(), NewSI, MatchOp);
8520 assert(0 && "Shouldn't get here");
8524 /// visitSelectInstWithICmp - Visit a SelectInst that has an
8525 /// ICmpInst as its first operand.
8527 Instruction *InstCombiner::visitSelectInstWithICmp(SelectInst &SI,
8529 bool Changed = false;
8530 ICmpInst::Predicate Pred = ICI->getPredicate();
8531 Value *CmpLHS = ICI->getOperand(0);
8532 Value *CmpRHS = ICI->getOperand(1);
8533 Value *TrueVal = SI.getTrueValue();
8534 Value *FalseVal = SI.getFalseValue();
8536 // Check cases where the comparison is with a constant that
8537 // can be adjusted to fit the min/max idiom. We may edit ICI in
8538 // place here, so make sure the select is the only user.
8539 if (ICI->hasOneUse())
8540 if (ConstantInt *CI = dyn_cast<ConstantInt>(CmpRHS)) {
8543 case ICmpInst::ICMP_ULT:
8544 case ICmpInst::ICMP_SLT: {
8545 // X < MIN ? T : F --> F
8546 if (CI->isMinValue(Pred == ICmpInst::ICMP_SLT))
8547 return ReplaceInstUsesWith(SI, FalseVal);
8548 // X < C ? X : C-1 --> X > C-1 ? C-1 : X
8549 Constant *AdjustedRHS = SubOne(CI);
8550 if ((CmpLHS == TrueVal && AdjustedRHS == FalseVal) ||
8551 (CmpLHS == FalseVal && AdjustedRHS == TrueVal)) {
8552 Pred = ICmpInst::getSwappedPredicate(Pred);
8553 CmpRHS = AdjustedRHS;
8554 std::swap(FalseVal, TrueVal);
8555 ICI->setPredicate(Pred);
8556 ICI->setOperand(1, CmpRHS);
8557 SI.setOperand(1, TrueVal);
8558 SI.setOperand(2, FalseVal);
8563 case ICmpInst::ICMP_UGT:
8564 case ICmpInst::ICMP_SGT: {
8565 // X > MAX ? T : F --> F
8566 if (CI->isMaxValue(Pred == ICmpInst::ICMP_SGT))
8567 return ReplaceInstUsesWith(SI, FalseVal);
8568 // X > C ? X : C+1 --> X < C+1 ? C+1 : X
8569 Constant *AdjustedRHS = AddOne(CI);
8570 if ((CmpLHS == TrueVal && AdjustedRHS == FalseVal) ||
8571 (CmpLHS == FalseVal && AdjustedRHS == TrueVal)) {
8572 Pred = ICmpInst::getSwappedPredicate(Pred);
8573 CmpRHS = AdjustedRHS;
8574 std::swap(FalseVal, TrueVal);
8575 ICI->setPredicate(Pred);
8576 ICI->setOperand(1, CmpRHS);
8577 SI.setOperand(1, TrueVal);
8578 SI.setOperand(2, FalseVal);
8585 // (x <s 0) ? -1 : 0 -> ashr x, 31 -> all ones if signed
8586 // (x >s -1) ? -1 : 0 -> ashr x, 31 -> all ones if not signed
8587 CmpInst::Predicate Pred = ICI->getPredicate();
8588 if (match(TrueVal, m_ConstantInt(0)) &&
8589 match(FalseVal, m_ConstantInt(-1)))
8590 Pred = CmpInst::getInversePredicate(Pred);
8591 else if (!match(TrueVal, m_ConstantInt(-1)) ||
8592 !match(FalseVal, m_ConstantInt(0)))
8593 Pred = CmpInst::BAD_ICMP_PREDICATE;
8594 if (Pred != CmpInst::BAD_ICMP_PREDICATE) {
8595 // If we are just checking for a icmp eq of a single bit and zext'ing it
8596 // to an integer, then shift the bit to the appropriate place and then
8597 // cast to integer to avoid the comparison.
8598 const APInt &Op1CV = CI->getValue();
8600 // sext (x <s 0) to i32 --> x>>s31 true if signbit set.
8601 // sext (x >s -1) to i32 --> (x>>s31)^-1 true if signbit clear.
8602 if ((Pred == ICmpInst::ICMP_SLT && Op1CV == 0) ||
8603 (Pred == ICmpInst::ICMP_SGT &&Op1CV.isAllOnesValue())) {
8604 Value *In = ICI->getOperand(0);
8605 Value *Sh = ConstantInt::get(In->getType(),
8606 In->getType()->getPrimitiveSizeInBits()-1);
8607 In = InsertNewInstBefore(BinaryOperator::CreateAShr(In, Sh,
8608 In->getName()+".lobit"),
8610 if (In->getType() != SI.getType())
8611 In = CastInst::CreateIntegerCast(In, SI.getType(),
8612 true/*SExt*/, "tmp", ICI);
8614 if (Pred == ICmpInst::ICMP_SGT)
8615 In = InsertNewInstBefore(BinaryOperator::CreateNot(In,
8616 In->getName()+".not"), *ICI);
8618 return ReplaceInstUsesWith(SI, In);
8623 if (CmpLHS == TrueVal && CmpRHS == FalseVal) {
8624 // Transform (X == Y) ? X : Y -> Y
8625 if (Pred == ICmpInst::ICMP_EQ)
8626 return ReplaceInstUsesWith(SI, FalseVal);
8627 // Transform (X != Y) ? X : Y -> X
8628 if (Pred == ICmpInst::ICMP_NE)
8629 return ReplaceInstUsesWith(SI, TrueVal);
8630 /// NOTE: if we wanted to, this is where to detect integer MIN/MAX
8632 } else if (CmpLHS == FalseVal && CmpRHS == TrueVal) {
8633 // Transform (X == Y) ? Y : X -> X
8634 if (Pred == ICmpInst::ICMP_EQ)
8635 return ReplaceInstUsesWith(SI, FalseVal);
8636 // Transform (X != Y) ? Y : X -> Y
8637 if (Pred == ICmpInst::ICMP_NE)
8638 return ReplaceInstUsesWith(SI, TrueVal);
8639 /// NOTE: if we wanted to, this is where to detect integer MIN/MAX
8642 /// NOTE: if we wanted to, this is where to detect integer ABS
8644 return Changed ? &SI : 0;
8647 Instruction *InstCombiner::visitSelectInst(SelectInst &SI) {
8648 Value *CondVal = SI.getCondition();
8649 Value *TrueVal = SI.getTrueValue();
8650 Value *FalseVal = SI.getFalseValue();
8652 // select true, X, Y -> X
8653 // select false, X, Y -> Y
8654 if (ConstantInt *C = dyn_cast<ConstantInt>(CondVal))
8655 return ReplaceInstUsesWith(SI, C->getZExtValue() ? TrueVal : FalseVal);
8657 // select C, X, X -> X
8658 if (TrueVal == FalseVal)
8659 return ReplaceInstUsesWith(SI, TrueVal);
8661 if (isa<UndefValue>(TrueVal)) // select C, undef, X -> X
8662 return ReplaceInstUsesWith(SI, FalseVal);
8663 if (isa<UndefValue>(FalseVal)) // select C, X, undef -> X
8664 return ReplaceInstUsesWith(SI, TrueVal);
8665 if (isa<UndefValue>(CondVal)) { // select undef, X, Y -> X or Y
8666 if (isa<Constant>(TrueVal))
8667 return ReplaceInstUsesWith(SI, TrueVal);
8669 return ReplaceInstUsesWith(SI, FalseVal);
8672 if (SI.getType() == Type::Int1Ty) {
8673 if (ConstantInt *C = dyn_cast<ConstantInt>(TrueVal)) {
8674 if (C->getZExtValue()) {
8675 // Change: A = select B, true, C --> A = or B, C
8676 return BinaryOperator::CreateOr(CondVal, FalseVal);
8678 // Change: A = select B, false, C --> A = and !B, C
8680 InsertNewInstBefore(BinaryOperator::CreateNot(CondVal,
8681 "not."+CondVal->getName()), SI);
8682 return BinaryOperator::CreateAnd(NotCond, FalseVal);
8684 } else if (ConstantInt *C = dyn_cast<ConstantInt>(FalseVal)) {
8685 if (C->getZExtValue() == false) {
8686 // Change: A = select B, C, false --> A = and B, C
8687 return BinaryOperator::CreateAnd(CondVal, TrueVal);
8689 // Change: A = select B, C, true --> A = or !B, C
8691 InsertNewInstBefore(BinaryOperator::CreateNot(CondVal,
8692 "not."+CondVal->getName()), SI);
8693 return BinaryOperator::CreateOr(NotCond, TrueVal);
8697 // select a, b, a -> a&b
8698 // select a, a, b -> a|b
8699 if (CondVal == TrueVal)
8700 return BinaryOperator::CreateOr(CondVal, FalseVal);
8701 else if (CondVal == FalseVal)
8702 return BinaryOperator::CreateAnd(CondVal, TrueVal);
8705 // Selecting between two integer constants?
8706 if (ConstantInt *TrueValC = dyn_cast<ConstantInt>(TrueVal))
8707 if (ConstantInt *FalseValC = dyn_cast<ConstantInt>(FalseVal)) {
8708 // select C, 1, 0 -> zext C to int
8709 if (FalseValC->isZero() && TrueValC->getValue() == 1) {
8710 return CastInst::Create(Instruction::ZExt, CondVal, SI.getType());
8711 } else if (TrueValC->isZero() && FalseValC->getValue() == 1) {
8712 // select C, 0, 1 -> zext !C to int
8714 InsertNewInstBefore(BinaryOperator::CreateNot(CondVal,
8715 "not."+CondVal->getName()), SI);
8716 return CastInst::Create(Instruction::ZExt, NotCond, SI.getType());
8719 // FIXME: Turn select 0/-1 and -1/0 into sext from condition!
8721 if (ICmpInst *IC = dyn_cast<ICmpInst>(SI.getCondition())) {
8723 // (x <s 0) ? -1 : 0 -> ashr x, 31
8724 if (TrueValC->isAllOnesValue() && FalseValC->isZero())
8725 if (ConstantInt *CmpCst = dyn_cast<ConstantInt>(IC->getOperand(1))) {
8726 if (IC->getPredicate() == ICmpInst::ICMP_SLT && CmpCst->isZero()) {
8727 // The comparison constant and the result are not neccessarily the
8728 // same width. Make an all-ones value by inserting a AShr.
8729 Value *X = IC->getOperand(0);
8730 uint32_t Bits = X->getType()->getPrimitiveSizeInBits();
8731 Constant *ShAmt = ConstantInt::get(X->getType(), Bits-1);
8732 Instruction *SRA = BinaryOperator::Create(Instruction::AShr, X,
8734 InsertNewInstBefore(SRA, SI);
8736 // Finally, convert to the type of the select RHS. We figure out
8737 // if this requires a SExt, Trunc or BitCast based on the sizes.
8738 Instruction::CastOps opc = Instruction::BitCast;
8739 uint32_t SRASize = SRA->getType()->getPrimitiveSizeInBits();
8740 uint32_t SISize = SI.getType()->getPrimitiveSizeInBits();
8741 if (SRASize < SISize)
8742 opc = Instruction::SExt;
8743 else if (SRASize > SISize)
8744 opc = Instruction::Trunc;
8745 return CastInst::Create(opc, SRA, SI.getType());
8750 // If one of the constants is zero (we know they can't both be) and we
8751 // have an icmp instruction with zero, and we have an 'and' with the
8752 // non-constant value, eliminate this whole mess. This corresponds to
8753 // cases like this: ((X & 27) ? 27 : 0)
8754 if (TrueValC->isZero() || FalseValC->isZero())
8755 if (IC->isEquality() && isa<ConstantInt>(IC->getOperand(1)) &&
8756 cast<Constant>(IC->getOperand(1))->isNullValue())
8757 if (Instruction *ICA = dyn_cast<Instruction>(IC->getOperand(0)))
8758 if (ICA->getOpcode() == Instruction::And &&
8759 isa<ConstantInt>(ICA->getOperand(1)) &&
8760 (ICA->getOperand(1) == TrueValC ||
8761 ICA->getOperand(1) == FalseValC) &&
8762 isOneBitSet(cast<ConstantInt>(ICA->getOperand(1)))) {
8763 // Okay, now we know that everything is set up, we just don't
8764 // know whether we have a icmp_ne or icmp_eq and whether the
8765 // true or false val is the zero.
8766 bool ShouldNotVal = !TrueValC->isZero();
8767 ShouldNotVal ^= IC->getPredicate() == ICmpInst::ICMP_NE;
8770 V = InsertNewInstBefore(BinaryOperator::Create(
8771 Instruction::Xor, V, ICA->getOperand(1)), SI);
8772 return ReplaceInstUsesWith(SI, V);
8777 // See if we are selecting two values based on a comparison of the two values.
8778 if (FCmpInst *FCI = dyn_cast<FCmpInst>(CondVal)) {
8779 if (FCI->getOperand(0) == TrueVal && FCI->getOperand(1) == FalseVal) {
8780 // Transform (X == Y) ? X : Y -> Y
8781 if (FCI->getPredicate() == FCmpInst::FCMP_OEQ) {
8782 // This is not safe in general for floating point:
8783 // consider X== -0, Y== +0.
8784 // It becomes safe if either operand is a nonzero constant.
8785 ConstantFP *CFPt, *CFPf;
8786 if (((CFPt = dyn_cast<ConstantFP>(TrueVal)) &&
8787 !CFPt->getValueAPF().isZero()) ||
8788 ((CFPf = dyn_cast<ConstantFP>(FalseVal)) &&
8789 !CFPf->getValueAPF().isZero()))
8790 return ReplaceInstUsesWith(SI, FalseVal);
8792 // Transform (X != Y) ? X : Y -> X
8793 if (FCI->getPredicate() == FCmpInst::FCMP_ONE)
8794 return ReplaceInstUsesWith(SI, TrueVal);
8795 // NOTE: if we wanted to, this is where to detect MIN/MAX
8797 } else if (FCI->getOperand(0) == FalseVal && FCI->getOperand(1) == TrueVal){
8798 // Transform (X == Y) ? Y : X -> X
8799 if (FCI->getPredicate() == FCmpInst::FCMP_OEQ) {
8800 // This is not safe in general for floating point:
8801 // consider X== -0, Y== +0.
8802 // It becomes safe if either operand is a nonzero constant.
8803 ConstantFP *CFPt, *CFPf;
8804 if (((CFPt = dyn_cast<ConstantFP>(TrueVal)) &&
8805 !CFPt->getValueAPF().isZero()) ||
8806 ((CFPf = dyn_cast<ConstantFP>(FalseVal)) &&
8807 !CFPf->getValueAPF().isZero()))
8808 return ReplaceInstUsesWith(SI, FalseVal);
8810 // Transform (X != Y) ? Y : X -> Y
8811 if (FCI->getPredicate() == FCmpInst::FCMP_ONE)
8812 return ReplaceInstUsesWith(SI, TrueVal);
8813 // NOTE: if we wanted to, this is where to detect MIN/MAX
8815 // NOTE: if we wanted to, this is where to detect ABS
8818 // See if we are selecting two values based on a comparison of the two values.
8819 if (ICmpInst *ICI = dyn_cast<ICmpInst>(CondVal))
8820 if (Instruction *Result = visitSelectInstWithICmp(SI, ICI))
8823 if (Instruction *TI = dyn_cast<Instruction>(TrueVal))
8824 if (Instruction *FI = dyn_cast<Instruction>(FalseVal))
8825 if (TI->hasOneUse() && FI->hasOneUse()) {
8826 Instruction *AddOp = 0, *SubOp = 0;
8828 // Turn (select C, (op X, Y), (op X, Z)) -> (op X, (select C, Y, Z))
8829 if (TI->getOpcode() == FI->getOpcode())
8830 if (Instruction *IV = FoldSelectOpOp(SI, TI, FI))
8833 // Turn select C, (X+Y), (X-Y) --> (X+(select C, Y, (-Y))). This is
8834 // even legal for FP.
8835 if (TI->getOpcode() == Instruction::Sub &&
8836 FI->getOpcode() == Instruction::Add) {
8837 AddOp = FI; SubOp = TI;
8838 } else if (FI->getOpcode() == Instruction::Sub &&
8839 TI->getOpcode() == Instruction::Add) {
8840 AddOp = TI; SubOp = FI;
8844 Value *OtherAddOp = 0;
8845 if (SubOp->getOperand(0) == AddOp->getOperand(0)) {
8846 OtherAddOp = AddOp->getOperand(1);
8847 } else if (SubOp->getOperand(0) == AddOp->getOperand(1)) {
8848 OtherAddOp = AddOp->getOperand(0);
8852 // So at this point we know we have (Y -> OtherAddOp):
8853 // select C, (add X, Y), (sub X, Z)
8854 Value *NegVal; // Compute -Z
8855 if (Constant *C = dyn_cast<Constant>(SubOp->getOperand(1))) {
8856 NegVal = ConstantExpr::getNeg(C);
8858 NegVal = InsertNewInstBefore(
8859 BinaryOperator::CreateNeg(SubOp->getOperand(1), "tmp"), SI);
8862 Value *NewTrueOp = OtherAddOp;
8863 Value *NewFalseOp = NegVal;
8865 std::swap(NewTrueOp, NewFalseOp);
8866 Instruction *NewSel =
8867 SelectInst::Create(CondVal, NewTrueOp,
8868 NewFalseOp, SI.getName() + ".p");
8870 NewSel = InsertNewInstBefore(NewSel, SI);
8871 return BinaryOperator::CreateAdd(SubOp->getOperand(0), NewSel);
8876 // See if we can fold the select into one of our operands.
8877 if (SI.getType()->isInteger()) {
8878 // See the comment above GetSelectFoldableOperands for a description of the
8879 // transformation we are doing here.
8880 if (Instruction *TVI = dyn_cast<Instruction>(TrueVal))
8881 if (TVI->hasOneUse() && TVI->getNumOperands() == 2 &&
8882 !isa<Constant>(FalseVal))
8883 if (unsigned SFO = GetSelectFoldableOperands(TVI)) {
8884 unsigned OpToFold = 0;
8885 if ((SFO & 1) && FalseVal == TVI->getOperand(0)) {
8887 } else if ((SFO & 2) && FalseVal == TVI->getOperand(1)) {
8892 Constant *C = GetSelectFoldableConstant(TVI);
8893 Instruction *NewSel =
8894 SelectInst::Create(SI.getCondition(),
8895 TVI->getOperand(2-OpToFold), C);
8896 InsertNewInstBefore(NewSel, SI);
8897 NewSel->takeName(TVI);
8898 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(TVI))
8899 return BinaryOperator::Create(BO->getOpcode(), FalseVal, NewSel);
8901 assert(0 && "Unknown instruction!!");
8906 if (Instruction *FVI = dyn_cast<Instruction>(FalseVal))
8907 if (FVI->hasOneUse() && FVI->getNumOperands() == 2 &&
8908 !isa<Constant>(TrueVal))
8909 if (unsigned SFO = GetSelectFoldableOperands(FVI)) {
8910 unsigned OpToFold = 0;
8911 if ((SFO & 1) && TrueVal == FVI->getOperand(0)) {
8913 } else if ((SFO & 2) && TrueVal == FVI->getOperand(1)) {
8918 Constant *C = GetSelectFoldableConstant(FVI);
8919 Instruction *NewSel =
8920 SelectInst::Create(SI.getCondition(), C,
8921 FVI->getOperand(2-OpToFold));
8922 InsertNewInstBefore(NewSel, SI);
8923 NewSel->takeName(FVI);
8924 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(FVI))
8925 return BinaryOperator::Create(BO->getOpcode(), TrueVal, NewSel);
8927 assert(0 && "Unknown instruction!!");
8932 if (BinaryOperator::isNot(CondVal)) {
8933 SI.setOperand(0, BinaryOperator::getNotArgument(CondVal));
8934 SI.setOperand(1, FalseVal);
8935 SI.setOperand(2, TrueVal);
8942 /// EnforceKnownAlignment - If the specified pointer points to an object that
8943 /// we control, modify the object's alignment to PrefAlign. This isn't
8944 /// often possible though. If alignment is important, a more reliable approach
8945 /// is to simply align all global variables and allocation instructions to
8946 /// their preferred alignment from the beginning.
8948 static unsigned EnforceKnownAlignment(Value *V,
8949 unsigned Align, unsigned PrefAlign) {
8951 User *U = dyn_cast<User>(V);
8952 if (!U) return Align;
8954 switch (getOpcode(U)) {
8956 case Instruction::BitCast:
8957 return EnforceKnownAlignment(U->getOperand(0), Align, PrefAlign);
8958 case Instruction::GetElementPtr: {
8959 // If all indexes are zero, it is just the alignment of the base pointer.
8960 bool AllZeroOperands = true;
8961 for (User::op_iterator i = U->op_begin() + 1, e = U->op_end(); i != e; ++i)
8962 if (!isa<Constant>(*i) ||
8963 !cast<Constant>(*i)->isNullValue()) {
8964 AllZeroOperands = false;
8968 if (AllZeroOperands) {
8969 // Treat this like a bitcast.
8970 return EnforceKnownAlignment(U->getOperand(0), Align, PrefAlign);
8976 if (GlobalValue *GV = dyn_cast<GlobalValue>(V)) {
8977 // If there is a large requested alignment and we can, bump up the alignment
8979 if (!GV->isDeclaration()) {
8980 GV->setAlignment(PrefAlign);
8983 } else if (AllocationInst *AI = dyn_cast<AllocationInst>(V)) {
8984 // If there is a requested alignment and if this is an alloca, round up. We
8985 // don't do this for malloc, because some systems can't respect the request.
8986 if (isa<AllocaInst>(AI)) {
8987 AI->setAlignment(PrefAlign);
8995 /// GetOrEnforceKnownAlignment - If the specified pointer has an alignment that
8996 /// we can determine, return it, otherwise return 0. If PrefAlign is specified,
8997 /// and it is more than the alignment of the ultimate object, see if we can
8998 /// increase the alignment of the ultimate object, making this check succeed.
8999 unsigned InstCombiner::GetOrEnforceKnownAlignment(Value *V,
9000 unsigned PrefAlign) {
9001 unsigned BitWidth = TD ? TD->getTypeSizeInBits(V->getType()) :
9002 sizeof(PrefAlign) * CHAR_BIT;
9003 APInt Mask = APInt::getAllOnesValue(BitWidth);
9004 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
9005 ComputeMaskedBits(V, Mask, KnownZero, KnownOne);
9006 unsigned TrailZ = KnownZero.countTrailingOnes();
9007 unsigned Align = 1u << std::min(BitWidth - 1, TrailZ);
9009 if (PrefAlign > Align)
9010 Align = EnforceKnownAlignment(V, Align, PrefAlign);
9012 // We don't need to make any adjustment.
9016 Instruction *InstCombiner::SimplifyMemTransfer(MemIntrinsic *MI) {
9017 unsigned DstAlign = GetOrEnforceKnownAlignment(MI->getOperand(1));
9018 unsigned SrcAlign = GetOrEnforceKnownAlignment(MI->getOperand(2));
9019 unsigned MinAlign = std::min(DstAlign, SrcAlign);
9020 unsigned CopyAlign = MI->getAlignment()->getZExtValue();
9022 if (CopyAlign < MinAlign) {
9023 MI->setAlignment(ConstantInt::get(Type::Int32Ty, MinAlign));
9027 // If MemCpyInst length is 1/2/4/8 bytes then replace memcpy with
9029 ConstantInt *MemOpLength = dyn_cast<ConstantInt>(MI->getOperand(3));
9030 if (MemOpLength == 0) return 0;
9032 // Source and destination pointer types are always "i8*" for intrinsic. See
9033 // if the size is something we can handle with a single primitive load/store.
9034 // A single load+store correctly handles overlapping memory in the memmove
9036 unsigned Size = MemOpLength->getZExtValue();
9037 if (Size == 0) return MI; // Delete this mem transfer.
9039 if (Size > 8 || (Size&(Size-1)))
9040 return 0; // If not 1/2/4/8 bytes, exit.
9042 // Use an integer load+store unless we can find something better.
9043 Type *NewPtrTy = PointerType::getUnqual(IntegerType::get(Size<<3));
9045 // Memcpy forces the use of i8* for the source and destination. That means
9046 // that if you're using memcpy to move one double around, you'll get a cast
9047 // from double* to i8*. We'd much rather use a double load+store rather than
9048 // an i64 load+store, here because this improves the odds that the source or
9049 // dest address will be promotable. See if we can find a better type than the
9050 // integer datatype.
9051 if (Value *Op = getBitCastOperand(MI->getOperand(1))) {
9052 const Type *SrcETy = cast<PointerType>(Op->getType())->getElementType();
9053 if (SrcETy->isSized() && TD->getTypeStoreSize(SrcETy) == Size) {
9054 // The SrcETy might be something like {{{double}}} or [1 x double]. Rip
9055 // down through these levels if so.
9056 while (!SrcETy->isSingleValueType()) {
9057 if (const StructType *STy = dyn_cast<StructType>(SrcETy)) {
9058 if (STy->getNumElements() == 1)
9059 SrcETy = STy->getElementType(0);
9062 } else if (const ArrayType *ATy = dyn_cast<ArrayType>(SrcETy)) {
9063 if (ATy->getNumElements() == 1)
9064 SrcETy = ATy->getElementType();
9071 if (SrcETy->isSingleValueType())
9072 NewPtrTy = PointerType::getUnqual(SrcETy);
9077 // If the memcpy/memmove provides better alignment info than we can
9079 SrcAlign = std::max(SrcAlign, CopyAlign);
9080 DstAlign = std::max(DstAlign, CopyAlign);
9082 Value *Src = InsertBitCastBefore(MI->getOperand(2), NewPtrTy, *MI);
9083 Value *Dest = InsertBitCastBefore(MI->getOperand(1), NewPtrTy, *MI);
9084 Instruction *L = new LoadInst(Src, "tmp", false, SrcAlign);
9085 InsertNewInstBefore(L, *MI);
9086 InsertNewInstBefore(new StoreInst(L, Dest, false, DstAlign), *MI);
9088 // Set the size of the copy to 0, it will be deleted on the next iteration.
9089 MI->setOperand(3, Constant::getNullValue(MemOpLength->getType()));
9093 Instruction *InstCombiner::SimplifyMemSet(MemSetInst *MI) {
9094 unsigned Alignment = GetOrEnforceKnownAlignment(MI->getDest());
9095 if (MI->getAlignment()->getZExtValue() < Alignment) {
9096 MI->setAlignment(ConstantInt::get(Type::Int32Ty, Alignment));
9100 // Extract the length and alignment and fill if they are constant.
9101 ConstantInt *LenC = dyn_cast<ConstantInt>(MI->getLength());
9102 ConstantInt *FillC = dyn_cast<ConstantInt>(MI->getValue());
9103 if (!LenC || !FillC || FillC->getType() != Type::Int8Ty)
9105 uint64_t Len = LenC->getZExtValue();
9106 Alignment = MI->getAlignment()->getZExtValue();
9108 // If the length is zero, this is a no-op
9109 if (Len == 0) return MI; // memset(d,c,0,a) -> noop
9111 // memset(s,c,n) -> store s, c (for n=1,2,4,8)
9112 if (Len <= 8 && isPowerOf2_32((uint32_t)Len)) {
9113 const Type *ITy = IntegerType::get(Len*8); // n=1 -> i8.
9115 Value *Dest = MI->getDest();
9116 Dest = InsertBitCastBefore(Dest, PointerType::getUnqual(ITy), *MI);
9118 // Alignment 0 is identity for alignment 1 for memset, but not store.
9119 if (Alignment == 0) Alignment = 1;
9121 // Extract the fill value and store.
9122 uint64_t Fill = FillC->getZExtValue()*0x0101010101010101ULL;
9123 InsertNewInstBefore(new StoreInst(ConstantInt::get(ITy, Fill), Dest, false,
9126 // Set the size of the copy to 0, it will be deleted on the next iteration.
9127 MI->setLength(Constant::getNullValue(LenC->getType()));
9135 /// visitCallInst - CallInst simplification. This mostly only handles folding
9136 /// of intrinsic instructions. For normal calls, it allows visitCallSite to do
9137 /// the heavy lifting.
9139 Instruction *InstCombiner::visitCallInst(CallInst &CI) {
9140 IntrinsicInst *II = dyn_cast<IntrinsicInst>(&CI);
9141 if (!II) return visitCallSite(&CI);
9143 // Intrinsics cannot occur in an invoke, so handle them here instead of in
9145 if (MemIntrinsic *MI = dyn_cast<MemIntrinsic>(II)) {
9146 bool Changed = false;
9148 // memmove/cpy/set of zero bytes is a noop.
9149 if (Constant *NumBytes = dyn_cast<Constant>(MI->getLength())) {
9150 if (NumBytes->isNullValue()) return EraseInstFromFunction(CI);
9152 if (ConstantInt *CI = dyn_cast<ConstantInt>(NumBytes))
9153 if (CI->getZExtValue() == 1) {
9154 // Replace the instruction with just byte operations. We would
9155 // transform other cases to loads/stores, but we don't know if
9156 // alignment is sufficient.
9160 // If we have a memmove and the source operation is a constant global,
9161 // then the source and dest pointers can't alias, so we can change this
9162 // into a call to memcpy.
9163 if (MemMoveInst *MMI = dyn_cast<MemMoveInst>(MI)) {
9164 if (GlobalVariable *GVSrc = dyn_cast<GlobalVariable>(MMI->getSource()))
9165 if (GVSrc->isConstant()) {
9166 Module *M = CI.getParent()->getParent()->getParent();
9167 Intrinsic::ID MemCpyID;
9168 if (CI.getOperand(3)->getType() == Type::Int32Ty)
9169 MemCpyID = Intrinsic::memcpy_i32;
9171 MemCpyID = Intrinsic::memcpy_i64;
9172 CI.setOperand(0, Intrinsic::getDeclaration(M, MemCpyID));
9176 // memmove(x,x,size) -> noop.
9177 if (MMI->getSource() == MMI->getDest())
9178 return EraseInstFromFunction(CI);
9181 // If we can determine a pointer alignment that is bigger than currently
9182 // set, update the alignment.
9183 if (isa<MemCpyInst>(MI) || isa<MemMoveInst>(MI)) {
9184 if (Instruction *I = SimplifyMemTransfer(MI))
9186 } else if (MemSetInst *MSI = dyn_cast<MemSetInst>(MI)) {
9187 if (Instruction *I = SimplifyMemSet(MSI))
9191 if (Changed) return II;
9194 switch (II->getIntrinsicID()) {
9196 case Intrinsic::bswap:
9197 // bswap(bswap(x)) -> x
9198 if (IntrinsicInst *Operand = dyn_cast<IntrinsicInst>(II->getOperand(1)))
9199 if (Operand->getIntrinsicID() == Intrinsic::bswap)
9200 return ReplaceInstUsesWith(CI, Operand->getOperand(1));
9202 case Intrinsic::ppc_altivec_lvx:
9203 case Intrinsic::ppc_altivec_lvxl:
9204 case Intrinsic::x86_sse_loadu_ps:
9205 case Intrinsic::x86_sse2_loadu_pd:
9206 case Intrinsic::x86_sse2_loadu_dq:
9207 // Turn PPC lvx -> load if the pointer is known aligned.
9208 // Turn X86 loadups -> load if the pointer is known aligned.
9209 if (GetOrEnforceKnownAlignment(II->getOperand(1), 16) >= 16) {
9210 Value *Ptr = InsertBitCastBefore(II->getOperand(1),
9211 PointerType::getUnqual(II->getType()),
9213 return new LoadInst(Ptr);
9216 case Intrinsic::ppc_altivec_stvx:
9217 case Intrinsic::ppc_altivec_stvxl:
9218 // Turn stvx -> store if the pointer is known aligned.
9219 if (GetOrEnforceKnownAlignment(II->getOperand(2), 16) >= 16) {
9220 const Type *OpPtrTy =
9221 PointerType::getUnqual(II->getOperand(1)->getType());
9222 Value *Ptr = InsertBitCastBefore(II->getOperand(2), OpPtrTy, CI);
9223 return new StoreInst(II->getOperand(1), Ptr);
9226 case Intrinsic::x86_sse_storeu_ps:
9227 case Intrinsic::x86_sse2_storeu_pd:
9228 case Intrinsic::x86_sse2_storeu_dq:
9229 // Turn X86 storeu -> store if the pointer is known aligned.
9230 if (GetOrEnforceKnownAlignment(II->getOperand(1), 16) >= 16) {
9231 const Type *OpPtrTy =
9232 PointerType::getUnqual(II->getOperand(2)->getType());
9233 Value *Ptr = InsertBitCastBefore(II->getOperand(1), OpPtrTy, CI);
9234 return new StoreInst(II->getOperand(2), Ptr);
9238 case Intrinsic::x86_sse_cvttss2si: {
9239 // These intrinsics only demands the 0th element of its input vector. If
9240 // we can simplify the input based on that, do so now.
9242 if (Value *V = SimplifyDemandedVectorElts(II->getOperand(1), 1,
9244 II->setOperand(1, V);
9250 case Intrinsic::ppc_altivec_vperm:
9251 // Turn vperm(V1,V2,mask) -> shuffle(V1,V2,mask) if mask is a constant.
9252 if (ConstantVector *Mask = dyn_cast<ConstantVector>(II->getOperand(3))) {
9253 assert(Mask->getNumOperands() == 16 && "Bad type for intrinsic!");
9255 // Check that all of the elements are integer constants or undefs.
9256 bool AllEltsOk = true;
9257 for (unsigned i = 0; i != 16; ++i) {
9258 if (!isa<ConstantInt>(Mask->getOperand(i)) &&
9259 !isa<UndefValue>(Mask->getOperand(i))) {
9266 // Cast the input vectors to byte vectors.
9267 Value *Op0 =InsertBitCastBefore(II->getOperand(1),Mask->getType(),CI);
9268 Value *Op1 =InsertBitCastBefore(II->getOperand(2),Mask->getType(),CI);
9269 Value *Result = UndefValue::get(Op0->getType());
9271 // Only extract each element once.
9272 Value *ExtractedElts[32];
9273 memset(ExtractedElts, 0, sizeof(ExtractedElts));
9275 for (unsigned i = 0; i != 16; ++i) {
9276 if (isa<UndefValue>(Mask->getOperand(i)))
9278 unsigned Idx=cast<ConstantInt>(Mask->getOperand(i))->getZExtValue();
9279 Idx &= 31; // Match the hardware behavior.
9281 if (ExtractedElts[Idx] == 0) {
9283 new ExtractElementInst(Idx < 16 ? Op0 : Op1, Idx&15, "tmp");
9284 InsertNewInstBefore(Elt, CI);
9285 ExtractedElts[Idx] = Elt;
9288 // Insert this value into the result vector.
9289 Result = InsertElementInst::Create(Result, ExtractedElts[Idx],
9291 InsertNewInstBefore(cast<Instruction>(Result), CI);
9293 return CastInst::Create(Instruction::BitCast, Result, CI.getType());
9298 case Intrinsic::stackrestore: {
9299 // If the save is right next to the restore, remove the restore. This can
9300 // happen when variable allocas are DCE'd.
9301 if (IntrinsicInst *SS = dyn_cast<IntrinsicInst>(II->getOperand(1))) {
9302 if (SS->getIntrinsicID() == Intrinsic::stacksave) {
9303 BasicBlock::iterator BI = SS;
9305 return EraseInstFromFunction(CI);
9309 // Scan down this block to see if there is another stack restore in the
9310 // same block without an intervening call/alloca.
9311 BasicBlock::iterator BI = II;
9312 TerminatorInst *TI = II->getParent()->getTerminator();
9313 bool CannotRemove = false;
9314 for (++BI; &*BI != TI; ++BI) {
9315 if (isa<AllocaInst>(BI)) {
9316 CannotRemove = true;
9319 if (CallInst *BCI = dyn_cast<CallInst>(BI)) {
9320 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(BCI)) {
9321 // If there is a stackrestore below this one, remove this one.
9322 if (II->getIntrinsicID() == Intrinsic::stackrestore)
9323 return EraseInstFromFunction(CI);
9324 // Otherwise, ignore the intrinsic.
9326 // If we found a non-intrinsic call, we can't remove the stack
9328 CannotRemove = true;
9334 // If the stack restore is in a return/unwind block and if there are no
9335 // allocas or calls between the restore and the return, nuke the restore.
9336 if (!CannotRemove && (isa<ReturnInst>(TI) || isa<UnwindInst>(TI)))
9337 return EraseInstFromFunction(CI);
9342 return visitCallSite(II);
9345 // InvokeInst simplification
9347 Instruction *InstCombiner::visitInvokeInst(InvokeInst &II) {
9348 return visitCallSite(&II);
9351 /// isSafeToEliminateVarargsCast - If this cast does not affect the value
9352 /// passed through the varargs area, we can eliminate the use of the cast.
9353 static bool isSafeToEliminateVarargsCast(const CallSite CS,
9354 const CastInst * const CI,
9355 const TargetData * const TD,
9357 if (!CI->isLosslessCast())
9360 // The size of ByVal arguments is derived from the type, so we
9361 // can't change to a type with a different size. If the size were
9362 // passed explicitly we could avoid this check.
9363 if (!CS.paramHasAttr(ix, Attribute::ByVal))
9367 cast<PointerType>(CI->getOperand(0)->getType())->getElementType();
9368 const Type* DstTy = cast<PointerType>(CI->getType())->getElementType();
9369 if (!SrcTy->isSized() || !DstTy->isSized())
9371 if (TD->getABITypeSize(SrcTy) != TD->getABITypeSize(DstTy))
9376 // visitCallSite - Improvements for call and invoke instructions.
9378 Instruction *InstCombiner::visitCallSite(CallSite CS) {
9379 bool Changed = false;
9381 // If the callee is a constexpr cast of a function, attempt to move the cast
9382 // to the arguments of the call/invoke.
9383 if (transformConstExprCastCall(CS)) return 0;
9385 Value *Callee = CS.getCalledValue();
9387 if (Function *CalleeF = dyn_cast<Function>(Callee))
9388 if (CalleeF->getCallingConv() != CS.getCallingConv()) {
9389 Instruction *OldCall = CS.getInstruction();
9390 // If the call and callee calling conventions don't match, this call must
9391 // be unreachable, as the call is undefined.
9392 new StoreInst(ConstantInt::getTrue(),
9393 UndefValue::get(PointerType::getUnqual(Type::Int1Ty)),
9395 if (!OldCall->use_empty())
9396 OldCall->replaceAllUsesWith(UndefValue::get(OldCall->getType()));
9397 if (isa<CallInst>(OldCall)) // Not worth removing an invoke here.
9398 return EraseInstFromFunction(*OldCall);
9402 if (isa<ConstantPointerNull>(Callee) || isa<UndefValue>(Callee)) {
9403 // This instruction is not reachable, just remove it. We insert a store to
9404 // undef so that we know that this code is not reachable, despite the fact
9405 // that we can't modify the CFG here.
9406 new StoreInst(ConstantInt::getTrue(),
9407 UndefValue::get(PointerType::getUnqual(Type::Int1Ty)),
9408 CS.getInstruction());
9410 if (!CS.getInstruction()->use_empty())
9411 CS.getInstruction()->
9412 replaceAllUsesWith(UndefValue::get(CS.getInstruction()->getType()));
9414 if (InvokeInst *II = dyn_cast<InvokeInst>(CS.getInstruction())) {
9415 // Don't break the CFG, insert a dummy cond branch.
9416 BranchInst::Create(II->getNormalDest(), II->getUnwindDest(),
9417 ConstantInt::getTrue(), II);
9419 return EraseInstFromFunction(*CS.getInstruction());
9422 if (BitCastInst *BC = dyn_cast<BitCastInst>(Callee))
9423 if (IntrinsicInst *In = dyn_cast<IntrinsicInst>(BC->getOperand(0)))
9424 if (In->getIntrinsicID() == Intrinsic::init_trampoline)
9425 return transformCallThroughTrampoline(CS);
9427 const PointerType *PTy = cast<PointerType>(Callee->getType());
9428 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
9429 if (FTy->isVarArg()) {
9430 int ix = FTy->getNumParams() + (isa<InvokeInst>(Callee) ? 3 : 1);
9431 // See if we can optimize any arguments passed through the varargs area of
9433 for (CallSite::arg_iterator I = CS.arg_begin()+FTy->getNumParams(),
9434 E = CS.arg_end(); I != E; ++I, ++ix) {
9435 CastInst *CI = dyn_cast<CastInst>(*I);
9436 if (CI && isSafeToEliminateVarargsCast(CS, CI, TD, ix)) {
9437 *I = CI->getOperand(0);
9443 if (isa<InlineAsm>(Callee) && !CS.doesNotThrow()) {
9444 // Inline asm calls cannot throw - mark them 'nounwind'.
9445 CS.setDoesNotThrow();
9449 return Changed ? CS.getInstruction() : 0;
9452 // transformConstExprCastCall - If the callee is a constexpr cast of a function,
9453 // attempt to move the cast to the arguments of the call/invoke.
9455 bool InstCombiner::transformConstExprCastCall(CallSite CS) {
9456 if (!isa<ConstantExpr>(CS.getCalledValue())) return false;
9457 ConstantExpr *CE = cast<ConstantExpr>(CS.getCalledValue());
9458 if (CE->getOpcode() != Instruction::BitCast ||
9459 !isa<Function>(CE->getOperand(0)))
9461 Function *Callee = cast<Function>(CE->getOperand(0));
9462 Instruction *Caller = CS.getInstruction();
9463 const AttrListPtr &CallerPAL = CS.getAttributes();
9465 // Okay, this is a cast from a function to a different type. Unless doing so
9466 // would cause a type conversion of one of our arguments, change this call to
9467 // be a direct call with arguments casted to the appropriate types.
9469 const FunctionType *FT = Callee->getFunctionType();
9470 const Type *OldRetTy = Caller->getType();
9471 const Type *NewRetTy = FT->getReturnType();
9473 if (isa<StructType>(NewRetTy))
9474 return false; // TODO: Handle multiple return values.
9476 // Check to see if we are changing the return type...
9477 if (OldRetTy != NewRetTy) {
9478 if (Callee->isDeclaration() &&
9479 // Conversion is ok if changing from one pointer type to another or from
9480 // a pointer to an integer of the same size.
9481 !((isa<PointerType>(OldRetTy) || OldRetTy == TD->getIntPtrType()) &&
9482 (isa<PointerType>(NewRetTy) || NewRetTy == TD->getIntPtrType())))
9483 return false; // Cannot transform this return value.
9485 if (!Caller->use_empty() &&
9486 // void -> non-void is handled specially
9487 NewRetTy != Type::VoidTy && !CastInst::isCastable(NewRetTy, OldRetTy))
9488 return false; // Cannot transform this return value.
9490 if (!CallerPAL.isEmpty() && !Caller->use_empty()) {
9491 Attributes RAttrs = CallerPAL.getRetAttributes();
9492 if (RAttrs & Attribute::typeIncompatible(NewRetTy))
9493 return false; // Attribute not compatible with transformed value.
9496 // If the callsite is an invoke instruction, and the return value is used by
9497 // a PHI node in a successor, we cannot change the return type of the call
9498 // because there is no place to put the cast instruction (without breaking
9499 // the critical edge). Bail out in this case.
9500 if (!Caller->use_empty())
9501 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller))
9502 for (Value::use_iterator UI = II->use_begin(), E = II->use_end();
9504 if (PHINode *PN = dyn_cast<PHINode>(*UI))
9505 if (PN->getParent() == II->getNormalDest() ||
9506 PN->getParent() == II->getUnwindDest())
9510 unsigned NumActualArgs = unsigned(CS.arg_end()-CS.arg_begin());
9511 unsigned NumCommonArgs = std::min(FT->getNumParams(), NumActualArgs);
9513 CallSite::arg_iterator AI = CS.arg_begin();
9514 for (unsigned i = 0, e = NumCommonArgs; i != e; ++i, ++AI) {
9515 const Type *ParamTy = FT->getParamType(i);
9516 const Type *ActTy = (*AI)->getType();
9518 if (!CastInst::isCastable(ActTy, ParamTy))
9519 return false; // Cannot transform this parameter value.
9521 if (CallerPAL.getParamAttributes(i + 1)
9522 & Attribute::typeIncompatible(ParamTy))
9523 return false; // Attribute not compatible with transformed value.
9525 // Converting from one pointer type to another or between a pointer and an
9526 // integer of the same size is safe even if we do not have a body.
9527 bool isConvertible = ActTy == ParamTy ||
9528 ((isa<PointerType>(ParamTy) || ParamTy == TD->getIntPtrType()) &&
9529 (isa<PointerType>(ActTy) || ActTy == TD->getIntPtrType()));
9530 if (Callee->isDeclaration() && !isConvertible) return false;
9533 if (FT->getNumParams() < NumActualArgs && !FT->isVarArg() &&
9534 Callee->isDeclaration())
9535 return false; // Do not delete arguments unless we have a function body.
9537 if (FT->getNumParams() < NumActualArgs && FT->isVarArg() &&
9538 !CallerPAL.isEmpty())
9539 // In this case we have more arguments than the new function type, but we
9540 // won't be dropping them. Check that these extra arguments have attributes
9541 // that are compatible with being a vararg call argument.
9542 for (unsigned i = CallerPAL.getNumSlots(); i; --i) {
9543 if (CallerPAL.getSlot(i - 1).Index <= FT->getNumParams())
9545 Attributes PAttrs = CallerPAL.getSlot(i - 1).Attrs;
9546 if (PAttrs & Attribute::VarArgsIncompatible)
9550 // Okay, we decided that this is a safe thing to do: go ahead and start
9551 // inserting cast instructions as necessary...
9552 std::vector<Value*> Args;
9553 Args.reserve(NumActualArgs);
9554 SmallVector<AttributeWithIndex, 8> attrVec;
9555 attrVec.reserve(NumCommonArgs);
9557 // Get any return attributes.
9558 Attributes RAttrs = CallerPAL.getRetAttributes();
9560 // If the return value is not being used, the type may not be compatible
9561 // with the existing attributes. Wipe out any problematic attributes.
9562 RAttrs &= ~Attribute::typeIncompatible(NewRetTy);
9564 // Add the new return attributes.
9566 attrVec.push_back(AttributeWithIndex::get(0, RAttrs));
9568 AI = CS.arg_begin();
9569 for (unsigned i = 0; i != NumCommonArgs; ++i, ++AI) {
9570 const Type *ParamTy = FT->getParamType(i);
9571 if ((*AI)->getType() == ParamTy) {
9572 Args.push_back(*AI);
9574 Instruction::CastOps opcode = CastInst::getCastOpcode(*AI,
9575 false, ParamTy, false);
9576 CastInst *NewCast = CastInst::Create(opcode, *AI, ParamTy, "tmp");
9577 Args.push_back(InsertNewInstBefore(NewCast, *Caller));
9580 // Add any parameter attributes.
9581 if (Attributes PAttrs = CallerPAL.getParamAttributes(i + 1))
9582 attrVec.push_back(AttributeWithIndex::get(i + 1, PAttrs));
9585 // If the function takes more arguments than the call was taking, add them
9587 for (unsigned i = NumCommonArgs; i != FT->getNumParams(); ++i)
9588 Args.push_back(Constant::getNullValue(FT->getParamType(i)));
9590 // If we are removing arguments to the function, emit an obnoxious warning...
9591 if (FT->getNumParams() < NumActualArgs) {
9592 if (!FT->isVarArg()) {
9593 cerr << "WARNING: While resolving call to function '"
9594 << Callee->getName() << "' arguments were dropped!\n";
9596 // Add all of the arguments in their promoted form to the arg list...
9597 for (unsigned i = FT->getNumParams(); i != NumActualArgs; ++i, ++AI) {
9598 const Type *PTy = getPromotedType((*AI)->getType());
9599 if (PTy != (*AI)->getType()) {
9600 // Must promote to pass through va_arg area!
9601 Instruction::CastOps opcode = CastInst::getCastOpcode(*AI, false,
9603 Instruction *Cast = CastInst::Create(opcode, *AI, PTy, "tmp");
9604 InsertNewInstBefore(Cast, *Caller);
9605 Args.push_back(Cast);
9607 Args.push_back(*AI);
9610 // Add any parameter attributes.
9611 if (Attributes PAttrs = CallerPAL.getParamAttributes(i + 1))
9612 attrVec.push_back(AttributeWithIndex::get(i + 1, PAttrs));
9617 if (Attributes FnAttrs = CallerPAL.getFnAttributes())
9618 attrVec.push_back(AttributeWithIndex::get(~0, FnAttrs));
9620 if (NewRetTy == Type::VoidTy)
9621 Caller->setName(""); // Void type should not have a name.
9623 const AttrListPtr &NewCallerPAL = AttrListPtr::get(attrVec.begin(),attrVec.end());
9626 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
9627 NC = InvokeInst::Create(Callee, II->getNormalDest(), II->getUnwindDest(),
9628 Args.begin(), Args.end(),
9629 Caller->getName(), Caller);
9630 cast<InvokeInst>(NC)->setCallingConv(II->getCallingConv());
9631 cast<InvokeInst>(NC)->setAttributes(NewCallerPAL);
9633 NC = CallInst::Create(Callee, Args.begin(), Args.end(),
9634 Caller->getName(), Caller);
9635 CallInst *CI = cast<CallInst>(Caller);
9636 if (CI->isTailCall())
9637 cast<CallInst>(NC)->setTailCall();
9638 cast<CallInst>(NC)->setCallingConv(CI->getCallingConv());
9639 cast<CallInst>(NC)->setAttributes(NewCallerPAL);
9642 // Insert a cast of the return type as necessary.
9644 if (OldRetTy != NV->getType() && !Caller->use_empty()) {
9645 if (NV->getType() != Type::VoidTy) {
9646 Instruction::CastOps opcode = CastInst::getCastOpcode(NC, false,
9648 NV = NC = CastInst::Create(opcode, NC, OldRetTy, "tmp");
9650 // If this is an invoke instruction, we should insert it after the first
9651 // non-phi, instruction in the normal successor block.
9652 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
9653 BasicBlock::iterator I = II->getNormalDest()->getFirstNonPHI();
9654 InsertNewInstBefore(NC, *I);
9656 // Otherwise, it's a call, just insert cast right after the call instr
9657 InsertNewInstBefore(NC, *Caller);
9659 AddUsersToWorkList(*Caller);
9661 NV = UndefValue::get(Caller->getType());
9665 if (Caller->getType() != Type::VoidTy && !Caller->use_empty())
9666 Caller->replaceAllUsesWith(NV);
9667 Caller->eraseFromParent();
9668 RemoveFromWorkList(Caller);
9672 // transformCallThroughTrampoline - Turn a call to a function created by the
9673 // init_trampoline intrinsic into a direct call to the underlying function.
9675 Instruction *InstCombiner::transformCallThroughTrampoline(CallSite CS) {
9676 Value *Callee = CS.getCalledValue();
9677 const PointerType *PTy = cast<PointerType>(Callee->getType());
9678 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
9679 const AttrListPtr &Attrs = CS.getAttributes();
9681 // If the call already has the 'nest' attribute somewhere then give up -
9682 // otherwise 'nest' would occur twice after splicing in the chain.
9683 if (Attrs.hasAttrSomewhere(Attribute::Nest))
9686 IntrinsicInst *Tramp =
9687 cast<IntrinsicInst>(cast<BitCastInst>(Callee)->getOperand(0));
9689 Function *NestF = cast<Function>(Tramp->getOperand(2)->stripPointerCasts());
9690 const PointerType *NestFPTy = cast<PointerType>(NestF->getType());
9691 const FunctionType *NestFTy = cast<FunctionType>(NestFPTy->getElementType());
9693 const AttrListPtr &NestAttrs = NestF->getAttributes();
9694 if (!NestAttrs.isEmpty()) {
9695 unsigned NestIdx = 1;
9696 const Type *NestTy = 0;
9697 Attributes NestAttr = Attribute::None;
9699 // Look for a parameter marked with the 'nest' attribute.
9700 for (FunctionType::param_iterator I = NestFTy->param_begin(),
9701 E = NestFTy->param_end(); I != E; ++NestIdx, ++I)
9702 if (NestAttrs.paramHasAttr(NestIdx, Attribute::Nest)) {
9703 // Record the parameter type and any other attributes.
9705 NestAttr = NestAttrs.getParamAttributes(NestIdx);
9710 Instruction *Caller = CS.getInstruction();
9711 std::vector<Value*> NewArgs;
9712 NewArgs.reserve(unsigned(CS.arg_end()-CS.arg_begin())+1);
9714 SmallVector<AttributeWithIndex, 8> NewAttrs;
9715 NewAttrs.reserve(Attrs.getNumSlots() + 1);
9717 // Insert the nest argument into the call argument list, which may
9718 // mean appending it. Likewise for attributes.
9720 // Add any result attributes.
9721 if (Attributes Attr = Attrs.getRetAttributes())
9722 NewAttrs.push_back(AttributeWithIndex::get(0, Attr));
9726 CallSite::arg_iterator I = CS.arg_begin(), E = CS.arg_end();
9728 if (Idx == NestIdx) {
9729 // Add the chain argument and attributes.
9730 Value *NestVal = Tramp->getOperand(3);
9731 if (NestVal->getType() != NestTy)
9732 NestVal = new BitCastInst(NestVal, NestTy, "nest", Caller);
9733 NewArgs.push_back(NestVal);
9734 NewAttrs.push_back(AttributeWithIndex::get(NestIdx, NestAttr));
9740 // Add the original argument and attributes.
9741 NewArgs.push_back(*I);
9742 if (Attributes Attr = Attrs.getParamAttributes(Idx))
9744 (AttributeWithIndex::get(Idx + (Idx >= NestIdx), Attr));
9750 // Add any function attributes.
9751 if (Attributes Attr = Attrs.getFnAttributes())
9752 NewAttrs.push_back(AttributeWithIndex::get(~0, Attr));
9754 // The trampoline may have been bitcast to a bogus type (FTy).
9755 // Handle this by synthesizing a new function type, equal to FTy
9756 // with the chain parameter inserted.
9758 std::vector<const Type*> NewTypes;
9759 NewTypes.reserve(FTy->getNumParams()+1);
9761 // Insert the chain's type into the list of parameter types, which may
9762 // mean appending it.
9765 FunctionType::param_iterator I = FTy->param_begin(),
9766 E = FTy->param_end();
9770 // Add the chain's type.
9771 NewTypes.push_back(NestTy);
9776 // Add the original type.
9777 NewTypes.push_back(*I);
9783 // Replace the trampoline call with a direct call. Let the generic
9784 // code sort out any function type mismatches.
9785 FunctionType *NewFTy =
9786 FunctionType::get(FTy->getReturnType(), NewTypes, FTy->isVarArg());
9787 Constant *NewCallee = NestF->getType() == PointerType::getUnqual(NewFTy) ?
9788 NestF : ConstantExpr::getBitCast(NestF, PointerType::getUnqual(NewFTy));
9789 const AttrListPtr &NewPAL = AttrListPtr::get(NewAttrs.begin(),NewAttrs.end());
9791 Instruction *NewCaller;
9792 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
9793 NewCaller = InvokeInst::Create(NewCallee,
9794 II->getNormalDest(), II->getUnwindDest(),
9795 NewArgs.begin(), NewArgs.end(),
9796 Caller->getName(), Caller);
9797 cast<InvokeInst>(NewCaller)->setCallingConv(II->getCallingConv());
9798 cast<InvokeInst>(NewCaller)->setAttributes(NewPAL);
9800 NewCaller = CallInst::Create(NewCallee, NewArgs.begin(), NewArgs.end(),
9801 Caller->getName(), Caller);
9802 if (cast<CallInst>(Caller)->isTailCall())
9803 cast<CallInst>(NewCaller)->setTailCall();
9804 cast<CallInst>(NewCaller)->
9805 setCallingConv(cast<CallInst>(Caller)->getCallingConv());
9806 cast<CallInst>(NewCaller)->setAttributes(NewPAL);
9808 if (Caller->getType() != Type::VoidTy && !Caller->use_empty())
9809 Caller->replaceAllUsesWith(NewCaller);
9810 Caller->eraseFromParent();
9811 RemoveFromWorkList(Caller);
9816 // Replace the trampoline call with a direct call. Since there is no 'nest'
9817 // parameter, there is no need to adjust the argument list. Let the generic
9818 // code sort out any function type mismatches.
9819 Constant *NewCallee =
9820 NestF->getType() == PTy ? NestF : ConstantExpr::getBitCast(NestF, PTy);
9821 CS.setCalledFunction(NewCallee);
9822 return CS.getInstruction();
9825 /// FoldPHIArgBinOpIntoPHI - If we have something like phi [add (a,b), add(c,d)]
9826 /// and if a/b/c/d and the add's all have a single use, turn this into two phi's
9827 /// and a single binop.
9828 Instruction *InstCombiner::FoldPHIArgBinOpIntoPHI(PHINode &PN) {
9829 Instruction *FirstInst = cast<Instruction>(PN.getIncomingValue(0));
9830 assert(isa<BinaryOperator>(FirstInst) || isa<GetElementPtrInst>(FirstInst) ||
9831 isa<CmpInst>(FirstInst));
9832 unsigned Opc = FirstInst->getOpcode();
9833 Value *LHSVal = FirstInst->getOperand(0);
9834 Value *RHSVal = FirstInst->getOperand(1);
9836 const Type *LHSType = LHSVal->getType();
9837 const Type *RHSType = RHSVal->getType();
9839 // Scan to see if all operands are the same opcode, all have one use, and all
9840 // kill their operands (i.e. the operands have one use).
9841 for (unsigned i = 0; i != PN.getNumIncomingValues(); ++i) {
9842 Instruction *I = dyn_cast<Instruction>(PN.getIncomingValue(i));
9843 if (!I || I->getOpcode() != Opc || !I->hasOneUse() ||
9844 // Verify type of the LHS matches so we don't fold cmp's of different
9845 // types or GEP's with different index types.
9846 I->getOperand(0)->getType() != LHSType ||
9847 I->getOperand(1)->getType() != RHSType)
9850 // If they are CmpInst instructions, check their predicates
9851 if (Opc == Instruction::ICmp || Opc == Instruction::FCmp)
9852 if (cast<CmpInst>(I)->getPredicate() !=
9853 cast<CmpInst>(FirstInst)->getPredicate())
9856 // Keep track of which operand needs a phi node.
9857 if (I->getOperand(0) != LHSVal) LHSVal = 0;
9858 if (I->getOperand(1) != RHSVal) RHSVal = 0;
9861 // Otherwise, this is safe to transform, determine if it is profitable.
9863 // If this is a GEP, and if the index (not the pointer) needs a PHI, bail out.
9864 // Indexes are often folded into load/store instructions, so we don't want to
9865 // hide them behind a phi.
9866 if (isa<GetElementPtrInst>(FirstInst) && RHSVal == 0)
9869 Value *InLHS = FirstInst->getOperand(0);
9870 Value *InRHS = FirstInst->getOperand(1);
9871 PHINode *NewLHS = 0, *NewRHS = 0;
9873 NewLHS = PHINode::Create(LHSType,
9874 FirstInst->getOperand(0)->getName() + ".pn");
9875 NewLHS->reserveOperandSpace(PN.getNumOperands()/2);
9876 NewLHS->addIncoming(InLHS, PN.getIncomingBlock(0));
9877 InsertNewInstBefore(NewLHS, PN);
9882 NewRHS = PHINode::Create(RHSType,
9883 FirstInst->getOperand(1)->getName() + ".pn");
9884 NewRHS->reserveOperandSpace(PN.getNumOperands()/2);
9885 NewRHS->addIncoming(InRHS, PN.getIncomingBlock(0));
9886 InsertNewInstBefore(NewRHS, PN);
9890 // Add all operands to the new PHIs.
9891 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
9893 Value *NewInLHS =cast<Instruction>(PN.getIncomingValue(i))->getOperand(0);
9894 NewLHS->addIncoming(NewInLHS, PN.getIncomingBlock(i));
9897 Value *NewInRHS =cast<Instruction>(PN.getIncomingValue(i))->getOperand(1);
9898 NewRHS->addIncoming(NewInRHS, PN.getIncomingBlock(i));
9902 if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(FirstInst))
9903 return BinaryOperator::Create(BinOp->getOpcode(), LHSVal, RHSVal);
9904 else if (CmpInst *CIOp = dyn_cast<CmpInst>(FirstInst))
9905 return CmpInst::Create(CIOp->getOpcode(), CIOp->getPredicate(), LHSVal,
9908 assert(isa<GetElementPtrInst>(FirstInst));
9909 return GetElementPtrInst::Create(LHSVal, RHSVal);
9913 /// isSafeToSinkLoad - Return true if we know that it is safe sink the load out
9914 /// of the block that defines it. This means that it must be obvious the value
9915 /// of the load is not changed from the point of the load to the end of the
9918 /// Finally, it is safe, but not profitable, to sink a load targetting a
9919 /// non-address-taken alloca. Doing so will cause us to not promote the alloca
9921 static bool isSafeToSinkLoad(LoadInst *L) {
9922 BasicBlock::iterator BBI = L, E = L->getParent()->end();
9924 for (++BBI; BBI != E; ++BBI)
9925 if (BBI->mayWriteToMemory())
9928 // Check for non-address taken alloca. If not address-taken already, it isn't
9929 // profitable to do this xform.
9930 if (AllocaInst *AI = dyn_cast<AllocaInst>(L->getOperand(0))) {
9931 bool isAddressTaken = false;
9932 for (Value::use_iterator UI = AI->use_begin(), E = AI->use_end();
9934 if (isa<LoadInst>(UI)) continue;
9935 if (StoreInst *SI = dyn_cast<StoreInst>(*UI)) {
9936 // If storing TO the alloca, then the address isn't taken.
9937 if (SI->getOperand(1) == AI) continue;
9939 isAddressTaken = true;
9943 if (!isAddressTaken)
9951 // FoldPHIArgOpIntoPHI - If all operands to a PHI node are the same "unary"
9952 // operator and they all are only used by the PHI, PHI together their
9953 // inputs, and do the operation once, to the result of the PHI.
9954 Instruction *InstCombiner::FoldPHIArgOpIntoPHI(PHINode &PN) {
9955 Instruction *FirstInst = cast<Instruction>(PN.getIncomingValue(0));
9957 // Scan the instruction, looking for input operations that can be folded away.
9958 // If all input operands to the phi are the same instruction (e.g. a cast from
9959 // the same type or "+42") we can pull the operation through the PHI, reducing
9960 // code size and simplifying code.
9961 Constant *ConstantOp = 0;
9962 const Type *CastSrcTy = 0;
9963 bool isVolatile = false;
9964 if (isa<CastInst>(FirstInst)) {
9965 CastSrcTy = FirstInst->getOperand(0)->getType();
9966 } else if (isa<BinaryOperator>(FirstInst) || isa<CmpInst>(FirstInst)) {
9967 // Can fold binop, compare or shift here if the RHS is a constant,
9968 // otherwise call FoldPHIArgBinOpIntoPHI.
9969 ConstantOp = dyn_cast<Constant>(FirstInst->getOperand(1));
9970 if (ConstantOp == 0)
9971 return FoldPHIArgBinOpIntoPHI(PN);
9972 } else if (LoadInst *LI = dyn_cast<LoadInst>(FirstInst)) {
9973 isVolatile = LI->isVolatile();
9974 // We can't sink the load if the loaded value could be modified between the
9975 // load and the PHI.
9976 if (LI->getParent() != PN.getIncomingBlock(0) ||
9977 !isSafeToSinkLoad(LI))
9980 // If the PHI is of volatile loads and the load block has multiple
9981 // successors, sinking it would remove a load of the volatile value from
9982 // the path through the other successor.
9984 LI->getParent()->getTerminator()->getNumSuccessors() != 1)
9987 } else if (isa<GetElementPtrInst>(FirstInst)) {
9988 if (FirstInst->getNumOperands() == 2)
9989 return FoldPHIArgBinOpIntoPHI(PN);
9990 // Can't handle general GEPs yet.
9993 return 0; // Cannot fold this operation.
9996 // Check to see if all arguments are the same operation.
9997 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
9998 if (!isa<Instruction>(PN.getIncomingValue(i))) return 0;
9999 Instruction *I = cast<Instruction>(PN.getIncomingValue(i));
10000 if (!I->hasOneUse() || !I->isSameOperationAs(FirstInst))
10003 if (I->getOperand(0)->getType() != CastSrcTy)
10004 return 0; // Cast operation must match.
10005 } else if (LoadInst *LI = dyn_cast<LoadInst>(I)) {
10006 // We can't sink the load if the loaded value could be modified between
10007 // the load and the PHI.
10008 if (LI->isVolatile() != isVolatile ||
10009 LI->getParent() != PN.getIncomingBlock(i) ||
10010 !isSafeToSinkLoad(LI))
10013 // If the PHI is of volatile loads and the load block has multiple
10014 // successors, sinking it would remove a load of the volatile value from
10015 // the path through the other successor.
10017 LI->getParent()->getTerminator()->getNumSuccessors() != 1)
10021 } else if (I->getOperand(1) != ConstantOp) {
10026 // Okay, they are all the same operation. Create a new PHI node of the
10027 // correct type, and PHI together all of the LHS's of the instructions.
10028 PHINode *NewPN = PHINode::Create(FirstInst->getOperand(0)->getType(),
10029 PN.getName()+".in");
10030 NewPN->reserveOperandSpace(PN.getNumOperands()/2);
10032 Value *InVal = FirstInst->getOperand(0);
10033 NewPN->addIncoming(InVal, PN.getIncomingBlock(0));
10035 // Add all operands to the new PHI.
10036 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
10037 Value *NewInVal = cast<Instruction>(PN.getIncomingValue(i))->getOperand(0);
10038 if (NewInVal != InVal)
10040 NewPN->addIncoming(NewInVal, PN.getIncomingBlock(i));
10045 // The new PHI unions all of the same values together. This is really
10046 // common, so we handle it intelligently here for compile-time speed.
10050 InsertNewInstBefore(NewPN, PN);
10054 // Insert and return the new operation.
10055 if (CastInst* FirstCI = dyn_cast<CastInst>(FirstInst))
10056 return CastInst::Create(FirstCI->getOpcode(), PhiVal, PN.getType());
10057 if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(FirstInst))
10058 return BinaryOperator::Create(BinOp->getOpcode(), PhiVal, ConstantOp);
10059 if (CmpInst *CIOp = dyn_cast<CmpInst>(FirstInst))
10060 return CmpInst::Create(CIOp->getOpcode(), CIOp->getPredicate(),
10061 PhiVal, ConstantOp);
10062 assert(isa<LoadInst>(FirstInst) && "Unknown operation");
10064 // If this was a volatile load that we are merging, make sure to loop through
10065 // and mark all the input loads as non-volatile. If we don't do this, we will
10066 // insert a new volatile load and the old ones will not be deletable.
10068 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
10069 cast<LoadInst>(PN.getIncomingValue(i))->setVolatile(false);
10071 return new LoadInst(PhiVal, "", isVolatile);
10074 /// DeadPHICycle - Return true if this PHI node is only used by a PHI node cycle
10076 static bool DeadPHICycle(PHINode *PN,
10077 SmallPtrSet<PHINode*, 16> &PotentiallyDeadPHIs) {
10078 if (PN->use_empty()) return true;
10079 if (!PN->hasOneUse()) return false;
10081 // Remember this node, and if we find the cycle, return.
10082 if (!PotentiallyDeadPHIs.insert(PN))
10085 // Don't scan crazily complex things.
10086 if (PotentiallyDeadPHIs.size() == 16)
10089 if (PHINode *PU = dyn_cast<PHINode>(PN->use_back()))
10090 return DeadPHICycle(PU, PotentiallyDeadPHIs);
10095 /// PHIsEqualValue - Return true if this phi node is always equal to
10096 /// NonPhiInVal. This happens with mutually cyclic phi nodes like:
10097 /// z = some value; x = phi (y, z); y = phi (x, z)
10098 static bool PHIsEqualValue(PHINode *PN, Value *NonPhiInVal,
10099 SmallPtrSet<PHINode*, 16> &ValueEqualPHIs) {
10100 // See if we already saw this PHI node.
10101 if (!ValueEqualPHIs.insert(PN))
10104 // Don't scan crazily complex things.
10105 if (ValueEqualPHIs.size() == 16)
10108 // Scan the operands to see if they are either phi nodes or are equal to
10110 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
10111 Value *Op = PN->getIncomingValue(i);
10112 if (PHINode *OpPN = dyn_cast<PHINode>(Op)) {
10113 if (!PHIsEqualValue(OpPN, NonPhiInVal, ValueEqualPHIs))
10115 } else if (Op != NonPhiInVal)
10123 // PHINode simplification
10125 Instruction *InstCombiner::visitPHINode(PHINode &PN) {
10126 // If LCSSA is around, don't mess with Phi nodes
10127 if (MustPreserveLCSSA) return 0;
10129 if (Value *V = PN.hasConstantValue())
10130 return ReplaceInstUsesWith(PN, V);
10132 // If all PHI operands are the same operation, pull them through the PHI,
10133 // reducing code size.
10134 if (isa<Instruction>(PN.getIncomingValue(0)) &&
10135 PN.getIncomingValue(0)->hasOneUse())
10136 if (Instruction *Result = FoldPHIArgOpIntoPHI(PN))
10139 // If this is a trivial cycle in the PHI node graph, remove it. Basically, if
10140 // this PHI only has a single use (a PHI), and if that PHI only has one use (a
10141 // PHI)... break the cycle.
10142 if (PN.hasOneUse()) {
10143 Instruction *PHIUser = cast<Instruction>(PN.use_back());
10144 if (PHINode *PU = dyn_cast<PHINode>(PHIUser)) {
10145 SmallPtrSet<PHINode*, 16> PotentiallyDeadPHIs;
10146 PotentiallyDeadPHIs.insert(&PN);
10147 if (DeadPHICycle(PU, PotentiallyDeadPHIs))
10148 return ReplaceInstUsesWith(PN, UndefValue::get(PN.getType()));
10151 // If this phi has a single use, and if that use just computes a value for
10152 // the next iteration of a loop, delete the phi. This occurs with unused
10153 // induction variables, e.g. "for (int j = 0; ; ++j);". Detecting this
10154 // common case here is good because the only other things that catch this
10155 // are induction variable analysis (sometimes) and ADCE, which is only run
10157 if (PHIUser->hasOneUse() &&
10158 (isa<BinaryOperator>(PHIUser) || isa<GetElementPtrInst>(PHIUser)) &&
10159 PHIUser->use_back() == &PN) {
10160 return ReplaceInstUsesWith(PN, UndefValue::get(PN.getType()));
10164 // We sometimes end up with phi cycles that non-obviously end up being the
10165 // same value, for example:
10166 // z = some value; x = phi (y, z); y = phi (x, z)
10167 // where the phi nodes don't necessarily need to be in the same block. Do a
10168 // quick check to see if the PHI node only contains a single non-phi value, if
10169 // so, scan to see if the phi cycle is actually equal to that value.
10171 unsigned InValNo = 0, NumOperandVals = PN.getNumIncomingValues();
10172 // Scan for the first non-phi operand.
10173 while (InValNo != NumOperandVals &&
10174 isa<PHINode>(PN.getIncomingValue(InValNo)))
10177 if (InValNo != NumOperandVals) {
10178 Value *NonPhiInVal = PN.getOperand(InValNo);
10180 // Scan the rest of the operands to see if there are any conflicts, if so
10181 // there is no need to recursively scan other phis.
10182 for (++InValNo; InValNo != NumOperandVals; ++InValNo) {
10183 Value *OpVal = PN.getIncomingValue(InValNo);
10184 if (OpVal != NonPhiInVal && !isa<PHINode>(OpVal))
10188 // If we scanned over all operands, then we have one unique value plus
10189 // phi values. Scan PHI nodes to see if they all merge in each other or
10191 if (InValNo == NumOperandVals) {
10192 SmallPtrSet<PHINode*, 16> ValueEqualPHIs;
10193 if (PHIsEqualValue(&PN, NonPhiInVal, ValueEqualPHIs))
10194 return ReplaceInstUsesWith(PN, NonPhiInVal);
10201 static Value *InsertCastToIntPtrTy(Value *V, const Type *DTy,
10202 Instruction *InsertPoint,
10203 InstCombiner *IC) {
10204 unsigned PtrSize = DTy->getPrimitiveSizeInBits();
10205 unsigned VTySize = V->getType()->getPrimitiveSizeInBits();
10206 // We must cast correctly to the pointer type. Ensure that we
10207 // sign extend the integer value if it is smaller as this is
10208 // used for address computation.
10209 Instruction::CastOps opcode =
10210 (VTySize < PtrSize ? Instruction::SExt :
10211 (VTySize == PtrSize ? Instruction::BitCast : Instruction::Trunc));
10212 return IC->InsertCastBefore(opcode, V, DTy, *InsertPoint);
10216 Instruction *InstCombiner::visitGetElementPtrInst(GetElementPtrInst &GEP) {
10217 Value *PtrOp = GEP.getOperand(0);
10218 // Is it 'getelementptr %P, i32 0' or 'getelementptr %P'
10219 // If so, eliminate the noop.
10220 if (GEP.getNumOperands() == 1)
10221 return ReplaceInstUsesWith(GEP, PtrOp);
10223 if (isa<UndefValue>(GEP.getOperand(0)))
10224 return ReplaceInstUsesWith(GEP, UndefValue::get(GEP.getType()));
10226 bool HasZeroPointerIndex = false;
10227 if (Constant *C = dyn_cast<Constant>(GEP.getOperand(1)))
10228 HasZeroPointerIndex = C->isNullValue();
10230 if (GEP.getNumOperands() == 2 && HasZeroPointerIndex)
10231 return ReplaceInstUsesWith(GEP, PtrOp);
10233 // Eliminate unneeded casts for indices.
10234 bool MadeChange = false;
10236 gep_type_iterator GTI = gep_type_begin(GEP);
10237 for (User::op_iterator i = GEP.op_begin() + 1, e = GEP.op_end();
10238 i != e; ++i, ++GTI) {
10239 if (isa<SequentialType>(*GTI)) {
10240 if (CastInst *CI = dyn_cast<CastInst>(*i)) {
10241 if (CI->getOpcode() == Instruction::ZExt ||
10242 CI->getOpcode() == Instruction::SExt) {
10243 const Type *SrcTy = CI->getOperand(0)->getType();
10244 // We can eliminate a cast from i32 to i64 iff the target
10245 // is a 32-bit pointer target.
10246 if (SrcTy->getPrimitiveSizeInBits() >= TD->getPointerSizeInBits()) {
10248 *i = CI->getOperand(0);
10252 // If we are using a wider index than needed for this platform, shrink it
10253 // to what we need. If narrower, sign-extend it to what we need.
10254 // If the incoming value needs a cast instruction,
10255 // insert it. This explicit cast can make subsequent optimizations more
10258 if (TD->getTypeSizeInBits(Op->getType()) > TD->getPointerSizeInBits()) {
10259 if (Constant *C = dyn_cast<Constant>(Op)) {
10260 *i = ConstantExpr::getTrunc(C, TD->getIntPtrType());
10263 Op = InsertCastBefore(Instruction::Trunc, Op, TD->getIntPtrType(),
10268 } else if (TD->getTypeSizeInBits(Op->getType()) < TD->getPointerSizeInBits()) {
10269 if (Constant *C = dyn_cast<Constant>(Op)) {
10270 *i = ConstantExpr::getSExt(C, TD->getIntPtrType());
10273 Op = InsertCastBefore(Instruction::SExt, Op, TD->getIntPtrType(),
10281 if (MadeChange) return &GEP;
10283 // If this GEP instruction doesn't move the pointer, and if the input operand
10284 // is a bitcast of another pointer, just replace the GEP with a bitcast of the
10285 // real input to the dest type.
10286 if (GEP.hasAllZeroIndices()) {
10287 if (BitCastInst *BCI = dyn_cast<BitCastInst>(GEP.getOperand(0))) {
10288 // If the bitcast is of an allocation, and the allocation will be
10289 // converted to match the type of the cast, don't touch this.
10290 if (isa<AllocationInst>(BCI->getOperand(0))) {
10291 // See if the bitcast simplifies, if so, don't nuke this GEP yet.
10292 if (Instruction *I = visitBitCast(*BCI)) {
10295 BCI->getParent()->getInstList().insert(BCI, I);
10296 ReplaceInstUsesWith(*BCI, I);
10301 return new BitCastInst(BCI->getOperand(0), GEP.getType());
10305 // Combine Indices - If the source pointer to this getelementptr instruction
10306 // is a getelementptr instruction, combine the indices of the two
10307 // getelementptr instructions into a single instruction.
10309 SmallVector<Value*, 8> SrcGEPOperands;
10310 if (User *Src = dyn_castGetElementPtr(PtrOp))
10311 SrcGEPOperands.append(Src->op_begin(), Src->op_end());
10313 if (!SrcGEPOperands.empty()) {
10314 // Note that if our source is a gep chain itself that we wait for that
10315 // chain to be resolved before we perform this transformation. This
10316 // avoids us creating a TON of code in some cases.
10318 if (isa<GetElementPtrInst>(SrcGEPOperands[0]) &&
10319 cast<Instruction>(SrcGEPOperands[0])->getNumOperands() == 2)
10320 return 0; // Wait until our source is folded to completion.
10322 SmallVector<Value*, 8> Indices;
10324 // Find out whether the last index in the source GEP is a sequential idx.
10325 bool EndsWithSequential = false;
10326 for (gep_type_iterator I = gep_type_begin(*cast<User>(PtrOp)),
10327 E = gep_type_end(*cast<User>(PtrOp)); I != E; ++I)
10328 EndsWithSequential = !isa<StructType>(*I);
10330 // Can we combine the two pointer arithmetics offsets?
10331 if (EndsWithSequential) {
10332 // Replace: gep (gep %P, long B), long A, ...
10333 // With: T = long A+B; gep %P, T, ...
10335 Value *Sum, *SO1 = SrcGEPOperands.back(), *GO1 = GEP.getOperand(1);
10336 if (SO1 == Constant::getNullValue(SO1->getType())) {
10338 } else if (GO1 == Constant::getNullValue(GO1->getType())) {
10341 // If they aren't the same type, convert both to an integer of the
10342 // target's pointer size.
10343 if (SO1->getType() != GO1->getType()) {
10344 if (Constant *SO1C = dyn_cast<Constant>(SO1)) {
10345 SO1 = ConstantExpr::getIntegerCast(SO1C, GO1->getType(), true);
10346 } else if (Constant *GO1C = dyn_cast<Constant>(GO1)) {
10347 GO1 = ConstantExpr::getIntegerCast(GO1C, SO1->getType(), true);
10349 unsigned PS = TD->getPointerSizeInBits();
10350 if (TD->getTypeSizeInBits(SO1->getType()) == PS) {
10351 // Convert GO1 to SO1's type.
10352 GO1 = InsertCastToIntPtrTy(GO1, SO1->getType(), &GEP, this);
10354 } else if (TD->getTypeSizeInBits(GO1->getType()) == PS) {
10355 // Convert SO1 to GO1's type.
10356 SO1 = InsertCastToIntPtrTy(SO1, GO1->getType(), &GEP, this);
10358 const Type *PT = TD->getIntPtrType();
10359 SO1 = InsertCastToIntPtrTy(SO1, PT, &GEP, this);
10360 GO1 = InsertCastToIntPtrTy(GO1, PT, &GEP, this);
10364 if (isa<Constant>(SO1) && isa<Constant>(GO1))
10365 Sum = ConstantExpr::getAdd(cast<Constant>(SO1), cast<Constant>(GO1));
10367 Sum = BinaryOperator::CreateAdd(SO1, GO1, PtrOp->getName()+".sum");
10368 InsertNewInstBefore(cast<Instruction>(Sum), GEP);
10372 // Recycle the GEP we already have if possible.
10373 if (SrcGEPOperands.size() == 2) {
10374 GEP.setOperand(0, SrcGEPOperands[0]);
10375 GEP.setOperand(1, Sum);
10378 Indices.insert(Indices.end(), SrcGEPOperands.begin()+1,
10379 SrcGEPOperands.end()-1);
10380 Indices.push_back(Sum);
10381 Indices.insert(Indices.end(), GEP.op_begin()+2, GEP.op_end());
10383 } else if (isa<Constant>(*GEP.idx_begin()) &&
10384 cast<Constant>(*GEP.idx_begin())->isNullValue() &&
10385 SrcGEPOperands.size() != 1) {
10386 // Otherwise we can do the fold if the first index of the GEP is a zero
10387 Indices.insert(Indices.end(), SrcGEPOperands.begin()+1,
10388 SrcGEPOperands.end());
10389 Indices.insert(Indices.end(), GEP.idx_begin()+1, GEP.idx_end());
10392 if (!Indices.empty())
10393 return GetElementPtrInst::Create(SrcGEPOperands[0], Indices.begin(),
10394 Indices.end(), GEP.getName());
10396 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(PtrOp)) {
10397 // GEP of global variable. If all of the indices for this GEP are
10398 // constants, we can promote this to a constexpr instead of an instruction.
10400 // Scan for nonconstants...
10401 SmallVector<Constant*, 8> Indices;
10402 User::op_iterator I = GEP.idx_begin(), E = GEP.idx_end();
10403 for (; I != E && isa<Constant>(*I); ++I)
10404 Indices.push_back(cast<Constant>(*I));
10406 if (I == E) { // If they are all constants...
10407 Constant *CE = ConstantExpr::getGetElementPtr(GV,
10408 &Indices[0],Indices.size());
10410 // Replace all uses of the GEP with the new constexpr...
10411 return ReplaceInstUsesWith(GEP, CE);
10413 } else if (Value *X = getBitCastOperand(PtrOp)) { // Is the operand a cast?
10414 if (!isa<PointerType>(X->getType())) {
10415 // Not interesting. Source pointer must be a cast from pointer.
10416 } else if (HasZeroPointerIndex) {
10417 // transform: GEP (bitcast [10 x i8]* X to [0 x i8]*), i32 0, ...
10418 // into : GEP [10 x i8]* X, i32 0, ...
10420 // This occurs when the program declares an array extern like "int X[];"
10422 const PointerType *CPTy = cast<PointerType>(PtrOp->getType());
10423 const PointerType *XTy = cast<PointerType>(X->getType());
10424 if (const ArrayType *XATy =
10425 dyn_cast<ArrayType>(XTy->getElementType()))
10426 if (const ArrayType *CATy =
10427 dyn_cast<ArrayType>(CPTy->getElementType()))
10428 if (CATy->getElementType() == XATy->getElementType()) {
10429 // At this point, we know that the cast source type is a pointer
10430 // to an array of the same type as the destination pointer
10431 // array. Because the array type is never stepped over (there
10432 // is a leading zero) we can fold the cast into this GEP.
10433 GEP.setOperand(0, X);
10436 } else if (GEP.getNumOperands() == 2) {
10437 // Transform things like:
10438 // %t = getelementptr i32* bitcast ([2 x i32]* %str to i32*), i32 %V
10439 // into: %t1 = getelementptr [2 x i32]* %str, i32 0, i32 %V; bitcast
10440 const Type *SrcElTy = cast<PointerType>(X->getType())->getElementType();
10441 const Type *ResElTy=cast<PointerType>(PtrOp->getType())->getElementType();
10442 if (isa<ArrayType>(SrcElTy) &&
10443 TD->getABITypeSize(cast<ArrayType>(SrcElTy)->getElementType()) ==
10444 TD->getABITypeSize(ResElTy)) {
10446 Idx[0] = Constant::getNullValue(Type::Int32Ty);
10447 Idx[1] = GEP.getOperand(1);
10448 Value *V = InsertNewInstBefore(
10449 GetElementPtrInst::Create(X, Idx, Idx + 2, GEP.getName()), GEP);
10450 // V and GEP are both pointer types --> BitCast
10451 return new BitCastInst(V, GEP.getType());
10454 // Transform things like:
10455 // getelementptr i8* bitcast ([100 x double]* X to i8*), i32 %tmp
10456 // (where tmp = 8*tmp2) into:
10457 // getelementptr [100 x double]* %arr, i32 0, i32 %tmp2; bitcast
10459 if (isa<ArrayType>(SrcElTy) && ResElTy == Type::Int8Ty) {
10460 uint64_t ArrayEltSize =
10461 TD->getABITypeSize(cast<ArrayType>(SrcElTy)->getElementType());
10463 // Check to see if "tmp" is a scale by a multiple of ArrayEltSize. We
10464 // allow either a mul, shift, or constant here.
10466 ConstantInt *Scale = 0;
10467 if (ArrayEltSize == 1) {
10468 NewIdx = GEP.getOperand(1);
10469 Scale = ConstantInt::get(NewIdx->getType(), 1);
10470 } else if (ConstantInt *CI = dyn_cast<ConstantInt>(GEP.getOperand(1))) {
10471 NewIdx = ConstantInt::get(CI->getType(), 1);
10473 } else if (Instruction *Inst =dyn_cast<Instruction>(GEP.getOperand(1))){
10474 if (Inst->getOpcode() == Instruction::Shl &&
10475 isa<ConstantInt>(Inst->getOperand(1))) {
10476 ConstantInt *ShAmt = cast<ConstantInt>(Inst->getOperand(1));
10477 uint32_t ShAmtVal = ShAmt->getLimitedValue(64);
10478 Scale = ConstantInt::get(Inst->getType(), 1ULL << ShAmtVal);
10479 NewIdx = Inst->getOperand(0);
10480 } else if (Inst->getOpcode() == Instruction::Mul &&
10481 isa<ConstantInt>(Inst->getOperand(1))) {
10482 Scale = cast<ConstantInt>(Inst->getOperand(1));
10483 NewIdx = Inst->getOperand(0);
10487 // If the index will be to exactly the right offset with the scale taken
10488 // out, perform the transformation. Note, we don't know whether Scale is
10489 // signed or not. We'll use unsigned version of division/modulo
10490 // operation after making sure Scale doesn't have the sign bit set.
10491 if (Scale && Scale->getSExtValue() >= 0LL &&
10492 Scale->getZExtValue() % ArrayEltSize == 0) {
10493 Scale = ConstantInt::get(Scale->getType(),
10494 Scale->getZExtValue() / ArrayEltSize);
10495 if (Scale->getZExtValue() != 1) {
10496 Constant *C = ConstantExpr::getIntegerCast(Scale, NewIdx->getType(),
10498 Instruction *Sc = BinaryOperator::CreateMul(NewIdx, C, "idxscale");
10499 NewIdx = InsertNewInstBefore(Sc, GEP);
10502 // Insert the new GEP instruction.
10504 Idx[0] = Constant::getNullValue(Type::Int32Ty);
10506 Instruction *NewGEP =
10507 GetElementPtrInst::Create(X, Idx, Idx + 2, GEP.getName());
10508 NewGEP = InsertNewInstBefore(NewGEP, GEP);
10509 // The NewGEP must be pointer typed, so must the old one -> BitCast
10510 return new BitCastInst(NewGEP, GEP.getType());
10519 Instruction *InstCombiner::visitAllocationInst(AllocationInst &AI) {
10520 // Convert: malloc Ty, C - where C is a constant != 1 into: malloc [C x Ty], 1
10521 if (AI.isArrayAllocation()) { // Check C != 1
10522 if (const ConstantInt *C = dyn_cast<ConstantInt>(AI.getArraySize())) {
10523 const Type *NewTy =
10524 ArrayType::get(AI.getAllocatedType(), C->getZExtValue());
10525 AllocationInst *New = 0;
10527 // Create and insert the replacement instruction...
10528 if (isa<MallocInst>(AI))
10529 New = new MallocInst(NewTy, 0, AI.getAlignment(), AI.getName());
10531 assert(isa<AllocaInst>(AI) && "Unknown type of allocation inst!");
10532 New = new AllocaInst(NewTy, 0, AI.getAlignment(), AI.getName());
10535 InsertNewInstBefore(New, AI);
10537 // Scan to the end of the allocation instructions, to skip over a block of
10538 // allocas if possible...
10540 BasicBlock::iterator It = New;
10541 while (isa<AllocationInst>(*It)) ++It;
10543 // Now that I is pointing to the first non-allocation-inst in the block,
10544 // insert our getelementptr instruction...
10546 Value *NullIdx = Constant::getNullValue(Type::Int32Ty);
10550 Value *V = GetElementPtrInst::Create(New, Idx, Idx + 2,
10551 New->getName()+".sub", It);
10553 // Now make everything use the getelementptr instead of the original
10555 return ReplaceInstUsesWith(AI, V);
10556 } else if (isa<UndefValue>(AI.getArraySize())) {
10557 return ReplaceInstUsesWith(AI, Constant::getNullValue(AI.getType()));
10561 // If alloca'ing a zero byte object, replace the alloca with a null pointer.
10562 // Note that we only do this for alloca's, because malloc should allocate and
10563 // return a unique pointer, even for a zero byte allocation.
10564 if (isa<AllocaInst>(AI) && AI.getAllocatedType()->isSized() &&
10565 TD->getABITypeSize(AI.getAllocatedType()) == 0)
10566 return ReplaceInstUsesWith(AI, Constant::getNullValue(AI.getType()));
10571 Instruction *InstCombiner::visitFreeInst(FreeInst &FI) {
10572 Value *Op = FI.getOperand(0);
10574 // free undef -> unreachable.
10575 if (isa<UndefValue>(Op)) {
10576 // Insert a new store to null because we cannot modify the CFG here.
10577 new StoreInst(ConstantInt::getTrue(),
10578 UndefValue::get(PointerType::getUnqual(Type::Int1Ty)), &FI);
10579 return EraseInstFromFunction(FI);
10582 // If we have 'free null' delete the instruction. This can happen in stl code
10583 // when lots of inlining happens.
10584 if (isa<ConstantPointerNull>(Op))
10585 return EraseInstFromFunction(FI);
10587 // Change free <ty>* (cast <ty2>* X to <ty>*) into free <ty2>* X
10588 if (BitCastInst *CI = dyn_cast<BitCastInst>(Op)) {
10589 FI.setOperand(0, CI->getOperand(0));
10593 // Change free (gep X, 0,0,0,0) into free(X)
10594 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(Op)) {
10595 if (GEPI->hasAllZeroIndices()) {
10596 AddToWorkList(GEPI);
10597 FI.setOperand(0, GEPI->getOperand(0));
10602 // Change free(malloc) into nothing, if the malloc has a single use.
10603 if (MallocInst *MI = dyn_cast<MallocInst>(Op))
10604 if (MI->hasOneUse()) {
10605 EraseInstFromFunction(FI);
10606 return EraseInstFromFunction(*MI);
10613 /// InstCombineLoadCast - Fold 'load (cast P)' -> cast (load P)' when possible.
10614 static Instruction *InstCombineLoadCast(InstCombiner &IC, LoadInst &LI,
10615 const TargetData *TD) {
10616 User *CI = cast<User>(LI.getOperand(0));
10617 Value *CastOp = CI->getOperand(0);
10619 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(CI)) {
10620 // Instead of loading constant c string, use corresponding integer value
10621 // directly if string length is small enough.
10623 if (GetConstantStringInfo(CE->getOperand(0), Str) && !Str.empty()) {
10624 unsigned len = Str.length();
10625 const Type *Ty = cast<PointerType>(CE->getType())->getElementType();
10626 unsigned numBits = Ty->getPrimitiveSizeInBits();
10627 // Replace LI with immediate integer store.
10628 if ((numBits >> 3) == len + 1) {
10629 APInt StrVal(numBits, 0);
10630 APInt SingleChar(numBits, 0);
10631 if (TD->isLittleEndian()) {
10632 for (signed i = len-1; i >= 0; i--) {
10633 SingleChar = (uint64_t) Str[i];
10634 StrVal = (StrVal << 8) | SingleChar;
10637 for (unsigned i = 0; i < len; i++) {
10638 SingleChar = (uint64_t) Str[i];
10639 StrVal = (StrVal << 8) | SingleChar;
10641 // Append NULL at the end.
10643 StrVal = (StrVal << 8) | SingleChar;
10645 Value *NL = ConstantInt::get(StrVal);
10646 return IC.ReplaceInstUsesWith(LI, NL);
10651 const Type *DestPTy = cast<PointerType>(CI->getType())->getElementType();
10652 if (const PointerType *SrcTy = dyn_cast<PointerType>(CastOp->getType())) {
10653 const Type *SrcPTy = SrcTy->getElementType();
10655 if (DestPTy->isInteger() || isa<PointerType>(DestPTy) ||
10656 isa<VectorType>(DestPTy)) {
10657 // If the source is an array, the code below will not succeed. Check to
10658 // see if a trivial 'gep P, 0, 0' will help matters. Only do this for
10660 if (const ArrayType *ASrcTy = dyn_cast<ArrayType>(SrcPTy))
10661 if (Constant *CSrc = dyn_cast<Constant>(CastOp))
10662 if (ASrcTy->getNumElements() != 0) {
10664 Idxs[0] = Idxs[1] = Constant::getNullValue(Type::Int32Ty);
10665 CastOp = ConstantExpr::getGetElementPtr(CSrc, Idxs, 2);
10666 SrcTy = cast<PointerType>(CastOp->getType());
10667 SrcPTy = SrcTy->getElementType();
10670 if ((SrcPTy->isInteger() || isa<PointerType>(SrcPTy) ||
10671 isa<VectorType>(SrcPTy)) &&
10672 // Do not allow turning this into a load of an integer, which is then
10673 // casted to a pointer, this pessimizes pointer analysis a lot.
10674 (isa<PointerType>(SrcPTy) == isa<PointerType>(LI.getType())) &&
10675 IC.getTargetData().getTypeSizeInBits(SrcPTy) ==
10676 IC.getTargetData().getTypeSizeInBits(DestPTy)) {
10678 // Okay, we are casting from one integer or pointer type to another of
10679 // the same size. Instead of casting the pointer before the load, cast
10680 // the result of the loaded value.
10681 Value *NewLoad = IC.InsertNewInstBefore(new LoadInst(CastOp,
10683 LI.isVolatile()),LI);
10684 // Now cast the result of the load.
10685 return new BitCastInst(NewLoad, LI.getType());
10692 /// isSafeToLoadUnconditionally - Return true if we know that executing a load
10693 /// from this value cannot trap. If it is not obviously safe to load from the
10694 /// specified pointer, we do a quick local scan of the basic block containing
10695 /// ScanFrom, to determine if the address is already accessed.
10696 static bool isSafeToLoadUnconditionally(Value *V, Instruction *ScanFrom) {
10697 // If it is an alloca it is always safe to load from.
10698 if (isa<AllocaInst>(V)) return true;
10700 // If it is a global variable it is mostly safe to load from.
10701 if (const GlobalValue *GV = dyn_cast<GlobalVariable>(V))
10702 // Don't try to evaluate aliases. External weak GV can be null.
10703 return !isa<GlobalAlias>(GV) && !GV->hasExternalWeakLinkage();
10705 // Otherwise, be a little bit agressive by scanning the local block where we
10706 // want to check to see if the pointer is already being loaded or stored
10707 // from/to. If so, the previous load or store would have already trapped,
10708 // so there is no harm doing an extra load (also, CSE will later eliminate
10709 // the load entirely).
10710 BasicBlock::iterator BBI = ScanFrom, E = ScanFrom->getParent()->begin();
10715 // If we see a free or a call (which might do a free) the pointer could be
10717 if (isa<FreeInst>(BBI) || isa<CallInst>(BBI))
10720 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) {
10721 if (LI->getOperand(0) == V) return true;
10722 } else if (StoreInst *SI = dyn_cast<StoreInst>(BBI)) {
10723 if (SI->getOperand(1) == V) return true;
10730 /// equivalentAddressValues - Test if A and B will obviously have the same
10731 /// value. This includes recognizing that %t0 and %t1 will have the same
10732 /// value in code like this:
10733 /// %t0 = getelementptr @a, 0, 3
10734 /// store i32 0, i32* %t0
10735 /// %t1 = getelementptr @a, 0, 3
10736 /// %t2 = load i32* %t1
10738 static bool equivalentAddressValues(Value *A, Value *B) {
10739 // Test if the values are trivially equivalent.
10740 if (A == B) return true;
10742 // Test if the values come form identical arithmetic instructions.
10743 if (isa<BinaryOperator>(A) ||
10744 isa<CastInst>(A) ||
10746 isa<GetElementPtrInst>(A))
10747 if (Instruction *BI = dyn_cast<Instruction>(B))
10748 if (cast<Instruction>(A)->isIdenticalTo(BI))
10751 // Otherwise they may not be equivalent.
10755 Instruction *InstCombiner::visitLoadInst(LoadInst &LI) {
10756 Value *Op = LI.getOperand(0);
10758 // Attempt to improve the alignment.
10759 unsigned KnownAlign = GetOrEnforceKnownAlignment(Op);
10761 (LI.getAlignment() == 0 ? TD->getABITypeAlignment(LI.getType()) :
10762 LI.getAlignment()))
10763 LI.setAlignment(KnownAlign);
10765 // load (cast X) --> cast (load X) iff safe
10766 if (isa<CastInst>(Op))
10767 if (Instruction *Res = InstCombineLoadCast(*this, LI, TD))
10770 // None of the following transforms are legal for volatile loads.
10771 if (LI.isVolatile()) return 0;
10773 // Do really simple store-to-load forwarding and load CSE, to catch cases
10774 // where there are several consequtive memory accesses to the same location,
10775 // separated by a few arithmetic operations.
10776 BasicBlock::iterator BBI = &LI;
10777 for (unsigned ScanInsts = 6; BBI != LI.getParent()->begin() && ScanInsts;
10781 if (StoreInst *SI = dyn_cast<StoreInst>(BBI)) {
10782 if (equivalentAddressValues(SI->getOperand(1), LI.getOperand(0)))
10783 return ReplaceInstUsesWith(LI, SI->getOperand(0));
10784 } else if (LoadInst *LIB = dyn_cast<LoadInst>(BBI)) {
10785 if (equivalentAddressValues(LIB->getOperand(0), LI.getOperand(0)))
10786 return ReplaceInstUsesWith(LI, LIB);
10789 // Don't skip over things that can modify memory.
10790 if (BBI->mayWriteToMemory())
10794 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(Op)) {
10795 const Value *GEPI0 = GEPI->getOperand(0);
10796 // TODO: Consider a target hook for valid address spaces for this xform.
10797 if (isa<ConstantPointerNull>(GEPI0) &&
10798 cast<PointerType>(GEPI0->getType())->getAddressSpace() == 0) {
10799 // Insert a new store to null instruction before the load to indicate
10800 // that this code is not reachable. We do this instead of inserting
10801 // an unreachable instruction directly because we cannot modify the
10803 new StoreInst(UndefValue::get(LI.getType()),
10804 Constant::getNullValue(Op->getType()), &LI);
10805 return ReplaceInstUsesWith(LI, UndefValue::get(LI.getType()));
10809 if (Constant *C = dyn_cast<Constant>(Op)) {
10810 // load null/undef -> undef
10811 // TODO: Consider a target hook for valid address spaces for this xform.
10812 if (isa<UndefValue>(C) || (C->isNullValue() &&
10813 cast<PointerType>(Op->getType())->getAddressSpace() == 0)) {
10814 // Insert a new store to null instruction before the load to indicate that
10815 // this code is not reachable. We do this instead of inserting an
10816 // unreachable instruction directly because we cannot modify the CFG.
10817 new StoreInst(UndefValue::get(LI.getType()),
10818 Constant::getNullValue(Op->getType()), &LI);
10819 return ReplaceInstUsesWith(LI, UndefValue::get(LI.getType()));
10822 // Instcombine load (constant global) into the value loaded.
10823 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(Op))
10824 if (GV->isConstant() && !GV->isDeclaration())
10825 return ReplaceInstUsesWith(LI, GV->getInitializer());
10827 // Instcombine load (constantexpr_GEP global, 0, ...) into the value loaded.
10828 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Op)) {
10829 if (CE->getOpcode() == Instruction::GetElementPtr) {
10830 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(CE->getOperand(0)))
10831 if (GV->isConstant() && !GV->isDeclaration())
10833 ConstantFoldLoadThroughGEPConstantExpr(GV->getInitializer(), CE))
10834 return ReplaceInstUsesWith(LI, V);
10835 if (CE->getOperand(0)->isNullValue()) {
10836 // Insert a new store to null instruction before the load to indicate
10837 // that this code is not reachable. We do this instead of inserting
10838 // an unreachable instruction directly because we cannot modify the
10840 new StoreInst(UndefValue::get(LI.getType()),
10841 Constant::getNullValue(Op->getType()), &LI);
10842 return ReplaceInstUsesWith(LI, UndefValue::get(LI.getType()));
10845 } else if (CE->isCast()) {
10846 if (Instruction *Res = InstCombineLoadCast(*this, LI, TD))
10852 // If this load comes from anywhere in a constant global, and if the global
10853 // is all undef or zero, we know what it loads.
10854 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(Op->getUnderlyingObject())){
10855 if (GV->isConstant() && GV->hasInitializer()) {
10856 if (GV->getInitializer()->isNullValue())
10857 return ReplaceInstUsesWith(LI, Constant::getNullValue(LI.getType()));
10858 else if (isa<UndefValue>(GV->getInitializer()))
10859 return ReplaceInstUsesWith(LI, UndefValue::get(LI.getType()));
10863 if (Op->hasOneUse()) {
10864 // Change select and PHI nodes to select values instead of addresses: this
10865 // helps alias analysis out a lot, allows many others simplifications, and
10866 // exposes redundancy in the code.
10868 // Note that we cannot do the transformation unless we know that the
10869 // introduced loads cannot trap! Something like this is valid as long as
10870 // the condition is always false: load (select bool %C, int* null, int* %G),
10871 // but it would not be valid if we transformed it to load from null
10872 // unconditionally.
10874 if (SelectInst *SI = dyn_cast<SelectInst>(Op)) {
10875 // load (select (Cond, &V1, &V2)) --> select(Cond, load &V1, load &V2).
10876 if (isSafeToLoadUnconditionally(SI->getOperand(1), SI) &&
10877 isSafeToLoadUnconditionally(SI->getOperand(2), SI)) {
10878 Value *V1 = InsertNewInstBefore(new LoadInst(SI->getOperand(1),
10879 SI->getOperand(1)->getName()+".val"), LI);
10880 Value *V2 = InsertNewInstBefore(new LoadInst(SI->getOperand(2),
10881 SI->getOperand(2)->getName()+".val"), LI);
10882 return SelectInst::Create(SI->getCondition(), V1, V2);
10885 // load (select (cond, null, P)) -> load P
10886 if (Constant *C = dyn_cast<Constant>(SI->getOperand(1)))
10887 if (C->isNullValue()) {
10888 LI.setOperand(0, SI->getOperand(2));
10892 // load (select (cond, P, null)) -> load P
10893 if (Constant *C = dyn_cast<Constant>(SI->getOperand(2)))
10894 if (C->isNullValue()) {
10895 LI.setOperand(0, SI->getOperand(1));
10903 /// InstCombineStoreToCast - Fold store V, (cast P) -> store (cast V), P
10905 static Instruction *InstCombineStoreToCast(InstCombiner &IC, StoreInst &SI) {
10906 User *CI = cast<User>(SI.getOperand(1));
10907 Value *CastOp = CI->getOperand(0);
10909 const Type *DestPTy = cast<PointerType>(CI->getType())->getElementType();
10910 if (const PointerType *SrcTy = dyn_cast<PointerType>(CastOp->getType())) {
10911 const Type *SrcPTy = SrcTy->getElementType();
10913 if (DestPTy->isInteger() || isa<PointerType>(DestPTy)) {
10914 // If the source is an array, the code below will not succeed. Check to
10915 // see if a trivial 'gep P, 0, 0' will help matters. Only do this for
10917 if (const ArrayType *ASrcTy = dyn_cast<ArrayType>(SrcPTy))
10918 if (Constant *CSrc = dyn_cast<Constant>(CastOp))
10919 if (ASrcTy->getNumElements() != 0) {
10921 Idxs[0] = Idxs[1] = Constant::getNullValue(Type::Int32Ty);
10922 CastOp = ConstantExpr::getGetElementPtr(CSrc, Idxs, 2);
10923 SrcTy = cast<PointerType>(CastOp->getType());
10924 SrcPTy = SrcTy->getElementType();
10927 if ((SrcPTy->isInteger() || isa<PointerType>(SrcPTy)) &&
10928 IC.getTargetData().getTypeSizeInBits(SrcPTy) ==
10929 IC.getTargetData().getTypeSizeInBits(DestPTy)) {
10931 // Okay, we are casting from one integer or pointer type to another of
10932 // the same size. Instead of casting the pointer before
10933 // the store, cast the value to be stored.
10935 Value *SIOp0 = SI.getOperand(0);
10936 Instruction::CastOps opcode = Instruction::BitCast;
10937 const Type* CastSrcTy = SIOp0->getType();
10938 const Type* CastDstTy = SrcPTy;
10939 if (isa<PointerType>(CastDstTy)) {
10940 if (CastSrcTy->isInteger())
10941 opcode = Instruction::IntToPtr;
10942 } else if (isa<IntegerType>(CastDstTy)) {
10943 if (isa<PointerType>(SIOp0->getType()))
10944 opcode = Instruction::PtrToInt;
10946 if (Constant *C = dyn_cast<Constant>(SIOp0))
10947 NewCast = ConstantExpr::getCast(opcode, C, CastDstTy);
10949 NewCast = IC.InsertNewInstBefore(
10950 CastInst::Create(opcode, SIOp0, CastDstTy, SIOp0->getName()+".c"),
10952 return new StoreInst(NewCast, CastOp);
10959 Instruction *InstCombiner::visitStoreInst(StoreInst &SI) {
10960 Value *Val = SI.getOperand(0);
10961 Value *Ptr = SI.getOperand(1);
10963 if (isa<UndefValue>(Ptr)) { // store X, undef -> noop (even if volatile)
10964 EraseInstFromFunction(SI);
10969 // If the RHS is an alloca with a single use, zapify the store, making the
10971 if (Ptr->hasOneUse() && !SI.isVolatile()) {
10972 if (isa<AllocaInst>(Ptr)) {
10973 EraseInstFromFunction(SI);
10978 if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Ptr))
10979 if (isa<AllocaInst>(GEP->getOperand(0)) &&
10980 GEP->getOperand(0)->hasOneUse()) {
10981 EraseInstFromFunction(SI);
10987 // Attempt to improve the alignment.
10988 unsigned KnownAlign = GetOrEnforceKnownAlignment(Ptr);
10990 (SI.getAlignment() == 0 ? TD->getABITypeAlignment(Val->getType()) :
10991 SI.getAlignment()))
10992 SI.setAlignment(KnownAlign);
10994 // Do really simple DSE, to catch cases where there are several consequtive
10995 // stores to the same location, separated by a few arithmetic operations. This
10996 // situation often occurs with bitfield accesses.
10997 BasicBlock::iterator BBI = &SI;
10998 for (unsigned ScanInsts = 6; BBI != SI.getParent()->begin() && ScanInsts;
11002 if (StoreInst *PrevSI = dyn_cast<StoreInst>(BBI)) {
11003 // Prev store isn't volatile, and stores to the same location?
11004 if (!PrevSI->isVolatile() && equivalentAddressValues(PrevSI->getOperand(1),
11005 SI.getOperand(1))) {
11008 EraseInstFromFunction(*PrevSI);
11014 // If this is a load, we have to stop. However, if the loaded value is from
11015 // the pointer we're loading and is producing the pointer we're storing,
11016 // then *this* store is dead (X = load P; store X -> P).
11017 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) {
11018 if (LI == Val && equivalentAddressValues(LI->getOperand(0), Ptr) &&
11019 !SI.isVolatile()) {
11020 EraseInstFromFunction(SI);
11024 // Otherwise, this is a load from some other location. Stores before it
11025 // may not be dead.
11029 // Don't skip over loads or things that can modify memory.
11030 if (BBI->mayWriteToMemory() || BBI->mayReadFromMemory())
11035 if (SI.isVolatile()) return 0; // Don't hack volatile stores.
11037 // store X, null -> turns into 'unreachable' in SimplifyCFG
11038 if (isa<ConstantPointerNull>(Ptr)) {
11039 if (!isa<UndefValue>(Val)) {
11040 SI.setOperand(0, UndefValue::get(Val->getType()));
11041 if (Instruction *U = dyn_cast<Instruction>(Val))
11042 AddToWorkList(U); // Dropped a use.
11045 return 0; // Do not modify these!
11048 // store undef, Ptr -> noop
11049 if (isa<UndefValue>(Val)) {
11050 EraseInstFromFunction(SI);
11055 // If the pointer destination is a cast, see if we can fold the cast into the
11057 if (isa<CastInst>(Ptr))
11058 if (Instruction *Res = InstCombineStoreToCast(*this, SI))
11060 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Ptr))
11062 if (Instruction *Res = InstCombineStoreToCast(*this, SI))
11066 // If this store is the last instruction in the basic block, and if the block
11067 // ends with an unconditional branch, try to move it to the successor block.
11069 if (BranchInst *BI = dyn_cast<BranchInst>(BBI))
11070 if (BI->isUnconditional())
11071 if (SimplifyStoreAtEndOfBlock(SI))
11072 return 0; // xform done!
11077 /// SimplifyStoreAtEndOfBlock - Turn things like:
11078 /// if () { *P = v1; } else { *P = v2 }
11079 /// into a phi node with a store in the successor.
11081 /// Simplify things like:
11082 /// *P = v1; if () { *P = v2; }
11083 /// into a phi node with a store in the successor.
11085 bool InstCombiner::SimplifyStoreAtEndOfBlock(StoreInst &SI) {
11086 BasicBlock *StoreBB = SI.getParent();
11088 // Check to see if the successor block has exactly two incoming edges. If
11089 // so, see if the other predecessor contains a store to the same location.
11090 // if so, insert a PHI node (if needed) and move the stores down.
11091 BasicBlock *DestBB = StoreBB->getTerminator()->getSuccessor(0);
11093 // Determine whether Dest has exactly two predecessors and, if so, compute
11094 // the other predecessor.
11095 pred_iterator PI = pred_begin(DestBB);
11096 BasicBlock *OtherBB = 0;
11097 if (*PI != StoreBB)
11100 if (PI == pred_end(DestBB))
11103 if (*PI != StoreBB) {
11108 if (++PI != pred_end(DestBB))
11111 // Bail out if all the relevant blocks aren't distinct (this can happen,
11112 // for example, if SI is in an infinite loop)
11113 if (StoreBB == DestBB || OtherBB == DestBB)
11116 // Verify that the other block ends in a branch and is not otherwise empty.
11117 BasicBlock::iterator BBI = OtherBB->getTerminator();
11118 BranchInst *OtherBr = dyn_cast<BranchInst>(BBI);
11119 if (!OtherBr || BBI == OtherBB->begin())
11122 // If the other block ends in an unconditional branch, check for the 'if then
11123 // else' case. there is an instruction before the branch.
11124 StoreInst *OtherStore = 0;
11125 if (OtherBr->isUnconditional()) {
11126 // If this isn't a store, or isn't a store to the same location, bail out.
11128 OtherStore = dyn_cast<StoreInst>(BBI);
11129 if (!OtherStore || OtherStore->getOperand(1) != SI.getOperand(1))
11132 // Otherwise, the other block ended with a conditional branch. If one of the
11133 // destinations is StoreBB, then we have the if/then case.
11134 if (OtherBr->getSuccessor(0) != StoreBB &&
11135 OtherBr->getSuccessor(1) != StoreBB)
11138 // Okay, we know that OtherBr now goes to Dest and StoreBB, so this is an
11139 // if/then triangle. See if there is a store to the same ptr as SI that
11140 // lives in OtherBB.
11142 // Check to see if we find the matching store.
11143 if ((OtherStore = dyn_cast<StoreInst>(BBI))) {
11144 if (OtherStore->getOperand(1) != SI.getOperand(1))
11148 // If we find something that may be using or overwriting the stored
11149 // value, or if we run out of instructions, we can't do the xform.
11150 if (BBI->mayReadFromMemory() || BBI->mayWriteToMemory() ||
11151 BBI == OtherBB->begin())
11155 // In order to eliminate the store in OtherBr, we have to
11156 // make sure nothing reads or overwrites the stored value in
11158 for (BasicBlock::iterator I = StoreBB->begin(); &*I != &SI; ++I) {
11159 // FIXME: This should really be AA driven.
11160 if (I->mayReadFromMemory() || I->mayWriteToMemory())
11165 // Insert a PHI node now if we need it.
11166 Value *MergedVal = OtherStore->getOperand(0);
11167 if (MergedVal != SI.getOperand(0)) {
11168 PHINode *PN = PHINode::Create(MergedVal->getType(), "storemerge");
11169 PN->reserveOperandSpace(2);
11170 PN->addIncoming(SI.getOperand(0), SI.getParent());
11171 PN->addIncoming(OtherStore->getOperand(0), OtherBB);
11172 MergedVal = InsertNewInstBefore(PN, DestBB->front());
11175 // Advance to a place where it is safe to insert the new store and
11177 BBI = DestBB->getFirstNonPHI();
11178 InsertNewInstBefore(new StoreInst(MergedVal, SI.getOperand(1),
11179 OtherStore->isVolatile()), *BBI);
11181 // Nuke the old stores.
11182 EraseInstFromFunction(SI);
11183 EraseInstFromFunction(*OtherStore);
11189 Instruction *InstCombiner::visitBranchInst(BranchInst &BI) {
11190 // Change br (not X), label True, label False to: br X, label False, True
11192 BasicBlock *TrueDest;
11193 BasicBlock *FalseDest;
11194 if (match(&BI, m_Br(m_Not(m_Value(X)), TrueDest, FalseDest)) &&
11195 !isa<Constant>(X)) {
11196 // Swap Destinations and condition...
11197 BI.setCondition(X);
11198 BI.setSuccessor(0, FalseDest);
11199 BI.setSuccessor(1, TrueDest);
11203 // Cannonicalize fcmp_one -> fcmp_oeq
11204 FCmpInst::Predicate FPred; Value *Y;
11205 if (match(&BI, m_Br(m_FCmp(FPred, m_Value(X), m_Value(Y)),
11206 TrueDest, FalseDest)))
11207 if ((FPred == FCmpInst::FCMP_ONE || FPred == FCmpInst::FCMP_OLE ||
11208 FPred == FCmpInst::FCMP_OGE) && BI.getCondition()->hasOneUse()) {
11209 FCmpInst *I = cast<FCmpInst>(BI.getCondition());
11210 FCmpInst::Predicate NewPred = FCmpInst::getInversePredicate(FPred);
11211 Instruction *NewSCC = new FCmpInst(NewPred, X, Y, "", I);
11212 NewSCC->takeName(I);
11213 // Swap Destinations and condition...
11214 BI.setCondition(NewSCC);
11215 BI.setSuccessor(0, FalseDest);
11216 BI.setSuccessor(1, TrueDest);
11217 RemoveFromWorkList(I);
11218 I->eraseFromParent();
11219 AddToWorkList(NewSCC);
11223 // Cannonicalize icmp_ne -> icmp_eq
11224 ICmpInst::Predicate IPred;
11225 if (match(&BI, m_Br(m_ICmp(IPred, m_Value(X), m_Value(Y)),
11226 TrueDest, FalseDest)))
11227 if ((IPred == ICmpInst::ICMP_NE || IPred == ICmpInst::ICMP_ULE ||
11228 IPred == ICmpInst::ICMP_SLE || IPred == ICmpInst::ICMP_UGE ||
11229 IPred == ICmpInst::ICMP_SGE) && BI.getCondition()->hasOneUse()) {
11230 ICmpInst *I = cast<ICmpInst>(BI.getCondition());
11231 ICmpInst::Predicate NewPred = ICmpInst::getInversePredicate(IPred);
11232 Instruction *NewSCC = new ICmpInst(NewPred, X, Y, "", I);
11233 NewSCC->takeName(I);
11234 // Swap Destinations and condition...
11235 BI.setCondition(NewSCC);
11236 BI.setSuccessor(0, FalseDest);
11237 BI.setSuccessor(1, TrueDest);
11238 RemoveFromWorkList(I);
11239 I->eraseFromParent();;
11240 AddToWorkList(NewSCC);
11247 Instruction *InstCombiner::visitSwitchInst(SwitchInst &SI) {
11248 Value *Cond = SI.getCondition();
11249 if (Instruction *I = dyn_cast<Instruction>(Cond)) {
11250 if (I->getOpcode() == Instruction::Add)
11251 if (ConstantInt *AddRHS = dyn_cast<ConstantInt>(I->getOperand(1))) {
11252 // change 'switch (X+4) case 1:' into 'switch (X) case -3'
11253 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2)
11254 SI.setOperand(i,ConstantExpr::getSub(cast<Constant>(SI.getOperand(i)),
11256 SI.setOperand(0, I->getOperand(0));
11264 Instruction *InstCombiner::visitExtractValueInst(ExtractValueInst &EV) {
11265 Value *Agg = EV.getAggregateOperand();
11267 if (!EV.hasIndices())
11268 return ReplaceInstUsesWith(EV, Agg);
11270 if (Constant *C = dyn_cast<Constant>(Agg)) {
11271 if (isa<UndefValue>(C))
11272 return ReplaceInstUsesWith(EV, UndefValue::get(EV.getType()));
11274 if (isa<ConstantAggregateZero>(C))
11275 return ReplaceInstUsesWith(EV, Constant::getNullValue(EV.getType()));
11277 if (isa<ConstantArray>(C) || isa<ConstantStruct>(C)) {
11278 // Extract the element indexed by the first index out of the constant
11279 Value *V = C->getOperand(*EV.idx_begin());
11280 if (EV.getNumIndices() > 1)
11281 // Extract the remaining indices out of the constant indexed by the
11283 return ExtractValueInst::Create(V, EV.idx_begin() + 1, EV.idx_end());
11285 return ReplaceInstUsesWith(EV, V);
11287 return 0; // Can't handle other constants
11289 if (InsertValueInst *IV = dyn_cast<InsertValueInst>(Agg)) {
11290 // We're extracting from an insertvalue instruction, compare the indices
11291 const unsigned *exti, *exte, *insi, *inse;
11292 for (exti = EV.idx_begin(), insi = IV->idx_begin(),
11293 exte = EV.idx_end(), inse = IV->idx_end();
11294 exti != exte && insi != inse;
11296 if (*insi != *exti)
11297 // The insert and extract both reference distinctly different elements.
11298 // This means the extract is not influenced by the insert, and we can
11299 // replace the aggregate operand of the extract with the aggregate
11300 // operand of the insert. i.e., replace
11301 // %I = insertvalue { i32, { i32 } } %A, { i32 } { i32 42 }, 1
11302 // %E = extractvalue { i32, { i32 } } %I, 0
11304 // %E = extractvalue { i32, { i32 } } %A, 0
11305 return ExtractValueInst::Create(IV->getAggregateOperand(),
11306 EV.idx_begin(), EV.idx_end());
11308 if (exti == exte && insi == inse)
11309 // Both iterators are at the end: Index lists are identical. Replace
11310 // %B = insertvalue { i32, { i32 } } %A, i32 42, 1, 0
11311 // %C = extractvalue { i32, { i32 } } %B, 1, 0
11313 return ReplaceInstUsesWith(EV, IV->getInsertedValueOperand());
11314 if (exti == exte) {
11315 // The extract list is a prefix of the insert list. i.e. replace
11316 // %I = insertvalue { i32, { i32 } } %A, i32 42, 1, 0
11317 // %E = extractvalue { i32, { i32 } } %I, 1
11319 // %X = extractvalue { i32, { i32 } } %A, 1
11320 // %E = insertvalue { i32 } %X, i32 42, 0
11321 // by switching the order of the insert and extract (though the
11322 // insertvalue should be left in, since it may have other uses).
11323 Value *NewEV = InsertNewInstBefore(
11324 ExtractValueInst::Create(IV->getAggregateOperand(),
11325 EV.idx_begin(), EV.idx_end()),
11327 return InsertValueInst::Create(NewEV, IV->getInsertedValueOperand(),
11331 // The insert list is a prefix of the extract list
11332 // We can simply remove the common indices from the extract and make it
11333 // operate on the inserted value instead of the insertvalue result.
11335 // %I = insertvalue { i32, { i32 } } %A, { i32 } { i32 42 }, 1
11336 // %E = extractvalue { i32, { i32 } } %I, 1, 0
11338 // %E extractvalue { i32 } { i32 42 }, 0
11339 return ExtractValueInst::Create(IV->getInsertedValueOperand(),
11342 // Can't simplify extracts from other values. Note that nested extracts are
11343 // already simplified implicitely by the above (extract ( extract (insert) )
11344 // will be translated into extract ( insert ( extract ) ) first and then just
11345 // the value inserted, if appropriate).
11349 /// CheapToScalarize - Return true if the value is cheaper to scalarize than it
11350 /// is to leave as a vector operation.
11351 static bool CheapToScalarize(Value *V, bool isConstant) {
11352 if (isa<ConstantAggregateZero>(V))
11354 if (ConstantVector *C = dyn_cast<ConstantVector>(V)) {
11355 if (isConstant) return true;
11356 // If all elts are the same, we can extract.
11357 Constant *Op0 = C->getOperand(0);
11358 for (unsigned i = 1; i < C->getNumOperands(); ++i)
11359 if (C->getOperand(i) != Op0)
11363 Instruction *I = dyn_cast<Instruction>(V);
11364 if (!I) return false;
11366 // Insert element gets simplified to the inserted element or is deleted if
11367 // this is constant idx extract element and its a constant idx insertelt.
11368 if (I->getOpcode() == Instruction::InsertElement && isConstant &&
11369 isa<ConstantInt>(I->getOperand(2)))
11371 if (I->getOpcode() == Instruction::Load && I->hasOneUse())
11373 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(I))
11374 if (BO->hasOneUse() &&
11375 (CheapToScalarize(BO->getOperand(0), isConstant) ||
11376 CheapToScalarize(BO->getOperand(1), isConstant)))
11378 if (CmpInst *CI = dyn_cast<CmpInst>(I))
11379 if (CI->hasOneUse() &&
11380 (CheapToScalarize(CI->getOperand(0), isConstant) ||
11381 CheapToScalarize(CI->getOperand(1), isConstant)))
11387 /// Read and decode a shufflevector mask.
11389 /// It turns undef elements into values that are larger than the number of
11390 /// elements in the input.
11391 static std::vector<unsigned> getShuffleMask(const ShuffleVectorInst *SVI) {
11392 unsigned NElts = SVI->getType()->getNumElements();
11393 if (isa<ConstantAggregateZero>(SVI->getOperand(2)))
11394 return std::vector<unsigned>(NElts, 0);
11395 if (isa<UndefValue>(SVI->getOperand(2)))
11396 return std::vector<unsigned>(NElts, 2*NElts);
11398 std::vector<unsigned> Result;
11399 const ConstantVector *CP = cast<ConstantVector>(SVI->getOperand(2));
11400 for (User::const_op_iterator i = CP->op_begin(), e = CP->op_end(); i!=e; ++i)
11401 if (isa<UndefValue>(*i))
11402 Result.push_back(NElts*2); // undef -> 8
11404 Result.push_back(cast<ConstantInt>(*i)->getZExtValue());
11408 /// FindScalarElement - Given a vector and an element number, see if the scalar
11409 /// value is already around as a register, for example if it were inserted then
11410 /// extracted from the vector.
11411 static Value *FindScalarElement(Value *V, unsigned EltNo) {
11412 assert(isa<VectorType>(V->getType()) && "Not looking at a vector?");
11413 const VectorType *PTy = cast<VectorType>(V->getType());
11414 unsigned Width = PTy->getNumElements();
11415 if (EltNo >= Width) // Out of range access.
11416 return UndefValue::get(PTy->getElementType());
11418 if (isa<UndefValue>(V))
11419 return UndefValue::get(PTy->getElementType());
11420 else if (isa<ConstantAggregateZero>(V))
11421 return Constant::getNullValue(PTy->getElementType());
11422 else if (ConstantVector *CP = dyn_cast<ConstantVector>(V))
11423 return CP->getOperand(EltNo);
11424 else if (InsertElementInst *III = dyn_cast<InsertElementInst>(V)) {
11425 // If this is an insert to a variable element, we don't know what it is.
11426 if (!isa<ConstantInt>(III->getOperand(2)))
11428 unsigned IIElt = cast<ConstantInt>(III->getOperand(2))->getZExtValue();
11430 // If this is an insert to the element we are looking for, return the
11432 if (EltNo == IIElt)
11433 return III->getOperand(1);
11435 // Otherwise, the insertelement doesn't modify the value, recurse on its
11437 return FindScalarElement(III->getOperand(0), EltNo);
11438 } else if (ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(V)) {
11439 unsigned LHSWidth =
11440 cast<VectorType>(SVI->getOperand(0)->getType())->getNumElements();
11441 unsigned InEl = getShuffleMask(SVI)[EltNo];
11442 if (InEl < LHSWidth)
11443 return FindScalarElement(SVI->getOperand(0), InEl);
11444 else if (InEl < LHSWidth*2)
11445 return FindScalarElement(SVI->getOperand(1), InEl - LHSWidth);
11447 return UndefValue::get(PTy->getElementType());
11450 // Otherwise, we don't know.
11454 Instruction *InstCombiner::visitExtractElementInst(ExtractElementInst &EI) {
11455 // If vector val is undef, replace extract with scalar undef.
11456 if (isa<UndefValue>(EI.getOperand(0)))
11457 return ReplaceInstUsesWith(EI, UndefValue::get(EI.getType()));
11459 // If vector val is constant 0, replace extract with scalar 0.
11460 if (isa<ConstantAggregateZero>(EI.getOperand(0)))
11461 return ReplaceInstUsesWith(EI, Constant::getNullValue(EI.getType()));
11463 if (ConstantVector *C = dyn_cast<ConstantVector>(EI.getOperand(0))) {
11464 // If vector val is constant with all elements the same, replace EI with
11465 // that element. When the elements are not identical, we cannot replace yet
11466 // (we do that below, but only when the index is constant).
11467 Constant *op0 = C->getOperand(0);
11468 for (unsigned i = 1; i < C->getNumOperands(); ++i)
11469 if (C->getOperand(i) != op0) {
11474 return ReplaceInstUsesWith(EI, op0);
11477 // If extracting a specified index from the vector, see if we can recursively
11478 // find a previously computed scalar that was inserted into the vector.
11479 if (ConstantInt *IdxC = dyn_cast<ConstantInt>(EI.getOperand(1))) {
11480 unsigned IndexVal = IdxC->getZExtValue();
11481 unsigned VectorWidth =
11482 cast<VectorType>(EI.getOperand(0)->getType())->getNumElements();
11484 // If this is extracting an invalid index, turn this into undef, to avoid
11485 // crashing the code below.
11486 if (IndexVal >= VectorWidth)
11487 return ReplaceInstUsesWith(EI, UndefValue::get(EI.getType()));
11489 // This instruction only demands the single element from the input vector.
11490 // If the input vector has a single use, simplify it based on this use
11492 if (EI.getOperand(0)->hasOneUse() && VectorWidth != 1) {
11493 uint64_t UndefElts;
11494 if (Value *V = SimplifyDemandedVectorElts(EI.getOperand(0),
11497 EI.setOperand(0, V);
11502 if (Value *Elt = FindScalarElement(EI.getOperand(0), IndexVal))
11503 return ReplaceInstUsesWith(EI, Elt);
11505 // If the this extractelement is directly using a bitcast from a vector of
11506 // the same number of elements, see if we can find the source element from
11507 // it. In this case, we will end up needing to bitcast the scalars.
11508 if (BitCastInst *BCI = dyn_cast<BitCastInst>(EI.getOperand(0))) {
11509 if (const VectorType *VT =
11510 dyn_cast<VectorType>(BCI->getOperand(0)->getType()))
11511 if (VT->getNumElements() == VectorWidth)
11512 if (Value *Elt = FindScalarElement(BCI->getOperand(0), IndexVal))
11513 return new BitCastInst(Elt, EI.getType());
11517 if (Instruction *I = dyn_cast<Instruction>(EI.getOperand(0))) {
11518 if (I->hasOneUse()) {
11519 // Push extractelement into predecessor operation if legal and
11520 // profitable to do so
11521 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(I)) {
11522 bool isConstantElt = isa<ConstantInt>(EI.getOperand(1));
11523 if (CheapToScalarize(BO, isConstantElt)) {
11524 ExtractElementInst *newEI0 =
11525 new ExtractElementInst(BO->getOperand(0), EI.getOperand(1),
11526 EI.getName()+".lhs");
11527 ExtractElementInst *newEI1 =
11528 new ExtractElementInst(BO->getOperand(1), EI.getOperand(1),
11529 EI.getName()+".rhs");
11530 InsertNewInstBefore(newEI0, EI);
11531 InsertNewInstBefore(newEI1, EI);
11532 return BinaryOperator::Create(BO->getOpcode(), newEI0, newEI1);
11534 } else if (isa<LoadInst>(I)) {
11536 cast<PointerType>(I->getOperand(0)->getType())->getAddressSpace();
11537 Value *Ptr = InsertBitCastBefore(I->getOperand(0),
11538 PointerType::get(EI.getType(), AS),EI);
11539 GetElementPtrInst *GEP =
11540 GetElementPtrInst::Create(Ptr, EI.getOperand(1), I->getName()+".gep");
11541 InsertNewInstBefore(GEP, EI);
11542 return new LoadInst(GEP);
11545 if (InsertElementInst *IE = dyn_cast<InsertElementInst>(I)) {
11546 // Extracting the inserted element?
11547 if (IE->getOperand(2) == EI.getOperand(1))
11548 return ReplaceInstUsesWith(EI, IE->getOperand(1));
11549 // If the inserted and extracted elements are constants, they must not
11550 // be the same value, extract from the pre-inserted value instead.
11551 if (isa<Constant>(IE->getOperand(2)) &&
11552 isa<Constant>(EI.getOperand(1))) {
11553 AddUsesToWorkList(EI);
11554 EI.setOperand(0, IE->getOperand(0));
11557 } else if (ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(I)) {
11558 // If this is extracting an element from a shufflevector, figure out where
11559 // it came from and extract from the appropriate input element instead.
11560 if (ConstantInt *Elt = dyn_cast<ConstantInt>(EI.getOperand(1))) {
11561 unsigned SrcIdx = getShuffleMask(SVI)[Elt->getZExtValue()];
11563 unsigned LHSWidth =
11564 cast<VectorType>(SVI->getOperand(0)->getType())->getNumElements();
11566 if (SrcIdx < LHSWidth)
11567 Src = SVI->getOperand(0);
11568 else if (SrcIdx < LHSWidth*2) {
11569 SrcIdx -= LHSWidth;
11570 Src = SVI->getOperand(1);
11572 return ReplaceInstUsesWith(EI, UndefValue::get(EI.getType()));
11574 return new ExtractElementInst(Src, SrcIdx);
11581 /// CollectSingleShuffleElements - If V is a shuffle of values that ONLY returns
11582 /// elements from either LHS or RHS, return the shuffle mask and true.
11583 /// Otherwise, return false.
11584 static bool CollectSingleShuffleElements(Value *V, Value *LHS, Value *RHS,
11585 std::vector<Constant*> &Mask) {
11586 assert(V->getType() == LHS->getType() && V->getType() == RHS->getType() &&
11587 "Invalid CollectSingleShuffleElements");
11588 unsigned NumElts = cast<VectorType>(V->getType())->getNumElements();
11590 if (isa<UndefValue>(V)) {
11591 Mask.assign(NumElts, UndefValue::get(Type::Int32Ty));
11593 } else if (V == LHS) {
11594 for (unsigned i = 0; i != NumElts; ++i)
11595 Mask.push_back(ConstantInt::get(Type::Int32Ty, i));
11597 } else if (V == RHS) {
11598 for (unsigned i = 0; i != NumElts; ++i)
11599 Mask.push_back(ConstantInt::get(Type::Int32Ty, i+NumElts));
11601 } else if (InsertElementInst *IEI = dyn_cast<InsertElementInst>(V)) {
11602 // If this is an insert of an extract from some other vector, include it.
11603 Value *VecOp = IEI->getOperand(0);
11604 Value *ScalarOp = IEI->getOperand(1);
11605 Value *IdxOp = IEI->getOperand(2);
11607 if (!isa<ConstantInt>(IdxOp))
11609 unsigned InsertedIdx = cast<ConstantInt>(IdxOp)->getZExtValue();
11611 if (isa<UndefValue>(ScalarOp)) { // inserting undef into vector.
11612 // Okay, we can handle this if the vector we are insertinting into is
11613 // transitively ok.
11614 if (CollectSingleShuffleElements(VecOp, LHS, RHS, Mask)) {
11615 // If so, update the mask to reflect the inserted undef.
11616 Mask[InsertedIdx] = UndefValue::get(Type::Int32Ty);
11619 } else if (ExtractElementInst *EI = dyn_cast<ExtractElementInst>(ScalarOp)){
11620 if (isa<ConstantInt>(EI->getOperand(1)) &&
11621 EI->getOperand(0)->getType() == V->getType()) {
11622 unsigned ExtractedIdx =
11623 cast<ConstantInt>(EI->getOperand(1))->getZExtValue();
11625 // This must be extracting from either LHS or RHS.
11626 if (EI->getOperand(0) == LHS || EI->getOperand(0) == RHS) {
11627 // Okay, we can handle this if the vector we are insertinting into is
11628 // transitively ok.
11629 if (CollectSingleShuffleElements(VecOp, LHS, RHS, Mask)) {
11630 // If so, update the mask to reflect the inserted value.
11631 if (EI->getOperand(0) == LHS) {
11632 Mask[InsertedIdx % NumElts] =
11633 ConstantInt::get(Type::Int32Ty, ExtractedIdx);
11635 assert(EI->getOperand(0) == RHS);
11636 Mask[InsertedIdx % NumElts] =
11637 ConstantInt::get(Type::Int32Ty, ExtractedIdx+NumElts);
11646 // TODO: Handle shufflevector here!
11651 /// CollectShuffleElements - We are building a shuffle of V, using RHS as the
11652 /// RHS of the shuffle instruction, if it is not null. Return a shuffle mask
11653 /// that computes V and the LHS value of the shuffle.
11654 static Value *CollectShuffleElements(Value *V, std::vector<Constant*> &Mask,
11656 assert(isa<VectorType>(V->getType()) &&
11657 (RHS == 0 || V->getType() == RHS->getType()) &&
11658 "Invalid shuffle!");
11659 unsigned NumElts = cast<VectorType>(V->getType())->getNumElements();
11661 if (isa<UndefValue>(V)) {
11662 Mask.assign(NumElts, UndefValue::get(Type::Int32Ty));
11664 } else if (isa<ConstantAggregateZero>(V)) {
11665 Mask.assign(NumElts, ConstantInt::get(Type::Int32Ty, 0));
11667 } else if (InsertElementInst *IEI = dyn_cast<InsertElementInst>(V)) {
11668 // If this is an insert of an extract from some other vector, include it.
11669 Value *VecOp = IEI->getOperand(0);
11670 Value *ScalarOp = IEI->getOperand(1);
11671 Value *IdxOp = IEI->getOperand(2);
11673 if (ExtractElementInst *EI = dyn_cast<ExtractElementInst>(ScalarOp)) {
11674 if (isa<ConstantInt>(EI->getOperand(1)) && isa<ConstantInt>(IdxOp) &&
11675 EI->getOperand(0)->getType() == V->getType()) {
11676 unsigned ExtractedIdx =
11677 cast<ConstantInt>(EI->getOperand(1))->getZExtValue();
11678 unsigned InsertedIdx = cast<ConstantInt>(IdxOp)->getZExtValue();
11680 // Either the extracted from or inserted into vector must be RHSVec,
11681 // otherwise we'd end up with a shuffle of three inputs.
11682 if (EI->getOperand(0) == RHS || RHS == 0) {
11683 RHS = EI->getOperand(0);
11684 Value *V = CollectShuffleElements(VecOp, Mask, RHS);
11685 Mask[InsertedIdx % NumElts] =
11686 ConstantInt::get(Type::Int32Ty, NumElts+ExtractedIdx);
11690 if (VecOp == RHS) {
11691 Value *V = CollectShuffleElements(EI->getOperand(0), Mask, RHS);
11692 // Everything but the extracted element is replaced with the RHS.
11693 for (unsigned i = 0; i != NumElts; ++i) {
11694 if (i != InsertedIdx)
11695 Mask[i] = ConstantInt::get(Type::Int32Ty, NumElts+i);
11700 // If this insertelement is a chain that comes from exactly these two
11701 // vectors, return the vector and the effective shuffle.
11702 if (CollectSingleShuffleElements(IEI, EI->getOperand(0), RHS, Mask))
11703 return EI->getOperand(0);
11708 // TODO: Handle shufflevector here!
11710 // Otherwise, can't do anything fancy. Return an identity vector.
11711 for (unsigned i = 0; i != NumElts; ++i)
11712 Mask.push_back(ConstantInt::get(Type::Int32Ty, i));
11716 Instruction *InstCombiner::visitInsertElementInst(InsertElementInst &IE) {
11717 Value *VecOp = IE.getOperand(0);
11718 Value *ScalarOp = IE.getOperand(1);
11719 Value *IdxOp = IE.getOperand(2);
11721 // Inserting an undef or into an undefined place, remove this.
11722 if (isa<UndefValue>(ScalarOp) || isa<UndefValue>(IdxOp))
11723 ReplaceInstUsesWith(IE, VecOp);
11725 // If the inserted element was extracted from some other vector, and if the
11726 // indexes are constant, try to turn this into a shufflevector operation.
11727 if (ExtractElementInst *EI = dyn_cast<ExtractElementInst>(ScalarOp)) {
11728 if (isa<ConstantInt>(EI->getOperand(1)) && isa<ConstantInt>(IdxOp) &&
11729 EI->getOperand(0)->getType() == IE.getType()) {
11730 unsigned NumVectorElts = IE.getType()->getNumElements();
11731 unsigned ExtractedIdx =
11732 cast<ConstantInt>(EI->getOperand(1))->getZExtValue();
11733 unsigned InsertedIdx = cast<ConstantInt>(IdxOp)->getZExtValue();
11735 if (ExtractedIdx >= NumVectorElts) // Out of range extract.
11736 return ReplaceInstUsesWith(IE, VecOp);
11738 if (InsertedIdx >= NumVectorElts) // Out of range insert.
11739 return ReplaceInstUsesWith(IE, UndefValue::get(IE.getType()));
11741 // If we are extracting a value from a vector, then inserting it right
11742 // back into the same place, just use the input vector.
11743 if (EI->getOperand(0) == VecOp && ExtractedIdx == InsertedIdx)
11744 return ReplaceInstUsesWith(IE, VecOp);
11746 // We could theoretically do this for ANY input. However, doing so could
11747 // turn chains of insertelement instructions into a chain of shufflevector
11748 // instructions, and right now we do not merge shufflevectors. As such,
11749 // only do this in a situation where it is clear that there is benefit.
11750 if (isa<UndefValue>(VecOp) || isa<ConstantAggregateZero>(VecOp)) {
11751 // Turn this into shuffle(EIOp0, VecOp, Mask). The result has all of
11752 // the values of VecOp, except then one read from EIOp0.
11753 // Build a new shuffle mask.
11754 std::vector<Constant*> Mask;
11755 if (isa<UndefValue>(VecOp))
11756 Mask.assign(NumVectorElts, UndefValue::get(Type::Int32Ty));
11758 assert(isa<ConstantAggregateZero>(VecOp) && "Unknown thing");
11759 Mask.assign(NumVectorElts, ConstantInt::get(Type::Int32Ty,
11762 Mask[InsertedIdx] = ConstantInt::get(Type::Int32Ty, ExtractedIdx);
11763 return new ShuffleVectorInst(EI->getOperand(0), VecOp,
11764 ConstantVector::get(Mask));
11767 // If this insertelement isn't used by some other insertelement, turn it
11768 // (and any insertelements it points to), into one big shuffle.
11769 if (!IE.hasOneUse() || !isa<InsertElementInst>(IE.use_back())) {
11770 std::vector<Constant*> Mask;
11772 Value *LHS = CollectShuffleElements(&IE, Mask, RHS);
11773 if (RHS == 0) RHS = UndefValue::get(LHS->getType());
11774 // We now have a shuffle of LHS, RHS, Mask.
11775 return new ShuffleVectorInst(LHS, RHS, ConstantVector::get(Mask));
11784 Instruction *InstCombiner::visitShuffleVectorInst(ShuffleVectorInst &SVI) {
11785 Value *LHS = SVI.getOperand(0);
11786 Value *RHS = SVI.getOperand(1);
11787 std::vector<unsigned> Mask = getShuffleMask(&SVI);
11789 bool MadeChange = false;
11791 // Undefined shuffle mask -> undefined value.
11792 if (isa<UndefValue>(SVI.getOperand(2)))
11793 return ReplaceInstUsesWith(SVI, UndefValue::get(SVI.getType()));
11795 uint64_t UndefElts;
11796 unsigned VWidth = cast<VectorType>(SVI.getType())->getNumElements();
11798 if (VWidth != cast<VectorType>(LHS->getType())->getNumElements())
11801 uint64_t AllOnesEltMask = ~0ULL >> (64-VWidth);
11802 if (VWidth <= 64 &&
11803 SimplifyDemandedVectorElts(&SVI, AllOnesEltMask, UndefElts)) {
11804 LHS = SVI.getOperand(0);
11805 RHS = SVI.getOperand(1);
11809 // Canonicalize shuffle(x ,x,mask) -> shuffle(x, undef,mask')
11810 // Canonicalize shuffle(undef,x,mask) -> shuffle(x, undef,mask').
11811 if (LHS == RHS || isa<UndefValue>(LHS)) {
11812 if (isa<UndefValue>(LHS) && LHS == RHS) {
11813 // shuffle(undef,undef,mask) -> undef.
11814 return ReplaceInstUsesWith(SVI, LHS);
11817 // Remap any references to RHS to use LHS.
11818 std::vector<Constant*> Elts;
11819 for (unsigned i = 0, e = Mask.size(); i != e; ++i) {
11820 if (Mask[i] >= 2*e)
11821 Elts.push_back(UndefValue::get(Type::Int32Ty));
11823 if ((Mask[i] >= e && isa<UndefValue>(RHS)) ||
11824 (Mask[i] < e && isa<UndefValue>(LHS))) {
11825 Mask[i] = 2*e; // Turn into undef.
11826 Elts.push_back(UndefValue::get(Type::Int32Ty));
11828 Mask[i] = Mask[i] % e; // Force to LHS.
11829 Elts.push_back(ConstantInt::get(Type::Int32Ty, Mask[i]));
11833 SVI.setOperand(0, SVI.getOperand(1));
11834 SVI.setOperand(1, UndefValue::get(RHS->getType()));
11835 SVI.setOperand(2, ConstantVector::get(Elts));
11836 LHS = SVI.getOperand(0);
11837 RHS = SVI.getOperand(1);
11841 // Analyze the shuffle, are the LHS or RHS and identity shuffles?
11842 bool isLHSID = true, isRHSID = true;
11844 for (unsigned i = 0, e = Mask.size(); i != e; ++i) {
11845 if (Mask[i] >= e*2) continue; // Ignore undef values.
11846 // Is this an identity shuffle of the LHS value?
11847 isLHSID &= (Mask[i] == i);
11849 // Is this an identity shuffle of the RHS value?
11850 isRHSID &= (Mask[i]-e == i);
11853 // Eliminate identity shuffles.
11854 if (isLHSID) return ReplaceInstUsesWith(SVI, LHS);
11855 if (isRHSID) return ReplaceInstUsesWith(SVI, RHS);
11857 // If the LHS is a shufflevector itself, see if we can combine it with this
11858 // one without producing an unusual shuffle. Here we are really conservative:
11859 // we are absolutely afraid of producing a shuffle mask not in the input
11860 // program, because the code gen may not be smart enough to turn a merged
11861 // shuffle into two specific shuffles: it may produce worse code. As such,
11862 // we only merge two shuffles if the result is one of the two input shuffle
11863 // masks. In this case, merging the shuffles just removes one instruction,
11864 // which we know is safe. This is good for things like turning:
11865 // (splat(splat)) -> splat.
11866 if (ShuffleVectorInst *LHSSVI = dyn_cast<ShuffleVectorInst>(LHS)) {
11867 if (isa<UndefValue>(RHS)) {
11868 std::vector<unsigned> LHSMask = getShuffleMask(LHSSVI);
11870 std::vector<unsigned> NewMask;
11871 for (unsigned i = 0, e = Mask.size(); i != e; ++i)
11872 if (Mask[i] >= 2*e)
11873 NewMask.push_back(2*e);
11875 NewMask.push_back(LHSMask[Mask[i]]);
11877 // If the result mask is equal to the src shuffle or this shuffle mask, do
11878 // the replacement.
11879 if (NewMask == LHSMask || NewMask == Mask) {
11880 std::vector<Constant*> Elts;
11881 for (unsigned i = 0, e = NewMask.size(); i != e; ++i) {
11882 if (NewMask[i] >= e*2) {
11883 Elts.push_back(UndefValue::get(Type::Int32Ty));
11885 Elts.push_back(ConstantInt::get(Type::Int32Ty, NewMask[i]));
11888 return new ShuffleVectorInst(LHSSVI->getOperand(0),
11889 LHSSVI->getOperand(1),
11890 ConstantVector::get(Elts));
11895 return MadeChange ? &SVI : 0;
11901 /// TryToSinkInstruction - Try to move the specified instruction from its
11902 /// current block into the beginning of DestBlock, which can only happen if it's
11903 /// safe to move the instruction past all of the instructions between it and the
11904 /// end of its block.
11905 static bool TryToSinkInstruction(Instruction *I, BasicBlock *DestBlock) {
11906 assert(I->hasOneUse() && "Invariants didn't hold!");
11908 // Cannot move control-flow-involving, volatile loads, vaarg, etc.
11909 if (isa<PHINode>(I) || I->mayWriteToMemory() || isa<TerminatorInst>(I))
11912 // Do not sink alloca instructions out of the entry block.
11913 if (isa<AllocaInst>(I) && I->getParent() ==
11914 &DestBlock->getParent()->getEntryBlock())
11917 // We can only sink load instructions if there is nothing between the load and
11918 // the end of block that could change the value.
11919 if (I->mayReadFromMemory()) {
11920 for (BasicBlock::iterator Scan = I, E = I->getParent()->end();
11922 if (Scan->mayWriteToMemory())
11926 BasicBlock::iterator InsertPos = DestBlock->getFirstNonPHI();
11928 I->moveBefore(InsertPos);
11934 /// AddReachableCodeToWorklist - Walk the function in depth-first order, adding
11935 /// all reachable code to the worklist.
11937 /// This has a couple of tricks to make the code faster and more powerful. In
11938 /// particular, we constant fold and DCE instructions as we go, to avoid adding
11939 /// them to the worklist (this significantly speeds up instcombine on code where
11940 /// many instructions are dead or constant). Additionally, if we find a branch
11941 /// whose condition is a known constant, we only visit the reachable successors.
11943 static void AddReachableCodeToWorklist(BasicBlock *BB,
11944 SmallPtrSet<BasicBlock*, 64> &Visited,
11946 const TargetData *TD) {
11947 SmallVector<BasicBlock*, 256> Worklist;
11948 Worklist.push_back(BB);
11950 while (!Worklist.empty()) {
11951 BB = Worklist.back();
11952 Worklist.pop_back();
11954 // We have now visited this block! If we've already been here, ignore it.
11955 if (!Visited.insert(BB)) continue;
11957 for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E; ) {
11958 Instruction *Inst = BBI++;
11960 // DCE instruction if trivially dead.
11961 if (isInstructionTriviallyDead(Inst)) {
11963 DOUT << "IC: DCE: " << *Inst;
11964 Inst->eraseFromParent();
11968 // ConstantProp instruction if trivially constant.
11969 if (Constant *C = ConstantFoldInstruction(Inst, TD)) {
11970 DOUT << "IC: ConstFold to: " << *C << " from: " << *Inst;
11971 Inst->replaceAllUsesWith(C);
11973 Inst->eraseFromParent();
11977 IC.AddToWorkList(Inst);
11980 // Recursively visit successors. If this is a branch or switch on a
11981 // constant, only visit the reachable successor.
11982 TerminatorInst *TI = BB->getTerminator();
11983 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
11984 if (BI->isConditional() && isa<ConstantInt>(BI->getCondition())) {
11985 bool CondVal = cast<ConstantInt>(BI->getCondition())->getZExtValue();
11986 BasicBlock *ReachableBB = BI->getSuccessor(!CondVal);
11987 Worklist.push_back(ReachableBB);
11990 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) {
11991 if (ConstantInt *Cond = dyn_cast<ConstantInt>(SI->getCondition())) {
11992 // See if this is an explicit destination.
11993 for (unsigned i = 1, e = SI->getNumSuccessors(); i != e; ++i)
11994 if (SI->getCaseValue(i) == Cond) {
11995 BasicBlock *ReachableBB = SI->getSuccessor(i);
11996 Worklist.push_back(ReachableBB);
12000 // Otherwise it is the default destination.
12001 Worklist.push_back(SI->getSuccessor(0));
12006 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
12007 Worklist.push_back(TI->getSuccessor(i));
12011 bool InstCombiner::DoOneIteration(Function &F, unsigned Iteration) {
12012 bool Changed = false;
12013 TD = &getAnalysis<TargetData>();
12015 DEBUG(DOUT << "\n\nINSTCOMBINE ITERATION #" << Iteration << " on "
12016 << F.getNameStr() << "\n");
12019 // Do a depth-first traversal of the function, populate the worklist with
12020 // the reachable instructions. Ignore blocks that are not reachable. Keep
12021 // track of which blocks we visit.
12022 SmallPtrSet<BasicBlock*, 64> Visited;
12023 AddReachableCodeToWorklist(F.begin(), Visited, *this, TD);
12025 // Do a quick scan over the function. If we find any blocks that are
12026 // unreachable, remove any instructions inside of them. This prevents
12027 // the instcombine code from having to deal with some bad special cases.
12028 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
12029 if (!Visited.count(BB)) {
12030 Instruction *Term = BB->getTerminator();
12031 while (Term != BB->begin()) { // Remove instrs bottom-up
12032 BasicBlock::iterator I = Term; --I;
12034 DOUT << "IC: DCE: " << *I;
12037 if (!I->use_empty())
12038 I->replaceAllUsesWith(UndefValue::get(I->getType()));
12039 I->eraseFromParent();
12044 while (!Worklist.empty()) {
12045 Instruction *I = RemoveOneFromWorkList();
12046 if (I == 0) continue; // skip null values.
12048 // Check to see if we can DCE the instruction.
12049 if (isInstructionTriviallyDead(I)) {
12050 // Add operands to the worklist.
12051 if (I->getNumOperands() < 4)
12052 AddUsesToWorkList(*I);
12055 DOUT << "IC: DCE: " << *I;
12057 I->eraseFromParent();
12058 RemoveFromWorkList(I);
12062 // Instruction isn't dead, see if we can constant propagate it.
12063 if (Constant *C = ConstantFoldInstruction(I, TD)) {
12064 DOUT << "IC: ConstFold to: " << *C << " from: " << *I;
12066 // Add operands to the worklist.
12067 AddUsesToWorkList(*I);
12068 ReplaceInstUsesWith(*I, C);
12071 I->eraseFromParent();
12072 RemoveFromWorkList(I);
12076 if (TD && I->getType()->getTypeID() == Type::VoidTyID) {
12077 // See if we can constant fold its operands.
12078 for (User::op_iterator i = I->op_begin(), e = I->op_end(); i != e; ++i) {
12079 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(i)) {
12080 if (Constant *NewC = ConstantFoldConstantExpression(CE, TD))
12086 // See if we can trivially sink this instruction to a successor basic block.
12087 if (I->hasOneUse()) {
12088 BasicBlock *BB = I->getParent();
12089 BasicBlock *UserParent = cast<Instruction>(I->use_back())->getParent();
12090 if (UserParent != BB) {
12091 bool UserIsSuccessor = false;
12092 // See if the user is one of our successors.
12093 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI)
12094 if (*SI == UserParent) {
12095 UserIsSuccessor = true;
12099 // If the user is one of our immediate successors, and if that successor
12100 // only has us as a predecessors (we'd have to split the critical edge
12101 // otherwise), we can keep going.
12102 if (UserIsSuccessor && !isa<PHINode>(I->use_back()) &&
12103 next(pred_begin(UserParent)) == pred_end(UserParent))
12104 // Okay, the CFG is simple enough, try to sink this instruction.
12105 Changed |= TryToSinkInstruction(I, UserParent);
12109 // Now that we have an instruction, try combining it to simplify it...
12113 DEBUG(std::ostringstream SS; I->print(SS); OrigI = SS.str(););
12114 if (Instruction *Result = visit(*I)) {
12116 // Should we replace the old instruction with a new one?
12118 DOUT << "IC: Old = " << *I
12119 << " New = " << *Result;
12121 // Everything uses the new instruction now.
12122 I->replaceAllUsesWith(Result);
12124 // Push the new instruction and any users onto the worklist.
12125 AddToWorkList(Result);
12126 AddUsersToWorkList(*Result);
12128 // Move the name to the new instruction first.
12129 Result->takeName(I);
12131 // Insert the new instruction into the basic block...
12132 BasicBlock *InstParent = I->getParent();
12133 BasicBlock::iterator InsertPos = I;
12135 if (!isa<PHINode>(Result)) // If combining a PHI, don't insert
12136 while (isa<PHINode>(InsertPos)) // middle of a block of PHIs.
12139 InstParent->getInstList().insert(InsertPos, Result);
12141 // Make sure that we reprocess all operands now that we reduced their
12143 AddUsesToWorkList(*I);
12145 // Instructions can end up on the worklist more than once. Make sure
12146 // we do not process an instruction that has been deleted.
12147 RemoveFromWorkList(I);
12149 // Erase the old instruction.
12150 InstParent->getInstList().erase(I);
12153 DOUT << "IC: Mod = " << OrigI
12154 << " New = " << *I;
12157 // If the instruction was modified, it's possible that it is now dead.
12158 // if so, remove it.
12159 if (isInstructionTriviallyDead(I)) {
12160 // Make sure we process all operands now that we are reducing their
12162 AddUsesToWorkList(*I);
12164 // Instructions may end up in the worklist more than once. Erase all
12165 // occurrences of this instruction.
12166 RemoveFromWorkList(I);
12167 I->eraseFromParent();
12170 AddUsersToWorkList(*I);
12177 assert(WorklistMap.empty() && "Worklist empty, but map not?");
12179 // Do an explicit clear, this shrinks the map if needed.
12180 WorklistMap.clear();
12185 bool InstCombiner::runOnFunction(Function &F) {
12186 MustPreserveLCSSA = mustPreserveAnalysisID(LCSSAID);
12188 bool EverMadeChange = false;
12190 // Iterate while there is work to do.
12191 unsigned Iteration = 0;
12192 while (DoOneIteration(F, Iteration++))
12193 EverMadeChange = true;
12194 return EverMadeChange;
12197 FunctionPass *llvm::createInstructionCombiningPass() {
12198 return new InstCombiner();