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/LLVMContext.h"
40 #include "llvm/Pass.h"
41 #include "llvm/DerivedTypes.h"
42 #include "llvm/GlobalVariable.h"
43 #include "llvm/Operator.h"
44 #include "llvm/Analysis/ConstantFolding.h"
45 #include "llvm/Analysis/InstructionSimplify.h"
46 #include "llvm/Analysis/MemoryBuiltins.h"
47 #include "llvm/Analysis/ValueTracking.h"
48 #include "llvm/Target/TargetData.h"
49 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
50 #include "llvm/Transforms/Utils/Local.h"
51 #include "llvm/Support/CallSite.h"
52 #include "llvm/Support/ConstantRange.h"
53 #include "llvm/Support/Debug.h"
54 #include "llvm/Support/ErrorHandling.h"
55 #include "llvm/Support/GetElementPtrTypeIterator.h"
56 #include "llvm/Support/InstVisitor.h"
57 #include "llvm/Support/IRBuilder.h"
58 #include "llvm/Support/MathExtras.h"
59 #include "llvm/Support/PatternMatch.h"
60 #include "llvm/Support/TargetFolder.h"
61 #include "llvm/Support/raw_ostream.h"
62 #include "llvm/ADT/DenseMap.h"
63 #include "llvm/ADT/SmallVector.h"
64 #include "llvm/ADT/SmallPtrSet.h"
65 #include "llvm/ADT/Statistic.h"
66 #include "llvm/ADT/STLExtras.h"
70 using namespace llvm::PatternMatch;
72 STATISTIC(NumCombined , "Number of insts combined");
73 STATISTIC(NumConstProp, "Number of constant folds");
74 STATISTIC(NumDeadInst , "Number of dead inst eliminated");
75 STATISTIC(NumDeadStore, "Number of dead stores eliminated");
76 STATISTIC(NumSunkInst , "Number of instructions sunk");
78 /// SelectPatternFlavor - We can match a variety of different patterns for
79 /// select operations.
80 enum SelectPatternFlavor {
88 /// InstCombineWorklist - This is the worklist management logic for
90 class InstCombineWorklist {
91 SmallVector<Instruction*, 256> Worklist;
92 DenseMap<Instruction*, unsigned> WorklistMap;
94 void operator=(const InstCombineWorklist&RHS); // DO NOT IMPLEMENT
95 InstCombineWorklist(const InstCombineWorklist&); // DO NOT IMPLEMENT
97 InstCombineWorklist() {}
99 bool isEmpty() const { return Worklist.empty(); }
101 /// Add - Add the specified instruction to the worklist if it isn't already
103 void Add(Instruction *I) {
104 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
105 DEBUG(errs() << "IC: ADD: " << *I << '\n');
106 Worklist.push_back(I);
110 void AddValue(Value *V) {
111 if (Instruction *I = dyn_cast<Instruction>(V))
115 /// AddInitialGroup - Add the specified batch of stuff in reverse order.
116 /// which should only be done when the worklist is empty and when the group
117 /// has no duplicates.
118 void AddInitialGroup(Instruction *const *List, unsigned NumEntries) {
119 assert(Worklist.empty() && "Worklist must be empty to add initial group");
120 Worklist.reserve(NumEntries+16);
121 DEBUG(errs() << "IC: ADDING: " << NumEntries << " instrs to worklist\n");
122 for (; NumEntries; --NumEntries) {
123 Instruction *I = List[NumEntries-1];
124 WorklistMap.insert(std::make_pair(I, Worklist.size()));
125 Worklist.push_back(I);
129 // Remove - remove I from the worklist if it exists.
130 void Remove(Instruction *I) {
131 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
132 if (It == WorklistMap.end()) return; // Not in worklist.
134 // Don't bother moving everything down, just null out the slot.
135 Worklist[It->second] = 0;
137 WorklistMap.erase(It);
140 Instruction *RemoveOne() {
141 Instruction *I = Worklist.back();
143 WorklistMap.erase(I);
147 /// AddUsersToWorkList - When an instruction is simplified, add all users of
148 /// the instruction to the work lists because they might get more simplified
151 void AddUsersToWorkList(Instruction &I) {
152 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
154 Add(cast<Instruction>(*UI));
158 /// Zap - check that the worklist is empty and nuke the backing store for
159 /// the map if it is large.
161 assert(WorklistMap.empty() && "Worklist empty, but map not?");
163 // Do an explicit clear, this shrinks the map if needed.
167 } // end anonymous namespace.
171 /// InstCombineIRInserter - This is an IRBuilder insertion helper that works
172 /// just like the normal insertion helper, but also adds any new instructions
173 /// to the instcombine worklist.
174 class InstCombineIRInserter : public IRBuilderDefaultInserter<true> {
175 InstCombineWorklist &Worklist;
177 InstCombineIRInserter(InstCombineWorklist &WL) : Worklist(WL) {}
179 void InsertHelper(Instruction *I, const Twine &Name,
180 BasicBlock *BB, BasicBlock::iterator InsertPt) const {
181 IRBuilderDefaultInserter<true>::InsertHelper(I, Name, BB, InsertPt);
185 } // end anonymous namespace
189 class InstCombiner : public FunctionPass,
190 public InstVisitor<InstCombiner, Instruction*> {
192 bool MustPreserveLCSSA;
195 /// Worklist - All of the instructions that need to be simplified.
196 InstCombineWorklist Worklist;
198 /// Builder - This is an IRBuilder that automatically inserts new
199 /// instructions into the worklist when they are created.
200 typedef IRBuilder<true, TargetFolder, InstCombineIRInserter> BuilderTy;
203 static char ID; // Pass identification, replacement for typeid
204 InstCombiner() : FunctionPass(&ID), TD(0), Builder(0) {}
206 LLVMContext *Context;
207 LLVMContext *getContext() const { return Context; }
210 virtual bool runOnFunction(Function &F);
212 bool DoOneIteration(Function &F, unsigned ItNum);
214 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
215 AU.addPreservedID(LCSSAID);
216 AU.setPreservesCFG();
219 TargetData *getTargetData() const { return TD; }
221 // Visitation implementation - Implement instruction combining for different
222 // instruction types. The semantics are as follows:
224 // null - No change was made
225 // I - Change was made, I is still valid, I may be dead though
226 // otherwise - Change was made, replace I with returned instruction
228 Instruction *visitAdd(BinaryOperator &I);
229 Instruction *visitFAdd(BinaryOperator &I);
230 Value *OptimizePointerDifference(Value *LHS, Value *RHS, const Type *Ty);
231 Instruction *visitSub(BinaryOperator &I);
232 Instruction *visitFSub(BinaryOperator &I);
233 Instruction *visitMul(BinaryOperator &I);
234 Instruction *visitFMul(BinaryOperator &I);
235 Instruction *visitURem(BinaryOperator &I);
236 Instruction *visitSRem(BinaryOperator &I);
237 Instruction *visitFRem(BinaryOperator &I);
238 bool SimplifyDivRemOfSelect(BinaryOperator &I);
239 Instruction *commonRemTransforms(BinaryOperator &I);
240 Instruction *commonIRemTransforms(BinaryOperator &I);
241 Instruction *commonDivTransforms(BinaryOperator &I);
242 Instruction *commonIDivTransforms(BinaryOperator &I);
243 Instruction *visitUDiv(BinaryOperator &I);
244 Instruction *visitSDiv(BinaryOperator &I);
245 Instruction *visitFDiv(BinaryOperator &I);
246 Instruction *FoldAndOfICmps(Instruction &I, ICmpInst *LHS, ICmpInst *RHS);
247 Instruction *FoldAndOfFCmps(Instruction &I, FCmpInst *LHS, FCmpInst *RHS);
248 Instruction *visitAnd(BinaryOperator &I);
249 Instruction *FoldOrOfICmps(Instruction &I, ICmpInst *LHS, ICmpInst *RHS);
250 Instruction *FoldOrOfFCmps(Instruction &I, FCmpInst *LHS, FCmpInst *RHS);
251 Instruction *FoldOrWithConstants(BinaryOperator &I, Value *Op,
252 Value *A, Value *B, Value *C);
253 Instruction *visitOr (BinaryOperator &I);
254 Instruction *visitXor(BinaryOperator &I);
255 Instruction *visitShl(BinaryOperator &I);
256 Instruction *visitAShr(BinaryOperator &I);
257 Instruction *visitLShr(BinaryOperator &I);
258 Instruction *commonShiftTransforms(BinaryOperator &I);
259 Instruction *FoldFCmp_IntToFP_Cst(FCmpInst &I, Instruction *LHSI,
261 Instruction *visitFCmpInst(FCmpInst &I);
262 Instruction *visitICmpInst(ICmpInst &I);
263 Instruction *visitICmpInstWithCastAndCast(ICmpInst &ICI);
264 Instruction *visitICmpInstWithInstAndIntCst(ICmpInst &ICI,
267 Instruction *FoldICmpDivCst(ICmpInst &ICI, BinaryOperator *DivI,
268 ConstantInt *DivRHS);
269 Instruction *FoldICmpAddOpCst(ICmpInst &ICI, Value *X, ConstantInt *CI,
270 ICmpInst::Predicate Pred, Value *TheAdd);
271 Instruction *FoldGEPICmp(GEPOperator *GEPLHS, Value *RHS,
272 ICmpInst::Predicate Cond, Instruction &I);
273 Instruction *FoldShiftByConstant(Value *Op0, ConstantInt *Op1,
275 Instruction *commonCastTransforms(CastInst &CI);
276 Instruction *commonIntCastTransforms(CastInst &CI);
277 Instruction *commonPointerCastTransforms(CastInst &CI);
278 Instruction *visitTrunc(TruncInst &CI);
279 Instruction *visitZExt(ZExtInst &CI);
280 Instruction *visitSExt(SExtInst &CI);
281 Instruction *visitFPTrunc(FPTruncInst &CI);
282 Instruction *visitFPExt(CastInst &CI);
283 Instruction *visitFPToUI(FPToUIInst &FI);
284 Instruction *visitFPToSI(FPToSIInst &FI);
285 Instruction *visitUIToFP(CastInst &CI);
286 Instruction *visitSIToFP(CastInst &CI);
287 Instruction *visitPtrToInt(PtrToIntInst &CI);
288 Instruction *visitIntToPtr(IntToPtrInst &CI);
289 Instruction *visitBitCast(BitCastInst &CI);
290 Instruction *FoldSelectOpOp(SelectInst &SI, Instruction *TI,
292 Instruction *FoldSelectIntoOp(SelectInst &SI, Value*, Value*);
293 Instruction *FoldSPFofSPF(Instruction *Inner, SelectPatternFlavor SPF1,
294 Value *A, Value *B, Instruction &Outer,
295 SelectPatternFlavor SPF2, Value *C);
296 Instruction *visitSelectInst(SelectInst &SI);
297 Instruction *visitSelectInstWithICmp(SelectInst &SI, ICmpInst *ICI);
298 Instruction *visitCallInst(CallInst &CI);
299 Instruction *visitInvokeInst(InvokeInst &II);
301 Instruction *SliceUpIllegalIntegerPHI(PHINode &PN);
302 Instruction *visitPHINode(PHINode &PN);
303 Instruction *visitGetElementPtrInst(GetElementPtrInst &GEP);
304 Instruction *visitAllocaInst(AllocaInst &AI);
305 Instruction *visitFree(Instruction &FI);
306 Instruction *visitLoadInst(LoadInst &LI);
307 Instruction *visitStoreInst(StoreInst &SI);
308 Instruction *visitBranchInst(BranchInst &BI);
309 Instruction *visitSwitchInst(SwitchInst &SI);
310 Instruction *visitInsertElementInst(InsertElementInst &IE);
311 Instruction *visitExtractElementInst(ExtractElementInst &EI);
312 Instruction *visitShuffleVectorInst(ShuffleVectorInst &SVI);
313 Instruction *visitExtractValueInst(ExtractValueInst &EV);
315 // visitInstruction - Specify what to return for unhandled instructions...
316 Instruction *visitInstruction(Instruction &I) { return 0; }
319 Instruction *visitCallSite(CallSite CS);
320 bool transformConstExprCastCall(CallSite CS);
321 Instruction *transformCallThroughTrampoline(CallSite CS);
322 Instruction *transformZExtICmp(ICmpInst *ICI, Instruction &CI,
323 bool DoXform = true);
324 bool WillNotOverflowSignedAdd(Value *LHS, Value *RHS);
325 DbgDeclareInst *hasOneUsePlusDeclare(Value *V);
329 // InsertNewInstBefore - insert an instruction New before instruction Old
330 // in the program. Add the new instruction to the worklist.
332 Instruction *InsertNewInstBefore(Instruction *New, Instruction &Old) {
333 assert(New && New->getParent() == 0 &&
334 "New instruction already inserted into a basic block!");
335 BasicBlock *BB = Old.getParent();
336 BB->getInstList().insert(&Old, New); // Insert inst
341 // ReplaceInstUsesWith - This method is to be used when an instruction is
342 // found to be dead, replacable with another preexisting expression. Here
343 // we add all uses of I to the worklist, replace all uses of I with the new
344 // value, then return I, so that the inst combiner will know that I was
347 Instruction *ReplaceInstUsesWith(Instruction &I, Value *V) {
348 Worklist.AddUsersToWorkList(I); // Add all modified instrs to worklist.
350 // If we are replacing the instruction with itself, this must be in a
351 // segment of unreachable code, so just clobber the instruction.
353 V = UndefValue::get(I.getType());
355 I.replaceAllUsesWith(V);
359 // EraseInstFromFunction - When dealing with an instruction that has side
360 // effects or produces a void value, we can't rely on DCE to delete the
361 // instruction. Instead, visit methods should return the value returned by
363 Instruction *EraseInstFromFunction(Instruction &I) {
364 DEBUG(errs() << "IC: ERASE " << I << '\n');
366 assert(I.use_empty() && "Cannot erase instruction that is used!");
367 // Make sure that we reprocess all operands now that we reduced their
369 if (I.getNumOperands() < 8) {
370 for (User::op_iterator i = I.op_begin(), e = I.op_end(); i != e; ++i)
371 if (Instruction *Op = dyn_cast<Instruction>(*i))
377 return 0; // Don't do anything with FI
380 void ComputeMaskedBits(Value *V, const APInt &Mask, APInt &KnownZero,
381 APInt &KnownOne, unsigned Depth = 0) const {
382 return llvm::ComputeMaskedBits(V, Mask, KnownZero, KnownOne, TD, Depth);
385 bool MaskedValueIsZero(Value *V, const APInt &Mask,
386 unsigned Depth = 0) const {
387 return llvm::MaskedValueIsZero(V, Mask, TD, Depth);
389 unsigned ComputeNumSignBits(Value *Op, unsigned Depth = 0) const {
390 return llvm::ComputeNumSignBits(Op, TD, Depth);
395 /// SimplifyCommutative - This performs a few simplifications for
396 /// commutative operators.
397 bool SimplifyCommutative(BinaryOperator &I);
399 /// SimplifyDemandedUseBits - Attempts to replace V with a simpler value
400 /// based on the demanded bits.
401 Value *SimplifyDemandedUseBits(Value *V, APInt DemandedMask,
402 APInt& KnownZero, APInt& KnownOne,
404 bool SimplifyDemandedBits(Use &U, APInt DemandedMask,
405 APInt& KnownZero, APInt& KnownOne,
408 /// SimplifyDemandedInstructionBits - Inst is an integer instruction that
409 /// SimplifyDemandedBits knows about. See if the instruction has any
410 /// properties that allow us to simplify its operands.
411 bool SimplifyDemandedInstructionBits(Instruction &Inst);
413 Value *SimplifyDemandedVectorElts(Value *V, APInt DemandedElts,
414 APInt& UndefElts, unsigned Depth = 0);
416 // FoldOpIntoPhi - Given a binary operator, cast instruction, or select
417 // which has a PHI node as operand #0, see if we can fold the instruction
418 // into the PHI (which is only possible if all operands to the PHI are
421 // If AllowAggressive is true, FoldOpIntoPhi will allow certain transforms
422 // that would normally be unprofitable because they strongly encourage jump
424 Instruction *FoldOpIntoPhi(Instruction &I, bool AllowAggressive = false);
426 // FoldPHIArgOpIntoPHI - If all operands to a PHI node are the same "unary"
427 // operator and they all are only used by the PHI, PHI together their
428 // inputs, and do the operation once, to the result of the PHI.
429 Instruction *FoldPHIArgOpIntoPHI(PHINode &PN);
430 Instruction *FoldPHIArgBinOpIntoPHI(PHINode &PN);
431 Instruction *FoldPHIArgGEPIntoPHI(PHINode &PN);
432 Instruction *FoldPHIArgLoadIntoPHI(PHINode &PN);
435 Instruction *OptAndOp(Instruction *Op, ConstantInt *OpRHS,
436 ConstantInt *AndRHS, BinaryOperator &TheAnd);
438 Value *FoldLogicalPlusAnd(Value *LHS, Value *RHS, ConstantInt *Mask,
439 bool isSub, Instruction &I);
440 Instruction *InsertRangeTest(Value *V, Constant *Lo, Constant *Hi,
441 bool isSigned, bool Inside, Instruction &IB);
442 Instruction *PromoteCastOfAllocation(BitCastInst &CI, AllocaInst &AI);
443 Instruction *MatchBSwap(BinaryOperator &I);
444 bool SimplifyStoreAtEndOfBlock(StoreInst &SI);
445 Instruction *SimplifyMemTransfer(MemIntrinsic *MI);
446 Instruction *SimplifyMemSet(MemSetInst *MI);
449 Value *EvaluateInDifferentType(Value *V, const Type *Ty, bool isSigned);
451 bool CanEvaluateInDifferentType(Value *V, const Type *Ty,
452 unsigned CastOpc, int &NumCastsRemoved);
453 unsigned GetOrEnforceKnownAlignment(Value *V,
454 unsigned PrefAlign = 0);
457 } // end anonymous namespace
459 char InstCombiner::ID = 0;
460 static RegisterPass<InstCombiner>
461 X("instcombine", "Combine redundant instructions");
463 // getComplexity: Assign a complexity or rank value to LLVM Values...
464 // 0 -> undef, 1 -> Const, 2 -> Other, 3 -> Arg, 3 -> Unary, 4 -> OtherInst
465 static unsigned getComplexity(Value *V) {
466 if (isa<Instruction>(V)) {
467 if (BinaryOperator::isNeg(V) ||
468 BinaryOperator::isFNeg(V) ||
469 BinaryOperator::isNot(V))
473 if (isa<Argument>(V)) return 3;
474 return isa<Constant>(V) ? (isa<UndefValue>(V) ? 0 : 1) : 2;
477 // isOnlyUse - Return true if this instruction will be deleted if we stop using
479 static bool isOnlyUse(Value *V) {
480 return V->hasOneUse() || isa<Constant>(V);
483 // getPromotedType - Return the specified type promoted as it would be to pass
484 // though a va_arg area...
485 static const Type *getPromotedType(const Type *Ty) {
486 if (const IntegerType* ITy = dyn_cast<IntegerType>(Ty)) {
487 if (ITy->getBitWidth() < 32)
488 return Type::getInt32Ty(Ty->getContext());
493 /// ShouldChangeType - Return true if it is desirable to convert a computation
494 /// from 'From' to 'To'. We don't want to convert from a legal to an illegal
495 /// type for example, or from a smaller to a larger illegal type.
496 static bool ShouldChangeType(const Type *From, const Type *To,
497 const TargetData *TD) {
498 assert(isa<IntegerType>(From) && isa<IntegerType>(To));
500 // If we don't have TD, we don't know if the source/dest are legal.
501 if (!TD) return false;
503 unsigned FromWidth = From->getPrimitiveSizeInBits();
504 unsigned ToWidth = To->getPrimitiveSizeInBits();
505 bool FromLegal = TD->isLegalInteger(FromWidth);
506 bool ToLegal = TD->isLegalInteger(ToWidth);
508 // If this is a legal integer from type, and the result would be an illegal
509 // type, don't do the transformation.
510 if (FromLegal && !ToLegal)
513 // Otherwise, if both are illegal, do not increase the size of the result. We
514 // do allow things like i160 -> i64, but not i64 -> i160.
515 if (!FromLegal && !ToLegal && ToWidth > FromWidth)
521 /// getBitCastOperand - If the specified operand is a CastInst, a constant
522 /// expression bitcast, or a GetElementPtrInst with all zero indices, return the
523 /// operand value, otherwise return null.
524 static Value *getBitCastOperand(Value *V) {
525 if (Operator *O = dyn_cast<Operator>(V)) {
526 if (O->getOpcode() == Instruction::BitCast)
527 return O->getOperand(0);
528 if (GEPOperator *GEP = dyn_cast<GEPOperator>(V))
529 if (GEP->hasAllZeroIndices())
530 return GEP->getPointerOperand();
535 /// This function is a wrapper around CastInst::isEliminableCastPair. It
536 /// simply extracts arguments and returns what that function returns.
537 static Instruction::CastOps
538 isEliminableCastPair(
539 const CastInst *CI, ///< The first cast instruction
540 unsigned opcode, ///< The opcode of the second cast instruction
541 const Type *DstTy, ///< The target type for the second cast instruction
542 TargetData *TD ///< The target data for pointer size
545 const Type *SrcTy = CI->getOperand(0)->getType(); // A from above
546 const Type *MidTy = CI->getType(); // B from above
548 // Get the opcodes of the two Cast instructions
549 Instruction::CastOps firstOp = Instruction::CastOps(CI->getOpcode());
550 Instruction::CastOps secondOp = Instruction::CastOps(opcode);
552 unsigned Res = CastInst::isEliminableCastPair(firstOp, secondOp, SrcTy, MidTy,
554 TD ? TD->getIntPtrType(CI->getContext()) : 0);
556 // We don't want to form an inttoptr or ptrtoint that converts to an integer
557 // type that differs from the pointer size.
558 if ((Res == Instruction::IntToPtr &&
559 (!TD || SrcTy != TD->getIntPtrType(CI->getContext()))) ||
560 (Res == Instruction::PtrToInt &&
561 (!TD || DstTy != TD->getIntPtrType(CI->getContext()))))
564 return Instruction::CastOps(Res);
567 /// ValueRequiresCast - Return true if the cast from "V to Ty" actually results
568 /// in any code being generated. It does not require codegen if V is simple
569 /// enough or if the cast can be folded into other casts.
570 static bool ValueRequiresCast(Instruction::CastOps opcode, const Value *V,
571 const Type *Ty, TargetData *TD) {
572 if (V->getType() == Ty || isa<Constant>(V)) return false;
574 // If this is another cast that can be eliminated, it isn't codegen either.
575 if (const CastInst *CI = dyn_cast<CastInst>(V))
576 if (isEliminableCastPair(CI, opcode, Ty, TD))
581 // SimplifyCommutative - This performs a few simplifications for commutative
584 // 1. Order operands such that they are listed from right (least complex) to
585 // left (most complex). This puts constants before unary operators before
588 // 2. Transform: (op (op V, C1), C2) ==> (op V, (op C1, C2))
589 // 3. Transform: (op (op V1, C1), (op V2, C2)) ==> (op (op V1, V2), (op C1,C2))
591 bool InstCombiner::SimplifyCommutative(BinaryOperator &I) {
592 bool Changed = false;
593 if (getComplexity(I.getOperand(0)) < getComplexity(I.getOperand(1)))
594 Changed = !I.swapOperands();
596 if (!I.isAssociative()) return Changed;
597 Instruction::BinaryOps Opcode = I.getOpcode();
598 if (BinaryOperator *Op = dyn_cast<BinaryOperator>(I.getOperand(0)))
599 if (Op->getOpcode() == Opcode && isa<Constant>(Op->getOperand(1))) {
600 if (isa<Constant>(I.getOperand(1))) {
601 Constant *Folded = ConstantExpr::get(I.getOpcode(),
602 cast<Constant>(I.getOperand(1)),
603 cast<Constant>(Op->getOperand(1)));
604 I.setOperand(0, Op->getOperand(0));
605 I.setOperand(1, Folded);
607 } else if (BinaryOperator *Op1=dyn_cast<BinaryOperator>(I.getOperand(1)))
608 if (Op1->getOpcode() == Opcode && isa<Constant>(Op1->getOperand(1)) &&
609 isOnlyUse(Op) && isOnlyUse(Op1)) {
610 Constant *C1 = cast<Constant>(Op->getOperand(1));
611 Constant *C2 = cast<Constant>(Op1->getOperand(1));
613 // Fold (op (op V1, C1), (op V2, C2)) ==> (op (op V1, V2), (op C1,C2))
614 Constant *Folded = ConstantExpr::get(I.getOpcode(), C1, C2);
615 Instruction *New = BinaryOperator::Create(Opcode, Op->getOperand(0),
619 I.setOperand(0, New);
620 I.setOperand(1, Folded);
627 // dyn_castNegVal - Given a 'sub' instruction, return the RHS of the instruction
628 // if the LHS is a constant zero (which is the 'negate' form).
630 static inline Value *dyn_castNegVal(Value *V) {
631 if (BinaryOperator::isNeg(V))
632 return BinaryOperator::getNegArgument(V);
634 // Constants can be considered to be negated values if they can be folded.
635 if (ConstantInt *C = dyn_cast<ConstantInt>(V))
636 return ConstantExpr::getNeg(C);
638 if (ConstantVector *C = dyn_cast<ConstantVector>(V))
639 if (C->getType()->getElementType()->isInteger())
640 return ConstantExpr::getNeg(C);
645 // dyn_castFNegVal - Given a 'fsub' instruction, return the RHS of the
646 // instruction if the LHS is a constant negative zero (which is the 'negate'
649 static inline Value *dyn_castFNegVal(Value *V) {
650 if (BinaryOperator::isFNeg(V))
651 return BinaryOperator::getFNegArgument(V);
653 // Constants can be considered to be negated values if they can be folded.
654 if (ConstantFP *C = dyn_cast<ConstantFP>(V))
655 return ConstantExpr::getFNeg(C);
657 if (ConstantVector *C = dyn_cast<ConstantVector>(V))
658 if (C->getType()->getElementType()->isFloatingPoint())
659 return ConstantExpr::getFNeg(C);
664 /// MatchSelectPattern - Pattern match integer [SU]MIN, [SU]MAX, and ABS idioms,
665 /// returning the kind and providing the out parameter results if we
666 /// successfully match.
667 static SelectPatternFlavor
668 MatchSelectPattern(Value *V, Value *&LHS, Value *&RHS) {
669 SelectInst *SI = dyn_cast<SelectInst>(V);
670 if (SI == 0) return SPF_UNKNOWN;
672 ICmpInst *ICI = dyn_cast<ICmpInst>(SI->getCondition());
673 if (ICI == 0) return SPF_UNKNOWN;
675 LHS = ICI->getOperand(0);
676 RHS = ICI->getOperand(1);
678 // (icmp X, Y) ? X : Y
679 if (SI->getTrueValue() == ICI->getOperand(0) &&
680 SI->getFalseValue() == ICI->getOperand(1)) {
681 switch (ICI->getPredicate()) {
682 default: return SPF_UNKNOWN; // Equality.
683 case ICmpInst::ICMP_UGT:
684 case ICmpInst::ICMP_UGE: return SPF_UMAX;
685 case ICmpInst::ICMP_SGT:
686 case ICmpInst::ICMP_SGE: return SPF_SMAX;
687 case ICmpInst::ICMP_ULT:
688 case ICmpInst::ICMP_ULE: return SPF_UMIN;
689 case ICmpInst::ICMP_SLT:
690 case ICmpInst::ICMP_SLE: return SPF_SMIN;
694 // (icmp X, Y) ? Y : X
695 if (SI->getTrueValue() == ICI->getOperand(1) &&
696 SI->getFalseValue() == ICI->getOperand(0)) {
697 switch (ICI->getPredicate()) {
698 default: return SPF_UNKNOWN; // Equality.
699 case ICmpInst::ICMP_UGT:
700 case ICmpInst::ICMP_UGE: return SPF_UMIN;
701 case ICmpInst::ICMP_SGT:
702 case ICmpInst::ICMP_SGE: return SPF_SMIN;
703 case ICmpInst::ICMP_ULT:
704 case ICmpInst::ICMP_ULE: return SPF_UMAX;
705 case ICmpInst::ICMP_SLT:
706 case ICmpInst::ICMP_SLE: return SPF_SMAX;
710 // TODO: (X > 4) ? X : 5 --> (X >= 5) ? X : 5 --> MAX(X, 5)
715 /// isFreeToInvert - Return true if the specified value is free to invert (apply
716 /// ~ to). This happens in cases where the ~ can be eliminated.
717 static inline bool isFreeToInvert(Value *V) {
719 if (BinaryOperator::isNot(V))
722 // Constants can be considered to be not'ed values.
723 if (isa<ConstantInt>(V))
726 // Compares can be inverted if they have a single use.
727 if (CmpInst *CI = dyn_cast<CmpInst>(V))
728 return CI->hasOneUse();
733 static inline Value *dyn_castNotVal(Value *V) {
734 // If this is not(not(x)) don't return that this is a not: we want the two
735 // not's to be folded first.
736 if (BinaryOperator::isNot(V)) {
737 Value *Operand = BinaryOperator::getNotArgument(V);
738 if (!isFreeToInvert(Operand))
742 // Constants can be considered to be not'ed values...
743 if (ConstantInt *C = dyn_cast<ConstantInt>(V))
744 return ConstantInt::get(C->getType(), ~C->getValue());
750 // dyn_castFoldableMul - If this value is a multiply that can be folded into
751 // other computations (because it has a constant operand), return the
752 // non-constant operand of the multiply, and set CST to point to the multiplier.
753 // Otherwise, return null.
755 static inline Value *dyn_castFoldableMul(Value *V, ConstantInt *&CST) {
756 if (V->hasOneUse() && V->getType()->isInteger())
757 if (Instruction *I = dyn_cast<Instruction>(V)) {
758 if (I->getOpcode() == Instruction::Mul)
759 if ((CST = dyn_cast<ConstantInt>(I->getOperand(1))))
760 return I->getOperand(0);
761 if (I->getOpcode() == Instruction::Shl)
762 if ((CST = dyn_cast<ConstantInt>(I->getOperand(1)))) {
763 // The multiplier is really 1 << CST.
764 uint32_t BitWidth = cast<IntegerType>(V->getType())->getBitWidth();
765 uint32_t CSTVal = CST->getLimitedValue(BitWidth);
766 CST = ConstantInt::get(V->getType()->getContext(),
767 APInt(BitWidth, 1).shl(CSTVal));
768 return I->getOperand(0);
774 /// AddOne - Add one to a ConstantInt
775 static Constant *AddOne(Constant *C) {
776 return ConstantExpr::getAdd(C,
777 ConstantInt::get(C->getType(), 1));
779 /// SubOne - Subtract one from a ConstantInt
780 static Constant *SubOne(ConstantInt *C) {
781 return ConstantExpr::getSub(C,
782 ConstantInt::get(C->getType(), 1));
784 /// MultiplyOverflows - True if the multiply can not be expressed in an int
786 static bool MultiplyOverflows(ConstantInt *C1, ConstantInt *C2, bool sign) {
787 uint32_t W = C1->getBitWidth();
788 APInt LHSExt = C1->getValue(), RHSExt = C2->getValue();
797 APInt MulExt = LHSExt * RHSExt;
800 return MulExt.ugt(APInt::getLowBitsSet(W * 2, W));
802 APInt Min = APInt::getSignedMinValue(W).sext(W * 2);
803 APInt Max = APInt::getSignedMaxValue(W).sext(W * 2);
804 return MulExt.slt(Min) || MulExt.sgt(Max);
808 /// ShrinkDemandedConstant - Check to see if the specified operand of the
809 /// specified instruction is a constant integer. If so, check to see if there
810 /// are any bits set in the constant that are not demanded. If so, shrink the
811 /// constant and return true.
812 static bool ShrinkDemandedConstant(Instruction *I, unsigned OpNo,
814 assert(I && "No instruction?");
815 assert(OpNo < I->getNumOperands() && "Operand index too large");
817 // If the operand is not a constant integer, nothing to do.
818 ConstantInt *OpC = dyn_cast<ConstantInt>(I->getOperand(OpNo));
819 if (!OpC) return false;
821 // If there are no bits set that aren't demanded, nothing to do.
822 Demanded.zextOrTrunc(OpC->getValue().getBitWidth());
823 if ((~Demanded & OpC->getValue()) == 0)
826 // This instruction is producing bits that are not demanded. Shrink the RHS.
827 Demanded &= OpC->getValue();
828 I->setOperand(OpNo, ConstantInt::get(OpC->getType(), Demanded));
832 // ComputeSignedMinMaxValuesFromKnownBits - Given a signed integer type and a
833 // set of known zero and one bits, compute the maximum and minimum values that
834 // could have the specified known zero and known one bits, returning them in
836 static void ComputeSignedMinMaxValuesFromKnownBits(const APInt& KnownZero,
837 const APInt& KnownOne,
838 APInt& Min, APInt& Max) {
839 assert(KnownZero.getBitWidth() == KnownOne.getBitWidth() &&
840 KnownZero.getBitWidth() == Min.getBitWidth() &&
841 KnownZero.getBitWidth() == Max.getBitWidth() &&
842 "KnownZero, KnownOne and Min, Max must have equal bitwidth.");
843 APInt UnknownBits = ~(KnownZero|KnownOne);
845 // The minimum value is when all unknown bits are zeros, EXCEPT for the sign
846 // bit if it is unknown.
848 Max = KnownOne|UnknownBits;
850 if (UnknownBits.isNegative()) { // Sign bit is unknown
851 Min.set(Min.getBitWidth()-1);
852 Max.clear(Max.getBitWidth()-1);
856 // ComputeUnsignedMinMaxValuesFromKnownBits - Given an unsigned integer type and
857 // a set of known zero and one bits, compute the maximum and minimum values that
858 // could have the specified known zero and known one bits, returning them in
860 static void ComputeUnsignedMinMaxValuesFromKnownBits(const APInt &KnownZero,
861 const APInt &KnownOne,
862 APInt &Min, APInt &Max) {
863 assert(KnownZero.getBitWidth() == KnownOne.getBitWidth() &&
864 KnownZero.getBitWidth() == Min.getBitWidth() &&
865 KnownZero.getBitWidth() == Max.getBitWidth() &&
866 "Ty, KnownZero, KnownOne and Min, Max must have equal bitwidth.");
867 APInt UnknownBits = ~(KnownZero|KnownOne);
869 // The minimum value is when the unknown bits are all zeros.
871 // The maximum value is when the unknown bits are all ones.
872 Max = KnownOne|UnknownBits;
875 /// SimplifyDemandedInstructionBits - Inst is an integer instruction that
876 /// SimplifyDemandedBits knows about. See if the instruction has any
877 /// properties that allow us to simplify its operands.
878 bool InstCombiner::SimplifyDemandedInstructionBits(Instruction &Inst) {
879 unsigned BitWidth = Inst.getType()->getScalarSizeInBits();
880 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
881 APInt DemandedMask(APInt::getAllOnesValue(BitWidth));
883 Value *V = SimplifyDemandedUseBits(&Inst, DemandedMask,
884 KnownZero, KnownOne, 0);
885 if (V == 0) return false;
886 if (V == &Inst) return true;
887 ReplaceInstUsesWith(Inst, V);
891 /// SimplifyDemandedBits - This form of SimplifyDemandedBits simplifies the
892 /// specified instruction operand if possible, updating it in place. It returns
893 /// true if it made any change and false otherwise.
894 bool InstCombiner::SimplifyDemandedBits(Use &U, APInt DemandedMask,
895 APInt &KnownZero, APInt &KnownOne,
897 Value *NewVal = SimplifyDemandedUseBits(U.get(), DemandedMask,
898 KnownZero, KnownOne, Depth);
899 if (NewVal == 0) return false;
905 /// SimplifyDemandedUseBits - This function attempts to replace V with a simpler
906 /// value based on the demanded bits. When this function is called, it is known
907 /// that only the bits set in DemandedMask of the result of V are ever used
908 /// downstream. Consequently, depending on the mask and V, it may be possible
909 /// to replace V with a constant or one of its operands. In such cases, this
910 /// function does the replacement and returns true. In all other cases, it
911 /// returns false after analyzing the expression and setting KnownOne and known
912 /// to be one in the expression. KnownZero contains all the bits that are known
913 /// to be zero in the expression. These are provided to potentially allow the
914 /// caller (which might recursively be SimplifyDemandedBits itself) to simplify
915 /// the expression. KnownOne and KnownZero always follow the invariant that
916 /// KnownOne & KnownZero == 0. That is, a bit can't be both 1 and 0. Note that
917 /// the bits in KnownOne and KnownZero may only be accurate for those bits set
918 /// in DemandedMask. Note also that the bitwidth of V, DemandedMask, KnownZero
919 /// and KnownOne must all be the same.
921 /// This returns null if it did not change anything and it permits no
922 /// simplification. This returns V itself if it did some simplification of V's
923 /// operands based on the information about what bits are demanded. This returns
924 /// some other non-null value if it found out that V is equal to another value
925 /// in the context where the specified bits are demanded, but not for all users.
926 Value *InstCombiner::SimplifyDemandedUseBits(Value *V, APInt DemandedMask,
927 APInt &KnownZero, APInt &KnownOne,
929 assert(V != 0 && "Null pointer of Value???");
930 assert(Depth <= 6 && "Limit Search Depth");
931 uint32_t BitWidth = DemandedMask.getBitWidth();
932 const Type *VTy = V->getType();
933 assert((TD || !isa<PointerType>(VTy)) &&
934 "SimplifyDemandedBits needs to know bit widths!");
935 assert((!TD || TD->getTypeSizeInBits(VTy->getScalarType()) == BitWidth) &&
936 (!VTy->isIntOrIntVector() ||
937 VTy->getScalarSizeInBits() == BitWidth) &&
938 KnownZero.getBitWidth() == BitWidth &&
939 KnownOne.getBitWidth() == BitWidth &&
940 "Value *V, DemandedMask, KnownZero and KnownOne "
941 "must have same BitWidth");
942 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
943 // We know all of the bits for a constant!
944 KnownOne = CI->getValue() & DemandedMask;
945 KnownZero = ~KnownOne & DemandedMask;
948 if (isa<ConstantPointerNull>(V)) {
949 // We know all of the bits for a constant!
951 KnownZero = DemandedMask;
957 if (DemandedMask == 0) { // Not demanding any bits from V.
958 if (isa<UndefValue>(V))
960 return UndefValue::get(VTy);
963 if (Depth == 6) // Limit search depth.
966 APInt LHSKnownZero(BitWidth, 0), LHSKnownOne(BitWidth, 0);
967 APInt &RHSKnownZero = KnownZero, &RHSKnownOne = KnownOne;
969 Instruction *I = dyn_cast<Instruction>(V);
971 ComputeMaskedBits(V, DemandedMask, RHSKnownZero, RHSKnownOne, Depth);
972 return 0; // Only analyze instructions.
975 // If there are multiple uses of this value and we aren't at the root, then
976 // we can't do any simplifications of the operands, because DemandedMask
977 // only reflects the bits demanded by *one* of the users.
978 if (Depth != 0 && !I->hasOneUse()) {
979 // Despite the fact that we can't simplify this instruction in all User's
980 // context, we can at least compute the knownzero/knownone bits, and we can
981 // do simplifications that apply to *just* the one user if we know that
982 // this instruction has a simpler value in that context.
983 if (I->getOpcode() == Instruction::And) {
984 // If either the LHS or the RHS are Zero, the result is zero.
985 ComputeMaskedBits(I->getOperand(1), DemandedMask,
986 RHSKnownZero, RHSKnownOne, Depth+1);
987 ComputeMaskedBits(I->getOperand(0), DemandedMask & ~RHSKnownZero,
988 LHSKnownZero, LHSKnownOne, Depth+1);
990 // If all of the demanded bits are known 1 on one side, return the other.
991 // These bits cannot contribute to the result of the 'and' in this
993 if ((DemandedMask & ~LHSKnownZero & RHSKnownOne) ==
994 (DemandedMask & ~LHSKnownZero))
995 return I->getOperand(0);
996 if ((DemandedMask & ~RHSKnownZero & LHSKnownOne) ==
997 (DemandedMask & ~RHSKnownZero))
998 return I->getOperand(1);
1000 // If all of the demanded bits in the inputs are known zeros, return zero.
1001 if ((DemandedMask & (RHSKnownZero|LHSKnownZero)) == DemandedMask)
1002 return Constant::getNullValue(VTy);
1004 } else if (I->getOpcode() == Instruction::Or) {
1005 // We can simplify (X|Y) -> X or Y in the user's context if we know that
1006 // only bits from X or Y are demanded.
1008 // If either the LHS or the RHS are One, the result is One.
1009 ComputeMaskedBits(I->getOperand(1), DemandedMask,
1010 RHSKnownZero, RHSKnownOne, Depth+1);
1011 ComputeMaskedBits(I->getOperand(0), DemandedMask & ~RHSKnownOne,
1012 LHSKnownZero, LHSKnownOne, Depth+1);
1014 // If all of the demanded bits are known zero on one side, return the
1015 // other. These bits cannot contribute to the result of the 'or' in this
1017 if ((DemandedMask & ~LHSKnownOne & RHSKnownZero) ==
1018 (DemandedMask & ~LHSKnownOne))
1019 return I->getOperand(0);
1020 if ((DemandedMask & ~RHSKnownOne & LHSKnownZero) ==
1021 (DemandedMask & ~RHSKnownOne))
1022 return I->getOperand(1);
1024 // If all of the potentially set bits on one side are known to be set on
1025 // the other side, just use the 'other' side.
1026 if ((DemandedMask & (~RHSKnownZero) & LHSKnownOne) ==
1027 (DemandedMask & (~RHSKnownZero)))
1028 return I->getOperand(0);
1029 if ((DemandedMask & (~LHSKnownZero) & RHSKnownOne) ==
1030 (DemandedMask & (~LHSKnownZero)))
1031 return I->getOperand(1);
1034 // Compute the KnownZero/KnownOne bits to simplify things downstream.
1035 ComputeMaskedBits(I, DemandedMask, KnownZero, KnownOne, Depth);
1039 // If this is the root being simplified, allow it to have multiple uses,
1040 // just set the DemandedMask to all bits so that we can try to simplify the
1041 // operands. This allows visitTruncInst (for example) to simplify the
1042 // operand of a trunc without duplicating all the logic below.
1043 if (Depth == 0 && !V->hasOneUse())
1044 DemandedMask = APInt::getAllOnesValue(BitWidth);
1046 switch (I->getOpcode()) {
1048 ComputeMaskedBits(I, DemandedMask, RHSKnownZero, RHSKnownOne, Depth);
1050 case Instruction::And:
1051 // If either the LHS or the RHS are Zero, the result is zero.
1052 if (SimplifyDemandedBits(I->getOperandUse(1), DemandedMask,
1053 RHSKnownZero, RHSKnownOne, Depth+1) ||
1054 SimplifyDemandedBits(I->getOperandUse(0), DemandedMask & ~RHSKnownZero,
1055 LHSKnownZero, LHSKnownOne, Depth+1))
1057 assert(!(RHSKnownZero & RHSKnownOne) && "Bits known to be one AND zero?");
1058 assert(!(LHSKnownZero & LHSKnownOne) && "Bits known to be one AND zero?");
1060 // If all of the demanded bits are known 1 on one side, return the other.
1061 // These bits cannot contribute to the result of the 'and'.
1062 if ((DemandedMask & ~LHSKnownZero & RHSKnownOne) ==
1063 (DemandedMask & ~LHSKnownZero))
1064 return I->getOperand(0);
1065 if ((DemandedMask & ~RHSKnownZero & LHSKnownOne) ==
1066 (DemandedMask & ~RHSKnownZero))
1067 return I->getOperand(1);
1069 // If all of the demanded bits in the inputs are known zeros, return zero.
1070 if ((DemandedMask & (RHSKnownZero|LHSKnownZero)) == DemandedMask)
1071 return Constant::getNullValue(VTy);
1073 // If the RHS is a constant, see if we can simplify it.
1074 if (ShrinkDemandedConstant(I, 1, DemandedMask & ~LHSKnownZero))
1077 // Output known-1 bits are only known if set in both the LHS & RHS.
1078 RHSKnownOne &= LHSKnownOne;
1079 // Output known-0 are known to be clear if zero in either the LHS | RHS.
1080 RHSKnownZero |= LHSKnownZero;
1082 case Instruction::Or:
1083 // If either the LHS or the RHS are One, the result is One.
1084 if (SimplifyDemandedBits(I->getOperandUse(1), DemandedMask,
1085 RHSKnownZero, RHSKnownOne, Depth+1) ||
1086 SimplifyDemandedBits(I->getOperandUse(0), DemandedMask & ~RHSKnownOne,
1087 LHSKnownZero, LHSKnownOne, Depth+1))
1089 assert(!(RHSKnownZero & RHSKnownOne) && "Bits known to be one AND zero?");
1090 assert(!(LHSKnownZero & LHSKnownOne) && "Bits known to be one AND zero?");
1092 // If all of the demanded bits are known zero on one side, return the other.
1093 // These bits cannot contribute to the result of the 'or'.
1094 if ((DemandedMask & ~LHSKnownOne & RHSKnownZero) ==
1095 (DemandedMask & ~LHSKnownOne))
1096 return I->getOperand(0);
1097 if ((DemandedMask & ~RHSKnownOne & LHSKnownZero) ==
1098 (DemandedMask & ~RHSKnownOne))
1099 return I->getOperand(1);
1101 // If all of the potentially set bits on one side are known to be set on
1102 // the other side, just use the 'other' side.
1103 if ((DemandedMask & (~RHSKnownZero) & LHSKnownOne) ==
1104 (DemandedMask & (~RHSKnownZero)))
1105 return I->getOperand(0);
1106 if ((DemandedMask & (~LHSKnownZero) & RHSKnownOne) ==
1107 (DemandedMask & (~LHSKnownZero)))
1108 return I->getOperand(1);
1110 // If the RHS is a constant, see if we can simplify it.
1111 if (ShrinkDemandedConstant(I, 1, DemandedMask))
1114 // Output known-0 bits are only known if clear in both the LHS & RHS.
1115 RHSKnownZero &= LHSKnownZero;
1116 // Output known-1 are known to be set if set in either the LHS | RHS.
1117 RHSKnownOne |= LHSKnownOne;
1119 case Instruction::Xor: {
1120 if (SimplifyDemandedBits(I->getOperandUse(1), DemandedMask,
1121 RHSKnownZero, RHSKnownOne, Depth+1) ||
1122 SimplifyDemandedBits(I->getOperandUse(0), DemandedMask,
1123 LHSKnownZero, LHSKnownOne, Depth+1))
1125 assert(!(RHSKnownZero & RHSKnownOne) && "Bits known to be one AND zero?");
1126 assert(!(LHSKnownZero & LHSKnownOne) && "Bits known to be one AND zero?");
1128 // If all of the demanded bits are known zero on one side, return the other.
1129 // These bits cannot contribute to the result of the 'xor'.
1130 if ((DemandedMask & RHSKnownZero) == DemandedMask)
1131 return I->getOperand(0);
1132 if ((DemandedMask & LHSKnownZero) == DemandedMask)
1133 return I->getOperand(1);
1135 // Output known-0 bits are known if clear or set in both the LHS & RHS.
1136 APInt KnownZeroOut = (RHSKnownZero & LHSKnownZero) |
1137 (RHSKnownOne & LHSKnownOne);
1138 // Output known-1 are known to be set if set in only one of the LHS, RHS.
1139 APInt KnownOneOut = (RHSKnownZero & LHSKnownOne) |
1140 (RHSKnownOne & LHSKnownZero);
1142 // If all of the demanded bits are known to be zero on one side or the
1143 // other, turn this into an *inclusive* or.
1144 // e.g. (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
1145 if ((DemandedMask & ~RHSKnownZero & ~LHSKnownZero) == 0) {
1147 BinaryOperator::CreateOr(I->getOperand(0), I->getOperand(1),
1149 return InsertNewInstBefore(Or, *I);
1152 // If all of the demanded bits on one side are known, and all of the set
1153 // bits on that side are also known to be set on the other side, turn this
1154 // into an AND, as we know the bits will be cleared.
1155 // e.g. (X | C1) ^ C2 --> (X | C1) & ~C2 iff (C1&C2) == C2
1156 if ((DemandedMask & (RHSKnownZero|RHSKnownOne)) == DemandedMask) {
1158 if ((RHSKnownOne & LHSKnownOne) == RHSKnownOne) {
1159 Constant *AndC = Constant::getIntegerValue(VTy,
1160 ~RHSKnownOne & DemandedMask);
1162 BinaryOperator::CreateAnd(I->getOperand(0), AndC, "tmp");
1163 return InsertNewInstBefore(And, *I);
1167 // If the RHS is a constant, see if we can simplify it.
1168 // FIXME: for XOR, we prefer to force bits to 1 if they will make a -1.
1169 if (ShrinkDemandedConstant(I, 1, DemandedMask))
1172 // If our LHS is an 'and' and if it has one use, and if any of the bits we
1173 // are flipping are known to be set, then the xor is just resetting those
1174 // bits to zero. We can just knock out bits from the 'and' and the 'xor',
1175 // simplifying both of them.
1176 if (Instruction *LHSInst = dyn_cast<Instruction>(I->getOperand(0)))
1177 if (LHSInst->getOpcode() == Instruction::And && LHSInst->hasOneUse() &&
1178 isa<ConstantInt>(I->getOperand(1)) &&
1179 isa<ConstantInt>(LHSInst->getOperand(1)) &&
1180 (LHSKnownOne & RHSKnownOne & DemandedMask) != 0) {
1181 ConstantInt *AndRHS = cast<ConstantInt>(LHSInst->getOperand(1));
1182 ConstantInt *XorRHS = cast<ConstantInt>(I->getOperand(1));
1183 APInt NewMask = ~(LHSKnownOne & RHSKnownOne & DemandedMask);
1186 ConstantInt::get(I->getType(), NewMask & AndRHS->getValue());
1187 Instruction *NewAnd =
1188 BinaryOperator::CreateAnd(I->getOperand(0), AndC, "tmp");
1189 InsertNewInstBefore(NewAnd, *I);
1192 ConstantInt::get(I->getType(), NewMask & XorRHS->getValue());
1193 Instruction *NewXor =
1194 BinaryOperator::CreateXor(NewAnd, XorC, "tmp");
1195 return InsertNewInstBefore(NewXor, *I);
1199 RHSKnownZero = KnownZeroOut;
1200 RHSKnownOne = KnownOneOut;
1203 case Instruction::Select:
1204 if (SimplifyDemandedBits(I->getOperandUse(2), DemandedMask,
1205 RHSKnownZero, RHSKnownOne, Depth+1) ||
1206 SimplifyDemandedBits(I->getOperandUse(1), DemandedMask,
1207 LHSKnownZero, LHSKnownOne, Depth+1))
1209 assert(!(RHSKnownZero & RHSKnownOne) && "Bits known to be one AND zero?");
1210 assert(!(LHSKnownZero & LHSKnownOne) && "Bits known to be one AND zero?");
1212 // If the operands are constants, see if we can simplify them.
1213 if (ShrinkDemandedConstant(I, 1, DemandedMask) ||
1214 ShrinkDemandedConstant(I, 2, DemandedMask))
1217 // Only known if known in both the LHS and RHS.
1218 RHSKnownOne &= LHSKnownOne;
1219 RHSKnownZero &= LHSKnownZero;
1221 case Instruction::Trunc: {
1222 unsigned truncBf = I->getOperand(0)->getType()->getScalarSizeInBits();
1223 DemandedMask.zext(truncBf);
1224 RHSKnownZero.zext(truncBf);
1225 RHSKnownOne.zext(truncBf);
1226 if (SimplifyDemandedBits(I->getOperandUse(0), DemandedMask,
1227 RHSKnownZero, RHSKnownOne, Depth+1))
1229 DemandedMask.trunc(BitWidth);
1230 RHSKnownZero.trunc(BitWidth);
1231 RHSKnownOne.trunc(BitWidth);
1232 assert(!(RHSKnownZero & RHSKnownOne) && "Bits known to be one AND zero?");
1235 case Instruction::BitCast:
1236 if (!I->getOperand(0)->getType()->isIntOrIntVector())
1237 return false; // vector->int or fp->int?
1239 if (const VectorType *DstVTy = dyn_cast<VectorType>(I->getType())) {
1240 if (const VectorType *SrcVTy =
1241 dyn_cast<VectorType>(I->getOperand(0)->getType())) {
1242 if (DstVTy->getNumElements() != SrcVTy->getNumElements())
1243 // Don't touch a bitcast between vectors of different element counts.
1246 // Don't touch a scalar-to-vector bitcast.
1248 } else if (isa<VectorType>(I->getOperand(0)->getType()))
1249 // Don't touch a vector-to-scalar bitcast.
1252 if (SimplifyDemandedBits(I->getOperandUse(0), DemandedMask,
1253 RHSKnownZero, RHSKnownOne, Depth+1))
1255 assert(!(RHSKnownZero & RHSKnownOne) && "Bits known to be one AND zero?");
1257 case Instruction::ZExt: {
1258 // Compute the bits in the result that are not present in the input.
1259 unsigned SrcBitWidth =I->getOperand(0)->getType()->getScalarSizeInBits();
1261 DemandedMask.trunc(SrcBitWidth);
1262 RHSKnownZero.trunc(SrcBitWidth);
1263 RHSKnownOne.trunc(SrcBitWidth);
1264 if (SimplifyDemandedBits(I->getOperandUse(0), DemandedMask,
1265 RHSKnownZero, RHSKnownOne, Depth+1))
1267 DemandedMask.zext(BitWidth);
1268 RHSKnownZero.zext(BitWidth);
1269 RHSKnownOne.zext(BitWidth);
1270 assert(!(RHSKnownZero & RHSKnownOne) && "Bits known to be one AND zero?");
1271 // The top bits are known to be zero.
1272 RHSKnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth);
1275 case Instruction::SExt: {
1276 // Compute the bits in the result that are not present in the input.
1277 unsigned SrcBitWidth =I->getOperand(0)->getType()->getScalarSizeInBits();
1279 APInt InputDemandedBits = DemandedMask &
1280 APInt::getLowBitsSet(BitWidth, SrcBitWidth);
1282 APInt NewBits(APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth));
1283 // If any of the sign extended bits are demanded, we know that the sign
1285 if ((NewBits & DemandedMask) != 0)
1286 InputDemandedBits.set(SrcBitWidth-1);
1288 InputDemandedBits.trunc(SrcBitWidth);
1289 RHSKnownZero.trunc(SrcBitWidth);
1290 RHSKnownOne.trunc(SrcBitWidth);
1291 if (SimplifyDemandedBits(I->getOperandUse(0), InputDemandedBits,
1292 RHSKnownZero, RHSKnownOne, Depth+1))
1294 InputDemandedBits.zext(BitWidth);
1295 RHSKnownZero.zext(BitWidth);
1296 RHSKnownOne.zext(BitWidth);
1297 assert(!(RHSKnownZero & RHSKnownOne) && "Bits known to be one AND zero?");
1299 // If the sign bit of the input is known set or clear, then we know the
1300 // top bits of the result.
1302 // If the input sign bit is known zero, or if the NewBits are not demanded
1303 // convert this into a zero extension.
1304 if (RHSKnownZero[SrcBitWidth-1] || (NewBits & ~DemandedMask) == NewBits) {
1305 // Convert to ZExt cast
1306 CastInst *NewCast = new ZExtInst(I->getOperand(0), VTy, I->getName());
1307 return InsertNewInstBefore(NewCast, *I);
1308 } else if (RHSKnownOne[SrcBitWidth-1]) { // Input sign bit known set
1309 RHSKnownOne |= NewBits;
1313 case Instruction::Add: {
1314 // Figure out what the input bits are. If the top bits of the and result
1315 // are not demanded, then the add doesn't demand them from its input
1317 unsigned NLZ = DemandedMask.countLeadingZeros();
1319 // If there is a constant on the RHS, there are a variety of xformations
1321 if (ConstantInt *RHS = dyn_cast<ConstantInt>(I->getOperand(1))) {
1322 // If null, this should be simplified elsewhere. Some of the xforms here
1323 // won't work if the RHS is zero.
1327 // If the top bit of the output is demanded, demand everything from the
1328 // input. Otherwise, we demand all the input bits except NLZ top bits.
1329 APInt InDemandedBits(APInt::getLowBitsSet(BitWidth, BitWidth - NLZ));
1331 // Find information about known zero/one bits in the input.
1332 if (SimplifyDemandedBits(I->getOperandUse(0), InDemandedBits,
1333 LHSKnownZero, LHSKnownOne, Depth+1))
1336 // If the RHS of the add has bits set that can't affect the input, reduce
1338 if (ShrinkDemandedConstant(I, 1, InDemandedBits))
1341 // Avoid excess work.
1342 if (LHSKnownZero == 0 && LHSKnownOne == 0)
1345 // Turn it into OR if input bits are zero.
1346 if ((LHSKnownZero & RHS->getValue()) == RHS->getValue()) {
1348 BinaryOperator::CreateOr(I->getOperand(0), I->getOperand(1),
1350 return InsertNewInstBefore(Or, *I);
1353 // We can say something about the output known-zero and known-one bits,
1354 // depending on potential carries from the input constant and the
1355 // unknowns. For example if the LHS is known to have at most the 0x0F0F0
1356 // bits set and the RHS constant is 0x01001, then we know we have a known
1357 // one mask of 0x00001 and a known zero mask of 0xE0F0E.
1359 // To compute this, we first compute the potential carry bits. These are
1360 // the bits which may be modified. I'm not aware of a better way to do
1362 const APInt &RHSVal = RHS->getValue();
1363 APInt CarryBits((~LHSKnownZero + RHSVal) ^ (~LHSKnownZero ^ RHSVal));
1365 // Now that we know which bits have carries, compute the known-1/0 sets.
1367 // Bits are known one if they are known zero in one operand and one in the
1368 // other, and there is no input carry.
1369 RHSKnownOne = ((LHSKnownZero & RHSVal) |
1370 (LHSKnownOne & ~RHSVal)) & ~CarryBits;
1372 // Bits are known zero if they are known zero in both operands and there
1373 // is no input carry.
1374 RHSKnownZero = LHSKnownZero & ~RHSVal & ~CarryBits;
1376 // If the high-bits of this ADD are not demanded, then it does not demand
1377 // the high bits of its LHS or RHS.
1378 if (DemandedMask[BitWidth-1] == 0) {
1379 // Right fill the mask of bits for this ADD to demand the most
1380 // significant bit and all those below it.
1381 APInt DemandedFromOps(APInt::getLowBitsSet(BitWidth, BitWidth-NLZ));
1382 if (SimplifyDemandedBits(I->getOperandUse(0), DemandedFromOps,
1383 LHSKnownZero, LHSKnownOne, Depth+1) ||
1384 SimplifyDemandedBits(I->getOperandUse(1), DemandedFromOps,
1385 LHSKnownZero, LHSKnownOne, Depth+1))
1391 case Instruction::Sub:
1392 // If the high-bits of this SUB are not demanded, then it does not demand
1393 // the high bits of its LHS or RHS.
1394 if (DemandedMask[BitWidth-1] == 0) {
1395 // Right fill the mask of bits for this SUB to demand the most
1396 // significant bit and all those below it.
1397 uint32_t NLZ = DemandedMask.countLeadingZeros();
1398 APInt DemandedFromOps(APInt::getLowBitsSet(BitWidth, BitWidth-NLZ));
1399 if (SimplifyDemandedBits(I->getOperandUse(0), DemandedFromOps,
1400 LHSKnownZero, LHSKnownOne, Depth+1) ||
1401 SimplifyDemandedBits(I->getOperandUse(1), DemandedFromOps,
1402 LHSKnownZero, LHSKnownOne, Depth+1))
1405 // Otherwise just hand the sub off to ComputeMaskedBits to fill in
1406 // the known zeros and ones.
1407 ComputeMaskedBits(V, DemandedMask, RHSKnownZero, RHSKnownOne, Depth);
1409 case Instruction::Shl:
1410 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
1411 uint64_t ShiftAmt = SA->getLimitedValue(BitWidth);
1412 APInt DemandedMaskIn(DemandedMask.lshr(ShiftAmt));
1413 if (SimplifyDemandedBits(I->getOperandUse(0), DemandedMaskIn,
1414 RHSKnownZero, RHSKnownOne, Depth+1))
1416 assert(!(RHSKnownZero & RHSKnownOne) && "Bits known to be one AND zero?");
1417 RHSKnownZero <<= ShiftAmt;
1418 RHSKnownOne <<= ShiftAmt;
1419 // low bits known zero.
1421 RHSKnownZero |= APInt::getLowBitsSet(BitWidth, ShiftAmt);
1424 case Instruction::LShr:
1425 // For a logical shift right
1426 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
1427 uint64_t ShiftAmt = SA->getLimitedValue(BitWidth);
1429 // Unsigned shift right.
1430 APInt DemandedMaskIn(DemandedMask.shl(ShiftAmt));
1431 if (SimplifyDemandedBits(I->getOperandUse(0), DemandedMaskIn,
1432 RHSKnownZero, RHSKnownOne, Depth+1))
1434 assert(!(RHSKnownZero & RHSKnownOne) && "Bits known to be one AND zero?");
1435 RHSKnownZero = APIntOps::lshr(RHSKnownZero, ShiftAmt);
1436 RHSKnownOne = APIntOps::lshr(RHSKnownOne, ShiftAmt);
1438 // Compute the new bits that are at the top now.
1439 APInt HighBits(APInt::getHighBitsSet(BitWidth, ShiftAmt));
1440 RHSKnownZero |= HighBits; // high bits known zero.
1444 case Instruction::AShr:
1445 // If this is an arithmetic shift right and only the low-bit is set, we can
1446 // always convert this into a logical shr, even if the shift amount is
1447 // variable. The low bit of the shift cannot be an input sign bit unless
1448 // the shift amount is >= the size of the datatype, which is undefined.
1449 if (DemandedMask == 1) {
1450 // Perform the logical shift right.
1451 Instruction *NewVal = BinaryOperator::CreateLShr(
1452 I->getOperand(0), I->getOperand(1), I->getName());
1453 return InsertNewInstBefore(NewVal, *I);
1456 // If the sign bit is the only bit demanded by this ashr, then there is no
1457 // need to do it, the shift doesn't change the high bit.
1458 if (DemandedMask.isSignBit())
1459 return I->getOperand(0);
1461 if (ConstantInt *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
1462 uint32_t ShiftAmt = SA->getLimitedValue(BitWidth);
1464 // Signed shift right.
1465 APInt DemandedMaskIn(DemandedMask.shl(ShiftAmt));
1466 // If any of the "high bits" are demanded, we should set the sign bit as
1468 if (DemandedMask.countLeadingZeros() <= ShiftAmt)
1469 DemandedMaskIn.set(BitWidth-1);
1470 if (SimplifyDemandedBits(I->getOperandUse(0), DemandedMaskIn,
1471 RHSKnownZero, RHSKnownOne, Depth+1))
1473 assert(!(RHSKnownZero & RHSKnownOne) && "Bits known to be one AND zero?");
1474 // Compute the new bits that are at the top now.
1475 APInt HighBits(APInt::getHighBitsSet(BitWidth, ShiftAmt));
1476 RHSKnownZero = APIntOps::lshr(RHSKnownZero, ShiftAmt);
1477 RHSKnownOne = APIntOps::lshr(RHSKnownOne, ShiftAmt);
1479 // Handle the sign bits.
1480 APInt SignBit(APInt::getSignBit(BitWidth));
1481 // Adjust to where it is now in the mask.
1482 SignBit = APIntOps::lshr(SignBit, ShiftAmt);
1484 // If the input sign bit is known to be zero, or if none of the top bits
1485 // are demanded, turn this into an unsigned shift right.
1486 if (BitWidth <= ShiftAmt || RHSKnownZero[BitWidth-ShiftAmt-1] ||
1487 (HighBits & ~DemandedMask) == HighBits) {
1488 // Perform the logical shift right.
1489 Instruction *NewVal = BinaryOperator::CreateLShr(
1490 I->getOperand(0), SA, I->getName());
1491 return InsertNewInstBefore(NewVal, *I);
1492 } else if ((RHSKnownOne & SignBit) != 0) { // New bits are known one.
1493 RHSKnownOne |= HighBits;
1497 case Instruction::SRem:
1498 if (ConstantInt *Rem = dyn_cast<ConstantInt>(I->getOperand(1))) {
1499 APInt RA = Rem->getValue().abs();
1500 if (RA.isPowerOf2()) {
1501 if (DemandedMask.ult(RA)) // srem won't affect demanded bits
1502 return I->getOperand(0);
1504 APInt LowBits = RA - 1;
1505 APInt Mask2 = LowBits | APInt::getSignBit(BitWidth);
1506 if (SimplifyDemandedBits(I->getOperandUse(0), Mask2,
1507 LHSKnownZero, LHSKnownOne, Depth+1))
1510 if (LHSKnownZero[BitWidth-1] || ((LHSKnownZero & LowBits) == LowBits))
1511 LHSKnownZero |= ~LowBits;
1513 KnownZero |= LHSKnownZero & DemandedMask;
1515 assert(!(KnownZero & KnownOne) && "Bits known to be one AND zero?");
1519 case Instruction::URem: {
1520 APInt KnownZero2(BitWidth, 0), KnownOne2(BitWidth, 0);
1521 APInt AllOnes = APInt::getAllOnesValue(BitWidth);
1522 if (SimplifyDemandedBits(I->getOperandUse(0), AllOnes,
1523 KnownZero2, KnownOne2, Depth+1) ||
1524 SimplifyDemandedBits(I->getOperandUse(1), AllOnes,
1525 KnownZero2, KnownOne2, Depth+1))
1528 unsigned Leaders = KnownZero2.countLeadingOnes();
1529 Leaders = std::max(Leaders,
1530 KnownZero2.countLeadingOnes());
1531 KnownZero = APInt::getHighBitsSet(BitWidth, Leaders) & DemandedMask;
1534 case Instruction::Call:
1535 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) {
1536 switch (II->getIntrinsicID()) {
1538 case Intrinsic::bswap: {
1539 // If the only bits demanded come from one byte of the bswap result,
1540 // just shift the input byte into position to eliminate the bswap.
1541 unsigned NLZ = DemandedMask.countLeadingZeros();
1542 unsigned NTZ = DemandedMask.countTrailingZeros();
1544 // Round NTZ down to the next byte. If we have 11 trailing zeros, then
1545 // we need all the bits down to bit 8. Likewise, round NLZ. If we
1546 // have 14 leading zeros, round to 8.
1549 // If we need exactly one byte, we can do this transformation.
1550 if (BitWidth-NLZ-NTZ == 8) {
1551 unsigned ResultBit = NTZ;
1552 unsigned InputBit = BitWidth-NTZ-8;
1554 // Replace this with either a left or right shift to get the byte into
1556 Instruction *NewVal;
1557 if (InputBit > ResultBit)
1558 NewVal = BinaryOperator::CreateLShr(I->getOperand(1),
1559 ConstantInt::get(I->getType(), InputBit-ResultBit));
1561 NewVal = BinaryOperator::CreateShl(I->getOperand(1),
1562 ConstantInt::get(I->getType(), ResultBit-InputBit));
1563 NewVal->takeName(I);
1564 return InsertNewInstBefore(NewVal, *I);
1567 // TODO: Could compute known zero/one bits based on the input.
1572 ComputeMaskedBits(V, DemandedMask, RHSKnownZero, RHSKnownOne, Depth);
1576 // If the client is only demanding bits that we know, return the known
1578 if ((DemandedMask & (RHSKnownZero|RHSKnownOne)) == DemandedMask)
1579 return Constant::getIntegerValue(VTy, RHSKnownOne);
1584 /// SimplifyDemandedVectorElts - The specified value produces a vector with
1585 /// any number of elements. DemandedElts contains the set of elements that are
1586 /// actually used by the caller. This method analyzes which elements of the
1587 /// operand are undef and returns that information in UndefElts.
1589 /// If the information about demanded elements can be used to simplify the
1590 /// operation, the operation is simplified, then the resultant value is
1591 /// returned. This returns null if no change was made.
1592 Value *InstCombiner::SimplifyDemandedVectorElts(Value *V, APInt DemandedElts,
1595 unsigned VWidth = cast<VectorType>(V->getType())->getNumElements();
1596 APInt EltMask(APInt::getAllOnesValue(VWidth));
1597 assert((DemandedElts & ~EltMask) == 0 && "Invalid DemandedElts!");
1599 if (isa<UndefValue>(V)) {
1600 // If the entire vector is undefined, just return this info.
1601 UndefElts = EltMask;
1603 } else if (DemandedElts == 0) { // If nothing is demanded, provide undef.
1604 UndefElts = EltMask;
1605 return UndefValue::get(V->getType());
1609 if (ConstantVector *CP = dyn_cast<ConstantVector>(V)) {
1610 const Type *EltTy = cast<VectorType>(V->getType())->getElementType();
1611 Constant *Undef = UndefValue::get(EltTy);
1613 std::vector<Constant*> Elts;
1614 for (unsigned i = 0; i != VWidth; ++i)
1615 if (!DemandedElts[i]) { // If not demanded, set to undef.
1616 Elts.push_back(Undef);
1618 } else if (isa<UndefValue>(CP->getOperand(i))) { // Already undef.
1619 Elts.push_back(Undef);
1621 } else { // Otherwise, defined.
1622 Elts.push_back(CP->getOperand(i));
1625 // If we changed the constant, return it.
1626 Constant *NewCP = ConstantVector::get(Elts);
1627 return NewCP != CP ? NewCP : 0;
1628 } else if (isa<ConstantAggregateZero>(V)) {
1629 // Simplify the CAZ to a ConstantVector where the non-demanded elements are
1632 // Check if this is identity. If so, return 0 since we are not simplifying
1634 if (DemandedElts == ((1ULL << VWidth) -1))
1637 const Type *EltTy = cast<VectorType>(V->getType())->getElementType();
1638 Constant *Zero = Constant::getNullValue(EltTy);
1639 Constant *Undef = UndefValue::get(EltTy);
1640 std::vector<Constant*> Elts;
1641 for (unsigned i = 0; i != VWidth; ++i) {
1642 Constant *Elt = DemandedElts[i] ? Zero : Undef;
1643 Elts.push_back(Elt);
1645 UndefElts = DemandedElts ^ EltMask;
1646 return ConstantVector::get(Elts);
1649 // Limit search depth.
1653 // If multiple users are using the root value, procede with
1654 // simplification conservatively assuming that all elements
1656 if (!V->hasOneUse()) {
1657 // Quit if we find multiple users of a non-root value though.
1658 // They'll be handled when it's their turn to be visited by
1659 // the main instcombine process.
1661 // TODO: Just compute the UndefElts information recursively.
1664 // Conservatively assume that all elements are needed.
1665 DemandedElts = EltMask;
1668 Instruction *I = dyn_cast<Instruction>(V);
1669 if (!I) return 0; // Only analyze instructions.
1671 bool MadeChange = false;
1672 APInt UndefElts2(VWidth, 0);
1674 switch (I->getOpcode()) {
1677 case Instruction::InsertElement: {
1678 // If this is a variable index, we don't know which element it overwrites.
1679 // demand exactly the same input as we produce.
1680 ConstantInt *Idx = dyn_cast<ConstantInt>(I->getOperand(2));
1682 // Note that we can't propagate undef elt info, because we don't know
1683 // which elt is getting updated.
1684 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), DemandedElts,
1685 UndefElts2, Depth+1);
1686 if (TmpV) { I->setOperand(0, TmpV); MadeChange = true; }
1690 // If this is inserting an element that isn't demanded, remove this
1692 unsigned IdxNo = Idx->getZExtValue();
1693 if (IdxNo >= VWidth || !DemandedElts[IdxNo]) {
1695 return I->getOperand(0);
1698 // Otherwise, the element inserted overwrites whatever was there, so the
1699 // input demanded set is simpler than the output set.
1700 APInt DemandedElts2 = DemandedElts;
1701 DemandedElts2.clear(IdxNo);
1702 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), DemandedElts2,
1703 UndefElts, Depth+1);
1704 if (TmpV) { I->setOperand(0, TmpV); MadeChange = true; }
1706 // The inserted element is defined.
1707 UndefElts.clear(IdxNo);
1710 case Instruction::ShuffleVector: {
1711 ShuffleVectorInst *Shuffle = cast<ShuffleVectorInst>(I);
1712 uint64_t LHSVWidth =
1713 cast<VectorType>(Shuffle->getOperand(0)->getType())->getNumElements();
1714 APInt LeftDemanded(LHSVWidth, 0), RightDemanded(LHSVWidth, 0);
1715 for (unsigned i = 0; i < VWidth; i++) {
1716 if (DemandedElts[i]) {
1717 unsigned MaskVal = Shuffle->getMaskValue(i);
1718 if (MaskVal != -1u) {
1719 assert(MaskVal < LHSVWidth * 2 &&
1720 "shufflevector mask index out of range!");
1721 if (MaskVal < LHSVWidth)
1722 LeftDemanded.set(MaskVal);
1724 RightDemanded.set(MaskVal - LHSVWidth);
1729 APInt UndefElts4(LHSVWidth, 0);
1730 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), LeftDemanded,
1731 UndefElts4, Depth+1);
1732 if (TmpV) { I->setOperand(0, TmpV); MadeChange = true; }
1734 APInt UndefElts3(LHSVWidth, 0);
1735 TmpV = SimplifyDemandedVectorElts(I->getOperand(1), RightDemanded,
1736 UndefElts3, Depth+1);
1737 if (TmpV) { I->setOperand(1, TmpV); MadeChange = true; }
1739 bool NewUndefElts = false;
1740 for (unsigned i = 0; i < VWidth; i++) {
1741 unsigned MaskVal = Shuffle->getMaskValue(i);
1742 if (MaskVal == -1u) {
1744 } else if (MaskVal < LHSVWidth) {
1745 if (UndefElts4[MaskVal]) {
1746 NewUndefElts = true;
1750 if (UndefElts3[MaskVal - LHSVWidth]) {
1751 NewUndefElts = true;
1758 // Add additional discovered undefs.
1759 std::vector<Constant*> Elts;
1760 for (unsigned i = 0; i < VWidth; ++i) {
1762 Elts.push_back(UndefValue::get(Type::getInt32Ty(*Context)));
1764 Elts.push_back(ConstantInt::get(Type::getInt32Ty(*Context),
1765 Shuffle->getMaskValue(i)));
1767 I->setOperand(2, ConstantVector::get(Elts));
1772 case Instruction::BitCast: {
1773 // Vector->vector casts only.
1774 const VectorType *VTy = dyn_cast<VectorType>(I->getOperand(0)->getType());
1776 unsigned InVWidth = VTy->getNumElements();
1777 APInt InputDemandedElts(InVWidth, 0);
1780 if (VWidth == InVWidth) {
1781 // If we are converting from <4 x i32> -> <4 x f32>, we demand the same
1782 // elements as are demanded of us.
1784 InputDemandedElts = DemandedElts;
1785 } else if (VWidth > InVWidth) {
1789 // If there are more elements in the result than there are in the source,
1790 // then an input element is live if any of the corresponding output
1791 // elements are live.
1792 Ratio = VWidth/InVWidth;
1793 for (unsigned OutIdx = 0; OutIdx != VWidth; ++OutIdx) {
1794 if (DemandedElts[OutIdx])
1795 InputDemandedElts.set(OutIdx/Ratio);
1801 // If there are more elements in the source than there are in the result,
1802 // then an input element is live if the corresponding output element is
1804 Ratio = InVWidth/VWidth;
1805 for (unsigned InIdx = 0; InIdx != InVWidth; ++InIdx)
1806 if (DemandedElts[InIdx/Ratio])
1807 InputDemandedElts.set(InIdx);
1810 // div/rem demand all inputs, because they don't want divide by zero.
1811 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), InputDemandedElts,
1812 UndefElts2, Depth+1);
1814 I->setOperand(0, TmpV);
1818 UndefElts = UndefElts2;
1819 if (VWidth > InVWidth) {
1820 llvm_unreachable("Unimp");
1821 // If there are more elements in the result than there are in the source,
1822 // then an output element is undef if the corresponding input element is
1824 for (unsigned OutIdx = 0; OutIdx != VWidth; ++OutIdx)
1825 if (UndefElts2[OutIdx/Ratio])
1826 UndefElts.set(OutIdx);
1827 } else if (VWidth < InVWidth) {
1828 llvm_unreachable("Unimp");
1829 // If there are more elements in the source than there are in the result,
1830 // then a result element is undef if all of the corresponding input
1831 // elements are undef.
1832 UndefElts = ~0ULL >> (64-VWidth); // Start out all undef.
1833 for (unsigned InIdx = 0; InIdx != InVWidth; ++InIdx)
1834 if (!UndefElts2[InIdx]) // Not undef?
1835 UndefElts.clear(InIdx/Ratio); // Clear undef bit.
1839 case Instruction::And:
1840 case Instruction::Or:
1841 case Instruction::Xor:
1842 case Instruction::Add:
1843 case Instruction::Sub:
1844 case Instruction::Mul:
1845 // div/rem demand all inputs, because they don't want divide by zero.
1846 TmpV = SimplifyDemandedVectorElts(I->getOperand(0), DemandedElts,
1847 UndefElts, Depth+1);
1848 if (TmpV) { I->setOperand(0, TmpV); MadeChange = true; }
1849 TmpV = SimplifyDemandedVectorElts(I->getOperand(1), DemandedElts,
1850 UndefElts2, Depth+1);
1851 if (TmpV) { I->setOperand(1, TmpV); MadeChange = true; }
1853 // Output elements are undefined if both are undefined. Consider things
1854 // like undef&0. The result is known zero, not undef.
1855 UndefElts &= UndefElts2;
1858 case Instruction::Call: {
1859 IntrinsicInst *II = dyn_cast<IntrinsicInst>(I);
1861 switch (II->getIntrinsicID()) {
1864 // Binary vector operations that work column-wise. A dest element is a
1865 // function of the corresponding input elements from the two inputs.
1866 case Intrinsic::x86_sse_sub_ss:
1867 case Intrinsic::x86_sse_mul_ss:
1868 case Intrinsic::x86_sse_min_ss:
1869 case Intrinsic::x86_sse_max_ss:
1870 case Intrinsic::x86_sse2_sub_sd:
1871 case Intrinsic::x86_sse2_mul_sd:
1872 case Intrinsic::x86_sse2_min_sd:
1873 case Intrinsic::x86_sse2_max_sd:
1874 TmpV = SimplifyDemandedVectorElts(II->getOperand(1), DemandedElts,
1875 UndefElts, Depth+1);
1876 if (TmpV) { II->setOperand(1, TmpV); MadeChange = true; }
1877 TmpV = SimplifyDemandedVectorElts(II->getOperand(2), DemandedElts,
1878 UndefElts2, Depth+1);
1879 if (TmpV) { II->setOperand(2, TmpV); MadeChange = true; }
1881 // If only the low elt is demanded and this is a scalarizable intrinsic,
1882 // scalarize it now.
1883 if (DemandedElts == 1) {
1884 switch (II->getIntrinsicID()) {
1886 case Intrinsic::x86_sse_sub_ss:
1887 case Intrinsic::x86_sse_mul_ss:
1888 case Intrinsic::x86_sse2_sub_sd:
1889 case Intrinsic::x86_sse2_mul_sd:
1890 // TODO: Lower MIN/MAX/ABS/etc
1891 Value *LHS = II->getOperand(1);
1892 Value *RHS = II->getOperand(2);
1893 // Extract the element as scalars.
1894 LHS = InsertNewInstBefore(ExtractElementInst::Create(LHS,
1895 ConstantInt::get(Type::getInt32Ty(*Context), 0U, false), "tmp"), *II);
1896 RHS = InsertNewInstBefore(ExtractElementInst::Create(RHS,
1897 ConstantInt::get(Type::getInt32Ty(*Context), 0U, false), "tmp"), *II);
1899 switch (II->getIntrinsicID()) {
1900 default: llvm_unreachable("Case stmts out of sync!");
1901 case Intrinsic::x86_sse_sub_ss:
1902 case Intrinsic::x86_sse2_sub_sd:
1903 TmpV = InsertNewInstBefore(BinaryOperator::CreateFSub(LHS, RHS,
1904 II->getName()), *II);
1906 case Intrinsic::x86_sse_mul_ss:
1907 case Intrinsic::x86_sse2_mul_sd:
1908 TmpV = InsertNewInstBefore(BinaryOperator::CreateFMul(LHS, RHS,
1909 II->getName()), *II);
1914 InsertElementInst::Create(
1915 UndefValue::get(II->getType()), TmpV,
1916 ConstantInt::get(Type::getInt32Ty(*Context), 0U, false), II->getName());
1917 InsertNewInstBefore(New, *II);
1922 // Output elements are undefined if both are undefined. Consider things
1923 // like undef&0. The result is known zero, not undef.
1924 UndefElts &= UndefElts2;
1930 return MadeChange ? I : 0;
1934 /// AssociativeOpt - Perform an optimization on an associative operator. This
1935 /// function is designed to check a chain of associative operators for a
1936 /// potential to apply a certain optimization. Since the optimization may be
1937 /// applicable if the expression was reassociated, this checks the chain, then
1938 /// reassociates the expression as necessary to expose the optimization
1939 /// opportunity. This makes use of a special Functor, which must define
1940 /// 'shouldApply' and 'apply' methods.
1942 template<typename Functor>
1943 static Instruction *AssociativeOpt(BinaryOperator &Root, const Functor &F) {
1944 unsigned Opcode = Root.getOpcode();
1945 Value *LHS = Root.getOperand(0);
1947 // Quick check, see if the immediate LHS matches...
1948 if (F.shouldApply(LHS))
1949 return F.apply(Root);
1951 // Otherwise, if the LHS is not of the same opcode as the root, return.
1952 Instruction *LHSI = dyn_cast<Instruction>(LHS);
1953 while (LHSI && LHSI->getOpcode() == Opcode && LHSI->hasOneUse()) {
1954 // Should we apply this transform to the RHS?
1955 bool ShouldApply = F.shouldApply(LHSI->getOperand(1));
1957 // If not to the RHS, check to see if we should apply to the LHS...
1958 if (!ShouldApply && F.shouldApply(LHSI->getOperand(0))) {
1959 cast<BinaryOperator>(LHSI)->swapOperands(); // Make the LHS the RHS
1963 // If the functor wants to apply the optimization to the RHS of LHSI,
1964 // reassociate the expression from ((? op A) op B) to (? op (A op B))
1966 // Now all of the instructions are in the current basic block, go ahead
1967 // and perform the reassociation.
1968 Instruction *TmpLHSI = cast<Instruction>(Root.getOperand(0));
1970 // First move the selected RHS to the LHS of the root...
1971 Root.setOperand(0, LHSI->getOperand(1));
1973 // Make what used to be the LHS of the root be the user of the root...
1974 Value *ExtraOperand = TmpLHSI->getOperand(1);
1975 if (&Root == TmpLHSI) {
1976 Root.replaceAllUsesWith(Constant::getNullValue(TmpLHSI->getType()));
1979 Root.replaceAllUsesWith(TmpLHSI); // Users now use TmpLHSI
1980 TmpLHSI->setOperand(1, &Root); // TmpLHSI now uses the root
1981 BasicBlock::iterator ARI = &Root; ++ARI;
1982 TmpLHSI->moveBefore(ARI); // Move TmpLHSI to after Root
1985 // Now propagate the ExtraOperand down the chain of instructions until we
1987 while (TmpLHSI != LHSI) {
1988 Instruction *NextLHSI = cast<Instruction>(TmpLHSI->getOperand(0));
1989 // Move the instruction to immediately before the chain we are
1990 // constructing to avoid breaking dominance properties.
1991 NextLHSI->moveBefore(ARI);
1994 Value *NextOp = NextLHSI->getOperand(1);
1995 NextLHSI->setOperand(1, ExtraOperand);
1997 ExtraOperand = NextOp;
2000 // Now that the instructions are reassociated, have the functor perform
2001 // the transformation...
2002 return F.apply(Root);
2005 LHSI = dyn_cast<Instruction>(LHSI->getOperand(0));
2012 // AddRHS - Implements: X + X --> X << 1
2015 explicit AddRHS(Value *rhs) : RHS(rhs) {}
2016 bool shouldApply(Value *LHS) const { return LHS == RHS; }
2017 Instruction *apply(BinaryOperator &Add) const {
2018 return BinaryOperator::CreateShl(Add.getOperand(0),
2019 ConstantInt::get(Add.getType(), 1));
2023 // AddMaskingAnd - Implements (A & C1)+(B & C2) --> (A & C1)|(B & C2)
2025 struct AddMaskingAnd {
2027 explicit AddMaskingAnd(Constant *c) : C2(c) {}
2028 bool shouldApply(Value *LHS) const {
2030 return match(LHS, m_And(m_Value(), m_ConstantInt(C1))) &&
2031 ConstantExpr::getAnd(C1, C2)->isNullValue();
2033 Instruction *apply(BinaryOperator &Add) const {
2034 return BinaryOperator::CreateOr(Add.getOperand(0), Add.getOperand(1));
2040 static Value *FoldOperationIntoSelectOperand(Instruction &I, Value *SO,
2042 if (CastInst *CI = dyn_cast<CastInst>(&I))
2043 return IC->Builder->CreateCast(CI->getOpcode(), SO, I.getType());
2045 // Figure out if the constant is the left or the right argument.
2046 bool ConstIsRHS = isa<Constant>(I.getOperand(1));
2047 Constant *ConstOperand = cast<Constant>(I.getOperand(ConstIsRHS));
2049 if (Constant *SOC = dyn_cast<Constant>(SO)) {
2051 return ConstantExpr::get(I.getOpcode(), SOC, ConstOperand);
2052 return ConstantExpr::get(I.getOpcode(), ConstOperand, SOC);
2055 Value *Op0 = SO, *Op1 = ConstOperand;
2057 std::swap(Op0, Op1);
2059 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(&I))
2060 return IC->Builder->CreateBinOp(BO->getOpcode(), Op0, Op1,
2061 SO->getName()+".op");
2062 if (ICmpInst *CI = dyn_cast<ICmpInst>(&I))
2063 return IC->Builder->CreateICmp(CI->getPredicate(), Op0, Op1,
2064 SO->getName()+".cmp");
2065 if (FCmpInst *CI = dyn_cast<FCmpInst>(&I))
2066 return IC->Builder->CreateICmp(CI->getPredicate(), Op0, Op1,
2067 SO->getName()+".cmp");
2068 llvm_unreachable("Unknown binary instruction type!");
2071 // FoldOpIntoSelect - Given an instruction with a select as one operand and a
2072 // constant as the other operand, try to fold the binary operator into the
2073 // select arguments. This also works for Cast instructions, which obviously do
2074 // not have a second operand.
2075 static Instruction *FoldOpIntoSelect(Instruction &Op, SelectInst *SI,
2077 // Don't modify shared select instructions
2078 if (!SI->hasOneUse()) return 0;
2079 Value *TV = SI->getOperand(1);
2080 Value *FV = SI->getOperand(2);
2082 if (isa<Constant>(TV) || isa<Constant>(FV)) {
2083 // Bool selects with constant operands can be folded to logical ops.
2084 if (SI->getType() == Type::getInt1Ty(*IC->getContext())) return 0;
2086 Value *SelectTrueVal = FoldOperationIntoSelectOperand(Op, TV, IC);
2087 Value *SelectFalseVal = FoldOperationIntoSelectOperand(Op, FV, IC);
2089 return SelectInst::Create(SI->getCondition(), SelectTrueVal,
2096 /// FoldOpIntoPhi - Given a binary operator, cast instruction, or select which
2097 /// has a PHI node as operand #0, see if we can fold the instruction into the
2098 /// PHI (which is only possible if all operands to the PHI are constants).
2100 /// If AllowAggressive is true, FoldOpIntoPhi will allow certain transforms
2101 /// that would normally be unprofitable because they strongly encourage jump
2103 Instruction *InstCombiner::FoldOpIntoPhi(Instruction &I,
2104 bool AllowAggressive) {
2105 AllowAggressive = false;
2106 PHINode *PN = cast<PHINode>(I.getOperand(0));
2107 unsigned NumPHIValues = PN->getNumIncomingValues();
2108 if (NumPHIValues == 0 ||
2109 // We normally only transform phis with a single use, unless we're trying
2110 // hard to make jump threading happen.
2111 (!PN->hasOneUse() && !AllowAggressive))
2115 // Check to see if all of the operands of the PHI are simple constants
2116 // (constantint/constantfp/undef). If there is one non-constant value,
2117 // remember the BB it is in. If there is more than one or if *it* is a PHI,
2118 // bail out. We don't do arbitrary constant expressions here because moving
2119 // their computation can be expensive without a cost model.
2120 BasicBlock *NonConstBB = 0;
2121 for (unsigned i = 0; i != NumPHIValues; ++i)
2122 if (!isa<Constant>(PN->getIncomingValue(i)) ||
2123 isa<ConstantExpr>(PN->getIncomingValue(i))) {
2124 if (NonConstBB) return 0; // More than one non-const value.
2125 if (isa<PHINode>(PN->getIncomingValue(i))) return 0; // Itself a phi.
2126 NonConstBB = PN->getIncomingBlock(i);
2128 // If the incoming non-constant value is in I's block, we have an infinite
2130 if (NonConstBB == I.getParent())
2134 // If there is exactly one non-constant value, we can insert a copy of the
2135 // operation in that block. However, if this is a critical edge, we would be
2136 // inserting the computation one some other paths (e.g. inside a loop). Only
2137 // do this if the pred block is unconditionally branching into the phi block.
2138 if (NonConstBB != 0 && !AllowAggressive) {
2139 BranchInst *BI = dyn_cast<BranchInst>(NonConstBB->getTerminator());
2140 if (!BI || !BI->isUnconditional()) return 0;
2143 // Okay, we can do the transformation: create the new PHI node.
2144 PHINode *NewPN = PHINode::Create(I.getType(), "");
2145 NewPN->reserveOperandSpace(PN->getNumOperands()/2);
2146 InsertNewInstBefore(NewPN, *PN);
2147 NewPN->takeName(PN);
2149 // Next, add all of the operands to the PHI.
2150 if (SelectInst *SI = dyn_cast<SelectInst>(&I)) {
2151 // We only currently try to fold the condition of a select when it is a phi,
2152 // not the true/false values.
2153 Value *TrueV = SI->getTrueValue();
2154 Value *FalseV = SI->getFalseValue();
2155 BasicBlock *PhiTransBB = PN->getParent();
2156 for (unsigned i = 0; i != NumPHIValues; ++i) {
2157 BasicBlock *ThisBB = PN->getIncomingBlock(i);
2158 Value *TrueVInPred = TrueV->DoPHITranslation(PhiTransBB, ThisBB);
2159 Value *FalseVInPred = FalseV->DoPHITranslation(PhiTransBB, ThisBB);
2161 if (Constant *InC = dyn_cast<Constant>(PN->getIncomingValue(i))) {
2162 InV = InC->isNullValue() ? FalseVInPred : TrueVInPred;
2164 assert(PN->getIncomingBlock(i) == NonConstBB);
2165 InV = SelectInst::Create(PN->getIncomingValue(i), TrueVInPred,
2167 "phitmp", NonConstBB->getTerminator());
2168 Worklist.Add(cast<Instruction>(InV));
2170 NewPN->addIncoming(InV, ThisBB);
2172 } else if (I.getNumOperands() == 2) {
2173 Constant *C = cast<Constant>(I.getOperand(1));
2174 for (unsigned i = 0; i != NumPHIValues; ++i) {
2176 if (Constant *InC = dyn_cast<Constant>(PN->getIncomingValue(i))) {
2177 if (CmpInst *CI = dyn_cast<CmpInst>(&I))
2178 InV = ConstantExpr::getCompare(CI->getPredicate(), InC, C);
2180 InV = ConstantExpr::get(I.getOpcode(), InC, C);
2182 assert(PN->getIncomingBlock(i) == NonConstBB);
2183 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(&I))
2184 InV = BinaryOperator::Create(BO->getOpcode(),
2185 PN->getIncomingValue(i), C, "phitmp",
2186 NonConstBB->getTerminator());
2187 else if (CmpInst *CI = dyn_cast<CmpInst>(&I))
2188 InV = CmpInst::Create(CI->getOpcode(),
2190 PN->getIncomingValue(i), C, "phitmp",
2191 NonConstBB->getTerminator());
2193 llvm_unreachable("Unknown binop!");
2195 Worklist.Add(cast<Instruction>(InV));
2197 NewPN->addIncoming(InV, PN->getIncomingBlock(i));
2200 CastInst *CI = cast<CastInst>(&I);
2201 const Type *RetTy = CI->getType();
2202 for (unsigned i = 0; i != NumPHIValues; ++i) {
2204 if (Constant *InC = dyn_cast<Constant>(PN->getIncomingValue(i))) {
2205 InV = ConstantExpr::getCast(CI->getOpcode(), InC, RetTy);
2207 assert(PN->getIncomingBlock(i) == NonConstBB);
2208 InV = CastInst::Create(CI->getOpcode(), PN->getIncomingValue(i),
2209 I.getType(), "phitmp",
2210 NonConstBB->getTerminator());
2211 Worklist.Add(cast<Instruction>(InV));
2213 NewPN->addIncoming(InV, PN->getIncomingBlock(i));
2216 return ReplaceInstUsesWith(I, NewPN);
2220 /// WillNotOverflowSignedAdd - Return true if we can prove that:
2221 /// (sext (add LHS, RHS)) === (add (sext LHS), (sext RHS))
2222 /// This basically requires proving that the add in the original type would not
2223 /// overflow to change the sign bit or have a carry out.
2224 bool InstCombiner::WillNotOverflowSignedAdd(Value *LHS, Value *RHS) {
2225 // There are different heuristics we can use for this. Here are some simple
2228 // Add has the property that adding any two 2's complement numbers can only
2229 // have one carry bit which can change a sign. As such, if LHS and RHS each
2230 // have at least two sign bits, we know that the addition of the two values
2231 // will sign extend fine.
2232 if (ComputeNumSignBits(LHS) > 1 && ComputeNumSignBits(RHS) > 1)
2236 // If one of the operands only has one non-zero bit, and if the other operand
2237 // has a known-zero bit in a more significant place than it (not including the
2238 // sign bit) the ripple may go up to and fill the zero, but won't change the
2239 // sign. For example, (X & ~4) + 1.
2247 Instruction *InstCombiner::visitAdd(BinaryOperator &I) {
2248 bool Changed = SimplifyCommutative(I);
2249 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1);
2251 if (Value *V = SimplifyAddInst(LHS, RHS, I.hasNoSignedWrap(),
2252 I.hasNoUnsignedWrap(), TD))
2253 return ReplaceInstUsesWith(I, V);
2256 if (Constant *RHSC = dyn_cast<Constant>(RHS)) {
2257 if (ConstantInt *CI = dyn_cast<ConstantInt>(RHSC)) {
2258 // X + (signbit) --> X ^ signbit
2259 const APInt& Val = CI->getValue();
2260 uint32_t BitWidth = Val.getBitWidth();
2261 if (Val == APInt::getSignBit(BitWidth))
2262 return BinaryOperator::CreateXor(LHS, RHS);
2264 // See if SimplifyDemandedBits can simplify this. This handles stuff like
2265 // (X & 254)+1 -> (X&254)|1
2266 if (SimplifyDemandedInstructionBits(I))
2269 // zext(bool) + C -> bool ? C + 1 : C
2270 if (ZExtInst *ZI = dyn_cast<ZExtInst>(LHS))
2271 if (ZI->getSrcTy() == Type::getInt1Ty(*Context))
2272 return SelectInst::Create(ZI->getOperand(0), AddOne(CI), CI);
2275 if (isa<PHINode>(LHS))
2276 if (Instruction *NV = FoldOpIntoPhi(I))
2279 ConstantInt *XorRHS = 0;
2281 if (isa<ConstantInt>(RHSC) &&
2282 match(LHS, m_Xor(m_Value(XorLHS), m_ConstantInt(XorRHS)))) {
2283 uint32_t TySizeBits = I.getType()->getScalarSizeInBits();
2284 const APInt& RHSVal = cast<ConstantInt>(RHSC)->getValue();
2286 uint32_t Size = TySizeBits / 2;
2287 APInt C0080Val(APInt(TySizeBits, 1ULL).shl(Size - 1));
2288 APInt CFF80Val(-C0080Val);
2290 if (TySizeBits > Size) {
2291 // If we have ADD(XOR(AND(X, 0xFF), 0x80), 0xF..F80), it's a sext.
2292 // If we have ADD(XOR(AND(X, 0xFF), 0xF..F80), 0x80), it's a sext.
2293 if ((RHSVal == CFF80Val && XorRHS->getValue() == C0080Val) ||
2294 (RHSVal == C0080Val && XorRHS->getValue() == CFF80Val)) {
2295 // This is a sign extend if the top bits are known zero.
2296 if (!MaskedValueIsZero(XorLHS,
2297 APInt::getHighBitsSet(TySizeBits, TySizeBits - Size)))
2298 Size = 0; // Not a sign ext, but can't be any others either.
2303 C0080Val = APIntOps::lshr(C0080Val, Size);
2304 CFF80Val = APIntOps::ashr(CFF80Val, Size);
2305 } while (Size >= 1);
2307 // FIXME: This shouldn't be necessary. When the backends can handle types
2308 // with funny bit widths then this switch statement should be removed. It
2309 // is just here to get the size of the "middle" type back up to something
2310 // that the back ends can handle.
2311 const Type *MiddleType = 0;
2314 case 32: MiddleType = Type::getInt32Ty(*Context); break;
2315 case 16: MiddleType = Type::getInt16Ty(*Context); break;
2316 case 8: MiddleType = Type::getInt8Ty(*Context); break;
2319 Value *NewTrunc = Builder->CreateTrunc(XorLHS, MiddleType, "sext");
2320 return new SExtInst(NewTrunc, I.getType(), I.getName());
2325 if (I.getType() == Type::getInt1Ty(*Context))
2326 return BinaryOperator::CreateXor(LHS, RHS);
2329 if (I.getType()->isInteger()) {
2330 if (Instruction *Result = AssociativeOpt(I, AddRHS(RHS)))
2333 if (Instruction *RHSI = dyn_cast<Instruction>(RHS)) {
2334 if (RHSI->getOpcode() == Instruction::Sub)
2335 if (LHS == RHSI->getOperand(1)) // A + (B - A) --> B
2336 return ReplaceInstUsesWith(I, RHSI->getOperand(0));
2338 if (Instruction *LHSI = dyn_cast<Instruction>(LHS)) {
2339 if (LHSI->getOpcode() == Instruction::Sub)
2340 if (RHS == LHSI->getOperand(1)) // (B - A) + A --> B
2341 return ReplaceInstUsesWith(I, LHSI->getOperand(0));
2346 // -A + -B --> -(A + B)
2347 if (Value *LHSV = dyn_castNegVal(LHS)) {
2348 if (LHS->getType()->isIntOrIntVector()) {
2349 if (Value *RHSV = dyn_castNegVal(RHS)) {
2350 Value *NewAdd = Builder->CreateAdd(LHSV, RHSV, "sum");
2351 return BinaryOperator::CreateNeg(NewAdd);
2355 return BinaryOperator::CreateSub(RHS, LHSV);
2359 if (!isa<Constant>(RHS))
2360 if (Value *V = dyn_castNegVal(RHS))
2361 return BinaryOperator::CreateSub(LHS, V);
2365 if (Value *X = dyn_castFoldableMul(LHS, C2)) {
2366 if (X == RHS) // X*C + X --> X * (C+1)
2367 return BinaryOperator::CreateMul(RHS, AddOne(C2));
2369 // X*C1 + X*C2 --> X * (C1+C2)
2371 if (X == dyn_castFoldableMul(RHS, C1))
2372 return BinaryOperator::CreateMul(X, ConstantExpr::getAdd(C1, C2));
2375 // X + X*C --> X * (C+1)
2376 if (dyn_castFoldableMul(RHS, C2) == LHS)
2377 return BinaryOperator::CreateMul(LHS, AddOne(C2));
2379 // X + ~X --> -1 since ~X = -X-1
2380 if (dyn_castNotVal(LHS) == RHS ||
2381 dyn_castNotVal(RHS) == LHS)
2382 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
2385 // (A & C1)+(B & C2) --> (A & C1)|(B & C2) iff C1&C2 == 0
2386 if (match(RHS, m_And(m_Value(), m_ConstantInt(C2))))
2387 if (Instruction *R = AssociativeOpt(I, AddMaskingAnd(C2)))
2390 // A+B --> A|B iff A and B have no bits set in common.
2391 if (const IntegerType *IT = dyn_cast<IntegerType>(I.getType())) {
2392 APInt Mask = APInt::getAllOnesValue(IT->getBitWidth());
2393 APInt LHSKnownOne(IT->getBitWidth(), 0);
2394 APInt LHSKnownZero(IT->getBitWidth(), 0);
2395 ComputeMaskedBits(LHS, Mask, LHSKnownZero, LHSKnownOne);
2396 if (LHSKnownZero != 0) {
2397 APInt RHSKnownOne(IT->getBitWidth(), 0);
2398 APInt RHSKnownZero(IT->getBitWidth(), 0);
2399 ComputeMaskedBits(RHS, Mask, RHSKnownZero, RHSKnownOne);
2401 // No bits in common -> bitwise or.
2402 if ((LHSKnownZero|RHSKnownZero).isAllOnesValue())
2403 return BinaryOperator::CreateOr(LHS, RHS);
2407 // W*X + Y*Z --> W * (X+Z) iff W == Y
2408 if (I.getType()->isIntOrIntVector()) {
2409 Value *W, *X, *Y, *Z;
2410 if (match(LHS, m_Mul(m_Value(W), m_Value(X))) &&
2411 match(RHS, m_Mul(m_Value(Y), m_Value(Z)))) {
2415 } else if (Y == X) {
2417 } else if (X == Z) {
2424 Value *NewAdd = Builder->CreateAdd(X, Z, LHS->getName());
2425 return BinaryOperator::CreateMul(W, NewAdd);
2430 if (ConstantInt *CRHS = dyn_cast<ConstantInt>(RHS)) {
2432 if (match(LHS, m_Not(m_Value(X)))) // ~X + C --> (C-1) - X
2433 return BinaryOperator::CreateSub(SubOne(CRHS), X);
2435 // (X & FF00) + xx00 -> (X+xx00) & FF00
2436 if (LHS->hasOneUse() &&
2437 match(LHS, m_And(m_Value(X), m_ConstantInt(C2)))) {
2438 Constant *Anded = ConstantExpr::getAnd(CRHS, C2);
2439 if (Anded == CRHS) {
2440 // See if all bits from the first bit set in the Add RHS up are included
2441 // in the mask. First, get the rightmost bit.
2442 const APInt& AddRHSV = CRHS->getValue();
2444 // Form a mask of all bits from the lowest bit added through the top.
2445 APInt AddRHSHighBits(~((AddRHSV & -AddRHSV)-1));
2447 // See if the and mask includes all of these bits.
2448 APInt AddRHSHighBitsAnd(AddRHSHighBits & C2->getValue());
2450 if (AddRHSHighBits == AddRHSHighBitsAnd) {
2451 // Okay, the xform is safe. Insert the new add pronto.
2452 Value *NewAdd = Builder->CreateAdd(X, CRHS, LHS->getName());
2453 return BinaryOperator::CreateAnd(NewAdd, C2);
2458 // Try to fold constant add into select arguments.
2459 if (SelectInst *SI = dyn_cast<SelectInst>(LHS))
2460 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2464 // add (select X 0 (sub n A)) A --> select X A n
2466 SelectInst *SI = dyn_cast<SelectInst>(LHS);
2469 SI = dyn_cast<SelectInst>(RHS);
2472 if (SI && SI->hasOneUse()) {
2473 Value *TV = SI->getTrueValue();
2474 Value *FV = SI->getFalseValue();
2477 // Can we fold the add into the argument of the select?
2478 // We check both true and false select arguments for a matching subtract.
2479 if (match(FV, m_Zero()) &&
2480 match(TV, m_Sub(m_Value(N), m_Specific(A))))
2481 // Fold the add into the true select value.
2482 return SelectInst::Create(SI->getCondition(), N, A);
2483 if (match(TV, m_Zero()) &&
2484 match(FV, m_Sub(m_Value(N), m_Specific(A))))
2485 // Fold the add into the false select value.
2486 return SelectInst::Create(SI->getCondition(), A, N);
2490 // Check for (add (sext x), y), see if we can merge this into an
2491 // integer add followed by a sext.
2492 if (SExtInst *LHSConv = dyn_cast<SExtInst>(LHS)) {
2493 // (add (sext x), cst) --> (sext (add x, cst'))
2494 if (ConstantInt *RHSC = dyn_cast<ConstantInt>(RHS)) {
2496 ConstantExpr::getTrunc(RHSC, LHSConv->getOperand(0)->getType());
2497 if (LHSConv->hasOneUse() &&
2498 ConstantExpr::getSExt(CI, I.getType()) == RHSC &&
2499 WillNotOverflowSignedAdd(LHSConv->getOperand(0), CI)) {
2500 // Insert the new, smaller add.
2501 Value *NewAdd = Builder->CreateNSWAdd(LHSConv->getOperand(0),
2503 return new SExtInst(NewAdd, I.getType());
2507 // (add (sext x), (sext y)) --> (sext (add int x, y))
2508 if (SExtInst *RHSConv = dyn_cast<SExtInst>(RHS)) {
2509 // Only do this if x/y have the same type, if at last one of them has a
2510 // single use (so we don't increase the number of sexts), and if the
2511 // integer add will not overflow.
2512 if (LHSConv->getOperand(0)->getType()==RHSConv->getOperand(0)->getType()&&
2513 (LHSConv->hasOneUse() || RHSConv->hasOneUse()) &&
2514 WillNotOverflowSignedAdd(LHSConv->getOperand(0),
2515 RHSConv->getOperand(0))) {
2516 // Insert the new integer add.
2517 Value *NewAdd = Builder->CreateNSWAdd(LHSConv->getOperand(0),
2518 RHSConv->getOperand(0), "addconv");
2519 return new SExtInst(NewAdd, I.getType());
2524 return Changed ? &I : 0;
2527 Instruction *InstCombiner::visitFAdd(BinaryOperator &I) {
2528 bool Changed = SimplifyCommutative(I);
2529 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1);
2531 if (Constant *RHSC = dyn_cast<Constant>(RHS)) {
2533 if (ConstantFP *CFP = dyn_cast<ConstantFP>(RHSC)) {
2534 if (CFP->isExactlyValue(ConstantFP::getNegativeZero
2535 (I.getType())->getValueAPF()))
2536 return ReplaceInstUsesWith(I, LHS);
2539 if (isa<PHINode>(LHS))
2540 if (Instruction *NV = FoldOpIntoPhi(I))
2545 // -A + -B --> -(A + B)
2546 if (Value *LHSV = dyn_castFNegVal(LHS))
2547 return BinaryOperator::CreateFSub(RHS, LHSV);
2550 if (!isa<Constant>(RHS))
2551 if (Value *V = dyn_castFNegVal(RHS))
2552 return BinaryOperator::CreateFSub(LHS, V);
2554 // Check for X+0.0. Simplify it to X if we know X is not -0.0.
2555 if (ConstantFP *CFP = dyn_cast<ConstantFP>(RHS))
2556 if (CFP->getValueAPF().isPosZero() && CannotBeNegativeZero(LHS))
2557 return ReplaceInstUsesWith(I, LHS);
2559 // Check for (add double (sitofp x), y), see if we can merge this into an
2560 // integer add followed by a promotion.
2561 if (SIToFPInst *LHSConv = dyn_cast<SIToFPInst>(LHS)) {
2562 // (add double (sitofp x), fpcst) --> (sitofp (add int x, intcst))
2563 // ... if the constant fits in the integer value. This is useful for things
2564 // like (double)(x & 1234) + 4.0 -> (double)((X & 1234)+4) which no longer
2565 // requires a constant pool load, and generally allows the add to be better
2567 if (ConstantFP *CFP = dyn_cast<ConstantFP>(RHS)) {
2569 ConstantExpr::getFPToSI(CFP, LHSConv->getOperand(0)->getType());
2570 if (LHSConv->hasOneUse() &&
2571 ConstantExpr::getSIToFP(CI, I.getType()) == CFP &&
2572 WillNotOverflowSignedAdd(LHSConv->getOperand(0), CI)) {
2573 // Insert the new integer add.
2574 Value *NewAdd = Builder->CreateNSWAdd(LHSConv->getOperand(0),
2576 return new SIToFPInst(NewAdd, I.getType());
2580 // (add double (sitofp x), (sitofp y)) --> (sitofp (add int x, y))
2581 if (SIToFPInst *RHSConv = dyn_cast<SIToFPInst>(RHS)) {
2582 // Only do this if x/y have the same type, if at last one of them has a
2583 // single use (so we don't increase the number of int->fp conversions),
2584 // and if the integer add will not overflow.
2585 if (LHSConv->getOperand(0)->getType()==RHSConv->getOperand(0)->getType()&&
2586 (LHSConv->hasOneUse() || RHSConv->hasOneUse()) &&
2587 WillNotOverflowSignedAdd(LHSConv->getOperand(0),
2588 RHSConv->getOperand(0))) {
2589 // Insert the new integer add.
2590 Value *NewAdd = Builder->CreateNSWAdd(LHSConv->getOperand(0),
2591 RHSConv->getOperand(0),"addconv");
2592 return new SIToFPInst(NewAdd, I.getType());
2597 return Changed ? &I : 0;
2601 /// EmitGEPOffset - Given a getelementptr instruction/constantexpr, emit the
2602 /// code necessary to compute the offset from the base pointer (without adding
2603 /// in the base pointer). Return the result as a signed integer of intptr size.
2604 static Value *EmitGEPOffset(User *GEP, InstCombiner &IC) {
2605 TargetData &TD = *IC.getTargetData();
2606 gep_type_iterator GTI = gep_type_begin(GEP);
2607 const Type *IntPtrTy = TD.getIntPtrType(GEP->getContext());
2608 Value *Result = Constant::getNullValue(IntPtrTy);
2610 // Build a mask for high order bits.
2611 unsigned IntPtrWidth = TD.getPointerSizeInBits();
2612 uint64_t PtrSizeMask = ~0ULL >> (64-IntPtrWidth);
2614 for (User::op_iterator i = GEP->op_begin() + 1, e = GEP->op_end(); i != e;
2617 uint64_t Size = TD.getTypeAllocSize(GTI.getIndexedType()) & PtrSizeMask;
2618 if (ConstantInt *OpC = dyn_cast<ConstantInt>(Op)) {
2619 if (OpC->isZero()) continue;
2621 // Handle a struct index, which adds its field offset to the pointer.
2622 if (const StructType *STy = dyn_cast<StructType>(*GTI)) {
2623 Size = TD.getStructLayout(STy)->getElementOffset(OpC->getZExtValue());
2625 Result = IC.Builder->CreateAdd(Result,
2626 ConstantInt::get(IntPtrTy, Size),
2627 GEP->getName()+".offs");
2631 Constant *Scale = ConstantInt::get(IntPtrTy, Size);
2633 ConstantExpr::getIntegerCast(OpC, IntPtrTy, true /*SExt*/);
2634 Scale = ConstantExpr::getMul(OC, Scale);
2635 // Emit an add instruction.
2636 Result = IC.Builder->CreateAdd(Result, Scale, GEP->getName()+".offs");
2639 // Convert to correct type.
2640 if (Op->getType() != IntPtrTy)
2641 Op = IC.Builder->CreateIntCast(Op, IntPtrTy, true, Op->getName()+".c");
2643 Constant *Scale = ConstantInt::get(IntPtrTy, Size);
2644 // We'll let instcombine(mul) convert this to a shl if possible.
2645 Op = IC.Builder->CreateMul(Op, Scale, GEP->getName()+".idx");
2648 // Emit an add instruction.
2649 Result = IC.Builder->CreateAdd(Op, Result, GEP->getName()+".offs");
2655 /// EvaluateGEPOffsetExpression - Return a value that can be used to compare
2656 /// the *offset* implied by a GEP to zero. For example, if we have &A[i], we
2657 /// want to return 'i' for "icmp ne i, 0". Note that, in general, indices can
2658 /// be complex, and scales are involved. The above expression would also be
2659 /// legal to codegen as "icmp ne (i*4), 0" (assuming A is a pointer to i32).
2660 /// This later form is less amenable to optimization though, and we are allowed
2661 /// to generate the first by knowing that pointer arithmetic doesn't overflow.
2663 /// If we can't emit an optimized form for this expression, this returns null.
2665 static Value *EvaluateGEPOffsetExpression(User *GEP, Instruction &I,
2667 TargetData &TD = *IC.getTargetData();
2668 gep_type_iterator GTI = gep_type_begin(GEP);
2670 // Check to see if this gep only has a single variable index. If so, and if
2671 // any constant indices are a multiple of its scale, then we can compute this
2672 // in terms of the scale of the variable index. For example, if the GEP
2673 // implies an offset of "12 + i*4", then we can codegen this as "3 + i",
2674 // because the expression will cross zero at the same point.
2675 unsigned i, e = GEP->getNumOperands();
2677 for (i = 1; i != e; ++i, ++GTI) {
2678 if (ConstantInt *CI = dyn_cast<ConstantInt>(GEP->getOperand(i))) {
2679 // Compute the aggregate offset of constant indices.
2680 if (CI->isZero()) continue;
2682 // Handle a struct index, which adds its field offset to the pointer.
2683 if (const StructType *STy = dyn_cast<StructType>(*GTI)) {
2684 Offset += TD.getStructLayout(STy)->getElementOffset(CI->getZExtValue());
2686 uint64_t Size = TD.getTypeAllocSize(GTI.getIndexedType());
2687 Offset += Size*CI->getSExtValue();
2690 // Found our variable index.
2695 // If there are no variable indices, we must have a constant offset, just
2696 // evaluate it the general way.
2697 if (i == e) return 0;
2699 Value *VariableIdx = GEP->getOperand(i);
2700 // Determine the scale factor of the variable element. For example, this is
2701 // 4 if the variable index is into an array of i32.
2702 uint64_t VariableScale = TD.getTypeAllocSize(GTI.getIndexedType());
2704 // Verify that there are no other variable indices. If so, emit the hard way.
2705 for (++i, ++GTI; i != e; ++i, ++GTI) {
2706 ConstantInt *CI = dyn_cast<ConstantInt>(GEP->getOperand(i));
2709 // Compute the aggregate offset of constant indices.
2710 if (CI->isZero()) continue;
2712 // Handle a struct index, which adds its field offset to the pointer.
2713 if (const StructType *STy = dyn_cast<StructType>(*GTI)) {
2714 Offset += TD.getStructLayout(STy)->getElementOffset(CI->getZExtValue());
2716 uint64_t Size = TD.getTypeAllocSize(GTI.getIndexedType());
2717 Offset += Size*CI->getSExtValue();
2721 // Okay, we know we have a single variable index, which must be a
2722 // pointer/array/vector index. If there is no offset, life is simple, return
2724 unsigned IntPtrWidth = TD.getPointerSizeInBits();
2726 // Cast to intptrty in case a truncation occurs. If an extension is needed,
2727 // we don't need to bother extending: the extension won't affect where the
2728 // computation crosses zero.
2729 if (VariableIdx->getType()->getPrimitiveSizeInBits() > IntPtrWidth)
2730 VariableIdx = new TruncInst(VariableIdx,
2731 TD.getIntPtrType(VariableIdx->getContext()),
2732 VariableIdx->getName(), &I);
2736 // Otherwise, there is an index. The computation we will do will be modulo
2737 // the pointer size, so get it.
2738 uint64_t PtrSizeMask = ~0ULL >> (64-IntPtrWidth);
2740 Offset &= PtrSizeMask;
2741 VariableScale &= PtrSizeMask;
2743 // To do this transformation, any constant index must be a multiple of the
2744 // variable scale factor. For example, we can evaluate "12 + 4*i" as "3 + i",
2745 // but we can't evaluate "10 + 3*i" in terms of i. Check that the offset is a
2746 // multiple of the variable scale.
2747 int64_t NewOffs = Offset / (int64_t)VariableScale;
2748 if (Offset != NewOffs*(int64_t)VariableScale)
2751 // Okay, we can do this evaluation. Start by converting the index to intptr.
2752 const Type *IntPtrTy = TD.getIntPtrType(VariableIdx->getContext());
2753 if (VariableIdx->getType() != IntPtrTy)
2754 VariableIdx = CastInst::CreateIntegerCast(VariableIdx, IntPtrTy,
2756 VariableIdx->getName(), &I);
2757 Constant *OffsetVal = ConstantInt::get(IntPtrTy, NewOffs);
2758 return BinaryOperator::CreateAdd(VariableIdx, OffsetVal, "offset", &I);
2762 /// Optimize pointer differences into the same array into a size. Consider:
2763 /// &A[10] - &A[0]: we should compile this to "10". LHS/RHS are the pointer
2764 /// operands to the ptrtoint instructions for the LHS/RHS of the subtract.
2766 Value *InstCombiner::OptimizePointerDifference(Value *LHS, Value *RHS,
2768 assert(TD && "Must have target data info for this");
2770 // If LHS is a gep based on RHS or RHS is a gep based on LHS, we can optimize
2773 GetElementPtrInst *GEP = 0;
2774 ConstantExpr *CstGEP = 0;
2776 // TODO: Could also optimize &A[i] - &A[j] -> "i-j", and "&A.foo[i] - &A.foo".
2777 // For now we require one side to be the base pointer "A" or a constant
2778 // expression derived from it.
2779 if (GetElementPtrInst *LHSGEP = dyn_cast<GetElementPtrInst>(LHS)) {
2781 if (LHSGEP->getOperand(0) == RHS) {
2784 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(RHS)) {
2785 // (gep X, ...) - (ce_gep X, ...)
2786 if (CE->getOpcode() == Instruction::GetElementPtr &&
2787 LHSGEP->getOperand(0) == CE->getOperand(0)) {
2795 if (GetElementPtrInst *RHSGEP = dyn_cast<GetElementPtrInst>(RHS)) {
2797 if (RHSGEP->getOperand(0) == LHS) {
2800 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(LHS)) {
2801 // (ce_gep X, ...) - (gep X, ...)
2802 if (CE->getOpcode() == Instruction::GetElementPtr &&
2803 RHSGEP->getOperand(0) == CE->getOperand(0)) {
2814 // Emit the offset of the GEP and an intptr_t.
2815 Value *Result = EmitGEPOffset(GEP, *this);
2817 // If we had a constant expression GEP on the other side offsetting the
2818 // pointer, subtract it from the offset we have.
2820 Value *CstOffset = EmitGEPOffset(CstGEP, *this);
2821 Result = Builder->CreateSub(Result, CstOffset);
2825 // If we have p - gep(p, ...) then we have to negate the result.
2827 Result = Builder->CreateNeg(Result, "diff.neg");
2829 return Builder->CreateIntCast(Result, Ty, true);
2833 Instruction *InstCombiner::visitSub(BinaryOperator &I) {
2834 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2836 if (Op0 == Op1) // sub X, X -> 0
2837 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
2839 // If this is a 'B = x-(-A)', change to B = x+A. This preserves NSW/NUW.
2840 if (Value *V = dyn_castNegVal(Op1)) {
2841 BinaryOperator *Res = BinaryOperator::CreateAdd(Op0, V);
2842 Res->setHasNoSignedWrap(I.hasNoSignedWrap());
2843 Res->setHasNoUnsignedWrap(I.hasNoUnsignedWrap());
2847 if (isa<UndefValue>(Op0))
2848 return ReplaceInstUsesWith(I, Op0); // undef - X -> undef
2849 if (isa<UndefValue>(Op1))
2850 return ReplaceInstUsesWith(I, Op1); // X - undef -> undef
2851 if (I.getType() == Type::getInt1Ty(*Context))
2852 return BinaryOperator::CreateXor(Op0, Op1);
2854 if (ConstantInt *C = dyn_cast<ConstantInt>(Op0)) {
2855 // Replace (-1 - A) with (~A).
2856 if (C->isAllOnesValue())
2857 return BinaryOperator::CreateNot(Op1);
2859 // C - ~X == X + (1+C)
2861 if (match(Op1, m_Not(m_Value(X))))
2862 return BinaryOperator::CreateAdd(X, AddOne(C));
2864 // -(X >>u 31) -> (X >>s 31)
2865 // -(X >>s 31) -> (X >>u 31)
2867 if (BinaryOperator *SI = dyn_cast<BinaryOperator>(Op1)) {
2868 if (SI->getOpcode() == Instruction::LShr) {
2869 if (ConstantInt *CU = dyn_cast<ConstantInt>(SI->getOperand(1))) {
2870 // Check to see if we are shifting out everything but the sign bit.
2871 if (CU->getLimitedValue(SI->getType()->getPrimitiveSizeInBits()) ==
2872 SI->getType()->getPrimitiveSizeInBits()-1) {
2873 // Ok, the transformation is safe. Insert AShr.
2874 return BinaryOperator::Create(Instruction::AShr,
2875 SI->getOperand(0), CU, SI->getName());
2878 } else if (SI->getOpcode() == Instruction::AShr) {
2879 if (ConstantInt *CU = dyn_cast<ConstantInt>(SI->getOperand(1))) {
2880 // Check to see if we are shifting out everything but the sign bit.
2881 if (CU->getLimitedValue(SI->getType()->getPrimitiveSizeInBits()) ==
2882 SI->getType()->getPrimitiveSizeInBits()-1) {
2883 // Ok, the transformation is safe. Insert LShr.
2884 return BinaryOperator::CreateLShr(
2885 SI->getOperand(0), CU, SI->getName());
2892 // Try to fold constant sub into select arguments.
2893 if (SelectInst *SI = dyn_cast<SelectInst>(Op1))
2894 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
2897 // C - zext(bool) -> bool ? C - 1 : C
2898 if (ZExtInst *ZI = dyn_cast<ZExtInst>(Op1))
2899 if (ZI->getSrcTy() == Type::getInt1Ty(*Context))
2900 return SelectInst::Create(ZI->getOperand(0), SubOne(C), C);
2903 if (BinaryOperator *Op1I = dyn_cast<BinaryOperator>(Op1)) {
2904 if (Op1I->getOpcode() == Instruction::Add) {
2905 if (Op1I->getOperand(0) == Op0) // X-(X+Y) == -Y
2906 return BinaryOperator::CreateNeg(Op1I->getOperand(1),
2908 else if (Op1I->getOperand(1) == Op0) // X-(Y+X) == -Y
2909 return BinaryOperator::CreateNeg(Op1I->getOperand(0),
2911 else if (ConstantInt *CI1 = dyn_cast<ConstantInt>(I.getOperand(0))) {
2912 if (ConstantInt *CI2 = dyn_cast<ConstantInt>(Op1I->getOperand(1)))
2913 // C1-(X+C2) --> (C1-C2)-X
2914 return BinaryOperator::CreateSub(
2915 ConstantExpr::getSub(CI1, CI2), Op1I->getOperand(0));
2919 if (Op1I->hasOneUse()) {
2920 // Replace (x - (y - z)) with (x + (z - y)) if the (y - z) subexpression
2921 // is not used by anyone else...
2923 if (Op1I->getOpcode() == Instruction::Sub) {
2924 // Swap the two operands of the subexpr...
2925 Value *IIOp0 = Op1I->getOperand(0), *IIOp1 = Op1I->getOperand(1);
2926 Op1I->setOperand(0, IIOp1);
2927 Op1I->setOperand(1, IIOp0);
2929 // Create the new top level add instruction...
2930 return BinaryOperator::CreateAdd(Op0, Op1);
2933 // Replace (A - (A & B)) with (A & ~B) if this is the only use of (A&B)...
2935 if (Op1I->getOpcode() == Instruction::And &&
2936 (Op1I->getOperand(0) == Op0 || Op1I->getOperand(1) == Op0)) {
2937 Value *OtherOp = Op1I->getOperand(Op1I->getOperand(0) == Op0);
2939 Value *NewNot = Builder->CreateNot(OtherOp, "B.not");
2940 return BinaryOperator::CreateAnd(Op0, NewNot);
2943 // 0 - (X sdiv C) -> (X sdiv -C)
2944 if (Op1I->getOpcode() == Instruction::SDiv)
2945 if (ConstantInt *CSI = dyn_cast<ConstantInt>(Op0))
2947 if (Constant *DivRHS = dyn_cast<Constant>(Op1I->getOperand(1)))
2948 return BinaryOperator::CreateSDiv(Op1I->getOperand(0),
2949 ConstantExpr::getNeg(DivRHS));
2951 // X - X*C --> X * (1-C)
2952 ConstantInt *C2 = 0;
2953 if (dyn_castFoldableMul(Op1I, C2) == Op0) {
2955 ConstantExpr::getSub(ConstantInt::get(I.getType(), 1),
2957 return BinaryOperator::CreateMul(Op0, CP1);
2962 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0)) {
2963 if (Op0I->getOpcode() == Instruction::Add) {
2964 if (Op0I->getOperand(0) == Op1) // (Y+X)-Y == X
2965 return ReplaceInstUsesWith(I, Op0I->getOperand(1));
2966 else if (Op0I->getOperand(1) == Op1) // (X+Y)-Y == X
2967 return ReplaceInstUsesWith(I, Op0I->getOperand(0));
2968 } else if (Op0I->getOpcode() == Instruction::Sub) {
2969 if (Op0I->getOperand(0) == Op1) // (X-Y)-X == -Y
2970 return BinaryOperator::CreateNeg(Op0I->getOperand(1),
2976 if (Value *X = dyn_castFoldableMul(Op0, C1)) {
2977 if (X == Op1) // X*C - X --> X * (C-1)
2978 return BinaryOperator::CreateMul(Op1, SubOne(C1));
2980 ConstantInt *C2; // X*C1 - X*C2 -> X * (C1-C2)
2981 if (X == dyn_castFoldableMul(Op1, C2))
2982 return BinaryOperator::CreateMul(X, ConstantExpr::getSub(C1, C2));
2985 // Optimize pointer differences into the same array into a size. Consider:
2986 // &A[10] - &A[0]: we should compile this to "10".
2988 Value *LHSOp, *RHSOp;
2989 if (match(Op0, m_PtrToInt(m_Value(LHSOp))) &&
2990 match(Op1, m_PtrToInt(m_Value(RHSOp))))
2991 if (Value *Res = OptimizePointerDifference(LHSOp, RHSOp, I.getType()))
2992 return ReplaceInstUsesWith(I, Res);
2994 // trunc(p)-trunc(q) -> trunc(p-q)
2995 if (match(Op0, m_Trunc(m_PtrToInt(m_Value(LHSOp)))) &&
2996 match(Op1, m_Trunc(m_PtrToInt(m_Value(RHSOp)))))
2997 if (Value *Res = OptimizePointerDifference(LHSOp, RHSOp, I.getType()))
2998 return ReplaceInstUsesWith(I, Res);
3004 Instruction *InstCombiner::visitFSub(BinaryOperator &I) {
3005 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3007 // If this is a 'B = x-(-A)', change to B = x+A...
3008 if (Value *V = dyn_castFNegVal(Op1))
3009 return BinaryOperator::CreateFAdd(Op0, V);
3011 if (BinaryOperator *Op1I = dyn_cast<BinaryOperator>(Op1)) {
3012 if (Op1I->getOpcode() == Instruction::FAdd) {
3013 if (Op1I->getOperand(0) == Op0) // X-(X+Y) == -Y
3014 return BinaryOperator::CreateFNeg(Op1I->getOperand(1),
3016 else if (Op1I->getOperand(1) == Op0) // X-(Y+X) == -Y
3017 return BinaryOperator::CreateFNeg(Op1I->getOperand(0),
3025 /// isSignBitCheck - Given an exploded icmp instruction, return true if the
3026 /// comparison only checks the sign bit. If it only checks the sign bit, set
3027 /// TrueIfSigned if the result of the comparison is true when the input value is
3029 static bool isSignBitCheck(ICmpInst::Predicate pred, ConstantInt *RHS,
3030 bool &TrueIfSigned) {
3032 case ICmpInst::ICMP_SLT: // True if LHS s< 0
3033 TrueIfSigned = true;
3034 return RHS->isZero();
3035 case ICmpInst::ICMP_SLE: // True if LHS s<= RHS and RHS == -1
3036 TrueIfSigned = true;
3037 return RHS->isAllOnesValue();
3038 case ICmpInst::ICMP_SGT: // True if LHS s> -1
3039 TrueIfSigned = false;
3040 return RHS->isAllOnesValue();
3041 case ICmpInst::ICMP_UGT:
3042 // True if LHS u> RHS and RHS == high-bit-mask - 1
3043 TrueIfSigned = true;
3044 return RHS->getValue() ==
3045 APInt::getSignedMaxValue(RHS->getType()->getPrimitiveSizeInBits());
3046 case ICmpInst::ICMP_UGE:
3047 // True if LHS u>= RHS and RHS == high-bit-mask (2^7, 2^15, 2^31, etc)
3048 TrueIfSigned = true;
3049 return RHS->getValue().isSignBit();
3055 Instruction *InstCombiner::visitMul(BinaryOperator &I) {
3056 bool Changed = SimplifyCommutative(I);
3057 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3059 if (isa<UndefValue>(Op1)) // undef * X -> 0
3060 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
3062 // Simplify mul instructions with a constant RHS.
3063 if (Constant *Op1C = dyn_cast<Constant>(Op1)) {
3064 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1C)) {
3066 // ((X << C1)*C2) == (X * (C2 << C1))
3067 if (BinaryOperator *SI = dyn_cast<BinaryOperator>(Op0))
3068 if (SI->getOpcode() == Instruction::Shl)
3069 if (Constant *ShOp = dyn_cast<Constant>(SI->getOperand(1)))
3070 return BinaryOperator::CreateMul(SI->getOperand(0),
3071 ConstantExpr::getShl(CI, ShOp));
3074 return ReplaceInstUsesWith(I, Op1C); // X * 0 == 0
3075 if (CI->equalsInt(1)) // X * 1 == X
3076 return ReplaceInstUsesWith(I, Op0);
3077 if (CI->isAllOnesValue()) // X * -1 == 0 - X
3078 return BinaryOperator::CreateNeg(Op0, I.getName());
3080 const APInt& Val = cast<ConstantInt>(CI)->getValue();
3081 if (Val.isPowerOf2()) { // Replace X*(2^C) with X << C
3082 return BinaryOperator::CreateShl(Op0,
3083 ConstantInt::get(Op0->getType(), Val.logBase2()));
3085 } else if (isa<VectorType>(Op1C->getType())) {
3086 if (Op1C->isNullValue())
3087 return ReplaceInstUsesWith(I, Op1C);
3089 if (ConstantVector *Op1V = dyn_cast<ConstantVector>(Op1C)) {
3090 if (Op1V->isAllOnesValue()) // X * -1 == 0 - X
3091 return BinaryOperator::CreateNeg(Op0, I.getName());
3093 // As above, vector X*splat(1.0) -> X in all defined cases.
3094 if (Constant *Splat = Op1V->getSplatValue()) {
3095 if (ConstantInt *CI = dyn_cast<ConstantInt>(Splat))
3096 if (CI->equalsInt(1))
3097 return ReplaceInstUsesWith(I, Op0);
3102 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0))
3103 if (Op0I->getOpcode() == Instruction::Add && Op0I->hasOneUse() &&
3104 isa<ConstantInt>(Op0I->getOperand(1)) && isa<ConstantInt>(Op1C)) {
3105 // Canonicalize (X+C1)*C2 -> X*C2+C1*C2.
3106 Value *Add = Builder->CreateMul(Op0I->getOperand(0), Op1C, "tmp");
3107 Value *C1C2 = Builder->CreateMul(Op1C, Op0I->getOperand(1));
3108 return BinaryOperator::CreateAdd(Add, C1C2);
3112 // Try to fold constant mul into select arguments.
3113 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
3114 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
3117 if (isa<PHINode>(Op0))
3118 if (Instruction *NV = FoldOpIntoPhi(I))
3122 if (Value *Op0v = dyn_castNegVal(Op0)) // -X * -Y = X*Y
3123 if (Value *Op1v = dyn_castNegVal(Op1))
3124 return BinaryOperator::CreateMul(Op0v, Op1v);
3126 // (X / Y) * Y = X - (X % Y)
3127 // (X / Y) * -Y = (X % Y) - X
3130 BinaryOperator *BO = dyn_cast<BinaryOperator>(Op0);
3132 (BO->getOpcode() != Instruction::UDiv &&
3133 BO->getOpcode() != Instruction::SDiv)) {
3135 BO = dyn_cast<BinaryOperator>(Op1);
3137 Value *Neg = dyn_castNegVal(Op1C);
3138 if (BO && BO->hasOneUse() &&
3139 (BO->getOperand(1) == Op1C || BO->getOperand(1) == Neg) &&
3140 (BO->getOpcode() == Instruction::UDiv ||
3141 BO->getOpcode() == Instruction::SDiv)) {
3142 Value *Op0BO = BO->getOperand(0), *Op1BO = BO->getOperand(1);
3144 // If the division is exact, X % Y is zero.
3145 if (SDivOperator *SDiv = dyn_cast<SDivOperator>(BO))
3146 if (SDiv->isExact()) {
3148 return ReplaceInstUsesWith(I, Op0BO);
3149 return BinaryOperator::CreateNeg(Op0BO);
3153 if (BO->getOpcode() == Instruction::UDiv)
3154 Rem = Builder->CreateURem(Op0BO, Op1BO);
3156 Rem = Builder->CreateSRem(Op0BO, Op1BO);
3160 return BinaryOperator::CreateSub(Op0BO, Rem);
3161 return BinaryOperator::CreateSub(Rem, Op0BO);
3165 /// i1 mul -> i1 and.
3166 if (I.getType() == Type::getInt1Ty(*Context))
3167 return BinaryOperator::CreateAnd(Op0, Op1);
3169 // X*(1 << Y) --> X << Y
3170 // (1 << Y)*X --> X << Y
3173 if (match(Op0, m_Shl(m_One(), m_Value(Y))))
3174 return BinaryOperator::CreateShl(Op1, Y);
3175 if (match(Op1, m_Shl(m_One(), m_Value(Y))))
3176 return BinaryOperator::CreateShl(Op0, Y);
3179 // If one of the operands of the multiply is a cast from a boolean value, then
3180 // we know the bool is either zero or one, so this is a 'masking' multiply.
3181 // X * Y (where Y is 0 or 1) -> X & (0-Y)
3182 if (!isa<VectorType>(I.getType())) {
3183 // -2 is "-1 << 1" so it is all bits set except the low one.
3184 APInt Negative2(I.getType()->getPrimitiveSizeInBits(), (uint64_t)-2, true);
3186 Value *BoolCast = 0, *OtherOp = 0;
3187 if (MaskedValueIsZero(Op0, Negative2))
3188 BoolCast = Op0, OtherOp = Op1;
3189 else if (MaskedValueIsZero(Op1, Negative2))
3190 BoolCast = Op1, OtherOp = Op0;
3193 Value *V = Builder->CreateSub(Constant::getNullValue(I.getType()),
3195 return BinaryOperator::CreateAnd(V, OtherOp);
3199 return Changed ? &I : 0;
3202 Instruction *InstCombiner::visitFMul(BinaryOperator &I) {
3203 bool Changed = SimplifyCommutative(I);
3204 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3206 // Simplify mul instructions with a constant RHS...
3207 if (Constant *Op1C = dyn_cast<Constant>(Op1)) {
3208 if (ConstantFP *Op1F = dyn_cast<ConstantFP>(Op1C)) {
3209 // "In IEEE floating point, x*1 is not equivalent to x for nans. However,
3210 // ANSI says we can drop signals, so we can do this anyway." (from GCC)
3211 if (Op1F->isExactlyValue(1.0))
3212 return ReplaceInstUsesWith(I, Op0); // Eliminate 'mul double %X, 1.0'
3213 } else if (isa<VectorType>(Op1C->getType())) {
3214 if (ConstantVector *Op1V = dyn_cast<ConstantVector>(Op1C)) {
3215 // As above, vector X*splat(1.0) -> X in all defined cases.
3216 if (Constant *Splat = Op1V->getSplatValue()) {
3217 if (ConstantFP *F = dyn_cast<ConstantFP>(Splat))
3218 if (F->isExactlyValue(1.0))
3219 return ReplaceInstUsesWith(I, Op0);
3224 // Try to fold constant mul into select arguments.
3225 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
3226 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
3229 if (isa<PHINode>(Op0))
3230 if (Instruction *NV = FoldOpIntoPhi(I))
3234 if (Value *Op0v = dyn_castFNegVal(Op0)) // -X * -Y = X*Y
3235 if (Value *Op1v = dyn_castFNegVal(Op1))
3236 return BinaryOperator::CreateFMul(Op0v, Op1v);
3238 return Changed ? &I : 0;
3241 /// SimplifyDivRemOfSelect - Try to fold a divide or remainder of a select
3243 bool InstCombiner::SimplifyDivRemOfSelect(BinaryOperator &I) {
3244 SelectInst *SI = cast<SelectInst>(I.getOperand(1));
3246 // div/rem X, (Cond ? 0 : Y) -> div/rem X, Y
3247 int NonNullOperand = -1;
3248 if (Constant *ST = dyn_cast<Constant>(SI->getOperand(1)))
3249 if (ST->isNullValue())
3251 // div/rem X, (Cond ? Y : 0) -> div/rem X, Y
3252 if (Constant *ST = dyn_cast<Constant>(SI->getOperand(2)))
3253 if (ST->isNullValue())
3256 if (NonNullOperand == -1)
3259 Value *SelectCond = SI->getOperand(0);
3261 // Change the div/rem to use 'Y' instead of the select.
3262 I.setOperand(1, SI->getOperand(NonNullOperand));
3264 // Okay, we know we replace the operand of the div/rem with 'Y' with no
3265 // problem. However, the select, or the condition of the select may have
3266 // multiple uses. Based on our knowledge that the operand must be non-zero,
3267 // propagate the known value for the select into other uses of it, and
3268 // propagate a known value of the condition into its other users.
3270 // If the select and condition only have a single use, don't bother with this,
3272 if (SI->use_empty() && SelectCond->hasOneUse())
3275 // Scan the current block backward, looking for other uses of SI.
3276 BasicBlock::iterator BBI = &I, BBFront = I.getParent()->begin();
3278 while (BBI != BBFront) {
3280 // If we found a call to a function, we can't assume it will return, so
3281 // information from below it cannot be propagated above it.
3282 if (isa<CallInst>(BBI) && !isa<IntrinsicInst>(BBI))
3285 // Replace uses of the select or its condition with the known values.
3286 for (Instruction::op_iterator I = BBI->op_begin(), E = BBI->op_end();
3289 *I = SI->getOperand(NonNullOperand);
3291 } else if (*I == SelectCond) {
3292 *I = NonNullOperand == 1 ? ConstantInt::getTrue(*Context) :
3293 ConstantInt::getFalse(*Context);
3298 // If we past the instruction, quit looking for it.
3301 if (&*BBI == SelectCond)
3304 // If we ran out of things to eliminate, break out of the loop.
3305 if (SelectCond == 0 && SI == 0)
3313 /// This function implements the transforms on div instructions that work
3314 /// regardless of the kind of div instruction it is (udiv, sdiv, or fdiv). It is
3315 /// used by the visitors to those instructions.
3316 /// @brief Transforms common to all three div instructions
3317 Instruction *InstCombiner::commonDivTransforms(BinaryOperator &I) {
3318 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3320 // undef / X -> 0 for integer.
3321 // undef / X -> undef for FP (the undef could be a snan).
3322 if (isa<UndefValue>(Op0)) {
3323 if (Op0->getType()->isFPOrFPVector())
3324 return ReplaceInstUsesWith(I, Op0);
3325 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
3328 // X / undef -> undef
3329 if (isa<UndefValue>(Op1))
3330 return ReplaceInstUsesWith(I, Op1);
3335 /// This function implements the transforms common to both integer division
3336 /// instructions (udiv and sdiv). It is called by the visitors to those integer
3337 /// division instructions.
3338 /// @brief Common integer divide transforms
3339 Instruction *InstCombiner::commonIDivTransforms(BinaryOperator &I) {
3340 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3342 // (sdiv X, X) --> 1 (udiv X, X) --> 1
3344 if (const VectorType *Ty = dyn_cast<VectorType>(I.getType())) {
3345 Constant *CI = ConstantInt::get(Ty->getElementType(), 1);
3346 std::vector<Constant*> Elts(Ty->getNumElements(), CI);
3347 return ReplaceInstUsesWith(I, ConstantVector::get(Elts));
3350 Constant *CI = ConstantInt::get(I.getType(), 1);
3351 return ReplaceInstUsesWith(I, CI);
3354 if (Instruction *Common = commonDivTransforms(I))
3357 // Handle cases involving: [su]div X, (select Cond, Y, Z)
3358 // This does not apply for fdiv.
3359 if (isa<SelectInst>(Op1) && SimplifyDivRemOfSelect(I))
3362 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
3364 if (RHS->equalsInt(1))
3365 return ReplaceInstUsesWith(I, Op0);
3367 // (X / C1) / C2 -> X / (C1*C2)
3368 if (Instruction *LHS = dyn_cast<Instruction>(Op0))
3369 if (Instruction::BinaryOps(LHS->getOpcode()) == I.getOpcode())
3370 if (ConstantInt *LHSRHS = dyn_cast<ConstantInt>(LHS->getOperand(1))) {
3371 if (MultiplyOverflows(RHS, LHSRHS,
3372 I.getOpcode()==Instruction::SDiv))
3373 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
3375 return BinaryOperator::Create(I.getOpcode(), LHS->getOperand(0),
3376 ConstantExpr::getMul(RHS, LHSRHS));
3379 if (!RHS->isZero()) { // avoid X udiv 0
3380 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
3381 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
3383 if (isa<PHINode>(Op0))
3384 if (Instruction *NV = FoldOpIntoPhi(I))
3389 // 0 / X == 0, we don't need to preserve faults!
3390 if (ConstantInt *LHS = dyn_cast<ConstantInt>(Op0))
3391 if (LHS->equalsInt(0))
3392 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
3394 // It can't be division by zero, hence it must be division by one.
3395 if (I.getType() == Type::getInt1Ty(*Context))
3396 return ReplaceInstUsesWith(I, Op0);
3398 if (ConstantVector *Op1V = dyn_cast<ConstantVector>(Op1)) {
3399 if (ConstantInt *X = cast_or_null<ConstantInt>(Op1V->getSplatValue()))
3402 return ReplaceInstUsesWith(I, Op0);
3408 Instruction *InstCombiner::visitUDiv(BinaryOperator &I) {
3409 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3411 // Handle the integer div common cases
3412 if (Instruction *Common = commonIDivTransforms(I))
3415 if (ConstantInt *C = dyn_cast<ConstantInt>(Op1)) {
3416 // X udiv C^2 -> X >> C
3417 // Check to see if this is an unsigned division with an exact power of 2,
3418 // if so, convert to a right shift.
3419 if (C->getValue().isPowerOf2()) // 0 not included in isPowerOf2
3420 return BinaryOperator::CreateLShr(Op0,
3421 ConstantInt::get(Op0->getType(), C->getValue().logBase2()));
3423 // X udiv C, where C >= signbit
3424 if (C->getValue().isNegative()) {
3425 Value *IC = Builder->CreateICmpULT( Op0, C);
3426 return SelectInst::Create(IC, Constant::getNullValue(I.getType()),
3427 ConstantInt::get(I.getType(), 1));
3431 // X udiv (C1 << N), where C1 is "1<<C2" --> X >> (N+C2)
3432 if (BinaryOperator *RHSI = dyn_cast<BinaryOperator>(I.getOperand(1))) {
3433 if (RHSI->getOpcode() == Instruction::Shl &&
3434 isa<ConstantInt>(RHSI->getOperand(0))) {
3435 const APInt& C1 = cast<ConstantInt>(RHSI->getOperand(0))->getValue();
3436 if (C1.isPowerOf2()) {
3437 Value *N = RHSI->getOperand(1);
3438 const Type *NTy = N->getType();
3439 if (uint32_t C2 = C1.logBase2())
3440 N = Builder->CreateAdd(N, ConstantInt::get(NTy, C2), "tmp");
3441 return BinaryOperator::CreateLShr(Op0, N);
3446 // udiv X, (Select Cond, C1, C2) --> Select Cond, (shr X, C1), (shr X, C2)
3447 // where C1&C2 are powers of two.
3448 if (SelectInst *SI = dyn_cast<SelectInst>(Op1))
3449 if (ConstantInt *STO = dyn_cast<ConstantInt>(SI->getOperand(1)))
3450 if (ConstantInt *SFO = dyn_cast<ConstantInt>(SI->getOperand(2))) {
3451 const APInt &TVA = STO->getValue(), &FVA = SFO->getValue();
3452 if (TVA.isPowerOf2() && FVA.isPowerOf2()) {
3453 // Compute the shift amounts
3454 uint32_t TSA = TVA.logBase2(), FSA = FVA.logBase2();
3455 // Construct the "on true" case of the select
3456 Constant *TC = ConstantInt::get(Op0->getType(), TSA);
3457 Value *TSI = Builder->CreateLShr(Op0, TC, SI->getName()+".t");
3459 // Construct the "on false" case of the select
3460 Constant *FC = ConstantInt::get(Op0->getType(), FSA);
3461 Value *FSI = Builder->CreateLShr(Op0, FC, SI->getName()+".f");
3463 // construct the select instruction and return it.
3464 return SelectInst::Create(SI->getOperand(0), TSI, FSI, SI->getName());
3470 Instruction *InstCombiner::visitSDiv(BinaryOperator &I) {
3471 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3473 // Handle the integer div common cases
3474 if (Instruction *Common = commonIDivTransforms(I))
3477 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
3479 if (RHS->isAllOnesValue())
3480 return BinaryOperator::CreateNeg(Op0);
3482 // sdiv X, C --> ashr X, log2(C)
3483 if (cast<SDivOperator>(&I)->isExact() &&
3484 RHS->getValue().isNonNegative() &&
3485 RHS->getValue().isPowerOf2()) {
3486 Value *ShAmt = llvm::ConstantInt::get(RHS->getType(),
3487 RHS->getValue().exactLogBase2());
3488 return BinaryOperator::CreateAShr(Op0, ShAmt, I.getName());
3491 // -X/C --> X/-C provided the negation doesn't overflow.
3492 if (SubOperator *Sub = dyn_cast<SubOperator>(Op0))
3493 if (isa<Constant>(Sub->getOperand(0)) &&
3494 cast<Constant>(Sub->getOperand(0))->isNullValue() &&
3495 Sub->hasNoSignedWrap())
3496 return BinaryOperator::CreateSDiv(Sub->getOperand(1),
3497 ConstantExpr::getNeg(RHS));
3500 // If the sign bits of both operands are zero (i.e. we can prove they are
3501 // unsigned inputs), turn this into a udiv.
3502 if (I.getType()->isInteger()) {
3503 APInt Mask(APInt::getSignBit(I.getType()->getPrimitiveSizeInBits()));
3504 if (MaskedValueIsZero(Op0, Mask)) {
3505 if (MaskedValueIsZero(Op1, Mask)) {
3506 // X sdiv Y -> X udiv Y, iff X and Y don't have sign bit set
3507 return BinaryOperator::CreateUDiv(Op0, Op1, I.getName());
3509 ConstantInt *ShiftedInt;
3510 if (match(Op1, m_Shl(m_ConstantInt(ShiftedInt), m_Value())) &&
3511 ShiftedInt->getValue().isPowerOf2()) {
3512 // X sdiv (1 << Y) -> X udiv (1 << Y) ( -> X u>> Y)
3513 // Safe because the only negative value (1 << Y) can take on is
3514 // INT_MIN, and X sdiv INT_MIN == X udiv INT_MIN == 0 if X doesn't have
3515 // the sign bit set.
3516 return BinaryOperator::CreateUDiv(Op0, Op1, I.getName());
3524 Instruction *InstCombiner::visitFDiv(BinaryOperator &I) {
3525 return commonDivTransforms(I);
3528 /// This function implements the transforms on rem instructions that work
3529 /// regardless of the kind of rem instruction it is (urem, srem, or frem). It
3530 /// is used by the visitors to those instructions.
3531 /// @brief Transforms common to all three rem instructions
3532 Instruction *InstCombiner::commonRemTransforms(BinaryOperator &I) {
3533 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3535 if (isa<UndefValue>(Op0)) { // undef % X -> 0
3536 if (I.getType()->isFPOrFPVector())
3537 return ReplaceInstUsesWith(I, Op0); // X % undef -> undef (could be SNaN)
3538 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
3540 if (isa<UndefValue>(Op1))
3541 return ReplaceInstUsesWith(I, Op1); // X % undef -> undef
3543 // Handle cases involving: rem X, (select Cond, Y, Z)
3544 if (isa<SelectInst>(Op1) && SimplifyDivRemOfSelect(I))
3550 /// This function implements the transforms common to both integer remainder
3551 /// instructions (urem and srem). It is called by the visitors to those integer
3552 /// remainder instructions.
3553 /// @brief Common integer remainder transforms
3554 Instruction *InstCombiner::commonIRemTransforms(BinaryOperator &I) {
3555 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3557 if (Instruction *common = commonRemTransforms(I))
3560 // 0 % X == 0 for integer, we don't need to preserve faults!
3561 if (Constant *LHS = dyn_cast<Constant>(Op0))
3562 if (LHS->isNullValue())
3563 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
3565 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
3566 // X % 0 == undef, we don't need to preserve faults!
3567 if (RHS->equalsInt(0))
3568 return ReplaceInstUsesWith(I, UndefValue::get(I.getType()));
3570 if (RHS->equalsInt(1)) // X % 1 == 0
3571 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
3573 if (Instruction *Op0I = dyn_cast<Instruction>(Op0)) {
3574 if (SelectInst *SI = dyn_cast<SelectInst>(Op0I)) {
3575 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
3577 } else if (isa<PHINode>(Op0I)) {
3578 if (Instruction *NV = FoldOpIntoPhi(I))
3582 // See if we can fold away this rem instruction.
3583 if (SimplifyDemandedInstructionBits(I))
3591 Instruction *InstCombiner::visitURem(BinaryOperator &I) {
3592 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3594 if (Instruction *common = commonIRemTransforms(I))
3597 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
3598 // X urem C^2 -> X and C
3599 // Check to see if this is an unsigned remainder with an exact power of 2,
3600 // if so, convert to a bitwise and.
3601 if (ConstantInt *C = dyn_cast<ConstantInt>(RHS))
3602 if (C->getValue().isPowerOf2())
3603 return BinaryOperator::CreateAnd(Op0, SubOne(C));
3606 if (Instruction *RHSI = dyn_cast<Instruction>(I.getOperand(1))) {
3607 // Turn A % (C << N), where C is 2^k, into A & ((C << N)-1)
3608 if (RHSI->getOpcode() == Instruction::Shl &&
3609 isa<ConstantInt>(RHSI->getOperand(0))) {
3610 if (cast<ConstantInt>(RHSI->getOperand(0))->getValue().isPowerOf2()) {
3611 Constant *N1 = Constant::getAllOnesValue(I.getType());
3612 Value *Add = Builder->CreateAdd(RHSI, N1, "tmp");
3613 return BinaryOperator::CreateAnd(Op0, Add);
3618 // urem X, (select Cond, 2^C1, 2^C2) --> select Cond, (and X, C1), (and X, C2)
3619 // where C1&C2 are powers of two.
3620 if (SelectInst *SI = dyn_cast<SelectInst>(Op1)) {
3621 if (ConstantInt *STO = dyn_cast<ConstantInt>(SI->getOperand(1)))
3622 if (ConstantInt *SFO = dyn_cast<ConstantInt>(SI->getOperand(2))) {
3623 // STO == 0 and SFO == 0 handled above.
3624 if ((STO->getValue().isPowerOf2()) &&
3625 (SFO->getValue().isPowerOf2())) {
3626 Value *TrueAnd = Builder->CreateAnd(Op0, SubOne(STO),
3627 SI->getName()+".t");
3628 Value *FalseAnd = Builder->CreateAnd(Op0, SubOne(SFO),
3629 SI->getName()+".f");
3630 return SelectInst::Create(SI->getOperand(0), TrueAnd, FalseAnd);
3638 Instruction *InstCombiner::visitSRem(BinaryOperator &I) {
3639 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
3641 // Handle the integer rem common cases
3642 if (Instruction *Common = commonIRemTransforms(I))
3645 if (Value *RHSNeg = dyn_castNegVal(Op1))
3646 if (!isa<Constant>(RHSNeg) ||
3647 (isa<ConstantInt>(RHSNeg) &&
3648 cast<ConstantInt>(RHSNeg)->getValue().isStrictlyPositive())) {
3650 Worklist.AddValue(I.getOperand(1));
3651 I.setOperand(1, RHSNeg);
3655 // If the sign bits of both operands are zero (i.e. we can prove they are
3656 // unsigned inputs), turn this into a urem.
3657 if (I.getType()->isInteger()) {
3658 APInt Mask(APInt::getSignBit(I.getType()->getPrimitiveSizeInBits()));
3659 if (MaskedValueIsZero(Op1, Mask) && MaskedValueIsZero(Op0, Mask)) {
3660 // X srem Y -> X urem Y, iff X and Y don't have sign bit set
3661 return BinaryOperator::CreateURem(Op0, Op1, I.getName());
3665 // If it's a constant vector, flip any negative values positive.
3666 if (ConstantVector *RHSV = dyn_cast<ConstantVector>(Op1)) {
3667 unsigned VWidth = RHSV->getNumOperands();
3669 bool hasNegative = false;
3670 for (unsigned i = 0; !hasNegative && i != VWidth; ++i)
3671 if (ConstantInt *RHS = dyn_cast<ConstantInt>(RHSV->getOperand(i)))
3672 if (RHS->getValue().isNegative())
3676 std::vector<Constant *> Elts(VWidth);
3677 for (unsigned i = 0; i != VWidth; ++i) {
3678 if (ConstantInt *RHS = dyn_cast<ConstantInt>(RHSV->getOperand(i))) {
3679 if (RHS->getValue().isNegative())
3680 Elts[i] = cast<ConstantInt>(ConstantExpr::getNeg(RHS));
3686 Constant *NewRHSV = ConstantVector::get(Elts);
3687 if (NewRHSV != RHSV) {
3688 Worklist.AddValue(I.getOperand(1));
3689 I.setOperand(1, NewRHSV);
3698 Instruction *InstCombiner::visitFRem(BinaryOperator &I) {
3699 return commonRemTransforms(I);
3702 // isOneBitSet - Return true if there is exactly one bit set in the specified
3704 static bool isOneBitSet(const ConstantInt *CI) {
3705 return CI->getValue().isPowerOf2();
3708 // isHighOnes - Return true if the constant is of the form 1+0+.
3709 // This is the same as lowones(~X).
3710 static bool isHighOnes(const ConstantInt *CI) {
3711 return (~CI->getValue() + 1).isPowerOf2();
3714 /// getICmpCode - Encode a icmp predicate into a three bit mask. These bits
3715 /// are carefully arranged to allow folding of expressions such as:
3717 /// (A < B) | (A > B) --> (A != B)
3719 /// Note that this is only valid if the first and second predicates have the
3720 /// same sign. Is illegal to do: (A u< B) | (A s> B)
3722 /// Three bits are used to represent the condition, as follows:
3727 /// <=> Value Definition
3728 /// 000 0 Always false
3735 /// 111 7 Always true
3737 static unsigned getICmpCode(const ICmpInst *ICI) {
3738 switch (ICI->getPredicate()) {
3740 case ICmpInst::ICMP_UGT: return 1; // 001
3741 case ICmpInst::ICMP_SGT: return 1; // 001
3742 case ICmpInst::ICMP_EQ: return 2; // 010
3743 case ICmpInst::ICMP_UGE: return 3; // 011
3744 case ICmpInst::ICMP_SGE: return 3; // 011
3745 case ICmpInst::ICMP_ULT: return 4; // 100
3746 case ICmpInst::ICMP_SLT: return 4; // 100
3747 case ICmpInst::ICMP_NE: return 5; // 101
3748 case ICmpInst::ICMP_ULE: return 6; // 110
3749 case ICmpInst::ICMP_SLE: return 6; // 110
3752 llvm_unreachable("Invalid ICmp predicate!");
3757 /// getFCmpCode - Similar to getICmpCode but for FCmpInst. This encodes a fcmp
3758 /// predicate into a three bit mask. It also returns whether it is an ordered
3759 /// predicate by reference.
3760 static unsigned getFCmpCode(FCmpInst::Predicate CC, bool &isOrdered) {
3763 case FCmpInst::FCMP_ORD: isOrdered = true; return 0; // 000
3764 case FCmpInst::FCMP_UNO: return 0; // 000
3765 case FCmpInst::FCMP_OGT: isOrdered = true; return 1; // 001
3766 case FCmpInst::FCMP_UGT: return 1; // 001
3767 case FCmpInst::FCMP_OEQ: isOrdered = true; return 2; // 010
3768 case FCmpInst::FCMP_UEQ: return 2; // 010
3769 case FCmpInst::FCMP_OGE: isOrdered = true; return 3; // 011
3770 case FCmpInst::FCMP_UGE: return 3; // 011
3771 case FCmpInst::FCMP_OLT: isOrdered = true; return 4; // 100
3772 case FCmpInst::FCMP_ULT: return 4; // 100
3773 case FCmpInst::FCMP_ONE: isOrdered = true; return 5; // 101
3774 case FCmpInst::FCMP_UNE: return 5; // 101
3775 case FCmpInst::FCMP_OLE: isOrdered = true; return 6; // 110
3776 case FCmpInst::FCMP_ULE: return 6; // 110
3779 // Not expecting FCMP_FALSE and FCMP_TRUE;
3780 llvm_unreachable("Unexpected FCmp predicate!");
3785 /// getICmpValue - This is the complement of getICmpCode, which turns an
3786 /// opcode and two operands into either a constant true or false, or a brand
3787 /// new ICmp instruction. The sign is passed in to determine which kind
3788 /// of predicate to use in the new icmp instruction.
3789 static Value *getICmpValue(bool sign, unsigned code, Value *LHS, Value *RHS,
3790 LLVMContext *Context) {
3792 default: llvm_unreachable("Illegal ICmp code!");
3793 case 0: return ConstantInt::getFalse(*Context);
3796 return new ICmpInst(ICmpInst::ICMP_SGT, LHS, RHS);
3798 return new ICmpInst(ICmpInst::ICMP_UGT, LHS, RHS);
3799 case 2: return new ICmpInst(ICmpInst::ICMP_EQ, LHS, RHS);
3802 return new ICmpInst(ICmpInst::ICMP_SGE, LHS, RHS);
3804 return new ICmpInst(ICmpInst::ICMP_UGE, LHS, RHS);
3807 return new ICmpInst(ICmpInst::ICMP_SLT, LHS, RHS);
3809 return new ICmpInst(ICmpInst::ICMP_ULT, LHS, RHS);
3810 case 5: return new ICmpInst(ICmpInst::ICMP_NE, LHS, RHS);
3813 return new ICmpInst(ICmpInst::ICMP_SLE, LHS, RHS);
3815 return new ICmpInst(ICmpInst::ICMP_ULE, LHS, RHS);
3816 case 7: return ConstantInt::getTrue(*Context);
3820 /// getFCmpValue - This is the complement of getFCmpCode, which turns an
3821 /// opcode and two operands into either a FCmp instruction. isordered is passed
3822 /// in to determine which kind of predicate to use in the new fcmp instruction.
3823 static Value *getFCmpValue(bool isordered, unsigned code,
3824 Value *LHS, Value *RHS, LLVMContext *Context) {
3826 default: llvm_unreachable("Illegal FCmp code!");
3829 return new FCmpInst(FCmpInst::FCMP_ORD, LHS, RHS);
3831 return new FCmpInst(FCmpInst::FCMP_UNO, LHS, RHS);
3834 return new FCmpInst(FCmpInst::FCMP_OGT, LHS, RHS);
3836 return new FCmpInst(FCmpInst::FCMP_UGT, LHS, RHS);
3839 return new FCmpInst(FCmpInst::FCMP_OEQ, LHS, RHS);
3841 return new FCmpInst(FCmpInst::FCMP_UEQ, LHS, RHS);
3844 return new FCmpInst(FCmpInst::FCMP_OGE, LHS, RHS);
3846 return new FCmpInst(FCmpInst::FCMP_UGE, LHS, RHS);
3849 return new FCmpInst(FCmpInst::FCMP_OLT, LHS, RHS);
3851 return new FCmpInst(FCmpInst::FCMP_ULT, LHS, RHS);
3854 return new FCmpInst(FCmpInst::FCMP_ONE, LHS, RHS);
3856 return new FCmpInst(FCmpInst::FCMP_UNE, LHS, RHS);
3859 return new FCmpInst(FCmpInst::FCMP_OLE, LHS, RHS);
3861 return new FCmpInst(FCmpInst::FCMP_ULE, LHS, RHS);
3862 case 7: return ConstantInt::getTrue(*Context);
3866 /// PredicatesFoldable - Return true if both predicates match sign or if at
3867 /// least one of them is an equality comparison (which is signless).
3868 static bool PredicatesFoldable(ICmpInst::Predicate p1, ICmpInst::Predicate p2) {
3869 return (CmpInst::isSigned(p1) == CmpInst::isSigned(p2)) ||
3870 (CmpInst::isSigned(p1) && ICmpInst::isEquality(p2)) ||
3871 (CmpInst::isSigned(p2) && ICmpInst::isEquality(p1));
3875 // FoldICmpLogical - Implements (icmp1 A, B) & (icmp2 A, B) --> (icmp3 A, B)
3876 struct FoldICmpLogical {
3879 ICmpInst::Predicate pred;
3880 FoldICmpLogical(InstCombiner &ic, ICmpInst *ICI)
3881 : IC(ic), LHS(ICI->getOperand(0)), RHS(ICI->getOperand(1)),
3882 pred(ICI->getPredicate()) {}
3883 bool shouldApply(Value *V) const {
3884 if (ICmpInst *ICI = dyn_cast<ICmpInst>(V))
3885 if (PredicatesFoldable(pred, ICI->getPredicate()))
3886 return ((ICI->getOperand(0) == LHS && ICI->getOperand(1) == RHS) ||
3887 (ICI->getOperand(0) == RHS && ICI->getOperand(1) == LHS));
3890 Instruction *apply(Instruction &Log) const {
3891 ICmpInst *ICI = cast<ICmpInst>(Log.getOperand(0));
3892 if (ICI->getOperand(0) != LHS) {
3893 assert(ICI->getOperand(1) == LHS);
3894 ICI->swapOperands(); // Swap the LHS and RHS of the ICmp
3897 ICmpInst *RHSICI = cast<ICmpInst>(Log.getOperand(1));
3898 unsigned LHSCode = getICmpCode(ICI);
3899 unsigned RHSCode = getICmpCode(RHSICI);
3901 switch (Log.getOpcode()) {
3902 case Instruction::And: Code = LHSCode & RHSCode; break;
3903 case Instruction::Or: Code = LHSCode | RHSCode; break;
3904 case Instruction::Xor: Code = LHSCode ^ RHSCode; break;
3905 default: llvm_unreachable("Illegal logical opcode!"); return 0;
3908 bool isSigned = RHSICI->isSigned() || ICI->isSigned();
3909 Value *RV = getICmpValue(isSigned, Code, LHS, RHS, IC.getContext());
3910 if (Instruction *I = dyn_cast<Instruction>(RV))
3912 // Otherwise, it's a constant boolean value...
3913 return IC.ReplaceInstUsesWith(Log, RV);
3916 } // end anonymous namespace
3918 // OptAndOp - This handles expressions of the form ((val OP C1) & C2). Where
3919 // the Op parameter is 'OP', OpRHS is 'C1', and AndRHS is 'C2'. Op is
3920 // guaranteed to be a binary operator.
3921 Instruction *InstCombiner::OptAndOp(Instruction *Op,
3923 ConstantInt *AndRHS,
3924 BinaryOperator &TheAnd) {
3925 Value *X = Op->getOperand(0);
3926 Constant *Together = 0;
3928 Together = ConstantExpr::getAnd(AndRHS, OpRHS);
3930 switch (Op->getOpcode()) {
3931 case Instruction::Xor:
3932 if (Op->hasOneUse()) {
3933 // (X ^ C1) & C2 --> (X & C2) ^ (C1&C2)
3934 Value *And = Builder->CreateAnd(X, AndRHS);
3936 return BinaryOperator::CreateXor(And, Together);
3939 case Instruction::Or:
3940 if (Together == AndRHS) // (X | C) & C --> C
3941 return ReplaceInstUsesWith(TheAnd, AndRHS);
3943 if (Op->hasOneUse() && Together != OpRHS) {
3944 // (X | C1) & C2 --> (X | (C1&C2)) & C2
3945 Value *Or = Builder->CreateOr(X, Together);
3947 return BinaryOperator::CreateAnd(Or, AndRHS);
3950 case Instruction::Add:
3951 if (Op->hasOneUse()) {
3952 // Adding a one to a single bit bit-field should be turned into an XOR
3953 // of the bit. First thing to check is to see if this AND is with a
3954 // single bit constant.
3955 const APInt& AndRHSV = cast<ConstantInt>(AndRHS)->getValue();
3957 // If there is only one bit set...
3958 if (isOneBitSet(cast<ConstantInt>(AndRHS))) {
3959 // Ok, at this point, we know that we are masking the result of the
3960 // ADD down to exactly one bit. If the constant we are adding has
3961 // no bits set below this bit, then we can eliminate the ADD.
3962 const APInt& AddRHS = cast<ConstantInt>(OpRHS)->getValue();
3964 // Check to see if any bits below the one bit set in AndRHSV are set.
3965 if ((AddRHS & (AndRHSV-1)) == 0) {
3966 // If not, the only thing that can effect the output of the AND is
3967 // the bit specified by AndRHSV. If that bit is set, the effect of
3968 // the XOR is to toggle the bit. If it is clear, then the ADD has
3970 if ((AddRHS & AndRHSV) == 0) { // Bit is not set, noop
3971 TheAnd.setOperand(0, X);
3974 // Pull the XOR out of the AND.
3975 Value *NewAnd = Builder->CreateAnd(X, AndRHS);
3976 NewAnd->takeName(Op);
3977 return BinaryOperator::CreateXor(NewAnd, AndRHS);
3984 case Instruction::Shl: {
3985 // We know that the AND will not produce any of the bits shifted in, so if
3986 // the anded constant includes them, clear them now!
3988 uint32_t BitWidth = AndRHS->getType()->getBitWidth();
3989 uint32_t OpRHSVal = OpRHS->getLimitedValue(BitWidth);
3990 APInt ShlMask(APInt::getHighBitsSet(BitWidth, BitWidth-OpRHSVal));
3991 ConstantInt *CI = ConstantInt::get(*Context, AndRHS->getValue() & ShlMask);
3993 if (CI->getValue() == ShlMask) {
3994 // Masking out bits that the shift already masks
3995 return ReplaceInstUsesWith(TheAnd, Op); // No need for the and.
3996 } else if (CI != AndRHS) { // Reducing bits set in and.
3997 TheAnd.setOperand(1, CI);
4002 case Instruction::LShr:
4004 // We know that the AND will not produce any of the bits shifted in, so if
4005 // the anded constant includes them, clear them now! This only applies to
4006 // unsigned shifts, because a signed shr may bring in set bits!
4008 uint32_t BitWidth = AndRHS->getType()->getBitWidth();
4009 uint32_t OpRHSVal = OpRHS->getLimitedValue(BitWidth);
4010 APInt ShrMask(APInt::getLowBitsSet(BitWidth, BitWidth - OpRHSVal));
4011 ConstantInt *CI = ConstantInt::get(*Context, AndRHS->getValue() & ShrMask);
4013 if (CI->getValue() == ShrMask) {
4014 // Masking out bits that the shift already masks.
4015 return ReplaceInstUsesWith(TheAnd, Op);
4016 } else if (CI != AndRHS) {
4017 TheAnd.setOperand(1, CI); // Reduce bits set in and cst.
4022 case Instruction::AShr:
4024 // See if this is shifting in some sign extension, then masking it out
4026 if (Op->hasOneUse()) {
4027 uint32_t BitWidth = AndRHS->getType()->getBitWidth();
4028 uint32_t OpRHSVal = OpRHS->getLimitedValue(BitWidth);
4029 APInt ShrMask(APInt::getLowBitsSet(BitWidth, BitWidth - OpRHSVal));
4030 Constant *C = ConstantInt::get(*Context, AndRHS->getValue() & ShrMask);
4031 if (C == AndRHS) { // Masking out bits shifted in.
4032 // (Val ashr C1) & C2 -> (Val lshr C1) & C2
4033 // Make the argument unsigned.
4034 Value *ShVal = Op->getOperand(0);
4035 ShVal = Builder->CreateLShr(ShVal, OpRHS, Op->getName());
4036 return BinaryOperator::CreateAnd(ShVal, AndRHS, TheAnd.getName());
4045 /// InsertRangeTest - Emit a computation of: (V >= Lo && V < Hi) if Inside is
4046 /// true, otherwise (V < Lo || V >= Hi). In pratice, we emit the more efficient
4047 /// (V-Lo) <u Hi-Lo. This method expects that Lo <= Hi. isSigned indicates
4048 /// whether to treat the V, Lo and HI as signed or not. IB is the location to
4049 /// insert new instructions.
4050 Instruction *InstCombiner::InsertRangeTest(Value *V, Constant *Lo, Constant *Hi,
4051 bool isSigned, bool Inside,
4053 assert(cast<ConstantInt>(ConstantExpr::getICmp((isSigned ?
4054 ICmpInst::ICMP_SLE:ICmpInst::ICMP_ULE), Lo, Hi))->getZExtValue() &&
4055 "Lo is not <= Hi in range emission code!");
4058 if (Lo == Hi) // Trivially false.
4059 return new ICmpInst(ICmpInst::ICMP_NE, V, V);
4061 // V >= Min && V < Hi --> V < Hi
4062 if (cast<ConstantInt>(Lo)->isMinValue(isSigned)) {
4063 ICmpInst::Predicate pred = (isSigned ?
4064 ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT);
4065 return new ICmpInst(pred, V, Hi);
4068 // Emit V-Lo <u Hi-Lo
4069 Constant *NegLo = ConstantExpr::getNeg(Lo);
4070 Value *Add = Builder->CreateAdd(V, NegLo, V->getName()+".off");
4071 Constant *UpperBound = ConstantExpr::getAdd(NegLo, Hi);
4072 return new ICmpInst(ICmpInst::ICMP_ULT, Add, UpperBound);
4075 if (Lo == Hi) // Trivially true.
4076 return new ICmpInst(ICmpInst::ICMP_EQ, V, V);
4078 // V < Min || V >= Hi -> V > Hi-1
4079 Hi = SubOne(cast<ConstantInt>(Hi));
4080 if (cast<ConstantInt>(Lo)->isMinValue(isSigned)) {
4081 ICmpInst::Predicate pred = (isSigned ?
4082 ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT);
4083 return new ICmpInst(pred, V, Hi);
4086 // Emit V-Lo >u Hi-1-Lo
4087 // Note that Hi has already had one subtracted from it, above.
4088 ConstantInt *NegLo = cast<ConstantInt>(ConstantExpr::getNeg(Lo));
4089 Value *Add = Builder->CreateAdd(V, NegLo, V->getName()+".off");
4090 Constant *LowerBound = ConstantExpr::getAdd(NegLo, Hi);
4091 return new ICmpInst(ICmpInst::ICMP_UGT, Add, LowerBound);
4094 // isRunOfOnes - Returns true iff Val consists of one contiguous run of 1s with
4095 // any number of 0s on either side. The 1s are allowed to wrap from LSB to
4096 // MSB, so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is
4097 // not, since all 1s are not contiguous.
4098 static bool isRunOfOnes(ConstantInt *Val, uint32_t &MB, uint32_t &ME) {
4099 const APInt& V = Val->getValue();
4100 uint32_t BitWidth = Val->getType()->getBitWidth();
4101 if (!APIntOps::isShiftedMask(BitWidth, V)) return false;
4103 // look for the first zero bit after the run of ones
4104 MB = BitWidth - ((V - 1) ^ V).countLeadingZeros();
4105 // look for the first non-zero bit
4106 ME = V.getActiveBits();
4110 /// FoldLogicalPlusAnd - This is part of an expression (LHS +/- RHS) & Mask,
4111 /// where isSub determines whether the operator is a sub. If we can fold one of
4112 /// the following xforms:
4114 /// ((A & N) +/- B) & Mask -> (A +/- B) & Mask iff N&Mask == Mask
4115 /// ((A | N) +/- B) & Mask -> (A +/- B) & Mask iff N&Mask == 0
4116 /// ((A ^ N) +/- B) & Mask -> (A +/- B) & Mask iff N&Mask == 0
4118 /// return (A +/- B).
4120 Value *InstCombiner::FoldLogicalPlusAnd(Value *LHS, Value *RHS,
4121 ConstantInt *Mask, bool isSub,
4123 Instruction *LHSI = dyn_cast<Instruction>(LHS);
4124 if (!LHSI || LHSI->getNumOperands() != 2 ||
4125 !isa<ConstantInt>(LHSI->getOperand(1))) return 0;
4127 ConstantInt *N = cast<ConstantInt>(LHSI->getOperand(1));
4129 switch (LHSI->getOpcode()) {
4131 case Instruction::And:
4132 if (ConstantExpr::getAnd(N, Mask) == Mask) {
4133 // If the AndRHS is a power of two minus one (0+1+), this is simple.
4134 if ((Mask->getValue().countLeadingZeros() +
4135 Mask->getValue().countPopulation()) ==
4136 Mask->getValue().getBitWidth())
4139 // Otherwise, if Mask is 0+1+0+, and if B is known to have the low 0+
4140 // part, we don't need any explicit masks to take them out of A. If that
4141 // is all N is, ignore it.
4142 uint32_t MB = 0, ME = 0;
4143 if (isRunOfOnes(Mask, MB, ME)) { // begin/end bit of run, inclusive
4144 uint32_t BitWidth = cast<IntegerType>(RHS->getType())->getBitWidth();
4145 APInt Mask(APInt::getLowBitsSet(BitWidth, MB-1));
4146 if (MaskedValueIsZero(RHS, Mask))
4151 case Instruction::Or:
4152 case Instruction::Xor:
4153 // If the AndRHS is a power of two minus one (0+1+), and N&Mask == 0
4154 if ((Mask->getValue().countLeadingZeros() +
4155 Mask->getValue().countPopulation()) == Mask->getValue().getBitWidth()
4156 && ConstantExpr::getAnd(N, Mask)->isNullValue())
4162 return Builder->CreateSub(LHSI->getOperand(0), RHS, "fold");
4163 return Builder->CreateAdd(LHSI->getOperand(0), RHS, "fold");
4166 /// FoldAndOfICmps - Fold (icmp)&(icmp) if possible.
4167 Instruction *InstCombiner::FoldAndOfICmps(Instruction &I,
4168 ICmpInst *LHS, ICmpInst *RHS) {
4170 ConstantInt *LHSCst, *RHSCst;
4171 ICmpInst::Predicate LHSCC, RHSCC;
4173 // This only handles icmp of constants: (icmp1 A, C1) & (icmp2 B, C2).
4174 if (!match(LHS, m_ICmp(LHSCC, m_Value(Val),
4175 m_ConstantInt(LHSCst))) ||
4176 !match(RHS, m_ICmp(RHSCC, m_Value(Val2),
4177 m_ConstantInt(RHSCst))))
4180 if (LHSCst == RHSCst && LHSCC == RHSCC) {
4181 // (icmp ult A, C) & (icmp ult B, C) --> (icmp ult (A|B), C)
4182 // where C is a power of 2
4183 if (LHSCC == ICmpInst::ICMP_ULT &&
4184 LHSCst->getValue().isPowerOf2()) {
4185 Value *NewOr = Builder->CreateOr(Val, Val2);
4186 return new ICmpInst(LHSCC, NewOr, LHSCst);
4189 // (icmp eq A, 0) & (icmp eq B, 0) --> (icmp eq (A|B), 0)
4190 if (LHSCC == ICmpInst::ICMP_EQ && LHSCst->isZero()) {
4191 Value *NewOr = Builder->CreateOr(Val, Val2);
4192 return new ICmpInst(LHSCC, NewOr, LHSCst);
4196 // From here on, we only handle:
4197 // (icmp1 A, C1) & (icmp2 A, C2) --> something simpler.
4198 if (Val != Val2) return 0;
4200 // ICMP_[US][GL]E X, CST is folded to ICMP_[US][GL]T elsewhere.
4201 if (LHSCC == ICmpInst::ICMP_UGE || LHSCC == ICmpInst::ICMP_ULE ||
4202 RHSCC == ICmpInst::ICMP_UGE || RHSCC == ICmpInst::ICMP_ULE ||
4203 LHSCC == ICmpInst::ICMP_SGE || LHSCC == ICmpInst::ICMP_SLE ||
4204 RHSCC == ICmpInst::ICMP_SGE || RHSCC == ICmpInst::ICMP_SLE)
4207 // We can't fold (ugt x, C) & (sgt x, C2).
4208 if (!PredicatesFoldable(LHSCC, RHSCC))
4211 // Ensure that the larger constant is on the RHS.
4213 if (CmpInst::isSigned(LHSCC) ||
4214 (ICmpInst::isEquality(LHSCC) &&
4215 CmpInst::isSigned(RHSCC)))
4216 ShouldSwap = LHSCst->getValue().sgt(RHSCst->getValue());
4218 ShouldSwap = LHSCst->getValue().ugt(RHSCst->getValue());
4221 std::swap(LHS, RHS);
4222 std::swap(LHSCst, RHSCst);
4223 std::swap(LHSCC, RHSCC);
4226 // At this point, we know we have have two icmp instructions
4227 // comparing a value against two constants and and'ing the result
4228 // together. Because of the above check, we know that we only have
4229 // icmp eq, icmp ne, icmp [su]lt, and icmp [SU]gt here. We also know
4230 // (from the FoldICmpLogical check above), that the two constants
4231 // are not equal and that the larger constant is on the RHS
4232 assert(LHSCst != RHSCst && "Compares not folded above?");
4235 default: llvm_unreachable("Unknown integer condition code!");
4236 case ICmpInst::ICMP_EQ:
4238 default: llvm_unreachable("Unknown integer condition code!");
4239 case ICmpInst::ICMP_EQ: // (X == 13 & X == 15) -> false
4240 case ICmpInst::ICMP_UGT: // (X == 13 & X > 15) -> false
4241 case ICmpInst::ICMP_SGT: // (X == 13 & X > 15) -> false
4242 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
4243 case ICmpInst::ICMP_NE: // (X == 13 & X != 15) -> X == 13
4244 case ICmpInst::ICMP_ULT: // (X == 13 & X < 15) -> X == 13
4245 case ICmpInst::ICMP_SLT: // (X == 13 & X < 15) -> X == 13
4246 return ReplaceInstUsesWith(I, LHS);
4248 case ICmpInst::ICMP_NE:
4250 default: llvm_unreachable("Unknown integer condition code!");
4251 case ICmpInst::ICMP_ULT:
4252 if (LHSCst == SubOne(RHSCst)) // (X != 13 & X u< 14) -> X < 13
4253 return new ICmpInst(ICmpInst::ICMP_ULT, Val, LHSCst);
4254 break; // (X != 13 & X u< 15) -> no change
4255 case ICmpInst::ICMP_SLT:
4256 if (LHSCst == SubOne(RHSCst)) // (X != 13 & X s< 14) -> X < 13
4257 return new ICmpInst(ICmpInst::ICMP_SLT, Val, LHSCst);
4258 break; // (X != 13 & X s< 15) -> no change
4259 case ICmpInst::ICMP_EQ: // (X != 13 & X == 15) -> X == 15
4260 case ICmpInst::ICMP_UGT: // (X != 13 & X u> 15) -> X u> 15
4261 case ICmpInst::ICMP_SGT: // (X != 13 & X s> 15) -> X s> 15
4262 return ReplaceInstUsesWith(I, RHS);
4263 case ICmpInst::ICMP_NE:
4264 if (LHSCst == SubOne(RHSCst)){// (X != 13 & X != 14) -> X-13 >u 1
4265 Constant *AddCST = ConstantExpr::getNeg(LHSCst);
4266 Value *Add = Builder->CreateAdd(Val, AddCST, Val->getName()+".off");
4267 return new ICmpInst(ICmpInst::ICMP_UGT, Add,
4268 ConstantInt::get(Add->getType(), 1));
4270 break; // (X != 13 & X != 15) -> no change
4273 case ICmpInst::ICMP_ULT:
4275 default: llvm_unreachable("Unknown integer condition code!");
4276 case ICmpInst::ICMP_EQ: // (X u< 13 & X == 15) -> false
4277 case ICmpInst::ICMP_UGT: // (X u< 13 & X u> 15) -> false
4278 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
4279 case ICmpInst::ICMP_SGT: // (X u< 13 & X s> 15) -> no change
4281 case ICmpInst::ICMP_NE: // (X u< 13 & X != 15) -> X u< 13
4282 case ICmpInst::ICMP_ULT: // (X u< 13 & X u< 15) -> X u< 13
4283 return ReplaceInstUsesWith(I, LHS);
4284 case ICmpInst::ICMP_SLT: // (X u< 13 & X s< 15) -> no change
4288 case ICmpInst::ICMP_SLT:
4290 default: llvm_unreachable("Unknown integer condition code!");
4291 case ICmpInst::ICMP_EQ: // (X s< 13 & X == 15) -> false
4292 case ICmpInst::ICMP_SGT: // (X s< 13 & X s> 15) -> false
4293 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
4294 case ICmpInst::ICMP_UGT: // (X s< 13 & X u> 15) -> no change
4296 case ICmpInst::ICMP_NE: // (X s< 13 & X != 15) -> X < 13
4297 case ICmpInst::ICMP_SLT: // (X s< 13 & X s< 15) -> X < 13
4298 return ReplaceInstUsesWith(I, LHS);
4299 case ICmpInst::ICMP_ULT: // (X s< 13 & X u< 15) -> no change
4303 case ICmpInst::ICMP_UGT:
4305 default: llvm_unreachable("Unknown integer condition code!");
4306 case ICmpInst::ICMP_EQ: // (X u> 13 & X == 15) -> X == 15
4307 case ICmpInst::ICMP_UGT: // (X u> 13 & X u> 15) -> X u> 15
4308 return ReplaceInstUsesWith(I, RHS);
4309 case ICmpInst::ICMP_SGT: // (X u> 13 & X s> 15) -> no change
4311 case ICmpInst::ICMP_NE:
4312 if (RHSCst == AddOne(LHSCst)) // (X u> 13 & X != 14) -> X u> 14
4313 return new ICmpInst(LHSCC, Val, RHSCst);
4314 break; // (X u> 13 & X != 15) -> no change
4315 case ICmpInst::ICMP_ULT: // (X u> 13 & X u< 15) -> (X-14) <u 1
4316 return InsertRangeTest(Val, AddOne(LHSCst),
4317 RHSCst, false, true, I);
4318 case ICmpInst::ICMP_SLT: // (X u> 13 & X s< 15) -> no change
4322 case ICmpInst::ICMP_SGT:
4324 default: llvm_unreachable("Unknown integer condition code!");
4325 case ICmpInst::ICMP_EQ: // (X s> 13 & X == 15) -> X == 15
4326 case ICmpInst::ICMP_SGT: // (X s> 13 & X s> 15) -> X s> 15
4327 return ReplaceInstUsesWith(I, RHS);
4328 case ICmpInst::ICMP_UGT: // (X s> 13 & X u> 15) -> no change
4330 case ICmpInst::ICMP_NE:
4331 if (RHSCst == AddOne(LHSCst)) // (X s> 13 & X != 14) -> X s> 14
4332 return new ICmpInst(LHSCC, Val, RHSCst);
4333 break; // (X s> 13 & X != 15) -> no change
4334 case ICmpInst::ICMP_SLT: // (X s> 13 & X s< 15) -> (X-14) s< 1
4335 return InsertRangeTest(Val, AddOne(LHSCst),
4336 RHSCst, true, true, I);
4337 case ICmpInst::ICMP_ULT: // (X s> 13 & X u< 15) -> no change
4346 Instruction *InstCombiner::FoldAndOfFCmps(Instruction &I, FCmpInst *LHS,
4349 if (LHS->getPredicate() == FCmpInst::FCMP_ORD &&
4350 RHS->getPredicate() == FCmpInst::FCMP_ORD) {
4351 // (fcmp ord x, c) & (fcmp ord y, c) -> (fcmp ord x, y)
4352 if (ConstantFP *LHSC = dyn_cast<ConstantFP>(LHS->getOperand(1)))
4353 if (ConstantFP *RHSC = dyn_cast<ConstantFP>(RHS->getOperand(1))) {
4354 // If either of the constants are nans, then the whole thing returns
4356 if (LHSC->getValueAPF().isNaN() || RHSC->getValueAPF().isNaN())
4357 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
4358 return new FCmpInst(FCmpInst::FCMP_ORD,
4359 LHS->getOperand(0), RHS->getOperand(0));
4362 // Handle vector zeros. This occurs because the canonical form of
4363 // "fcmp ord x,x" is "fcmp ord x, 0".
4364 if (isa<ConstantAggregateZero>(LHS->getOperand(1)) &&
4365 isa<ConstantAggregateZero>(RHS->getOperand(1)))
4366 return new FCmpInst(FCmpInst::FCMP_ORD,
4367 LHS->getOperand(0), RHS->getOperand(0));
4371 Value *Op0LHS = LHS->getOperand(0), *Op0RHS = LHS->getOperand(1);
4372 Value *Op1LHS = RHS->getOperand(0), *Op1RHS = RHS->getOperand(1);
4373 FCmpInst::Predicate Op0CC = LHS->getPredicate(), Op1CC = RHS->getPredicate();
4376 if (Op0LHS == Op1RHS && Op0RHS == Op1LHS) {
4377 // Swap RHS operands to match LHS.
4378 Op1CC = FCmpInst::getSwappedPredicate(Op1CC);
4379 std::swap(Op1LHS, Op1RHS);
4382 if (Op0LHS == Op1LHS && Op0RHS == Op1RHS) {
4383 // Simplify (fcmp cc0 x, y) & (fcmp cc1 x, y).
4385 return new FCmpInst((FCmpInst::Predicate)Op0CC, Op0LHS, Op0RHS);
4387 if (Op0CC == FCmpInst::FCMP_FALSE || Op1CC == FCmpInst::FCMP_FALSE)
4388 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
4389 if (Op0CC == FCmpInst::FCMP_TRUE)
4390 return ReplaceInstUsesWith(I, RHS);
4391 if (Op1CC == FCmpInst::FCMP_TRUE)
4392 return ReplaceInstUsesWith(I, LHS);
4396 unsigned Op0Pred = getFCmpCode(Op0CC, Op0Ordered);
4397 unsigned Op1Pred = getFCmpCode(Op1CC, Op1Ordered);
4399 std::swap(LHS, RHS);
4400 std::swap(Op0Pred, Op1Pred);
4401 std::swap(Op0Ordered, Op1Ordered);
4404 // uno && ueq -> uno && (uno || eq) -> ueq
4405 // ord && olt -> ord && (ord && lt) -> olt
4406 if (Op0Ordered == Op1Ordered)
4407 return ReplaceInstUsesWith(I, RHS);
4409 // uno && oeq -> uno && (ord && eq) -> false
4410 // uno && ord -> false
4412 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
4413 // ord && ueq -> ord && (uno || eq) -> oeq
4414 return cast<Instruction>(getFCmpValue(true, Op1Pred,
4415 Op0LHS, Op0RHS, Context));
4423 Instruction *InstCombiner::visitAnd(BinaryOperator &I) {
4424 bool Changed = SimplifyCommutative(I);
4425 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
4427 if (Value *V = SimplifyAndInst(Op0, Op1, TD))
4428 return ReplaceInstUsesWith(I, V);
4430 // See if we can simplify any instructions used by the instruction whose sole
4431 // purpose is to compute bits we don't care about.
4432 if (SimplifyDemandedInstructionBits(I))
4436 if (ConstantInt *AndRHS = dyn_cast<ConstantInt>(Op1)) {
4437 const APInt &AndRHSMask = AndRHS->getValue();
4438 APInt NotAndRHS(~AndRHSMask);
4440 // Optimize a variety of ((val OP C1) & C2) combinations...
4441 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0)) {
4442 Value *Op0LHS = Op0I->getOperand(0);
4443 Value *Op0RHS = Op0I->getOperand(1);
4444 switch (Op0I->getOpcode()) {
4446 case Instruction::Xor:
4447 case Instruction::Or:
4448 // If the mask is only needed on one incoming arm, push it up.
4449 if (!Op0I->hasOneUse()) break;
4451 if (MaskedValueIsZero(Op0LHS, NotAndRHS)) {
4452 // Not masking anything out for the LHS, move to RHS.
4453 Value *NewRHS = Builder->CreateAnd(Op0RHS, AndRHS,
4454 Op0RHS->getName()+".masked");
4455 return BinaryOperator::Create(Op0I->getOpcode(), Op0LHS, NewRHS);
4457 if (!isa<Constant>(Op0RHS) &&
4458 MaskedValueIsZero(Op0RHS, NotAndRHS)) {
4459 // Not masking anything out for the RHS, move to LHS.
4460 Value *NewLHS = Builder->CreateAnd(Op0LHS, AndRHS,
4461 Op0LHS->getName()+".masked");
4462 return BinaryOperator::Create(Op0I->getOpcode(), NewLHS, Op0RHS);
4466 case Instruction::Add:
4467 // ((A & N) + B) & AndRHS -> (A + B) & AndRHS iff N&AndRHS == AndRHS.
4468 // ((A | N) + B) & AndRHS -> (A + B) & AndRHS iff N&AndRHS == 0
4469 // ((A ^ N) + B) & AndRHS -> (A + B) & AndRHS iff N&AndRHS == 0
4470 if (Value *V = FoldLogicalPlusAnd(Op0LHS, Op0RHS, AndRHS, false, I))
4471 return BinaryOperator::CreateAnd(V, AndRHS);
4472 if (Value *V = FoldLogicalPlusAnd(Op0RHS, Op0LHS, AndRHS, false, I))
4473 return BinaryOperator::CreateAnd(V, AndRHS); // Add commutes
4476 case Instruction::Sub:
4477 // ((A & N) - B) & AndRHS -> (A - B) & AndRHS iff N&AndRHS == AndRHS.
4478 // ((A | N) - B) & AndRHS -> (A - B) & AndRHS iff N&AndRHS == 0
4479 // ((A ^ N) - B) & AndRHS -> (A - B) & AndRHS iff N&AndRHS == 0
4480 if (Value *V = FoldLogicalPlusAnd(Op0LHS, Op0RHS, AndRHS, true, I))
4481 return BinaryOperator::CreateAnd(V, AndRHS);
4483 // (A - N) & AndRHS -> -N & AndRHS iff A&AndRHS==0 and AndRHS
4484 // has 1's for all bits that the subtraction with A might affect.
4485 if (Op0I->hasOneUse()) {
4486 uint32_t BitWidth = AndRHSMask.getBitWidth();
4487 uint32_t Zeros = AndRHSMask.countLeadingZeros();
4488 APInt Mask = APInt::getLowBitsSet(BitWidth, BitWidth - Zeros);
4490 ConstantInt *A = dyn_cast<ConstantInt>(Op0LHS);
4491 if (!(A && A->isZero()) && // avoid infinite recursion.
4492 MaskedValueIsZero(Op0LHS, Mask)) {
4493 Value *NewNeg = Builder->CreateNeg(Op0RHS);
4494 return BinaryOperator::CreateAnd(NewNeg, AndRHS);
4499 case Instruction::Shl:
4500 case Instruction::LShr:
4501 // (1 << x) & 1 --> zext(x == 0)
4502 // (1 >> x) & 1 --> zext(x == 0)
4503 if (AndRHSMask == 1 && Op0LHS == AndRHS) {
4505 Builder->CreateICmpEQ(Op0RHS, Constant::getNullValue(I.getType()));
4506 return new ZExtInst(NewICmp, I.getType());
4511 if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1)))
4512 if (Instruction *Res = OptAndOp(Op0I, Op0CI, AndRHS, I))
4514 } else if (CastInst *CI = dyn_cast<CastInst>(Op0)) {
4515 // If this is an integer truncation or change from signed-to-unsigned, and
4516 // if the source is an and/or with immediate, transform it. This
4517 // frequently occurs for bitfield accesses.
4518 if (Instruction *CastOp = dyn_cast<Instruction>(CI->getOperand(0))) {
4519 if ((isa<TruncInst>(CI) || isa<BitCastInst>(CI)) &&
4520 CastOp->getNumOperands() == 2)
4521 if (ConstantInt *AndCI =dyn_cast<ConstantInt>(CastOp->getOperand(1))){
4522 if (CastOp->getOpcode() == Instruction::And) {
4523 // Change: and (cast (and X, C1) to T), C2
4524 // into : and (cast X to T), trunc_or_bitcast(C1)&C2
4525 // This will fold the two constants together, which may allow
4526 // other simplifications.
4527 Value *NewCast = Builder->CreateTruncOrBitCast(
4528 CastOp->getOperand(0), I.getType(),
4529 CastOp->getName()+".shrunk");
4530 // trunc_or_bitcast(C1)&C2
4531 Constant *C3 = ConstantExpr::getTruncOrBitCast(AndCI,I.getType());
4532 C3 = ConstantExpr::getAnd(C3, AndRHS);
4533 return BinaryOperator::CreateAnd(NewCast, C3);
4534 } else if (CastOp->getOpcode() == Instruction::Or) {
4535 // Change: and (cast (or X, C1) to T), C2
4536 // into : trunc(C1)&C2 iff trunc(C1)&C2 == C2
4537 Constant *C3 = ConstantExpr::getTruncOrBitCast(AndCI,I.getType());
4538 if (ConstantExpr::getAnd(C3, AndRHS) == AndRHS)
4540 return ReplaceInstUsesWith(I, AndRHS);
4546 // Try to fold constant and into select arguments.
4547 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
4548 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
4550 if (isa<PHINode>(Op0))
4551 if (Instruction *NV = FoldOpIntoPhi(I))
4556 // (~A & ~B) == (~(A | B)) - De Morgan's Law
4557 if (Value *Op0NotVal = dyn_castNotVal(Op0))
4558 if (Value *Op1NotVal = dyn_castNotVal(Op1))
4559 if (Op0->hasOneUse() && Op1->hasOneUse()) {
4560 Value *Or = Builder->CreateOr(Op0NotVal, Op1NotVal,
4561 I.getName()+".demorgan");
4562 return BinaryOperator::CreateNot(Or);
4566 Value *A = 0, *B = 0, *C = 0, *D = 0;
4567 // (A|B) & ~(A&B) -> A^B
4568 if (match(Op0, m_Or(m_Value(A), m_Value(B))) &&
4569 match(Op1, m_Not(m_And(m_Value(C), m_Value(D)))) &&
4570 ((A == C && B == D) || (A == D && B == C)))
4571 return BinaryOperator::CreateXor(A, B);
4573 // ~(A&B) & (A|B) -> A^B
4574 if (match(Op1, m_Or(m_Value(A), m_Value(B))) &&
4575 match(Op0, m_Not(m_And(m_Value(C), m_Value(D)))) &&
4576 ((A == C && B == D) || (A == D && B == C)))
4577 return BinaryOperator::CreateXor(A, B);
4579 if (Op0->hasOneUse() &&
4580 match(Op0, m_Xor(m_Value(A), m_Value(B)))) {
4581 if (A == Op1) { // (A^B)&A -> A&(A^B)
4582 I.swapOperands(); // Simplify below
4583 std::swap(Op0, Op1);
4584 } else if (B == Op1) { // (A^B)&B -> B&(B^A)
4585 cast<BinaryOperator>(Op0)->swapOperands();
4586 I.swapOperands(); // Simplify below
4587 std::swap(Op0, Op1);
4591 if (Op1->hasOneUse() &&
4592 match(Op1, m_Xor(m_Value(A), m_Value(B)))) {
4593 if (B == Op0) { // B&(A^B) -> B&(B^A)
4594 cast<BinaryOperator>(Op1)->swapOperands();
4597 if (A == Op0) // A&(A^B) -> A & ~B
4598 return BinaryOperator::CreateAnd(A, Builder->CreateNot(B, "tmp"));
4601 // (A&((~A)|B)) -> A&B
4602 if (match(Op0, m_Or(m_Not(m_Specific(Op1)), m_Value(A))) ||
4603 match(Op0, m_Or(m_Value(A), m_Not(m_Specific(Op1)))))
4604 return BinaryOperator::CreateAnd(A, Op1);
4605 if (match(Op1, m_Or(m_Not(m_Specific(Op0)), m_Value(A))) ||
4606 match(Op1, m_Or(m_Value(A), m_Not(m_Specific(Op0)))))
4607 return BinaryOperator::CreateAnd(A, Op0);
4610 if (ICmpInst *RHS = dyn_cast<ICmpInst>(Op1)) {
4611 // (icmp1 A, B) & (icmp2 A, B) --> (icmp3 A, B)
4612 if (Instruction *R = AssociativeOpt(I, FoldICmpLogical(*this, RHS)))
4615 if (ICmpInst *LHS = dyn_cast<ICmpInst>(Op0))
4616 if (Instruction *Res = FoldAndOfICmps(I, LHS, RHS))
4620 // fold (and (cast A), (cast B)) -> (cast (and A, B))
4621 if (CastInst *Op0C = dyn_cast<CastInst>(Op0))
4622 if (CastInst *Op1C = dyn_cast<CastInst>(Op1))
4623 if (Op0C->getOpcode() == Op1C->getOpcode()) { // same cast kind ?
4624 const Type *SrcTy = Op0C->getOperand(0)->getType();
4625 if (SrcTy == Op1C->getOperand(0)->getType() &&
4626 SrcTy->isIntOrIntVector() &&
4627 // Only do this if the casts both really cause code to be generated.
4628 ValueRequiresCast(Op0C->getOpcode(), Op0C->getOperand(0),
4630 ValueRequiresCast(Op1C->getOpcode(), Op1C->getOperand(0),
4632 Value *NewOp = Builder->CreateAnd(Op0C->getOperand(0),
4633 Op1C->getOperand(0), I.getName());
4634 return CastInst::Create(Op0C->getOpcode(), NewOp, I.getType());
4638 // (X >> Z) & (Y >> Z) -> (X&Y) >> Z for all shifts.
4639 if (BinaryOperator *SI1 = dyn_cast<BinaryOperator>(Op1)) {
4640 if (BinaryOperator *SI0 = dyn_cast<BinaryOperator>(Op0))
4641 if (SI0->isShift() && SI0->getOpcode() == SI1->getOpcode() &&
4642 SI0->getOperand(1) == SI1->getOperand(1) &&
4643 (SI0->hasOneUse() || SI1->hasOneUse())) {
4645 Builder->CreateAnd(SI0->getOperand(0), SI1->getOperand(0),
4647 return BinaryOperator::Create(SI1->getOpcode(), NewOp,
4648 SI1->getOperand(1));
4652 // If and'ing two fcmp, try combine them into one.
4653 if (FCmpInst *LHS = dyn_cast<FCmpInst>(I.getOperand(0))) {
4654 if (FCmpInst *RHS = dyn_cast<FCmpInst>(I.getOperand(1)))
4655 if (Instruction *Res = FoldAndOfFCmps(I, LHS, RHS))
4659 return Changed ? &I : 0;
4662 /// CollectBSwapParts - Analyze the specified subexpression and see if it is
4663 /// capable of providing pieces of a bswap. The subexpression provides pieces
4664 /// of a bswap if it is proven that each of the non-zero bytes in the output of
4665 /// the expression came from the corresponding "byte swapped" byte in some other
4666 /// value. For example, if the current subexpression is "(shl i32 %X, 24)" then
4667 /// we know that the expression deposits the low byte of %X into the high byte
4668 /// of the bswap result and that all other bytes are zero. This expression is
4669 /// accepted, the high byte of ByteValues is set to X to indicate a correct
4672 /// This function returns true if the match was unsuccessful and false if so.
4673 /// On entry to the function the "OverallLeftShift" is a signed integer value
4674 /// indicating the number of bytes that the subexpression is later shifted. For
4675 /// example, if the expression is later right shifted by 16 bits, the
4676 /// OverallLeftShift value would be -2 on entry. This is used to specify which
4677 /// byte of ByteValues is actually being set.
4679 /// Similarly, ByteMask is a bitmask where a bit is clear if its corresponding
4680 /// byte is masked to zero by a user. For example, in (X & 255), X will be
4681 /// processed with a bytemask of 1. Because bytemask is 32-bits, this limits
4682 /// this function to working on up to 32-byte (256 bit) values. ByteMask is
4683 /// always in the local (OverallLeftShift) coordinate space.
4685 static bool CollectBSwapParts(Value *V, int OverallLeftShift, uint32_t ByteMask,
4686 SmallVector<Value*, 8> &ByteValues) {
4687 if (Instruction *I = dyn_cast<Instruction>(V)) {
4688 // If this is an or instruction, it may be an inner node of the bswap.
4689 if (I->getOpcode() == Instruction::Or) {
4690 return CollectBSwapParts(I->getOperand(0), OverallLeftShift, ByteMask,
4692 CollectBSwapParts(I->getOperand(1), OverallLeftShift, ByteMask,
4696 // If this is a logical shift by a constant multiple of 8, recurse with
4697 // OverallLeftShift and ByteMask adjusted.
4698 if (I->isLogicalShift() && isa<ConstantInt>(I->getOperand(1))) {
4700 cast<ConstantInt>(I->getOperand(1))->getLimitedValue(~0U);
4701 // Ensure the shift amount is defined and of a byte value.
4702 if ((ShAmt & 7) || (ShAmt > 8*ByteValues.size()))
4705 unsigned ByteShift = ShAmt >> 3;
4706 if (I->getOpcode() == Instruction::Shl) {
4707 // X << 2 -> collect(X, +2)
4708 OverallLeftShift += ByteShift;
4709 ByteMask >>= ByteShift;
4711 // X >>u 2 -> collect(X, -2)
4712 OverallLeftShift -= ByteShift;
4713 ByteMask <<= ByteShift;
4714 ByteMask &= (~0U >> (32-ByteValues.size()));
4717 if (OverallLeftShift >= (int)ByteValues.size()) return true;
4718 if (OverallLeftShift <= -(int)ByteValues.size()) return true;
4720 return CollectBSwapParts(I->getOperand(0), OverallLeftShift, ByteMask,
4724 // If this is a logical 'and' with a mask that clears bytes, clear the
4725 // corresponding bytes in ByteMask.
4726 if (I->getOpcode() == Instruction::And &&
4727 isa<ConstantInt>(I->getOperand(1))) {
4728 // Scan every byte of the and mask, seeing if the byte is either 0 or 255.
4729 unsigned NumBytes = ByteValues.size();
4730 APInt Byte(I->getType()->getPrimitiveSizeInBits(), 255);
4731 const APInt &AndMask = cast<ConstantInt>(I->getOperand(1))->getValue();
4733 for (unsigned i = 0; i != NumBytes; ++i, Byte <<= 8) {
4734 // If this byte is masked out by a later operation, we don't care what
4736 if ((ByteMask & (1 << i)) == 0)
4739 // If the AndMask is all zeros for this byte, clear the bit.
4740 APInt MaskB = AndMask & Byte;
4742 ByteMask &= ~(1U << i);
4746 // If the AndMask is not all ones for this byte, it's not a bytezap.
4750 // Otherwise, this byte is kept.
4753 return CollectBSwapParts(I->getOperand(0), OverallLeftShift, ByteMask,
4758 // Okay, we got to something that isn't a shift, 'or' or 'and'. This must be
4759 // the input value to the bswap. Some observations: 1) if more than one byte
4760 // is demanded from this input, then it could not be successfully assembled
4761 // into a byteswap. At least one of the two bytes would not be aligned with
4762 // their ultimate destination.
4763 if (!isPowerOf2_32(ByteMask)) return true;
4764 unsigned InputByteNo = CountTrailingZeros_32(ByteMask);
4766 // 2) The input and ultimate destinations must line up: if byte 3 of an i32
4767 // is demanded, it needs to go into byte 0 of the result. This means that the
4768 // byte needs to be shifted until it lands in the right byte bucket. The
4769 // shift amount depends on the position: if the byte is coming from the high
4770 // part of the value (e.g. byte 3) then it must be shifted right. If from the
4771 // low part, it must be shifted left.
4772 unsigned DestByteNo = InputByteNo + OverallLeftShift;
4773 if (InputByteNo < ByteValues.size()/2) {
4774 if (ByteValues.size()-1-DestByteNo != InputByteNo)
4777 if (ByteValues.size()-1-DestByteNo != InputByteNo)
4781 // If the destination byte value is already defined, the values are or'd
4782 // together, which isn't a bswap (unless it's an or of the same bits).
4783 if (ByteValues[DestByteNo] && ByteValues[DestByteNo] != V)
4785 ByteValues[DestByteNo] = V;
4789 /// MatchBSwap - Given an OR instruction, check to see if this is a bswap idiom.
4790 /// If so, insert the new bswap intrinsic and return it.
4791 Instruction *InstCombiner::MatchBSwap(BinaryOperator &I) {
4792 const IntegerType *ITy = dyn_cast<IntegerType>(I.getType());
4793 if (!ITy || ITy->getBitWidth() % 16 ||
4794 // ByteMask only allows up to 32-byte values.
4795 ITy->getBitWidth() > 32*8)
4796 return 0; // Can only bswap pairs of bytes. Can't do vectors.
4798 /// ByteValues - For each byte of the result, we keep track of which value
4799 /// defines each byte.
4800 SmallVector<Value*, 8> ByteValues;
4801 ByteValues.resize(ITy->getBitWidth()/8);
4803 // Try to find all the pieces corresponding to the bswap.
4804 uint32_t ByteMask = ~0U >> (32-ByteValues.size());
4805 if (CollectBSwapParts(&I, 0, ByteMask, ByteValues))
4808 // Check to see if all of the bytes come from the same value.
4809 Value *V = ByteValues[0];
4810 if (V == 0) return 0; // Didn't find a byte? Must be zero.
4812 // Check to make sure that all of the bytes come from the same value.
4813 for (unsigned i = 1, e = ByteValues.size(); i != e; ++i)
4814 if (ByteValues[i] != V)
4816 const Type *Tys[] = { ITy };
4817 Module *M = I.getParent()->getParent()->getParent();
4818 Function *F = Intrinsic::getDeclaration(M, Intrinsic::bswap, Tys, 1);
4819 return CallInst::Create(F, V);
4822 /// MatchSelectFromAndOr - We have an expression of the form (A&C)|(B&D). Check
4823 /// If A is (cond?-1:0) and either B or D is ~(cond?-1,0) or (cond?0,-1), then
4824 /// we can simplify this expression to "cond ? C : D or B".
4825 static Instruction *MatchSelectFromAndOr(Value *A, Value *B,
4827 LLVMContext *Context) {
4828 // If A is not a select of -1/0, this cannot match.
4830 if (!match(A, m_SelectCst<-1, 0>(m_Value(Cond))))
4833 // ((cond?-1:0)&C) | (B&(cond?0:-1)) -> cond ? C : B.
4834 if (match(D, m_SelectCst<0, -1>(m_Specific(Cond))))
4835 return SelectInst::Create(Cond, C, B);
4836 if (match(D, m_Not(m_SelectCst<-1, 0>(m_Specific(Cond)))))
4837 return SelectInst::Create(Cond, C, B);
4838 // ((cond?-1:0)&C) | ((cond?0:-1)&D) -> cond ? C : D.
4839 if (match(B, m_SelectCst<0, -1>(m_Specific(Cond))))
4840 return SelectInst::Create(Cond, C, D);
4841 if (match(B, m_Not(m_SelectCst<-1, 0>(m_Specific(Cond)))))
4842 return SelectInst::Create(Cond, C, D);
4846 /// FoldOrOfICmps - Fold (icmp)|(icmp) if possible.
4847 Instruction *InstCombiner::FoldOrOfICmps(Instruction &I,
4848 ICmpInst *LHS, ICmpInst *RHS) {
4850 ConstantInt *LHSCst, *RHSCst;
4851 ICmpInst::Predicate LHSCC, RHSCC;
4853 // This only handles icmp of constants: (icmp1 A, C1) | (icmp2 B, C2).
4854 if (!match(LHS, m_ICmp(LHSCC, m_Value(Val), m_ConstantInt(LHSCst))) ||
4855 !match(RHS, m_ICmp(RHSCC, m_Value(Val2), m_ConstantInt(RHSCst))))
4859 // (icmp ne A, 0) | (icmp ne B, 0) --> (icmp ne (A|B), 0)
4860 if (LHSCst == RHSCst && LHSCC == RHSCC &&
4861 LHSCC == ICmpInst::ICMP_NE && LHSCst->isZero()) {
4862 Value *NewOr = Builder->CreateOr(Val, Val2);
4863 return new ICmpInst(LHSCC, NewOr, LHSCst);
4866 // From here on, we only handle:
4867 // (icmp1 A, C1) | (icmp2 A, C2) --> something simpler.
4868 if (Val != Val2) return 0;
4870 // ICMP_[US][GL]E X, CST is folded to ICMP_[US][GL]T elsewhere.
4871 if (LHSCC == ICmpInst::ICMP_UGE || LHSCC == ICmpInst::ICMP_ULE ||
4872 RHSCC == ICmpInst::ICMP_UGE || RHSCC == ICmpInst::ICMP_ULE ||
4873 LHSCC == ICmpInst::ICMP_SGE || LHSCC == ICmpInst::ICMP_SLE ||
4874 RHSCC == ICmpInst::ICMP_SGE || RHSCC == ICmpInst::ICMP_SLE)
4877 // We can't fold (ugt x, C) | (sgt x, C2).
4878 if (!PredicatesFoldable(LHSCC, RHSCC))
4881 // Ensure that the larger constant is on the RHS.
4883 if (CmpInst::isSigned(LHSCC) ||
4884 (ICmpInst::isEquality(LHSCC) &&
4885 CmpInst::isSigned(RHSCC)))
4886 ShouldSwap = LHSCst->getValue().sgt(RHSCst->getValue());
4888 ShouldSwap = LHSCst->getValue().ugt(RHSCst->getValue());
4891 std::swap(LHS, RHS);
4892 std::swap(LHSCst, RHSCst);
4893 std::swap(LHSCC, RHSCC);
4896 // At this point, we know we have have two icmp instructions
4897 // comparing a value against two constants and or'ing the result
4898 // together. Because of the above check, we know that we only have
4899 // ICMP_EQ, ICMP_NE, ICMP_LT, and ICMP_GT here. We also know (from the
4900 // FoldICmpLogical check above), that the two constants are not
4902 assert(LHSCst != RHSCst && "Compares not folded above?");
4905 default: llvm_unreachable("Unknown integer condition code!");
4906 case ICmpInst::ICMP_EQ:
4908 default: llvm_unreachable("Unknown integer condition code!");
4909 case ICmpInst::ICMP_EQ:
4910 if (LHSCst == SubOne(RHSCst)) {
4911 // (X == 13 | X == 14) -> X-13 <u 2
4912 Constant *AddCST = ConstantExpr::getNeg(LHSCst);
4913 Value *Add = Builder->CreateAdd(Val, AddCST, Val->getName()+".off");
4914 AddCST = ConstantExpr::getSub(AddOne(RHSCst), LHSCst);
4915 return new ICmpInst(ICmpInst::ICMP_ULT, Add, AddCST);
4917 break; // (X == 13 | X == 15) -> no change
4918 case ICmpInst::ICMP_UGT: // (X == 13 | X u> 14) -> no change
4919 case ICmpInst::ICMP_SGT: // (X == 13 | X s> 14) -> no change
4921 case ICmpInst::ICMP_NE: // (X == 13 | X != 15) -> X != 15
4922 case ICmpInst::ICMP_ULT: // (X == 13 | X u< 15) -> X u< 15
4923 case ICmpInst::ICMP_SLT: // (X == 13 | X s< 15) -> X s< 15
4924 return ReplaceInstUsesWith(I, RHS);
4927 case ICmpInst::ICMP_NE:
4929 default: llvm_unreachable("Unknown integer condition code!");
4930 case ICmpInst::ICMP_EQ: // (X != 13 | X == 15) -> X != 13
4931 case ICmpInst::ICMP_UGT: // (X != 13 | X u> 15) -> X != 13
4932 case ICmpInst::ICMP_SGT: // (X != 13 | X s> 15) -> X != 13
4933 return ReplaceInstUsesWith(I, LHS);
4934 case ICmpInst::ICMP_NE: // (X != 13 | X != 15) -> true
4935 case ICmpInst::ICMP_ULT: // (X != 13 | X u< 15) -> true
4936 case ICmpInst::ICMP_SLT: // (X != 13 | X s< 15) -> true
4937 return ReplaceInstUsesWith(I, ConstantInt::getTrue(*Context));
4940 case ICmpInst::ICMP_ULT:
4942 default: llvm_unreachable("Unknown integer condition code!");
4943 case ICmpInst::ICMP_EQ: // (X u< 13 | X == 14) -> no change
4945 case ICmpInst::ICMP_UGT: // (X u< 13 | X u> 15) -> (X-13) u> 2
4946 // If RHSCst is [us]MAXINT, it is always false. Not handling
4947 // this can cause overflow.
4948 if (RHSCst->isMaxValue(false))
4949 return ReplaceInstUsesWith(I, LHS);
4950 return InsertRangeTest(Val, LHSCst, AddOne(RHSCst),
4952 case ICmpInst::ICMP_SGT: // (X u< 13 | X s> 15) -> no change
4954 case ICmpInst::ICMP_NE: // (X u< 13 | X != 15) -> X != 15
4955 case ICmpInst::ICMP_ULT: // (X u< 13 | X u< 15) -> X u< 15
4956 return ReplaceInstUsesWith(I, RHS);
4957 case ICmpInst::ICMP_SLT: // (X u< 13 | X s< 15) -> no change
4961 case ICmpInst::ICMP_SLT:
4963 default: llvm_unreachable("Unknown integer condition code!");
4964 case ICmpInst::ICMP_EQ: // (X s< 13 | X == 14) -> no change
4966 case ICmpInst::ICMP_SGT: // (X s< 13 | X s> 15) -> (X-13) s> 2
4967 // If RHSCst is [us]MAXINT, it is always false. Not handling
4968 // this can cause overflow.
4969 if (RHSCst->isMaxValue(true))
4970 return ReplaceInstUsesWith(I, LHS);
4971 return InsertRangeTest(Val, LHSCst, AddOne(RHSCst),
4973 case ICmpInst::ICMP_UGT: // (X s< 13 | X u> 15) -> no change
4975 case ICmpInst::ICMP_NE: // (X s< 13 | X != 15) -> X != 15
4976 case ICmpInst::ICMP_SLT: // (X s< 13 | X s< 15) -> X s< 15
4977 return ReplaceInstUsesWith(I, RHS);
4978 case ICmpInst::ICMP_ULT: // (X s< 13 | X u< 15) -> no change
4982 case ICmpInst::ICMP_UGT:
4984 default: llvm_unreachable("Unknown integer condition code!");
4985 case ICmpInst::ICMP_EQ: // (X u> 13 | X == 15) -> X u> 13
4986 case ICmpInst::ICMP_UGT: // (X u> 13 | X u> 15) -> X u> 13
4987 return ReplaceInstUsesWith(I, LHS);
4988 case ICmpInst::ICMP_SGT: // (X u> 13 | X s> 15) -> no change
4990 case ICmpInst::ICMP_NE: // (X u> 13 | X != 15) -> true
4991 case ICmpInst::ICMP_ULT: // (X u> 13 | X u< 15) -> true
4992 return ReplaceInstUsesWith(I, ConstantInt::getTrue(*Context));
4993 case ICmpInst::ICMP_SLT: // (X u> 13 | X s< 15) -> no change
4997 case ICmpInst::ICMP_SGT:
4999 default: llvm_unreachable("Unknown integer condition code!");
5000 case ICmpInst::ICMP_EQ: // (X s> 13 | X == 15) -> X > 13
5001 case ICmpInst::ICMP_SGT: // (X s> 13 | X s> 15) -> X > 13
5002 return ReplaceInstUsesWith(I, LHS);
5003 case ICmpInst::ICMP_UGT: // (X s> 13 | X u> 15) -> no change
5005 case ICmpInst::ICMP_NE: // (X s> 13 | X != 15) -> true
5006 case ICmpInst::ICMP_SLT: // (X s> 13 | X s< 15) -> true
5007 return ReplaceInstUsesWith(I, ConstantInt::getTrue(*Context));
5008 case ICmpInst::ICMP_ULT: // (X s> 13 | X u< 15) -> no change
5016 Instruction *InstCombiner::FoldOrOfFCmps(Instruction &I, FCmpInst *LHS,
5018 if (LHS->getPredicate() == FCmpInst::FCMP_UNO &&
5019 RHS->getPredicate() == FCmpInst::FCMP_UNO &&
5020 LHS->getOperand(0)->getType() == RHS->getOperand(0)->getType()) {
5021 if (ConstantFP *LHSC = dyn_cast<ConstantFP>(LHS->getOperand(1)))
5022 if (ConstantFP *RHSC = dyn_cast<ConstantFP>(RHS->getOperand(1))) {
5023 // If either of the constants are nans, then the whole thing returns
5025 if (LHSC->getValueAPF().isNaN() || RHSC->getValueAPF().isNaN())
5026 return ReplaceInstUsesWith(I, ConstantInt::getTrue(*Context));
5028 // Otherwise, no need to compare the two constants, compare the
5030 return new FCmpInst(FCmpInst::FCMP_UNO,
5031 LHS->getOperand(0), RHS->getOperand(0));
5034 // Handle vector zeros. This occurs because the canonical form of
5035 // "fcmp uno x,x" is "fcmp uno x, 0".
5036 if (isa<ConstantAggregateZero>(LHS->getOperand(1)) &&
5037 isa<ConstantAggregateZero>(RHS->getOperand(1)))
5038 return new FCmpInst(FCmpInst::FCMP_UNO,
5039 LHS->getOperand(0), RHS->getOperand(0));
5044 Value *Op0LHS = LHS->getOperand(0), *Op0RHS = LHS->getOperand(1);
5045 Value *Op1LHS = RHS->getOperand(0), *Op1RHS = RHS->getOperand(1);
5046 FCmpInst::Predicate Op0CC = LHS->getPredicate(), Op1CC = RHS->getPredicate();
5048 if (Op0LHS == Op1RHS && Op0RHS == Op1LHS) {
5049 // Swap RHS operands to match LHS.
5050 Op1CC = FCmpInst::getSwappedPredicate(Op1CC);
5051 std::swap(Op1LHS, Op1RHS);
5053 if (Op0LHS == Op1LHS && Op0RHS == Op1RHS) {
5054 // Simplify (fcmp cc0 x, y) | (fcmp cc1 x, y).
5056 return new FCmpInst((FCmpInst::Predicate)Op0CC,
5058 if (Op0CC == FCmpInst::FCMP_TRUE || Op1CC == FCmpInst::FCMP_TRUE)
5059 return ReplaceInstUsesWith(I, ConstantInt::getTrue(*Context));
5060 if (Op0CC == FCmpInst::FCMP_FALSE)
5061 return ReplaceInstUsesWith(I, RHS);
5062 if (Op1CC == FCmpInst::FCMP_FALSE)
5063 return ReplaceInstUsesWith(I, LHS);
5066 unsigned Op0Pred = getFCmpCode(Op0CC, Op0Ordered);
5067 unsigned Op1Pred = getFCmpCode(Op1CC, Op1Ordered);
5068 if (Op0Ordered == Op1Ordered) {
5069 // If both are ordered or unordered, return a new fcmp with
5070 // or'ed predicates.
5071 Value *RV = getFCmpValue(Op0Ordered, Op0Pred|Op1Pred,
5072 Op0LHS, Op0RHS, Context);
5073 if (Instruction *I = dyn_cast<Instruction>(RV))
5075 // Otherwise, it's a constant boolean value...
5076 return ReplaceInstUsesWith(I, RV);
5082 /// FoldOrWithConstants - This helper function folds:
5084 /// ((A | B) & C1) | (B & C2)
5090 /// when the XOR of the two constants is "all ones" (-1).
5091 Instruction *InstCombiner::FoldOrWithConstants(BinaryOperator &I, Value *Op,
5092 Value *A, Value *B, Value *C) {
5093 ConstantInt *CI1 = dyn_cast<ConstantInt>(C);
5097 ConstantInt *CI2 = 0;
5098 if (!match(Op, m_And(m_Value(V1), m_ConstantInt(CI2)))) return 0;
5100 APInt Xor = CI1->getValue() ^ CI2->getValue();
5101 if (!Xor.isAllOnesValue()) return 0;
5103 if (V1 == A || V1 == B) {
5104 Value *NewOp = Builder->CreateAnd((V1 == A) ? B : A, CI1);
5105 return BinaryOperator::CreateOr(NewOp, V1);
5111 Instruction *InstCombiner::visitOr(BinaryOperator &I) {
5112 bool Changed = SimplifyCommutative(I);
5113 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
5115 if (Value *V = SimplifyOrInst(Op0, Op1, TD))
5116 return ReplaceInstUsesWith(I, V);
5119 // See if we can simplify any instructions used by the instruction whose sole
5120 // purpose is to compute bits we don't care about.
5121 if (SimplifyDemandedInstructionBits(I))
5124 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
5125 ConstantInt *C1 = 0; Value *X = 0;
5126 // (X & C1) | C2 --> (X | C2) & (C1|C2)
5127 if (match(Op0, m_And(m_Value(X), m_ConstantInt(C1))) &&
5129 Value *Or = Builder->CreateOr(X, RHS);
5131 return BinaryOperator::CreateAnd(Or,
5132 ConstantInt::get(*Context, RHS->getValue() | C1->getValue()));
5135 // (X ^ C1) | C2 --> (X | C2) ^ (C1&~C2)
5136 if (match(Op0, m_Xor(m_Value(X), m_ConstantInt(C1))) &&
5138 Value *Or = Builder->CreateOr(X, RHS);
5140 return BinaryOperator::CreateXor(Or,
5141 ConstantInt::get(*Context, C1->getValue() & ~RHS->getValue()));
5144 // Try to fold constant and into select arguments.
5145 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
5146 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
5148 if (isa<PHINode>(Op0))
5149 if (Instruction *NV = FoldOpIntoPhi(I))
5153 Value *A = 0, *B = 0;
5154 ConstantInt *C1 = 0, *C2 = 0;
5156 // (A | B) | C and A | (B | C) -> bswap if possible.
5157 // (A >> B) | (C << D) and (A << B) | (B >> C) -> bswap if possible.
5158 if (match(Op0, m_Or(m_Value(), m_Value())) ||
5159 match(Op1, m_Or(m_Value(), m_Value())) ||
5160 (match(Op0, m_Shift(m_Value(), m_Value())) &&
5161 match(Op1, m_Shift(m_Value(), m_Value())))) {
5162 if (Instruction *BSwap = MatchBSwap(I))
5166 // (X^C)|Y -> (X|Y)^C iff Y&C == 0
5167 if (Op0->hasOneUse() &&
5168 match(Op0, m_Xor(m_Value(A), m_ConstantInt(C1))) &&
5169 MaskedValueIsZero(Op1, C1->getValue())) {
5170 Value *NOr = Builder->CreateOr(A, Op1);
5172 return BinaryOperator::CreateXor(NOr, C1);
5175 // Y|(X^C) -> (X|Y)^C iff Y&C == 0
5176 if (Op1->hasOneUse() &&
5177 match(Op1, m_Xor(m_Value(A), m_ConstantInt(C1))) &&
5178 MaskedValueIsZero(Op0, C1->getValue())) {
5179 Value *NOr = Builder->CreateOr(A, Op0);
5181 return BinaryOperator::CreateXor(NOr, C1);
5185 Value *C = 0, *D = 0;
5186 if (match(Op0, m_And(m_Value(A), m_Value(C))) &&
5187 match(Op1, m_And(m_Value(B), m_Value(D)))) {
5188 Value *V1 = 0, *V2 = 0, *V3 = 0;
5189 C1 = dyn_cast<ConstantInt>(C);
5190 C2 = dyn_cast<ConstantInt>(D);
5191 if (C1 && C2) { // (A & C1)|(B & C2)
5192 // If we have: ((V + N) & C1) | (V & C2)
5193 // .. and C2 = ~C1 and C2 is 0+1+ and (N & C2) == 0
5194 // replace with V+N.
5195 if (C1->getValue() == ~C2->getValue()) {
5196 if ((C2->getValue() & (C2->getValue()+1)) == 0 && // C2 == 0+1+
5197 match(A, m_Add(m_Value(V1), m_Value(V2)))) {
5198 // Add commutes, try both ways.
5199 if (V1 == B && MaskedValueIsZero(V2, C2->getValue()))
5200 return ReplaceInstUsesWith(I, A);
5201 if (V2 == B && MaskedValueIsZero(V1, C2->getValue()))
5202 return ReplaceInstUsesWith(I, A);
5204 // Or commutes, try both ways.
5205 if ((C1->getValue() & (C1->getValue()+1)) == 0 &&
5206 match(B, m_Add(m_Value(V1), m_Value(V2)))) {
5207 // Add commutes, try both ways.
5208 if (V1 == A && MaskedValueIsZero(V2, C1->getValue()))
5209 return ReplaceInstUsesWith(I, B);
5210 if (V2 == A && MaskedValueIsZero(V1, C1->getValue()))
5211 return ReplaceInstUsesWith(I, B);
5214 V1 = 0; V2 = 0; V3 = 0;
5217 // Check to see if we have any common things being and'ed. If so, find the
5218 // terms for V1 & (V2|V3).
5219 if (isOnlyUse(Op0) || isOnlyUse(Op1)) {
5220 if (A == B) // (A & C)|(A & D) == A & (C|D)
5221 V1 = A, V2 = C, V3 = D;
5222 else if (A == D) // (A & C)|(B & A) == A & (B|C)
5223 V1 = A, V2 = B, V3 = C;
5224 else if (C == B) // (A & C)|(C & D) == C & (A|D)
5225 V1 = C, V2 = A, V3 = D;
5226 else if (C == D) // (A & C)|(B & C) == C & (A|B)
5227 V1 = C, V2 = A, V3 = B;
5230 Value *Or = Builder->CreateOr(V2, V3, "tmp");
5231 return BinaryOperator::CreateAnd(V1, Or);
5235 // (A & (C0?-1:0)) | (B & ~(C0?-1:0)) -> C0 ? A : B, and commuted variants
5236 if (Instruction *Match = MatchSelectFromAndOr(A, B, C, D, Context))
5238 if (Instruction *Match = MatchSelectFromAndOr(B, A, D, C, Context))
5240 if (Instruction *Match = MatchSelectFromAndOr(C, B, A, D, Context))
5242 if (Instruction *Match = MatchSelectFromAndOr(D, A, B, C, Context))
5245 // ((A&~B)|(~A&B)) -> A^B
5246 if ((match(C, m_Not(m_Specific(D))) &&
5247 match(B, m_Not(m_Specific(A)))))
5248 return BinaryOperator::CreateXor(A, D);
5249 // ((~B&A)|(~A&B)) -> A^B
5250 if ((match(A, m_Not(m_Specific(D))) &&
5251 match(B, m_Not(m_Specific(C)))))
5252 return BinaryOperator::CreateXor(C, D);
5253 // ((A&~B)|(B&~A)) -> A^B
5254 if ((match(C, m_Not(m_Specific(B))) &&
5255 match(D, m_Not(m_Specific(A)))))
5256 return BinaryOperator::CreateXor(A, B);
5257 // ((~B&A)|(B&~A)) -> A^B
5258 if ((match(A, m_Not(m_Specific(B))) &&
5259 match(D, m_Not(m_Specific(C)))))
5260 return BinaryOperator::CreateXor(C, B);
5263 // (X >> Z) | (Y >> Z) -> (X|Y) >> Z for all shifts.
5264 if (BinaryOperator *SI1 = dyn_cast<BinaryOperator>(Op1)) {
5265 if (BinaryOperator *SI0 = dyn_cast<BinaryOperator>(Op0))
5266 if (SI0->isShift() && SI0->getOpcode() == SI1->getOpcode() &&
5267 SI0->getOperand(1) == SI1->getOperand(1) &&
5268 (SI0->hasOneUse() || SI1->hasOneUse())) {
5269 Value *NewOp = Builder->CreateOr(SI0->getOperand(0), SI1->getOperand(0),
5271 return BinaryOperator::Create(SI1->getOpcode(), NewOp,
5272 SI1->getOperand(1));
5276 // ((A|B)&1)|(B&-2) -> (A&1) | B
5277 if (match(Op0, m_And(m_Or(m_Value(A), m_Value(B)), m_Value(C))) ||
5278 match(Op0, m_And(m_Value(C), m_Or(m_Value(A), m_Value(B))))) {
5279 Instruction *Ret = FoldOrWithConstants(I, Op1, A, B, C);
5280 if (Ret) return Ret;
5282 // (B&-2)|((A|B)&1) -> (A&1) | B
5283 if (match(Op1, m_And(m_Or(m_Value(A), m_Value(B)), m_Value(C))) ||
5284 match(Op1, m_And(m_Value(C), m_Or(m_Value(A), m_Value(B))))) {
5285 Instruction *Ret = FoldOrWithConstants(I, Op0, A, B, C);
5286 if (Ret) return Ret;
5289 // (~A | ~B) == (~(A & B)) - De Morgan's Law
5290 if (Value *Op0NotVal = dyn_castNotVal(Op0))
5291 if (Value *Op1NotVal = dyn_castNotVal(Op1))
5292 if (Op0->hasOneUse() && Op1->hasOneUse()) {
5293 Value *And = Builder->CreateAnd(Op0NotVal, Op1NotVal,
5294 I.getName()+".demorgan");
5295 return BinaryOperator::CreateNot(And);
5298 // (icmp1 A, B) | (icmp2 A, B) --> (icmp3 A, B)
5299 if (ICmpInst *RHS = dyn_cast<ICmpInst>(I.getOperand(1))) {
5300 if (Instruction *R = AssociativeOpt(I, FoldICmpLogical(*this, RHS)))
5303 if (ICmpInst *LHS = dyn_cast<ICmpInst>(I.getOperand(0)))
5304 if (Instruction *Res = FoldOrOfICmps(I, LHS, RHS))
5308 // fold (or (cast A), (cast B)) -> (cast (or A, B))
5309 if (CastInst *Op0C = dyn_cast<CastInst>(Op0)) {
5310 if (CastInst *Op1C = dyn_cast<CastInst>(Op1))
5311 if (Op0C->getOpcode() == Op1C->getOpcode()) {// same cast kind ?
5312 if (!isa<ICmpInst>(Op0C->getOperand(0)) ||
5313 !isa<ICmpInst>(Op1C->getOperand(0))) {
5314 const Type *SrcTy = Op0C->getOperand(0)->getType();
5315 if (SrcTy == Op1C->getOperand(0)->getType() &&
5316 SrcTy->isIntOrIntVector() &&
5317 // Only do this if the casts both really cause code to be
5319 ValueRequiresCast(Op0C->getOpcode(), Op0C->getOperand(0),
5321 ValueRequiresCast(Op1C->getOpcode(), Op1C->getOperand(0),
5323 Value *NewOp = Builder->CreateOr(Op0C->getOperand(0),
5324 Op1C->getOperand(0), I.getName());
5325 return CastInst::Create(Op0C->getOpcode(), NewOp, I.getType());
5332 // (fcmp uno x, c) | (fcmp uno y, c) -> (fcmp uno x, y)
5333 if (FCmpInst *LHS = dyn_cast<FCmpInst>(I.getOperand(0))) {
5334 if (FCmpInst *RHS = dyn_cast<FCmpInst>(I.getOperand(1)))
5335 if (Instruction *Res = FoldOrOfFCmps(I, LHS, RHS))
5339 return Changed ? &I : 0;
5344 // XorSelf - Implements: X ^ X --> 0
5347 XorSelf(Value *rhs) : RHS(rhs) {}
5348 bool shouldApply(Value *LHS) const { return LHS == RHS; }
5349 Instruction *apply(BinaryOperator &Xor) const {
5356 Instruction *InstCombiner::visitXor(BinaryOperator &I) {
5357 bool Changed = SimplifyCommutative(I);
5358 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
5360 if (isa<UndefValue>(Op1)) {
5361 if (isa<UndefValue>(Op0))
5362 // Handle undef ^ undef -> 0 special case. This is a common
5364 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
5365 return ReplaceInstUsesWith(I, Op1); // X ^ undef -> undef
5368 // xor X, X = 0, even if X is nested in a sequence of Xor's.
5369 if (Instruction *Result = AssociativeOpt(I, XorSelf(Op1))) {
5370 assert(Result == &I && "AssociativeOpt didn't work?"); Result=Result;
5371 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
5374 // See if we can simplify any instructions used by the instruction whose sole
5375 // purpose is to compute bits we don't care about.
5376 if (SimplifyDemandedInstructionBits(I))
5378 if (isa<VectorType>(I.getType()))
5379 if (isa<ConstantAggregateZero>(Op1))
5380 return ReplaceInstUsesWith(I, Op0); // X ^ <0,0> -> X
5382 // Is this a ~ operation?
5383 if (Value *NotOp = dyn_castNotVal(&I)) {
5384 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(NotOp)) {
5385 if (Op0I->getOpcode() == Instruction::And ||
5386 Op0I->getOpcode() == Instruction::Or) {
5387 // ~(~X & Y) --> (X | ~Y) - De Morgan's Law
5388 // ~(~X | Y) === (X & ~Y) - De Morgan's Law
5389 if (dyn_castNotVal(Op0I->getOperand(1)))
5390 Op0I->swapOperands();
5391 if (Value *Op0NotVal = dyn_castNotVal(Op0I->getOperand(0))) {
5393 Builder->CreateNot(Op0I->getOperand(1),
5394 Op0I->getOperand(1)->getName()+".not");
5395 if (Op0I->getOpcode() == Instruction::And)
5396 return BinaryOperator::CreateOr(Op0NotVal, NotY);
5397 return BinaryOperator::CreateAnd(Op0NotVal, NotY);
5400 // ~(X & Y) --> (~X | ~Y) - De Morgan's Law
5401 // ~(X | Y) === (~X & ~Y) - De Morgan's Law
5402 if (isFreeToInvert(Op0I->getOperand(0)) &&
5403 isFreeToInvert(Op0I->getOperand(1))) {
5405 Builder->CreateNot(Op0I->getOperand(0), "notlhs");
5407 Builder->CreateNot(Op0I->getOperand(1), "notrhs");
5408 if (Op0I->getOpcode() == Instruction::And)
5409 return BinaryOperator::CreateOr(NotX, NotY);
5410 return BinaryOperator::CreateAnd(NotX, NotY);
5417 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
5418 if (RHS->isOne() && Op0->hasOneUse()) {
5419 // xor (cmp A, B), true = not (cmp A, B) = !cmp A, B
5420 if (ICmpInst *ICI = dyn_cast<ICmpInst>(Op0))
5421 return new ICmpInst(ICI->getInversePredicate(),
5422 ICI->getOperand(0), ICI->getOperand(1));
5424 if (FCmpInst *FCI = dyn_cast<FCmpInst>(Op0))
5425 return new FCmpInst(FCI->getInversePredicate(),
5426 FCI->getOperand(0), FCI->getOperand(1));
5429 // fold (xor(zext(cmp)), 1) and (xor(sext(cmp)), -1) to ext(!cmp).
5430 if (CastInst *Op0C = dyn_cast<CastInst>(Op0)) {
5431 if (CmpInst *CI = dyn_cast<CmpInst>(Op0C->getOperand(0))) {
5432 if (CI->hasOneUse() && Op0C->hasOneUse()) {
5433 Instruction::CastOps Opcode = Op0C->getOpcode();
5434 if ((Opcode == Instruction::ZExt || Opcode == Instruction::SExt) &&
5435 (RHS == ConstantExpr::getCast(Opcode,
5436 ConstantInt::getTrue(*Context),
5437 Op0C->getDestTy()))) {
5438 CI->setPredicate(CI->getInversePredicate());
5439 return CastInst::Create(Opcode, CI, Op0C->getType());
5445 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0)) {
5446 // ~(c-X) == X-c-1 == X+(-c-1)
5447 if (Op0I->getOpcode() == Instruction::Sub && RHS->isAllOnesValue())
5448 if (Constant *Op0I0C = dyn_cast<Constant>(Op0I->getOperand(0))) {
5449 Constant *NegOp0I0C = ConstantExpr::getNeg(Op0I0C);
5450 Constant *ConstantRHS = ConstantExpr::getSub(NegOp0I0C,
5451 ConstantInt::get(I.getType(), 1));
5452 return BinaryOperator::CreateAdd(Op0I->getOperand(1), ConstantRHS);
5455 if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1))) {
5456 if (Op0I->getOpcode() == Instruction::Add) {
5457 // ~(X-c) --> (-c-1)-X
5458 if (RHS->isAllOnesValue()) {
5459 Constant *NegOp0CI = ConstantExpr::getNeg(Op0CI);
5460 return BinaryOperator::CreateSub(
5461 ConstantExpr::getSub(NegOp0CI,
5462 ConstantInt::get(I.getType(), 1)),
5463 Op0I->getOperand(0));
5464 } else if (RHS->getValue().isSignBit()) {
5465 // (X + C) ^ signbit -> (X + C + signbit)
5466 Constant *C = ConstantInt::get(*Context,
5467 RHS->getValue() + Op0CI->getValue());
5468 return BinaryOperator::CreateAdd(Op0I->getOperand(0), C);
5471 } else if (Op0I->getOpcode() == Instruction::Or) {
5472 // (X|C1)^C2 -> X^(C1|C2) iff X&~C1 == 0
5473 if (MaskedValueIsZero(Op0I->getOperand(0), Op0CI->getValue())) {
5474 Constant *NewRHS = ConstantExpr::getOr(Op0CI, RHS);
5475 // Anything in both C1 and C2 is known to be zero, remove it from
5477 Constant *CommonBits = ConstantExpr::getAnd(Op0CI, RHS);
5478 NewRHS = ConstantExpr::getAnd(NewRHS,
5479 ConstantExpr::getNot(CommonBits));
5481 I.setOperand(0, Op0I->getOperand(0));
5482 I.setOperand(1, NewRHS);
5489 // Try to fold constant and into select arguments.
5490 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
5491 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
5493 if (isa<PHINode>(Op0))
5494 if (Instruction *NV = FoldOpIntoPhi(I))
5498 if (Value *X = dyn_castNotVal(Op0)) // ~A ^ A == -1
5500 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
5502 if (Value *X = dyn_castNotVal(Op1)) // A ^ ~A == -1
5504 return ReplaceInstUsesWith(I, Constant::getAllOnesValue(I.getType()));
5507 BinaryOperator *Op1I = dyn_cast<BinaryOperator>(Op1);
5510 if (match(Op1I, m_Or(m_Value(A), m_Value(B)))) {
5511 if (A == Op0) { // B^(B|A) == (A|B)^B
5512 Op1I->swapOperands();
5514 std::swap(Op0, Op1);
5515 } else if (B == Op0) { // B^(A|B) == (A|B)^B
5516 I.swapOperands(); // Simplified below.
5517 std::swap(Op0, Op1);
5519 } else if (match(Op1I, m_Xor(m_Specific(Op0), m_Value(B)))) {
5520 return ReplaceInstUsesWith(I, B); // A^(A^B) == B
5521 } else if (match(Op1I, m_Xor(m_Value(A), m_Specific(Op0)))) {
5522 return ReplaceInstUsesWith(I, A); // A^(B^A) == B
5523 } else if (match(Op1I, m_And(m_Value(A), m_Value(B))) &&
5525 if (A == Op0) { // A^(A&B) -> A^(B&A)
5526 Op1I->swapOperands();
5529 if (B == Op0) { // A^(B&A) -> (B&A)^A
5530 I.swapOperands(); // Simplified below.
5531 std::swap(Op0, Op1);
5536 BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0);
5539 if (match(Op0I, m_Or(m_Value(A), m_Value(B))) &&
5540 Op0I->hasOneUse()) {
5541 if (A == Op1) // (B|A)^B == (A|B)^B
5543 if (B == Op1) // (A|B)^B == A & ~B
5544 return BinaryOperator::CreateAnd(A, Builder->CreateNot(Op1, "tmp"));
5545 } else if (match(Op0I, m_Xor(m_Specific(Op1), m_Value(B)))) {
5546 return ReplaceInstUsesWith(I, B); // (A^B)^A == B
5547 } else if (match(Op0I, m_Xor(m_Value(A), m_Specific(Op1)))) {
5548 return ReplaceInstUsesWith(I, A); // (B^A)^A == B
5549 } else if (match(Op0I, m_And(m_Value(A), m_Value(B))) &&
5551 if (A == Op1) // (A&B)^A -> (B&A)^A
5553 if (B == Op1 && // (B&A)^A == ~B & A
5554 !isa<ConstantInt>(Op1)) { // Canonical form is (B&C)^C
5555 return BinaryOperator::CreateAnd(Builder->CreateNot(A, "tmp"), Op1);
5560 // (X >> Z) ^ (Y >> Z) -> (X^Y) >> Z for all shifts.
5561 if (Op0I && Op1I && Op0I->isShift() &&
5562 Op0I->getOpcode() == Op1I->getOpcode() &&
5563 Op0I->getOperand(1) == Op1I->getOperand(1) &&
5564 (Op1I->hasOneUse() || Op1I->hasOneUse())) {
5566 Builder->CreateXor(Op0I->getOperand(0), Op1I->getOperand(0),
5568 return BinaryOperator::Create(Op1I->getOpcode(), NewOp,
5569 Op1I->getOperand(1));
5573 Value *A, *B, *C, *D;
5574 // (A & B)^(A | B) -> A ^ B
5575 if (match(Op0I, m_And(m_Value(A), m_Value(B))) &&
5576 match(Op1I, m_Or(m_Value(C), m_Value(D)))) {
5577 if ((A == C && B == D) || (A == D && B == C))
5578 return BinaryOperator::CreateXor(A, B);
5580 // (A | B)^(A & B) -> A ^ B
5581 if (match(Op0I, m_Or(m_Value(A), m_Value(B))) &&
5582 match(Op1I, m_And(m_Value(C), m_Value(D)))) {
5583 if ((A == C && B == D) || (A == D && B == C))
5584 return BinaryOperator::CreateXor(A, B);
5588 if ((Op0I->hasOneUse() || Op1I->hasOneUse()) &&
5589 match(Op0I, m_And(m_Value(A), m_Value(B))) &&
5590 match(Op1I, m_And(m_Value(C), m_Value(D)))) {
5591 // (X & Y)^(X & Y) -> (Y^Z) & X
5592 Value *X = 0, *Y = 0, *Z = 0;
5594 X = A, Y = B, Z = D;
5596 X = A, Y = B, Z = C;
5598 X = B, Y = A, Z = D;
5600 X = B, Y = A, Z = C;
5603 Value *NewOp = Builder->CreateXor(Y, Z, Op0->getName());
5604 return BinaryOperator::CreateAnd(NewOp, X);
5609 // (icmp1 A, B) ^ (icmp2 A, B) --> (icmp3 A, B)
5610 if (ICmpInst *RHS = dyn_cast<ICmpInst>(I.getOperand(1)))
5611 if (Instruction *R = AssociativeOpt(I, FoldICmpLogical(*this, RHS)))
5614 // fold (xor (cast A), (cast B)) -> (cast (xor A, B))
5615 if (CastInst *Op0C = dyn_cast<CastInst>(Op0)) {
5616 if (CastInst *Op1C = dyn_cast<CastInst>(Op1))
5617 if (Op0C->getOpcode() == Op1C->getOpcode()) { // same cast kind?
5618 const Type *SrcTy = Op0C->getOperand(0)->getType();
5619 if (SrcTy == Op1C->getOperand(0)->getType() && SrcTy->isInteger() &&
5620 // Only do this if the casts both really cause code to be generated.
5621 ValueRequiresCast(Op0C->getOpcode(), Op0C->getOperand(0),
5623 ValueRequiresCast(Op1C->getOpcode(), Op1C->getOperand(0),
5625 Value *NewOp = Builder->CreateXor(Op0C->getOperand(0),
5626 Op1C->getOperand(0), I.getName());
5627 return CastInst::Create(Op0C->getOpcode(), NewOp, I.getType());
5632 return Changed ? &I : 0;
5635 static ConstantInt *ExtractElement(Constant *V, Constant *Idx,
5636 LLVMContext *Context) {
5637 return cast<ConstantInt>(ConstantExpr::getExtractElement(V, Idx));
5640 static bool HasAddOverflow(ConstantInt *Result,
5641 ConstantInt *In1, ConstantInt *In2,
5644 if (In2->getValue().isNegative())
5645 return Result->getValue().sgt(In1->getValue());
5647 return Result->getValue().slt(In1->getValue());
5649 return Result->getValue().ult(In1->getValue());
5652 /// AddWithOverflow - Compute Result = In1+In2, returning true if the result
5653 /// overflowed for this type.
5654 static bool AddWithOverflow(Constant *&Result, Constant *In1,
5655 Constant *In2, LLVMContext *Context,
5656 bool IsSigned = false) {
5657 Result = ConstantExpr::getAdd(In1, In2);
5659 if (const VectorType *VTy = dyn_cast<VectorType>(In1->getType())) {
5660 for (unsigned i = 0, e = VTy->getNumElements(); i != e; ++i) {
5661 Constant *Idx = ConstantInt::get(Type::getInt32Ty(*Context), i);
5662 if (HasAddOverflow(ExtractElement(Result, Idx, Context),
5663 ExtractElement(In1, Idx, Context),
5664 ExtractElement(In2, Idx, Context),
5671 return HasAddOverflow(cast<ConstantInt>(Result),
5672 cast<ConstantInt>(In1), cast<ConstantInt>(In2),
5676 static bool HasSubOverflow(ConstantInt *Result,
5677 ConstantInt *In1, ConstantInt *In2,
5680 if (In2->getValue().isNegative())
5681 return Result->getValue().slt(In1->getValue());
5683 return Result->getValue().sgt(In1->getValue());
5685 return Result->getValue().ugt(In1->getValue());
5688 /// SubWithOverflow - Compute Result = In1-In2, returning true if the result
5689 /// overflowed for this type.
5690 static bool SubWithOverflow(Constant *&Result, Constant *In1,
5691 Constant *In2, LLVMContext *Context,
5692 bool IsSigned = false) {
5693 Result = ConstantExpr::getSub(In1, In2);
5695 if (const VectorType *VTy = dyn_cast<VectorType>(In1->getType())) {
5696 for (unsigned i = 0, e = VTy->getNumElements(); i != e; ++i) {
5697 Constant *Idx = ConstantInt::get(Type::getInt32Ty(*Context), i);
5698 if (HasSubOverflow(ExtractElement(Result, Idx, Context),
5699 ExtractElement(In1, Idx, Context),
5700 ExtractElement(In2, Idx, Context),
5707 return HasSubOverflow(cast<ConstantInt>(Result),
5708 cast<ConstantInt>(In1), cast<ConstantInt>(In2),
5713 /// FoldGEPICmp - Fold comparisons between a GEP instruction and something
5714 /// else. At this point we know that the GEP is on the LHS of the comparison.
5715 Instruction *InstCombiner::FoldGEPICmp(GEPOperator *GEPLHS, Value *RHS,
5716 ICmpInst::Predicate Cond,
5718 // Look through bitcasts.
5719 if (BitCastInst *BCI = dyn_cast<BitCastInst>(RHS))
5720 RHS = BCI->getOperand(0);
5722 Value *PtrBase = GEPLHS->getOperand(0);
5723 if (TD && PtrBase == RHS && GEPLHS->isInBounds()) {
5724 // ((gep Ptr, OFFSET) cmp Ptr) ---> (OFFSET cmp 0).
5725 // This transformation (ignoring the base and scales) is valid because we
5726 // know pointers can't overflow since the gep is inbounds. See if we can
5727 // output an optimized form.
5728 Value *Offset = EvaluateGEPOffsetExpression(GEPLHS, I, *this);
5730 // If not, synthesize the offset the hard way.
5732 Offset = EmitGEPOffset(GEPLHS, *this);
5733 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), Offset,
5734 Constant::getNullValue(Offset->getType()));
5735 } else if (GEPOperator *GEPRHS = dyn_cast<GEPOperator>(RHS)) {
5736 // If the base pointers are different, but the indices are the same, just
5737 // compare the base pointer.
5738 if (PtrBase != GEPRHS->getOperand(0)) {
5739 bool IndicesTheSame = GEPLHS->getNumOperands()==GEPRHS->getNumOperands();
5740 IndicesTheSame &= GEPLHS->getOperand(0)->getType() ==
5741 GEPRHS->getOperand(0)->getType();
5743 for (unsigned i = 1, e = GEPLHS->getNumOperands(); i != e; ++i)
5744 if (GEPLHS->getOperand(i) != GEPRHS->getOperand(i)) {
5745 IndicesTheSame = false;
5749 // If all indices are the same, just compare the base pointers.
5751 return new ICmpInst(ICmpInst::getSignedPredicate(Cond),
5752 GEPLHS->getOperand(0), GEPRHS->getOperand(0));
5754 // Otherwise, the base pointers are different and the indices are
5755 // different, bail out.
5759 // If one of the GEPs has all zero indices, recurse.
5760 bool AllZeros = true;
5761 for (unsigned i = 1, e = GEPLHS->getNumOperands(); i != e; ++i)
5762 if (!isa<Constant>(GEPLHS->getOperand(i)) ||
5763 !cast<Constant>(GEPLHS->getOperand(i))->isNullValue()) {
5768 return FoldGEPICmp(GEPRHS, GEPLHS->getOperand(0),
5769 ICmpInst::getSwappedPredicate(Cond), I);
5771 // If the other GEP has all zero indices, recurse.
5773 for (unsigned i = 1, e = GEPRHS->getNumOperands(); i != e; ++i)
5774 if (!isa<Constant>(GEPRHS->getOperand(i)) ||
5775 !cast<Constant>(GEPRHS->getOperand(i))->isNullValue()) {
5780 return FoldGEPICmp(GEPLHS, GEPRHS->getOperand(0), Cond, I);
5782 if (GEPLHS->getNumOperands() == GEPRHS->getNumOperands()) {
5783 // If the GEPs only differ by one index, compare it.
5784 unsigned NumDifferences = 0; // Keep track of # differences.
5785 unsigned DiffOperand = 0; // The operand that differs.
5786 for (unsigned i = 1, e = GEPRHS->getNumOperands(); i != e; ++i)
5787 if (GEPLHS->getOperand(i) != GEPRHS->getOperand(i)) {
5788 if (GEPLHS->getOperand(i)->getType()->getPrimitiveSizeInBits() !=
5789 GEPRHS->getOperand(i)->getType()->getPrimitiveSizeInBits()) {
5790 // Irreconcilable differences.
5794 if (NumDifferences++) break;
5799 if (NumDifferences == 0) // SAME GEP?
5800 return ReplaceInstUsesWith(I, // No comparison is needed here.
5801 ConstantInt::get(Type::getInt1Ty(*Context),
5802 ICmpInst::isTrueWhenEqual(Cond)));
5804 else if (NumDifferences == 1) {
5805 Value *LHSV = GEPLHS->getOperand(DiffOperand);
5806 Value *RHSV = GEPRHS->getOperand(DiffOperand);
5807 // Make sure we do a signed comparison here.
5808 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), LHSV, RHSV);
5812 // Only lower this if the icmp is the only user of the GEP or if we expect
5813 // the result to fold to a constant!
5815 (isa<ConstantExpr>(GEPLHS) || GEPLHS->hasOneUse()) &&
5816 (isa<ConstantExpr>(GEPRHS) || GEPRHS->hasOneUse())) {
5817 // ((gep Ptr, OFFSET1) cmp (gep Ptr, OFFSET2) ---> (OFFSET1 cmp OFFSET2)
5818 Value *L = EmitGEPOffset(GEPLHS, *this);
5819 Value *R = EmitGEPOffset(GEPRHS, *this);
5820 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), L, R);
5826 /// FoldFCmp_IntToFP_Cst - Fold fcmp ([us]itofp x, cst) if possible.
5828 Instruction *InstCombiner::FoldFCmp_IntToFP_Cst(FCmpInst &I,
5831 if (!isa<ConstantFP>(RHSC)) return 0;
5832 const APFloat &RHS = cast<ConstantFP>(RHSC)->getValueAPF();
5834 // Get the width of the mantissa. We don't want to hack on conversions that
5835 // might lose information from the integer, e.g. "i64 -> float"
5836 int MantissaWidth = LHSI->getType()->getFPMantissaWidth();
5837 if (MantissaWidth == -1) return 0; // Unknown.
5839 // Check to see that the input is converted from an integer type that is small
5840 // enough that preserves all bits. TODO: check here for "known" sign bits.
5841 // This would allow us to handle (fptosi (x >>s 62) to float) if x is i64 f.e.
5842 unsigned InputSize = LHSI->getOperand(0)->getType()->getScalarSizeInBits();
5844 // If this is a uitofp instruction, we need an extra bit to hold the sign.
5845 bool LHSUnsigned = isa<UIToFPInst>(LHSI);
5849 // If the conversion would lose info, don't hack on this.
5850 if ((int)InputSize > MantissaWidth)
5853 // Otherwise, we can potentially simplify the comparison. We know that it
5854 // will always come through as an integer value and we know the constant is
5855 // not a NAN (it would have been previously simplified).
5856 assert(!RHS.isNaN() && "NaN comparison not already folded!");
5858 ICmpInst::Predicate Pred;
5859 switch (I.getPredicate()) {
5860 default: llvm_unreachable("Unexpected predicate!");
5861 case FCmpInst::FCMP_UEQ:
5862 case FCmpInst::FCMP_OEQ:
5863 Pred = ICmpInst::ICMP_EQ;
5865 case FCmpInst::FCMP_UGT:
5866 case FCmpInst::FCMP_OGT:
5867 Pred = LHSUnsigned ? ICmpInst::ICMP_UGT : ICmpInst::ICMP_SGT;
5869 case FCmpInst::FCMP_UGE:
5870 case FCmpInst::FCMP_OGE:
5871 Pred = LHSUnsigned ? ICmpInst::ICMP_UGE : ICmpInst::ICMP_SGE;
5873 case FCmpInst::FCMP_ULT:
5874 case FCmpInst::FCMP_OLT:
5875 Pred = LHSUnsigned ? ICmpInst::ICMP_ULT : ICmpInst::ICMP_SLT;
5877 case FCmpInst::FCMP_ULE:
5878 case FCmpInst::FCMP_OLE:
5879 Pred = LHSUnsigned ? ICmpInst::ICMP_ULE : ICmpInst::ICMP_SLE;
5881 case FCmpInst::FCMP_UNE:
5882 case FCmpInst::FCMP_ONE:
5883 Pred = ICmpInst::ICMP_NE;
5885 case FCmpInst::FCMP_ORD:
5886 return ReplaceInstUsesWith(I, ConstantInt::getTrue(*Context));
5887 case FCmpInst::FCMP_UNO:
5888 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
5891 const IntegerType *IntTy = cast<IntegerType>(LHSI->getOperand(0)->getType());
5893 // Now we know that the APFloat is a normal number, zero or inf.
5895 // See if the FP constant is too large for the integer. For example,
5896 // comparing an i8 to 300.0.
5897 unsigned IntWidth = IntTy->getScalarSizeInBits();
5900 // If the RHS value is > SignedMax, fold the comparison. This handles +INF
5901 // and large values.
5902 APFloat SMax(RHS.getSemantics(), APFloat::fcZero, false);
5903 SMax.convertFromAPInt(APInt::getSignedMaxValue(IntWidth), true,
5904 APFloat::rmNearestTiesToEven);
5905 if (SMax.compare(RHS) == APFloat::cmpLessThan) { // smax < 13123.0
5906 if (Pred == ICmpInst::ICMP_NE || Pred == ICmpInst::ICMP_SLT ||
5907 Pred == ICmpInst::ICMP_SLE)
5908 return ReplaceInstUsesWith(I, ConstantInt::getTrue(*Context));
5909 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
5912 // If the RHS value is > UnsignedMax, fold the comparison. This handles
5913 // +INF and large values.
5914 APFloat UMax(RHS.getSemantics(), APFloat::fcZero, false);
5915 UMax.convertFromAPInt(APInt::getMaxValue(IntWidth), false,
5916 APFloat::rmNearestTiesToEven);
5917 if (UMax.compare(RHS) == APFloat::cmpLessThan) { // umax < 13123.0
5918 if (Pred == ICmpInst::ICMP_NE || Pred == ICmpInst::ICMP_ULT ||
5919 Pred == ICmpInst::ICMP_ULE)
5920 return ReplaceInstUsesWith(I, ConstantInt::getTrue(*Context));
5921 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
5926 // See if the RHS value is < SignedMin.
5927 APFloat SMin(RHS.getSemantics(), APFloat::fcZero, false);
5928 SMin.convertFromAPInt(APInt::getSignedMinValue(IntWidth), true,
5929 APFloat::rmNearestTiesToEven);
5930 if (SMin.compare(RHS) == APFloat::cmpGreaterThan) { // smin > 12312.0
5931 if (Pred == ICmpInst::ICMP_NE || Pred == ICmpInst::ICMP_SGT ||
5932 Pred == ICmpInst::ICMP_SGE)
5933 return ReplaceInstUsesWith(I, ConstantInt::getTrue(*Context));
5934 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
5938 // Okay, now we know that the FP constant fits in the range [SMIN, SMAX] or
5939 // [0, UMAX], but it may still be fractional. See if it is fractional by
5940 // casting the FP value to the integer value and back, checking for equality.
5941 // Don't do this for zero, because -0.0 is not fractional.
5942 Constant *RHSInt = LHSUnsigned
5943 ? ConstantExpr::getFPToUI(RHSC, IntTy)
5944 : ConstantExpr::getFPToSI(RHSC, IntTy);
5945 if (!RHS.isZero()) {
5946 bool Equal = LHSUnsigned
5947 ? ConstantExpr::getUIToFP(RHSInt, RHSC->getType()) == RHSC
5948 : ConstantExpr::getSIToFP(RHSInt, RHSC->getType()) == RHSC;
5950 // If we had a comparison against a fractional value, we have to adjust
5951 // the compare predicate and sometimes the value. RHSC is rounded towards
5952 // zero at this point.
5954 default: llvm_unreachable("Unexpected integer comparison!");
5955 case ICmpInst::ICMP_NE: // (float)int != 4.4 --> true
5956 return ReplaceInstUsesWith(I, ConstantInt::getTrue(*Context));
5957 case ICmpInst::ICMP_EQ: // (float)int == 4.4 --> false
5958 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
5959 case ICmpInst::ICMP_ULE:
5960 // (float)int <= 4.4 --> int <= 4
5961 // (float)int <= -4.4 --> false
5962 if (RHS.isNegative())
5963 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
5965 case ICmpInst::ICMP_SLE:
5966 // (float)int <= 4.4 --> int <= 4
5967 // (float)int <= -4.4 --> int < -4
5968 if (RHS.isNegative())
5969 Pred = ICmpInst::ICMP_SLT;
5971 case ICmpInst::ICMP_ULT:
5972 // (float)int < -4.4 --> false
5973 // (float)int < 4.4 --> int <= 4
5974 if (RHS.isNegative())
5975 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
5976 Pred = ICmpInst::ICMP_ULE;
5978 case ICmpInst::ICMP_SLT:
5979 // (float)int < -4.4 --> int < -4
5980 // (float)int < 4.4 --> int <= 4
5981 if (!RHS.isNegative())
5982 Pred = ICmpInst::ICMP_SLE;
5984 case ICmpInst::ICMP_UGT:
5985 // (float)int > 4.4 --> int > 4
5986 // (float)int > -4.4 --> true
5987 if (RHS.isNegative())
5988 return ReplaceInstUsesWith(I, ConstantInt::getTrue(*Context));
5990 case ICmpInst::ICMP_SGT:
5991 // (float)int > 4.4 --> int > 4
5992 // (float)int > -4.4 --> int >= -4
5993 if (RHS.isNegative())
5994 Pred = ICmpInst::ICMP_SGE;
5996 case ICmpInst::ICMP_UGE:
5997 // (float)int >= -4.4 --> true
5998 // (float)int >= 4.4 --> int > 4
5999 if (!RHS.isNegative())
6000 return ReplaceInstUsesWith(I, ConstantInt::getTrue(*Context));
6001 Pred = ICmpInst::ICMP_UGT;
6003 case ICmpInst::ICMP_SGE:
6004 // (float)int >= -4.4 --> int >= -4
6005 // (float)int >= 4.4 --> int > 4
6006 if (!RHS.isNegative())
6007 Pred = ICmpInst::ICMP_SGT;
6013 // Lower this FP comparison into an appropriate integer version of the
6015 return new ICmpInst(Pred, LHSI->getOperand(0), RHSInt);
6018 Instruction *InstCombiner::visitFCmpInst(FCmpInst &I) {
6019 bool Changed = false;
6021 /// Orders the operands of the compare so that they are listed from most
6022 /// complex to least complex. This puts constants before unary operators,
6023 /// before binary operators.
6024 if (getComplexity(I.getOperand(0)) < getComplexity(I.getOperand(1))) {
6029 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
6031 if (Value *V = SimplifyFCmpInst(I.getPredicate(), Op0, Op1, TD))
6032 return ReplaceInstUsesWith(I, V);
6034 // Simplify 'fcmp pred X, X'
6036 switch (I.getPredicate()) {
6037 default: llvm_unreachable("Unknown predicate!");
6038 case FCmpInst::FCMP_UNO: // True if unordered: isnan(X) | isnan(Y)
6039 case FCmpInst::FCMP_ULT: // True if unordered or less than
6040 case FCmpInst::FCMP_UGT: // True if unordered or greater than
6041 case FCmpInst::FCMP_UNE: // True if unordered or not equal
6042 // Canonicalize these to be 'fcmp uno %X, 0.0'.
6043 I.setPredicate(FCmpInst::FCMP_UNO);
6044 I.setOperand(1, Constant::getNullValue(Op0->getType()));
6047 case FCmpInst::FCMP_ORD: // True if ordered (no nans)
6048 case FCmpInst::FCMP_OEQ: // True if ordered and equal
6049 case FCmpInst::FCMP_OGE: // True if ordered and greater than or equal
6050 case FCmpInst::FCMP_OLE: // True if ordered and less than or equal
6051 // Canonicalize these to be 'fcmp ord %X, 0.0'.
6052 I.setPredicate(FCmpInst::FCMP_ORD);
6053 I.setOperand(1, Constant::getNullValue(Op0->getType()));
6058 // Handle fcmp with constant RHS
6059 if (Constant *RHSC = dyn_cast<Constant>(Op1)) {
6060 if (Instruction *LHSI = dyn_cast<Instruction>(Op0))
6061 switch (LHSI->getOpcode()) {
6062 case Instruction::PHI:
6063 // Only fold fcmp into the PHI if the phi and fcmp are in the same
6064 // block. If in the same block, we're encouraging jump threading. If
6065 // not, we are just pessimizing the code by making an i1 phi.
6066 if (LHSI->getParent() == I.getParent())
6067 if (Instruction *NV = FoldOpIntoPhi(I, true))
6070 case Instruction::SIToFP:
6071 case Instruction::UIToFP:
6072 if (Instruction *NV = FoldFCmp_IntToFP_Cst(I, LHSI, RHSC))
6075 case Instruction::Select:
6076 // If either operand of the select is a constant, we can fold the
6077 // comparison into the select arms, which will cause one to be
6078 // constant folded and the select turned into a bitwise or.
6079 Value *Op1 = 0, *Op2 = 0;
6080 if (LHSI->hasOneUse()) {
6081 if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(1))) {
6082 // Fold the known value into the constant operand.
6083 Op1 = ConstantExpr::getCompare(I.getPredicate(), C, RHSC);
6084 // Insert a new FCmp of the other select operand.
6085 Op2 = Builder->CreateFCmp(I.getPredicate(),
6086 LHSI->getOperand(2), RHSC, I.getName());
6087 } else if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(2))) {
6088 // Fold the known value into the constant operand.
6089 Op2 = ConstantExpr::getCompare(I.getPredicate(), C, RHSC);
6090 // Insert a new FCmp of the other select operand.
6091 Op1 = Builder->CreateFCmp(I.getPredicate(), LHSI->getOperand(1),
6097 return SelectInst::Create(LHSI->getOperand(0), Op1, Op2);
6102 return Changed ? &I : 0;
6105 Instruction *InstCombiner::visitICmpInst(ICmpInst &I) {
6106 bool Changed = false;
6108 /// Orders the operands of the compare so that they are listed from most
6109 /// complex to least complex. This puts constants before unary operators,
6110 /// before binary operators.
6111 if (getComplexity(I.getOperand(0)) < getComplexity(I.getOperand(1))) {
6116 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
6118 if (Value *V = SimplifyICmpInst(I.getPredicate(), Op0, Op1, TD))
6119 return ReplaceInstUsesWith(I, V);
6121 const Type *Ty = Op0->getType();
6123 // icmp's with boolean values can always be turned into bitwise operations
6124 if (Ty == Type::getInt1Ty(*Context)) {
6125 switch (I.getPredicate()) {
6126 default: llvm_unreachable("Invalid icmp instruction!");
6127 case ICmpInst::ICMP_EQ: { // icmp eq i1 A, B -> ~(A^B)
6128 Value *Xor = Builder->CreateXor(Op0, Op1, I.getName()+"tmp");
6129 return BinaryOperator::CreateNot(Xor);
6131 case ICmpInst::ICMP_NE: // icmp eq i1 A, B -> A^B
6132 return BinaryOperator::CreateXor(Op0, Op1);
6134 case ICmpInst::ICMP_UGT:
6135 std::swap(Op0, Op1); // Change icmp ugt -> icmp ult
6137 case ICmpInst::ICMP_ULT:{ // icmp ult i1 A, B -> ~A & B
6138 Value *Not = Builder->CreateNot(Op0, I.getName()+"tmp");
6139 return BinaryOperator::CreateAnd(Not, Op1);
6141 case ICmpInst::ICMP_SGT:
6142 std::swap(Op0, Op1); // Change icmp sgt -> icmp slt
6144 case ICmpInst::ICMP_SLT: { // icmp slt i1 A, B -> A & ~B
6145 Value *Not = Builder->CreateNot(Op1, I.getName()+"tmp");
6146 return BinaryOperator::CreateAnd(Not, Op0);
6148 case ICmpInst::ICMP_UGE:
6149 std::swap(Op0, Op1); // Change icmp uge -> icmp ule
6151 case ICmpInst::ICMP_ULE: { // icmp ule i1 A, B -> ~A | B
6152 Value *Not = Builder->CreateNot(Op0, I.getName()+"tmp");
6153 return BinaryOperator::CreateOr(Not, Op1);
6155 case ICmpInst::ICMP_SGE:
6156 std::swap(Op0, Op1); // Change icmp sge -> icmp sle
6158 case ICmpInst::ICMP_SLE: { // icmp sle i1 A, B -> A | ~B
6159 Value *Not = Builder->CreateNot(Op1, I.getName()+"tmp");
6160 return BinaryOperator::CreateOr(Not, Op0);
6165 unsigned BitWidth = 0;
6167 BitWidth = TD->getTypeSizeInBits(Ty->getScalarType());
6168 else if (Ty->isIntOrIntVector())
6169 BitWidth = Ty->getScalarSizeInBits();
6171 bool isSignBit = false;
6173 // See if we are doing a comparison with a constant.
6174 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
6175 Value *A = 0, *B = 0;
6177 // (icmp ne/eq (sub A B) 0) -> (icmp ne/eq A, B)
6178 if (I.isEquality() && CI->isNullValue() &&
6179 match(Op0, m_Sub(m_Value(A), m_Value(B)))) {
6180 // (icmp cond A B) if cond is equality
6181 return new ICmpInst(I.getPredicate(), A, B);
6184 // If we have an icmp le or icmp ge instruction, turn it into the
6185 // appropriate icmp lt or icmp gt instruction. This allows us to rely on
6186 // them being folded in the code below. The SimplifyICmpInst code has
6187 // already handled the edge cases for us, so we just assert on them.
6188 switch (I.getPredicate()) {
6190 case ICmpInst::ICMP_ULE:
6191 assert(!CI->isMaxValue(false)); // A <=u MAX -> TRUE
6192 return new ICmpInst(ICmpInst::ICMP_ULT, Op0,
6194 case ICmpInst::ICMP_SLE:
6195 assert(!CI->isMaxValue(true)); // A <=s MAX -> TRUE
6196 return new ICmpInst(ICmpInst::ICMP_SLT, Op0,
6198 case ICmpInst::ICMP_UGE:
6199 assert(!CI->isMinValue(false)); // A >=u MIN -> TRUE
6200 return new ICmpInst(ICmpInst::ICMP_UGT, Op0,
6202 case ICmpInst::ICMP_SGE:
6203 assert(!CI->isMinValue(true)); // A >=s MIN -> TRUE
6204 return new ICmpInst(ICmpInst::ICMP_SGT, Op0,
6208 // If this comparison is a normal comparison, it demands all
6209 // bits, if it is a sign bit comparison, it only demands the sign bit.
6211 isSignBit = isSignBitCheck(I.getPredicate(), CI, UnusedBit);
6214 // See if we can fold the comparison based on range information we can get
6215 // by checking whether bits are known to be zero or one in the input.
6216 if (BitWidth != 0) {
6217 APInt Op0KnownZero(BitWidth, 0), Op0KnownOne(BitWidth, 0);
6218 APInt Op1KnownZero(BitWidth, 0), Op1KnownOne(BitWidth, 0);
6220 if (SimplifyDemandedBits(I.getOperandUse(0),
6221 isSignBit ? APInt::getSignBit(BitWidth)
6222 : APInt::getAllOnesValue(BitWidth),
6223 Op0KnownZero, Op0KnownOne, 0))
6225 if (SimplifyDemandedBits(I.getOperandUse(1),
6226 APInt::getAllOnesValue(BitWidth),
6227 Op1KnownZero, Op1KnownOne, 0))
6230 // Given the known and unknown bits, compute a range that the LHS could be
6231 // in. Compute the Min, Max and RHS values based on the known bits. For the
6232 // EQ and NE we use unsigned values.
6233 APInt Op0Min(BitWidth, 0), Op0Max(BitWidth, 0);
6234 APInt Op1Min(BitWidth, 0), Op1Max(BitWidth, 0);
6236 ComputeSignedMinMaxValuesFromKnownBits(Op0KnownZero, Op0KnownOne,
6238 ComputeSignedMinMaxValuesFromKnownBits(Op1KnownZero, Op1KnownOne,
6241 ComputeUnsignedMinMaxValuesFromKnownBits(Op0KnownZero, Op0KnownOne,
6243 ComputeUnsignedMinMaxValuesFromKnownBits(Op1KnownZero, Op1KnownOne,
6247 // If Min and Max are known to be the same, then SimplifyDemandedBits
6248 // figured out that the LHS is a constant. Just constant fold this now so
6249 // that code below can assume that Min != Max.
6250 if (!isa<Constant>(Op0) && Op0Min == Op0Max)
6251 return new ICmpInst(I.getPredicate(),
6252 ConstantInt::get(*Context, Op0Min), Op1);
6253 if (!isa<Constant>(Op1) && Op1Min == Op1Max)
6254 return new ICmpInst(I.getPredicate(), Op0,
6255 ConstantInt::get(*Context, Op1Min));
6257 // Based on the range information we know about the LHS, see if we can
6258 // simplify this comparison. For example, (x&4) < 8 is always true.
6259 switch (I.getPredicate()) {
6260 default: llvm_unreachable("Unknown icmp opcode!");
6261 case ICmpInst::ICMP_EQ:
6262 if (Op0Max.ult(Op1Min) || Op0Min.ugt(Op1Max))
6263 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
6265 case ICmpInst::ICMP_NE:
6266 if (Op0Max.ult(Op1Min) || Op0Min.ugt(Op1Max))
6267 return ReplaceInstUsesWith(I, ConstantInt::getTrue(*Context));
6269 case ICmpInst::ICMP_ULT:
6270 if (Op0Max.ult(Op1Min)) // A <u B -> true if max(A) < min(B)
6271 return ReplaceInstUsesWith(I, ConstantInt::getTrue(*Context));
6272 if (Op0Min.uge(Op1Max)) // A <u B -> false if min(A) >= max(B)
6273 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
6274 if (Op1Min == Op0Max) // A <u B -> A != B if max(A) == min(B)
6275 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
6276 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
6277 if (Op1Max == Op0Min+1) // A <u C -> A == C-1 if min(A)+1 == C
6278 return new ICmpInst(ICmpInst::ICMP_EQ, Op0,
6281 // (x <u 2147483648) -> (x >s -1) -> true if sign bit clear
6282 if (CI->isMinValue(true))
6283 return new ICmpInst(ICmpInst::ICMP_SGT, Op0,
6284 Constant::getAllOnesValue(Op0->getType()));
6287 case ICmpInst::ICMP_UGT:
6288 if (Op0Min.ugt(Op1Max)) // A >u B -> true if min(A) > max(B)
6289 return ReplaceInstUsesWith(I, ConstantInt::getTrue(*Context));
6290 if (Op0Max.ule(Op1Min)) // A >u B -> false if max(A) <= max(B)
6291 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
6293 if (Op1Max == Op0Min) // A >u B -> A != B if min(A) == max(B)
6294 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
6295 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
6296 if (Op1Min == Op0Max-1) // A >u C -> A == C+1 if max(a)-1 == C
6297 return new ICmpInst(ICmpInst::ICMP_EQ, Op0,
6300 // (x >u 2147483647) -> (x <s 0) -> true if sign bit set
6301 if (CI->isMaxValue(true))
6302 return new ICmpInst(ICmpInst::ICMP_SLT, Op0,
6303 Constant::getNullValue(Op0->getType()));
6306 case ICmpInst::ICMP_SLT:
6307 if (Op0Max.slt(Op1Min)) // A <s B -> true if max(A) < min(C)
6308 return ReplaceInstUsesWith(I, ConstantInt::getTrue(*Context));
6309 if (Op0Min.sge(Op1Max)) // A <s B -> false if min(A) >= max(C)
6310 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
6311 if (Op1Min == Op0Max) // A <s B -> A != B if max(A) == min(B)
6312 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
6313 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
6314 if (Op1Max == Op0Min+1) // A <s C -> A == C-1 if min(A)+1 == C
6315 return new ICmpInst(ICmpInst::ICMP_EQ, Op0,
6319 case ICmpInst::ICMP_SGT:
6320 if (Op0Min.sgt(Op1Max)) // A >s B -> true if min(A) > max(B)
6321 return ReplaceInstUsesWith(I, ConstantInt::getTrue(*Context));
6322 if (Op0Max.sle(Op1Min)) // A >s B -> false if max(A) <= min(B)
6323 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
6325 if (Op1Max == Op0Min) // A >s B -> A != B if min(A) == max(B)
6326 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
6327 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
6328 if (Op1Min == Op0Max-1) // A >s C -> A == C+1 if max(A)-1 == C
6329 return new ICmpInst(ICmpInst::ICMP_EQ, Op0,
6333 case ICmpInst::ICMP_SGE:
6334 assert(!isa<ConstantInt>(Op1) && "ICMP_SGE with ConstantInt not folded!");
6335 if (Op0Min.sge(Op1Max)) // A >=s B -> true if min(A) >= max(B)
6336 return ReplaceInstUsesWith(I, ConstantInt::getTrue(*Context));
6337 if (Op0Max.slt(Op1Min)) // A >=s B -> false if max(A) < min(B)
6338 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
6340 case ICmpInst::ICMP_SLE:
6341 assert(!isa<ConstantInt>(Op1) && "ICMP_SLE with ConstantInt not folded!");
6342 if (Op0Max.sle(Op1Min)) // A <=s B -> true if max(A) <= min(B)
6343 return ReplaceInstUsesWith(I, ConstantInt::getTrue(*Context));
6344 if (Op0Min.sgt(Op1Max)) // A <=s B -> false if min(A) > max(B)
6345 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
6347 case ICmpInst::ICMP_UGE:
6348 assert(!isa<ConstantInt>(Op1) && "ICMP_UGE with ConstantInt not folded!");
6349 if (Op0Min.uge(Op1Max)) // A >=u B -> true if min(A) >= max(B)
6350 return ReplaceInstUsesWith(I, ConstantInt::getTrue(*Context));
6351 if (Op0Max.ult(Op1Min)) // A >=u B -> false if max(A) < min(B)
6352 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
6354 case ICmpInst::ICMP_ULE:
6355 assert(!isa<ConstantInt>(Op1) && "ICMP_ULE with ConstantInt not folded!");
6356 if (Op0Max.ule(Op1Min)) // A <=u B -> true if max(A) <= min(B)
6357 return ReplaceInstUsesWith(I, ConstantInt::getTrue(*Context));
6358 if (Op0Min.ugt(Op1Max)) // A <=u B -> false if min(A) > max(B)
6359 return ReplaceInstUsesWith(I, ConstantInt::getFalse(*Context));
6363 // Turn a signed comparison into an unsigned one if both operands
6364 // are known to have the same sign.
6366 ((Op0KnownZero.isNegative() && Op1KnownZero.isNegative()) ||
6367 (Op0KnownOne.isNegative() && Op1KnownOne.isNegative())))
6368 return new ICmpInst(I.getUnsignedPredicate(), Op0, Op1);
6371 // Test if the ICmpInst instruction is used exclusively by a select as
6372 // part of a minimum or maximum operation. If so, refrain from doing
6373 // any other folding. This helps out other analyses which understand
6374 // non-obfuscated minimum and maximum idioms, such as ScalarEvolution
6375 // and CodeGen. And in this case, at least one of the comparison
6376 // operands has at least one user besides the compare (the select),
6377 // which would often largely negate the benefit of folding anyway.
6379 if (SelectInst *SI = dyn_cast<SelectInst>(*I.use_begin()))
6380 if ((SI->getOperand(1) == Op0 && SI->getOperand(2) == Op1) ||
6381 (SI->getOperand(2) == Op0 && SI->getOperand(1) == Op1))
6384 // See if we are doing a comparison between a constant and an instruction that
6385 // can be folded into the comparison.
6386 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
6387 // Since the RHS is a ConstantInt (CI), if the left hand side is an
6388 // instruction, see if that instruction also has constants so that the
6389 // instruction can be folded into the icmp
6390 if (Instruction *LHSI = dyn_cast<Instruction>(Op0))
6391 if (Instruction *Res = visitICmpInstWithInstAndIntCst(I, LHSI, CI))
6395 // Handle icmp with constant (but not simple integer constant) RHS
6396 if (Constant *RHSC = dyn_cast<Constant>(Op1)) {
6397 if (Instruction *LHSI = dyn_cast<Instruction>(Op0))
6398 switch (LHSI->getOpcode()) {
6399 case Instruction::GetElementPtr:
6400 // icmp pred GEP (P, int 0, int 0, int 0), null -> icmp pred P, null
6401 if (RHSC->isNullValue() &&
6402 cast<GetElementPtrInst>(LHSI)->hasAllZeroIndices())
6403 return new ICmpInst(I.getPredicate(), LHSI->getOperand(0),
6404 Constant::getNullValue(LHSI->getOperand(0)->getType()));
6406 case Instruction::PHI:
6407 // Only fold icmp into the PHI if the phi and icmp are in the same
6408 // block. If in the same block, we're encouraging jump threading. If
6409 // not, we are just pessimizing the code by making an i1 phi.
6410 if (LHSI->getParent() == I.getParent())
6411 if (Instruction *NV = FoldOpIntoPhi(I, true))
6414 case Instruction::Select: {
6415 // If either operand of the select is a constant, we can fold the
6416 // comparison into the select arms, which will cause one to be
6417 // constant folded and the select turned into a bitwise or.
6418 Value *Op1 = 0, *Op2 = 0;
6419 if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(1)))
6420 Op1 = ConstantExpr::getICmp(I.getPredicate(), C, RHSC);
6421 if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(2)))
6422 Op2 = ConstantExpr::getICmp(I.getPredicate(), C, RHSC);
6424 // We only want to perform this transformation if it will not lead to
6425 // additional code. This is true if either both sides of the select
6426 // fold to a constant (in which case the icmp is replaced with a select
6427 // which will usually simplify) or this is the only user of the
6428 // select (in which case we are trading a select+icmp for a simpler
6430 if ((Op1 && Op2) || (LHSI->hasOneUse() && (Op1 || Op2))) {
6432 Op1 = Builder->CreateICmp(I.getPredicate(), LHSI->getOperand(1),
6435 Op2 = Builder->CreateICmp(I.getPredicate(), LHSI->getOperand(2),
6437 return SelectInst::Create(LHSI->getOperand(0), Op1, Op2);
6441 case Instruction::Call:
6442 // If we have (malloc != null), and if the malloc has a single use, we
6443 // can assume it is successful and remove the malloc.
6444 if (isMalloc(LHSI) && LHSI->hasOneUse() &&
6445 isa<ConstantPointerNull>(RHSC)) {
6446 // Need to explicitly erase malloc call here, instead of adding it to
6447 // Worklist, because it won't get DCE'd from the Worklist since
6448 // isInstructionTriviallyDead() returns false for function calls.
6449 // It is OK to replace LHSI/MallocCall with Undef because the
6450 // instruction that uses it will be erased via Worklist.
6451 if (extractMallocCall(LHSI)) {
6452 LHSI->replaceAllUsesWith(UndefValue::get(LHSI->getType()));
6453 EraseInstFromFunction(*LHSI);
6454 return ReplaceInstUsesWith(I,
6455 ConstantInt::get(Type::getInt1Ty(*Context),
6456 !I.isTrueWhenEqual()));
6458 if (CallInst* MallocCall = extractMallocCallFromBitCast(LHSI))
6459 if (MallocCall->hasOneUse()) {
6460 MallocCall->replaceAllUsesWith(
6461 UndefValue::get(MallocCall->getType()));
6462 EraseInstFromFunction(*MallocCall);
6463 Worklist.Add(LHSI); // The malloc's bitcast use.
6464 return ReplaceInstUsesWith(I,
6465 ConstantInt::get(Type::getInt1Ty(*Context),
6466 !I.isTrueWhenEqual()));
6470 case Instruction::IntToPtr:
6471 // icmp pred inttoptr(X), null -> icmp pred X, 0
6472 if (RHSC->isNullValue() && TD &&
6473 TD->getIntPtrType(RHSC->getContext()) ==
6474 LHSI->getOperand(0)->getType())
6475 return new ICmpInst(I.getPredicate(), LHSI->getOperand(0),
6476 Constant::getNullValue(LHSI->getOperand(0)->getType()));
6481 // If we can optimize a 'icmp GEP, P' or 'icmp P, GEP', do so now.
6482 if (GEPOperator *GEP = dyn_cast<GEPOperator>(Op0))
6483 if (Instruction *NI = FoldGEPICmp(GEP, Op1, I.getPredicate(), I))
6485 if (GEPOperator *GEP = dyn_cast<GEPOperator>(Op1))
6486 if (Instruction *NI = FoldGEPICmp(GEP, Op0,
6487 ICmpInst::getSwappedPredicate(I.getPredicate()), I))
6490 // Test to see if the operands of the icmp are casted versions of other
6491 // values. If the ptr->ptr cast can be stripped off both arguments, we do so
6493 if (BitCastInst *CI = dyn_cast<BitCastInst>(Op0)) {
6494 if (isa<PointerType>(Op0->getType()) &&
6495 (isa<Constant>(Op1) || isa<BitCastInst>(Op1))) {
6496 // We keep moving the cast from the left operand over to the right
6497 // operand, where it can often be eliminated completely.
6498 Op0 = CI->getOperand(0);
6500 // If operand #1 is a bitcast instruction, it must also be a ptr->ptr cast
6501 // so eliminate it as well.
6502 if (BitCastInst *CI2 = dyn_cast<BitCastInst>(Op1))
6503 Op1 = CI2->getOperand(0);
6505 // If Op1 is a constant, we can fold the cast into the constant.
6506 if (Op0->getType() != Op1->getType()) {
6507 if (Constant *Op1C = dyn_cast<Constant>(Op1)) {
6508 Op1 = ConstantExpr::getBitCast(Op1C, Op0->getType());
6510 // Otherwise, cast the RHS right before the icmp
6511 Op1 = Builder->CreateBitCast(Op1, Op0->getType());
6514 return new ICmpInst(I.getPredicate(), Op0, Op1);
6518 if (isa<CastInst>(Op0)) {
6519 // Handle the special case of: icmp (cast bool to X), <cst>
6520 // This comes up when you have code like
6523 // For generality, we handle any zero-extension of any operand comparison
6524 // with a constant or another cast from the same type.
6525 if (isa<Constant>(Op1) || isa<CastInst>(Op1))
6526 if (Instruction *R = visitICmpInstWithCastAndCast(I))
6530 // See if it's the same type of instruction on the left and right.
6531 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0)) {
6532 if (BinaryOperator *Op1I = dyn_cast<BinaryOperator>(Op1)) {
6533 if (Op0I->getOpcode() == Op1I->getOpcode() && Op0I->hasOneUse() &&
6534 Op1I->hasOneUse() && Op0I->getOperand(1) == Op1I->getOperand(1)) {
6535 switch (Op0I->getOpcode()) {
6537 case Instruction::Add:
6538 case Instruction::Sub:
6539 case Instruction::Xor:
6540 if (I.isEquality()) // a+x icmp eq/ne b+x --> a icmp b
6541 return new ICmpInst(I.getPredicate(), Op0I->getOperand(0),
6542 Op1I->getOperand(0));
6543 // icmp u/s (a ^ signbit), (b ^ signbit) --> icmp s/u a, b
6544 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op0I->getOperand(1))) {
6545 if (CI->getValue().isSignBit()) {
6546 ICmpInst::Predicate Pred = I.isSigned()
6547 ? I.getUnsignedPredicate()
6548 : I.getSignedPredicate();
6549 return new ICmpInst(Pred, Op0I->getOperand(0),
6550 Op1I->getOperand(0));
6553 if (CI->getValue().isMaxSignedValue()) {
6554 ICmpInst::Predicate Pred = I.isSigned()
6555 ? I.getUnsignedPredicate()
6556 : I.getSignedPredicate();
6557 Pred = I.getSwappedPredicate(Pred);
6558 return new ICmpInst(Pred, Op0I->getOperand(0),
6559 Op1I->getOperand(0));
6563 case Instruction::Mul:
6564 if (!I.isEquality())
6567 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op0I->getOperand(1))) {
6568 // a * Cst icmp eq/ne b * Cst --> a & Mask icmp b & Mask
6569 // Mask = -1 >> count-trailing-zeros(Cst).
6570 if (!CI->isZero() && !CI->isOne()) {
6571 const APInt &AP = CI->getValue();
6572 ConstantInt *Mask = ConstantInt::get(*Context,
6573 APInt::getLowBitsSet(AP.getBitWidth(),
6575 AP.countTrailingZeros()));
6576 Value *And1 = Builder->CreateAnd(Op0I->getOperand(0), Mask);
6577 Value *And2 = Builder->CreateAnd(Op1I->getOperand(0), Mask);
6578 return new ICmpInst(I.getPredicate(), And1, And2);
6587 // ~x < ~y --> y < x
6589 if (match(Op0, m_Not(m_Value(A))) &&
6590 match(Op1, m_Not(m_Value(B))))
6591 return new ICmpInst(I.getPredicate(), B, A);
6594 if (I.isEquality()) {
6595 Value *A, *B, *C, *D;
6597 // -x == -y --> x == y
6598 if (match(Op0, m_Neg(m_Value(A))) &&
6599 match(Op1, m_Neg(m_Value(B))))
6600 return new ICmpInst(I.getPredicate(), A, B);
6602 if (match(Op0, m_Xor(m_Value(A), m_Value(B)))) {
6603 if (A == Op1 || B == Op1) { // (A^B) == A -> B == 0
6604 Value *OtherVal = A == Op1 ? B : A;
6605 return new ICmpInst(I.getPredicate(), OtherVal,
6606 Constant::getNullValue(A->getType()));
6609 if (match(Op1, m_Xor(m_Value(C), m_Value(D)))) {
6610 // A^c1 == C^c2 --> A == C^(c1^c2)
6611 ConstantInt *C1, *C2;
6612 if (match(B, m_ConstantInt(C1)) &&
6613 match(D, m_ConstantInt(C2)) && Op1->hasOneUse()) {
6615 ConstantInt::get(*Context, C1->getValue() ^ C2->getValue());
6616 Value *Xor = Builder->CreateXor(C, NC, "tmp");
6617 return new ICmpInst(I.getPredicate(), A, Xor);
6620 // A^B == A^D -> B == D
6621 if (A == C) return new ICmpInst(I.getPredicate(), B, D);
6622 if (A == D) return new ICmpInst(I.getPredicate(), B, C);
6623 if (B == C) return new ICmpInst(I.getPredicate(), A, D);
6624 if (B == D) return new ICmpInst(I.getPredicate(), A, C);
6628 if (match(Op1, m_Xor(m_Value(A), m_Value(B))) &&
6629 (A == Op0 || B == Op0)) {
6630 // A == (A^B) -> B == 0
6631 Value *OtherVal = A == Op0 ? B : A;
6632 return new ICmpInst(I.getPredicate(), OtherVal,
6633 Constant::getNullValue(A->getType()));
6636 // (A-B) == A -> B == 0
6637 if (match(Op0, m_Sub(m_Specific(Op1), m_Value(B))))
6638 return new ICmpInst(I.getPredicate(), B,
6639 Constant::getNullValue(B->getType()));
6641 // A == (A-B) -> B == 0
6642 if (match(Op1, m_Sub(m_Specific(Op0), m_Value(B))))
6643 return new ICmpInst(I.getPredicate(), B,
6644 Constant::getNullValue(B->getType()));
6646 // (X&Z) == (Y&Z) -> (X^Y) & Z == 0
6647 if (Op0->hasOneUse() && Op1->hasOneUse() &&
6648 match(Op0, m_And(m_Value(A), m_Value(B))) &&
6649 match(Op1, m_And(m_Value(C), m_Value(D)))) {
6650 Value *X = 0, *Y = 0, *Z = 0;
6653 X = B; Y = D; Z = A;
6654 } else if (A == D) {
6655 X = B; Y = C; Z = A;
6656 } else if (B == C) {
6657 X = A; Y = D; Z = B;
6658 } else if (B == D) {
6659 X = A; Y = C; Z = B;
6662 if (X) { // Build (X^Y) & Z
6663 Op1 = Builder->CreateXor(X, Y, "tmp");
6664 Op1 = Builder->CreateAnd(Op1, Z, "tmp");
6665 I.setOperand(0, Op1);
6666 I.setOperand(1, Constant::getNullValue(Op1->getType()));
6673 Value *X; ConstantInt *Cst;
6675 if (match(Op0, m_Add(m_Value(X), m_ConstantInt(Cst))) && Op1 == X)
6676 return FoldICmpAddOpCst(I, X, Cst, I.getPredicate(), Op0);
6679 if (match(Op1, m_Add(m_Value(X), m_ConstantInt(Cst))) && Op0 == X)
6680 return FoldICmpAddOpCst(I, X, Cst, I.getSwappedPredicate(), Op1);
6682 return Changed ? &I : 0;
6685 /// FoldICmpAddOpCst - Fold "icmp pred (X+CI), X".
6686 Instruction *InstCombiner::FoldICmpAddOpCst(ICmpInst &ICI,
6687 Value *X, ConstantInt *CI,
6688 ICmpInst::Predicate Pred,
6690 // If we have X+0, exit early (simplifying logic below) and let it get folded
6691 // elsewhere. icmp X+0, X -> icmp X, X
6693 bool isTrue = ICmpInst::isTrueWhenEqual(Pred);
6694 return ReplaceInstUsesWith(ICI, ConstantInt::get(ICI.getType(), isTrue));
6697 // (X+4) == X -> false.
6698 if (Pred == ICmpInst::ICMP_EQ)
6699 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse(X->getContext()));
6701 // (X+4) != X -> true.
6702 if (Pred == ICmpInst::ICMP_NE)
6703 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue(X->getContext()));
6705 // If this is an instruction (as opposed to constantexpr) get NUW/NSW info.
6706 bool isNUW = false, isNSW = false;
6707 if (BinaryOperator *Add = dyn_cast<BinaryOperator>(TheAdd)) {
6708 isNUW = Add->hasNoUnsignedWrap();
6709 isNSW = Add->hasNoSignedWrap();
6712 // From this point on, we know that (X+C <= X) --> (X+C < X) because C != 0,
6713 // so the values can never be equal. Similiarly for all other "or equals"
6716 // (X+1) <u X --> X >u (MAXUINT-1) --> X != 255
6717 // (X+2) <u X --> X >u (MAXUINT-2) --> X > 253
6718 // (X+MAXUINT) <u X --> X >u (MAXUINT-MAXUINT) --> X != 0
6719 if (Pred == ICmpInst::ICMP_ULT || Pred == ICmpInst::ICMP_ULE) {
6720 // If this is an NUW add, then this is always false.
6722 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse(X->getContext()));
6724 Value *R = ConstantExpr::getSub(ConstantInt::get(CI->getType(), -1ULL), CI);
6725 return new ICmpInst(ICmpInst::ICMP_UGT, X, R);
6728 // (X+1) >u X --> X <u (0-1) --> X != 255
6729 // (X+2) >u X --> X <u (0-2) --> X <u 254
6730 // (X+MAXUINT) >u X --> X <u (0-MAXUINT) --> X <u 1 --> X == 0
6731 if (Pred == ICmpInst::ICMP_UGT || Pred == ICmpInst::ICMP_UGE) {
6732 // If this is an NUW add, then this is always true.
6734 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue(X->getContext()));
6735 return new ICmpInst(ICmpInst::ICMP_ULT, X, ConstantExpr::getNeg(CI));
6738 unsigned BitWidth = CI->getType()->getPrimitiveSizeInBits();
6739 ConstantInt *SMax = ConstantInt::get(X->getContext(),
6740 APInt::getSignedMaxValue(BitWidth));
6742 // (X+ 1) <s X --> X >s (MAXSINT-1) --> X == 127
6743 // (X+ 2) <s X --> X >s (MAXSINT-2) --> X >s 125
6744 // (X+MAXSINT) <s X --> X >s (MAXSINT-MAXSINT) --> X >s 0
6745 // (X+MINSINT) <s X --> X >s (MAXSINT-MINSINT) --> X >s -1
6746 // (X+ -2) <s X --> X >s (MAXSINT- -2) --> X >s 126
6747 // (X+ -1) <s X --> X >s (MAXSINT- -1) --> X != 127
6748 if (Pred == ICmpInst::ICMP_SLT || Pred == ICmpInst::ICMP_SLE) {
6749 // If this is an NSW add, then we have two cases: if the constant is
6750 // positive, then this is always false, if negative, this is always true.
6752 bool isTrue = CI->getValue().isNegative();
6753 return ReplaceInstUsesWith(ICI, ConstantInt::get(ICI.getType(), isTrue));
6756 return new ICmpInst(ICmpInst::ICMP_SGT, X, ConstantExpr::getSub(SMax, CI));
6759 // (X+ 1) >s X --> X <s (MAXSINT-(1-1)) --> X != 127
6760 // (X+ 2) >s X --> X <s (MAXSINT-(2-1)) --> X <s 126
6761 // (X+MAXSINT) >s X --> X <s (MAXSINT-(MAXSINT-1)) --> X <s 1
6762 // (X+MINSINT) >s X --> X <s (MAXSINT-(MINSINT-1)) --> X <s -2
6763 // (X+ -2) >s X --> X <s (MAXSINT-(-2-1)) --> X <s -126
6764 // (X+ -1) >s X --> X <s (MAXSINT-(-1-1)) --> X == -128
6766 // If this is an NSW add, then we have two cases: if the constant is
6767 // positive, then this is always true, if negative, this is always false.
6769 bool isTrue = !CI->getValue().isNegative();
6770 return ReplaceInstUsesWith(ICI, ConstantInt::get(ICI.getType(), isTrue));
6773 assert(Pred == ICmpInst::ICMP_SGT || Pred == ICmpInst::ICMP_SGE);
6774 Constant *C = ConstantInt::get(X->getContext(), CI->getValue()-1);
6775 return new ICmpInst(ICmpInst::ICMP_SLT, X, ConstantExpr::getSub(SMax, C));
6778 /// FoldICmpDivCst - Fold "icmp pred, ([su]div X, DivRHS), CmpRHS" where DivRHS
6779 /// and CmpRHS are both known to be integer constants.
6780 Instruction *InstCombiner::FoldICmpDivCst(ICmpInst &ICI, BinaryOperator *DivI,
6781 ConstantInt *DivRHS) {
6782 ConstantInt *CmpRHS = cast<ConstantInt>(ICI.getOperand(1));
6783 const APInt &CmpRHSV = CmpRHS->getValue();
6785 // FIXME: If the operand types don't match the type of the divide
6786 // then don't attempt this transform. The code below doesn't have the
6787 // logic to deal with a signed divide and an unsigned compare (and
6788 // vice versa). This is because (x /s C1) <s C2 produces different
6789 // results than (x /s C1) <u C2 or (x /u C1) <s C2 or even
6790 // (x /u C1) <u C2. Simply casting the operands and result won't
6791 // work. :( The if statement below tests that condition and bails
6793 bool DivIsSigned = DivI->getOpcode() == Instruction::SDiv;
6794 if (!ICI.isEquality() && DivIsSigned != ICI.isSigned())
6796 if (DivRHS->isZero())
6797 return 0; // The ProdOV computation fails on divide by zero.
6798 if (DivIsSigned && DivRHS->isAllOnesValue())
6799 return 0; // The overflow computation also screws up here
6800 if (DivRHS->isOne())
6801 return 0; // Not worth bothering, and eliminates some funny cases
6804 // Compute Prod = CI * DivRHS. We are essentially solving an equation
6805 // of form X/C1=C2. We solve for X by multiplying C1 (DivRHS) and
6806 // C2 (CI). By solving for X we can turn this into a range check
6807 // instead of computing a divide.
6808 Constant *Prod = ConstantExpr::getMul(CmpRHS, DivRHS);
6810 // Determine if the product overflows by seeing if the product is
6811 // not equal to the divide. Make sure we do the same kind of divide
6812 // as in the LHS instruction that we're folding.
6813 bool ProdOV = (DivIsSigned ? ConstantExpr::getSDiv(Prod, DivRHS) :
6814 ConstantExpr::getUDiv(Prod, DivRHS)) != CmpRHS;
6816 // Get the ICmp opcode
6817 ICmpInst::Predicate Pred = ICI.getPredicate();
6819 // Figure out the interval that is being checked. For example, a comparison
6820 // like "X /u 5 == 0" is really checking that X is in the interval [0, 5).
6821 // Compute this interval based on the constants involved and the signedness of
6822 // the compare/divide. This computes a half-open interval, keeping track of
6823 // whether either value in the interval overflows. After analysis each
6824 // overflow variable is set to 0 if it's corresponding bound variable is valid
6825 // -1 if overflowed off the bottom end, or +1 if overflowed off the top end.
6826 int LoOverflow = 0, HiOverflow = 0;
6827 Constant *LoBound = 0, *HiBound = 0;
6829 if (!DivIsSigned) { // udiv
6830 // e.g. X/5 op 3 --> [15, 20)
6832 HiOverflow = LoOverflow = ProdOV;
6834 HiOverflow = AddWithOverflow(HiBound, LoBound, DivRHS, Context, false);
6835 } else if (DivRHS->getValue().isStrictlyPositive()) { // Divisor is > 0.
6836 if (CmpRHSV == 0) { // (X / pos) op 0
6837 // Can't overflow. e.g. X/2 op 0 --> [-1, 2)
6838 LoBound = cast<ConstantInt>(ConstantExpr::getNeg(SubOne(DivRHS)));
6840 } else if (CmpRHSV.isStrictlyPositive()) { // (X / pos) op pos
6841 LoBound = Prod; // e.g. X/5 op 3 --> [15, 20)
6842 HiOverflow = LoOverflow = ProdOV;
6844 HiOverflow = AddWithOverflow(HiBound, Prod, DivRHS, Context, true);
6845 } else { // (X / pos) op neg
6846 // e.g. X/5 op -3 --> [-15-4, -15+1) --> [-19, -14)
6847 HiBound = AddOne(Prod);
6848 LoOverflow = HiOverflow = ProdOV ? -1 : 0;
6850 ConstantInt* DivNeg =
6851 cast<ConstantInt>(ConstantExpr::getNeg(DivRHS));
6852 LoOverflow = AddWithOverflow(LoBound, HiBound, DivNeg, Context,
6856 } else if (DivRHS->getValue().isNegative()) { // Divisor is < 0.
6857 if (CmpRHSV == 0) { // (X / neg) op 0
6858 // e.g. X/-5 op 0 --> [-4, 5)
6859 LoBound = AddOne(DivRHS);
6860 HiBound = cast<ConstantInt>(ConstantExpr::getNeg(DivRHS));
6861 if (HiBound == DivRHS) { // -INTMIN = INTMIN
6862 HiOverflow = 1; // [INTMIN+1, overflow)
6863 HiBound = 0; // e.g. X/INTMIN = 0 --> X > INTMIN
6865 } else if (CmpRHSV.isStrictlyPositive()) { // (X / neg) op pos
6866 // e.g. X/-5 op 3 --> [-19, -14)
6867 HiBound = AddOne(Prod);
6868 HiOverflow = LoOverflow = ProdOV ? -1 : 0;
6870 LoOverflow = AddWithOverflow(LoBound, HiBound,
6871 DivRHS, Context, true) ? -1 : 0;
6872 } else { // (X / neg) op neg
6873 LoBound = Prod; // e.g. X/-5 op -3 --> [15, 20)
6874 LoOverflow = HiOverflow = ProdOV;
6876 HiOverflow = SubWithOverflow(HiBound, Prod, DivRHS, Context, true);
6879 // Dividing by a negative swaps the condition. LT <-> GT
6880 Pred = ICmpInst::getSwappedPredicate(Pred);
6883 Value *X = DivI->getOperand(0);
6885 default: llvm_unreachable("Unhandled icmp opcode!");
6886 case ICmpInst::ICMP_EQ:
6887 if (LoOverflow && HiOverflow)
6888 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse(*Context));
6889 else if (HiOverflow)
6890 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SGE :
6891 ICmpInst::ICMP_UGE, X, LoBound);
6892 else if (LoOverflow)
6893 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SLT :
6894 ICmpInst::ICMP_ULT, X, HiBound);
6896 return InsertRangeTest(X, LoBound, HiBound, DivIsSigned, true, ICI);
6897 case ICmpInst::ICMP_NE:
6898 if (LoOverflow && HiOverflow)
6899 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue(*Context));
6900 else if (HiOverflow)
6901 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SLT :
6902 ICmpInst::ICMP_ULT, X, LoBound);
6903 else if (LoOverflow)
6904 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SGE :
6905 ICmpInst::ICMP_UGE, X, HiBound);
6907 return InsertRangeTest(X, LoBound, HiBound, DivIsSigned, false, ICI);
6908 case ICmpInst::ICMP_ULT:
6909 case ICmpInst::ICMP_SLT:
6910 if (LoOverflow == +1) // Low bound is greater than input range.
6911 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue(*Context));
6912 if (LoOverflow == -1) // Low bound is less than input range.
6913 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse(*Context));
6914 return new ICmpInst(Pred, X, LoBound);
6915 case ICmpInst::ICMP_UGT:
6916 case ICmpInst::ICMP_SGT:
6917 if (HiOverflow == +1) // High bound greater than input range.
6918 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse(*Context));
6919 else if (HiOverflow == -1) // High bound less than input range.
6920 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue(*Context));
6921 if (Pred == ICmpInst::ICMP_UGT)
6922 return new ICmpInst(ICmpInst::ICMP_UGE, X, HiBound);
6924 return new ICmpInst(ICmpInst::ICMP_SGE, X, HiBound);
6929 /// visitICmpInstWithInstAndIntCst - Handle "icmp (instr, intcst)".
6931 Instruction *InstCombiner::visitICmpInstWithInstAndIntCst(ICmpInst &ICI,
6934 const APInt &RHSV = RHS->getValue();
6936 switch (LHSI->getOpcode()) {
6937 case Instruction::Trunc:
6938 if (ICI.isEquality() && LHSI->hasOneUse()) {
6939 // Simplify icmp eq (trunc x to i8), 42 -> icmp eq x, 42|highbits if all
6940 // of the high bits truncated out of x are known.
6941 unsigned DstBits = LHSI->getType()->getPrimitiveSizeInBits(),
6942 SrcBits = LHSI->getOperand(0)->getType()->getPrimitiveSizeInBits();
6943 APInt Mask(APInt::getHighBitsSet(SrcBits, SrcBits-DstBits));
6944 APInt KnownZero(SrcBits, 0), KnownOne(SrcBits, 0);
6945 ComputeMaskedBits(LHSI->getOperand(0), Mask, KnownZero, KnownOne);
6947 // If all the high bits are known, we can do this xform.
6948 if ((KnownZero|KnownOne).countLeadingOnes() >= SrcBits-DstBits) {
6949 // Pull in the high bits from known-ones set.
6950 APInt NewRHS(RHS->getValue());
6951 NewRHS.zext(SrcBits);
6953 return new ICmpInst(ICI.getPredicate(), LHSI->getOperand(0),
6954 ConstantInt::get(*Context, NewRHS));
6959 case Instruction::Xor: // (icmp pred (xor X, XorCST), CI)
6960 if (ConstantInt *XorCST = dyn_cast<ConstantInt>(LHSI->getOperand(1))) {
6961 // If this is a comparison that tests the signbit (X < 0) or (x > -1),
6963 if ((ICI.getPredicate() == ICmpInst::ICMP_SLT && RHSV == 0) ||
6964 (ICI.getPredicate() == ICmpInst::ICMP_SGT && RHSV.isAllOnesValue())) {
6965 Value *CompareVal = LHSI->getOperand(0);
6967 // If the sign bit of the XorCST is not set, there is no change to
6968 // the operation, just stop using the Xor.
6969 if (!XorCST->getValue().isNegative()) {
6970 ICI.setOperand(0, CompareVal);
6975 // Was the old condition true if the operand is positive?
6976 bool isTrueIfPositive = ICI.getPredicate() == ICmpInst::ICMP_SGT;
6978 // If so, the new one isn't.
6979 isTrueIfPositive ^= true;
6981 if (isTrueIfPositive)
6982 return new ICmpInst(ICmpInst::ICMP_SGT, CompareVal,
6985 return new ICmpInst(ICmpInst::ICMP_SLT, CompareVal,
6989 if (LHSI->hasOneUse()) {
6990 // (icmp u/s (xor A SignBit), C) -> (icmp s/u A, (xor C SignBit))
6991 if (!ICI.isEquality() && XorCST->getValue().isSignBit()) {
6992 const APInt &SignBit = XorCST->getValue();
6993 ICmpInst::Predicate Pred = ICI.isSigned()
6994 ? ICI.getUnsignedPredicate()
6995 : ICI.getSignedPredicate();
6996 return new ICmpInst(Pred, LHSI->getOperand(0),
6997 ConstantInt::get(*Context, RHSV ^ SignBit));
7000 // (icmp u/s (xor A ~SignBit), C) -> (icmp s/u (xor C ~SignBit), A)
7001 if (!ICI.isEquality() && XorCST->getValue().isMaxSignedValue()) {
7002 const APInt &NotSignBit = XorCST->getValue();
7003 ICmpInst::Predicate Pred = ICI.isSigned()
7004 ? ICI.getUnsignedPredicate()
7005 : ICI.getSignedPredicate();
7006 Pred = ICI.getSwappedPredicate(Pred);
7007 return new ICmpInst(Pred, LHSI->getOperand(0),
7008 ConstantInt::get(*Context, RHSV ^ NotSignBit));
7013 case Instruction::And: // (icmp pred (and X, AndCST), RHS)
7014 if (LHSI->hasOneUse() && isa<ConstantInt>(LHSI->getOperand(1)) &&
7015 LHSI->getOperand(0)->hasOneUse()) {
7016 ConstantInt *AndCST = cast<ConstantInt>(LHSI->getOperand(1));
7018 // If the LHS is an AND of a truncating cast, we can widen the
7019 // and/compare to be the input width without changing the value
7020 // produced, eliminating a cast.
7021 if (TruncInst *Cast = dyn_cast<TruncInst>(LHSI->getOperand(0))) {
7022 // We can do this transformation if either the AND constant does not
7023 // have its sign bit set or if it is an equality comparison.
7024 // Extending a relational comparison when we're checking the sign
7025 // bit would not work.
7026 if (Cast->hasOneUse() &&
7027 (ICI.isEquality() ||
7028 (AndCST->getValue().isNonNegative() && RHSV.isNonNegative()))) {
7030 cast<IntegerType>(Cast->getOperand(0)->getType())->getBitWidth();
7031 APInt NewCST = AndCST->getValue();
7032 NewCST.zext(BitWidth);
7034 NewCI.zext(BitWidth);
7036 Builder->CreateAnd(Cast->getOperand(0),
7037 ConstantInt::get(*Context, NewCST), LHSI->getName());
7038 return new ICmpInst(ICI.getPredicate(), NewAnd,
7039 ConstantInt::get(*Context, NewCI));
7043 // If this is: (X >> C1) & C2 != C3 (where any shift and any compare
7044 // could exist), turn it into (X & (C2 << C1)) != (C3 << C1). This
7045 // happens a LOT in code produced by the C front-end, for bitfield
7047 BinaryOperator *Shift = dyn_cast<BinaryOperator>(LHSI->getOperand(0));
7048 if (Shift && !Shift->isShift())
7052 ShAmt = Shift ? dyn_cast<ConstantInt>(Shift->getOperand(1)) : 0;
7053 const Type *Ty = Shift ? Shift->getType() : 0; // Type of the shift.
7054 const Type *AndTy = AndCST->getType(); // Type of the and.
7056 // We can fold this as long as we can't shift unknown bits
7057 // into the mask. This can only happen with signed shift
7058 // rights, as they sign-extend.
7060 bool CanFold = Shift->isLogicalShift();
7062 // To test for the bad case of the signed shr, see if any
7063 // of the bits shifted in could be tested after the mask.
7064 uint32_t TyBits = Ty->getPrimitiveSizeInBits();
7065 int ShAmtVal = TyBits - ShAmt->getLimitedValue(TyBits);
7067 uint32_t BitWidth = AndTy->getPrimitiveSizeInBits();
7068 if ((APInt::getHighBitsSet(BitWidth, BitWidth-ShAmtVal) &
7069 AndCST->getValue()) == 0)
7075 if (Shift->getOpcode() == Instruction::Shl)
7076 NewCst = ConstantExpr::getLShr(RHS, ShAmt);
7078 NewCst = ConstantExpr::getShl(RHS, ShAmt);
7080 // Check to see if we are shifting out any of the bits being
7082 if (ConstantExpr::get(Shift->getOpcode(),
7083 NewCst, ShAmt) != RHS) {
7084 // If we shifted bits out, the fold is not going to work out.
7085 // As a special case, check to see if this means that the
7086 // result is always true or false now.
7087 if (ICI.getPredicate() == ICmpInst::ICMP_EQ)
7088 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse(*Context));
7089 if (ICI.getPredicate() == ICmpInst::ICMP_NE)
7090 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue(*Context));
7092 ICI.setOperand(1, NewCst);
7093 Constant *NewAndCST;
7094 if (Shift->getOpcode() == Instruction::Shl)
7095 NewAndCST = ConstantExpr::getLShr(AndCST, ShAmt);
7097 NewAndCST = ConstantExpr::getShl(AndCST, ShAmt);
7098 LHSI->setOperand(1, NewAndCST);
7099 LHSI->setOperand(0, Shift->getOperand(0));
7100 Worklist.Add(Shift); // Shift is dead.
7106 // Turn ((X >> Y) & C) == 0 into (X & (C << Y)) == 0. The later is
7107 // preferable because it allows the C<<Y expression to be hoisted out
7108 // of a loop if Y is invariant and X is not.
7109 if (Shift && Shift->hasOneUse() && RHSV == 0 &&
7110 ICI.isEquality() && !Shift->isArithmeticShift() &&
7111 !isa<Constant>(Shift->getOperand(0))) {
7114 if (Shift->getOpcode() == Instruction::LShr) {
7115 NS = Builder->CreateShl(AndCST, Shift->getOperand(1), "tmp");
7117 // Insert a logical shift.
7118 NS = Builder->CreateLShr(AndCST, Shift->getOperand(1), "tmp");
7121 // Compute X & (C << Y).
7123 Builder->CreateAnd(Shift->getOperand(0), NS, LHSI->getName());
7125 ICI.setOperand(0, NewAnd);
7131 case Instruction::Shl: { // (icmp pred (shl X, ShAmt), CI)
7132 ConstantInt *ShAmt = dyn_cast<ConstantInt>(LHSI->getOperand(1));
7135 uint32_t TypeBits = RHSV.getBitWidth();
7137 // Check that the shift amount is in range. If not, don't perform
7138 // undefined shifts. When the shift is visited it will be
7140 if (ShAmt->uge(TypeBits))
7143 if (ICI.isEquality()) {
7144 // If we are comparing against bits always shifted out, the
7145 // comparison cannot succeed.
7147 ConstantExpr::getShl(ConstantExpr::getLShr(RHS, ShAmt),
7149 if (Comp != RHS) {// Comparing against a bit that we know is zero.
7150 bool IsICMP_NE = ICI.getPredicate() == ICmpInst::ICMP_NE;
7151 Constant *Cst = ConstantInt::get(Type::getInt1Ty(*Context), IsICMP_NE);
7152 return ReplaceInstUsesWith(ICI, Cst);
7155 if (LHSI->hasOneUse()) {
7156 // Otherwise strength reduce the shift into an and.
7157 uint32_t ShAmtVal = (uint32_t)ShAmt->getLimitedValue(TypeBits);
7159 ConstantInt::get(*Context, APInt::getLowBitsSet(TypeBits,
7160 TypeBits-ShAmtVal));
7163 Builder->CreateAnd(LHSI->getOperand(0),Mask, LHSI->getName()+".mask");
7164 return new ICmpInst(ICI.getPredicate(), And,
7165 ConstantInt::get(*Context, RHSV.lshr(ShAmtVal)));
7169 // Otherwise, if this is a comparison of the sign bit, simplify to and/test.
7170 bool TrueIfSigned = false;
7171 if (LHSI->hasOneUse() &&
7172 isSignBitCheck(ICI.getPredicate(), RHS, TrueIfSigned)) {
7173 // (X << 31) <s 0 --> (X&1) != 0
7174 Constant *Mask = ConstantInt::get(*Context, APInt(TypeBits, 1) <<
7175 (TypeBits-ShAmt->getZExtValue()-1));
7177 Builder->CreateAnd(LHSI->getOperand(0), Mask, LHSI->getName()+".mask");
7178 return new ICmpInst(TrueIfSigned ? ICmpInst::ICMP_NE : ICmpInst::ICMP_EQ,
7179 And, Constant::getNullValue(And->getType()));
7184 case Instruction::LShr: // (icmp pred (shr X, ShAmt), CI)
7185 case Instruction::AShr: {
7186 // Only handle equality comparisons of shift-by-constant.
7187 ConstantInt *ShAmt = dyn_cast<ConstantInt>(LHSI->getOperand(1));
7188 if (!ShAmt || !ICI.isEquality()) break;
7190 // Check that the shift amount is in range. If not, don't perform
7191 // undefined shifts. When the shift is visited it will be
7193 uint32_t TypeBits = RHSV.getBitWidth();
7194 if (ShAmt->uge(TypeBits))
7197 uint32_t ShAmtVal = (uint32_t)ShAmt->getLimitedValue(TypeBits);
7199 // If we are comparing against bits always shifted out, the
7200 // comparison cannot succeed.
7201 APInt Comp = RHSV << ShAmtVal;
7202 if (LHSI->getOpcode() == Instruction::LShr)
7203 Comp = Comp.lshr(ShAmtVal);
7205 Comp = Comp.ashr(ShAmtVal);
7207 if (Comp != RHSV) { // Comparing against a bit that we know is zero.
7208 bool IsICMP_NE = ICI.getPredicate() == ICmpInst::ICMP_NE;
7209 Constant *Cst = ConstantInt::get(Type::getInt1Ty(*Context), IsICMP_NE);
7210 return ReplaceInstUsesWith(ICI, Cst);
7213 // Otherwise, check to see if the bits shifted out are known to be zero.
7214 // If so, we can compare against the unshifted value:
7215 // (X & 4) >> 1 == 2 --> (X & 4) == 4.
7216 if (LHSI->hasOneUse() &&
7217 MaskedValueIsZero(LHSI->getOperand(0),
7218 APInt::getLowBitsSet(Comp.getBitWidth(), ShAmtVal))) {
7219 return new ICmpInst(ICI.getPredicate(), LHSI->getOperand(0),
7220 ConstantExpr::getShl(RHS, ShAmt));
7223 if (LHSI->hasOneUse()) {
7224 // Otherwise strength reduce the shift into an and.
7225 APInt Val(APInt::getHighBitsSet(TypeBits, TypeBits - ShAmtVal));
7226 Constant *Mask = ConstantInt::get(*Context, Val);
7228 Value *And = Builder->CreateAnd(LHSI->getOperand(0),
7229 Mask, LHSI->getName()+".mask");
7230 return new ICmpInst(ICI.getPredicate(), And,
7231 ConstantExpr::getShl(RHS, ShAmt));
7236 case Instruction::SDiv:
7237 case Instruction::UDiv:
7238 // Fold: icmp pred ([us]div X, C1), C2 -> range test
7239 // Fold this div into the comparison, producing a range check.
7240 // Determine, based on the divide type, what the range is being
7241 // checked. If there is an overflow on the low or high side, remember
7242 // it, otherwise compute the range [low, hi) bounding the new value.
7243 // See: InsertRangeTest above for the kinds of replacements possible.
7244 if (ConstantInt *DivRHS = dyn_cast<ConstantInt>(LHSI->getOperand(1)))
7245 if (Instruction *R = FoldICmpDivCst(ICI, cast<BinaryOperator>(LHSI),
7250 case Instruction::Add:
7251 // Fold: icmp pred (add X, C1), C2
7252 if (!ICI.isEquality()) {
7253 ConstantInt *LHSC = dyn_cast<ConstantInt>(LHSI->getOperand(1));
7255 const APInt &LHSV = LHSC->getValue();
7257 ConstantRange CR = ICI.makeConstantRange(ICI.getPredicate(), RHSV)
7260 if (ICI.isSigned()) {
7261 if (CR.getLower().isSignBit()) {
7262 return new ICmpInst(ICmpInst::ICMP_SLT, LHSI->getOperand(0),
7263 ConstantInt::get(*Context, CR.getUpper()));
7264 } else if (CR.getUpper().isSignBit()) {
7265 return new ICmpInst(ICmpInst::ICMP_SGE, LHSI->getOperand(0),
7266 ConstantInt::get(*Context, CR.getLower()));
7269 if (CR.getLower().isMinValue()) {
7270 return new ICmpInst(ICmpInst::ICMP_ULT, LHSI->getOperand(0),
7271 ConstantInt::get(*Context, CR.getUpper()));
7272 } else if (CR.getUpper().isMinValue()) {
7273 return new ICmpInst(ICmpInst::ICMP_UGE, LHSI->getOperand(0),
7274 ConstantInt::get(*Context, CR.getLower()));
7281 // Simplify icmp_eq and icmp_ne instructions with integer constant RHS.
7282 if (ICI.isEquality()) {
7283 bool isICMP_NE = ICI.getPredicate() == ICmpInst::ICMP_NE;
7285 // If the first operand is (add|sub|and|or|xor|rem) with a constant, and
7286 // the second operand is a constant, simplify a bit.
7287 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(LHSI)) {
7288 switch (BO->getOpcode()) {
7289 case Instruction::SRem:
7290 // If we have a signed (X % (2^c)) == 0, turn it into an unsigned one.
7291 if (RHSV == 0 && isa<ConstantInt>(BO->getOperand(1)) &&BO->hasOneUse()){
7292 const APInt &V = cast<ConstantInt>(BO->getOperand(1))->getValue();
7293 if (V.sgt(APInt(V.getBitWidth(), 1)) && V.isPowerOf2()) {
7295 Builder->CreateURem(BO->getOperand(0), BO->getOperand(1),
7297 return new ICmpInst(ICI.getPredicate(), NewRem,
7298 Constant::getNullValue(BO->getType()));
7302 case Instruction::Add:
7303 // Replace ((add A, B) != C) with (A != C-B) if B & C are constants.
7304 if (ConstantInt *BOp1C = dyn_cast<ConstantInt>(BO->getOperand(1))) {
7305 if (BO->hasOneUse())
7306 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
7307 ConstantExpr::getSub(RHS, BOp1C));
7308 } else if (RHSV == 0) {
7309 // Replace ((add A, B) != 0) with (A != -B) if A or B is
7310 // efficiently invertible, or if the add has just this one use.
7311 Value *BOp0 = BO->getOperand(0), *BOp1 = BO->getOperand(1);
7313 if (Value *NegVal = dyn_castNegVal(BOp1))
7314 return new ICmpInst(ICI.getPredicate(), BOp0, NegVal);
7315 else if (Value *NegVal = dyn_castNegVal(BOp0))
7316 return new ICmpInst(ICI.getPredicate(), NegVal, BOp1);
7317 else if (BO->hasOneUse()) {
7318 Value *Neg = Builder->CreateNeg(BOp1);
7320 return new ICmpInst(ICI.getPredicate(), BOp0, Neg);
7324 case Instruction::Xor:
7325 // For the xor case, we can xor two constants together, eliminating
7326 // the explicit xor.
7327 if (Constant *BOC = dyn_cast<Constant>(BO->getOperand(1)))
7328 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
7329 ConstantExpr::getXor(RHS, BOC));
7332 case Instruction::Sub:
7333 // Replace (([sub|xor] A, B) != 0) with (A != B)
7335 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
7339 case Instruction::Or:
7340 // If bits are being or'd in that are not present in the constant we
7341 // are comparing against, then the comparison could never succeed!
7342 if (Constant *BOC = dyn_cast<Constant>(BO->getOperand(1))) {
7343 Constant *NotCI = ConstantExpr::getNot(RHS);
7344 if (!ConstantExpr::getAnd(BOC, NotCI)->isNullValue())
7345 return ReplaceInstUsesWith(ICI,
7346 ConstantInt::get(Type::getInt1Ty(*Context),
7351 case Instruction::And:
7352 if (ConstantInt *BOC = dyn_cast<ConstantInt>(BO->getOperand(1))) {
7353 // If bits are being compared against that are and'd out, then the
7354 // comparison can never succeed!
7355 if ((RHSV & ~BOC->getValue()) != 0)
7356 return ReplaceInstUsesWith(ICI,
7357 ConstantInt::get(Type::getInt1Ty(*Context),
7360 // If we have ((X & C) == C), turn it into ((X & C) != 0).
7361 if (RHS == BOC && RHSV.isPowerOf2())
7362 return new ICmpInst(isICMP_NE ? ICmpInst::ICMP_EQ :
7363 ICmpInst::ICMP_NE, LHSI,
7364 Constant::getNullValue(RHS->getType()));
7366 // Replace (and X, (1 << size(X)-1) != 0) with x s< 0
7367 if (BOC->getValue().isSignBit()) {
7368 Value *X = BO->getOperand(0);
7369 Constant *Zero = Constant::getNullValue(X->getType());
7370 ICmpInst::Predicate pred = isICMP_NE ?
7371 ICmpInst::ICMP_SLT : ICmpInst::ICMP_SGE;
7372 return new ICmpInst(pred, X, Zero);
7375 // ((X & ~7) == 0) --> X < 8
7376 if (RHSV == 0 && isHighOnes(BOC)) {
7377 Value *X = BO->getOperand(0);
7378 Constant *NegX = ConstantExpr::getNeg(BOC);
7379 ICmpInst::Predicate pred = isICMP_NE ?
7380 ICmpInst::ICMP_UGE : ICmpInst::ICMP_ULT;
7381 return new ICmpInst(pred, X, NegX);
7386 } else if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(LHSI)) {
7387 // Handle icmp {eq|ne} <intrinsic>, intcst.
7388 if (II->getIntrinsicID() == Intrinsic::bswap) {
7390 ICI.setOperand(0, II->getOperand(1));
7391 ICI.setOperand(1, ConstantInt::get(*Context, RHSV.byteSwap()));
7399 /// visitICmpInstWithCastAndCast - Handle icmp (cast x to y), (cast/cst).
7400 /// We only handle extending casts so far.
7402 Instruction *InstCombiner::visitICmpInstWithCastAndCast(ICmpInst &ICI) {
7403 const CastInst *LHSCI = cast<CastInst>(ICI.getOperand(0));
7404 Value *LHSCIOp = LHSCI->getOperand(0);
7405 const Type *SrcTy = LHSCIOp->getType();
7406 const Type *DestTy = LHSCI->getType();
7409 // Turn icmp (ptrtoint x), (ptrtoint/c) into a compare of the input if the
7410 // integer type is the same size as the pointer type.
7411 if (TD && LHSCI->getOpcode() == Instruction::PtrToInt &&
7412 TD->getPointerSizeInBits() ==
7413 cast<IntegerType>(DestTy)->getBitWidth()) {
7415 if (Constant *RHSC = dyn_cast<Constant>(ICI.getOperand(1))) {
7416 RHSOp = ConstantExpr::getIntToPtr(RHSC, SrcTy);
7417 } else if (PtrToIntInst *RHSC = dyn_cast<PtrToIntInst>(ICI.getOperand(1))) {
7418 RHSOp = RHSC->getOperand(0);
7419 // If the pointer types don't match, insert a bitcast.
7420 if (LHSCIOp->getType() != RHSOp->getType())
7421 RHSOp = Builder->CreateBitCast(RHSOp, LHSCIOp->getType());
7425 return new ICmpInst(ICI.getPredicate(), LHSCIOp, RHSOp);
7428 // The code below only handles extension cast instructions, so far.
7430 if (LHSCI->getOpcode() != Instruction::ZExt &&
7431 LHSCI->getOpcode() != Instruction::SExt)
7434 bool isSignedExt = LHSCI->getOpcode() == Instruction::SExt;
7435 bool isSignedCmp = ICI.isSigned();
7437 if (CastInst *CI = dyn_cast<CastInst>(ICI.getOperand(1))) {
7438 // Not an extension from the same type?
7439 RHSCIOp = CI->getOperand(0);
7440 if (RHSCIOp->getType() != LHSCIOp->getType())
7443 // If the signedness of the two casts doesn't agree (i.e. one is a sext
7444 // and the other is a zext), then we can't handle this.
7445 if (CI->getOpcode() != LHSCI->getOpcode())
7448 // Deal with equality cases early.
7449 if (ICI.isEquality())
7450 return new ICmpInst(ICI.getPredicate(), LHSCIOp, RHSCIOp);
7452 // A signed comparison of sign extended values simplifies into a
7453 // signed comparison.
7454 if (isSignedCmp && isSignedExt)
7455 return new ICmpInst(ICI.getPredicate(), LHSCIOp, RHSCIOp);
7457 // The other three cases all fold into an unsigned comparison.
7458 return new ICmpInst(ICI.getUnsignedPredicate(), LHSCIOp, RHSCIOp);
7461 // If we aren't dealing with a constant on the RHS, exit early
7462 ConstantInt *CI = dyn_cast<ConstantInt>(ICI.getOperand(1));
7466 // Compute the constant that would happen if we truncated to SrcTy then
7467 // reextended to DestTy.
7468 Constant *Res1 = ConstantExpr::getTrunc(CI, SrcTy);
7469 Constant *Res2 = ConstantExpr::getCast(LHSCI->getOpcode(),
7472 // If the re-extended constant didn't change...
7474 // Deal with equality cases early.
7475 if (ICI.isEquality())
7476 return new ICmpInst(ICI.getPredicate(), LHSCIOp, Res1);
7478 // A signed comparison of sign extended values simplifies into a
7479 // signed comparison.
7480 if (isSignedExt && isSignedCmp)
7481 return new ICmpInst(ICI.getPredicate(), LHSCIOp, Res1);
7483 // The other three cases all fold into an unsigned comparison.
7484 return new ICmpInst(ICI.getUnsignedPredicate(), LHSCIOp, Res1);
7487 // The re-extended constant changed so the constant cannot be represented
7488 // in the shorter type. Consequently, we cannot emit a simple comparison.
7490 // First, handle some easy cases. We know the result cannot be equal at this
7491 // point so handle the ICI.isEquality() cases
7492 if (ICI.getPredicate() == ICmpInst::ICMP_EQ)
7493 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse(*Context));
7494 if (ICI.getPredicate() == ICmpInst::ICMP_NE)
7495 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue(*Context));
7497 // Evaluate the comparison for LT (we invert for GT below). LE and GE cases
7498 // should have been folded away previously and not enter in here.
7501 // We're performing a signed comparison.
7502 if (cast<ConstantInt>(CI)->getValue().isNegative())
7503 Result = ConstantInt::getFalse(*Context); // X < (small) --> false
7505 Result = ConstantInt::getTrue(*Context); // X < (large) --> true
7507 // We're performing an unsigned comparison.
7509 // We're performing an unsigned comp with a sign extended value.
7510 // This is true if the input is >= 0. [aka >s -1]
7511 Constant *NegOne = Constant::getAllOnesValue(SrcTy);
7512 Result = Builder->CreateICmpSGT(LHSCIOp, NegOne, ICI.getName());
7514 // Unsigned extend & unsigned compare -> always true.
7515 Result = ConstantInt::getTrue(*Context);
7519 // Finally, return the value computed.
7520 if (ICI.getPredicate() == ICmpInst::ICMP_ULT ||
7521 ICI.getPredicate() == ICmpInst::ICMP_SLT)
7522 return ReplaceInstUsesWith(ICI, Result);
7524 assert((ICI.getPredicate()==ICmpInst::ICMP_UGT ||
7525 ICI.getPredicate()==ICmpInst::ICMP_SGT) &&
7526 "ICmp should be folded!");
7527 if (Constant *CI = dyn_cast<Constant>(Result))
7528 return ReplaceInstUsesWith(ICI, ConstantExpr::getNot(CI));
7529 return BinaryOperator::CreateNot(Result);
7532 Instruction *InstCombiner::visitShl(BinaryOperator &I) {
7533 return commonShiftTransforms(I);
7536 Instruction *InstCombiner::visitLShr(BinaryOperator &I) {
7537 return commonShiftTransforms(I);
7540 Instruction *InstCombiner::visitAShr(BinaryOperator &I) {
7541 if (Instruction *R = commonShiftTransforms(I))
7544 Value *Op0 = I.getOperand(0);
7546 // ashr int -1, X = -1 (for any arithmetic shift rights of ~0)
7547 if (ConstantInt *CSI = dyn_cast<ConstantInt>(Op0))
7548 if (CSI->isAllOnesValue())
7549 return ReplaceInstUsesWith(I, CSI);
7551 // See if we can turn a signed shr into an unsigned shr.
7552 if (MaskedValueIsZero(Op0,
7553 APInt::getSignBit(I.getType()->getScalarSizeInBits())))
7554 return BinaryOperator::CreateLShr(Op0, I.getOperand(1));
7556 // Arithmetic shifting an all-sign-bit value is a no-op.
7557 unsigned NumSignBits = ComputeNumSignBits(Op0);
7558 if (NumSignBits == Op0->getType()->getScalarSizeInBits())
7559 return ReplaceInstUsesWith(I, Op0);
7564 Instruction *InstCombiner::commonShiftTransforms(BinaryOperator &I) {
7565 assert(I.getOperand(1)->getType() == I.getOperand(0)->getType());
7566 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
7568 // shl X, 0 == X and shr X, 0 == X
7569 // shl 0, X == 0 and shr 0, X == 0
7570 if (Op1 == Constant::getNullValue(Op1->getType()) ||
7571 Op0 == Constant::getNullValue(Op0->getType()))
7572 return ReplaceInstUsesWith(I, Op0);
7574 if (isa<UndefValue>(Op0)) {
7575 if (I.getOpcode() == Instruction::AShr) // undef >>s X -> undef
7576 return ReplaceInstUsesWith(I, Op0);
7577 else // undef << X -> 0, undef >>u X -> 0
7578 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
7580 if (isa<UndefValue>(Op1)) {
7581 if (I.getOpcode() == Instruction::AShr) // X >>s undef -> X
7582 return ReplaceInstUsesWith(I, Op0);
7583 else // X << undef, X >>u undef -> 0
7584 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
7587 // See if we can fold away this shift.
7588 if (SimplifyDemandedInstructionBits(I))
7591 // Try to fold constant and into select arguments.
7592 if (isa<Constant>(Op0))
7593 if (SelectInst *SI = dyn_cast<SelectInst>(Op1))
7594 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
7597 if (ConstantInt *CUI = dyn_cast<ConstantInt>(Op1))
7598 if (Instruction *Res = FoldShiftByConstant(Op0, CUI, I))
7603 Instruction *InstCombiner::FoldShiftByConstant(Value *Op0, ConstantInt *Op1,
7604 BinaryOperator &I) {
7605 bool isLeftShift = I.getOpcode() == Instruction::Shl;
7607 // See if we can simplify any instructions used by the instruction whose sole
7608 // purpose is to compute bits we don't care about.
7609 uint32_t TypeBits = Op0->getType()->getScalarSizeInBits();
7611 // shl i32 X, 32 = 0 and srl i8 Y, 9 = 0, ... just don't eliminate
7614 if (Op1->uge(TypeBits)) {
7615 if (I.getOpcode() != Instruction::AShr)
7616 return ReplaceInstUsesWith(I, Constant::getNullValue(Op0->getType()));
7618 I.setOperand(1, ConstantInt::get(I.getType(), TypeBits-1));
7623 // ((X*C1) << C2) == (X * (C1 << C2))
7624 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(Op0))
7625 if (BO->getOpcode() == Instruction::Mul && isLeftShift)
7626 if (Constant *BOOp = dyn_cast<Constant>(BO->getOperand(1)))
7627 return BinaryOperator::CreateMul(BO->getOperand(0),
7628 ConstantExpr::getShl(BOOp, Op1));
7630 // Try to fold constant and into select arguments.
7631 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
7632 if (Instruction *R = FoldOpIntoSelect(I, SI, this))
7634 if (isa<PHINode>(Op0))
7635 if (Instruction *NV = FoldOpIntoPhi(I))
7638 // Fold shift2(trunc(shift1(x,c1)), c2) -> trunc(shift2(shift1(x,c1),c2))
7639 if (TruncInst *TI = dyn_cast<TruncInst>(Op0)) {
7640 Instruction *TrOp = dyn_cast<Instruction>(TI->getOperand(0));
7641 // If 'shift2' is an ashr, we would have to get the sign bit into a funny
7642 // place. Don't try to do this transformation in this case. Also, we
7643 // require that the input operand is a shift-by-constant so that we have
7644 // confidence that the shifts will get folded together. We could do this
7645 // xform in more cases, but it is unlikely to be profitable.
7646 if (TrOp && I.isLogicalShift() && TrOp->isShift() &&
7647 isa<ConstantInt>(TrOp->getOperand(1))) {
7648 // Okay, we'll do this xform. Make the shift of shift.
7649 Constant *ShAmt = ConstantExpr::getZExt(Op1, TrOp->getType());
7650 // (shift2 (shift1 & 0x00FF), c2)
7651 Value *NSh = Builder->CreateBinOp(I.getOpcode(), TrOp, ShAmt,I.getName());
7653 // For logical shifts, the truncation has the effect of making the high
7654 // part of the register be zeros. Emulate this by inserting an AND to
7655 // clear the top bits as needed. This 'and' will usually be zapped by
7656 // other xforms later if dead.
7657 unsigned SrcSize = TrOp->getType()->getScalarSizeInBits();
7658 unsigned DstSize = TI->getType()->getScalarSizeInBits();
7659 APInt MaskV(APInt::getLowBitsSet(SrcSize, DstSize));
7661 // The mask we constructed says what the trunc would do if occurring
7662 // between the shifts. We want to know the effect *after* the second
7663 // shift. We know that it is a logical shift by a constant, so adjust the
7664 // mask as appropriate.
7665 if (I.getOpcode() == Instruction::Shl)
7666 MaskV <<= Op1->getZExtValue();
7668 assert(I.getOpcode() == Instruction::LShr && "Unknown logical shift");
7669 MaskV = MaskV.lshr(Op1->getZExtValue());
7673 Value *And = Builder->CreateAnd(NSh, ConstantInt::get(*Context, MaskV),
7676 // Return the value truncated to the interesting size.
7677 return new TruncInst(And, I.getType());
7681 if (Op0->hasOneUse()) {
7682 if (BinaryOperator *Op0BO = dyn_cast<BinaryOperator>(Op0)) {
7683 // Turn ((X >> C) + Y) << C -> (X + (Y << C)) & (~0 << C)
7686 switch (Op0BO->getOpcode()) {
7688 case Instruction::Add:
7689 case Instruction::And:
7690 case Instruction::Or:
7691 case Instruction::Xor: {
7692 // These operators commute.
7693 // Turn (Y + (X >> C)) << C -> (X + (Y << C)) & (~0 << C)
7694 if (isLeftShift && Op0BO->getOperand(1)->hasOneUse() &&
7695 match(Op0BO->getOperand(1), m_Shr(m_Value(V1),
7696 m_Specific(Op1)))) {
7697 Value *YS = // (Y << C)
7698 Builder->CreateShl(Op0BO->getOperand(0), Op1, Op0BO->getName());
7700 Value *X = Builder->CreateBinOp(Op0BO->getOpcode(), YS, V1,
7701 Op0BO->getOperand(1)->getName());
7702 uint32_t Op1Val = Op1->getLimitedValue(TypeBits);
7703 return BinaryOperator::CreateAnd(X, ConstantInt::get(*Context,
7704 APInt::getHighBitsSet(TypeBits, TypeBits-Op1Val)));
7707 // Turn (Y + ((X >> C) & CC)) << C -> ((X & (CC << C)) + (Y << C))
7708 Value *Op0BOOp1 = Op0BO->getOperand(1);
7709 if (isLeftShift && Op0BOOp1->hasOneUse() &&
7711 m_And(m_Shr(m_Value(V1), m_Specific(Op1)),
7712 m_ConstantInt(CC))) &&
7713 cast<BinaryOperator>(Op0BOOp1)->getOperand(0)->hasOneUse()) {
7714 Value *YS = // (Y << C)
7715 Builder->CreateShl(Op0BO->getOperand(0), Op1,
7718 Value *XM = Builder->CreateAnd(V1, ConstantExpr::getShl(CC, Op1),
7719 V1->getName()+".mask");
7720 return BinaryOperator::Create(Op0BO->getOpcode(), YS, XM);
7725 case Instruction::Sub: {
7726 // Turn ((X >> C) + Y) << C -> (X + (Y << C)) & (~0 << C)
7727 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() &&
7728 match(Op0BO->getOperand(0), m_Shr(m_Value(V1),
7729 m_Specific(Op1)))) {
7730 Value *YS = // (Y << C)
7731 Builder->CreateShl(Op0BO->getOperand(1), Op1, Op0BO->getName());
7733 Value *X = Builder->CreateBinOp(Op0BO->getOpcode(), V1, YS,
7734 Op0BO->getOperand(0)->getName());
7735 uint32_t Op1Val = Op1->getLimitedValue(TypeBits);
7736 return BinaryOperator::CreateAnd(X, ConstantInt::get(*Context,
7737 APInt::getHighBitsSet(TypeBits, TypeBits-Op1Val)));
7740 // Turn (((X >> C)&CC) + Y) << C -> (X + (Y << C)) & (CC << C)
7741 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() &&
7742 match(Op0BO->getOperand(0),
7743 m_And(m_Shr(m_Value(V1), m_Value(V2)),
7744 m_ConstantInt(CC))) && V2 == Op1 &&
7745 cast<BinaryOperator>(Op0BO->getOperand(0))
7746 ->getOperand(0)->hasOneUse()) {
7747 Value *YS = // (Y << C)
7748 Builder->CreateShl(Op0BO->getOperand(1), Op1, Op0BO->getName());
7750 Value *XM = Builder->CreateAnd(V1, ConstantExpr::getShl(CC, Op1),
7751 V1->getName()+".mask");
7753 return BinaryOperator::Create(Op0BO->getOpcode(), XM, YS);
7761 // If the operand is an bitwise operator with a constant RHS, and the
7762 // shift is the only use, we can pull it out of the shift.
7763 if (ConstantInt *Op0C = dyn_cast<ConstantInt>(Op0BO->getOperand(1))) {
7764 bool isValid = true; // Valid only for And, Or, Xor
7765 bool highBitSet = false; // Transform if high bit of constant set?
7767 switch (Op0BO->getOpcode()) {
7768 default: isValid = false; break; // Do not perform transform!
7769 case Instruction::Add:
7770 isValid = isLeftShift;
7772 case Instruction::Or:
7773 case Instruction::Xor:
7776 case Instruction::And:
7781 // If this is a signed shift right, and the high bit is modified
7782 // by the logical operation, do not perform the transformation.
7783 // The highBitSet boolean indicates the value of the high bit of
7784 // the constant which would cause it to be modified for this
7787 if (isValid && I.getOpcode() == Instruction::AShr)
7788 isValid = Op0C->getValue()[TypeBits-1] == highBitSet;
7791 Constant *NewRHS = ConstantExpr::get(I.getOpcode(), Op0C, Op1);
7794 Builder->CreateBinOp(I.getOpcode(), Op0BO->getOperand(0), Op1);
7795 NewShift->takeName(Op0BO);
7797 return BinaryOperator::Create(Op0BO->getOpcode(), NewShift,
7804 // Find out if this is a shift of a shift by a constant.
7805 BinaryOperator *ShiftOp = dyn_cast<BinaryOperator>(Op0);
7806 if (ShiftOp && !ShiftOp->isShift())
7809 if (ShiftOp && isa<ConstantInt>(ShiftOp->getOperand(1))) {
7810 ConstantInt *ShiftAmt1C = cast<ConstantInt>(ShiftOp->getOperand(1));
7811 uint32_t ShiftAmt1 = ShiftAmt1C->getLimitedValue(TypeBits);
7812 uint32_t ShiftAmt2 = Op1->getLimitedValue(TypeBits);
7813 assert(ShiftAmt2 != 0 && "Should have been simplified earlier");
7814 if (ShiftAmt1 == 0) return 0; // Will be simplified in the future.
7815 Value *X = ShiftOp->getOperand(0);
7817 uint32_t AmtSum = ShiftAmt1+ShiftAmt2; // Fold into one big shift.
7819 const IntegerType *Ty = cast<IntegerType>(I.getType());
7821 // Check for (X << c1) << c2 and (X >> c1) >> c2
7822 if (I.getOpcode() == ShiftOp->getOpcode()) {
7823 // If this is oversized composite shift, then unsigned shifts get 0, ashr
7825 if (AmtSum >= TypeBits) {
7826 if (I.getOpcode() != Instruction::AShr)
7827 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
7828 AmtSum = TypeBits-1; // Saturate to 31 for i32 ashr.
7831 return BinaryOperator::Create(I.getOpcode(), X,
7832 ConstantInt::get(Ty, AmtSum));
7835 if (ShiftOp->getOpcode() == Instruction::LShr &&
7836 I.getOpcode() == Instruction::AShr) {
7837 if (AmtSum >= TypeBits)
7838 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
7840 // ((X >>u C1) >>s C2) -> (X >>u (C1+C2)) since C1 != 0.
7841 return BinaryOperator::CreateLShr(X, ConstantInt::get(Ty, AmtSum));
7844 if (ShiftOp->getOpcode() == Instruction::AShr &&
7845 I.getOpcode() == Instruction::LShr) {
7846 // ((X >>s C1) >>u C2) -> ((X >>s (C1+C2)) & mask) since C1 != 0.
7847 if (AmtSum >= TypeBits)
7848 AmtSum = TypeBits-1;
7850 Value *Shift = Builder->CreateAShr(X, ConstantInt::get(Ty, AmtSum));
7852 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt2));
7853 return BinaryOperator::CreateAnd(Shift, ConstantInt::get(*Context, Mask));
7856 // Okay, if we get here, one shift must be left, and the other shift must be
7857 // right. See if the amounts are equal.
7858 if (ShiftAmt1 == ShiftAmt2) {
7859 // If we have ((X >>? C) << C), turn this into X & (-1 << C).
7860 if (I.getOpcode() == Instruction::Shl) {
7861 APInt Mask(APInt::getHighBitsSet(TypeBits, TypeBits - ShiftAmt1));
7862 return BinaryOperator::CreateAnd(X, ConstantInt::get(*Context, Mask));
7864 // If we have ((X << C) >>u C), turn this into X & (-1 >>u C).
7865 if (I.getOpcode() == Instruction::LShr) {
7866 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt1));
7867 return BinaryOperator::CreateAnd(X, ConstantInt::get(*Context, Mask));
7869 // We can simplify ((X << C) >>s C) into a trunc + sext.
7870 // NOTE: we could do this for any C, but that would make 'unusual' integer
7871 // types. For now, just stick to ones well-supported by the code
7873 const Type *SExtType = 0;
7874 switch (Ty->getBitWidth() - ShiftAmt1) {
7881 SExtType = IntegerType::get(*Context, Ty->getBitWidth() - ShiftAmt1);
7886 return new SExtInst(Builder->CreateTrunc(X, SExtType, "sext"), Ty);
7887 // Otherwise, we can't handle it yet.
7888 } else if (ShiftAmt1 < ShiftAmt2) {
7889 uint32_t ShiftDiff = ShiftAmt2-ShiftAmt1;
7891 // (X >>? C1) << C2 --> X << (C2-C1) & (-1 << C2)
7892 if (I.getOpcode() == Instruction::Shl) {
7893 assert(ShiftOp->getOpcode() == Instruction::LShr ||
7894 ShiftOp->getOpcode() == Instruction::AShr);
7895 Value *Shift = Builder->CreateShl(X, ConstantInt::get(Ty, ShiftDiff));
7897 APInt Mask(APInt::getHighBitsSet(TypeBits, TypeBits - ShiftAmt2));
7898 return BinaryOperator::CreateAnd(Shift,
7899 ConstantInt::get(*Context, Mask));
7902 // (X << C1) >>u C2 --> X >>u (C2-C1) & (-1 >> C2)
7903 if (I.getOpcode() == Instruction::LShr) {
7904 assert(ShiftOp->getOpcode() == Instruction::Shl);
7905 Value *Shift = Builder->CreateLShr(X, ConstantInt::get(Ty, ShiftDiff));
7907 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt2));
7908 return BinaryOperator::CreateAnd(Shift,
7909 ConstantInt::get(*Context, Mask));
7912 // We can't handle (X << C1) >>s C2, it shifts arbitrary bits in.
7914 assert(ShiftAmt2 < ShiftAmt1);
7915 uint32_t ShiftDiff = ShiftAmt1-ShiftAmt2;
7917 // (X >>? C1) << C2 --> X >>? (C1-C2) & (-1 << C2)
7918 if (I.getOpcode() == Instruction::Shl) {
7919 assert(ShiftOp->getOpcode() == Instruction::LShr ||
7920 ShiftOp->getOpcode() == Instruction::AShr);
7921 Value *Shift = Builder->CreateBinOp(ShiftOp->getOpcode(), X,
7922 ConstantInt::get(Ty, ShiftDiff));
7924 APInt Mask(APInt::getHighBitsSet(TypeBits, TypeBits - ShiftAmt2));
7925 return BinaryOperator::CreateAnd(Shift,
7926 ConstantInt::get(*Context, Mask));
7929 // (X << C1) >>u C2 --> X << (C1-C2) & (-1 >> C2)
7930 if (I.getOpcode() == Instruction::LShr) {
7931 assert(ShiftOp->getOpcode() == Instruction::Shl);
7932 Value *Shift = Builder->CreateShl(X, ConstantInt::get(Ty, ShiftDiff));
7934 APInt Mask(APInt::getLowBitsSet(TypeBits, TypeBits - ShiftAmt2));
7935 return BinaryOperator::CreateAnd(Shift,
7936 ConstantInt::get(*Context, Mask));
7939 // We can't handle (X << C1) >>a C2, it shifts arbitrary bits in.
7946 /// DecomposeSimpleLinearExpr - Analyze 'Val', seeing if it is a simple linear
7947 /// expression. If so, decompose it, returning some value X, such that Val is
7950 static Value *DecomposeSimpleLinearExpr(Value *Val, unsigned &Scale,
7951 int &Offset, LLVMContext *Context) {
7952 assert(Val->getType() == Type::getInt32Ty(*Context) &&
7953 "Unexpected allocation size type!");
7954 if (ConstantInt *CI = dyn_cast<ConstantInt>(Val)) {
7955 Offset = CI->getZExtValue();
7957 return ConstantInt::get(Type::getInt32Ty(*Context), 0);
7958 } else if (BinaryOperator *I = dyn_cast<BinaryOperator>(Val)) {
7959 if (ConstantInt *RHS = dyn_cast<ConstantInt>(I->getOperand(1))) {
7960 if (I->getOpcode() == Instruction::Shl) {
7961 // This is a value scaled by '1 << the shift amt'.
7962 Scale = 1U << RHS->getZExtValue();
7964 return I->getOperand(0);
7965 } else if (I->getOpcode() == Instruction::Mul) {
7966 // This value is scaled by 'RHS'.
7967 Scale = RHS->getZExtValue();
7969 return I->getOperand(0);
7970 } else if (I->getOpcode() == Instruction::Add) {
7971 // We have X+C. Check to see if we really have (X*C2)+C1,
7972 // where C1 is divisible by C2.
7975 DecomposeSimpleLinearExpr(I->getOperand(0), SubScale,
7977 Offset += RHS->getZExtValue();
7984 // Otherwise, we can't look past this.
7991 /// PromoteCastOfAllocation - If we find a cast of an allocation instruction,
7992 /// try to eliminate the cast by moving the type information into the alloc.
7993 Instruction *InstCombiner::PromoteCastOfAllocation(BitCastInst &CI,
7995 const PointerType *PTy = cast<PointerType>(CI.getType());
7997 BuilderTy AllocaBuilder(*Builder);
7998 AllocaBuilder.SetInsertPoint(AI.getParent(), &AI);
8000 // Remove any uses of AI that are dead.
8001 assert(!CI.use_empty() && "Dead instructions should be removed earlier!");
8003 for (Value::use_iterator UI = AI.use_begin(), E = AI.use_end(); UI != E; ) {
8004 Instruction *User = cast<Instruction>(*UI++);
8005 if (isInstructionTriviallyDead(User)) {
8006 while (UI != E && *UI == User)
8007 ++UI; // If this instruction uses AI more than once, don't break UI.
8010 DEBUG(errs() << "IC: DCE: " << *User << '\n');
8011 EraseInstFromFunction(*User);
8015 // This requires TargetData to get the alloca alignment and size information.
8018 // Get the type really allocated and the type casted to.
8019 const Type *AllocElTy = AI.getAllocatedType();
8020 const Type *CastElTy = PTy->getElementType();
8021 if (!AllocElTy->isSized() || !CastElTy->isSized()) return 0;
8023 unsigned AllocElTyAlign = TD->getABITypeAlignment(AllocElTy);
8024 unsigned CastElTyAlign = TD->getABITypeAlignment(CastElTy);
8025 if (CastElTyAlign < AllocElTyAlign) return 0;
8027 // If the allocation has multiple uses, only promote it if we are strictly
8028 // increasing the alignment of the resultant allocation. If we keep it the
8029 // same, we open the door to infinite loops of various kinds. (A reference
8030 // from a dbg.declare doesn't count as a use for this purpose.)
8031 if (!AI.hasOneUse() && !hasOneUsePlusDeclare(&AI) &&
8032 CastElTyAlign == AllocElTyAlign) return 0;
8034 uint64_t AllocElTySize = TD->getTypeAllocSize(AllocElTy);
8035 uint64_t CastElTySize = TD->getTypeAllocSize(CastElTy);
8036 if (CastElTySize == 0 || AllocElTySize == 0) return 0;
8038 // See if we can satisfy the modulus by pulling a scale out of the array
8040 unsigned ArraySizeScale;
8042 Value *NumElements = // See if the array size is a decomposable linear expr.
8043 DecomposeSimpleLinearExpr(AI.getOperand(0), ArraySizeScale,
8044 ArrayOffset, Context);
8046 // If we can now satisfy the modulus, by using a non-1 scale, we really can
8048 if ((AllocElTySize*ArraySizeScale) % CastElTySize != 0 ||
8049 (AllocElTySize*ArrayOffset ) % CastElTySize != 0) return 0;
8051 unsigned Scale = (AllocElTySize*ArraySizeScale)/CastElTySize;
8056 Amt = ConstantInt::get(Type::getInt32Ty(*Context), Scale);
8057 // Insert before the alloca, not before the cast.
8058 Amt = AllocaBuilder.CreateMul(Amt, NumElements, "tmp");
8061 if (int Offset = (AllocElTySize*ArrayOffset)/CastElTySize) {
8062 Value *Off = ConstantInt::get(Type::getInt32Ty(*Context), Offset, true);
8063 Amt = AllocaBuilder.CreateAdd(Amt, Off, "tmp");
8066 AllocaInst *New = AllocaBuilder.CreateAlloca(CastElTy, Amt);
8067 New->setAlignment(AI.getAlignment());
8070 // If the allocation has one real use plus a dbg.declare, just remove the
8072 if (DbgDeclareInst *DI = hasOneUsePlusDeclare(&AI)) {
8073 EraseInstFromFunction(*DI);
8075 // If the allocation has multiple real uses, insert a cast and change all
8076 // things that used it to use the new cast. This will also hack on CI, but it
8078 else if (!AI.hasOneUse()) {
8079 // New is the allocation instruction, pointer typed. AI is the original
8080 // allocation instruction, also pointer typed. Thus, cast to use is BitCast.
8081 Value *NewCast = AllocaBuilder.CreateBitCast(New, AI.getType(), "tmpcast");
8082 AI.replaceAllUsesWith(NewCast);
8084 return ReplaceInstUsesWith(CI, New);
8087 /// CanEvaluateInDifferentType - Return true if we can take the specified value
8088 /// and return it as type Ty without inserting any new casts and without
8089 /// changing the computed value. This is used by code that tries to decide
8090 /// whether promoting or shrinking integer operations to wider or smaller types
8091 /// will allow us to eliminate a truncate or extend.
8093 /// This is a truncation operation if Ty is smaller than V->getType(), or an
8094 /// extension operation if Ty is larger.
8096 /// If CastOpc is a truncation, then Ty will be a type smaller than V. We
8097 /// should return true if trunc(V) can be computed by computing V in the smaller
8098 /// type. If V is an instruction, then trunc(inst(x,y)) can be computed as
8099 /// inst(trunc(x),trunc(y)), which only makes sense if x and y can be
8100 /// efficiently truncated.
8102 /// If CastOpc is a sext or zext, we are asking if the low bits of the value can
8103 /// bit computed in a larger type, which is then and'd or sext_in_reg'd to get
8104 /// the final result.
8105 bool InstCombiner::CanEvaluateInDifferentType(Value *V, const Type *Ty,
8107 int &NumCastsRemoved){
8108 // We can always evaluate constants in another type.
8109 if (isa<Constant>(V))
8112 Instruction *I = dyn_cast<Instruction>(V);
8113 if (!I) return false;
8115 const Type *OrigTy = V->getType();
8117 // If this is an extension or truncate, we can often eliminate it.
8118 if (isa<TruncInst>(I) || isa<ZExtInst>(I) || isa<SExtInst>(I)) {
8119 // If this is a cast from the destination type, we can trivially eliminate
8120 // it, and this will remove a cast overall.
8121 if (I->getOperand(0)->getType() == Ty) {
8122 // If the first operand is itself a cast, and is eliminable, do not count
8123 // this as an eliminable cast. We would prefer to eliminate those two
8125 if (!isa<CastInst>(I->getOperand(0)) && I->hasOneUse())
8131 // We can't extend or shrink something that has multiple uses: doing so would
8132 // require duplicating the instruction in general, which isn't profitable.
8133 if (!I->hasOneUse()) return false;
8135 unsigned Opc = I->getOpcode();
8137 case Instruction::Add:
8138 case Instruction::Sub:
8139 case Instruction::Mul:
8140 case Instruction::And:
8141 case Instruction::Or:
8142 case Instruction::Xor:
8143 // These operators can all arbitrarily be extended or truncated.
8144 return CanEvaluateInDifferentType(I->getOperand(0), Ty, CastOpc,
8146 CanEvaluateInDifferentType(I->getOperand(1), Ty, CastOpc,
8149 case Instruction::UDiv:
8150 case Instruction::URem: {
8151 // UDiv and URem can be truncated if all the truncated bits are zero.
8152 uint32_t OrigBitWidth = OrigTy->getScalarSizeInBits();
8153 uint32_t BitWidth = Ty->getScalarSizeInBits();
8154 if (BitWidth < OrigBitWidth) {
8155 APInt Mask = APInt::getHighBitsSet(OrigBitWidth, OrigBitWidth-BitWidth);
8156 if (MaskedValueIsZero(I->getOperand(0), Mask) &&
8157 MaskedValueIsZero(I->getOperand(1), Mask)) {
8158 return CanEvaluateInDifferentType(I->getOperand(0), Ty, CastOpc,
8160 CanEvaluateInDifferentType(I->getOperand(1), Ty, CastOpc,
8166 case Instruction::Shl:
8167 // If we are truncating the result of this SHL, and if it's a shift of a
8168 // constant amount, we can always perform a SHL in a smaller type.
8169 if (ConstantInt *CI = dyn_cast<ConstantInt>(I->getOperand(1))) {
8170 uint32_t BitWidth = Ty->getScalarSizeInBits();
8171 if (BitWidth < OrigTy->getScalarSizeInBits() &&
8172 CI->getLimitedValue(BitWidth) < BitWidth)
8173 return CanEvaluateInDifferentType(I->getOperand(0), Ty, CastOpc,
8177 case Instruction::LShr:
8178 // If this is a truncate of a logical shr, we can truncate it to a smaller
8179 // lshr iff we know that the bits we would otherwise be shifting in are
8181 if (ConstantInt *CI = dyn_cast<ConstantInt>(I->getOperand(1))) {
8182 uint32_t OrigBitWidth = OrigTy->getScalarSizeInBits();
8183 uint32_t BitWidth = Ty->getScalarSizeInBits();
8184 if (BitWidth < OrigBitWidth &&
8185 MaskedValueIsZero(I->getOperand(0),
8186 APInt::getHighBitsSet(OrigBitWidth, OrigBitWidth-BitWidth)) &&
8187 CI->getLimitedValue(BitWidth) < BitWidth) {
8188 return CanEvaluateInDifferentType(I->getOperand(0), Ty, CastOpc,
8193 case Instruction::ZExt:
8194 case Instruction::SExt:
8195 case Instruction::Trunc:
8196 // If this is the same kind of case as our original (e.g. zext+zext), we
8197 // can safely replace it. Note that replacing it does not reduce the number
8198 // of casts in the input.
8202 // sext (zext ty1), ty2 -> zext ty2
8203 if (CastOpc == Instruction::SExt && Opc == Instruction::ZExt)
8206 case Instruction::Select: {
8207 SelectInst *SI = cast<SelectInst>(I);
8208 return CanEvaluateInDifferentType(SI->getTrueValue(), Ty, CastOpc,
8210 CanEvaluateInDifferentType(SI->getFalseValue(), Ty, CastOpc,
8213 case Instruction::PHI: {
8214 // We can change a phi if we can change all operands.
8215 PHINode *PN = cast<PHINode>(I);
8216 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
8217 if (!CanEvaluateInDifferentType(PN->getIncomingValue(i), Ty, CastOpc,
8223 // TODO: Can handle more cases here.
8230 /// EvaluateInDifferentType - Given an expression that
8231 /// CanEvaluateInDifferentType returns true for, actually insert the code to
8232 /// evaluate the expression.
8233 Value *InstCombiner::EvaluateInDifferentType(Value *V, const Type *Ty,
8235 if (Constant *C = dyn_cast<Constant>(V))
8236 return ConstantExpr::getIntegerCast(C, Ty, isSigned /*Sext or ZExt*/);
8238 // Otherwise, it must be an instruction.
8239 Instruction *I = cast<Instruction>(V);
8240 Instruction *Res = 0;
8241 unsigned Opc = I->getOpcode();
8243 case Instruction::Add:
8244 case Instruction::Sub:
8245 case Instruction::Mul:
8246 case Instruction::And:
8247 case Instruction::Or:
8248 case Instruction::Xor:
8249 case Instruction::AShr:
8250 case Instruction::LShr:
8251 case Instruction::Shl:
8252 case Instruction::UDiv:
8253 case Instruction::URem: {
8254 Value *LHS = EvaluateInDifferentType(I->getOperand(0), Ty, isSigned);
8255 Value *RHS = EvaluateInDifferentType(I->getOperand(1), Ty, isSigned);
8256 Res = BinaryOperator::Create((Instruction::BinaryOps)Opc, LHS, RHS);
8259 case Instruction::Trunc:
8260 case Instruction::ZExt:
8261 case Instruction::SExt:
8262 // If the source type of the cast is the type we're trying for then we can
8263 // just return the source. There's no need to insert it because it is not
8265 if (I->getOperand(0)->getType() == Ty)
8266 return I->getOperand(0);
8268 // Otherwise, must be the same type of cast, so just reinsert a new one.
8269 Res = CastInst::Create(cast<CastInst>(I)->getOpcode(), I->getOperand(0),Ty);
8271 case Instruction::Select: {
8272 Value *True = EvaluateInDifferentType(I->getOperand(1), Ty, isSigned);
8273 Value *False = EvaluateInDifferentType(I->getOperand(2), Ty, isSigned);
8274 Res = SelectInst::Create(I->getOperand(0), True, False);
8277 case Instruction::PHI: {
8278 PHINode *OPN = cast<PHINode>(I);
8279 PHINode *NPN = PHINode::Create(Ty);
8280 for (unsigned i = 0, e = OPN->getNumIncomingValues(); i != e; ++i) {
8281 Value *V =EvaluateInDifferentType(OPN->getIncomingValue(i), Ty, isSigned);
8282 NPN->addIncoming(V, OPN->getIncomingBlock(i));
8288 // TODO: Can handle more cases here.
8289 llvm_unreachable("Unreachable!");
8294 return InsertNewInstBefore(Res, *I);
8297 /// @brief Implement the transforms common to all CastInst visitors.
8298 Instruction *InstCombiner::commonCastTransforms(CastInst &CI) {
8299 Value *Src = CI.getOperand(0);
8301 // Many cases of "cast of a cast" are eliminable. If it's eliminable we just
8302 // eliminate it now.
8303 if (CastInst *CSrc = dyn_cast<CastInst>(Src)) { // A->B->C cast
8304 if (Instruction::CastOps opc =
8305 isEliminableCastPair(CSrc, CI.getOpcode(), CI.getType(), TD)) {
8306 // The first cast (CSrc) is eliminable so we need to fix up or replace
8307 // the second cast (CI). CSrc will then have a good chance of being dead.
8308 return CastInst::Create(opc, CSrc->getOperand(0), CI.getType());
8312 // If we are casting a select then fold the cast into the select
8313 if (SelectInst *SI = dyn_cast<SelectInst>(Src))
8314 if (Instruction *NV = FoldOpIntoSelect(CI, SI, this))
8317 // If we are casting a PHI then fold the cast into the PHI
8318 if (isa<PHINode>(Src)) {
8319 // We don't do this if this would create a PHI node with an illegal type if
8320 // it is currently legal.
8321 if (!isa<IntegerType>(Src->getType()) ||
8322 !isa<IntegerType>(CI.getType()) ||
8323 ShouldChangeType(CI.getType(), Src->getType(), TD))
8324 if (Instruction *NV = FoldOpIntoPhi(CI))
8331 /// FindElementAtOffset - Given a type and a constant offset, determine whether
8332 /// or not there is a sequence of GEP indices into the type that will land us at
8333 /// the specified offset. If so, fill them into NewIndices and return the
8334 /// resultant element type, otherwise return null.
8335 static const Type *FindElementAtOffset(const Type *Ty, int64_t Offset,
8336 SmallVectorImpl<Value*> &NewIndices,
8337 const TargetData *TD,
8338 LLVMContext *Context) {
8340 if (!Ty->isSized()) return 0;
8342 // Start with the index over the outer type. Note that the type size
8343 // might be zero (even if the offset isn't zero) if the indexed type
8344 // is something like [0 x {int, int}]
8345 const Type *IntPtrTy = TD->getIntPtrType(*Context);
8346 int64_t FirstIdx = 0;
8347 if (int64_t TySize = TD->getTypeAllocSize(Ty)) {
8348 FirstIdx = Offset/TySize;
8349 Offset -= FirstIdx*TySize;
8351 // Handle hosts where % returns negative instead of values [0..TySize).
8355 assert(Offset >= 0);
8357 assert((uint64_t)Offset < (uint64_t)TySize && "Out of range offset");
8360 NewIndices.push_back(ConstantInt::get(IntPtrTy, FirstIdx));
8362 // Index into the types. If we fail, set OrigBase to null.
8364 // Indexing into tail padding between struct/array elements.
8365 if (uint64_t(Offset*8) >= TD->getTypeSizeInBits(Ty))
8368 if (const StructType *STy = dyn_cast<StructType>(Ty)) {
8369 const StructLayout *SL = TD->getStructLayout(STy);
8370 assert(Offset < (int64_t)SL->getSizeInBytes() &&
8371 "Offset must stay within the indexed type");
8373 unsigned Elt = SL->getElementContainingOffset(Offset);
8374 NewIndices.push_back(ConstantInt::get(Type::getInt32Ty(*Context), Elt));
8376 Offset -= SL->getElementOffset(Elt);
8377 Ty = STy->getElementType(Elt);
8378 } else if (const ArrayType *AT = dyn_cast<ArrayType>(Ty)) {
8379 uint64_t EltSize = TD->getTypeAllocSize(AT->getElementType());
8380 assert(EltSize && "Cannot index into a zero-sized array");
8381 NewIndices.push_back(ConstantInt::get(IntPtrTy,Offset/EltSize));
8383 Ty = AT->getElementType();
8385 // Otherwise, we can't index into the middle of this atomic type, bail.
8393 /// @brief Implement the transforms for cast of pointer (bitcast/ptrtoint)
8394 Instruction *InstCombiner::commonPointerCastTransforms(CastInst &CI) {
8395 Value *Src = CI.getOperand(0);
8397 if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Src)) {
8398 // If casting the result of a getelementptr instruction with no offset, turn
8399 // this into a cast of the original pointer!
8400 if (GEP->hasAllZeroIndices()) {
8401 // Changing the cast operand is usually not a good idea but it is safe
8402 // here because the pointer operand is being replaced with another
8403 // pointer operand so the opcode doesn't need to change.
8405 CI.setOperand(0, GEP->getOperand(0));
8409 // If the GEP has a single use, and the base pointer is a bitcast, and the
8410 // GEP computes a constant offset, see if we can convert these three
8411 // instructions into fewer. This typically happens with unions and other
8412 // non-type-safe code.
8413 if (TD && GEP->hasOneUse() && isa<BitCastInst>(GEP->getOperand(0))) {
8414 if (GEP->hasAllConstantIndices()) {
8415 // We are guaranteed to get a constant from EmitGEPOffset.
8416 ConstantInt *OffsetV = cast<ConstantInt>(EmitGEPOffset(GEP, *this));
8417 int64_t Offset = OffsetV->getSExtValue();
8419 // Get the base pointer input of the bitcast, and the type it points to.
8420 Value *OrigBase = cast<BitCastInst>(GEP->getOperand(0))->getOperand(0);
8421 const Type *GEPIdxTy =
8422 cast<PointerType>(OrigBase->getType())->getElementType();
8423 SmallVector<Value*, 8> NewIndices;
8424 if (FindElementAtOffset(GEPIdxTy, Offset, NewIndices, TD, Context)) {
8425 // If we were able to index down into an element, create the GEP
8426 // and bitcast the result. This eliminates one bitcast, potentially
8428 Value *NGEP = cast<GEPOperator>(GEP)->isInBounds() ?
8429 Builder->CreateInBoundsGEP(OrigBase,
8430 NewIndices.begin(), NewIndices.end()) :
8431 Builder->CreateGEP(OrigBase, NewIndices.begin(), NewIndices.end());
8432 NGEP->takeName(GEP);
8434 if (isa<BitCastInst>(CI))
8435 return new BitCastInst(NGEP, CI.getType());
8436 assert(isa<PtrToIntInst>(CI));
8437 return new PtrToIntInst(NGEP, CI.getType());
8443 return commonCastTransforms(CI);
8446 /// commonIntCastTransforms - This function implements the common transforms
8447 /// for trunc, zext, and sext.
8448 Instruction *InstCombiner::commonIntCastTransforms(CastInst &CI) {
8449 if (Instruction *Result = commonCastTransforms(CI))
8452 Value *Src = CI.getOperand(0);
8453 const Type *SrcTy = Src->getType();
8454 const Type *DestTy = CI.getType();
8455 uint32_t SrcBitSize = SrcTy->getScalarSizeInBits();
8456 uint32_t DestBitSize = DestTy->getScalarSizeInBits();
8458 // See if we can simplify any instructions used by the LHS whose sole
8459 // purpose is to compute bits we don't care about.
8460 if (SimplifyDemandedInstructionBits(CI))
8463 // If the source isn't an instruction or has more than one use then we
8464 // can't do anything more.
8465 Instruction *SrcI = dyn_cast<Instruction>(Src);
8466 if (!SrcI || !Src->hasOneUse())
8469 // Attempt to propagate the cast into the instruction for int->int casts.
8470 int NumCastsRemoved = 0;
8471 // Only do this if the dest type is a simple type, don't convert the
8472 // expression tree to something weird like i93 unless the source is also
8474 if ((isa<VectorType>(DestTy) ||
8475 ShouldChangeType(SrcI->getType(), DestTy, TD)) &&
8476 CanEvaluateInDifferentType(SrcI, DestTy,
8477 CI.getOpcode(), NumCastsRemoved)) {
8478 // If this cast is a truncate, evaluting in a different type always
8479 // eliminates the cast, so it is always a win. If this is a zero-extension,
8480 // we need to do an AND to maintain the clear top-part of the computation,
8481 // so we require that the input have eliminated at least one cast. If this
8482 // is a sign extension, we insert two new casts (to do the extension) so we
8483 // require that two casts have been eliminated.
8484 bool DoXForm = false;
8485 bool JustReplace = false;
8486 switch (CI.getOpcode()) {
8488 // All the others use floating point so we shouldn't actually
8489 // get here because of the check above.
8490 llvm_unreachable("Unknown cast type");
8491 case Instruction::Trunc:
8494 case Instruction::ZExt: {
8495 DoXForm = NumCastsRemoved >= 1;
8497 if (!DoXForm && 0) {
8498 // If it's unnecessary to issue an AND to clear the high bits, it's
8499 // always profitable to do this xform.
8500 Value *TryRes = EvaluateInDifferentType(SrcI, DestTy, false);
8501 APInt Mask(APInt::getBitsSet(DestBitSize, SrcBitSize, DestBitSize));
8502 if (MaskedValueIsZero(TryRes, Mask))
8503 return ReplaceInstUsesWith(CI, TryRes);
8505 if (Instruction *TryI = dyn_cast<Instruction>(TryRes))
8506 if (TryI->use_empty())
8507 EraseInstFromFunction(*TryI);
8511 case Instruction::SExt: {
8512 DoXForm = NumCastsRemoved >= 2;
8513 if (!DoXForm && !isa<TruncInst>(SrcI) && 0) {
8514 // If we do not have to emit the truncate + sext pair, then it's always
8515 // profitable to do this xform.
8517 // It's not safe to eliminate the trunc + sext pair if one of the
8518 // eliminated cast is a truncate. e.g.
8519 // t2 = trunc i32 t1 to i16
8520 // t3 = sext i16 t2 to i32
8523 Value *TryRes = EvaluateInDifferentType(SrcI, DestTy, true);
8524 unsigned NumSignBits = ComputeNumSignBits(TryRes);
8525 if (NumSignBits > (DestBitSize - SrcBitSize))
8526 return ReplaceInstUsesWith(CI, TryRes);
8528 if (Instruction *TryI = dyn_cast<Instruction>(TryRes))
8529 if (TryI->use_empty())
8530 EraseInstFromFunction(*TryI);
8537 DEBUG(errs() << "ICE: EvaluateInDifferentType converting expression type"
8538 " to avoid cast: " << CI);
8539 Value *Res = EvaluateInDifferentType(SrcI, DestTy,
8540 CI.getOpcode() == Instruction::SExt);
8542 // Just replace this cast with the result.
8543 return ReplaceInstUsesWith(CI, Res);
8545 assert(Res->getType() == DestTy);
8546 switch (CI.getOpcode()) {
8547 default: llvm_unreachable("Unknown cast type!");
8548 case Instruction::Trunc:
8549 // Just replace this cast with the result.
8550 return ReplaceInstUsesWith(CI, Res);
8551 case Instruction::ZExt: {
8552 assert(SrcBitSize < DestBitSize && "Not a zext?");
8554 // If the high bits are already zero, just replace this cast with the
8556 APInt Mask(APInt::getBitsSet(DestBitSize, SrcBitSize, DestBitSize));
8557 if (MaskedValueIsZero(Res, Mask))
8558 return ReplaceInstUsesWith(CI, Res);
8560 // We need to emit an AND to clear the high bits.
8561 Constant *C = ConstantInt::get(*Context,
8562 APInt::getLowBitsSet(DestBitSize, SrcBitSize));
8563 return BinaryOperator::CreateAnd(Res, C);
8565 case Instruction::SExt: {
8566 // If the high bits are already filled with sign bit, just replace this
8567 // cast with the result.
8568 unsigned NumSignBits = ComputeNumSignBits(Res);
8569 if (NumSignBits > (DestBitSize - SrcBitSize))
8570 return ReplaceInstUsesWith(CI, Res);
8572 // We need to emit a cast to truncate, then a cast to sext.
8573 return new SExtInst(Builder->CreateTrunc(Res, Src->getType()), DestTy);
8579 Value *Op0 = SrcI->getNumOperands() > 0 ? SrcI->getOperand(0) : 0;
8580 Value *Op1 = SrcI->getNumOperands() > 1 ? SrcI->getOperand(1) : 0;
8582 switch (SrcI->getOpcode()) {
8583 case Instruction::Add:
8584 case Instruction::Mul:
8585 case Instruction::And:
8586 case Instruction::Or:
8587 case Instruction::Xor:
8588 // If we are discarding information, rewrite.
8589 if (DestBitSize < SrcBitSize && DestBitSize != 1) {
8590 // Don't insert two casts unless at least one can be eliminated.
8591 if (!ValueRequiresCast(CI.getOpcode(), Op1, DestTy, TD) ||
8592 !ValueRequiresCast(CI.getOpcode(), Op0, DestTy, TD)) {
8593 Value *Op0c = Builder->CreateTrunc(Op0, DestTy, Op0->getName());
8594 Value *Op1c = Builder->CreateTrunc(Op1, DestTy, Op1->getName());
8595 return BinaryOperator::Create(
8596 cast<BinaryOperator>(SrcI)->getOpcode(), Op0c, Op1c);
8600 // cast (xor bool X, true) to int --> xor (cast bool X to int), 1
8601 if (isa<ZExtInst>(CI) && SrcBitSize == 1 &&
8602 SrcI->getOpcode() == Instruction::Xor &&
8603 Op1 == ConstantInt::getTrue(*Context) &&
8604 (!Op0->hasOneUse() || !isa<CmpInst>(Op0))) {
8605 Value *New = Builder->CreateZExt(Op0, DestTy, Op0->getName());
8606 return BinaryOperator::CreateXor(New,
8607 ConstantInt::get(CI.getType(), 1));
8611 case Instruction::Shl: {
8612 // Canonicalize trunc inside shl, if we can.
8613 ConstantInt *CI = dyn_cast<ConstantInt>(Op1);
8614 if (CI && DestBitSize < SrcBitSize &&
8615 CI->getLimitedValue(DestBitSize) < DestBitSize) {
8616 Value *Op0c = Builder->CreateTrunc(Op0, DestTy, Op0->getName());
8617 Value *Op1c = Builder->CreateTrunc(Op1, DestTy, Op1->getName());
8618 return BinaryOperator::CreateShl(Op0c, Op1c);
8626 Instruction *InstCombiner::visitTrunc(TruncInst &CI) {
8627 if (Instruction *Result = commonIntCastTransforms(CI))
8630 Value *Src = CI.getOperand(0);
8631 const Type *Ty = CI.getType();
8632 uint32_t DestBitWidth = Ty->getScalarSizeInBits();
8633 uint32_t SrcBitWidth = Src->getType()->getScalarSizeInBits();
8635 // Canonicalize trunc x to i1 -> (icmp ne (and x, 1), 0)
8636 if (DestBitWidth == 1) {
8637 Constant *One = ConstantInt::get(Src->getType(), 1);
8638 Src = Builder->CreateAnd(Src, One, "tmp");
8639 Value *Zero = Constant::getNullValue(Src->getType());
8640 return new ICmpInst(ICmpInst::ICMP_NE, Src, Zero);
8643 // Optimize trunc(lshr(), c) to pull the shift through the truncate.
8644 ConstantInt *ShAmtV = 0;
8646 if (Src->hasOneUse() &&
8647 match(Src, m_LShr(m_Value(ShiftOp), m_ConstantInt(ShAmtV)))) {
8648 uint32_t ShAmt = ShAmtV->getLimitedValue(SrcBitWidth);
8650 // Get a mask for the bits shifting in.
8651 APInt Mask(APInt::getLowBitsSet(SrcBitWidth, ShAmt).shl(DestBitWidth));
8652 if (MaskedValueIsZero(ShiftOp, Mask)) {
8653 if (ShAmt >= DestBitWidth) // All zeros.
8654 return ReplaceInstUsesWith(CI, Constant::getNullValue(Ty));
8656 // Okay, we can shrink this. Truncate the input, then return a new
8658 Value *V1 = Builder->CreateTrunc(ShiftOp, Ty, ShiftOp->getName());
8659 Value *V2 = ConstantExpr::getTrunc(ShAmtV, Ty);
8660 return BinaryOperator::CreateLShr(V1, V2);
8667 /// transformZExtICmp - Transform (zext icmp) to bitwise / integer operations
8668 /// in order to eliminate the icmp.
8669 Instruction *InstCombiner::transformZExtICmp(ICmpInst *ICI, Instruction &CI,
8671 // If we are just checking for a icmp eq of a single bit and zext'ing it
8672 // to an integer, then shift the bit to the appropriate place and then
8673 // cast to integer to avoid the comparison.
8674 if (ConstantInt *Op1C = dyn_cast<ConstantInt>(ICI->getOperand(1))) {
8675 const APInt &Op1CV = Op1C->getValue();
8677 // zext (x <s 0) to i32 --> x>>u31 true if signbit set.
8678 // zext (x >s -1) to i32 --> (x>>u31)^1 true if signbit clear.
8679 if ((ICI->getPredicate() == ICmpInst::ICMP_SLT && Op1CV == 0) ||
8680 (ICI->getPredicate() == ICmpInst::ICMP_SGT &&Op1CV.isAllOnesValue())) {
8681 if (!DoXform) return ICI;
8683 Value *In = ICI->getOperand(0);
8684 Value *Sh = ConstantInt::get(In->getType(),
8685 In->getType()->getScalarSizeInBits()-1);
8686 In = Builder->CreateLShr(In, Sh, In->getName()+".lobit");
8687 if (In->getType() != CI.getType())
8688 In = Builder->CreateIntCast(In, CI.getType(), false/*ZExt*/, "tmp");
8690 if (ICI->getPredicate() == ICmpInst::ICMP_SGT) {
8691 Constant *One = ConstantInt::get(In->getType(), 1);
8692 In = Builder->CreateXor(In, One, In->getName()+".not");
8695 return ReplaceInstUsesWith(CI, In);
8700 // zext (X == 0) to i32 --> X^1 iff X has only the low bit set.
8701 // zext (X == 0) to i32 --> (X>>1)^1 iff X has only the 2nd bit set.
8702 // zext (X == 1) to i32 --> X iff X has only the low bit set.
8703 // zext (X == 2) to i32 --> X>>1 iff X has only the 2nd bit set.
8704 // zext (X != 0) to i32 --> X iff X has only the low bit set.
8705 // zext (X != 0) to i32 --> X>>1 iff X has only the 2nd bit set.
8706 // zext (X != 1) to i32 --> X^1 iff X has only the low bit set.
8707 // zext (X != 2) to i32 --> (X>>1)^1 iff X has only the 2nd bit set.
8708 if ((Op1CV == 0 || Op1CV.isPowerOf2()) &&
8709 // This only works for EQ and NE
8710 ICI->isEquality()) {
8711 // If Op1C some other power of two, convert:
8712 uint32_t BitWidth = Op1C->getType()->getBitWidth();
8713 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
8714 APInt TypeMask(APInt::getAllOnesValue(BitWidth));
8715 ComputeMaskedBits(ICI->getOperand(0), TypeMask, KnownZero, KnownOne);
8717 APInt KnownZeroMask(~KnownZero);
8718 if (KnownZeroMask.isPowerOf2()) { // Exactly 1 possible 1?
8719 if (!DoXform) return ICI;
8721 bool isNE = ICI->getPredicate() == ICmpInst::ICMP_NE;
8722 if (Op1CV != 0 && (Op1CV != KnownZeroMask)) {
8723 // (X&4) == 2 --> false
8724 // (X&4) != 2 --> true
8725 Constant *Res = ConstantInt::get(Type::getInt1Ty(*Context), isNE);
8726 Res = ConstantExpr::getZExt(Res, CI.getType());
8727 return ReplaceInstUsesWith(CI, Res);
8730 uint32_t ShiftAmt = KnownZeroMask.logBase2();
8731 Value *In = ICI->getOperand(0);
8733 // Perform a logical shr by shiftamt.
8734 // Insert the shift to put the result in the low bit.
8735 In = Builder->CreateLShr(In, ConstantInt::get(In->getType(),ShiftAmt),
8736 In->getName()+".lobit");
8739 if ((Op1CV != 0) == isNE) { // Toggle the low bit.
8740 Constant *One = ConstantInt::get(In->getType(), 1);
8741 In = Builder->CreateXor(In, One, "tmp");
8744 if (CI.getType() == In->getType())
8745 return ReplaceInstUsesWith(CI, In);
8747 return CastInst::CreateIntegerCast(In, CI.getType(), false/*ZExt*/);
8752 // icmp ne A, B is equal to xor A, B when A and B only really have one bit.
8753 // It is also profitable to transform icmp eq into not(xor(A, B)) because that
8754 // may lead to additional simplifications.
8755 if (ICI->isEquality() && CI.getType() == ICI->getOperand(0)->getType()) {
8756 if (const IntegerType *ITy = dyn_cast<IntegerType>(CI.getType())) {
8757 uint32_t BitWidth = ITy->getBitWidth();
8758 Value *LHS = ICI->getOperand(0);
8759 Value *RHS = ICI->getOperand(1);
8761 APInt KnownZeroLHS(BitWidth, 0), KnownOneLHS(BitWidth, 0);
8762 APInt KnownZeroRHS(BitWidth, 0), KnownOneRHS(BitWidth, 0);
8763 APInt TypeMask(APInt::getAllOnesValue(BitWidth));
8764 ComputeMaskedBits(LHS, TypeMask, KnownZeroLHS, KnownOneLHS);
8765 ComputeMaskedBits(RHS, TypeMask, KnownZeroRHS, KnownOneRHS);
8767 if (KnownZeroLHS == KnownZeroRHS && KnownOneLHS == KnownOneRHS) {
8768 APInt KnownBits = KnownZeroLHS | KnownOneLHS;
8769 APInt UnknownBit = ~KnownBits;
8770 if (UnknownBit.countPopulation() == 1) {
8771 if (!DoXform) return ICI;
8773 Value *Result = Builder->CreateXor(LHS, RHS);
8775 // Mask off any bits that are set and won't be shifted away.
8776 if (KnownOneLHS.uge(UnknownBit))
8777 Result = Builder->CreateAnd(Result,
8778 ConstantInt::get(ITy, UnknownBit));
8780 // Shift the bit we're testing down to the lsb.
8781 Result = Builder->CreateLShr(
8782 Result, ConstantInt::get(ITy, UnknownBit.countTrailingZeros()));
8784 if (ICI->getPredicate() == ICmpInst::ICMP_EQ)
8785 Result = Builder->CreateXor(Result, ConstantInt::get(ITy, 1));
8786 Result->takeName(ICI);
8787 return ReplaceInstUsesWith(CI, Result);
8796 Instruction *InstCombiner::visitZExt(ZExtInst &CI) {
8797 // If one of the common conversion will work ..
8798 if (Instruction *Result = commonIntCastTransforms(CI))
8801 Value *Src = CI.getOperand(0);
8803 // If this is a TRUNC followed by a ZEXT then we are dealing with integral
8804 // types and if the sizes are just right we can convert this into a logical
8805 // 'and' which will be much cheaper than the pair of casts.
8806 if (TruncInst *CSrc = dyn_cast<TruncInst>(Src)) { // A->B->C cast
8807 // Get the sizes of the types involved. We know that the intermediate type
8808 // will be smaller than A or C, but don't know the relation between A and C.
8809 Value *A = CSrc->getOperand(0);
8810 unsigned SrcSize = A->getType()->getScalarSizeInBits();
8811 unsigned MidSize = CSrc->getType()->getScalarSizeInBits();
8812 unsigned DstSize = CI.getType()->getScalarSizeInBits();
8813 // If we're actually extending zero bits, then if
8814 // SrcSize < DstSize: zext(a & mask)
8815 // SrcSize == DstSize: a & mask
8816 // SrcSize > DstSize: trunc(a) & mask
8817 if (SrcSize < DstSize) {
8818 APInt AndValue(APInt::getLowBitsSet(SrcSize, MidSize));
8819 Constant *AndConst = ConstantInt::get(A->getType(), AndValue);
8820 Value *And = Builder->CreateAnd(A, AndConst, CSrc->getName()+".mask");
8821 return new ZExtInst(And, CI.getType());
8824 if (SrcSize == DstSize) {
8825 APInt AndValue(APInt::getLowBitsSet(SrcSize, MidSize));
8826 return BinaryOperator::CreateAnd(A, ConstantInt::get(A->getType(),
8829 if (SrcSize > DstSize) {
8830 Value *Trunc = Builder->CreateTrunc(A, CI.getType(), "tmp");
8831 APInt AndValue(APInt::getLowBitsSet(DstSize, MidSize));
8832 return BinaryOperator::CreateAnd(Trunc,
8833 ConstantInt::get(Trunc->getType(),
8838 if (ICmpInst *ICI = dyn_cast<ICmpInst>(Src))
8839 return transformZExtICmp(ICI, CI);
8841 BinaryOperator *SrcI = dyn_cast<BinaryOperator>(Src);
8842 if (SrcI && SrcI->getOpcode() == Instruction::Or) {
8843 // zext (or icmp, icmp) --> or (zext icmp), (zext icmp) if at least one
8844 // of the (zext icmp) will be transformed.
8845 ICmpInst *LHS = dyn_cast<ICmpInst>(SrcI->getOperand(0));
8846 ICmpInst *RHS = dyn_cast<ICmpInst>(SrcI->getOperand(1));
8847 if (LHS && RHS && LHS->hasOneUse() && RHS->hasOneUse() &&
8848 (transformZExtICmp(LHS, CI, false) ||
8849 transformZExtICmp(RHS, CI, false))) {
8850 Value *LCast = Builder->CreateZExt(LHS, CI.getType(), LHS->getName());
8851 Value *RCast = Builder->CreateZExt(RHS, CI.getType(), RHS->getName());
8852 return BinaryOperator::Create(Instruction::Or, LCast, RCast);
8856 // zext(trunc(t) & C) -> (t & zext(C)).
8857 if (SrcI && SrcI->getOpcode() == Instruction::And && SrcI->hasOneUse())
8858 if (ConstantInt *C = dyn_cast<ConstantInt>(SrcI->getOperand(1)))
8859 if (TruncInst *TI = dyn_cast<TruncInst>(SrcI->getOperand(0))) {
8860 Value *TI0 = TI->getOperand(0);
8861 if (TI0->getType() == CI.getType())
8863 BinaryOperator::CreateAnd(TI0,
8864 ConstantExpr::getZExt(C, CI.getType()));
8867 // zext((trunc(t) & C) ^ C) -> ((t & zext(C)) ^ zext(C)).
8868 if (SrcI && SrcI->getOpcode() == Instruction::Xor && SrcI->hasOneUse())
8869 if (ConstantInt *C = dyn_cast<ConstantInt>(SrcI->getOperand(1)))
8870 if (BinaryOperator *And = dyn_cast<BinaryOperator>(SrcI->getOperand(0)))
8871 if (And->getOpcode() == Instruction::And && And->hasOneUse() &&
8872 And->getOperand(1) == C)
8873 if (TruncInst *TI = dyn_cast<TruncInst>(And->getOperand(0))) {
8874 Value *TI0 = TI->getOperand(0);
8875 if (TI0->getType() == CI.getType()) {
8876 Constant *ZC = ConstantExpr::getZExt(C, CI.getType());
8877 Value *NewAnd = Builder->CreateAnd(TI0, ZC, "tmp");
8878 return BinaryOperator::CreateXor(NewAnd, ZC);
8885 Instruction *InstCombiner::visitSExt(SExtInst &CI) {
8886 if (Instruction *I = commonIntCastTransforms(CI))
8889 Value *Src = CI.getOperand(0);
8891 // Canonicalize sign-extend from i1 to a select.
8892 if (Src->getType() == Type::getInt1Ty(*Context))
8893 return SelectInst::Create(Src,
8894 Constant::getAllOnesValue(CI.getType()),
8895 Constant::getNullValue(CI.getType()));
8897 // See if the value being truncated is already sign extended. If so, just
8898 // eliminate the trunc/sext pair.
8899 if (Operator::getOpcode(Src) == Instruction::Trunc) {
8900 Value *Op = cast<User>(Src)->getOperand(0);
8901 unsigned OpBits = Op->getType()->getScalarSizeInBits();
8902 unsigned MidBits = Src->getType()->getScalarSizeInBits();
8903 unsigned DestBits = CI.getType()->getScalarSizeInBits();
8904 unsigned NumSignBits = ComputeNumSignBits(Op);
8906 if (OpBits == DestBits) {
8907 // Op is i32, Mid is i8, and Dest is i32. If Op has more than 24 sign
8908 // bits, it is already ready.
8909 if (NumSignBits > DestBits-MidBits)
8910 return ReplaceInstUsesWith(CI, Op);
8911 } else if (OpBits < DestBits) {
8912 // Op is i32, Mid is i8, and Dest is i64. If Op has more than 24 sign
8913 // bits, just sext from i32.
8914 if (NumSignBits > OpBits-MidBits)
8915 return new SExtInst(Op, CI.getType(), "tmp");
8917 // Op is i64, Mid is i8, and Dest is i32. If Op has more than 56 sign
8918 // bits, just truncate to i32.
8919 if (NumSignBits > OpBits-MidBits)
8920 return new TruncInst(Op, CI.getType(), "tmp");
8924 // If the input is a shl/ashr pair of a same constant, then this is a sign
8925 // extension from a smaller value. If we could trust arbitrary bitwidth
8926 // integers, we could turn this into a truncate to the smaller bit and then
8927 // use a sext for the whole extension. Since we don't, look deeper and check
8928 // for a truncate. If the source and dest are the same type, eliminate the
8929 // trunc and extend and just do shifts. For example, turn:
8930 // %a = trunc i32 %i to i8
8931 // %b = shl i8 %a, 6
8932 // %c = ashr i8 %b, 6
8933 // %d = sext i8 %c to i32
8935 // %a = shl i32 %i, 30
8936 // %d = ashr i32 %a, 30
8938 ConstantInt *BA = 0, *CA = 0;
8939 if (match(Src, m_AShr(m_Shl(m_Value(A), m_ConstantInt(BA)),
8940 m_ConstantInt(CA))) &&
8941 BA == CA && isa<TruncInst>(A)) {
8942 Value *I = cast<TruncInst>(A)->getOperand(0);
8943 if (I->getType() == CI.getType()) {
8944 unsigned MidSize = Src->getType()->getScalarSizeInBits();
8945 unsigned SrcDstSize = CI.getType()->getScalarSizeInBits();
8946 unsigned ShAmt = CA->getZExtValue()+SrcDstSize-MidSize;
8947 Constant *ShAmtV = ConstantInt::get(CI.getType(), ShAmt);
8948 I = Builder->CreateShl(I, ShAmtV, CI.getName());
8949 return BinaryOperator::CreateAShr(I, ShAmtV);
8956 /// FitsInFPType - Return a Constant* for the specified FP constant if it fits
8957 /// in the specified FP type without changing its value.
8958 static Constant *FitsInFPType(ConstantFP *CFP, const fltSemantics &Sem,
8959 LLVMContext *Context) {
8961 APFloat F = CFP->getValueAPF();
8962 (void)F.convert(Sem, APFloat::rmNearestTiesToEven, &losesInfo);
8964 return ConstantFP::get(*Context, F);
8968 /// LookThroughFPExtensions - If this is an fp extension instruction, look
8969 /// through it until we get the source value.
8970 static Value *LookThroughFPExtensions(Value *V, LLVMContext *Context) {
8971 if (Instruction *I = dyn_cast<Instruction>(V))
8972 if (I->getOpcode() == Instruction::FPExt)
8973 return LookThroughFPExtensions(I->getOperand(0), Context);
8975 // If this value is a constant, return the constant in the smallest FP type
8976 // that can accurately represent it. This allows us to turn
8977 // (float)((double)X+2.0) into x+2.0f.
8978 if (ConstantFP *CFP = dyn_cast<ConstantFP>(V)) {
8979 if (CFP->getType() == Type::getPPC_FP128Ty(*Context))
8980 return V; // No constant folding of this.
8981 // See if the value can be truncated to float and then reextended.
8982 if (Value *V = FitsInFPType(CFP, APFloat::IEEEsingle, Context))
8984 if (CFP->getType() == Type::getDoubleTy(*Context))
8985 return V; // Won't shrink.
8986 if (Value *V = FitsInFPType(CFP, APFloat::IEEEdouble, Context))
8988 // Don't try to shrink to various long double types.
8994 Instruction *InstCombiner::visitFPTrunc(FPTruncInst &CI) {
8995 if (Instruction *I = commonCastTransforms(CI))
8998 // If we have fptrunc(fadd (fpextend x), (fpextend y)), where x and y are
8999 // smaller than the destination type, we can eliminate the truncate by doing
9000 // the add as the smaller type. This applies to fadd/fsub/fmul/fdiv as well as
9001 // many builtins (sqrt, etc).
9002 BinaryOperator *OpI = dyn_cast<BinaryOperator>(CI.getOperand(0));
9003 if (OpI && OpI->hasOneUse()) {
9004 switch (OpI->getOpcode()) {
9006 case Instruction::FAdd:
9007 case Instruction::FSub:
9008 case Instruction::FMul:
9009 case Instruction::FDiv:
9010 case Instruction::FRem:
9011 const Type *SrcTy = OpI->getType();
9012 Value *LHSTrunc = LookThroughFPExtensions(OpI->getOperand(0), Context);
9013 Value *RHSTrunc = LookThroughFPExtensions(OpI->getOperand(1), Context);
9014 if (LHSTrunc->getType() != SrcTy &&
9015 RHSTrunc->getType() != SrcTy) {
9016 unsigned DstSize = CI.getType()->getScalarSizeInBits();
9017 // If the source types were both smaller than the destination type of
9018 // the cast, do this xform.
9019 if (LHSTrunc->getType()->getScalarSizeInBits() <= DstSize &&
9020 RHSTrunc->getType()->getScalarSizeInBits() <= DstSize) {
9021 LHSTrunc = Builder->CreateFPExt(LHSTrunc, CI.getType());
9022 RHSTrunc = Builder->CreateFPExt(RHSTrunc, CI.getType());
9023 return BinaryOperator::Create(OpI->getOpcode(), LHSTrunc, RHSTrunc);
9032 Instruction *InstCombiner::visitFPExt(CastInst &CI) {
9033 return commonCastTransforms(CI);
9036 Instruction *InstCombiner::visitFPToUI(FPToUIInst &FI) {
9037 Instruction *OpI = dyn_cast<Instruction>(FI.getOperand(0));
9039 return commonCastTransforms(FI);
9041 // fptoui(uitofp(X)) --> X
9042 // fptoui(sitofp(X)) --> X
9043 // This is safe if the intermediate type has enough bits in its mantissa to
9044 // accurately represent all values of X. For example, do not do this with
9045 // i64->float->i64. This is also safe for sitofp case, because any negative
9046 // 'X' value would cause an undefined result for the fptoui.
9047 if ((isa<UIToFPInst>(OpI) || isa<SIToFPInst>(OpI)) &&
9048 OpI->getOperand(0)->getType() == FI.getType() &&
9049 (int)FI.getType()->getScalarSizeInBits() < /*extra bit for sign */
9050 OpI->getType()->getFPMantissaWidth())
9051 return ReplaceInstUsesWith(FI, OpI->getOperand(0));
9053 return commonCastTransforms(FI);
9056 Instruction *InstCombiner::visitFPToSI(FPToSIInst &FI) {
9057 Instruction *OpI = dyn_cast<Instruction>(FI.getOperand(0));
9059 return commonCastTransforms(FI);
9061 // fptosi(sitofp(X)) --> X
9062 // fptosi(uitofp(X)) --> X
9063 // This is safe if the intermediate type has enough bits in its mantissa to
9064 // accurately represent all values of X. For example, do not do this with
9065 // i64->float->i64. This is also safe for sitofp case, because any negative
9066 // 'X' value would cause an undefined result for the fptoui.
9067 if ((isa<UIToFPInst>(OpI) || isa<SIToFPInst>(OpI)) &&
9068 OpI->getOperand(0)->getType() == FI.getType() &&
9069 (int)FI.getType()->getScalarSizeInBits() <=
9070 OpI->getType()->getFPMantissaWidth())
9071 return ReplaceInstUsesWith(FI, OpI->getOperand(0));
9073 return commonCastTransforms(FI);
9076 Instruction *InstCombiner::visitUIToFP(CastInst &CI) {
9077 return commonCastTransforms(CI);
9080 Instruction *InstCombiner::visitSIToFP(CastInst &CI) {
9081 return commonCastTransforms(CI);
9084 Instruction *InstCombiner::visitPtrToInt(PtrToIntInst &CI) {
9085 // If the destination integer type is smaller than the intptr_t type for
9086 // this target, do a ptrtoint to intptr_t then do a trunc. This allows the
9087 // trunc to be exposed to other transforms. Don't do this for extending
9088 // ptrtoint's, because we don't know if the target sign or zero extends its
9091 CI.getType()->getScalarSizeInBits() < TD->getPointerSizeInBits()) {
9092 Value *P = Builder->CreatePtrToInt(CI.getOperand(0),
9093 TD->getIntPtrType(CI.getContext()),
9095 return new TruncInst(P, CI.getType());
9098 return commonPointerCastTransforms(CI);
9101 Instruction *InstCombiner::visitIntToPtr(IntToPtrInst &CI) {
9102 // If the source integer type is larger than the intptr_t type for
9103 // this target, do a trunc to the intptr_t type, then inttoptr of it. This
9104 // allows the trunc to be exposed to other transforms. Don't do this for
9105 // extending inttoptr's, because we don't know if the target sign or zero
9106 // extends to pointers.
9107 if (TD && CI.getOperand(0)->getType()->getScalarSizeInBits() >
9108 TD->getPointerSizeInBits()) {
9109 Value *P = Builder->CreateTrunc(CI.getOperand(0),
9110 TD->getIntPtrType(CI.getContext()), "tmp");
9111 return new IntToPtrInst(P, CI.getType());
9114 if (Instruction *I = commonCastTransforms(CI))
9120 Instruction *InstCombiner::visitBitCast(BitCastInst &CI) {
9121 // If the operands are integer typed then apply the integer transforms,
9122 // otherwise just apply the common ones.
9123 Value *Src = CI.getOperand(0);
9124 const Type *SrcTy = Src->getType();
9125 const Type *DestTy = CI.getType();
9127 if (isa<PointerType>(SrcTy)) {
9128 if (Instruction *I = commonPointerCastTransforms(CI))
9131 if (Instruction *Result = commonCastTransforms(CI))
9136 // Get rid of casts from one type to the same type. These are useless and can
9137 // be replaced by the operand.
9138 if (DestTy == Src->getType())
9139 return ReplaceInstUsesWith(CI, Src);
9141 if (const PointerType *DstPTy = dyn_cast<PointerType>(DestTy)) {
9142 const PointerType *SrcPTy = cast<PointerType>(SrcTy);
9143 const Type *DstElTy = DstPTy->getElementType();
9144 const Type *SrcElTy = SrcPTy->getElementType();
9146 // If the address spaces don't match, don't eliminate the bitcast, which is
9147 // required for changing types.
9148 if (SrcPTy->getAddressSpace() != DstPTy->getAddressSpace())
9151 // If we are casting a alloca to a pointer to a type of the same
9152 // size, rewrite the allocation instruction to allocate the "right" type.
9153 // There is no need to modify malloc calls because it is their bitcast that
9154 // needs to be cleaned up.
9155 if (AllocaInst *AI = dyn_cast<AllocaInst>(Src))
9156 if (Instruction *V = PromoteCastOfAllocation(CI, *AI))
9159 // If the source and destination are pointers, and this cast is equivalent
9160 // to a getelementptr X, 0, 0, 0... turn it into the appropriate gep.
9161 // This can enhance SROA and other transforms that want type-safe pointers.
9162 Constant *ZeroUInt = Constant::getNullValue(Type::getInt32Ty(*Context));
9163 unsigned NumZeros = 0;
9164 while (SrcElTy != DstElTy &&
9165 isa<CompositeType>(SrcElTy) && !isa<PointerType>(SrcElTy) &&
9166 SrcElTy->getNumContainedTypes() /* not "{}" */) {
9167 SrcElTy = cast<CompositeType>(SrcElTy)->getTypeAtIndex(ZeroUInt);
9171 // If we found a path from the src to dest, create the getelementptr now.
9172 if (SrcElTy == DstElTy) {
9173 SmallVector<Value*, 8> Idxs(NumZeros+1, ZeroUInt);
9174 return GetElementPtrInst::CreateInBounds(Src, Idxs.begin(), Idxs.end(), "",
9175 ((Instruction*) NULL));
9179 if (const VectorType *DestVTy = dyn_cast<VectorType>(DestTy)) {
9180 if (DestVTy->getNumElements() == 1) {
9181 if (!isa<VectorType>(SrcTy)) {
9182 Value *Elem = Builder->CreateBitCast(Src, DestVTy->getElementType());
9183 return InsertElementInst::Create(UndefValue::get(DestTy), Elem,
9184 Constant::getNullValue(Type::getInt32Ty(*Context)));
9186 // FIXME: Canonicalize bitcast(insertelement) -> insertelement(bitcast)
9190 if (const VectorType *SrcVTy = dyn_cast<VectorType>(SrcTy)) {
9191 if (SrcVTy->getNumElements() == 1) {
9192 if (!isa<VectorType>(DestTy)) {
9194 Builder->CreateExtractElement(Src,
9195 Constant::getNullValue(Type::getInt32Ty(*Context)));
9196 return CastInst::Create(Instruction::BitCast, Elem, DestTy);
9201 if (ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(Src)) {
9202 if (SVI->hasOneUse()) {
9203 // Okay, we have (bitconvert (shuffle ..)). Check to see if this is
9204 // a bitconvert to a vector with the same # elts.
9205 if (isa<VectorType>(DestTy) &&
9206 cast<VectorType>(DestTy)->getNumElements() ==
9207 SVI->getType()->getNumElements() &&
9208 SVI->getType()->getNumElements() ==
9209 cast<VectorType>(SVI->getOperand(0)->getType())->getNumElements()) {
9211 // If either of the operands is a cast from CI.getType(), then
9212 // evaluating the shuffle in the casted destination's type will allow
9213 // us to eliminate at least one cast.
9214 if (((Tmp = dyn_cast<CastInst>(SVI->getOperand(0))) &&
9215 Tmp->getOperand(0)->getType() == DestTy) ||
9216 ((Tmp = dyn_cast<CastInst>(SVI->getOperand(1))) &&
9217 Tmp->getOperand(0)->getType() == DestTy)) {
9218 Value *LHS = Builder->CreateBitCast(SVI->getOperand(0), DestTy);
9219 Value *RHS = Builder->CreateBitCast(SVI->getOperand(1), DestTy);
9220 // Return a new shuffle vector. Use the same element ID's, as we
9221 // know the vector types match #elts.
9222 return new ShuffleVectorInst(LHS, RHS, SVI->getOperand(2));
9230 /// GetSelectFoldableOperands - We want to turn code that looks like this:
9232 /// %D = select %cond, %C, %A
9234 /// %C = select %cond, %B, 0
9237 /// Assuming that the specified instruction is an operand to the select, return
9238 /// a bitmask indicating which operands of this instruction are foldable if they
9239 /// equal the other incoming value of the select.
9241 static unsigned GetSelectFoldableOperands(Instruction *I) {
9242 switch (I->getOpcode()) {
9243 case Instruction::Add:
9244 case Instruction::Mul:
9245 case Instruction::And:
9246 case Instruction::Or:
9247 case Instruction::Xor:
9248 return 3; // Can fold through either operand.
9249 case Instruction::Sub: // Can only fold on the amount subtracted.
9250 case Instruction::Shl: // Can only fold on the shift amount.
9251 case Instruction::LShr:
9252 case Instruction::AShr:
9255 return 0; // Cannot fold
9259 /// GetSelectFoldableConstant - For the same transformation as the previous
9260 /// function, return the identity constant that goes into the select.
9261 static Constant *GetSelectFoldableConstant(Instruction *I,
9262 LLVMContext *Context) {
9263 switch (I->getOpcode()) {
9264 default: llvm_unreachable("This cannot happen!");
9265 case Instruction::Add:
9266 case Instruction::Sub:
9267 case Instruction::Or:
9268 case Instruction::Xor:
9269 case Instruction::Shl:
9270 case Instruction::LShr:
9271 case Instruction::AShr:
9272 return Constant::getNullValue(I->getType());
9273 case Instruction::And:
9274 return Constant::getAllOnesValue(I->getType());
9275 case Instruction::Mul:
9276 return ConstantInt::get(I->getType(), 1);
9280 /// FoldSelectOpOp - Here we have (select c, TI, FI), and we know that TI and FI
9281 /// have the same opcode and only one use each. Try to simplify this.
9282 Instruction *InstCombiner::FoldSelectOpOp(SelectInst &SI, Instruction *TI,
9284 if (TI->getNumOperands() == 1) {
9285 // If this is a non-volatile load or a cast from the same type,
9288 if (TI->getOperand(0)->getType() != FI->getOperand(0)->getType())
9291 return 0; // unknown unary op.
9294 // Fold this by inserting a select from the input values.
9295 SelectInst *NewSI = SelectInst::Create(SI.getCondition(), TI->getOperand(0),
9296 FI->getOperand(0), SI.getName()+".v");
9297 InsertNewInstBefore(NewSI, SI);
9298 return CastInst::Create(Instruction::CastOps(TI->getOpcode()), NewSI,
9302 // Only handle binary operators here.
9303 if (!isa<BinaryOperator>(TI))
9306 // Figure out if the operations have any operands in common.
9307 Value *MatchOp, *OtherOpT, *OtherOpF;
9309 if (TI->getOperand(0) == FI->getOperand(0)) {
9310 MatchOp = TI->getOperand(0);
9311 OtherOpT = TI->getOperand(1);
9312 OtherOpF = FI->getOperand(1);
9313 MatchIsOpZero = true;
9314 } else if (TI->getOperand(1) == FI->getOperand(1)) {
9315 MatchOp = TI->getOperand(1);
9316 OtherOpT = TI->getOperand(0);
9317 OtherOpF = FI->getOperand(0);
9318 MatchIsOpZero = false;
9319 } else if (!TI->isCommutative()) {
9321 } else if (TI->getOperand(0) == FI->getOperand(1)) {
9322 MatchOp = TI->getOperand(0);
9323 OtherOpT = TI->getOperand(1);
9324 OtherOpF = FI->getOperand(0);
9325 MatchIsOpZero = true;
9326 } else if (TI->getOperand(1) == FI->getOperand(0)) {
9327 MatchOp = TI->getOperand(1);
9328 OtherOpT = TI->getOperand(0);
9329 OtherOpF = FI->getOperand(1);
9330 MatchIsOpZero = true;
9335 // If we reach here, they do have operations in common.
9336 SelectInst *NewSI = SelectInst::Create(SI.getCondition(), OtherOpT,
9337 OtherOpF, SI.getName()+".v");
9338 InsertNewInstBefore(NewSI, SI);
9340 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(TI)) {
9342 return BinaryOperator::Create(BO->getOpcode(), MatchOp, NewSI);
9344 return BinaryOperator::Create(BO->getOpcode(), NewSI, MatchOp);
9346 llvm_unreachable("Shouldn't get here");
9350 static bool isSelect01(Constant *C1, Constant *C2) {
9351 ConstantInt *C1I = dyn_cast<ConstantInt>(C1);
9354 ConstantInt *C2I = dyn_cast<ConstantInt>(C2);
9357 return (C1I->isZero() || C1I->isOne()) && (C2I->isZero() || C2I->isOne());
9360 /// FoldSelectIntoOp - Try fold the select into one of the operands to
9361 /// facilitate further optimization.
9362 Instruction *InstCombiner::FoldSelectIntoOp(SelectInst &SI, Value *TrueVal,
9364 // See the comment above GetSelectFoldableOperands for a description of the
9365 // transformation we are doing here.
9366 if (Instruction *TVI = dyn_cast<Instruction>(TrueVal)) {
9367 if (TVI->hasOneUse() && TVI->getNumOperands() == 2 &&
9368 !isa<Constant>(FalseVal)) {
9369 if (unsigned SFO = GetSelectFoldableOperands(TVI)) {
9370 unsigned OpToFold = 0;
9371 if ((SFO & 1) && FalseVal == TVI->getOperand(0)) {
9373 } else if ((SFO & 2) && FalseVal == TVI->getOperand(1)) {
9378 Constant *C = GetSelectFoldableConstant(TVI, Context);
9379 Value *OOp = TVI->getOperand(2-OpToFold);
9380 // Avoid creating select between 2 constants unless it's selecting
9382 if (!isa<Constant>(OOp) || isSelect01(C, cast<Constant>(OOp))) {
9383 Instruction *NewSel = SelectInst::Create(SI.getCondition(), OOp, C);
9384 InsertNewInstBefore(NewSel, SI);
9385 NewSel->takeName(TVI);
9386 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(TVI))
9387 return BinaryOperator::Create(BO->getOpcode(), FalseVal, NewSel);
9388 llvm_unreachable("Unknown instruction!!");
9395 if (Instruction *FVI = dyn_cast<Instruction>(FalseVal)) {
9396 if (FVI->hasOneUse() && FVI->getNumOperands() == 2 &&
9397 !isa<Constant>(TrueVal)) {
9398 if (unsigned SFO = GetSelectFoldableOperands(FVI)) {
9399 unsigned OpToFold = 0;
9400 if ((SFO & 1) && TrueVal == FVI->getOperand(0)) {
9402 } else if ((SFO & 2) && TrueVal == FVI->getOperand(1)) {
9407 Constant *C = GetSelectFoldableConstant(FVI, Context);
9408 Value *OOp = FVI->getOperand(2-OpToFold);
9409 // Avoid creating select between 2 constants unless it's selecting
9411 if (!isa<Constant>(OOp) || isSelect01(C, cast<Constant>(OOp))) {
9412 Instruction *NewSel = SelectInst::Create(SI.getCondition(), C, OOp);
9413 InsertNewInstBefore(NewSel, SI);
9414 NewSel->takeName(FVI);
9415 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(FVI))
9416 return BinaryOperator::Create(BO->getOpcode(), TrueVal, NewSel);
9417 llvm_unreachable("Unknown instruction!!");
9427 /// visitSelectInstWithICmp - Visit a SelectInst that has an
9428 /// ICmpInst as its first operand.
9430 Instruction *InstCombiner::visitSelectInstWithICmp(SelectInst &SI,
9432 bool Changed = false;
9433 ICmpInst::Predicate Pred = ICI->getPredicate();
9434 Value *CmpLHS = ICI->getOperand(0);
9435 Value *CmpRHS = ICI->getOperand(1);
9436 Value *TrueVal = SI.getTrueValue();
9437 Value *FalseVal = SI.getFalseValue();
9439 // Check cases where the comparison is with a constant that
9440 // can be adjusted to fit the min/max idiom. We may edit ICI in
9441 // place here, so make sure the select is the only user.
9442 if (ICI->hasOneUse())
9443 if (ConstantInt *CI = dyn_cast<ConstantInt>(CmpRHS)) {
9446 case ICmpInst::ICMP_ULT:
9447 case ICmpInst::ICMP_SLT: {
9448 // X < MIN ? T : F --> F
9449 if (CI->isMinValue(Pred == ICmpInst::ICMP_SLT))
9450 return ReplaceInstUsesWith(SI, FalseVal);
9451 // X < C ? X : C-1 --> X > C-1 ? C-1 : X
9452 Constant *AdjustedRHS = SubOne(CI);
9453 if ((CmpLHS == TrueVal && AdjustedRHS == FalseVal) ||
9454 (CmpLHS == FalseVal && AdjustedRHS == TrueVal)) {
9455 Pred = ICmpInst::getSwappedPredicate(Pred);
9456 CmpRHS = AdjustedRHS;
9457 std::swap(FalseVal, TrueVal);
9458 ICI->setPredicate(Pred);
9459 ICI->setOperand(1, CmpRHS);
9460 SI.setOperand(1, TrueVal);
9461 SI.setOperand(2, FalseVal);
9466 case ICmpInst::ICMP_UGT:
9467 case ICmpInst::ICMP_SGT: {
9468 // X > MAX ? T : F --> F
9469 if (CI->isMaxValue(Pred == ICmpInst::ICMP_SGT))
9470 return ReplaceInstUsesWith(SI, FalseVal);
9471 // X > C ? X : C+1 --> X < C+1 ? C+1 : X
9472 Constant *AdjustedRHS = AddOne(CI);
9473 if ((CmpLHS == TrueVal && AdjustedRHS == FalseVal) ||
9474 (CmpLHS == FalseVal && AdjustedRHS == TrueVal)) {
9475 Pred = ICmpInst::getSwappedPredicate(Pred);
9476 CmpRHS = AdjustedRHS;
9477 std::swap(FalseVal, TrueVal);
9478 ICI->setPredicate(Pred);
9479 ICI->setOperand(1, CmpRHS);
9480 SI.setOperand(1, TrueVal);
9481 SI.setOperand(2, FalseVal);
9488 // (x <s 0) ? -1 : 0 -> ashr x, 31 -> all ones if signed
9489 // (x >s -1) ? -1 : 0 -> ashr x, 31 -> all ones if not signed
9490 CmpInst::Predicate Pred = CmpInst::BAD_ICMP_PREDICATE;
9491 if (match(TrueVal, m_ConstantInt<-1>()) &&
9492 match(FalseVal, m_ConstantInt<0>()))
9493 Pred = ICI->getPredicate();
9494 else if (match(TrueVal, m_ConstantInt<0>()) &&
9495 match(FalseVal, m_ConstantInt<-1>()))
9496 Pred = CmpInst::getInversePredicate(ICI->getPredicate());
9498 if (Pred != CmpInst::BAD_ICMP_PREDICATE) {
9499 // If we are just checking for a icmp eq of a single bit and zext'ing it
9500 // to an integer, then shift the bit to the appropriate place and then
9501 // cast to integer to avoid the comparison.
9502 const APInt &Op1CV = CI->getValue();
9504 // sext (x <s 0) to i32 --> x>>s31 true if signbit set.
9505 // sext (x >s -1) to i32 --> (x>>s31)^-1 true if signbit clear.
9506 if ((Pred == ICmpInst::ICMP_SLT && Op1CV == 0) ||
9507 (Pred == ICmpInst::ICMP_SGT && Op1CV.isAllOnesValue())) {
9508 Value *In = ICI->getOperand(0);
9509 Value *Sh = ConstantInt::get(In->getType(),
9510 In->getType()->getScalarSizeInBits()-1);
9511 In = InsertNewInstBefore(BinaryOperator::CreateAShr(In, Sh,
9512 In->getName()+".lobit"),
9514 if (In->getType() != SI.getType())
9515 In = CastInst::CreateIntegerCast(In, SI.getType(),
9516 true/*SExt*/, "tmp", ICI);
9518 if (Pred == ICmpInst::ICMP_SGT)
9519 In = InsertNewInstBefore(BinaryOperator::CreateNot(In,
9520 In->getName()+".not"), *ICI);
9522 return ReplaceInstUsesWith(SI, In);
9527 if (CmpLHS == TrueVal && CmpRHS == FalseVal) {
9528 // Transform (X == Y) ? X : Y -> Y
9529 if (Pred == ICmpInst::ICMP_EQ)
9530 return ReplaceInstUsesWith(SI, FalseVal);
9531 // Transform (X != Y) ? X : Y -> X
9532 if (Pred == ICmpInst::ICMP_NE)
9533 return ReplaceInstUsesWith(SI, TrueVal);
9534 /// NOTE: if we wanted to, this is where to detect integer MIN/MAX
9536 } else if (CmpLHS == FalseVal && CmpRHS == TrueVal) {
9537 // Transform (X == Y) ? Y : X -> X
9538 if (Pred == ICmpInst::ICMP_EQ)
9539 return ReplaceInstUsesWith(SI, FalseVal);
9540 // Transform (X != Y) ? Y : X -> Y
9541 if (Pred == ICmpInst::ICMP_NE)
9542 return ReplaceInstUsesWith(SI, TrueVal);
9543 /// NOTE: if we wanted to, this is where to detect integer MIN/MAX
9545 return Changed ? &SI : 0;
9549 /// CanSelectOperandBeMappingIntoPredBlock - SI is a select whose condition is a
9550 /// PHI node (but the two may be in different blocks). See if the true/false
9551 /// values (V) are live in all of the predecessor blocks of the PHI. For
9552 /// example, cases like this cannot be mapped:
9554 /// X = phi [ C1, BB1], [C2, BB2]
9556 /// Z = select X, Y, 0
9558 /// because Y is not live in BB1/BB2.
9560 static bool CanSelectOperandBeMappingIntoPredBlock(const Value *V,
9561 const SelectInst &SI) {
9562 // If the value is a non-instruction value like a constant or argument, it
9563 // can always be mapped.
9564 const Instruction *I = dyn_cast<Instruction>(V);
9565 if (I == 0) return true;
9567 // If V is a PHI node defined in the same block as the condition PHI, we can
9568 // map the arguments.
9569 const PHINode *CondPHI = cast<PHINode>(SI.getCondition());
9571 if (const PHINode *VP = dyn_cast<PHINode>(I))
9572 if (VP->getParent() == CondPHI->getParent())
9575 // Otherwise, if the PHI and select are defined in the same block and if V is
9576 // defined in a different block, then we can transform it.
9577 if (SI.getParent() == CondPHI->getParent() &&
9578 I->getParent() != CondPHI->getParent())
9581 // Otherwise we have a 'hard' case and we can't tell without doing more
9582 // detailed dominator based analysis, punt.
9586 /// FoldSPFofSPF - We have an SPF (e.g. a min or max) of an SPF of the form:
9587 /// SPF2(SPF1(A, B), C)
9588 Instruction *InstCombiner::FoldSPFofSPF(Instruction *Inner,
9589 SelectPatternFlavor SPF1,
9592 SelectPatternFlavor SPF2, Value *C) {
9593 if (C == A || C == B) {
9594 // MAX(MAX(A, B), B) -> MAX(A, B)
9595 // MIN(MIN(a, b), a) -> MIN(a, b)
9597 return ReplaceInstUsesWith(Outer, Inner);
9599 // MAX(MIN(a, b), a) -> a
9600 // MIN(MAX(a, b), a) -> a
9601 if ((SPF1 == SPF_SMIN && SPF2 == SPF_SMAX) ||
9602 (SPF1 == SPF_SMAX && SPF2 == SPF_SMIN) ||
9603 (SPF1 == SPF_UMIN && SPF2 == SPF_UMAX) ||
9604 (SPF1 == SPF_UMAX && SPF2 == SPF_UMIN))
9605 return ReplaceInstUsesWith(Outer, C);
9608 // TODO: MIN(MIN(A, 23), 97)
9615 Instruction *InstCombiner::visitSelectInst(SelectInst &SI) {
9616 Value *CondVal = SI.getCondition();
9617 Value *TrueVal = SI.getTrueValue();
9618 Value *FalseVal = SI.getFalseValue();
9620 // select true, X, Y -> X
9621 // select false, X, Y -> Y
9622 if (ConstantInt *C = dyn_cast<ConstantInt>(CondVal))
9623 return ReplaceInstUsesWith(SI, C->getZExtValue() ? TrueVal : FalseVal);
9625 // select C, X, X -> X
9626 if (TrueVal == FalseVal)
9627 return ReplaceInstUsesWith(SI, TrueVal);
9629 if (isa<UndefValue>(TrueVal)) // select C, undef, X -> X
9630 return ReplaceInstUsesWith(SI, FalseVal);
9631 if (isa<UndefValue>(FalseVal)) // select C, X, undef -> X
9632 return ReplaceInstUsesWith(SI, TrueVal);
9633 if (isa<UndefValue>(CondVal)) { // select undef, X, Y -> X or Y
9634 if (isa<Constant>(TrueVal))
9635 return ReplaceInstUsesWith(SI, TrueVal);
9637 return ReplaceInstUsesWith(SI, FalseVal);
9640 if (SI.getType() == Type::getInt1Ty(*Context)) {
9641 if (ConstantInt *C = dyn_cast<ConstantInt>(TrueVal)) {
9642 if (C->getZExtValue()) {
9643 // Change: A = select B, true, C --> A = or B, C
9644 return BinaryOperator::CreateOr(CondVal, FalseVal);
9646 // Change: A = select B, false, C --> A = and !B, C
9648 InsertNewInstBefore(BinaryOperator::CreateNot(CondVal,
9649 "not."+CondVal->getName()), SI);
9650 return BinaryOperator::CreateAnd(NotCond, FalseVal);
9652 } else if (ConstantInt *C = dyn_cast<ConstantInt>(FalseVal)) {
9653 if (C->getZExtValue() == false) {
9654 // Change: A = select B, C, false --> A = and B, C
9655 return BinaryOperator::CreateAnd(CondVal, TrueVal);
9657 // Change: A = select B, C, true --> A = or !B, C
9659 InsertNewInstBefore(BinaryOperator::CreateNot(CondVal,
9660 "not."+CondVal->getName()), SI);
9661 return BinaryOperator::CreateOr(NotCond, TrueVal);
9665 // select a, b, a -> a&b
9666 // select a, a, b -> a|b
9667 if (CondVal == TrueVal)
9668 return BinaryOperator::CreateOr(CondVal, FalseVal);
9669 else if (CondVal == FalseVal)
9670 return BinaryOperator::CreateAnd(CondVal, TrueVal);
9673 // Selecting between two integer constants?
9674 if (ConstantInt *TrueValC = dyn_cast<ConstantInt>(TrueVal))
9675 if (ConstantInt *FalseValC = dyn_cast<ConstantInt>(FalseVal)) {
9676 // select C, 1, 0 -> zext C to int
9677 if (FalseValC->isZero() && TrueValC->getValue() == 1) {
9678 return CastInst::Create(Instruction::ZExt, CondVal, SI.getType());
9679 } else if (TrueValC->isZero() && FalseValC->getValue() == 1) {
9680 // select C, 0, 1 -> zext !C to int
9682 InsertNewInstBefore(BinaryOperator::CreateNot(CondVal,
9683 "not."+CondVal->getName()), SI);
9684 return CastInst::Create(Instruction::ZExt, NotCond, SI.getType());
9687 if (ICmpInst *IC = dyn_cast<ICmpInst>(SI.getCondition())) {
9688 // If one of the constants is zero (we know they can't both be) and we
9689 // have an icmp instruction with zero, and we have an 'and' with the
9690 // non-constant value, eliminate this whole mess. This corresponds to
9691 // cases like this: ((X & 27) ? 27 : 0)
9692 if (TrueValC->isZero() || FalseValC->isZero())
9693 if (IC->isEquality() && isa<ConstantInt>(IC->getOperand(1)) &&
9694 cast<Constant>(IC->getOperand(1))->isNullValue())
9695 if (Instruction *ICA = dyn_cast<Instruction>(IC->getOperand(0)))
9696 if (ICA->getOpcode() == Instruction::And &&
9697 isa<ConstantInt>(ICA->getOperand(1)) &&
9698 (ICA->getOperand(1) == TrueValC ||
9699 ICA->getOperand(1) == FalseValC) &&
9700 isOneBitSet(cast<ConstantInt>(ICA->getOperand(1)))) {
9701 // Okay, now we know that everything is set up, we just don't
9702 // know whether we have a icmp_ne or icmp_eq and whether the
9703 // true or false val is the zero.
9704 bool ShouldNotVal = !TrueValC->isZero();
9705 ShouldNotVal ^= IC->getPredicate() == ICmpInst::ICMP_NE;
9708 V = InsertNewInstBefore(BinaryOperator::Create(
9709 Instruction::Xor, V, ICA->getOperand(1)), SI);
9710 return ReplaceInstUsesWith(SI, V);
9715 // See if we are selecting two values based on a comparison of the two values.
9716 if (FCmpInst *FCI = dyn_cast<FCmpInst>(CondVal)) {
9717 if (FCI->getOperand(0) == TrueVal && FCI->getOperand(1) == FalseVal) {
9718 // Transform (X == Y) ? X : Y -> Y
9719 if (FCI->getPredicate() == FCmpInst::FCMP_OEQ) {
9720 // This is not safe in general for floating point:
9721 // consider X== -0, Y== +0.
9722 // It becomes safe if either operand is a nonzero constant.
9723 ConstantFP *CFPt, *CFPf;
9724 if (((CFPt = dyn_cast<ConstantFP>(TrueVal)) &&
9725 !CFPt->getValueAPF().isZero()) ||
9726 ((CFPf = dyn_cast<ConstantFP>(FalseVal)) &&
9727 !CFPf->getValueAPF().isZero()))
9728 return ReplaceInstUsesWith(SI, FalseVal);
9730 // Transform (X != Y) ? X : Y -> X
9731 if (FCI->getPredicate() == FCmpInst::FCMP_ONE)
9732 return ReplaceInstUsesWith(SI, TrueVal);
9733 // NOTE: if we wanted to, this is where to detect MIN/MAX
9735 } else if (FCI->getOperand(0) == FalseVal && FCI->getOperand(1) == TrueVal){
9736 // Transform (X == Y) ? Y : X -> X
9737 if (FCI->getPredicate() == FCmpInst::FCMP_OEQ) {
9738 // This is not safe in general for floating point:
9739 // consider X== -0, Y== +0.
9740 // It becomes safe if either operand is a nonzero constant.
9741 ConstantFP *CFPt, *CFPf;
9742 if (((CFPt = dyn_cast<ConstantFP>(TrueVal)) &&
9743 !CFPt->getValueAPF().isZero()) ||
9744 ((CFPf = dyn_cast<ConstantFP>(FalseVal)) &&
9745 !CFPf->getValueAPF().isZero()))
9746 return ReplaceInstUsesWith(SI, FalseVal);
9748 // Transform (X != Y) ? Y : X -> Y
9749 if (FCI->getPredicate() == FCmpInst::FCMP_ONE)
9750 return ReplaceInstUsesWith(SI, TrueVal);
9751 // NOTE: if we wanted to, this is where to detect MIN/MAX
9753 // NOTE: if we wanted to, this is where to detect ABS
9756 // See if we are selecting two values based on a comparison of the two values.
9757 if (ICmpInst *ICI = dyn_cast<ICmpInst>(CondVal))
9758 if (Instruction *Result = visitSelectInstWithICmp(SI, ICI))
9761 if (Instruction *TI = dyn_cast<Instruction>(TrueVal))
9762 if (Instruction *FI = dyn_cast<Instruction>(FalseVal))
9763 if (TI->hasOneUse() && FI->hasOneUse()) {
9764 Instruction *AddOp = 0, *SubOp = 0;
9766 // Turn (select C, (op X, Y), (op X, Z)) -> (op X, (select C, Y, Z))
9767 if (TI->getOpcode() == FI->getOpcode())
9768 if (Instruction *IV = FoldSelectOpOp(SI, TI, FI))
9771 // Turn select C, (X+Y), (X-Y) --> (X+(select C, Y, (-Y))). This is
9772 // even legal for FP.
9773 if ((TI->getOpcode() == Instruction::Sub &&
9774 FI->getOpcode() == Instruction::Add) ||
9775 (TI->getOpcode() == Instruction::FSub &&
9776 FI->getOpcode() == Instruction::FAdd)) {
9777 AddOp = FI; SubOp = TI;
9778 } else if ((FI->getOpcode() == Instruction::Sub &&
9779 TI->getOpcode() == Instruction::Add) ||
9780 (FI->getOpcode() == Instruction::FSub &&
9781 TI->getOpcode() == Instruction::FAdd)) {
9782 AddOp = TI; SubOp = FI;
9786 Value *OtherAddOp = 0;
9787 if (SubOp->getOperand(0) == AddOp->getOperand(0)) {
9788 OtherAddOp = AddOp->getOperand(1);
9789 } else if (SubOp->getOperand(0) == AddOp->getOperand(1)) {
9790 OtherAddOp = AddOp->getOperand(0);
9794 // So at this point we know we have (Y -> OtherAddOp):
9795 // select C, (add X, Y), (sub X, Z)
9796 Value *NegVal; // Compute -Z
9797 if (Constant *C = dyn_cast<Constant>(SubOp->getOperand(1))) {
9798 NegVal = ConstantExpr::getNeg(C);
9800 NegVal = InsertNewInstBefore(
9801 BinaryOperator::CreateNeg(SubOp->getOperand(1),
9805 Value *NewTrueOp = OtherAddOp;
9806 Value *NewFalseOp = NegVal;
9808 std::swap(NewTrueOp, NewFalseOp);
9809 Instruction *NewSel =
9810 SelectInst::Create(CondVal, NewTrueOp,
9811 NewFalseOp, SI.getName() + ".p");
9813 NewSel = InsertNewInstBefore(NewSel, SI);
9814 return BinaryOperator::CreateAdd(SubOp->getOperand(0), NewSel);
9819 // See if we can fold the select into one of our operands.
9820 if (SI.getType()->isInteger()) {
9821 if (Instruction *FoldI = FoldSelectIntoOp(SI, TrueVal, FalseVal))
9824 // MAX(MAX(a, b), a) -> MAX(a, b)
9825 // MIN(MIN(a, b), a) -> MIN(a, b)
9826 // MAX(MIN(a, b), a) -> a
9827 // MIN(MAX(a, b), a) -> a
9828 Value *LHS, *RHS, *LHS2, *RHS2;
9829 if (SelectPatternFlavor SPF = MatchSelectPattern(&SI, LHS, RHS)) {
9830 if (SelectPatternFlavor SPF2 = MatchSelectPattern(LHS, LHS2, RHS2))
9831 if (Instruction *R = FoldSPFofSPF(cast<Instruction>(LHS),SPF2,LHS2,RHS2,
9834 if (SelectPatternFlavor SPF2 = MatchSelectPattern(RHS, LHS2, RHS2))
9835 if (Instruction *R = FoldSPFofSPF(cast<Instruction>(RHS),SPF2,LHS2,RHS2,
9841 // ABS(-X) -> ABS(X)
9842 // ABS(ABS(X)) -> ABS(X)
9845 // See if we can fold the select into a phi node if the condition is a select.
9846 if (isa<PHINode>(SI.getCondition()))
9847 // The true/false values have to be live in the PHI predecessor's blocks.
9848 if (CanSelectOperandBeMappingIntoPredBlock(TrueVal, SI) &&
9849 CanSelectOperandBeMappingIntoPredBlock(FalseVal, SI))
9850 if (Instruction *NV = FoldOpIntoPhi(SI))
9853 if (BinaryOperator::isNot(CondVal)) {
9854 SI.setOperand(0, BinaryOperator::getNotArgument(CondVal));
9855 SI.setOperand(1, FalseVal);
9856 SI.setOperand(2, TrueVal);
9863 /// EnforceKnownAlignment - If the specified pointer points to an object that
9864 /// we control, modify the object's alignment to PrefAlign. This isn't
9865 /// often possible though. If alignment is important, a more reliable approach
9866 /// is to simply align all global variables and allocation instructions to
9867 /// their preferred alignment from the beginning.
9869 static unsigned EnforceKnownAlignment(Value *V,
9870 unsigned Align, unsigned PrefAlign) {
9872 User *U = dyn_cast<User>(V);
9873 if (!U) return Align;
9875 switch (Operator::getOpcode(U)) {
9877 case Instruction::BitCast:
9878 return EnforceKnownAlignment(U->getOperand(0), Align, PrefAlign);
9879 case Instruction::GetElementPtr: {
9880 // If all indexes are zero, it is just the alignment of the base pointer.
9881 bool AllZeroOperands = true;
9882 for (User::op_iterator i = U->op_begin() + 1, e = U->op_end(); i != e; ++i)
9883 if (!isa<Constant>(*i) ||
9884 !cast<Constant>(*i)->isNullValue()) {
9885 AllZeroOperands = false;
9889 if (AllZeroOperands) {
9890 // Treat this like a bitcast.
9891 return EnforceKnownAlignment(U->getOperand(0), Align, PrefAlign);
9897 if (GlobalValue *GV = dyn_cast<GlobalValue>(V)) {
9898 // If there is a large requested alignment and we can, bump up the alignment
9900 if (!GV->isDeclaration()) {
9901 if (GV->getAlignment() >= PrefAlign)
9902 Align = GV->getAlignment();
9904 GV->setAlignment(PrefAlign);
9908 } else if (AllocaInst *AI = dyn_cast<AllocaInst>(V)) {
9909 // If there is a requested alignment and if this is an alloca, round up.
9910 if (AI->getAlignment() >= PrefAlign)
9911 Align = AI->getAlignment();
9913 AI->setAlignment(PrefAlign);
9921 /// GetOrEnforceKnownAlignment - If the specified pointer has an alignment that
9922 /// we can determine, return it, otherwise return 0. If PrefAlign is specified,
9923 /// and it is more than the alignment of the ultimate object, see if we can
9924 /// increase the alignment of the ultimate object, making this check succeed.
9925 unsigned InstCombiner::GetOrEnforceKnownAlignment(Value *V,
9926 unsigned PrefAlign) {
9927 unsigned BitWidth = TD ? TD->getTypeSizeInBits(V->getType()) :
9928 sizeof(PrefAlign) * CHAR_BIT;
9929 APInt Mask = APInt::getAllOnesValue(BitWidth);
9930 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
9931 ComputeMaskedBits(V, Mask, KnownZero, KnownOne);
9932 unsigned TrailZ = KnownZero.countTrailingOnes();
9933 unsigned Align = 1u << std::min(BitWidth - 1, TrailZ);
9935 if (PrefAlign > Align)
9936 Align = EnforceKnownAlignment(V, Align, PrefAlign);
9938 // We don't need to make any adjustment.
9942 Instruction *InstCombiner::SimplifyMemTransfer(MemIntrinsic *MI) {
9943 unsigned DstAlign = GetOrEnforceKnownAlignment(MI->getOperand(1));
9944 unsigned SrcAlign = GetOrEnforceKnownAlignment(MI->getOperand(2));
9945 unsigned MinAlign = std::min(DstAlign, SrcAlign);
9946 unsigned CopyAlign = MI->getAlignment();
9948 if (CopyAlign < MinAlign) {
9949 MI->setAlignment(ConstantInt::get(MI->getAlignmentType(),
9954 // If MemCpyInst length is 1/2/4/8 bytes then replace memcpy with
9956 ConstantInt *MemOpLength = dyn_cast<ConstantInt>(MI->getOperand(3));
9957 if (MemOpLength == 0) return 0;
9959 // Source and destination pointer types are always "i8*" for intrinsic. See
9960 // if the size is something we can handle with a single primitive load/store.
9961 // A single load+store correctly handles overlapping memory in the memmove
9963 unsigned Size = MemOpLength->getZExtValue();
9964 if (Size == 0) return MI; // Delete this mem transfer.
9966 if (Size > 8 || (Size&(Size-1)))
9967 return 0; // If not 1/2/4/8 bytes, exit.
9969 // Use an integer load+store unless we can find something better.
9971 PointerType::getUnqual(IntegerType::get(*Context, Size<<3));
9973 // Memcpy forces the use of i8* for the source and destination. That means
9974 // that if you're using memcpy to move one double around, you'll get a cast
9975 // from double* to i8*. We'd much rather use a double load+store rather than
9976 // an i64 load+store, here because this improves the odds that the source or
9977 // dest address will be promotable. See if we can find a better type than the
9978 // integer datatype.
9979 if (Value *Op = getBitCastOperand(MI->getOperand(1))) {
9980 const Type *SrcETy = cast<PointerType>(Op->getType())->getElementType();
9981 if (TD && SrcETy->isSized() && TD->getTypeStoreSize(SrcETy) == Size) {
9982 // The SrcETy might be something like {{{double}}} or [1 x double]. Rip
9983 // down through these levels if so.
9984 while (!SrcETy->isSingleValueType()) {
9985 if (const StructType *STy = dyn_cast<StructType>(SrcETy)) {
9986 if (STy->getNumElements() == 1)
9987 SrcETy = STy->getElementType(0);
9990 } else if (const ArrayType *ATy = dyn_cast<ArrayType>(SrcETy)) {
9991 if (ATy->getNumElements() == 1)
9992 SrcETy = ATy->getElementType();
9999 if (SrcETy->isSingleValueType())
10000 NewPtrTy = PointerType::getUnqual(SrcETy);
10005 // If the memcpy/memmove provides better alignment info than we can
10007 SrcAlign = std::max(SrcAlign, CopyAlign);
10008 DstAlign = std::max(DstAlign, CopyAlign);
10010 Value *Src = Builder->CreateBitCast(MI->getOperand(2), NewPtrTy);
10011 Value *Dest = Builder->CreateBitCast(MI->getOperand(1), NewPtrTy);
10012 Instruction *L = new LoadInst(Src, "tmp", false, SrcAlign);
10013 InsertNewInstBefore(L, *MI);
10014 InsertNewInstBefore(new StoreInst(L, Dest, false, DstAlign), *MI);
10016 // Set the size of the copy to 0, it will be deleted on the next iteration.
10017 MI->setOperand(3, Constant::getNullValue(MemOpLength->getType()));
10021 Instruction *InstCombiner::SimplifyMemSet(MemSetInst *MI) {
10022 unsigned Alignment = GetOrEnforceKnownAlignment(MI->getDest());
10023 if (MI->getAlignment() < Alignment) {
10024 MI->setAlignment(ConstantInt::get(MI->getAlignmentType(),
10025 Alignment, false));
10029 // Extract the length and alignment and fill if they are constant.
10030 ConstantInt *LenC = dyn_cast<ConstantInt>(MI->getLength());
10031 ConstantInt *FillC = dyn_cast<ConstantInt>(MI->getValue());
10032 if (!LenC || !FillC || FillC->getType() != Type::getInt8Ty(*Context))
10034 uint64_t Len = LenC->getZExtValue();
10035 Alignment = MI->getAlignment();
10037 // If the length is zero, this is a no-op
10038 if (Len == 0) return MI; // memset(d,c,0,a) -> noop
10040 // memset(s,c,n) -> store s, c (for n=1,2,4,8)
10041 if (Len <= 8 && isPowerOf2_32((uint32_t)Len)) {
10042 const Type *ITy = IntegerType::get(*Context, Len*8); // n=1 -> i8.
10044 Value *Dest = MI->getDest();
10045 Dest = Builder->CreateBitCast(Dest, PointerType::getUnqual(ITy));
10047 // Alignment 0 is identity for alignment 1 for memset, but not store.
10048 if (Alignment == 0) Alignment = 1;
10050 // Extract the fill value and store.
10051 uint64_t Fill = FillC->getZExtValue()*0x0101010101010101ULL;
10052 InsertNewInstBefore(new StoreInst(ConstantInt::get(ITy, Fill),
10053 Dest, false, Alignment), *MI);
10055 // Set the size of the copy to 0, it will be deleted on the next iteration.
10056 MI->setLength(Constant::getNullValue(LenC->getType()));
10064 /// visitCallInst - CallInst simplification. This mostly only handles folding
10065 /// of intrinsic instructions. For normal calls, it allows visitCallSite to do
10066 /// the heavy lifting.
10068 Instruction *InstCombiner::visitCallInst(CallInst &CI) {
10069 if (isFreeCall(&CI))
10070 return visitFree(CI);
10072 // If the caller function is nounwind, mark the call as nounwind, even if the
10074 if (CI.getParent()->getParent()->doesNotThrow() &&
10075 !CI.doesNotThrow()) {
10076 CI.setDoesNotThrow();
10080 IntrinsicInst *II = dyn_cast<IntrinsicInst>(&CI);
10081 if (!II) return visitCallSite(&CI);
10083 // Intrinsics cannot occur in an invoke, so handle them here instead of in
10085 if (MemIntrinsic *MI = dyn_cast<MemIntrinsic>(II)) {
10086 bool Changed = false;
10088 // memmove/cpy/set of zero bytes is a noop.
10089 if (Constant *NumBytes = dyn_cast<Constant>(MI->getLength())) {
10090 if (NumBytes->isNullValue()) return EraseInstFromFunction(CI);
10092 if (ConstantInt *CI = dyn_cast<ConstantInt>(NumBytes))
10093 if (CI->getZExtValue() == 1) {
10094 // Replace the instruction with just byte operations. We would
10095 // transform other cases to loads/stores, but we don't know if
10096 // alignment is sufficient.
10100 // If we have a memmove and the source operation is a constant global,
10101 // then the source and dest pointers can't alias, so we can change this
10102 // into a call to memcpy.
10103 if (MemMoveInst *MMI = dyn_cast<MemMoveInst>(MI)) {
10104 if (GlobalVariable *GVSrc = dyn_cast<GlobalVariable>(MMI->getSource()))
10105 if (GVSrc->isConstant()) {
10106 Module *M = CI.getParent()->getParent()->getParent();
10107 Intrinsic::ID MemCpyID = Intrinsic::memcpy;
10108 const Type *Tys[1];
10109 Tys[0] = CI.getOperand(3)->getType();
10111 Intrinsic::getDeclaration(M, MemCpyID, Tys, 1));
10116 if (MemTransferInst *MTI = dyn_cast<MemTransferInst>(MI)) {
10117 // memmove(x,x,size) -> noop.
10118 if (MTI->getSource() == MTI->getDest())
10119 return EraseInstFromFunction(CI);
10122 // If we can determine a pointer alignment that is bigger than currently
10123 // set, update the alignment.
10124 if (isa<MemTransferInst>(MI)) {
10125 if (Instruction *I = SimplifyMemTransfer(MI))
10127 } else if (MemSetInst *MSI = dyn_cast<MemSetInst>(MI)) {
10128 if (Instruction *I = SimplifyMemSet(MSI))
10132 if (Changed) return II;
10135 switch (II->getIntrinsicID()) {
10137 case Intrinsic::bswap:
10138 // bswap(bswap(x)) -> x
10139 if (IntrinsicInst *Operand = dyn_cast<IntrinsicInst>(II->getOperand(1)))
10140 if (Operand->getIntrinsicID() == Intrinsic::bswap)
10141 return ReplaceInstUsesWith(CI, Operand->getOperand(1));
10143 // bswap(trunc(bswap(x))) -> trunc(lshr(x, c))
10144 if (TruncInst *TI = dyn_cast<TruncInst>(II->getOperand(1))) {
10145 if (IntrinsicInst *Operand = dyn_cast<IntrinsicInst>(TI->getOperand(0)))
10146 if (Operand->getIntrinsicID() == Intrinsic::bswap) {
10147 unsigned C = Operand->getType()->getPrimitiveSizeInBits() -
10148 TI->getType()->getPrimitiveSizeInBits();
10149 Value *CV = ConstantInt::get(Operand->getType(), C);
10150 Value *V = Builder->CreateLShr(Operand->getOperand(1), CV);
10151 return new TruncInst(V, TI->getType());
10156 case Intrinsic::powi:
10157 if (ConstantInt *Power = dyn_cast<ConstantInt>(II->getOperand(2))) {
10158 // powi(x, 0) -> 1.0
10159 if (Power->isZero())
10160 return ReplaceInstUsesWith(CI, ConstantFP::get(CI.getType(), 1.0));
10162 if (Power->isOne())
10163 return ReplaceInstUsesWith(CI, II->getOperand(1));
10164 // powi(x, -1) -> 1/x
10165 if (Power->isAllOnesValue())
10166 return BinaryOperator::CreateFDiv(ConstantFP::get(CI.getType(), 1.0),
10167 II->getOperand(1));
10171 case Intrinsic::uadd_with_overflow: {
10172 Value *LHS = II->getOperand(1), *RHS = II->getOperand(2);
10173 const IntegerType *IT = cast<IntegerType>(II->getOperand(1)->getType());
10174 uint32_t BitWidth = IT->getBitWidth();
10175 APInt Mask = APInt::getSignBit(BitWidth);
10176 APInt LHSKnownZero(BitWidth, 0);
10177 APInt LHSKnownOne(BitWidth, 0);
10178 ComputeMaskedBits(LHS, Mask, LHSKnownZero, LHSKnownOne);
10179 bool LHSKnownNegative = LHSKnownOne[BitWidth - 1];
10180 bool LHSKnownPositive = LHSKnownZero[BitWidth - 1];
10182 if (LHSKnownNegative || LHSKnownPositive) {
10183 APInt RHSKnownZero(BitWidth, 0);
10184 APInt RHSKnownOne(BitWidth, 0);
10185 ComputeMaskedBits(RHS, Mask, RHSKnownZero, RHSKnownOne);
10186 bool RHSKnownNegative = RHSKnownOne[BitWidth - 1];
10187 bool RHSKnownPositive = RHSKnownZero[BitWidth - 1];
10188 if (LHSKnownNegative && RHSKnownNegative) {
10189 // The sign bit is set in both cases: this MUST overflow.
10190 // Create a simple add instruction, and insert it into the struct.
10191 Instruction *Add = BinaryOperator::CreateAdd(LHS, RHS, "", &CI);
10194 UndefValue::get(LHS->getType()), ConstantInt::getTrue(*Context)
10196 Constant *Struct = ConstantStruct::get(*Context, V, 2, false);
10197 return InsertValueInst::Create(Struct, Add, 0);
10200 if (LHSKnownPositive && RHSKnownPositive) {
10201 // The sign bit is clear in both cases: this CANNOT overflow.
10202 // Create a simple add instruction, and insert it into the struct.
10203 Instruction *Add = BinaryOperator::CreateNUWAdd(LHS, RHS, "", &CI);
10206 UndefValue::get(LHS->getType()), ConstantInt::getFalse(*Context)
10208 Constant *Struct = ConstantStruct::get(*Context, V, 2, false);
10209 return InsertValueInst::Create(Struct, Add, 0);
10213 // FALL THROUGH uadd into sadd
10214 case Intrinsic::sadd_with_overflow:
10215 // Canonicalize constants into the RHS.
10216 if (isa<Constant>(II->getOperand(1)) &&
10217 !isa<Constant>(II->getOperand(2))) {
10218 Value *LHS = II->getOperand(1);
10219 II->setOperand(1, II->getOperand(2));
10220 II->setOperand(2, LHS);
10224 // X + undef -> undef
10225 if (isa<UndefValue>(II->getOperand(2)))
10226 return ReplaceInstUsesWith(CI, UndefValue::get(II->getType()));
10228 if (ConstantInt *RHS = dyn_cast<ConstantInt>(II->getOperand(2))) {
10229 // X + 0 -> {X, false}
10230 if (RHS->isZero()) {
10232 UndefValue::get(II->getOperand(0)->getType()),
10233 ConstantInt::getFalse(*Context)
10235 Constant *Struct = ConstantStruct::get(*Context, V, 2, false);
10236 return InsertValueInst::Create(Struct, II->getOperand(1), 0);
10240 case Intrinsic::usub_with_overflow:
10241 case Intrinsic::ssub_with_overflow:
10242 // undef - X -> undef
10243 // X - undef -> undef
10244 if (isa<UndefValue>(II->getOperand(1)) ||
10245 isa<UndefValue>(II->getOperand(2)))
10246 return ReplaceInstUsesWith(CI, UndefValue::get(II->getType()));
10248 if (ConstantInt *RHS = dyn_cast<ConstantInt>(II->getOperand(2))) {
10249 // X - 0 -> {X, false}
10250 if (RHS->isZero()) {
10252 UndefValue::get(II->getOperand(1)->getType()),
10253 ConstantInt::getFalse(*Context)
10255 Constant *Struct = ConstantStruct::get(*Context, V, 2, false);
10256 return InsertValueInst::Create(Struct, II->getOperand(1), 0);
10260 case Intrinsic::umul_with_overflow:
10261 case Intrinsic::smul_with_overflow:
10262 // Canonicalize constants into the RHS.
10263 if (isa<Constant>(II->getOperand(1)) &&
10264 !isa<Constant>(II->getOperand(2))) {
10265 Value *LHS = II->getOperand(1);
10266 II->setOperand(1, II->getOperand(2));
10267 II->setOperand(2, LHS);
10271 // X * undef -> undef
10272 if (isa<UndefValue>(II->getOperand(2)))
10273 return ReplaceInstUsesWith(CI, UndefValue::get(II->getType()));
10275 if (ConstantInt *RHSI = dyn_cast<ConstantInt>(II->getOperand(2))) {
10276 // X*0 -> {0, false}
10277 if (RHSI->isZero())
10278 return ReplaceInstUsesWith(CI, Constant::getNullValue(II->getType()));
10280 // X * 1 -> {X, false}
10281 if (RHSI->equalsInt(1)) {
10283 UndefValue::get(II->getOperand(1)->getType()),
10284 ConstantInt::getFalse(*Context)
10286 Constant *Struct = ConstantStruct::get(*Context, V, 2, false);
10287 return InsertValueInst::Create(Struct, II->getOperand(1), 0);
10291 case Intrinsic::ppc_altivec_lvx:
10292 case Intrinsic::ppc_altivec_lvxl:
10293 case Intrinsic::x86_sse_loadu_ps:
10294 case Intrinsic::x86_sse2_loadu_pd:
10295 case Intrinsic::x86_sse2_loadu_dq:
10296 // Turn PPC lvx -> load if the pointer is known aligned.
10297 // Turn X86 loadups -> load if the pointer is known aligned.
10298 if (GetOrEnforceKnownAlignment(II->getOperand(1), 16) >= 16) {
10299 Value *Ptr = Builder->CreateBitCast(II->getOperand(1),
10300 PointerType::getUnqual(II->getType()));
10301 return new LoadInst(Ptr);
10304 case Intrinsic::ppc_altivec_stvx:
10305 case Intrinsic::ppc_altivec_stvxl:
10306 // Turn stvx -> store if the pointer is known aligned.
10307 if (GetOrEnforceKnownAlignment(II->getOperand(2), 16) >= 16) {
10308 const Type *OpPtrTy =
10309 PointerType::getUnqual(II->getOperand(1)->getType());
10310 Value *Ptr = Builder->CreateBitCast(II->getOperand(2), OpPtrTy);
10311 return new StoreInst(II->getOperand(1), Ptr);
10314 case Intrinsic::x86_sse_storeu_ps:
10315 case Intrinsic::x86_sse2_storeu_pd:
10316 case Intrinsic::x86_sse2_storeu_dq:
10317 // Turn X86 storeu -> store if the pointer is known aligned.
10318 if (GetOrEnforceKnownAlignment(II->getOperand(1), 16) >= 16) {
10319 const Type *OpPtrTy =
10320 PointerType::getUnqual(II->getOperand(2)->getType());
10321 Value *Ptr = Builder->CreateBitCast(II->getOperand(1), OpPtrTy);
10322 return new StoreInst(II->getOperand(2), Ptr);
10326 case Intrinsic::x86_sse_cvttss2si: {
10327 // These intrinsics only demands the 0th element of its input vector. If
10328 // we can simplify the input based on that, do so now.
10330 cast<VectorType>(II->getOperand(1)->getType())->getNumElements();
10331 APInt DemandedElts(VWidth, 1);
10332 APInt UndefElts(VWidth, 0);
10333 if (Value *V = SimplifyDemandedVectorElts(II->getOperand(1), DemandedElts,
10335 II->setOperand(1, V);
10341 case Intrinsic::ppc_altivec_vperm:
10342 // Turn vperm(V1,V2,mask) -> shuffle(V1,V2,mask) if mask is a constant.
10343 if (ConstantVector *Mask = dyn_cast<ConstantVector>(II->getOperand(3))) {
10344 assert(Mask->getNumOperands() == 16 && "Bad type for intrinsic!");
10346 // Check that all of the elements are integer constants or undefs.
10347 bool AllEltsOk = true;
10348 for (unsigned i = 0; i != 16; ++i) {
10349 if (!isa<ConstantInt>(Mask->getOperand(i)) &&
10350 !isa<UndefValue>(Mask->getOperand(i))) {
10357 // Cast the input vectors to byte vectors.
10358 Value *Op0 = Builder->CreateBitCast(II->getOperand(1), Mask->getType());
10359 Value *Op1 = Builder->CreateBitCast(II->getOperand(2), Mask->getType());
10360 Value *Result = UndefValue::get(Op0->getType());
10362 // Only extract each element once.
10363 Value *ExtractedElts[32];
10364 memset(ExtractedElts, 0, sizeof(ExtractedElts));
10366 for (unsigned i = 0; i != 16; ++i) {
10367 if (isa<UndefValue>(Mask->getOperand(i)))
10369 unsigned Idx=cast<ConstantInt>(Mask->getOperand(i))->getZExtValue();
10370 Idx &= 31; // Match the hardware behavior.
10372 if (ExtractedElts[Idx] == 0) {
10373 ExtractedElts[Idx] =
10374 Builder->CreateExtractElement(Idx < 16 ? Op0 : Op1,
10375 ConstantInt::get(Type::getInt32Ty(*Context), Idx&15, false),
10379 // Insert this value into the result vector.
10380 Result = Builder->CreateInsertElement(Result, ExtractedElts[Idx],
10381 ConstantInt::get(Type::getInt32Ty(*Context), i, false),
10384 return CastInst::Create(Instruction::BitCast, Result, CI.getType());
10389 case Intrinsic::stackrestore: {
10390 // If the save is right next to the restore, remove the restore. This can
10391 // happen when variable allocas are DCE'd.
10392 if (IntrinsicInst *SS = dyn_cast<IntrinsicInst>(II->getOperand(1))) {
10393 if (SS->getIntrinsicID() == Intrinsic::stacksave) {
10394 BasicBlock::iterator BI = SS;
10396 return EraseInstFromFunction(CI);
10400 // Scan down this block to see if there is another stack restore in the
10401 // same block without an intervening call/alloca.
10402 BasicBlock::iterator BI = II;
10403 TerminatorInst *TI = II->getParent()->getTerminator();
10404 bool CannotRemove = false;
10405 for (++BI; &*BI != TI; ++BI) {
10406 if (isa<AllocaInst>(BI) || isMalloc(BI)) {
10407 CannotRemove = true;
10410 if (CallInst *BCI = dyn_cast<CallInst>(BI)) {
10411 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(BCI)) {
10412 // If there is a stackrestore below this one, remove this one.
10413 if (II->getIntrinsicID() == Intrinsic::stackrestore)
10414 return EraseInstFromFunction(CI);
10415 // Otherwise, ignore the intrinsic.
10417 // If we found a non-intrinsic call, we can't remove the stack
10419 CannotRemove = true;
10425 // If the stack restore is in a return/unwind block and if there are no
10426 // allocas or calls between the restore and the return, nuke the restore.
10427 if (!CannotRemove && (isa<ReturnInst>(TI) || isa<UnwindInst>(TI)))
10428 return EraseInstFromFunction(CI);
10433 return visitCallSite(II);
10436 // InvokeInst simplification
10438 Instruction *InstCombiner::visitInvokeInst(InvokeInst &II) {
10439 return visitCallSite(&II);
10442 /// isSafeToEliminateVarargsCast - If this cast does not affect the value
10443 /// passed through the varargs area, we can eliminate the use of the cast.
10444 static bool isSafeToEliminateVarargsCast(const CallSite CS,
10445 const CastInst * const CI,
10446 const TargetData * const TD,
10448 if (!CI->isLosslessCast())
10451 // The size of ByVal arguments is derived from the type, so we
10452 // can't change to a type with a different size. If the size were
10453 // passed explicitly we could avoid this check.
10454 if (!CS.paramHasAttr(ix, Attribute::ByVal))
10457 const Type* SrcTy =
10458 cast<PointerType>(CI->getOperand(0)->getType())->getElementType();
10459 const Type* DstTy = cast<PointerType>(CI->getType())->getElementType();
10460 if (!SrcTy->isSized() || !DstTy->isSized())
10462 if (!TD || TD->getTypeAllocSize(SrcTy) != TD->getTypeAllocSize(DstTy))
10467 // visitCallSite - Improvements for call and invoke instructions.
10469 Instruction *InstCombiner::visitCallSite(CallSite CS) {
10470 bool Changed = false;
10472 // If the callee is a constexpr cast of a function, attempt to move the cast
10473 // to the arguments of the call/invoke.
10474 if (transformConstExprCastCall(CS)) return 0;
10476 Value *Callee = CS.getCalledValue();
10478 if (Function *CalleeF = dyn_cast<Function>(Callee))
10479 if (CalleeF->getCallingConv() != CS.getCallingConv()) {
10480 Instruction *OldCall = CS.getInstruction();
10481 // If the call and callee calling conventions don't match, this call must
10482 // be unreachable, as the call is undefined.
10483 new StoreInst(ConstantInt::getTrue(*Context),
10484 UndefValue::get(Type::getInt1PtrTy(*Context)),
10486 // If OldCall dues not return void then replaceAllUsesWith undef.
10487 // This allows ValueHandlers and custom metadata to adjust itself.
10488 if (!OldCall->getType()->isVoidTy())
10489 OldCall->replaceAllUsesWith(UndefValue::get(OldCall->getType()));
10490 if (isa<CallInst>(OldCall)) // Not worth removing an invoke here.
10491 return EraseInstFromFunction(*OldCall);
10495 if (isa<ConstantPointerNull>(Callee) || isa<UndefValue>(Callee)) {
10496 // This instruction is not reachable, just remove it. We insert a store to
10497 // undef so that we know that this code is not reachable, despite the fact
10498 // that we can't modify the CFG here.
10499 new StoreInst(ConstantInt::getTrue(*Context),
10500 UndefValue::get(Type::getInt1PtrTy(*Context)),
10501 CS.getInstruction());
10503 // If CS dues not return void then replaceAllUsesWith undef.
10504 // This allows ValueHandlers and custom metadata to adjust itself.
10505 if (!CS.getInstruction()->getType()->isVoidTy())
10506 CS.getInstruction()->
10507 replaceAllUsesWith(UndefValue::get(CS.getInstruction()->getType()));
10509 if (InvokeInst *II = dyn_cast<InvokeInst>(CS.getInstruction())) {
10510 // Don't break the CFG, insert a dummy cond branch.
10511 BranchInst::Create(II->getNormalDest(), II->getUnwindDest(),
10512 ConstantInt::getTrue(*Context), II);
10514 return EraseInstFromFunction(*CS.getInstruction());
10517 if (BitCastInst *BC = dyn_cast<BitCastInst>(Callee))
10518 if (IntrinsicInst *In = dyn_cast<IntrinsicInst>(BC->getOperand(0)))
10519 if (In->getIntrinsicID() == Intrinsic::init_trampoline)
10520 return transformCallThroughTrampoline(CS);
10522 const PointerType *PTy = cast<PointerType>(Callee->getType());
10523 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
10524 if (FTy->isVarArg()) {
10525 int ix = FTy->getNumParams() + (isa<InvokeInst>(Callee) ? 3 : 1);
10526 // See if we can optimize any arguments passed through the varargs area of
10528 for (CallSite::arg_iterator I = CS.arg_begin()+FTy->getNumParams(),
10529 E = CS.arg_end(); I != E; ++I, ++ix) {
10530 CastInst *CI = dyn_cast<CastInst>(*I);
10531 if (CI && isSafeToEliminateVarargsCast(CS, CI, TD, ix)) {
10532 *I = CI->getOperand(0);
10538 if (isa<InlineAsm>(Callee) && !CS.doesNotThrow()) {
10539 // Inline asm calls cannot throw - mark them 'nounwind'.
10540 CS.setDoesNotThrow();
10544 return Changed ? CS.getInstruction() : 0;
10547 // transformConstExprCastCall - If the callee is a constexpr cast of a function,
10548 // attempt to move the cast to the arguments of the call/invoke.
10550 bool InstCombiner::transformConstExprCastCall(CallSite CS) {
10551 if (!isa<ConstantExpr>(CS.getCalledValue())) return false;
10552 ConstantExpr *CE = cast<ConstantExpr>(CS.getCalledValue());
10553 if (CE->getOpcode() != Instruction::BitCast ||
10554 !isa<Function>(CE->getOperand(0)))
10556 Function *Callee = cast<Function>(CE->getOperand(0));
10557 Instruction *Caller = CS.getInstruction();
10558 const AttrListPtr &CallerPAL = CS.getAttributes();
10560 // Okay, this is a cast from a function to a different type. Unless doing so
10561 // would cause a type conversion of one of our arguments, change this call to
10562 // be a direct call with arguments casted to the appropriate types.
10564 const FunctionType *FT = Callee->getFunctionType();
10565 const Type *OldRetTy = Caller->getType();
10566 const Type *NewRetTy = FT->getReturnType();
10568 if (isa<StructType>(NewRetTy))
10569 return false; // TODO: Handle multiple return values.
10571 // Check to see if we are changing the return type...
10572 if (OldRetTy != NewRetTy) {
10573 if (Callee->isDeclaration() &&
10574 // Conversion is ok if changing from one pointer type to another or from
10575 // a pointer to an integer of the same size.
10576 !((isa<PointerType>(OldRetTy) || !TD ||
10577 OldRetTy == TD->getIntPtrType(Caller->getContext())) &&
10578 (isa<PointerType>(NewRetTy) || !TD ||
10579 NewRetTy == TD->getIntPtrType(Caller->getContext()))))
10580 return false; // Cannot transform this return value.
10582 if (!Caller->use_empty() &&
10583 // void -> non-void is handled specially
10584 !NewRetTy->isVoidTy() && !CastInst::isCastable(NewRetTy, OldRetTy))
10585 return false; // Cannot transform this return value.
10587 if (!CallerPAL.isEmpty() && !Caller->use_empty()) {
10588 Attributes RAttrs = CallerPAL.getRetAttributes();
10589 if (RAttrs & Attribute::typeIncompatible(NewRetTy))
10590 return false; // Attribute not compatible with transformed value.
10593 // If the callsite is an invoke instruction, and the return value is used by
10594 // a PHI node in a successor, we cannot change the return type of the call
10595 // because there is no place to put the cast instruction (without breaking
10596 // the critical edge). Bail out in this case.
10597 if (!Caller->use_empty())
10598 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller))
10599 for (Value::use_iterator UI = II->use_begin(), E = II->use_end();
10601 if (PHINode *PN = dyn_cast<PHINode>(*UI))
10602 if (PN->getParent() == II->getNormalDest() ||
10603 PN->getParent() == II->getUnwindDest())
10607 unsigned NumActualArgs = unsigned(CS.arg_end()-CS.arg_begin());
10608 unsigned NumCommonArgs = std::min(FT->getNumParams(), NumActualArgs);
10610 CallSite::arg_iterator AI = CS.arg_begin();
10611 for (unsigned i = 0, e = NumCommonArgs; i != e; ++i, ++AI) {
10612 const Type *ParamTy = FT->getParamType(i);
10613 const Type *ActTy = (*AI)->getType();
10615 if (!CastInst::isCastable(ActTy, ParamTy))
10616 return false; // Cannot transform this parameter value.
10618 if (CallerPAL.getParamAttributes(i + 1)
10619 & Attribute::typeIncompatible(ParamTy))
10620 return false; // Attribute not compatible with transformed value.
10622 // Converting from one pointer type to another or between a pointer and an
10623 // integer of the same size is safe even if we do not have a body.
10624 bool isConvertible = ActTy == ParamTy ||
10625 (TD && ((isa<PointerType>(ParamTy) ||
10626 ParamTy == TD->getIntPtrType(Caller->getContext())) &&
10627 (isa<PointerType>(ActTy) ||
10628 ActTy == TD->getIntPtrType(Caller->getContext()))));
10629 if (Callee->isDeclaration() && !isConvertible) return false;
10632 if (FT->getNumParams() < NumActualArgs && !FT->isVarArg() &&
10633 Callee->isDeclaration())
10634 return false; // Do not delete arguments unless we have a function body.
10636 if (FT->getNumParams() < NumActualArgs && FT->isVarArg() &&
10637 !CallerPAL.isEmpty())
10638 // In this case we have more arguments than the new function type, but we
10639 // won't be dropping them. Check that these extra arguments have attributes
10640 // that are compatible with being a vararg call argument.
10641 for (unsigned i = CallerPAL.getNumSlots(); i; --i) {
10642 if (CallerPAL.getSlot(i - 1).Index <= FT->getNumParams())
10644 Attributes PAttrs = CallerPAL.getSlot(i - 1).Attrs;
10645 if (PAttrs & Attribute::VarArgsIncompatible)
10649 // Okay, we decided that this is a safe thing to do: go ahead and start
10650 // inserting cast instructions as necessary...
10651 std::vector<Value*> Args;
10652 Args.reserve(NumActualArgs);
10653 SmallVector<AttributeWithIndex, 8> attrVec;
10654 attrVec.reserve(NumCommonArgs);
10656 // Get any return attributes.
10657 Attributes RAttrs = CallerPAL.getRetAttributes();
10659 // If the return value is not being used, the type may not be compatible
10660 // with the existing attributes. Wipe out any problematic attributes.
10661 RAttrs &= ~Attribute::typeIncompatible(NewRetTy);
10663 // Add the new return attributes.
10665 attrVec.push_back(AttributeWithIndex::get(0, RAttrs));
10667 AI = CS.arg_begin();
10668 for (unsigned i = 0; i != NumCommonArgs; ++i, ++AI) {
10669 const Type *ParamTy = FT->getParamType(i);
10670 if ((*AI)->getType() == ParamTy) {
10671 Args.push_back(*AI);
10673 Instruction::CastOps opcode = CastInst::getCastOpcode(*AI,
10674 false, ParamTy, false);
10675 Args.push_back(Builder->CreateCast(opcode, *AI, ParamTy, "tmp"));
10678 // Add any parameter attributes.
10679 if (Attributes PAttrs = CallerPAL.getParamAttributes(i + 1))
10680 attrVec.push_back(AttributeWithIndex::get(i + 1, PAttrs));
10683 // If the function takes more arguments than the call was taking, add them
10685 for (unsigned i = NumCommonArgs; i != FT->getNumParams(); ++i)
10686 Args.push_back(Constant::getNullValue(FT->getParamType(i)));
10688 // If we are removing arguments to the function, emit an obnoxious warning.
10689 if (FT->getNumParams() < NumActualArgs) {
10690 if (!FT->isVarArg()) {
10691 errs() << "WARNING: While resolving call to function '"
10692 << Callee->getName() << "' arguments were dropped!\n";
10694 // Add all of the arguments in their promoted form to the arg list.
10695 for (unsigned i = FT->getNumParams(); i != NumActualArgs; ++i, ++AI) {
10696 const Type *PTy = getPromotedType((*AI)->getType());
10697 if (PTy != (*AI)->getType()) {
10698 // Must promote to pass through va_arg area!
10699 Instruction::CastOps opcode =
10700 CastInst::getCastOpcode(*AI, false, PTy, false);
10701 Args.push_back(Builder->CreateCast(opcode, *AI, PTy, "tmp"));
10703 Args.push_back(*AI);
10706 // Add any parameter attributes.
10707 if (Attributes PAttrs = CallerPAL.getParamAttributes(i + 1))
10708 attrVec.push_back(AttributeWithIndex::get(i + 1, PAttrs));
10713 if (Attributes FnAttrs = CallerPAL.getFnAttributes())
10714 attrVec.push_back(AttributeWithIndex::get(~0, FnAttrs));
10716 if (NewRetTy->isVoidTy())
10717 Caller->setName(""); // Void type should not have a name.
10719 const AttrListPtr &NewCallerPAL = AttrListPtr::get(attrVec.begin(),
10723 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
10724 NC = InvokeInst::Create(Callee, II->getNormalDest(), II->getUnwindDest(),
10725 Args.begin(), Args.end(),
10726 Caller->getName(), Caller);
10727 cast<InvokeInst>(NC)->setCallingConv(II->getCallingConv());
10728 cast<InvokeInst>(NC)->setAttributes(NewCallerPAL);
10730 NC = CallInst::Create(Callee, Args.begin(), Args.end(),
10731 Caller->getName(), Caller);
10732 CallInst *CI = cast<CallInst>(Caller);
10733 if (CI->isTailCall())
10734 cast<CallInst>(NC)->setTailCall();
10735 cast<CallInst>(NC)->setCallingConv(CI->getCallingConv());
10736 cast<CallInst>(NC)->setAttributes(NewCallerPAL);
10739 // Insert a cast of the return type as necessary.
10741 if (OldRetTy != NV->getType() && !Caller->use_empty()) {
10742 if (!NV->getType()->isVoidTy()) {
10743 Instruction::CastOps opcode = CastInst::getCastOpcode(NC, false,
10745 NV = NC = CastInst::Create(opcode, NC, OldRetTy, "tmp");
10747 // If this is an invoke instruction, we should insert it after the first
10748 // non-phi, instruction in the normal successor block.
10749 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
10750 BasicBlock::iterator I = II->getNormalDest()->getFirstNonPHI();
10751 InsertNewInstBefore(NC, *I);
10753 // Otherwise, it's a call, just insert cast right after the call instr
10754 InsertNewInstBefore(NC, *Caller);
10756 Worklist.AddUsersToWorkList(*Caller);
10758 NV = UndefValue::get(Caller->getType());
10763 if (!Caller->use_empty())
10764 Caller->replaceAllUsesWith(NV);
10766 EraseInstFromFunction(*Caller);
10770 // transformCallThroughTrampoline - Turn a call to a function created by the
10771 // init_trampoline intrinsic into a direct call to the underlying function.
10773 Instruction *InstCombiner::transformCallThroughTrampoline(CallSite CS) {
10774 Value *Callee = CS.getCalledValue();
10775 const PointerType *PTy = cast<PointerType>(Callee->getType());
10776 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
10777 const AttrListPtr &Attrs = CS.getAttributes();
10779 // If the call already has the 'nest' attribute somewhere then give up -
10780 // otherwise 'nest' would occur twice after splicing in the chain.
10781 if (Attrs.hasAttrSomewhere(Attribute::Nest))
10784 IntrinsicInst *Tramp =
10785 cast<IntrinsicInst>(cast<BitCastInst>(Callee)->getOperand(0));
10787 Function *NestF = cast<Function>(Tramp->getOperand(2)->stripPointerCasts());
10788 const PointerType *NestFPTy = cast<PointerType>(NestF->getType());
10789 const FunctionType *NestFTy = cast<FunctionType>(NestFPTy->getElementType());
10791 const AttrListPtr &NestAttrs = NestF->getAttributes();
10792 if (!NestAttrs.isEmpty()) {
10793 unsigned NestIdx = 1;
10794 const Type *NestTy = 0;
10795 Attributes NestAttr = Attribute::None;
10797 // Look for a parameter marked with the 'nest' attribute.
10798 for (FunctionType::param_iterator I = NestFTy->param_begin(),
10799 E = NestFTy->param_end(); I != E; ++NestIdx, ++I)
10800 if (NestAttrs.paramHasAttr(NestIdx, Attribute::Nest)) {
10801 // Record the parameter type and any other attributes.
10803 NestAttr = NestAttrs.getParamAttributes(NestIdx);
10808 Instruction *Caller = CS.getInstruction();
10809 std::vector<Value*> NewArgs;
10810 NewArgs.reserve(unsigned(CS.arg_end()-CS.arg_begin())+1);
10812 SmallVector<AttributeWithIndex, 8> NewAttrs;
10813 NewAttrs.reserve(Attrs.getNumSlots() + 1);
10815 // Insert the nest argument into the call argument list, which may
10816 // mean appending it. Likewise for attributes.
10818 // Add any result attributes.
10819 if (Attributes Attr = Attrs.getRetAttributes())
10820 NewAttrs.push_back(AttributeWithIndex::get(0, Attr));
10824 CallSite::arg_iterator I = CS.arg_begin(), E = CS.arg_end();
10826 if (Idx == NestIdx) {
10827 // Add the chain argument and attributes.
10828 Value *NestVal = Tramp->getOperand(3);
10829 if (NestVal->getType() != NestTy)
10830 NestVal = new BitCastInst(NestVal, NestTy, "nest", Caller);
10831 NewArgs.push_back(NestVal);
10832 NewAttrs.push_back(AttributeWithIndex::get(NestIdx, NestAttr));
10838 // Add the original argument and attributes.
10839 NewArgs.push_back(*I);
10840 if (Attributes Attr = Attrs.getParamAttributes(Idx))
10842 (AttributeWithIndex::get(Idx + (Idx >= NestIdx), Attr));
10848 // Add any function attributes.
10849 if (Attributes Attr = Attrs.getFnAttributes())
10850 NewAttrs.push_back(AttributeWithIndex::get(~0, Attr));
10852 // The trampoline may have been bitcast to a bogus type (FTy).
10853 // Handle this by synthesizing a new function type, equal to FTy
10854 // with the chain parameter inserted.
10856 std::vector<const Type*> NewTypes;
10857 NewTypes.reserve(FTy->getNumParams()+1);
10859 // Insert the chain's type into the list of parameter types, which may
10860 // mean appending it.
10863 FunctionType::param_iterator I = FTy->param_begin(),
10864 E = FTy->param_end();
10867 if (Idx == NestIdx)
10868 // Add the chain's type.
10869 NewTypes.push_back(NestTy);
10874 // Add the original type.
10875 NewTypes.push_back(*I);
10881 // Replace the trampoline call with a direct call. Let the generic
10882 // code sort out any function type mismatches.
10883 FunctionType *NewFTy = FunctionType::get(FTy->getReturnType(), NewTypes,
10885 Constant *NewCallee =
10886 NestF->getType() == PointerType::getUnqual(NewFTy) ?
10887 NestF : ConstantExpr::getBitCast(NestF,
10888 PointerType::getUnqual(NewFTy));
10889 const AttrListPtr &NewPAL = AttrListPtr::get(NewAttrs.begin(),
10892 Instruction *NewCaller;
10893 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
10894 NewCaller = InvokeInst::Create(NewCallee,
10895 II->getNormalDest(), II->getUnwindDest(),
10896 NewArgs.begin(), NewArgs.end(),
10897 Caller->getName(), Caller);
10898 cast<InvokeInst>(NewCaller)->setCallingConv(II->getCallingConv());
10899 cast<InvokeInst>(NewCaller)->setAttributes(NewPAL);
10901 NewCaller = CallInst::Create(NewCallee, NewArgs.begin(), NewArgs.end(),
10902 Caller->getName(), Caller);
10903 if (cast<CallInst>(Caller)->isTailCall())
10904 cast<CallInst>(NewCaller)->setTailCall();
10905 cast<CallInst>(NewCaller)->
10906 setCallingConv(cast<CallInst>(Caller)->getCallingConv());
10907 cast<CallInst>(NewCaller)->setAttributes(NewPAL);
10909 if (!Caller->getType()->isVoidTy())
10910 Caller->replaceAllUsesWith(NewCaller);
10911 Caller->eraseFromParent();
10912 Worklist.Remove(Caller);
10917 // Replace the trampoline call with a direct call. Since there is no 'nest'
10918 // parameter, there is no need to adjust the argument list. Let the generic
10919 // code sort out any function type mismatches.
10920 Constant *NewCallee =
10921 NestF->getType() == PTy ? NestF :
10922 ConstantExpr::getBitCast(NestF, PTy);
10923 CS.setCalledFunction(NewCallee);
10924 return CS.getInstruction();
10927 /// FoldPHIArgBinOpIntoPHI - If we have something like phi [add (a,b), add(a,c)]
10928 /// and if a/b/c and the add's all have a single use, turn this into a phi
10929 /// and a single binop.
10930 Instruction *InstCombiner::FoldPHIArgBinOpIntoPHI(PHINode &PN) {
10931 Instruction *FirstInst = cast<Instruction>(PN.getIncomingValue(0));
10932 assert(isa<BinaryOperator>(FirstInst) || isa<CmpInst>(FirstInst));
10933 unsigned Opc = FirstInst->getOpcode();
10934 Value *LHSVal = FirstInst->getOperand(0);
10935 Value *RHSVal = FirstInst->getOperand(1);
10937 const Type *LHSType = LHSVal->getType();
10938 const Type *RHSType = RHSVal->getType();
10940 // Scan to see if all operands are the same opcode, and all have one use.
10941 for (unsigned i = 1; i != PN.getNumIncomingValues(); ++i) {
10942 Instruction *I = dyn_cast<Instruction>(PN.getIncomingValue(i));
10943 if (!I || I->getOpcode() != Opc || !I->hasOneUse() ||
10944 // Verify type of the LHS matches so we don't fold cmp's of different
10945 // types or GEP's with different index types.
10946 I->getOperand(0)->getType() != LHSType ||
10947 I->getOperand(1)->getType() != RHSType)
10950 // If they are CmpInst instructions, check their predicates
10951 if (Opc == Instruction::ICmp || Opc == Instruction::FCmp)
10952 if (cast<CmpInst>(I)->getPredicate() !=
10953 cast<CmpInst>(FirstInst)->getPredicate())
10956 // Keep track of which operand needs a phi node.
10957 if (I->getOperand(0) != LHSVal) LHSVal = 0;
10958 if (I->getOperand(1) != RHSVal) RHSVal = 0;
10961 // If both LHS and RHS would need a PHI, don't do this transformation,
10962 // because it would increase the number of PHIs entering the block,
10963 // which leads to higher register pressure. This is especially
10964 // bad when the PHIs are in the header of a loop.
10965 if (!LHSVal && !RHSVal)
10968 // Otherwise, this is safe to transform!
10970 Value *InLHS = FirstInst->getOperand(0);
10971 Value *InRHS = FirstInst->getOperand(1);
10972 PHINode *NewLHS = 0, *NewRHS = 0;
10974 NewLHS = PHINode::Create(LHSType,
10975 FirstInst->getOperand(0)->getName() + ".pn");
10976 NewLHS->reserveOperandSpace(PN.getNumOperands()/2);
10977 NewLHS->addIncoming(InLHS, PN.getIncomingBlock(0));
10978 InsertNewInstBefore(NewLHS, PN);
10983 NewRHS = PHINode::Create(RHSType,
10984 FirstInst->getOperand(1)->getName() + ".pn");
10985 NewRHS->reserveOperandSpace(PN.getNumOperands()/2);
10986 NewRHS->addIncoming(InRHS, PN.getIncomingBlock(0));
10987 InsertNewInstBefore(NewRHS, PN);
10991 // Add all operands to the new PHIs.
10992 if (NewLHS || NewRHS) {
10993 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
10994 Instruction *InInst = cast<Instruction>(PN.getIncomingValue(i));
10996 Value *NewInLHS = InInst->getOperand(0);
10997 NewLHS->addIncoming(NewInLHS, PN.getIncomingBlock(i));
11000 Value *NewInRHS = InInst->getOperand(1);
11001 NewRHS->addIncoming(NewInRHS, PN.getIncomingBlock(i));
11006 if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(FirstInst))
11007 return BinaryOperator::Create(BinOp->getOpcode(), LHSVal, RHSVal);
11008 CmpInst *CIOp = cast<CmpInst>(FirstInst);
11009 return CmpInst::Create(CIOp->getOpcode(), CIOp->getPredicate(),
11013 Instruction *InstCombiner::FoldPHIArgGEPIntoPHI(PHINode &PN) {
11014 GetElementPtrInst *FirstInst =cast<GetElementPtrInst>(PN.getIncomingValue(0));
11016 SmallVector<Value*, 16> FixedOperands(FirstInst->op_begin(),
11017 FirstInst->op_end());
11018 // This is true if all GEP bases are allocas and if all indices into them are
11020 bool AllBasePointersAreAllocas = true;
11022 // We don't want to replace this phi if the replacement would require
11023 // more than one phi, which leads to higher register pressure. This is
11024 // especially bad when the PHIs are in the header of a loop.
11025 bool NeededPhi = false;
11027 // Scan to see if all operands are the same opcode, and all have one use.
11028 for (unsigned i = 1; i != PN.getNumIncomingValues(); ++i) {
11029 GetElementPtrInst *GEP= dyn_cast<GetElementPtrInst>(PN.getIncomingValue(i));
11030 if (!GEP || !GEP->hasOneUse() || GEP->getType() != FirstInst->getType() ||
11031 GEP->getNumOperands() != FirstInst->getNumOperands())
11034 // Keep track of whether or not all GEPs are of alloca pointers.
11035 if (AllBasePointersAreAllocas &&
11036 (!isa<AllocaInst>(GEP->getOperand(0)) ||
11037 !GEP->hasAllConstantIndices()))
11038 AllBasePointersAreAllocas = false;
11040 // Compare the operand lists.
11041 for (unsigned op = 0, e = FirstInst->getNumOperands(); op != e; ++op) {
11042 if (FirstInst->getOperand(op) == GEP->getOperand(op))
11045 // Don't merge two GEPs when two operands differ (introducing phi nodes)
11046 // if one of the PHIs has a constant for the index. The index may be
11047 // substantially cheaper to compute for the constants, so making it a
11048 // variable index could pessimize the path. This also handles the case
11049 // for struct indices, which must always be constant.
11050 if (isa<ConstantInt>(FirstInst->getOperand(op)) ||
11051 isa<ConstantInt>(GEP->getOperand(op)))
11054 if (FirstInst->getOperand(op)->getType() !=GEP->getOperand(op)->getType())
11057 // If we already needed a PHI for an earlier operand, and another operand
11058 // also requires a PHI, we'd be introducing more PHIs than we're
11059 // eliminating, which increases register pressure on entry to the PHI's
11064 FixedOperands[op] = 0; // Needs a PHI.
11069 // If all of the base pointers of the PHI'd GEPs are from allocas, don't
11070 // bother doing this transformation. At best, this will just save a bit of
11071 // offset calculation, but all the predecessors will have to materialize the
11072 // stack address into a register anyway. We'd actually rather *clone* the
11073 // load up into the predecessors so that we have a load of a gep of an alloca,
11074 // which can usually all be folded into the load.
11075 if (AllBasePointersAreAllocas)
11078 // Otherwise, this is safe to transform. Insert PHI nodes for each operand
11079 // that is variable.
11080 SmallVector<PHINode*, 16> OperandPhis(FixedOperands.size());
11082 bool HasAnyPHIs = false;
11083 for (unsigned i = 0, e = FixedOperands.size(); i != e; ++i) {
11084 if (FixedOperands[i]) continue; // operand doesn't need a phi.
11085 Value *FirstOp = FirstInst->getOperand(i);
11086 PHINode *NewPN = PHINode::Create(FirstOp->getType(),
11087 FirstOp->getName()+".pn");
11088 InsertNewInstBefore(NewPN, PN);
11090 NewPN->reserveOperandSpace(e);
11091 NewPN->addIncoming(FirstOp, PN.getIncomingBlock(0));
11092 OperandPhis[i] = NewPN;
11093 FixedOperands[i] = NewPN;
11098 // Add all operands to the new PHIs.
11100 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
11101 GetElementPtrInst *InGEP =cast<GetElementPtrInst>(PN.getIncomingValue(i));
11102 BasicBlock *InBB = PN.getIncomingBlock(i);
11104 for (unsigned op = 0, e = OperandPhis.size(); op != e; ++op)
11105 if (PHINode *OpPhi = OperandPhis[op])
11106 OpPhi->addIncoming(InGEP->getOperand(op), InBB);
11110 Value *Base = FixedOperands[0];
11111 return cast<GEPOperator>(FirstInst)->isInBounds() ?
11112 GetElementPtrInst::CreateInBounds(Base, FixedOperands.begin()+1,
11113 FixedOperands.end()) :
11114 GetElementPtrInst::Create(Base, FixedOperands.begin()+1,
11115 FixedOperands.end());
11119 /// isSafeAndProfitableToSinkLoad - Return true if we know that it is safe to
11120 /// sink the load out of the block that defines it. This means that it must be
11121 /// obvious the value of the load is not changed from the point of the load to
11122 /// the end of the block it is in.
11124 /// Finally, it is safe, but not profitable, to sink a load targetting a
11125 /// non-address-taken alloca. Doing so will cause us to not promote the alloca
11127 static bool isSafeAndProfitableToSinkLoad(LoadInst *L) {
11128 BasicBlock::iterator BBI = L, E = L->getParent()->end();
11130 for (++BBI; BBI != E; ++BBI)
11131 if (BBI->mayWriteToMemory())
11134 // Check for non-address taken alloca. If not address-taken already, it isn't
11135 // profitable to do this xform.
11136 if (AllocaInst *AI = dyn_cast<AllocaInst>(L->getOperand(0))) {
11137 bool isAddressTaken = false;
11138 for (Value::use_iterator UI = AI->use_begin(), E = AI->use_end();
11140 if (isa<LoadInst>(UI)) continue;
11141 if (StoreInst *SI = dyn_cast<StoreInst>(*UI)) {
11142 // If storing TO the alloca, then the address isn't taken.
11143 if (SI->getOperand(1) == AI) continue;
11145 isAddressTaken = true;
11149 if (!isAddressTaken && AI->isStaticAlloca())
11153 // If this load is a load from a GEP with a constant offset from an alloca,
11154 // then we don't want to sink it. In its present form, it will be
11155 // load [constant stack offset]. Sinking it will cause us to have to
11156 // materialize the stack addresses in each predecessor in a register only to
11157 // do a shared load from register in the successor.
11158 if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(L->getOperand(0)))
11159 if (AllocaInst *AI = dyn_cast<AllocaInst>(GEP->getOperand(0)))
11160 if (AI->isStaticAlloca() && GEP->hasAllConstantIndices())
11166 Instruction *InstCombiner::FoldPHIArgLoadIntoPHI(PHINode &PN) {
11167 LoadInst *FirstLI = cast<LoadInst>(PN.getIncomingValue(0));
11169 // When processing loads, we need to propagate two bits of information to the
11170 // sunk load: whether it is volatile, and what its alignment is. We currently
11171 // don't sink loads when some have their alignment specified and some don't.
11172 // visitLoadInst will propagate an alignment onto the load when TD is around,
11173 // and if TD isn't around, we can't handle the mixed case.
11174 bool isVolatile = FirstLI->isVolatile();
11175 unsigned LoadAlignment = FirstLI->getAlignment();
11177 // We can't sink the load if the loaded value could be modified between the
11178 // load and the PHI.
11179 if (FirstLI->getParent() != PN.getIncomingBlock(0) ||
11180 !isSafeAndProfitableToSinkLoad(FirstLI))
11183 // If the PHI is of volatile loads and the load block has multiple
11184 // successors, sinking it would remove a load of the volatile value from
11185 // the path through the other successor.
11187 FirstLI->getParent()->getTerminator()->getNumSuccessors() != 1)
11190 // Check to see if all arguments are the same operation.
11191 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
11192 LoadInst *LI = dyn_cast<LoadInst>(PN.getIncomingValue(i));
11193 if (!LI || !LI->hasOneUse())
11196 // We can't sink the load if the loaded value could be modified between
11197 // the load and the PHI.
11198 if (LI->isVolatile() != isVolatile ||
11199 LI->getParent() != PN.getIncomingBlock(i) ||
11200 !isSafeAndProfitableToSinkLoad(LI))
11203 // If some of the loads have an alignment specified but not all of them,
11204 // we can't do the transformation.
11205 if ((LoadAlignment != 0) != (LI->getAlignment() != 0))
11208 LoadAlignment = std::min(LoadAlignment, LI->getAlignment());
11210 // If the PHI is of volatile loads and the load block has multiple
11211 // successors, sinking it would remove a load of the volatile value from
11212 // the path through the other successor.
11214 LI->getParent()->getTerminator()->getNumSuccessors() != 1)
11218 // Okay, they are all the same operation. Create a new PHI node of the
11219 // correct type, and PHI together all of the LHS's of the instructions.
11220 PHINode *NewPN = PHINode::Create(FirstLI->getOperand(0)->getType(),
11221 PN.getName()+".in");
11222 NewPN->reserveOperandSpace(PN.getNumOperands()/2);
11224 Value *InVal = FirstLI->getOperand(0);
11225 NewPN->addIncoming(InVal, PN.getIncomingBlock(0));
11227 // Add all operands to the new PHI.
11228 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
11229 Value *NewInVal = cast<LoadInst>(PN.getIncomingValue(i))->getOperand(0);
11230 if (NewInVal != InVal)
11232 NewPN->addIncoming(NewInVal, PN.getIncomingBlock(i));
11237 // The new PHI unions all of the same values together. This is really
11238 // common, so we handle it intelligently here for compile-time speed.
11242 InsertNewInstBefore(NewPN, PN);
11246 // If this was a volatile load that we are merging, make sure to loop through
11247 // and mark all the input loads as non-volatile. If we don't do this, we will
11248 // insert a new volatile load and the old ones will not be deletable.
11250 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
11251 cast<LoadInst>(PN.getIncomingValue(i))->setVolatile(false);
11253 return new LoadInst(PhiVal, "", isVolatile, LoadAlignment);
11258 /// FoldPHIArgOpIntoPHI - If all operands to a PHI node are the same "unary"
11259 /// operator and they all are only used by the PHI, PHI together their
11260 /// inputs, and do the operation once, to the result of the PHI.
11261 Instruction *InstCombiner::FoldPHIArgOpIntoPHI(PHINode &PN) {
11262 Instruction *FirstInst = cast<Instruction>(PN.getIncomingValue(0));
11264 if (isa<GetElementPtrInst>(FirstInst))
11265 return FoldPHIArgGEPIntoPHI(PN);
11266 if (isa<LoadInst>(FirstInst))
11267 return FoldPHIArgLoadIntoPHI(PN);
11269 // Scan the instruction, looking for input operations that can be folded away.
11270 // If all input operands to the phi are the same instruction (e.g. a cast from
11271 // the same type or "+42") we can pull the operation through the PHI, reducing
11272 // code size and simplifying code.
11273 Constant *ConstantOp = 0;
11274 const Type *CastSrcTy = 0;
11276 if (isa<CastInst>(FirstInst)) {
11277 CastSrcTy = FirstInst->getOperand(0)->getType();
11279 // Be careful about transforming integer PHIs. We don't want to pessimize
11280 // the code by turning an i32 into an i1293.
11281 if (isa<IntegerType>(PN.getType()) && isa<IntegerType>(CastSrcTy)) {
11282 if (!ShouldChangeType(PN.getType(), CastSrcTy, TD))
11285 } else if (isa<BinaryOperator>(FirstInst) || isa<CmpInst>(FirstInst)) {
11286 // Can fold binop, compare or shift here if the RHS is a constant,
11287 // otherwise call FoldPHIArgBinOpIntoPHI.
11288 ConstantOp = dyn_cast<Constant>(FirstInst->getOperand(1));
11289 if (ConstantOp == 0)
11290 return FoldPHIArgBinOpIntoPHI(PN);
11292 return 0; // Cannot fold this operation.
11295 // Check to see if all arguments are the same operation.
11296 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
11297 Instruction *I = dyn_cast<Instruction>(PN.getIncomingValue(i));
11298 if (I == 0 || !I->hasOneUse() || !I->isSameOperationAs(FirstInst))
11301 if (I->getOperand(0)->getType() != CastSrcTy)
11302 return 0; // Cast operation must match.
11303 } else if (I->getOperand(1) != ConstantOp) {
11308 // Okay, they are all the same operation. Create a new PHI node of the
11309 // correct type, and PHI together all of the LHS's of the instructions.
11310 PHINode *NewPN = PHINode::Create(FirstInst->getOperand(0)->getType(),
11311 PN.getName()+".in");
11312 NewPN->reserveOperandSpace(PN.getNumOperands()/2);
11314 Value *InVal = FirstInst->getOperand(0);
11315 NewPN->addIncoming(InVal, PN.getIncomingBlock(0));
11317 // Add all operands to the new PHI.
11318 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
11319 Value *NewInVal = cast<Instruction>(PN.getIncomingValue(i))->getOperand(0);
11320 if (NewInVal != InVal)
11322 NewPN->addIncoming(NewInVal, PN.getIncomingBlock(i));
11327 // The new PHI unions all of the same values together. This is really
11328 // common, so we handle it intelligently here for compile-time speed.
11332 InsertNewInstBefore(NewPN, PN);
11336 // Insert and return the new operation.
11337 if (CastInst *FirstCI = dyn_cast<CastInst>(FirstInst))
11338 return CastInst::Create(FirstCI->getOpcode(), PhiVal, PN.getType());
11340 if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(FirstInst))
11341 return BinaryOperator::Create(BinOp->getOpcode(), PhiVal, ConstantOp);
11343 CmpInst *CIOp = cast<CmpInst>(FirstInst);
11344 return CmpInst::Create(CIOp->getOpcode(), CIOp->getPredicate(),
11345 PhiVal, ConstantOp);
11348 /// DeadPHICycle - Return true if this PHI node is only used by a PHI node cycle
11350 static bool DeadPHICycle(PHINode *PN,
11351 SmallPtrSet<PHINode*, 16> &PotentiallyDeadPHIs) {
11352 if (PN->use_empty()) return true;
11353 if (!PN->hasOneUse()) return false;
11355 // Remember this node, and if we find the cycle, return.
11356 if (!PotentiallyDeadPHIs.insert(PN))
11359 // Don't scan crazily complex things.
11360 if (PotentiallyDeadPHIs.size() == 16)
11363 if (PHINode *PU = dyn_cast<PHINode>(PN->use_back()))
11364 return DeadPHICycle(PU, PotentiallyDeadPHIs);
11369 /// PHIsEqualValue - Return true if this phi node is always equal to
11370 /// NonPhiInVal. This happens with mutually cyclic phi nodes like:
11371 /// z = some value; x = phi (y, z); y = phi (x, z)
11372 static bool PHIsEqualValue(PHINode *PN, Value *NonPhiInVal,
11373 SmallPtrSet<PHINode*, 16> &ValueEqualPHIs) {
11374 // See if we already saw this PHI node.
11375 if (!ValueEqualPHIs.insert(PN))
11378 // Don't scan crazily complex things.
11379 if (ValueEqualPHIs.size() == 16)
11382 // Scan the operands to see if they are either phi nodes or are equal to
11384 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
11385 Value *Op = PN->getIncomingValue(i);
11386 if (PHINode *OpPN = dyn_cast<PHINode>(Op)) {
11387 if (!PHIsEqualValue(OpPN, NonPhiInVal, ValueEqualPHIs))
11389 } else if (Op != NonPhiInVal)
11398 struct PHIUsageRecord {
11399 unsigned PHIId; // The ID # of the PHI (something determinstic to sort on)
11400 unsigned Shift; // The amount shifted.
11401 Instruction *Inst; // The trunc instruction.
11403 PHIUsageRecord(unsigned pn, unsigned Sh, Instruction *User)
11404 : PHIId(pn), Shift(Sh), Inst(User) {}
11406 bool operator<(const PHIUsageRecord &RHS) const {
11407 if (PHIId < RHS.PHIId) return true;
11408 if (PHIId > RHS.PHIId) return false;
11409 if (Shift < RHS.Shift) return true;
11410 if (Shift > RHS.Shift) return false;
11411 return Inst->getType()->getPrimitiveSizeInBits() <
11412 RHS.Inst->getType()->getPrimitiveSizeInBits();
11416 struct LoweredPHIRecord {
11417 PHINode *PN; // The PHI that was lowered.
11418 unsigned Shift; // The amount shifted.
11419 unsigned Width; // The width extracted.
11421 LoweredPHIRecord(PHINode *pn, unsigned Sh, const Type *Ty)
11422 : PN(pn), Shift(Sh), Width(Ty->getPrimitiveSizeInBits()) {}
11424 // Ctor form used by DenseMap.
11425 LoweredPHIRecord(PHINode *pn, unsigned Sh)
11426 : PN(pn), Shift(Sh), Width(0) {}
11432 struct DenseMapInfo<LoweredPHIRecord> {
11433 static inline LoweredPHIRecord getEmptyKey() {
11434 return LoweredPHIRecord(0, 0);
11436 static inline LoweredPHIRecord getTombstoneKey() {
11437 return LoweredPHIRecord(0, 1);
11439 static unsigned getHashValue(const LoweredPHIRecord &Val) {
11440 return DenseMapInfo<PHINode*>::getHashValue(Val.PN) ^ (Val.Shift>>3) ^
11443 static bool isEqual(const LoweredPHIRecord &LHS,
11444 const LoweredPHIRecord &RHS) {
11445 return LHS.PN == RHS.PN && LHS.Shift == RHS.Shift &&
11446 LHS.Width == RHS.Width;
11450 struct isPodLike<LoweredPHIRecord> { static const bool value = true; };
11454 /// SliceUpIllegalIntegerPHI - This is an integer PHI and we know that it has an
11455 /// illegal type: see if it is only used by trunc or trunc(lshr) operations. If
11456 /// so, we split the PHI into the various pieces being extracted. This sort of
11457 /// thing is introduced when SROA promotes an aggregate to large integer values.
11459 /// TODO: The user of the trunc may be an bitcast to float/double/vector or an
11460 /// inttoptr. We should produce new PHIs in the right type.
11462 Instruction *InstCombiner::SliceUpIllegalIntegerPHI(PHINode &FirstPhi) {
11463 // PHIUsers - Keep track of all of the truncated values extracted from a set
11464 // of PHIs, along with their offset. These are the things we want to rewrite.
11465 SmallVector<PHIUsageRecord, 16> PHIUsers;
11467 // PHIs are often mutually cyclic, so we keep track of a whole set of PHI
11468 // nodes which are extracted from. PHIsToSlice is a set we use to avoid
11469 // revisiting PHIs, PHIsInspected is a ordered list of PHIs that we need to
11470 // check the uses of (to ensure they are all extracts).
11471 SmallVector<PHINode*, 8> PHIsToSlice;
11472 SmallPtrSet<PHINode*, 8> PHIsInspected;
11474 PHIsToSlice.push_back(&FirstPhi);
11475 PHIsInspected.insert(&FirstPhi);
11477 for (unsigned PHIId = 0; PHIId != PHIsToSlice.size(); ++PHIId) {
11478 PHINode *PN = PHIsToSlice[PHIId];
11480 // Scan the input list of the PHI. If any input is an invoke, and if the
11481 // input is defined in the predecessor, then we won't be split the critical
11482 // edge which is required to insert a truncate. Because of this, we have to
11484 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
11485 InvokeInst *II = dyn_cast<InvokeInst>(PN->getIncomingValue(i));
11486 if (II == 0) continue;
11487 if (II->getParent() != PN->getIncomingBlock(i))
11490 // If we have a phi, and if it's directly in the predecessor, then we have
11491 // a critical edge where we need to put the truncate. Since we can't
11492 // split the edge in instcombine, we have to bail out.
11497 for (Value::use_iterator UI = PN->use_begin(), E = PN->use_end();
11499 Instruction *User = cast<Instruction>(*UI);
11501 // If the user is a PHI, inspect its uses recursively.
11502 if (PHINode *UserPN = dyn_cast<PHINode>(User)) {
11503 if (PHIsInspected.insert(UserPN))
11504 PHIsToSlice.push_back(UserPN);
11508 // Truncates are always ok.
11509 if (isa<TruncInst>(User)) {
11510 PHIUsers.push_back(PHIUsageRecord(PHIId, 0, User));
11514 // Otherwise it must be a lshr which can only be used by one trunc.
11515 if (User->getOpcode() != Instruction::LShr ||
11516 !User->hasOneUse() || !isa<TruncInst>(User->use_back()) ||
11517 !isa<ConstantInt>(User->getOperand(1)))
11520 unsigned Shift = cast<ConstantInt>(User->getOperand(1))->getZExtValue();
11521 PHIUsers.push_back(PHIUsageRecord(PHIId, Shift, User->use_back()));
11525 // If we have no users, they must be all self uses, just nuke the PHI.
11526 if (PHIUsers.empty())
11527 return ReplaceInstUsesWith(FirstPhi, UndefValue::get(FirstPhi.getType()));
11529 // If this phi node is transformable, create new PHIs for all the pieces
11530 // extracted out of it. First, sort the users by their offset and size.
11531 array_pod_sort(PHIUsers.begin(), PHIUsers.end());
11533 DEBUG(errs() << "SLICING UP PHI: " << FirstPhi << '\n';
11534 for (unsigned i = 1, e = PHIsToSlice.size(); i != e; ++i)
11535 errs() << "AND USER PHI #" << i << ": " << *PHIsToSlice[i] <<'\n';
11538 // PredValues - This is a temporary used when rewriting PHI nodes. It is
11539 // hoisted out here to avoid construction/destruction thrashing.
11540 DenseMap<BasicBlock*, Value*> PredValues;
11542 // ExtractedVals - Each new PHI we introduce is saved here so we don't
11543 // introduce redundant PHIs.
11544 DenseMap<LoweredPHIRecord, PHINode*> ExtractedVals;
11546 for (unsigned UserI = 0, UserE = PHIUsers.size(); UserI != UserE; ++UserI) {
11547 unsigned PHIId = PHIUsers[UserI].PHIId;
11548 PHINode *PN = PHIsToSlice[PHIId];
11549 unsigned Offset = PHIUsers[UserI].Shift;
11550 const Type *Ty = PHIUsers[UserI].Inst->getType();
11554 // If we've already lowered a user like this, reuse the previously lowered
11556 if ((EltPHI = ExtractedVals[LoweredPHIRecord(PN, Offset, Ty)]) == 0) {
11558 // Otherwise, Create the new PHI node for this user.
11559 EltPHI = PHINode::Create(Ty, PN->getName()+".off"+Twine(Offset), PN);
11560 assert(EltPHI->getType() != PN->getType() &&
11561 "Truncate didn't shrink phi?");
11563 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
11564 BasicBlock *Pred = PN->getIncomingBlock(i);
11565 Value *&PredVal = PredValues[Pred];
11567 // If we already have a value for this predecessor, reuse it.
11569 EltPHI->addIncoming(PredVal, Pred);
11573 // Handle the PHI self-reuse case.
11574 Value *InVal = PN->getIncomingValue(i);
11577 EltPHI->addIncoming(PredVal, Pred);
11581 if (PHINode *InPHI = dyn_cast<PHINode>(PN)) {
11582 // If the incoming value was a PHI, and if it was one of the PHIs we
11583 // already rewrote it, just use the lowered value.
11584 if (Value *Res = ExtractedVals[LoweredPHIRecord(InPHI, Offset, Ty)]) {
11586 EltPHI->addIncoming(PredVal, Pred);
11591 // Otherwise, do an extract in the predecessor.
11592 Builder->SetInsertPoint(Pred, Pred->getTerminator());
11593 Value *Res = InVal;
11595 Res = Builder->CreateLShr(Res, ConstantInt::get(InVal->getType(),
11596 Offset), "extract");
11597 Res = Builder->CreateTrunc(Res, Ty, "extract.t");
11599 EltPHI->addIncoming(Res, Pred);
11601 // If the incoming value was a PHI, and if it was one of the PHIs we are
11602 // rewriting, we will ultimately delete the code we inserted. This
11603 // means we need to revisit that PHI to make sure we extract out the
11605 if (PHINode *OldInVal = dyn_cast<PHINode>(PN->getIncomingValue(i)))
11606 if (PHIsInspected.count(OldInVal)) {
11607 unsigned RefPHIId = std::find(PHIsToSlice.begin(),PHIsToSlice.end(),
11608 OldInVal)-PHIsToSlice.begin();
11609 PHIUsers.push_back(PHIUsageRecord(RefPHIId, Offset,
11610 cast<Instruction>(Res)));
11614 PredValues.clear();
11616 DEBUG(errs() << " Made element PHI for offset " << Offset << ": "
11617 << *EltPHI << '\n');
11618 ExtractedVals[LoweredPHIRecord(PN, Offset, Ty)] = EltPHI;
11621 // Replace the use of this piece with the PHI node.
11622 ReplaceInstUsesWith(*PHIUsers[UserI].Inst, EltPHI);
11625 // Replace all the remaining uses of the PHI nodes (self uses and the lshrs)
11627 Value *Undef = UndefValue::get(FirstPhi.getType());
11628 for (unsigned i = 1, e = PHIsToSlice.size(); i != e; ++i)
11629 ReplaceInstUsesWith(*PHIsToSlice[i], Undef);
11630 return ReplaceInstUsesWith(FirstPhi, Undef);
11633 // PHINode simplification
11635 Instruction *InstCombiner::visitPHINode(PHINode &PN) {
11636 // If LCSSA is around, don't mess with Phi nodes
11637 if (MustPreserveLCSSA) return 0;
11639 if (Value *V = PN.hasConstantValue())
11640 return ReplaceInstUsesWith(PN, V);
11642 // If all PHI operands are the same operation, pull them through the PHI,
11643 // reducing code size.
11644 if (isa<Instruction>(PN.getIncomingValue(0)) &&
11645 isa<Instruction>(PN.getIncomingValue(1)) &&
11646 cast<Instruction>(PN.getIncomingValue(0))->getOpcode() ==
11647 cast<Instruction>(PN.getIncomingValue(1))->getOpcode() &&
11648 // FIXME: The hasOneUse check will fail for PHIs that use the value more
11649 // than themselves more than once.
11650 PN.getIncomingValue(0)->hasOneUse())
11651 if (Instruction *Result = FoldPHIArgOpIntoPHI(PN))
11654 // If this is a trivial cycle in the PHI node graph, remove it. Basically, if
11655 // this PHI only has a single use (a PHI), and if that PHI only has one use (a
11656 // PHI)... break the cycle.
11657 if (PN.hasOneUse()) {
11658 Instruction *PHIUser = cast<Instruction>(PN.use_back());
11659 if (PHINode *PU = dyn_cast<PHINode>(PHIUser)) {
11660 SmallPtrSet<PHINode*, 16> PotentiallyDeadPHIs;
11661 PotentiallyDeadPHIs.insert(&PN);
11662 if (DeadPHICycle(PU, PotentiallyDeadPHIs))
11663 return ReplaceInstUsesWith(PN, UndefValue::get(PN.getType()));
11666 // If this phi has a single use, and if that use just computes a value for
11667 // the next iteration of a loop, delete the phi. This occurs with unused
11668 // induction variables, e.g. "for (int j = 0; ; ++j);". Detecting this
11669 // common case here is good because the only other things that catch this
11670 // are induction variable analysis (sometimes) and ADCE, which is only run
11672 if (PHIUser->hasOneUse() &&
11673 (isa<BinaryOperator>(PHIUser) || isa<GetElementPtrInst>(PHIUser)) &&
11674 PHIUser->use_back() == &PN) {
11675 return ReplaceInstUsesWith(PN, UndefValue::get(PN.getType()));
11679 // We sometimes end up with phi cycles that non-obviously end up being the
11680 // same value, for example:
11681 // z = some value; x = phi (y, z); y = phi (x, z)
11682 // where the phi nodes don't necessarily need to be in the same block. Do a
11683 // quick check to see if the PHI node only contains a single non-phi value, if
11684 // so, scan to see if the phi cycle is actually equal to that value.
11686 unsigned InValNo = 0, NumOperandVals = PN.getNumIncomingValues();
11687 // Scan for the first non-phi operand.
11688 while (InValNo != NumOperandVals &&
11689 isa<PHINode>(PN.getIncomingValue(InValNo)))
11692 if (InValNo != NumOperandVals) {
11693 Value *NonPhiInVal = PN.getOperand(InValNo);
11695 // Scan the rest of the operands to see if there are any conflicts, if so
11696 // there is no need to recursively scan other phis.
11697 for (++InValNo; InValNo != NumOperandVals; ++InValNo) {
11698 Value *OpVal = PN.getIncomingValue(InValNo);
11699 if (OpVal != NonPhiInVal && !isa<PHINode>(OpVal))
11703 // If we scanned over all operands, then we have one unique value plus
11704 // phi values. Scan PHI nodes to see if they all merge in each other or
11706 if (InValNo == NumOperandVals) {
11707 SmallPtrSet<PHINode*, 16> ValueEqualPHIs;
11708 if (PHIsEqualValue(&PN, NonPhiInVal, ValueEqualPHIs))
11709 return ReplaceInstUsesWith(PN, NonPhiInVal);
11714 // If there are multiple PHIs, sort their operands so that they all list
11715 // the blocks in the same order. This will help identical PHIs be eliminated
11716 // by other passes. Other passes shouldn't depend on this for correctness
11718 PHINode *FirstPN = cast<PHINode>(PN.getParent()->begin());
11719 if (&PN != FirstPN)
11720 for (unsigned i = 0, e = FirstPN->getNumIncomingValues(); i != e; ++i) {
11721 BasicBlock *BBA = PN.getIncomingBlock(i);
11722 BasicBlock *BBB = FirstPN->getIncomingBlock(i);
11724 Value *VA = PN.getIncomingValue(i);
11725 unsigned j = PN.getBasicBlockIndex(BBB);
11726 Value *VB = PN.getIncomingValue(j);
11727 PN.setIncomingBlock(i, BBB);
11728 PN.setIncomingValue(i, VB);
11729 PN.setIncomingBlock(j, BBA);
11730 PN.setIncomingValue(j, VA);
11731 // NOTE: Instcombine normally would want us to "return &PN" if we
11732 // modified any of the operands of an instruction. However, since we
11733 // aren't adding or removing uses (just rearranging them) we don't do
11734 // this in this case.
11738 // If this is an integer PHI and we know that it has an illegal type, see if
11739 // it is only used by trunc or trunc(lshr) operations. If so, we split the
11740 // PHI into the various pieces being extracted. This sort of thing is
11741 // introduced when SROA promotes an aggregate to a single large integer type.
11742 if (isa<IntegerType>(PN.getType()) && TD &&
11743 !TD->isLegalInteger(PN.getType()->getPrimitiveSizeInBits()))
11744 if (Instruction *Res = SliceUpIllegalIntegerPHI(PN))
11750 Instruction *InstCombiner::visitGetElementPtrInst(GetElementPtrInst &GEP) {
11751 SmallVector<Value*, 8> Ops(GEP.op_begin(), GEP.op_end());
11753 if (Value *V = SimplifyGEPInst(&Ops[0], Ops.size(), TD))
11754 return ReplaceInstUsesWith(GEP, V);
11756 Value *PtrOp = GEP.getOperand(0);
11758 if (isa<UndefValue>(GEP.getOperand(0)))
11759 return ReplaceInstUsesWith(GEP, UndefValue::get(GEP.getType()));
11761 // Eliminate unneeded casts for indices.
11763 bool MadeChange = false;
11764 unsigned PtrSize = TD->getPointerSizeInBits();
11766 gep_type_iterator GTI = gep_type_begin(GEP);
11767 for (User::op_iterator I = GEP.op_begin() + 1, E = GEP.op_end();
11768 I != E; ++I, ++GTI) {
11769 if (!isa<SequentialType>(*GTI)) continue;
11771 // If we are using a wider index than needed for this platform, shrink it
11772 // to what we need. If narrower, sign-extend it to what we need. This
11773 // explicit cast can make subsequent optimizations more obvious.
11774 unsigned OpBits = cast<IntegerType>((*I)->getType())->getBitWidth();
11775 if (OpBits == PtrSize)
11778 *I = Builder->CreateIntCast(*I, TD->getIntPtrType(GEP.getContext()),true);
11781 if (MadeChange) return &GEP;
11784 // Combine Indices - If the source pointer to this getelementptr instruction
11785 // is a getelementptr instruction, combine the indices of the two
11786 // getelementptr instructions into a single instruction.
11788 if (GEPOperator *Src = dyn_cast<GEPOperator>(PtrOp)) {
11789 // Note that if our source is a gep chain itself that we wait for that
11790 // chain to be resolved before we perform this transformation. This
11791 // avoids us creating a TON of code in some cases.
11793 if (GetElementPtrInst *SrcGEP =
11794 dyn_cast<GetElementPtrInst>(Src->getOperand(0)))
11795 if (SrcGEP->getNumOperands() == 2)
11796 return 0; // Wait until our source is folded to completion.
11798 SmallVector<Value*, 8> Indices;
11800 // Find out whether the last index in the source GEP is a sequential idx.
11801 bool EndsWithSequential = false;
11802 for (gep_type_iterator I = gep_type_begin(*Src), E = gep_type_end(*Src);
11804 EndsWithSequential = !isa<StructType>(*I);
11806 // Can we combine the two pointer arithmetics offsets?
11807 if (EndsWithSequential) {
11808 // Replace: gep (gep %P, long B), long A, ...
11809 // With: T = long A+B; gep %P, T, ...
11812 Value *SO1 = Src->getOperand(Src->getNumOperands()-1);
11813 Value *GO1 = GEP.getOperand(1);
11814 if (SO1 == Constant::getNullValue(SO1->getType())) {
11816 } else if (GO1 == Constant::getNullValue(GO1->getType())) {
11819 // If they aren't the same type, then the input hasn't been processed
11820 // by the loop above yet (which canonicalizes sequential index types to
11821 // intptr_t). Just avoid transforming this until the input has been
11823 if (SO1->getType() != GO1->getType())
11825 Sum = Builder->CreateAdd(SO1, GO1, PtrOp->getName()+".sum");
11828 // Update the GEP in place if possible.
11829 if (Src->getNumOperands() == 2) {
11830 GEP.setOperand(0, Src->getOperand(0));
11831 GEP.setOperand(1, Sum);
11834 Indices.append(Src->op_begin()+1, Src->op_end()-1);
11835 Indices.push_back(Sum);
11836 Indices.append(GEP.op_begin()+2, GEP.op_end());
11837 } else if (isa<Constant>(*GEP.idx_begin()) &&
11838 cast<Constant>(*GEP.idx_begin())->isNullValue() &&
11839 Src->getNumOperands() != 1) {
11840 // Otherwise we can do the fold if the first index of the GEP is a zero
11841 Indices.append(Src->op_begin()+1, Src->op_end());
11842 Indices.append(GEP.idx_begin()+1, GEP.idx_end());
11845 if (!Indices.empty())
11846 return (cast<GEPOperator>(&GEP)->isInBounds() &&
11847 Src->isInBounds()) ?
11848 GetElementPtrInst::CreateInBounds(Src->getOperand(0), Indices.begin(),
11849 Indices.end(), GEP.getName()) :
11850 GetElementPtrInst::Create(Src->getOperand(0), Indices.begin(),
11851 Indices.end(), GEP.getName());
11854 // Handle gep(bitcast x) and gep(gep x, 0, 0, 0).
11855 if (Value *X = getBitCastOperand(PtrOp)) {
11856 assert(isa<PointerType>(X->getType()) && "Must be cast from pointer");
11858 // If the input bitcast is actually "bitcast(bitcast(x))", then we don't
11859 // want to change the gep until the bitcasts are eliminated.
11860 if (getBitCastOperand(X)) {
11861 Worklist.AddValue(PtrOp);
11865 bool HasZeroPointerIndex = false;
11866 if (ConstantInt *C = dyn_cast<ConstantInt>(GEP.getOperand(1)))
11867 HasZeroPointerIndex = C->isZero();
11869 // Transform: GEP (bitcast [10 x i8]* X to [0 x i8]*), i32 0, ...
11870 // into : GEP [10 x i8]* X, i32 0, ...
11872 // Likewise, transform: GEP (bitcast i8* X to [0 x i8]*), i32 0, ...
11873 // into : GEP i8* X, ...
11875 // This occurs when the program declares an array extern like "int X[];"
11876 if (HasZeroPointerIndex) {
11877 const PointerType *CPTy = cast<PointerType>(PtrOp->getType());
11878 const PointerType *XTy = cast<PointerType>(X->getType());
11879 if (const ArrayType *CATy =
11880 dyn_cast<ArrayType>(CPTy->getElementType())) {
11881 // GEP (bitcast i8* X to [0 x i8]*), i32 0, ... ?
11882 if (CATy->getElementType() == XTy->getElementType()) {
11883 // -> GEP i8* X, ...
11884 SmallVector<Value*, 8> Indices(GEP.idx_begin()+1, GEP.idx_end());
11885 return cast<GEPOperator>(&GEP)->isInBounds() ?
11886 GetElementPtrInst::CreateInBounds(X, Indices.begin(), Indices.end(),
11888 GetElementPtrInst::Create(X, Indices.begin(), Indices.end(),
11892 if (const ArrayType *XATy = dyn_cast<ArrayType>(XTy->getElementType())){
11893 // GEP (bitcast [10 x i8]* X to [0 x i8]*), i32 0, ... ?
11894 if (CATy->getElementType() == XATy->getElementType()) {
11895 // -> GEP [10 x i8]* X, i32 0, ...
11896 // At this point, we know that the cast source type is a pointer
11897 // to an array of the same type as the destination pointer
11898 // array. Because the array type is never stepped over (there
11899 // is a leading zero) we can fold the cast into this GEP.
11900 GEP.setOperand(0, X);
11905 } else if (GEP.getNumOperands() == 2) {
11906 // Transform things like:
11907 // %t = getelementptr i32* bitcast ([2 x i32]* %str to i32*), i32 %V
11908 // into: %t1 = getelementptr [2 x i32]* %str, i32 0, i32 %V; bitcast
11909 const Type *SrcElTy = cast<PointerType>(X->getType())->getElementType();
11910 const Type *ResElTy=cast<PointerType>(PtrOp->getType())->getElementType();
11911 if (TD && isa<ArrayType>(SrcElTy) &&
11912 TD->getTypeAllocSize(cast<ArrayType>(SrcElTy)->getElementType()) ==
11913 TD->getTypeAllocSize(ResElTy)) {
11915 Idx[0] = Constant::getNullValue(Type::getInt32Ty(*Context));
11916 Idx[1] = GEP.getOperand(1);
11917 Value *NewGEP = cast<GEPOperator>(&GEP)->isInBounds() ?
11918 Builder->CreateInBoundsGEP(X, Idx, Idx + 2, GEP.getName()) :
11919 Builder->CreateGEP(X, Idx, Idx + 2, GEP.getName());
11920 // V and GEP are both pointer types --> BitCast
11921 return new BitCastInst(NewGEP, GEP.getType());
11924 // Transform things like:
11925 // getelementptr i8* bitcast ([100 x double]* X to i8*), i32 %tmp
11926 // (where tmp = 8*tmp2) into:
11927 // getelementptr [100 x double]* %arr, i32 0, i32 %tmp2; bitcast
11929 if (TD && isa<ArrayType>(SrcElTy) && ResElTy == Type::getInt8Ty(*Context)) {
11930 uint64_t ArrayEltSize =
11931 TD->getTypeAllocSize(cast<ArrayType>(SrcElTy)->getElementType());
11933 // Check to see if "tmp" is a scale by a multiple of ArrayEltSize. We
11934 // allow either a mul, shift, or constant here.
11936 ConstantInt *Scale = 0;
11937 if (ArrayEltSize == 1) {
11938 NewIdx = GEP.getOperand(1);
11939 Scale = ConstantInt::get(cast<IntegerType>(NewIdx->getType()), 1);
11940 } else if (ConstantInt *CI = dyn_cast<ConstantInt>(GEP.getOperand(1))) {
11941 NewIdx = ConstantInt::get(CI->getType(), 1);
11943 } else if (Instruction *Inst =dyn_cast<Instruction>(GEP.getOperand(1))){
11944 if (Inst->getOpcode() == Instruction::Shl &&
11945 isa<ConstantInt>(Inst->getOperand(1))) {
11946 ConstantInt *ShAmt = cast<ConstantInt>(Inst->getOperand(1));
11947 uint32_t ShAmtVal = ShAmt->getLimitedValue(64);
11948 Scale = ConstantInt::get(cast<IntegerType>(Inst->getType()),
11950 NewIdx = Inst->getOperand(0);
11951 } else if (Inst->getOpcode() == Instruction::Mul &&
11952 isa<ConstantInt>(Inst->getOperand(1))) {
11953 Scale = cast<ConstantInt>(Inst->getOperand(1));
11954 NewIdx = Inst->getOperand(0);
11958 // If the index will be to exactly the right offset with the scale taken
11959 // out, perform the transformation. Note, we don't know whether Scale is
11960 // signed or not. We'll use unsigned version of division/modulo
11961 // operation after making sure Scale doesn't have the sign bit set.
11962 if (ArrayEltSize && Scale && Scale->getSExtValue() >= 0LL &&
11963 Scale->getZExtValue() % ArrayEltSize == 0) {
11964 Scale = ConstantInt::get(Scale->getType(),
11965 Scale->getZExtValue() / ArrayEltSize);
11966 if (Scale->getZExtValue() != 1) {
11967 Constant *C = ConstantExpr::getIntegerCast(Scale, NewIdx->getType(),
11969 NewIdx = Builder->CreateMul(NewIdx, C, "idxscale");
11972 // Insert the new GEP instruction.
11974 Idx[0] = Constant::getNullValue(Type::getInt32Ty(*Context));
11976 Value *NewGEP = cast<GEPOperator>(&GEP)->isInBounds() ?
11977 Builder->CreateInBoundsGEP(X, Idx, Idx + 2, GEP.getName()) :
11978 Builder->CreateGEP(X, Idx, Idx + 2, GEP.getName());
11979 // The NewGEP must be pointer typed, so must the old one -> BitCast
11980 return new BitCastInst(NewGEP, GEP.getType());
11986 /// See if we can simplify:
11987 /// X = bitcast A* to B*
11988 /// Y = gep X, <...constant indices...>
11989 /// into a gep of the original struct. This is important for SROA and alias
11990 /// analysis of unions. If "A" is also a bitcast, wait for A/X to be merged.
11991 if (BitCastInst *BCI = dyn_cast<BitCastInst>(PtrOp)) {
11993 !isa<BitCastInst>(BCI->getOperand(0)) && GEP.hasAllConstantIndices()) {
11994 // Determine how much the GEP moves the pointer. We are guaranteed to get
11995 // a constant back from EmitGEPOffset.
11996 ConstantInt *OffsetV = cast<ConstantInt>(EmitGEPOffset(&GEP, *this));
11997 int64_t Offset = OffsetV->getSExtValue();
11999 // If this GEP instruction doesn't move the pointer, just replace the GEP
12000 // with a bitcast of the real input to the dest type.
12002 // If the bitcast is of an allocation, and the allocation will be
12003 // converted to match the type of the cast, don't touch this.
12004 if (isa<AllocaInst>(BCI->getOperand(0)) ||
12005 isMalloc(BCI->getOperand(0))) {
12006 // See if the bitcast simplifies, if so, don't nuke this GEP yet.
12007 if (Instruction *I = visitBitCast(*BCI)) {
12010 BCI->getParent()->getInstList().insert(BCI, I);
12011 ReplaceInstUsesWith(*BCI, I);
12016 return new BitCastInst(BCI->getOperand(0), GEP.getType());
12019 // Otherwise, if the offset is non-zero, we need to find out if there is a
12020 // field at Offset in 'A's type. If so, we can pull the cast through the
12022 SmallVector<Value*, 8> NewIndices;
12024 cast<PointerType>(BCI->getOperand(0)->getType())->getElementType();
12025 if (FindElementAtOffset(InTy, Offset, NewIndices, TD, Context)) {
12026 Value *NGEP = cast<GEPOperator>(&GEP)->isInBounds() ?
12027 Builder->CreateInBoundsGEP(BCI->getOperand(0), NewIndices.begin(),
12028 NewIndices.end()) :
12029 Builder->CreateGEP(BCI->getOperand(0), NewIndices.begin(),
12032 if (NGEP->getType() == GEP.getType())
12033 return ReplaceInstUsesWith(GEP, NGEP);
12034 NGEP->takeName(&GEP);
12035 return new BitCastInst(NGEP, GEP.getType());
12043 Instruction *InstCombiner::visitAllocaInst(AllocaInst &AI) {
12044 // Convert: alloca Ty, C - where C is a constant != 1 into: alloca [C x Ty], 1
12045 if (AI.isArrayAllocation()) { // Check C != 1
12046 if (const ConstantInt *C = dyn_cast<ConstantInt>(AI.getArraySize())) {
12047 const Type *NewTy =
12048 ArrayType::get(AI.getAllocatedType(), C->getZExtValue());
12049 assert(isa<AllocaInst>(AI) && "Unknown type of allocation inst!");
12050 AllocaInst *New = Builder->CreateAlloca(NewTy, 0, AI.getName());
12051 New->setAlignment(AI.getAlignment());
12053 // Scan to the end of the allocation instructions, to skip over a block of
12054 // allocas if possible...also skip interleaved debug info
12056 BasicBlock::iterator It = New;
12057 while (isa<AllocaInst>(*It) || isa<DbgInfoIntrinsic>(*It)) ++It;
12059 // Now that I is pointing to the first non-allocation-inst in the block,
12060 // insert our getelementptr instruction...
12062 Value *NullIdx = Constant::getNullValue(Type::getInt32Ty(*Context));
12066 Value *V = GetElementPtrInst::CreateInBounds(New, Idx, Idx + 2,
12067 New->getName()+".sub", It);
12069 // Now make everything use the getelementptr instead of the original
12071 return ReplaceInstUsesWith(AI, V);
12072 } else if (isa<UndefValue>(AI.getArraySize())) {
12073 return ReplaceInstUsesWith(AI, Constant::getNullValue(AI.getType()));
12077 if (TD && isa<AllocaInst>(AI) && AI.getAllocatedType()->isSized()) {
12078 // If alloca'ing a zero byte object, replace the alloca with a null pointer.
12079 // Note that we only do this for alloca's, because malloc should allocate
12080 // and return a unique pointer, even for a zero byte allocation.
12081 if (TD->getTypeAllocSize(AI.getAllocatedType()) == 0)
12082 return ReplaceInstUsesWith(AI, Constant::getNullValue(AI.getType()));
12084 // If the alignment is 0 (unspecified), assign it the preferred alignment.
12085 if (AI.getAlignment() == 0)
12086 AI.setAlignment(TD->getPrefTypeAlignment(AI.getAllocatedType()));
12092 Instruction *InstCombiner::visitFree(Instruction &FI) {
12093 Value *Op = FI.getOperand(1);
12095 // free undef -> unreachable.
12096 if (isa<UndefValue>(Op)) {
12097 // Insert a new store to null because we cannot modify the CFG here.
12098 new StoreInst(ConstantInt::getTrue(*Context),
12099 UndefValue::get(Type::getInt1PtrTy(*Context)), &FI);
12100 return EraseInstFromFunction(FI);
12103 // If we have 'free null' delete the instruction. This can happen in stl code
12104 // when lots of inlining happens.
12105 if (isa<ConstantPointerNull>(Op))
12106 return EraseInstFromFunction(FI);
12108 // If we have a malloc call whose only use is a free call, delete both.
12109 if (isMalloc(Op)) {
12110 if (CallInst* CI = extractMallocCallFromBitCast(Op)) {
12111 if (Op->hasOneUse() && CI->hasOneUse()) {
12112 EraseInstFromFunction(FI);
12113 EraseInstFromFunction(*CI);
12114 return EraseInstFromFunction(*cast<Instruction>(Op));
12117 // Op is a call to malloc
12118 if (Op->hasOneUse()) {
12119 EraseInstFromFunction(FI);
12120 return EraseInstFromFunction(*cast<Instruction>(Op));
12128 /// InstCombineLoadCast - Fold 'load (cast P)' -> cast (load P)' when possible.
12129 static Instruction *InstCombineLoadCast(InstCombiner &IC, LoadInst &LI,
12130 const TargetData *TD) {
12131 User *CI = cast<User>(LI.getOperand(0));
12132 Value *CastOp = CI->getOperand(0);
12133 LLVMContext *Context = IC.getContext();
12135 const PointerType *DestTy = cast<PointerType>(CI->getType());
12136 const Type *DestPTy = DestTy->getElementType();
12137 if (const PointerType *SrcTy = dyn_cast<PointerType>(CastOp->getType())) {
12139 // If the address spaces don't match, don't eliminate the cast.
12140 if (DestTy->getAddressSpace() != SrcTy->getAddressSpace())
12143 const Type *SrcPTy = SrcTy->getElementType();
12145 if (DestPTy->isInteger() || isa<PointerType>(DestPTy) ||
12146 isa<VectorType>(DestPTy)) {
12147 // If the source is an array, the code below will not succeed. Check to
12148 // see if a trivial 'gep P, 0, 0' will help matters. Only do this for
12150 if (const ArrayType *ASrcTy = dyn_cast<ArrayType>(SrcPTy))
12151 if (Constant *CSrc = dyn_cast<Constant>(CastOp))
12152 if (ASrcTy->getNumElements() != 0) {
12154 Idxs[0] = Constant::getNullValue(Type::getInt32Ty(*Context));
12156 CastOp = ConstantExpr::getGetElementPtr(CSrc, Idxs, 2);
12157 SrcTy = cast<PointerType>(CastOp->getType());
12158 SrcPTy = SrcTy->getElementType();
12161 if (IC.getTargetData() &&
12162 (SrcPTy->isInteger() || isa<PointerType>(SrcPTy) ||
12163 isa<VectorType>(SrcPTy)) &&
12164 // Do not allow turning this into a load of an integer, which is then
12165 // casted to a pointer, this pessimizes pointer analysis a lot.
12166 (isa<PointerType>(SrcPTy) == isa<PointerType>(LI.getType())) &&
12167 IC.getTargetData()->getTypeSizeInBits(SrcPTy) ==
12168 IC.getTargetData()->getTypeSizeInBits(DestPTy)) {
12170 // Okay, we are casting from one integer or pointer type to another of
12171 // the same size. Instead of casting the pointer before the load, cast
12172 // the result of the loaded value.
12174 IC.Builder->CreateLoad(CastOp, LI.isVolatile(), CI->getName());
12175 // Now cast the result of the load.
12176 return new BitCastInst(NewLoad, LI.getType());
12183 Instruction *InstCombiner::visitLoadInst(LoadInst &LI) {
12184 Value *Op = LI.getOperand(0);
12186 // Attempt to improve the alignment.
12188 unsigned KnownAlign =
12189 GetOrEnforceKnownAlignment(Op, TD->getPrefTypeAlignment(LI.getType()));
12191 (LI.getAlignment() == 0 ? TD->getABITypeAlignment(LI.getType()) :
12192 LI.getAlignment()))
12193 LI.setAlignment(KnownAlign);
12196 // load (cast X) --> cast (load X) iff safe.
12197 if (isa<CastInst>(Op))
12198 if (Instruction *Res = InstCombineLoadCast(*this, LI, TD))
12201 // None of the following transforms are legal for volatile loads.
12202 if (LI.isVolatile()) return 0;
12204 // Do really simple store-to-load forwarding and load CSE, to catch cases
12205 // where there are several consequtive memory accesses to the same location,
12206 // separated by a few arithmetic operations.
12207 BasicBlock::iterator BBI = &LI;
12208 if (Value *AvailableVal = FindAvailableLoadedValue(Op, LI.getParent(), BBI,6))
12209 return ReplaceInstUsesWith(LI, AvailableVal);
12211 // load(gep null, ...) -> unreachable
12212 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(Op)) {
12213 const Value *GEPI0 = GEPI->getOperand(0);
12214 // TODO: Consider a target hook for valid address spaces for this xform.
12215 if (isa<ConstantPointerNull>(GEPI0) && GEPI->getPointerAddressSpace() == 0){
12216 // Insert a new store to null instruction before the load to indicate
12217 // that this code is not reachable. We do this instead of inserting
12218 // an unreachable instruction directly because we cannot modify the
12220 new StoreInst(UndefValue::get(LI.getType()),
12221 Constant::getNullValue(Op->getType()), &LI);
12222 return ReplaceInstUsesWith(LI, UndefValue::get(LI.getType()));
12226 // load null/undef -> unreachable
12227 // TODO: Consider a target hook for valid address spaces for this xform.
12228 if (isa<UndefValue>(Op) ||
12229 (isa<ConstantPointerNull>(Op) && LI.getPointerAddressSpace() == 0)) {
12230 // Insert a new store to null instruction before the load to indicate that
12231 // this code is not reachable. We do this instead of inserting an
12232 // unreachable instruction directly because we cannot modify the CFG.
12233 new StoreInst(UndefValue::get(LI.getType()),
12234 Constant::getNullValue(Op->getType()), &LI);
12235 return ReplaceInstUsesWith(LI, UndefValue::get(LI.getType()));
12238 // Instcombine load (constantexpr_cast global) -> cast (load global)
12239 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Op))
12241 if (Instruction *Res = InstCombineLoadCast(*this, LI, TD))
12244 if (Op->hasOneUse()) {
12245 // Change select and PHI nodes to select values instead of addresses: this
12246 // helps alias analysis out a lot, allows many others simplifications, and
12247 // exposes redundancy in the code.
12249 // Note that we cannot do the transformation unless we know that the
12250 // introduced loads cannot trap! Something like this is valid as long as
12251 // the condition is always false: load (select bool %C, int* null, int* %G),
12252 // but it would not be valid if we transformed it to load from null
12253 // unconditionally.
12255 if (SelectInst *SI = dyn_cast<SelectInst>(Op)) {
12256 // load (select (Cond, &V1, &V2)) --> select(Cond, load &V1, load &V2).
12257 if (isSafeToLoadUnconditionally(SI->getOperand(1), SI) &&
12258 isSafeToLoadUnconditionally(SI->getOperand(2), SI)) {
12259 Value *V1 = Builder->CreateLoad(SI->getOperand(1),
12260 SI->getOperand(1)->getName()+".val");
12261 Value *V2 = Builder->CreateLoad(SI->getOperand(2),
12262 SI->getOperand(2)->getName()+".val");
12263 return SelectInst::Create(SI->getCondition(), V1, V2);
12266 // load (select (cond, null, P)) -> load P
12267 if (Constant *C = dyn_cast<Constant>(SI->getOperand(1)))
12268 if (C->isNullValue()) {
12269 LI.setOperand(0, SI->getOperand(2));
12273 // load (select (cond, P, null)) -> load P
12274 if (Constant *C = dyn_cast<Constant>(SI->getOperand(2)))
12275 if (C->isNullValue()) {
12276 LI.setOperand(0, SI->getOperand(1));
12284 /// InstCombineStoreToCast - Fold store V, (cast P) -> store (cast V), P
12285 /// when possible. This makes it generally easy to do alias analysis and/or
12286 /// SROA/mem2reg of the memory object.
12287 static Instruction *InstCombineStoreToCast(InstCombiner &IC, StoreInst &SI) {
12288 User *CI = cast<User>(SI.getOperand(1));
12289 Value *CastOp = CI->getOperand(0);
12291 const Type *DestPTy = cast<PointerType>(CI->getType())->getElementType();
12292 const PointerType *SrcTy = dyn_cast<PointerType>(CastOp->getType());
12293 if (SrcTy == 0) return 0;
12295 const Type *SrcPTy = SrcTy->getElementType();
12297 if (!DestPTy->isInteger() && !isa<PointerType>(DestPTy))
12300 /// NewGEPIndices - If SrcPTy is an aggregate type, we can emit a "noop gep"
12301 /// to its first element. This allows us to handle things like:
12302 /// store i32 xxx, (bitcast {foo*, float}* %P to i32*)
12303 /// on 32-bit hosts.
12304 SmallVector<Value*, 4> NewGEPIndices;
12306 // If the source is an array, the code below will not succeed. Check to
12307 // see if a trivial 'gep P, 0, 0' will help matters. Only do this for
12309 if (isa<ArrayType>(SrcPTy) || isa<StructType>(SrcPTy)) {
12310 // Index through pointer.
12311 Constant *Zero = Constant::getNullValue(Type::getInt32Ty(*IC.getContext()));
12312 NewGEPIndices.push_back(Zero);
12315 if (const StructType *STy = dyn_cast<StructType>(SrcPTy)) {
12316 if (!STy->getNumElements()) /* Struct can be empty {} */
12318 NewGEPIndices.push_back(Zero);
12319 SrcPTy = STy->getElementType(0);
12320 } else if (const ArrayType *ATy = dyn_cast<ArrayType>(SrcPTy)) {
12321 NewGEPIndices.push_back(Zero);
12322 SrcPTy = ATy->getElementType();
12328 SrcTy = PointerType::get(SrcPTy, SrcTy->getAddressSpace());
12331 if (!SrcPTy->isInteger() && !isa<PointerType>(SrcPTy))
12334 // If the pointers point into different address spaces or if they point to
12335 // values with different sizes, we can't do the transformation.
12336 if (!IC.getTargetData() ||
12337 SrcTy->getAddressSpace() !=
12338 cast<PointerType>(CI->getType())->getAddressSpace() ||
12339 IC.getTargetData()->getTypeSizeInBits(SrcPTy) !=
12340 IC.getTargetData()->getTypeSizeInBits(DestPTy))
12343 // Okay, we are casting from one integer or pointer type to another of
12344 // the same size. Instead of casting the pointer before
12345 // the store, cast the value to be stored.
12347 Value *SIOp0 = SI.getOperand(0);
12348 Instruction::CastOps opcode = Instruction::BitCast;
12349 const Type* CastSrcTy = SIOp0->getType();
12350 const Type* CastDstTy = SrcPTy;
12351 if (isa<PointerType>(CastDstTy)) {
12352 if (CastSrcTy->isInteger())
12353 opcode = Instruction::IntToPtr;
12354 } else if (isa<IntegerType>(CastDstTy)) {
12355 if (isa<PointerType>(SIOp0->getType()))
12356 opcode = Instruction::PtrToInt;
12359 // SIOp0 is a pointer to aggregate and this is a store to the first field,
12360 // emit a GEP to index into its first field.
12361 if (!NewGEPIndices.empty())
12362 CastOp = IC.Builder->CreateInBoundsGEP(CastOp, NewGEPIndices.begin(),
12363 NewGEPIndices.end());
12365 NewCast = IC.Builder->CreateCast(opcode, SIOp0, CastDstTy,
12366 SIOp0->getName()+".c");
12367 return new StoreInst(NewCast, CastOp);
12370 /// equivalentAddressValues - Test if A and B will obviously have the same
12371 /// value. This includes recognizing that %t0 and %t1 will have the same
12372 /// value in code like this:
12373 /// %t0 = getelementptr \@a, 0, 3
12374 /// store i32 0, i32* %t0
12375 /// %t1 = getelementptr \@a, 0, 3
12376 /// %t2 = load i32* %t1
12378 static bool equivalentAddressValues(Value *A, Value *B) {
12379 // Test if the values are trivially equivalent.
12380 if (A == B) return true;
12382 // Test if the values come form identical arithmetic instructions.
12383 // This uses isIdenticalToWhenDefined instead of isIdenticalTo because
12384 // its only used to compare two uses within the same basic block, which
12385 // means that they'll always either have the same value or one of them
12386 // will have an undefined value.
12387 if (isa<BinaryOperator>(A) ||
12388 isa<CastInst>(A) ||
12390 isa<GetElementPtrInst>(A))
12391 if (Instruction *BI = dyn_cast<Instruction>(B))
12392 if (cast<Instruction>(A)->isIdenticalToWhenDefined(BI))
12395 // Otherwise they may not be equivalent.
12399 // If this instruction has two uses, one of which is a llvm.dbg.declare,
12400 // return the llvm.dbg.declare.
12401 DbgDeclareInst *InstCombiner::hasOneUsePlusDeclare(Value *V) {
12402 if (!V->hasNUses(2))
12404 for (Value::use_iterator UI = V->use_begin(), E = V->use_end();
12406 if (DbgDeclareInst *DI = dyn_cast<DbgDeclareInst>(UI))
12408 if (isa<BitCastInst>(UI) && UI->hasOneUse()) {
12409 if (DbgDeclareInst *DI = dyn_cast<DbgDeclareInst>(UI->use_begin()))
12416 Instruction *InstCombiner::visitStoreInst(StoreInst &SI) {
12417 Value *Val = SI.getOperand(0);
12418 Value *Ptr = SI.getOperand(1);
12420 // If the RHS is an alloca with a single use, zapify the store, making the
12422 // If the RHS is an alloca with a two uses, the other one being a
12423 // llvm.dbg.declare, zapify the store and the declare, making the
12424 // alloca dead. We must do this to prevent declare's from affecting
12426 if (!SI.isVolatile()) {
12427 if (Ptr->hasOneUse()) {
12428 if (isa<AllocaInst>(Ptr)) {
12429 EraseInstFromFunction(SI);
12433 if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Ptr)) {
12434 if (isa<AllocaInst>(GEP->getOperand(0))) {
12435 if (GEP->getOperand(0)->hasOneUse()) {
12436 EraseInstFromFunction(SI);
12440 if (DbgDeclareInst *DI = hasOneUsePlusDeclare(GEP->getOperand(0))) {
12441 EraseInstFromFunction(*DI);
12442 EraseInstFromFunction(SI);
12449 if (DbgDeclareInst *DI = hasOneUsePlusDeclare(Ptr)) {
12450 EraseInstFromFunction(*DI);
12451 EraseInstFromFunction(SI);
12457 // Attempt to improve the alignment.
12459 unsigned KnownAlign =
12460 GetOrEnforceKnownAlignment(Ptr, TD->getPrefTypeAlignment(Val->getType()));
12462 (SI.getAlignment() == 0 ? TD->getABITypeAlignment(Val->getType()) :
12463 SI.getAlignment()))
12464 SI.setAlignment(KnownAlign);
12467 // Do really simple DSE, to catch cases where there are several consecutive
12468 // stores to the same location, separated by a few arithmetic operations. This
12469 // situation often occurs with bitfield accesses.
12470 BasicBlock::iterator BBI = &SI;
12471 for (unsigned ScanInsts = 6; BBI != SI.getParent()->begin() && ScanInsts;
12474 // Don't count debug info directives, lest they affect codegen,
12475 // and we skip pointer-to-pointer bitcasts, which are NOPs.
12476 // It is necessary for correctness to skip those that feed into a
12477 // llvm.dbg.declare, as these are not present when debugging is off.
12478 if (isa<DbgInfoIntrinsic>(BBI) ||
12479 (isa<BitCastInst>(BBI) && isa<PointerType>(BBI->getType()))) {
12484 if (StoreInst *PrevSI = dyn_cast<StoreInst>(BBI)) {
12485 // Prev store isn't volatile, and stores to the same location?
12486 if (!PrevSI->isVolatile() &&equivalentAddressValues(PrevSI->getOperand(1),
12487 SI.getOperand(1))) {
12490 EraseInstFromFunction(*PrevSI);
12496 // If this is a load, we have to stop. However, if the loaded value is from
12497 // the pointer we're loading and is producing the pointer we're storing,
12498 // then *this* store is dead (X = load P; store X -> P).
12499 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) {
12500 if (LI == Val && equivalentAddressValues(LI->getOperand(0), Ptr) &&
12501 !SI.isVolatile()) {
12502 EraseInstFromFunction(SI);
12506 // Otherwise, this is a load from some other location. Stores before it
12507 // may not be dead.
12511 // Don't skip over loads or things that can modify memory.
12512 if (BBI->mayWriteToMemory() || BBI->mayReadFromMemory())
12517 if (SI.isVolatile()) return 0; // Don't hack volatile stores.
12519 // store X, null -> turns into 'unreachable' in SimplifyCFG
12520 if (isa<ConstantPointerNull>(Ptr) && SI.getPointerAddressSpace() == 0) {
12521 if (!isa<UndefValue>(Val)) {
12522 SI.setOperand(0, UndefValue::get(Val->getType()));
12523 if (Instruction *U = dyn_cast<Instruction>(Val))
12524 Worklist.Add(U); // Dropped a use.
12527 return 0; // Do not modify these!
12530 // store undef, Ptr -> noop
12531 if (isa<UndefValue>(Val)) {
12532 EraseInstFromFunction(SI);
12537 // If the pointer destination is a cast, see if we can fold the cast into the
12539 if (isa<CastInst>(Ptr))
12540 if (Instruction *Res = InstCombineStoreToCast(*this, SI))
12542 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Ptr))
12544 if (Instruction *Res = InstCombineStoreToCast(*this, SI))
12548 // If this store is the last instruction in the basic block (possibly
12549 // excepting debug info instructions and the pointer bitcasts that feed
12550 // into them), and if the block ends with an unconditional branch, try
12551 // to move it to the successor block.
12555 } while (isa<DbgInfoIntrinsic>(BBI) ||
12556 (isa<BitCastInst>(BBI) && isa<PointerType>(BBI->getType())));
12557 if (BranchInst *BI = dyn_cast<BranchInst>(BBI))
12558 if (BI->isUnconditional())
12559 if (SimplifyStoreAtEndOfBlock(SI))
12560 return 0; // xform done!
12565 /// SimplifyStoreAtEndOfBlock - Turn things like:
12566 /// if () { *P = v1; } else { *P = v2 }
12567 /// into a phi node with a store in the successor.
12569 /// Simplify things like:
12570 /// *P = v1; if () { *P = v2; }
12571 /// into a phi node with a store in the successor.
12573 bool InstCombiner::SimplifyStoreAtEndOfBlock(StoreInst &SI) {
12574 BasicBlock *StoreBB = SI.getParent();
12576 // Check to see if the successor block has exactly two incoming edges. If
12577 // so, see if the other predecessor contains a store to the same location.
12578 // if so, insert a PHI node (if needed) and move the stores down.
12579 BasicBlock *DestBB = StoreBB->getTerminator()->getSuccessor(0);
12581 // Determine whether Dest has exactly two predecessors and, if so, compute
12582 // the other predecessor.
12583 pred_iterator PI = pred_begin(DestBB);
12584 BasicBlock *OtherBB = 0;
12585 if (*PI != StoreBB)
12588 if (PI == pred_end(DestBB))
12591 if (*PI != StoreBB) {
12596 if (++PI != pred_end(DestBB))
12599 // Bail out if all the relevant blocks aren't distinct (this can happen,
12600 // for example, if SI is in an infinite loop)
12601 if (StoreBB == DestBB || OtherBB == DestBB)
12604 // Verify that the other block ends in a branch and is not otherwise empty.
12605 BasicBlock::iterator BBI = OtherBB->getTerminator();
12606 BranchInst *OtherBr = dyn_cast<BranchInst>(BBI);
12607 if (!OtherBr || BBI == OtherBB->begin())
12610 // If the other block ends in an unconditional branch, check for the 'if then
12611 // else' case. there is an instruction before the branch.
12612 StoreInst *OtherStore = 0;
12613 if (OtherBr->isUnconditional()) {
12615 // Skip over debugging info.
12616 while (isa<DbgInfoIntrinsic>(BBI) ||
12617 (isa<BitCastInst>(BBI) && isa<PointerType>(BBI->getType()))) {
12618 if (BBI==OtherBB->begin())
12622 // If this isn't a store, isn't a store to the same location, or if the
12623 // alignments differ, bail out.
12624 OtherStore = dyn_cast<StoreInst>(BBI);
12625 if (!OtherStore || OtherStore->getOperand(1) != SI.getOperand(1) ||
12626 OtherStore->getAlignment() != SI.getAlignment())
12629 // Otherwise, the other block ended with a conditional branch. If one of the
12630 // destinations is StoreBB, then we have the if/then case.
12631 if (OtherBr->getSuccessor(0) != StoreBB &&
12632 OtherBr->getSuccessor(1) != StoreBB)
12635 // Okay, we know that OtherBr now goes to Dest and StoreBB, so this is an
12636 // if/then triangle. See if there is a store to the same ptr as SI that
12637 // lives in OtherBB.
12639 // Check to see if we find the matching store.
12640 if ((OtherStore = dyn_cast<StoreInst>(BBI))) {
12641 if (OtherStore->getOperand(1) != SI.getOperand(1) ||
12642 OtherStore->getAlignment() != SI.getAlignment())
12646 // If we find something that may be using or overwriting the stored
12647 // value, or if we run out of instructions, we can't do the xform.
12648 if (BBI->mayReadFromMemory() || BBI->mayWriteToMemory() ||
12649 BBI == OtherBB->begin())
12653 // In order to eliminate the store in OtherBr, we have to
12654 // make sure nothing reads or overwrites the stored value in
12656 for (BasicBlock::iterator I = StoreBB->begin(); &*I != &SI; ++I) {
12657 // FIXME: This should really be AA driven.
12658 if (I->mayReadFromMemory() || I->mayWriteToMemory())
12663 // Insert a PHI node now if we need it.
12664 Value *MergedVal = OtherStore->getOperand(0);
12665 if (MergedVal != SI.getOperand(0)) {
12666 PHINode *PN = PHINode::Create(MergedVal->getType(), "storemerge");
12667 PN->reserveOperandSpace(2);
12668 PN->addIncoming(SI.getOperand(0), SI.getParent());
12669 PN->addIncoming(OtherStore->getOperand(0), OtherBB);
12670 MergedVal = InsertNewInstBefore(PN, DestBB->front());
12673 // Advance to a place where it is safe to insert the new store and
12675 BBI = DestBB->getFirstNonPHI();
12676 InsertNewInstBefore(new StoreInst(MergedVal, SI.getOperand(1),
12677 OtherStore->isVolatile(),
12678 SI.getAlignment()), *BBI);
12680 // Nuke the old stores.
12681 EraseInstFromFunction(SI);
12682 EraseInstFromFunction(*OtherStore);
12688 Instruction *InstCombiner::visitBranchInst(BranchInst &BI) {
12689 // Change br (not X), label True, label False to: br X, label False, True
12691 BasicBlock *TrueDest;
12692 BasicBlock *FalseDest;
12693 if (match(&BI, m_Br(m_Not(m_Value(X)), TrueDest, FalseDest)) &&
12694 !isa<Constant>(X)) {
12695 // Swap Destinations and condition...
12696 BI.setCondition(X);
12697 BI.setSuccessor(0, FalseDest);
12698 BI.setSuccessor(1, TrueDest);
12702 // Cannonicalize fcmp_one -> fcmp_oeq
12703 FCmpInst::Predicate FPred; Value *Y;
12704 if (match(&BI, m_Br(m_FCmp(FPred, m_Value(X), m_Value(Y)),
12705 TrueDest, FalseDest)) &&
12706 BI.getCondition()->hasOneUse())
12707 if (FPred == FCmpInst::FCMP_ONE || FPred == FCmpInst::FCMP_OLE ||
12708 FPred == FCmpInst::FCMP_OGE) {
12709 FCmpInst *Cond = cast<FCmpInst>(BI.getCondition());
12710 Cond->setPredicate(FCmpInst::getInversePredicate(FPred));
12712 // Swap Destinations and condition.
12713 BI.setSuccessor(0, FalseDest);
12714 BI.setSuccessor(1, TrueDest);
12715 Worklist.Add(Cond);
12719 // Cannonicalize icmp_ne -> icmp_eq
12720 ICmpInst::Predicate IPred;
12721 if (match(&BI, m_Br(m_ICmp(IPred, m_Value(X), m_Value(Y)),
12722 TrueDest, FalseDest)) &&
12723 BI.getCondition()->hasOneUse())
12724 if (IPred == ICmpInst::ICMP_NE || IPred == ICmpInst::ICMP_ULE ||
12725 IPred == ICmpInst::ICMP_SLE || IPred == ICmpInst::ICMP_UGE ||
12726 IPred == ICmpInst::ICMP_SGE) {
12727 ICmpInst *Cond = cast<ICmpInst>(BI.getCondition());
12728 Cond->setPredicate(ICmpInst::getInversePredicate(IPred));
12729 // Swap Destinations and condition.
12730 BI.setSuccessor(0, FalseDest);
12731 BI.setSuccessor(1, TrueDest);
12732 Worklist.Add(Cond);
12739 Instruction *InstCombiner::visitSwitchInst(SwitchInst &SI) {
12740 Value *Cond = SI.getCondition();
12741 if (Instruction *I = dyn_cast<Instruction>(Cond)) {
12742 if (I->getOpcode() == Instruction::Add)
12743 if (ConstantInt *AddRHS = dyn_cast<ConstantInt>(I->getOperand(1))) {
12744 // change 'switch (X+4) case 1:' into 'switch (X) case -3'
12745 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2)
12747 ConstantExpr::getSub(cast<Constant>(SI.getOperand(i)),
12749 SI.setOperand(0, I->getOperand(0));
12757 Instruction *InstCombiner::visitExtractValueInst(ExtractValueInst &EV) {
12758 Value *Agg = EV.getAggregateOperand();
12760 if (!EV.hasIndices())
12761 return ReplaceInstUsesWith(EV, Agg);
12763 if (Constant *C = dyn_cast<Constant>(Agg)) {
12764 if (isa<UndefValue>(C))
12765 return ReplaceInstUsesWith(EV, UndefValue::get(EV.getType()));
12767 if (isa<ConstantAggregateZero>(C))
12768 return ReplaceInstUsesWith(EV, Constant::getNullValue(EV.getType()));
12770 if (isa<ConstantArray>(C) || isa<ConstantStruct>(C)) {
12771 // Extract the element indexed by the first index out of the constant
12772 Value *V = C->getOperand(*EV.idx_begin());
12773 if (EV.getNumIndices() > 1)
12774 // Extract the remaining indices out of the constant indexed by the
12776 return ExtractValueInst::Create(V, EV.idx_begin() + 1, EV.idx_end());
12778 return ReplaceInstUsesWith(EV, V);
12780 return 0; // Can't handle other constants
12782 if (InsertValueInst *IV = dyn_cast<InsertValueInst>(Agg)) {
12783 // We're extracting from an insertvalue instruction, compare the indices
12784 const unsigned *exti, *exte, *insi, *inse;
12785 for (exti = EV.idx_begin(), insi = IV->idx_begin(),
12786 exte = EV.idx_end(), inse = IV->idx_end();
12787 exti != exte && insi != inse;
12789 if (*insi != *exti)
12790 // The insert and extract both reference distinctly different elements.
12791 // This means the extract is not influenced by the insert, and we can
12792 // replace the aggregate operand of the extract with the aggregate
12793 // operand of the insert. i.e., replace
12794 // %I = insertvalue { i32, { i32 } } %A, { i32 } { i32 42 }, 1
12795 // %E = extractvalue { i32, { i32 } } %I, 0
12797 // %E = extractvalue { i32, { i32 } } %A, 0
12798 return ExtractValueInst::Create(IV->getAggregateOperand(),
12799 EV.idx_begin(), EV.idx_end());
12801 if (exti == exte && insi == inse)
12802 // Both iterators are at the end: Index lists are identical. Replace
12803 // %B = insertvalue { i32, { i32 } } %A, i32 42, 1, 0
12804 // %C = extractvalue { i32, { i32 } } %B, 1, 0
12806 return ReplaceInstUsesWith(EV, IV->getInsertedValueOperand());
12807 if (exti == exte) {
12808 // The extract list is a prefix of the insert list. i.e. replace
12809 // %I = insertvalue { i32, { i32 } } %A, i32 42, 1, 0
12810 // %E = extractvalue { i32, { i32 } } %I, 1
12812 // %X = extractvalue { i32, { i32 } } %A, 1
12813 // %E = insertvalue { i32 } %X, i32 42, 0
12814 // by switching the order of the insert and extract (though the
12815 // insertvalue should be left in, since it may have other uses).
12816 Value *NewEV = Builder->CreateExtractValue(IV->getAggregateOperand(),
12817 EV.idx_begin(), EV.idx_end());
12818 return InsertValueInst::Create(NewEV, IV->getInsertedValueOperand(),
12822 // The insert list is a prefix of the extract list
12823 // We can simply remove the common indices from the extract and make it
12824 // operate on the inserted value instead of the insertvalue result.
12826 // %I = insertvalue { i32, { i32 } } %A, { i32 } { i32 42 }, 1
12827 // %E = extractvalue { i32, { i32 } } %I, 1, 0
12829 // %E extractvalue { i32 } { i32 42 }, 0
12830 return ExtractValueInst::Create(IV->getInsertedValueOperand(),
12833 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(Agg)) {
12834 // We're extracting from an intrinsic, see if we're the only user, which
12835 // allows us to simplify multiple result intrinsics to simpler things that
12836 // just get one value..
12837 if (II->hasOneUse()) {
12838 // Check if we're grabbing the overflow bit or the result of a 'with
12839 // overflow' intrinsic. If it's the latter we can remove the intrinsic
12840 // and replace it with a traditional binary instruction.
12841 switch (II->getIntrinsicID()) {
12842 case Intrinsic::uadd_with_overflow:
12843 case Intrinsic::sadd_with_overflow:
12844 if (*EV.idx_begin() == 0) { // Normal result.
12845 Value *LHS = II->getOperand(1), *RHS = II->getOperand(2);
12846 II->replaceAllUsesWith(UndefValue::get(II->getType()));
12847 EraseInstFromFunction(*II);
12848 return BinaryOperator::CreateAdd(LHS, RHS);
12851 case Intrinsic::usub_with_overflow:
12852 case Intrinsic::ssub_with_overflow:
12853 if (*EV.idx_begin() == 0) { // Normal result.
12854 Value *LHS = II->getOperand(1), *RHS = II->getOperand(2);
12855 II->replaceAllUsesWith(UndefValue::get(II->getType()));
12856 EraseInstFromFunction(*II);
12857 return BinaryOperator::CreateSub(LHS, RHS);
12860 case Intrinsic::umul_with_overflow:
12861 case Intrinsic::smul_with_overflow:
12862 if (*EV.idx_begin() == 0) { // Normal result.
12863 Value *LHS = II->getOperand(1), *RHS = II->getOperand(2);
12864 II->replaceAllUsesWith(UndefValue::get(II->getType()));
12865 EraseInstFromFunction(*II);
12866 return BinaryOperator::CreateMul(LHS, RHS);
12874 // Can't simplify extracts from other values. Note that nested extracts are
12875 // already simplified implicitely by the above (extract ( extract (insert) )
12876 // will be translated into extract ( insert ( extract ) ) first and then just
12877 // the value inserted, if appropriate).
12881 /// CheapToScalarize - Return true if the value is cheaper to scalarize than it
12882 /// is to leave as a vector operation.
12883 static bool CheapToScalarize(Value *V, bool isConstant) {
12884 if (isa<ConstantAggregateZero>(V))
12886 if (ConstantVector *C = dyn_cast<ConstantVector>(V)) {
12887 if (isConstant) return true;
12888 // If all elts are the same, we can extract.
12889 Constant *Op0 = C->getOperand(0);
12890 for (unsigned i = 1; i < C->getNumOperands(); ++i)
12891 if (C->getOperand(i) != Op0)
12895 Instruction *I = dyn_cast<Instruction>(V);
12896 if (!I) return false;
12898 // Insert element gets simplified to the inserted element or is deleted if
12899 // this is constant idx extract element and its a constant idx insertelt.
12900 if (I->getOpcode() == Instruction::InsertElement && isConstant &&
12901 isa<ConstantInt>(I->getOperand(2)))
12903 if (I->getOpcode() == Instruction::Load && I->hasOneUse())
12905 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(I))
12906 if (BO->hasOneUse() &&
12907 (CheapToScalarize(BO->getOperand(0), isConstant) ||
12908 CheapToScalarize(BO->getOperand(1), isConstant)))
12910 if (CmpInst *CI = dyn_cast<CmpInst>(I))
12911 if (CI->hasOneUse() &&
12912 (CheapToScalarize(CI->getOperand(0), isConstant) ||
12913 CheapToScalarize(CI->getOperand(1), isConstant)))
12919 /// Read and decode a shufflevector mask.
12921 /// It turns undef elements into values that are larger than the number of
12922 /// elements in the input.
12923 static std::vector<unsigned> getShuffleMask(const ShuffleVectorInst *SVI) {
12924 unsigned NElts = SVI->getType()->getNumElements();
12925 if (isa<ConstantAggregateZero>(SVI->getOperand(2)))
12926 return std::vector<unsigned>(NElts, 0);
12927 if (isa<UndefValue>(SVI->getOperand(2)))
12928 return std::vector<unsigned>(NElts, 2*NElts);
12930 std::vector<unsigned> Result;
12931 const ConstantVector *CP = cast<ConstantVector>(SVI->getOperand(2));
12932 for (User::const_op_iterator i = CP->op_begin(), e = CP->op_end(); i!=e; ++i)
12933 if (isa<UndefValue>(*i))
12934 Result.push_back(NElts*2); // undef -> 8
12936 Result.push_back(cast<ConstantInt>(*i)->getZExtValue());
12940 /// FindScalarElement - Given a vector and an element number, see if the scalar
12941 /// value is already around as a register, for example if it were inserted then
12942 /// extracted from the vector.
12943 static Value *FindScalarElement(Value *V, unsigned EltNo,
12944 LLVMContext *Context) {
12945 assert(isa<VectorType>(V->getType()) && "Not looking at a vector?");
12946 const VectorType *PTy = cast<VectorType>(V->getType());
12947 unsigned Width = PTy->getNumElements();
12948 if (EltNo >= Width) // Out of range access.
12949 return UndefValue::get(PTy->getElementType());
12951 if (isa<UndefValue>(V))
12952 return UndefValue::get(PTy->getElementType());
12953 else if (isa<ConstantAggregateZero>(V))
12954 return Constant::getNullValue(PTy->getElementType());
12955 else if (ConstantVector *CP = dyn_cast<ConstantVector>(V))
12956 return CP->getOperand(EltNo);
12957 else if (InsertElementInst *III = dyn_cast<InsertElementInst>(V)) {
12958 // If this is an insert to a variable element, we don't know what it is.
12959 if (!isa<ConstantInt>(III->getOperand(2)))
12961 unsigned IIElt = cast<ConstantInt>(III->getOperand(2))->getZExtValue();
12963 // If this is an insert to the element we are looking for, return the
12965 if (EltNo == IIElt)
12966 return III->getOperand(1);
12968 // Otherwise, the insertelement doesn't modify the value, recurse on its
12970 return FindScalarElement(III->getOperand(0), EltNo, Context);
12971 } else if (ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(V)) {
12972 unsigned LHSWidth =
12973 cast<VectorType>(SVI->getOperand(0)->getType())->getNumElements();
12974 unsigned InEl = getShuffleMask(SVI)[EltNo];
12975 if (InEl < LHSWidth)
12976 return FindScalarElement(SVI->getOperand(0), InEl, Context);
12977 else if (InEl < LHSWidth*2)
12978 return FindScalarElement(SVI->getOperand(1), InEl - LHSWidth, Context);
12980 return UndefValue::get(PTy->getElementType());
12983 // Otherwise, we don't know.
12987 Instruction *InstCombiner::visitExtractElementInst(ExtractElementInst &EI) {
12988 // If vector val is undef, replace extract with scalar undef.
12989 if (isa<UndefValue>(EI.getOperand(0)))
12990 return ReplaceInstUsesWith(EI, UndefValue::get(EI.getType()));
12992 // If vector val is constant 0, replace extract with scalar 0.
12993 if (isa<ConstantAggregateZero>(EI.getOperand(0)))
12994 return ReplaceInstUsesWith(EI, Constant::getNullValue(EI.getType()));
12996 if (ConstantVector *C = dyn_cast<ConstantVector>(EI.getOperand(0))) {
12997 // If vector val is constant with all elements the same, replace EI with
12998 // that element. When the elements are not identical, we cannot replace yet
12999 // (we do that below, but only when the index is constant).
13000 Constant *op0 = C->getOperand(0);
13001 for (unsigned i = 1; i != C->getNumOperands(); ++i)
13002 if (C->getOperand(i) != op0) {
13007 return ReplaceInstUsesWith(EI, op0);
13010 // If extracting a specified index from the vector, see if we can recursively
13011 // find a previously computed scalar that was inserted into the vector.
13012 if (ConstantInt *IdxC = dyn_cast<ConstantInt>(EI.getOperand(1))) {
13013 unsigned IndexVal = IdxC->getZExtValue();
13014 unsigned VectorWidth = EI.getVectorOperandType()->getNumElements();
13016 // If this is extracting an invalid index, turn this into undef, to avoid
13017 // crashing the code below.
13018 if (IndexVal >= VectorWidth)
13019 return ReplaceInstUsesWith(EI, UndefValue::get(EI.getType()));
13021 // This instruction only demands the single element from the input vector.
13022 // If the input vector has a single use, simplify it based on this use
13024 if (EI.getOperand(0)->hasOneUse() && VectorWidth != 1) {
13025 APInt UndefElts(VectorWidth, 0);
13026 APInt DemandedMask(VectorWidth, 1 << IndexVal);
13027 if (Value *V = SimplifyDemandedVectorElts(EI.getOperand(0),
13028 DemandedMask, UndefElts)) {
13029 EI.setOperand(0, V);
13034 if (Value *Elt = FindScalarElement(EI.getOperand(0), IndexVal, Context))
13035 return ReplaceInstUsesWith(EI, Elt);
13037 // If the this extractelement is directly using a bitcast from a vector of
13038 // the same number of elements, see if we can find the source element from
13039 // it. In this case, we will end up needing to bitcast the scalars.
13040 if (BitCastInst *BCI = dyn_cast<BitCastInst>(EI.getOperand(0))) {
13041 if (const VectorType *VT =
13042 dyn_cast<VectorType>(BCI->getOperand(0)->getType()))
13043 if (VT->getNumElements() == VectorWidth)
13044 if (Value *Elt = FindScalarElement(BCI->getOperand(0),
13045 IndexVal, Context))
13046 return new BitCastInst(Elt, EI.getType());
13050 if (Instruction *I = dyn_cast<Instruction>(EI.getOperand(0))) {
13051 // Push extractelement into predecessor operation if legal and
13052 // profitable to do so
13053 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(I)) {
13054 if (I->hasOneUse() &&
13055 CheapToScalarize(BO, isa<ConstantInt>(EI.getOperand(1)))) {
13057 Builder->CreateExtractElement(BO->getOperand(0), EI.getOperand(1),
13058 EI.getName()+".lhs");
13060 Builder->CreateExtractElement(BO->getOperand(1), EI.getOperand(1),
13061 EI.getName()+".rhs");
13062 return BinaryOperator::Create(BO->getOpcode(), newEI0, newEI1);
13064 } else if (InsertElementInst *IE = dyn_cast<InsertElementInst>(I)) {
13065 // Extracting the inserted element?
13066 if (IE->getOperand(2) == EI.getOperand(1))
13067 return ReplaceInstUsesWith(EI, IE->getOperand(1));
13068 // If the inserted and extracted elements are constants, they must not
13069 // be the same value, extract from the pre-inserted value instead.
13070 if (isa<Constant>(IE->getOperand(2)) && isa<Constant>(EI.getOperand(1))) {
13071 Worklist.AddValue(EI.getOperand(0));
13072 EI.setOperand(0, IE->getOperand(0));
13075 } else if (ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(I)) {
13076 // If this is extracting an element from a shufflevector, figure out where
13077 // it came from and extract from the appropriate input element instead.
13078 if (ConstantInt *Elt = dyn_cast<ConstantInt>(EI.getOperand(1))) {
13079 unsigned SrcIdx = getShuffleMask(SVI)[Elt->getZExtValue()];
13081 unsigned LHSWidth =
13082 cast<VectorType>(SVI->getOperand(0)->getType())->getNumElements();
13084 if (SrcIdx < LHSWidth)
13085 Src = SVI->getOperand(0);
13086 else if (SrcIdx < LHSWidth*2) {
13087 SrcIdx -= LHSWidth;
13088 Src = SVI->getOperand(1);
13090 return ReplaceInstUsesWith(EI, UndefValue::get(EI.getType()));
13092 return ExtractElementInst::Create(Src,
13093 ConstantInt::get(Type::getInt32Ty(*Context), SrcIdx,
13097 // FIXME: Canonicalize extractelement(bitcast) -> bitcast(extractelement)
13102 /// CollectSingleShuffleElements - If V is a shuffle of values that ONLY returns
13103 /// elements from either LHS or RHS, return the shuffle mask and true.
13104 /// Otherwise, return false.
13105 static bool CollectSingleShuffleElements(Value *V, Value *LHS, Value *RHS,
13106 std::vector<Constant*> &Mask,
13107 LLVMContext *Context) {
13108 assert(V->getType() == LHS->getType() && V->getType() == RHS->getType() &&
13109 "Invalid CollectSingleShuffleElements");
13110 unsigned NumElts = cast<VectorType>(V->getType())->getNumElements();
13112 if (isa<UndefValue>(V)) {
13113 Mask.assign(NumElts, UndefValue::get(Type::getInt32Ty(*Context)));
13115 } else if (V == LHS) {
13116 for (unsigned i = 0; i != NumElts; ++i)
13117 Mask.push_back(ConstantInt::get(Type::getInt32Ty(*Context), i));
13119 } else if (V == RHS) {
13120 for (unsigned i = 0; i != NumElts; ++i)
13121 Mask.push_back(ConstantInt::get(Type::getInt32Ty(*Context), i+NumElts));
13123 } else if (InsertElementInst *IEI = dyn_cast<InsertElementInst>(V)) {
13124 // If this is an insert of an extract from some other vector, include it.
13125 Value *VecOp = IEI->getOperand(0);
13126 Value *ScalarOp = IEI->getOperand(1);
13127 Value *IdxOp = IEI->getOperand(2);
13129 if (!isa<ConstantInt>(IdxOp))
13131 unsigned InsertedIdx = cast<ConstantInt>(IdxOp)->getZExtValue();
13133 if (isa<UndefValue>(ScalarOp)) { // inserting undef into vector.
13134 // Okay, we can handle this if the vector we are insertinting into is
13135 // transitively ok.
13136 if (CollectSingleShuffleElements(VecOp, LHS, RHS, Mask, Context)) {
13137 // If so, update the mask to reflect the inserted undef.
13138 Mask[InsertedIdx] = UndefValue::get(Type::getInt32Ty(*Context));
13141 } else if (ExtractElementInst *EI = dyn_cast<ExtractElementInst>(ScalarOp)){
13142 if (isa<ConstantInt>(EI->getOperand(1)) &&
13143 EI->getOperand(0)->getType() == V->getType()) {
13144 unsigned ExtractedIdx =
13145 cast<ConstantInt>(EI->getOperand(1))->getZExtValue();
13147 // This must be extracting from either LHS or RHS.
13148 if (EI->getOperand(0) == LHS || EI->getOperand(0) == RHS) {
13149 // Okay, we can handle this if the vector we are insertinting into is
13150 // transitively ok.
13151 if (CollectSingleShuffleElements(VecOp, LHS, RHS, Mask, Context)) {
13152 // If so, update the mask to reflect the inserted value.
13153 if (EI->getOperand(0) == LHS) {
13154 Mask[InsertedIdx % NumElts] =
13155 ConstantInt::get(Type::getInt32Ty(*Context), ExtractedIdx);
13157 assert(EI->getOperand(0) == RHS);
13158 Mask[InsertedIdx % NumElts] =
13159 ConstantInt::get(Type::getInt32Ty(*Context), ExtractedIdx+NumElts);
13168 // TODO: Handle shufflevector here!
13173 /// CollectShuffleElements - We are building a shuffle of V, using RHS as the
13174 /// RHS of the shuffle instruction, if it is not null. Return a shuffle mask
13175 /// that computes V and the LHS value of the shuffle.
13176 static Value *CollectShuffleElements(Value *V, std::vector<Constant*> &Mask,
13177 Value *&RHS, LLVMContext *Context) {
13178 assert(isa<VectorType>(V->getType()) &&
13179 (RHS == 0 || V->getType() == RHS->getType()) &&
13180 "Invalid shuffle!");
13181 unsigned NumElts = cast<VectorType>(V->getType())->getNumElements();
13183 if (isa<UndefValue>(V)) {
13184 Mask.assign(NumElts, UndefValue::get(Type::getInt32Ty(*Context)));
13186 } else if (isa<ConstantAggregateZero>(V)) {
13187 Mask.assign(NumElts, ConstantInt::get(Type::getInt32Ty(*Context), 0));
13189 } else if (InsertElementInst *IEI = dyn_cast<InsertElementInst>(V)) {
13190 // If this is an insert of an extract from some other vector, include it.
13191 Value *VecOp = IEI->getOperand(0);
13192 Value *ScalarOp = IEI->getOperand(1);
13193 Value *IdxOp = IEI->getOperand(2);
13195 if (ExtractElementInst *EI = dyn_cast<ExtractElementInst>(ScalarOp)) {
13196 if (isa<ConstantInt>(EI->getOperand(1)) && isa<ConstantInt>(IdxOp) &&
13197 EI->getOperand(0)->getType() == V->getType()) {
13198 unsigned ExtractedIdx =
13199 cast<ConstantInt>(EI->getOperand(1))->getZExtValue();
13200 unsigned InsertedIdx = cast<ConstantInt>(IdxOp)->getZExtValue();
13202 // Either the extracted from or inserted into vector must be RHSVec,
13203 // otherwise we'd end up with a shuffle of three inputs.
13204 if (EI->getOperand(0) == RHS || RHS == 0) {
13205 RHS = EI->getOperand(0);
13206 Value *V = CollectShuffleElements(VecOp, Mask, RHS, Context);
13207 Mask[InsertedIdx % NumElts] =
13208 ConstantInt::get(Type::getInt32Ty(*Context), NumElts+ExtractedIdx);
13212 if (VecOp == RHS) {
13213 Value *V = CollectShuffleElements(EI->getOperand(0), Mask,
13215 // Everything but the extracted element is replaced with the RHS.
13216 for (unsigned i = 0; i != NumElts; ++i) {
13217 if (i != InsertedIdx)
13218 Mask[i] = ConstantInt::get(Type::getInt32Ty(*Context), NumElts+i);
13223 // If this insertelement is a chain that comes from exactly these two
13224 // vectors, return the vector and the effective shuffle.
13225 if (CollectSingleShuffleElements(IEI, EI->getOperand(0), RHS, Mask,
13227 return EI->getOperand(0);
13232 // TODO: Handle shufflevector here!
13234 // Otherwise, can't do anything fancy. Return an identity vector.
13235 for (unsigned i = 0; i != NumElts; ++i)
13236 Mask.push_back(ConstantInt::get(Type::getInt32Ty(*Context), i));
13240 Instruction *InstCombiner::visitInsertElementInst(InsertElementInst &IE) {
13241 Value *VecOp = IE.getOperand(0);
13242 Value *ScalarOp = IE.getOperand(1);
13243 Value *IdxOp = IE.getOperand(2);
13245 // Inserting an undef or into an undefined place, remove this.
13246 if (isa<UndefValue>(ScalarOp) || isa<UndefValue>(IdxOp))
13247 ReplaceInstUsesWith(IE, VecOp);
13249 // If the inserted element was extracted from some other vector, and if the
13250 // indexes are constant, try to turn this into a shufflevector operation.
13251 if (ExtractElementInst *EI = dyn_cast<ExtractElementInst>(ScalarOp)) {
13252 if (isa<ConstantInt>(EI->getOperand(1)) && isa<ConstantInt>(IdxOp) &&
13253 EI->getOperand(0)->getType() == IE.getType()) {
13254 unsigned NumVectorElts = IE.getType()->getNumElements();
13255 unsigned ExtractedIdx =
13256 cast<ConstantInt>(EI->getOperand(1))->getZExtValue();
13257 unsigned InsertedIdx = cast<ConstantInt>(IdxOp)->getZExtValue();
13259 if (ExtractedIdx >= NumVectorElts) // Out of range extract.
13260 return ReplaceInstUsesWith(IE, VecOp);
13262 if (InsertedIdx >= NumVectorElts) // Out of range insert.
13263 return ReplaceInstUsesWith(IE, UndefValue::get(IE.getType()));
13265 // If we are extracting a value from a vector, then inserting it right
13266 // back into the same place, just use the input vector.
13267 if (EI->getOperand(0) == VecOp && ExtractedIdx == InsertedIdx)
13268 return ReplaceInstUsesWith(IE, VecOp);
13270 // If this insertelement isn't used by some other insertelement, turn it
13271 // (and any insertelements it points to), into one big shuffle.
13272 if (!IE.hasOneUse() || !isa<InsertElementInst>(IE.use_back())) {
13273 std::vector<Constant*> Mask;
13275 Value *LHS = CollectShuffleElements(&IE, Mask, RHS, Context);
13276 if (RHS == 0) RHS = UndefValue::get(LHS->getType());
13277 // We now have a shuffle of LHS, RHS, Mask.
13278 return new ShuffleVectorInst(LHS, RHS,
13279 ConstantVector::get(Mask));
13284 unsigned VWidth = cast<VectorType>(VecOp->getType())->getNumElements();
13285 APInt UndefElts(VWidth, 0);
13286 APInt AllOnesEltMask(APInt::getAllOnesValue(VWidth));
13287 if (SimplifyDemandedVectorElts(&IE, AllOnesEltMask, UndefElts))
13294 Instruction *InstCombiner::visitShuffleVectorInst(ShuffleVectorInst &SVI) {
13295 Value *LHS = SVI.getOperand(0);
13296 Value *RHS = SVI.getOperand(1);
13297 std::vector<unsigned> Mask = getShuffleMask(&SVI);
13299 bool MadeChange = false;
13301 // Undefined shuffle mask -> undefined value.
13302 if (isa<UndefValue>(SVI.getOperand(2)))
13303 return ReplaceInstUsesWith(SVI, UndefValue::get(SVI.getType()));
13305 unsigned VWidth = cast<VectorType>(SVI.getType())->getNumElements();
13307 if (VWidth != cast<VectorType>(LHS->getType())->getNumElements())
13310 APInt UndefElts(VWidth, 0);
13311 APInt AllOnesEltMask(APInt::getAllOnesValue(VWidth));
13312 if (SimplifyDemandedVectorElts(&SVI, AllOnesEltMask, UndefElts)) {
13313 LHS = SVI.getOperand(0);
13314 RHS = SVI.getOperand(1);
13318 // Canonicalize shuffle(x ,x,mask) -> shuffle(x, undef,mask')
13319 // Canonicalize shuffle(undef,x,mask) -> shuffle(x, undef,mask').
13320 if (LHS == RHS || isa<UndefValue>(LHS)) {
13321 if (isa<UndefValue>(LHS) && LHS == RHS) {
13322 // shuffle(undef,undef,mask) -> undef.
13323 return ReplaceInstUsesWith(SVI, LHS);
13326 // Remap any references to RHS to use LHS.
13327 std::vector<Constant*> Elts;
13328 for (unsigned i = 0, e = Mask.size(); i != e; ++i) {
13329 if (Mask[i] >= 2*e)
13330 Elts.push_back(UndefValue::get(Type::getInt32Ty(*Context)));
13332 if ((Mask[i] >= e && isa<UndefValue>(RHS)) ||
13333 (Mask[i] < e && isa<UndefValue>(LHS))) {
13334 Mask[i] = 2*e; // Turn into undef.
13335 Elts.push_back(UndefValue::get(Type::getInt32Ty(*Context)));
13337 Mask[i] = Mask[i] % e; // Force to LHS.
13338 Elts.push_back(ConstantInt::get(Type::getInt32Ty(*Context), Mask[i]));
13342 SVI.setOperand(0, SVI.getOperand(1));
13343 SVI.setOperand(1, UndefValue::get(RHS->getType()));
13344 SVI.setOperand(2, ConstantVector::get(Elts));
13345 LHS = SVI.getOperand(0);
13346 RHS = SVI.getOperand(1);
13350 // Analyze the shuffle, are the LHS or RHS and identity shuffles?
13351 bool isLHSID = true, isRHSID = true;
13353 for (unsigned i = 0, e = Mask.size(); i != e; ++i) {
13354 if (Mask[i] >= e*2) continue; // Ignore undef values.
13355 // Is this an identity shuffle of the LHS value?
13356 isLHSID &= (Mask[i] == i);
13358 // Is this an identity shuffle of the RHS value?
13359 isRHSID &= (Mask[i]-e == i);
13362 // Eliminate identity shuffles.
13363 if (isLHSID) return ReplaceInstUsesWith(SVI, LHS);
13364 if (isRHSID) return ReplaceInstUsesWith(SVI, RHS);
13366 // If the LHS is a shufflevector itself, see if we can combine it with this
13367 // one without producing an unusual shuffle. Here we are really conservative:
13368 // we are absolutely afraid of producing a shuffle mask not in the input
13369 // program, because the code gen may not be smart enough to turn a merged
13370 // shuffle into two specific shuffles: it may produce worse code. As such,
13371 // we only merge two shuffles if the result is one of the two input shuffle
13372 // masks. In this case, merging the shuffles just removes one instruction,
13373 // which we know is safe. This is good for things like turning:
13374 // (splat(splat)) -> splat.
13375 if (ShuffleVectorInst *LHSSVI = dyn_cast<ShuffleVectorInst>(LHS)) {
13376 if (isa<UndefValue>(RHS)) {
13377 std::vector<unsigned> LHSMask = getShuffleMask(LHSSVI);
13379 if (LHSMask.size() == Mask.size()) {
13380 std::vector<unsigned> NewMask;
13381 for (unsigned i = 0, e = Mask.size(); i != e; ++i)
13383 NewMask.push_back(2*e);
13385 NewMask.push_back(LHSMask[Mask[i]]);
13387 // If the result mask is equal to the src shuffle or this
13388 // shuffle mask, do the replacement.
13389 if (NewMask == LHSMask || NewMask == Mask) {
13390 unsigned LHSInNElts =
13391 cast<VectorType>(LHSSVI->getOperand(0)->getType())->
13393 std::vector<Constant*> Elts;
13394 for (unsigned i = 0, e = NewMask.size(); i != e; ++i) {
13395 if (NewMask[i] >= LHSInNElts*2) {
13396 Elts.push_back(UndefValue::get(Type::getInt32Ty(*Context)));
13398 Elts.push_back(ConstantInt::get(Type::getInt32Ty(*Context),
13402 return new ShuffleVectorInst(LHSSVI->getOperand(0),
13403 LHSSVI->getOperand(1),
13404 ConstantVector::get(Elts));
13410 return MadeChange ? &SVI : 0;
13416 /// TryToSinkInstruction - Try to move the specified instruction from its
13417 /// current block into the beginning of DestBlock, which can only happen if it's
13418 /// safe to move the instruction past all of the instructions between it and the
13419 /// end of its block.
13420 static bool TryToSinkInstruction(Instruction *I, BasicBlock *DestBlock) {
13421 assert(I->hasOneUse() && "Invariants didn't hold!");
13423 // Cannot move control-flow-involving, volatile loads, vaarg, etc.
13424 if (isa<PHINode>(I) || I->mayHaveSideEffects() || isa<TerminatorInst>(I))
13427 // Do not sink alloca instructions out of the entry block.
13428 if (isa<AllocaInst>(I) && I->getParent() ==
13429 &DestBlock->getParent()->getEntryBlock())
13432 // We can only sink load instructions if there is nothing between the load and
13433 // the end of block that could change the value.
13434 if (I->mayReadFromMemory()) {
13435 for (BasicBlock::iterator Scan = I, E = I->getParent()->end();
13437 if (Scan->mayWriteToMemory())
13441 BasicBlock::iterator InsertPos = DestBlock->getFirstNonPHI();
13443 CopyPrecedingStopPoint(I, InsertPos);
13444 I->moveBefore(InsertPos);
13450 /// AddReachableCodeToWorklist - Walk the function in depth-first order, adding
13451 /// all reachable code to the worklist.
13453 /// This has a couple of tricks to make the code faster and more powerful. In
13454 /// particular, we constant fold and DCE instructions as we go, to avoid adding
13455 /// them to the worklist (this significantly speeds up instcombine on code where
13456 /// many instructions are dead or constant). Additionally, if we find a branch
13457 /// whose condition is a known constant, we only visit the reachable successors.
13459 static bool AddReachableCodeToWorklist(BasicBlock *BB,
13460 SmallPtrSet<BasicBlock*, 64> &Visited,
13462 const TargetData *TD) {
13463 bool MadeIRChange = false;
13464 SmallVector<BasicBlock*, 256> Worklist;
13465 Worklist.push_back(BB);
13467 std::vector<Instruction*> InstrsForInstCombineWorklist;
13468 InstrsForInstCombineWorklist.reserve(128);
13470 SmallPtrSet<ConstantExpr*, 64> FoldedConstants;
13472 while (!Worklist.empty()) {
13473 BB = Worklist.back();
13474 Worklist.pop_back();
13476 // We have now visited this block! If we've already been here, ignore it.
13477 if (!Visited.insert(BB)) continue;
13479 for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E; ) {
13480 Instruction *Inst = BBI++;
13482 // DCE instruction if trivially dead.
13483 if (isInstructionTriviallyDead(Inst)) {
13485 DEBUG(errs() << "IC: DCE: " << *Inst << '\n');
13486 Inst->eraseFromParent();
13490 // ConstantProp instruction if trivially constant.
13491 if (!Inst->use_empty() && isa<Constant>(Inst->getOperand(0)))
13492 if (Constant *C = ConstantFoldInstruction(Inst, TD)) {
13493 DEBUG(errs() << "IC: ConstFold to: " << *C << " from: "
13495 Inst->replaceAllUsesWith(C);
13497 Inst->eraseFromParent();
13504 // See if we can constant fold its operands.
13505 for (User::op_iterator i = Inst->op_begin(), e = Inst->op_end();
13507 ConstantExpr *CE = dyn_cast<ConstantExpr>(i);
13508 if (CE == 0) continue;
13510 // If we already folded this constant, don't try again.
13511 if (!FoldedConstants.insert(CE))
13514 Constant *NewC = ConstantFoldConstantExpression(CE, TD);
13515 if (NewC && NewC != CE) {
13517 MadeIRChange = true;
13523 InstrsForInstCombineWorklist.push_back(Inst);
13526 // Recursively visit successors. If this is a branch or switch on a
13527 // constant, only visit the reachable successor.
13528 TerminatorInst *TI = BB->getTerminator();
13529 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
13530 if (BI->isConditional() && isa<ConstantInt>(BI->getCondition())) {
13531 bool CondVal = cast<ConstantInt>(BI->getCondition())->getZExtValue();
13532 BasicBlock *ReachableBB = BI->getSuccessor(!CondVal);
13533 Worklist.push_back(ReachableBB);
13536 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) {
13537 if (ConstantInt *Cond = dyn_cast<ConstantInt>(SI->getCondition())) {
13538 // See if this is an explicit destination.
13539 for (unsigned i = 1, e = SI->getNumSuccessors(); i != e; ++i)
13540 if (SI->getCaseValue(i) == Cond) {
13541 BasicBlock *ReachableBB = SI->getSuccessor(i);
13542 Worklist.push_back(ReachableBB);
13546 // Otherwise it is the default destination.
13547 Worklist.push_back(SI->getSuccessor(0));
13552 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
13553 Worklist.push_back(TI->getSuccessor(i));
13556 // Once we've found all of the instructions to add to instcombine's worklist,
13557 // add them in reverse order. This way instcombine will visit from the top
13558 // of the function down. This jives well with the way that it adds all uses
13559 // of instructions to the worklist after doing a transformation, thus avoiding
13560 // some N^2 behavior in pathological cases.
13561 IC.Worklist.AddInitialGroup(&InstrsForInstCombineWorklist[0],
13562 InstrsForInstCombineWorklist.size());
13564 return MadeIRChange;
13567 bool InstCombiner::DoOneIteration(Function &F, unsigned Iteration) {
13568 MadeIRChange = false;
13570 DEBUG(errs() << "\n\nINSTCOMBINE ITERATION #" << Iteration << " on "
13571 << F.getNameStr() << "\n");
13574 // Do a depth-first traversal of the function, populate the worklist with
13575 // the reachable instructions. Ignore blocks that are not reachable. Keep
13576 // track of which blocks we visit.
13577 SmallPtrSet<BasicBlock*, 64> Visited;
13578 MadeIRChange |= AddReachableCodeToWorklist(F.begin(), Visited, *this, TD);
13580 // Do a quick scan over the function. If we find any blocks that are
13581 // unreachable, remove any instructions inside of them. This prevents
13582 // the instcombine code from having to deal with some bad special cases.
13583 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
13584 if (!Visited.count(BB)) {
13585 Instruction *Term = BB->getTerminator();
13586 while (Term != BB->begin()) { // Remove instrs bottom-up
13587 BasicBlock::iterator I = Term; --I;
13589 DEBUG(errs() << "IC: DCE: " << *I << '\n');
13590 // A debug intrinsic shouldn't force another iteration if we weren't
13591 // going to do one without it.
13592 if (!isa<DbgInfoIntrinsic>(I)) {
13594 MadeIRChange = true;
13597 // If I is not void type then replaceAllUsesWith undef.
13598 // This allows ValueHandlers and custom metadata to adjust itself.
13599 if (!I->getType()->isVoidTy())
13600 I->replaceAllUsesWith(UndefValue::get(I->getType()));
13601 I->eraseFromParent();
13606 while (!Worklist.isEmpty()) {
13607 Instruction *I = Worklist.RemoveOne();
13608 if (I == 0) continue; // skip null values.
13610 // Check to see if we can DCE the instruction.
13611 if (isInstructionTriviallyDead(I)) {
13612 DEBUG(errs() << "IC: DCE: " << *I << '\n');
13613 EraseInstFromFunction(*I);
13615 MadeIRChange = true;
13619 // Instruction isn't dead, see if we can constant propagate it.
13620 if (!I->use_empty() && isa<Constant>(I->getOperand(0)))
13621 if (Constant *C = ConstantFoldInstruction(I, TD)) {
13622 DEBUG(errs() << "IC: ConstFold to: " << *C << " from: " << *I << '\n');
13624 // Add operands to the worklist.
13625 ReplaceInstUsesWith(*I, C);
13627 EraseInstFromFunction(*I);
13628 MadeIRChange = true;
13632 // See if we can trivially sink this instruction to a successor basic block.
13633 if (I->hasOneUse()) {
13634 BasicBlock *BB = I->getParent();
13635 Instruction *UserInst = cast<Instruction>(I->use_back());
13636 BasicBlock *UserParent;
13638 // Get the block the use occurs in.
13639 if (PHINode *PN = dyn_cast<PHINode>(UserInst))
13640 UserParent = PN->getIncomingBlock(I->use_begin().getUse());
13642 UserParent = UserInst->getParent();
13644 if (UserParent != BB) {
13645 bool UserIsSuccessor = false;
13646 // See if the user is one of our successors.
13647 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI)
13648 if (*SI == UserParent) {
13649 UserIsSuccessor = true;
13653 // If the user is one of our immediate successors, and if that successor
13654 // only has us as a predecessors (we'd have to split the critical edge
13655 // otherwise), we can keep going.
13656 if (UserIsSuccessor && UserParent->getSinglePredecessor())
13657 // Okay, the CFG is simple enough, try to sink this instruction.
13658 MadeIRChange |= TryToSinkInstruction(I, UserParent);
13662 // Now that we have an instruction, try combining it to simplify it.
13663 Builder->SetInsertPoint(I->getParent(), I);
13668 DEBUG(raw_string_ostream SS(OrigI); I->print(SS); OrigI = SS.str(););
13669 DEBUG(errs() << "IC: Visiting: " << OrigI << '\n');
13671 if (Instruction *Result = visit(*I)) {
13673 // Should we replace the old instruction with a new one?
13675 DEBUG(errs() << "IC: Old = " << *I << '\n'
13676 << " New = " << *Result << '\n');
13678 // Everything uses the new instruction now.
13679 I->replaceAllUsesWith(Result);
13681 // Push the new instruction and any users onto the worklist.
13682 Worklist.Add(Result);
13683 Worklist.AddUsersToWorkList(*Result);
13685 // Move the name to the new instruction first.
13686 Result->takeName(I);
13688 // Insert the new instruction into the basic block...
13689 BasicBlock *InstParent = I->getParent();
13690 BasicBlock::iterator InsertPos = I;
13692 if (!isa<PHINode>(Result)) // If combining a PHI, don't insert
13693 while (isa<PHINode>(InsertPos)) // middle of a block of PHIs.
13696 InstParent->getInstList().insert(InsertPos, Result);
13698 EraseInstFromFunction(*I);
13701 DEBUG(errs() << "IC: Mod = " << OrigI << '\n'
13702 << " New = " << *I << '\n');
13705 // If the instruction was modified, it's possible that it is now dead.
13706 // if so, remove it.
13707 if (isInstructionTriviallyDead(I)) {
13708 EraseInstFromFunction(*I);
13711 Worklist.AddUsersToWorkList(*I);
13714 MadeIRChange = true;
13719 return MadeIRChange;
13723 bool InstCombiner::runOnFunction(Function &F) {
13724 MustPreserveLCSSA = mustPreserveAnalysisID(LCSSAID);
13725 Context = &F.getContext();
13726 TD = getAnalysisIfAvailable<TargetData>();
13729 /// Builder - This is an IRBuilder that automatically inserts new
13730 /// instructions into the worklist when they are created.
13731 IRBuilder<true, TargetFolder, InstCombineIRInserter>
13732 TheBuilder(F.getContext(), TargetFolder(TD),
13733 InstCombineIRInserter(Worklist));
13734 Builder = &TheBuilder;
13736 bool EverMadeChange = false;
13738 // Iterate while there is work to do.
13739 unsigned Iteration = 0;
13740 while (DoOneIteration(F, Iteration++))
13741 EverMadeChange = true;
13744 return EverMadeChange;
13747 FunctionPass *llvm::createInstructionCombiningPass() {
13748 return new InstCombiner();