Lines Matching refs:Max
59 int32_t Min = INT_MIN, Max = INT_MAX; member
65 : Min(L), Max(H), Align(A), Offset(O) {} in OffsetRange()
73 Max = adjustDown(std::min(Max, A.Max), Align, Offset); in intersect()
77 Max = -1; in intersect()
80 if (Min > Max) in intersect()
81 std::tie(Min, Max, Align) = std::make_tuple(0, -1, 1); in intersect()
86 Max += S; in shift()
96 Max = (INT_MAX-D > Max) ? Max+D : INT_MAX; in extendBy()
100 return Min > Max; in empty()
103 return Min <= V && V <= Max && (V-Offset) % Align == 0; in contains()
106 return Min == R.Min && Max == R.Max && Align == R.Align; in operator ==()
114 if (Max != R.Max) in operator <()
115 return Max < R.Max; in operator <()
123 Node(const OffsetRange &R) : MaxEnd(R.Max), Range(R) {} in Node()
435 if (OR.Min > OR.Max) in operator <<()
437 OS << '[' << OR.Min << ',' << OR.Max << "]a" << unsigned(OR.Align) in operator <<()
615 if ((CheckA && N->Range.contains(P)) || (!CheckA && P <= N->Range.Max)) in nodesWith()
1085 int32_t Max = Off >= 0 ? 0 : -Off; in getOffsetRange() local
1087 OffsetRange R = { Min, Max, A }; in getOffsetRange()
1121 int32_t Max = 0; // Force non-negative offsets. in getOffsetRange() local
1122 return { Min, Max, A }; in getOffsetRange()
1361 auto P1 = MaxAlign(Tree.nodesWith(R.Max, false), R.Align, R.Offset); in assignInits()
1362 CandSet.insert(R.Max); in assignInits()
1364 CandSet.insert(adjustDown(R.Max, P1.first, P1.second)); in assignInits()