Lines Matching refs:Min
62 int32_t Min = INT_MIN, Max = INT_MAX; member
68 : Min(L), Max(H), Align(A), Offset(O) {} in OffsetRange()
75 Min = adjustUp(std::max(Min, A.Min), Align, Offset); in intersect()
79 Min = 0; in intersect()
83 if (Min > Max) in intersect()
84 std::tie(Min, Max, Align) = std::make_tuple(0, -1, 1); in intersect()
88 Min += S; in shift()
97 Min = (INT_MIN-D < Min) ? Min+D : INT_MIN; in extendBy()
103 return Min > Max; in empty()
106 return Min <= V && V <= Max && (V-Offset) % Align == 0; in contains()
109 return Min == R.Min && Max == R.Max && Align == R.Align; in operator ==()
115 if (Min != R.Min) in operator <()
116 return Min < R.Min; in operator <()
437 if (OR.Min > OR.Max) in operator <<()
439 OS << '[' << OR.Min << ',' << OR.Max << "]a" << unsigned(OR.Align) in operator <<()
616 if (N->Range.Min <= P) { in nodesWith()
1082 int32_t Min = -alignDown((1<<S)-1, A); in getOffsetRange() local
1089 OffsetRange R = { Min, Max, A }; in getOffsetRange()
1122 int32_t Min = -alignDown((1<<S)-1, A); in getOffsetRange() local
1124 return { Min, Max, A }; in getOffsetRange()
1363 auto P0 = MaxAlign(Tree.nodesWith(R.Min, false), R.Align, R.Offset); in assignInits()
1364 CandSet.insert(R.Min); in assignInits()
1366 CandSet.insert(adjustUp(R.Min, P0.first, P0.second)); in assignInits()