Lines Matching refs:fRect
35 fRect = rect;
40 if (xRad >= SkScalarHalf(fRect.width()) && yRad >= SkScalarHalf(fRect.height())) {
99 fRect = rect;
151 fRect = rect;
223 canonicalPt.set(x - fRect.centerX(), y - fRect.centerY());
226 if (x < fRect.fLeft + fRadii[kUpperLeft_Corner].fX &&
227 y < fRect.fTop + fRadii[kUpperLeft_Corner].fY) {
230 canonicalPt.set(x - (fRect.fLeft + fRadii[kUpperLeft_Corner].fX),
231 y - (fRect.fTop + fRadii[kUpperLeft_Corner].fY));
233 } else if (x < fRect.fLeft + fRadii[kLowerLeft_Corner].fX &&
234 y > fRect.fBottom - fRadii[kLowerLeft_Corner].fY) {
237 canonicalPt.set(x - (fRect.fLeft + fRadii[kLowerLeft_Corner].fX),
238 y - (fRect.fBottom - fRadii[kLowerLeft_Corner].fY));
240 } else if (x > fRect.fRight - fRadii[kUpperRight_Corner].fX &&
241 y < fRect.fTop + fRadii[kUpperRight_Corner].fY) {
244 canonicalPt.set(x - (fRect.fRight - fRadii[kUpperRight_Corner].fX),
245 y - (fRect.fTop + fRadii[kUpperRight_Corner].fY));
247 } else if (x > fRect.fRight - fRadii[kLowerRight_Corner].fX &&
248 y > fRect.fBottom - fRadii[kLowerRight_Corner].fY) {
251 canonicalPt.set(x - (fRect.fRight - fRadii[kLowerRight_Corner].fX),
252 y - (fRect.fBottom - fRadii[kLowerRight_Corner].fY));
314 if (fRect.isEmpty()) {
339 if (fRadii[0].fX >= SkScalarHalf(fRect.width()) &&
340 fRadii[0].fY >= SkScalarHalf(fRect.height())) {
383 if (!matrix.mapRect(&newRect, fRect)) {
395 dst->fRect = newRect;
453 const SkRect r = fRect.makeInset(dx, dy);
478 memcpy(buffer, &fRect, sizeof(SkRect));
505 fRect.dump(asHex);
556 SkASSERT(fRect.isEmpty());
560 SkASSERT(!fRect.isEmpty());
564 SkASSERT(!fRect.isEmpty());
568 SkASSERT(SkScalarNearlyEqual(fRadii[i].fX, SkScalarHalf(fRect.width())));
569 SkASSERT(SkScalarNearlyEqual(fRadii[i].fY, SkScalarHalf(fRect.height())));
573 SkASSERT(!fRect.isEmpty());
577 SkASSERT(!fRect.isEmpty());
582 SkASSERT(!fRect.isEmpty());
589 validate_radius_check_predicates(fRadii[i].fX, fRect.fLeft, fRect.fRight);
590 validate_radius_check_predicates(fRadii[i].fY, fRect.fTop, fRect.fBottom);
