Lines Matching defs:max
59 dst->fRight = std::max(dst->fRight, src.fRight);
60 dst->fBottom = std::max(dst->fBottom, src.fBottom);
470 int SkPath::getPoints(SkPoint dst[], int max) const {
473 SkASSERT(max >= 0);
474 SkASSERT(!max || dst);
475 int count = std::min(max, fPathRef->countPoints());
491 int SkPath::getVerbs(uint8_t dst[], int max) const {
494 SkASSERT(max >= 0);
495 SkASSERT(!max || dst);
496 int count = std::min(max, fPathRef->countVerbs());
1213 SkScalar scaleFactorSquared = std::max(1 / d - 0.25f, 0.f);
2465 SkScalar max = pts[0].fY;
2469 if (y > max) {
2470 max = y;
2499 SkScalar max = min;
2510 } else if (x > max) {
2511 max = x;
2525 * contour that contained the global y-max. If we just look at the first
2528 * that is outer most (or at least has the global y-max) before we can consider
2563 // If there is more than 1 distinct point at the y-max, we take the
2564 // x-min and x-max of them and just subtract to compute the dir.
2637 SkScalar min, max;
2638 min = max = pts[0].fX;
2641 max = std::max(max, pts[i].fX);
2644 *maxPtr = max;
2677 SkScalar min, max;
2678 find_minmax<4>(pts, &min, &max);
2682 if (x > max) {
3340 Sk2s min, max;
3341 min = max = from_point(this->getPoint(0));
3368 max = Sk2s::Max(max, tmp);
3373 max.store((SkPoint*)&bounds.fRight);