2002-09-01 23:53:36 +00:00
|
|
|
//===-- ConstantRange.cpp - ConstantRange implementation ------------------===//
|
2005-04-21 23:48:37 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:36:04 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-21 23:48:37 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-09-01 23:53:36 +00:00
|
|
|
//
|
|
|
|
// Represent a range of possible values that may occur when the program is run
|
|
|
|
// for an integral value. This keeps track of a lower and upper bound for the
|
|
|
|
// constant, which MAY wrap around the end of the numeric range. To do this, it
|
|
|
|
// keeps track of a [lower, upper) bound, which specifies an interval just like
|
|
|
|
// STL iterators. When used with boolean values, the following are important
|
|
|
|
// ranges (other integral ranges use min/max values for special range values):
|
|
|
|
//
|
|
|
|
// [F, F) = {} = Empty set
|
|
|
|
// [T, F) = {T}
|
|
|
|
// [F, T) = {F}
|
|
|
|
// [T, T) = {F, T} = Full set
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2015-10-22 03:12:57 +00:00
|
|
|
#include "llvm/IR/Instruction.h"
|
2013-01-02 11:36:10 +00:00
|
|
|
#include "llvm/IR/InstrTypes.h"
|
2015-10-22 03:12:57 +00:00
|
|
|
#include "llvm/IR/Operator.h"
|
2014-03-04 12:24:34 +00:00
|
|
|
#include "llvm/IR/ConstantRange.h"
|
2010-01-05 01:28:32 +00:00
|
|
|
#include "llvm/Support/Debug.h"
|
2008-08-23 22:23:09 +00:00
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2003-12-14 21:35:53 +00:00
|
|
|
using namespace llvm;
|
2003-11-11 22:41:34 +00:00
|
|
|
|
2009-07-09 23:16:10 +00:00
|
|
|
ConstantRange::ConstantRange(uint32_t BitWidth, bool Full) {
|
2002-09-01 23:53:36 +00:00
|
|
|
if (Full)
|
2007-02-28 17:36:23 +00:00
|
|
|
Lower = Upper = APInt::getMaxValue(BitWidth);
|
2002-09-01 23:53:36 +00:00
|
|
|
else
|
2007-02-28 17:36:23 +00:00
|
|
|
Lower = Upper = APInt::getMinValue(BitWidth);
|
2002-09-01 23:53:36 +00:00
|
|
|
}
|
|
|
|
|
2017-04-13 00:20:31 +00:00
|
|
|
ConstantRange::ConstantRange(APInt V)
|
2014-03-02 04:08:41 +00:00
|
|
|
: Lower(std::move(V)), Upper(Lower + 1) {}
|
2002-09-01 23:53:36 +00:00
|
|
|
|
2017-04-13 00:20:31 +00:00
|
|
|
ConstantRange::ConstantRange(APInt L, APInt U)
|
2014-03-02 04:08:41 +00:00
|
|
|
: Lower(std::move(L)), Upper(std::move(U)) {
|
2013-07-11 15:37:27 +00:00
|
|
|
assert(Lower.getBitWidth() == Upper.getBitWidth() &&
|
2009-07-09 23:16:10 +00:00
|
|
|
"ConstantRange with unequal bit widths");
|
2013-07-11 15:37:27 +00:00
|
|
|
assert((Lower != Upper || (Lower.isMaxValue() || Lower.isMinValue())) &&
|
2007-02-28 17:36:23 +00:00
|
|
|
"Lower == Upper, but they aren't min or max value!");
|
|
|
|
}
|
|
|
|
|
2015-03-18 00:41:24 +00:00
|
|
|
ConstantRange ConstantRange::makeAllowedICmpRegion(CmpInst::Predicate Pred,
|
|
|
|
const ConstantRange &CR) {
|
2010-09-28 18:18:36 +00:00
|
|
|
if (CR.isEmptySet())
|
|
|
|
return CR;
|
|
|
|
|
2009-07-11 06:15:39 +00:00
|
|
|
uint32_t W = CR.getBitWidth();
|
|
|
|
switch (Pred) {
|
2015-03-18 00:41:24 +00:00
|
|
|
default:
|
|
|
|
llvm_unreachable("Invalid ICmp predicate to makeAllowedICmpRegion()");
|
2016-06-19 17:20:27 +00:00
|
|
|
case CmpInst::ICMP_EQ:
|
|
|
|
return CR;
|
|
|
|
case CmpInst::ICMP_NE:
|
|
|
|
if (CR.isSingleElement())
|
|
|
|
return ConstantRange(CR.getUpper(), CR.getLower());
|
|
|
|
return ConstantRange(W);
|
|
|
|
case CmpInst::ICMP_ULT: {
|
|
|
|
APInt UMax(CR.getUnsignedMax());
|
|
|
|
if (UMax.isMinValue())
|
|
|
|
return ConstantRange(W, /* empty */ false);
|
|
|
|
return ConstantRange(APInt::getMinValue(W), UMax);
|
|
|
|
}
|
|
|
|
case CmpInst::ICMP_SLT: {
|
|
|
|
APInt SMax(CR.getSignedMax());
|
|
|
|
if (SMax.isMinSignedValue())
|
|
|
|
return ConstantRange(W, /* empty */ false);
|
|
|
|
return ConstantRange(APInt::getSignedMinValue(W), SMax);
|
|
|
|
}
|
|
|
|
case CmpInst::ICMP_ULE: {
|
|
|
|
APInt UMax(CR.getUnsignedMax());
|
|
|
|
if (UMax.isMaxValue())
|
|
|
|
return ConstantRange(W);
|
|
|
|
return ConstantRange(APInt::getMinValue(W), UMax + 1);
|
|
|
|
}
|
|
|
|
case CmpInst::ICMP_SLE: {
|
|
|
|
APInt SMax(CR.getSignedMax());
|
|
|
|
if (SMax.isMaxSignedValue())
|
|
|
|
return ConstantRange(W);
|
|
|
|
return ConstantRange(APInt::getSignedMinValue(W), SMax + 1);
|
|
|
|
}
|
|
|
|
case CmpInst::ICMP_UGT: {
|
|
|
|
APInt UMin(CR.getUnsignedMin());
|
|
|
|
if (UMin.isMaxValue())
|
|
|
|
return ConstantRange(W, /* empty */ false);
|
|
|
|
return ConstantRange(UMin + 1, APInt::getNullValue(W));
|
|
|
|
}
|
|
|
|
case CmpInst::ICMP_SGT: {
|
|
|
|
APInt SMin(CR.getSignedMin());
|
|
|
|
if (SMin.isMaxSignedValue())
|
|
|
|
return ConstantRange(W, /* empty */ false);
|
|
|
|
return ConstantRange(SMin + 1, APInt::getSignedMinValue(W));
|
|
|
|
}
|
|
|
|
case CmpInst::ICMP_UGE: {
|
|
|
|
APInt UMin(CR.getUnsignedMin());
|
|
|
|
if (UMin.isMinValue())
|
2009-07-11 06:15:39 +00:00
|
|
|
return ConstantRange(W);
|
2016-06-19 17:20:27 +00:00
|
|
|
return ConstantRange(UMin, APInt::getNullValue(W));
|
|
|
|
}
|
|
|
|
case CmpInst::ICMP_SGE: {
|
|
|
|
APInt SMin(CR.getSignedMin());
|
|
|
|
if (SMin.isMinSignedValue())
|
|
|
|
return ConstantRange(W);
|
|
|
|
return ConstantRange(SMin, APInt::getSignedMinValue(W));
|
|
|
|
}
|
2009-07-11 06:15:39 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-03-18 00:41:24 +00:00
|
|
|
ConstantRange ConstantRange::makeSatisfyingICmpRegion(CmpInst::Predicate Pred,
|
|
|
|
const ConstantRange &CR) {
|
|
|
|
// Follows from De-Morgan's laws:
|
|
|
|
//
|
|
|
|
// ~(~A union ~B) == A intersect B.
|
|
|
|
//
|
|
|
|
return makeAllowedICmpRegion(CmpInst::getInversePredicate(Pred), CR)
|
|
|
|
.inverse();
|
|
|
|
}
|
|
|
|
|
2016-05-04 21:32:14 +00:00
|
|
|
ConstantRange ConstantRange::makeExactICmpRegion(CmpInst::Predicate Pred,
|
|
|
|
const APInt &C) {
|
|
|
|
// Computes the exact range that is equal to both the constant ranges returned
|
|
|
|
// by makeAllowedICmpRegion and makeSatisfyingICmpRegion. This is always true
|
|
|
|
// when RHS is a singleton such as an APInt and so the assert is valid.
|
|
|
|
// However for non-singleton RHS, for example ult [2,5) makeAllowedICmpRegion
|
|
|
|
// returns [0,4) but makeSatisfyICmpRegion returns [0,2).
|
|
|
|
//
|
|
|
|
assert(makeAllowedICmpRegion(Pred, C) == makeSatisfyingICmpRegion(Pred, C));
|
|
|
|
return makeAllowedICmpRegion(Pred, C);
|
|
|
|
}
|
|
|
|
|
2016-05-19 03:53:06 +00:00
|
|
|
bool ConstantRange::getEquivalentICmp(CmpInst::Predicate &Pred,
|
|
|
|
APInt &RHS) const {
|
|
|
|
bool Success = false;
|
|
|
|
|
|
|
|
if (isFullSet() || isEmptySet()) {
|
|
|
|
Pred = isEmptySet() ? CmpInst::ICMP_ULT : CmpInst::ICMP_UGE;
|
|
|
|
RHS = APInt(getBitWidth(), 0);
|
|
|
|
Success = true;
|
2016-10-02 20:59:05 +00:00
|
|
|
} else if (auto *OnlyElt = getSingleElement()) {
|
|
|
|
Pred = CmpInst::ICMP_EQ;
|
|
|
|
RHS = *OnlyElt;
|
|
|
|
Success = true;
|
|
|
|
} else if (auto *OnlyMissingElt = getSingleMissingElement()) {
|
|
|
|
Pred = CmpInst::ICMP_NE;
|
|
|
|
RHS = *OnlyMissingElt;
|
|
|
|
Success = true;
|
2016-05-19 03:53:06 +00:00
|
|
|
} else if (getLower().isMinSignedValue() || getLower().isMinValue()) {
|
|
|
|
Pred =
|
|
|
|
getLower().isMinSignedValue() ? CmpInst::ICMP_SLT : CmpInst::ICMP_ULT;
|
|
|
|
RHS = getUpper();
|
|
|
|
Success = true;
|
|
|
|
} else if (getUpper().isMinSignedValue() || getUpper().isMinValue()) {
|
|
|
|
Pred =
|
|
|
|
getUpper().isMinSignedValue() ? CmpInst::ICMP_SGE : CmpInst::ICMP_UGE;
|
|
|
|
RHS = getLower();
|
|
|
|
Success = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
assert((!Success || ConstantRange::makeExactICmpRegion(Pred, RHS) == *this) &&
|
|
|
|
"Bad result!");
|
|
|
|
|
|
|
|
return Success;
|
|
|
|
}
|
|
|
|
|
2016-02-22 16:13:02 +00:00
|
|
|
ConstantRange
|
|
|
|
ConstantRange::makeGuaranteedNoWrapRegion(Instruction::BinaryOps BinOp,
|
2016-03-03 18:31:16 +00:00
|
|
|
const ConstantRange &Other,
|
|
|
|
unsigned NoWrapKind) {
|
2015-10-22 03:12:57 +00:00
|
|
|
typedef OverflowingBinaryOperator OBO;
|
|
|
|
|
|
|
|
// Computes the intersection of CR0 and CR1. It is different from
|
|
|
|
// intersectWith in that the ConstantRange returned will only contain elements
|
|
|
|
// in both CR0 and CR1 (i.e. SubsetIntersect(X, Y) is a *subset*, proper or
|
|
|
|
// not, of both X and Y).
|
|
|
|
auto SubsetIntersect =
|
|
|
|
[](const ConstantRange &CR0, const ConstantRange &CR1) {
|
|
|
|
return CR0.inverse().unionWith(CR1.inverse()).inverse();
|
|
|
|
};
|
|
|
|
|
|
|
|
assert(BinOp >= Instruction::BinaryOpsBegin &&
|
|
|
|
BinOp < Instruction::BinaryOpsEnd && "Binary operators only!");
|
|
|
|
|
|
|
|
assert((NoWrapKind == OBO::NoSignedWrap ||
|
|
|
|
NoWrapKind == OBO::NoUnsignedWrap ||
|
|
|
|
NoWrapKind == (OBO::NoUnsignedWrap | OBO::NoSignedWrap)) &&
|
|
|
|
"NoWrapKind invalid!");
|
|
|
|
|
2016-03-03 18:31:16 +00:00
|
|
|
unsigned BitWidth = Other.getBitWidth();
|
2015-10-22 03:12:57 +00:00
|
|
|
if (BinOp != Instruction::Add)
|
|
|
|
// Conservative answer: empty set
|
|
|
|
return ConstantRange(BitWidth, false);
|
|
|
|
|
2016-03-03 18:31:16 +00:00
|
|
|
if (auto *C = Other.getSingleElement())
|
|
|
|
if (C->isMinValue())
|
|
|
|
// Full set: nothing signed / unsigned wraps when added to 0.
|
|
|
|
return ConstantRange(BitWidth);
|
2015-10-22 03:12:57 +00:00
|
|
|
|
|
|
|
ConstantRange Result(BitWidth);
|
|
|
|
|
|
|
|
if (NoWrapKind & OBO::NoUnsignedWrap)
|
2016-03-03 18:31:16 +00:00
|
|
|
Result =
|
|
|
|
SubsetIntersect(Result, ConstantRange(APInt::getNullValue(BitWidth),
|
|
|
|
-Other.getUnsignedMax()));
|
2015-10-22 03:12:57 +00:00
|
|
|
|
|
|
|
if (NoWrapKind & OBO::NoSignedWrap) {
|
2016-03-03 18:31:16 +00:00
|
|
|
APInt SignedMin = Other.getSignedMin();
|
|
|
|
APInt SignedMax = Other.getSignedMax();
|
|
|
|
|
|
|
|
if (SignedMax.isStrictlyPositive())
|
2015-10-22 03:12:57 +00:00
|
|
|
Result = SubsetIntersect(
|
2016-03-03 18:31:16 +00:00
|
|
|
Result,
|
|
|
|
ConstantRange(APInt::getSignedMinValue(BitWidth),
|
|
|
|
APInt::getSignedMinValue(BitWidth) - SignedMax));
|
|
|
|
|
|
|
|
if (SignedMin.isNegative())
|
2015-10-22 03:12:57 +00:00
|
|
|
Result = SubsetIntersect(
|
2016-03-03 18:31:16 +00:00
|
|
|
Result, ConstantRange(APInt::getSignedMinValue(BitWidth) - SignedMin,
|
2015-10-22 03:12:57 +00:00
|
|
|
APInt::getSignedMinValue(BitWidth)));
|
|
|
|
}
|
|
|
|
|
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
|
2002-09-01 23:53:36 +00:00
|
|
|
bool ConstantRange::isFullSet() const {
|
2007-04-26 16:42:07 +00:00
|
|
|
return Lower == Upper && Lower.isMaxValue();
|
2002-09-01 23:53:36 +00:00
|
|
|
}
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2002-09-01 23:53:36 +00:00
|
|
|
bool ConstantRange::isEmptySet() const {
|
2007-04-26 16:42:07 +00:00
|
|
|
return Lower == Upper && Lower.isMinValue();
|
2002-09-01 23:53:36 +00:00
|
|
|
}
|
|
|
|
|
2007-03-01 07:54:15 +00:00
|
|
|
bool ConstantRange::isWrappedSet() const {
|
2007-02-28 17:36:23 +00:00
|
|
|
return Lower.ugt(Upper);
|
2002-09-01 23:53:36 +00:00
|
|
|
}
|
|
|
|
|
2010-09-06 23:52:49 +00:00
|
|
|
bool ConstantRange::isSignWrappedSet() const {
|
|
|
|
return contains(APInt::getSignedMaxValue(getBitWidth())) &&
|
|
|
|
contains(APInt::getSignedMinValue(getBitWidth()));
|
|
|
|
}
|
|
|
|
|
2007-02-28 17:36:23 +00:00
|
|
|
APInt ConstantRange::getSetSize() const {
|
2012-07-17 15:43:59 +00:00
|
|
|
if (isFullSet()) {
|
|
|
|
APInt Size(getBitWidth()+1, 0);
|
|
|
|
Size.setBit(getBitWidth());
|
|
|
|
return Size;
|
2002-09-01 23:53:36 +00:00
|
|
|
}
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2012-07-17 15:43:59 +00:00
|
|
|
// This is also correct for wrapped sets.
|
2012-07-16 18:08:12 +00:00
|
|
|
return (Upper - Lower).zext(getBitWidth()+1);
|
2002-09-01 23:53:36 +00:00
|
|
|
}
|
|
|
|
|
2017-03-20 06:33:07 +00:00
|
|
|
bool
|
|
|
|
ConstantRange::isSizeStrictlySmallerThanOf(const ConstantRange &Other) const {
|
|
|
|
assert(getBitWidth() == Other.getBitWidth());
|
|
|
|
if (isFullSet())
|
|
|
|
return false;
|
|
|
|
if (Other.isFullSet())
|
|
|
|
return true;
|
|
|
|
return (Upper - Lower).ult(Other.Upper - Other.Lower);
|
|
|
|
}
|
|
|
|
|
2007-03-10 15:54:12 +00:00
|
|
|
APInt ConstantRange::getUnsignedMax() const {
|
|
|
|
if (isFullSet() || isWrappedSet())
|
|
|
|
return APInt::getMaxValue(getBitWidth());
|
2012-01-03 20:33:00 +00:00
|
|
|
return getUpper() - 1;
|
2007-03-10 15:54:12 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
APInt ConstantRange::getUnsignedMin() const {
|
|
|
|
if (isFullSet() || (isWrappedSet() && getUpper() != 0))
|
|
|
|
return APInt::getMinValue(getBitWidth());
|
2012-01-03 20:33:00 +00:00
|
|
|
return getLower();
|
2007-03-10 15:54:12 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
APInt ConstantRange::getSignedMax() const {
|
2007-04-13 05:57:32 +00:00
|
|
|
APInt SignedMax(APInt::getSignedMaxValue(getBitWidth()));
|
2007-03-10 15:54:12 +00:00
|
|
|
if (!isWrappedSet()) {
|
2017-04-18 23:02:39 +00:00
|
|
|
APInt UpperMinusOne = getUpper() - 1;
|
|
|
|
if (getLower().sle(UpperMinusOne))
|
|
|
|
return UpperMinusOne;
|
|
|
|
return APInt::getSignedMaxValue(getBitWidth());
|
2007-03-10 15:54:12 +00:00
|
|
|
}
|
2012-01-03 20:33:00 +00:00
|
|
|
if (getLower().isNegative() == getUpper().isNegative())
|
2017-04-18 23:02:39 +00:00
|
|
|
return APInt::getSignedMaxValue(getBitWidth());
|
2012-01-03 20:33:00 +00:00
|
|
|
return getUpper() - 1;
|
2007-03-10 15:54:12 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
APInt ConstantRange::getSignedMin() const {
|
|
|
|
if (!isWrappedSet()) {
|
2007-06-09 04:20:33 +00:00
|
|
|
if (getLower().sle(getUpper() - 1))
|
2007-03-10 15:54:12 +00:00
|
|
|
return getLower();
|
2017-04-18 23:02:39 +00:00
|
|
|
return APInt::getSignedMinValue(getBitWidth());
|
2012-01-03 20:33:00 +00:00
|
|
|
}
|
|
|
|
if ((getUpper() - 1).slt(getLower())) {
|
2017-04-18 23:02:39 +00:00
|
|
|
if (!getUpper().isMinSignedValue())
|
|
|
|
return APInt::getSignedMinValue(getBitWidth());
|
2007-03-10 15:54:12 +00:00
|
|
|
}
|
2012-01-03 20:33:00 +00:00
|
|
|
return getLower();
|
2007-03-10 15:54:12 +00:00
|
|
|
}
|
|
|
|
|
2007-03-01 07:54:15 +00:00
|
|
|
bool ConstantRange::contains(const APInt &V) const {
|
|
|
|
if (Lower == Upper)
|
|
|
|
return isFullSet();
|
2004-03-30 00:20:08 +00:00
|
|
|
|
2007-03-01 07:54:15 +00:00
|
|
|
if (!isWrappedSet())
|
|
|
|
return Lower.ule(V) && V.ult(Upper);
|
2012-01-03 20:33:00 +00:00
|
|
|
return Lower.ule(V) || V.ult(Upper);
|
2004-03-30 00:20:08 +00:00
|
|
|
}
|
2002-09-01 23:53:36 +00:00
|
|
|
|
2009-07-11 06:15:39 +00:00
|
|
|
bool ConstantRange::contains(const ConstantRange &Other) const {
|
2010-08-11 22:04:36 +00:00
|
|
|
if (isFullSet() || Other.isEmptySet()) return true;
|
|
|
|
if (isEmptySet() || Other.isFullSet()) return false;
|
2009-07-11 06:15:39 +00:00
|
|
|
|
|
|
|
if (!isWrappedSet()) {
|
|
|
|
if (Other.isWrappedSet())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return Lower.ule(Other.getLower()) && Other.getUpper().ule(Upper);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!Other.isWrappedSet())
|
|
|
|
return Other.getUpper().ule(Upper) ||
|
|
|
|
Lower.ule(Other.getLower());
|
|
|
|
|
|
|
|
return Other.getUpper().ule(Upper) && Lower.ule(Other.getLower());
|
|
|
|
}
|
|
|
|
|
2007-02-28 19:57:34 +00:00
|
|
|
ConstantRange ConstantRange::subtract(const APInt &Val) const {
|
2007-02-28 22:02:48 +00:00
|
|
|
assert(Val.getBitWidth() == getBitWidth() && "Wrong bit width");
|
2004-03-30 00:20:08 +00:00
|
|
|
// If the set is empty or full, don't modify the endpoints.
|
2007-02-28 17:36:23 +00:00
|
|
|
if (Lower == Upper)
|
|
|
|
return *this;
|
|
|
|
return ConstantRange(Lower - Val, Upper - Val);
|
2004-03-30 00:20:08 +00:00
|
|
|
}
|
|
|
|
|
2012-06-28 16:10:13 +00:00
|
|
|
ConstantRange ConstantRange::difference(const ConstantRange &CR) const {
|
|
|
|
return intersectWith(CR.inverse());
|
|
|
|
}
|
|
|
|
|
2007-03-01 07:54:15 +00:00
|
|
|
ConstantRange ConstantRange::intersectWith(const ConstantRange &CR) const {
|
2007-07-14 02:51:34 +00:00
|
|
|
assert(getBitWidth() == CR.getBitWidth() &&
|
|
|
|
"ConstantRange types don't agree!");
|
|
|
|
|
|
|
|
// Handle common cases.
|
|
|
|
if ( isEmptySet() || CR.isFullSet()) return *this;
|
|
|
|
if (CR.isEmptySet() || isFullSet()) return CR;
|
|
|
|
|
|
|
|
if (!isWrappedSet() && CR.isWrappedSet())
|
2009-07-18 06:34:42 +00:00
|
|
|
return CR.intersectWith(*this);
|
2007-07-14 02:51:34 +00:00
|
|
|
|
|
|
|
if (!isWrappedSet() && !CR.isWrappedSet()) {
|
|
|
|
if (Lower.ult(CR.Lower)) {
|
|
|
|
if (Upper.ule(CR.Lower))
|
|
|
|
return ConstantRange(getBitWidth(), false);
|
|
|
|
|
|
|
|
if (Upper.ult(CR.Upper))
|
|
|
|
return ConstantRange(CR.Lower, Upper);
|
|
|
|
|
|
|
|
return CR;
|
2012-01-03 20:33:00 +00:00
|
|
|
}
|
|
|
|
if (Upper.ult(CR.Upper))
|
|
|
|
return *this;
|
2007-07-14 02:51:34 +00:00
|
|
|
|
2012-01-03 20:33:00 +00:00
|
|
|
if (Lower.ult(CR.Upper))
|
|
|
|
return ConstantRange(Lower, CR.Upper);
|
2007-07-14 02:51:34 +00:00
|
|
|
|
2012-01-03 20:33:00 +00:00
|
|
|
return ConstantRange(getBitWidth(), false);
|
2007-07-14 02:51:34 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (isWrappedSet() && !CR.isWrappedSet()) {
|
|
|
|
if (CR.Lower.ult(Upper)) {
|
|
|
|
if (CR.Upper.ult(Upper))
|
|
|
|
return CR;
|
|
|
|
|
2012-05-18 00:14:36 +00:00
|
|
|
if (CR.Upper.ule(Lower))
|
2007-07-14 02:51:34 +00:00
|
|
|
return ConstantRange(CR.Lower, Upper);
|
|
|
|
|
2017-03-20 06:33:07 +00:00
|
|
|
if (isSizeStrictlySmallerThanOf(CR))
|
2007-07-14 02:51:34 +00:00
|
|
|
return *this;
|
2012-01-03 20:33:00 +00:00
|
|
|
return CR;
|
|
|
|
}
|
|
|
|
if (CR.Lower.ult(Lower)) {
|
2007-07-14 02:51:34 +00:00
|
|
|
if (CR.Upper.ule(Lower))
|
|
|
|
return ConstantRange(getBitWidth(), false);
|
|
|
|
|
|
|
|
return ConstantRange(Lower, CR.Upper);
|
|
|
|
}
|
|
|
|
return CR;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (CR.Upper.ult(Upper)) {
|
|
|
|
if (CR.Lower.ult(Upper)) {
|
2017-03-20 06:33:07 +00:00
|
|
|
if (isSizeStrictlySmallerThanOf(CR))
|
2007-07-14 02:51:34 +00:00
|
|
|
return *this;
|
2012-01-03 20:33:00 +00:00
|
|
|
return CR;
|
2007-07-14 02:51:34 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (CR.Lower.ult(Lower))
|
|
|
|
return ConstantRange(Lower, CR.Upper);
|
|
|
|
|
|
|
|
return CR;
|
2012-01-03 20:33:00 +00:00
|
|
|
}
|
2012-06-28 00:59:33 +00:00
|
|
|
if (CR.Upper.ule(Lower)) {
|
2007-07-14 02:51:34 +00:00
|
|
|
if (CR.Lower.ult(Lower))
|
|
|
|
return *this;
|
|
|
|
|
|
|
|
return ConstantRange(CR.Lower, Upper);
|
|
|
|
}
|
2017-03-20 06:33:07 +00:00
|
|
|
if (isSizeStrictlySmallerThanOf(CR))
|
2007-07-14 02:51:34 +00:00
|
|
|
return *this;
|
2012-01-03 20:33:00 +00:00
|
|
|
return CR;
|
2007-07-14 02:51:34 +00:00
|
|
|
}
|
|
|
|
|
2007-03-01 07:54:15 +00:00
|
|
|
ConstantRange ConstantRange::unionWith(const ConstantRange &CR) const {
|
2007-02-28 22:02:48 +00:00
|
|
|
assert(getBitWidth() == CR.getBitWidth() &&
|
|
|
|
"ConstantRange types don't agree!");
|
2002-09-01 23:53:36 +00:00
|
|
|
|
2007-03-02 03:33:05 +00:00
|
|
|
if ( isFullSet() || CR.isEmptySet()) return *this;
|
|
|
|
if (CR.isFullSet() || isEmptySet()) return CR;
|
2002-09-01 23:53:36 +00:00
|
|
|
|
2007-04-01 03:47:44 +00:00
|
|
|
if (!isWrappedSet() && CR.isWrappedSet()) return CR.unionWith(*this);
|
|
|
|
|
|
|
|
if (!isWrappedSet() && !CR.isWrappedSet()) {
|
2009-07-19 03:44:35 +00:00
|
|
|
if (CR.Upper.ult(Lower) || Upper.ult(CR.Lower)) {
|
|
|
|
// If the two ranges are disjoint, find the smaller gap and bridge it.
|
|
|
|
APInt d1 = CR.Lower - Upper, d2 = Lower - CR.Upper;
|
|
|
|
if (d1.ult(d2))
|
|
|
|
return ConstantRange(Lower, CR.Upper);
|
2012-01-03 20:33:00 +00:00
|
|
|
return ConstantRange(CR.Lower, Upper);
|
2009-07-19 03:44:35 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
APInt L = Lower, U = Upper;
|
2007-04-01 03:47:44 +00:00
|
|
|
if (CR.Lower.ult(L))
|
|
|
|
L = CR.Lower;
|
2009-07-19 03:44:35 +00:00
|
|
|
if ((CR.Upper - 1).ugt(U - 1))
|
2007-04-01 03:47:44 +00:00
|
|
|
U = CR.Upper;
|
2009-07-19 03:44:35 +00:00
|
|
|
|
|
|
|
if (L == 0 && U == 0)
|
|
|
|
return ConstantRange(getBitWidth());
|
|
|
|
|
|
|
|
return ConstantRange(L, U);
|
2007-04-01 03:47:44 +00:00
|
|
|
}
|
|
|
|
|
2009-07-19 03:44:35 +00:00
|
|
|
if (!CR.isWrappedSet()) {
|
|
|
|
// ------U L----- and ------U L----- : this
|
|
|
|
// L--U L--U : CR
|
|
|
|
if (CR.Upper.ule(Upper) || CR.Lower.uge(Lower))
|
2007-04-01 03:47:44 +00:00
|
|
|
return *this;
|
|
|
|
|
2009-07-19 03:44:35 +00:00
|
|
|
// ------U L----- : this
|
|
|
|
// L---------U : CR
|
|
|
|
if (CR.Lower.ule(Upper) && Lower.ule(CR.Upper))
|
2007-04-01 03:47:44 +00:00
|
|
|
return ConstantRange(getBitWidth());
|
|
|
|
|
2009-07-19 03:44:35 +00:00
|
|
|
// ----U L---- : this
|
|
|
|
// L---U : CR
|
|
|
|
// <d1> <d2>
|
|
|
|
if (Upper.ule(CR.Lower) && CR.Upper.ule(Lower)) {
|
2007-04-01 03:47:44 +00:00
|
|
|
APInt d1 = CR.Lower - Upper, d2 = Lower - CR.Upper;
|
2009-07-19 03:44:35 +00:00
|
|
|
if (d1.ult(d2))
|
|
|
|
return ConstantRange(Lower, CR.Upper);
|
2012-01-03 20:33:00 +00:00
|
|
|
return ConstantRange(CR.Lower, Upper);
|
2007-04-01 03:47:44 +00:00
|
|
|
}
|
2007-03-02 03:33:05 +00:00
|
|
|
|
2009-07-19 03:44:35 +00:00
|
|
|
// ----U L----- : this
|
|
|
|
// L----U : CR
|
|
|
|
if (Upper.ult(CR.Lower) && Lower.ult(CR.Upper))
|
|
|
|
return ConstantRange(CR.Lower, Upper);
|
2007-04-01 03:47:44 +00:00
|
|
|
|
2009-07-19 03:44:35 +00:00
|
|
|
// ------U L---- : this
|
|
|
|
// L-----U : CR
|
2012-01-03 20:33:00 +00:00
|
|
|
assert(CR.Lower.ult(Upper) && CR.Upper.ult(Lower) &&
|
|
|
|
"ConstantRange::unionWith missed a case with one range wrapped");
|
|
|
|
return ConstantRange(Lower, CR.Upper);
|
2007-04-01 03:47:44 +00:00
|
|
|
}
|
|
|
|
|
2009-07-19 03:44:35 +00:00
|
|
|
// ------U L---- and ------U L---- : this
|
|
|
|
// -U L----------- and ------------U L : CR
|
|
|
|
if (CR.Lower.ule(Upper) || Lower.ule(CR.Upper))
|
|
|
|
return ConstantRange(getBitWidth());
|
2007-04-01 03:47:44 +00:00
|
|
|
|
2009-07-19 03:44:35 +00:00
|
|
|
APInt L = Lower, U = Upper;
|
|
|
|
if (CR.Upper.ugt(U))
|
|
|
|
U = CR.Upper;
|
|
|
|
if (CR.Lower.ult(L))
|
|
|
|
L = CR.Lower;
|
2007-03-02 03:33:05 +00:00
|
|
|
|
|
|
|
return ConstantRange(L, U);
|
2002-09-01 23:53:36 +00:00
|
|
|
}
|
2002-09-02 00:18:22 +00:00
|
|
|
|
2016-12-01 20:08:47 +00:00
|
|
|
ConstantRange ConstantRange::castOp(Instruction::CastOps CastOp,
|
|
|
|
uint32_t ResultBitWidth) const {
|
|
|
|
switch (CastOp) {
|
|
|
|
default:
|
|
|
|
llvm_unreachable("unsupported cast type");
|
|
|
|
case Instruction::Trunc:
|
|
|
|
return truncate(ResultBitWidth);
|
|
|
|
case Instruction::SExt:
|
|
|
|
return signExtend(ResultBitWidth);
|
|
|
|
case Instruction::ZExt:
|
|
|
|
return zeroExtend(ResultBitWidth);
|
|
|
|
case Instruction::BitCast:
|
|
|
|
return *this;
|
|
|
|
case Instruction::FPToUI:
|
|
|
|
case Instruction::FPToSI:
|
|
|
|
if (getBitWidth() == ResultBitWidth)
|
|
|
|
return *this;
|
|
|
|
else
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/true);
|
|
|
|
case Instruction::UIToFP: {
|
|
|
|
// TODO: use input range if available
|
|
|
|
auto BW = getBitWidth();
|
|
|
|
APInt Min = APInt::getMinValue(BW).zextOrSelf(ResultBitWidth);
|
|
|
|
APInt Max = APInt::getMaxValue(BW).zextOrSelf(ResultBitWidth);
|
|
|
|
return ConstantRange(Min, Max);
|
|
|
|
}
|
|
|
|
case Instruction::SIToFP: {
|
|
|
|
// TODO: use input range if available
|
|
|
|
auto BW = getBitWidth();
|
|
|
|
APInt SMin = APInt::getSignedMinValue(BW).sextOrSelf(ResultBitWidth);
|
|
|
|
APInt SMax = APInt::getSignedMaxValue(BW).sextOrSelf(ResultBitWidth);
|
|
|
|
return ConstantRange(SMin, SMax);
|
|
|
|
}
|
|
|
|
case Instruction::FPTrunc:
|
|
|
|
case Instruction::FPExt:
|
|
|
|
case Instruction::IntToPtr:
|
|
|
|
case Instruction::PtrToInt:
|
|
|
|
case Instruction::AddrSpaceCast:
|
|
|
|
// Conservatively return full set.
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/true);
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
2007-02-28 22:02:48 +00:00
|
|
|
ConstantRange ConstantRange::zeroExtend(uint32_t DstTySize) const {
|
2010-09-06 23:52:49 +00:00
|
|
|
if (isEmptySet()) return ConstantRange(DstTySize, /*isFullSet=*/false);
|
|
|
|
|
2007-02-28 22:02:48 +00:00
|
|
|
unsigned SrcTySize = getBitWidth();
|
2007-02-28 17:36:23 +00:00
|
|
|
assert(SrcTySize < DstTySize && "Not a value extension");
|
2012-07-23 20:33:29 +00:00
|
|
|
if (isFullSet() || isWrappedSet()) {
|
2010-09-06 23:52:49 +00:00
|
|
|
// Change into [0, 1 << src bit width)
|
2012-07-23 20:33:29 +00:00
|
|
|
APInt LowerExt(DstTySize, 0);
|
|
|
|
if (!Upper) // special case: [X, 0) -- not really wrapping around
|
|
|
|
LowerExt = Lower.zext(DstTySize);
|
2013-07-11 16:05:50 +00:00
|
|
|
return ConstantRange(LowerExt, APInt::getOneBitSet(DstTySize, SrcTySize));
|
2012-07-23 20:33:29 +00:00
|
|
|
}
|
2004-03-30 00:20:08 +00:00
|
|
|
|
2010-12-07 08:25:19 +00:00
|
|
|
return ConstantRange(Lower.zext(DstTySize), Upper.zext(DstTySize));
|
2007-04-07 15:41:33 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
ConstantRange ConstantRange::signExtend(uint32_t DstTySize) const {
|
2010-09-06 23:52:49 +00:00
|
|
|
if (isEmptySet()) return ConstantRange(DstTySize, /*isFullSet=*/false);
|
|
|
|
|
2007-04-07 15:41:33 +00:00
|
|
|
unsigned SrcTySize = getBitWidth();
|
|
|
|
assert(SrcTySize < DstTySize && "Not a value extension");
|
2013-10-30 15:36:50 +00:00
|
|
|
|
|
|
|
// special case: [X, INT_MIN) -- not really wrapping around
|
2013-10-31 19:53:53 +00:00
|
|
|
if (Upper.isMinSignedValue())
|
2013-10-30 15:36:50 +00:00
|
|
|
return ConstantRange(Lower.sext(DstTySize), Upper.zext(DstTySize));
|
|
|
|
|
2010-09-06 23:52:49 +00:00
|
|
|
if (isFullSet() || isSignWrappedSet()) {
|
2007-04-07 15:41:33 +00:00
|
|
|
return ConstantRange(APInt::getHighBitsSet(DstTySize,DstTySize-SrcTySize+1),
|
2009-07-13 04:17:23 +00:00
|
|
|
APInt::getLowBitsSet(DstTySize, SrcTySize-1) + 1);
|
2007-04-07 15:41:33 +00:00
|
|
|
}
|
|
|
|
|
2010-12-07 08:25:19 +00:00
|
|
|
return ConstantRange(Lower.sext(DstTySize), Upper.sext(DstTySize));
|
2004-03-30 00:20:08 +00:00
|
|
|
}
|
|
|
|
|
2007-02-28 22:02:48 +00:00
|
|
|
ConstantRange ConstantRange::truncate(uint32_t DstTySize) const {
|
2011-11-24 17:24:33 +00:00
|
|
|
assert(getBitWidth() > DstTySize && "Not a value truncation");
|
2012-07-19 16:27:45 +00:00
|
|
|
if (isEmptySet())
|
|
|
|
return ConstantRange(DstTySize, /*isFullSet=*/false);
|
|
|
|
if (isFullSet())
|
2010-08-11 22:04:36 +00:00
|
|
|
return ConstantRange(DstTySize, /*isFullSet=*/true);
|
2004-03-30 00:20:08 +00:00
|
|
|
|
2012-07-19 16:27:45 +00:00
|
|
|
APInt MaxValue = APInt::getMaxValue(DstTySize).zext(getBitWidth());
|
|
|
|
APInt MaxBitValue(getBitWidth(), 0);
|
|
|
|
MaxBitValue.setBit(DstTySize);
|
|
|
|
|
|
|
|
APInt LowerDiv(Lower), UpperDiv(Upper);
|
|
|
|
ConstantRange Union(DstTySize, /*isFullSet=*/false);
|
|
|
|
|
|
|
|
// Analyze wrapped sets in their two parts: [0, Upper) \/ [Lower, MaxValue]
|
|
|
|
// We use the non-wrapped set code to analyze the [Lower, MaxValue) part, and
|
|
|
|
// then we do the union with [MaxValue, Upper)
|
|
|
|
if (isWrappedSet()) {
|
2016-06-06 01:51:23 +00:00
|
|
|
// If Upper is greater than Max Value, it covers the whole truncated range.
|
2012-07-19 16:27:45 +00:00
|
|
|
if (Upper.uge(MaxValue))
|
|
|
|
return ConstantRange(DstTySize, /*isFullSet=*/true);
|
|
|
|
|
|
|
|
Union = ConstantRange(APInt::getMaxValue(DstTySize),Upper.trunc(DstTySize));
|
|
|
|
UpperDiv = APInt::getMaxValue(getBitWidth());
|
|
|
|
|
|
|
|
// Union covers the MaxValue case, so return if the remaining range is just
|
|
|
|
// MaxValue.
|
|
|
|
if (LowerDiv == UpperDiv)
|
|
|
|
return Union;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Chop off the most significant bits that are past the destination bitwidth.
|
|
|
|
if (LowerDiv.uge(MaxValue)) {
|
|
|
|
APInt Div(getBitWidth(), 0);
|
|
|
|
APInt::udivrem(LowerDiv, MaxBitValue, Div, LowerDiv);
|
|
|
|
UpperDiv = UpperDiv - MaxBitValue * Div;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (UpperDiv.ule(MaxValue))
|
|
|
|
return ConstantRange(LowerDiv.trunc(DstTySize),
|
|
|
|
UpperDiv.trunc(DstTySize)).unionWith(Union);
|
|
|
|
|
2016-06-06 01:51:23 +00:00
|
|
|
// The truncated value wraps around. Check if we can do better than fullset.
|
2012-07-19 16:27:45 +00:00
|
|
|
APInt UpperModulo = UpperDiv - MaxBitValue;
|
|
|
|
if (UpperModulo.ult(LowerDiv))
|
|
|
|
return ConstantRange(LowerDiv.trunc(DstTySize),
|
|
|
|
UpperModulo.trunc(DstTySize)).unionWith(Union);
|
|
|
|
|
|
|
|
return ConstantRange(DstTySize, /*isFullSet=*/true);
|
2004-03-30 00:20:08 +00:00
|
|
|
}
|
|
|
|
|
2009-11-09 15:36:28 +00:00
|
|
|
ConstantRange ConstantRange::zextOrTrunc(uint32_t DstTySize) const {
|
|
|
|
unsigned SrcTySize = getBitWidth();
|
|
|
|
if (SrcTySize > DstTySize)
|
|
|
|
return truncate(DstTySize);
|
2012-01-03 20:33:00 +00:00
|
|
|
if (SrcTySize < DstTySize)
|
2009-11-09 15:36:28 +00:00
|
|
|
return zeroExtend(DstTySize);
|
2012-01-03 20:33:00 +00:00
|
|
|
return *this;
|
2009-11-09 15:36:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
ConstantRange ConstantRange::sextOrTrunc(uint32_t DstTySize) const {
|
|
|
|
unsigned SrcTySize = getBitWidth();
|
|
|
|
if (SrcTySize > DstTySize)
|
|
|
|
return truncate(DstTySize);
|
2012-01-03 20:33:00 +00:00
|
|
|
if (SrcTySize < DstTySize)
|
2009-11-09 15:36:28 +00:00
|
|
|
return signExtend(DstTySize);
|
2012-01-03 20:33:00 +00:00
|
|
|
return *this;
|
2009-11-09 15:36:28 +00:00
|
|
|
}
|
|
|
|
|
2016-12-01 20:08:47 +00:00
|
|
|
ConstantRange ConstantRange::binaryOp(Instruction::BinaryOps BinOp,
|
|
|
|
const ConstantRange &Other) const {
|
|
|
|
assert(BinOp >= Instruction::BinaryOpsBegin &&
|
|
|
|
BinOp < Instruction::BinaryOpsEnd && "Binary operators only!");
|
|
|
|
|
|
|
|
switch (BinOp) {
|
|
|
|
case Instruction::Add:
|
|
|
|
return add(Other);
|
|
|
|
case Instruction::Sub:
|
|
|
|
return sub(Other);
|
|
|
|
case Instruction::Mul:
|
|
|
|
return multiply(Other);
|
|
|
|
case Instruction::UDiv:
|
|
|
|
return udiv(Other);
|
|
|
|
case Instruction::Shl:
|
|
|
|
return shl(Other);
|
|
|
|
case Instruction::LShr:
|
|
|
|
return lshr(Other);
|
|
|
|
case Instruction::And:
|
|
|
|
return binaryAnd(Other);
|
|
|
|
case Instruction::Or:
|
|
|
|
return binaryOr(Other);
|
|
|
|
// Note: floating point operations applied to abstract ranges are just
|
|
|
|
// ideal integer operations with a lossy representation
|
|
|
|
case Instruction::FAdd:
|
|
|
|
return add(Other);
|
|
|
|
case Instruction::FSub:
|
|
|
|
return sub(Other);
|
|
|
|
case Instruction::FMul:
|
|
|
|
return multiply(Other);
|
|
|
|
default:
|
|
|
|
// Conservatively return full set.
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/true);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-07-09 22:07:27 +00:00
|
|
|
ConstantRange
|
|
|
|
ConstantRange::add(const ConstantRange &Other) const {
|
|
|
|
if (isEmptySet() || Other.isEmptySet())
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/false);
|
2009-07-13 02:49:08 +00:00
|
|
|
if (isFullSet() || Other.isFullSet())
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/true);
|
2009-07-09 22:07:27 +00:00
|
|
|
|
|
|
|
APInt NewLower = getLower() + Other.getLower();
|
|
|
|
APInt NewUpper = getUpper() + Other.getUpper() - 1;
|
|
|
|
if (NewLower == NewUpper)
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/true);
|
|
|
|
|
|
|
|
ConstantRange X = ConstantRange(NewLower, NewUpper);
|
2017-03-20 06:33:07 +00:00
|
|
|
if (X.isSizeStrictlySmallerThanOf(*this) ||
|
|
|
|
X.isSizeStrictlySmallerThanOf(Other))
|
2009-07-09 22:07:27 +00:00
|
|
|
// We've wrapped, therefore, full set.
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/true);
|
|
|
|
return X;
|
|
|
|
}
|
|
|
|
|
2016-10-19 14:44:23 +00:00
|
|
|
ConstantRange ConstantRange::addWithNoSignedWrap(const APInt &Other) const {
|
|
|
|
// Calculate the subset of this range such that "X + Other" is
|
|
|
|
// guaranteed not to wrap (overflow) for all X in this subset.
|
|
|
|
// makeGuaranteedNoWrapRegion will produce an exact NSW range since we are
|
|
|
|
// passing a single element range.
|
|
|
|
auto NSWRange = ConstantRange::makeGuaranteedNoWrapRegion(BinaryOperator::Add,
|
|
|
|
ConstantRange(Other),
|
|
|
|
OverflowingBinaryOperator::NoSignedWrap);
|
|
|
|
auto NSWConstrainedRange = intersectWith(NSWRange);
|
|
|
|
|
|
|
|
return NSWConstrainedRange.add(ConstantRange(Other));
|
|
|
|
}
|
|
|
|
|
2010-08-11 22:04:36 +00:00
|
|
|
ConstantRange
|
|
|
|
ConstantRange::sub(const ConstantRange &Other) const {
|
|
|
|
if (isEmptySet() || Other.isEmptySet())
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/false);
|
|
|
|
if (isFullSet() || Other.isFullSet())
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/true);
|
|
|
|
|
2011-06-22 21:13:46 +00:00
|
|
|
APInt NewLower = getLower() - Other.getUpper() + 1;
|
|
|
|
APInt NewUpper = getUpper() - Other.getLower();
|
2010-08-11 22:04:36 +00:00
|
|
|
if (NewLower == NewUpper)
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/true);
|
|
|
|
|
|
|
|
ConstantRange X = ConstantRange(NewLower, NewUpper);
|
2017-03-20 06:33:07 +00:00
|
|
|
if (X.isSizeStrictlySmallerThanOf(*this) ||
|
|
|
|
X.isSizeStrictlySmallerThanOf(Other))
|
2010-08-11 22:04:36 +00:00
|
|
|
// We've wrapped, therefore, full set.
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/true);
|
|
|
|
return X;
|
|
|
|
}
|
|
|
|
|
2009-07-09 22:07:27 +00:00
|
|
|
ConstantRange
|
|
|
|
ConstantRange::multiply(const ConstantRange &Other) const {
|
2010-01-26 15:56:18 +00:00
|
|
|
// TODO: If either operand is a single element and the multiply is known to
|
|
|
|
// be non-wrapping, round the result min and max value to the appropriate
|
|
|
|
// multiple of that element. If wrapping is possible, at least adjust the
|
|
|
|
// range according to the greatest power-of-two factor of the single element.
|
2010-01-26 04:13:15 +00:00
|
|
|
|
2009-07-12 02:19:05 +00:00
|
|
|
if (isEmptySet() || Other.isEmptySet())
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/false);
|
2012-07-16 20:47:16 +00:00
|
|
|
|
2015-03-06 15:50:47 +00:00
|
|
|
// Multiplication is signedness-independent. However different ranges can be
|
|
|
|
// obtained depending on how the input ranges are treated. These different
|
|
|
|
// ranges are all conservatively correct, but one might be better than the
|
|
|
|
// other. We calculate two ranges; one treating the inputs as unsigned
|
|
|
|
// and the other signed, then return the smallest of these ranges.
|
|
|
|
|
|
|
|
// Unsigned range first.
|
2009-07-13 03:27:41 +00:00
|
|
|
APInt this_min = getUnsignedMin().zext(getBitWidth() * 2);
|
|
|
|
APInt this_max = getUnsignedMax().zext(getBitWidth() * 2);
|
|
|
|
APInt Other_min = Other.getUnsignedMin().zext(getBitWidth() * 2);
|
|
|
|
APInt Other_max = Other.getUnsignedMax().zext(getBitWidth() * 2);
|
2009-07-12 02:19:05 +00:00
|
|
|
|
2009-07-13 03:27:41 +00:00
|
|
|
ConstantRange Result_zext = ConstantRange(this_min * Other_min,
|
|
|
|
this_max * Other_max + 1);
|
2015-03-06 15:50:47 +00:00
|
|
|
ConstantRange UR = Result_zext.truncate(getBitWidth());
|
|
|
|
|
2016-05-27 17:06:50 +00:00
|
|
|
// If the unsigned range doesn't wrap, and isn't negative then it's a range
|
|
|
|
// from one positive number to another which is as good as we can generate.
|
|
|
|
// In this case, skip the extra work of generating signed ranges which aren't
|
|
|
|
// going to be better than this range.
|
|
|
|
if (!UR.isWrappedSet() && UR.getLower().isNonNegative())
|
|
|
|
return UR;
|
|
|
|
|
2015-03-06 15:50:47 +00:00
|
|
|
// Now the signed range. Because we could be dealing with negative numbers
|
|
|
|
// here, the lower bound is the smallest of the cartesian product of the
|
|
|
|
// lower and upper ranges; for example:
|
|
|
|
// [-1,4) * [-2,3) = min(-1*-2, -1*2, 3*-2, 3*2) = -6.
|
|
|
|
// Similarly for the upper bound, swapping min for max.
|
|
|
|
|
|
|
|
this_min = getSignedMin().sext(getBitWidth() * 2);
|
|
|
|
this_max = getSignedMax().sext(getBitWidth() * 2);
|
|
|
|
Other_min = Other.getSignedMin().sext(getBitWidth() * 2);
|
|
|
|
Other_max = Other.getSignedMax().sext(getBitWidth() * 2);
|
|
|
|
|
|
|
|
auto L = {this_min * Other_min, this_min * Other_max,
|
|
|
|
this_max * Other_min, this_max * Other_max};
|
|
|
|
auto Compare = [](const APInt &A, const APInt &B) { return A.slt(B); };
|
|
|
|
ConstantRange Result_sext(std::min(L, Compare), std::max(L, Compare) + 1);
|
|
|
|
ConstantRange SR = Result_sext.truncate(getBitWidth());
|
|
|
|
|
2017-03-20 06:33:07 +00:00
|
|
|
return UR.isSizeStrictlySmallerThanOf(SR) ? UR : SR;
|
2009-07-09 22:07:27 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
ConstantRange
|
|
|
|
ConstantRange::smax(const ConstantRange &Other) const {
|
2009-07-09 23:16:10 +00:00
|
|
|
// X smax Y is: range(smax(X_smin, Y_smin),
|
|
|
|
// smax(X_smax, Y_smax))
|
|
|
|
if (isEmptySet() || Other.isEmptySet())
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/false);
|
|
|
|
APInt NewL = APIntOps::smax(getSignedMin(), Other.getSignedMin());
|
|
|
|
APInt NewU = APIntOps::smax(getSignedMax(), Other.getSignedMax()) + 1;
|
|
|
|
if (NewU == NewL)
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/true);
|
|
|
|
return ConstantRange(NewL, NewU);
|
2009-07-09 22:07:27 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
ConstantRange
|
|
|
|
ConstantRange::umax(const ConstantRange &Other) const {
|
|
|
|
// X umax Y is: range(umax(X_umin, Y_umin),
|
|
|
|
// umax(X_umax, Y_umax))
|
|
|
|
if (isEmptySet() || Other.isEmptySet())
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/false);
|
|
|
|
APInt NewL = APIntOps::umax(getUnsignedMin(), Other.getUnsignedMin());
|
|
|
|
APInt NewU = APIntOps::umax(getUnsignedMax(), Other.getUnsignedMax()) + 1;
|
|
|
|
if (NewU == NewL)
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/true);
|
|
|
|
return ConstantRange(NewL, NewU);
|
|
|
|
}
|
|
|
|
|
2016-02-26 22:08:18 +00:00
|
|
|
ConstantRange
|
|
|
|
ConstantRange::smin(const ConstantRange &Other) const {
|
|
|
|
// X smin Y is: range(smin(X_smin, Y_smin),
|
|
|
|
// smin(X_smax, Y_smax))
|
|
|
|
if (isEmptySet() || Other.isEmptySet())
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/false);
|
|
|
|
APInt NewL = APIntOps::smin(getSignedMin(), Other.getSignedMin());
|
|
|
|
APInt NewU = APIntOps::smin(getSignedMax(), Other.getSignedMax()) + 1;
|
|
|
|
if (NewU == NewL)
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/true);
|
|
|
|
return ConstantRange(NewL, NewU);
|
|
|
|
}
|
|
|
|
|
|
|
|
ConstantRange
|
|
|
|
ConstantRange::umin(const ConstantRange &Other) const {
|
|
|
|
// X umin Y is: range(umin(X_umin, Y_umin),
|
|
|
|
// umin(X_umax, Y_umax))
|
|
|
|
if (isEmptySet() || Other.isEmptySet())
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/false);
|
|
|
|
APInt NewL = APIntOps::umin(getUnsignedMin(), Other.getUnsignedMin());
|
|
|
|
APInt NewU = APIntOps::umin(getUnsignedMax(), Other.getUnsignedMax()) + 1;
|
|
|
|
if (NewU == NewL)
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/true);
|
|
|
|
return ConstantRange(NewL, NewU);
|
|
|
|
}
|
|
|
|
|
2009-07-09 22:07:27 +00:00
|
|
|
ConstantRange
|
2009-07-12 05:18:18 +00:00
|
|
|
ConstantRange::udiv(const ConstantRange &RHS) const {
|
|
|
|
if (isEmptySet() || RHS.isEmptySet() || RHS.getUnsignedMax() == 0)
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/false);
|
|
|
|
if (RHS.isFullSet())
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/true);
|
|
|
|
|
|
|
|
APInt Lower = getUnsignedMin().udiv(RHS.getUnsignedMax());
|
|
|
|
|
|
|
|
APInt RHS_umin = RHS.getUnsignedMin();
|
|
|
|
if (RHS_umin == 0) {
|
|
|
|
// We want the lowest value in RHS excluding zero. Usually that would be 1
|
|
|
|
// except for a range in the form of [X, 1) in which case it would be X.
|
|
|
|
if (RHS.getUpper() == 1)
|
|
|
|
RHS_umin = RHS.getLower();
|
|
|
|
else
|
|
|
|
RHS_umin = APInt(getBitWidth(), 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
APInt Upper = getUnsignedMax().udiv(RHS_umin) + 1;
|
|
|
|
|
|
|
|
// If the LHS is Full and the RHS is a wrapped interval containing 1 then
|
|
|
|
// this could occur.
|
|
|
|
if (Lower == Upper)
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/true);
|
|
|
|
|
|
|
|
return ConstantRange(Lower, Upper);
|
2009-07-09 22:07:27 +00:00
|
|
|
}
|
|
|
|
|
2010-09-07 05:39:02 +00:00
|
|
|
ConstantRange
|
|
|
|
ConstantRange::binaryAnd(const ConstantRange &Other) const {
|
|
|
|
if (isEmptySet() || Other.isEmptySet())
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/false);
|
|
|
|
|
|
|
|
// TODO: replace this with something less conservative
|
|
|
|
|
|
|
|
APInt umin = APIntOps::umin(Other.getUnsignedMax(), getUnsignedMax());
|
|
|
|
if (umin.isAllOnesValue())
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/true);
|
|
|
|
return ConstantRange(APInt::getNullValue(getBitWidth()), umin + 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
ConstantRange
|
|
|
|
ConstantRange::binaryOr(const ConstantRange &Other) const {
|
|
|
|
if (isEmptySet() || Other.isEmptySet())
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/false);
|
|
|
|
|
|
|
|
// TODO: replace this with something less conservative
|
|
|
|
|
|
|
|
APInt umax = APIntOps::umax(getUnsignedMin(), Other.getUnsignedMin());
|
|
|
|
if (umax.isMinValue())
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/true);
|
|
|
|
return ConstantRange(umax, APInt::getNullValue(getBitWidth()));
|
|
|
|
}
|
|
|
|
|
2009-11-12 14:53:53 +00:00
|
|
|
ConstantRange
|
2010-08-11 22:04:36 +00:00
|
|
|
ConstantRange::shl(const ConstantRange &Other) const {
|
|
|
|
if (isEmptySet() || Other.isEmptySet())
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/false);
|
2009-11-12 14:53:53 +00:00
|
|
|
|
2010-08-11 22:04:36 +00:00
|
|
|
APInt min = getUnsignedMin().shl(Other.getUnsignedMin());
|
|
|
|
APInt max = getUnsignedMax().shl(Other.getUnsignedMax());
|
2009-11-12 14:53:53 +00:00
|
|
|
|
|
|
|
// there's no overflow!
|
2009-11-12 15:10:33 +00:00
|
|
|
APInt Zeros(getBitWidth(), getUnsignedMax().countLeadingZeros());
|
2010-08-11 22:04:36 +00:00
|
|
|
if (Zeros.ugt(Other.getUnsignedMax()))
|
|
|
|
return ConstantRange(min, max + 1);
|
2009-11-12 14:53:53 +00:00
|
|
|
|
|
|
|
// FIXME: implement the other tricky cases
|
2010-08-11 22:04:36 +00:00
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/true);
|
2009-11-12 14:53:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
ConstantRange
|
2010-08-11 22:04:36 +00:00
|
|
|
ConstantRange::lshr(const ConstantRange &Other) const {
|
|
|
|
if (isEmptySet() || Other.isEmptySet())
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/false);
|
2009-11-12 14:53:53 +00:00
|
|
|
|
2010-08-11 22:04:36 +00:00
|
|
|
APInt max = getUnsignedMax().lshr(Other.getUnsignedMin());
|
|
|
|
APInt min = getUnsignedMin().lshr(Other.getUnsignedMax());
|
|
|
|
if (min == max + 1)
|
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/true);
|
|
|
|
|
|
|
|
return ConstantRange(min, max + 1);
|
2009-11-12 14:53:53 +00:00
|
|
|
}
|
|
|
|
|
2010-08-07 05:47:46 +00:00
|
|
|
ConstantRange ConstantRange::inverse() const {
|
2012-01-03 20:33:00 +00:00
|
|
|
if (isFullSet())
|
2010-08-11 22:04:36 +00:00
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/false);
|
2012-01-03 20:33:00 +00:00
|
|
|
if (isEmptySet())
|
2010-08-11 22:04:36 +00:00
|
|
|
return ConstantRange(getBitWidth(), /*isFullSet=*/true);
|
2010-08-07 05:47:46 +00:00
|
|
|
return ConstantRange(Upper, Lower);
|
|
|
|
}
|
|
|
|
|
2009-07-09 23:16:10 +00:00
|
|
|
void ConstantRange::print(raw_ostream &OS) const {
|
2010-01-26 04:12:55 +00:00
|
|
|
if (isFullSet())
|
|
|
|
OS << "full-set";
|
|
|
|
else if (isEmptySet())
|
|
|
|
OS << "empty-set";
|
|
|
|
else
|
|
|
|
OS << "[" << Lower << "," << Upper << ")";
|
2009-07-09 22:07:27 +00:00
|
|
|
}
|
|
|
|
|
2017-01-28 02:02:38 +00:00
|
|
|
#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
|
2016-01-29 20:50:44 +00:00
|
|
|
LLVM_DUMP_METHOD void ConstantRange::dump() const {
|
2010-01-05 01:28:32 +00:00
|
|
|
print(dbgs());
|
2009-07-09 22:07:27 +00:00
|
|
|
}
|
2017-01-28 02:02:38 +00:00
|
|
|
#endif
|
2016-10-21 19:59:26 +00:00
|
|
|
|
|
|
|
ConstantRange llvm::getConstantRangeFromMetadata(const MDNode &Ranges) {
|
|
|
|
const unsigned NumRanges = Ranges.getNumOperands() / 2;
|
|
|
|
assert(NumRanges >= 1 && "Must have at least one range!");
|
|
|
|
assert(Ranges.getNumOperands() % 2 == 0 && "Must be a sequence of pairs");
|
|
|
|
|
|
|
|
auto *FirstLow = mdconst::extract<ConstantInt>(Ranges.getOperand(0));
|
|
|
|
auto *FirstHigh = mdconst::extract<ConstantInt>(Ranges.getOperand(1));
|
|
|
|
|
|
|
|
ConstantRange CR(FirstLow->getValue(), FirstHigh->getValue());
|
|
|
|
|
|
|
|
for (unsigned i = 1; i < NumRanges; ++i) {
|
|
|
|
auto *Low = mdconst::extract<ConstantInt>(Ranges.getOperand(2 * i + 0));
|
|
|
|
auto *High = mdconst::extract<ConstantInt>(Ranges.getOperand(2 * i + 1));
|
|
|
|
|
|
|
|
// Note: unionWith will potentially create a range that contains values not
|
|
|
|
// contained in any of the original N ranges.
|
|
|
|
CR = CR.unionWith(ConstantRange(Low->getValue(), High->getValue()));
|
|
|
|
}
|
|
|
|
|
|
|
|
return CR;
|
|
|
|
}
|