2002-09-01 23:53:39 +00:00
|
|
|
//===-- llvm/Support/ConstantRange.h - Represent a range --------*- C++ -*-===//
|
2005-04-21 20:48:15 +00:00
|
|
|
//
|
2003-10-20 20:19:47 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 19:59:42 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-21 20:48:15 +00:00
|
|
|
//
|
2003-10-20 20:19:47 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-09-01 23:53:39 +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
|
2006-12-23 06:05:41 +00:00
|
|
|
// ranges: :
|
2002-09-01 23:53:39 +00:00
|
|
|
//
|
|
|
|
// [F, F) = {} = Empty set
|
|
|
|
// [T, F) = {T}
|
|
|
|
// [F, T) = {F}
|
|
|
|
// [T, T) = {F, T} = Full set
|
|
|
|
//
|
2006-12-23 06:05:41 +00:00
|
|
|
// The other integral ranges use min/max values for special range values. For
|
|
|
|
// example, for 8-bit types, it uses:
|
|
|
|
// [0, 0) = {} = Empty set
|
|
|
|
// [255, 255) = {0..255} = Full Set
|
|
|
|
//
|
2009-07-09 23:16:10 +00:00
|
|
|
// Note that ConstantRange can be used to represent either signed or
|
|
|
|
// unsigned ranges.
|
2009-07-09 22:07:27 +00:00
|
|
|
//
|
2002-09-01 23:53:39 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef LLVM_SUPPORT_CONSTANT_RANGE_H
|
|
|
|
#define LLVM_SUPPORT_CONSTANT_RANGE_H
|
|
|
|
|
2007-02-28 17:36:23 +00:00
|
|
|
#include "llvm/ADT/APInt.h"
|
2004-09-01 22:55:40 +00:00
|
|
|
#include "llvm/Support/DataTypes.h"
|
2003-11-11 22:41:34 +00:00
|
|
|
|
|
|
|
namespace llvm {
|
2002-09-01 23:53:39 +00:00
|
|
|
|
2009-07-09 23:16:10 +00:00
|
|
|
/// ConstantRange - This class represents an range of values.
|
|
|
|
///
|
|
|
|
class ConstantRange {
|
2007-02-28 17:36:23 +00:00
|
|
|
APInt Lower, Upper;
|
2009-07-09 23:16:10 +00:00
|
|
|
static ConstantRange intersect1Wrapped(const ConstantRange &LHS,
|
|
|
|
const ConstantRange &RHS);
|
|
|
|
|
|
|
|
public:
|
|
|
|
/// Initialize a full (the default) or empty set for the specified bit width.
|
|
|
|
///
|
|
|
|
explicit ConstantRange(uint32_t BitWidth, bool isFullSet = true);
|
2005-04-21 20:48:15 +00:00
|
|
|
|
2004-03-30 00:20:08 +00:00
|
|
|
/// Initialize a range to hold the single specified value.
|
|
|
|
///
|
2009-07-09 23:16:10 +00:00
|
|
|
ConstantRange(const APInt &Value);
|
2004-03-30 00:20:08 +00:00
|
|
|
|
2007-02-28 18:57:32 +00:00
|
|
|
/// @brief Initialize a range of values explicitly. This will assert out if
|
|
|
|
/// Lower==Upper and Lower != Min or Max value for its type. It will also
|
|
|
|
/// assert out if the two APInt's are not the same bit width.
|
2009-07-09 23:16:10 +00:00
|
|
|
ConstantRange(const APInt& Lower, const APInt& Upper);
|
2007-02-28 17:36:23 +00:00
|
|
|
|
2002-09-01 23:53:39 +00:00
|
|
|
/// getLower - Return the lower value for this range...
|
|
|
|
///
|
2007-02-28 19:57:34 +00:00
|
|
|
const APInt &getLower() const { return Lower; }
|
2002-09-01 23:53:39 +00:00
|
|
|
|
|
|
|
/// getUpper - Return the upper value for this range...
|
|
|
|
///
|
2009-02-20 22:51:36 +00:00
|
|
|
const APInt &getUpper() const { return Upper; }
|
2002-09-01 23:53:39 +00:00
|
|
|
|
2007-02-28 22:02:48 +00:00
|
|
|
/// getBitWidth - get the bit width of this ConstantRange
|
2002-09-01 23:53:39 +00:00
|
|
|
///
|
2007-02-28 22:02:48 +00:00
|
|
|
uint32_t getBitWidth() const { return Lower.getBitWidth(); }
|
2005-04-21 20:48:15 +00:00
|
|
|
|
2002-09-01 23:53:39 +00:00
|
|
|
/// isFullSet - Return true if this set contains all of the elements possible
|
|
|
|
/// for this data-type
|
|
|
|
///
|
|
|
|
bool isFullSet() const;
|
2005-04-21 20:48:15 +00:00
|
|
|
|
2002-09-01 23:53:39 +00:00
|
|
|
/// isEmptySet - Return true if this set contains no members.
|
|
|
|
///
|
|
|
|
bool isEmptySet() const;
|
|
|
|
|
|
|
|
/// isWrappedSet - Return true if this set wraps around the top of the range,
|
|
|
|
/// for example: [100, 8)
|
|
|
|
///
|
2007-03-01 07:54:15 +00:00
|
|
|
bool isWrappedSet() const;
|
2004-03-30 00:20:08 +00:00
|
|
|
|
|
|
|
/// contains - Return true if the specified value is in the set.
|
|
|
|
///
|
2007-03-01 07:54:15 +00:00
|
|
|
bool contains(const APInt &Val) const;
|
2005-04-21 20:48:15 +00:00
|
|
|
|
2009-07-09 23:16:10 +00:00
|
|
|
/// getSingleElement - If this set contains a single element, return it,
|
|
|
|
/// otherwise return null.
|
|
|
|
///
|
|
|
|
const APInt *getSingleElement() const {
|
|
|
|
if (Upper == Lower + 1)
|
|
|
|
return &Lower;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// isSingleElement - Return true if this set contains exactly one member.
|
|
|
|
///
|
|
|
|
bool isSingleElement() const { return getSingleElement() != 0; }
|
|
|
|
|
2002-09-01 23:53:39 +00:00
|
|
|
/// getSetSize - Return the number of elements in this set.
|
|
|
|
///
|
2007-02-28 17:36:23 +00:00
|
|
|
APInt getSetSize() const;
|
2002-09-01 23:53:39 +00:00
|
|
|
|
2007-03-10 15:54:12 +00:00
|
|
|
/// getUnsignedMax - Return the largest unsigned value contained in the
|
|
|
|
/// ConstantRange.
|
|
|
|
///
|
|
|
|
APInt getUnsignedMax() const;
|
|
|
|
|
|
|
|
/// getUnsignedMin - Return the smallest unsigned value contained in the
|
|
|
|
/// ConstantRange.
|
|
|
|
///
|
|
|
|
APInt getUnsignedMin() const;
|
|
|
|
|
|
|
|
/// getSignedMax - Return the largest signed value contained in the
|
|
|
|
/// ConstantRange.
|
|
|
|
///
|
|
|
|
APInt getSignedMax() const;
|
|
|
|
|
|
|
|
/// getSignedMin - Return the smallest signed value contained in the
|
|
|
|
/// ConstantRange.
|
|
|
|
///
|
|
|
|
APInt getSignedMin() const;
|
|
|
|
|
2009-07-09 23:16:10 +00:00
|
|
|
/// operator== - Return true if this range is equal to another range.
|
|
|
|
///
|
|
|
|
bool operator==(const ConstantRange &CR) const {
|
|
|
|
return Lower == CR.Lower && Upper == CR.Upper;
|
|
|
|
}
|
|
|
|
bool operator!=(const ConstantRange &CR) const {
|
|
|
|
return !operator==(CR);
|
|
|
|
}
|
|
|
|
|
2004-03-30 00:20:08 +00:00
|
|
|
/// subtract - Subtract the specified constant from the endpoints of this
|
|
|
|
/// constant range.
|
2007-02-28 19:57:34 +00:00
|
|
|
ConstantRange subtract(const APInt &CI) const;
|
2004-03-30 00:20:08 +00:00
|
|
|
|
2007-02-11 00:58:49 +00:00
|
|
|
/// intersectWith - Return the range that results from the intersection of
|
|
|
|
/// this range with another range. The resultant range is pruned as much as
|
2002-09-01 23:53:39 +00:00
|
|
|
/// possible, but there may be cases where elements are included that are in
|
|
|
|
/// one of the sets but not the other. For example: [100, 8) intersect [3,
|
|
|
|
/// 120) yields [3, 120)
|
|
|
|
///
|
2007-03-01 07:54:15 +00:00
|
|
|
ConstantRange intersectWith(const ConstantRange &CR) const;
|
2002-09-01 23:53:39 +00:00
|
|
|
|
2007-07-14 02:51:34 +00:00
|
|
|
/// maximalIntersectWith - Return the range that results from the intersection
|
|
|
|
/// of this range with another range. The resultant range is guaranteed to
|
2007-07-14 17:41:03 +00:00
|
|
|
/// include all elements contained in both input ranges, and to have the
|
|
|
|
/// smallest possible set size that does so. Because there may be two
|
|
|
|
/// intersections with the same set size, A.maximalIntersectWith(B) might not
|
|
|
|
/// be equal to B.maximalIntersectWith(A).
|
|
|
|
///
|
2007-07-14 02:51:34 +00:00
|
|
|
ConstantRange maximalIntersectWith(const ConstantRange &CR) const;
|
|
|
|
|
2007-02-11 00:58:49 +00:00
|
|
|
/// unionWith - Return the range that results from the union of this range
|
|
|
|
/// with another range. The resultant range is guaranteed to include the
|
|
|
|
/// elements of both sets, but may contain more. For example, [3, 9) union
|
|
|
|
/// [12,15) is [3, 15), which includes 9, 10, and 11, which were not included
|
|
|
|
/// in either set before.
|
2002-09-01 23:53:39 +00:00
|
|
|
///
|
2007-03-01 07:54:15 +00:00
|
|
|
ConstantRange unionWith(const ConstantRange &CR) const;
|
2002-09-02 00:18:26 +00:00
|
|
|
|
2004-03-30 00:20:08 +00:00
|
|
|
/// zeroExtend - Return a new range in the specified integer type, which must
|
|
|
|
/// be strictly larger than the current type. The returned range will
|
|
|
|
/// correspond to the possible range of values if the source range had been
|
2007-02-28 22:02:48 +00:00
|
|
|
/// zero extended to BitWidth.
|
|
|
|
ConstantRange zeroExtend(uint32_t BitWidth) const;
|
2004-03-30 00:20:08 +00:00
|
|
|
|
2007-04-07 15:41:33 +00:00
|
|
|
/// signExtend - Return a new range in the specified integer type, which must
|
|
|
|
/// be strictly larger than the current type. The returned range will
|
|
|
|
/// correspond to the possible range of values if the source range had been
|
|
|
|
/// sign extended to BitWidth.
|
|
|
|
ConstantRange signExtend(uint32_t BitWidth) const;
|
|
|
|
|
2004-03-30 00:20:08 +00:00
|
|
|
/// truncate - Return a new range in the specified integer type, which must be
|
|
|
|
/// strictly smaller than the current type. The returned range will
|
|
|
|
/// correspond to the possible range of values if the source range had been
|
|
|
|
/// truncated to the specified type.
|
2007-02-28 22:02:48 +00:00
|
|
|
ConstantRange truncate(uint32_t BitWidth) const;
|
2004-03-30 00:20:08 +00:00
|
|
|
|
2009-07-09 22:07:27 +00:00
|
|
|
/// add - Return a new range representing the possible values resulting
|
|
|
|
/// from an addition of a value in this range and a value in Other.
|
|
|
|
ConstantRange add(const ConstantRange &Other) const;
|
|
|
|
|
|
|
|
/// multiply - Return a new range representing the possible values resulting
|
|
|
|
/// from a multiplication of a value in this range and a value in Other.
|
|
|
|
/// TODO: This isn't fully implemented yet.
|
|
|
|
ConstantRange multiply(const ConstantRange &Other) const;
|
|
|
|
|
|
|
|
/// smax - Return a new range representing the possible values resulting
|
|
|
|
/// from a signed maximum of a value in this range and a value in Other.
|
|
|
|
ConstantRange smax(const ConstantRange &Other) const;
|
|
|
|
|
|
|
|
/// umax - Return a new range representing the possible values resulting
|
|
|
|
/// from an unsigned maximum of a value in this range and a value in Other.
|
|
|
|
ConstantRange umax(const ConstantRange &Other) const;
|
|
|
|
|
|
|
|
/// udiv - Return a new range representing the possible values resulting
|
|
|
|
/// from an unsigned division of a value in this range and a value in Other.
|
|
|
|
/// TODO: This isn't fully implemented yet.
|
|
|
|
ConstantRange udiv(const ConstantRange &Other) const;
|
|
|
|
|
2009-07-09 23:16:10 +00:00
|
|
|
/// print - Print out the bounds to a stream...
|
2009-07-09 22:07:27 +00:00
|
|
|
///
|
2009-07-09 23:16:10 +00:00
|
|
|
void print(raw_ostream &OS) const;
|
2009-07-09 22:07:27 +00:00
|
|
|
|
2009-07-09 23:16:10 +00:00
|
|
|
/// dump - Allow printing from a debugger easily...
|
2009-07-09 22:07:27 +00:00
|
|
|
///
|
2009-07-09 23:16:10 +00:00
|
|
|
void dump() const;
|
2002-09-01 23:53:39 +00:00
|
|
|
};
|
|
|
|
|
2009-07-09 23:16:10 +00:00
|
|
|
inline raw_ostream &operator<<(raw_ostream &OS, const ConstantRange &CR) {
|
2002-09-02 00:18:26 +00:00
|
|
|
CR.print(OS);
|
|
|
|
return OS;
|
|
|
|
}
|
|
|
|
|
2009-07-09 23:16:10 +00:00
|
|
|
std::ostream &operator<<(std::ostream &OS, const ConstantRange &CR);
|
2009-07-09 22:07:27 +00:00
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
} // End llvm namespace
|
|
|
|
|
2002-09-01 23:53:39 +00:00
|
|
|
#endif
|