| /external/skia/tests/ |
| D | PathOpsConicIntersectionTest.cpp | 139 path.moveTo(dConic.fPts[0].asSkPoint()); in writeDPng()
140 path.conicTo(dConic.fPts[1].asSkPoint(), dConic.fPts[2].asSkPoint(), dConic.fWeight); in writeDPng()
148 path.moveTo(chopped.fPts[0].asSkPoint()); in writeDPng()
149 path.conicTo(chopped.fPts[1].asSkPoint(), chopped.fPts[2].asSkPoint(), chopped.fWeight); in writeDPng()
163 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 | 187 quads[index][1].asSkPoint(), in CubicPathToQuads()
188 quads[index][2].asSkPoint() in CubicPathToQuads()
232 cPts[0] = part[1].asSkPoint(); in CubicPathToSimple()
233 cPts[1] = part[2].asSkPoint(); in CubicPathToSimple()
234 cPts[2] = part[3].asSkPoint(); in CubicPathToSimple()
|
| D | PathOpsConicLineIntersectionTest.cpp | 103 SkPoint pts[3] = { conic.fPts.fPts[0].asSkPoint(), conic.fPts.fPts[1].asSkPoint(), in DEF_TEST()
104 conic.fPts.fPts[2].asSkPoint() }; in DEF_TEST()
|
| D | PathOpsAngleTest.cpp | 44 SkPoint pt = dPt.asSkPoint(); in DEF_TEST()
102 } while (last.asSkPoint() != quad[1].asSkPoint()); in DEF_TEST()
243 data.fShortPts[idx2] = data.fPts.fPts[idx2].asSkPoint(); in DEF_TEST()
442 temp[idx2] = data.fPts.fPts[idx2].asSkPoint(); in DEF_TEST()
|
| D | PathOpsDPointTest.cpp | 36 SkPoint sPt = pt.asSkPoint(); in DEF_TEST()
|
| D | PathOpsAngleIdeas.cpp | 411 shortQuad[0] = quad[0].asSkPoint(); in makeSegment()
412 shortQuad[1] = quad[1].asSkPoint(); in makeSegment()
413 shortQuad[2] = quad[2].asSkPoint(); in makeSegment()
|
| D | PathOpsLineIntersectionTest.cpp | 102 REPORTER_ASSERT(reporter, result1.approximatelyEqual(ts.pt(i).asSkPoint())); in check_results()
|
| D | PathOpsOpTest.cpp | 3607 path.moveTo(q1a[0].fPts[0].asSkPoint()); in loop1asQuad()
3608 path.quadTo(q1a[0].fPts[1].asSkPoint(), q1a[0].fPts[2].asSkPoint()); in loop1asQuad()
3609 path.quadTo(q1a[1].fPts[1].asSkPoint(), q1a[1].fPts[2].asSkPoint()); in loop1asQuad()
3610 path.quadTo(q1[1].fPts[1].asSkPoint(), q1[1].fPts[2].asSkPoint()); in loop1asQuad()
3612 pathB.moveTo(q2[0].fPts[0].asSkPoint()); in loop1asQuad()
3613 pathB.quadTo(q2[0].fPts[1].asSkPoint(), q2[0].fPts[2].asSkPoint()); in loop1asQuad()
3614 pathB.quadTo(q2[1].fPts[1].asSkPoint(), q2[1].fPts[2].asSkPoint()); in loop1asQuad()
3856 path->quadTo(q1[1].asSkPoint(), q1[2].asSkPoint()); in complex_to_quads()
3857 path->quadTo(q2[1].asSkPoint(), q2[2].asSkPoint()); in complex_to_quads()
|
| D | PathOpsCubicIntersectionTest.cpp | 631 c[i] = cubic[i].asSkPoint(); in selfOneOff()
|
| /external/skia/src/pathops/ |
| D | SkPathOpsCurve.h | 32 fPts[index] = quad[index].asSkPoint(); in set()
40 fPts[index] = cubic[index].asSkPoint(); in set()
119 return dline_xy_at_t(a, weight, t).asSkPoint(); in fline_xy_at_t()
123 return dquad_xy_at_t(a, weight, t).asSkPoint(); in fquad_xy_at_t()
127 return dconic_xy_at_t(a, weight, t).asSkPoint(); in fconic_xy_at_t()
131 return dcubic_xy_at_t(a, weight, t).asSkPoint(); in fcubic_xy_at_t()
|
| D | SkDQuadLineIntersection.cpp | 379 SkPoint gridPt = pt->asSkPoint(); in pinTs()
380 if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[0].asSkPoint())) { in pinTs()
383 } else if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[1].asSkPoint())) { in pinTs()
390 if (gridPt == fQuad[0].asSkPoint()) { in pinTs()
393 } else if (gridPt == fQuad[2].asSkPoint()) { in pinTs()
|
| D | SkDConicLineIntersection.cpp | 274 SkPoint gridPt = pt->asSkPoint(); in pinTs()
275 if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[0].asSkPoint())) { in pinTs()
278 } else if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[1].asSkPoint())) { in pinTs()
285 if (gridPt == fConic[0].asSkPoint()) { in pinTs()
288 } else if (gridPt == fConic[2].asSkPoint()) { in pinTs()
|
| D | SkDCubicLineIntersection.cpp | 379 SkPoint gridPt = pt->asSkPoint(); in pinTs()
380 if (gridPt == fLine[0].asSkPoint()) { in pinTs()
382 } else if (gridPt == fLine[1].asSkPoint()) { in pinTs()
385 if (gridPt == fCubic[0].asSkPoint() && approximately_equal(*cubicT, 0)) { in pinTs()
387 } else if (gridPt == fCubic[3].asSkPoint() && approximately_equal(*cubicT, 1)) { in pinTs()
|
| D | SkPathOpsDebug.h | 146 #define PT_DEBUG_DATA(i, n) i.pt(n).asSkPoint().fX, i.pt(n).asSkPoint().fY
|
| D | SkReduceOrder.cpp | 250 *reducePts++ = reducer.fLine[index].asSkPoint(); in Quad()
276 *reducePts++ = reducer.fQuad[index].asSkPoint(); in Cubic()
|
| D | SkPathOpsPoint.h | 175 SkPoint asSkPoint() const { in asSkPoint() function
|
| D | SkOpSegment.cpp | 1615 edge->fPts[1] = SkDQuad::SubDivide(fPts, sub[0], sub[1], startT, endT).asSkPoint(); in subDivide()
1618 startT, endT, &edge->fWeight).asSkPoint(); in subDivide()
1623 edge->fPts[1] = ctrl[0].asSkPoint(); in subDivide()
1624 edge->fPts[2] = ctrl[1].asSkPoint(); in subDivide()
|
| D | SkOpAngle.cpp | 902 lineHalf[0].set(fCurvePart[0].asSkPoint()); in setSpans()
903 lineHalf[1].set(fCurvePart[SkPathOpsVerbToPoints(verb)].asSkPoint()); in setSpans()
|
| /external/skia/src/core/ |
| D | SkGlyphCache.cpp | 298 SkPoint pt = quad.ptAtT(roots[count]).asSkPoint(); in AddQuad()
311 SkPoint pt = cubic.ptAtT(roots[count]).asSkPoint(); in AddCubic()
|
| D | SkGeometry.cpp | 878 dst[i] = pair.pts[i].asSkPoint(); in cubic_dchop_at_intercept()
|