Lines Matching defs:max
328 if (inputPolygonSize > std::numeric_limits<uint16_t>::max()) {
487 // limit the number of steps to at most max uint16_t (that's all we can index)
489 if (floatSteps >= std::numeric_limits<uint16_t>::max()) {
1173 if (inputPolygonSize >= std::numeric_limits<uint16_t>::max()) {
1228 numEdges += std::max(numSteps, 1);
1241 numEdges += std::max(numSteps, 1);
1244 // Make sure we don't overflow the max array count.
1245 // We shouldn't overflow numEdges, as SkComputeRadialSteps returns a max of 2^16-1,
1246 // and we have a max of 2^16-1 original vertices.
1247 if (numEdges > (unsigned int)std::numeric_limits<int32_t>::max()) {
1268 auto currEdge = edgeData.push_back_n(std::max(numSteps, 1));
1399 offsetVertexCount >= std::numeric_limits<uint16_t>::max()) {
1456 Sk4s min, max;
1457 min = max = Sk4s(p0.fX, p0.fY, p0.fX, p0.fY);
1460 max = Sk4s::Max(max, xy);
1462 std::max(max[0], max[2]), std::max(max[1], max[3]));
1509 fHCount = std::max(std::min(SkScalarRoundToInt(hCount), vertexCount), 1);
1608 if (polygonSize >= std::numeric_limits<uint16_t>::max()) {