Lines Matching defs:fPts
15 static bool pointInTriangle(const SkDPoint fPts[3], const SkDPoint& test) {
16 SkDVector v0 = fPts[2] - fPts[0];
17 SkDVector v1 = fPts[1] - fPts[0];
18 SkDVector v2 = test - fPts[0];
35 static bool matchesEnd(const SkDPoint fPts[3], const SkDPoint& test) {
36 return fPts[0] == test || fPts[2] == test;
56 double sign = (fPts[oddMan].fY - origY) * adj - (fPts[oddMan].fX - origX) * opp;
73 if (linear && !matchesEnd(fPts, q2.fPts[0]) && !matchesEnd(fPts, q2.fPts[2])) {
77 if (pointInTriangle(fPts, q2.fPts[0]) || pointInTriangle(fPts, q2.fPts[2])) {
106 endPt[opp - 1] = &fPts[end];
191 double tiniest = std::min(std::min(std::min(std::min(std::min(fPts[0].fX, fPts[0].fY),
192 fPts[1].fX), fPts[1].fY), fPts[2].fX), fPts[2].fY);
193 double largest = std::max(std::max(std::max(std::max(std::max(fPts[0].fX, fPts[0].fY),
194 fPts[1].fX), fPts[1].fY), fPts[2].fX), fPts[2].fY);
203 SkDVector result = { a * fPts[0].fX + b * fPts[1].fX + c * fPts[2].fX,
204 a * fPts[0].fY + b * fPts[1].fY + c * fPts[2].fY };
207 result = fPts[2] - fPts[0];
219 return fPts[0];
222 return fPts[2];
228 SkDPoint result = { a * fPts[0].fX + b * fPts[1].fX + c * fPts[2].fX,
229 a * fPts[0].fY + b * fPts[1].fY + c * fPts[2].fY };
247 return between(fPts[0].fX, fPts[1].fX, fPts[2].fX);
251 return between(fPts[0].fY, fPts[1].fY, fPts[2].fY);
283 double ax = dst[0].fX = interp_quad_coords(&fPts[0].fX, t1);
284 double ay = dst[0].fY = interp_quad_coords(&fPts[0].fY, t1);
285 double dx = interp_quad_coords(&fPts[0].fX, (t1 + t2) / 2);
286 double dy = interp_quad_coords(&fPts[0].fY, (t1 + t2) / 2);
287 double cx = dst[2].fX = interp_quad_coords(&fPts[0].fX, t2);
288 double cy = dst[2].fY = interp_quad_coords(&fPts[0].fY, t2);
295 if (fPts[endIndex].fX == fPts[1].fX) {
296 dstPt->fX = fPts[endIndex].fX;
298 if (fPts[endIndex].fY == fPts[1].fY) {
299 dstPt->fY = fPts[endIndex].fY;
350 interp_quad_coords(&fPts[0].fX, &dst.pts[0].fX, t);
351 interp_quad_coords(&fPts[0].fY, &dst.pts[0].fY, t);