Lines Matching defs:radii
40 // TODO: assert that all the x&y radii are already W/2 & H/2
77 // If the left and (by equality check above) right radii are zero then it is a rect.
101 void SkRRect::setRectRadii(const SkRect& rect, const SkVector radii[4]) {
108 memcpy(fRadii, radii, sizeof(fRadii));
112 // Clamp negative radii to zero
116 // the radii is 0 the corner is square. However, the other radii
131 // Proportionally scale down all radii to fit. Find the minimum ratio
132 // of a side and the radii on that side (for all four sides) and use
133 // that to scale down _all_ the radii. This algorithm is from the
137 // Si is the sum of the two corresponding radii of the corners on side i,
140 // If f < 1, then all corner radii are reduced by multiplying them by f."
258 static bool radii_are_nine_patch(const SkVector radii[4]) {
259 return radii[SkRRect::kUpperLeft_Corner].fX == radii[SkRRect::kLowerLeft_Corner].fX &&
260 radii[SkRRect::kUpperLeft_Corner].fY == radii[SkRRect::kUpperRight_Corner].fY &&
261 radii[SkRRect::kUpperRight_Corner].fX == radii[SkRRect::kLowerRight_Corner].fX &&
262 radii[SkRRect::kLowerLeft_Corner].fY == radii[SkRRect::kLowerRight_Corner].fY;
274 bool allRadiiEqual = true; // are all x radii equal and all y radii?
357 // Scale the radii without respecting the flip.
400 SkVector radii[4];
401 memcpy(radii, fRadii, sizeof(radii));
403 if (radii[i].fX) {
404 radii[i].fX -= dx;
406 if (radii[i].fY) {
407 radii[i].fY -= dy;
410 dst->setRectRadii(r, radii);