1 //===- ConstantRange.h - Represent a range ----------------------*- C++ -*-===//
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 // Represent a range of possible values that may occur when the program is run
11 // for an integral value. This keeps track of a lower and upper bound for the
12 // constant, which MAY wrap around the end of the numeric range. To do this, it
13 // keeps track of a [lower, upper) bound, which specifies an interval just like
14 // STL iterators. When used with boolean values, the following are important
17 // [F, F) = {} = Empty set
20 // [T, T) = {F, T} = Full set
22 // The other integral ranges use min/max values for special range values. For
23 // example, for 8-bit types, it uses:
24 // [0, 0) = {} = Empty set
25 // [255, 255) = {0..255} = Full Set
27 // Note that ConstantRange can be used to represent either signed or
30 //===----------------------------------------------------------------------===//
32 #ifndef LLVM_IR_CONSTANTRANGE_H
33 #define LLVM_IR_CONSTANTRANGE_H
35 #include "llvm/ADT/APInt.h"
36 #include "llvm/IR/InstrTypes.h"
37 #include "llvm/IR/Instruction.h"
38 #include "llvm/Support/Compiler.h"
46 /// This class represents a range of values.
47 class LLVM_NODISCARD ConstantRange {
51 /// Initialize a full (the default) or empty set for the specified bit width.
52 explicit ConstantRange(uint32_t BitWidth, bool isFullSet = true);
54 /// Initialize a range to hold the single specified value.
55 ConstantRange(APInt Value);
57 /// @brief Initialize a range of values explicitly. This will assert out if
58 /// Lower==Upper and Lower != Min or Max value for its type. It will also
59 /// assert out if the two APInt's are not the same bit width.
60 ConstantRange(APInt Lower, APInt Upper);
62 /// Produce the smallest range such that all values that may satisfy the given
63 /// predicate with any value contained within Other is contained in the
64 /// returned range. Formally, this returns a superset of
65 /// 'union over all y in Other . { x : icmp op x y is true }'. If the exact
66 /// answer is not representable as a ConstantRange, the return value will be a
67 /// proper superset of the above.
69 /// Example: Pred = ult and Other = i8 [2, 5) returns Result = [0, 4)
70 static ConstantRange makeAllowedICmpRegion(CmpInst::Predicate Pred,
71 const ConstantRange &Other);
73 /// Produce the largest range such that all values in the returned range
74 /// satisfy the given predicate with all values contained within Other.
75 /// Formally, this returns a subset of
76 /// 'intersection over all y in Other . { x : icmp op x y is true }'. If the
77 /// exact answer is not representable as a ConstantRange, the return value
78 /// will be a proper subset of the above.
80 /// Example: Pred = ult and Other = i8 [2, 5) returns [0, 2)
81 static ConstantRange makeSatisfyingICmpRegion(CmpInst::Predicate Pred,
82 const ConstantRange &Other);
84 /// Produce the exact range such that all values in the returned range satisfy
85 /// the given predicate with any value contained within Other. Formally, this
86 /// returns the exact answer when the superset of 'union over all y in Other
87 /// is exactly same as the subset of intersection over all y in Other.
88 /// { x : icmp op x y is true}'.
90 /// Example: Pred = ult and Other = i8 3 returns [0, 3)
91 static ConstantRange makeExactICmpRegion(CmpInst::Predicate Pred,
94 /// Return the largest range containing all X such that "X BinOpC Y" is
95 /// guaranteed not to wrap (overflow) for all Y in Other.
97 /// NB! The returned set does *not* contain **all** possible values of X for
98 /// which "X BinOpC Y" does not wrap -- some viable values of X may be
99 /// missing, so you cannot use this to constrain X's range. E.g. in the last
100 /// example, "(-2) + 1" is both nsw and nuw (so the "X" could be -2), but (-2)
101 /// is not in the set returned.
104 /// typedef OverflowingBinaryOperator OBO;
105 /// #define MGNR makeGuaranteedNoWrapRegion
106 /// MGNR(Add, [i8 1, 2), OBO::NoSignedWrap) == [-128, 127)
107 /// MGNR(Add, [i8 1, 2), OBO::NoUnsignedWrap) == [0, -1)
108 /// MGNR(Add, [i8 0, 1), OBO::NoUnsignedWrap) == Full Set
109 /// MGNR(Add, [i8 1, 2), OBO::NoUnsignedWrap | OBO::NoSignedWrap)
111 /// MGNR(Add, [i8 -1, 6), OBO::NoSignedWrap) == [INT_MIN+1, INT_MAX-4)
112 static ConstantRange makeGuaranteedNoWrapRegion(Instruction::BinaryOps BinOp,
113 const ConstantRange &Other,
114 unsigned NoWrapKind);
116 /// Set up \p Pred and \p RHS such that
117 /// ConstantRange::makeExactICmpRegion(Pred, RHS) == *this. Return true if
119 bool getEquivalentICmp(CmpInst::Predicate &Pred, APInt &RHS) const;
121 /// Return the lower value for this range.
122 const APInt &getLower() const { return Lower; }
124 /// Return the upper value for this range.
125 const APInt &getUpper() const { return Upper; }
127 /// Get the bit width of this ConstantRange.
128 uint32_t getBitWidth() const { return Lower.getBitWidth(); }
130 /// Return true if this set contains all of the elements possible
131 /// for this data-type.
132 bool isFullSet() const;
134 /// Return true if this set contains no members.
135 bool isEmptySet() const;
137 /// Return true if this set wraps around the top of the range.
138 /// For example: [100, 8).
139 bool isWrappedSet() const;
141 /// Return true if this set wraps around the INT_MIN of
142 /// its bitwidth. For example: i8 [120, 140).
143 bool isSignWrappedSet() const;
145 /// Return true if the specified value is in the set.
146 bool contains(const APInt &Val) const;
148 /// Return true if the other range is a subset of this one.
149 bool contains(const ConstantRange &CR) const;
151 /// If this set contains a single element, return it, otherwise return null.
152 const APInt *getSingleElement() const {
153 if (Upper == Lower + 1)
158 /// If this set contains all but a single element, return it, otherwise return
160 const APInt *getSingleMissingElement() const {
161 if (Lower == Upper + 1)
166 /// Return true if this set contains exactly one member.
167 bool isSingleElement() const { return getSingleElement() != nullptr; }
169 /// Return the number of elements in this set.
170 APInt getSetSize() const;
172 /// Compare set size of this range with the range CR.
173 bool isSizeStrictlySmallerThan(const ConstantRange &CR) const;
175 // Compare set size of this range with Value.
176 bool isSizeLargerThan(uint64_t MaxSize) const;
178 /// Return the largest unsigned value contained in the ConstantRange.
179 APInt getUnsignedMax() const;
181 /// Return the smallest unsigned value contained in the ConstantRange.
182 APInt getUnsignedMin() const;
184 /// Return the largest signed value contained in the ConstantRange.
185 APInt getSignedMax() const;
187 /// Return the smallest signed value contained in the ConstantRange.
188 APInt getSignedMin() const;
190 /// Return true if this range is equal to another range.
191 bool operator==(const ConstantRange &CR) const {
192 return Lower == CR.Lower && Upper == CR.Upper;
194 bool operator!=(const ConstantRange &CR) const {
195 return !operator==(CR);
198 /// Subtract the specified constant from the endpoints of this constant range.
199 ConstantRange subtract(const APInt &CI) const;
201 /// Subtract the specified range from this range (aka relative complement of
203 ConstantRange difference(const ConstantRange &CR) const;
205 /// Return the range that results from the intersection of
206 /// this range with another range. The resultant range is guaranteed to
207 /// include all elements contained in both input ranges, and to have the
208 /// smallest possible set size that does so. Because there may be two
209 /// intersections with the same set size, A.intersectWith(B) might not
210 /// be equal to B.intersectWith(A).
211 ConstantRange intersectWith(const ConstantRange &CR) const;
213 /// Return the range that results from the union of this range
214 /// with another range. The resultant range is guaranteed to include the
215 /// elements of both sets, but may contain more. For example, [3, 9) union
216 /// [12,15) is [3, 15), which includes 9, 10, and 11, which were not included
217 /// in either set before.
218 ConstantRange unionWith(const ConstantRange &CR) const;
220 /// Return a new range representing the possible values resulting
221 /// from an application of the specified cast operator to this range. \p
222 /// BitWidth is the target bitwidth of the cast. For casts which don't
223 /// change bitwidth, it must be the same as the source bitwidth. For casts
224 /// which do change bitwidth, the bitwidth must be consistent with the
225 /// requested cast and source bitwidth.
226 ConstantRange castOp(Instruction::CastOps CastOp,
227 uint32_t BitWidth) const;
229 /// Return a new range in the specified integer type, which must
230 /// be strictly larger than the current type. The returned range will
231 /// correspond to the possible range of values if the source range had been
232 /// zero extended to BitWidth.
233 ConstantRange zeroExtend(uint32_t BitWidth) const;
235 /// Return a new range in the specified integer type, which must
236 /// be strictly larger than the current type. The returned range will
237 /// correspond to the possible range of values if the source range had been
238 /// sign extended to BitWidth.
239 ConstantRange signExtend(uint32_t BitWidth) const;
241 /// Return a new range in the specified integer type, which must be
242 /// strictly smaller than the current type. The returned range will
243 /// correspond to the possible range of values if the source range had been
244 /// truncated to the specified type.
245 ConstantRange truncate(uint32_t BitWidth) const;
247 /// Make this range have the bit width given by \p BitWidth. The
248 /// value is zero extended, truncated, or left alone to make it that width.
249 ConstantRange zextOrTrunc(uint32_t BitWidth) const;
251 /// Make this range have the bit width given by \p BitWidth. The
252 /// value is sign extended, truncated, or left alone to make it that width.
253 ConstantRange sextOrTrunc(uint32_t BitWidth) const;
255 /// Return a new range representing the possible values resulting
256 /// from an application of the specified binary operator to an left hand side
257 /// of this range and a right hand side of \p Other.
258 ConstantRange binaryOp(Instruction::BinaryOps BinOp,
259 const ConstantRange &Other) const;
261 /// Return a new range representing the possible values resulting
262 /// from an addition of a value in this range and a value in \p Other.
263 ConstantRange add(const ConstantRange &Other) const;
265 /// Return a new range representing the possible values resulting from a
266 /// known NSW addition of a value in this range and \p Other constant.
267 ConstantRange addWithNoSignedWrap(const APInt &Other) const;
269 /// Return a new range representing the possible values resulting
270 /// from a subtraction of a value in this range and a value in \p Other.
271 ConstantRange sub(const ConstantRange &Other) const;
273 /// Return a new range representing the possible values resulting
274 /// from a multiplication of a value in this range and a value in \p Other,
275 /// treating both this and \p Other as unsigned ranges.
276 ConstantRange multiply(const ConstantRange &Other) const;
278 /// Return a new range representing the possible values resulting
279 /// from a signed maximum of a value in this range and a value in \p Other.
280 ConstantRange smax(const ConstantRange &Other) const;
282 /// Return a new range representing the possible values resulting
283 /// from an unsigned maximum of a value in this range and a value in \p Other.
284 ConstantRange umax(const ConstantRange &Other) const;
286 /// Return a new range representing the possible values resulting
287 /// from a signed minimum of a value in this range and a value in \p Other.
288 ConstantRange smin(const ConstantRange &Other) const;
290 /// Return a new range representing the possible values resulting
291 /// from an unsigned minimum of a value in this range and a value in \p Other.
292 ConstantRange umin(const ConstantRange &Other) const;
294 /// Return a new range representing the possible values resulting
295 /// from an unsigned division of a value in this range and a value in
297 ConstantRange udiv(const ConstantRange &Other) const;
299 /// Return a new range representing the possible values resulting
300 /// from a binary-and of a value in this range by a value in \p Other.
301 ConstantRange binaryAnd(const ConstantRange &Other) const;
303 /// Return a new range representing the possible values resulting
304 /// from a binary-or of a value in this range by a value in \p Other.
305 ConstantRange binaryOr(const ConstantRange &Other) const;
307 /// Return a new range representing the possible values resulting
308 /// from a left shift of a value in this range by a value in \p Other.
309 /// TODO: This isn't fully implemented yet.
310 ConstantRange shl(const ConstantRange &Other) const;
312 /// Return a new range representing the possible values resulting from a
313 /// logical right shift of a value in this range and a value in \p Other.
314 ConstantRange lshr(const ConstantRange &Other) const;
316 /// Return a new range that is the logical not of the current set.
317 ConstantRange inverse() const;
319 /// Print out the bounds to a stream.
320 void print(raw_ostream &OS) const;
322 /// Allow printing from a debugger easily.
326 inline raw_ostream &operator<<(raw_ostream &OS, const ConstantRange &CR) {
331 /// Parse out a conservative ConstantRange from !range metadata.
333 /// E.g. if RangeMD is !{i32 0, i32 10, i32 15, i32 20} then return [0, 20).
334 ConstantRange getConstantRangeFromMetadata(const MDNode &RangeMD);
336 } // end namespace llvm
338 #endif // LLVM_IR_CONSTANTRANGE_H