/external/skia/src/pathops/ |
SkDCubicToQuads.cpp | 38 const SkDPoint fromC1 = {(3 * fPts[1].fX - fPts[0].fX) / 2, (3 * fPts[1].fY - fPts[0].fY) / 2}; 39 const SkDPoint fromC2 = {(3 * fPts[2].fX - fPts[3].fX) / 2, (3 * fPts[2].fY - fPts[3].fY) / 2}; 41 quad[1].fY = (fromC1.fY + fromC2.fY) / 2;
|
SkPathOpsPoint.h | 14 return AlmostEqualUlps(pt1.fX, pt2.fX) && AlmostEqualUlps(pt1.fY, pt2.fY); 19 double fY; 23 fY = pt.fY; 29 fY += v.fY; 35 fY -= v.fY; 41 fY /= s [all...] |
SkPathOpsPoint.cpp | 10 SkDVector v = {a.fX - b.fX, a.fY - b.fY};
|
SkLineParameters.h | 55 if (NotAlmostEqualUlps(pts[0].fY, pts[++endIndex].fY)) { 56 if (pts[0].fY > pts[endIndex].fY) { 65 if (pts[0].fY > pts[3].fY) { 72 fA = pts[s].fY - pts[e].fY; 74 fC = pts[s].fX * pts[e].fY - pts[e].fX * pts[s].fY; [all...] |
SkOpCubicHull.cpp | 10 double dy = cubic[index].fY - cubic[zero].fY; 18 rotPath[index].fY = cubic[zero].fY; 22 if (approximately_equal(cubic[side1].fY, cubic[zero].fY)) { 23 rotPath[side1].fY = cubic[zero].fY; 25 if (approximately_equal(cubic[side2].fY, cubic[zero].fY)) { [all...] |
SkPathOpsBounds.h | 38 if (pt.fY < fTop) fTop = pt.fY; 40 if (pt.fY > fBottom) fBottom = pt.fY; 45 if (pt.fY < fTop) fTop = SkDoubleToScalar(pt.fY); 47 if (pt.fY > fBottom) fBottom = SkDoubleToScalar(pt.fY); 53 && AlmostLessOrEqualUlps(fTop, pt.fY) 54 && AlmostLessOrEqualUlps(pt.fY, fBottom) [all...] |
SkPathOpsLine.cpp | 17 SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY }; 33 || !AlmostBetweenUlps(fPts[0].fY, xy.fY, fPts[1].fY)) { 38 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRay 40 double numer = len.fX * ab0.fX + ab0.fY * len.fY; 51 double tiniest = SkTMin(SkTMin(SkTMin(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY) [all...] |
/external/skqp/src/pathops/ |
SkDCubicToQuads.cpp | 38 const SkDPoint fromC1 = {(3 * fPts[1].fX - fPts[0].fX) / 2, (3 * fPts[1].fY - fPts[0].fY) / 2}; 39 const SkDPoint fromC2 = {(3 * fPts[2].fX - fPts[3].fX) / 2, (3 * fPts[2].fY - fPts[3].fY) / 2}; 41 quad[1].fY = (fromC1.fY + fromC2.fY) / 2;
|
SkPathOpsPoint.h | 14 return AlmostEqualUlps(pt1.fX, pt2.fX) && AlmostEqualUlps(pt1.fY, pt2.fY); 19 double fY; 23 fY = pt.fY; 29 fY += v.fY; 35 fY -= v.fY; 41 fY /= s [all...] |
SkPathOpsPoint.cpp | 10 SkDVector v = {a.fX - b.fX, a.fY - b.fY};
|
SkLineParameters.h | 55 if (NotAlmostEqualUlps(pts[0].fY, pts[++endIndex].fY)) { 56 if (pts[0].fY > pts[endIndex].fY) { 65 if (pts[0].fY > pts[3].fY) { 72 fA = pts[s].fY - pts[e].fY; 74 fC = pts[s].fX * pts[e].fY - pts[e].fX * pts[s].fY; [all...] |
SkOpCubicHull.cpp | 10 double dy = cubic[index].fY - cubic[zero].fY; 18 rotPath[index].fY = cubic[zero].fY; 22 if (approximately_equal(cubic[side1].fY, cubic[zero].fY)) { 23 rotPath[side1].fY = cubic[zero].fY; 25 if (approximately_equal(cubic[side2].fY, cubic[zero].fY)) { [all...] |
SkPathOpsBounds.h | 38 if (pt.fY < fTop) fTop = pt.fY; 40 if (pt.fY > fBottom) fBottom = pt.fY; 45 if (pt.fY < fTop) fTop = SkDoubleToScalar(pt.fY); 47 if (pt.fY > fBottom) fBottom = SkDoubleToScalar(pt.fY); 53 && AlmostLessOrEqualUlps(fTop, pt.fY) 54 && AlmostLessOrEqualUlps(pt.fY, fBottom) [all...] |
SkPathOpsLine.cpp | 17 SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY }; 33 || !AlmostBetweenUlps(fPts[0].fY, xy.fY, fPts[1].fY)) { 38 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRay 40 double numer = len.fX * ab0.fX + ab0.fY * len.fY; 51 double tiniest = SkTMin(SkTMin(SkTMin(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY) [all...] |
/external/skia/include/core/ |
SkPoint.h | 21 int16_t fY; //!< y-axis value used by SkIPoint16 23 /** Sets fX to x, fY to y. If SK_DEBUG is defined, asserts 42 @return fY 44 int16_t y() const { return fY; } 46 /** Sets fX to x and fY to y. 49 @param y new value for fY 53 fY = SkToS16(y); 66 int32_t fY; //!< y-axis value used by SkIPoint. 68 /** Sets fX to x, fY to y. 86 @return fY [all...] |
SkPoint3.h | 14 SkScalar fX, fY, fZ; 23 SkScalar y() const { return fY; } 26 void set(SkScalar x, SkScalar y, SkScalar z) { fX = x; fY = y; fZ = z; } 29 return a.fX == b.fX && a.fY == b.fY && a.fZ == b.fZ; 42 SkScalar length() const { return SkPoint3::Length(fX, fY, fZ); } 54 p.set(scale * fX, scale * fY, scale * fZ); 62 fY *= value; 72 neg.fY = -fY; [all...] |
/external/skqp/include/core/ |
SkPoint.h | 20 int16_t fY; //!< y-axis value used by SkIPoint16. 22 /** Sets fX to x, fY to y. If SK_DEBUG is defined, asserts 41 @return fY 43 int16_t y() const { return fY; } 45 /** Sets fX to x and fY to y. 48 @param y new value for fY 52 fY = SkToS16(y); 65 int32_t fY; //!< y-axis value used by SkIPoint. 67 /** Sets fX to x, fY to y. 85 @return fY [all...] |
SkPoint3.h | 14 SkScalar fX, fY, fZ; 23 SkScalar y() const { return fY; } 26 void set(SkScalar x, SkScalar y, SkScalar z) { fX = x; fY = y; fZ = z; } 29 return a.fX == b.fX && a.fY == b.fY && a.fZ == b.fZ; 42 SkScalar length() const { return SkPoint3::Length(fX, fY, fZ); } 54 p.set(scale * fX, scale * fY, scale * fZ); 62 fY *= value; 72 neg.fY = -fY; [all...] |
/external/skia/src/core/ |
SkQuadClipper.cpp | 42 return chopMonoQuadAt(pts[0].fY, pts[1].fY, pts[2].fY, y, t); 55 if (srcPts[0].fY > srcPts[2].fY) { 68 if (dst[2].fY <= ctop || dst[0].fY >= cbot) { 76 if (dst[0].fY < ctop) { 86 if (dst[i].fY < ctop) { 87 dst[i].fY = ctop [all...] |
SkStrokerPriv.cpp | 15 path->lineTo(stop.fX, stop.fY); 35 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); 36 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); 38 path->lineTo(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); [all...] |
SkAnalyticEdge.h | 31 SkFixed fY; // The current y 54 // Update fX, fY of this edge so fY = y 56 if (y == fY + SK_Fixed1) { 58 fY = y; 59 } else if (y != fY) { 63 fY = y; 69 SkASSERT(fDX == 0 || y - fY == SK_Fixed1 >> yShift); 70 fY = y; 89 fUpperY, fLowerY, SkFixedToFloat(fY), SkFixedToFloat(fX) [all...] |
SkWritePixelsRec.h | 22 , fY(y) 30 , fY(y) 37 int fY;
|
/external/skqp/src/core/ |
SkQuadClipper.cpp | 42 return chopMonoQuadAt(pts[0].fY, pts[1].fY, pts[2].fY, y, t); 55 if (srcPts[0].fY > srcPts[2].fY) { 68 if (dst[2].fY <= ctop || dst[0].fY >= cbot) { 76 if (dst[0].fY < ctop) { 86 if (dst[i].fY < ctop) { 87 dst[i].fY = ctop [all...] |
SkStrokerPriv.cpp | 15 path->lineTo(stop.fX, stop.fY); 35 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); 36 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); 38 path->lineTo(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); [all...] |
SkAnalyticEdge.h | 31 SkFixed fY; // The current y 54 // Update fX, fY of this edge so fY = y 56 if (y == fY + SK_Fixed1) { 58 fY = y; 59 } else if (y != fY) { 63 fY = y; 69 SkASSERT(fDX == 0 || y - fY == SK_Fixed1 >> yShift); 70 fY = y; 89 fUpperY, fLowerY, SkFixedToFloat(fY), SkFixedToFloat(fX) [all...] |