reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
73 Max = adjustDown(std::min(Max, A.Max), Align, Offset); 73 Max = adjustDown(std::min(Max, A.Max), Align, Offset); 73 Max = adjustDown(std::min(Max, A.Max), Align, Offset); 77 Max = -1; 80 if (Min > Max) 81 std::tie(Min, Max, Align) = std::make_tuple(0, -1, 1); 86 Max += S; 96 Max = (INT_MAX-D > Max) ? Max+D : INT_MAX; 96 Max = (INT_MAX-D > Max) ? Max+D : INT_MAX; 96 Max = (INT_MAX-D > Max) ? Max+D : INT_MAX; 100 return Min > Max; 103 return Min <= V && V <= Max && (V-Offset) % Align == 0; 106 return Min == R.Min && Max == R.Max && Align == R.Align; 106 return Min == R.Min && Max == R.Max && Align == R.Align; 114 if (Max != R.Max) 114 if (Max != R.Max) 115 return Max < R.Max; 115 return Max < R.Max; 123 Node(const OffsetRange &R) : MaxEnd(R.Max), Range(R) {} 435 if (OR.Min > OR.Max) 437 OS << '[' << OR.Min << ',' << OR.Max << "]a" << unsigned(OR.Align) 615 if ((CheckA && N->Range.contains(P)) || (!CheckA && P <= N->Range.Max)) 1361 auto P1 = MaxAlign(Tree.nodesWith(R.Max, false), R.Align, R.Offset); 1362 CandSet.insert(R.Max); 1364 CandSet.insert(adjustDown(R.Max, P1.first, P1.second));