/third_party/flutter/skia/tests/ |
D | PathOpsConicIntersectionTest.cpp | 138 path.moveTo(dConic.fPts[0].asSkPoint()); in writeDPng() 139 path.conicTo(dConic.fPts[1].asSkPoint(), dConic.fPts[2].asSkPoint(), dConic.fWeight); in writeDPng() 147 path.moveTo(chopped.fPts[0].asSkPoint()); in writeDPng() 148 path.conicTo(chopped.fPts[1].asSkPoint(), chopped.fPts[2].asSkPoint(), chopped.fWeight); in writeDPng() 161 conic.fPts[index] = dConic.fPts[index].asSkPoint(); in chopBothWays() 280 path.moveTo(dConic.fPts[0].asSkPoint()); in writeFrames() 281 path.conicTo(dConic.fPts[1].asSkPoint(), dConic.fPts[2].asSkPoint(), dConic.fWeight); in writeFrames()
|
D | PathOpsDLineTest.cpp | 27 SkPoint pts[2] = {line[0].asSkPoint(), line[1].asSkPoint()}; in DEF_TEST()
|
D | PathOpsTestCommon.cpp | 190 quads[index][1].asSkPoint(), in CubicPathToQuads() 191 quads[index][2].asSkPoint() in CubicPathToQuads() 236 cPts[0] = part[1].asSkPoint(); in CubicPathToSimple() 237 cPts[1] = part[2].asSkPoint(); in CubicPathToSimple() 238 cPts[2] = part[3].asSkPoint(); in CubicPathToSimple()
|
D | PathOpsConicLineIntersectionTest.cpp | 112 SkPoint pts[3] = { conic.fPts.fPts[0].asSkPoint(), conic.fPts.fPts[1].asSkPoint(), in DEF_TEST() 113 conic.fPts.fPts[2].asSkPoint() }; in DEF_TEST()
|
D | PathOpsAngleTest.cpp | 44 SkPoint pt = dPt.asSkPoint(); in DEF_TEST() 104 } while (last.asSkPoint() != quad[1].asSkPoint()); in DEF_TEST() 249 data.fShortPts[idx2] = data.fPts.fPts[idx2].asSkPoint(); in DEF_TEST() 448 temp[idx2] = data.fPts.fPts[idx2].asSkPoint(); in DEF_TEST()
|
D | PathOpsDPointTest.cpp | 36 SkPoint sPt = pt.asSkPoint(); in DEF_TEST()
|
/third_party/skia/tests/ |
D | PathOpsConicIntersectionTest.cpp | 138 path.moveTo(dConic.fPts[0].asSkPoint()); in writeDPng() 139 path.conicTo(dConic.fPts[1].asSkPoint(), dConic.fPts[2].asSkPoint(), dConic.fWeight); in writeDPng() 147 path.moveTo(chopped.fPts[0].asSkPoint()); in writeDPng() 148 path.conicTo(chopped.fPts[1].asSkPoint(), chopped.fPts[2].asSkPoint(), chopped.fWeight); in writeDPng() 161 conic.fPts[index] = dConic.fPts[index].asSkPoint(); in chopBothWays() 280 path.moveTo(dConic.fPts[0].asSkPoint()); in writeFrames() 281 path.conicTo(dConic.fPts[1].asSkPoint(), dConic.fPts[2].asSkPoint(), dConic.fWeight); in writeFrames()
|
D | PathOpsDLineTest.cpp | 27 SkPoint pts[2] = {line[0].asSkPoint(), line[1].asSkPoint()}; in DEF_TEST()
|
D | PathOpsTestCommon.cpp | 188 quads[index][1].asSkPoint(), in CubicPathToQuads() 189 quads[index][2].asSkPoint() in CubicPathToQuads() 231 cPts[0] = part[1].asSkPoint(); in CubicPathToSimple() 232 cPts[1] = part[2].asSkPoint(); in CubicPathToSimple() 233 cPts[2] = part[3].asSkPoint(); in CubicPathToSimple()
|
D | PathOpsConicLineIntersectionTest.cpp | 111 SkPoint pts[3] = { conic.fPts.fPts[0].asSkPoint(), conic.fPts.fPts[1].asSkPoint(), in DEF_TEST() 112 conic.fPts.fPts[2].asSkPoint() }; in DEF_TEST()
|
D | PathOpsAngleTest.cpp | 43 SkPoint pt = dPt.asSkPoint(); in DEF_TEST() 103 } while (last.asSkPoint() != quad[1].asSkPoint()); in DEF_TEST() 248 data.fShortPts[idx2] = data.fPts.fPts[idx2].asSkPoint(); in DEF_TEST() 445 temp[idx2] = data.fPts.fPts[idx2].asSkPoint(); in DEF_TEST()
|
D | PathOpsDPointTest.cpp | 36 SkPoint sPt = pt.asSkPoint(); in DEF_TEST()
|
/third_party/skia/src/pathops/ |
D | SkPathOpsCurve.h | 32 fPts[index] = quad[index].asSkPoint(); in set() 40 fPts[index] = cubic[index].asSkPoint(); in set() 159 return dline_xy_at_t(a, weight, t).asSkPoint(); in fline_xy_at_t() 163 return dquad_xy_at_t(a, weight, t).asSkPoint(); in fquad_xy_at_t() 167 return dconic_xy_at_t(a, weight, t).asSkPoint(); in fconic_xy_at_t() 171 return dcubic_xy_at_t(a, weight, t).asSkPoint(); in fcubic_xy_at_t()
|
D | SkDQuadLineIntersection.cpp | 395 SkPoint gridPt = pt->asSkPoint(); in pinTs() 396 if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[0].asSkPoint())) { in pinTs() 399 } else if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[1].asSkPoint())) { in pinTs() 406 if (gridPt == fQuad[0].asSkPoint()) { in pinTs() 409 } else if (gridPt == fQuad[2].asSkPoint()) { in pinTs()
|
D | SkDConicLineIntersection.cpp | 295 SkPoint gridPt = pt->asSkPoint(); in pinTs() 296 if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[0].asSkPoint())) { in pinTs() 299 } else if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[1].asSkPoint())) { in pinTs() 306 if (gridPt == fConic[0].asSkPoint()) { in pinTs() 309 } else if (gridPt == fConic[2].asSkPoint()) { in pinTs()
|
D | SkDCubicLineIntersection.cpp | 397 SkPoint gridPt = pt->asSkPoint(); in pinTs() 398 if (gridPt == fLine[0].asSkPoint()) { in pinTs() 400 } else if (gridPt == fLine[1].asSkPoint()) { in pinTs() 403 if (gridPt == fCubic[0].asSkPoint() && approximately_equal(*cubicT, 0)) { in pinTs() 405 } else if (gridPt == fCubic[3].asSkPoint() && approximately_equal(*cubicT, 1)) { in pinTs()
|
D | SkPathOpsAsWinding.cpp | 121 result = quad.ptAtT(t).asSkPoint(); in left_edge() 134 result = conic.ptAtT(t).asSkPoint(); in left_edge() 149 SkPoint temp = cubic.ptAtT(tValues[index]).asSkPoint(); in left_edge() 157 result = cubic.ptAtT(t).asSkPoint(); in left_edge()
|
D | SkReduceOrder.cpp | 253 *reducePts++ = reducer.fLine[index].asSkPoint(); in Quad() 279 *reducePts++ = reducer.fQuad[index].asSkPoint(); in Cubic()
|
/third_party/flutter/skia/src/pathops/ |
D | SkPathOpsCurve.h | 32 fPts[index] = quad[index].asSkPoint(); in set() 40 fPts[index] = cubic[index].asSkPoint(); in set() 159 return dline_xy_at_t(a, weight, t).asSkPoint(); in fline_xy_at_t() 163 return dquad_xy_at_t(a, weight, t).asSkPoint(); in fquad_xy_at_t() 167 return dconic_xy_at_t(a, weight, t).asSkPoint(); in fconic_xy_at_t() 171 return dcubic_xy_at_t(a, weight, t).asSkPoint(); in fcubic_xy_at_t()
|
D | SkDQuadLineIntersection.cpp | 395 SkPoint gridPt = pt->asSkPoint(); in pinTs() 396 if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[0].asSkPoint())) { in pinTs() 399 } else if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[1].asSkPoint())) { in pinTs() 406 if (gridPt == fQuad[0].asSkPoint()) { in pinTs() 409 } else if (gridPt == fQuad[2].asSkPoint()) { in pinTs()
|
D | SkDConicLineIntersection.cpp | 295 SkPoint gridPt = pt->asSkPoint(); in pinTs() 296 if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[0].asSkPoint())) { in pinTs() 299 } else if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[1].asSkPoint())) { in pinTs() 306 if (gridPt == fConic[0].asSkPoint()) { in pinTs() 309 } else if (gridPt == fConic[2].asSkPoint()) { in pinTs()
|
D | SkDCubicLineIntersection.cpp | 397 SkPoint gridPt = pt->asSkPoint(); in pinTs() 398 if (gridPt == fLine[0].asSkPoint()) { in pinTs() 400 } else if (gridPt == fLine[1].asSkPoint()) { in pinTs() 403 if (gridPt == fCubic[0].asSkPoint() && approximately_equal(*cubicT, 0)) { in pinTs() 405 } else if (gridPt == fCubic[3].asSkPoint() && approximately_equal(*cubicT, 1)) { in pinTs()
|
D | SkPathOpsAsWinding.cpp | 120 result = quad.ptAtT(t).asSkPoint(); in left_edge() 133 result = conic.ptAtT(t).asSkPoint(); in left_edge() 148 SkPoint temp = cubic.ptAtT(tValues[index]).asSkPoint(); in left_edge() 156 result = cubic.ptAtT(t).asSkPoint(); in left_edge()
|
D | SkReduceOrder.cpp | 253 *reducePts++ = reducer.fLine[index].asSkPoint(); in Quad() 279 *reducePts++ = reducer.fQuad[index].asSkPoint(); in Cubic()
|
/third_party/skia/src/core/ |
D | SkGlyph.cpp | 213 expandGap(quad.ptAtT(roots[count]).asSkPoint().fX); in calculate_path_gap() 223 expandGap(cubic.ptAtT(roots[count]).asSkPoint().fX); in calculate_path_gap()
|