Lines Matching refs:fX
152 if (radii[i].fX <= 0 || radii[i].fY <= 0) { in clamp_to_zero()
157 radii[i].fX = 0; in clamp_to_zero()
172 if (!SkScalarsAreFinite(&radii[0].fX, 8)) { in setRectRadii()
236 scale = compute_min_scale(fRadii[0].fX, fRadii[1].fX, width, scale); in scaleRadii()
238 scale = compute_min_scale(fRadii[2].fX, fRadii[3].fX, width, scale); in scaleRadii()
241 flush_to_zero(fRadii[0].fX, fRadii[1].fX); in scaleRadii()
243 flush_to_zero(fRadii[2].fX, fRadii[3].fX); in scaleRadii()
247 SkScaleToSides::AdjustRadii(width, scale, &fRadii[0].fX, &fRadii[1].fX); in scaleRadii()
249 SkScaleToSides::AdjustRadii(width, scale, &fRadii[2].fX, &fRadii[3].fX); in scaleRadii()
275 if (x < fRect.fLeft + fRadii[kUpperLeft_Corner].fX && in checkCornerContainment()
279 canonicalPt.set(x - (fRect.fLeft + fRadii[kUpperLeft_Corner].fX), in checkCornerContainment()
281 SkASSERT(canonicalPt.fX < 0 && canonicalPt.fY < 0); in checkCornerContainment()
282 } else if (x < fRect.fLeft + fRadii[kLowerLeft_Corner].fX && in checkCornerContainment()
286 canonicalPt.set(x - (fRect.fLeft + fRadii[kLowerLeft_Corner].fX), in checkCornerContainment()
288 SkASSERT(canonicalPt.fX < 0 && canonicalPt.fY > 0); in checkCornerContainment()
289 } else if (x > fRect.fRight - fRadii[kUpperRight_Corner].fX && in checkCornerContainment()
293 canonicalPt.set(x - (fRect.fRight - fRadii[kUpperRight_Corner].fX), in checkCornerContainment()
295 SkASSERT(canonicalPt.fX > 0 && canonicalPt.fY < 0); in checkCornerContainment()
296 } else if (x > fRect.fRight - fRadii[kLowerRight_Corner].fX && in checkCornerContainment()
300 canonicalPt.set(x - (fRect.fRight - fRadii[kLowerRight_Corner].fX), in checkCornerContainment()
302 SkASSERT(canonicalPt.fX > 0 && canonicalPt.fY > 0); in checkCornerContainment()
315 SkScalar dist = SkScalarSquare(canonicalPt.fX) * SkScalarSquare(fRadii[index].fY) + in checkCornerContainment()
316 SkScalarSquare(canonicalPt.fY) * SkScalarSquare(fRadii[index].fX); in checkCornerContainment()
317 return dist <= SkScalarSquare(fRadii[index].fX * fRadii[index].fY); in checkCornerContainment()
321 SkScalar simpleRadius = rr.fRadii[0].fX; in IsNearlySimpleCircular()
323 SkScalarNearlyEqual(simpleRadius, rr.fRadii[1].fX, tolerance) && in IsNearlySimpleCircular()
325 SkScalarNearlyEqual(simpleRadius, rr.fRadii[2].fX, tolerance) && in IsNearlySimpleCircular()
327 SkScalarNearlyEqual(simpleRadius, rr.fRadii[3].fX, tolerance) && in IsNearlySimpleCircular()
332 return SkScalarNearlyEqual(rr.fRadii[0].fX, rr.fRadii[0].fY, tolerance) && in AllCornersCircular()
333 SkScalarNearlyEqual(rr.fRadii[1].fX, rr.fRadii[1].fY, tolerance) && in AllCornersCircular()
334 SkScalarNearlyEqual(rr.fRadii[2].fX, rr.fRadii[2].fY, tolerance) && in AllCornersCircular()
335 SkScalarNearlyEqual(rr.fRadii[3].fX, rr.fRadii[3].fY, tolerance); in AllCornersCircular()
360 return radii[SkRRect::kUpperLeft_Corner].fX == radii[SkRRect::kLowerLeft_Corner].fX && in radii_are_nine_patch()
362 radii[SkRRect::kUpperRight_Corner].fX == radii[SkRRect::kLowerRight_Corner].fX && in radii_are_nine_patch()
379 bool allCornersSquare = 0 == fRadii[0].fX || 0 == fRadii[0].fY; in computeType()
382 if (0 != fRadii[i].fX && 0 != fRadii[i].fY) { in computeType()
387 if (fRadii[i].fX != fRadii[i-1].fX || fRadii[i].fY != fRadii[i-1].fY) { in computeType()
399 if (fRadii[0].fX >= SkScalarHalf(fRect.width()) && in computeType()
466 dst->fRadii[i].fX = SkScalarHalf(newRect.width()); in transform()
491 dst->fRadii[i].fX = fRadii[src].fY; in transform()
492 dst->fRadii[i].fY = fRadii[src].fX; in transform()
496 dst->fRadii[i].fX = fRadii[i].fX; in transform()
513 dst->fRadii[i].fX *= xScale; in transform()
572 if (radii[i].fX) { in inset()
573 radii[i].fX -= dx; in inset()
656 bool allRadiiZero = (0 == fRadii[0].fX && 0 == fRadii[0].fY); in isValid()
657 bool allCornersSquare = (0 == fRadii[0].fX || 0 == fRadii[0].fY); in isValid()
661 if (0 != fRadii[i].fX || 0 != fRadii[i].fY) { in isValid()
665 if (fRadii[i].fX != fRadii[i-1].fX || fRadii[i].fY != fRadii[i-1].fY) { in isValid()
669 if (0 != fRadii[i].fX && 0 != fRadii[i].fY) { in isValid()
696 if (!SkScalarNearlyEqual(fRadii[i].fX, SkRectPriv::HalfWidth(fRect)) || in isValid()
729 if (!are_radius_check_predicates_valid(radii[i].fX, rect.fLeft, rect.fRight) || in AreRectAndRadiiValid()
757 SkScalar leftShift = std::max(tl.fX, bl.fX); in InnerBounds()
759 SkScalar rightShift = std::max(tr.fX, br.fX); in InnerBounds()
816 case SkRRect::kUpperLeft_Corner: return a.fX >= b.fX && a.fY >= b.fY; in ConservativeIntersect()
817 case SkRRect::kUpperRight_Corner: return a.fX <= b.fX && a.fY >= b.fY; in ConservativeIntersect()
818 case SkRRect::kLowerRight_Corner: return a.fX <= b.fX && a.fY <= b.fY; in ConservativeIntersect()
819 case SkRRect::kLowerLeft_Corner: return a.fX >= b.fX && a.fY <= b.fY; in ConservativeIntersect()
835 if (aRadii.fX >= bRadii.fX && aRadii.fY >= bRadii.fY) { in ConservativeIntersect()
838 } else if (bRadii.fX >= aRadii.fX && bRadii.fY >= aRadii.fY) { in ConservativeIntersect()
852 return b.checkCornerContainment(aCorner.fX, aCorner.fY); in ConservativeIntersect()
860 return a.checkCornerContainment(bCorner.fX, bCorner.fY); in ConservativeIntersect()
866 return a.checkCornerContainment(test.fX, test.fY) && in ConservativeIntersect()
867 b.checkCornerContainment(test.fX, test.fY); in ConservativeIntersect()