Lines Matching refs:Upper

107                         const llvm::APSInt &Upper,
123 if (i->From() > Upper) {
128 if (i->Includes(Upper)) {
130 BV.getValue(Upper)));
135 if (i->Includes(Upper)) {
136 newRanges = F.add(newRanges, Range(i->From(), BV.getValue(Upper)));
149 bool pin(llvm::APSInt &Lower, llvm::APSInt &Upper) const {
157 APSIntType::RangeTestResultKind UpperTest = Type.testInRange(Upper, true);
165 if (Lower < Upper)
170 Upper = Type.getMaxValue();
175 Type.apply(Upper);
180 Upper = Type.getMaxValue();
189 Upper = Type.getMaxValue();
194 Type.apply(Upper);
199 Upper = Type.getMaxValue();
211 Type.apply(Upper);
216 if (Lower < Upper)
221 Upper = Type.getMaxValue();
232 // the closed range [Lower, Upper]. Unlike the Range type, this range uses
234 // overflow. Thus, if the Lower bound is greater than the Upper bound, the
236 // intersection with the two ranges [Min, Upper] and [Lower, Max],
237 // or, alternatively, /removing/ all integers between Upper and Lower.
239 llvm::APSInt Lower, llvm::APSInt Upper) const {
240 if (!pin(Lower, Upper))
246 if (Lower <= Upper)
247 IntersectInRange(BV, F, Lower, Upper, newRanges, i, e);
252 IntersectInRange(BV, F, BV.getMinValue(Upper), Upper, newRanges, i, e);
426 llvm::APSInt Upper = Lower;
428 ++Upper;
432 RangeSet New = GetRange(St, Sym).Intersect(getBasicVals(), F, Upper, Lower);
473 llvm::APSInt Upper = ComparisonVal-Adjustment;
474 --Upper;
476 RangeSet New = GetRange(St, Sym).Intersect(getBasicVals(), F, Lower, Upper);
502 llvm::APSInt Upper = Max-Adjustment;
505 RangeSet New = GetRange(St, Sym).Intersect(getBasicVals(), F, Lower, Upper);
532 llvm::APSInt Upper = Max-Adjustment;
534 RangeSet New = GetRange(St, Sym).Intersect(getBasicVals(), F, Lower, Upper);
561 llvm::APSInt Upper = ComparisonVal-Adjustment;
563 RangeSet New = GetRange(St, Sym).Intersect(getBasicVals(), F, Lower, Upper);