1 //===- ValueTracking.cpp - Walk computations to compute properties --------===//
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 contains routines that help analyze properties that chains of
13 //===----------------------------------------------------------------------===//
15 #include "llvm/Analysis/ValueTracking.h"
16 #include "llvm/ADT/APFloat.h"
17 #include "llvm/ADT/APInt.h"
18 #include "llvm/ADT/ArrayRef.h"
19 #include "llvm/ADT/None.h"
20 #include "llvm/ADT/Optional.h"
21 #include "llvm/ADT/STLExtras.h"
22 #include "llvm/ADT/SmallPtrSet.h"
23 #include "llvm/ADT/SmallSet.h"
24 #include "llvm/ADT/SmallVector.h"
25 #include "llvm/ADT/StringRef.h"
26 #include "llvm/ADT/iterator_range.h"
27 #include "llvm/Analysis/AliasAnalysis.h"
28 #include "llvm/Analysis/AssumptionCache.h"
29 #include "llvm/Analysis/InstructionSimplify.h"
30 #include "llvm/Analysis/Loads.h"
31 #include "llvm/Analysis/LoopInfo.h"
32 #include "llvm/Analysis/OptimizationRemarkEmitter.h"
33 #include "llvm/Analysis/TargetLibraryInfo.h"
34 #include "llvm/IR/Argument.h"
35 #include "llvm/IR/Attributes.h"
36 #include "llvm/IR/BasicBlock.h"
37 #include "llvm/IR/CallSite.h"
38 #include "llvm/IR/Constant.h"
39 #include "llvm/IR/ConstantRange.h"
40 #include "llvm/IR/Constants.h"
41 #include "llvm/IR/DataLayout.h"
42 #include "llvm/IR/DerivedTypes.h"
43 #include "llvm/IR/DiagnosticInfo.h"
44 #include "llvm/IR/Dominators.h"
45 #include "llvm/IR/Function.h"
46 #include "llvm/IR/GetElementPtrTypeIterator.h"
47 #include "llvm/IR/GlobalAlias.h"
48 #include "llvm/IR/GlobalValue.h"
49 #include "llvm/IR/GlobalVariable.h"
50 #include "llvm/IR/InstrTypes.h"
51 #include "llvm/IR/Instruction.h"
52 #include "llvm/IR/Instructions.h"
53 #include "llvm/IR/IntrinsicInst.h"
54 #include "llvm/IR/Intrinsics.h"
55 #include "llvm/IR/LLVMContext.h"
56 #include "llvm/IR/Metadata.h"
57 #include "llvm/IR/Module.h"
58 #include "llvm/IR/Operator.h"
59 #include "llvm/IR/PatternMatch.h"
60 #include "llvm/IR/Type.h"
61 #include "llvm/IR/User.h"
62 #include "llvm/IR/Value.h"
63 #include "llvm/Support/Casting.h"
64 #include "llvm/Support/CommandLine.h"
65 #include "llvm/Support/Compiler.h"
66 #include "llvm/Support/ErrorHandling.h"
67 #include "llvm/Support/KnownBits.h"
68 #include "llvm/Support/MathExtras.h"
77 using namespace llvm::PatternMatch;
79 const unsigned MaxDepth = 6;
81 // Controls the number of uses of the value searched for possible
82 // dominating comparisons.
83 static cl::opt<unsigned> DomConditionsMaxUses("dom-conditions-max-uses",
84 cl::Hidden, cl::init(20));
86 /// Returns the bitwidth of the given scalar or pointer type. For vector types,
87 /// returns the element type's bitwidth.
88 static unsigned getBitWidth(Type *Ty, const DataLayout &DL) {
89 if (unsigned BitWidth = Ty->getScalarSizeInBits())
92 return DL.getIndexTypeSizeInBits(Ty);
97 // Simplifying using an assume can only be done in a particular control-flow
98 // context (the context instruction provides that context). If an assume and
99 // the context instruction are not in the same block then the DT helps in
100 // figuring out if we can use it.
102 const DataLayout &DL;
104 const Instruction *CxtI;
105 const DominatorTree *DT;
107 // Unlike the other analyses, this may be a nullptr because not all clients
108 // provide it currently.
109 OptimizationRemarkEmitter *ORE;
111 /// Set of assumptions that should be excluded from further queries.
112 /// This is because of the potential for mutual recursion to cause
113 /// computeKnownBits to repeatedly visit the same assume intrinsic. The
114 /// classic case of this is assume(x = y), which will attempt to determine
115 /// bits in x from bits in y, which will attempt to determine bits in y from
116 /// bits in x, etc. Regarding the mutual recursion, computeKnownBits can call
117 /// isKnownNonZero, which calls computeKnownBits and isKnownToBeAPowerOfTwo
118 /// (all of which can call computeKnownBits), and so on.
119 std::array<const Value *, MaxDepth> Excluded;
121 unsigned NumExcluded = 0;
123 Query(const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI,
124 const DominatorTree *DT, OptimizationRemarkEmitter *ORE = nullptr)
125 : DL(DL), AC(AC), CxtI(CxtI), DT(DT), ORE(ORE) {}
127 Query(const Query &Q, const Value *NewExcl)
128 : DL(Q.DL), AC(Q.AC), CxtI(Q.CxtI), DT(Q.DT), ORE(Q.ORE),
129 NumExcluded(Q.NumExcluded) {
130 Excluded = Q.Excluded;
131 Excluded[NumExcluded++] = NewExcl;
132 assert(NumExcluded <= Excluded.size());
135 bool isExcluded(const Value *Value) const {
136 if (NumExcluded == 0)
138 auto End = Excluded.begin() + NumExcluded;
139 return std::find(Excluded.begin(), End, Value) != End;
143 } // end anonymous namespace
145 // Given the provided Value and, potentially, a context instruction, return
146 // the preferred context instruction (if any).
147 static const Instruction *safeCxtI(const Value *V, const Instruction *CxtI) {
148 // If we've been provided with a context instruction, then use that (provided
149 // it has been inserted).
150 if (CxtI && CxtI->getParent())
153 // If the value is really an already-inserted instruction, then use that.
154 CxtI = dyn_cast<Instruction>(V);
155 if (CxtI && CxtI->getParent())
161 static void computeKnownBits(const Value *V, KnownBits &Known,
162 unsigned Depth, const Query &Q);
164 void llvm::computeKnownBits(const Value *V, KnownBits &Known,
165 const DataLayout &DL, unsigned Depth,
166 AssumptionCache *AC, const Instruction *CxtI,
167 const DominatorTree *DT,
168 OptimizationRemarkEmitter *ORE) {
169 ::computeKnownBits(V, Known, Depth,
170 Query(DL, AC, safeCxtI(V, CxtI), DT, ORE));
173 static KnownBits computeKnownBits(const Value *V, unsigned Depth,
176 KnownBits llvm::computeKnownBits(const Value *V, const DataLayout &DL,
177 unsigned Depth, AssumptionCache *AC,
178 const Instruction *CxtI,
179 const DominatorTree *DT,
180 OptimizationRemarkEmitter *ORE) {
181 return ::computeKnownBits(V, Depth,
182 Query(DL, AC, safeCxtI(V, CxtI), DT, ORE));
185 bool llvm::haveNoCommonBitsSet(const Value *LHS, const Value *RHS,
186 const DataLayout &DL,
187 AssumptionCache *AC, const Instruction *CxtI,
188 const DominatorTree *DT) {
189 assert(LHS->getType() == RHS->getType() &&
190 "LHS and RHS should have the same type");
191 assert(LHS->getType()->isIntOrIntVectorTy() &&
192 "LHS and RHS should be integers");
193 // Look for an inverted mask: (X & ~M) op (Y & M).
195 if (match(LHS, m_c_And(m_Not(m_Value(M)), m_Value())) &&
196 match(RHS, m_c_And(m_Specific(M), m_Value())))
198 if (match(RHS, m_c_And(m_Not(m_Value(M)), m_Value())) &&
199 match(LHS, m_c_And(m_Specific(M), m_Value())))
201 IntegerType *IT = cast<IntegerType>(LHS->getType()->getScalarType());
202 KnownBits LHSKnown(IT->getBitWidth());
203 KnownBits RHSKnown(IT->getBitWidth());
204 computeKnownBits(LHS, LHSKnown, DL, 0, AC, CxtI, DT);
205 computeKnownBits(RHS, RHSKnown, DL, 0, AC, CxtI, DT);
206 return (LHSKnown.Zero | RHSKnown.Zero).isAllOnesValue();
209 bool llvm::isOnlyUsedInZeroEqualityComparison(const Instruction *CxtI) {
210 for (const User *U : CxtI->users()) {
211 if (const ICmpInst *IC = dyn_cast<ICmpInst>(U))
212 if (IC->isEquality())
213 if (Constant *C = dyn_cast<Constant>(IC->getOperand(1)))
214 if (C->isNullValue())
221 static bool isKnownToBeAPowerOfTwo(const Value *V, bool OrZero, unsigned Depth,
224 bool llvm::isKnownToBeAPowerOfTwo(const Value *V, const DataLayout &DL,
226 unsigned Depth, AssumptionCache *AC,
227 const Instruction *CxtI,
228 const DominatorTree *DT) {
229 return ::isKnownToBeAPowerOfTwo(V, OrZero, Depth,
230 Query(DL, AC, safeCxtI(V, CxtI), DT));
233 static bool isKnownNonZero(const Value *V, unsigned Depth, const Query &Q);
235 bool llvm::isKnownNonZero(const Value *V, const DataLayout &DL, unsigned Depth,
236 AssumptionCache *AC, const Instruction *CxtI,
237 const DominatorTree *DT) {
238 return ::isKnownNonZero(V, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT));
241 bool llvm::isKnownNonNegative(const Value *V, const DataLayout &DL,
243 AssumptionCache *AC, const Instruction *CxtI,
244 const DominatorTree *DT) {
245 KnownBits Known = computeKnownBits(V, DL, Depth, AC, CxtI, DT);
246 return Known.isNonNegative();
249 bool llvm::isKnownPositive(const Value *V, const DataLayout &DL, unsigned Depth,
250 AssumptionCache *AC, const Instruction *CxtI,
251 const DominatorTree *DT) {
252 if (auto *CI = dyn_cast<ConstantInt>(V))
253 return CI->getValue().isStrictlyPositive();
255 // TODO: We'd doing two recursive queries here. We should factor this such
256 // that only a single query is needed.
257 return isKnownNonNegative(V, DL, Depth, AC, CxtI, DT) &&
258 isKnownNonZero(V, DL, Depth, AC, CxtI, DT);
261 bool llvm::isKnownNegative(const Value *V, const DataLayout &DL, unsigned Depth,
262 AssumptionCache *AC, const Instruction *CxtI,
263 const DominatorTree *DT) {
264 KnownBits Known = computeKnownBits(V, DL, Depth, AC, CxtI, DT);
265 return Known.isNegative();
268 static bool isKnownNonEqual(const Value *V1, const Value *V2, const Query &Q);
270 bool llvm::isKnownNonEqual(const Value *V1, const Value *V2,
271 const DataLayout &DL,
272 AssumptionCache *AC, const Instruction *CxtI,
273 const DominatorTree *DT) {
274 return ::isKnownNonEqual(V1, V2, Query(DL, AC,
275 safeCxtI(V1, safeCxtI(V2, CxtI)),
279 static bool MaskedValueIsZero(const Value *V, const APInt &Mask, unsigned Depth,
282 bool llvm::MaskedValueIsZero(const Value *V, const APInt &Mask,
283 const DataLayout &DL,
284 unsigned Depth, AssumptionCache *AC,
285 const Instruction *CxtI, const DominatorTree *DT) {
286 return ::MaskedValueIsZero(V, Mask, Depth,
287 Query(DL, AC, safeCxtI(V, CxtI), DT));
290 static unsigned ComputeNumSignBits(const Value *V, unsigned Depth,
293 unsigned llvm::ComputeNumSignBits(const Value *V, const DataLayout &DL,
294 unsigned Depth, AssumptionCache *AC,
295 const Instruction *CxtI,
296 const DominatorTree *DT) {
297 return ::ComputeNumSignBits(V, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT));
300 static void computeKnownBitsAddSub(bool Add, const Value *Op0, const Value *Op1,
302 KnownBits &KnownOut, KnownBits &Known2,
303 unsigned Depth, const Query &Q) {
304 unsigned BitWidth = KnownOut.getBitWidth();
306 // If an initial sequence of bits in the result is not needed, the
307 // corresponding bits in the operands are not needed.
308 KnownBits LHSKnown(BitWidth);
309 computeKnownBits(Op0, LHSKnown, Depth + 1, Q);
310 computeKnownBits(Op1, Known2, Depth + 1, Q);
312 KnownOut = KnownBits::computeForAddSub(Add, NSW, LHSKnown, Known2);
315 static void computeKnownBitsMul(const Value *Op0, const Value *Op1, bool NSW,
316 KnownBits &Known, KnownBits &Known2,
317 unsigned Depth, const Query &Q) {
318 unsigned BitWidth = Known.getBitWidth();
319 computeKnownBits(Op1, Known, Depth + 1, Q);
320 computeKnownBits(Op0, Known2, Depth + 1, Q);
322 bool isKnownNegative = false;
323 bool isKnownNonNegative = false;
324 // If the multiplication is known not to overflow, compute the sign bit.
327 // The product of a number with itself is non-negative.
328 isKnownNonNegative = true;
330 bool isKnownNonNegativeOp1 = Known.isNonNegative();
331 bool isKnownNonNegativeOp0 = Known2.isNonNegative();
332 bool isKnownNegativeOp1 = Known.isNegative();
333 bool isKnownNegativeOp0 = Known2.isNegative();
334 // The product of two numbers with the same sign is non-negative.
335 isKnownNonNegative = (isKnownNegativeOp1 && isKnownNegativeOp0) ||
336 (isKnownNonNegativeOp1 && isKnownNonNegativeOp0);
337 // The product of a negative number and a non-negative number is either
339 if (!isKnownNonNegative)
340 isKnownNegative = (isKnownNegativeOp1 && isKnownNonNegativeOp0 &&
341 isKnownNonZero(Op0, Depth, Q)) ||
342 (isKnownNegativeOp0 && isKnownNonNegativeOp1 &&
343 isKnownNonZero(Op1, Depth, Q));
347 assert(!Known.hasConflict() && !Known2.hasConflict());
348 // Compute a conservative estimate for high known-0 bits.
349 unsigned LeadZ = std::max(Known.countMinLeadingZeros() +
350 Known2.countMinLeadingZeros(),
351 BitWidth) - BitWidth;
352 LeadZ = std::min(LeadZ, BitWidth);
354 // The result of the bottom bits of an integer multiply can be
355 // inferred by looking at the bottom bits of both operands and
356 // multiplying them together.
357 // We can infer at least the minimum number of known trailing bits
358 // of both operands. Depending on number of trailing zeros, we can
359 // infer more bits, because (a*b) <=> ((a/m) * (b/n)) * (m*n) assuming
360 // a and b are divisible by m and n respectively.
361 // We then calculate how many of those bits are inferrable and set
362 // the output. For example, the i8 mul:
365 // We know the bottom 3 bits are zero since the first can be divided by
366 // 4 and the second by 2, thus having ((12/4) * (14/2)) * (2*4).
367 // Applying the multiplication to the trimmed arguments gets:
377 // Which allows us to infer the 2 LSBs. Since we're multiplying the result
378 // by 8, the bottom 3 bits will be 0, so we can infer a total of 5 bits.
379 // The proof for this can be described as:
380 // Pre: (C1 >= 0) && (C1 < (1 << C5)) && (C2 >= 0) && (C2 < (1 << C6)) &&
381 // (C7 == (1 << (umin(countTrailingZeros(C1), C5) +
382 // umin(countTrailingZeros(C2), C6) +
383 // umin(C5 - umin(countTrailingZeros(C1), C5),
384 // C6 - umin(countTrailingZeros(C2), C6)))) - 1)
385 // %aa = shl i8 %a, C5
386 // %bb = shl i8 %b, C6
387 // %aaa = or i8 %aa, C1
388 // %bbb = or i8 %bb, C2
389 // %mul = mul i8 %aaa, %bbb
390 // %mask = and i8 %mul, C7
392 // %mask = i8 ((C1*C2)&C7)
393 // Where C5, C6 describe the known bits of %a, %b
394 // C1, C2 describe the known bottom bits of %a, %b.
395 // C7 describes the mask of the known bits of the result.
396 APInt Bottom0 = Known.One;
397 APInt Bottom1 = Known2.One;
399 // How many times we'd be able to divide each argument by 2 (shr by 1).
400 // This gives us the number of trailing zeros on the multiplication result.
401 unsigned TrailBitsKnown0 = (Known.Zero | Known.One).countTrailingOnes();
402 unsigned TrailBitsKnown1 = (Known2.Zero | Known2.One).countTrailingOnes();
403 unsigned TrailZero0 = Known.countMinTrailingZeros();
404 unsigned TrailZero1 = Known2.countMinTrailingZeros();
405 unsigned TrailZ = TrailZero0 + TrailZero1;
407 // Figure out the fewest known-bits operand.
408 unsigned SmallestOperand = std::min(TrailBitsKnown0 - TrailZero0,
409 TrailBitsKnown1 - TrailZero1);
410 unsigned ResultBitsKnown = std::min(SmallestOperand + TrailZ, BitWidth);
412 APInt BottomKnown = Bottom0.getLoBits(TrailBitsKnown0) *
413 Bottom1.getLoBits(TrailBitsKnown1);
416 Known.Zero.setHighBits(LeadZ);
417 Known.Zero |= (~BottomKnown).getLoBits(ResultBitsKnown);
418 Known.One |= BottomKnown.getLoBits(ResultBitsKnown);
420 // Only make use of no-wrap flags if we failed to compute the sign bit
421 // directly. This matters if the multiplication always overflows, in
422 // which case we prefer to follow the result of the direct computation,
423 // though as the program is invoking undefined behaviour we can choose
424 // whatever we like here.
425 if (isKnownNonNegative && !Known.isNegative())
426 Known.makeNonNegative();
427 else if (isKnownNegative && !Known.isNonNegative())
428 Known.makeNegative();
431 void llvm::computeKnownBitsFromRangeMetadata(const MDNode &Ranges,
433 unsigned BitWidth = Known.getBitWidth();
434 unsigned NumRanges = Ranges.getNumOperands() / 2;
435 assert(NumRanges >= 1);
437 Known.Zero.setAllBits();
438 Known.One.setAllBits();
440 for (unsigned i = 0; i < NumRanges; ++i) {
442 mdconst::extract<ConstantInt>(Ranges.getOperand(2 * i + 0));
444 mdconst::extract<ConstantInt>(Ranges.getOperand(2 * i + 1));
445 ConstantRange Range(Lower->getValue(), Upper->getValue());
447 // The first CommonPrefixBits of all values in Range are equal.
448 unsigned CommonPrefixBits =
449 (Range.getUnsignedMax() ^ Range.getUnsignedMin()).countLeadingZeros();
451 APInt Mask = APInt::getHighBitsSet(BitWidth, CommonPrefixBits);
452 Known.One &= Range.getUnsignedMax() & Mask;
453 Known.Zero &= ~Range.getUnsignedMax() & Mask;
457 static bool isEphemeralValueOf(const Instruction *I, const Value *E) {
458 SmallVector<const Value *, 16> WorkSet(1, I);
459 SmallPtrSet<const Value *, 32> Visited;
460 SmallPtrSet<const Value *, 16> EphValues;
462 // The instruction defining an assumption's condition itself is always
463 // considered ephemeral to that assumption (even if it has other
464 // non-ephemeral users). See r246696's test case for an example.
465 if (is_contained(I->operands(), E))
468 while (!WorkSet.empty()) {
469 const Value *V = WorkSet.pop_back_val();
470 if (!Visited.insert(V).second)
473 // If all uses of this value are ephemeral, then so is this value.
474 if (llvm::all_of(V->users(), [&](const User *U) {
475 return EphValues.count(U);
480 if (V == I || isSafeToSpeculativelyExecute(V)) {
482 if (const User *U = dyn_cast<User>(V))
483 for (User::const_op_iterator J = U->op_begin(), JE = U->op_end();
485 WorkSet.push_back(*J);
493 // Is this an intrinsic that cannot be speculated but also cannot trap?
494 bool llvm::isAssumeLikeIntrinsic(const Instruction *I) {
495 if (const CallInst *CI = dyn_cast<CallInst>(I))
496 if (Function *F = CI->getCalledFunction())
497 switch (F->getIntrinsicID()) {
499 // FIXME: This list is repeated from NoTTI::getIntrinsicCost.
500 case Intrinsic::assume:
501 case Intrinsic::sideeffect:
502 case Intrinsic::dbg_declare:
503 case Intrinsic::dbg_value:
504 case Intrinsic::dbg_label:
505 case Intrinsic::invariant_start:
506 case Intrinsic::invariant_end:
507 case Intrinsic::lifetime_start:
508 case Intrinsic::lifetime_end:
509 case Intrinsic::objectsize:
510 case Intrinsic::ptr_annotation:
511 case Intrinsic::var_annotation:
518 bool llvm::isValidAssumeForContext(const Instruction *Inv,
519 const Instruction *CxtI,
520 const DominatorTree *DT) {
521 // There are two restrictions on the use of an assume:
522 // 1. The assume must dominate the context (or the control flow must
523 // reach the assume whenever it reaches the context).
524 // 2. The context must not be in the assume's set of ephemeral values
525 // (otherwise we will use the assume to prove that the condition
526 // feeding the assume is trivially true, thus causing the removal of
530 if (DT->dominates(Inv, CxtI))
532 } else if (Inv->getParent() == CxtI->getParent()->getSinglePredecessor()) {
533 // We don't have a DT, but this trivially dominates.
537 // With or without a DT, the only remaining case we will check is if the
538 // instructions are in the same BB. Give up if that is not the case.
539 if (Inv->getParent() != CxtI->getParent())
542 // If we have a dom tree, then we now know that the assume doesn't dominate
543 // the other instruction. If we don't have a dom tree then we can check if
544 // the assume is first in the BB.
546 // Search forward from the assume until we reach the context (or the end
547 // of the block); the common case is that the assume will come first.
548 for (auto I = std::next(BasicBlock::const_iterator(Inv)),
549 IE = Inv->getParent()->end(); I != IE; ++I)
554 // The context comes first, but they're both in the same block. Make sure
555 // there is nothing in between that might interrupt the control flow.
556 for (BasicBlock::const_iterator I =
557 std::next(BasicBlock::const_iterator(CxtI)), IE(Inv);
559 if (!isSafeToSpeculativelyExecute(&*I) && !isAssumeLikeIntrinsic(&*I))
562 return !isEphemeralValueOf(Inv, CxtI);
565 static void computeKnownBitsFromAssume(const Value *V, KnownBits &Known,
566 unsigned Depth, const Query &Q) {
567 // Use of assumptions is context-sensitive. If we don't have a context, we
569 if (!Q.AC || !Q.CxtI)
572 unsigned BitWidth = Known.getBitWidth();
574 // Note that the patterns below need to be kept in sync with the code
575 // in AssumptionCache::updateAffectedValues.
577 for (auto &AssumeVH : Q.AC->assumptionsFor(V)) {
580 CallInst *I = cast<CallInst>(AssumeVH);
581 assert(I->getParent()->getParent() == Q.CxtI->getParent()->getParent() &&
582 "Got assumption for the wrong function!");
586 // Warning: This loop can end up being somewhat performance sensitive.
587 // We're running this loop for once for each value queried resulting in a
588 // runtime of ~O(#assumes * #values).
590 assert(I->getCalledFunction()->getIntrinsicID() == Intrinsic::assume &&
591 "must be an assume intrinsic");
593 Value *Arg = I->getArgOperand(0);
595 if (Arg == V && isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
596 assert(BitWidth == 1 && "assume operand is not i1?");
600 if (match(Arg, m_Not(m_Specific(V))) &&
601 isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
602 assert(BitWidth == 1 && "assume operand is not i1?");
607 // The remaining tests are all recursive, so bail out if we hit the limit.
608 if (Depth == MaxDepth)
612 auto m_V = m_CombineOr(m_Specific(V),
613 m_CombineOr(m_PtrToInt(m_Specific(V)),
614 m_BitCast(m_Specific(V))));
616 CmpInst::Predicate Pred;
619 if (match(Arg, m_c_ICmp(Pred, m_V, m_Value(A))) &&
620 Pred == ICmpInst::ICMP_EQ && isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
621 KnownBits RHSKnown(BitWidth);
622 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
623 Known.Zero |= RHSKnown.Zero;
624 Known.One |= RHSKnown.One;
626 } else if (match(Arg,
627 m_c_ICmp(Pred, m_c_And(m_V, m_Value(B)), m_Value(A))) &&
628 Pred == ICmpInst::ICMP_EQ &&
629 isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
630 KnownBits RHSKnown(BitWidth);
631 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
632 KnownBits MaskKnown(BitWidth);
633 computeKnownBits(B, MaskKnown, Depth+1, Query(Q, I));
635 // For those bits in the mask that are known to be one, we can propagate
636 // known bits from the RHS to V.
637 Known.Zero |= RHSKnown.Zero & MaskKnown.One;
638 Known.One |= RHSKnown.One & MaskKnown.One;
639 // assume(~(v & b) = a)
640 } else if (match(Arg, m_c_ICmp(Pred, m_Not(m_c_And(m_V, m_Value(B))),
642 Pred == ICmpInst::ICMP_EQ &&
643 isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
644 KnownBits RHSKnown(BitWidth);
645 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
646 KnownBits MaskKnown(BitWidth);
647 computeKnownBits(B, MaskKnown, Depth+1, Query(Q, I));
649 // For those bits in the mask that are known to be one, we can propagate
650 // inverted known bits from the RHS to V.
651 Known.Zero |= RHSKnown.One & MaskKnown.One;
652 Known.One |= RHSKnown.Zero & MaskKnown.One;
654 } else if (match(Arg,
655 m_c_ICmp(Pred, m_c_Or(m_V, m_Value(B)), m_Value(A))) &&
656 Pred == ICmpInst::ICMP_EQ &&
657 isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
658 KnownBits RHSKnown(BitWidth);
659 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
660 KnownBits BKnown(BitWidth);
661 computeKnownBits(B, BKnown, Depth+1, Query(Q, I));
663 // For those bits in B that are known to be zero, we can propagate known
664 // bits from the RHS to V.
665 Known.Zero |= RHSKnown.Zero & BKnown.Zero;
666 Known.One |= RHSKnown.One & BKnown.Zero;
667 // assume(~(v | b) = a)
668 } else if (match(Arg, m_c_ICmp(Pred, m_Not(m_c_Or(m_V, m_Value(B))),
670 Pred == ICmpInst::ICMP_EQ &&
671 isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
672 KnownBits RHSKnown(BitWidth);
673 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
674 KnownBits BKnown(BitWidth);
675 computeKnownBits(B, BKnown, Depth+1, Query(Q, I));
677 // For those bits in B that are known to be zero, we can propagate
678 // inverted known bits from the RHS to V.
679 Known.Zero |= RHSKnown.One & BKnown.Zero;
680 Known.One |= RHSKnown.Zero & BKnown.Zero;
682 } else if (match(Arg,
683 m_c_ICmp(Pred, m_c_Xor(m_V, m_Value(B)), m_Value(A))) &&
684 Pred == ICmpInst::ICMP_EQ &&
685 isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
686 KnownBits RHSKnown(BitWidth);
687 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
688 KnownBits BKnown(BitWidth);
689 computeKnownBits(B, BKnown, Depth+1, Query(Q, I));
691 // For those bits in B that are known to be zero, we can propagate known
692 // bits from the RHS to V. For those bits in B that are known to be one,
693 // we can propagate inverted known bits from the RHS to V.
694 Known.Zero |= RHSKnown.Zero & BKnown.Zero;
695 Known.One |= RHSKnown.One & BKnown.Zero;
696 Known.Zero |= RHSKnown.One & BKnown.One;
697 Known.One |= RHSKnown.Zero & BKnown.One;
698 // assume(~(v ^ b) = a)
699 } else if (match(Arg, m_c_ICmp(Pred, m_Not(m_c_Xor(m_V, m_Value(B))),
701 Pred == ICmpInst::ICMP_EQ &&
702 isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
703 KnownBits RHSKnown(BitWidth);
704 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
705 KnownBits BKnown(BitWidth);
706 computeKnownBits(B, BKnown, Depth+1, Query(Q, I));
708 // For those bits in B that are known to be zero, we can propagate
709 // inverted known bits from the RHS to V. For those bits in B that are
710 // known to be one, we can propagate known bits from the RHS to V.
711 Known.Zero |= RHSKnown.One & BKnown.Zero;
712 Known.One |= RHSKnown.Zero & BKnown.Zero;
713 Known.Zero |= RHSKnown.Zero & BKnown.One;
714 Known.One |= RHSKnown.One & BKnown.One;
715 // assume(v << c = a)
716 } else if (match(Arg, m_c_ICmp(Pred, m_Shl(m_V, m_ConstantInt(C)),
718 Pred == ICmpInst::ICMP_EQ &&
719 isValidAssumeForContext(I, Q.CxtI, Q.DT) &&
721 KnownBits RHSKnown(BitWidth);
722 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
723 // For those bits in RHS that are known, we can propagate them to known
724 // bits in V shifted to the right by C.
725 RHSKnown.Zero.lshrInPlace(C);
726 Known.Zero |= RHSKnown.Zero;
727 RHSKnown.One.lshrInPlace(C);
728 Known.One |= RHSKnown.One;
729 // assume(~(v << c) = a)
730 } else if (match(Arg, m_c_ICmp(Pred, m_Not(m_Shl(m_V, m_ConstantInt(C))),
732 Pred == ICmpInst::ICMP_EQ &&
733 isValidAssumeForContext(I, Q.CxtI, Q.DT) &&
735 KnownBits RHSKnown(BitWidth);
736 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
737 // For those bits in RHS that are known, we can propagate them inverted
738 // to known bits in V shifted to the right by C.
739 RHSKnown.One.lshrInPlace(C);
740 Known.Zero |= RHSKnown.One;
741 RHSKnown.Zero.lshrInPlace(C);
742 Known.One |= RHSKnown.Zero;
743 // assume(v >> c = a)
744 } else if (match(Arg,
745 m_c_ICmp(Pred, m_Shr(m_V, m_ConstantInt(C)),
747 Pred == ICmpInst::ICMP_EQ &&
748 isValidAssumeForContext(I, Q.CxtI, Q.DT) &&
750 KnownBits RHSKnown(BitWidth);
751 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
752 // For those bits in RHS that are known, we can propagate them to known
753 // bits in V shifted to the right by C.
754 Known.Zero |= RHSKnown.Zero << C;
755 Known.One |= RHSKnown.One << C;
756 // assume(~(v >> c) = a)
757 } else if (match(Arg, m_c_ICmp(Pred, m_Not(m_Shr(m_V, m_ConstantInt(C))),
759 Pred == ICmpInst::ICMP_EQ &&
760 isValidAssumeForContext(I, Q.CxtI, Q.DT) &&
762 KnownBits RHSKnown(BitWidth);
763 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
764 // For those bits in RHS that are known, we can propagate them inverted
765 // to known bits in V shifted to the right by C.
766 Known.Zero |= RHSKnown.One << C;
767 Known.One |= RHSKnown.Zero << C;
768 // assume(v >=_s c) where c is non-negative
769 } else if (match(Arg, m_ICmp(Pred, m_V, m_Value(A))) &&
770 Pred == ICmpInst::ICMP_SGE &&
771 isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
772 KnownBits RHSKnown(BitWidth);
773 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
775 if (RHSKnown.isNonNegative()) {
776 // We know that the sign bit is zero.
777 Known.makeNonNegative();
779 // assume(v >_s c) where c is at least -1.
780 } else if (match(Arg, m_ICmp(Pred, m_V, m_Value(A))) &&
781 Pred == ICmpInst::ICMP_SGT &&
782 isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
783 KnownBits RHSKnown(BitWidth);
784 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
786 if (RHSKnown.isAllOnes() || RHSKnown.isNonNegative()) {
787 // We know that the sign bit is zero.
788 Known.makeNonNegative();
790 // assume(v <=_s c) where c is negative
791 } else if (match(Arg, m_ICmp(Pred, m_V, m_Value(A))) &&
792 Pred == ICmpInst::ICMP_SLE &&
793 isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
794 KnownBits RHSKnown(BitWidth);
795 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
797 if (RHSKnown.isNegative()) {
798 // We know that the sign bit is one.
799 Known.makeNegative();
801 // assume(v <_s c) where c is non-positive
802 } else if (match(Arg, m_ICmp(Pred, m_V, m_Value(A))) &&
803 Pred == ICmpInst::ICMP_SLT &&
804 isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
805 KnownBits RHSKnown(BitWidth);
806 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
808 if (RHSKnown.isZero() || RHSKnown.isNegative()) {
809 // We know that the sign bit is one.
810 Known.makeNegative();
813 } else if (match(Arg, m_ICmp(Pred, m_V, m_Value(A))) &&
814 Pred == ICmpInst::ICMP_ULE &&
815 isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
816 KnownBits RHSKnown(BitWidth);
817 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
819 // Whatever high bits in c are zero are known to be zero.
820 Known.Zero.setHighBits(RHSKnown.countMinLeadingZeros());
822 } else if (match(Arg, m_ICmp(Pred, m_V, m_Value(A))) &&
823 Pred == ICmpInst::ICMP_ULT &&
824 isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
825 KnownBits RHSKnown(BitWidth);
826 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
828 // If the RHS is known zero, then this assumption must be wrong (nothing
829 // is unsigned less than zero). Signal a conflict and get out of here.
830 if (RHSKnown.isZero()) {
831 Known.Zero.setAllBits();
832 Known.One.setAllBits();
836 // Whatever high bits in c are zero are known to be zero (if c is a power
837 // of 2, then one more).
838 if (isKnownToBeAPowerOfTwo(A, false, Depth + 1, Query(Q, I)))
839 Known.Zero.setHighBits(RHSKnown.countMinLeadingZeros() + 1);
841 Known.Zero.setHighBits(RHSKnown.countMinLeadingZeros());
845 // If assumptions conflict with each other or previous known bits, then we
846 // have a logical fallacy. It's possible that the assumption is not reachable,
847 // so this isn't a real bug. On the other hand, the program may have undefined
848 // behavior, or we might have a bug in the compiler. We can't assert/crash, so
849 // clear out the known bits, try to warn the user, and hope for the best.
850 if (Known.Zero.intersects(Known.One)) {
855 auto *CxtI = const_cast<Instruction *>(Q.CxtI);
856 return OptimizationRemarkAnalysis("value-tracking", "BadAssumption",
858 << "Detected conflicting code assumptions. Program may "
859 "have undefined behavior, or compiler may have "
865 /// Compute known bits from a shift operator, including those with a
866 /// non-constant shift amount. Known is the output of this function. Known2 is a
867 /// pre-allocated temporary with the same bit width as Known. KZF and KOF are
868 /// operator-specific functions that, given the known-zero or known-one bits
869 /// respectively, and a shift amount, compute the implied known-zero or
870 /// known-one bits of the shift operator's result respectively for that shift
871 /// amount. The results from calling KZF and KOF are conservatively combined for
872 /// all permitted shift amounts.
873 static void computeKnownBitsFromShiftOperator(
874 const Operator *I, KnownBits &Known, KnownBits &Known2,
875 unsigned Depth, const Query &Q,
876 function_ref<APInt(const APInt &, unsigned)> KZF,
877 function_ref<APInt(const APInt &, unsigned)> KOF) {
878 unsigned BitWidth = Known.getBitWidth();
880 if (auto *SA = dyn_cast<ConstantInt>(I->getOperand(1))) {
881 unsigned ShiftAmt = SA->getLimitedValue(BitWidth-1);
883 computeKnownBits(I->getOperand(0), Known, Depth + 1, Q);
884 Known.Zero = KZF(Known.Zero, ShiftAmt);
885 Known.One = KOF(Known.One, ShiftAmt);
886 // If the known bits conflict, this must be an overflowing left shift, so
887 // the shift result is poison. We can return anything we want. Choose 0 for
888 // the best folding opportunity.
889 if (Known.hasConflict())
895 computeKnownBits(I->getOperand(1), Known, Depth + 1, Q);
897 // If the shift amount could be greater than or equal to the bit-width of the
898 // LHS, the value could be poison, but bail out because the check below is
899 // expensive. TODO: Should we just carry on?
900 if ((~Known.Zero).uge(BitWidth)) {
905 // Note: We cannot use Known.Zero.getLimitedValue() here, because if
906 // BitWidth > 64 and any upper bits are known, we'll end up returning the
907 // limit value (which implies all bits are known).
908 uint64_t ShiftAmtKZ = Known.Zero.zextOrTrunc(64).getZExtValue();
909 uint64_t ShiftAmtKO = Known.One.zextOrTrunc(64).getZExtValue();
911 // It would be more-clearly correct to use the two temporaries for this
912 // calculation. Reusing the APInts here to prevent unnecessary allocations.
915 // If we know the shifter operand is nonzero, we can sometimes infer more
916 // known bits. However this is expensive to compute, so be lazy about it and
917 // only compute it when absolutely necessary.
918 Optional<bool> ShifterOperandIsNonZero;
920 // Early exit if we can't constrain any well-defined shift amount.
921 if (!(ShiftAmtKZ & (PowerOf2Ceil(BitWidth) - 1)) &&
922 !(ShiftAmtKO & (PowerOf2Ceil(BitWidth) - 1))) {
923 ShifterOperandIsNonZero = isKnownNonZero(I->getOperand(1), Depth + 1, Q);
924 if (!*ShifterOperandIsNonZero)
928 computeKnownBits(I->getOperand(0), Known2, Depth + 1, Q);
930 Known.Zero.setAllBits();
931 Known.One.setAllBits();
932 for (unsigned ShiftAmt = 0; ShiftAmt < BitWidth; ++ShiftAmt) {
933 // Combine the shifted known input bits only for those shift amounts
934 // compatible with its known constraints.
935 if ((ShiftAmt & ~ShiftAmtKZ) != ShiftAmt)
937 if ((ShiftAmt | ShiftAmtKO) != ShiftAmt)
939 // If we know the shifter is nonzero, we may be able to infer more known
940 // bits. This check is sunk down as far as possible to avoid the expensive
941 // call to isKnownNonZero if the cheaper checks above fail.
943 if (!ShifterOperandIsNonZero.hasValue())
944 ShifterOperandIsNonZero =
945 isKnownNonZero(I->getOperand(1), Depth + 1, Q);
946 if (*ShifterOperandIsNonZero)
950 Known.Zero &= KZF(Known2.Zero, ShiftAmt);
951 Known.One &= KOF(Known2.One, ShiftAmt);
954 // If the known bits conflict, the result is poison. Return a 0 and hope the
955 // caller can further optimize that.
956 if (Known.hasConflict())
960 static void computeKnownBitsFromOperator(const Operator *I, KnownBits &Known,
961 unsigned Depth, const Query &Q) {
962 unsigned BitWidth = Known.getBitWidth();
964 KnownBits Known2(Known);
965 switch (I->getOpcode()) {
967 case Instruction::Load:
968 if (MDNode *MD = cast<LoadInst>(I)->getMetadata(LLVMContext::MD_range))
969 computeKnownBitsFromRangeMetadata(*MD, Known);
971 case Instruction::And: {
972 // If either the LHS or the RHS are Zero, the result is zero.
973 computeKnownBits(I->getOperand(1), Known, Depth + 1, Q);
974 computeKnownBits(I->getOperand(0), Known2, Depth + 1, Q);
976 // Output known-1 bits are only known if set in both the LHS & RHS.
977 Known.One &= Known2.One;
978 // Output known-0 are known to be clear if zero in either the LHS | RHS.
979 Known.Zero |= Known2.Zero;
981 // and(x, add (x, -1)) is a common idiom that always clears the low bit;
982 // here we handle the more general case of adding any odd number by
983 // matching the form add(x, add(x, y)) where y is odd.
984 // TODO: This could be generalized to clearing any bit set in y where the
985 // following bit is known to be unset in y.
986 Value *X = nullptr, *Y = nullptr;
987 if (!Known.Zero[0] && !Known.One[0] &&
988 match(I, m_c_BinOp(m_Value(X), m_Add(m_Deferred(X), m_Value(Y))))) {
990 computeKnownBits(Y, Known2, Depth + 1, Q);
991 if (Known2.countMinTrailingOnes() > 0)
992 Known.Zero.setBit(0);
996 case Instruction::Or:
997 computeKnownBits(I->getOperand(1), Known, Depth + 1, Q);
998 computeKnownBits(I->getOperand(0), Known2, Depth + 1, Q);
1000 // Output known-0 bits are only known if clear in both the LHS & RHS.
1001 Known.Zero &= Known2.Zero;
1002 // Output known-1 are known to be set if set in either the LHS | RHS.
1003 Known.One |= Known2.One;
1005 case Instruction::Xor: {
1006 computeKnownBits(I->getOperand(1), Known, Depth + 1, Q);
1007 computeKnownBits(I->getOperand(0), Known2, Depth + 1, Q);
1009 // Output known-0 bits are known if clear or set in both the LHS & RHS.
1010 APInt KnownZeroOut = (Known.Zero & Known2.Zero) | (Known.One & Known2.One);
1011 // Output known-1 are known to be set if set in only one of the LHS, RHS.
1012 Known.One = (Known.Zero & Known2.One) | (Known.One & Known2.Zero);
1013 Known.Zero = std::move(KnownZeroOut);
1016 case Instruction::Mul: {
1017 bool NSW = cast<OverflowingBinaryOperator>(I)->hasNoSignedWrap();
1018 computeKnownBitsMul(I->getOperand(0), I->getOperand(1), NSW, Known,
1022 case Instruction::UDiv: {
1023 // For the purposes of computing leading zeros we can conservatively
1024 // treat a udiv as a logical right shift by the power of 2 known to
1025 // be less than the denominator.
1026 computeKnownBits(I->getOperand(0), Known2, Depth + 1, Q);
1027 unsigned LeadZ = Known2.countMinLeadingZeros();
1030 computeKnownBits(I->getOperand(1), Known2, Depth + 1, Q);
1031 unsigned RHSMaxLeadingZeros = Known2.countMaxLeadingZeros();
1032 if (RHSMaxLeadingZeros != BitWidth)
1033 LeadZ = std::min(BitWidth, LeadZ + BitWidth - RHSMaxLeadingZeros - 1);
1035 Known.Zero.setHighBits(LeadZ);
1038 case Instruction::Select: {
1039 const Value *LHS, *RHS;
1040 SelectPatternFlavor SPF = matchSelectPattern(I, LHS, RHS).Flavor;
1041 if (SelectPatternResult::isMinOrMax(SPF)) {
1042 computeKnownBits(RHS, Known, Depth + 1, Q);
1043 computeKnownBits(LHS, Known2, Depth + 1, Q);
1045 computeKnownBits(I->getOperand(2), Known, Depth + 1, Q);
1046 computeKnownBits(I->getOperand(1), Known2, Depth + 1, Q);
1049 unsigned MaxHighOnes = 0;
1050 unsigned MaxHighZeros = 0;
1051 if (SPF == SPF_SMAX) {
1052 // If both sides are negative, the result is negative.
1053 if (Known.isNegative() && Known2.isNegative())
1054 // We can derive a lower bound on the result by taking the max of the
1055 // leading one bits.
1057 std::max(Known.countMinLeadingOnes(), Known2.countMinLeadingOnes());
1058 // If either side is non-negative, the result is non-negative.
1059 else if (Known.isNonNegative() || Known2.isNonNegative())
1061 } else if (SPF == SPF_SMIN) {
1062 // If both sides are non-negative, the result is non-negative.
1063 if (Known.isNonNegative() && Known2.isNonNegative())
1064 // We can derive an upper bound on the result by taking the max of the
1065 // leading zero bits.
1066 MaxHighZeros = std::max(Known.countMinLeadingZeros(),
1067 Known2.countMinLeadingZeros());
1068 // If either side is negative, the result is negative.
1069 else if (Known.isNegative() || Known2.isNegative())
1071 } else if (SPF == SPF_UMAX) {
1072 // We can derive a lower bound on the result by taking the max of the
1073 // leading one bits.
1075 std::max(Known.countMinLeadingOnes(), Known2.countMinLeadingOnes());
1076 } else if (SPF == SPF_UMIN) {
1077 // We can derive an upper bound on the result by taking the max of the
1078 // leading zero bits.
1080 std::max(Known.countMinLeadingZeros(), Known2.countMinLeadingZeros());
1081 } else if (SPF == SPF_ABS) {
1082 // RHS from matchSelectPattern returns the negation part of abs pattern.
1083 // If the negate has an NSW flag we can assume the sign bit of the result
1084 // will be 0 because that makes abs(INT_MIN) undefined.
1085 if (cast<Instruction>(RHS)->hasNoSignedWrap())
1089 // Only known if known in both the LHS and RHS.
1090 Known.One &= Known2.One;
1091 Known.Zero &= Known2.Zero;
1092 if (MaxHighOnes > 0)
1093 Known.One.setHighBits(MaxHighOnes);
1094 if (MaxHighZeros > 0)
1095 Known.Zero.setHighBits(MaxHighZeros);
1098 case Instruction::FPTrunc:
1099 case Instruction::FPExt:
1100 case Instruction::FPToUI:
1101 case Instruction::FPToSI:
1102 case Instruction::SIToFP:
1103 case Instruction::UIToFP:
1104 break; // Can't work with floating point.
1105 case Instruction::PtrToInt:
1106 case Instruction::IntToPtr:
1107 // Fall through and handle them the same as zext/trunc.
1109 case Instruction::ZExt:
1110 case Instruction::Trunc: {
1111 Type *SrcTy = I->getOperand(0)->getType();
1113 unsigned SrcBitWidth;
1114 // Note that we handle pointer operands here because of inttoptr/ptrtoint
1115 // which fall through here.
1116 Type *ScalarTy = SrcTy->getScalarType();
1117 SrcBitWidth = ScalarTy->isPointerTy() ?
1118 Q.DL.getIndexTypeSizeInBits(ScalarTy) :
1119 Q.DL.getTypeSizeInBits(ScalarTy);
1121 assert(SrcBitWidth && "SrcBitWidth can't be zero");
1122 Known = Known.zextOrTrunc(SrcBitWidth);
1123 computeKnownBits(I->getOperand(0), Known, Depth + 1, Q);
1124 Known = Known.zextOrTrunc(BitWidth);
1125 // Any top bits are known to be zero.
1126 if (BitWidth > SrcBitWidth)
1127 Known.Zero.setBitsFrom(SrcBitWidth);
1130 case Instruction::BitCast: {
1131 Type *SrcTy = I->getOperand(0)->getType();
1132 if ((SrcTy->isIntegerTy() || SrcTy->isPointerTy()) &&
1133 // TODO: For now, not handling conversions like:
1134 // (bitcast i64 %x to <2 x i32>)
1135 !I->getType()->isVectorTy()) {
1136 computeKnownBits(I->getOperand(0), Known, Depth + 1, Q);
1141 case Instruction::SExt: {
1142 // Compute the bits in the result that are not present in the input.
1143 unsigned SrcBitWidth = I->getOperand(0)->getType()->getScalarSizeInBits();
1145 Known = Known.trunc(SrcBitWidth);
1146 computeKnownBits(I->getOperand(0), Known, Depth + 1, Q);
1147 // If the sign bit of the input is known set or clear, then we know the
1148 // top bits of the result.
1149 Known = Known.sext(BitWidth);
1152 case Instruction::Shl: {
1153 // (shl X, C1) & C2 == 0 iff (X & C2 >>u C1) == 0
1154 bool NSW = cast<OverflowingBinaryOperator>(I)->hasNoSignedWrap();
1155 auto KZF = [NSW](const APInt &KnownZero, unsigned ShiftAmt) {
1156 APInt KZResult = KnownZero << ShiftAmt;
1157 KZResult.setLowBits(ShiftAmt); // Low bits known 0.
1158 // If this shift has "nsw" keyword, then the result is either a poison
1159 // value or has the same sign bit as the first operand.
1160 if (NSW && KnownZero.isSignBitSet())
1161 KZResult.setSignBit();
1165 auto KOF = [NSW](const APInt &KnownOne, unsigned ShiftAmt) {
1166 APInt KOResult = KnownOne << ShiftAmt;
1167 if (NSW && KnownOne.isSignBitSet())
1168 KOResult.setSignBit();
1172 computeKnownBitsFromShiftOperator(I, Known, Known2, Depth, Q, KZF, KOF);
1175 case Instruction::LShr: {
1176 // (lshr X, C1) & C2 == 0 iff (-1 >> C1) & C2 == 0
1177 auto KZF = [](const APInt &KnownZero, unsigned ShiftAmt) {
1178 APInt KZResult = KnownZero.lshr(ShiftAmt);
1179 // High bits known zero.
1180 KZResult.setHighBits(ShiftAmt);
1184 auto KOF = [](const APInt &KnownOne, unsigned ShiftAmt) {
1185 return KnownOne.lshr(ShiftAmt);
1188 computeKnownBitsFromShiftOperator(I, Known, Known2, Depth, Q, KZF, KOF);
1191 case Instruction::AShr: {
1192 // (ashr X, C1) & C2 == 0 iff (-1 >> C1) & C2 == 0
1193 auto KZF = [](const APInt &KnownZero, unsigned ShiftAmt) {
1194 return KnownZero.ashr(ShiftAmt);
1197 auto KOF = [](const APInt &KnownOne, unsigned ShiftAmt) {
1198 return KnownOne.ashr(ShiftAmt);
1201 computeKnownBitsFromShiftOperator(I, Known, Known2, Depth, Q, KZF, KOF);
1204 case Instruction::Sub: {
1205 bool NSW = cast<OverflowingBinaryOperator>(I)->hasNoSignedWrap();
1206 computeKnownBitsAddSub(false, I->getOperand(0), I->getOperand(1), NSW,
1207 Known, Known2, Depth, Q);
1210 case Instruction::Add: {
1211 bool NSW = cast<OverflowingBinaryOperator>(I)->hasNoSignedWrap();
1212 computeKnownBitsAddSub(true, I->getOperand(0), I->getOperand(1), NSW,
1213 Known, Known2, Depth, Q);
1216 case Instruction::SRem:
1217 if (ConstantInt *Rem = dyn_cast<ConstantInt>(I->getOperand(1))) {
1218 APInt RA = Rem->getValue().abs();
1219 if (RA.isPowerOf2()) {
1220 APInt LowBits = RA - 1;
1221 computeKnownBits(I->getOperand(0), Known2, Depth + 1, Q);
1223 // The low bits of the first operand are unchanged by the srem.
1224 Known.Zero = Known2.Zero & LowBits;
1225 Known.One = Known2.One & LowBits;
1227 // If the first operand is non-negative or has all low bits zero, then
1228 // the upper bits are all zero.
1229 if (Known2.isNonNegative() || LowBits.isSubsetOf(Known2.Zero))
1230 Known.Zero |= ~LowBits;
1232 // If the first operand is negative and not all low bits are zero, then
1233 // the upper bits are all one.
1234 if (Known2.isNegative() && LowBits.intersects(Known2.One))
1235 Known.One |= ~LowBits;
1237 assert((Known.Zero & Known.One) == 0 && "Bits known to be one AND zero?");
1242 // The sign bit is the LHS's sign bit, except when the result of the
1243 // remainder is zero.
1244 computeKnownBits(I->getOperand(0), Known2, Depth + 1, Q);
1245 // If it's known zero, our sign bit is also zero.
1246 if (Known2.isNonNegative())
1247 Known.makeNonNegative();
1250 case Instruction::URem: {
1251 if (ConstantInt *Rem = dyn_cast<ConstantInt>(I->getOperand(1))) {
1252 const APInt &RA = Rem->getValue();
1253 if (RA.isPowerOf2()) {
1254 APInt LowBits = (RA - 1);
1255 computeKnownBits(I->getOperand(0), Known, Depth + 1, Q);
1256 Known.Zero |= ~LowBits;
1257 Known.One &= LowBits;
1262 // Since the result is less than or equal to either operand, any leading
1263 // zero bits in either operand must also exist in the result.
1264 computeKnownBits(I->getOperand(0), Known, Depth + 1, Q);
1265 computeKnownBits(I->getOperand(1), Known2, Depth + 1, Q);
1268 std::max(Known.countMinLeadingZeros(), Known2.countMinLeadingZeros());
1270 Known.Zero.setHighBits(Leaders);
1274 case Instruction::Alloca: {
1275 const AllocaInst *AI = cast<AllocaInst>(I);
1276 unsigned Align = AI->getAlignment();
1278 Align = Q.DL.getABITypeAlignment(AI->getAllocatedType());
1281 Known.Zero.setLowBits(countTrailingZeros(Align));
1284 case Instruction::GetElementPtr: {
1285 // Analyze all of the subscripts of this getelementptr instruction
1286 // to determine if we can prove known low zero bits.
1287 KnownBits LocalKnown(BitWidth);
1288 computeKnownBits(I->getOperand(0), LocalKnown, Depth + 1, Q);
1289 unsigned TrailZ = LocalKnown.countMinTrailingZeros();
1291 gep_type_iterator GTI = gep_type_begin(I);
1292 for (unsigned i = 1, e = I->getNumOperands(); i != e; ++i, ++GTI) {
1293 Value *Index = I->getOperand(i);
1294 if (StructType *STy = GTI.getStructTypeOrNull()) {
1295 // Handle struct member offset arithmetic.
1297 // Handle case when index is vector zeroinitializer
1298 Constant *CIndex = cast<Constant>(Index);
1299 if (CIndex->isZeroValue())
1302 if (CIndex->getType()->isVectorTy())
1303 Index = CIndex->getSplatValue();
1305 unsigned Idx = cast<ConstantInt>(Index)->getZExtValue();
1306 const StructLayout *SL = Q.DL.getStructLayout(STy);
1307 uint64_t Offset = SL->getElementOffset(Idx);
1308 TrailZ = std::min<unsigned>(TrailZ,
1309 countTrailingZeros(Offset));
1311 // Handle array index arithmetic.
1312 Type *IndexedTy = GTI.getIndexedType();
1313 if (!IndexedTy->isSized()) {
1317 unsigned GEPOpiBits = Index->getType()->getScalarSizeInBits();
1318 uint64_t TypeSize = Q.DL.getTypeAllocSize(IndexedTy);
1319 LocalKnown.Zero = LocalKnown.One = APInt(GEPOpiBits, 0);
1320 computeKnownBits(Index, LocalKnown, Depth + 1, Q);
1321 TrailZ = std::min(TrailZ,
1322 unsigned(countTrailingZeros(TypeSize) +
1323 LocalKnown.countMinTrailingZeros()));
1327 Known.Zero.setLowBits(TrailZ);
1330 case Instruction::PHI: {
1331 const PHINode *P = cast<PHINode>(I);
1332 // Handle the case of a simple two-predecessor recurrence PHI.
1333 // There's a lot more that could theoretically be done here, but
1334 // this is sufficient to catch some interesting cases.
1335 if (P->getNumIncomingValues() == 2) {
1336 for (unsigned i = 0; i != 2; ++i) {
1337 Value *L = P->getIncomingValue(i);
1338 Value *R = P->getIncomingValue(!i);
1339 Operator *LU = dyn_cast<Operator>(L);
1342 unsigned Opcode = LU->getOpcode();
1343 // Check for operations that have the property that if
1344 // both their operands have low zero bits, the result
1345 // will have low zero bits.
1346 if (Opcode == Instruction::Add ||
1347 Opcode == Instruction::Sub ||
1348 Opcode == Instruction::And ||
1349 Opcode == Instruction::Or ||
1350 Opcode == Instruction::Mul) {
1351 Value *LL = LU->getOperand(0);
1352 Value *LR = LU->getOperand(1);
1353 // Find a recurrence.
1360 // Ok, we have a PHI of the form L op= R. Check for low
1362 computeKnownBits(R, Known2, Depth + 1, Q);
1364 // We need to take the minimum number of known bits
1365 KnownBits Known3(Known);
1366 computeKnownBits(L, Known3, Depth + 1, Q);
1368 Known.Zero.setLowBits(std::min(Known2.countMinTrailingZeros(),
1369 Known3.countMinTrailingZeros()));
1371 auto *OverflowOp = dyn_cast<OverflowingBinaryOperator>(LU);
1372 if (OverflowOp && OverflowOp->hasNoSignedWrap()) {
1373 // If initial value of recurrence is nonnegative, and we are adding
1374 // a nonnegative number with nsw, the result can only be nonnegative
1375 // or poison value regardless of the number of times we execute the
1376 // add in phi recurrence. If initial value is negative and we are
1377 // adding a negative number with nsw, the result can only be
1378 // negative or poison value. Similar arguments apply to sub and mul.
1380 // (add non-negative, non-negative) --> non-negative
1381 // (add negative, negative) --> negative
1382 if (Opcode == Instruction::Add) {
1383 if (Known2.isNonNegative() && Known3.isNonNegative())
1384 Known.makeNonNegative();
1385 else if (Known2.isNegative() && Known3.isNegative())
1386 Known.makeNegative();
1389 // (sub nsw non-negative, negative) --> non-negative
1390 // (sub nsw negative, non-negative) --> negative
1391 else if (Opcode == Instruction::Sub && LL == I) {
1392 if (Known2.isNonNegative() && Known3.isNegative())
1393 Known.makeNonNegative();
1394 else if (Known2.isNegative() && Known3.isNonNegative())
1395 Known.makeNegative();
1398 // (mul nsw non-negative, non-negative) --> non-negative
1399 else if (Opcode == Instruction::Mul && Known2.isNonNegative() &&
1400 Known3.isNonNegative())
1401 Known.makeNonNegative();
1409 // Unreachable blocks may have zero-operand PHI nodes.
1410 if (P->getNumIncomingValues() == 0)
1413 // Otherwise take the unions of the known bit sets of the operands,
1414 // taking conservative care to avoid excessive recursion.
1415 if (Depth < MaxDepth - 1 && !Known.Zero && !Known.One) {
1416 // Skip if every incoming value references to ourself.
1417 if (dyn_cast_or_null<UndefValue>(P->hasConstantValue()))
1420 Known.Zero.setAllBits();
1421 Known.One.setAllBits();
1422 for (Value *IncValue : P->incoming_values()) {
1423 // Skip direct self references.
1424 if (IncValue == P) continue;
1426 Known2 = KnownBits(BitWidth);
1427 // Recurse, but cap the recursion to one level, because we don't
1428 // want to waste time spinning around in loops.
1429 computeKnownBits(IncValue, Known2, MaxDepth - 1, Q);
1430 Known.Zero &= Known2.Zero;
1431 Known.One &= Known2.One;
1432 // If all bits have been ruled out, there's no need to check
1434 if (!Known.Zero && !Known.One)
1440 case Instruction::Call:
1441 case Instruction::Invoke:
1442 // If range metadata is attached to this call, set known bits from that,
1443 // and then intersect with known bits based on other properties of the
1445 if (MDNode *MD = cast<Instruction>(I)->getMetadata(LLVMContext::MD_range))
1446 computeKnownBitsFromRangeMetadata(*MD, Known);
1447 if (const Value *RV = ImmutableCallSite(I).getReturnedArgOperand()) {
1448 computeKnownBits(RV, Known2, Depth + 1, Q);
1449 Known.Zero |= Known2.Zero;
1450 Known.One |= Known2.One;
1452 if (const IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) {
1453 switch (II->getIntrinsicID()) {
1455 case Intrinsic::bitreverse:
1456 computeKnownBits(I->getOperand(0), Known2, Depth + 1, Q);
1457 Known.Zero |= Known2.Zero.reverseBits();
1458 Known.One |= Known2.One.reverseBits();
1460 case Intrinsic::bswap:
1461 computeKnownBits(I->getOperand(0), Known2, Depth + 1, Q);
1462 Known.Zero |= Known2.Zero.byteSwap();
1463 Known.One |= Known2.One.byteSwap();
1465 case Intrinsic::ctlz: {
1466 computeKnownBits(I->getOperand(0), Known2, Depth + 1, Q);
1467 // If we have a known 1, its position is our upper bound.
1468 unsigned PossibleLZ = Known2.One.countLeadingZeros();
1469 // If this call is undefined for 0, the result will be less than 2^n.
1470 if (II->getArgOperand(1) == ConstantInt::getTrue(II->getContext()))
1471 PossibleLZ = std::min(PossibleLZ, BitWidth - 1);
1472 unsigned LowBits = Log2_32(PossibleLZ)+1;
1473 Known.Zero.setBitsFrom(LowBits);
1476 case Intrinsic::cttz: {
1477 computeKnownBits(I->getOperand(0), Known2, Depth + 1, Q);
1478 // If we have a known 1, its position is our upper bound.
1479 unsigned PossibleTZ = Known2.One.countTrailingZeros();
1480 // If this call is undefined for 0, the result will be less than 2^n.
1481 if (II->getArgOperand(1) == ConstantInt::getTrue(II->getContext()))
1482 PossibleTZ = std::min(PossibleTZ, BitWidth - 1);
1483 unsigned LowBits = Log2_32(PossibleTZ)+1;
1484 Known.Zero.setBitsFrom(LowBits);
1487 case Intrinsic::ctpop: {
1488 computeKnownBits(I->getOperand(0), Known2, Depth + 1, Q);
1489 // We can bound the space the count needs. Also, bits known to be zero
1490 // can't contribute to the population.
1491 unsigned BitsPossiblySet = Known2.countMaxPopulation();
1492 unsigned LowBits = Log2_32(BitsPossiblySet)+1;
1493 Known.Zero.setBitsFrom(LowBits);
1494 // TODO: we could bound KnownOne using the lower bound on the number
1495 // of bits which might be set provided by popcnt KnownOne2.
1498 case Intrinsic::x86_sse42_crc32_64_64:
1499 Known.Zero.setBitsFrom(32);
1504 case Instruction::ExtractElement:
1505 // Look through extract element. At the moment we keep this simple and skip
1506 // tracking the specific element. But at least we might find information
1507 // valid for all elements of the vector (for example if vector is sign
1508 // extended, shifted, etc).
1509 computeKnownBits(I->getOperand(0), Known, Depth + 1, Q);
1511 case Instruction::ExtractValue:
1512 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I->getOperand(0))) {
1513 const ExtractValueInst *EVI = cast<ExtractValueInst>(I);
1514 if (EVI->getNumIndices() != 1) break;
1515 if (EVI->getIndices()[0] == 0) {
1516 switch (II->getIntrinsicID()) {
1518 case Intrinsic::uadd_with_overflow:
1519 case Intrinsic::sadd_with_overflow:
1520 computeKnownBitsAddSub(true, II->getArgOperand(0),
1521 II->getArgOperand(1), false, Known, Known2,
1524 case Intrinsic::usub_with_overflow:
1525 case Intrinsic::ssub_with_overflow:
1526 computeKnownBitsAddSub(false, II->getArgOperand(0),
1527 II->getArgOperand(1), false, Known, Known2,
1530 case Intrinsic::umul_with_overflow:
1531 case Intrinsic::smul_with_overflow:
1532 computeKnownBitsMul(II->getArgOperand(0), II->getArgOperand(1), false,
1533 Known, Known2, Depth, Q);
1541 /// Determine which bits of V are known to be either zero or one and return
1543 KnownBits computeKnownBits(const Value *V, unsigned Depth, const Query &Q) {
1544 KnownBits Known(getBitWidth(V->getType(), Q.DL));
1545 computeKnownBits(V, Known, Depth, Q);
1549 /// Determine which bits of V are known to be either zero or one and return
1550 /// them in the Known bit set.
1552 /// NOTE: we cannot consider 'undef' to be "IsZero" here. The problem is that
1553 /// we cannot optimize based on the assumption that it is zero without changing
1554 /// it to be an explicit zero. If we don't change it to zero, other code could
1555 /// optimized based on the contradictory assumption that it is non-zero.
1556 /// Because instcombine aggressively folds operations with undef args anyway,
1557 /// this won't lose us code quality.
1559 /// This function is defined on values with integer type, values with pointer
1560 /// type, and vectors of integers. In the case
1561 /// where V is a vector, known zero, and known one values are the
1562 /// same width as the vector element, and the bit is set only if it is true
1563 /// for all of the elements in the vector.
1564 void computeKnownBits(const Value *V, KnownBits &Known, unsigned Depth,
1566 assert(V && "No Value?");
1567 assert(Depth <= MaxDepth && "Limit Search Depth");
1568 unsigned BitWidth = Known.getBitWidth();
1570 assert((V->getType()->isIntOrIntVectorTy(BitWidth) ||
1571 V->getType()->isPtrOrPtrVectorTy()) &&
1572 "Not integer or pointer type!");
1574 Type *ScalarTy = V->getType()->getScalarType();
1575 unsigned ExpectedWidth = ScalarTy->isPointerTy() ?
1576 Q.DL.getIndexTypeSizeInBits(ScalarTy) : Q.DL.getTypeSizeInBits(ScalarTy);
1577 assert(ExpectedWidth == BitWidth && "V and Known should have same BitWidth");
1579 (void)ExpectedWidth;
1582 if (match(V, m_APInt(C))) {
1583 // We know all of the bits for a scalar constant or a splat vector constant!
1585 Known.Zero = ~Known.One;
1588 // Null and aggregate-zero are all-zeros.
1589 if (isa<ConstantPointerNull>(V) || isa<ConstantAggregateZero>(V)) {
1593 // Handle a constant vector by taking the intersection of the known bits of
1595 if (const ConstantDataSequential *CDS = dyn_cast<ConstantDataSequential>(V)) {
1596 // We know that CDS must be a vector of integers. Take the intersection of
1598 Known.Zero.setAllBits(); Known.One.setAllBits();
1599 for (unsigned i = 0, e = CDS->getNumElements(); i != e; ++i) {
1600 APInt Elt = CDS->getElementAsAPInt(i);
1607 if (const auto *CV = dyn_cast<ConstantVector>(V)) {
1608 // We know that CV must be a vector of integers. Take the intersection of
1610 Known.Zero.setAllBits(); Known.One.setAllBits();
1611 for (unsigned i = 0, e = CV->getNumOperands(); i != e; ++i) {
1612 Constant *Element = CV->getAggregateElement(i);
1613 auto *ElementCI = dyn_cast_or_null<ConstantInt>(Element);
1618 const APInt &Elt = ElementCI->getValue();
1625 // Start out not knowing anything.
1628 // We can't imply anything about undefs.
1629 if (isa<UndefValue>(V))
1632 // There's no point in looking through other users of ConstantData for
1633 // assumptions. Confirm that we've handled them all.
1634 assert(!isa<ConstantData>(V) && "Unhandled constant data!");
1636 // Limit search depth.
1637 // All recursive calls that increase depth must come after this.
1638 if (Depth == MaxDepth)
1641 // A weak GlobalAlias is totally unknown. A non-weak GlobalAlias has
1642 // the bits of its aliasee.
1643 if (const GlobalAlias *GA = dyn_cast<GlobalAlias>(V)) {
1644 if (!GA->isInterposable())
1645 computeKnownBits(GA->getAliasee(), Known, Depth + 1, Q);
1649 if (const Operator *I = dyn_cast<Operator>(V))
1650 computeKnownBitsFromOperator(I, Known, Depth, Q);
1652 // Aligned pointers have trailing zeros - refine Known.Zero set
1653 if (V->getType()->isPointerTy()) {
1654 unsigned Align = V->getPointerAlignment(Q.DL);
1656 Known.Zero.setLowBits(countTrailingZeros(Align));
1659 // computeKnownBitsFromAssume strictly refines Known.
1660 // Therefore, we run them after computeKnownBitsFromOperator.
1662 // Check whether a nearby assume intrinsic can determine some known bits.
1663 computeKnownBitsFromAssume(V, Known, Depth, Q);
1665 assert((Known.Zero & Known.One) == 0 && "Bits known to be one AND zero?");
1668 /// Return true if the given value is known to have exactly one
1669 /// bit set when defined. For vectors return true if every element is known to
1670 /// be a power of two when defined. Supports values with integer or pointer
1671 /// types and vectors of integers.
1672 bool isKnownToBeAPowerOfTwo(const Value *V, bool OrZero, unsigned Depth,
1674 assert(Depth <= MaxDepth && "Limit Search Depth");
1676 // Attempt to match against constants.
1677 if (OrZero && match(V, m_Power2OrZero()))
1679 if (match(V, m_Power2()))
1682 // 1 << X is clearly a power of two if the one is not shifted off the end. If
1683 // it is shifted off the end then the result is undefined.
1684 if (match(V, m_Shl(m_One(), m_Value())))
1687 // (signmask) >>l X is clearly a power of two if the one is not shifted off
1688 // the bottom. If it is shifted off the bottom then the result is undefined.
1689 if (match(V, m_LShr(m_SignMask(), m_Value())))
1692 // The remaining tests are all recursive, so bail out if we hit the limit.
1693 if (Depth++ == MaxDepth)
1696 Value *X = nullptr, *Y = nullptr;
1697 // A shift left or a logical shift right of a power of two is a power of two
1699 if (OrZero && (match(V, m_Shl(m_Value(X), m_Value())) ||
1700 match(V, m_LShr(m_Value(X), m_Value()))))
1701 return isKnownToBeAPowerOfTwo(X, /*OrZero*/ true, Depth, Q);
1703 if (const ZExtInst *ZI = dyn_cast<ZExtInst>(V))
1704 return isKnownToBeAPowerOfTwo(ZI->getOperand(0), OrZero, Depth, Q);
1706 if (const SelectInst *SI = dyn_cast<SelectInst>(V))
1707 return isKnownToBeAPowerOfTwo(SI->getTrueValue(), OrZero, Depth, Q) &&
1708 isKnownToBeAPowerOfTwo(SI->getFalseValue(), OrZero, Depth, Q);
1710 if (OrZero && match(V, m_And(m_Value(X), m_Value(Y)))) {
1711 // A power of two and'd with anything is a power of two or zero.
1712 if (isKnownToBeAPowerOfTwo(X, /*OrZero*/ true, Depth, Q) ||
1713 isKnownToBeAPowerOfTwo(Y, /*OrZero*/ true, Depth, Q))
1715 // X & (-X) is always a power of two or zero.
1716 if (match(X, m_Neg(m_Specific(Y))) || match(Y, m_Neg(m_Specific(X))))
1721 // Adding a power-of-two or zero to the same power-of-two or zero yields
1722 // either the original power-of-two, a larger power-of-two or zero.
1723 if (match(V, m_Add(m_Value(X), m_Value(Y)))) {
1724 const OverflowingBinaryOperator *VOBO = cast<OverflowingBinaryOperator>(V);
1725 if (OrZero || VOBO->hasNoUnsignedWrap() || VOBO->hasNoSignedWrap()) {
1726 if (match(X, m_And(m_Specific(Y), m_Value())) ||
1727 match(X, m_And(m_Value(), m_Specific(Y))))
1728 if (isKnownToBeAPowerOfTwo(Y, OrZero, Depth, Q))
1730 if (match(Y, m_And(m_Specific(X), m_Value())) ||
1731 match(Y, m_And(m_Value(), m_Specific(X))))
1732 if (isKnownToBeAPowerOfTwo(X, OrZero, Depth, Q))
1735 unsigned BitWidth = V->getType()->getScalarSizeInBits();
1736 KnownBits LHSBits(BitWidth);
1737 computeKnownBits(X, LHSBits, Depth, Q);
1739 KnownBits RHSBits(BitWidth);
1740 computeKnownBits(Y, RHSBits, Depth, Q);
1741 // If i8 V is a power of two or zero:
1742 // ZeroBits: 1 1 1 0 1 1 1 1
1743 // ~ZeroBits: 0 0 0 1 0 0 0 0
1744 if ((~(LHSBits.Zero & RHSBits.Zero)).isPowerOf2())
1745 // If OrZero isn't set, we cannot give back a zero result.
1746 // Make sure either the LHS or RHS has a bit set.
1747 if (OrZero || RHSBits.One.getBoolValue() || LHSBits.One.getBoolValue())
1752 // An exact divide or right shift can only shift off zero bits, so the result
1753 // is a power of two only if the first operand is a power of two and not
1754 // copying a sign bit (sdiv int_min, 2).
1755 if (match(V, m_Exact(m_LShr(m_Value(), m_Value()))) ||
1756 match(V, m_Exact(m_UDiv(m_Value(), m_Value())))) {
1757 return isKnownToBeAPowerOfTwo(cast<Operator>(V)->getOperand(0), OrZero,
1764 /// Test whether a GEP's result is known to be non-null.
1766 /// Uses properties inherent in a GEP to try to determine whether it is known
1769 /// Currently this routine does not support vector GEPs.
1770 static bool isGEPKnownNonNull(const GEPOperator *GEP, unsigned Depth,
1772 if (!GEP->isInBounds() || GEP->getPointerAddressSpace() != 0)
1775 // FIXME: Support vector-GEPs.
1776 assert(GEP->getType()->isPointerTy() && "We only support plain pointer GEP");
1778 // If the base pointer is non-null, we cannot walk to a null address with an
1779 // inbounds GEP in address space zero.
1780 if (isKnownNonZero(GEP->getPointerOperand(), Depth, Q))
1783 // Walk the GEP operands and see if any operand introduces a non-zero offset.
1784 // If so, then the GEP cannot produce a null pointer, as doing so would
1785 // inherently violate the inbounds contract within address space zero.
1786 for (gep_type_iterator GTI = gep_type_begin(GEP), GTE = gep_type_end(GEP);
1787 GTI != GTE; ++GTI) {
1788 // Struct types are easy -- they must always be indexed by a constant.
1789 if (StructType *STy = GTI.getStructTypeOrNull()) {
1790 ConstantInt *OpC = cast<ConstantInt>(GTI.getOperand());
1791 unsigned ElementIdx = OpC->getZExtValue();
1792 const StructLayout *SL = Q.DL.getStructLayout(STy);
1793 uint64_t ElementOffset = SL->getElementOffset(ElementIdx);
1794 if (ElementOffset > 0)
1799 // If we have a zero-sized type, the index doesn't matter. Keep looping.
1800 if (Q.DL.getTypeAllocSize(GTI.getIndexedType()) == 0)
1803 // Fast path the constant operand case both for efficiency and so we don't
1804 // increment Depth when just zipping down an all-constant GEP.
1805 if (ConstantInt *OpC = dyn_cast<ConstantInt>(GTI.getOperand())) {
1811 // We post-increment Depth here because while isKnownNonZero increments it
1812 // as well, when we pop back up that increment won't persist. We don't want
1813 // to recurse 10k times just because we have 10k GEP operands. We don't
1814 // bail completely out because we want to handle constant GEPs regardless
1816 if (Depth++ >= MaxDepth)
1819 if (isKnownNonZero(GTI.getOperand(), Depth, Q))
1826 static bool isKnownNonNullFromDominatingCondition(const Value *V,
1827 const Instruction *CtxI,
1828 const DominatorTree *DT) {
1829 assert(V->getType()->isPointerTy() && "V must be pointer type");
1830 assert(!isa<ConstantData>(V) && "Did not expect ConstantPointerNull");
1835 unsigned NumUsesExplored = 0;
1836 for (auto *U : V->users()) {
1837 // Avoid massive lists
1838 if (NumUsesExplored >= DomConditionsMaxUses)
1842 // If the value is used as an argument to a call or invoke, then argument
1843 // attributes may provide an answer about null-ness.
1844 if (auto CS = ImmutableCallSite(U))
1845 if (auto *CalledFunc = CS.getCalledFunction())
1846 for (const Argument &Arg : CalledFunc->args())
1847 if (CS.getArgOperand(Arg.getArgNo()) == V &&
1848 Arg.hasNonNullAttr() && DT->dominates(CS.getInstruction(), CtxI))
1851 // Consider only compare instructions uniquely controlling a branch
1852 CmpInst::Predicate Pred;
1853 if (!match(const_cast<User *>(U),
1854 m_c_ICmp(Pred, m_Specific(V), m_Zero())) ||
1855 (Pred != ICmpInst::ICMP_EQ && Pred != ICmpInst::ICMP_NE))
1858 for (auto *CmpU : U->users()) {
1859 if (const BranchInst *BI = dyn_cast<BranchInst>(CmpU)) {
1860 assert(BI->isConditional() && "uses a comparison!");
1862 BasicBlock *NonNullSuccessor =
1863 BI->getSuccessor(Pred == ICmpInst::ICMP_EQ ? 1 : 0);
1864 BasicBlockEdge Edge(BI->getParent(), NonNullSuccessor);
1865 if (Edge.isSingleEdge() && DT->dominates(Edge, CtxI->getParent()))
1867 } else if (Pred == ICmpInst::ICMP_NE &&
1868 match(CmpU, m_Intrinsic<Intrinsic::experimental_guard>()) &&
1869 DT->dominates(cast<Instruction>(CmpU), CtxI)) {
1878 /// Does the 'Range' metadata (which must be a valid MD_range operand list)
1879 /// ensure that the value it's attached to is never Value? 'RangeType' is
1880 /// is the type of the value described by the range.
1881 static bool rangeMetadataExcludesValue(const MDNode* Ranges, const APInt& Value) {
1882 const unsigned NumRanges = Ranges->getNumOperands() / 2;
1883 assert(NumRanges >= 1);
1884 for (unsigned i = 0; i < NumRanges; ++i) {
1885 ConstantInt *Lower =
1886 mdconst::extract<ConstantInt>(Ranges->getOperand(2 * i + 0));
1887 ConstantInt *Upper =
1888 mdconst::extract<ConstantInt>(Ranges->getOperand(2 * i + 1));
1889 ConstantRange Range(Lower->getValue(), Upper->getValue());
1890 if (Range.contains(Value))
1896 /// Return true if the given value is known to be non-zero when defined. For
1897 /// vectors, return true if every element is known to be non-zero when
1898 /// defined. For pointers, if the context instruction and dominator tree are
1899 /// specified, perform context-sensitive analysis and return true if the
1900 /// pointer couldn't possibly be null at the specified instruction.
1901 /// Supports values with integer or pointer type and vectors of integers.
1902 bool isKnownNonZero(const Value *V, unsigned Depth, const Query &Q) {
1903 if (auto *C = dyn_cast<Constant>(V)) {
1904 if (C->isNullValue())
1906 if (isa<ConstantInt>(C))
1907 // Must be non-zero due to null test above.
1910 // For constant vectors, check that all elements are undefined or known
1911 // non-zero to determine that the whole vector is known non-zero.
1912 if (auto *VecTy = dyn_cast<VectorType>(C->getType())) {
1913 for (unsigned i = 0, e = VecTy->getNumElements(); i != e; ++i) {
1914 Constant *Elt = C->getAggregateElement(i);
1915 if (!Elt || Elt->isNullValue())
1917 if (!isa<UndefValue>(Elt) && !isa<ConstantInt>(Elt))
1923 // A global variable in address space 0 is non null unless extern weak
1924 // or an absolute symbol reference. Other address spaces may have null as a
1925 // valid address for a global, so we can't assume anything.
1926 if (const GlobalValue *GV = dyn_cast<GlobalValue>(V)) {
1927 if (!GV->isAbsoluteSymbolRef() && !GV->hasExternalWeakLinkage() &&
1928 GV->getType()->getAddressSpace() == 0)
1934 if (auto *I = dyn_cast<Instruction>(V)) {
1935 if (MDNode *Ranges = I->getMetadata(LLVMContext::MD_range)) {
1936 // If the possible ranges don't contain zero, then the value is
1937 // definitely non-zero.
1938 if (auto *Ty = dyn_cast<IntegerType>(V->getType())) {
1939 const APInt ZeroValue(Ty->getBitWidth(), 0);
1940 if (rangeMetadataExcludesValue(Ranges, ZeroValue))
1946 // Some of the tests below are recursive, so bail out if we hit the limit.
1947 if (Depth++ >= MaxDepth)
1950 // Check for pointer simplifications.
1951 if (V->getType()->isPointerTy()) {
1952 // Alloca never returns null, malloc might.
1953 if (isa<AllocaInst>(V) && Q.DL.getAllocaAddrSpace() == 0)
1956 // A byval, inalloca, or nonnull argument is never null.
1957 if (const Argument *A = dyn_cast<Argument>(V))
1958 if (A->hasByValOrInAllocaAttr() || A->hasNonNullAttr())
1961 // A Load tagged with nonnull metadata is never null.
1962 if (const LoadInst *LI = dyn_cast<LoadInst>(V))
1963 if (LI->getMetadata(LLVMContext::MD_nonnull))
1966 if (auto CS = ImmutableCallSite(V)) {
1967 if (CS.isReturnNonNull())
1969 if (const auto *RP = getArgumentAliasingToReturnedPointer(CS))
1970 return isKnownNonZero(RP, Depth, Q);
1975 // Check for recursive pointer simplifications.
1976 if (V->getType()->isPointerTy()) {
1977 if (isKnownNonNullFromDominatingCondition(V, Q.CxtI, Q.DT))
1980 if (const GEPOperator *GEP = dyn_cast<GEPOperator>(V))
1981 if (isGEPKnownNonNull(GEP, Depth, Q))
1985 unsigned BitWidth = getBitWidth(V->getType()->getScalarType(), Q.DL);
1987 // X | Y != 0 if X != 0 or Y != 0.
1988 Value *X = nullptr, *Y = nullptr;
1989 if (match(V, m_Or(m_Value(X), m_Value(Y))))
1990 return isKnownNonZero(X, Depth, Q) || isKnownNonZero(Y, Depth, Q);
1992 // ext X != 0 if X != 0.
1993 if (isa<SExtInst>(V) || isa<ZExtInst>(V))
1994 return isKnownNonZero(cast<Instruction>(V)->getOperand(0), Depth, Q);
1996 // shl X, Y != 0 if X is odd. Note that the value of the shift is undefined
1997 // if the lowest bit is shifted off the end.
1998 if (match(V, m_Shl(m_Value(X), m_Value(Y)))) {
1999 // shl nuw can't remove any non-zero bits.
2000 const OverflowingBinaryOperator *BO = cast<OverflowingBinaryOperator>(V);
2001 if (BO->hasNoUnsignedWrap())
2002 return isKnownNonZero(X, Depth, Q);
2004 KnownBits Known(BitWidth);
2005 computeKnownBits(X, Known, Depth, Q);
2009 // shr X, Y != 0 if X is negative. Note that the value of the shift is not
2010 // defined if the sign bit is shifted off the end.
2011 else if (match(V, m_Shr(m_Value(X), m_Value(Y)))) {
2012 // shr exact can only shift out zero bits.
2013 const PossiblyExactOperator *BO = cast<PossiblyExactOperator>(V);
2015 return isKnownNonZero(X, Depth, Q);
2017 KnownBits Known = computeKnownBits(X, Depth, Q);
2018 if (Known.isNegative())
2021 // If the shifter operand is a constant, and all of the bits shifted
2022 // out are known to be zero, and X is known non-zero then at least one
2023 // non-zero bit must remain.
2024 if (ConstantInt *Shift = dyn_cast<ConstantInt>(Y)) {
2025 auto ShiftVal = Shift->getLimitedValue(BitWidth - 1);
2026 // Is there a known one in the portion not shifted out?
2027 if (Known.countMaxLeadingZeros() < BitWidth - ShiftVal)
2029 // Are all the bits to be shifted out known zero?
2030 if (Known.countMinTrailingZeros() >= ShiftVal)
2031 return isKnownNonZero(X, Depth, Q);
2034 // div exact can only produce a zero if the dividend is zero.
2035 else if (match(V, m_Exact(m_IDiv(m_Value(X), m_Value())))) {
2036 return isKnownNonZero(X, Depth, Q);
2039 else if (match(V, m_Add(m_Value(X), m_Value(Y)))) {
2040 KnownBits XKnown = computeKnownBits(X, Depth, Q);
2041 KnownBits YKnown = computeKnownBits(Y, Depth, Q);
2043 // If X and Y are both non-negative (as signed values) then their sum is not
2044 // zero unless both X and Y are zero.
2045 if (XKnown.isNonNegative() && YKnown.isNonNegative())
2046 if (isKnownNonZero(X, Depth, Q) || isKnownNonZero(Y, Depth, Q))
2049 // If X and Y are both negative (as signed values) then their sum is not
2050 // zero unless both X and Y equal INT_MIN.
2051 if (XKnown.isNegative() && YKnown.isNegative()) {
2052 APInt Mask = APInt::getSignedMaxValue(BitWidth);
2053 // The sign bit of X is set. If some other bit is set then X is not equal
2055 if (XKnown.One.intersects(Mask))
2057 // The sign bit of Y is set. If some other bit is set then Y is not equal
2059 if (YKnown.One.intersects(Mask))
2063 // The sum of a non-negative number and a power of two is not zero.
2064 if (XKnown.isNonNegative() &&
2065 isKnownToBeAPowerOfTwo(Y, /*OrZero*/ false, Depth, Q))
2067 if (YKnown.isNonNegative() &&
2068 isKnownToBeAPowerOfTwo(X, /*OrZero*/ false, Depth, Q))
2072 else if (match(V, m_Mul(m_Value(X), m_Value(Y)))) {
2073 const OverflowingBinaryOperator *BO = cast<OverflowingBinaryOperator>(V);
2074 // If X and Y are non-zero then so is X * Y as long as the multiplication
2075 // does not overflow.
2076 if ((BO->hasNoSignedWrap() || BO->hasNoUnsignedWrap()) &&
2077 isKnownNonZero(X, Depth, Q) && isKnownNonZero(Y, Depth, Q))
2080 // (C ? X : Y) != 0 if X != 0 and Y != 0.
2081 else if (const SelectInst *SI = dyn_cast<SelectInst>(V)) {
2082 if (isKnownNonZero(SI->getTrueValue(), Depth, Q) &&
2083 isKnownNonZero(SI->getFalseValue(), Depth, Q))
2087 else if (const PHINode *PN = dyn_cast<PHINode>(V)) {
2088 // Try and detect a recurrence that monotonically increases from a
2089 // starting value, as these are common as induction variables.
2090 if (PN->getNumIncomingValues() == 2) {
2091 Value *Start = PN->getIncomingValue(0);
2092 Value *Induction = PN->getIncomingValue(1);
2093 if (isa<ConstantInt>(Induction) && !isa<ConstantInt>(Start))
2094 std::swap(Start, Induction);
2095 if (ConstantInt *C = dyn_cast<ConstantInt>(Start)) {
2096 if (!C->isZero() && !C->isNegative()) {
2098 if ((match(Induction, m_NSWAdd(m_Specific(PN), m_ConstantInt(X))) ||
2099 match(Induction, m_NUWAdd(m_Specific(PN), m_ConstantInt(X)))) &&
2105 // Check if all incoming values are non-zero constant.
2106 bool AllNonZeroConstants = llvm::all_of(PN->operands(), [](Value *V) {
2107 return isa<ConstantInt>(V) && !cast<ConstantInt>(V)->isZero();
2109 if (AllNonZeroConstants)
2113 KnownBits Known(BitWidth);
2114 computeKnownBits(V, Known, Depth, Q);
2115 return Known.One != 0;
2118 /// Return true if V2 == V1 + X, where X is known non-zero.
2119 static bool isAddOfNonZero(const Value *V1, const Value *V2, const Query &Q) {
2120 const BinaryOperator *BO = dyn_cast<BinaryOperator>(V1);
2121 if (!BO || BO->getOpcode() != Instruction::Add)
2123 Value *Op = nullptr;
2124 if (V2 == BO->getOperand(0))
2125 Op = BO->getOperand(1);
2126 else if (V2 == BO->getOperand(1))
2127 Op = BO->getOperand(0);
2130 return isKnownNonZero(Op, 0, Q);
2133 /// Return true if it is known that V1 != V2.
2134 static bool isKnownNonEqual(const Value *V1, const Value *V2, const Query &Q) {
2137 if (V1->getType() != V2->getType())
2138 // We can't look through casts yet.
2140 if (isAddOfNonZero(V1, V2, Q) || isAddOfNonZero(V2, V1, Q))
2143 if (V1->getType()->isIntOrIntVectorTy()) {
2144 // Are any known bits in V1 contradictory to known bits in V2? If V1
2145 // has a known zero where V2 has a known one, they must not be equal.
2146 KnownBits Known1 = computeKnownBits(V1, 0, Q);
2147 KnownBits Known2 = computeKnownBits(V2, 0, Q);
2149 if (Known1.Zero.intersects(Known2.One) ||
2150 Known2.Zero.intersects(Known1.One))
2156 /// Return true if 'V & Mask' is known to be zero. We use this predicate to
2157 /// simplify operations downstream. Mask is known to be zero for bits that V
2160 /// This function is defined on values with integer type, values with pointer
2161 /// type, and vectors of integers. In the case
2162 /// where V is a vector, the mask, known zero, and known one values are the
2163 /// same width as the vector element, and the bit is set only if it is true
2164 /// for all of the elements in the vector.
2165 bool MaskedValueIsZero(const Value *V, const APInt &Mask, unsigned Depth,
2167 KnownBits Known(Mask.getBitWidth());
2168 computeKnownBits(V, Known, Depth, Q);
2169 return Mask.isSubsetOf(Known.Zero);
2172 /// For vector constants, loop over the elements and find the constant with the
2173 /// minimum number of sign bits. Return 0 if the value is not a vector constant
2174 /// or if any element was not analyzed; otherwise, return the count for the
2175 /// element with the minimum number of sign bits.
2176 static unsigned computeNumSignBitsVectorConstant(const Value *V,
2178 const auto *CV = dyn_cast<Constant>(V);
2179 if (!CV || !CV->getType()->isVectorTy())
2182 unsigned MinSignBits = TyBits;
2183 unsigned NumElts = CV->getType()->getVectorNumElements();
2184 for (unsigned i = 0; i != NumElts; ++i) {
2185 // If we find a non-ConstantInt, bail out.
2186 auto *Elt = dyn_cast_or_null<ConstantInt>(CV->getAggregateElement(i));
2190 MinSignBits = std::min(MinSignBits, Elt->getValue().getNumSignBits());
2196 static unsigned ComputeNumSignBitsImpl(const Value *V, unsigned Depth,
2199 static unsigned ComputeNumSignBits(const Value *V, unsigned Depth,
2201 unsigned Result = ComputeNumSignBitsImpl(V, Depth, Q);
2202 assert(Result > 0 && "At least one sign bit needs to be present!");
2206 /// Return the number of times the sign bit of the register is replicated into
2207 /// the other bits. We know that at least 1 bit is always equal to the sign bit
2208 /// (itself), but other cases can give us information. For example, immediately
2209 /// after an "ashr X, 2", we know that the top 3 bits are all equal to each
2210 /// other, so we return 3. For vectors, return the number of sign bits for the
2211 /// vector element with the minimum number of known sign bits.
2212 static unsigned ComputeNumSignBitsImpl(const Value *V, unsigned Depth,
2214 assert(Depth <= MaxDepth && "Limit Search Depth");
2216 // We return the minimum number of sign bits that are guaranteed to be present
2217 // in V, so for undef we have to conservatively return 1. We don't have the
2218 // same behavior for poison though -- that's a FIXME today.
2220 Type *ScalarTy = V->getType()->getScalarType();
2221 unsigned TyBits = ScalarTy->isPointerTy() ?
2222 Q.DL.getIndexTypeSizeInBits(ScalarTy) :
2223 Q.DL.getTypeSizeInBits(ScalarTy);
2226 unsigned FirstAnswer = 1;
2228 // Note that ConstantInt is handled by the general computeKnownBits case
2231 if (Depth == MaxDepth)
2232 return 1; // Limit search depth.
2234 const Operator *U = dyn_cast<Operator>(V);
2235 switch (Operator::getOpcode(V)) {
2237 case Instruction::SExt:
2238 Tmp = TyBits - U->getOperand(0)->getType()->getScalarSizeInBits();
2239 return ComputeNumSignBits(U->getOperand(0), Depth + 1, Q) + Tmp;
2241 case Instruction::SDiv: {
2242 const APInt *Denominator;
2243 // sdiv X, C -> adds log(C) sign bits.
2244 if (match(U->getOperand(1), m_APInt(Denominator))) {
2246 // Ignore non-positive denominator.
2247 if (!Denominator->isStrictlyPositive())
2250 // Calculate the incoming numerator bits.
2251 unsigned NumBits = ComputeNumSignBits(U->getOperand(0), Depth + 1, Q);
2253 // Add floor(log(C)) bits to the numerator bits.
2254 return std::min(TyBits, NumBits + Denominator->logBase2());
2259 case Instruction::SRem: {
2260 const APInt *Denominator;
2261 // srem X, C -> we know that the result is within [-C+1,C) when C is a
2262 // positive constant. This let us put a lower bound on the number of sign
2264 if (match(U->getOperand(1), m_APInt(Denominator))) {
2266 // Ignore non-positive denominator.
2267 if (!Denominator->isStrictlyPositive())
2270 // Calculate the incoming numerator bits. SRem by a positive constant
2271 // can't lower the number of sign bits.
2273 ComputeNumSignBits(U->getOperand(0), Depth + 1, Q);
2275 // Calculate the leading sign bit constraints by examining the
2276 // denominator. Given that the denominator is positive, there are two
2279 // 1. the numerator is positive. The result range is [0,C) and [0,C) u<
2280 // (1 << ceilLogBase2(C)).
2282 // 2. the numerator is negative. Then the result range is (-C,0] and
2283 // integers in (-C,0] are either 0 or >u (-1 << ceilLogBase2(C)).
2285 // Thus a lower bound on the number of sign bits is `TyBits -
2286 // ceilLogBase2(C)`.
2288 unsigned ResBits = TyBits - Denominator->ceilLogBase2();
2289 return std::max(NumrBits, ResBits);
2294 case Instruction::AShr: {
2295 Tmp = ComputeNumSignBits(U->getOperand(0), Depth + 1, Q);
2296 // ashr X, C -> adds C sign bits. Vectors too.
2298 if (match(U->getOperand(1), m_APInt(ShAmt))) {
2299 if (ShAmt->uge(TyBits))
2300 break; // Bad shift.
2301 unsigned ShAmtLimited = ShAmt->getZExtValue();
2302 Tmp += ShAmtLimited;
2303 if (Tmp > TyBits) Tmp = TyBits;
2307 case Instruction::Shl: {
2309 if (match(U->getOperand(1), m_APInt(ShAmt))) {
2310 // shl destroys sign bits.
2311 Tmp = ComputeNumSignBits(U->getOperand(0), Depth + 1, Q);
2312 if (ShAmt->uge(TyBits) || // Bad shift.
2313 ShAmt->uge(Tmp)) break; // Shifted all sign bits out.
2314 Tmp2 = ShAmt->getZExtValue();
2319 case Instruction::And:
2320 case Instruction::Or:
2321 case Instruction::Xor: // NOT is handled here.
2322 // Logical binary ops preserve the number of sign bits at the worst.
2323 Tmp = ComputeNumSignBits(U->getOperand(0), Depth + 1, Q);
2325 Tmp2 = ComputeNumSignBits(U->getOperand(1), Depth + 1, Q);
2326 FirstAnswer = std::min(Tmp, Tmp2);
2327 // We computed what we know about the sign bits as our first
2328 // answer. Now proceed to the generic code that uses
2329 // computeKnownBits, and pick whichever answer is better.
2333 case Instruction::Select:
2334 Tmp = ComputeNumSignBits(U->getOperand(1), Depth + 1, Q);
2335 if (Tmp == 1) return 1; // Early out.
2336 Tmp2 = ComputeNumSignBits(U->getOperand(2), Depth + 1, Q);
2337 return std::min(Tmp, Tmp2);
2339 case Instruction::Add:
2340 // Add can have at most one carry bit. Thus we know that the output
2341 // is, at worst, one more bit than the inputs.
2342 Tmp = ComputeNumSignBits(U->getOperand(0), Depth + 1, Q);
2343 if (Tmp == 1) return 1; // Early out.
2345 // Special case decrementing a value (ADD X, -1):
2346 if (const auto *CRHS = dyn_cast<Constant>(U->getOperand(1)))
2347 if (CRHS->isAllOnesValue()) {
2348 KnownBits Known(TyBits);
2349 computeKnownBits(U->getOperand(0), Known, Depth + 1, Q);
2351 // If the input is known to be 0 or 1, the output is 0/-1, which is all
2353 if ((Known.Zero | 1).isAllOnesValue())
2356 // If we are subtracting one from a positive number, there is no carry
2357 // out of the result.
2358 if (Known.isNonNegative())
2362 Tmp2 = ComputeNumSignBits(U->getOperand(1), Depth + 1, Q);
2363 if (Tmp2 == 1) return 1;
2364 return std::min(Tmp, Tmp2)-1;
2366 case Instruction::Sub:
2367 Tmp2 = ComputeNumSignBits(U->getOperand(1), Depth + 1, Q);
2368 if (Tmp2 == 1) return 1;
2371 if (const auto *CLHS = dyn_cast<Constant>(U->getOperand(0)))
2372 if (CLHS->isNullValue()) {
2373 KnownBits Known(TyBits);
2374 computeKnownBits(U->getOperand(1), Known, Depth + 1, Q);
2375 // If the input is known to be 0 or 1, the output is 0/-1, which is all
2377 if ((Known.Zero | 1).isAllOnesValue())
2380 // If the input is known to be positive (the sign bit is known clear),
2381 // the output of the NEG has the same number of sign bits as the input.
2382 if (Known.isNonNegative())
2385 // Otherwise, we treat this like a SUB.
2388 // Sub can have at most one carry bit. Thus we know that the output
2389 // is, at worst, one more bit than the inputs.
2390 Tmp = ComputeNumSignBits(U->getOperand(0), Depth + 1, Q);
2391 if (Tmp == 1) return 1; // Early out.
2392 return std::min(Tmp, Tmp2)-1;
2394 case Instruction::Mul: {
2395 // The output of the Mul can be at most twice the valid bits in the inputs.
2396 unsigned SignBitsOp0 = ComputeNumSignBits(U->getOperand(0), Depth + 1, Q);
2397 if (SignBitsOp0 == 1) return 1; // Early out.
2398 unsigned SignBitsOp1 = ComputeNumSignBits(U->getOperand(1), Depth + 1, Q);
2399 if (SignBitsOp1 == 1) return 1;
2400 unsigned OutValidBits =
2401 (TyBits - SignBitsOp0 + 1) + (TyBits - SignBitsOp1 + 1);
2402 return OutValidBits > TyBits ? 1 : TyBits - OutValidBits + 1;
2405 case Instruction::PHI: {
2406 const PHINode *PN = cast<PHINode>(U);
2407 unsigned NumIncomingValues = PN->getNumIncomingValues();
2408 // Don't analyze large in-degree PHIs.
2409 if (NumIncomingValues > 4) break;
2410 // Unreachable blocks may have zero-operand PHI nodes.
2411 if (NumIncomingValues == 0) break;
2413 // Take the minimum of all incoming values. This can't infinitely loop
2414 // because of our depth threshold.
2415 Tmp = ComputeNumSignBits(PN->getIncomingValue(0), Depth + 1, Q);
2416 for (unsigned i = 1, e = NumIncomingValues; i != e; ++i) {
2417 if (Tmp == 1) return Tmp;
2419 Tmp, ComputeNumSignBits(PN->getIncomingValue(i), Depth + 1, Q));
2424 case Instruction::Trunc:
2425 // FIXME: it's tricky to do anything useful for this, but it is an important
2426 // case for targets like X86.
2429 case Instruction::ExtractElement:
2430 // Look through extract element. At the moment we keep this simple and skip
2431 // tracking the specific element. But at least we might find information
2432 // valid for all elements of the vector (for example if vector is sign
2433 // extended, shifted, etc).
2434 return ComputeNumSignBits(U->getOperand(0), Depth + 1, Q);
2437 // Finally, if we can prove that the top bits of the result are 0's or 1's,
2438 // use this information.
2440 // If we can examine all elements of a vector constant successfully, we're
2441 // done (we can't do any better than that). If not, keep trying.
2442 if (unsigned VecSignBits = computeNumSignBitsVectorConstant(V, TyBits))
2445 KnownBits Known(TyBits);
2446 computeKnownBits(V, Known, Depth, Q);
2448 // If we know that the sign bit is either zero or one, determine the number of
2449 // identical bits in the top of the input value.
2450 return std::max(FirstAnswer, Known.countMinSignBits());
2453 /// This function computes the integer multiple of Base that equals V.
2454 /// If successful, it returns true and returns the multiple in
2455 /// Multiple. If unsuccessful, it returns false. It looks
2456 /// through SExt instructions only if LookThroughSExt is true.
2457 bool llvm::ComputeMultiple(Value *V, unsigned Base, Value *&Multiple,
2458 bool LookThroughSExt, unsigned Depth) {
2459 const unsigned MaxDepth = 6;
2461 assert(V && "No Value?");
2462 assert(Depth <= MaxDepth && "Limit Search Depth");
2463 assert(V->getType()->isIntegerTy() && "Not integer or pointer type!");
2465 Type *T = V->getType();
2467 ConstantInt *CI = dyn_cast<ConstantInt>(V);
2477 ConstantExpr *CO = dyn_cast<ConstantExpr>(V);
2478 Constant *BaseVal = ConstantInt::get(T, Base);
2479 if (CO && CO == BaseVal) {
2481 Multiple = ConstantInt::get(T, 1);
2485 if (CI && CI->getZExtValue() % Base == 0) {
2486 Multiple = ConstantInt::get(T, CI->getZExtValue() / Base);
2490 if (Depth == MaxDepth) return false; // Limit search depth.
2492 Operator *I = dyn_cast<Operator>(V);
2493 if (!I) return false;
2495 switch (I->getOpcode()) {
2497 case Instruction::SExt:
2498 if (!LookThroughSExt) return false;
2499 // otherwise fall through to ZExt
2501 case Instruction::ZExt:
2502 return ComputeMultiple(I->getOperand(0), Base, Multiple,
2503 LookThroughSExt, Depth+1);
2504 case Instruction::Shl:
2505 case Instruction::Mul: {
2506 Value *Op0 = I->getOperand(0);
2507 Value *Op1 = I->getOperand(1);
2509 if (I->getOpcode() == Instruction::Shl) {
2510 ConstantInt *Op1CI = dyn_cast<ConstantInt>(Op1);
2511 if (!Op1CI) return false;
2512 // Turn Op0 << Op1 into Op0 * 2^Op1
2513 APInt Op1Int = Op1CI->getValue();
2514 uint64_t BitToSet = Op1Int.getLimitedValue(Op1Int.getBitWidth() - 1);
2515 APInt API(Op1Int.getBitWidth(), 0);
2516 API.setBit(BitToSet);
2517 Op1 = ConstantInt::get(V->getContext(), API);
2520 Value *Mul0 = nullptr;
2521 if (ComputeMultiple(Op0, Base, Mul0, LookThroughSExt, Depth+1)) {
2522 if (Constant *Op1C = dyn_cast<Constant>(Op1))
2523 if (Constant *MulC = dyn_cast<Constant>(Mul0)) {
2524 if (Op1C->getType()->getPrimitiveSizeInBits() <
2525 MulC->getType()->getPrimitiveSizeInBits())
2526 Op1C = ConstantExpr::getZExt(Op1C, MulC->getType());
2527 if (Op1C->getType()->getPrimitiveSizeInBits() >
2528 MulC->getType()->getPrimitiveSizeInBits())
2529 MulC = ConstantExpr::getZExt(MulC, Op1C->getType());
2531 // V == Base * (Mul0 * Op1), so return (Mul0 * Op1)
2532 Multiple = ConstantExpr::getMul(MulC, Op1C);
2536 if (ConstantInt *Mul0CI = dyn_cast<ConstantInt>(Mul0))
2537 if (Mul0CI->getValue() == 1) {
2538 // V == Base * Op1, so return Op1
2544 Value *Mul1 = nullptr;
2545 if (ComputeMultiple(Op1, Base, Mul1, LookThroughSExt, Depth+1)) {
2546 if (Constant *Op0C = dyn_cast<Constant>(Op0))
2547 if (Constant *MulC = dyn_cast<Constant>(Mul1)) {
2548 if (Op0C->getType()->getPrimitiveSizeInBits() <
2549 MulC->getType()->getPrimitiveSizeInBits())
2550 Op0C = ConstantExpr::getZExt(Op0C, MulC->getType());
2551 if (Op0C->getType()->getPrimitiveSizeInBits() >
2552 MulC->getType()->getPrimitiveSizeInBits())
2553 MulC = ConstantExpr::getZExt(MulC, Op0C->getType());
2555 // V == Base * (Mul1 * Op0), so return (Mul1 * Op0)
2556 Multiple = ConstantExpr::getMul(MulC, Op0C);
2560 if (ConstantInt *Mul1CI = dyn_cast<ConstantInt>(Mul1))
2561 if (Mul1CI->getValue() == 1) {
2562 // V == Base * Op0, so return Op0
2570 // We could not determine if V is a multiple of Base.
2574 Intrinsic::ID llvm::getIntrinsicForCallSite(ImmutableCallSite ICS,
2575 const TargetLibraryInfo *TLI) {
2576 const Function *F = ICS.getCalledFunction();
2578 return Intrinsic::not_intrinsic;
2580 if (F->isIntrinsic())
2581 return F->getIntrinsicID();
2584 return Intrinsic::not_intrinsic;
2587 // We're going to make assumptions on the semantics of the functions, check
2588 // that the target knows that it's available in this environment and it does
2589 // not have local linkage.
2590 if (!F || F->hasLocalLinkage() || !TLI->getLibFunc(*F, Func))
2591 return Intrinsic::not_intrinsic;
2593 if (!ICS.onlyReadsMemory())
2594 return Intrinsic::not_intrinsic;
2596 // Otherwise check if we have a call to a function that can be turned into a
2597 // vector intrinsic.
2604 return Intrinsic::sin;
2608 return Intrinsic::cos;
2612 return Intrinsic::exp;
2616 return Intrinsic::exp2;
2620 return Intrinsic::log;
2622 case LibFunc_log10f:
2623 case LibFunc_log10l:
2624 return Intrinsic::log10;
2628 return Intrinsic::log2;
2632 return Intrinsic::fabs;
2636 return Intrinsic::minnum;
2640 return Intrinsic::maxnum;
2641 case LibFunc_copysign:
2642 case LibFunc_copysignf:
2643 case LibFunc_copysignl:
2644 return Intrinsic::copysign;
2646 case LibFunc_floorf:
2647 case LibFunc_floorl:
2648 return Intrinsic::floor;
2652 return Intrinsic::ceil;
2654 case LibFunc_truncf:
2655 case LibFunc_truncl:
2656 return Intrinsic::trunc;
2660 return Intrinsic::rint;
2661 case LibFunc_nearbyint:
2662 case LibFunc_nearbyintf:
2663 case LibFunc_nearbyintl:
2664 return Intrinsic::nearbyint;
2666 case LibFunc_roundf:
2667 case LibFunc_roundl:
2668 return Intrinsic::round;
2672 return Intrinsic::pow;
2676 return Intrinsic::sqrt;
2679 return Intrinsic::not_intrinsic;
2682 /// Return true if we can prove that the specified FP value is never equal to
2685 /// NOTE: this function will need to be revisited when we support non-default
2687 bool llvm::CannotBeNegativeZero(const Value *V, const TargetLibraryInfo *TLI,
2689 if (auto *CFP = dyn_cast<ConstantFP>(V))
2690 return !CFP->getValueAPF().isNegZero();
2692 // Limit search depth.
2693 if (Depth == MaxDepth)
2696 auto *Op = dyn_cast<Operator>(V);
2700 // Check if the nsz fast-math flag is set.
2701 if (auto *FPO = dyn_cast<FPMathOperator>(Op))
2702 if (FPO->hasNoSignedZeros())
2705 // (fadd x, 0.0) is guaranteed to return +0.0, not -0.0.
2706 if (match(Op, m_FAdd(m_Value(), m_PosZeroFP())))
2709 // sitofp and uitofp turn into +0.0 for zero.
2710 if (isa<SIToFPInst>(Op) || isa<UIToFPInst>(Op))
2713 if (auto *Call = dyn_cast<CallInst>(Op)) {
2714 Intrinsic::ID IID = getIntrinsicForCallSite(Call, TLI);
2718 // sqrt(-0.0) = -0.0, no other negative results are possible.
2719 case Intrinsic::sqrt:
2720 return CannotBeNegativeZero(Call->getArgOperand(0), TLI, Depth + 1);
2722 case Intrinsic::fabs:
2730 /// If \p SignBitOnly is true, test for a known 0 sign bit rather than a
2731 /// standard ordered compare. e.g. make -0.0 olt 0.0 be true because of the sign
2732 /// bit despite comparing equal.
2733 static bool cannotBeOrderedLessThanZeroImpl(const Value *V,
2734 const TargetLibraryInfo *TLI,
2737 // TODO: This function does not do the right thing when SignBitOnly is true
2738 // and we're lowering to a hypothetical IEEE 754-compliant-but-evil platform
2739 // which flips the sign bits of NaNs. See
2740 // https://llvm.org/bugs/show_bug.cgi?id=31702.
2742 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(V)) {
2743 return !CFP->getValueAPF().isNegative() ||
2744 (!SignBitOnly && CFP->getValueAPF().isZero());
2747 // Handle vector of constants.
2748 if (auto *CV = dyn_cast<Constant>(V)) {
2749 if (CV->getType()->isVectorTy()) {
2750 unsigned NumElts = CV->getType()->getVectorNumElements();
2751 for (unsigned i = 0; i != NumElts; ++i) {
2752 auto *CFP = dyn_cast_or_null<ConstantFP>(CV->getAggregateElement(i));
2755 if (CFP->getValueAPF().isNegative() &&
2756 (SignBitOnly || !CFP->getValueAPF().isZero()))
2760 // All non-negative ConstantFPs.
2765 if (Depth == MaxDepth)
2766 return false; // Limit search depth.
2768 const Operator *I = dyn_cast<Operator>(V);
2772 switch (I->getOpcode()) {
2775 // Unsigned integers are always nonnegative.
2776 case Instruction::UIToFP:
2778 case Instruction::FMul:
2779 // x*x is always non-negative or a NaN.
2780 if (I->getOperand(0) == I->getOperand(1) &&
2781 (!SignBitOnly || cast<FPMathOperator>(I)->hasNoNaNs()))
2785 case Instruction::FAdd:
2786 case Instruction::FDiv:
2787 case Instruction::FRem:
2788 return cannotBeOrderedLessThanZeroImpl(I->getOperand(0), TLI, SignBitOnly,
2790 cannotBeOrderedLessThanZeroImpl(I->getOperand(1), TLI, SignBitOnly,
2792 case Instruction::Select:
2793 return cannotBeOrderedLessThanZeroImpl(I->getOperand(1), TLI, SignBitOnly,
2795 cannotBeOrderedLessThanZeroImpl(I->getOperand(2), TLI, SignBitOnly,
2797 case Instruction::FPExt:
2798 case Instruction::FPTrunc:
2799 // Widening/narrowing never change sign.
2800 return cannotBeOrderedLessThanZeroImpl(I->getOperand(0), TLI, SignBitOnly,
2802 case Instruction::ExtractElement:
2803 // Look through extract element. At the moment we keep this simple and skip
2804 // tracking the specific element. But at least we might find information
2805 // valid for all elements of the vector.
2806 return cannotBeOrderedLessThanZeroImpl(I->getOperand(0), TLI, SignBitOnly,
2808 case Instruction::Call:
2809 const auto *CI = cast<CallInst>(I);
2810 Intrinsic::ID IID = getIntrinsicForCallSite(CI, TLI);
2814 case Intrinsic::maxnum:
2815 return cannotBeOrderedLessThanZeroImpl(I->getOperand(0), TLI, SignBitOnly,
2817 cannotBeOrderedLessThanZeroImpl(I->getOperand(1), TLI, SignBitOnly,
2819 case Intrinsic::minnum:
2820 return cannotBeOrderedLessThanZeroImpl(I->getOperand(0), TLI, SignBitOnly,
2822 cannotBeOrderedLessThanZeroImpl(I->getOperand(1), TLI, SignBitOnly,
2824 case Intrinsic::exp:
2825 case Intrinsic::exp2:
2826 case Intrinsic::fabs:
2829 case Intrinsic::sqrt:
2830 // sqrt(x) is always >= -0 or NaN. Moreover, sqrt(x) == -0 iff x == -0.
2833 return CI->hasNoNaNs() && (CI->hasNoSignedZeros() ||
2834 CannotBeNegativeZero(CI->getOperand(0), TLI));
2836 case Intrinsic::powi:
2837 if (ConstantInt *Exponent = dyn_cast<ConstantInt>(I->getOperand(1))) {
2838 // powi(x,n) is non-negative if n is even.
2839 if (Exponent->getBitWidth() <= 64 && Exponent->getSExtValue() % 2u == 0)
2842 // TODO: This is not correct. Given that exp is an integer, here are the
2843 // ways that pow can return a negative value:
2845 // pow(x, exp) --> negative if exp is odd and x is negative.
2846 // pow(-0, exp) --> -inf if exp is negative odd.
2847 // pow(-0, exp) --> -0 if exp is positive odd.
2848 // pow(-inf, exp) --> -0 if exp is negative odd.
2849 // pow(-inf, exp) --> -inf if exp is positive odd.
2851 // Therefore, if !SignBitOnly, we can return true if x >= +0 or x is NaN,
2852 // but we must return false if x == -0. Unfortunately we do not currently
2853 // have a way of expressing this constraint. See details in
2854 // https://llvm.org/bugs/show_bug.cgi?id=31702.
2855 return cannotBeOrderedLessThanZeroImpl(I->getOperand(0), TLI, SignBitOnly,
2858 case Intrinsic::fma:
2859 case Intrinsic::fmuladd:
2860 // x*x+y is non-negative if y is non-negative.
2861 return I->getOperand(0) == I->getOperand(1) &&
2862 (!SignBitOnly || cast<FPMathOperator>(I)->hasNoNaNs()) &&
2863 cannotBeOrderedLessThanZeroImpl(I->getOperand(2), TLI, SignBitOnly,
2871 bool llvm::CannotBeOrderedLessThanZero(const Value *V,
2872 const TargetLibraryInfo *TLI) {
2873 return cannotBeOrderedLessThanZeroImpl(V, TLI, false, 0);
2876 bool llvm::SignBitMustBeZero(const Value *V, const TargetLibraryInfo *TLI) {
2877 return cannotBeOrderedLessThanZeroImpl(V, TLI, true, 0);
2880 bool llvm::isKnownNeverNaN(const Value *V) {
2881 assert(V->getType()->isFPOrFPVectorTy() && "Querying for NaN on non-FP type");
2883 // If we're told that NaNs won't happen, assume they won't.
2884 if (auto *FPMathOp = dyn_cast<FPMathOperator>(V))
2885 if (FPMathOp->hasNoNaNs())
2888 // TODO: Handle instructions and potentially recurse like other 'isKnown'
2889 // functions. For example, the result of sitofp is never NaN.
2891 // Handle scalar constants.
2892 if (auto *CFP = dyn_cast<ConstantFP>(V))
2893 return !CFP->isNaN();
2895 // Bail out for constant expressions, but try to handle vector constants.
2896 if (!V->getType()->isVectorTy() || !isa<Constant>(V))
2899 // For vectors, verify that each element is not NaN.
2900 unsigned NumElts = V->getType()->getVectorNumElements();
2901 for (unsigned i = 0; i != NumElts; ++i) {
2902 Constant *Elt = cast<Constant>(V)->getAggregateElement(i);
2905 if (isa<UndefValue>(Elt))
2907 auto *CElt = dyn_cast<ConstantFP>(Elt);
2908 if (!CElt || CElt->isNaN())
2911 // All elements were confirmed not-NaN or undefined.
2915 /// If the specified value can be set by repeating the same byte in memory,
2916 /// return the i8 value that it is represented with. This is
2917 /// true for all i8 values obviously, but is also true for i32 0, i32 -1,
2918 /// i16 0xF0F0, double 0.0 etc. If the value can't be handled with a repeated
2919 /// byte store (e.g. i16 0x1234), return null.
2920 Value *llvm::isBytewiseValue(Value *V) {
2921 // All byte-wide stores are splatable, even of arbitrary variables.
2922 if (V->getType()->isIntegerTy(8)) return V;
2924 // Handle 'null' ConstantArrayZero etc.
2925 if (Constant *C = dyn_cast<Constant>(V))
2926 if (C->isNullValue())
2927 return Constant::getNullValue(Type::getInt8Ty(V->getContext()));
2929 // Constant float and double values can be handled as integer values if the
2930 // corresponding integer value is "byteable". An important case is 0.0.
2931 if (ConstantFP *CFP = dyn_cast<ConstantFP>(V)) {
2932 if (CFP->getType()->isFloatTy())
2933 V = ConstantExpr::getBitCast(CFP, Type::getInt32Ty(V->getContext()));
2934 if (CFP->getType()->isDoubleTy())
2935 V = ConstantExpr::getBitCast(CFP, Type::getInt64Ty(V->getContext()));
2936 // Don't handle long double formats, which have strange constraints.
2939 // We can handle constant integers that are multiple of 8 bits.
2940 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
2941 if (CI->getBitWidth() % 8 == 0) {
2942 assert(CI->getBitWidth() > 8 && "8 bits should be handled above!");
2944 if (!CI->getValue().isSplat(8))
2946 return ConstantInt::get(V->getContext(), CI->getValue().trunc(8));
2950 // A ConstantDataArray/Vector is splatable if all its members are equal and
2952 if (ConstantDataSequential *CA = dyn_cast<ConstantDataSequential>(V)) {
2953 Value *Elt = CA->getElementAsConstant(0);
2954 Value *Val = isBytewiseValue(Elt);
2958 for (unsigned I = 1, E = CA->getNumElements(); I != E; ++I)
2959 if (CA->getElementAsConstant(I) != Elt)
2965 // Conceptually, we could handle things like:
2966 // %a = zext i8 %X to i16
2967 // %b = shl i16 %a, 8
2968 // %c = or i16 %a, %b
2969 // but until there is an example that actually needs this, it doesn't seem
2970 // worth worrying about.
2974 // This is the recursive version of BuildSubAggregate. It takes a few different
2975 // arguments. Idxs is the index within the nested struct From that we are
2976 // looking at now (which is of type IndexedType). IdxSkip is the number of
2977 // indices from Idxs that should be left out when inserting into the resulting
2978 // struct. To is the result struct built so far, new insertvalue instructions
2980 static Value *BuildSubAggregate(Value *From, Value* To, Type *IndexedType,
2981 SmallVectorImpl<unsigned> &Idxs,
2983 Instruction *InsertBefore) {
2984 StructType *STy = dyn_cast<StructType>(IndexedType);
2986 // Save the original To argument so we can modify it
2988 // General case, the type indexed by Idxs is a struct
2989 for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i) {
2990 // Process each struct element recursively
2993 To = BuildSubAggregate(From, To, STy->getElementType(i), Idxs, IdxSkip,
2997 // Couldn't find any inserted value for this index? Cleanup
2998 while (PrevTo != OrigTo) {
2999 InsertValueInst* Del = cast<InsertValueInst>(PrevTo);
3000 PrevTo = Del->getAggregateOperand();
3001 Del->eraseFromParent();
3003 // Stop processing elements
3007 // If we successfully found a value for each of our subaggregates
3011 // Base case, the type indexed by SourceIdxs is not a struct, or not all of
3012 // the struct's elements had a value that was inserted directly. In the latter
3013 // case, perhaps we can't determine each of the subelements individually, but
3014 // we might be able to find the complete struct somewhere.
3016 // Find the value that is at that particular spot
3017 Value *V = FindInsertedValue(From, Idxs);
3022 // Insert the value in the new (sub) aggregate
3023 return InsertValueInst::Create(To, V, makeArrayRef(Idxs).slice(IdxSkip),
3024 "tmp", InsertBefore);
3027 // This helper takes a nested struct and extracts a part of it (which is again a
3028 // struct) into a new value. For example, given the struct:
3029 // { a, { b, { c, d }, e } }
3030 // and the indices "1, 1" this returns
3033 // It does this by inserting an insertvalue for each element in the resulting
3034 // struct, as opposed to just inserting a single struct. This will only work if
3035 // each of the elements of the substruct are known (ie, inserted into From by an
3036 // insertvalue instruction somewhere).
3038 // All inserted insertvalue instructions are inserted before InsertBefore
3039 static Value *BuildSubAggregate(Value *From, ArrayRef<unsigned> idx_range,
3040 Instruction *InsertBefore) {
3041 assert(InsertBefore && "Must have someplace to insert!");
3042 Type *IndexedType = ExtractValueInst::getIndexedType(From->getType(),
3044 Value *To = UndefValue::get(IndexedType);
3045 SmallVector<unsigned, 10> Idxs(idx_range.begin(), idx_range.end());
3046 unsigned IdxSkip = Idxs.size();
3048 return BuildSubAggregate(From, To, IndexedType, Idxs, IdxSkip, InsertBefore);
3051 /// Given an aggregate and a sequence of indices, see if the scalar value
3052 /// indexed is already around as a register, for example if it was inserted
3053 /// directly into the aggregate.
3055 /// If InsertBefore is not null, this function will duplicate (modified)
3056 /// insertvalues when a part of a nested struct is extracted.
3057 Value *llvm::FindInsertedValue(Value *V, ArrayRef<unsigned> idx_range,
3058 Instruction *InsertBefore) {
3059 // Nothing to index? Just return V then (this is useful at the end of our
3061 if (idx_range.empty())
3063 // We have indices, so V should have an indexable type.
3064 assert((V->getType()->isStructTy() || V->getType()->isArrayTy()) &&
3065 "Not looking at a struct or array?");
3066 assert(ExtractValueInst::getIndexedType(V->getType(), idx_range) &&
3067 "Invalid indices for type?");
3069 if (Constant *C = dyn_cast<Constant>(V)) {
3070 C = C->getAggregateElement(idx_range[0]);
3071 if (!C) return nullptr;
3072 return FindInsertedValue(C, idx_range.slice(1), InsertBefore);
3075 if (InsertValueInst *I = dyn_cast<InsertValueInst>(V)) {
3076 // Loop the indices for the insertvalue instruction in parallel with the
3077 // requested indices
3078 const unsigned *req_idx = idx_range.begin();
3079 for (const unsigned *i = I->idx_begin(), *e = I->idx_end();
3080 i != e; ++i, ++req_idx) {
3081 if (req_idx == idx_range.end()) {
3082 // We can't handle this without inserting insertvalues
3086 // The requested index identifies a part of a nested aggregate. Handle
3087 // this specially. For example,
3088 // %A = insertvalue { i32, {i32, i32 } } undef, i32 10, 1, 0
3089 // %B = insertvalue { i32, {i32, i32 } } %A, i32 11, 1, 1
3090 // %C = extractvalue {i32, { i32, i32 } } %B, 1
3091 // This can be changed into
3092 // %A = insertvalue {i32, i32 } undef, i32 10, 0
3093 // %C = insertvalue {i32, i32 } %A, i32 11, 1
3094 // which allows the unused 0,0 element from the nested struct to be
3096 return BuildSubAggregate(V, makeArrayRef(idx_range.begin(), req_idx),
3100 // This insert value inserts something else than what we are looking for.
3101 // See if the (aggregate) value inserted into has the value we are
3102 // looking for, then.
3104 return FindInsertedValue(I->getAggregateOperand(), idx_range,
3107 // If we end up here, the indices of the insertvalue match with those
3108 // requested (though possibly only partially). Now we recursively look at
3109 // the inserted value, passing any remaining indices.
3110 return FindInsertedValue(I->getInsertedValueOperand(),
3111 makeArrayRef(req_idx, idx_range.end()),
3115 if (ExtractValueInst *I = dyn_cast<ExtractValueInst>(V)) {
3116 // If we're extracting a value from an aggregate that was extracted from
3117 // something else, we can extract from that something else directly instead.
3118 // However, we will need to chain I's indices with the requested indices.
3120 // Calculate the number of indices required
3121 unsigned size = I->getNumIndices() + idx_range.size();
3122 // Allocate some space to put the new indices in
3123 SmallVector<unsigned, 5> Idxs;
3125 // Add indices from the extract value instruction
3126 Idxs.append(I->idx_begin(), I->idx_end());
3128 // Add requested indices
3129 Idxs.append(idx_range.begin(), idx_range.end());
3131 assert(Idxs.size() == size
3132 && "Number of indices added not correct?");
3134 return FindInsertedValue(I->getAggregateOperand(), Idxs, InsertBefore);
3136 // Otherwise, we don't know (such as, extracting from a function return value
3137 // or load instruction)
3141 /// Analyze the specified pointer to see if it can be expressed as a base
3142 /// pointer plus a constant offset. Return the base and offset to the caller.
3143 Value *llvm::GetPointerBaseWithConstantOffset(Value *Ptr, int64_t &Offset,
3144 const DataLayout &DL) {
3145 unsigned BitWidth = DL.getIndexTypeSizeInBits(Ptr->getType());
3146 APInt ByteOffset(BitWidth, 0);
3148 // We walk up the defs but use a visited set to handle unreachable code. In
3149 // that case, we stop after accumulating the cycle once (not that it
3151 SmallPtrSet<Value *, 16> Visited;
3152 while (Visited.insert(Ptr).second) {
3153 if (Ptr->getType()->isVectorTy())
3156 if (GEPOperator *GEP = dyn_cast<GEPOperator>(Ptr)) {
3157 // If one of the values we have visited is an addrspacecast, then
3158 // the pointer type of this GEP may be different from the type
3159 // of the Ptr parameter which was passed to this function. This
3160 // means when we construct GEPOffset, we need to use the size
3161 // of GEP's pointer type rather than the size of the original
3163 APInt GEPOffset(DL.getIndexTypeSizeInBits(Ptr->getType()), 0);
3164 if (!GEP->accumulateConstantOffset(DL, GEPOffset))
3167 ByteOffset += GEPOffset.getSExtValue();
3169 Ptr = GEP->getPointerOperand();
3170 } else if (Operator::getOpcode(Ptr) == Instruction::BitCast ||
3171 Operator::getOpcode(Ptr) == Instruction::AddrSpaceCast) {
3172 Ptr = cast<Operator>(Ptr)->getOperand(0);
3173 } else if (GlobalAlias *GA = dyn_cast<GlobalAlias>(Ptr)) {
3174 if (GA->isInterposable())
3176 Ptr = GA->getAliasee();
3181 Offset = ByteOffset.getSExtValue();
3185 bool llvm::isGEPBasedOnPointerToString(const GEPOperator *GEP,
3186 unsigned CharSize) {
3187 // Make sure the GEP has exactly three arguments.
3188 if (GEP->getNumOperands() != 3)
3191 // Make sure the index-ee is a pointer to array of \p CharSize integers.
3193 ArrayType *AT = dyn_cast<ArrayType>(GEP->getSourceElementType());
3194 if (!AT || !AT->getElementType()->isIntegerTy(CharSize))
3197 // Check to make sure that the first operand of the GEP is an integer and
3198 // has value 0 so that we are sure we're indexing into the initializer.
3199 const ConstantInt *FirstIdx = dyn_cast<ConstantInt>(GEP->getOperand(1));
3200 if (!FirstIdx || !FirstIdx->isZero())
3206 bool llvm::getConstantDataArrayInfo(const Value *V,
3207 ConstantDataArraySlice &Slice,
3208 unsigned ElementSize, uint64_t Offset) {
3211 // Look through bitcast instructions and geps.
3212 V = V->stripPointerCasts();
3214 // If the value is a GEP instruction or constant expression, treat it as an
3216 if (const GEPOperator *GEP = dyn_cast<GEPOperator>(V)) {
3217 // The GEP operator should be based on a pointer to string constant, and is
3218 // indexing into the string constant.
3219 if (!isGEPBasedOnPointerToString(GEP, ElementSize))
3222 // If the second index isn't a ConstantInt, then this is a variable index
3223 // into the array. If this occurs, we can't say anything meaningful about
3225 uint64_t StartIdx = 0;
3226 if (const ConstantInt *CI = dyn_cast<ConstantInt>(GEP->getOperand(2)))
3227 StartIdx = CI->getZExtValue();
3230 return getConstantDataArrayInfo(GEP->getOperand(0), Slice, ElementSize,
3234 // The GEP instruction, constant or instruction, must reference a global
3235 // variable that is a constant and is initialized. The referenced constant
3236 // initializer is the array that we'll use for optimization.
3237 const GlobalVariable *GV = dyn_cast<GlobalVariable>(V);
3238 if (!GV || !GV->isConstant() || !GV->hasDefinitiveInitializer())
3241 const ConstantDataArray *Array;
3243 if (GV->getInitializer()->isNullValue()) {
3244 Type *GVTy = GV->getValueType();
3245 if ( (ArrayTy = dyn_cast<ArrayType>(GVTy)) ) {
3246 // A zeroinitializer for the array; there is no ConstantDataArray.
3249 const DataLayout &DL = GV->getParent()->getDataLayout();
3250 uint64_t SizeInBytes = DL.getTypeStoreSize(GVTy);
3251 uint64_t Length = SizeInBytes / (ElementSize / 8);
3252 if (Length <= Offset)
3255 Slice.Array = nullptr;
3257 Slice.Length = Length - Offset;
3261 // This must be a ConstantDataArray.
3262 Array = dyn_cast<ConstantDataArray>(GV->getInitializer());
3265 ArrayTy = Array->getType();
3267 if (!ArrayTy->getElementType()->isIntegerTy(ElementSize))
3270 uint64_t NumElts = ArrayTy->getArrayNumElements();
3271 if (Offset > NumElts)
3274 Slice.Array = Array;
3275 Slice.Offset = Offset;
3276 Slice.Length = NumElts - Offset;
3280 /// This function computes the length of a null-terminated C string pointed to
3281 /// by V. If successful, it returns true and returns the string in Str.
3282 /// If unsuccessful, it returns false.
3283 bool llvm::getConstantStringInfo(const Value *V, StringRef &Str,
3284 uint64_t Offset, bool TrimAtNul) {
3285 ConstantDataArraySlice Slice;
3286 if (!getConstantDataArrayInfo(V, Slice, 8, Offset))
3289 if (Slice.Array == nullptr) {
3294 if (Slice.Length == 1) {
3295 Str = StringRef("", 1);
3298 // We cannot instantiate a StringRef as we do not have an appropriate string
3303 // Start out with the entire array in the StringRef.
3304 Str = Slice.Array->getAsString();
3305 // Skip over 'offset' bytes.
3306 Str = Str.substr(Slice.Offset);
3309 // Trim off the \0 and anything after it. If the array is not nul
3310 // terminated, we just return the whole end of string. The client may know
3311 // some other way that the string is length-bound.
3312 Str = Str.substr(0, Str.find('\0'));
3317 // These next two are very similar to the above, but also look through PHI
3319 // TODO: See if we can integrate these two together.
3321 /// If we can compute the length of the string pointed to by
3322 /// the specified pointer, return 'len+1'. If we can't, return 0.
3323 static uint64_t GetStringLengthH(const Value *V,
3324 SmallPtrSetImpl<const PHINode*> &PHIs,
3325 unsigned CharSize) {
3326 // Look through noop bitcast instructions.
3327 V = V->stripPointerCasts();
3329 // If this is a PHI node, there are two cases: either we have already seen it
3331 if (const PHINode *PN = dyn_cast<PHINode>(V)) {
3332 if (!PHIs.insert(PN).second)
3333 return ~0ULL; // already in the set.
3335 // If it was new, see if all the input strings are the same length.
3336 uint64_t LenSoFar = ~0ULL;
3337 for (Value *IncValue : PN->incoming_values()) {
3338 uint64_t Len = GetStringLengthH(IncValue, PHIs, CharSize);
3339 if (Len == 0) return 0; // Unknown length -> unknown.
3341 if (Len == ~0ULL) continue;
3343 if (Len != LenSoFar && LenSoFar != ~0ULL)
3344 return 0; // Disagree -> unknown.
3348 // Success, all agree.
3352 // strlen(select(c,x,y)) -> strlen(x) ^ strlen(y)
3353 if (const SelectInst *SI = dyn_cast<SelectInst>(V)) {
3354 uint64_t Len1 = GetStringLengthH(SI->getTrueValue(), PHIs, CharSize);
3355 if (Len1 == 0) return 0;
3356 uint64_t Len2 = GetStringLengthH(SI->getFalseValue(), PHIs, CharSize);
3357 if (Len2 == 0) return 0;
3358 if (Len1 == ~0ULL) return Len2;
3359 if (Len2 == ~0ULL) return Len1;
3360 if (Len1 != Len2) return 0;
3364 // Otherwise, see if we can read the string.
3365 ConstantDataArraySlice Slice;
3366 if (!getConstantDataArrayInfo(V, Slice, CharSize))
3369 if (Slice.Array == nullptr)
3372 // Search for nul characters
3373 unsigned NullIndex = 0;
3374 for (unsigned E = Slice.Length; NullIndex < E; ++NullIndex) {
3375 if (Slice.Array->getElementAsInteger(Slice.Offset + NullIndex) == 0)
3379 return NullIndex + 1;
3382 /// If we can compute the length of the string pointed to by
3383 /// the specified pointer, return 'len+1'. If we can't, return 0.
3384 uint64_t llvm::GetStringLength(const Value *V, unsigned CharSize) {
3385 if (!V->getType()->isPointerTy())
3388 SmallPtrSet<const PHINode*, 32> PHIs;
3389 uint64_t Len = GetStringLengthH(V, PHIs, CharSize);
3390 // If Len is ~0ULL, we had an infinite phi cycle: this is dead code, so return
3391 // an empty string as a length.
3392 return Len == ~0ULL ? 1 : Len;
3395 const Value *llvm::getArgumentAliasingToReturnedPointer(ImmutableCallSite CS) {
3397 "getArgumentAliasingToReturnedPointer only works on nonnull CallSite");
3398 if (const Value *RV = CS.getReturnedArgOperand())
3400 // This can be used only as a aliasing property.
3401 if (isIntrinsicReturningPointerAliasingArgumentWithoutCapturing(CS))
3402 return CS.getArgOperand(0);
3406 bool llvm::isIntrinsicReturningPointerAliasingArgumentWithoutCapturing(
3407 ImmutableCallSite CS) {
3408 return CS.getIntrinsicID() == Intrinsic::launder_invariant_group ||
3409 CS.getIntrinsicID() == Intrinsic::strip_invariant_group;
3412 /// \p PN defines a loop-variant pointer to an object. Check if the
3413 /// previous iteration of the loop was referring to the same object as \p PN.
3414 static bool isSameUnderlyingObjectInLoop(const PHINode *PN,
3415 const LoopInfo *LI) {
3416 // Find the loop-defined value.
3417 Loop *L = LI->getLoopFor(PN->getParent());
3418 if (PN->getNumIncomingValues() != 2)
3421 // Find the value from previous iteration.
3422 auto *PrevValue = dyn_cast<Instruction>(PN->getIncomingValue(0));
3423 if (!PrevValue || LI->getLoopFor(PrevValue->getParent()) != L)
3424 PrevValue = dyn_cast<Instruction>(PN->getIncomingValue(1));
3425 if (!PrevValue || LI->getLoopFor(PrevValue->getParent()) != L)
3428 // If a new pointer is loaded in the loop, the pointer references a different
3429 // object in every iteration. E.g.:
3433 if (auto *Load = dyn_cast<LoadInst>(PrevValue))
3434 if (!L->isLoopInvariant(Load->getPointerOperand()))
3439 Value *llvm::GetUnderlyingObject(Value *V, const DataLayout &DL,
3440 unsigned MaxLookup) {
3441 if (!V->getType()->isPointerTy())
3443 for (unsigned Count = 0; MaxLookup == 0 || Count < MaxLookup; ++Count) {
3444 if (GEPOperator *GEP = dyn_cast<GEPOperator>(V)) {
3445 V = GEP->getPointerOperand();
3446 } else if (Operator::getOpcode(V) == Instruction::BitCast ||
3447 Operator::getOpcode(V) == Instruction::AddrSpaceCast) {
3448 V = cast<Operator>(V)->getOperand(0);
3449 } else if (GlobalAlias *GA = dyn_cast<GlobalAlias>(V)) {
3450 if (GA->isInterposable())
3452 V = GA->getAliasee();
3453 } else if (isa<AllocaInst>(V)) {
3454 // An alloca can't be further simplified.
3457 if (auto CS = CallSite(V)) {
3458 // CaptureTracking can know about special capturing properties of some
3459 // intrinsics like launder.invariant.group, that can't be expressed with
3460 // the attributes, but have properties like returning aliasing pointer.
3461 // Because some analysis may assume that nocaptured pointer is not
3462 // returned from some special intrinsic (because function would have to
3463 // be marked with returns attribute), it is crucial to use this function
3464 // because it should be in sync with CaptureTracking. Not using it may
3465 // cause weird miscompilations where 2 aliasing pointers are assumed to
3467 if (auto *RP = getArgumentAliasingToReturnedPointer(CS)) {
3473 // See if InstructionSimplify knows any relevant tricks.
3474 if (Instruction *I = dyn_cast<Instruction>(V))
3475 // TODO: Acquire a DominatorTree and AssumptionCache and use them.
3476 if (Value *Simplified = SimplifyInstruction(I, {DL, I})) {
3483 assert(V->getType()->isPointerTy() && "Unexpected operand type!");
3488 void llvm::GetUnderlyingObjects(Value *V, SmallVectorImpl<Value *> &Objects,
3489 const DataLayout &DL, LoopInfo *LI,
3490 unsigned MaxLookup) {
3491 SmallPtrSet<Value *, 4> Visited;
3492 SmallVector<Value *, 4> Worklist;
3493 Worklist.push_back(V);
3495 Value *P = Worklist.pop_back_val();
3496 P = GetUnderlyingObject(P, DL, MaxLookup);
3498 if (!Visited.insert(P).second)
3501 if (SelectInst *SI = dyn_cast<SelectInst>(P)) {
3502 Worklist.push_back(SI->getTrueValue());
3503 Worklist.push_back(SI->getFalseValue());
3507 if (PHINode *PN = dyn_cast<PHINode>(P)) {
3508 // If this PHI changes the underlying object in every iteration of the
3509 // loop, don't look through it. Consider:
3512 // Prev = Curr; // Prev = PHI (Prev_0, Curr)
3516 // Prev is tracking Curr one iteration behind so they refer to different
3517 // underlying objects.
3518 if (!LI || !LI->isLoopHeader(PN->getParent()) ||
3519 isSameUnderlyingObjectInLoop(PN, LI))
3520 for (Value *IncValue : PN->incoming_values())
3521 Worklist.push_back(IncValue);
3525 Objects.push_back(P);
3526 } while (!Worklist.empty());
3529 /// This is the function that does the work of looking through basic
3530 /// ptrtoint+arithmetic+inttoptr sequences.
3531 static const Value *getUnderlyingObjectFromInt(const Value *V) {
3533 if (const Operator *U = dyn_cast<Operator>(V)) {
3534 // If we find a ptrtoint, we can transfer control back to the
3535 // regular getUnderlyingObjectFromInt.
3536 if (U->getOpcode() == Instruction::PtrToInt)
3537 return U->getOperand(0);
3538 // If we find an add of a constant, a multiplied value, or a phi, it's
3539 // likely that the other operand will lead us to the base
3540 // object. We don't have to worry about the case where the
3541 // object address is somehow being computed by the multiply,
3542 // because our callers only care when the result is an
3543 // identifiable object.
3544 if (U->getOpcode() != Instruction::Add ||
3545 (!isa<ConstantInt>(U->getOperand(1)) &&
3546 Operator::getOpcode(U->getOperand(1)) != Instruction::Mul &&
3547 !isa<PHINode>(U->getOperand(1))))
3549 V = U->getOperand(0);
3553 assert(V->getType()->isIntegerTy() && "Unexpected operand type!");
3557 /// This is a wrapper around GetUnderlyingObjects and adds support for basic
3558 /// ptrtoint+arithmetic+inttoptr sequences.
3559 /// It returns false if unidentified object is found in GetUnderlyingObjects.
3560 bool llvm::getUnderlyingObjectsForCodeGen(const Value *V,
3561 SmallVectorImpl<Value *> &Objects,
3562 const DataLayout &DL) {
3563 SmallPtrSet<const Value *, 16> Visited;
3564 SmallVector<const Value *, 4> Working(1, V);
3566 V = Working.pop_back_val();
3568 SmallVector<Value *, 4> Objs;
3569 GetUnderlyingObjects(const_cast<Value *>(V), Objs, DL);
3571 for (Value *V : Objs) {
3572 if (!Visited.insert(V).second)
3574 if (Operator::getOpcode(V) == Instruction::IntToPtr) {
3576 getUnderlyingObjectFromInt(cast<User>(V)->getOperand(0));
3577 if (O->getType()->isPointerTy()) {
3578 Working.push_back(O);
3582 // If GetUnderlyingObjects fails to find an identifiable object,
3583 // getUnderlyingObjectsForCodeGen also fails for safety.
3584 if (!isIdentifiedObject(V)) {
3588 Objects.push_back(const_cast<Value *>(V));
3590 } while (!Working.empty());
3594 /// Return true if the only users of this pointer are lifetime markers.
3595 bool llvm::onlyUsedByLifetimeMarkers(const Value *V) {
3596 for (const User *U : V->users()) {
3597 const IntrinsicInst *II = dyn_cast<IntrinsicInst>(U);
3598 if (!II) return false;
3600 if (II->getIntrinsicID() != Intrinsic::lifetime_start &&
3601 II->getIntrinsicID() != Intrinsic::lifetime_end)
3607 bool llvm::isSafeToSpeculativelyExecute(const Value *V,
3608 const Instruction *CtxI,
3609 const DominatorTree *DT) {
3610 const Operator *Inst = dyn_cast<Operator>(V);
3614 for (unsigned i = 0, e = Inst->getNumOperands(); i != e; ++i)
3615 if (Constant *C = dyn_cast<Constant>(Inst->getOperand(i)))
3619 switch (Inst->getOpcode()) {
3622 case Instruction::UDiv:
3623 case Instruction::URem: {
3624 // x / y is undefined if y == 0.
3626 if (match(Inst->getOperand(1), m_APInt(V)))
3630 case Instruction::SDiv:
3631 case Instruction::SRem: {
3632 // x / y is undefined if y == 0 or x == INT_MIN and y == -1
3633 const APInt *Numerator, *Denominator;
3634 if (!match(Inst->getOperand(1), m_APInt(Denominator)))
3636 // We cannot hoist this division if the denominator is 0.
3637 if (*Denominator == 0)
3639 // It's safe to hoist if the denominator is not 0 or -1.
3640 if (*Denominator != -1)
3642 // At this point we know that the denominator is -1. It is safe to hoist as
3643 // long we know that the numerator is not INT_MIN.
3644 if (match(Inst->getOperand(0), m_APInt(Numerator)))
3645 return !Numerator->isMinSignedValue();
3646 // The numerator *might* be MinSignedValue.
3649 case Instruction::Load: {
3650 const LoadInst *LI = cast<LoadInst>(Inst);
3651 if (!LI->isUnordered() ||
3652 // Speculative load may create a race that did not exist in the source.
3653 LI->getFunction()->hasFnAttribute(Attribute::SanitizeThread) ||
3654 // Speculative load may load data from dirty regions.
3655 LI->getFunction()->hasFnAttribute(Attribute::SanitizeAddress) ||
3656 LI->getFunction()->hasFnAttribute(Attribute::SanitizeHWAddress))
3658 const DataLayout &DL = LI->getModule()->getDataLayout();
3659 return isDereferenceableAndAlignedPointer(LI->getPointerOperand(),
3660 LI->getAlignment(), DL, CtxI, DT);
3662 case Instruction::Call: {
3663 auto *CI = cast<const CallInst>(Inst);
3664 const Function *Callee = CI->getCalledFunction();
3666 // The called function could have undefined behavior or side-effects, even
3667 // if marked readnone nounwind.
3668 return Callee && Callee->isSpeculatable();
3670 case Instruction::VAArg:
3671 case Instruction::Alloca:
3672 case Instruction::Invoke:
3673 case Instruction::PHI:
3674 case Instruction::Store:
3675 case Instruction::Ret:
3676 case Instruction::Br:
3677 case Instruction::IndirectBr:
3678 case Instruction::Switch:
3679 case Instruction::Unreachable:
3680 case Instruction::Fence:
3681 case Instruction::AtomicRMW:
3682 case Instruction::AtomicCmpXchg:
3683 case Instruction::LandingPad:
3684 case Instruction::Resume:
3685 case Instruction::CatchSwitch:
3686 case Instruction::CatchPad:
3687 case Instruction::CatchRet:
3688 case Instruction::CleanupPad:
3689 case Instruction::CleanupRet:
3690 return false; // Misc instructions which have effects
3694 bool llvm::mayBeMemoryDependent(const Instruction &I) {
3695 return I.mayReadOrWriteMemory() || !isSafeToSpeculativelyExecute(&I);
3698 OverflowResult llvm::computeOverflowForUnsignedMul(const Value *LHS,
3700 const DataLayout &DL,
3701 AssumptionCache *AC,
3702 const Instruction *CxtI,
3703 const DominatorTree *DT) {
3704 // Multiplying n * m significant bits yields a result of n + m significant
3705 // bits. If the total number of significant bits does not exceed the
3706 // result bit width (minus 1), there is no overflow.
3707 // This means if we have enough leading zero bits in the operands
3708 // we can guarantee that the result does not overflow.
3709 // Ref: "Hacker's Delight" by Henry Warren
3710 unsigned BitWidth = LHS->getType()->getScalarSizeInBits();
3711 KnownBits LHSKnown(BitWidth);
3712 KnownBits RHSKnown(BitWidth);
3713 computeKnownBits(LHS, LHSKnown, DL, /*Depth=*/0, AC, CxtI, DT);
3714 computeKnownBits(RHS, RHSKnown, DL, /*Depth=*/0, AC, CxtI, DT);
3715 // Note that underestimating the number of zero bits gives a more
3716 // conservative answer.
3717 unsigned ZeroBits = LHSKnown.countMinLeadingZeros() +
3718 RHSKnown.countMinLeadingZeros();
3719 // First handle the easy case: if we have enough zero bits there's
3720 // definitely no overflow.
3721 if (ZeroBits >= BitWidth)
3722 return OverflowResult::NeverOverflows;
3724 // Get the largest possible values for each operand.
3725 APInt LHSMax = ~LHSKnown.Zero;
3726 APInt RHSMax = ~RHSKnown.Zero;
3728 // We know the multiply operation doesn't overflow if the maximum values for
3729 // each operand will not overflow after we multiply them together.
3731 (void)LHSMax.umul_ov(RHSMax, MaxOverflow);
3733 return OverflowResult::NeverOverflows;
3735 // We know it always overflows if multiplying the smallest possible values for
3736 // the operands also results in overflow.
3738 (void)LHSKnown.One.umul_ov(RHSKnown.One, MinOverflow);
3740 return OverflowResult::AlwaysOverflows;
3742 return OverflowResult::MayOverflow;
3745 OverflowResult llvm::computeOverflowForSignedMul(const Value *LHS,
3747 const DataLayout &DL,
3748 AssumptionCache *AC,
3749 const Instruction *CxtI,
3750 const DominatorTree *DT) {
3751 // Multiplying n * m significant bits yields a result of n + m significant
3752 // bits. If the total number of significant bits does not exceed the
3753 // result bit width (minus 1), there is no overflow.
3754 // This means if we have enough leading sign bits in the operands
3755 // we can guarantee that the result does not overflow.
3756 // Ref: "Hacker's Delight" by Henry Warren
3757 unsigned BitWidth = LHS->getType()->getScalarSizeInBits();
3759 // Note that underestimating the number of sign bits gives a more
3760 // conservative answer.
3761 unsigned SignBits = ComputeNumSignBits(LHS, DL, 0, AC, CxtI, DT) +
3762 ComputeNumSignBits(RHS, DL, 0, AC, CxtI, DT);
3764 // First handle the easy case: if we have enough sign bits there's
3765 // definitely no overflow.
3766 if (SignBits > BitWidth + 1)
3767 return OverflowResult::NeverOverflows;
3769 // There are two ambiguous cases where there can be no overflow:
3770 // SignBits == BitWidth + 1 and
3771 // SignBits == BitWidth
3772 // The second case is difficult to check, therefore we only handle the
3774 if (SignBits == BitWidth + 1) {
3775 // It overflows only when both arguments are negative and the true
3776 // product is exactly the minimum negative number.
3777 // E.g. mul i16 with 17 sign bits: 0xff00 * 0xff80 = 0x8000
3778 // For simplicity we just check if at least one side is not negative.
3779 KnownBits LHSKnown = computeKnownBits(LHS, DL, /*Depth=*/0, AC, CxtI, DT);
3780 KnownBits RHSKnown = computeKnownBits(RHS, DL, /*Depth=*/0, AC, CxtI, DT);
3781 if (LHSKnown.isNonNegative() || RHSKnown.isNonNegative())
3782 return OverflowResult::NeverOverflows;
3784 return OverflowResult::MayOverflow;
3787 OverflowResult llvm::computeOverflowForUnsignedAdd(const Value *LHS,
3789 const DataLayout &DL,
3790 AssumptionCache *AC,
3791 const Instruction *CxtI,
3792 const DominatorTree *DT) {
3793 KnownBits LHSKnown = computeKnownBits(LHS, DL, /*Depth=*/0, AC, CxtI, DT);
3794 if (LHSKnown.isNonNegative() || LHSKnown.isNegative()) {
3795 KnownBits RHSKnown = computeKnownBits(RHS, DL, /*Depth=*/0, AC, CxtI, DT);
3797 if (LHSKnown.isNegative() && RHSKnown.isNegative()) {
3798 // The sign bit is set in both cases: this MUST overflow.
3799 // Create a simple add instruction, and insert it into the struct.
3800 return OverflowResult::AlwaysOverflows;
3803 if (LHSKnown.isNonNegative() && RHSKnown.isNonNegative()) {
3804 // The sign bit is clear in both cases: this CANNOT overflow.
3805 // Create a simple add instruction, and insert it into the struct.
3806 return OverflowResult::NeverOverflows;
3810 return OverflowResult::MayOverflow;
3813 /// Return true if we can prove that adding the two values of the
3814 /// knownbits will not overflow.
3815 /// Otherwise return false.
3816 static bool checkRippleForSignedAdd(const KnownBits &LHSKnown,
3817 const KnownBits &RHSKnown) {
3818 // Addition of two 2's complement numbers having opposite signs will never
3820 if ((LHSKnown.isNegative() && RHSKnown.isNonNegative()) ||
3821 (LHSKnown.isNonNegative() && RHSKnown.isNegative()))
3824 // If either of the values is known to be non-negative, adding them can only
3825 // overflow if the second is also non-negative, so we can assume that.
3826 // Two non-negative numbers will only overflow if there is a carry to the
3827 // sign bit, so we can check if even when the values are as big as possible
3828 // there is no overflow to the sign bit.
3829 if (LHSKnown.isNonNegative() || RHSKnown.isNonNegative()) {
3830 APInt MaxLHS = ~LHSKnown.Zero;
3831 MaxLHS.clearSignBit();
3832 APInt MaxRHS = ~RHSKnown.Zero;
3833 MaxRHS.clearSignBit();
3834 APInt Result = std::move(MaxLHS) + std::move(MaxRHS);
3835 return Result.isSignBitClear();
3838 // If either of the values is known to be negative, adding them can only
3839 // overflow if the second is also negative, so we can assume that.
3840 // Two negative number will only overflow if there is no carry to the sign
3841 // bit, so we can check if even when the values are as small as possible
3842 // there is overflow to the sign bit.
3843 if (LHSKnown.isNegative() || RHSKnown.isNegative()) {
3844 APInt MinLHS = LHSKnown.One;
3845 MinLHS.clearSignBit();
3846 APInt MinRHS = RHSKnown.One;
3847 MinRHS.clearSignBit();
3848 APInt Result = std::move(MinLHS) + std::move(MinRHS);
3849 return Result.isSignBitSet();
3852 // If we reached here it means that we know nothing about the sign bits.
3853 // In this case we can't know if there will be an overflow, since by
3854 // changing the sign bits any two values can be made to overflow.
3858 static OverflowResult computeOverflowForSignedAdd(const Value *LHS,
3860 const AddOperator *Add,
3861 const DataLayout &DL,
3862 AssumptionCache *AC,
3863 const Instruction *CxtI,
3864 const DominatorTree *DT) {
3865 if (Add && Add->hasNoSignedWrap()) {
3866 return OverflowResult::NeverOverflows;
3869 // If LHS and RHS each have at least two sign bits, the addition will look
3875 // If the carry into the most significant position is 0, X and Y can't both
3876 // be 1 and therefore the carry out of the addition is also 0.
3878 // If the carry into the most significant position is 1, X and Y can't both
3879 // be 0 and therefore the carry out of the addition is also 1.
3881 // Since the carry into the most significant position is always equal to
3882 // the carry out of the addition, there is no signed overflow.
3883 if (ComputeNumSignBits(LHS, DL, 0, AC, CxtI, DT) > 1 &&
3884 ComputeNumSignBits(RHS, DL, 0, AC, CxtI, DT) > 1)
3885 return OverflowResult::NeverOverflows;
3887 KnownBits LHSKnown = computeKnownBits(LHS, DL, /*Depth=*/0, AC, CxtI, DT);
3888 KnownBits RHSKnown = computeKnownBits(RHS, DL, /*Depth=*/0, AC, CxtI, DT);
3890 if (checkRippleForSignedAdd(LHSKnown, RHSKnown))
3891 return OverflowResult::NeverOverflows;
3893 // The remaining code needs Add to be available. Early returns if not so.
3895 return OverflowResult::MayOverflow;
3897 // If the sign of Add is the same as at least one of the operands, this add
3898 // CANNOT overflow. This is particularly useful when the sum is
3899 // @llvm.assume'ed non-negative rather than proved so from analyzing its
3901 bool LHSOrRHSKnownNonNegative =
3902 (LHSKnown.isNonNegative() || RHSKnown.isNonNegative());
3903 bool LHSOrRHSKnownNegative =
3904 (LHSKnown.isNegative() || RHSKnown.isNegative());
3905 if (LHSOrRHSKnownNonNegative || LHSOrRHSKnownNegative) {
3906 KnownBits AddKnown = computeKnownBits(Add, DL, /*Depth=*/0, AC, CxtI, DT);
3907 if ((AddKnown.isNonNegative() && LHSOrRHSKnownNonNegative) ||
3908 (AddKnown.isNegative() && LHSOrRHSKnownNegative)) {
3909 return OverflowResult::NeverOverflows;
3913 return OverflowResult::MayOverflow;
3916 OverflowResult llvm::computeOverflowForUnsignedSub(const Value *LHS,
3918 const DataLayout &DL,
3919 AssumptionCache *AC,
3920 const Instruction *CxtI,
3921 const DominatorTree *DT) {
3922 // If the LHS is negative and the RHS is non-negative, no unsigned wrap.
3923 KnownBits LHSKnown = computeKnownBits(LHS, DL, /*Depth=*/0, AC, CxtI, DT);
3924 KnownBits RHSKnown = computeKnownBits(RHS, DL, /*Depth=*/0, AC, CxtI, DT);
3925 if (LHSKnown.isNegative() && RHSKnown.isNonNegative())
3926 return OverflowResult::NeverOverflows;
3928 return OverflowResult::MayOverflow;
3931 OverflowResult llvm::computeOverflowForSignedSub(const Value *LHS,
3933 const DataLayout &DL,
3934 AssumptionCache *AC,
3935 const Instruction *CxtI,
3936 const DominatorTree *DT) {
3937 // If LHS and RHS each have at least two sign bits, the subtraction
3939 if (ComputeNumSignBits(LHS, DL, 0, AC, CxtI, DT) > 1 &&
3940 ComputeNumSignBits(RHS, DL, 0, AC, CxtI, DT) > 1)
3941 return OverflowResult::NeverOverflows;
3943 KnownBits LHSKnown = computeKnownBits(LHS, DL, 0, AC, CxtI, DT);
3945 KnownBits RHSKnown = computeKnownBits(RHS, DL, 0, AC, CxtI, DT);
3947 // Subtraction of two 2's complement numbers having identical signs will
3949 if ((LHSKnown.isNegative() && RHSKnown.isNegative()) ||
3950 (LHSKnown.isNonNegative() && RHSKnown.isNonNegative()))
3951 return OverflowResult::NeverOverflows;
3953 // TODO: implement logic similar to checkRippleForAdd
3954 return OverflowResult::MayOverflow;
3957 bool llvm::isOverflowIntrinsicNoWrap(const IntrinsicInst *II,
3958 const DominatorTree &DT) {
3960 auto IID = II->getIntrinsicID();
3961 assert((IID == Intrinsic::sadd_with_overflow ||
3962 IID == Intrinsic::uadd_with_overflow ||
3963 IID == Intrinsic::ssub_with_overflow ||
3964 IID == Intrinsic::usub_with_overflow ||
3965 IID == Intrinsic::smul_with_overflow ||
3966 IID == Intrinsic::umul_with_overflow) &&
3967 "Not an overflow intrinsic!");
3970 SmallVector<const BranchInst *, 2> GuardingBranches;
3971 SmallVector<const ExtractValueInst *, 2> Results;
3973 for (const User *U : II->users()) {
3974 if (const auto *EVI = dyn_cast<ExtractValueInst>(U)) {
3975 assert(EVI->getNumIndices() == 1 && "Obvious from CI's type");
3977 if (EVI->getIndices()[0] == 0)
3978 Results.push_back(EVI);
3980 assert(EVI->getIndices()[0] == 1 && "Obvious from CI's type");
3982 for (const auto *U : EVI->users())
3983 if (const auto *B = dyn_cast<BranchInst>(U)) {
3984 assert(B->isConditional() && "How else is it using an i1?");
3985 GuardingBranches.push_back(B);
3989 // We are using the aggregate directly in a way we don't want to analyze
3990 // here (storing it to a global, say).
3995 auto AllUsesGuardedByBranch = [&](const BranchInst *BI) {
3996 BasicBlockEdge NoWrapEdge(BI->getParent(), BI->getSuccessor(1));
3997 if (!NoWrapEdge.isSingleEdge())
4000 // Check if all users of the add are provably no-wrap.
4001 for (const auto *Result : Results) {
4002 // If the extractvalue itself is not executed on overflow, the we don't
4003 // need to check each use separately, since domination is transitive.
4004 if (DT.dominates(NoWrapEdge, Result->getParent()))
4007 for (auto &RU : Result->uses())
4008 if (!DT.dominates(NoWrapEdge, RU))
4015 return llvm::any_of(GuardingBranches, AllUsesGuardedByBranch);
4019 OverflowResult llvm::computeOverflowForSignedAdd(const AddOperator *Add,
4020 const DataLayout &DL,
4021 AssumptionCache *AC,
4022 const Instruction *CxtI,
4023 const DominatorTree *DT) {
4024 return ::computeOverflowForSignedAdd(Add->getOperand(0), Add->getOperand(1),
4025 Add, DL, AC, CxtI, DT);
4028 OverflowResult llvm::computeOverflowForSignedAdd(const Value *LHS,
4030 const DataLayout &DL,
4031 AssumptionCache *AC,
4032 const Instruction *CxtI,
4033 const DominatorTree *DT) {
4034 return ::computeOverflowForSignedAdd(LHS, RHS, nullptr, DL, AC, CxtI, DT);
4037 bool llvm::isGuaranteedToTransferExecutionToSuccessor(const Instruction *I) {
4038 // A memory operation returns normally if it isn't volatile. A volatile
4039 // operation is allowed to trap.
4041 // An atomic operation isn't guaranteed to return in a reasonable amount of
4042 // time because it's possible for another thread to interfere with it for an
4043 // arbitrary length of time, but programs aren't allowed to rely on that.
4044 if (const LoadInst *LI = dyn_cast<LoadInst>(I))
4045 return !LI->isVolatile();
4046 if (const StoreInst *SI = dyn_cast<StoreInst>(I))
4047 return !SI->isVolatile();
4048 if (const AtomicCmpXchgInst *CXI = dyn_cast<AtomicCmpXchgInst>(I))
4049 return !CXI->isVolatile();
4050 if (const AtomicRMWInst *RMWI = dyn_cast<AtomicRMWInst>(I))
4051 return !RMWI->isVolatile();
4052 if (const MemIntrinsic *MII = dyn_cast<MemIntrinsic>(I))
4053 return !MII->isVolatile();
4055 // If there is no successor, then execution can't transfer to it.
4056 if (const auto *CRI = dyn_cast<CleanupReturnInst>(I))
4057 return !CRI->unwindsToCaller();
4058 if (const auto *CatchSwitch = dyn_cast<CatchSwitchInst>(I))
4059 return !CatchSwitch->unwindsToCaller();
4060 if (isa<ResumeInst>(I))
4062 if (isa<ReturnInst>(I))
4064 if (isa<UnreachableInst>(I))
4067 // Calls can throw, or contain an infinite loop, or kill the process.
4068 if (auto CS = ImmutableCallSite(I)) {
4069 // Call sites that throw have implicit non-local control flow.
4070 if (!CS.doesNotThrow())
4073 // Non-throwing call sites can loop infinitely, call exit/pthread_exit
4074 // etc. and thus not return. However, LLVM already assumes that
4076 // - Thread exiting actions are modeled as writes to memory invisible to
4079 // - Loops that don't have side effects (side effects are volatile/atomic
4080 // stores and IO) always terminate (see http://llvm.org/PR965).
4081 // Furthermore IO itself is also modeled as writes to memory invisible to
4084 // We rely on those assumptions here, and use the memory effects of the call
4085 // target as a proxy for checking that it always returns.
4087 // FIXME: This isn't aggressive enough; a call which only writes to a global
4088 // is guaranteed to return.
4089 return CS.onlyReadsMemory() || CS.onlyAccessesArgMemory() ||
4090 match(I, m_Intrinsic<Intrinsic::assume>()) ||
4091 match(I, m_Intrinsic<Intrinsic::sideeffect>());
4094 // Other instructions return normally.
4098 bool llvm::isGuaranteedToTransferExecutionToSuccessor(const BasicBlock *BB) {
4099 // TODO: This is slightly consdervative for invoke instruction since exiting
4100 // via an exception *is* normal control for them.
4101 for (auto I = BB->begin(), E = BB->end(); I != E; ++I)
4102 if (!isGuaranteedToTransferExecutionToSuccessor(&*I))
4107 bool llvm::isGuaranteedToExecuteForEveryIteration(const Instruction *I,
4109 // The loop header is guaranteed to be executed for every iteration.
4111 // FIXME: Relax this constraint to cover all basic blocks that are
4112 // guaranteed to be executed at every iteration.
4113 if (I->getParent() != L->getHeader()) return false;
4115 for (const Instruction &LI : *L->getHeader()) {
4116 if (&LI == I) return true;
4117 if (!isGuaranteedToTransferExecutionToSuccessor(&LI)) return false;
4119 llvm_unreachable("Instruction not contained in its own parent basic block.");
4122 bool llvm::propagatesFullPoison(const Instruction *I) {
4123 switch (I->getOpcode()) {
4124 case Instruction::Add:
4125 case Instruction::Sub:
4126 case Instruction::Xor:
4127 case Instruction::Trunc:
4128 case Instruction::BitCast:
4129 case Instruction::AddrSpaceCast:
4130 case Instruction::Mul:
4131 case Instruction::Shl:
4132 case Instruction::GetElementPtr:
4133 // These operations all propagate poison unconditionally. Note that poison
4134 // is not any particular value, so xor or subtraction of poison with
4135 // itself still yields poison, not zero.
4138 case Instruction::AShr:
4139 case Instruction::SExt:
4140 // For these operations, one bit of the input is replicated across
4141 // multiple output bits. A replicated poison bit is still poison.
4144 case Instruction::ICmp:
4145 // Comparing poison with any value yields poison. This is why, for
4146 // instance, x s< (x +nsw 1) can be folded to true.
4154 const Value *llvm::getGuaranteedNonFullPoisonOp(const Instruction *I) {
4155 switch (I->getOpcode()) {
4156 case Instruction::Store:
4157 return cast<StoreInst>(I)->getPointerOperand();
4159 case Instruction::Load:
4160 return cast<LoadInst>(I)->getPointerOperand();
4162 case Instruction::AtomicCmpXchg:
4163 return cast<AtomicCmpXchgInst>(I)->getPointerOperand();
4165 case Instruction::AtomicRMW:
4166 return cast<AtomicRMWInst>(I)->getPointerOperand();
4168 case Instruction::UDiv:
4169 case Instruction::SDiv:
4170 case Instruction::URem:
4171 case Instruction::SRem:
4172 return I->getOperand(1);
4179 bool llvm::programUndefinedIfFullPoison(const Instruction *PoisonI) {
4180 // We currently only look for uses of poison values within the same basic
4181 // block, as that makes it easier to guarantee that the uses will be
4182 // executed given that PoisonI is executed.
4184 // FIXME: Expand this to consider uses beyond the same basic block. To do
4185 // this, look out for the distinction between post-dominance and strong
4187 const BasicBlock *BB = PoisonI->getParent();
4189 // Set of instructions that we have proved will yield poison if PoisonI
4191 SmallSet<const Value *, 16> YieldsPoison;
4192 SmallSet<const BasicBlock *, 4> Visited;
4193 YieldsPoison.insert(PoisonI);
4194 Visited.insert(PoisonI->getParent());
4196 BasicBlock::const_iterator Begin = PoisonI->getIterator(), End = BB->end();
4199 while (Iter++ < MaxDepth) {
4200 for (auto &I : make_range(Begin, End)) {
4201 if (&I != PoisonI) {
4202 const Value *NotPoison = getGuaranteedNonFullPoisonOp(&I);
4203 if (NotPoison != nullptr && YieldsPoison.count(NotPoison))
4205 if (!isGuaranteedToTransferExecutionToSuccessor(&I))
4209 // Mark poison that propagates from I through uses of I.
4210 if (YieldsPoison.count(&I)) {
4211 for (const User *User : I.users()) {
4212 const Instruction *UserI = cast<Instruction>(User);
4213 if (propagatesFullPoison(UserI))
4214 YieldsPoison.insert(User);
4219 if (auto *NextBB = BB->getSingleSuccessor()) {
4220 if (Visited.insert(NextBB).second) {
4222 Begin = BB->getFirstNonPHI()->getIterator();
4233 static bool isKnownNonNaN(const Value *V, FastMathFlags FMF) {
4237 if (auto *C = dyn_cast<ConstantFP>(V))
4242 static bool isKnownNonZero(const Value *V) {
4243 if (auto *C = dyn_cast<ConstantFP>(V))
4244 return !C->isZero();
4248 /// Match clamp pattern for float types without care about NaNs or signed zeros.
4249 /// Given non-min/max outer cmp/select from the clamp pattern this
4250 /// function recognizes if it can be substitued by a "canonical" min/max
4252 static SelectPatternResult matchFastFloatClamp(CmpInst::Predicate Pred,
4253 Value *CmpLHS, Value *CmpRHS,
4254 Value *TrueVal, Value *FalseVal,
4255 Value *&LHS, Value *&RHS) {
4257 // X < C1 ? C1 : Min(X, C2) --> Max(C1, Min(X, C2))
4258 // X > C1 ? C1 : Max(X, C2) --> Min(C1, Max(X, C2))
4259 // and return description of the outer Max/Min.
4261 // First, check if select has inverse order:
4262 if (CmpRHS == FalseVal) {
4263 std::swap(TrueVal, FalseVal);
4264 Pred = CmpInst::getInversePredicate(Pred);
4267 // Assume success now. If there's no match, callers should not use these anyway.
4272 if (CmpRHS != TrueVal || !match(CmpRHS, m_APFloat(FC1)) || !FC1->isFinite())
4273 return {SPF_UNKNOWN, SPNB_NA, false};
4277 case CmpInst::FCMP_OLT:
4278 case CmpInst::FCMP_OLE:
4279 case CmpInst::FCMP_ULT:
4280 case CmpInst::FCMP_ULE:
4282 m_CombineOr(m_OrdFMin(m_Specific(CmpLHS), m_APFloat(FC2)),
4283 m_UnordFMin(m_Specific(CmpLHS), m_APFloat(FC2)))) &&
4284 FC1->compare(*FC2) == APFloat::cmpResult::cmpLessThan)
4285 return {SPF_FMAXNUM, SPNB_RETURNS_ANY, false};
4287 case CmpInst::FCMP_OGT:
4288 case CmpInst::FCMP_OGE:
4289 case CmpInst::FCMP_UGT:
4290 case CmpInst::FCMP_UGE:
4292 m_CombineOr(m_OrdFMax(m_Specific(CmpLHS), m_APFloat(FC2)),
4293 m_UnordFMax(m_Specific(CmpLHS), m_APFloat(FC2)))) &&
4294 FC1->compare(*FC2) == APFloat::cmpResult::cmpGreaterThan)
4295 return {SPF_FMINNUM, SPNB_RETURNS_ANY, false};
4301 return {SPF_UNKNOWN, SPNB_NA, false};
4304 /// Recognize variations of:
4305 /// CLAMP(v,l,h) ==> ((v) < (l) ? (l) : ((v) > (h) ? (h) : (v)))
4306 static SelectPatternResult matchClamp(CmpInst::Predicate Pred,
4307 Value *CmpLHS, Value *CmpRHS,
4308 Value *TrueVal, Value *FalseVal) {
4309 // Swap the select operands and predicate to match the patterns below.
4310 if (CmpRHS != TrueVal) {
4311 Pred = ICmpInst::getSwappedPredicate(Pred);
4312 std::swap(TrueVal, FalseVal);
4315 if (CmpRHS == TrueVal && match(CmpRHS, m_APInt(C1))) {
4317 // (X <s C1) ? C1 : SMIN(X, C2) ==> SMAX(SMIN(X, C2), C1)
4318 if (match(FalseVal, m_SMin(m_Specific(CmpLHS), m_APInt(C2))) &&
4319 C1->slt(*C2) && Pred == CmpInst::ICMP_SLT)
4320 return {SPF_SMAX, SPNB_NA, false};
4322 // (X >s C1) ? C1 : SMAX(X, C2) ==> SMIN(SMAX(X, C2), C1)
4323 if (match(FalseVal, m_SMax(m_Specific(CmpLHS), m_APInt(C2))) &&
4324 C1->sgt(*C2) && Pred == CmpInst::ICMP_SGT)
4325 return {SPF_SMIN, SPNB_NA, false};
4327 // (X <u C1) ? C1 : UMIN(X, C2) ==> UMAX(UMIN(X, C2), C1)
4328 if (match(FalseVal, m_UMin(m_Specific(CmpLHS), m_APInt(C2))) &&
4329 C1->ult(*C2) && Pred == CmpInst::ICMP_ULT)
4330 return {SPF_UMAX, SPNB_NA, false};
4332 // (X >u C1) ? C1 : UMAX(X, C2) ==> UMIN(UMAX(X, C2), C1)
4333 if (match(FalseVal, m_UMax(m_Specific(CmpLHS), m_APInt(C2))) &&
4334 C1->ugt(*C2) && Pred == CmpInst::ICMP_UGT)
4335 return {SPF_UMIN, SPNB_NA, false};
4337 return {SPF_UNKNOWN, SPNB_NA, false};
4340 /// Recognize variations of:
4341 /// a < c ? min(a,b) : min(b,c) ==> min(min(a,b),min(b,c))
4342 static SelectPatternResult matchMinMaxOfMinMax(CmpInst::Predicate Pred,
4343 Value *CmpLHS, Value *CmpRHS,
4344 Value *TVal, Value *FVal,
4346 // TODO: Allow FP min/max with nnan/nsz.
4347 assert(CmpInst::isIntPredicate(Pred) && "Expected integer comparison");
4350 SelectPatternResult L = matchSelectPattern(TVal, A, B, nullptr, Depth + 1);
4351 if (!SelectPatternResult::isMinOrMax(L.Flavor))
4352 return {SPF_UNKNOWN, SPNB_NA, false};
4355 SelectPatternResult R = matchSelectPattern(FVal, C, D, nullptr, Depth + 1);
4356 if (L.Flavor != R.Flavor)
4357 return {SPF_UNKNOWN, SPNB_NA, false};
4359 // We have something like: x Pred y ? min(a, b) : min(c, d).
4360 // Try to match the compare to the min/max operations of the select operands.
4361 // First, make sure we have the right compare predicate.
4364 if (Pred == ICmpInst::ICMP_SGT || Pred == ICmpInst::ICMP_SGE) {
4365 Pred = ICmpInst::getSwappedPredicate(Pred);
4366 std::swap(CmpLHS, CmpRHS);
4368 if (Pred == ICmpInst::ICMP_SLT || Pred == ICmpInst::ICMP_SLE)
4370 return {SPF_UNKNOWN, SPNB_NA, false};
4372 if (Pred == ICmpInst::ICMP_SLT || Pred == ICmpInst::ICMP_SLE) {
4373 Pred = ICmpInst::getSwappedPredicate(Pred);
4374 std::swap(CmpLHS, CmpRHS);
4376 if (Pred == ICmpInst::ICMP_SGT || Pred == ICmpInst::ICMP_SGE)
4378 return {SPF_UNKNOWN, SPNB_NA, false};
4380 if (Pred == ICmpInst::ICMP_UGT || Pred == ICmpInst::ICMP_UGE) {
4381 Pred = ICmpInst::getSwappedPredicate(Pred);
4382 std::swap(CmpLHS, CmpRHS);
4384 if (Pred == ICmpInst::ICMP_ULT || Pred == ICmpInst::ICMP_ULE)
4386 return {SPF_UNKNOWN, SPNB_NA, false};
4388 if (Pred == ICmpInst::ICMP_ULT || Pred == ICmpInst::ICMP_ULE) {
4389 Pred = ICmpInst::getSwappedPredicate(Pred);
4390 std::swap(CmpLHS, CmpRHS);
4392 if (Pred == ICmpInst::ICMP_UGT || Pred == ICmpInst::ICMP_UGE)
4394 return {SPF_UNKNOWN, SPNB_NA, false};
4396 return {SPF_UNKNOWN, SPNB_NA, false};
4399 // If there is a common operand in the already matched min/max and the other
4400 // min/max operands match the compare operands (either directly or inverted),
4401 // then this is min/max of the same flavor.
4403 // a pred c ? m(a, b) : m(c, b) --> m(m(a, b), m(c, b))
4404 // ~c pred ~a ? m(a, b) : m(c, b) --> m(m(a, b), m(c, b))
4406 if ((CmpLHS == A && CmpRHS == C) || (match(C, m_Not(m_Specific(CmpLHS))) &&
4407 match(A, m_Not(m_Specific(CmpRHS)))))
4408 return {L.Flavor, SPNB_NA, false};
4410 // a pred d ? m(a, b) : m(b, d) --> m(m(a, b), m(b, d))
4411 // ~d pred ~a ? m(a, b) : m(b, d) --> m(m(a, b), m(b, d))
4413 if ((CmpLHS == A && CmpRHS == D) || (match(D, m_Not(m_Specific(CmpLHS))) &&
4414 match(A, m_Not(m_Specific(CmpRHS)))))
4415 return {L.Flavor, SPNB_NA, false};
4417 // b pred c ? m(a, b) : m(c, a) --> m(m(a, b), m(c, a))
4418 // ~c pred ~b ? m(a, b) : m(c, a) --> m(m(a, b), m(c, a))
4420 if ((CmpLHS == B && CmpRHS == C) || (match(C, m_Not(m_Specific(CmpLHS))) &&
4421 match(B, m_Not(m_Specific(CmpRHS)))))
4422 return {L.Flavor, SPNB_NA, false};
4424 // b pred d ? m(a, b) : m(a, d) --> m(m(a, b), m(a, d))
4425 // ~d pred ~b ? m(a, b) : m(a, d) --> m(m(a, b), m(a, d))
4427 if ((CmpLHS == B && CmpRHS == D) || (match(D, m_Not(m_Specific(CmpLHS))) &&
4428 match(B, m_Not(m_Specific(CmpRHS)))))
4429 return {L.Flavor, SPNB_NA, false};
4432 return {SPF_UNKNOWN, SPNB_NA, false};
4435 /// Match non-obvious integer minimum and maximum sequences.
4436 static SelectPatternResult matchMinMax(CmpInst::Predicate Pred,
4437 Value *CmpLHS, Value *CmpRHS,
4438 Value *TrueVal, Value *FalseVal,
4439 Value *&LHS, Value *&RHS,
4441 // Assume success. If there's no match, callers should not use these anyway.
4445 SelectPatternResult SPR = matchClamp(Pred, CmpLHS, CmpRHS, TrueVal, FalseVal);
4446 if (SPR.Flavor != SelectPatternFlavor::SPF_UNKNOWN)
4449 SPR = matchMinMaxOfMinMax(Pred, CmpLHS, CmpRHS, TrueVal, FalseVal, Depth);
4450 if (SPR.Flavor != SelectPatternFlavor::SPF_UNKNOWN)
4453 if (Pred != CmpInst::ICMP_SGT && Pred != CmpInst::ICMP_SLT)
4454 return {SPF_UNKNOWN, SPNB_NA, false};
4457 // (X >s Y) ? 0 : Z ==> (Z >s 0) ? 0 : Z ==> SMIN(Z, 0)
4458 // (X <s Y) ? 0 : Z ==> (Z <s 0) ? 0 : Z ==> SMAX(Z, 0)
4459 if (match(TrueVal, m_Zero()) &&
4460 match(FalseVal, m_NSWSub(m_Specific(CmpLHS), m_Specific(CmpRHS))))
4461 return {Pred == CmpInst::ICMP_SGT ? SPF_SMIN : SPF_SMAX, SPNB_NA, false};
4464 // (X >s Y) ? Z : 0 ==> (Z >s 0) ? Z : 0 ==> SMAX(Z, 0)
4465 // (X <s Y) ? Z : 0 ==> (Z <s 0) ? Z : 0 ==> SMIN(Z, 0)
4466 if (match(FalseVal, m_Zero()) &&
4467 match(TrueVal, m_NSWSub(m_Specific(CmpLHS), m_Specific(CmpRHS))))
4468 return {Pred == CmpInst::ICMP_SGT ? SPF_SMAX : SPF_SMIN, SPNB_NA, false};
4471 if (!match(CmpRHS, m_APInt(C1)))
4472 return {SPF_UNKNOWN, SPNB_NA, false};
4474 // An unsigned min/max can be written with a signed compare.
4476 if ((CmpLHS == TrueVal && match(FalseVal, m_APInt(C2))) ||
4477 (CmpLHS == FalseVal && match(TrueVal, m_APInt(C2)))) {
4478 // Is the sign bit set?
4479 // (X <s 0) ? X : MAXVAL ==> (X >u MAXVAL) ? X : MAXVAL ==> UMAX
4480 // (X <s 0) ? MAXVAL : X ==> (X >u MAXVAL) ? MAXVAL : X ==> UMIN
4481 if (Pred == CmpInst::ICMP_SLT && C1->isNullValue() &&
4482 C2->isMaxSignedValue())
4483 return {CmpLHS == TrueVal ? SPF_UMAX : SPF_UMIN, SPNB_NA, false};
4485 // Is the sign bit clear?
4486 // (X >s -1) ? MINVAL : X ==> (X <u MINVAL) ? MINVAL : X ==> UMAX
4487 // (X >s -1) ? X : MINVAL ==> (X <u MINVAL) ? X : MINVAL ==> UMIN
4488 if (Pred == CmpInst::ICMP_SGT && C1->isAllOnesValue() &&
4489 C2->isMinSignedValue())
4490 return {CmpLHS == FalseVal ? SPF_UMAX : SPF_UMIN, SPNB_NA, false};
4493 // Look through 'not' ops to find disguised signed min/max.
4494 // (X >s C) ? ~X : ~C ==> (~X <s ~C) ? ~X : ~C ==> SMIN(~X, ~C)
4495 // (X <s C) ? ~X : ~C ==> (~X >s ~C) ? ~X : ~C ==> SMAX(~X, ~C)
4496 if (match(TrueVal, m_Not(m_Specific(CmpLHS))) &&
4497 match(FalseVal, m_APInt(C2)) && ~(*C1) == *C2)
4498 return {Pred == CmpInst::ICMP_SGT ? SPF_SMIN : SPF_SMAX, SPNB_NA, false};
4500 // (X >s C) ? ~C : ~X ==> (~X <s ~C) ? ~C : ~X ==> SMAX(~C, ~X)
4501 // (X <s C) ? ~C : ~X ==> (~X >s ~C) ? ~C : ~X ==> SMIN(~C, ~X)
4502 if (match(FalseVal, m_Not(m_Specific(CmpLHS))) &&
4503 match(TrueVal, m_APInt(C2)) && ~(*C1) == *C2)
4504 return {Pred == CmpInst::ICMP_SGT ? SPF_SMAX : SPF_SMIN, SPNB_NA, false};
4506 return {SPF_UNKNOWN, SPNB_NA, false};
4509 static SelectPatternResult matchSelectPattern(CmpInst::Predicate Pred,
4511 Value *CmpLHS, Value *CmpRHS,
4512 Value *TrueVal, Value *FalseVal,
4513 Value *&LHS, Value *&RHS,
4518 // Signed zero may return inconsistent results between implementations.
4519 // (0.0 <= -0.0) ? 0.0 : -0.0 // Returns 0.0
4520 // minNum(0.0, -0.0) // May return -0.0 or 0.0 (IEEE 754-2008 5.3.1)
4521 // Therefore, we behave conservatively and only proceed if at least one of the
4522 // operands is known to not be zero or if we don't care about signed zero.
4525 // FIXME: Include OGT/OLT/UGT/ULT.
4526 case CmpInst::FCMP_OGE: case CmpInst::FCMP_OLE:
4527 case CmpInst::FCMP_UGE: case CmpInst::FCMP_ULE:
4528 if (!FMF.noSignedZeros() && !isKnownNonZero(CmpLHS) &&
4529 !isKnownNonZero(CmpRHS))
4530 return {SPF_UNKNOWN, SPNB_NA, false};
4533 SelectPatternNaNBehavior NaNBehavior = SPNB_NA;
4534 bool Ordered = false;
4536 // When given one NaN and one non-NaN input:
4537 // - maxnum/minnum (C99 fmaxf()/fminf()) return the non-NaN input.
4538 // - A simple C99 (a < b ? a : b) construction will return 'b' (as the
4539 // ordered comparison fails), which could be NaN or non-NaN.
4540 // so here we discover exactly what NaN behavior is required/accepted.
4541 if (CmpInst::isFPPredicate(Pred)) {
4542 bool LHSSafe = isKnownNonNaN(CmpLHS, FMF);
4543 bool RHSSafe = isKnownNonNaN(CmpRHS, FMF);
4545 if (LHSSafe && RHSSafe) {
4546 // Both operands are known non-NaN.
4547 NaNBehavior = SPNB_RETURNS_ANY;
4548 } else if (CmpInst::isOrdered(Pred)) {
4549 // An ordered comparison will return false when given a NaN, so it
4553 // LHS is non-NaN, so if RHS is NaN then NaN will be returned.
4554 NaNBehavior = SPNB_RETURNS_NAN;
4556 NaNBehavior = SPNB_RETURNS_OTHER;
4558 // Completely unsafe.
4559 return {SPF_UNKNOWN, SPNB_NA, false};
4562 // An unordered comparison will return true when given a NaN, so it
4565 // LHS is non-NaN, so if RHS is NaN then non-NaN will be returned.
4566 NaNBehavior = SPNB_RETURNS_OTHER;
4568 NaNBehavior = SPNB_RETURNS_NAN;
4570 // Completely unsafe.
4571 return {SPF_UNKNOWN, SPNB_NA, false};
4575 if (TrueVal == CmpRHS && FalseVal == CmpLHS) {
4576 std::swap(CmpLHS, CmpRHS);
4577 Pred = CmpInst::getSwappedPredicate(Pred);
4578 if (NaNBehavior == SPNB_RETURNS_NAN)
4579 NaNBehavior = SPNB_RETURNS_OTHER;
4580 else if (NaNBehavior == SPNB_RETURNS_OTHER)
4581 NaNBehavior = SPNB_RETURNS_NAN;
4585 // ([if]cmp X, Y) ? X : Y
4586 if (TrueVal == CmpLHS && FalseVal == CmpRHS) {
4588 default: return {SPF_UNKNOWN, SPNB_NA, false}; // Equality.
4589 case ICmpInst::ICMP_UGT:
4590 case ICmpInst::ICMP_UGE: return {SPF_UMAX, SPNB_NA, false};
4591 case ICmpInst::ICMP_SGT:
4592 case ICmpInst::ICMP_SGE: return {SPF_SMAX, SPNB_NA, false};
4593 case ICmpInst::ICMP_ULT:
4594 case ICmpInst::ICMP_ULE: return {SPF_UMIN, SPNB_NA, false};
4595 case ICmpInst::ICMP_SLT:
4596 case ICmpInst::ICMP_SLE: return {SPF_SMIN, SPNB_NA, false};
4597 case FCmpInst::FCMP_UGT:
4598 case FCmpInst::FCMP_UGE:
4599 case FCmpInst::FCMP_OGT:
4600 case FCmpInst::FCMP_OGE: return {SPF_FMAXNUM, NaNBehavior, Ordered};
4601 case FCmpInst::FCMP_ULT:
4602 case FCmpInst::FCMP_ULE:
4603 case FCmpInst::FCMP_OLT:
4604 case FCmpInst::FCMP_OLE: return {SPF_FMINNUM, NaNBehavior, Ordered};
4608 // Sign-extending LHS does not change its sign, so TrueVal/FalseVal can
4609 // match against either LHS or sext(LHS).
4610 auto MaybeSExtLHS = m_CombineOr(m_Specific(CmpLHS),
4611 m_SExt(m_Specific(CmpLHS)));
4612 if ((match(TrueVal, MaybeSExtLHS) &&
4613 match(FalseVal, m_Neg(m_Specific(TrueVal)))) ||
4614 (match(FalseVal, MaybeSExtLHS) &&
4615 match(TrueVal, m_Neg(m_Specific(FalseVal))))) {
4616 // Set LHS and RHS so that RHS is the negated operand of the select
4617 if (match(TrueVal, MaybeSExtLHS)) {
4625 // (X >s 0) ? X : -X or (X >s -1) ? X : -X --> ABS(X)
4626 // (X >s 0) ? -X : X or (X >s -1) ? -X : X --> NABS(X)
4627 if (Pred == ICmpInst::ICMP_SGT &&
4628 match(CmpRHS, m_CombineOr(m_ZeroInt(), m_AllOnes())))
4629 return {(LHS == TrueVal) ? SPF_ABS : SPF_NABS, SPNB_NA, false};
4631 // (X <s 0) ? -X : X or (X <s 1) ? -X : X --> ABS(X)
4632 // (X <s 0) ? X : -X or (X <s 1) ? X : -X --> NABS(X)
4633 if (Pred == ICmpInst::ICMP_SLT &&
4634 match(CmpRHS, m_CombineOr(m_ZeroInt(), m_One())))
4635 return {(LHS == FalseVal) ? SPF_ABS : SPF_NABS, SPNB_NA, false};
4638 if (CmpInst::isIntPredicate(Pred))
4639 return matchMinMax(Pred, CmpLHS, CmpRHS, TrueVal, FalseVal, LHS, RHS, Depth);
4641 // According to (IEEE 754-2008 5.3.1), minNum(0.0, -0.0) and similar
4642 // may return either -0.0 or 0.0, so fcmp/select pair has stricter
4643 // semantics than minNum. Be conservative in such case.
4644 if (NaNBehavior != SPNB_RETURNS_ANY ||
4645 (!FMF.noSignedZeros() && !isKnownNonZero(CmpLHS) &&
4646 !isKnownNonZero(CmpRHS)))
4647 return {SPF_UNKNOWN, SPNB_NA, false};
4649 return matchFastFloatClamp(Pred, CmpLHS, CmpRHS, TrueVal, FalseVal, LHS, RHS);
4652 /// Helps to match a select pattern in case of a type mismatch.
4654 /// The function processes the case when type of true and false values of a
4655 /// select instruction differs from type of the cmp instruction operands because
4656 /// of a cast instruction. The function checks if it is legal to move the cast
4657 /// operation after "select". If yes, it returns the new second value of
4658 /// "select" (with the assumption that cast is moved):
4659 /// 1. As operand of cast instruction when both values of "select" are same cast
4661 /// 2. As restored constant (by applying reverse cast operation) when the first
4662 /// value of the "select" is a cast operation and the second value is a
4664 /// NOTE: We return only the new second value because the first value could be
4665 /// accessed as operand of cast instruction.
4666 static Value *lookThroughCast(CmpInst *CmpI, Value *V1, Value *V2,
4667 Instruction::CastOps *CastOp) {
4668 auto *Cast1 = dyn_cast<CastInst>(V1);
4672 *CastOp = Cast1->getOpcode();
4673 Type *SrcTy = Cast1->getSrcTy();
4674 if (auto *Cast2 = dyn_cast<CastInst>(V2)) {
4675 // If V1 and V2 are both the same cast from the same type, look through V1.
4676 if (*CastOp == Cast2->getOpcode() && SrcTy == Cast2->getSrcTy())
4677 return Cast2->getOperand(0);
4681 auto *C = dyn_cast<Constant>(V2);
4685 Constant *CastedTo = nullptr;
4687 case Instruction::ZExt:
4688 if (CmpI->isUnsigned())
4689 CastedTo = ConstantExpr::getTrunc(C, SrcTy);
4691 case Instruction::SExt:
4692 if (CmpI->isSigned())
4693 CastedTo = ConstantExpr::getTrunc(C, SrcTy, true);
4695 case Instruction::Trunc:
4697 if (match(CmpI->getOperand(1), m_Constant(CmpConst)) &&
4698 CmpConst->getType() == SrcTy) {
4699 // Here we have the following case:
4701 // %cond = cmp iN %x, CmpConst
4702 // %tr = trunc iN %x to iK
4703 // %narrowsel = select i1 %cond, iK %t, iK C
4705 // We can always move trunc after select operation:
4707 // %cond = cmp iN %x, CmpConst
4708 // %widesel = select i1 %cond, iN %x, iN CmpConst
4709 // %tr = trunc iN %widesel to iK
4711 // Note that C could be extended in any way because we don't care about
4712 // upper bits after truncation. It can't be abs pattern, because it would
4715 // select i1 %cond, x, -x.
4717 // So only min/max pattern could be matched. Such match requires widened C
4718 // == CmpConst. That is why set widened C = CmpConst, condition trunc
4719 // CmpConst == C is checked below.
4720 CastedTo = CmpConst;
4722 CastedTo = ConstantExpr::getIntegerCast(C, SrcTy, CmpI->isSigned());
4725 case Instruction::FPTrunc:
4726 CastedTo = ConstantExpr::getFPExtend(C, SrcTy, true);
4728 case Instruction::FPExt:
4729 CastedTo = ConstantExpr::getFPTrunc(C, SrcTy, true);
4731 case Instruction::FPToUI:
4732 CastedTo = ConstantExpr::getUIToFP(C, SrcTy, true);
4734 case Instruction::FPToSI:
4735 CastedTo = ConstantExpr::getSIToFP(C, SrcTy, true);
4737 case Instruction::UIToFP:
4738 CastedTo = ConstantExpr::getFPToUI(C, SrcTy, true);
4740 case Instruction::SIToFP:
4741 CastedTo = ConstantExpr::getFPToSI(C, SrcTy, true);
4750 // Make sure the cast doesn't lose any information.
4751 Constant *CastedBack =
4752 ConstantExpr::getCast(*CastOp, CastedTo, C->getType(), true);
4753 if (CastedBack != C)
4759 SelectPatternResult llvm::matchSelectPattern(Value *V, Value *&LHS, Value *&RHS,
4760 Instruction::CastOps *CastOp,
4762 if (Depth >= MaxDepth)
4763 return {SPF_UNKNOWN, SPNB_NA, false};
4765 SelectInst *SI = dyn_cast<SelectInst>(V);
4766 if (!SI) return {SPF_UNKNOWN, SPNB_NA, false};
4768 CmpInst *CmpI = dyn_cast<CmpInst>(SI->getCondition());
4769 if (!CmpI) return {SPF_UNKNOWN, SPNB_NA, false};
4771 CmpInst::Predicate Pred = CmpI->getPredicate();
4772 Value *CmpLHS = CmpI->getOperand(0);
4773 Value *CmpRHS = CmpI->getOperand(1);
4774 Value *TrueVal = SI->getTrueValue();
4775 Value *FalseVal = SI->getFalseValue();
4777 if (isa<FPMathOperator>(CmpI))
4778 FMF = CmpI->getFastMathFlags();
4781 if (CmpI->isEquality())
4782 return {SPF_UNKNOWN, SPNB_NA, false};
4784 // Deal with type mismatches.
4785 if (CastOp && CmpLHS->getType() != TrueVal->getType()) {
4786 if (Value *C = lookThroughCast(CmpI, TrueVal, FalseVal, CastOp)) {
4787 // If this is a potential fmin/fmax with a cast to integer, then ignore
4788 // -0.0 because there is no corresponding integer value.
4789 if (*CastOp == Instruction::FPToSI || *CastOp == Instruction::FPToUI)
4790 FMF.setNoSignedZeros();
4791 return ::matchSelectPattern(Pred, FMF, CmpLHS, CmpRHS,
4792 cast<CastInst>(TrueVal)->getOperand(0), C,
4795 if (Value *C = lookThroughCast(CmpI, FalseVal, TrueVal, CastOp)) {
4796 // If this is a potential fmin/fmax with a cast to integer, then ignore
4797 // -0.0 because there is no corresponding integer value.
4798 if (*CastOp == Instruction::FPToSI || *CastOp == Instruction::FPToUI)
4799 FMF.setNoSignedZeros();
4800 return ::matchSelectPattern(Pred, FMF, CmpLHS, CmpRHS,
4801 C, cast<CastInst>(FalseVal)->getOperand(0),
4805 return ::matchSelectPattern(Pred, FMF, CmpLHS, CmpRHS, TrueVal, FalseVal,
4809 CmpInst::Predicate llvm::getMinMaxPred(SelectPatternFlavor SPF, bool Ordered) {
4810 if (SPF == SPF_SMIN) return ICmpInst::ICMP_SLT;
4811 if (SPF == SPF_UMIN) return ICmpInst::ICMP_ULT;
4812 if (SPF == SPF_SMAX) return ICmpInst::ICMP_SGT;
4813 if (SPF == SPF_UMAX) return ICmpInst::ICMP_UGT;
4814 if (SPF == SPF_FMINNUM)
4815 return Ordered ? FCmpInst::FCMP_OLT : FCmpInst::FCMP_ULT;
4816 if (SPF == SPF_FMAXNUM)
4817 return Ordered ? FCmpInst::FCMP_OGT : FCmpInst::FCMP_UGT;
4818 llvm_unreachable("unhandled!");
4821 SelectPatternFlavor llvm::getInverseMinMaxFlavor(SelectPatternFlavor SPF) {
4822 if (SPF == SPF_SMIN) return SPF_SMAX;
4823 if (SPF == SPF_UMIN) return SPF_UMAX;
4824 if (SPF == SPF_SMAX) return SPF_SMIN;
4825 if (SPF == SPF_UMAX) return SPF_UMIN;
4826 llvm_unreachable("unhandled!");
4829 CmpInst::Predicate llvm::getInverseMinMaxPred(SelectPatternFlavor SPF) {
4830 return getMinMaxPred(getInverseMinMaxFlavor(SPF));
4833 /// Return true if "icmp Pred LHS RHS" is always true.
4834 static bool isTruePredicate(CmpInst::Predicate Pred, const Value *LHS,
4835 const Value *RHS, const DataLayout &DL,
4837 assert(!LHS->getType()->isVectorTy() && "TODO: extend to handle vectors!");
4838 if (ICmpInst::isTrueWhenEqual(Pred) && LHS == RHS)
4845 case CmpInst::ICMP_SLE: {
4848 // LHS s<= LHS +_{nsw} C if C >= 0
4849 if (match(RHS, m_NSWAdd(m_Specific(LHS), m_APInt(C))))
4850 return !C->isNegative();
4854 case CmpInst::ICMP_ULE: {
4857 // LHS u<= LHS +_{nuw} C for any C
4858 if (match(RHS, m_NUWAdd(m_Specific(LHS), m_APInt(C))))
4861 // Match A to (X +_{nuw} CA) and B to (X +_{nuw} CB)
4862 auto MatchNUWAddsToSameValue = [&](const Value *A, const Value *B,
4864 const APInt *&CA, const APInt *&CB) {
4865 if (match(A, m_NUWAdd(m_Value(X), m_APInt(CA))) &&
4866 match(B, m_NUWAdd(m_Specific(X), m_APInt(CB))))
4869 // If X & C == 0 then (X | C) == X +_{nuw} C
4870 if (match(A, m_Or(m_Value(X), m_APInt(CA))) &&
4871 match(B, m_Or(m_Specific(X), m_APInt(CB)))) {
4872 KnownBits Known(CA->getBitWidth());
4873 computeKnownBits(X, Known, DL, Depth + 1, /*AC*/ nullptr,
4874 /*CxtI*/ nullptr, /*DT*/ nullptr);
4875 if (CA->isSubsetOf(Known.Zero) && CB->isSubsetOf(Known.Zero))
4883 const APInt *CLHS, *CRHS;
4884 if (MatchNUWAddsToSameValue(LHS, RHS, X, CLHS, CRHS))
4885 return CLHS->ule(*CRHS);
4892 /// Return true if "icmp Pred BLHS BRHS" is true whenever "icmp Pred
4893 /// ALHS ARHS" is true. Otherwise, return None.
4894 static Optional<bool>
4895 isImpliedCondOperands(CmpInst::Predicate Pred, const Value *ALHS,
4896 const Value *ARHS, const Value *BLHS, const Value *BRHS,
4897 const DataLayout &DL, unsigned Depth) {
4902 case CmpInst::ICMP_SLT:
4903 case CmpInst::ICMP_SLE:
4904 if (isTruePredicate(CmpInst::ICMP_SLE, BLHS, ALHS, DL, Depth) &&
4905 isTruePredicate(CmpInst::ICMP_SLE, ARHS, BRHS, DL, Depth))
4909 case CmpInst::ICMP_ULT:
4910 case CmpInst::ICMP_ULE:
4911 if (isTruePredicate(CmpInst::ICMP_ULE, BLHS, ALHS, DL, Depth) &&
4912 isTruePredicate(CmpInst::ICMP_ULE, ARHS, BRHS, DL, Depth))
4918 /// Return true if the operands of the two compares match. IsSwappedOps is true
4919 /// when the operands match, but are swapped.
4920 static bool isMatchingOps(const Value *ALHS, const Value *ARHS,
4921 const Value *BLHS, const Value *BRHS,
4922 bool &IsSwappedOps) {
4924 bool IsMatchingOps = (ALHS == BLHS && ARHS == BRHS);
4925 IsSwappedOps = (ALHS == BRHS && ARHS == BLHS);
4926 return IsMatchingOps || IsSwappedOps;
4929 /// Return true if "icmp1 APred ALHS ARHS" implies "icmp2 BPred BLHS BRHS" is
4930 /// true. Return false if "icmp1 APred ALHS ARHS" implies "icmp2 BPred BLHS
4931 /// BRHS" is false. Otherwise, return None if we can't infer anything.
4932 static Optional<bool> isImpliedCondMatchingOperands(CmpInst::Predicate APred,
4935 CmpInst::Predicate BPred,
4938 bool IsSwappedOps) {
4939 // Canonicalize the operands so they're matching.
4941 std::swap(BLHS, BRHS);
4942 BPred = ICmpInst::getSwappedPredicate(BPred);
4944 if (CmpInst::isImpliedTrueByMatchingCmp(APred, BPred))
4946 if (CmpInst::isImpliedFalseByMatchingCmp(APred, BPred))
4952 /// Return true if "icmp1 APred ALHS C1" implies "icmp2 BPred BLHS C2" is
4953 /// true. Return false if "icmp1 APred ALHS C1" implies "icmp2 BPred BLHS
4954 /// C2" is false. Otherwise, return None if we can't infer anything.
4955 static Optional<bool>
4956 isImpliedCondMatchingImmOperands(CmpInst::Predicate APred, const Value *ALHS,
4957 const ConstantInt *C1,
4958 CmpInst::Predicate BPred,
4959 const Value *BLHS, const ConstantInt *C2) {
4960 assert(ALHS == BLHS && "LHS operands must match.");
4961 ConstantRange DomCR =
4962 ConstantRange::makeExactICmpRegion(APred, C1->getValue());
4964 ConstantRange::makeAllowedICmpRegion(BPred, C2->getValue());
4965 ConstantRange Intersection = DomCR.intersectWith(CR);
4966 ConstantRange Difference = DomCR.difference(CR);
4967 if (Intersection.isEmptySet())
4969 if (Difference.isEmptySet())
4974 /// Return true if LHS implies RHS is true. Return false if LHS implies RHS is
4975 /// false. Otherwise, return None if we can't infer anything.
4976 static Optional<bool> isImpliedCondICmps(const ICmpInst *LHS,
4977 const ICmpInst *RHS,
4978 const DataLayout &DL, bool LHSIsTrue,
4980 Value *ALHS = LHS->getOperand(0);
4981 Value *ARHS = LHS->getOperand(1);
4982 // The rest of the logic assumes the LHS condition is true. If that's not the
4983 // case, invert the predicate to make it so.
4984 ICmpInst::Predicate APred =
4985 LHSIsTrue ? LHS->getPredicate() : LHS->getInversePredicate();
4987 Value *BLHS = RHS->getOperand(0);
4988 Value *BRHS = RHS->getOperand(1);
4989 ICmpInst::Predicate BPred = RHS->getPredicate();
4991 // Can we infer anything when the two compares have matching operands?
4993 if (isMatchingOps(ALHS, ARHS, BLHS, BRHS, IsSwappedOps)) {
4994 if (Optional<bool> Implication = isImpliedCondMatchingOperands(
4995 APred, ALHS, ARHS, BPred, BLHS, BRHS, IsSwappedOps))
4997 // No amount of additional analysis will infer the second condition, so
5002 // Can we infer anything when the LHS operands match and the RHS operands are
5003 // constants (not necessarily matching)?
5004 if (ALHS == BLHS && isa<ConstantInt>(ARHS) && isa<ConstantInt>(BRHS)) {
5005 if (Optional<bool> Implication = isImpliedCondMatchingImmOperands(
5006 APred, ALHS, cast<ConstantInt>(ARHS), BPred, BLHS,
5007 cast<ConstantInt>(BRHS)))
5009 // No amount of additional analysis will infer the second condition, so
5015 return isImpliedCondOperands(APred, ALHS, ARHS, BLHS, BRHS, DL, Depth);
5019 /// Return true if LHS implies RHS is true. Return false if LHS implies RHS is
5020 /// false. Otherwise, return None if we can't infer anything. We expect the
5021 /// RHS to be an icmp and the LHS to be an 'and' or an 'or' instruction.
5022 static Optional<bool> isImpliedCondAndOr(const BinaryOperator *LHS,
5023 const ICmpInst *RHS,
5024 const DataLayout &DL, bool LHSIsTrue,
5026 // The LHS must be an 'or' or an 'and' instruction.
5027 assert((LHS->getOpcode() == Instruction::And ||
5028 LHS->getOpcode() == Instruction::Or) &&
5029 "Expected LHS to be 'and' or 'or'.");
5031 assert(Depth <= MaxDepth && "Hit recursion limit");
5033 // If the result of an 'or' is false, then we know both legs of the 'or' are
5034 // false. Similarly, if the result of an 'and' is true, then we know both
5035 // legs of the 'and' are true.
5037 if ((!LHSIsTrue && match(LHS, m_Or(m_Value(ALHS), m_Value(ARHS)))) ||
5038 (LHSIsTrue && match(LHS, m_And(m_Value(ALHS), m_Value(ARHS))))) {
5039 // FIXME: Make this non-recursion.
5040 if (Optional<bool> Implication =
5041 isImpliedCondition(ALHS, RHS, DL, LHSIsTrue, Depth + 1))
5043 if (Optional<bool> Implication =
5044 isImpliedCondition(ARHS, RHS, DL, LHSIsTrue, Depth + 1))
5051 Optional<bool> llvm::isImpliedCondition(const Value *LHS, const Value *RHS,
5052 const DataLayout &DL, bool LHSIsTrue,
5054 // Bail out when we hit the limit.
5055 if (Depth == MaxDepth)
5058 // A mismatch occurs when we compare a scalar cmp to a vector cmp, for
5060 if (LHS->getType() != RHS->getType())
5063 Type *OpTy = LHS->getType();
5064 assert(OpTy->isIntOrIntVectorTy(1) && "Expected integer type only!");
5066 // LHS ==> RHS by definition
5070 // FIXME: Extending the code below to handle vectors.
5071 if (OpTy->isVectorTy())
5074 assert(OpTy->isIntegerTy(1) && "implied by above");
5076 // Both LHS and RHS are icmps.
5077 const ICmpInst *LHSCmp = dyn_cast<ICmpInst>(LHS);
5078 const ICmpInst *RHSCmp = dyn_cast<ICmpInst>(RHS);
5079 if (LHSCmp && RHSCmp)
5080 return isImpliedCondICmps(LHSCmp, RHSCmp, DL, LHSIsTrue, Depth);
5082 // The LHS should be an 'or' or an 'and' instruction. We expect the RHS to be
5083 // an icmp. FIXME: Add support for and/or on the RHS.
5084 const BinaryOperator *LHSBO = dyn_cast<BinaryOperator>(LHS);
5085 if (LHSBO && RHSCmp) {
5086 if ((LHSBO->getOpcode() == Instruction::And ||
5087 LHSBO->getOpcode() == Instruction::Or))
5088 return isImpliedCondAndOr(LHSBO, RHSCmp, DL, LHSIsTrue, Depth);