Lines Matching refs:Lower

27                       const llvm::APSInt &Lower, const llvm::APSInt &Upper,
39 if (i->To() < Lower) {
46 if (i->Includes(Lower)) {
49 F.add(newRanges, Range(BV.getValue(Lower), BV.getValue(Upper)));
52 newRanges = F.add(newRanges, Range(BV.getValue(Lower), i->To()));
68 bool RangeSet::pin(llvm::APSInt &Lower, llvm::APSInt &Upper) const {
75 APSIntType::RangeTestResultKind LowerTest = Type.testInRange(Lower, true);
84 if (Lower <= Upper)
88 Lower = Type.getMinValue();
93 Lower = Type.getMinValue();
98 Lower = Type.getMinValue();
107 Type.apply(Lower);
112 Type.apply(Lower);
117 Type.apply(Lower);
129 Lower = Type.getMinValue();
135 if (Lower <= Upper)
139 Lower = Type.getMinValue();
150 // the closed range [Lower, Upper]. Unlike the Range type, this range uses
152 // overflow. Thus, if the Lower bound is greater than the Upper bound, the
154 // intersection with the two ranges [Min, Upper] and [Lower, Max],
155 // or, alternatively, /removing/ all integers between Upper and Lower.
157 llvm::APSInt Lower, llvm::APSInt Upper) const {
158 if (!pin(Lower, Upper))
164 if (Lower <= Upper)
165 IntersectInRange(BV, F, Lower, Upper, newRanges, i, e);
171 IntersectInRange(BV, F, Lower, BV.getMaxValue(Lower), newRanges, i, e);
562 llvm::APSInt Lower = AdjustmentType.convert(Int) - Adjustment;
563 llvm::APSInt Upper = Lower;
564 --Lower;
569 RangeSet New = getRange(St, Sym).Intersect(getBasicVals(), F, Upper, Lower);
609 llvm::APSInt Lower = Min - Adjustment;
613 return getRange(St, Sym).Intersect(getBasicVals(), F, Lower, Upper);
645 llvm::APSInt Lower = ComparisonVal - Adjustment;
647 ++Lower;
649 return getRange(St, Sym).Intersect(getBasicVals(), F, Lower, Upper);
682 llvm::APSInt Lower = ComparisonVal - Adjustment;
685 return getRange(St, Sym).Intersect(getBasicVals(), F, Lower, Upper);
718 llvm::APSInt Lower = Min - Adjustment;
721 return RS().Intersect(getBasicVals(), F, Lower, Upper);