1 //===- InstructionSimplify.cpp - Fold instruction operands ----------------===//
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 // This file implements routines for folding instructions into simpler forms
11 // that do not require creating new instructions. This does constant folding
12 // ("add i32 1, 1" -> "2") but can also handle non-constant operands, either
13 // returning a constant ("and i32 %x, 0" -> "0") or an already existing value
14 // ("and i32 %x, %x" -> "%x"). All operands are assumed to have already been
15 // simplified: This is usually true and assuming it simplifies the logic (if
16 // they have not been simplified then results are correct but maybe suboptimal).
18 //===----------------------------------------------------------------------===//
20 #include "llvm/Analysis/InstructionSimplify.h"
21 #include "llvm/ADT/SetVector.h"
22 #include "llvm/ADT/Statistic.h"
23 #include "llvm/Analysis/AliasAnalysis.h"
24 #include "llvm/Analysis/AssumptionCache.h"
25 #include "llvm/Analysis/CaptureTracking.h"
26 #include "llvm/Analysis/ConstantFolding.h"
27 #include "llvm/Analysis/LoopAnalysisManager.h"
28 #include "llvm/Analysis/MemoryBuiltins.h"
29 #include "llvm/Analysis/OptimizationDiagnosticInfo.h"
30 #include "llvm/Analysis/ValueTracking.h"
31 #include "llvm/Analysis/VectorUtils.h"
32 #include "llvm/IR/ConstantRange.h"
33 #include "llvm/IR/DataLayout.h"
34 #include "llvm/IR/Dominators.h"
35 #include "llvm/IR/GetElementPtrTypeIterator.h"
36 #include "llvm/IR/GlobalAlias.h"
37 #include "llvm/IR/Operator.h"
38 #include "llvm/IR/PatternMatch.h"
39 #include "llvm/IR/ValueHandle.h"
40 #include "llvm/Support/KnownBits.h"
43 using namespace llvm::PatternMatch;
45 #define DEBUG_TYPE "instsimplify"
47 enum { RecursionLimit = 3 };
49 STATISTIC(NumExpand, "Number of expansions");
50 STATISTIC(NumReassoc, "Number of reassociations");
52 static Value *SimplifyAndInst(Value *, Value *, const SimplifyQuery &, unsigned);
53 static Value *SimplifyBinOp(unsigned, Value *, Value *, const SimplifyQuery &,
55 static Value *SimplifyFPBinOp(unsigned, Value *, Value *, const FastMathFlags &,
56 const SimplifyQuery &, unsigned);
57 static Value *SimplifyCmpInst(unsigned, Value *, Value *, const SimplifyQuery &,
59 static Value *SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS,
60 const SimplifyQuery &Q, unsigned MaxRecurse);
61 static Value *SimplifyOrInst(Value *, Value *, const SimplifyQuery &, unsigned);
62 static Value *SimplifyXorInst(Value *, Value *, const SimplifyQuery &, unsigned);
63 static Value *SimplifyCastInst(unsigned, Value *, Type *,
64 const SimplifyQuery &, unsigned);
66 /// For a boolean type or a vector of boolean type, return false or a vector
67 /// with every element false.
68 static Constant *getFalse(Type *Ty) {
69 return ConstantInt::getFalse(Ty);
72 /// For a boolean type or a vector of boolean type, return true or a vector
73 /// with every element true.
74 static Constant *getTrue(Type *Ty) {
75 return ConstantInt::getTrue(Ty);
78 /// isSameCompare - Is V equivalent to the comparison "LHS Pred RHS"?
79 static bool isSameCompare(Value *V, CmpInst::Predicate Pred, Value *LHS,
81 CmpInst *Cmp = dyn_cast<CmpInst>(V);
84 CmpInst::Predicate CPred = Cmp->getPredicate();
85 Value *CLHS = Cmp->getOperand(0), *CRHS = Cmp->getOperand(1);
86 if (CPred == Pred && CLHS == LHS && CRHS == RHS)
88 return CPred == CmpInst::getSwappedPredicate(Pred) && CLHS == RHS &&
92 /// Does the given value dominate the specified phi node?
93 static bool ValueDominatesPHI(Value *V, PHINode *P, const DominatorTree *DT) {
94 Instruction *I = dyn_cast<Instruction>(V);
96 // Arguments and constants dominate all instructions.
99 // If we are processing instructions (and/or basic blocks) that have not been
100 // fully added to a function, the parent nodes may still be null. Simply
101 // return the conservative answer in these cases.
102 if (!I->getParent() || !P->getParent() || !I->getParent()->getParent())
105 // If we have a DominatorTree then do a precise test.
107 if (!DT->isReachableFromEntry(P->getParent()))
109 if (!DT->isReachableFromEntry(I->getParent()))
111 return DT->dominates(I, P);
114 // Otherwise, if the instruction is in the entry block and is not an invoke,
115 // then it obviously dominates all phi nodes.
116 if (I->getParent() == &I->getParent()->getParent()->getEntryBlock() &&
123 /// Simplify "A op (B op' C)" by distributing op over op', turning it into
124 /// "(A op B) op' (A op C)". Here "op" is given by Opcode and "op'" is
125 /// given by OpcodeToExpand, while "A" corresponds to LHS and "B op' C" to RHS.
126 /// Also performs the transform "(A op' B) op C" -> "(A op C) op' (B op C)".
127 /// Returns the simplified value, or null if no simplification was performed.
128 static Value *ExpandBinOp(Instruction::BinaryOps Opcode, Value *LHS, Value *RHS,
129 Instruction::BinaryOps OpcodeToExpand, const SimplifyQuery &Q,
130 unsigned MaxRecurse) {
131 // Recursion is always used, so bail out at once if we already hit the limit.
135 // Check whether the expression has the form "(A op' B) op C".
136 if (BinaryOperator *Op0 = dyn_cast<BinaryOperator>(LHS))
137 if (Op0->getOpcode() == OpcodeToExpand) {
138 // It does! Try turning it into "(A op C) op' (B op C)".
139 Value *A = Op0->getOperand(0), *B = Op0->getOperand(1), *C = RHS;
140 // Do "A op C" and "B op C" both simplify?
141 if (Value *L = SimplifyBinOp(Opcode, A, C, Q, MaxRecurse))
142 if (Value *R = SimplifyBinOp(Opcode, B, C, Q, MaxRecurse)) {
143 // They do! Return "L op' R" if it simplifies or is already available.
144 // If "L op' R" equals "A op' B" then "L op' R" is just the LHS.
145 if ((L == A && R == B) || (Instruction::isCommutative(OpcodeToExpand)
146 && L == B && R == A)) {
150 // Otherwise return "L op' R" if it simplifies.
151 if (Value *V = SimplifyBinOp(OpcodeToExpand, L, R, Q, MaxRecurse)) {
158 // Check whether the expression has the form "A op (B op' C)".
159 if (BinaryOperator *Op1 = dyn_cast<BinaryOperator>(RHS))
160 if (Op1->getOpcode() == OpcodeToExpand) {
161 // It does! Try turning it into "(A op B) op' (A op C)".
162 Value *A = LHS, *B = Op1->getOperand(0), *C = Op1->getOperand(1);
163 // Do "A op B" and "A op C" both simplify?
164 if (Value *L = SimplifyBinOp(Opcode, A, B, Q, MaxRecurse))
165 if (Value *R = SimplifyBinOp(Opcode, A, C, Q, MaxRecurse)) {
166 // They do! Return "L op' R" if it simplifies or is already available.
167 // If "L op' R" equals "B op' C" then "L op' R" is just the RHS.
168 if ((L == B && R == C) || (Instruction::isCommutative(OpcodeToExpand)
169 && L == C && R == B)) {
173 // Otherwise return "L op' R" if it simplifies.
174 if (Value *V = SimplifyBinOp(OpcodeToExpand, L, R, Q, MaxRecurse)) {
184 /// Generic simplifications for associative binary operations.
185 /// Returns the simpler value, or null if none was found.
186 static Value *SimplifyAssociativeBinOp(Instruction::BinaryOps Opcode,
187 Value *LHS, Value *RHS, const SimplifyQuery &Q,
188 unsigned MaxRecurse) {
189 assert(Instruction::isAssociative(Opcode) && "Not an associative operation!");
191 // Recursion is always used, so bail out at once if we already hit the limit.
195 BinaryOperator *Op0 = dyn_cast<BinaryOperator>(LHS);
196 BinaryOperator *Op1 = dyn_cast<BinaryOperator>(RHS);
198 // Transform: "(A op B) op C" ==> "A op (B op C)" if it simplifies completely.
199 if (Op0 && Op0->getOpcode() == Opcode) {
200 Value *A = Op0->getOperand(0);
201 Value *B = Op0->getOperand(1);
204 // Does "B op C" simplify?
205 if (Value *V = SimplifyBinOp(Opcode, B, C, Q, MaxRecurse)) {
206 // It does! Return "A op V" if it simplifies or is already available.
207 // If V equals B then "A op V" is just the LHS.
208 if (V == B) return LHS;
209 // Otherwise return "A op V" if it simplifies.
210 if (Value *W = SimplifyBinOp(Opcode, A, V, Q, MaxRecurse)) {
217 // Transform: "A op (B op C)" ==> "(A op B) op C" if it simplifies completely.
218 if (Op1 && Op1->getOpcode() == Opcode) {
220 Value *B = Op1->getOperand(0);
221 Value *C = Op1->getOperand(1);
223 // Does "A op B" simplify?
224 if (Value *V = SimplifyBinOp(Opcode, A, B, Q, MaxRecurse)) {
225 // It does! Return "V op C" if it simplifies or is already available.
226 // If V equals B then "V op C" is just the RHS.
227 if (V == B) return RHS;
228 // Otherwise return "V op C" if it simplifies.
229 if (Value *W = SimplifyBinOp(Opcode, V, C, Q, MaxRecurse)) {
236 // The remaining transforms require commutativity as well as associativity.
237 if (!Instruction::isCommutative(Opcode))
240 // Transform: "(A op B) op C" ==> "(C op A) op B" if it simplifies completely.
241 if (Op0 && Op0->getOpcode() == Opcode) {
242 Value *A = Op0->getOperand(0);
243 Value *B = Op0->getOperand(1);
246 // Does "C op A" simplify?
247 if (Value *V = SimplifyBinOp(Opcode, C, A, Q, MaxRecurse)) {
248 // It does! Return "V op B" if it simplifies or is already available.
249 // If V equals A then "V op B" is just the LHS.
250 if (V == A) return LHS;
251 // Otherwise return "V op B" if it simplifies.
252 if (Value *W = SimplifyBinOp(Opcode, V, B, Q, MaxRecurse)) {
259 // Transform: "A op (B op C)" ==> "B op (C op A)" if it simplifies completely.
260 if (Op1 && Op1->getOpcode() == Opcode) {
262 Value *B = Op1->getOperand(0);
263 Value *C = Op1->getOperand(1);
265 // Does "C op A" simplify?
266 if (Value *V = SimplifyBinOp(Opcode, C, A, Q, MaxRecurse)) {
267 // It does! Return "B op V" if it simplifies or is already available.
268 // If V equals C then "B op V" is just the RHS.
269 if (V == C) return RHS;
270 // Otherwise return "B op V" if it simplifies.
271 if (Value *W = SimplifyBinOp(Opcode, B, V, Q, MaxRecurse)) {
281 /// In the case of a binary operation with a select instruction as an operand,
282 /// try to simplify the binop by seeing whether evaluating it on both branches
283 /// of the select results in the same value. Returns the common value if so,
284 /// otherwise returns null.
285 static Value *ThreadBinOpOverSelect(Instruction::BinaryOps Opcode, Value *LHS,
286 Value *RHS, const SimplifyQuery &Q,
287 unsigned MaxRecurse) {
288 // Recursion is always used, so bail out at once if we already hit the limit.
293 if (isa<SelectInst>(LHS)) {
294 SI = cast<SelectInst>(LHS);
296 assert(isa<SelectInst>(RHS) && "No select instruction operand!");
297 SI = cast<SelectInst>(RHS);
300 // Evaluate the BinOp on the true and false branches of the select.
304 TV = SimplifyBinOp(Opcode, SI->getTrueValue(), RHS, Q, MaxRecurse);
305 FV = SimplifyBinOp(Opcode, SI->getFalseValue(), RHS, Q, MaxRecurse);
307 TV = SimplifyBinOp(Opcode, LHS, SI->getTrueValue(), Q, MaxRecurse);
308 FV = SimplifyBinOp(Opcode, LHS, SI->getFalseValue(), Q, MaxRecurse);
311 // If they simplified to the same value, then return the common value.
312 // If they both failed to simplify then return null.
316 // If one branch simplified to undef, return the other one.
317 if (TV && isa<UndefValue>(TV))
319 if (FV && isa<UndefValue>(FV))
322 // If applying the operation did not change the true and false select values,
323 // then the result of the binop is the select itself.
324 if (TV == SI->getTrueValue() && FV == SI->getFalseValue())
327 // If one branch simplified and the other did not, and the simplified
328 // value is equal to the unsimplified one, return the simplified value.
329 // For example, select (cond, X, X & Z) & Z -> X & Z.
330 if ((FV && !TV) || (TV && !FV)) {
331 // Check that the simplified value has the form "X op Y" where "op" is the
332 // same as the original operation.
333 Instruction *Simplified = dyn_cast<Instruction>(FV ? FV : TV);
334 if (Simplified && Simplified->getOpcode() == Opcode) {
335 // The value that didn't simplify is "UnsimplifiedLHS op UnsimplifiedRHS".
336 // We already know that "op" is the same as for the simplified value. See
337 // if the operands match too. If so, return the simplified value.
338 Value *UnsimplifiedBranch = FV ? SI->getTrueValue() : SI->getFalseValue();
339 Value *UnsimplifiedLHS = SI == LHS ? UnsimplifiedBranch : LHS;
340 Value *UnsimplifiedRHS = SI == LHS ? RHS : UnsimplifiedBranch;
341 if (Simplified->getOperand(0) == UnsimplifiedLHS &&
342 Simplified->getOperand(1) == UnsimplifiedRHS)
344 if (Simplified->isCommutative() &&
345 Simplified->getOperand(1) == UnsimplifiedLHS &&
346 Simplified->getOperand(0) == UnsimplifiedRHS)
354 /// In the case of a comparison with a select instruction, try to simplify the
355 /// comparison by seeing whether both branches of the select result in the same
356 /// value. Returns the common value if so, otherwise returns null.
357 static Value *ThreadCmpOverSelect(CmpInst::Predicate Pred, Value *LHS,
358 Value *RHS, const SimplifyQuery &Q,
359 unsigned MaxRecurse) {
360 // Recursion is always used, so bail out at once if we already hit the limit.
364 // Make sure the select is on the LHS.
365 if (!isa<SelectInst>(LHS)) {
367 Pred = CmpInst::getSwappedPredicate(Pred);
369 assert(isa<SelectInst>(LHS) && "Not comparing with a select instruction!");
370 SelectInst *SI = cast<SelectInst>(LHS);
371 Value *Cond = SI->getCondition();
372 Value *TV = SI->getTrueValue();
373 Value *FV = SI->getFalseValue();
375 // Now that we have "cmp select(Cond, TV, FV), RHS", analyse it.
376 // Does "cmp TV, RHS" simplify?
377 Value *TCmp = SimplifyCmpInst(Pred, TV, RHS, Q, MaxRecurse);
379 // It not only simplified, it simplified to the select condition. Replace
381 TCmp = getTrue(Cond->getType());
383 // It didn't simplify. However if "cmp TV, RHS" is equal to the select
384 // condition then we can replace it with 'true'. Otherwise give up.
385 if (!isSameCompare(Cond, Pred, TV, RHS))
387 TCmp = getTrue(Cond->getType());
390 // Does "cmp FV, RHS" simplify?
391 Value *FCmp = SimplifyCmpInst(Pred, FV, RHS, Q, MaxRecurse);
393 // It not only simplified, it simplified to the select condition. Replace
395 FCmp = getFalse(Cond->getType());
397 // It didn't simplify. However if "cmp FV, RHS" is equal to the select
398 // condition then we can replace it with 'false'. Otherwise give up.
399 if (!isSameCompare(Cond, Pred, FV, RHS))
401 FCmp = getFalse(Cond->getType());
404 // If both sides simplified to the same value, then use it as the result of
405 // the original comparison.
409 // The remaining cases only make sense if the select condition has the same
410 // type as the result of the comparison, so bail out if this is not so.
411 if (Cond->getType()->isVectorTy() != RHS->getType()->isVectorTy())
413 // If the false value simplified to false, then the result of the compare
414 // is equal to "Cond && TCmp". This also catches the case when the false
415 // value simplified to false and the true value to true, returning "Cond".
416 if (match(FCmp, m_Zero()))
417 if (Value *V = SimplifyAndInst(Cond, TCmp, Q, MaxRecurse))
419 // If the true value simplified to true, then the result of the compare
420 // is equal to "Cond || FCmp".
421 if (match(TCmp, m_One()))
422 if (Value *V = SimplifyOrInst(Cond, FCmp, Q, MaxRecurse))
424 // Finally, if the false value simplified to true and the true value to
425 // false, then the result of the compare is equal to "!Cond".
426 if (match(FCmp, m_One()) && match(TCmp, m_Zero()))
428 SimplifyXorInst(Cond, Constant::getAllOnesValue(Cond->getType()),
435 /// In the case of a binary operation with an operand that is a PHI instruction,
436 /// try to simplify the binop by seeing whether evaluating it on the incoming
437 /// phi values yields the same result for every value. If so returns the common
438 /// value, otherwise returns null.
439 static Value *ThreadBinOpOverPHI(Instruction::BinaryOps Opcode, Value *LHS,
440 Value *RHS, const SimplifyQuery &Q,
441 unsigned MaxRecurse) {
442 // Recursion is always used, so bail out at once if we already hit the limit.
447 if (isa<PHINode>(LHS)) {
448 PI = cast<PHINode>(LHS);
449 // Bail out if RHS and the phi may be mutually interdependent due to a loop.
450 if (!ValueDominatesPHI(RHS, PI, Q.DT))
453 assert(isa<PHINode>(RHS) && "No PHI instruction operand!");
454 PI = cast<PHINode>(RHS);
455 // Bail out if LHS and the phi may be mutually interdependent due to a loop.
456 if (!ValueDominatesPHI(LHS, PI, Q.DT))
460 // Evaluate the BinOp on the incoming phi values.
461 Value *CommonValue = nullptr;
462 for (Value *Incoming : PI->incoming_values()) {
463 // If the incoming value is the phi node itself, it can safely be skipped.
464 if (Incoming == PI) continue;
465 Value *V = PI == LHS ?
466 SimplifyBinOp(Opcode, Incoming, RHS, Q, MaxRecurse) :
467 SimplifyBinOp(Opcode, LHS, Incoming, Q, MaxRecurse);
468 // If the operation failed to simplify, or simplified to a different value
469 // to previously, then give up.
470 if (!V || (CommonValue && V != CommonValue))
478 /// In the case of a comparison with a PHI instruction, try to simplify the
479 /// comparison by seeing whether comparing with all of the incoming phi values
480 /// yields the same result every time. If so returns the common result,
481 /// otherwise returns null.
482 static Value *ThreadCmpOverPHI(CmpInst::Predicate Pred, Value *LHS, Value *RHS,
483 const SimplifyQuery &Q, unsigned MaxRecurse) {
484 // Recursion is always used, so bail out at once if we already hit the limit.
488 // Make sure the phi is on the LHS.
489 if (!isa<PHINode>(LHS)) {
491 Pred = CmpInst::getSwappedPredicate(Pred);
493 assert(isa<PHINode>(LHS) && "Not comparing with a phi instruction!");
494 PHINode *PI = cast<PHINode>(LHS);
496 // Bail out if RHS and the phi may be mutually interdependent due to a loop.
497 if (!ValueDominatesPHI(RHS, PI, Q.DT))
500 // Evaluate the BinOp on the incoming phi values.
501 Value *CommonValue = nullptr;
502 for (Value *Incoming : PI->incoming_values()) {
503 // If the incoming value is the phi node itself, it can safely be skipped.
504 if (Incoming == PI) continue;
505 Value *V = SimplifyCmpInst(Pred, Incoming, RHS, Q, MaxRecurse);
506 // If the operation failed to simplify, or simplified to a different value
507 // to previously, then give up.
508 if (!V || (CommonValue && V != CommonValue))
516 static Constant *foldOrCommuteConstant(Instruction::BinaryOps Opcode,
517 Value *&Op0, Value *&Op1,
518 const SimplifyQuery &Q) {
519 if (auto *CLHS = dyn_cast<Constant>(Op0)) {
520 if (auto *CRHS = dyn_cast<Constant>(Op1))
521 return ConstantFoldBinaryOpOperands(Opcode, CLHS, CRHS, Q.DL);
523 // Canonicalize the constant to the RHS if this is a commutative operation.
524 if (Instruction::isCommutative(Opcode))
530 /// Given operands for an Add, see if we can fold the result.
531 /// If not, this returns null.
532 static Value *SimplifyAddInst(Value *Op0, Value *Op1, bool isNSW, bool isNUW,
533 const SimplifyQuery &Q, unsigned MaxRecurse) {
534 if (Constant *C = foldOrCommuteConstant(Instruction::Add, Op0, Op1, Q))
537 // X + undef -> undef
538 if (match(Op1, m_Undef()))
542 if (match(Op1, m_Zero()))
549 if (match(Op1, m_Sub(m_Value(Y), m_Specific(Op0))) ||
550 match(Op0, m_Sub(m_Value(Y), m_Specific(Op1))))
553 // X + ~X -> -1 since ~X = -X-1
554 Type *Ty = Op0->getType();
555 if (match(Op0, m_Not(m_Specific(Op1))) ||
556 match(Op1, m_Not(m_Specific(Op0))))
557 return Constant::getAllOnesValue(Ty);
559 // add nsw/nuw (xor Y, signmask), signmask --> Y
560 // The no-wrapping add guarantees that the top bit will be set by the add.
561 // Therefore, the xor must be clearing the already set sign bit of Y.
562 if ((isNSW || isNUW) && match(Op1, m_SignMask()) &&
563 match(Op0, m_Xor(m_Value(Y), m_SignMask())))
567 if (MaxRecurse && Op0->getType()->getScalarType()->isIntegerTy(1))
568 if (Value *V = SimplifyXorInst(Op0, Op1, Q, MaxRecurse-1))
571 // Try some generic simplifications for associative operations.
572 if (Value *V = SimplifyAssociativeBinOp(Instruction::Add, Op0, Op1, Q,
576 // Threading Add over selects and phi nodes is pointless, so don't bother.
577 // Threading over the select in "A + select(cond, B, C)" means evaluating
578 // "A+B" and "A+C" and seeing if they are equal; but they are equal if and
579 // only if B and C are equal. If B and C are equal then (since we assume
580 // that operands have already been simplified) "select(cond, B, C)" should
581 // have been simplified to the common value of B and C already. Analysing
582 // "A+B" and "A+C" thus gains nothing, but costs compile time. Similarly
583 // for threading over phi nodes.
588 Value *llvm::SimplifyAddInst(Value *Op0, Value *Op1, bool isNSW, bool isNUW,
589 const SimplifyQuery &Query) {
590 return ::SimplifyAddInst(Op0, Op1, isNSW, isNUW, Query, RecursionLimit);
593 /// \brief Compute the base pointer and cumulative constant offsets for V.
595 /// This strips all constant offsets off of V, leaving it the base pointer, and
596 /// accumulates the total constant offset applied in the returned constant. It
597 /// returns 0 if V is not a pointer, and returns the constant '0' if there are
598 /// no constant offsets applied.
600 /// This is very similar to GetPointerBaseWithConstantOffset except it doesn't
601 /// follow non-inbounds geps. This allows it to remain usable for icmp ult/etc.
603 static Constant *stripAndComputeConstantOffsets(const DataLayout &DL, Value *&V,
604 bool AllowNonInbounds = false) {
605 assert(V->getType()->getScalarType()->isPointerTy());
607 Type *IntPtrTy = DL.getIntPtrType(V->getType())->getScalarType();
608 APInt Offset = APInt::getNullValue(IntPtrTy->getIntegerBitWidth());
610 // Even though we don't look through PHI nodes, we could be called on an
611 // instruction in an unreachable block, which may be on a cycle.
612 SmallPtrSet<Value *, 4> Visited;
615 if (GEPOperator *GEP = dyn_cast<GEPOperator>(V)) {
616 if ((!AllowNonInbounds && !GEP->isInBounds()) ||
617 !GEP->accumulateConstantOffset(DL, Offset))
619 V = GEP->getPointerOperand();
620 } else if (Operator::getOpcode(V) == Instruction::BitCast) {
621 V = cast<Operator>(V)->getOperand(0);
622 } else if (GlobalAlias *GA = dyn_cast<GlobalAlias>(V)) {
623 if (GA->isInterposable())
625 V = GA->getAliasee();
627 if (auto CS = CallSite(V))
628 if (Value *RV = CS.getReturnedArgOperand()) {
634 assert(V->getType()->getScalarType()->isPointerTy() &&
635 "Unexpected operand type!");
636 } while (Visited.insert(V).second);
638 Constant *OffsetIntPtr = ConstantInt::get(IntPtrTy, Offset);
639 if (V->getType()->isVectorTy())
640 return ConstantVector::getSplat(V->getType()->getVectorNumElements(),
645 /// \brief Compute the constant difference between two pointer values.
646 /// If the difference is not a constant, returns zero.
647 static Constant *computePointerDifference(const DataLayout &DL, Value *LHS,
649 Constant *LHSOffset = stripAndComputeConstantOffsets(DL, LHS);
650 Constant *RHSOffset = stripAndComputeConstantOffsets(DL, RHS);
652 // If LHS and RHS are not related via constant offsets to the same base
653 // value, there is nothing we can do here.
657 // Otherwise, the difference of LHS - RHS can be computed as:
659 // = (LHSOffset + Base) - (RHSOffset + Base)
660 // = LHSOffset - RHSOffset
661 return ConstantExpr::getSub(LHSOffset, RHSOffset);
664 /// Given operands for a Sub, see if we can fold the result.
665 /// If not, this returns null.
666 static Value *SimplifySubInst(Value *Op0, Value *Op1, bool isNSW, bool isNUW,
667 const SimplifyQuery &Q, unsigned MaxRecurse) {
668 if (Constant *C = foldOrCommuteConstant(Instruction::Sub, Op0, Op1, Q))
671 // X - undef -> undef
672 // undef - X -> undef
673 if (match(Op0, m_Undef()) || match(Op1, m_Undef()))
674 return UndefValue::get(Op0->getType());
677 if (match(Op1, m_Zero()))
682 return Constant::getNullValue(Op0->getType());
684 // Is this a negation?
685 if (match(Op0, m_Zero())) {
686 // 0 - X -> 0 if the sub is NUW.
690 unsigned BitWidth = Op1->getType()->getScalarSizeInBits();
691 KnownBits Known(BitWidth);
692 computeKnownBits(Op1, Known, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
693 if (Known.Zero.isMaxSignedValue()) {
694 // Op1 is either 0 or the minimum signed value. If the sub is NSW, then
695 // Op1 must be 0 because negating the minimum signed value is undefined.
699 // 0 - X -> X if X is 0 or the minimum signed value.
704 // (X + Y) - Z -> X + (Y - Z) or Y + (X - Z) if everything simplifies.
705 // For example, (X + Y) - Y -> X; (Y + X) - Y -> X
706 Value *X = nullptr, *Y = nullptr, *Z = Op1;
707 if (MaxRecurse && match(Op0, m_Add(m_Value(X), m_Value(Y)))) { // (X + Y) - Z
708 // See if "V === Y - Z" simplifies.
709 if (Value *V = SimplifyBinOp(Instruction::Sub, Y, Z, Q, MaxRecurse-1))
710 // It does! Now see if "X + V" simplifies.
711 if (Value *W = SimplifyBinOp(Instruction::Add, X, V, Q, MaxRecurse-1)) {
712 // It does, we successfully reassociated!
716 // See if "V === X - Z" simplifies.
717 if (Value *V = SimplifyBinOp(Instruction::Sub, X, Z, Q, MaxRecurse-1))
718 // It does! Now see if "Y + V" simplifies.
719 if (Value *W = SimplifyBinOp(Instruction::Add, Y, V, Q, MaxRecurse-1)) {
720 // It does, we successfully reassociated!
726 // X - (Y + Z) -> (X - Y) - Z or (X - Z) - Y if everything simplifies.
727 // For example, X - (X + 1) -> -1
729 if (MaxRecurse && match(Op1, m_Add(m_Value(Y), m_Value(Z)))) { // X - (Y + Z)
730 // See if "V === X - Y" simplifies.
731 if (Value *V = SimplifyBinOp(Instruction::Sub, X, Y, Q, MaxRecurse-1))
732 // It does! Now see if "V - Z" simplifies.
733 if (Value *W = SimplifyBinOp(Instruction::Sub, V, Z, Q, MaxRecurse-1)) {
734 // It does, we successfully reassociated!
738 // See if "V === X - Z" simplifies.
739 if (Value *V = SimplifyBinOp(Instruction::Sub, X, Z, Q, MaxRecurse-1))
740 // It does! Now see if "V - Y" simplifies.
741 if (Value *W = SimplifyBinOp(Instruction::Sub, V, Y, Q, MaxRecurse-1)) {
742 // It does, we successfully reassociated!
748 // Z - (X - Y) -> (Z - X) + Y if everything simplifies.
749 // For example, X - (X - Y) -> Y.
751 if (MaxRecurse && match(Op1, m_Sub(m_Value(X), m_Value(Y)))) // Z - (X - Y)
752 // See if "V === Z - X" simplifies.
753 if (Value *V = SimplifyBinOp(Instruction::Sub, Z, X, Q, MaxRecurse-1))
754 // It does! Now see if "V + Y" simplifies.
755 if (Value *W = SimplifyBinOp(Instruction::Add, V, Y, Q, MaxRecurse-1)) {
756 // It does, we successfully reassociated!
761 // trunc(X) - trunc(Y) -> trunc(X - Y) if everything simplifies.
762 if (MaxRecurse && match(Op0, m_Trunc(m_Value(X))) &&
763 match(Op1, m_Trunc(m_Value(Y))))
764 if (X->getType() == Y->getType())
765 // See if "V === X - Y" simplifies.
766 if (Value *V = SimplifyBinOp(Instruction::Sub, X, Y, Q, MaxRecurse-1))
767 // It does! Now see if "trunc V" simplifies.
768 if (Value *W = SimplifyCastInst(Instruction::Trunc, V, Op0->getType(),
770 // It does, return the simplified "trunc V".
773 // Variations on GEP(base, I, ...) - GEP(base, i, ...) -> GEP(null, I-i, ...).
774 if (match(Op0, m_PtrToInt(m_Value(X))) &&
775 match(Op1, m_PtrToInt(m_Value(Y))))
776 if (Constant *Result = computePointerDifference(Q.DL, X, Y))
777 return ConstantExpr::getIntegerCast(Result, Op0->getType(), true);
780 if (MaxRecurse && Op0->getType()->getScalarType()->isIntegerTy(1))
781 if (Value *V = SimplifyXorInst(Op0, Op1, Q, MaxRecurse-1))
784 // Threading Sub over selects and phi nodes is pointless, so don't bother.
785 // Threading over the select in "A - select(cond, B, C)" means evaluating
786 // "A-B" and "A-C" and seeing if they are equal; but they are equal if and
787 // only if B and C are equal. If B and C are equal then (since we assume
788 // that operands have already been simplified) "select(cond, B, C)" should
789 // have been simplified to the common value of B and C already. Analysing
790 // "A-B" and "A-C" thus gains nothing, but costs compile time. Similarly
791 // for threading over phi nodes.
796 Value *llvm::SimplifySubInst(Value *Op0, Value *Op1, bool isNSW, bool isNUW,
797 const SimplifyQuery &Q) {
798 return ::SimplifySubInst(Op0, Op1, isNSW, isNUW, Q, RecursionLimit);
801 /// Given operands for an FAdd, see if we can fold the result. If not, this
803 static Value *SimplifyFAddInst(Value *Op0, Value *Op1, FastMathFlags FMF,
804 const SimplifyQuery &Q, unsigned MaxRecurse) {
805 if (Constant *C = foldOrCommuteConstant(Instruction::FAdd, Op0, Op1, Q))
809 if (match(Op1, m_NegZero()))
812 // fadd X, 0 ==> X, when we know X is not -0
813 if (match(Op1, m_Zero()) &&
814 (FMF.noSignedZeros() || CannotBeNegativeZero(Op0, Q.TLI)))
817 // fadd [nnan ninf] X, (fsub [nnan ninf] 0, X) ==> 0
818 // where nnan and ninf have to occur at least once somewhere in this
820 Value *SubOp = nullptr;
821 if (match(Op1, m_FSub(m_AnyZero(), m_Specific(Op0))))
823 else if (match(Op0, m_FSub(m_AnyZero(), m_Specific(Op1))))
826 Instruction *FSub = cast<Instruction>(SubOp);
827 if ((FMF.noNaNs() || FSub->hasNoNaNs()) &&
828 (FMF.noInfs() || FSub->hasNoInfs()))
829 return Constant::getNullValue(Op0->getType());
835 /// Given operands for an FSub, see if we can fold the result. If not, this
837 static Value *SimplifyFSubInst(Value *Op0, Value *Op1, FastMathFlags FMF,
838 const SimplifyQuery &Q, unsigned MaxRecurse) {
839 if (Constant *C = foldOrCommuteConstant(Instruction::FSub, Op0, Op1, Q))
843 if (match(Op1, m_Zero()))
846 // fsub X, -0 ==> X, when we know X is not -0
847 if (match(Op1, m_NegZero()) &&
848 (FMF.noSignedZeros() || CannotBeNegativeZero(Op0, Q.TLI)))
851 // fsub -0.0, (fsub -0.0, X) ==> X
853 if (match(Op0, m_NegZero()) && match(Op1, m_FSub(m_NegZero(), m_Value(X))))
856 // fsub 0.0, (fsub 0.0, X) ==> X if signed zeros are ignored.
857 if (FMF.noSignedZeros() && match(Op0, m_AnyZero()) &&
858 match(Op1, m_FSub(m_AnyZero(), m_Value(X))))
861 // fsub nnan x, x ==> 0.0
862 if (FMF.noNaNs() && Op0 == Op1)
863 return Constant::getNullValue(Op0->getType());
868 /// Given the operands for an FMul, see if we can fold the result
869 static Value *SimplifyFMulInst(Value *Op0, Value *Op1, FastMathFlags FMF,
870 const SimplifyQuery &Q, unsigned MaxRecurse) {
871 if (Constant *C = foldOrCommuteConstant(Instruction::FMul, Op0, Op1, Q))
875 if (match(Op1, m_FPOne()))
878 // fmul nnan nsz X, 0 ==> 0
879 if (FMF.noNaNs() && FMF.noSignedZeros() && match(Op1, m_AnyZero()))
885 /// Given operands for a Mul, see if we can fold the result.
886 /// If not, this returns null.
887 static Value *SimplifyMulInst(Value *Op0, Value *Op1, const SimplifyQuery &Q,
888 unsigned MaxRecurse) {
889 if (Constant *C = foldOrCommuteConstant(Instruction::Mul, Op0, Op1, Q))
893 if (match(Op1, m_Undef()))
894 return Constant::getNullValue(Op0->getType());
897 if (match(Op1, m_Zero()))
901 if (match(Op1, m_One()))
904 // (X / Y) * Y -> X if the division is exact.
906 if (match(Op0, m_Exact(m_IDiv(m_Value(X), m_Specific(Op1)))) || // (X / Y) * Y
907 match(Op1, m_Exact(m_IDiv(m_Value(X), m_Specific(Op0))))) // Y * (X / Y)
911 if (MaxRecurse && Op0->getType()->getScalarType()->isIntegerTy(1))
912 if (Value *V = SimplifyAndInst(Op0, Op1, Q, MaxRecurse-1))
915 // Try some generic simplifications for associative operations.
916 if (Value *V = SimplifyAssociativeBinOp(Instruction::Mul, Op0, Op1, Q,
920 // Mul distributes over Add. Try some generic simplifications based on this.
921 if (Value *V = ExpandBinOp(Instruction::Mul, Op0, Op1, Instruction::Add,
925 // If the operation is with the result of a select instruction, check whether
926 // operating on either branch of the select always yields the same value.
927 if (isa<SelectInst>(Op0) || isa<SelectInst>(Op1))
928 if (Value *V = ThreadBinOpOverSelect(Instruction::Mul, Op0, Op1, Q,
932 // If the operation is with the result of a phi instruction, check whether
933 // operating on all incoming values of the phi always yields the same value.
934 if (isa<PHINode>(Op0) || isa<PHINode>(Op1))
935 if (Value *V = ThreadBinOpOverPHI(Instruction::Mul, Op0, Op1, Q,
942 Value *llvm::SimplifyFAddInst(Value *Op0, Value *Op1, FastMathFlags FMF,
943 const SimplifyQuery &Q) {
944 return ::SimplifyFAddInst(Op0, Op1, FMF, Q, RecursionLimit);
948 Value *llvm::SimplifyFSubInst(Value *Op0, Value *Op1, FastMathFlags FMF,
949 const SimplifyQuery &Q) {
950 return ::SimplifyFSubInst(Op0, Op1, FMF, Q, RecursionLimit);
953 Value *llvm::SimplifyFMulInst(Value *Op0, Value *Op1, FastMathFlags FMF,
954 const SimplifyQuery &Q) {
955 return ::SimplifyFMulInst(Op0, Op1, FMF, Q, RecursionLimit);
958 Value *llvm::SimplifyMulInst(Value *Op0, Value *Op1, const SimplifyQuery &Q) {
959 return ::SimplifyMulInst(Op0, Op1, Q, RecursionLimit);
962 /// Check for common or similar folds of integer division or integer remainder.
963 static Value *simplifyDivRem(Value *Op0, Value *Op1, bool IsDiv) {
964 Type *Ty = Op0->getType();
966 // X / undef -> undef
967 // X % undef -> undef
968 if (match(Op1, m_Undef()))
973 // We don't need to preserve faults!
974 if (match(Op1, m_Zero()))
975 return UndefValue::get(Ty);
977 // If any element of a constant divisor vector is zero, the whole op is undef.
978 auto *Op1C = dyn_cast<Constant>(Op1);
979 if (Op1C && Ty->isVectorTy()) {
980 unsigned NumElts = Ty->getVectorNumElements();
981 for (unsigned i = 0; i != NumElts; ++i) {
982 Constant *Elt = Op1C->getAggregateElement(i);
983 if (Elt && Elt->isNullValue())
984 return UndefValue::get(Ty);
990 if (match(Op0, m_Undef()))
991 return Constant::getNullValue(Ty);
995 if (match(Op0, m_Zero()))
1001 return IsDiv ? ConstantInt::get(Ty, 1) : Constant::getNullValue(Ty);
1005 // If this is a boolean op (single-bit element type), we can't have
1006 // division-by-zero or remainder-by-zero, so assume the divisor is 1.
1007 if (match(Op1, m_One()) || Ty->getScalarType()->isIntegerTy(1))
1008 return IsDiv ? Op0 : Constant::getNullValue(Ty);
1013 /// Given operands for an SDiv or UDiv, see if we can fold the result.
1014 /// If not, this returns null.
1015 static Value *SimplifyDiv(Instruction::BinaryOps Opcode, Value *Op0, Value *Op1,
1016 const SimplifyQuery &Q, unsigned MaxRecurse) {
1017 if (Constant *C = foldOrCommuteConstant(Opcode, Op0, Op1, Q))
1020 if (Value *V = simplifyDivRem(Op0, Op1, true))
1023 bool isSigned = Opcode == Instruction::SDiv;
1025 // (X * Y) / Y -> X if the multiplication does not overflow.
1026 Value *X = nullptr, *Y = nullptr;
1027 if (match(Op0, m_Mul(m_Value(X), m_Value(Y))) && (X == Op1 || Y == Op1)) {
1028 if (Y != Op1) std::swap(X, Y); // Ensure expression is (X * Y) / Y, Y = Op1
1029 OverflowingBinaryOperator *Mul = cast<OverflowingBinaryOperator>(Op0);
1030 // If the Mul knows it does not overflow, then we are good to go.
1031 if ((isSigned && Mul->hasNoSignedWrap()) ||
1032 (!isSigned && Mul->hasNoUnsignedWrap()))
1034 // If X has the form X = A / Y then X * Y cannot overflow.
1035 if (BinaryOperator *Div = dyn_cast<BinaryOperator>(X))
1036 if (Div->getOpcode() == Opcode && Div->getOperand(1) == Y)
1040 // (X rem Y) / Y -> 0
1041 if ((isSigned && match(Op0, m_SRem(m_Value(), m_Specific(Op1)))) ||
1042 (!isSigned && match(Op0, m_URem(m_Value(), m_Specific(Op1)))))
1043 return Constant::getNullValue(Op0->getType());
1045 // (X /u C1) /u C2 -> 0 if C1 * C2 overflow
1046 ConstantInt *C1, *C2;
1047 if (!isSigned && match(Op0, m_UDiv(m_Value(X), m_ConstantInt(C1))) &&
1048 match(Op1, m_ConstantInt(C2))) {
1050 (void)C1->getValue().umul_ov(C2->getValue(), Overflow);
1052 return Constant::getNullValue(Op0->getType());
1055 // If the operation is with the result of a select instruction, check whether
1056 // operating on either branch of the select always yields the same value.
1057 if (isa<SelectInst>(Op0) || isa<SelectInst>(Op1))
1058 if (Value *V = ThreadBinOpOverSelect(Opcode, Op0, Op1, Q, MaxRecurse))
1061 // If the operation is with the result of a phi instruction, check whether
1062 // operating on all incoming values of the phi always yields the same value.
1063 if (isa<PHINode>(Op0) || isa<PHINode>(Op1))
1064 if (Value *V = ThreadBinOpOverPHI(Opcode, Op0, Op1, Q, MaxRecurse))
1070 /// Given operands for an SDiv, see if we can fold the result.
1071 /// If not, this returns null.
1072 static Value *SimplifySDivInst(Value *Op0, Value *Op1, const SimplifyQuery &Q,
1073 unsigned MaxRecurse) {
1074 if (Value *V = SimplifyDiv(Instruction::SDiv, Op0, Op1, Q, MaxRecurse))
1080 Value *llvm::SimplifySDivInst(Value *Op0, Value *Op1, const SimplifyQuery &Q) {
1081 return ::SimplifySDivInst(Op0, Op1, Q, RecursionLimit);
1084 /// Given operands for a UDiv, see if we can fold the result.
1085 /// If not, this returns null.
1086 static Value *SimplifyUDivInst(Value *Op0, Value *Op1, const SimplifyQuery &Q,
1087 unsigned MaxRecurse) {
1088 if (Value *V = SimplifyDiv(Instruction::UDiv, Op0, Op1, Q, MaxRecurse))
1091 // udiv %V, C -> 0 if %V < C
1093 if (Constant *C = dyn_cast_or_null<Constant>(SimplifyICmpInst(
1094 ICmpInst::ICMP_ULT, Op0, Op1, Q, MaxRecurse - 1))) {
1095 if (C->isAllOnesValue()) {
1096 return Constant::getNullValue(Op0->getType());
1104 Value *llvm::SimplifyUDivInst(Value *Op0, Value *Op1, const SimplifyQuery &Q) {
1105 return ::SimplifyUDivInst(Op0, Op1, Q, RecursionLimit);
1108 static Value *SimplifyFDivInst(Value *Op0, Value *Op1, FastMathFlags FMF,
1109 const SimplifyQuery &Q, unsigned) {
1110 if (Constant *C = foldOrCommuteConstant(Instruction::FDiv, Op0, Op1, Q))
1113 // undef / X -> undef (the undef could be a snan).
1114 if (match(Op0, m_Undef()))
1117 // X / undef -> undef
1118 if (match(Op1, m_Undef()))
1122 if (match(Op1, m_FPOne()))
1126 // Requires that NaNs are off (X could be zero) and signed zeroes are
1127 // ignored (X could be positive or negative, so the output sign is unknown).
1128 if (FMF.noNaNs() && FMF.noSignedZeros() && match(Op0, m_AnyZero()))
1132 // X / X -> 1.0 is legal when NaNs are ignored.
1134 return ConstantFP::get(Op0->getType(), 1.0);
1136 // -X / X -> -1.0 and
1137 // X / -X -> -1.0 are legal when NaNs are ignored.
1138 // We can ignore signed zeros because +-0.0/+-0.0 is NaN and ignored.
1139 if ((BinaryOperator::isFNeg(Op0, /*IgnoreZeroSign=*/true) &&
1140 BinaryOperator::getFNegArgument(Op0) == Op1) ||
1141 (BinaryOperator::isFNeg(Op1, /*IgnoreZeroSign=*/true) &&
1142 BinaryOperator::getFNegArgument(Op1) == Op0))
1143 return ConstantFP::get(Op0->getType(), -1.0);
1149 Value *llvm::SimplifyFDivInst(Value *Op0, Value *Op1, FastMathFlags FMF,
1150 const SimplifyQuery &Q) {
1151 return ::SimplifyFDivInst(Op0, Op1, FMF, Q, RecursionLimit);
1154 /// Given operands for an SRem or URem, see if we can fold the result.
1155 /// If not, this returns null.
1156 static Value *SimplifyRem(Instruction::BinaryOps Opcode, Value *Op0, Value *Op1,
1157 const SimplifyQuery &Q, unsigned MaxRecurse) {
1158 if (Constant *C = foldOrCommuteConstant(Opcode, Op0, Op1, Q))
1161 if (Value *V = simplifyDivRem(Op0, Op1, false))
1164 // (X % Y) % Y -> X % Y
1165 if ((Opcode == Instruction::SRem &&
1166 match(Op0, m_SRem(m_Value(), m_Specific(Op1)))) ||
1167 (Opcode == Instruction::URem &&
1168 match(Op0, m_URem(m_Value(), m_Specific(Op1)))))
1171 // If the operation is with the result of a select instruction, check whether
1172 // operating on either branch of the select always yields the same value.
1173 if (isa<SelectInst>(Op0) || isa<SelectInst>(Op1))
1174 if (Value *V = ThreadBinOpOverSelect(Opcode, Op0, Op1, Q, MaxRecurse))
1177 // If the operation is with the result of a phi instruction, check whether
1178 // operating on all incoming values of the phi always yields the same value.
1179 if (isa<PHINode>(Op0) || isa<PHINode>(Op1))
1180 if (Value *V = ThreadBinOpOverPHI(Opcode, Op0, Op1, Q, MaxRecurse))
1186 /// Given operands for an SRem, see if we can fold the result.
1187 /// If not, this returns null.
1188 static Value *SimplifySRemInst(Value *Op0, Value *Op1, const SimplifyQuery &Q,
1189 unsigned MaxRecurse) {
1190 if (Value *V = SimplifyRem(Instruction::SRem, Op0, Op1, Q, MaxRecurse))
1196 Value *llvm::SimplifySRemInst(Value *Op0, Value *Op1, const SimplifyQuery &Q) {
1197 return ::SimplifySRemInst(Op0, Op1, Q, RecursionLimit);
1200 /// Given operands for a URem, see if we can fold the result.
1201 /// If not, this returns null.
1202 static Value *SimplifyURemInst(Value *Op0, Value *Op1, const SimplifyQuery &Q,
1203 unsigned MaxRecurse) {
1204 if (Value *V = SimplifyRem(Instruction::URem, Op0, Op1, Q, MaxRecurse))
1207 // urem %V, C -> %V if %V < C
1209 if (Constant *C = dyn_cast_or_null<Constant>(SimplifyICmpInst(
1210 ICmpInst::ICMP_ULT, Op0, Op1, Q, MaxRecurse - 1))) {
1211 if (C->isAllOnesValue()) {
1220 Value *llvm::SimplifyURemInst(Value *Op0, Value *Op1, const SimplifyQuery &Q) {
1221 return ::SimplifyURemInst(Op0, Op1, Q, RecursionLimit);
1224 static Value *SimplifyFRemInst(Value *Op0, Value *Op1, FastMathFlags FMF,
1225 const SimplifyQuery &Q, unsigned) {
1226 if (Constant *C = foldOrCommuteConstant(Instruction::FRem, Op0, Op1, Q))
1229 // undef % X -> undef (the undef could be a snan).
1230 if (match(Op0, m_Undef()))
1233 // X % undef -> undef
1234 if (match(Op1, m_Undef()))
1238 // Requires that NaNs are off (X could be zero) and signed zeroes are
1239 // ignored (X could be positive or negative, so the output sign is unknown).
1240 if (FMF.noNaNs() && FMF.noSignedZeros() && match(Op0, m_AnyZero()))
1246 Value *llvm::SimplifyFRemInst(Value *Op0, Value *Op1, FastMathFlags FMF,
1247 const SimplifyQuery &Q) {
1248 return ::SimplifyFRemInst(Op0, Op1, FMF, Q, RecursionLimit);
1251 /// Returns true if a shift by \c Amount always yields undef.
1252 static bool isUndefShift(Value *Amount) {
1253 Constant *C = dyn_cast<Constant>(Amount);
1257 // X shift by undef -> undef because it may shift by the bitwidth.
1258 if (isa<UndefValue>(C))
1261 // Shifting by the bitwidth or more is undefined.
1262 if (ConstantInt *CI = dyn_cast<ConstantInt>(C))
1263 if (CI->getValue().getLimitedValue() >=
1264 CI->getType()->getScalarSizeInBits())
1267 // If all lanes of a vector shift are undefined the whole shift is.
1268 if (isa<ConstantVector>(C) || isa<ConstantDataVector>(C)) {
1269 for (unsigned I = 0, E = C->getType()->getVectorNumElements(); I != E; ++I)
1270 if (!isUndefShift(C->getAggregateElement(I)))
1278 /// Given operands for an Shl, LShr or AShr, see if we can fold the result.
1279 /// If not, this returns null.
1280 static Value *SimplifyShift(Instruction::BinaryOps Opcode, Value *Op0,
1281 Value *Op1, const SimplifyQuery &Q, unsigned MaxRecurse) {
1282 if (Constant *C = foldOrCommuteConstant(Opcode, Op0, Op1, Q))
1285 // 0 shift by X -> 0
1286 if (match(Op0, m_Zero()))
1289 // X shift by 0 -> X
1290 if (match(Op1, m_Zero()))
1293 // Fold undefined shifts.
1294 if (isUndefShift(Op1))
1295 return UndefValue::get(Op0->getType());
1297 // If the operation is with the result of a select instruction, check whether
1298 // operating on either branch of the select always yields the same value.
1299 if (isa<SelectInst>(Op0) || isa<SelectInst>(Op1))
1300 if (Value *V = ThreadBinOpOverSelect(Opcode, Op0, Op1, Q, MaxRecurse))
1303 // If the operation is with the result of a phi instruction, check whether
1304 // operating on all incoming values of the phi always yields the same value.
1305 if (isa<PHINode>(Op0) || isa<PHINode>(Op1))
1306 if (Value *V = ThreadBinOpOverPHI(Opcode, Op0, Op1, Q, MaxRecurse))
1309 // If any bits in the shift amount make that value greater than or equal to
1310 // the number of bits in the type, the shift is undefined.
1311 unsigned BitWidth = Op1->getType()->getScalarSizeInBits();
1312 KnownBits Known(BitWidth);
1313 computeKnownBits(Op1, Known, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
1314 if (Known.One.getLimitedValue() >= BitWidth)
1315 return UndefValue::get(Op0->getType());
1317 // If all valid bits in the shift amount are known zero, the first operand is
1319 unsigned NumValidShiftBits = Log2_32_Ceil(BitWidth);
1320 if (Known.Zero.countTrailingOnes() >= NumValidShiftBits)
1326 /// \brief Given operands for an Shl, LShr or AShr, see if we can
1327 /// fold the result. If not, this returns null.
1328 static Value *SimplifyRightShift(Instruction::BinaryOps Opcode, Value *Op0,
1329 Value *Op1, bool isExact, const SimplifyQuery &Q,
1330 unsigned MaxRecurse) {
1331 if (Value *V = SimplifyShift(Opcode, Op0, Op1, Q, MaxRecurse))
1336 return Constant::getNullValue(Op0->getType());
1339 // undef >> X -> undef (if it's exact)
1340 if (match(Op0, m_Undef()))
1341 return isExact ? Op0 : Constant::getNullValue(Op0->getType());
1343 // The low bit cannot be shifted out of an exact shift if it is set.
1345 unsigned BitWidth = Op0->getType()->getScalarSizeInBits();
1346 KnownBits Op0Known(BitWidth);
1347 computeKnownBits(Op0, Op0Known, Q.DL, /*Depth=*/0, Q.AC, Q.CxtI, Q.DT);
1348 if (Op0Known.One[0])
1355 /// Given operands for an Shl, see if we can fold the result.
1356 /// If not, this returns null.
1357 static Value *SimplifyShlInst(Value *Op0, Value *Op1, bool isNSW, bool isNUW,
1358 const SimplifyQuery &Q, unsigned MaxRecurse) {
1359 if (Value *V = SimplifyShift(Instruction::Shl, Op0, Op1, Q, MaxRecurse))
1363 // undef << X -> undef if (if it's NSW/NUW)
1364 if (match(Op0, m_Undef()))
1365 return isNSW || isNUW ? Op0 : Constant::getNullValue(Op0->getType());
1367 // (X >> A) << A -> X
1369 if (match(Op0, m_Exact(m_Shr(m_Value(X), m_Specific(Op1)))))
1374 Value *llvm::SimplifyShlInst(Value *Op0, Value *Op1, bool isNSW, bool isNUW,
1375 const SimplifyQuery &Q) {
1376 return ::SimplifyShlInst(Op0, Op1, isNSW, isNUW, Q, RecursionLimit);
1379 /// Given operands for an LShr, see if we can fold the result.
1380 /// If not, this returns null.
1381 static Value *SimplifyLShrInst(Value *Op0, Value *Op1, bool isExact,
1382 const SimplifyQuery &Q, unsigned MaxRecurse) {
1383 if (Value *V = SimplifyRightShift(Instruction::LShr, Op0, Op1, isExact, Q,
1387 // (X << A) >> A -> X
1389 if (match(Op0, m_NUWShl(m_Value(X), m_Specific(Op1))))
1395 Value *llvm::SimplifyLShrInst(Value *Op0, Value *Op1, bool isExact,
1396 const SimplifyQuery &Q) {
1397 return ::SimplifyLShrInst(Op0, Op1, isExact, Q, RecursionLimit);
1400 /// Given operands for an AShr, see if we can fold the result.
1401 /// If not, this returns null.
1402 static Value *SimplifyAShrInst(Value *Op0, Value *Op1, bool isExact,
1403 const SimplifyQuery &Q, unsigned MaxRecurse) {
1404 if (Value *V = SimplifyRightShift(Instruction::AShr, Op0, Op1, isExact, Q,
1408 // all ones >>a X -> all ones
1409 if (match(Op0, m_AllOnes()))
1412 // (X << A) >> A -> X
1414 if (match(Op0, m_NSWShl(m_Value(X), m_Specific(Op1))))
1417 // Arithmetic shifting an all-sign-bit value is a no-op.
1418 unsigned NumSignBits = ComputeNumSignBits(Op0, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
1419 if (NumSignBits == Op0->getType()->getScalarSizeInBits())
1425 Value *llvm::SimplifyAShrInst(Value *Op0, Value *Op1, bool isExact,
1426 const SimplifyQuery &Q) {
1427 return ::SimplifyAShrInst(Op0, Op1, isExact, Q, RecursionLimit);
1430 static Value *simplifyUnsignedRangeCheck(ICmpInst *ZeroICmp,
1431 ICmpInst *UnsignedICmp, bool IsAnd) {
1434 ICmpInst::Predicate EqPred;
1435 if (!match(ZeroICmp, m_ICmp(EqPred, m_Value(Y), m_Zero())) ||
1436 !ICmpInst::isEquality(EqPred))
1439 ICmpInst::Predicate UnsignedPred;
1440 if (match(UnsignedICmp, m_ICmp(UnsignedPred, m_Value(X), m_Specific(Y))) &&
1441 ICmpInst::isUnsigned(UnsignedPred))
1443 else if (match(UnsignedICmp,
1444 m_ICmp(UnsignedPred, m_Value(Y), m_Specific(X))) &&
1445 ICmpInst::isUnsigned(UnsignedPred))
1446 UnsignedPred = ICmpInst::getSwappedPredicate(UnsignedPred);
1450 // X < Y && Y != 0 --> X < Y
1451 // X < Y || Y != 0 --> Y != 0
1452 if (UnsignedPred == ICmpInst::ICMP_ULT && EqPred == ICmpInst::ICMP_NE)
1453 return IsAnd ? UnsignedICmp : ZeroICmp;
1455 // X >= Y || Y != 0 --> true
1456 // X >= Y || Y == 0 --> X >= Y
1457 if (UnsignedPred == ICmpInst::ICMP_UGE && !IsAnd) {
1458 if (EqPred == ICmpInst::ICMP_NE)
1459 return getTrue(UnsignedICmp->getType());
1460 return UnsignedICmp;
1463 // X < Y && Y == 0 --> false
1464 if (UnsignedPred == ICmpInst::ICMP_ULT && EqPred == ICmpInst::ICMP_EQ &&
1466 return getFalse(UnsignedICmp->getType());
1471 /// Commuted variants are assumed to be handled by calling this function again
1472 /// with the parameters swapped.
1473 static Value *simplifyAndOfICmpsWithSameOperands(ICmpInst *Op0, ICmpInst *Op1) {
1474 ICmpInst::Predicate Pred0, Pred1;
1476 if (!match(Op0, m_ICmp(Pred0, m_Value(A), m_Value(B))) ||
1477 !match(Op1, m_ICmp(Pred1, m_Specific(A), m_Specific(B))))
1480 // We have (icmp Pred0, A, B) & (icmp Pred1, A, B).
1481 // If Op1 is always implied true by Op0, then Op0 is a subset of Op1, and we
1482 // can eliminate Op1 from this 'and'.
1483 if (ICmpInst::isImpliedTrueByMatchingCmp(Pred0, Pred1))
1486 // Check for any combination of predicates that are guaranteed to be disjoint.
1487 if ((Pred0 == ICmpInst::getInversePredicate(Pred1)) ||
1488 (Pred0 == ICmpInst::ICMP_EQ && ICmpInst::isFalseWhenEqual(Pred1)) ||
1489 (Pred0 == ICmpInst::ICMP_SLT && Pred1 == ICmpInst::ICMP_SGT) ||
1490 (Pred0 == ICmpInst::ICMP_ULT && Pred1 == ICmpInst::ICMP_UGT))
1491 return getFalse(Op0->getType());
1496 /// Commuted variants are assumed to be handled by calling this function again
1497 /// with the parameters swapped.
1498 static Value *simplifyOrOfICmpsWithSameOperands(ICmpInst *Op0, ICmpInst *Op1) {
1499 ICmpInst::Predicate Pred0, Pred1;
1501 if (!match(Op0, m_ICmp(Pred0, m_Value(A), m_Value(B))) ||
1502 !match(Op1, m_ICmp(Pred1, m_Specific(A), m_Specific(B))))
1505 // We have (icmp Pred0, A, B) | (icmp Pred1, A, B).
1506 // If Op1 is always implied true by Op0, then Op0 is a subset of Op1, and we
1507 // can eliminate Op0 from this 'or'.
1508 if (ICmpInst::isImpliedTrueByMatchingCmp(Pred0, Pred1))
1511 // Check for any combination of predicates that cover the entire range of
1513 if ((Pred0 == ICmpInst::getInversePredicate(Pred1)) ||
1514 (Pred0 == ICmpInst::ICMP_NE && ICmpInst::isTrueWhenEqual(Pred1)) ||
1515 (Pred0 == ICmpInst::ICMP_SLE && Pred1 == ICmpInst::ICMP_SGE) ||
1516 (Pred0 == ICmpInst::ICMP_ULE && Pred1 == ICmpInst::ICMP_UGE))
1517 return getTrue(Op0->getType());
1522 /// Test if a pair of compares with a shared operand and 2 constants has an
1523 /// empty set intersection, full set union, or if one compare is a superset of
1525 static Value *simplifyAndOrOfICmpsWithConstants(ICmpInst *Cmp0, ICmpInst *Cmp1,
1527 // Look for this pattern: {and/or} (icmp X, C0), (icmp X, C1)).
1528 if (Cmp0->getOperand(0) != Cmp1->getOperand(0))
1531 const APInt *C0, *C1;
1532 if (!match(Cmp0->getOperand(1), m_APInt(C0)) ||
1533 !match(Cmp1->getOperand(1), m_APInt(C1)))
1536 auto Range0 = ConstantRange::makeExactICmpRegion(Cmp0->getPredicate(), *C0);
1537 auto Range1 = ConstantRange::makeExactICmpRegion(Cmp1->getPredicate(), *C1);
1539 // For and-of-comapares, check if the intersection is empty:
1540 // (icmp X, C0) && (icmp X, C1) --> empty set --> false
1541 if (IsAnd && Range0.intersectWith(Range1).isEmptySet())
1542 return getFalse(Cmp0->getType());
1544 // For or-of-compares, check if the union is full:
1545 // (icmp X, C0) || (icmp X, C1) --> full set --> true
1546 if (!IsAnd && Range0.unionWith(Range1).isFullSet())
1547 return getTrue(Cmp0->getType());
1549 // Is one range a superset of the other?
1550 // If this is and-of-compares, take the smaller set:
1551 // (icmp sgt X, 4) && (icmp sgt X, 42) --> icmp sgt X, 42
1552 // If this is or-of-compares, take the larger set:
1553 // (icmp sgt X, 4) || (icmp sgt X, 42) --> icmp sgt X, 4
1554 if (Range0.contains(Range1))
1555 return IsAnd ? Cmp1 : Cmp0;
1556 if (Range1.contains(Range0))
1557 return IsAnd ? Cmp0 : Cmp1;
1562 /// Commuted variants are assumed to be handled by calling this function again
1563 /// with the parameters swapped.
1564 static Value *simplifyAndOfICmps(ICmpInst *Op0, ICmpInst *Op1) {
1565 if (Value *X = simplifyUnsignedRangeCheck(Op0, Op1, /*IsAnd=*/true))
1568 if (Value *X = simplifyAndOfICmpsWithSameOperands(Op0, Op1))
1571 if (Value *X = simplifyAndOrOfICmpsWithConstants(Op0, Op1, true))
1574 // (icmp (add V, C0), C1) & (icmp V, C0)
1575 Type *ITy = Op0->getType();
1576 ICmpInst::Predicate Pred0, Pred1;
1577 const APInt *C0, *C1;
1579 if (!match(Op0, m_ICmp(Pred0, m_Add(m_Value(V), m_APInt(C0)), m_APInt(C1))))
1582 if (!match(Op1, m_ICmp(Pred1, m_Specific(V), m_Value())))
1585 auto *AddInst = cast<BinaryOperator>(Op0->getOperand(0));
1586 if (AddInst->getOperand(1) != Op1->getOperand(1))
1589 bool isNSW = AddInst->hasNoSignedWrap();
1590 bool isNUW = AddInst->hasNoUnsignedWrap();
1592 const APInt Delta = *C1 - *C0;
1593 if (C0->isStrictlyPositive()) {
1595 if (Pred0 == ICmpInst::ICMP_ULT && Pred1 == ICmpInst::ICMP_SGT)
1596 return getFalse(ITy);
1597 if (Pred0 == ICmpInst::ICMP_SLT && Pred1 == ICmpInst::ICMP_SGT && isNSW)
1598 return getFalse(ITy);
1601 if (Pred0 == ICmpInst::ICMP_ULE && Pred1 == ICmpInst::ICMP_SGT)
1602 return getFalse(ITy);
1603 if (Pred0 == ICmpInst::ICMP_SLE && Pred1 == ICmpInst::ICMP_SGT && isNSW)
1604 return getFalse(ITy);
1607 if (C0->getBoolValue() && isNUW) {
1609 if (Pred0 == ICmpInst::ICMP_ULT && Pred1 == ICmpInst::ICMP_UGT)
1610 return getFalse(ITy);
1612 if (Pred0 == ICmpInst::ICMP_ULE && Pred1 == ICmpInst::ICMP_UGT)
1613 return getFalse(ITy);
1619 /// Commuted variants are assumed to be handled by calling this function again
1620 /// with the parameters swapped.
1621 static Value *simplifyOrOfICmps(ICmpInst *Op0, ICmpInst *Op1) {
1622 if (Value *X = simplifyUnsignedRangeCheck(Op0, Op1, /*IsAnd=*/false))
1625 if (Value *X = simplifyOrOfICmpsWithSameOperands(Op0, Op1))
1628 if (Value *X = simplifyAndOrOfICmpsWithConstants(Op0, Op1, false))
1631 // (icmp (add V, C0), C1) | (icmp V, C0)
1632 ICmpInst::Predicate Pred0, Pred1;
1633 const APInt *C0, *C1;
1635 if (!match(Op0, m_ICmp(Pred0, m_Add(m_Value(V), m_APInt(C0)), m_APInt(C1))))
1638 if (!match(Op1, m_ICmp(Pred1, m_Specific(V), m_Value())))
1641 auto *AddInst = cast<BinaryOperator>(Op0->getOperand(0));
1642 if (AddInst->getOperand(1) != Op1->getOperand(1))
1645 Type *ITy = Op0->getType();
1646 bool isNSW = AddInst->hasNoSignedWrap();
1647 bool isNUW = AddInst->hasNoUnsignedWrap();
1649 const APInt Delta = *C1 - *C0;
1650 if (C0->isStrictlyPositive()) {
1652 if (Pred0 == ICmpInst::ICMP_UGE && Pred1 == ICmpInst::ICMP_SLE)
1653 return getTrue(ITy);
1654 if (Pred0 == ICmpInst::ICMP_SGE && Pred1 == ICmpInst::ICMP_SLE && isNSW)
1655 return getTrue(ITy);
1658 if (Pred0 == ICmpInst::ICMP_UGT && Pred1 == ICmpInst::ICMP_SLE)
1659 return getTrue(ITy);
1660 if (Pred0 == ICmpInst::ICMP_SGT && Pred1 == ICmpInst::ICMP_SLE && isNSW)
1661 return getTrue(ITy);
1664 if (C0->getBoolValue() && isNUW) {
1666 if (Pred0 == ICmpInst::ICMP_UGE && Pred1 == ICmpInst::ICMP_ULE)
1667 return getTrue(ITy);
1669 if (Pred0 == ICmpInst::ICMP_UGT && Pred1 == ICmpInst::ICMP_ULE)
1670 return getTrue(ITy);
1676 static Value *simplifyPossiblyCastedAndOrOfICmps(ICmpInst *Cmp0, ICmpInst *Cmp1,
1677 bool IsAnd, CastInst *Cast) {
1679 IsAnd ? simplifyAndOfICmps(Cmp0, Cmp1) : simplifyOrOfICmps(Cmp0, Cmp1);
1685 // If we looked through casts, we can only handle a constant simplification
1686 // because we are not allowed to create a cast instruction here.
1687 if (auto *C = dyn_cast<Constant>(V))
1688 return ConstantExpr::getCast(Cast->getOpcode(), C, Cast->getType());
1693 static Value *simplifyAndOrOfICmps(Value *Op0, Value *Op1, bool IsAnd) {
1694 // Look through casts of the 'and' operands to find compares.
1695 auto *Cast0 = dyn_cast<CastInst>(Op0);
1696 auto *Cast1 = dyn_cast<CastInst>(Op1);
1697 if (Cast0 && Cast1 && Cast0->getOpcode() == Cast1->getOpcode() &&
1698 Cast0->getSrcTy() == Cast1->getSrcTy()) {
1699 Op0 = Cast0->getOperand(0);
1700 Op1 = Cast1->getOperand(0);
1703 auto *Cmp0 = dyn_cast<ICmpInst>(Op0);
1704 auto *Cmp1 = dyn_cast<ICmpInst>(Op1);
1708 if (Value *V = simplifyPossiblyCastedAndOrOfICmps(Cmp0, Cmp1, IsAnd, Cast0))
1710 if (Value *V = simplifyPossiblyCastedAndOrOfICmps(Cmp1, Cmp0, IsAnd, Cast0))
1716 /// Given operands for an And, see if we can fold the result.
1717 /// If not, this returns null.
1718 static Value *SimplifyAndInst(Value *Op0, Value *Op1, const SimplifyQuery &Q,
1719 unsigned MaxRecurse) {
1720 if (Constant *C = foldOrCommuteConstant(Instruction::And, Op0, Op1, Q))
1724 if (match(Op1, m_Undef()))
1725 return Constant::getNullValue(Op0->getType());
1732 if (match(Op1, m_Zero()))
1736 if (match(Op1, m_AllOnes()))
1739 // A & ~A = ~A & A = 0
1740 if (match(Op0, m_Not(m_Specific(Op1))) ||
1741 match(Op1, m_Not(m_Specific(Op0))))
1742 return Constant::getNullValue(Op0->getType());
1745 Value *A = nullptr, *B = nullptr;
1746 if (match(Op0, m_Or(m_Value(A), m_Value(B))) &&
1747 (A == Op1 || B == Op1))
1751 if (match(Op1, m_Or(m_Value(A), m_Value(B))) &&
1752 (A == Op0 || B == Op0))
1755 // A & (-A) = A if A is a power of two or zero.
1756 if (match(Op0, m_Neg(m_Specific(Op1))) ||
1757 match(Op1, m_Neg(m_Specific(Op0)))) {
1758 if (isKnownToBeAPowerOfTwo(Op0, Q.DL, /*OrZero*/ true, 0, Q.AC, Q.CxtI,
1761 if (isKnownToBeAPowerOfTwo(Op1, Q.DL, /*OrZero*/ true, 0, Q.AC, Q.CxtI,
1766 if (Value *V = simplifyAndOrOfICmps(Op0, Op1, true))
1769 // Try some generic simplifications for associative operations.
1770 if (Value *V = SimplifyAssociativeBinOp(Instruction::And, Op0, Op1, Q,
1774 // And distributes over Or. Try some generic simplifications based on this.
1775 if (Value *V = ExpandBinOp(Instruction::And, Op0, Op1, Instruction::Or,
1779 // And distributes over Xor. Try some generic simplifications based on this.
1780 if (Value *V = ExpandBinOp(Instruction::And, Op0, Op1, Instruction::Xor,
1784 // If the operation is with the result of a select instruction, check whether
1785 // operating on either branch of the select always yields the same value.
1786 if (isa<SelectInst>(Op0) || isa<SelectInst>(Op1))
1787 if (Value *V = ThreadBinOpOverSelect(Instruction::And, Op0, Op1, Q,
1791 // If the operation is with the result of a phi instruction, check whether
1792 // operating on all incoming values of the phi always yields the same value.
1793 if (isa<PHINode>(Op0) || isa<PHINode>(Op1))
1794 if (Value *V = ThreadBinOpOverPHI(Instruction::And, Op0, Op1, Q,
1801 Value *llvm::SimplifyAndInst(Value *Op0, Value *Op1, const SimplifyQuery &Q) {
1802 return ::SimplifyAndInst(Op0, Op1, Q, RecursionLimit);
1805 /// Given operands for an Or, see if we can fold the result.
1806 /// If not, this returns null.
1807 static Value *SimplifyOrInst(Value *Op0, Value *Op1, const SimplifyQuery &Q,
1808 unsigned MaxRecurse) {
1809 if (Constant *C = foldOrCommuteConstant(Instruction::Or, Op0, Op1, Q))
1813 if (match(Op1, m_Undef()))
1814 return Constant::getAllOnesValue(Op0->getType());
1821 if (match(Op1, m_Zero()))
1825 if (match(Op1, m_AllOnes()))
1828 // A | ~A = ~A | A = -1
1829 if (match(Op0, m_Not(m_Specific(Op1))) ||
1830 match(Op1, m_Not(m_Specific(Op0))))
1831 return Constant::getAllOnesValue(Op0->getType());
1834 Value *A = nullptr, *B = nullptr;
1835 if (match(Op0, m_And(m_Value(A), m_Value(B))) &&
1836 (A == Op1 || B == Op1))
1840 if (match(Op1, m_And(m_Value(A), m_Value(B))) &&
1841 (A == Op0 || B == Op0))
1844 // ~(A & ?) | A = -1
1845 if (match(Op0, m_Not(m_And(m_Value(A), m_Value(B)))) &&
1846 (A == Op1 || B == Op1))
1847 return Constant::getAllOnesValue(Op1->getType());
1849 // A | ~(A & ?) = -1
1850 if (match(Op1, m_Not(m_And(m_Value(A), m_Value(B)))) &&
1851 (A == Op0 || B == Op0))
1852 return Constant::getAllOnesValue(Op0->getType());
1854 // (A & ~B) | (A ^ B) -> (A ^ B)
1855 // (~B & A) | (A ^ B) -> (A ^ B)
1856 // (A & ~B) | (B ^ A) -> (B ^ A)
1857 // (~B & A) | (B ^ A) -> (B ^ A)
1858 if (match(Op1, m_Xor(m_Value(A), m_Value(B))) &&
1859 (match(Op0, m_c_And(m_Specific(A), m_Not(m_Specific(B)))) ||
1860 match(Op0, m_c_And(m_Not(m_Specific(A)), m_Specific(B)))))
1863 // Commute the 'or' operands.
1864 // (A ^ B) | (A & ~B) -> (A ^ B)
1865 // (A ^ B) | (~B & A) -> (A ^ B)
1866 // (B ^ A) | (A & ~B) -> (B ^ A)
1867 // (B ^ A) | (~B & A) -> (B ^ A)
1868 if (match(Op0, m_Xor(m_Value(A), m_Value(B))) &&
1869 (match(Op1, m_c_And(m_Specific(A), m_Not(m_Specific(B)))) ||
1870 match(Op1, m_c_And(m_Not(m_Specific(A)), m_Specific(B)))))
1873 if (Value *V = simplifyAndOrOfICmps(Op0, Op1, false))
1876 // Try some generic simplifications for associative operations.
1877 if (Value *V = SimplifyAssociativeBinOp(Instruction::Or, Op0, Op1, Q,
1881 // Or distributes over And. Try some generic simplifications based on this.
1882 if (Value *V = ExpandBinOp(Instruction::Or, Op0, Op1, Instruction::And, Q,
1886 // If the operation is with the result of a select instruction, check whether
1887 // operating on either branch of the select always yields the same value.
1888 if (isa<SelectInst>(Op0) || isa<SelectInst>(Op1))
1889 if (Value *V = ThreadBinOpOverSelect(Instruction::Or, Op0, Op1, Q,
1894 Value *C = nullptr, *D = nullptr;
1895 if (match(Op0, m_And(m_Value(A), m_Value(C))) &&
1896 match(Op1, m_And(m_Value(B), m_Value(D)))) {
1897 ConstantInt *C1 = dyn_cast<ConstantInt>(C);
1898 ConstantInt *C2 = dyn_cast<ConstantInt>(D);
1899 if (C1 && C2 && (C1->getValue() == ~C2->getValue())) {
1900 // (A & C1)|(B & C2)
1901 // If we have: ((V + N) & C1) | (V & C2)
1902 // .. and C2 = ~C1 and C2 is 0+1+ and (N & C2) == 0
1903 // replace with V+N.
1905 if ((C2->getValue() & (C2->getValue() + 1)) == 0 && // C2 == 0+1+
1906 match(A, m_Add(m_Value(V1), m_Value(V2)))) {
1907 // Add commutes, try both ways.
1909 MaskedValueIsZero(V2, C2->getValue(), Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
1912 MaskedValueIsZero(V1, C2->getValue(), Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
1915 // Or commutes, try both ways.
1916 if ((C1->getValue() & (C1->getValue() + 1)) == 0 &&
1917 match(B, m_Add(m_Value(V1), m_Value(V2)))) {
1918 // Add commutes, try both ways.
1920 MaskedValueIsZero(V2, C1->getValue(), Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
1923 MaskedValueIsZero(V1, C1->getValue(), Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
1929 // If the operation is with the result of a phi instruction, check whether
1930 // operating on all incoming values of the phi always yields the same value.
1931 if (isa<PHINode>(Op0) || isa<PHINode>(Op1))
1932 if (Value *V = ThreadBinOpOverPHI(Instruction::Or, Op0, Op1, Q, MaxRecurse))
1938 Value *llvm::SimplifyOrInst(Value *Op0, Value *Op1, const SimplifyQuery &Q) {
1939 return ::SimplifyOrInst(Op0, Op1, Q, RecursionLimit);
1942 /// Given operands for a Xor, see if we can fold the result.
1943 /// If not, this returns null.
1944 static Value *SimplifyXorInst(Value *Op0, Value *Op1, const SimplifyQuery &Q,
1945 unsigned MaxRecurse) {
1946 if (Constant *C = foldOrCommuteConstant(Instruction::Xor, Op0, Op1, Q))
1949 // A ^ undef -> undef
1950 if (match(Op1, m_Undef()))
1954 if (match(Op1, m_Zero()))
1959 return Constant::getNullValue(Op0->getType());
1961 // A ^ ~A = ~A ^ A = -1
1962 if (match(Op0, m_Not(m_Specific(Op1))) ||
1963 match(Op1, m_Not(m_Specific(Op0))))
1964 return Constant::getAllOnesValue(Op0->getType());
1966 // Try some generic simplifications for associative operations.
1967 if (Value *V = SimplifyAssociativeBinOp(Instruction::Xor, Op0, Op1, Q,
1971 // Threading Xor over selects and phi nodes is pointless, so don't bother.
1972 // Threading over the select in "A ^ select(cond, B, C)" means evaluating
1973 // "A^B" and "A^C" and seeing if they are equal; but they are equal if and
1974 // only if B and C are equal. If B and C are equal then (since we assume
1975 // that operands have already been simplified) "select(cond, B, C)" should
1976 // have been simplified to the common value of B and C already. Analysing
1977 // "A^B" and "A^C" thus gains nothing, but costs compile time. Similarly
1978 // for threading over phi nodes.
1983 Value *llvm::SimplifyXorInst(Value *Op0, Value *Op1, const SimplifyQuery &Q) {
1984 return ::SimplifyXorInst(Op0, Op1, Q, RecursionLimit);
1988 static Type *GetCompareTy(Value *Op) {
1989 return CmpInst::makeCmpResultType(Op->getType());
1992 /// Rummage around inside V looking for something equivalent to the comparison
1993 /// "LHS Pred RHS". Return such a value if found, otherwise return null.
1994 /// Helper function for analyzing max/min idioms.
1995 static Value *ExtractEquivalentCondition(Value *V, CmpInst::Predicate Pred,
1996 Value *LHS, Value *RHS) {
1997 SelectInst *SI = dyn_cast<SelectInst>(V);
2000 CmpInst *Cmp = dyn_cast<CmpInst>(SI->getCondition());
2003 Value *CmpLHS = Cmp->getOperand(0), *CmpRHS = Cmp->getOperand(1);
2004 if (Pred == Cmp->getPredicate() && LHS == CmpLHS && RHS == CmpRHS)
2006 if (Pred == CmpInst::getSwappedPredicate(Cmp->getPredicate()) &&
2007 LHS == CmpRHS && RHS == CmpLHS)
2012 // A significant optimization not implemented here is assuming that alloca
2013 // addresses are not equal to incoming argument values. They don't *alias*,
2014 // as we say, but that doesn't mean they aren't equal, so we take a
2015 // conservative approach.
2017 // This is inspired in part by C++11 5.10p1:
2018 // "Two pointers of the same type compare equal if and only if they are both
2019 // null, both point to the same function, or both represent the same
2022 // This is pretty permissive.
2024 // It's also partly due to C11 6.5.9p6:
2025 // "Two pointers compare equal if and only if both are null pointers, both are
2026 // pointers to the same object (including a pointer to an object and a
2027 // subobject at its beginning) or function, both are pointers to one past the
2028 // last element of the same array object, or one is a pointer to one past the
2029 // end of one array object and the other is a pointer to the start of a
2030 // different array object that happens to immediately follow the first array
2031 // object in the address space.)
2033 // C11's version is more restrictive, however there's no reason why an argument
2034 // couldn't be a one-past-the-end value for a stack object in the caller and be
2035 // equal to the beginning of a stack object in the callee.
2037 // If the C and C++ standards are ever made sufficiently restrictive in this
2038 // area, it may be possible to update LLVM's semantics accordingly and reinstate
2039 // this optimization.
2041 computePointerICmp(const DataLayout &DL, const TargetLibraryInfo *TLI,
2042 const DominatorTree *DT, CmpInst::Predicate Pred,
2043 const Instruction *CxtI, Value *LHS, Value *RHS) {
2044 // First, skip past any trivial no-ops.
2045 LHS = LHS->stripPointerCasts();
2046 RHS = RHS->stripPointerCasts();
2048 // A non-null pointer is not equal to a null pointer.
2049 if (llvm::isKnownNonNull(LHS) && isa<ConstantPointerNull>(RHS) &&
2050 (Pred == CmpInst::ICMP_EQ || Pred == CmpInst::ICMP_NE))
2051 return ConstantInt::get(GetCompareTy(LHS),
2052 !CmpInst::isTrueWhenEqual(Pred));
2054 // We can only fold certain predicates on pointer comparisons.
2059 // Equality comaprisons are easy to fold.
2060 case CmpInst::ICMP_EQ:
2061 case CmpInst::ICMP_NE:
2064 // We can only handle unsigned relational comparisons because 'inbounds' on
2065 // a GEP only protects against unsigned wrapping.
2066 case CmpInst::ICMP_UGT:
2067 case CmpInst::ICMP_UGE:
2068 case CmpInst::ICMP_ULT:
2069 case CmpInst::ICMP_ULE:
2070 // However, we have to switch them to their signed variants to handle
2071 // negative indices from the base pointer.
2072 Pred = ICmpInst::getSignedPredicate(Pred);
2076 // Strip off any constant offsets so that we can reason about them.
2077 // It's tempting to use getUnderlyingObject or even just stripInBoundsOffsets
2078 // here and compare base addresses like AliasAnalysis does, however there are
2079 // numerous hazards. AliasAnalysis and its utilities rely on special rules
2080 // governing loads and stores which don't apply to icmps. Also, AliasAnalysis
2081 // doesn't need to guarantee pointer inequality when it says NoAlias.
2082 Constant *LHSOffset = stripAndComputeConstantOffsets(DL, LHS);
2083 Constant *RHSOffset = stripAndComputeConstantOffsets(DL, RHS);
2085 // If LHS and RHS are related via constant offsets to the same base
2086 // value, we can replace it with an icmp which just compares the offsets.
2088 return ConstantExpr::getICmp(Pred, LHSOffset, RHSOffset);
2090 // Various optimizations for (in)equality comparisons.
2091 if (Pred == CmpInst::ICMP_EQ || Pred == CmpInst::ICMP_NE) {
2092 // Different non-empty allocations that exist at the same time have
2093 // different addresses (if the program can tell). Global variables always
2094 // exist, so they always exist during the lifetime of each other and all
2095 // allocas. Two different allocas usually have different addresses...
2097 // However, if there's an @llvm.stackrestore dynamically in between two
2098 // allocas, they may have the same address. It's tempting to reduce the
2099 // scope of the problem by only looking at *static* allocas here. That would
2100 // cover the majority of allocas while significantly reducing the likelihood
2101 // of having an @llvm.stackrestore pop up in the middle. However, it's not
2102 // actually impossible for an @llvm.stackrestore to pop up in the middle of
2103 // an entry block. Also, if we have a block that's not attached to a
2104 // function, we can't tell if it's "static" under the current definition.
2105 // Theoretically, this problem could be fixed by creating a new kind of
2106 // instruction kind specifically for static allocas. Such a new instruction
2107 // could be required to be at the top of the entry block, thus preventing it
2108 // from being subject to a @llvm.stackrestore. Instcombine could even
2109 // convert regular allocas into these special allocas. It'd be nifty.
2110 // However, until then, this problem remains open.
2112 // So, we'll assume that two non-empty allocas have different addresses
2115 // With all that, if the offsets are within the bounds of their allocations
2116 // (and not one-past-the-end! so we can't use inbounds!), and their
2117 // allocations aren't the same, the pointers are not equal.
2119 // Note that it's not necessary to check for LHS being a global variable
2120 // address, due to canonicalization and constant folding.
2121 if (isa<AllocaInst>(LHS) &&
2122 (isa<AllocaInst>(RHS) || isa<GlobalVariable>(RHS))) {
2123 ConstantInt *LHSOffsetCI = dyn_cast<ConstantInt>(LHSOffset);
2124 ConstantInt *RHSOffsetCI = dyn_cast<ConstantInt>(RHSOffset);
2125 uint64_t LHSSize, RHSSize;
2126 if (LHSOffsetCI && RHSOffsetCI &&
2127 getObjectSize(LHS, LHSSize, DL, TLI) &&
2128 getObjectSize(RHS, RHSSize, DL, TLI)) {
2129 const APInt &LHSOffsetValue = LHSOffsetCI->getValue();
2130 const APInt &RHSOffsetValue = RHSOffsetCI->getValue();
2131 if (!LHSOffsetValue.isNegative() &&
2132 !RHSOffsetValue.isNegative() &&
2133 LHSOffsetValue.ult(LHSSize) &&
2134 RHSOffsetValue.ult(RHSSize)) {
2135 return ConstantInt::get(GetCompareTy(LHS),
2136 !CmpInst::isTrueWhenEqual(Pred));
2140 // Repeat the above check but this time without depending on DataLayout
2141 // or being able to compute a precise size.
2142 if (!cast<PointerType>(LHS->getType())->isEmptyTy() &&
2143 !cast<PointerType>(RHS->getType())->isEmptyTy() &&
2144 LHSOffset->isNullValue() &&
2145 RHSOffset->isNullValue())
2146 return ConstantInt::get(GetCompareTy(LHS),
2147 !CmpInst::isTrueWhenEqual(Pred));
2150 // Even if an non-inbounds GEP occurs along the path we can still optimize
2151 // equality comparisons concerning the result. We avoid walking the whole
2152 // chain again by starting where the last calls to
2153 // stripAndComputeConstantOffsets left off and accumulate the offsets.
2154 Constant *LHSNoBound = stripAndComputeConstantOffsets(DL, LHS, true);
2155 Constant *RHSNoBound = stripAndComputeConstantOffsets(DL, RHS, true);
2157 return ConstantExpr::getICmp(Pred,
2158 ConstantExpr::getAdd(LHSOffset, LHSNoBound),
2159 ConstantExpr::getAdd(RHSOffset, RHSNoBound));
2161 // If one side of the equality comparison must come from a noalias call
2162 // (meaning a system memory allocation function), and the other side must
2163 // come from a pointer that cannot overlap with dynamically-allocated
2164 // memory within the lifetime of the current function (allocas, byval
2165 // arguments, globals), then determine the comparison result here.
2166 SmallVector<Value *, 8> LHSUObjs, RHSUObjs;
2167 GetUnderlyingObjects(LHS, LHSUObjs, DL);
2168 GetUnderlyingObjects(RHS, RHSUObjs, DL);
2170 // Is the set of underlying objects all noalias calls?
2171 auto IsNAC = [](ArrayRef<Value *> Objects) {
2172 return all_of(Objects, isNoAliasCall);
2175 // Is the set of underlying objects all things which must be disjoint from
2176 // noalias calls. For allocas, we consider only static ones (dynamic
2177 // allocas might be transformed into calls to malloc not simultaneously
2178 // live with the compared-to allocation). For globals, we exclude symbols
2179 // that might be resolve lazily to symbols in another dynamically-loaded
2180 // library (and, thus, could be malloc'ed by the implementation).
2181 auto IsAllocDisjoint = [](ArrayRef<Value *> Objects) {
2182 return all_of(Objects, [](Value *V) {
2183 if (const AllocaInst *AI = dyn_cast<AllocaInst>(V))
2184 return AI->getParent() && AI->getFunction() && AI->isStaticAlloca();
2185 if (const GlobalValue *GV = dyn_cast<GlobalValue>(V))
2186 return (GV->hasLocalLinkage() || GV->hasHiddenVisibility() ||
2187 GV->hasProtectedVisibility() || GV->hasGlobalUnnamedAddr()) &&
2188 !GV->isThreadLocal();
2189 if (const Argument *A = dyn_cast<Argument>(V))
2190 return A->hasByValAttr();
2195 if ((IsNAC(LHSUObjs) && IsAllocDisjoint(RHSUObjs)) ||
2196 (IsNAC(RHSUObjs) && IsAllocDisjoint(LHSUObjs)))
2197 return ConstantInt::get(GetCompareTy(LHS),
2198 !CmpInst::isTrueWhenEqual(Pred));
2200 // Fold comparisons for non-escaping pointer even if the allocation call
2201 // cannot be elided. We cannot fold malloc comparison to null. Also, the
2202 // dynamic allocation call could be either of the operands.
2203 Value *MI = nullptr;
2204 if (isAllocLikeFn(LHS, TLI) && llvm::isKnownNonNullAt(RHS, CxtI, DT))
2206 else if (isAllocLikeFn(RHS, TLI) && llvm::isKnownNonNullAt(LHS, CxtI, DT))
2208 // FIXME: We should also fold the compare when the pointer escapes, but the
2209 // compare dominates the pointer escape
2210 if (MI && !PointerMayBeCaptured(MI, true, true))
2211 return ConstantInt::get(GetCompareTy(LHS),
2212 CmpInst::isFalseWhenEqual(Pred));
2219 /// Fold an icmp when its operands have i1 scalar type.
2220 static Value *simplifyICmpOfBools(CmpInst::Predicate Pred, Value *LHS,
2221 Value *RHS, const SimplifyQuery &Q) {
2222 Type *ITy = GetCompareTy(LHS); // The return type.
2223 Type *OpTy = LHS->getType(); // The operand type.
2224 if (!OpTy->getScalarType()->isIntegerTy(1))
2230 case ICmpInst::ICMP_EQ:
2232 if (match(RHS, m_One()))
2235 case ICmpInst::ICMP_NE:
2237 if (match(RHS, m_Zero()))
2240 case ICmpInst::ICMP_UGT:
2242 if (match(RHS, m_Zero()))
2245 case ICmpInst::ICMP_UGE:
2247 if (match(RHS, m_One()))
2249 if (isImpliedCondition(RHS, LHS, Q.DL).getValueOr(false))
2250 return getTrue(ITy);
2252 case ICmpInst::ICMP_SGE:
2253 /// For signed comparison, the values for an i1 are 0 and -1
2254 /// respectively. This maps into a truth table of:
2255 /// LHS | RHS | LHS >=s RHS | LHS implies RHS
2256 /// 0 | 0 | 1 (0 >= 0) | 1
2257 /// 0 | 1 | 1 (0 >= -1) | 1
2258 /// 1 | 0 | 0 (-1 >= 0) | 0
2259 /// 1 | 1 | 1 (-1 >= -1) | 1
2260 if (isImpliedCondition(LHS, RHS, Q.DL).getValueOr(false))
2261 return getTrue(ITy);
2263 case ICmpInst::ICMP_SLT:
2265 if (match(RHS, m_Zero()))
2268 case ICmpInst::ICMP_SLE:
2270 if (match(RHS, m_One()))
2273 case ICmpInst::ICMP_ULE:
2274 if (isImpliedCondition(LHS, RHS, Q.DL).getValueOr(false))
2275 return getTrue(ITy);
2282 /// Try hard to fold icmp with zero RHS because this is a common case.
2283 static Value *simplifyICmpWithZero(CmpInst::Predicate Pred, Value *LHS,
2284 Value *RHS, const SimplifyQuery &Q) {
2285 if (!match(RHS, m_Zero()))
2288 Type *ITy = GetCompareTy(LHS); // The return type.
2289 bool LHSKnownNonNegative, LHSKnownNegative;
2292 llvm_unreachable("Unknown ICmp predicate!");
2293 case ICmpInst::ICMP_ULT:
2294 return getFalse(ITy);
2295 case ICmpInst::ICMP_UGE:
2296 return getTrue(ITy);
2297 case ICmpInst::ICMP_EQ:
2298 case ICmpInst::ICMP_ULE:
2299 if (isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
2300 return getFalse(ITy);
2302 case ICmpInst::ICMP_NE:
2303 case ICmpInst::ICMP_UGT:
2304 if (isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
2305 return getTrue(ITy);
2307 case ICmpInst::ICMP_SLT:
2308 ComputeSignBit(LHS, LHSKnownNonNegative, LHSKnownNegative, Q.DL, 0, Q.AC,
2310 if (LHSKnownNegative)
2311 return getTrue(ITy);
2312 if (LHSKnownNonNegative)
2313 return getFalse(ITy);
2315 case ICmpInst::ICMP_SLE:
2316 ComputeSignBit(LHS, LHSKnownNonNegative, LHSKnownNegative, Q.DL, 0, Q.AC,
2318 if (LHSKnownNegative)
2319 return getTrue(ITy);
2320 if (LHSKnownNonNegative && isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
2321 return getFalse(ITy);
2323 case ICmpInst::ICMP_SGE:
2324 ComputeSignBit(LHS, LHSKnownNonNegative, LHSKnownNegative, Q.DL, 0, Q.AC,
2326 if (LHSKnownNegative)
2327 return getFalse(ITy);
2328 if (LHSKnownNonNegative)
2329 return getTrue(ITy);
2331 case ICmpInst::ICMP_SGT:
2332 ComputeSignBit(LHS, LHSKnownNonNegative, LHSKnownNegative, Q.DL, 0, Q.AC,
2334 if (LHSKnownNegative)
2335 return getFalse(ITy);
2336 if (LHSKnownNonNegative && isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
2337 return getTrue(ITy);
2344 /// Many binary operators with a constant operand have an easy-to-compute
2345 /// range of outputs. This can be used to fold a comparison to always true or
2347 static void setLimitsForBinOp(BinaryOperator &BO, APInt &Lower, APInt &Upper) {
2348 unsigned Width = Lower.getBitWidth();
2350 switch (BO.getOpcode()) {
2351 case Instruction::Add:
2352 if (match(BO.getOperand(1), m_APInt(C)) && *C != 0) {
2353 // FIXME: If we have both nuw and nsw, we should reduce the range further.
2354 if (BO.hasNoUnsignedWrap()) {
2355 // 'add nuw x, C' produces [C, UINT_MAX].
2357 } else if (BO.hasNoSignedWrap()) {
2358 if (C->isNegative()) {
2359 // 'add nsw x, -C' produces [SINT_MIN, SINT_MAX - C].
2360 Lower = APInt::getSignedMinValue(Width);
2361 Upper = APInt::getSignedMaxValue(Width) + *C + 1;
2363 // 'add nsw x, +C' produces [SINT_MIN + C, SINT_MAX].
2364 Lower = APInt::getSignedMinValue(Width) + *C;
2365 Upper = APInt::getSignedMaxValue(Width) + 1;
2371 case Instruction::And:
2372 if (match(BO.getOperand(1), m_APInt(C)))
2373 // 'and x, C' produces [0, C].
2377 case Instruction::Or:
2378 if (match(BO.getOperand(1), m_APInt(C)))
2379 // 'or x, C' produces [C, UINT_MAX].
2383 case Instruction::AShr:
2384 if (match(BO.getOperand(1), m_APInt(C)) && C->ult(Width)) {
2385 // 'ashr x, C' produces [INT_MIN >> C, INT_MAX >> C].
2386 Lower = APInt::getSignedMinValue(Width).ashr(*C);
2387 Upper = APInt::getSignedMaxValue(Width).ashr(*C) + 1;
2388 } else if (match(BO.getOperand(0), m_APInt(C))) {
2389 unsigned ShiftAmount = Width - 1;
2390 if (*C != 0 && BO.isExact())
2391 ShiftAmount = C->countTrailingZeros();
2392 if (C->isNegative()) {
2393 // 'ashr C, x' produces [C, C >> (Width-1)]
2395 Upper = C->ashr(ShiftAmount) + 1;
2397 // 'ashr C, x' produces [C >> (Width-1), C]
2398 Lower = C->ashr(ShiftAmount);
2404 case Instruction::LShr:
2405 if (match(BO.getOperand(1), m_APInt(C)) && C->ult(Width)) {
2406 // 'lshr x, C' produces [0, UINT_MAX >> C].
2407 Upper = APInt::getAllOnesValue(Width).lshr(*C) + 1;
2408 } else if (match(BO.getOperand(0), m_APInt(C))) {
2409 // 'lshr C, x' produces [C >> (Width-1), C].
2410 unsigned ShiftAmount = Width - 1;
2411 if (*C != 0 && BO.isExact())
2412 ShiftAmount = C->countTrailingZeros();
2413 Lower = C->lshr(ShiftAmount);
2418 case Instruction::Shl:
2419 if (match(BO.getOperand(0), m_APInt(C))) {
2420 if (BO.hasNoUnsignedWrap()) {
2421 // 'shl nuw C, x' produces [C, C << CLZ(C)]
2423 Upper = Lower.shl(Lower.countLeadingZeros()) + 1;
2424 } else if (BO.hasNoSignedWrap()) { // TODO: What if both nuw+nsw?
2425 if (C->isNegative()) {
2426 // 'shl nsw C, x' produces [C << CLO(C)-1, C]
2427 unsigned ShiftAmount = C->countLeadingOnes() - 1;
2428 Lower = C->shl(ShiftAmount);
2431 // 'shl nsw C, x' produces [C, C << CLZ(C)-1]
2432 unsigned ShiftAmount = C->countLeadingZeros() - 1;
2434 Upper = C->shl(ShiftAmount) + 1;
2440 case Instruction::SDiv:
2441 if (match(BO.getOperand(1), m_APInt(C))) {
2442 APInt IntMin = APInt::getSignedMinValue(Width);
2443 APInt IntMax = APInt::getSignedMaxValue(Width);
2444 if (C->isAllOnesValue()) {
2445 // 'sdiv x, -1' produces [INT_MIN + 1, INT_MAX]
2446 // where C != -1 and C != 0 and C != 1
2449 } else if (C->countLeadingZeros() < Width - 1) {
2450 // 'sdiv x, C' produces [INT_MIN / C, INT_MAX / C]
2451 // where C != -1 and C != 0 and C != 1
2452 Lower = IntMin.sdiv(*C);
2453 Upper = IntMax.sdiv(*C);
2454 if (Lower.sgt(Upper))
2455 std::swap(Lower, Upper);
2457 assert(Upper != Lower && "Upper part of range has wrapped!");
2459 } else if (match(BO.getOperand(0), m_APInt(C))) {
2460 if (C->isMinSignedValue()) {
2461 // 'sdiv INT_MIN, x' produces [INT_MIN, INT_MIN / -2].
2463 Upper = Lower.lshr(1) + 1;
2465 // 'sdiv C, x' produces [-|C|, |C|].
2466 Upper = C->abs() + 1;
2467 Lower = (-Upper) + 1;
2472 case Instruction::UDiv:
2473 if (match(BO.getOperand(1), m_APInt(C)) && *C != 0) {
2474 // 'udiv x, C' produces [0, UINT_MAX / C].
2475 Upper = APInt::getMaxValue(Width).udiv(*C) + 1;
2476 } else if (match(BO.getOperand(0), m_APInt(C))) {
2477 // 'udiv C, x' produces [0, C].
2482 case Instruction::SRem:
2483 if (match(BO.getOperand(1), m_APInt(C))) {
2484 // 'srem x, C' produces (-|C|, |C|).
2486 Lower = (-Upper) + 1;
2490 case Instruction::URem:
2491 if (match(BO.getOperand(1), m_APInt(C)))
2492 // 'urem x, C' produces [0, C).
2501 static Value *simplifyICmpWithConstant(CmpInst::Predicate Pred, Value *LHS,
2504 if (!match(RHS, m_APInt(C)))
2507 // Rule out tautological comparisons (eg., ult 0 or uge 0).
2508 ConstantRange RHS_CR = ConstantRange::makeExactICmpRegion(Pred, *C);
2509 if (RHS_CR.isEmptySet())
2510 return ConstantInt::getFalse(GetCompareTy(RHS));
2511 if (RHS_CR.isFullSet())
2512 return ConstantInt::getTrue(GetCompareTy(RHS));
2514 // Find the range of possible values for binary operators.
2515 unsigned Width = C->getBitWidth();
2516 APInt Lower = APInt(Width, 0);
2517 APInt Upper = APInt(Width, 0);
2518 if (auto *BO = dyn_cast<BinaryOperator>(LHS))
2519 setLimitsForBinOp(*BO, Lower, Upper);
2521 ConstantRange LHS_CR =
2522 Lower != Upper ? ConstantRange(Lower, Upper) : ConstantRange(Width, true);
2524 if (auto *I = dyn_cast<Instruction>(LHS))
2525 if (auto *Ranges = I->getMetadata(LLVMContext::MD_range))
2526 LHS_CR = LHS_CR.intersectWith(getConstantRangeFromMetadata(*Ranges));
2528 if (!LHS_CR.isFullSet()) {
2529 if (RHS_CR.contains(LHS_CR))
2530 return ConstantInt::getTrue(GetCompareTy(RHS));
2531 if (RHS_CR.inverse().contains(LHS_CR))
2532 return ConstantInt::getFalse(GetCompareTy(RHS));
2538 static Value *simplifyICmpWithBinOp(CmpInst::Predicate Pred, Value *LHS,
2539 Value *RHS, const SimplifyQuery &Q,
2540 unsigned MaxRecurse) {
2541 Type *ITy = GetCompareTy(LHS); // The return type.
2543 BinaryOperator *LBO = dyn_cast<BinaryOperator>(LHS);
2544 BinaryOperator *RBO = dyn_cast<BinaryOperator>(RHS);
2545 if (MaxRecurse && (LBO || RBO)) {
2546 // Analyze the case when either LHS or RHS is an add instruction.
2547 Value *A = nullptr, *B = nullptr, *C = nullptr, *D = nullptr;
2548 // LHS = A + B (or A and B are null); RHS = C + D (or C and D are null).
2549 bool NoLHSWrapProblem = false, NoRHSWrapProblem = false;
2550 if (LBO && LBO->getOpcode() == Instruction::Add) {
2551 A = LBO->getOperand(0);
2552 B = LBO->getOperand(1);
2554 ICmpInst::isEquality(Pred) ||
2555 (CmpInst::isUnsigned(Pred) && LBO->hasNoUnsignedWrap()) ||
2556 (CmpInst::isSigned(Pred) && LBO->hasNoSignedWrap());
2558 if (RBO && RBO->getOpcode() == Instruction::Add) {
2559 C = RBO->getOperand(0);
2560 D = RBO->getOperand(1);
2562 ICmpInst::isEquality(Pred) ||
2563 (CmpInst::isUnsigned(Pred) && RBO->hasNoUnsignedWrap()) ||
2564 (CmpInst::isSigned(Pred) && RBO->hasNoSignedWrap());
2567 // icmp (X+Y), X -> icmp Y, 0 for equalities or if there is no overflow.
2568 if ((A == RHS || B == RHS) && NoLHSWrapProblem)
2569 if (Value *V = SimplifyICmpInst(Pred, A == RHS ? B : A,
2570 Constant::getNullValue(RHS->getType()), Q,
2574 // icmp X, (X+Y) -> icmp 0, Y for equalities or if there is no overflow.
2575 if ((C == LHS || D == LHS) && NoRHSWrapProblem)
2577 SimplifyICmpInst(Pred, Constant::getNullValue(LHS->getType()),
2578 C == LHS ? D : C, Q, MaxRecurse - 1))
2581 // icmp (X+Y), (X+Z) -> icmp Y,Z for equalities or if there is no overflow.
2582 if (A && C && (A == C || A == D || B == C || B == D) && NoLHSWrapProblem &&
2584 // Determine Y and Z in the form icmp (X+Y), (X+Z).
2587 // C + B == C + D -> B == D
2590 } else if (A == D) {
2591 // D + B == C + D -> B == C
2594 } else if (B == C) {
2595 // A + C == C + D -> A == D
2600 // A + D == C + D -> A == C
2604 if (Value *V = SimplifyICmpInst(Pred, Y, Z, Q, MaxRecurse - 1))
2611 // icmp pred (or X, Y), X
2612 if (LBO && match(LBO, m_c_Or(m_Value(Y), m_Specific(RHS)))) {
2613 if (Pred == ICmpInst::ICMP_ULT)
2614 return getFalse(ITy);
2615 if (Pred == ICmpInst::ICMP_UGE)
2616 return getTrue(ITy);
2618 if (Pred == ICmpInst::ICMP_SLT || Pred == ICmpInst::ICMP_SGE) {
2619 bool RHSKnownNonNegative, RHSKnownNegative;
2620 bool YKnownNonNegative, YKnownNegative;
2621 ComputeSignBit(RHS, RHSKnownNonNegative, RHSKnownNegative, Q.DL, 0,
2622 Q.AC, Q.CxtI, Q.DT);
2623 ComputeSignBit(Y, YKnownNonNegative, YKnownNegative, Q.DL, 0, Q.AC,
2625 if (RHSKnownNonNegative && YKnownNegative)
2626 return Pred == ICmpInst::ICMP_SLT ? getTrue(ITy) : getFalse(ITy);
2627 if (RHSKnownNegative || YKnownNonNegative)
2628 return Pred == ICmpInst::ICMP_SLT ? getFalse(ITy) : getTrue(ITy);
2631 // icmp pred X, (or X, Y)
2632 if (RBO && match(RBO, m_c_Or(m_Value(Y), m_Specific(LHS)))) {
2633 if (Pred == ICmpInst::ICMP_ULE)
2634 return getTrue(ITy);
2635 if (Pred == ICmpInst::ICMP_UGT)
2636 return getFalse(ITy);
2638 if (Pred == ICmpInst::ICMP_SGT || Pred == ICmpInst::ICMP_SLE) {
2639 bool LHSKnownNonNegative, LHSKnownNegative;
2640 bool YKnownNonNegative, YKnownNegative;
2641 ComputeSignBit(LHS, LHSKnownNonNegative, LHSKnownNegative, Q.DL, 0,
2642 Q.AC, Q.CxtI, Q.DT);
2643 ComputeSignBit(Y, YKnownNonNegative, YKnownNegative, Q.DL, 0, Q.AC,
2645 if (LHSKnownNonNegative && YKnownNegative)
2646 return Pred == ICmpInst::ICMP_SGT ? getTrue(ITy) : getFalse(ITy);
2647 if (LHSKnownNegative || YKnownNonNegative)
2648 return Pred == ICmpInst::ICMP_SGT ? getFalse(ITy) : getTrue(ITy);
2653 // icmp pred (and X, Y), X
2654 if (LBO && match(LBO, m_CombineOr(m_And(m_Value(), m_Specific(RHS)),
2655 m_And(m_Specific(RHS), m_Value())))) {
2656 if (Pred == ICmpInst::ICMP_UGT)
2657 return getFalse(ITy);
2658 if (Pred == ICmpInst::ICMP_ULE)
2659 return getTrue(ITy);
2661 // icmp pred X, (and X, Y)
2662 if (RBO && match(RBO, m_CombineOr(m_And(m_Value(), m_Specific(LHS)),
2663 m_And(m_Specific(LHS), m_Value())))) {
2664 if (Pred == ICmpInst::ICMP_UGE)
2665 return getTrue(ITy);
2666 if (Pred == ICmpInst::ICMP_ULT)
2667 return getFalse(ITy);
2670 // 0 - (zext X) pred C
2671 if (!CmpInst::isUnsigned(Pred) && match(LHS, m_Neg(m_ZExt(m_Value())))) {
2672 if (ConstantInt *RHSC = dyn_cast<ConstantInt>(RHS)) {
2673 if (RHSC->getValue().isStrictlyPositive()) {
2674 if (Pred == ICmpInst::ICMP_SLT)
2675 return ConstantInt::getTrue(RHSC->getContext());
2676 if (Pred == ICmpInst::ICMP_SGE)
2677 return ConstantInt::getFalse(RHSC->getContext());
2678 if (Pred == ICmpInst::ICMP_EQ)
2679 return ConstantInt::getFalse(RHSC->getContext());
2680 if (Pred == ICmpInst::ICMP_NE)
2681 return ConstantInt::getTrue(RHSC->getContext());
2683 if (RHSC->getValue().isNonNegative()) {
2684 if (Pred == ICmpInst::ICMP_SLE)
2685 return ConstantInt::getTrue(RHSC->getContext());
2686 if (Pred == ICmpInst::ICMP_SGT)
2687 return ConstantInt::getFalse(RHSC->getContext());
2692 // icmp pred (urem X, Y), Y
2693 if (LBO && match(LBO, m_URem(m_Value(), m_Specific(RHS)))) {
2694 bool KnownNonNegative, KnownNegative;
2698 case ICmpInst::ICMP_SGT:
2699 case ICmpInst::ICMP_SGE:
2700 ComputeSignBit(RHS, KnownNonNegative, KnownNegative, Q.DL, 0, Q.AC,
2702 if (!KnownNonNegative)
2705 case ICmpInst::ICMP_EQ:
2706 case ICmpInst::ICMP_UGT:
2707 case ICmpInst::ICMP_UGE:
2708 return getFalse(ITy);
2709 case ICmpInst::ICMP_SLT:
2710 case ICmpInst::ICMP_SLE:
2711 ComputeSignBit(RHS, KnownNonNegative, KnownNegative, Q.DL, 0, Q.AC,
2713 if (!KnownNonNegative)
2716 case ICmpInst::ICMP_NE:
2717 case ICmpInst::ICMP_ULT:
2718 case ICmpInst::ICMP_ULE:
2719 return getTrue(ITy);
2723 // icmp pred X, (urem Y, X)
2724 if (RBO && match(RBO, m_URem(m_Value(), m_Specific(LHS)))) {
2725 bool KnownNonNegative, KnownNegative;
2729 case ICmpInst::ICMP_SGT:
2730 case ICmpInst::ICMP_SGE:
2731 ComputeSignBit(LHS, KnownNonNegative, KnownNegative, Q.DL, 0, Q.AC,
2733 if (!KnownNonNegative)
2736 case ICmpInst::ICMP_NE:
2737 case ICmpInst::ICMP_UGT:
2738 case ICmpInst::ICMP_UGE:
2739 return getTrue(ITy);
2740 case ICmpInst::ICMP_SLT:
2741 case ICmpInst::ICMP_SLE:
2742 ComputeSignBit(LHS, KnownNonNegative, KnownNegative, Q.DL, 0, Q.AC,
2744 if (!KnownNonNegative)
2747 case ICmpInst::ICMP_EQ:
2748 case ICmpInst::ICMP_ULT:
2749 case ICmpInst::ICMP_ULE:
2750 return getFalse(ITy);
2756 if (LBO && (match(LBO, m_LShr(m_Specific(RHS), m_Value())) ||
2757 match(LBO, m_UDiv(m_Specific(RHS), m_Value())))) {
2758 // icmp pred (X op Y), X
2759 if (Pred == ICmpInst::ICMP_UGT)
2760 return getFalse(ITy);
2761 if (Pred == ICmpInst::ICMP_ULE)
2762 return getTrue(ITy);
2767 if (RBO && (match(RBO, m_LShr(m_Specific(LHS), m_Value())) ||
2768 match(RBO, m_UDiv(m_Specific(LHS), m_Value())))) {
2769 // icmp pred X, (X op Y)
2770 if (Pred == ICmpInst::ICMP_ULT)
2771 return getFalse(ITy);
2772 if (Pred == ICmpInst::ICMP_UGE)
2773 return getTrue(ITy);
2780 // where CI2 is a power of 2 and CI isn't
2781 if (auto *CI = dyn_cast<ConstantInt>(RHS)) {
2782 const APInt *CI2Val, *CIVal = &CI->getValue();
2783 if (LBO && match(LBO, m_Shl(m_APInt(CI2Val), m_Value())) &&
2784 CI2Val->isPowerOf2()) {
2785 if (!CIVal->isPowerOf2()) {
2786 // CI2 << X can equal zero in some circumstances,
2787 // this simplification is unsafe if CI is zero.
2789 // We know it is safe if:
2790 // - The shift is nsw, we can't shift out the one bit.
2791 // - The shift is nuw, we can't shift out the one bit.
2794 if (LBO->hasNoSignedWrap() || LBO->hasNoUnsignedWrap() ||
2795 *CI2Val == 1 || !CI->isZero()) {
2796 if (Pred == ICmpInst::ICMP_EQ)
2797 return ConstantInt::getFalse(RHS->getContext());
2798 if (Pred == ICmpInst::ICMP_NE)
2799 return ConstantInt::getTrue(RHS->getContext());
2802 if (CIVal->isSignMask() && *CI2Val == 1) {
2803 if (Pred == ICmpInst::ICMP_UGT)
2804 return ConstantInt::getFalse(RHS->getContext());
2805 if (Pred == ICmpInst::ICMP_ULE)
2806 return ConstantInt::getTrue(RHS->getContext());
2811 if (MaxRecurse && LBO && RBO && LBO->getOpcode() == RBO->getOpcode() &&
2812 LBO->getOperand(1) == RBO->getOperand(1)) {
2813 switch (LBO->getOpcode()) {
2816 case Instruction::UDiv:
2817 case Instruction::LShr:
2818 if (ICmpInst::isSigned(Pred))
2821 case Instruction::SDiv:
2822 case Instruction::AShr:
2823 if (!LBO->isExact() || !RBO->isExact())
2825 if (Value *V = SimplifyICmpInst(Pred, LBO->getOperand(0),
2826 RBO->getOperand(0), Q, MaxRecurse - 1))
2829 case Instruction::Shl: {
2830 bool NUW = LBO->hasNoUnsignedWrap() && RBO->hasNoUnsignedWrap();
2831 bool NSW = LBO->hasNoSignedWrap() && RBO->hasNoSignedWrap();
2834 if (!NSW && ICmpInst::isSigned(Pred))
2836 if (Value *V = SimplifyICmpInst(Pred, LBO->getOperand(0),
2837 RBO->getOperand(0), Q, MaxRecurse - 1))
2846 /// Simplify integer comparisons where at least one operand of the compare
2847 /// matches an integer min/max idiom.
2848 static Value *simplifyICmpWithMinMax(CmpInst::Predicate Pred, Value *LHS,
2849 Value *RHS, const SimplifyQuery &Q,
2850 unsigned MaxRecurse) {
2851 Type *ITy = GetCompareTy(LHS); // The return type.
2853 CmpInst::Predicate P = CmpInst::BAD_ICMP_PREDICATE;
2854 CmpInst::Predicate EqP; // Chosen so that "A == max/min(A,B)" iff "A EqP B".
2856 // Signed variants on "max(a,b)>=a -> true".
2857 if (match(LHS, m_SMax(m_Value(A), m_Value(B))) && (A == RHS || B == RHS)) {
2859 std::swap(A, B); // smax(A, B) pred A.
2860 EqP = CmpInst::ICMP_SGE; // "A == smax(A, B)" iff "A sge B".
2861 // We analyze this as smax(A, B) pred A.
2863 } else if (match(RHS, m_SMax(m_Value(A), m_Value(B))) &&
2864 (A == LHS || B == LHS)) {
2866 std::swap(A, B); // A pred smax(A, B).
2867 EqP = CmpInst::ICMP_SGE; // "A == smax(A, B)" iff "A sge B".
2868 // We analyze this as smax(A, B) swapped-pred A.
2869 P = CmpInst::getSwappedPredicate(Pred);
2870 } else if (match(LHS, m_SMin(m_Value(A), m_Value(B))) &&
2871 (A == RHS || B == RHS)) {
2873 std::swap(A, B); // smin(A, B) pred A.
2874 EqP = CmpInst::ICMP_SLE; // "A == smin(A, B)" iff "A sle B".
2875 // We analyze this as smax(-A, -B) swapped-pred -A.
2876 // Note that we do not need to actually form -A or -B thanks to EqP.
2877 P = CmpInst::getSwappedPredicate(Pred);
2878 } else if (match(RHS, m_SMin(m_Value(A), m_Value(B))) &&
2879 (A == LHS || B == LHS)) {
2881 std::swap(A, B); // A pred smin(A, B).
2882 EqP = CmpInst::ICMP_SLE; // "A == smin(A, B)" iff "A sle B".
2883 // We analyze this as smax(-A, -B) pred -A.
2884 // Note that we do not need to actually form -A or -B thanks to EqP.
2887 if (P != CmpInst::BAD_ICMP_PREDICATE) {
2888 // Cases correspond to "max(A, B) p A".
2892 case CmpInst::ICMP_EQ:
2893 case CmpInst::ICMP_SLE:
2894 // Equivalent to "A EqP B". This may be the same as the condition tested
2895 // in the max/min; if so, we can just return that.
2896 if (Value *V = ExtractEquivalentCondition(LHS, EqP, A, B))
2898 if (Value *V = ExtractEquivalentCondition(RHS, EqP, A, B))
2900 // Otherwise, see if "A EqP B" simplifies.
2902 if (Value *V = SimplifyICmpInst(EqP, A, B, Q, MaxRecurse - 1))
2905 case CmpInst::ICMP_NE:
2906 case CmpInst::ICMP_SGT: {
2907 CmpInst::Predicate InvEqP = CmpInst::getInversePredicate(EqP);
2908 // Equivalent to "A InvEqP B". This may be the same as the condition
2909 // tested in the max/min; if so, we can just return that.
2910 if (Value *V = ExtractEquivalentCondition(LHS, InvEqP, A, B))
2912 if (Value *V = ExtractEquivalentCondition(RHS, InvEqP, A, B))
2914 // Otherwise, see if "A InvEqP B" simplifies.
2916 if (Value *V = SimplifyICmpInst(InvEqP, A, B, Q, MaxRecurse - 1))
2920 case CmpInst::ICMP_SGE:
2922 return getTrue(ITy);
2923 case CmpInst::ICMP_SLT:
2925 return getFalse(ITy);
2929 // Unsigned variants on "max(a,b)>=a -> true".
2930 P = CmpInst::BAD_ICMP_PREDICATE;
2931 if (match(LHS, m_UMax(m_Value(A), m_Value(B))) && (A == RHS || B == RHS)) {
2933 std::swap(A, B); // umax(A, B) pred A.
2934 EqP = CmpInst::ICMP_UGE; // "A == umax(A, B)" iff "A uge B".
2935 // We analyze this as umax(A, B) pred A.
2937 } else if (match(RHS, m_UMax(m_Value(A), m_Value(B))) &&
2938 (A == LHS || B == LHS)) {
2940 std::swap(A, B); // A pred umax(A, B).
2941 EqP = CmpInst::ICMP_UGE; // "A == umax(A, B)" iff "A uge B".
2942 // We analyze this as umax(A, B) swapped-pred A.
2943 P = CmpInst::getSwappedPredicate(Pred);
2944 } else if (match(LHS, m_UMin(m_Value(A), m_Value(B))) &&
2945 (A == RHS || B == RHS)) {
2947 std::swap(A, B); // umin(A, B) pred A.
2948 EqP = CmpInst::ICMP_ULE; // "A == umin(A, B)" iff "A ule B".
2949 // We analyze this as umax(-A, -B) swapped-pred -A.
2950 // Note that we do not need to actually form -A or -B thanks to EqP.
2951 P = CmpInst::getSwappedPredicate(Pred);
2952 } else if (match(RHS, m_UMin(m_Value(A), m_Value(B))) &&
2953 (A == LHS || B == LHS)) {
2955 std::swap(A, B); // A pred umin(A, B).
2956 EqP = CmpInst::ICMP_ULE; // "A == umin(A, B)" iff "A ule B".
2957 // We analyze this as umax(-A, -B) pred -A.
2958 // Note that we do not need to actually form -A or -B thanks to EqP.
2961 if (P != CmpInst::BAD_ICMP_PREDICATE) {
2962 // Cases correspond to "max(A, B) p A".
2966 case CmpInst::ICMP_EQ:
2967 case CmpInst::ICMP_ULE:
2968 // Equivalent to "A EqP B". This may be the same as the condition tested
2969 // in the max/min; if so, we can just return that.
2970 if (Value *V = ExtractEquivalentCondition(LHS, EqP, A, B))
2972 if (Value *V = ExtractEquivalentCondition(RHS, EqP, A, B))
2974 // Otherwise, see if "A EqP B" simplifies.
2976 if (Value *V = SimplifyICmpInst(EqP, A, B, Q, MaxRecurse - 1))
2979 case CmpInst::ICMP_NE:
2980 case CmpInst::ICMP_UGT: {
2981 CmpInst::Predicate InvEqP = CmpInst::getInversePredicate(EqP);
2982 // Equivalent to "A InvEqP B". This may be the same as the condition
2983 // tested in the max/min; if so, we can just return that.
2984 if (Value *V = ExtractEquivalentCondition(LHS, InvEqP, A, B))
2986 if (Value *V = ExtractEquivalentCondition(RHS, InvEqP, A, B))
2988 // Otherwise, see if "A InvEqP B" simplifies.
2990 if (Value *V = SimplifyICmpInst(InvEqP, A, B, Q, MaxRecurse - 1))
2994 case CmpInst::ICMP_UGE:
2996 return getTrue(ITy);
2997 case CmpInst::ICMP_ULT:
2999 return getFalse(ITy);
3003 // Variants on "max(x,y) >= min(x,z)".
3005 if (match(LHS, m_SMax(m_Value(A), m_Value(B))) &&
3006 match(RHS, m_SMin(m_Value(C), m_Value(D))) &&
3007 (A == C || A == D || B == C || B == D)) {
3008 // max(x, ?) pred min(x, ?).
3009 if (Pred == CmpInst::ICMP_SGE)
3011 return getTrue(ITy);
3012 if (Pred == CmpInst::ICMP_SLT)
3014 return getFalse(ITy);
3015 } else if (match(LHS, m_SMin(m_Value(A), m_Value(B))) &&
3016 match(RHS, m_SMax(m_Value(C), m_Value(D))) &&
3017 (A == C || A == D || B == C || B == D)) {
3018 // min(x, ?) pred max(x, ?).
3019 if (Pred == CmpInst::ICMP_SLE)
3021 return getTrue(ITy);
3022 if (Pred == CmpInst::ICMP_SGT)
3024 return getFalse(ITy);
3025 } else if (match(LHS, m_UMax(m_Value(A), m_Value(B))) &&
3026 match(RHS, m_UMin(m_Value(C), m_Value(D))) &&
3027 (A == C || A == D || B == C || B == D)) {
3028 // max(x, ?) pred min(x, ?).
3029 if (Pred == CmpInst::ICMP_UGE)
3031 return getTrue(ITy);
3032 if (Pred == CmpInst::ICMP_ULT)
3034 return getFalse(ITy);
3035 } else if (match(LHS, m_UMin(m_Value(A), m_Value(B))) &&
3036 match(RHS, m_UMax(m_Value(C), m_Value(D))) &&
3037 (A == C || A == D || B == C || B == D)) {
3038 // min(x, ?) pred max(x, ?).
3039 if (Pred == CmpInst::ICMP_ULE)
3041 return getTrue(ITy);
3042 if (Pred == CmpInst::ICMP_UGT)
3044 return getFalse(ITy);
3050 /// Given operands for an ICmpInst, see if we can fold the result.
3051 /// If not, this returns null.
3052 static Value *SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS,
3053 const SimplifyQuery &Q, unsigned MaxRecurse) {
3054 CmpInst::Predicate Pred = (CmpInst::Predicate)Predicate;
3055 assert(CmpInst::isIntPredicate(Pred) && "Not an integer compare!");
3057 if (Constant *CLHS = dyn_cast<Constant>(LHS)) {
3058 if (Constant *CRHS = dyn_cast<Constant>(RHS))
3059 return ConstantFoldCompareInstOperands(Pred, CLHS, CRHS, Q.DL, Q.TLI);
3061 // If we have a constant, make sure it is on the RHS.
3062 std::swap(LHS, RHS);
3063 Pred = CmpInst::getSwappedPredicate(Pred);
3066 Type *ITy = GetCompareTy(LHS); // The return type.
3068 // icmp X, X -> true/false
3069 // X icmp undef -> true/false. For example, icmp ugt %X, undef -> false
3070 // because X could be 0.
3071 if (LHS == RHS || isa<UndefValue>(RHS))
3072 return ConstantInt::get(ITy, CmpInst::isTrueWhenEqual(Pred));
3074 if (Value *V = simplifyICmpOfBools(Pred, LHS, RHS, Q))
3077 if (Value *V = simplifyICmpWithZero(Pred, LHS, RHS, Q))
3080 if (Value *V = simplifyICmpWithConstant(Pred, LHS, RHS))
3083 // If both operands have range metadata, use the metadata
3084 // to simplify the comparison.
3085 if (isa<Instruction>(RHS) && isa<Instruction>(LHS)) {
3086 auto RHS_Instr = cast<Instruction>(RHS);
3087 auto LHS_Instr = cast<Instruction>(LHS);
3089 if (RHS_Instr->getMetadata(LLVMContext::MD_range) &&
3090 LHS_Instr->getMetadata(LLVMContext::MD_range)) {
3091 auto RHS_CR = getConstantRangeFromMetadata(
3092 *RHS_Instr->getMetadata(LLVMContext::MD_range));
3093 auto LHS_CR = getConstantRangeFromMetadata(
3094 *LHS_Instr->getMetadata(LLVMContext::MD_range));
3096 auto Satisfied_CR = ConstantRange::makeSatisfyingICmpRegion(Pred, RHS_CR);
3097 if (Satisfied_CR.contains(LHS_CR))
3098 return ConstantInt::getTrue(RHS->getContext());
3100 auto InversedSatisfied_CR = ConstantRange::makeSatisfyingICmpRegion(
3101 CmpInst::getInversePredicate(Pred), RHS_CR);
3102 if (InversedSatisfied_CR.contains(LHS_CR))
3103 return ConstantInt::getFalse(RHS->getContext());
3107 // Compare of cast, for example (zext X) != 0 -> X != 0
3108 if (isa<CastInst>(LHS) && (isa<Constant>(RHS) || isa<CastInst>(RHS))) {
3109 Instruction *LI = cast<CastInst>(LHS);
3110 Value *SrcOp = LI->getOperand(0);
3111 Type *SrcTy = SrcOp->getType();
3112 Type *DstTy = LI->getType();
3114 // Turn icmp (ptrtoint x), (ptrtoint/constant) into a compare of the input
3115 // if the integer type is the same size as the pointer type.
3116 if (MaxRecurse && isa<PtrToIntInst>(LI) &&
3117 Q.DL.getTypeSizeInBits(SrcTy) == DstTy->getPrimitiveSizeInBits()) {
3118 if (Constant *RHSC = dyn_cast<Constant>(RHS)) {
3119 // Transfer the cast to the constant.
3120 if (Value *V = SimplifyICmpInst(Pred, SrcOp,
3121 ConstantExpr::getIntToPtr(RHSC, SrcTy),
3124 } else if (PtrToIntInst *RI = dyn_cast<PtrToIntInst>(RHS)) {
3125 if (RI->getOperand(0)->getType() == SrcTy)
3126 // Compare without the cast.
3127 if (Value *V = SimplifyICmpInst(Pred, SrcOp, RI->getOperand(0),
3133 if (isa<ZExtInst>(LHS)) {
3134 // Turn icmp (zext X), (zext Y) into a compare of X and Y if they have the
3136 if (ZExtInst *RI = dyn_cast<ZExtInst>(RHS)) {
3137 if (MaxRecurse && SrcTy == RI->getOperand(0)->getType())
3138 // Compare X and Y. Note that signed predicates become unsigned.
3139 if (Value *V = SimplifyICmpInst(ICmpInst::getUnsignedPredicate(Pred),
3140 SrcOp, RI->getOperand(0), Q,
3144 // Turn icmp (zext X), Cst into a compare of X and Cst if Cst is extended
3145 // too. If not, then try to deduce the result of the comparison.
3146 else if (ConstantInt *CI = dyn_cast<ConstantInt>(RHS)) {
3147 // Compute the constant that would happen if we truncated to SrcTy then
3148 // reextended to DstTy.
3149 Constant *Trunc = ConstantExpr::getTrunc(CI, SrcTy);
3150 Constant *RExt = ConstantExpr::getCast(CastInst::ZExt, Trunc, DstTy);
3152 // If the re-extended constant didn't change then this is effectively
3153 // also a case of comparing two zero-extended values.
3154 if (RExt == CI && MaxRecurse)
3155 if (Value *V = SimplifyICmpInst(ICmpInst::getUnsignedPredicate(Pred),
3156 SrcOp, Trunc, Q, MaxRecurse-1))
3159 // Otherwise the upper bits of LHS are zero while RHS has a non-zero bit
3160 // there. Use this to work out the result of the comparison.
3163 default: llvm_unreachable("Unknown ICmp predicate!");
3165 case ICmpInst::ICMP_EQ:
3166 case ICmpInst::ICMP_UGT:
3167 case ICmpInst::ICMP_UGE:
3168 return ConstantInt::getFalse(CI->getContext());
3170 case ICmpInst::ICMP_NE:
3171 case ICmpInst::ICMP_ULT:
3172 case ICmpInst::ICMP_ULE:
3173 return ConstantInt::getTrue(CI->getContext());
3175 // LHS is non-negative. If RHS is negative then LHS >s LHS. If RHS
3176 // is non-negative then LHS <s RHS.
3177 case ICmpInst::ICMP_SGT:
3178 case ICmpInst::ICMP_SGE:
3179 return CI->getValue().isNegative() ?
3180 ConstantInt::getTrue(CI->getContext()) :
3181 ConstantInt::getFalse(CI->getContext());
3183 case ICmpInst::ICMP_SLT:
3184 case ICmpInst::ICMP_SLE:
3185 return CI->getValue().isNegative() ?
3186 ConstantInt::getFalse(CI->getContext()) :
3187 ConstantInt::getTrue(CI->getContext());
3193 if (isa<SExtInst>(LHS)) {
3194 // Turn icmp (sext X), (sext Y) into a compare of X and Y if they have the
3196 if (SExtInst *RI = dyn_cast<SExtInst>(RHS)) {
3197 if (MaxRecurse && SrcTy == RI->getOperand(0)->getType())
3198 // Compare X and Y. Note that the predicate does not change.
3199 if (Value *V = SimplifyICmpInst(Pred, SrcOp, RI->getOperand(0),
3203 // Turn icmp (sext X), Cst into a compare of X and Cst if Cst is extended
3204 // too. If not, then try to deduce the result of the comparison.
3205 else if (ConstantInt *CI = dyn_cast<ConstantInt>(RHS)) {
3206 // Compute the constant that would happen if we truncated to SrcTy then
3207 // reextended to DstTy.
3208 Constant *Trunc = ConstantExpr::getTrunc(CI, SrcTy);
3209 Constant *RExt = ConstantExpr::getCast(CastInst::SExt, Trunc, DstTy);
3211 // If the re-extended constant didn't change then this is effectively
3212 // also a case of comparing two sign-extended values.
3213 if (RExt == CI && MaxRecurse)
3214 if (Value *V = SimplifyICmpInst(Pred, SrcOp, Trunc, Q, MaxRecurse-1))
3217 // Otherwise the upper bits of LHS are all equal, while RHS has varying
3218 // bits there. Use this to work out the result of the comparison.
3221 default: llvm_unreachable("Unknown ICmp predicate!");
3222 case ICmpInst::ICMP_EQ:
3223 return ConstantInt::getFalse(CI->getContext());
3224 case ICmpInst::ICMP_NE:
3225 return ConstantInt::getTrue(CI->getContext());
3227 // If RHS is non-negative then LHS <s RHS. If RHS is negative then
3229 case ICmpInst::ICMP_SGT:
3230 case ICmpInst::ICMP_SGE:
3231 return CI->getValue().isNegative() ?
3232 ConstantInt::getTrue(CI->getContext()) :
3233 ConstantInt::getFalse(CI->getContext());
3234 case ICmpInst::ICMP_SLT:
3235 case ICmpInst::ICMP_SLE:
3236 return CI->getValue().isNegative() ?
3237 ConstantInt::getFalse(CI->getContext()) :
3238 ConstantInt::getTrue(CI->getContext());
3240 // If LHS is non-negative then LHS <u RHS. If LHS is negative then
3242 case ICmpInst::ICMP_UGT:
3243 case ICmpInst::ICMP_UGE:
3244 // Comparison is true iff the LHS <s 0.
3246 if (Value *V = SimplifyICmpInst(ICmpInst::ICMP_SLT, SrcOp,
3247 Constant::getNullValue(SrcTy),
3251 case ICmpInst::ICMP_ULT:
3252 case ICmpInst::ICMP_ULE:
3253 // Comparison is true iff the LHS >=s 0.
3255 if (Value *V = SimplifyICmpInst(ICmpInst::ICMP_SGE, SrcOp,
3256 Constant::getNullValue(SrcTy),
3266 // icmp eq|ne X, Y -> false|true if X != Y
3267 if ((Pred == ICmpInst::ICMP_EQ || Pred == ICmpInst::ICMP_NE) &&
3268 isKnownNonEqual(LHS, RHS, Q.DL, Q.AC, Q.CxtI, Q.DT)) {
3269 LLVMContext &Ctx = LHS->getType()->getContext();
3270 return Pred == ICmpInst::ICMP_NE ?
3271 ConstantInt::getTrue(Ctx) : ConstantInt::getFalse(Ctx);
3274 if (Value *V = simplifyICmpWithBinOp(Pred, LHS, RHS, Q, MaxRecurse))
3277 if (Value *V = simplifyICmpWithMinMax(Pred, LHS, RHS, Q, MaxRecurse))
3280 // Simplify comparisons of related pointers using a powerful, recursive
3281 // GEP-walk when we have target data available..
3282 if (LHS->getType()->isPointerTy())
3283 if (auto *C = computePointerICmp(Q.DL, Q.TLI, Q.DT, Pred, Q.CxtI, LHS, RHS))
3285 if (auto *CLHS = dyn_cast<PtrToIntOperator>(LHS))
3286 if (auto *CRHS = dyn_cast<PtrToIntOperator>(RHS))
3287 if (Q.DL.getTypeSizeInBits(CLHS->getPointerOperandType()) ==
3288 Q.DL.getTypeSizeInBits(CLHS->getType()) &&
3289 Q.DL.getTypeSizeInBits(CRHS->getPointerOperandType()) ==
3290 Q.DL.getTypeSizeInBits(CRHS->getType()))
3291 if (auto *C = computePointerICmp(Q.DL, Q.TLI, Q.DT, Pred, Q.CxtI,
3292 CLHS->getPointerOperand(),
3293 CRHS->getPointerOperand()))
3296 if (GetElementPtrInst *GLHS = dyn_cast<GetElementPtrInst>(LHS)) {
3297 if (GEPOperator *GRHS = dyn_cast<GEPOperator>(RHS)) {
3298 if (GLHS->getPointerOperand() == GRHS->getPointerOperand() &&
3299 GLHS->hasAllConstantIndices() && GRHS->hasAllConstantIndices() &&
3300 (ICmpInst::isEquality(Pred) ||
3301 (GLHS->isInBounds() && GRHS->isInBounds() &&
3302 Pred == ICmpInst::getSignedPredicate(Pred)))) {
3303 // The bases are equal and the indices are constant. Build a constant
3304 // expression GEP with the same indices and a null base pointer to see
3305 // what constant folding can make out of it.
3306 Constant *Null = Constant::getNullValue(GLHS->getPointerOperandType());
3307 SmallVector<Value *, 4> IndicesLHS(GLHS->idx_begin(), GLHS->idx_end());
3308 Constant *NewLHS = ConstantExpr::getGetElementPtr(
3309 GLHS->getSourceElementType(), Null, IndicesLHS);
3311 SmallVector<Value *, 4> IndicesRHS(GRHS->idx_begin(), GRHS->idx_end());
3312 Constant *NewRHS = ConstantExpr::getGetElementPtr(
3313 GLHS->getSourceElementType(), Null, IndicesRHS);
3314 return ConstantExpr::getICmp(Pred, NewLHS, NewRHS);
3319 // If a bit is known to be zero for A and known to be one for B,
3320 // then A and B cannot be equal.
3321 if (ICmpInst::isEquality(Pred)) {
3322 const APInt *RHSVal;
3323 if (match(RHS, m_APInt(RHSVal))) {
3324 unsigned BitWidth = RHSVal->getBitWidth();
3325 KnownBits LHSKnown(BitWidth);
3326 computeKnownBits(LHS, LHSKnown, Q.DL, /*Depth=*/0, Q.AC, Q.CxtI, Q.DT);
3327 if (LHSKnown.Zero.intersects(*RHSVal) ||
3328 !LHSKnown.One.isSubsetOf(*RHSVal))
3329 return Pred == ICmpInst::ICMP_EQ ? ConstantInt::getFalse(ITy)
3330 : ConstantInt::getTrue(ITy);
3334 // If the comparison is with the result of a select instruction, check whether
3335 // comparing with either branch of the select always yields the same value.
3336 if (isa<SelectInst>(LHS) || isa<SelectInst>(RHS))
3337 if (Value *V = ThreadCmpOverSelect(Pred, LHS, RHS, Q, MaxRecurse))
3340 // If the comparison is with the result of a phi instruction, check whether
3341 // doing the compare with each incoming phi value yields a common result.
3342 if (isa<PHINode>(LHS) || isa<PHINode>(RHS))
3343 if (Value *V = ThreadCmpOverPHI(Pred, LHS, RHS, Q, MaxRecurse))
3349 Value *llvm::SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS,
3350 const SimplifyQuery &Q) {
3351 return ::SimplifyICmpInst(Predicate, LHS, RHS, Q, RecursionLimit);
3354 /// Given operands for an FCmpInst, see if we can fold the result.
3355 /// If not, this returns null.
3356 static Value *SimplifyFCmpInst(unsigned Predicate, Value *LHS, Value *RHS,
3357 FastMathFlags FMF, const SimplifyQuery &Q,
3358 unsigned MaxRecurse) {
3359 CmpInst::Predicate Pred = (CmpInst::Predicate)Predicate;
3360 assert(CmpInst::isFPPredicate(Pred) && "Not an FP compare!");
3362 if (Constant *CLHS = dyn_cast<Constant>(LHS)) {
3363 if (Constant *CRHS = dyn_cast<Constant>(RHS))
3364 return ConstantFoldCompareInstOperands(Pred, CLHS, CRHS, Q.DL, Q.TLI);
3366 // If we have a constant, make sure it is on the RHS.
3367 std::swap(LHS, RHS);
3368 Pred = CmpInst::getSwappedPredicate(Pred);
3371 // Fold trivial predicates.
3372 Type *RetTy = GetCompareTy(LHS);
3373 if (Pred == FCmpInst::FCMP_FALSE)
3374 return getFalse(RetTy);
3375 if (Pred == FCmpInst::FCMP_TRUE)
3376 return getTrue(RetTy);
3378 // UNO/ORD predicates can be trivially folded if NaNs are ignored.
3380 if (Pred == FCmpInst::FCMP_UNO)
3381 return getFalse(RetTy);
3382 if (Pred == FCmpInst::FCMP_ORD)
3383 return getTrue(RetTy);
3386 // fcmp pred x, undef and fcmp pred undef, x
3387 // fold to true if unordered, false if ordered
3388 if (isa<UndefValue>(LHS) || isa<UndefValue>(RHS)) {
3389 // Choosing NaN for the undef will always make unordered comparison succeed
3390 // and ordered comparison fail.
3391 return ConstantInt::get(RetTy, CmpInst::isUnordered(Pred));
3394 // fcmp x,x -> true/false. Not all compares are foldable.
3396 if (CmpInst::isTrueWhenEqual(Pred))
3397 return getTrue(RetTy);
3398 if (CmpInst::isFalseWhenEqual(Pred))
3399 return getFalse(RetTy);
3402 // Handle fcmp with constant RHS
3403 const ConstantFP *CFP = nullptr;
3404 if (const auto *RHSC = dyn_cast<Constant>(RHS)) {
3405 if (RHS->getType()->isVectorTy())
3406 CFP = dyn_cast_or_null<ConstantFP>(RHSC->getSplatValue());
3408 CFP = dyn_cast<ConstantFP>(RHSC);
3411 // If the constant is a nan, see if we can fold the comparison based on it.
3412 if (CFP->getValueAPF().isNaN()) {
3413 if (FCmpInst::isOrdered(Pred)) // True "if ordered and foo"
3414 return getFalse(RetTy);
3415 assert(FCmpInst::isUnordered(Pred) &&
3416 "Comparison must be either ordered or unordered!");
3417 // True if unordered.
3418 return getTrue(RetTy);
3420 // Check whether the constant is an infinity.
3421 if (CFP->getValueAPF().isInfinity()) {
3422 if (CFP->getValueAPF().isNegative()) {
3424 case FCmpInst::FCMP_OLT:
3425 // No value is ordered and less than negative infinity.
3426 return getFalse(RetTy);
3427 case FCmpInst::FCMP_UGE:
3428 // All values are unordered with or at least negative infinity.
3429 return getTrue(RetTy);
3435 case FCmpInst::FCMP_OGT:
3436 // No value is ordered and greater than infinity.
3437 return getFalse(RetTy);
3438 case FCmpInst::FCMP_ULE:
3439 // All values are unordered with and at most infinity.
3440 return getTrue(RetTy);
3446 if (CFP->getValueAPF().isZero()) {
3448 case FCmpInst::FCMP_UGE:
3449 if (CannotBeOrderedLessThanZero(LHS, Q.TLI))
3450 return getTrue(RetTy);
3452 case FCmpInst::FCMP_OLT:
3454 if (CannotBeOrderedLessThanZero(LHS, Q.TLI))
3455 return getFalse(RetTy);
3463 // If the comparison is with the result of a select instruction, check whether
3464 // comparing with either branch of the select always yields the same value.
3465 if (isa<SelectInst>(LHS) || isa<SelectInst>(RHS))
3466 if (Value *V = ThreadCmpOverSelect(Pred, LHS, RHS, Q, MaxRecurse))
3469 // If the comparison is with the result of a phi instruction, check whether
3470 // doing the compare with each incoming phi value yields a common result.
3471 if (isa<PHINode>(LHS) || isa<PHINode>(RHS))
3472 if (Value *V = ThreadCmpOverPHI(Pred, LHS, RHS, Q, MaxRecurse))
3478 Value *llvm::SimplifyFCmpInst(unsigned Predicate, Value *LHS, Value *RHS,
3479 FastMathFlags FMF, const SimplifyQuery &Q) {
3480 return ::SimplifyFCmpInst(Predicate, LHS, RHS, FMF, Q, RecursionLimit);
3483 /// See if V simplifies when its operand Op is replaced with RepOp.
3484 static const Value *SimplifyWithOpReplaced(Value *V, Value *Op, Value *RepOp,
3485 const SimplifyQuery &Q,
3486 unsigned MaxRecurse) {
3487 // Trivial replacement.
3491 auto *I = dyn_cast<Instruction>(V);
3495 // If this is a binary operator, try to simplify it with the replaced op.
3496 if (auto *B = dyn_cast<BinaryOperator>(I)) {
3498 // %cmp = icmp eq i32 %x, 2147483647
3499 // %add = add nsw i32 %x, 1
3500 // %sel = select i1 %cmp, i32 -2147483648, i32 %add
3502 // We can't replace %sel with %add unless we strip away the flags.
3503 if (isa<OverflowingBinaryOperator>(B))
3504 if (B->hasNoSignedWrap() || B->hasNoUnsignedWrap())
3506 if (isa<PossiblyExactOperator>(B))
3511 if (B->getOperand(0) == Op)
3512 return SimplifyBinOp(B->getOpcode(), RepOp, B->getOperand(1), Q,
3514 if (B->getOperand(1) == Op)
3515 return SimplifyBinOp(B->getOpcode(), B->getOperand(0), RepOp, Q,
3520 // Same for CmpInsts.
3521 if (CmpInst *C = dyn_cast<CmpInst>(I)) {
3523 if (C->getOperand(0) == Op)
3524 return SimplifyCmpInst(C->getPredicate(), RepOp, C->getOperand(1), Q,
3526 if (C->getOperand(1) == Op)
3527 return SimplifyCmpInst(C->getPredicate(), C->getOperand(0), RepOp, Q,
3532 // TODO: We could hand off more cases to instsimplify here.
3534 // If all operands are constant after substituting Op for RepOp then we can
3535 // constant fold the instruction.
3536 if (Constant *CRepOp = dyn_cast<Constant>(RepOp)) {
3537 // Build a list of all constant operands.
3538 SmallVector<Constant *, 8> ConstOps;
3539 for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i) {
3540 if (I->getOperand(i) == Op)
3541 ConstOps.push_back(CRepOp);
3542 else if (Constant *COp = dyn_cast<Constant>(I->getOperand(i)))
3543 ConstOps.push_back(COp);
3548 // All operands were constants, fold it.
3549 if (ConstOps.size() == I->getNumOperands()) {
3550 if (CmpInst *C = dyn_cast<CmpInst>(I))
3551 return ConstantFoldCompareInstOperands(C->getPredicate(), ConstOps[0],
3552 ConstOps[1], Q.DL, Q.TLI);
3554 if (LoadInst *LI = dyn_cast<LoadInst>(I))
3555 if (!LI->isVolatile())
3556 return ConstantFoldLoadFromConstPtr(ConstOps[0], LI->getType(), Q.DL);
3558 return ConstantFoldInstOperands(I, ConstOps, Q.DL, Q.TLI);
3565 /// Try to simplify a select instruction when its condition operand is an
3566 /// integer comparison where one operand of the compare is a constant.
3567 static Value *simplifySelectBitTest(Value *TrueVal, Value *FalseVal, Value *X,
3568 const APInt *Y, bool TrueWhenUnset) {
3571 // (X & Y) == 0 ? X & ~Y : X --> X
3572 // (X & Y) != 0 ? X & ~Y : X --> X & ~Y
3573 if (FalseVal == X && match(TrueVal, m_And(m_Specific(X), m_APInt(C))) &&
3575 return TrueWhenUnset ? FalseVal : TrueVal;
3577 // (X & Y) == 0 ? X : X & ~Y --> X & ~Y
3578 // (X & Y) != 0 ? X : X & ~Y --> X
3579 if (TrueVal == X && match(FalseVal, m_And(m_Specific(X), m_APInt(C))) &&
3581 return TrueWhenUnset ? FalseVal : TrueVal;
3583 if (Y->isPowerOf2()) {
3584 // (X & Y) == 0 ? X | Y : X --> X | Y
3585 // (X & Y) != 0 ? X | Y : X --> X
3586 if (FalseVal == X && match(TrueVal, m_Or(m_Specific(X), m_APInt(C))) &&
3588 return TrueWhenUnset ? TrueVal : FalseVal;
3590 // (X & Y) == 0 ? X : X | Y --> X
3591 // (X & Y) != 0 ? X : X | Y --> X | Y
3592 if (TrueVal == X && match(FalseVal, m_Or(m_Specific(X), m_APInt(C))) &&
3594 return TrueWhenUnset ? TrueVal : FalseVal;
3600 /// An alternative way to test if a bit is set or not uses sgt/slt instead of
3602 static Value *simplifySelectWithFakeICmpEq(Value *CmpLHS, Value *TrueVal,
3604 bool TrueWhenUnset) {
3605 unsigned BitWidth = TrueVal->getType()->getScalarSizeInBits();
3609 APInt MinSignedValue;
3611 if (match(CmpLHS, m_Trunc(m_Value(X))) && (X == TrueVal || X == FalseVal)) {
3612 // icmp slt (trunc X), 0 <--> icmp ne (and X, C), 0
3613 // icmp sgt (trunc X), -1 <--> icmp eq (and X, C), 0
3614 unsigned DestSize = CmpLHS->getType()->getScalarSizeInBits();
3615 MinSignedValue = APInt::getSignedMinValue(DestSize).zext(BitWidth);
3617 // icmp slt X, 0 <--> icmp ne (and X, C), 0
3618 // icmp sgt X, -1 <--> icmp eq (and X, C), 0
3620 MinSignedValue = APInt::getSignedMinValue(BitWidth);
3623 if (Value *V = simplifySelectBitTest(TrueVal, FalseVal, X, &MinSignedValue,
3630 /// Try to simplify a select instruction when its condition operand is an
3631 /// integer comparison.
3632 static Value *simplifySelectWithICmpCond(Value *CondVal, Value *TrueVal,
3633 Value *FalseVal, const SimplifyQuery &Q,
3634 unsigned MaxRecurse) {
3635 ICmpInst::Predicate Pred;
3636 Value *CmpLHS, *CmpRHS;
3637 if (!match(CondVal, m_ICmp(Pred, m_Value(CmpLHS), m_Value(CmpRHS))))
3640 // FIXME: This code is nearly duplicated in InstCombine. Using/refactoring
3641 // decomposeBitTestICmp() might help.
3642 if (ICmpInst::isEquality(Pred) && match(CmpRHS, m_Zero())) {
3645 if (match(CmpLHS, m_And(m_Value(X), m_APInt(Y))))
3646 if (Value *V = simplifySelectBitTest(TrueVal, FalseVal, X, Y,
3647 Pred == ICmpInst::ICMP_EQ))
3649 } else if (Pred == ICmpInst::ICMP_SLT && match(CmpRHS, m_Zero())) {
3650 // Comparing signed-less-than 0 checks if the sign bit is set.
3651 if (Value *V = simplifySelectWithFakeICmpEq(CmpLHS, TrueVal, FalseVal,
3654 } else if (Pred == ICmpInst::ICMP_SGT && match(CmpRHS, m_AllOnes())) {
3655 // Comparing signed-greater-than -1 checks if the sign bit is not set.
3656 if (Value *V = simplifySelectWithFakeICmpEq(CmpLHS, TrueVal, FalseVal,
3661 if (CondVal->hasOneUse()) {
3663 if (match(CmpRHS, m_APInt(C))) {
3664 // X < MIN ? T : F --> F
3665 if (Pred == ICmpInst::ICMP_SLT && C->isMinSignedValue())
3667 // X < MIN ? T : F --> F
3668 if (Pred == ICmpInst::ICMP_ULT && C->isMinValue())
3670 // X > MAX ? T : F --> F
3671 if (Pred == ICmpInst::ICMP_SGT && C->isMaxSignedValue())
3673 // X > MAX ? T : F --> F
3674 if (Pred == ICmpInst::ICMP_UGT && C->isMaxValue())
3679 // If we have an equality comparison, then we know the value in one of the
3680 // arms of the select. See if substituting this value into the arm and
3681 // simplifying the result yields the same value as the other arm.
3682 if (Pred == ICmpInst::ICMP_EQ) {
3683 if (SimplifyWithOpReplaced(FalseVal, CmpLHS, CmpRHS, Q, MaxRecurse) ==
3685 SimplifyWithOpReplaced(FalseVal, CmpRHS, CmpLHS, Q, MaxRecurse) ==
3688 if (SimplifyWithOpReplaced(TrueVal, CmpLHS, CmpRHS, Q, MaxRecurse) ==
3690 SimplifyWithOpReplaced(TrueVal, CmpRHS, CmpLHS, Q, MaxRecurse) ==
3693 } else if (Pred == ICmpInst::ICMP_NE) {
3694 if (SimplifyWithOpReplaced(TrueVal, CmpLHS, CmpRHS, Q, MaxRecurse) ==
3696 SimplifyWithOpReplaced(TrueVal, CmpRHS, CmpLHS, Q, MaxRecurse) ==
3699 if (SimplifyWithOpReplaced(FalseVal, CmpLHS, CmpRHS, Q, MaxRecurse) ==
3701 SimplifyWithOpReplaced(FalseVal, CmpRHS, CmpLHS, Q, MaxRecurse) ==
3709 /// Given operands for a SelectInst, see if we can fold the result.
3710 /// If not, this returns null.
3711 static Value *SimplifySelectInst(Value *CondVal, Value *TrueVal,
3712 Value *FalseVal, const SimplifyQuery &Q,
3713 unsigned MaxRecurse) {
3714 // select true, X, Y -> X
3715 // select false, X, Y -> Y
3716 if (Constant *CB = dyn_cast<Constant>(CondVal)) {
3717 if (CB->isAllOnesValue())
3719 if (CB->isNullValue())
3723 // select C, X, X -> X
3724 if (TrueVal == FalseVal)
3727 if (isa<UndefValue>(CondVal)) { // select undef, X, Y -> X or Y
3728 if (isa<Constant>(FalseVal))
3732 if (isa<UndefValue>(TrueVal)) // select C, undef, X -> X
3734 if (isa<UndefValue>(FalseVal)) // select C, X, undef -> X
3738 simplifySelectWithICmpCond(CondVal, TrueVal, FalseVal, Q, MaxRecurse))
3744 Value *llvm::SimplifySelectInst(Value *Cond, Value *TrueVal, Value *FalseVal,
3745 const SimplifyQuery &Q) {
3746 return ::SimplifySelectInst(Cond, TrueVal, FalseVal, Q, RecursionLimit);
3749 /// Given operands for an GetElementPtrInst, see if we can fold the result.
3750 /// If not, this returns null.
3751 static Value *SimplifyGEPInst(Type *SrcTy, ArrayRef<Value *> Ops,
3752 const SimplifyQuery &Q, unsigned) {
3753 // The type of the GEP pointer operand.
3755 cast<PointerType>(Ops[0]->getType()->getScalarType())->getAddressSpace();
3757 // getelementptr P -> P.
3758 if (Ops.size() == 1)
3761 // Compute the (pointer) type returned by the GEP instruction.
3762 Type *LastType = GetElementPtrInst::getIndexedType(SrcTy, Ops.slice(1));
3763 Type *GEPTy = PointerType::get(LastType, AS);
3764 if (VectorType *VT = dyn_cast<VectorType>(Ops[0]->getType()))
3765 GEPTy = VectorType::get(GEPTy, VT->getNumElements());
3766 else if (VectorType *VT = dyn_cast<VectorType>(Ops[1]->getType()))
3767 GEPTy = VectorType::get(GEPTy, VT->getNumElements());
3769 if (isa<UndefValue>(Ops[0]))
3770 return UndefValue::get(GEPTy);
3772 if (Ops.size() == 2) {
3773 // getelementptr P, 0 -> P.
3774 if (match(Ops[1], m_Zero()))
3778 if (Ty->isSized()) {
3781 uint64_t TyAllocSize = Q.DL.getTypeAllocSize(Ty);
3782 // getelementptr P, N -> P if P points to a type of zero size.
3783 if (TyAllocSize == 0)
3786 // The following transforms are only safe if the ptrtoint cast
3787 // doesn't truncate the pointers.
3788 if (Ops[1]->getType()->getScalarSizeInBits() ==
3789 Q.DL.getPointerSizeInBits(AS)) {
3790 auto PtrToIntOrZero = [GEPTy](Value *P) -> Value * {
3791 if (match(P, m_Zero()))
3792 return Constant::getNullValue(GEPTy);
3794 if (match(P, m_PtrToInt(m_Value(Temp))))
3795 if (Temp->getType() == GEPTy)
3800 // getelementptr V, (sub P, V) -> P if P points to a type of size 1.
3801 if (TyAllocSize == 1 &&
3802 match(Ops[1], m_Sub(m_Value(P), m_PtrToInt(m_Specific(Ops[0])))))
3803 if (Value *R = PtrToIntOrZero(P))
3806 // getelementptr V, (ashr (sub P, V), C) -> Q
3807 // if P points to a type of size 1 << C.
3809 m_AShr(m_Sub(m_Value(P), m_PtrToInt(m_Specific(Ops[0]))),
3810 m_ConstantInt(C))) &&
3811 TyAllocSize == 1ULL << C)
3812 if (Value *R = PtrToIntOrZero(P))
3815 // getelementptr V, (sdiv (sub P, V), C) -> Q
3816 // if P points to a type of size C.
3818 m_SDiv(m_Sub(m_Value(P), m_PtrToInt(m_Specific(Ops[0]))),
3819 m_SpecificInt(TyAllocSize))))
3820 if (Value *R = PtrToIntOrZero(P))
3826 if (Q.DL.getTypeAllocSize(LastType) == 1 &&
3827 all_of(Ops.slice(1).drop_back(1),
3828 [](Value *Idx) { return match(Idx, m_Zero()); })) {
3830 Q.DL.getPointerSizeInBits(Ops[0]->getType()->getPointerAddressSpace());
3831 if (Q.DL.getTypeSizeInBits(Ops.back()->getType()) == PtrWidth) {
3832 APInt BasePtrOffset(PtrWidth, 0);
3833 Value *StrippedBasePtr =
3834 Ops[0]->stripAndAccumulateInBoundsConstantOffsets(Q.DL,
3837 // gep (gep V, C), (sub 0, V) -> C
3838 if (match(Ops.back(),
3839 m_Sub(m_Zero(), m_PtrToInt(m_Specific(StrippedBasePtr))))) {
3840 auto *CI = ConstantInt::get(GEPTy->getContext(), BasePtrOffset);
3841 return ConstantExpr::getIntToPtr(CI, GEPTy);
3843 // gep (gep V, C), (xor V, -1) -> C-1
3844 if (match(Ops.back(),
3845 m_Xor(m_PtrToInt(m_Specific(StrippedBasePtr)), m_AllOnes()))) {
3846 auto *CI = ConstantInt::get(GEPTy->getContext(), BasePtrOffset - 1);
3847 return ConstantExpr::getIntToPtr(CI, GEPTy);
3852 // Check to see if this is constant foldable.
3853 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
3854 if (!isa<Constant>(Ops[i]))
3857 return ConstantExpr::getGetElementPtr(SrcTy, cast<Constant>(Ops[0]),
3861 Value *llvm::SimplifyGEPInst(Type *SrcTy, ArrayRef<Value *> Ops,
3862 const SimplifyQuery &Q) {
3863 return ::SimplifyGEPInst(SrcTy, Ops, Q, RecursionLimit);
3866 /// Given operands for an InsertValueInst, see if we can fold the result.
3867 /// If not, this returns null.
3868 static Value *SimplifyInsertValueInst(Value *Agg, Value *Val,
3869 ArrayRef<unsigned> Idxs, const SimplifyQuery &Q,
3871 if (Constant *CAgg = dyn_cast<Constant>(Agg))
3872 if (Constant *CVal = dyn_cast<Constant>(Val))
3873 return ConstantFoldInsertValueInstruction(CAgg, CVal, Idxs);
3875 // insertvalue x, undef, n -> x
3876 if (match(Val, m_Undef()))
3879 // insertvalue x, (extractvalue y, n), n
3880 if (ExtractValueInst *EV = dyn_cast<ExtractValueInst>(Val))
3881 if (EV->getAggregateOperand()->getType() == Agg->getType() &&
3882 EV->getIndices() == Idxs) {
3883 // insertvalue undef, (extractvalue y, n), n -> y
3884 if (match(Agg, m_Undef()))
3885 return EV->getAggregateOperand();
3887 // insertvalue y, (extractvalue y, n), n -> y
3888 if (Agg == EV->getAggregateOperand())
3895 Value *llvm::SimplifyInsertValueInst(Value *Agg, Value *Val,
3896 ArrayRef<unsigned> Idxs,
3897 const SimplifyQuery &Q) {
3898 return ::SimplifyInsertValueInst(Agg, Val, Idxs, Q, RecursionLimit);
3901 /// Given operands for an ExtractValueInst, see if we can fold the result.
3902 /// If not, this returns null.
3903 static Value *SimplifyExtractValueInst(Value *Agg, ArrayRef<unsigned> Idxs,
3904 const SimplifyQuery &, unsigned) {
3905 if (auto *CAgg = dyn_cast<Constant>(Agg))
3906 return ConstantFoldExtractValueInstruction(CAgg, Idxs);
3908 // extractvalue x, (insertvalue y, elt, n), n -> elt
3909 unsigned NumIdxs = Idxs.size();
3910 for (auto *IVI = dyn_cast<InsertValueInst>(Agg); IVI != nullptr;
3911 IVI = dyn_cast<InsertValueInst>(IVI->getAggregateOperand())) {
3912 ArrayRef<unsigned> InsertValueIdxs = IVI->getIndices();
3913 unsigned NumInsertValueIdxs = InsertValueIdxs.size();
3914 unsigned NumCommonIdxs = std::min(NumInsertValueIdxs, NumIdxs);
3915 if (InsertValueIdxs.slice(0, NumCommonIdxs) ==
3916 Idxs.slice(0, NumCommonIdxs)) {
3917 if (NumIdxs == NumInsertValueIdxs)
3918 return IVI->getInsertedValueOperand();
3926 Value *llvm::SimplifyExtractValueInst(Value *Agg, ArrayRef<unsigned> Idxs,
3927 const SimplifyQuery &Q) {
3928 return ::SimplifyExtractValueInst(Agg, Idxs, Q, RecursionLimit);
3931 /// Given operands for an ExtractElementInst, see if we can fold the result.
3932 /// If not, this returns null.
3933 static Value *SimplifyExtractElementInst(Value *Vec, Value *Idx, const SimplifyQuery &,
3935 if (auto *CVec = dyn_cast<Constant>(Vec)) {
3936 if (auto *CIdx = dyn_cast<Constant>(Idx))
3937 return ConstantFoldExtractElementInstruction(CVec, CIdx);
3939 // The index is not relevant if our vector is a splat.
3940 if (auto *Splat = CVec->getSplatValue())
3943 if (isa<UndefValue>(Vec))
3944 return UndefValue::get(Vec->getType()->getVectorElementType());
3947 // If extracting a specified index from the vector, see if we can recursively
3948 // find a previously computed scalar that was inserted into the vector.
3949 if (auto *IdxC = dyn_cast<ConstantInt>(Idx))
3950 if (Value *Elt = findScalarElement(Vec, IdxC->getZExtValue()))
3956 Value *llvm::SimplifyExtractElementInst(Value *Vec, Value *Idx,
3957 const SimplifyQuery &Q) {
3958 return ::SimplifyExtractElementInst(Vec, Idx, Q, RecursionLimit);
3961 /// See if we can fold the given phi. If not, returns null.
3962 static Value *SimplifyPHINode(PHINode *PN, const SimplifyQuery &Q) {
3963 // If all of the PHI's incoming values are the same then replace the PHI node
3964 // with the common value.
3965 Value *CommonValue = nullptr;
3966 bool HasUndefInput = false;
3967 for (Value *Incoming : PN->incoming_values()) {
3968 // If the incoming value is the phi node itself, it can safely be skipped.
3969 if (Incoming == PN) continue;
3970 if (isa<UndefValue>(Incoming)) {
3971 // Remember that we saw an undef value, but otherwise ignore them.
3972 HasUndefInput = true;
3975 if (CommonValue && Incoming != CommonValue)
3976 return nullptr; // Not the same, bail out.
3977 CommonValue = Incoming;
3980 // If CommonValue is null then all of the incoming values were either undef or
3981 // equal to the phi node itself.
3983 return UndefValue::get(PN->getType());
3985 // If we have a PHI node like phi(X, undef, X), where X is defined by some
3986 // instruction, we cannot return X as the result of the PHI node unless it
3987 // dominates the PHI block.
3989 return ValueDominatesPHI(CommonValue, PN, Q.DT) ? CommonValue : nullptr;
3994 static Value *SimplifyCastInst(unsigned CastOpc, Value *Op,
3995 Type *Ty, const SimplifyQuery &Q, unsigned MaxRecurse) {
3996 if (auto *C = dyn_cast<Constant>(Op))
3997 return ConstantFoldCastOperand(CastOpc, C, Ty, Q.DL);
3999 if (auto *CI = dyn_cast<CastInst>(Op)) {
4000 auto *Src = CI->getOperand(0);
4001 Type *SrcTy = Src->getType();
4002 Type *MidTy = CI->getType();
4004 if (Src->getType() == Ty) {
4005 auto FirstOp = static_cast<Instruction::CastOps>(CI->getOpcode());
4006 auto SecondOp = static_cast<Instruction::CastOps>(CastOpc);
4008 SrcTy->isPtrOrPtrVectorTy() ? Q.DL.getIntPtrType(SrcTy) : nullptr;
4010 MidTy->isPtrOrPtrVectorTy() ? Q.DL.getIntPtrType(MidTy) : nullptr;
4012 DstTy->isPtrOrPtrVectorTy() ? Q.DL.getIntPtrType(DstTy) : nullptr;
4013 if (CastInst::isEliminableCastPair(FirstOp, SecondOp, SrcTy, MidTy, DstTy,
4014 SrcIntPtrTy, MidIntPtrTy,
4015 DstIntPtrTy) == Instruction::BitCast)
4021 if (CastOpc == Instruction::BitCast)
4022 if (Op->getType() == Ty)
4028 Value *llvm::SimplifyCastInst(unsigned CastOpc, Value *Op, Type *Ty,
4029 const SimplifyQuery &Q) {
4030 return ::SimplifyCastInst(CastOpc, Op, Ty, Q, RecursionLimit);
4033 /// For the given destination element of a shuffle, peek through shuffles to
4034 /// match a root vector source operand that contains that element in the same
4035 /// vector lane (ie, the same mask index), so we can eliminate the shuffle(s).
4036 static Value *foldIdentityShuffles(int DestElt, Value *Op0, Value *Op1,
4037 Constant *Mask, Value *RootVec, int RootElt,
4038 unsigned MaxRecurse) {
4042 // Bail out if any mask value is undefined. That kind of shuffle may be
4043 // simplified further based on demanded bits or other folds.
4044 int MaskVal = ShuffleVectorInst::getMaskValue(Mask, RootElt);
4048 // The mask value chooses which source operand we need to look at next.
4050 int InVecNumElts = Op0->getType()->getVectorNumElements();
4051 if (MaskVal < InVecNumElts) {
4055 RootElt = MaskVal - InVecNumElts;
4059 // If the source operand is a shuffle itself, look through it to find the
4060 // matching root vector.
4061 if (auto *SourceShuf = dyn_cast<ShuffleVectorInst>(SourceOp)) {
4062 return foldIdentityShuffles(
4063 DestElt, SourceShuf->getOperand(0), SourceShuf->getOperand(1),
4064 SourceShuf->getMask(), RootVec, RootElt, MaxRecurse);
4067 // TODO: Look through bitcasts? What if the bitcast changes the vector element
4070 // The source operand is not a shuffle. Initialize the root vector value for
4071 // this shuffle if that has not been done yet.
4075 // Give up as soon as a source operand does not match the existing root value.
4076 if (RootVec != SourceOp)
4079 // The element must be coming from the same lane in the source vector
4080 // (although it may have crossed lanes in intermediate shuffles).
4081 if (RootElt != DestElt)
4087 static Value *SimplifyShuffleVectorInst(Value *Op0, Value *Op1, Constant *Mask,
4088 Type *RetTy, const SimplifyQuery &Q,
4089 unsigned MaxRecurse) {
4090 if (isa<UndefValue>(Mask))
4091 return UndefValue::get(RetTy);
4093 Type *InVecTy = Op0->getType();
4094 unsigned MaskNumElts = Mask->getType()->getVectorNumElements();
4095 unsigned InVecNumElts = InVecTy->getVectorNumElements();
4097 SmallVector<int, 32> Indices;
4098 ShuffleVectorInst::getShuffleMask(Mask, Indices);
4099 assert(MaskNumElts == Indices.size() &&
4100 "Size of Indices not same as number of mask elements?");
4102 // Canonicalization: If mask does not select elements from an input vector,
4103 // replace that input vector with undef.
4104 bool MaskSelects0 = false, MaskSelects1 = false;
4105 for (unsigned i = 0; i != MaskNumElts; ++i) {
4106 if (Indices[i] == -1)
4108 if ((unsigned)Indices[i] < InVecNumElts)
4109 MaskSelects0 = true;
4111 MaskSelects1 = true;
4114 Op0 = UndefValue::get(InVecTy);
4116 Op1 = UndefValue::get(InVecTy);
4118 auto *Op0Const = dyn_cast<Constant>(Op0);
4119 auto *Op1Const = dyn_cast<Constant>(Op1);
4121 // If all operands are constant, constant fold the shuffle.
4122 if (Op0Const && Op1Const)
4123 return ConstantFoldShuffleVectorInstruction(Op0Const, Op1Const, Mask);
4125 // Canonicalization: if only one input vector is constant, it shall be the
4127 if (Op0Const && !Op1Const) {
4128 std::swap(Op0, Op1);
4129 for (int &Idx : Indices) {
4132 Idx = Idx < (int)InVecNumElts ? Idx + InVecNumElts : Idx - InVecNumElts;
4133 assert(Idx >= 0 && Idx < (int)InVecNumElts * 2 &&
4134 "shufflevector mask index out of range");
4136 Mask = ConstantDataVector::get(
4138 makeArrayRef(reinterpret_cast<uint32_t *>(Indices.data()),
4142 // A shuffle of a splat is always the splat itself. Legal if the shuffle's
4143 // value type is same as the input vectors' type.
4144 if (auto *OpShuf = dyn_cast<ShuffleVectorInst>(Op0))
4145 if (isa<UndefValue>(Op1) && RetTy == InVecTy &&
4146 OpShuf->getMask()->getSplatValue())
4149 // Don't fold a shuffle with undef mask elements. This may get folded in a
4150 // better way using demanded bits or other analysis.
4151 // TODO: Should we allow this?
4152 if (find(Indices, -1) != Indices.end())
4155 // Check if every element of this shuffle can be mapped back to the
4156 // corresponding element of a single root vector. If so, we don't need this
4157 // shuffle. This handles simple identity shuffles as well as chains of
4158 // shuffles that may widen/narrow and/or move elements across lanes and back.
4159 Value *RootVec = nullptr;
4160 for (unsigned i = 0; i != MaskNumElts; ++i) {
4161 // Note that recursion is limited for each vector element, so if any element
4162 // exceeds the limit, this will fail to simplify.
4163 RootVec = foldIdentityShuffles(i, Op0, Op1, Mask, RootVec, i, MaxRecurse);
4165 // We can't replace a widening/narrowing shuffle with one of its operands.
4166 if (!RootVec || RootVec->getType() != RetTy)
4172 /// Given operands for a ShuffleVectorInst, fold the result or return null.
4173 Value *llvm::SimplifyShuffleVectorInst(Value *Op0, Value *Op1, Constant *Mask,
4174 Type *RetTy, const SimplifyQuery &Q) {
4175 return ::SimplifyShuffleVectorInst(Op0, Op1, Mask, RetTy, Q, RecursionLimit);
4178 //=== Helper functions for higher up the class hierarchy.
4180 /// Given operands for a BinaryOperator, see if we can fold the result.
4181 /// If not, this returns null.
4182 static Value *SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS,
4183 const SimplifyQuery &Q, unsigned MaxRecurse) {
4185 case Instruction::Add:
4186 return SimplifyAddInst(LHS, RHS, false, false, Q, MaxRecurse);
4187 case Instruction::FAdd:
4188 return SimplifyFAddInst(LHS, RHS, FastMathFlags(), Q, MaxRecurse);
4189 case Instruction::Sub:
4190 return SimplifySubInst(LHS, RHS, false, false, Q, MaxRecurse);
4191 case Instruction::FSub:
4192 return SimplifyFSubInst(LHS, RHS, FastMathFlags(), Q, MaxRecurse);
4193 case Instruction::Mul:
4194 return SimplifyMulInst(LHS, RHS, Q, MaxRecurse);
4195 case Instruction::FMul:
4196 return SimplifyFMulInst(LHS, RHS, FastMathFlags(), Q, MaxRecurse);
4197 case Instruction::SDiv:
4198 return SimplifySDivInst(LHS, RHS, Q, MaxRecurse);
4199 case Instruction::UDiv:
4200 return SimplifyUDivInst(LHS, RHS, Q, MaxRecurse);
4201 case Instruction::FDiv:
4202 return SimplifyFDivInst(LHS, RHS, FastMathFlags(), Q, MaxRecurse);
4203 case Instruction::SRem:
4204 return SimplifySRemInst(LHS, RHS, Q, MaxRecurse);
4205 case Instruction::URem:
4206 return SimplifyURemInst(LHS, RHS, Q, MaxRecurse);
4207 case Instruction::FRem:
4208 return SimplifyFRemInst(LHS, RHS, FastMathFlags(), Q, MaxRecurse);
4209 case Instruction::Shl:
4210 return SimplifyShlInst(LHS, RHS, false, false, Q, MaxRecurse);
4211 case Instruction::LShr:
4212 return SimplifyLShrInst(LHS, RHS, false, Q, MaxRecurse);
4213 case Instruction::AShr:
4214 return SimplifyAShrInst(LHS, RHS, false, Q, MaxRecurse);
4215 case Instruction::And:
4216 return SimplifyAndInst(LHS, RHS, Q, MaxRecurse);
4217 case Instruction::Or:
4218 return SimplifyOrInst(LHS, RHS, Q, MaxRecurse);
4219 case Instruction::Xor:
4220 return SimplifyXorInst(LHS, RHS, Q, MaxRecurse);
4222 llvm_unreachable("Unexpected opcode");
4226 /// Given operands for a BinaryOperator, see if we can fold the result.
4227 /// If not, this returns null.
4228 /// In contrast to SimplifyBinOp, try to use FastMathFlag when folding the
4229 /// result. In case we don't need FastMathFlags, simply fall to SimplifyBinOp.
4230 static Value *SimplifyFPBinOp(unsigned Opcode, Value *LHS, Value *RHS,
4231 const FastMathFlags &FMF, const SimplifyQuery &Q,
4232 unsigned MaxRecurse) {
4234 case Instruction::FAdd:
4235 return SimplifyFAddInst(LHS, RHS, FMF, Q, MaxRecurse);
4236 case Instruction::FSub:
4237 return SimplifyFSubInst(LHS, RHS, FMF, Q, MaxRecurse);
4238 case Instruction::FMul:
4239 return SimplifyFMulInst(LHS, RHS, FMF, Q, MaxRecurse);
4240 case Instruction::FDiv:
4241 return SimplifyFDivInst(LHS, RHS, FMF, Q, MaxRecurse);
4243 return SimplifyBinOp(Opcode, LHS, RHS, Q, MaxRecurse);
4247 Value *llvm::SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS,
4248 const SimplifyQuery &Q) {
4249 return ::SimplifyBinOp(Opcode, LHS, RHS, Q, RecursionLimit);
4252 Value *llvm::SimplifyFPBinOp(unsigned Opcode, Value *LHS, Value *RHS,
4253 FastMathFlags FMF, const SimplifyQuery &Q) {
4254 return ::SimplifyFPBinOp(Opcode, LHS, RHS, FMF, Q, RecursionLimit);
4257 /// Given operands for a CmpInst, see if we can fold the result.
4258 static Value *SimplifyCmpInst(unsigned Predicate, Value *LHS, Value *RHS,
4259 const SimplifyQuery &Q, unsigned MaxRecurse) {
4260 if (CmpInst::isIntPredicate((CmpInst::Predicate)Predicate))
4261 return SimplifyICmpInst(Predicate, LHS, RHS, Q, MaxRecurse);
4262 return SimplifyFCmpInst(Predicate, LHS, RHS, FastMathFlags(), Q, MaxRecurse);
4265 Value *llvm::SimplifyCmpInst(unsigned Predicate, Value *LHS, Value *RHS,
4266 const SimplifyQuery &Q) {
4267 return ::SimplifyCmpInst(Predicate, LHS, RHS, Q, RecursionLimit);
4270 static bool IsIdempotent(Intrinsic::ID ID) {
4272 default: return false;
4274 // Unary idempotent: f(f(x)) = f(x)
4275 case Intrinsic::fabs:
4276 case Intrinsic::floor:
4277 case Intrinsic::ceil:
4278 case Intrinsic::trunc:
4279 case Intrinsic::rint:
4280 case Intrinsic::nearbyint:
4281 case Intrinsic::round:
4286 static Value *SimplifyRelativeLoad(Constant *Ptr, Constant *Offset,
4287 const DataLayout &DL) {
4288 GlobalValue *PtrSym;
4290 if (!IsConstantOffsetFromGlobal(Ptr, PtrSym, PtrOffset, DL))
4293 Type *Int8PtrTy = Type::getInt8PtrTy(Ptr->getContext());
4294 Type *Int32Ty = Type::getInt32Ty(Ptr->getContext());
4295 Type *Int32PtrTy = Int32Ty->getPointerTo();
4296 Type *Int64Ty = Type::getInt64Ty(Ptr->getContext());
4298 auto *OffsetConstInt = dyn_cast<ConstantInt>(Offset);
4299 if (!OffsetConstInt || OffsetConstInt->getType()->getBitWidth() > 64)
4302 uint64_t OffsetInt = OffsetConstInt->getSExtValue();
4303 if (OffsetInt % 4 != 0)
4306 Constant *C = ConstantExpr::getGetElementPtr(
4307 Int32Ty, ConstantExpr::getBitCast(Ptr, Int32PtrTy),
4308 ConstantInt::get(Int64Ty, OffsetInt / 4));
4309 Constant *Loaded = ConstantFoldLoadFromConstPtr(C, Int32Ty, DL);
4313 auto *LoadedCE = dyn_cast<ConstantExpr>(Loaded);
4317 if (LoadedCE->getOpcode() == Instruction::Trunc) {
4318 LoadedCE = dyn_cast<ConstantExpr>(LoadedCE->getOperand(0));
4323 if (LoadedCE->getOpcode() != Instruction::Sub)
4326 auto *LoadedLHS = dyn_cast<ConstantExpr>(LoadedCE->getOperand(0));
4327 if (!LoadedLHS || LoadedLHS->getOpcode() != Instruction::PtrToInt)
4329 auto *LoadedLHSPtr = LoadedLHS->getOperand(0);
4331 Constant *LoadedRHS = LoadedCE->getOperand(1);
4332 GlobalValue *LoadedRHSSym;
4333 APInt LoadedRHSOffset;
4334 if (!IsConstantOffsetFromGlobal(LoadedRHS, LoadedRHSSym, LoadedRHSOffset,
4336 PtrSym != LoadedRHSSym || PtrOffset != LoadedRHSOffset)
4339 return ConstantExpr::getBitCast(LoadedLHSPtr, Int8PtrTy);
4342 static bool maskIsAllZeroOrUndef(Value *Mask) {
4343 auto *ConstMask = dyn_cast<Constant>(Mask);
4346 if (ConstMask->isNullValue() || isa<UndefValue>(ConstMask))
4348 for (unsigned I = 0, E = ConstMask->getType()->getVectorNumElements(); I != E;
4350 if (auto *MaskElt = ConstMask->getAggregateElement(I))
4351 if (MaskElt->isNullValue() || isa<UndefValue>(MaskElt))
4358 template <typename IterTy>
4359 static Value *SimplifyIntrinsic(Function *F, IterTy ArgBegin, IterTy ArgEnd,
4360 const SimplifyQuery &Q, unsigned MaxRecurse) {
4361 Intrinsic::ID IID = F->getIntrinsicID();
4362 unsigned NumOperands = std::distance(ArgBegin, ArgEnd);
4365 if (NumOperands == 1) {
4366 // Perform idempotent optimizations
4367 if (IsIdempotent(IID)) {
4368 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(*ArgBegin)) {
4369 if (II->getIntrinsicID() == IID)
4375 case Intrinsic::fabs: {
4376 if (SignBitMustBeZero(*ArgBegin, Q.TLI))
4386 if (NumOperands == 2) {
4387 Value *LHS = *ArgBegin;
4388 Value *RHS = *(ArgBegin + 1);
4389 Type *ReturnType = F->getReturnType();
4392 case Intrinsic::usub_with_overflow:
4393 case Intrinsic::ssub_with_overflow: {
4394 // X - X -> { 0, false }
4396 return Constant::getNullValue(ReturnType);
4398 // X - undef -> undef
4399 // undef - X -> undef
4400 if (isa<UndefValue>(LHS) || isa<UndefValue>(RHS))
4401 return UndefValue::get(ReturnType);
4405 case Intrinsic::uadd_with_overflow:
4406 case Intrinsic::sadd_with_overflow: {
4407 // X + undef -> undef
4408 if (isa<UndefValue>(RHS))
4409 return UndefValue::get(ReturnType);
4413 case Intrinsic::umul_with_overflow:
4414 case Intrinsic::smul_with_overflow: {
4415 // X * 0 -> { 0, false }
4416 if (match(RHS, m_Zero()))
4417 return Constant::getNullValue(ReturnType);
4419 // X * undef -> { 0, false }
4420 if (match(RHS, m_Undef()))
4421 return Constant::getNullValue(ReturnType);
4425 case Intrinsic::load_relative: {
4426 Constant *C0 = dyn_cast<Constant>(LHS);
4427 Constant *C1 = dyn_cast<Constant>(RHS);
4429 return SimplifyRelativeLoad(C0, C1, Q.DL);
4437 // Simplify calls to llvm.masked.load.*
4439 case Intrinsic::masked_load: {
4440 Value *MaskArg = ArgBegin[2];
4441 Value *PassthruArg = ArgBegin[3];
4442 // If the mask is all zeros or undef, the "passthru" argument is the result.
4443 if (maskIsAllZeroOrUndef(MaskArg))
4452 template <typename IterTy>
4453 static Value *SimplifyCall(Value *V, IterTy ArgBegin, IterTy ArgEnd,
4454 const SimplifyQuery &Q, unsigned MaxRecurse) {
4455 Type *Ty = V->getType();
4456 if (PointerType *PTy = dyn_cast<PointerType>(Ty))
4457 Ty = PTy->getElementType();
4458 FunctionType *FTy = cast<FunctionType>(Ty);
4460 // call undef -> undef
4461 // call null -> undef
4462 if (isa<UndefValue>(V) || isa<ConstantPointerNull>(V))
4463 return UndefValue::get(FTy->getReturnType());
4465 Function *F = dyn_cast<Function>(V);
4469 if (F->isIntrinsic())
4470 if (Value *Ret = SimplifyIntrinsic(F, ArgBegin, ArgEnd, Q, MaxRecurse))
4473 if (!canConstantFoldCallTo(F))
4476 SmallVector<Constant *, 4> ConstantArgs;
4477 ConstantArgs.reserve(ArgEnd - ArgBegin);
4478 for (IterTy I = ArgBegin, E = ArgEnd; I != E; ++I) {
4479 Constant *C = dyn_cast<Constant>(*I);
4482 ConstantArgs.push_back(C);
4485 return ConstantFoldCall(F, ConstantArgs, Q.TLI);
4488 Value *llvm::SimplifyCall(Value *V, User::op_iterator ArgBegin,
4489 User::op_iterator ArgEnd, const SimplifyQuery &Q) {
4490 return ::SimplifyCall(V, ArgBegin, ArgEnd, Q, RecursionLimit);
4493 Value *llvm::SimplifyCall(Value *V, ArrayRef<Value *> Args,
4494 const SimplifyQuery &Q) {
4495 return ::SimplifyCall(V, Args.begin(), Args.end(), Q, RecursionLimit);
4498 /// See if we can compute a simplified version of this instruction.
4499 /// If not, this returns null.
4501 Value *llvm::SimplifyInstruction(Instruction *I, const SimplifyQuery &SQ,
4502 OptimizationRemarkEmitter *ORE) {
4503 const SimplifyQuery Q = SQ.CxtI ? SQ : SQ.getWithInstruction(I);
4506 switch (I->getOpcode()) {
4508 Result = ConstantFoldInstruction(I, Q.DL, Q.TLI);
4510 case Instruction::FAdd:
4511 Result = SimplifyFAddInst(I->getOperand(0), I->getOperand(1),
4512 I->getFastMathFlags(), Q);
4514 case Instruction::Add:
4515 Result = SimplifyAddInst(I->getOperand(0), I->getOperand(1),
4516 cast<BinaryOperator>(I)->hasNoSignedWrap(),
4517 cast<BinaryOperator>(I)->hasNoUnsignedWrap(), Q);
4519 case Instruction::FSub:
4520 Result = SimplifyFSubInst(I->getOperand(0), I->getOperand(1),
4521 I->getFastMathFlags(), Q);
4523 case Instruction::Sub:
4524 Result = SimplifySubInst(I->getOperand(0), I->getOperand(1),
4525 cast<BinaryOperator>(I)->hasNoSignedWrap(),
4526 cast<BinaryOperator>(I)->hasNoUnsignedWrap(), Q);
4528 case Instruction::FMul:
4529 Result = SimplifyFMulInst(I->getOperand(0), I->getOperand(1),
4530 I->getFastMathFlags(), Q);
4532 case Instruction::Mul:
4533 Result = SimplifyMulInst(I->getOperand(0), I->getOperand(1), Q);
4535 case Instruction::SDiv:
4536 Result = SimplifySDivInst(I->getOperand(0), I->getOperand(1), Q);
4538 case Instruction::UDiv:
4539 Result = SimplifyUDivInst(I->getOperand(0), I->getOperand(1), Q);
4541 case Instruction::FDiv:
4542 Result = SimplifyFDivInst(I->getOperand(0), I->getOperand(1),
4543 I->getFastMathFlags(), Q);
4545 case Instruction::SRem:
4546 Result = SimplifySRemInst(I->getOperand(0), I->getOperand(1), Q);
4548 case Instruction::URem:
4549 Result = SimplifyURemInst(I->getOperand(0), I->getOperand(1), Q);
4551 case Instruction::FRem:
4552 Result = SimplifyFRemInst(I->getOperand(0), I->getOperand(1),
4553 I->getFastMathFlags(), Q);
4555 case Instruction::Shl:
4556 Result = SimplifyShlInst(I->getOperand(0), I->getOperand(1),
4557 cast<BinaryOperator>(I)->hasNoSignedWrap(),
4558 cast<BinaryOperator>(I)->hasNoUnsignedWrap(), Q);
4560 case Instruction::LShr:
4561 Result = SimplifyLShrInst(I->getOperand(0), I->getOperand(1),
4562 cast<BinaryOperator>(I)->isExact(), Q);
4564 case Instruction::AShr:
4565 Result = SimplifyAShrInst(I->getOperand(0), I->getOperand(1),
4566 cast<BinaryOperator>(I)->isExact(), Q);
4568 case Instruction::And:
4569 Result = SimplifyAndInst(I->getOperand(0), I->getOperand(1), Q);
4571 case Instruction::Or:
4572 Result = SimplifyOrInst(I->getOperand(0), I->getOperand(1), Q);
4574 case Instruction::Xor:
4575 Result = SimplifyXorInst(I->getOperand(0), I->getOperand(1), Q);
4577 case Instruction::ICmp:
4578 Result = SimplifyICmpInst(cast<ICmpInst>(I)->getPredicate(),
4579 I->getOperand(0), I->getOperand(1), Q);
4581 case Instruction::FCmp:
4583 SimplifyFCmpInst(cast<FCmpInst>(I)->getPredicate(), I->getOperand(0),
4584 I->getOperand(1), I->getFastMathFlags(), Q);
4586 case Instruction::Select:
4587 Result = SimplifySelectInst(I->getOperand(0), I->getOperand(1),
4588 I->getOperand(2), Q);
4590 case Instruction::GetElementPtr: {
4591 SmallVector<Value *, 8> Ops(I->op_begin(), I->op_end());
4592 Result = SimplifyGEPInst(cast<GetElementPtrInst>(I)->getSourceElementType(),
4596 case Instruction::InsertValue: {
4597 InsertValueInst *IV = cast<InsertValueInst>(I);
4598 Result = SimplifyInsertValueInst(IV->getAggregateOperand(),
4599 IV->getInsertedValueOperand(),
4600 IV->getIndices(), Q);
4603 case Instruction::ExtractValue: {
4604 auto *EVI = cast<ExtractValueInst>(I);
4605 Result = SimplifyExtractValueInst(EVI->getAggregateOperand(),
4606 EVI->getIndices(), Q);
4609 case Instruction::ExtractElement: {
4610 auto *EEI = cast<ExtractElementInst>(I);
4611 Result = SimplifyExtractElementInst(EEI->getVectorOperand(),
4612 EEI->getIndexOperand(), Q);
4615 case Instruction::ShuffleVector: {
4616 auto *SVI = cast<ShuffleVectorInst>(I);
4617 Result = SimplifyShuffleVectorInst(SVI->getOperand(0), SVI->getOperand(1),
4618 SVI->getMask(), SVI->getType(), Q);
4621 case Instruction::PHI:
4622 Result = SimplifyPHINode(cast<PHINode>(I), Q);
4624 case Instruction::Call: {
4625 CallSite CS(cast<CallInst>(I));
4626 Result = SimplifyCall(CS.getCalledValue(), CS.arg_begin(), CS.arg_end(), Q);
4629 #define HANDLE_CAST_INST(num, opc, clas) case Instruction::opc:
4630 #include "llvm/IR/Instruction.def"
4631 #undef HANDLE_CAST_INST
4633 SimplifyCastInst(I->getOpcode(), I->getOperand(0), I->getType(), Q);
4635 case Instruction::Alloca:
4636 // No simplifications for Alloca and it can't be constant folded.
4641 // In general, it is possible for computeKnownBits to determine all bits in a
4642 // value even when the operands are not all constants.
4643 if (!Result && I->getType()->isIntOrIntVectorTy()) {
4644 unsigned BitWidth = I->getType()->getScalarSizeInBits();
4645 KnownBits Known(BitWidth);
4646 computeKnownBits(I, Known, Q.DL, /*Depth*/ 0, Q.AC, I, Q.DT, ORE);
4647 if (Known.isConstant())
4648 Result = ConstantInt::get(I->getType(), Known.getConstant());
4651 /// If called on unreachable code, the above logic may report that the
4652 /// instruction simplified to itself. Make life easier for users by
4653 /// detecting that case here, returning a safe value instead.
4654 return Result == I ? UndefValue::get(I->getType()) : Result;
4657 /// \brief Implementation of recursive simplification through an instruction's
4660 /// This is the common implementation of the recursive simplification routines.
4661 /// If we have a pre-simplified value in 'SimpleV', that is forcibly used to
4662 /// replace the instruction 'I'. Otherwise, we simply add 'I' to the list of
4663 /// instructions to process and attempt to simplify it using
4664 /// InstructionSimplify.
4666 /// This routine returns 'true' only when *it* simplifies something. The passed
4667 /// in simplified value does not count toward this.
4668 static bool replaceAndRecursivelySimplifyImpl(Instruction *I, Value *SimpleV,
4669 const TargetLibraryInfo *TLI,
4670 const DominatorTree *DT,
4671 AssumptionCache *AC) {
4672 bool Simplified = false;
4673 SmallSetVector<Instruction *, 8> Worklist;
4674 const DataLayout &DL = I->getModule()->getDataLayout();
4676 // If we have an explicit value to collapse to, do that round of the
4677 // simplification loop by hand initially.
4679 for (User *U : I->users())
4681 Worklist.insert(cast<Instruction>(U));
4683 // Replace the instruction with its simplified value.
4684 I->replaceAllUsesWith(SimpleV);
4686 // Gracefully handle edge cases where the instruction is not wired into any
4688 if (I->getParent() && !I->isEHPad() && !isa<TerminatorInst>(I) &&
4689 !I->mayHaveSideEffects())
4690 I->eraseFromParent();
4695 // Note that we must test the size on each iteration, the worklist can grow.
4696 for (unsigned Idx = 0; Idx != Worklist.size(); ++Idx) {
4699 // See if this instruction simplifies.
4700 SimpleV = SimplifyInstruction(I, {DL, TLI, DT, AC});
4706 // Stash away all the uses of the old instruction so we can check them for
4707 // recursive simplifications after a RAUW. This is cheaper than checking all
4708 // uses of To on the recursive step in most cases.
4709 for (User *U : I->users())
4710 Worklist.insert(cast<Instruction>(U));
4712 // Replace the instruction with its simplified value.
4713 I->replaceAllUsesWith(SimpleV);
4715 // Gracefully handle edge cases where the instruction is not wired into any
4717 if (I->getParent() && !I->isEHPad() && !isa<TerminatorInst>(I) &&
4718 !I->mayHaveSideEffects())
4719 I->eraseFromParent();
4724 bool llvm::recursivelySimplifyInstruction(Instruction *I,
4725 const TargetLibraryInfo *TLI,
4726 const DominatorTree *DT,
4727 AssumptionCache *AC) {
4728 return replaceAndRecursivelySimplifyImpl(I, nullptr, TLI, DT, AC);
4731 bool llvm::replaceAndRecursivelySimplify(Instruction *I, Value *SimpleV,
4732 const TargetLibraryInfo *TLI,
4733 const DominatorTree *DT,
4734 AssumptionCache *AC) {
4735 assert(I != SimpleV && "replaceAndRecursivelySimplify(X,X) is not valid!");
4736 assert(SimpleV && "Must provide a simplified value.");
4737 return replaceAndRecursivelySimplifyImpl(I, SimpleV, TLI, DT, AC);
4741 const SimplifyQuery getBestSimplifyQuery(Pass &P, Function &F) {
4742 auto *DTWP = P.getAnalysisIfAvailable<DominatorTreeWrapperPass>();
4743 auto *DT = DTWP ? &DTWP->getDomTree() : nullptr;
4744 auto *TLIWP = P.getAnalysisIfAvailable<TargetLibraryInfoWrapperPass>();
4745 auto *TLI = TLIWP ? &TLIWP->getTLI() : nullptr;
4746 auto *ACWP = P.getAnalysisIfAvailable<AssumptionCacheTracker>();
4747 auto *AC = ACWP ? &ACWP->getAssumptionCache(F) : nullptr;
4748 return {F.getParent()->getDataLayout(), TLI, DT, AC};
4751 const SimplifyQuery getBestSimplifyQuery(LoopStandardAnalysisResults &AR,
4752 const DataLayout &DL) {
4753 return {DL, &AR.TLI, &AR.DT, &AR.AC};
4756 template <class T, class... TArgs>
4757 const SimplifyQuery getBestSimplifyQuery(AnalysisManager<T, TArgs...> &AM,
4759 auto *DT = AM.template getCachedResult<DominatorTreeAnalysis>(F);
4760 auto *TLI = AM.template getCachedResult<TargetLibraryAnalysis>(F);
4761 auto *AC = AM.template getCachedResult<AssumptionAnalysis>(F);
4762 return {F.getParent()->getDataLayout(), TLI, DT, AC};
4764 template const SimplifyQuery getBestSimplifyQuery(AnalysisManager<Function> &,