1 //===- InstCombineCompares.cpp --------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the visitICmp and visitFCmp functions.
12 //===----------------------------------------------------------------------===//
14 #include "InstCombine.h"
15 #include "llvm/IntrinsicInst.h"
16 #include "llvm/Analysis/ConstantFolding.h"
17 #include "llvm/Analysis/InstructionSimplify.h"
18 #include "llvm/Analysis/MemoryBuiltins.h"
19 #include "llvm/DataLayout.h"
20 #include "llvm/Target/TargetLibraryInfo.h"
21 #include "llvm/Support/ConstantRange.h"
22 #include "llvm/Support/GetElementPtrTypeIterator.h"
23 #include "llvm/Support/PatternMatch.h"
25 using namespace PatternMatch;
27 static ConstantInt *getOne(Constant *C) {
28 return ConstantInt::get(cast<IntegerType>(C->getType()), 1);
31 /// AddOne - Add one to a ConstantInt
32 static Constant *AddOne(Constant *C) {
33 return ConstantExpr::getAdd(C, ConstantInt::get(C->getType(), 1));
35 /// SubOne - Subtract one from a ConstantInt
36 static Constant *SubOne(Constant *C) {
37 return ConstantExpr::getSub(C, ConstantInt::get(C->getType(), 1));
40 static ConstantInt *ExtractElement(Constant *V, Constant *Idx) {
41 return cast<ConstantInt>(ConstantExpr::getExtractElement(V, Idx));
44 static bool HasAddOverflow(ConstantInt *Result,
45 ConstantInt *In1, ConstantInt *In2,
48 return Result->getValue().ult(In1->getValue());
50 if (In2->isNegative())
51 return Result->getValue().sgt(In1->getValue());
52 return Result->getValue().slt(In1->getValue());
55 /// AddWithOverflow - Compute Result = In1+In2, returning true if the result
56 /// overflowed for this type.
57 static bool AddWithOverflow(Constant *&Result, Constant *In1,
58 Constant *In2, bool IsSigned = false) {
59 Result = ConstantExpr::getAdd(In1, In2);
61 if (VectorType *VTy = dyn_cast<VectorType>(In1->getType())) {
62 for (unsigned i = 0, e = VTy->getNumElements(); i != e; ++i) {
63 Constant *Idx = ConstantInt::get(Type::getInt32Ty(In1->getContext()), i);
64 if (HasAddOverflow(ExtractElement(Result, Idx),
65 ExtractElement(In1, Idx),
66 ExtractElement(In2, Idx),
73 return HasAddOverflow(cast<ConstantInt>(Result),
74 cast<ConstantInt>(In1), cast<ConstantInt>(In2),
78 static bool HasSubOverflow(ConstantInt *Result,
79 ConstantInt *In1, ConstantInt *In2,
82 return Result->getValue().ugt(In1->getValue());
84 if (In2->isNegative())
85 return Result->getValue().slt(In1->getValue());
87 return Result->getValue().sgt(In1->getValue());
90 /// SubWithOverflow - Compute Result = In1-In2, returning true if the result
91 /// overflowed for this type.
92 static bool SubWithOverflow(Constant *&Result, Constant *In1,
93 Constant *In2, bool IsSigned = false) {
94 Result = ConstantExpr::getSub(In1, In2);
96 if (VectorType *VTy = dyn_cast<VectorType>(In1->getType())) {
97 for (unsigned i = 0, e = VTy->getNumElements(); i != e; ++i) {
98 Constant *Idx = ConstantInt::get(Type::getInt32Ty(In1->getContext()), i);
99 if (HasSubOverflow(ExtractElement(Result, Idx),
100 ExtractElement(In1, Idx),
101 ExtractElement(In2, Idx),
108 return HasSubOverflow(cast<ConstantInt>(Result),
109 cast<ConstantInt>(In1), cast<ConstantInt>(In2),
113 /// isSignBitCheck - Given an exploded icmp instruction, return true if the
114 /// comparison only checks the sign bit. If it only checks the sign bit, set
115 /// TrueIfSigned if the result of the comparison is true when the input value is
117 static bool isSignBitCheck(ICmpInst::Predicate pred, ConstantInt *RHS,
118 bool &TrueIfSigned) {
120 case ICmpInst::ICMP_SLT: // True if LHS s< 0
122 return RHS->isZero();
123 case ICmpInst::ICMP_SLE: // True if LHS s<= RHS and RHS == -1
125 return RHS->isAllOnesValue();
126 case ICmpInst::ICMP_SGT: // True if LHS s> -1
127 TrueIfSigned = false;
128 return RHS->isAllOnesValue();
129 case ICmpInst::ICMP_UGT:
130 // True if LHS u> RHS and RHS == high-bit-mask - 1
132 return RHS->isMaxValue(true);
133 case ICmpInst::ICMP_UGE:
134 // True if LHS u>= RHS and RHS == high-bit-mask (2^7, 2^15, 2^31, etc)
136 return RHS->getValue().isSignBit();
142 // isHighOnes - Return true if the constant is of the form 1+0+.
143 // This is the same as lowones(~X).
144 static bool isHighOnes(const ConstantInt *CI) {
145 return (~CI->getValue() + 1).isPowerOf2();
148 /// ComputeSignedMinMaxValuesFromKnownBits - Given a signed integer type and a
149 /// set of known zero and one bits, compute the maximum and minimum values that
150 /// could have the specified known zero and known one bits, returning them in
152 static void ComputeSignedMinMaxValuesFromKnownBits(const APInt& KnownZero,
153 const APInt& KnownOne,
154 APInt& Min, APInt& Max) {
155 assert(KnownZero.getBitWidth() == KnownOne.getBitWidth() &&
156 KnownZero.getBitWidth() == Min.getBitWidth() &&
157 KnownZero.getBitWidth() == Max.getBitWidth() &&
158 "KnownZero, KnownOne and Min, Max must have equal bitwidth.");
159 APInt UnknownBits = ~(KnownZero|KnownOne);
161 // The minimum value is when all unknown bits are zeros, EXCEPT for the sign
162 // bit if it is unknown.
164 Max = KnownOne|UnknownBits;
166 if (UnknownBits.isNegative()) { // Sign bit is unknown
167 Min.setBit(Min.getBitWidth()-1);
168 Max.clearBit(Max.getBitWidth()-1);
172 // ComputeUnsignedMinMaxValuesFromKnownBits - Given an unsigned integer type and
173 // a set of known zero and one bits, compute the maximum and minimum values that
174 // could have the specified known zero and known one bits, returning them in
176 static void ComputeUnsignedMinMaxValuesFromKnownBits(const APInt &KnownZero,
177 const APInt &KnownOne,
178 APInt &Min, APInt &Max) {
179 assert(KnownZero.getBitWidth() == KnownOne.getBitWidth() &&
180 KnownZero.getBitWidth() == Min.getBitWidth() &&
181 KnownZero.getBitWidth() == Max.getBitWidth() &&
182 "Ty, KnownZero, KnownOne and Min, Max must have equal bitwidth.");
183 APInt UnknownBits = ~(KnownZero|KnownOne);
185 // The minimum value is when the unknown bits are all zeros.
187 // The maximum value is when the unknown bits are all ones.
188 Max = KnownOne|UnknownBits;
193 /// FoldCmpLoadFromIndexedGlobal - Called we see this pattern:
194 /// cmp pred (load (gep GV, ...)), cmpcst
195 /// where GV is a global variable with a constant initializer. Try to simplify
196 /// this into some simple computation that does not need the load. For example
197 /// we can optimize "icmp eq (load (gep "foo", 0, i)), 0" into "icmp eq i, 3".
199 /// If AndCst is non-null, then the loaded value is masked with that constant
200 /// before doing the comparison. This handles cases like "A[i]&4 == 0".
201 Instruction *InstCombiner::
202 FoldCmpLoadFromIndexedGlobal(GetElementPtrInst *GEP, GlobalVariable *GV,
203 CmpInst &ICI, ConstantInt *AndCst) {
204 // We need TD information to know the pointer size unless this is inbounds.
205 if (!GEP->isInBounds() && TD == 0) return 0;
207 Constant *Init = GV->getInitializer();
208 if (!isa<ConstantArray>(Init) && !isa<ConstantDataArray>(Init))
211 uint64_t ArrayElementCount = Init->getType()->getArrayNumElements();
212 if (ArrayElementCount > 1024) return 0; // Don't blow up on huge arrays.
214 // There are many forms of this optimization we can handle, for now, just do
215 // the simple index into a single-dimensional array.
217 // Require: GEP GV, 0, i {{, constant indices}}
218 if (GEP->getNumOperands() < 3 ||
219 !isa<ConstantInt>(GEP->getOperand(1)) ||
220 !cast<ConstantInt>(GEP->getOperand(1))->isZero() ||
221 isa<Constant>(GEP->getOperand(2)))
224 // Check that indices after the variable are constants and in-range for the
225 // type they index. Collect the indices. This is typically for arrays of
227 SmallVector<unsigned, 4> LaterIndices;
229 Type *EltTy = Init->getType()->getArrayElementType();
230 for (unsigned i = 3, e = GEP->getNumOperands(); i != e; ++i) {
231 ConstantInt *Idx = dyn_cast<ConstantInt>(GEP->getOperand(i));
232 if (Idx == 0) return 0; // Variable index.
234 uint64_t IdxVal = Idx->getZExtValue();
235 if ((unsigned)IdxVal != IdxVal) return 0; // Too large array index.
237 if (StructType *STy = dyn_cast<StructType>(EltTy))
238 EltTy = STy->getElementType(IdxVal);
239 else if (ArrayType *ATy = dyn_cast<ArrayType>(EltTy)) {
240 if (IdxVal >= ATy->getNumElements()) return 0;
241 EltTy = ATy->getElementType();
243 return 0; // Unknown type.
246 LaterIndices.push_back(IdxVal);
249 enum { Overdefined = -3, Undefined = -2 };
251 // Variables for our state machines.
253 // FirstTrueElement/SecondTrueElement - Used to emit a comparison of the form
254 // "i == 47 | i == 87", where 47 is the first index the condition is true for,
255 // and 87 is the second (and last) index. FirstTrueElement is -2 when
256 // undefined, otherwise set to the first true element. SecondTrueElement is
257 // -2 when undefined, -3 when overdefined and >= 0 when that index is true.
258 int FirstTrueElement = Undefined, SecondTrueElement = Undefined;
260 // FirstFalseElement/SecondFalseElement - Used to emit a comparison of the
261 // form "i != 47 & i != 87". Same state transitions as for true elements.
262 int FirstFalseElement = Undefined, SecondFalseElement = Undefined;
264 /// TrueRangeEnd/FalseRangeEnd - In conjunction with First*Element, these
265 /// define a state machine that triggers for ranges of values that the index
266 /// is true or false for. This triggers on things like "abbbbc"[i] == 'b'.
267 /// This is -2 when undefined, -3 when overdefined, and otherwise the last
268 /// index in the range (inclusive). We use -2 for undefined here because we
269 /// use relative comparisons and don't want 0-1 to match -1.
270 int TrueRangeEnd = Undefined, FalseRangeEnd = Undefined;
272 // MagicBitvector - This is a magic bitvector where we set a bit if the
273 // comparison is true for element 'i'. If there are 64 elements or less in
274 // the array, this will fully represent all the comparison results.
275 uint64_t MagicBitvector = 0;
278 // Scan the array and see if one of our patterns matches.
279 Constant *CompareRHS = cast<Constant>(ICI.getOperand(1));
280 for (unsigned i = 0, e = ArrayElementCount; i != e; ++i) {
281 Constant *Elt = Init->getAggregateElement(i);
282 if (Elt == 0) return 0;
284 // If this is indexing an array of structures, get the structure element.
285 if (!LaterIndices.empty())
286 Elt = ConstantExpr::getExtractValue(Elt, LaterIndices);
288 // If the element is masked, handle it.
289 if (AndCst) Elt = ConstantExpr::getAnd(Elt, AndCst);
291 // Find out if the comparison would be true or false for the i'th element.
292 Constant *C = ConstantFoldCompareInstOperands(ICI.getPredicate(), Elt,
293 CompareRHS, TD, TLI);
294 // If the result is undef for this element, ignore it.
295 if (isa<UndefValue>(C)) {
296 // Extend range state machines to cover this element in case there is an
297 // undef in the middle of the range.
298 if (TrueRangeEnd == (int)i-1)
300 if (FalseRangeEnd == (int)i-1)
305 // If we can't compute the result for any of the elements, we have to give
306 // up evaluating the entire conditional.
307 if (!isa<ConstantInt>(C)) return 0;
309 // Otherwise, we know if the comparison is true or false for this element,
310 // update our state machines.
311 bool IsTrueForElt = !cast<ConstantInt>(C)->isZero();
313 // State machine for single/double/range index comparison.
315 // Update the TrueElement state machine.
316 if (FirstTrueElement == Undefined)
317 FirstTrueElement = TrueRangeEnd = i; // First true element.
319 // Update double-compare state machine.
320 if (SecondTrueElement == Undefined)
321 SecondTrueElement = i;
323 SecondTrueElement = Overdefined;
325 // Update range state machine.
326 if (TrueRangeEnd == (int)i-1)
329 TrueRangeEnd = Overdefined;
332 // Update the FalseElement state machine.
333 if (FirstFalseElement == Undefined)
334 FirstFalseElement = FalseRangeEnd = i; // First false element.
336 // Update double-compare state machine.
337 if (SecondFalseElement == Undefined)
338 SecondFalseElement = i;
340 SecondFalseElement = Overdefined;
342 // Update range state machine.
343 if (FalseRangeEnd == (int)i-1)
346 FalseRangeEnd = Overdefined;
351 // If this element is in range, update our magic bitvector.
352 if (i < 64 && IsTrueForElt)
353 MagicBitvector |= 1ULL << i;
355 // If all of our states become overdefined, bail out early. Since the
356 // predicate is expensive, only check it every 8 elements. This is only
357 // really useful for really huge arrays.
358 if ((i & 8) == 0 && i >= 64 && SecondTrueElement == Overdefined &&
359 SecondFalseElement == Overdefined && TrueRangeEnd == Overdefined &&
360 FalseRangeEnd == Overdefined)
364 // Now that we've scanned the entire array, emit our new comparison(s). We
365 // order the state machines in complexity of the generated code.
366 Value *Idx = GEP->getOperand(2);
368 unsigned AS = GEP->getPointerAddressSpace();
369 // If the index is larger than the pointer size of the target, truncate the
370 // index down like the GEP would do implicitly. We don't have to do this for
371 // an inbounds GEP because the index can't be out of range.
372 if (!GEP->isInBounds() &&
373 Idx->getType()->getPrimitiveSizeInBits() > TD->getPointerSizeInBits(AS))
374 Idx = Builder->CreateTrunc(Idx, TD->getIntPtrType(Idx->getContext()));
376 // If the comparison is only true for one or two elements, emit direct
378 if (SecondTrueElement != Overdefined) {
379 // None true -> false.
380 if (FirstTrueElement == Undefined)
381 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse(GEP->getContext()));
383 Value *FirstTrueIdx = ConstantInt::get(Idx->getType(), FirstTrueElement);
385 // True for one element -> 'i == 47'.
386 if (SecondTrueElement == Undefined)
387 return new ICmpInst(ICmpInst::ICMP_EQ, Idx, FirstTrueIdx);
389 // True for two elements -> 'i == 47 | i == 72'.
390 Value *C1 = Builder->CreateICmpEQ(Idx, FirstTrueIdx);
391 Value *SecondTrueIdx = ConstantInt::get(Idx->getType(), SecondTrueElement);
392 Value *C2 = Builder->CreateICmpEQ(Idx, SecondTrueIdx);
393 return BinaryOperator::CreateOr(C1, C2);
396 // If the comparison is only false for one or two elements, emit direct
398 if (SecondFalseElement != Overdefined) {
399 // None false -> true.
400 if (FirstFalseElement == Undefined)
401 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue(GEP->getContext()));
403 Value *FirstFalseIdx = ConstantInt::get(Idx->getType(), FirstFalseElement);
405 // False for one element -> 'i != 47'.
406 if (SecondFalseElement == Undefined)
407 return new ICmpInst(ICmpInst::ICMP_NE, Idx, FirstFalseIdx);
409 // False for two elements -> 'i != 47 & i != 72'.
410 Value *C1 = Builder->CreateICmpNE(Idx, FirstFalseIdx);
411 Value *SecondFalseIdx = ConstantInt::get(Idx->getType(),SecondFalseElement);
412 Value *C2 = Builder->CreateICmpNE(Idx, SecondFalseIdx);
413 return BinaryOperator::CreateAnd(C1, C2);
416 // If the comparison can be replaced with a range comparison for the elements
417 // where it is true, emit the range check.
418 if (TrueRangeEnd != Overdefined) {
419 assert(TrueRangeEnd != FirstTrueElement && "Should emit single compare");
421 // Generate (i-FirstTrue) <u (TrueRangeEnd-FirstTrue+1).
422 if (FirstTrueElement) {
423 Value *Offs = ConstantInt::get(Idx->getType(), -FirstTrueElement);
424 Idx = Builder->CreateAdd(Idx, Offs);
427 Value *End = ConstantInt::get(Idx->getType(),
428 TrueRangeEnd-FirstTrueElement+1);
429 return new ICmpInst(ICmpInst::ICMP_ULT, Idx, End);
432 // False range check.
433 if (FalseRangeEnd != Overdefined) {
434 assert(FalseRangeEnd != FirstFalseElement && "Should emit single compare");
435 // Generate (i-FirstFalse) >u (FalseRangeEnd-FirstFalse).
436 if (FirstFalseElement) {
437 Value *Offs = ConstantInt::get(Idx->getType(), -FirstFalseElement);
438 Idx = Builder->CreateAdd(Idx, Offs);
441 Value *End = ConstantInt::get(Idx->getType(),
442 FalseRangeEnd-FirstFalseElement);
443 return new ICmpInst(ICmpInst::ICMP_UGT, Idx, End);
447 // If a 32-bit or 64-bit magic bitvector captures the entire comparison state
448 // of this load, replace it with computation that does:
449 // ((magic_cst >> i) & 1) != 0
450 if (ArrayElementCount <= 32 ||
451 (TD && ArrayElementCount <= 64 && TD->isLegalInteger(64))) {
453 if (ArrayElementCount <= 32)
454 Ty = Type::getInt32Ty(Init->getContext());
456 Ty = Type::getInt64Ty(Init->getContext());
457 Value *V = Builder->CreateIntCast(Idx, Ty, false);
458 V = Builder->CreateLShr(ConstantInt::get(Ty, MagicBitvector), V);
459 V = Builder->CreateAnd(ConstantInt::get(Ty, 1), V);
460 return new ICmpInst(ICmpInst::ICMP_NE, V, ConstantInt::get(Ty, 0));
467 /// EvaluateGEPOffsetExpression - Return a value that can be used to compare
468 /// the *offset* implied by a GEP to zero. For example, if we have &A[i], we
469 /// want to return 'i' for "icmp ne i, 0". Note that, in general, indices can
470 /// be complex, and scales are involved. The above expression would also be
471 /// legal to codegen as "icmp ne (i*4), 0" (assuming A is a pointer to i32).
472 /// This later form is less amenable to optimization though, and we are allowed
473 /// to generate the first by knowing that pointer arithmetic doesn't overflow.
475 /// If we can't emit an optimized form for this expression, this returns null.
477 static Value *EvaluateGEPOffsetExpression(User *GEP, InstCombiner &IC) {
478 DataLayout &TD = *IC.getDataLayout();
479 gep_type_iterator GTI = gep_type_begin(GEP);
481 // Check to see if this gep only has a single variable index. If so, and if
482 // any constant indices are a multiple of its scale, then we can compute this
483 // in terms of the scale of the variable index. For example, if the GEP
484 // implies an offset of "12 + i*4", then we can codegen this as "3 + i",
485 // because the expression will cross zero at the same point.
486 unsigned i, e = GEP->getNumOperands();
488 for (i = 1; i != e; ++i, ++GTI) {
489 if (ConstantInt *CI = dyn_cast<ConstantInt>(GEP->getOperand(i))) {
490 // Compute the aggregate offset of constant indices.
491 if (CI->isZero()) continue;
493 // Handle a struct index, which adds its field offset to the pointer.
494 if (StructType *STy = dyn_cast<StructType>(*GTI)) {
495 Offset += TD.getStructLayout(STy)->getElementOffset(CI->getZExtValue());
497 uint64_t Size = TD.getTypeAllocSize(GTI.getIndexedType());
498 Offset += Size*CI->getSExtValue();
501 // Found our variable index.
506 // If there are no variable indices, we must have a constant offset, just
507 // evaluate it the general way.
508 if (i == e) return 0;
510 Value *VariableIdx = GEP->getOperand(i);
511 // Determine the scale factor of the variable element. For example, this is
512 // 4 if the variable index is into an array of i32.
513 uint64_t VariableScale = TD.getTypeAllocSize(GTI.getIndexedType());
515 // Verify that there are no other variable indices. If so, emit the hard way.
516 for (++i, ++GTI; i != e; ++i, ++GTI) {
517 ConstantInt *CI = dyn_cast<ConstantInt>(GEP->getOperand(i));
520 // Compute the aggregate offset of constant indices.
521 if (CI->isZero()) continue;
523 // Handle a struct index, which adds its field offset to the pointer.
524 if (StructType *STy = dyn_cast<StructType>(*GTI)) {
525 Offset += TD.getStructLayout(STy)->getElementOffset(CI->getZExtValue());
527 uint64_t Size = TD.getTypeAllocSize(GTI.getIndexedType());
528 Offset += Size*CI->getSExtValue();
532 unsigned AS = cast<GetElementPtrInst>(GEP)->getPointerAddressSpace();
533 // Okay, we know we have a single variable index, which must be a
534 // pointer/array/vector index. If there is no offset, life is simple, return
536 unsigned IntPtrWidth = TD.getPointerSizeInBits(AS);
538 // Cast to intptrty in case a truncation occurs. If an extension is needed,
539 // we don't need to bother extending: the extension won't affect where the
540 // computation crosses zero.
541 if (VariableIdx->getType()->getPrimitiveSizeInBits() > IntPtrWidth) {
542 Type *IntPtrTy = TD.getIntPtrType(VariableIdx->getContext());
543 VariableIdx = IC.Builder->CreateTrunc(VariableIdx, IntPtrTy);
548 // Otherwise, there is an index. The computation we will do will be modulo
549 // the pointer size, so get it.
550 uint64_t PtrSizeMask = ~0ULL >> (64-IntPtrWidth);
552 Offset &= PtrSizeMask;
553 VariableScale &= PtrSizeMask;
555 // To do this transformation, any constant index must be a multiple of the
556 // variable scale factor. For example, we can evaluate "12 + 4*i" as "3 + i",
557 // but we can't evaluate "10 + 3*i" in terms of i. Check that the offset is a
558 // multiple of the variable scale.
559 int64_t NewOffs = Offset / (int64_t)VariableScale;
560 if (Offset != NewOffs*(int64_t)VariableScale)
563 // Okay, we can do this evaluation. Start by converting the index to intptr.
564 Type *IntPtrTy = TD.getIntPtrType(VariableIdx->getContext());
565 if (VariableIdx->getType() != IntPtrTy)
566 VariableIdx = IC.Builder->CreateIntCast(VariableIdx, IntPtrTy,
568 Constant *OffsetVal = ConstantInt::get(IntPtrTy, NewOffs);
569 return IC.Builder->CreateAdd(VariableIdx, OffsetVal, "offset");
572 /// FoldGEPICmp - Fold comparisons between a GEP instruction and something
573 /// else. At this point we know that the GEP is on the LHS of the comparison.
574 Instruction *InstCombiner::FoldGEPICmp(GEPOperator *GEPLHS, Value *RHS,
575 ICmpInst::Predicate Cond,
577 // Don't transform signed compares of GEPs into index compares. Even if the
578 // GEP is inbounds, the final add of the base pointer can have signed overflow
579 // and would change the result of the icmp.
580 // e.g. "&foo[0] <s &foo[1]" can't be folded to "true" because "foo" could be
581 // the maximum signed value for the pointer type.
582 if (ICmpInst::isSigned(Cond))
585 // Look through bitcasts.
586 if (BitCastInst *BCI = dyn_cast<BitCastInst>(RHS))
587 RHS = BCI->getOperand(0);
589 Value *PtrBase = GEPLHS->getOperand(0);
590 if (TD && PtrBase == RHS && GEPLHS->isInBounds()) {
591 // ((gep Ptr, OFFSET) cmp Ptr) ---> (OFFSET cmp 0).
592 // This transformation (ignoring the base and scales) is valid because we
593 // know pointers can't overflow since the gep is inbounds. See if we can
594 // output an optimized form.
595 Value *Offset = EvaluateGEPOffsetExpression(GEPLHS, *this);
597 // If not, synthesize the offset the hard way.
599 Offset = EmitGEPOffset(GEPLHS);
600 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), Offset,
601 Constant::getNullValue(Offset->getType()));
602 } else if (GEPOperator *GEPRHS = dyn_cast<GEPOperator>(RHS)) {
603 // If the base pointers are different, but the indices are the same, just
604 // compare the base pointer.
605 if (PtrBase != GEPRHS->getOperand(0)) {
606 bool IndicesTheSame = GEPLHS->getNumOperands()==GEPRHS->getNumOperands();
607 IndicesTheSame &= GEPLHS->getOperand(0)->getType() ==
608 GEPRHS->getOperand(0)->getType();
610 for (unsigned i = 1, e = GEPLHS->getNumOperands(); i != e; ++i)
611 if (GEPLHS->getOperand(i) != GEPRHS->getOperand(i)) {
612 IndicesTheSame = false;
616 // If all indices are the same, just compare the base pointers.
618 return new ICmpInst(ICmpInst::getSignedPredicate(Cond),
619 GEPLHS->getOperand(0), GEPRHS->getOperand(0));
621 // If we're comparing GEPs with two base pointers that only differ in type
622 // and both GEPs have only constant indices or just one use, then fold
623 // the compare with the adjusted indices.
624 if (TD && GEPLHS->isInBounds() && GEPRHS->isInBounds() &&
625 (GEPLHS->hasAllConstantIndices() || GEPLHS->hasOneUse()) &&
626 (GEPRHS->hasAllConstantIndices() || GEPRHS->hasOneUse()) &&
627 PtrBase->stripPointerCasts() ==
628 GEPRHS->getOperand(0)->stripPointerCasts()) {
629 Value *Cmp = Builder->CreateICmp(ICmpInst::getSignedPredicate(Cond),
630 EmitGEPOffset(GEPLHS),
631 EmitGEPOffset(GEPRHS));
632 return ReplaceInstUsesWith(I, Cmp);
635 // Otherwise, the base pointers are different and the indices are
636 // different, bail out.
640 // If one of the GEPs has all zero indices, recurse.
641 bool AllZeros = true;
642 for (unsigned i = 1, e = GEPLHS->getNumOperands(); i != e; ++i)
643 if (!isa<Constant>(GEPLHS->getOperand(i)) ||
644 !cast<Constant>(GEPLHS->getOperand(i))->isNullValue()) {
649 return FoldGEPICmp(GEPRHS, GEPLHS->getOperand(0),
650 ICmpInst::getSwappedPredicate(Cond), I);
652 // If the other GEP has all zero indices, recurse.
654 for (unsigned i = 1, e = GEPRHS->getNumOperands(); i != e; ++i)
655 if (!isa<Constant>(GEPRHS->getOperand(i)) ||
656 !cast<Constant>(GEPRHS->getOperand(i))->isNullValue()) {
661 return FoldGEPICmp(GEPLHS, GEPRHS->getOperand(0), Cond, I);
663 bool GEPsInBounds = GEPLHS->isInBounds() && GEPRHS->isInBounds();
664 if (GEPLHS->getNumOperands() == GEPRHS->getNumOperands()) {
665 // If the GEPs only differ by one index, compare it.
666 unsigned NumDifferences = 0; // Keep track of # differences.
667 unsigned DiffOperand = 0; // The operand that differs.
668 for (unsigned i = 1, e = GEPRHS->getNumOperands(); i != e; ++i)
669 if (GEPLHS->getOperand(i) != GEPRHS->getOperand(i)) {
670 if (GEPLHS->getOperand(i)->getType()->getPrimitiveSizeInBits() !=
671 GEPRHS->getOperand(i)->getType()->getPrimitiveSizeInBits()) {
672 // Irreconcilable differences.
676 if (NumDifferences++) break;
681 if (NumDifferences == 0) // SAME GEP?
682 return ReplaceInstUsesWith(I, // No comparison is needed here.
683 ConstantInt::get(Type::getInt1Ty(I.getContext()),
684 ICmpInst::isTrueWhenEqual(Cond)));
686 else if (NumDifferences == 1 && GEPsInBounds) {
687 Value *LHSV = GEPLHS->getOperand(DiffOperand);
688 Value *RHSV = GEPRHS->getOperand(DiffOperand);
689 // Make sure we do a signed comparison here.
690 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), LHSV, RHSV);
694 // Only lower this if the icmp is the only user of the GEP or if we expect
695 // the result to fold to a constant!
698 (isa<ConstantExpr>(GEPLHS) || GEPLHS->hasOneUse()) &&
699 (isa<ConstantExpr>(GEPRHS) || GEPRHS->hasOneUse())) {
700 // ((gep Ptr, OFFSET1) cmp (gep Ptr, OFFSET2) ---> (OFFSET1 cmp OFFSET2)
701 Value *L = EmitGEPOffset(GEPLHS);
702 Value *R = EmitGEPOffset(GEPRHS);
703 return new ICmpInst(ICmpInst::getSignedPredicate(Cond), L, R);
709 /// FoldICmpAddOpCst - Fold "icmp pred (X+CI), X".
710 Instruction *InstCombiner::FoldICmpAddOpCst(ICmpInst &ICI,
711 Value *X, ConstantInt *CI,
712 ICmpInst::Predicate Pred,
714 // If we have X+0, exit early (simplifying logic below) and let it get folded
715 // elsewhere. icmp X+0, X -> icmp X, X
717 bool isTrue = ICmpInst::isTrueWhenEqual(Pred);
718 return ReplaceInstUsesWith(ICI, ConstantInt::get(ICI.getType(), isTrue));
721 // (X+4) == X -> false.
722 if (Pred == ICmpInst::ICMP_EQ)
723 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse(X->getContext()));
725 // (X+4) != X -> true.
726 if (Pred == ICmpInst::ICMP_NE)
727 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue(X->getContext()));
729 // From this point on, we know that (X+C <= X) --> (X+C < X) because C != 0,
730 // so the values can never be equal. Similarly for all other "or equals"
733 // (X+1) <u X --> X >u (MAXUINT-1) --> X == 255
734 // (X+2) <u X --> X >u (MAXUINT-2) --> X > 253
735 // (X+MAXUINT) <u X --> X >u (MAXUINT-MAXUINT) --> X != 0
736 if (Pred == ICmpInst::ICMP_ULT || Pred == ICmpInst::ICMP_ULE) {
738 ConstantExpr::getSub(ConstantInt::getAllOnesValue(CI->getType()), CI);
739 return new ICmpInst(ICmpInst::ICMP_UGT, X, R);
742 // (X+1) >u X --> X <u (0-1) --> X != 255
743 // (X+2) >u X --> X <u (0-2) --> X <u 254
744 // (X+MAXUINT) >u X --> X <u (0-MAXUINT) --> X <u 1 --> X == 0
745 if (Pred == ICmpInst::ICMP_UGT || Pred == ICmpInst::ICMP_UGE)
746 return new ICmpInst(ICmpInst::ICMP_ULT, X, ConstantExpr::getNeg(CI));
748 unsigned BitWidth = CI->getType()->getPrimitiveSizeInBits();
749 ConstantInt *SMax = ConstantInt::get(X->getContext(),
750 APInt::getSignedMaxValue(BitWidth));
752 // (X+ 1) <s X --> X >s (MAXSINT-1) --> X == 127
753 // (X+ 2) <s X --> X >s (MAXSINT-2) --> X >s 125
754 // (X+MAXSINT) <s X --> X >s (MAXSINT-MAXSINT) --> X >s 0
755 // (X+MINSINT) <s X --> X >s (MAXSINT-MINSINT) --> X >s -1
756 // (X+ -2) <s X --> X >s (MAXSINT- -2) --> X >s 126
757 // (X+ -1) <s X --> X >s (MAXSINT- -1) --> X != 127
758 if (Pred == ICmpInst::ICMP_SLT || Pred == ICmpInst::ICMP_SLE)
759 return new ICmpInst(ICmpInst::ICMP_SGT, X, ConstantExpr::getSub(SMax, CI));
761 // (X+ 1) >s X --> X <s (MAXSINT-(1-1)) --> X != 127
762 // (X+ 2) >s X --> X <s (MAXSINT-(2-1)) --> X <s 126
763 // (X+MAXSINT) >s X --> X <s (MAXSINT-(MAXSINT-1)) --> X <s 1
764 // (X+MINSINT) >s X --> X <s (MAXSINT-(MINSINT-1)) --> X <s -2
765 // (X+ -2) >s X --> X <s (MAXSINT-(-2-1)) --> X <s -126
766 // (X+ -1) >s X --> X <s (MAXSINT-(-1-1)) --> X == -128
768 assert(Pred == ICmpInst::ICMP_SGT || Pred == ICmpInst::ICMP_SGE);
769 Constant *C = ConstantInt::get(X->getContext(), CI->getValue()-1);
770 return new ICmpInst(ICmpInst::ICMP_SLT, X, ConstantExpr::getSub(SMax, C));
773 /// FoldICmpDivCst - Fold "icmp pred, ([su]div X, DivRHS), CmpRHS" where DivRHS
774 /// and CmpRHS are both known to be integer constants.
775 Instruction *InstCombiner::FoldICmpDivCst(ICmpInst &ICI, BinaryOperator *DivI,
776 ConstantInt *DivRHS) {
777 ConstantInt *CmpRHS = cast<ConstantInt>(ICI.getOperand(1));
778 const APInt &CmpRHSV = CmpRHS->getValue();
780 // FIXME: If the operand types don't match the type of the divide
781 // then don't attempt this transform. The code below doesn't have the
782 // logic to deal with a signed divide and an unsigned compare (and
783 // vice versa). This is because (x /s C1) <s C2 produces different
784 // results than (x /s C1) <u C2 or (x /u C1) <s C2 or even
785 // (x /u C1) <u C2. Simply casting the operands and result won't
786 // work. :( The if statement below tests that condition and bails
788 bool DivIsSigned = DivI->getOpcode() == Instruction::SDiv;
789 if (!ICI.isEquality() && DivIsSigned != ICI.isSigned())
791 if (DivRHS->isZero())
792 return 0; // The ProdOV computation fails on divide by zero.
793 if (DivIsSigned && DivRHS->isAllOnesValue())
794 return 0; // The overflow computation also screws up here
795 if (DivRHS->isOne()) {
796 // This eliminates some funny cases with INT_MIN.
797 ICI.setOperand(0, DivI->getOperand(0)); // X/1 == X.
801 // Compute Prod = CI * DivRHS. We are essentially solving an equation
802 // of form X/C1=C2. We solve for X by multiplying C1 (DivRHS) and
803 // C2 (CI). By solving for X we can turn this into a range check
804 // instead of computing a divide.
805 Constant *Prod = ConstantExpr::getMul(CmpRHS, DivRHS);
807 // Determine if the product overflows by seeing if the product is
808 // not equal to the divide. Make sure we do the same kind of divide
809 // as in the LHS instruction that we're folding.
810 bool ProdOV = (DivIsSigned ? ConstantExpr::getSDiv(Prod, DivRHS) :
811 ConstantExpr::getUDiv(Prod, DivRHS)) != CmpRHS;
813 // Get the ICmp opcode
814 ICmpInst::Predicate Pred = ICI.getPredicate();
816 /// If the division is known to be exact, then there is no remainder from the
817 /// divide, so the covered range size is unit, otherwise it is the divisor.
818 ConstantInt *RangeSize = DivI->isExact() ? getOne(Prod) : DivRHS;
820 // Figure out the interval that is being checked. For example, a comparison
821 // like "X /u 5 == 0" is really checking that X is in the interval [0, 5).
822 // Compute this interval based on the constants involved and the signedness of
823 // the compare/divide. This computes a half-open interval, keeping track of
824 // whether either value in the interval overflows. After analysis each
825 // overflow variable is set to 0 if it's corresponding bound variable is valid
826 // -1 if overflowed off the bottom end, or +1 if overflowed off the top end.
827 int LoOverflow = 0, HiOverflow = 0;
828 Constant *LoBound = 0, *HiBound = 0;
830 if (!DivIsSigned) { // udiv
831 // e.g. X/5 op 3 --> [15, 20)
833 HiOverflow = LoOverflow = ProdOV;
835 // If this is not an exact divide, then many values in the range collapse
836 // to the same result value.
837 HiOverflow = AddWithOverflow(HiBound, LoBound, RangeSize, false);
840 } else if (DivRHS->getValue().isStrictlyPositive()) { // Divisor is > 0.
841 if (CmpRHSV == 0) { // (X / pos) op 0
842 // Can't overflow. e.g. X/2 op 0 --> [-1, 2)
843 LoBound = ConstantExpr::getNeg(SubOne(RangeSize));
845 } else if (CmpRHSV.isStrictlyPositive()) { // (X / pos) op pos
846 LoBound = Prod; // e.g. X/5 op 3 --> [15, 20)
847 HiOverflow = LoOverflow = ProdOV;
849 HiOverflow = AddWithOverflow(HiBound, Prod, RangeSize, true);
850 } else { // (X / pos) op neg
851 // e.g. X/5 op -3 --> [-15-4, -15+1) --> [-19, -14)
852 HiBound = AddOne(Prod);
853 LoOverflow = HiOverflow = ProdOV ? -1 : 0;
855 ConstantInt *DivNeg =cast<ConstantInt>(ConstantExpr::getNeg(RangeSize));
856 LoOverflow = AddWithOverflow(LoBound, HiBound, DivNeg, true) ? -1 : 0;
859 } else if (DivRHS->isNegative()) { // Divisor is < 0.
861 RangeSize = cast<ConstantInt>(ConstantExpr::getNeg(RangeSize));
862 if (CmpRHSV == 0) { // (X / neg) op 0
863 // e.g. X/-5 op 0 --> [-4, 5)
864 LoBound = AddOne(RangeSize);
865 HiBound = cast<ConstantInt>(ConstantExpr::getNeg(RangeSize));
866 if (HiBound == DivRHS) { // -INTMIN = INTMIN
867 HiOverflow = 1; // [INTMIN+1, overflow)
868 HiBound = 0; // e.g. X/INTMIN = 0 --> X > INTMIN
870 } else if (CmpRHSV.isStrictlyPositive()) { // (X / neg) op pos
871 // e.g. X/-5 op 3 --> [-19, -14)
872 HiBound = AddOne(Prod);
873 HiOverflow = LoOverflow = ProdOV ? -1 : 0;
875 LoOverflow = AddWithOverflow(LoBound, HiBound, RangeSize, true) ? -1:0;
876 } else { // (X / neg) op neg
877 LoBound = Prod; // e.g. X/-5 op -3 --> [15, 20)
878 LoOverflow = HiOverflow = ProdOV;
880 HiOverflow = SubWithOverflow(HiBound, Prod, RangeSize, true);
883 // Dividing by a negative swaps the condition. LT <-> GT
884 Pred = ICmpInst::getSwappedPredicate(Pred);
887 Value *X = DivI->getOperand(0);
889 default: llvm_unreachable("Unhandled icmp opcode!");
890 case ICmpInst::ICMP_EQ:
891 if (LoOverflow && HiOverflow)
892 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse(ICI.getContext()));
894 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SGE :
895 ICmpInst::ICMP_UGE, X, LoBound);
897 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SLT :
898 ICmpInst::ICMP_ULT, X, HiBound);
899 return ReplaceInstUsesWith(ICI, InsertRangeTest(X, LoBound, HiBound,
901 case ICmpInst::ICMP_NE:
902 if (LoOverflow && HiOverflow)
903 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue(ICI.getContext()));
905 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SLT :
906 ICmpInst::ICMP_ULT, X, LoBound);
908 return new ICmpInst(DivIsSigned ? ICmpInst::ICMP_SGE :
909 ICmpInst::ICMP_UGE, X, HiBound);
910 return ReplaceInstUsesWith(ICI, InsertRangeTest(X, LoBound, HiBound,
911 DivIsSigned, false));
912 case ICmpInst::ICMP_ULT:
913 case ICmpInst::ICMP_SLT:
914 if (LoOverflow == +1) // Low bound is greater than input range.
915 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue(ICI.getContext()));
916 if (LoOverflow == -1) // Low bound is less than input range.
917 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse(ICI.getContext()));
918 return new ICmpInst(Pred, X, LoBound);
919 case ICmpInst::ICMP_UGT:
920 case ICmpInst::ICMP_SGT:
921 if (HiOverflow == +1) // High bound greater than input range.
922 return ReplaceInstUsesWith(ICI, ConstantInt::getFalse(ICI.getContext()));
923 if (HiOverflow == -1) // High bound less than input range.
924 return ReplaceInstUsesWith(ICI, ConstantInt::getTrue(ICI.getContext()));
925 if (Pred == ICmpInst::ICMP_UGT)
926 return new ICmpInst(ICmpInst::ICMP_UGE, X, HiBound);
927 return new ICmpInst(ICmpInst::ICMP_SGE, X, HiBound);
931 /// FoldICmpShrCst - Handle "icmp(([al]shr X, cst1), cst2)".
932 Instruction *InstCombiner::FoldICmpShrCst(ICmpInst &ICI, BinaryOperator *Shr,
933 ConstantInt *ShAmt) {
934 const APInt &CmpRHSV = cast<ConstantInt>(ICI.getOperand(1))->getValue();
936 // Check that the shift amount is in range. If not, don't perform
937 // undefined shifts. When the shift is visited it will be
939 uint32_t TypeBits = CmpRHSV.getBitWidth();
940 uint32_t ShAmtVal = (uint32_t)ShAmt->getLimitedValue(TypeBits);
941 if (ShAmtVal >= TypeBits || ShAmtVal == 0)
944 if (!ICI.isEquality()) {
945 // If we have an unsigned comparison and an ashr, we can't simplify this.
946 // Similarly for signed comparisons with lshr.
947 if (ICI.isSigned() != (Shr->getOpcode() == Instruction::AShr))
950 // Otherwise, all lshr and most exact ashr's are equivalent to a udiv/sdiv
951 // by a power of 2. Since we already have logic to simplify these,
952 // transform to div and then simplify the resultant comparison.
953 if (Shr->getOpcode() == Instruction::AShr &&
954 (!Shr->isExact() || ShAmtVal == TypeBits - 1))
957 // Revisit the shift (to delete it).
961 ConstantInt::get(Shr->getType(), APInt::getOneBitSet(TypeBits, ShAmtVal));
964 Shr->getOpcode() == Instruction::AShr ?
965 Builder->CreateSDiv(Shr->getOperand(0), DivCst, "", Shr->isExact()) :
966 Builder->CreateUDiv(Shr->getOperand(0), DivCst, "", Shr->isExact());
968 ICI.setOperand(0, Tmp);
970 // If the builder folded the binop, just return it.
971 BinaryOperator *TheDiv = dyn_cast<BinaryOperator>(Tmp);
975 // Otherwise, fold this div/compare.
976 assert(TheDiv->getOpcode() == Instruction::SDiv ||
977 TheDiv->getOpcode() == Instruction::UDiv);
979 Instruction *Res = FoldICmpDivCst(ICI, TheDiv, cast<ConstantInt>(DivCst));
980 assert(Res && "This div/cst should have folded!");
985 // If we are comparing against bits always shifted out, the
986 // comparison cannot succeed.
987 APInt Comp = CmpRHSV << ShAmtVal;
988 ConstantInt *ShiftedCmpRHS = ConstantInt::get(ICI.getContext(), Comp);
989 if (Shr->getOpcode() == Instruction::LShr)
990 Comp = Comp.lshr(ShAmtVal);
992 Comp = Comp.ashr(ShAmtVal);
994 if (Comp != CmpRHSV) { // Comparing against a bit that we know is zero.
995 bool IsICMP_NE = ICI.getPredicate() == ICmpInst::ICMP_NE;
996 Constant *Cst = ConstantInt::get(Type::getInt1Ty(ICI.getContext()),
998 return ReplaceInstUsesWith(ICI, Cst);
1001 // Otherwise, check to see if the bits shifted out are known to be zero.
1002 // If so, we can compare against the unshifted value:
1003 // (X & 4) >> 1 == 2 --> (X & 4) == 4.
1004 if (Shr->hasOneUse() && Shr->isExact())
1005 return new ICmpInst(ICI.getPredicate(), Shr->getOperand(0), ShiftedCmpRHS);
1007 if (Shr->hasOneUse()) {
1008 // Otherwise strength reduce the shift into an and.
1009 APInt Val(APInt::getHighBitsSet(TypeBits, TypeBits - ShAmtVal));
1010 Constant *Mask = ConstantInt::get(ICI.getContext(), Val);
1012 Value *And = Builder->CreateAnd(Shr->getOperand(0),
1013 Mask, Shr->getName()+".mask");
1014 return new ICmpInst(ICI.getPredicate(), And, ShiftedCmpRHS);
1020 /// visitICmpInstWithInstAndIntCst - Handle "icmp (instr, intcst)".
1022 Instruction *InstCombiner::visitICmpInstWithInstAndIntCst(ICmpInst &ICI,
1025 const APInt &RHSV = RHS->getValue();
1027 switch (LHSI->getOpcode()) {
1028 case Instruction::Trunc:
1029 if (ICI.isEquality() && LHSI->hasOneUse()) {
1030 // Simplify icmp eq (trunc x to i8), 42 -> icmp eq x, 42|highbits if all
1031 // of the high bits truncated out of x are known.
1032 unsigned DstBits = LHSI->getType()->getPrimitiveSizeInBits(),
1033 SrcBits = LHSI->getOperand(0)->getType()->getPrimitiveSizeInBits();
1034 APInt KnownZero(SrcBits, 0), KnownOne(SrcBits, 0);
1035 ComputeMaskedBits(LHSI->getOperand(0), KnownZero, KnownOne);
1037 // If all the high bits are known, we can do this xform.
1038 if ((KnownZero|KnownOne).countLeadingOnes() >= SrcBits-DstBits) {
1039 // Pull in the high bits from known-ones set.
1040 APInt NewRHS = RHS->getValue().zext(SrcBits);
1041 NewRHS |= KnownOne & APInt::getHighBitsSet(SrcBits, SrcBits-DstBits);
1042 return new ICmpInst(ICI.getPredicate(), LHSI->getOperand(0),
1043 ConstantInt::get(ICI.getContext(), NewRHS));
1048 case Instruction::Xor: // (icmp pred (xor X, XorCST), CI)
1049 if (ConstantInt *XorCST = dyn_cast<ConstantInt>(LHSI->getOperand(1))) {
1050 // If this is a comparison that tests the signbit (X < 0) or (x > -1),
1052 if ((ICI.getPredicate() == ICmpInst::ICMP_SLT && RHSV == 0) ||
1053 (ICI.getPredicate() == ICmpInst::ICMP_SGT && RHSV.isAllOnesValue())) {
1054 Value *CompareVal = LHSI->getOperand(0);
1056 // If the sign bit of the XorCST is not set, there is no change to
1057 // the operation, just stop using the Xor.
1058 if (!XorCST->isNegative()) {
1059 ICI.setOperand(0, CompareVal);
1064 // Was the old condition true if the operand is positive?
1065 bool isTrueIfPositive = ICI.getPredicate() == ICmpInst::ICMP_SGT;
1067 // If so, the new one isn't.
1068 isTrueIfPositive ^= true;
1070 if (isTrueIfPositive)
1071 return new ICmpInst(ICmpInst::ICMP_SGT, CompareVal,
1074 return new ICmpInst(ICmpInst::ICMP_SLT, CompareVal,
1078 if (LHSI->hasOneUse()) {
1079 // (icmp u/s (xor A SignBit), C) -> (icmp s/u A, (xor C SignBit))
1080 if (!ICI.isEquality() && XorCST->getValue().isSignBit()) {
1081 const APInt &SignBit = XorCST->getValue();
1082 ICmpInst::Predicate Pred = ICI.isSigned()
1083 ? ICI.getUnsignedPredicate()
1084 : ICI.getSignedPredicate();
1085 return new ICmpInst(Pred, LHSI->getOperand(0),
1086 ConstantInt::get(ICI.getContext(),
1090 // (icmp u/s (xor A ~SignBit), C) -> (icmp s/u (xor C ~SignBit), A)
1091 if (!ICI.isEquality() && XorCST->isMaxValue(true)) {
1092 const APInt &NotSignBit = XorCST->getValue();
1093 ICmpInst::Predicate Pred = ICI.isSigned()
1094 ? ICI.getUnsignedPredicate()
1095 : ICI.getSignedPredicate();
1096 Pred = ICI.getSwappedPredicate(Pred);
1097 return new ICmpInst(Pred, LHSI->getOperand(0),
1098 ConstantInt::get(ICI.getContext(),
1099 RHSV ^ NotSignBit));
1104 case Instruction::And: // (icmp pred (and X, AndCST), RHS)
1105 if (LHSI->hasOneUse() && isa<ConstantInt>(LHSI->getOperand(1)) &&
1106 LHSI->getOperand(0)->hasOneUse()) {
1107 ConstantInt *AndCST = cast<ConstantInt>(LHSI->getOperand(1));
1109 // If the LHS is an AND of a truncating cast, we can widen the
1110 // and/compare to be the input width without changing the value
1111 // produced, eliminating a cast.
1112 if (TruncInst *Cast = dyn_cast<TruncInst>(LHSI->getOperand(0))) {
1113 // We can do this transformation if either the AND constant does not
1114 // have its sign bit set or if it is an equality comparison.
1115 // Extending a relational comparison when we're checking the sign
1116 // bit would not work.
1117 if (ICI.isEquality() ||
1118 (!AndCST->isNegative() && RHSV.isNonNegative())) {
1120 Builder->CreateAnd(Cast->getOperand(0),
1121 ConstantExpr::getZExt(AndCST, Cast->getSrcTy()));
1122 NewAnd->takeName(LHSI);
1123 return new ICmpInst(ICI.getPredicate(), NewAnd,
1124 ConstantExpr::getZExt(RHS, Cast->getSrcTy()));
1128 // If the LHS is an AND of a zext, and we have an equality compare, we can
1129 // shrink the and/compare to the smaller type, eliminating the cast.
1130 if (ZExtInst *Cast = dyn_cast<ZExtInst>(LHSI->getOperand(0))) {
1131 IntegerType *Ty = cast<IntegerType>(Cast->getSrcTy());
1132 // Make sure we don't compare the upper bits, SimplifyDemandedBits
1133 // should fold the icmp to true/false in that case.
1134 if (ICI.isEquality() && RHSV.getActiveBits() <= Ty->getBitWidth()) {
1136 Builder->CreateAnd(Cast->getOperand(0),
1137 ConstantExpr::getTrunc(AndCST, Ty));
1138 NewAnd->takeName(LHSI);
1139 return new ICmpInst(ICI.getPredicate(), NewAnd,
1140 ConstantExpr::getTrunc(RHS, Ty));
1144 // If this is: (X >> C1) & C2 != C3 (where any shift and any compare
1145 // could exist), turn it into (X & (C2 << C1)) != (C3 << C1). This
1146 // happens a LOT in code produced by the C front-end, for bitfield
1148 BinaryOperator *Shift = dyn_cast<BinaryOperator>(LHSI->getOperand(0));
1149 if (Shift && !Shift->isShift())
1153 ShAmt = Shift ? dyn_cast<ConstantInt>(Shift->getOperand(1)) : 0;
1154 Type *Ty = Shift ? Shift->getType() : 0; // Type of the shift.
1155 Type *AndTy = AndCST->getType(); // Type of the and.
1157 // We can fold this as long as we can't shift unknown bits
1158 // into the mask. This can only happen with signed shift
1159 // rights, as they sign-extend.
1161 bool CanFold = Shift->isLogicalShift();
1163 // To test for the bad case of the signed shr, see if any
1164 // of the bits shifted in could be tested after the mask.
1165 uint32_t TyBits = Ty->getPrimitiveSizeInBits();
1166 int ShAmtVal = TyBits - ShAmt->getLimitedValue(TyBits);
1168 uint32_t BitWidth = AndTy->getPrimitiveSizeInBits();
1169 if ((APInt::getHighBitsSet(BitWidth, BitWidth-ShAmtVal) &
1170 AndCST->getValue()) == 0)
1176 if (Shift->getOpcode() == Instruction::Shl)
1177 NewCst = ConstantExpr::getLShr(RHS, ShAmt);
1179 NewCst = ConstantExpr::getShl(RHS, ShAmt);
1181 // Check to see if we are shifting out any of the bits being
1183 if (ConstantExpr::get(Shift->getOpcode(),
1184 NewCst, ShAmt) != RHS) {
1185 // If we shifted bits out, the fold is not going to work out.
1186 // As a special case, check to see if this means that the
1187 // result is always true or false now.
1188 if (ICI.getPredicate() == ICmpInst::ICMP_EQ)
1189 return ReplaceInstUsesWith(ICI,
1190 ConstantInt::getFalse(ICI.getContext()));
1191 if (ICI.getPredicate() == ICmpInst::ICMP_NE)
1192 return ReplaceInstUsesWith(ICI,
1193 ConstantInt::getTrue(ICI.getContext()));
1195 ICI.setOperand(1, NewCst);
1196 Constant *NewAndCST;
1197 if (Shift->getOpcode() == Instruction::Shl)
1198 NewAndCST = ConstantExpr::getLShr(AndCST, ShAmt);
1200 NewAndCST = ConstantExpr::getShl(AndCST, ShAmt);
1201 LHSI->setOperand(1, NewAndCST);
1202 LHSI->setOperand(0, Shift->getOperand(0));
1203 Worklist.Add(Shift); // Shift is dead.
1209 // Turn ((X >> Y) & C) == 0 into (X & (C << Y)) == 0. The later is
1210 // preferable because it allows the C<<Y expression to be hoisted out
1211 // of a loop if Y is invariant and X is not.
1212 if (Shift && Shift->hasOneUse() && RHSV == 0 &&
1213 ICI.isEquality() && !Shift->isArithmeticShift() &&
1214 !isa<Constant>(Shift->getOperand(0))) {
1217 if (Shift->getOpcode() == Instruction::LShr) {
1218 NS = Builder->CreateShl(AndCST, Shift->getOperand(1));
1220 // Insert a logical shift.
1221 NS = Builder->CreateLShr(AndCST, Shift->getOperand(1));
1224 // Compute X & (C << Y).
1226 Builder->CreateAnd(Shift->getOperand(0), NS, LHSI->getName());
1228 ICI.setOperand(0, NewAnd);
1233 // Try to optimize things like "A[i]&42 == 0" to index computations.
1234 if (LoadInst *LI = dyn_cast<LoadInst>(LHSI->getOperand(0))) {
1235 if (GetElementPtrInst *GEP =
1236 dyn_cast<GetElementPtrInst>(LI->getOperand(0)))
1237 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(GEP->getOperand(0)))
1238 if (GV->isConstant() && GV->hasDefinitiveInitializer() &&
1239 !LI->isVolatile() && isa<ConstantInt>(LHSI->getOperand(1))) {
1240 ConstantInt *C = cast<ConstantInt>(LHSI->getOperand(1));
1241 if (Instruction *Res = FoldCmpLoadFromIndexedGlobal(GEP, GV,ICI, C))
1247 case Instruction::Or: {
1248 if (!ICI.isEquality() || !RHS->isNullValue() || !LHSI->hasOneUse())
1251 if (match(LHSI, m_Or(m_PtrToInt(m_Value(P)), m_PtrToInt(m_Value(Q))))) {
1252 // Simplify icmp eq (or (ptrtoint P), (ptrtoint Q)), 0
1253 // -> and (icmp eq P, null), (icmp eq Q, null).
1254 Value *ICIP = Builder->CreateICmp(ICI.getPredicate(), P,
1255 Constant::getNullValue(P->getType()));
1256 Value *ICIQ = Builder->CreateICmp(ICI.getPredicate(), Q,
1257 Constant::getNullValue(Q->getType()));
1259 if (ICI.getPredicate() == ICmpInst::ICMP_EQ)
1260 Op = BinaryOperator::CreateAnd(ICIP, ICIQ);
1262 Op = BinaryOperator::CreateOr(ICIP, ICIQ);
1268 case Instruction::Shl: { // (icmp pred (shl X, ShAmt), CI)
1269 ConstantInt *ShAmt = dyn_cast<ConstantInt>(LHSI->getOperand(1));
1272 uint32_t TypeBits = RHSV.getBitWidth();
1274 // Check that the shift amount is in range. If not, don't perform
1275 // undefined shifts. When the shift is visited it will be
1277 if (ShAmt->uge(TypeBits))
1280 if (ICI.isEquality()) {
1281 // If we are comparing against bits always shifted out, the
1282 // comparison cannot succeed.
1284 ConstantExpr::getShl(ConstantExpr::getLShr(RHS, ShAmt),
1286 if (Comp != RHS) {// Comparing against a bit that we know is zero.
1287 bool IsICMP_NE = ICI.getPredicate() == ICmpInst::ICMP_NE;
1289 ConstantInt::get(Type::getInt1Ty(ICI.getContext()), IsICMP_NE);
1290 return ReplaceInstUsesWith(ICI, Cst);
1293 // If the shift is NUW, then it is just shifting out zeros, no need for an
1295 if (cast<BinaryOperator>(LHSI)->hasNoUnsignedWrap())
1296 return new ICmpInst(ICI.getPredicate(), LHSI->getOperand(0),
1297 ConstantExpr::getLShr(RHS, ShAmt));
1299 if (LHSI->hasOneUse()) {
1300 // Otherwise strength reduce the shift into an and.
1301 uint32_t ShAmtVal = (uint32_t)ShAmt->getLimitedValue(TypeBits);
1303 ConstantInt::get(ICI.getContext(), APInt::getLowBitsSet(TypeBits,
1304 TypeBits-ShAmtVal));
1307 Builder->CreateAnd(LHSI->getOperand(0),Mask, LHSI->getName()+".mask");
1308 return new ICmpInst(ICI.getPredicate(), And,
1309 ConstantExpr::getLShr(RHS, ShAmt));
1313 // Otherwise, if this is a comparison of the sign bit, simplify to and/test.
1314 bool TrueIfSigned = false;
1315 if (LHSI->hasOneUse() &&
1316 isSignBitCheck(ICI.getPredicate(), RHS, TrueIfSigned)) {
1317 // (X << 31) <s 0 --> (X&1) != 0
1318 Constant *Mask = ConstantInt::get(LHSI->getOperand(0)->getType(),
1319 APInt::getOneBitSet(TypeBits,
1320 TypeBits-ShAmt->getZExtValue()-1));
1322 Builder->CreateAnd(LHSI->getOperand(0), Mask, LHSI->getName()+".mask");
1323 return new ICmpInst(TrueIfSigned ? ICmpInst::ICMP_NE : ICmpInst::ICMP_EQ,
1324 And, Constant::getNullValue(And->getType()));
1329 case Instruction::LShr: // (icmp pred (shr X, ShAmt), CI)
1330 case Instruction::AShr: {
1331 // Handle equality comparisons of shift-by-constant.
1332 BinaryOperator *BO = cast<BinaryOperator>(LHSI);
1333 if (ConstantInt *ShAmt = dyn_cast<ConstantInt>(LHSI->getOperand(1))) {
1334 if (Instruction *Res = FoldICmpShrCst(ICI, BO, ShAmt))
1338 // Handle exact shr's.
1339 if (ICI.isEquality() && BO->isExact() && BO->hasOneUse()) {
1340 if (RHSV.isMinValue())
1341 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0), RHS);
1346 case Instruction::SDiv:
1347 case Instruction::UDiv:
1348 // Fold: icmp pred ([us]div X, C1), C2 -> range test
1349 // Fold this div into the comparison, producing a range check.
1350 // Determine, based on the divide type, what the range is being
1351 // checked. If there is an overflow on the low or high side, remember
1352 // it, otherwise compute the range [low, hi) bounding the new value.
1353 // See: InsertRangeTest above for the kinds of replacements possible.
1354 if (ConstantInt *DivRHS = dyn_cast<ConstantInt>(LHSI->getOperand(1)))
1355 if (Instruction *R = FoldICmpDivCst(ICI, cast<BinaryOperator>(LHSI),
1360 case Instruction::Add:
1361 // Fold: icmp pred (add X, C1), C2
1362 if (!ICI.isEquality()) {
1363 ConstantInt *LHSC = dyn_cast<ConstantInt>(LHSI->getOperand(1));
1365 const APInt &LHSV = LHSC->getValue();
1367 ConstantRange CR = ICI.makeConstantRange(ICI.getPredicate(), RHSV)
1370 if (ICI.isSigned()) {
1371 if (CR.getLower().isSignBit()) {
1372 return new ICmpInst(ICmpInst::ICMP_SLT, LHSI->getOperand(0),
1373 ConstantInt::get(ICI.getContext(),CR.getUpper()));
1374 } else if (CR.getUpper().isSignBit()) {
1375 return new ICmpInst(ICmpInst::ICMP_SGE, LHSI->getOperand(0),
1376 ConstantInt::get(ICI.getContext(),CR.getLower()));
1379 if (CR.getLower().isMinValue()) {
1380 return new ICmpInst(ICmpInst::ICMP_ULT, LHSI->getOperand(0),
1381 ConstantInt::get(ICI.getContext(),CR.getUpper()));
1382 } else if (CR.getUpper().isMinValue()) {
1383 return new ICmpInst(ICmpInst::ICMP_UGE, LHSI->getOperand(0),
1384 ConstantInt::get(ICI.getContext(),CR.getLower()));
1391 // Simplify icmp_eq and icmp_ne instructions with integer constant RHS.
1392 if (ICI.isEquality()) {
1393 bool isICMP_NE = ICI.getPredicate() == ICmpInst::ICMP_NE;
1395 // If the first operand is (add|sub|and|or|xor|rem) with a constant, and
1396 // the second operand is a constant, simplify a bit.
1397 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(LHSI)) {
1398 switch (BO->getOpcode()) {
1399 case Instruction::SRem:
1400 // If we have a signed (X % (2^c)) == 0, turn it into an unsigned one.
1401 if (RHSV == 0 && isa<ConstantInt>(BO->getOperand(1)) &&BO->hasOneUse()){
1402 const APInt &V = cast<ConstantInt>(BO->getOperand(1))->getValue();
1403 if (V.sgt(1) && V.isPowerOf2()) {
1405 Builder->CreateURem(BO->getOperand(0), BO->getOperand(1),
1407 return new ICmpInst(ICI.getPredicate(), NewRem,
1408 Constant::getNullValue(BO->getType()));
1412 case Instruction::Add:
1413 // Replace ((add A, B) != C) with (A != C-B) if B & C are constants.
1414 if (ConstantInt *BOp1C = dyn_cast<ConstantInt>(BO->getOperand(1))) {
1415 if (BO->hasOneUse())
1416 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
1417 ConstantExpr::getSub(RHS, BOp1C));
1418 } else if (RHSV == 0) {
1419 // Replace ((add A, B) != 0) with (A != -B) if A or B is
1420 // efficiently invertible, or if the add has just this one use.
1421 Value *BOp0 = BO->getOperand(0), *BOp1 = BO->getOperand(1);
1423 if (Value *NegVal = dyn_castNegVal(BOp1))
1424 return new ICmpInst(ICI.getPredicate(), BOp0, NegVal);
1425 if (Value *NegVal = dyn_castNegVal(BOp0))
1426 return new ICmpInst(ICI.getPredicate(), NegVal, BOp1);
1427 if (BO->hasOneUse()) {
1428 Value *Neg = Builder->CreateNeg(BOp1);
1430 return new ICmpInst(ICI.getPredicate(), BOp0, Neg);
1434 case Instruction::Xor:
1435 // For the xor case, we can xor two constants together, eliminating
1436 // the explicit xor.
1437 if (Constant *BOC = dyn_cast<Constant>(BO->getOperand(1))) {
1438 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
1439 ConstantExpr::getXor(RHS, BOC));
1440 } else if (RHSV == 0) {
1441 // Replace ((xor A, B) != 0) with (A != B)
1442 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
1446 case Instruction::Sub:
1447 // Replace ((sub A, B) != C) with (B != A-C) if A & C are constants.
1448 if (ConstantInt *BOp0C = dyn_cast<ConstantInt>(BO->getOperand(0))) {
1449 if (BO->hasOneUse())
1450 return new ICmpInst(ICI.getPredicate(), BO->getOperand(1),
1451 ConstantExpr::getSub(BOp0C, RHS));
1452 } else if (RHSV == 0) {
1453 // Replace ((sub A, B) != 0) with (A != B)
1454 return new ICmpInst(ICI.getPredicate(), BO->getOperand(0),
1458 case Instruction::Or:
1459 // If bits are being or'd in that are not present in the constant we
1460 // are comparing against, then the comparison could never succeed!
1461 if (ConstantInt *BOC = dyn_cast<ConstantInt>(BO->getOperand(1))) {
1462 Constant *NotCI = ConstantExpr::getNot(RHS);
1463 if (!ConstantExpr::getAnd(BOC, NotCI)->isNullValue())
1464 return ReplaceInstUsesWith(ICI,
1465 ConstantInt::get(Type::getInt1Ty(ICI.getContext()),
1470 case Instruction::And:
1471 if (ConstantInt *BOC = dyn_cast<ConstantInt>(BO->getOperand(1))) {
1472 // If bits are being compared against that are and'd out, then the
1473 // comparison can never succeed!
1474 if ((RHSV & ~BOC->getValue()) != 0)
1475 return ReplaceInstUsesWith(ICI,
1476 ConstantInt::get(Type::getInt1Ty(ICI.getContext()),
1479 // If we have ((X & C) == C), turn it into ((X & C) != 0).
1480 if (RHS == BOC && RHSV.isPowerOf2())
1481 return new ICmpInst(isICMP_NE ? ICmpInst::ICMP_EQ :
1482 ICmpInst::ICMP_NE, LHSI,
1483 Constant::getNullValue(RHS->getType()));
1485 // Don't perform the following transforms if the AND has multiple uses
1486 if (!BO->hasOneUse())
1489 // Replace (and X, (1 << size(X)-1) != 0) with x s< 0
1490 if (BOC->getValue().isSignBit()) {
1491 Value *X = BO->getOperand(0);
1492 Constant *Zero = Constant::getNullValue(X->getType());
1493 ICmpInst::Predicate pred = isICMP_NE ?
1494 ICmpInst::ICMP_SLT : ICmpInst::ICMP_SGE;
1495 return new ICmpInst(pred, X, Zero);
1498 // ((X & ~7) == 0) --> X < 8
1499 if (RHSV == 0 && isHighOnes(BOC)) {
1500 Value *X = BO->getOperand(0);
1501 Constant *NegX = ConstantExpr::getNeg(BOC);
1502 ICmpInst::Predicate pred = isICMP_NE ?
1503 ICmpInst::ICMP_UGE : ICmpInst::ICMP_ULT;
1504 return new ICmpInst(pred, X, NegX);
1509 } else if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(LHSI)) {
1510 // Handle icmp {eq|ne} <intrinsic>, intcst.
1511 switch (II->getIntrinsicID()) {
1512 case Intrinsic::bswap:
1514 ICI.setOperand(0, II->getArgOperand(0));
1515 ICI.setOperand(1, ConstantInt::get(II->getContext(), RHSV.byteSwap()));
1517 case Intrinsic::ctlz:
1518 case Intrinsic::cttz:
1519 // ctz(A) == bitwidth(a) -> A == 0 and likewise for !=
1520 if (RHSV == RHS->getType()->getBitWidth()) {
1522 ICI.setOperand(0, II->getArgOperand(0));
1523 ICI.setOperand(1, ConstantInt::get(RHS->getType(), 0));
1527 case Intrinsic::ctpop:
1528 // popcount(A) == 0 -> A == 0 and likewise for !=
1529 if (RHS->isZero()) {
1531 ICI.setOperand(0, II->getArgOperand(0));
1532 ICI.setOperand(1, RHS);
1544 /// visitICmpInstWithCastAndCast - Handle icmp (cast x to y), (cast/cst).
1545 /// We only handle extending casts so far.
1547 Instruction *InstCombiner::visitICmpInstWithCastAndCast(ICmpInst &ICI) {
1548 const CastInst *LHSCI = cast<CastInst>(ICI.getOperand(0));
1549 Value *LHSCIOp = LHSCI->getOperand(0);
1550 Type *SrcTy = LHSCIOp->getType();
1551 Type *DestTy = LHSCI->getType();
1554 // Turn icmp (ptrtoint x), (ptrtoint/c) into a compare of the input if the
1555 // integer type is the same size as the pointer type.
1556 if (TD && LHSCI->getOpcode() == Instruction::PtrToInt &&
1557 TD->getPointerSizeInBits(
1558 cast<PtrToIntInst>(LHSCI)->getPointerAddressSpace()) ==
1559 cast<IntegerType>(DestTy)->getBitWidth()) {
1561 if (Constant *RHSC = dyn_cast<Constant>(ICI.getOperand(1))) {
1562 RHSOp = ConstantExpr::getIntToPtr(RHSC, SrcTy);
1563 } else if (PtrToIntInst *RHSC = dyn_cast<PtrToIntInst>(ICI.getOperand(1))) {
1564 RHSOp = RHSC->getOperand(0);
1565 // If the pointer types don't match, insert a bitcast.
1566 if (LHSCIOp->getType() != RHSOp->getType())
1567 RHSOp = Builder->CreateBitCast(RHSOp, LHSCIOp->getType());
1571 return new ICmpInst(ICI.getPredicate(), LHSCIOp, RHSOp);
1574 // The code below only handles extension cast instructions, so far.
1576 if (LHSCI->getOpcode() != Instruction::ZExt &&
1577 LHSCI->getOpcode() != Instruction::SExt)
1580 bool isSignedExt = LHSCI->getOpcode() == Instruction::SExt;
1581 bool isSignedCmp = ICI.isSigned();
1583 if (CastInst *CI = dyn_cast<CastInst>(ICI.getOperand(1))) {
1584 // Not an extension from the same type?
1585 RHSCIOp = CI->getOperand(0);
1586 if (RHSCIOp->getType() != LHSCIOp->getType())
1589 // If the signedness of the two casts doesn't agree (i.e. one is a sext
1590 // and the other is a zext), then we can't handle this.
1591 if (CI->getOpcode() != LHSCI->getOpcode())
1594 // Deal with equality cases early.
1595 if (ICI.isEquality())
1596 return new ICmpInst(ICI.getPredicate(), LHSCIOp, RHSCIOp);
1598 // A signed comparison of sign extended values simplifies into a
1599 // signed comparison.
1600 if (isSignedCmp && isSignedExt)
1601 return new ICmpInst(ICI.getPredicate(), LHSCIOp, RHSCIOp);
1603 // The other three cases all fold into an unsigned comparison.
1604 return new ICmpInst(ICI.getUnsignedPredicate(), LHSCIOp, RHSCIOp);
1607 // If we aren't dealing with a constant on the RHS, exit early
1608 ConstantInt *CI = dyn_cast<ConstantInt>(ICI.getOperand(1));
1612 // Compute the constant that would happen if we truncated to SrcTy then
1613 // reextended to DestTy.
1614 Constant *Res1 = ConstantExpr::getTrunc(CI, SrcTy);
1615 Constant *Res2 = ConstantExpr::getCast(LHSCI->getOpcode(),
1618 // If the re-extended constant didn't change...
1620 // Deal with equality cases early.
1621 if (ICI.isEquality())
1622 return new ICmpInst(ICI.getPredicate(), LHSCIOp, Res1);
1624 // A signed comparison of sign extended values simplifies into a
1625 // signed comparison.
1626 if (isSignedExt && isSignedCmp)
1627 return new ICmpInst(ICI.getPredicate(), LHSCIOp, Res1);
1629 // The other three cases all fold into an unsigned comparison.
1630 return new ICmpInst(ICI.getUnsignedPredicate(), LHSCIOp, Res1);
1633 // The re-extended constant changed so the constant cannot be represented
1634 // in the shorter type. Consequently, we cannot emit a simple comparison.
1635 // All the cases that fold to true or false will have already been handled
1636 // by SimplifyICmpInst, so only deal with the tricky case.
1638 if (isSignedCmp || !isSignedExt)
1641 // Evaluate the comparison for LT (we invert for GT below). LE and GE cases
1642 // should have been folded away previously and not enter in here.
1644 // We're performing an unsigned comp with a sign extended value.
1645 // This is true if the input is >= 0. [aka >s -1]
1646 Constant *NegOne = Constant::getAllOnesValue(SrcTy);
1647 Value *Result = Builder->CreateICmpSGT(LHSCIOp, NegOne, ICI.getName());
1649 // Finally, return the value computed.
1650 if (ICI.getPredicate() == ICmpInst::ICMP_ULT)
1651 return ReplaceInstUsesWith(ICI, Result);
1653 assert(ICI.getPredicate() == ICmpInst::ICMP_UGT && "ICmp should be folded!");
1654 return BinaryOperator::CreateNot(Result);
1657 /// ProcessUGT_ADDCST_ADD - The caller has matched a pattern of the form:
1658 /// I = icmp ugt (add (add A, B), CI2), CI1
1659 /// If this is of the form:
1661 /// if (sum+128 >u 255)
1662 /// Then replace it with llvm.sadd.with.overflow.i8.
1664 static Instruction *ProcessUGT_ADDCST_ADD(ICmpInst &I, Value *A, Value *B,
1665 ConstantInt *CI2, ConstantInt *CI1,
1667 // The transformation we're trying to do here is to transform this into an
1668 // llvm.sadd.with.overflow. To do this, we have to replace the original add
1669 // with a narrower add, and discard the add-with-constant that is part of the
1670 // range check (if we can't eliminate it, this isn't profitable).
1672 // In order to eliminate the add-with-constant, the compare can be its only
1674 Instruction *AddWithCst = cast<Instruction>(I.getOperand(0));
1675 if (!AddWithCst->hasOneUse()) return 0;
1677 // If CI2 is 2^7, 2^15, 2^31, then it might be an sadd.with.overflow.
1678 if (!CI2->getValue().isPowerOf2()) return 0;
1679 unsigned NewWidth = CI2->getValue().countTrailingZeros();
1680 if (NewWidth != 7 && NewWidth != 15 && NewWidth != 31) return 0;
1682 // The width of the new add formed is 1 more than the bias.
1685 // Check to see that CI1 is an all-ones value with NewWidth bits.
1686 if (CI1->getBitWidth() == NewWidth ||
1687 CI1->getValue() != APInt::getLowBitsSet(CI1->getBitWidth(), NewWidth))
1690 // This is only really a signed overflow check if the inputs have been
1691 // sign-extended; check for that condition. For example, if CI2 is 2^31 and
1692 // the operands of the add are 64 bits wide, we need at least 33 sign bits.
1693 unsigned NeededSignBits = CI1->getBitWidth() - NewWidth + 1;
1694 if (IC.ComputeNumSignBits(A) < NeededSignBits ||
1695 IC.ComputeNumSignBits(B) < NeededSignBits)
1698 // In order to replace the original add with a narrower
1699 // llvm.sadd.with.overflow, the only uses allowed are the add-with-constant
1700 // and truncates that discard the high bits of the add. Verify that this is
1702 Instruction *OrigAdd = cast<Instruction>(AddWithCst->getOperand(0));
1703 for (Value::use_iterator UI = OrigAdd->use_begin(), E = OrigAdd->use_end();
1705 if (*UI == AddWithCst) continue;
1707 // Only accept truncates for now. We would really like a nice recursive
1708 // predicate like SimplifyDemandedBits, but which goes downwards the use-def
1709 // chain to see which bits of a value are actually demanded. If the
1710 // original add had another add which was then immediately truncated, we
1711 // could still do the transformation.
1712 TruncInst *TI = dyn_cast<TruncInst>(*UI);
1714 TI->getType()->getPrimitiveSizeInBits() > NewWidth) return 0;
1717 // If the pattern matches, truncate the inputs to the narrower type and
1718 // use the sadd_with_overflow intrinsic to efficiently compute both the
1719 // result and the overflow bit.
1720 Module *M = I.getParent()->getParent()->getParent();
1722 Type *NewType = IntegerType::get(OrigAdd->getContext(), NewWidth);
1723 Value *F = Intrinsic::getDeclaration(M, Intrinsic::sadd_with_overflow,
1726 InstCombiner::BuilderTy *Builder = IC.Builder;
1728 // Put the new code above the original add, in case there are any uses of the
1729 // add between the add and the compare.
1730 Builder->SetInsertPoint(OrigAdd);
1732 Value *TruncA = Builder->CreateTrunc(A, NewType, A->getName()+".trunc");
1733 Value *TruncB = Builder->CreateTrunc(B, NewType, B->getName()+".trunc");
1734 CallInst *Call = Builder->CreateCall2(F, TruncA, TruncB, "sadd");
1735 Value *Add = Builder->CreateExtractValue(Call, 0, "sadd.result");
1736 Value *ZExt = Builder->CreateZExt(Add, OrigAdd->getType());
1738 // The inner add was the result of the narrow add, zero extended to the
1739 // wider type. Replace it with the result computed by the intrinsic.
1740 IC.ReplaceInstUsesWith(*OrigAdd, ZExt);
1742 // The original icmp gets replaced with the overflow value.
1743 return ExtractValueInst::Create(Call, 1, "sadd.overflow");
1746 static Instruction *ProcessUAddIdiom(Instruction &I, Value *OrigAddV,
1748 // Don't bother doing this transformation for pointers, don't do it for
1750 if (!isa<IntegerType>(OrigAddV->getType())) return 0;
1752 // If the add is a constant expr, then we don't bother transforming it.
1753 Instruction *OrigAdd = dyn_cast<Instruction>(OrigAddV);
1754 if (OrigAdd == 0) return 0;
1756 Value *LHS = OrigAdd->getOperand(0), *RHS = OrigAdd->getOperand(1);
1758 // Put the new code above the original add, in case there are any uses of the
1759 // add between the add and the compare.
1760 InstCombiner::BuilderTy *Builder = IC.Builder;
1761 Builder->SetInsertPoint(OrigAdd);
1763 Module *M = I.getParent()->getParent()->getParent();
1764 Type *Ty = LHS->getType();
1765 Value *F = Intrinsic::getDeclaration(M, Intrinsic::uadd_with_overflow, Ty);
1766 CallInst *Call = Builder->CreateCall2(F, LHS, RHS, "uadd");
1767 Value *Add = Builder->CreateExtractValue(Call, 0);
1769 IC.ReplaceInstUsesWith(*OrigAdd, Add);
1771 // The original icmp gets replaced with the overflow value.
1772 return ExtractValueInst::Create(Call, 1, "uadd.overflow");
1775 // DemandedBitsLHSMask - When performing a comparison against a constant,
1776 // it is possible that not all the bits in the LHS are demanded. This helper
1777 // method computes the mask that IS demanded.
1778 static APInt DemandedBitsLHSMask(ICmpInst &I,
1779 unsigned BitWidth, bool isSignCheck) {
1781 return APInt::getSignBit(BitWidth);
1783 ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand(1));
1784 if (!CI) return APInt::getAllOnesValue(BitWidth);
1785 const APInt &RHS = CI->getValue();
1787 switch (I.getPredicate()) {
1788 // For a UGT comparison, we don't care about any bits that
1789 // correspond to the trailing ones of the comparand. The value of these
1790 // bits doesn't impact the outcome of the comparison, because any value
1791 // greater than the RHS must differ in a bit higher than these due to carry.
1792 case ICmpInst::ICMP_UGT: {
1793 unsigned trailingOnes = RHS.countTrailingOnes();
1794 APInt lowBitsSet = APInt::getLowBitsSet(BitWidth, trailingOnes);
1798 // Similarly, for a ULT comparison, we don't care about the trailing zeros.
1799 // Any value less than the RHS must differ in a higher bit because of carries.
1800 case ICmpInst::ICMP_ULT: {
1801 unsigned trailingZeros = RHS.countTrailingZeros();
1802 APInt lowBitsSet = APInt::getLowBitsSet(BitWidth, trailingZeros);
1807 return APInt::getAllOnesValue(BitWidth);
1812 Instruction *InstCombiner::visitICmpInst(ICmpInst &I) {
1813 bool Changed = false;
1814 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
1816 /// Orders the operands of the compare so that they are listed from most
1817 /// complex to least complex. This puts constants before unary operators,
1818 /// before binary operators.
1819 if (getComplexity(Op0) < getComplexity(Op1)) {
1821 std::swap(Op0, Op1);
1825 if (Value *V = SimplifyICmpInst(I.getPredicate(), Op0, Op1, TD))
1826 return ReplaceInstUsesWith(I, V);
1828 // comparing -val or val with non-zero is the same as just comparing val
1829 // ie, abs(val) != 0 -> val != 0
1830 if (I.getPredicate() == ICmpInst::ICMP_NE && match(Op1, m_Zero()))
1832 Value *Cond, *SelectTrue, *SelectFalse;
1833 if (match(Op0, m_Select(m_Value(Cond), m_Value(SelectTrue),
1834 m_Value(SelectFalse)))) {
1835 if (Value *V = dyn_castNegVal(SelectTrue)) {
1836 if (V == SelectFalse)
1837 return CmpInst::Create(Instruction::ICmp, I.getPredicate(), V, Op1);
1839 else if (Value *V = dyn_castNegVal(SelectFalse)) {
1840 if (V == SelectTrue)
1841 return CmpInst::Create(Instruction::ICmp, I.getPredicate(), V, Op1);
1846 Type *Ty = Op0->getType();
1848 // icmp's with boolean values can always be turned into bitwise operations
1849 if (Ty->isIntegerTy(1)) {
1850 switch (I.getPredicate()) {
1851 default: llvm_unreachable("Invalid icmp instruction!");
1852 case ICmpInst::ICMP_EQ: { // icmp eq i1 A, B -> ~(A^B)
1853 Value *Xor = Builder->CreateXor(Op0, Op1, I.getName()+"tmp");
1854 return BinaryOperator::CreateNot(Xor);
1856 case ICmpInst::ICMP_NE: // icmp eq i1 A, B -> A^B
1857 return BinaryOperator::CreateXor(Op0, Op1);
1859 case ICmpInst::ICMP_UGT:
1860 std::swap(Op0, Op1); // Change icmp ugt -> icmp ult
1862 case ICmpInst::ICMP_ULT:{ // icmp ult i1 A, B -> ~A & B
1863 Value *Not = Builder->CreateNot(Op0, I.getName()+"tmp");
1864 return BinaryOperator::CreateAnd(Not, Op1);
1866 case ICmpInst::ICMP_SGT:
1867 std::swap(Op0, Op1); // Change icmp sgt -> icmp slt
1869 case ICmpInst::ICMP_SLT: { // icmp slt i1 A, B -> A & ~B
1870 Value *Not = Builder->CreateNot(Op1, I.getName()+"tmp");
1871 return BinaryOperator::CreateAnd(Not, Op0);
1873 case ICmpInst::ICMP_UGE:
1874 std::swap(Op0, Op1); // Change icmp uge -> icmp ule
1876 case ICmpInst::ICMP_ULE: { // icmp ule i1 A, B -> ~A | B
1877 Value *Not = Builder->CreateNot(Op0, I.getName()+"tmp");
1878 return BinaryOperator::CreateOr(Not, Op1);
1880 case ICmpInst::ICMP_SGE:
1881 std::swap(Op0, Op1); // Change icmp sge -> icmp sle
1883 case ICmpInst::ICMP_SLE: { // icmp sle i1 A, B -> A | ~B
1884 Value *Not = Builder->CreateNot(Op1, I.getName()+"tmp");
1885 return BinaryOperator::CreateOr(Not, Op0);
1890 unsigned BitWidth = 0;
1891 if (Ty->isIntOrIntVectorTy())
1892 BitWidth = Ty->getScalarSizeInBits();
1893 else if (TD) // Pointers require TD info to get their size.
1894 BitWidth = TD->getTypeSizeInBits(Ty->getScalarType());
1896 bool isSignBit = false;
1898 // See if we are doing a comparison with a constant.
1899 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
1900 Value *A = 0, *B = 0;
1902 // Match the following pattern, which is a common idiom when writing
1903 // overflow-safe integer arithmetic function. The source performs an
1904 // addition in wider type, and explicitly checks for overflow using
1905 // comparisons against INT_MIN and INT_MAX. Simplify this by using the
1906 // sadd_with_overflow intrinsic.
1908 // TODO: This could probably be generalized to handle other overflow-safe
1909 // operations if we worked out the formulas to compute the appropriate
1913 // if (sum+128 >u 255) ... -> llvm.sadd.with.overflow.i8
1915 ConstantInt *CI2; // I = icmp ugt (add (add A, B), CI2), CI
1916 if (I.getPredicate() == ICmpInst::ICMP_UGT &&
1917 match(Op0, m_Add(m_Add(m_Value(A), m_Value(B)), m_ConstantInt(CI2))))
1918 if (Instruction *Res = ProcessUGT_ADDCST_ADD(I, A, B, CI2, CI, *this))
1922 // (icmp ne/eq (sub A B) 0) -> (icmp ne/eq A, B)
1923 if (I.isEquality() && CI->isZero() &&
1924 match(Op0, m_Sub(m_Value(A), m_Value(B)))) {
1925 // (icmp cond A B) if cond is equality
1926 return new ICmpInst(I.getPredicate(), A, B);
1929 // If we have an icmp le or icmp ge instruction, turn it into the
1930 // appropriate icmp lt or icmp gt instruction. This allows us to rely on
1931 // them being folded in the code below. The SimplifyICmpInst code has
1932 // already handled the edge cases for us, so we just assert on them.
1933 switch (I.getPredicate()) {
1935 case ICmpInst::ICMP_ULE:
1936 assert(!CI->isMaxValue(false)); // A <=u MAX -> TRUE
1937 return new ICmpInst(ICmpInst::ICMP_ULT, Op0,
1938 ConstantInt::get(CI->getContext(), CI->getValue()+1));
1939 case ICmpInst::ICMP_SLE:
1940 assert(!CI->isMaxValue(true)); // A <=s MAX -> TRUE
1941 return new ICmpInst(ICmpInst::ICMP_SLT, Op0,
1942 ConstantInt::get(CI->getContext(), CI->getValue()+1));
1943 case ICmpInst::ICMP_UGE:
1944 assert(!CI->isMinValue(false)); // A >=u MIN -> TRUE
1945 return new ICmpInst(ICmpInst::ICMP_UGT, Op0,
1946 ConstantInt::get(CI->getContext(), CI->getValue()-1));
1947 case ICmpInst::ICMP_SGE:
1948 assert(!CI->isMinValue(true)); // A >=s MIN -> TRUE
1949 return new ICmpInst(ICmpInst::ICMP_SGT, Op0,
1950 ConstantInt::get(CI->getContext(), CI->getValue()-1));
1953 // If this comparison is a normal comparison, it demands all
1954 // bits, if it is a sign bit comparison, it only demands the sign bit.
1956 isSignBit = isSignBitCheck(I.getPredicate(), CI, UnusedBit);
1959 // See if we can fold the comparison based on range information we can get
1960 // by checking whether bits are known to be zero or one in the input.
1961 if (BitWidth != 0) {
1962 APInt Op0KnownZero(BitWidth, 0), Op0KnownOne(BitWidth, 0);
1963 APInt Op1KnownZero(BitWidth, 0), Op1KnownOne(BitWidth, 0);
1965 if (SimplifyDemandedBits(I.getOperandUse(0),
1966 DemandedBitsLHSMask(I, BitWidth, isSignBit),
1967 Op0KnownZero, Op0KnownOne, 0))
1969 if (SimplifyDemandedBits(I.getOperandUse(1),
1970 APInt::getAllOnesValue(BitWidth),
1971 Op1KnownZero, Op1KnownOne, 0))
1974 // Given the known and unknown bits, compute a range that the LHS could be
1975 // in. Compute the Min, Max and RHS values based on the known bits. For the
1976 // EQ and NE we use unsigned values.
1977 APInt Op0Min(BitWidth, 0), Op0Max(BitWidth, 0);
1978 APInt Op1Min(BitWidth, 0), Op1Max(BitWidth, 0);
1980 ComputeSignedMinMaxValuesFromKnownBits(Op0KnownZero, Op0KnownOne,
1982 ComputeSignedMinMaxValuesFromKnownBits(Op1KnownZero, Op1KnownOne,
1985 ComputeUnsignedMinMaxValuesFromKnownBits(Op0KnownZero, Op0KnownOne,
1987 ComputeUnsignedMinMaxValuesFromKnownBits(Op1KnownZero, Op1KnownOne,
1991 // If Min and Max are known to be the same, then SimplifyDemandedBits
1992 // figured out that the LHS is a constant. Just constant fold this now so
1993 // that code below can assume that Min != Max.
1994 if (!isa<Constant>(Op0) && Op0Min == Op0Max)
1995 return new ICmpInst(I.getPredicate(),
1996 ConstantInt::get(Op0->getType(), Op0Min), Op1);
1997 if (!isa<Constant>(Op1) && Op1Min == Op1Max)
1998 return new ICmpInst(I.getPredicate(), Op0,
1999 ConstantInt::get(Op1->getType(), Op1Min));
2001 // Based on the range information we know about the LHS, see if we can
2002 // simplify this comparison. For example, (x&4) < 8 is always true.
2003 switch (I.getPredicate()) {
2004 default: llvm_unreachable("Unknown icmp opcode!");
2005 case ICmpInst::ICMP_EQ: {
2006 if (Op0Max.ult(Op1Min) || Op0Min.ugt(Op1Max))
2007 return ReplaceInstUsesWith(I, ConstantInt::getFalse(I.getType()));
2009 // If all bits are known zero except for one, then we know at most one
2010 // bit is set. If the comparison is against zero, then this is a check
2011 // to see if *that* bit is set.
2012 APInt Op0KnownZeroInverted = ~Op0KnownZero;
2013 if (~Op1KnownZero == 0 && Op0KnownZeroInverted.isPowerOf2()) {
2014 // If the LHS is an AND with the same constant, look through it.
2016 ConstantInt *LHSC = 0;
2017 if (!match(Op0, m_And(m_Value(LHS), m_ConstantInt(LHSC))) ||
2018 LHSC->getValue() != Op0KnownZeroInverted)
2021 // If the LHS is 1 << x, and we know the result is a power of 2 like 8,
2022 // then turn "((1 << x)&8) == 0" into "x != 3".
2024 if (match(LHS, m_Shl(m_One(), m_Value(X)))) {
2025 unsigned CmpVal = Op0KnownZeroInverted.countTrailingZeros();
2026 return new ICmpInst(ICmpInst::ICMP_NE, X,
2027 ConstantInt::get(X->getType(), CmpVal));
2030 // If the LHS is 8 >>u x, and we know the result is a power of 2 like 1,
2031 // then turn "((8 >>u x)&1) == 0" into "x != 3".
2033 if (Op0KnownZeroInverted == 1 &&
2034 match(LHS, m_LShr(m_Power2(CI), m_Value(X))))
2035 return new ICmpInst(ICmpInst::ICMP_NE, X,
2036 ConstantInt::get(X->getType(),
2037 CI->countTrailingZeros()));
2042 case ICmpInst::ICMP_NE: {
2043 if (Op0Max.ult(Op1Min) || Op0Min.ugt(Op1Max))
2044 return ReplaceInstUsesWith(I, ConstantInt::getTrue(I.getType()));
2046 // If all bits are known zero except for one, then we know at most one
2047 // bit is set. If the comparison is against zero, then this is a check
2048 // to see if *that* bit is set.
2049 APInt Op0KnownZeroInverted = ~Op0KnownZero;
2050 if (~Op1KnownZero == 0 && Op0KnownZeroInverted.isPowerOf2()) {
2051 // If the LHS is an AND with the same constant, look through it.
2053 ConstantInt *LHSC = 0;
2054 if (!match(Op0, m_And(m_Value(LHS), m_ConstantInt(LHSC))) ||
2055 LHSC->getValue() != Op0KnownZeroInverted)
2058 // If the LHS is 1 << x, and we know the result is a power of 2 like 8,
2059 // then turn "((1 << x)&8) != 0" into "x == 3".
2061 if (match(LHS, m_Shl(m_One(), m_Value(X)))) {
2062 unsigned CmpVal = Op0KnownZeroInverted.countTrailingZeros();
2063 return new ICmpInst(ICmpInst::ICMP_EQ, X,
2064 ConstantInt::get(X->getType(), CmpVal));
2067 // If the LHS is 8 >>u x, and we know the result is a power of 2 like 1,
2068 // then turn "((8 >>u x)&1) != 0" into "x == 3".
2070 if (Op0KnownZeroInverted == 1 &&
2071 match(LHS, m_LShr(m_Power2(CI), m_Value(X))))
2072 return new ICmpInst(ICmpInst::ICMP_EQ, X,
2073 ConstantInt::get(X->getType(),
2074 CI->countTrailingZeros()));
2079 case ICmpInst::ICMP_ULT:
2080 if (Op0Max.ult(Op1Min)) // A <u B -> true if max(A) < min(B)
2081 return ReplaceInstUsesWith(I, ConstantInt::getTrue(I.getType()));
2082 if (Op0Min.uge(Op1Max)) // A <u B -> false if min(A) >= max(B)
2083 return ReplaceInstUsesWith(I, ConstantInt::getFalse(I.getType()));
2084 if (Op1Min == Op0Max) // A <u B -> A != B if max(A) == min(B)
2085 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
2086 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
2087 if (Op1Max == Op0Min+1) // A <u C -> A == C-1 if min(A)+1 == C
2088 return new ICmpInst(ICmpInst::ICMP_EQ, Op0,
2089 ConstantInt::get(CI->getContext(), CI->getValue()-1));
2091 // (x <u 2147483648) -> (x >s -1) -> true if sign bit clear
2092 if (CI->isMinValue(true))
2093 return new ICmpInst(ICmpInst::ICMP_SGT, Op0,
2094 Constant::getAllOnesValue(Op0->getType()));
2097 case ICmpInst::ICMP_UGT:
2098 if (Op0Min.ugt(Op1Max)) // A >u B -> true if min(A) > max(B)
2099 return ReplaceInstUsesWith(I, ConstantInt::getTrue(I.getType()));
2100 if (Op0Max.ule(Op1Min)) // A >u B -> false if max(A) <= max(B)
2101 return ReplaceInstUsesWith(I, ConstantInt::getFalse(I.getType()));
2103 if (Op1Max == Op0Min) // A >u B -> A != B if min(A) == max(B)
2104 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
2105 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
2106 if (Op1Min == Op0Max-1) // A >u C -> A == C+1 if max(a)-1 == C
2107 return new ICmpInst(ICmpInst::ICMP_EQ, Op0,
2108 ConstantInt::get(CI->getContext(), CI->getValue()+1));
2110 // (x >u 2147483647) -> (x <s 0) -> true if sign bit set
2111 if (CI->isMaxValue(true))
2112 return new ICmpInst(ICmpInst::ICMP_SLT, Op0,
2113 Constant::getNullValue(Op0->getType()));
2116 case ICmpInst::ICMP_SLT:
2117 if (Op0Max.slt(Op1Min)) // A <s B -> true if max(A) < min(C)
2118 return ReplaceInstUsesWith(I, ConstantInt::getTrue(I.getType()));
2119 if (Op0Min.sge(Op1Max)) // A <s B -> false if min(A) >= max(C)
2120 return ReplaceInstUsesWith(I, ConstantInt::getFalse(I.getType()));
2121 if (Op1Min == Op0Max) // A <s B -> A != B if max(A) == min(B)
2122 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
2123 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
2124 if (Op1Max == Op0Min+1) // A <s C -> A == C-1 if min(A)+1 == C
2125 return new ICmpInst(ICmpInst::ICMP_EQ, Op0,
2126 ConstantInt::get(CI->getContext(), CI->getValue()-1));
2129 case ICmpInst::ICMP_SGT:
2130 if (Op0Min.sgt(Op1Max)) // A >s B -> true if min(A) > max(B)
2131 return ReplaceInstUsesWith(I, ConstantInt::getTrue(I.getType()));
2132 if (Op0Max.sle(Op1Min)) // A >s B -> false if max(A) <= min(B)
2133 return ReplaceInstUsesWith(I, ConstantInt::getFalse(I.getType()));
2135 if (Op1Max == Op0Min) // A >s B -> A != B if min(A) == max(B)
2136 return new ICmpInst(ICmpInst::ICMP_NE, Op0, Op1);
2137 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
2138 if (Op1Min == Op0Max-1) // A >s C -> A == C+1 if max(A)-1 == C
2139 return new ICmpInst(ICmpInst::ICMP_EQ, Op0,
2140 ConstantInt::get(CI->getContext(), CI->getValue()+1));
2143 case ICmpInst::ICMP_SGE:
2144 assert(!isa<ConstantInt>(Op1) && "ICMP_SGE with ConstantInt not folded!");
2145 if (Op0Min.sge(Op1Max)) // A >=s B -> true if min(A) >= max(B)
2146 return ReplaceInstUsesWith(I, ConstantInt::getTrue(I.getType()));
2147 if (Op0Max.slt(Op1Min)) // A >=s B -> false if max(A) < min(B)
2148 return ReplaceInstUsesWith(I, ConstantInt::getFalse(I.getType()));
2150 case ICmpInst::ICMP_SLE:
2151 assert(!isa<ConstantInt>(Op1) && "ICMP_SLE with ConstantInt not folded!");
2152 if (Op0Max.sle(Op1Min)) // A <=s B -> true if max(A) <= min(B)
2153 return ReplaceInstUsesWith(I, ConstantInt::getTrue(I.getType()));
2154 if (Op0Min.sgt(Op1Max)) // A <=s B -> false if min(A) > max(B)
2155 return ReplaceInstUsesWith(I, ConstantInt::getFalse(I.getType()));
2157 case ICmpInst::ICMP_UGE:
2158 assert(!isa<ConstantInt>(Op1) && "ICMP_UGE with ConstantInt not folded!");
2159 if (Op0Min.uge(Op1Max)) // A >=u B -> true if min(A) >= max(B)
2160 return ReplaceInstUsesWith(I, ConstantInt::getTrue(I.getType()));
2161 if (Op0Max.ult(Op1Min)) // A >=u B -> false if max(A) < min(B)
2162 return ReplaceInstUsesWith(I, ConstantInt::getFalse(I.getType()));
2164 case ICmpInst::ICMP_ULE:
2165 assert(!isa<ConstantInt>(Op1) && "ICMP_ULE with ConstantInt not folded!");
2166 if (Op0Max.ule(Op1Min)) // A <=u B -> true if max(A) <= min(B)
2167 return ReplaceInstUsesWith(I, ConstantInt::getTrue(I.getType()));
2168 if (Op0Min.ugt(Op1Max)) // A <=u B -> false if min(A) > max(B)
2169 return ReplaceInstUsesWith(I, ConstantInt::getFalse(I.getType()));
2173 // Turn a signed comparison into an unsigned one if both operands
2174 // are known to have the same sign.
2176 ((Op0KnownZero.isNegative() && Op1KnownZero.isNegative()) ||
2177 (Op0KnownOne.isNegative() && Op1KnownOne.isNegative())))
2178 return new ICmpInst(I.getUnsignedPredicate(), Op0, Op1);
2181 // Test if the ICmpInst instruction is used exclusively by a select as
2182 // part of a minimum or maximum operation. If so, refrain from doing
2183 // any other folding. This helps out other analyses which understand
2184 // non-obfuscated minimum and maximum idioms, such as ScalarEvolution
2185 // and CodeGen. And in this case, at least one of the comparison
2186 // operands has at least one user besides the compare (the select),
2187 // which would often largely negate the benefit of folding anyway.
2189 if (SelectInst *SI = dyn_cast<SelectInst>(*I.use_begin()))
2190 if ((SI->getOperand(1) == Op0 && SI->getOperand(2) == Op1) ||
2191 (SI->getOperand(2) == Op0 && SI->getOperand(1) == Op1))
2194 // See if we are doing a comparison between a constant and an instruction that
2195 // can be folded into the comparison.
2196 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
2197 // Since the RHS is a ConstantInt (CI), if the left hand side is an
2198 // instruction, see if that instruction also has constants so that the
2199 // instruction can be folded into the icmp
2200 if (Instruction *LHSI = dyn_cast<Instruction>(Op0))
2201 if (Instruction *Res = visitICmpInstWithInstAndIntCst(I, LHSI, CI))
2205 // Handle icmp with constant (but not simple integer constant) RHS
2206 if (Constant *RHSC = dyn_cast<Constant>(Op1)) {
2207 if (Instruction *LHSI = dyn_cast<Instruction>(Op0))
2208 switch (LHSI->getOpcode()) {
2209 case Instruction::GetElementPtr:
2210 // icmp pred GEP (P, int 0, int 0, int 0), null -> icmp pred P, null
2211 if (RHSC->isNullValue() &&
2212 cast<GetElementPtrInst>(LHSI)->hasAllZeroIndices())
2213 return new ICmpInst(I.getPredicate(), LHSI->getOperand(0),
2214 Constant::getNullValue(LHSI->getOperand(0)->getType()));
2216 case Instruction::PHI:
2217 // Only fold icmp into the PHI if the phi and icmp are in the same
2218 // block. If in the same block, we're encouraging jump threading. If
2219 // not, we are just pessimizing the code by making an i1 phi.
2220 if (LHSI->getParent() == I.getParent())
2221 if (Instruction *NV = FoldOpIntoPhi(I))
2224 case Instruction::Select: {
2225 // If either operand of the select is a constant, we can fold the
2226 // comparison into the select arms, which will cause one to be
2227 // constant folded and the select turned into a bitwise or.
2228 Value *Op1 = 0, *Op2 = 0;
2229 if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(1)))
2230 Op1 = ConstantExpr::getICmp(I.getPredicate(), C, RHSC);
2231 if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(2)))
2232 Op2 = ConstantExpr::getICmp(I.getPredicate(), C, RHSC);
2234 // We only want to perform this transformation if it will not lead to
2235 // additional code. This is true if either both sides of the select
2236 // fold to a constant (in which case the icmp is replaced with a select
2237 // which will usually simplify) or this is the only user of the
2238 // select (in which case we are trading a select+icmp for a simpler
2240 if ((Op1 && Op2) || (LHSI->hasOneUse() && (Op1 || Op2))) {
2242 Op1 = Builder->CreateICmp(I.getPredicate(), LHSI->getOperand(1),
2245 Op2 = Builder->CreateICmp(I.getPredicate(), LHSI->getOperand(2),
2247 return SelectInst::Create(LHSI->getOperand(0), Op1, Op2);
2251 case Instruction::IntToPtr:
2252 // icmp pred inttoptr(X), null -> icmp pred X, 0
2253 if (RHSC->isNullValue() && TD &&
2254 TD->getIntPtrType(RHSC->getContext()) ==
2255 LHSI->getOperand(0)->getType())
2256 return new ICmpInst(I.getPredicate(), LHSI->getOperand(0),
2257 Constant::getNullValue(LHSI->getOperand(0)->getType()));
2260 case Instruction::Load:
2261 // Try to optimize things like "A[i] > 4" to index computations.
2262 if (GetElementPtrInst *GEP =
2263 dyn_cast<GetElementPtrInst>(LHSI->getOperand(0))) {
2264 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(GEP->getOperand(0)))
2265 if (GV->isConstant() && GV->hasDefinitiveInitializer() &&
2266 !cast<LoadInst>(LHSI)->isVolatile())
2267 if (Instruction *Res = FoldCmpLoadFromIndexedGlobal(GEP, GV, I))
2274 // If we can optimize a 'icmp GEP, P' or 'icmp P, GEP', do so now.
2275 if (GEPOperator *GEP = dyn_cast<GEPOperator>(Op0))
2276 if (Instruction *NI = FoldGEPICmp(GEP, Op1, I.getPredicate(), I))
2278 if (GEPOperator *GEP = dyn_cast<GEPOperator>(Op1))
2279 if (Instruction *NI = FoldGEPICmp(GEP, Op0,
2280 ICmpInst::getSwappedPredicate(I.getPredicate()), I))
2283 // Test to see if the operands of the icmp are casted versions of other
2284 // values. If the ptr->ptr cast can be stripped off both arguments, we do so
2286 if (BitCastInst *CI = dyn_cast<BitCastInst>(Op0)) {
2287 if (Op0->getType()->isPointerTy() &&
2288 (isa<Constant>(Op1) || isa<BitCastInst>(Op1))) {
2289 // We keep moving the cast from the left operand over to the right
2290 // operand, where it can often be eliminated completely.
2291 Op0 = CI->getOperand(0);
2293 // If operand #1 is a bitcast instruction, it must also be a ptr->ptr cast
2294 // so eliminate it as well.
2295 if (BitCastInst *CI2 = dyn_cast<BitCastInst>(Op1))
2296 Op1 = CI2->getOperand(0);
2298 // If Op1 is a constant, we can fold the cast into the constant.
2299 if (Op0->getType() != Op1->getType()) {
2300 if (Constant *Op1C = dyn_cast<Constant>(Op1)) {
2301 Op1 = ConstantExpr::getBitCast(Op1C, Op0->getType());
2303 // Otherwise, cast the RHS right before the icmp
2304 Op1 = Builder->CreateBitCast(Op1, Op0->getType());
2307 return new ICmpInst(I.getPredicate(), Op0, Op1);
2311 if (isa<CastInst>(Op0)) {
2312 // Handle the special case of: icmp (cast bool to X), <cst>
2313 // This comes up when you have code like
2316 // For generality, we handle any zero-extension of any operand comparison
2317 // with a constant or another cast from the same type.
2318 if (isa<Constant>(Op1) || isa<CastInst>(Op1))
2319 if (Instruction *R = visitICmpInstWithCastAndCast(I))
2323 // Special logic for binary operators.
2324 BinaryOperator *BO0 = dyn_cast<BinaryOperator>(Op0);
2325 BinaryOperator *BO1 = dyn_cast<BinaryOperator>(Op1);
2327 CmpInst::Predicate Pred = I.getPredicate();
2328 bool NoOp0WrapProblem = false, NoOp1WrapProblem = false;
2329 if (BO0 && isa<OverflowingBinaryOperator>(BO0))
2330 NoOp0WrapProblem = ICmpInst::isEquality(Pred) ||
2331 (CmpInst::isUnsigned(Pred) && BO0->hasNoUnsignedWrap()) ||
2332 (CmpInst::isSigned(Pred) && BO0->hasNoSignedWrap());
2333 if (BO1 && isa<OverflowingBinaryOperator>(BO1))
2334 NoOp1WrapProblem = ICmpInst::isEquality(Pred) ||
2335 (CmpInst::isUnsigned(Pred) && BO1->hasNoUnsignedWrap()) ||
2336 (CmpInst::isSigned(Pred) && BO1->hasNoSignedWrap());
2338 // Analyze the case when either Op0 or Op1 is an add instruction.
2339 // Op0 = A + B (or A and B are null); Op1 = C + D (or C and D are null).
2340 Value *A = 0, *B = 0, *C = 0, *D = 0;
2341 if (BO0 && BO0->getOpcode() == Instruction::Add)
2342 A = BO0->getOperand(0), B = BO0->getOperand(1);
2343 if (BO1 && BO1->getOpcode() == Instruction::Add)
2344 C = BO1->getOperand(0), D = BO1->getOperand(1);
2346 // icmp (X+Y), X -> icmp Y, 0 for equalities or if there is no overflow.
2347 if ((A == Op1 || B == Op1) && NoOp0WrapProblem)
2348 return new ICmpInst(Pred, A == Op1 ? B : A,
2349 Constant::getNullValue(Op1->getType()));
2351 // icmp X, (X+Y) -> icmp 0, Y for equalities or if there is no overflow.
2352 if ((C == Op0 || D == Op0) && NoOp1WrapProblem)
2353 return new ICmpInst(Pred, Constant::getNullValue(Op0->getType()),
2356 // icmp (X+Y), (X+Z) -> icmp Y, Z for equalities or if there is no overflow.
2357 if (A && C && (A == C || A == D || B == C || B == D) &&
2358 NoOp0WrapProblem && NoOp1WrapProblem &&
2359 // Try not to increase register pressure.
2360 BO0->hasOneUse() && BO1->hasOneUse()) {
2361 // Determine Y and Z in the form icmp (X+Y), (X+Z).
2362 Value *Y = (A == C || A == D) ? B : A;
2363 Value *Z = (C == A || C == B) ? D : C;
2364 return new ICmpInst(Pred, Y, Z);
2367 // Analyze the case when either Op0 or Op1 is a sub instruction.
2368 // Op0 = A - B (or A and B are null); Op1 = C - D (or C and D are null).
2369 A = 0; B = 0; C = 0; D = 0;
2370 if (BO0 && BO0->getOpcode() == Instruction::Sub)
2371 A = BO0->getOperand(0), B = BO0->getOperand(1);
2372 if (BO1 && BO1->getOpcode() == Instruction::Sub)
2373 C = BO1->getOperand(0), D = BO1->getOperand(1);
2375 // icmp (X-Y), X -> icmp 0, Y for equalities or if there is no overflow.
2376 if (A == Op1 && NoOp0WrapProblem)
2377 return new ICmpInst(Pred, Constant::getNullValue(Op1->getType()), B);
2379 // icmp X, (X-Y) -> icmp Y, 0 for equalities or if there is no overflow.
2380 if (C == Op0 && NoOp1WrapProblem)
2381 return new ICmpInst(Pred, D, Constant::getNullValue(Op0->getType()));
2383 // icmp (Y-X), (Z-X) -> icmp Y, Z for equalities or if there is no overflow.
2384 if (B && D && B == D && NoOp0WrapProblem && NoOp1WrapProblem &&
2385 // Try not to increase register pressure.
2386 BO0->hasOneUse() && BO1->hasOneUse())
2387 return new ICmpInst(Pred, A, C);
2389 // icmp (X-Y), (X-Z) -> icmp Z, Y for equalities or if there is no overflow.
2390 if (A && C && A == C && NoOp0WrapProblem && NoOp1WrapProblem &&
2391 // Try not to increase register pressure.
2392 BO0->hasOneUse() && BO1->hasOneUse())
2393 return new ICmpInst(Pred, D, B);
2395 BinaryOperator *SRem = NULL;
2396 // icmp (srem X, Y), Y
2397 if (BO0 && BO0->getOpcode() == Instruction::SRem &&
2398 Op1 == BO0->getOperand(1))
2400 // icmp Y, (srem X, Y)
2401 else if (BO1 && BO1->getOpcode() == Instruction::SRem &&
2402 Op0 == BO1->getOperand(1))
2405 // We don't check hasOneUse to avoid increasing register pressure because
2406 // the value we use is the same value this instruction was already using.
2407 switch (SRem == BO0 ? ICmpInst::getSwappedPredicate(Pred) : Pred) {
2409 case ICmpInst::ICMP_EQ:
2410 return ReplaceInstUsesWith(I, ConstantInt::getFalse(I.getType()));
2411 case ICmpInst::ICMP_NE:
2412 return ReplaceInstUsesWith(I, ConstantInt::getTrue(I.getType()));
2413 case ICmpInst::ICMP_SGT:
2414 case ICmpInst::ICMP_SGE:
2415 return new ICmpInst(ICmpInst::ICMP_SGT, SRem->getOperand(1),
2416 Constant::getAllOnesValue(SRem->getType()));
2417 case ICmpInst::ICMP_SLT:
2418 case ICmpInst::ICMP_SLE:
2419 return new ICmpInst(ICmpInst::ICMP_SLT, SRem->getOperand(1),
2420 Constant::getNullValue(SRem->getType()));
2424 if (BO0 && BO1 && BO0->getOpcode() == BO1->getOpcode() &&
2425 BO0->hasOneUse() && BO1->hasOneUse() &&
2426 BO0->getOperand(1) == BO1->getOperand(1)) {
2427 switch (BO0->getOpcode()) {
2429 case Instruction::Add:
2430 case Instruction::Sub:
2431 case Instruction::Xor:
2432 if (I.isEquality()) // a+x icmp eq/ne b+x --> a icmp b
2433 return new ICmpInst(I.getPredicate(), BO0->getOperand(0),
2434 BO1->getOperand(0));
2435 // icmp u/s (a ^ signbit), (b ^ signbit) --> icmp s/u a, b
2436 if (ConstantInt *CI = dyn_cast<ConstantInt>(BO0->getOperand(1))) {
2437 if (CI->getValue().isSignBit()) {
2438 ICmpInst::Predicate Pred = I.isSigned()
2439 ? I.getUnsignedPredicate()
2440 : I.getSignedPredicate();
2441 return new ICmpInst(Pred, BO0->getOperand(0),
2442 BO1->getOperand(0));
2445 if (CI->isMaxValue(true)) {
2446 ICmpInst::Predicate Pred = I.isSigned()
2447 ? I.getUnsignedPredicate()
2448 : I.getSignedPredicate();
2449 Pred = I.getSwappedPredicate(Pred);
2450 return new ICmpInst(Pred, BO0->getOperand(0),
2451 BO1->getOperand(0));
2455 case Instruction::Mul:
2456 if (!I.isEquality())
2459 if (ConstantInt *CI = dyn_cast<ConstantInt>(BO0->getOperand(1))) {
2460 // a * Cst icmp eq/ne b * Cst --> a & Mask icmp b & Mask
2461 // Mask = -1 >> count-trailing-zeros(Cst).
2462 if (!CI->isZero() && !CI->isOne()) {
2463 const APInt &AP = CI->getValue();
2464 ConstantInt *Mask = ConstantInt::get(I.getContext(),
2465 APInt::getLowBitsSet(AP.getBitWidth(),
2467 AP.countTrailingZeros()));
2468 Value *And1 = Builder->CreateAnd(BO0->getOperand(0), Mask);
2469 Value *And2 = Builder->CreateAnd(BO1->getOperand(0), Mask);
2470 return new ICmpInst(I.getPredicate(), And1, And2);
2474 case Instruction::UDiv:
2475 case Instruction::LShr:
2479 case Instruction::SDiv:
2480 case Instruction::AShr:
2481 if (!BO0->isExact() || !BO1->isExact())
2483 return new ICmpInst(I.getPredicate(), BO0->getOperand(0),
2484 BO1->getOperand(0));
2485 case Instruction::Shl: {
2486 bool NUW = BO0->hasNoUnsignedWrap() && BO1->hasNoUnsignedWrap();
2487 bool NSW = BO0->hasNoSignedWrap() && BO1->hasNoSignedWrap();
2490 if (!NSW && I.isSigned())
2492 return new ICmpInst(I.getPredicate(), BO0->getOperand(0),
2493 BO1->getOperand(0));
2500 // ~x < ~y --> y < x
2501 // ~x < cst --> ~cst < x
2502 if (match(Op0, m_Not(m_Value(A)))) {
2503 if (match(Op1, m_Not(m_Value(B))))
2504 return new ICmpInst(I.getPredicate(), B, A);
2505 if (ConstantInt *RHSC = dyn_cast<ConstantInt>(Op1))
2506 return new ICmpInst(I.getPredicate(), ConstantExpr::getNot(RHSC), A);
2509 // (a+b) <u a --> llvm.uadd.with.overflow.
2510 // (a+b) <u b --> llvm.uadd.with.overflow.
2511 if (I.getPredicate() == ICmpInst::ICMP_ULT &&
2512 match(Op0, m_Add(m_Value(A), m_Value(B))) &&
2513 (Op1 == A || Op1 == B))
2514 if (Instruction *R = ProcessUAddIdiom(I, Op0, *this))
2517 // a >u (a+b) --> llvm.uadd.with.overflow.
2518 // b >u (a+b) --> llvm.uadd.with.overflow.
2519 if (I.getPredicate() == ICmpInst::ICMP_UGT &&
2520 match(Op1, m_Add(m_Value(A), m_Value(B))) &&
2521 (Op0 == A || Op0 == B))
2522 if (Instruction *R = ProcessUAddIdiom(I, Op1, *this))
2526 if (I.isEquality()) {
2527 Value *A, *B, *C, *D;
2529 if (match(Op0, m_Xor(m_Value(A), m_Value(B)))) {
2530 if (A == Op1 || B == Op1) { // (A^B) == A -> B == 0
2531 Value *OtherVal = A == Op1 ? B : A;
2532 return new ICmpInst(I.getPredicate(), OtherVal,
2533 Constant::getNullValue(A->getType()));
2536 if (match(Op1, m_Xor(m_Value(C), m_Value(D)))) {
2537 // A^c1 == C^c2 --> A == C^(c1^c2)
2538 ConstantInt *C1, *C2;
2539 if (match(B, m_ConstantInt(C1)) &&
2540 match(D, m_ConstantInt(C2)) && Op1->hasOneUse()) {
2541 Constant *NC = ConstantInt::get(I.getContext(),
2542 C1->getValue() ^ C2->getValue());
2543 Value *Xor = Builder->CreateXor(C, NC);
2544 return new ICmpInst(I.getPredicate(), A, Xor);
2547 // A^B == A^D -> B == D
2548 if (A == C) return new ICmpInst(I.getPredicate(), B, D);
2549 if (A == D) return new ICmpInst(I.getPredicate(), B, C);
2550 if (B == C) return new ICmpInst(I.getPredicate(), A, D);
2551 if (B == D) return new ICmpInst(I.getPredicate(), A, C);
2555 if (match(Op1, m_Xor(m_Value(A), m_Value(B))) &&
2556 (A == Op0 || B == Op0)) {
2557 // A == (A^B) -> B == 0
2558 Value *OtherVal = A == Op0 ? B : A;
2559 return new ICmpInst(I.getPredicate(), OtherVal,
2560 Constant::getNullValue(A->getType()));
2563 // (X&Z) == (Y&Z) -> (X^Y) & Z == 0
2564 if (match(Op0, m_OneUse(m_And(m_Value(A), m_Value(B)))) &&
2565 match(Op1, m_OneUse(m_And(m_Value(C), m_Value(D))))) {
2566 Value *X = 0, *Y = 0, *Z = 0;
2569 X = B; Y = D; Z = A;
2570 } else if (A == D) {
2571 X = B; Y = C; Z = A;
2572 } else if (B == C) {
2573 X = A; Y = D; Z = B;
2574 } else if (B == D) {
2575 X = A; Y = C; Z = B;
2578 if (X) { // Build (X^Y) & Z
2579 Op1 = Builder->CreateXor(X, Y);
2580 Op1 = Builder->CreateAnd(Op1, Z);
2581 I.setOperand(0, Op1);
2582 I.setOperand(1, Constant::getNullValue(Op1->getType()));
2587 // Transform (zext A) == (B & (1<<X)-1) --> A == (trunc B)
2588 // and (B & (1<<X)-1) == (zext A) --> A == (trunc B)
2590 if ((Op0->hasOneUse() &&
2591 match(Op0, m_ZExt(m_Value(A))) &&
2592 match(Op1, m_And(m_Value(B), m_ConstantInt(Cst1)))) ||
2593 (Op1->hasOneUse() &&
2594 match(Op0, m_And(m_Value(B), m_ConstantInt(Cst1))) &&
2595 match(Op1, m_ZExt(m_Value(A))))) {
2596 APInt Pow2 = Cst1->getValue() + 1;
2597 if (Pow2.isPowerOf2() && isa<IntegerType>(A->getType()) &&
2598 Pow2.logBase2() == cast<IntegerType>(A->getType())->getBitWidth())
2599 return new ICmpInst(I.getPredicate(), A,
2600 Builder->CreateTrunc(B, A->getType()));
2603 // Transform "icmp eq (trunc (lshr(X, cst1)), cst" to
2604 // "icmp (and X, mask), cst"
2606 if (Op0->hasOneUse() &&
2607 match(Op0, m_Trunc(m_OneUse(m_LShr(m_Value(A),
2608 m_ConstantInt(ShAmt))))) &&
2609 match(Op1, m_ConstantInt(Cst1)) &&
2610 // Only do this when A has multiple uses. This is most important to do
2611 // when it exposes other optimizations.
2613 unsigned ASize =cast<IntegerType>(A->getType())->getPrimitiveSizeInBits();
2615 if (ShAmt < ASize) {
2617 APInt::getLowBitsSet(ASize, Op0->getType()->getPrimitiveSizeInBits());
2620 APInt CmpV = Cst1->getValue().zext(ASize);
2623 Value *Mask = Builder->CreateAnd(A, Builder->getInt(MaskV));
2624 return new ICmpInst(I.getPredicate(), Mask, Builder->getInt(CmpV));
2630 Value *X; ConstantInt *Cst;
2632 if (match(Op0, m_Add(m_Value(X), m_ConstantInt(Cst))) && Op1 == X)
2633 return FoldICmpAddOpCst(I, X, Cst, I.getPredicate(), Op0);
2636 if (match(Op1, m_Add(m_Value(X), m_ConstantInt(Cst))) && Op0 == X)
2637 return FoldICmpAddOpCst(I, X, Cst, I.getSwappedPredicate(), Op1);
2639 return Changed ? &I : 0;
2647 /// FoldFCmp_IntToFP_Cst - Fold fcmp ([us]itofp x, cst) if possible.
2649 Instruction *InstCombiner::FoldFCmp_IntToFP_Cst(FCmpInst &I,
2652 if (!isa<ConstantFP>(RHSC)) return 0;
2653 const APFloat &RHS = cast<ConstantFP>(RHSC)->getValueAPF();
2655 // Get the width of the mantissa. We don't want to hack on conversions that
2656 // might lose information from the integer, e.g. "i64 -> float"
2657 int MantissaWidth = LHSI->getType()->getFPMantissaWidth();
2658 if (MantissaWidth == -1) return 0; // Unknown.
2660 // Check to see that the input is converted from an integer type that is small
2661 // enough that preserves all bits. TODO: check here for "known" sign bits.
2662 // This would allow us to handle (fptosi (x >>s 62) to float) if x is i64 f.e.
2663 unsigned InputSize = LHSI->getOperand(0)->getType()->getScalarSizeInBits();
2665 // If this is a uitofp instruction, we need an extra bit to hold the sign.
2666 bool LHSUnsigned = isa<UIToFPInst>(LHSI);
2670 // If the conversion would lose info, don't hack on this.
2671 if ((int)InputSize > MantissaWidth)
2674 // Otherwise, we can potentially simplify the comparison. We know that it
2675 // will always come through as an integer value and we know the constant is
2676 // not a NAN (it would have been previously simplified).
2677 assert(!RHS.isNaN() && "NaN comparison not already folded!");
2679 ICmpInst::Predicate Pred;
2680 switch (I.getPredicate()) {
2681 default: llvm_unreachable("Unexpected predicate!");
2682 case FCmpInst::FCMP_UEQ:
2683 case FCmpInst::FCMP_OEQ:
2684 Pred = ICmpInst::ICMP_EQ;
2686 case FCmpInst::FCMP_UGT:
2687 case FCmpInst::FCMP_OGT:
2688 Pred = LHSUnsigned ? ICmpInst::ICMP_UGT : ICmpInst::ICMP_SGT;
2690 case FCmpInst::FCMP_UGE:
2691 case FCmpInst::FCMP_OGE:
2692 Pred = LHSUnsigned ? ICmpInst::ICMP_UGE : ICmpInst::ICMP_SGE;
2694 case FCmpInst::FCMP_ULT:
2695 case FCmpInst::FCMP_OLT:
2696 Pred = LHSUnsigned ? ICmpInst::ICMP_ULT : ICmpInst::ICMP_SLT;
2698 case FCmpInst::FCMP_ULE:
2699 case FCmpInst::FCMP_OLE:
2700 Pred = LHSUnsigned ? ICmpInst::ICMP_ULE : ICmpInst::ICMP_SLE;
2702 case FCmpInst::FCMP_UNE:
2703 case FCmpInst::FCMP_ONE:
2704 Pred = ICmpInst::ICMP_NE;
2706 case FCmpInst::FCMP_ORD:
2707 return ReplaceInstUsesWith(I, ConstantInt::getTrue(I.getContext()));
2708 case FCmpInst::FCMP_UNO:
2709 return ReplaceInstUsesWith(I, ConstantInt::getFalse(I.getContext()));
2712 IntegerType *IntTy = cast<IntegerType>(LHSI->getOperand(0)->getType());
2714 // Now we know that the APFloat is a normal number, zero or inf.
2716 // See if the FP constant is too large for the integer. For example,
2717 // comparing an i8 to 300.0.
2718 unsigned IntWidth = IntTy->getScalarSizeInBits();
2721 // If the RHS value is > SignedMax, fold the comparison. This handles +INF
2722 // and large values.
2723 APFloat SMax(RHS.getSemantics(), APFloat::fcZero, false);
2724 SMax.convertFromAPInt(APInt::getSignedMaxValue(IntWidth), true,
2725 APFloat::rmNearestTiesToEven);
2726 if (SMax.compare(RHS) == APFloat::cmpLessThan) { // smax < 13123.0
2727 if (Pred == ICmpInst::ICMP_NE || Pred == ICmpInst::ICMP_SLT ||
2728 Pred == ICmpInst::ICMP_SLE)
2729 return ReplaceInstUsesWith(I, ConstantInt::getTrue(I.getContext()));
2730 return ReplaceInstUsesWith(I, ConstantInt::getFalse(I.getContext()));
2733 // If the RHS value is > UnsignedMax, fold the comparison. This handles
2734 // +INF and large values.
2735 APFloat UMax(RHS.getSemantics(), APFloat::fcZero, false);
2736 UMax.convertFromAPInt(APInt::getMaxValue(IntWidth), false,
2737 APFloat::rmNearestTiesToEven);
2738 if (UMax.compare(RHS) == APFloat::cmpLessThan) { // umax < 13123.0
2739 if (Pred == ICmpInst::ICMP_NE || Pred == ICmpInst::ICMP_ULT ||
2740 Pred == ICmpInst::ICMP_ULE)
2741 return ReplaceInstUsesWith(I, ConstantInt::getTrue(I.getContext()));
2742 return ReplaceInstUsesWith(I, ConstantInt::getFalse(I.getContext()));
2747 // See if the RHS value is < SignedMin.
2748 APFloat SMin(RHS.getSemantics(), APFloat::fcZero, false);
2749 SMin.convertFromAPInt(APInt::getSignedMinValue(IntWidth), true,
2750 APFloat::rmNearestTiesToEven);
2751 if (SMin.compare(RHS) == APFloat::cmpGreaterThan) { // smin > 12312.0
2752 if (Pred == ICmpInst::ICMP_NE || Pred == ICmpInst::ICMP_SGT ||
2753 Pred == ICmpInst::ICMP_SGE)
2754 return ReplaceInstUsesWith(I, ConstantInt::getTrue(I.getContext()));
2755 return ReplaceInstUsesWith(I, ConstantInt::getFalse(I.getContext()));
2758 // See if the RHS value is < UnsignedMin.
2759 APFloat SMin(RHS.getSemantics(), APFloat::fcZero, false);
2760 SMin.convertFromAPInt(APInt::getMinValue(IntWidth), true,
2761 APFloat::rmNearestTiesToEven);
2762 if (SMin.compare(RHS) == APFloat::cmpGreaterThan) { // umin > 12312.0
2763 if (Pred == ICmpInst::ICMP_NE || Pred == ICmpInst::ICMP_UGT ||
2764 Pred == ICmpInst::ICMP_UGE)
2765 return ReplaceInstUsesWith(I, ConstantInt::getTrue(I.getContext()));
2766 return ReplaceInstUsesWith(I, ConstantInt::getFalse(I.getContext()));
2770 // Okay, now we know that the FP constant fits in the range [SMIN, SMAX] or
2771 // [0, UMAX], but it may still be fractional. See if it is fractional by
2772 // casting the FP value to the integer value and back, checking for equality.
2773 // Don't do this for zero, because -0.0 is not fractional.
2774 Constant *RHSInt = LHSUnsigned
2775 ? ConstantExpr::getFPToUI(RHSC, IntTy)
2776 : ConstantExpr::getFPToSI(RHSC, IntTy);
2777 if (!RHS.isZero()) {
2778 bool Equal = LHSUnsigned
2779 ? ConstantExpr::getUIToFP(RHSInt, RHSC->getType()) == RHSC
2780 : ConstantExpr::getSIToFP(RHSInt, RHSC->getType()) == RHSC;
2782 // If we had a comparison against a fractional value, we have to adjust
2783 // the compare predicate and sometimes the value. RHSC is rounded towards
2784 // zero at this point.
2786 default: llvm_unreachable("Unexpected integer comparison!");
2787 case ICmpInst::ICMP_NE: // (float)int != 4.4 --> true
2788 return ReplaceInstUsesWith(I, ConstantInt::getTrue(I.getContext()));
2789 case ICmpInst::ICMP_EQ: // (float)int == 4.4 --> false
2790 return ReplaceInstUsesWith(I, ConstantInt::getFalse(I.getContext()));
2791 case ICmpInst::ICMP_ULE:
2792 // (float)int <= 4.4 --> int <= 4
2793 // (float)int <= -4.4 --> false
2794 if (RHS.isNegative())
2795 return ReplaceInstUsesWith(I, ConstantInt::getFalse(I.getContext()));
2797 case ICmpInst::ICMP_SLE:
2798 // (float)int <= 4.4 --> int <= 4
2799 // (float)int <= -4.4 --> int < -4
2800 if (RHS.isNegative())
2801 Pred = ICmpInst::ICMP_SLT;
2803 case ICmpInst::ICMP_ULT:
2804 // (float)int < -4.4 --> false
2805 // (float)int < 4.4 --> int <= 4
2806 if (RHS.isNegative())
2807 return ReplaceInstUsesWith(I, ConstantInt::getFalse(I.getContext()));
2808 Pred = ICmpInst::ICMP_ULE;
2810 case ICmpInst::ICMP_SLT:
2811 // (float)int < -4.4 --> int < -4
2812 // (float)int < 4.4 --> int <= 4
2813 if (!RHS.isNegative())
2814 Pred = ICmpInst::ICMP_SLE;
2816 case ICmpInst::ICMP_UGT:
2817 // (float)int > 4.4 --> int > 4
2818 // (float)int > -4.4 --> true
2819 if (RHS.isNegative())
2820 return ReplaceInstUsesWith(I, ConstantInt::getTrue(I.getContext()));
2822 case ICmpInst::ICMP_SGT:
2823 // (float)int > 4.4 --> int > 4
2824 // (float)int > -4.4 --> int >= -4
2825 if (RHS.isNegative())
2826 Pred = ICmpInst::ICMP_SGE;
2828 case ICmpInst::ICMP_UGE:
2829 // (float)int >= -4.4 --> true
2830 // (float)int >= 4.4 --> int > 4
2831 if (RHS.isNegative())
2832 return ReplaceInstUsesWith(I, ConstantInt::getTrue(I.getContext()));
2833 Pred = ICmpInst::ICMP_UGT;
2835 case ICmpInst::ICMP_SGE:
2836 // (float)int >= -4.4 --> int >= -4
2837 // (float)int >= 4.4 --> int > 4
2838 if (!RHS.isNegative())
2839 Pred = ICmpInst::ICMP_SGT;
2845 // Lower this FP comparison into an appropriate integer version of the
2847 return new ICmpInst(Pred, LHSI->getOperand(0), RHSInt);
2850 Instruction *InstCombiner::visitFCmpInst(FCmpInst &I) {
2851 bool Changed = false;
2853 /// Orders the operands of the compare so that they are listed from most
2854 /// complex to least complex. This puts constants before unary operators,
2855 /// before binary operators.
2856 if (getComplexity(I.getOperand(0)) < getComplexity(I.getOperand(1))) {
2861 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2863 if (Value *V = SimplifyFCmpInst(I.getPredicate(), Op0, Op1, TD))
2864 return ReplaceInstUsesWith(I, V);
2866 // Simplify 'fcmp pred X, X'
2868 switch (I.getPredicate()) {
2869 default: llvm_unreachable("Unknown predicate!");
2870 case FCmpInst::FCMP_UNO: // True if unordered: isnan(X) | isnan(Y)
2871 case FCmpInst::FCMP_ULT: // True if unordered or less than
2872 case FCmpInst::FCMP_UGT: // True if unordered or greater than
2873 case FCmpInst::FCMP_UNE: // True if unordered or not equal
2874 // Canonicalize these to be 'fcmp uno %X, 0.0'.
2875 I.setPredicate(FCmpInst::FCMP_UNO);
2876 I.setOperand(1, Constant::getNullValue(Op0->getType()));
2879 case FCmpInst::FCMP_ORD: // True if ordered (no nans)
2880 case FCmpInst::FCMP_OEQ: // True if ordered and equal
2881 case FCmpInst::FCMP_OGE: // True if ordered and greater than or equal
2882 case FCmpInst::FCMP_OLE: // True if ordered and less than or equal
2883 // Canonicalize these to be 'fcmp ord %X, 0.0'.
2884 I.setPredicate(FCmpInst::FCMP_ORD);
2885 I.setOperand(1, Constant::getNullValue(Op0->getType()));
2890 // Handle fcmp with constant RHS
2891 if (Constant *RHSC = dyn_cast<Constant>(Op1)) {
2892 if (Instruction *LHSI = dyn_cast<Instruction>(Op0))
2893 switch (LHSI->getOpcode()) {
2894 case Instruction::FPExt: {
2895 // fcmp (fpext x), C -> fcmp x, (fptrunc C) if fptrunc is lossless
2896 FPExtInst *LHSExt = cast<FPExtInst>(LHSI);
2897 ConstantFP *RHSF = dyn_cast<ConstantFP>(RHSC);
2901 // We can't convert a PPC double double.
2902 if (RHSF->getType()->isPPC_FP128Ty())
2905 const fltSemantics *Sem;
2906 // FIXME: This shouldn't be here.
2907 if (LHSExt->getSrcTy()->isHalfTy())
2908 Sem = &APFloat::IEEEhalf;
2909 else if (LHSExt->getSrcTy()->isFloatTy())
2910 Sem = &APFloat::IEEEsingle;
2911 else if (LHSExt->getSrcTy()->isDoubleTy())
2912 Sem = &APFloat::IEEEdouble;
2913 else if (LHSExt->getSrcTy()->isFP128Ty())
2914 Sem = &APFloat::IEEEquad;
2915 else if (LHSExt->getSrcTy()->isX86_FP80Ty())
2916 Sem = &APFloat::x87DoubleExtended;
2921 APFloat F = RHSF->getValueAPF();
2922 F.convert(*Sem, APFloat::rmNearestTiesToEven, &Lossy);
2924 // Avoid lossy conversions and denormals. Zero is a special case
2925 // that's OK to convert.
2929 ((Fabs.compare(APFloat::getSmallestNormalized(*Sem)) !=
2930 APFloat::cmpLessThan) || Fabs.isZero()))
2932 return new FCmpInst(I.getPredicate(), LHSExt->getOperand(0),
2933 ConstantFP::get(RHSC->getContext(), F));
2936 case Instruction::PHI:
2937 // Only fold fcmp into the PHI if the phi and fcmp are in the same
2938 // block. If in the same block, we're encouraging jump threading. If
2939 // not, we are just pessimizing the code by making an i1 phi.
2940 if (LHSI->getParent() == I.getParent())
2941 if (Instruction *NV = FoldOpIntoPhi(I))
2944 case Instruction::SIToFP:
2945 case Instruction::UIToFP:
2946 if (Instruction *NV = FoldFCmp_IntToFP_Cst(I, LHSI, RHSC))
2949 case Instruction::Select: {
2950 // If either operand of the select is a constant, we can fold the
2951 // comparison into the select arms, which will cause one to be
2952 // constant folded and the select turned into a bitwise or.
2953 Value *Op1 = 0, *Op2 = 0;
2954 if (LHSI->hasOneUse()) {
2955 if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(1))) {
2956 // Fold the known value into the constant operand.
2957 Op1 = ConstantExpr::getCompare(I.getPredicate(), C, RHSC);
2958 // Insert a new FCmp of the other select operand.
2959 Op2 = Builder->CreateFCmp(I.getPredicate(),
2960 LHSI->getOperand(2), RHSC, I.getName());
2961 } else if (Constant *C = dyn_cast<Constant>(LHSI->getOperand(2))) {
2962 // Fold the known value into the constant operand.
2963 Op2 = ConstantExpr::getCompare(I.getPredicate(), C, RHSC);
2964 // Insert a new FCmp of the other select operand.
2965 Op1 = Builder->CreateFCmp(I.getPredicate(), LHSI->getOperand(1),
2971 return SelectInst::Create(LHSI->getOperand(0), Op1, Op2);
2974 case Instruction::FSub: {
2975 // fcmp pred (fneg x), C -> fcmp swap(pred) x, -C
2977 if (match(LHSI, m_FNeg(m_Value(Op))))
2978 return new FCmpInst(I.getSwappedPredicate(), Op,
2979 ConstantExpr::getFNeg(RHSC));
2982 case Instruction::Load:
2983 if (GetElementPtrInst *GEP =
2984 dyn_cast<GetElementPtrInst>(LHSI->getOperand(0))) {
2985 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(GEP->getOperand(0)))
2986 if (GV->isConstant() && GV->hasDefinitiveInitializer() &&
2987 !cast<LoadInst>(LHSI)->isVolatile())
2988 if (Instruction *Res = FoldCmpLoadFromIndexedGlobal(GEP, GV, I))
2992 case Instruction::Call: {
2993 CallInst *CI = cast<CallInst>(LHSI);
2995 // Various optimization for fabs compared with zero.
2996 if (RHSC->isNullValue() && CI->getCalledFunction() &&
2997 TLI->getLibFunc(CI->getCalledFunction()->getName(), Func) &&
2999 if (Func == LibFunc::fabs || Func == LibFunc::fabsf ||
3000 Func == LibFunc::fabsl) {
3001 switch (I.getPredicate()) {
3003 // fabs(x) < 0 --> false
3004 case FCmpInst::FCMP_OLT:
3005 return ReplaceInstUsesWith(I, Builder->getFalse());
3006 // fabs(x) > 0 --> x != 0
3007 case FCmpInst::FCMP_OGT:
3008 return new FCmpInst(FCmpInst::FCMP_ONE, CI->getArgOperand(0),
3010 // fabs(x) <= 0 --> x == 0
3011 case FCmpInst::FCMP_OLE:
3012 return new FCmpInst(FCmpInst::FCMP_OEQ, CI->getArgOperand(0),
3014 // fabs(x) >= 0 --> !isnan(x)
3015 case FCmpInst::FCMP_OGE:
3016 return new FCmpInst(FCmpInst::FCMP_ORD, CI->getArgOperand(0),
3018 // fabs(x) == 0 --> x == 0
3019 // fabs(x) != 0 --> x != 0
3020 case FCmpInst::FCMP_OEQ:
3021 case FCmpInst::FCMP_UEQ:
3022 case FCmpInst::FCMP_ONE:
3023 case FCmpInst::FCMP_UNE:
3024 return new FCmpInst(I.getPredicate(), CI->getArgOperand(0),
3033 // fcmp pred (fneg x), (fneg y) -> fcmp swap(pred) x, y
3035 if (match(Op0, m_FNeg(m_Value(X))) && match(Op1, m_FNeg(m_Value(Y))))
3036 return new FCmpInst(I.getSwappedPredicate(), X, Y);
3038 // fcmp (fpext x), (fpext y) -> fcmp x, y
3039 if (FPExtInst *LHSExt = dyn_cast<FPExtInst>(Op0))
3040 if (FPExtInst *RHSExt = dyn_cast<FPExtInst>(Op1))
3041 if (LHSExt->getSrcTy() == RHSExt->getSrcTy())
3042 return new FCmpInst(I.getPredicate(), LHSExt->getOperand(0),
3043 RHSExt->getOperand(0));
3045 return Changed ? &I : 0;