| /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()
282 path.moveTo(dConic.fPts[0].asSkPoint()); in writeFrames()
283 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 | 108 SkPoint pts[3] = { conic.fPts.fPts[0].asSkPoint(), conic.fPts.fPts[1].asSkPoint(), in DEF_TEST()
109 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()
250 data.fShortPts[idx2] = data.fPts.fPts[idx2].asSkPoint(); in DEF_TEST()
450 temp[idx2] = data.fPts.fPts[idx2].asSkPoint(); in DEF_TEST()
|
| D | PathOpsDPointTest.cpp | 36 SkPoint sPt = pt.asSkPoint(); in DEF_TEST()
|
| D | PathOpsAngleIdeas.cpp | 415 shortQuad[0] = quad[0].asSkPoint(); in makeSegment()
416 shortQuad[1] = quad[1].asSkPoint(); in makeSegment()
417 shortQuad[2] = quad[2].asSkPoint(); in makeSegment()
|
| D | PathOpsLineIntersectionTest.cpp | 102 REPORTER_ASSERT(reporter, result1.approximatelyEqual(ts.pt(i).asSkPoint())); in check_results()
|
| D | PathOpsCubicIntersectionTest.cpp | 646 c[i] = cubic.fPts[i].asSkPoint(); in selfOneOff()
|
| D | PathOpsOpTest.cpp | 3610 path.moveTo(q1a[0].fPts[0].asSkPoint()); in loop1asQuad()
3611 path.quadTo(q1a[0].fPts[1].asSkPoint(), q1a[0].fPts[2].asSkPoint()); in loop1asQuad()
3612 path.quadTo(q1a[1].fPts[1].asSkPoint(), q1a[1].fPts[2].asSkPoint()); in loop1asQuad()
3613 path.quadTo(q1[1].fPts[1].asSkPoint(), q1[1].fPts[2].asSkPoint()); in loop1asQuad()
3615 pathB.moveTo(q2[0].fPts[0].asSkPoint()); in loop1asQuad()
3616 pathB.quadTo(q2[0].fPts[1].asSkPoint(), q2[0].fPts[2].asSkPoint()); in loop1asQuad()
3617 pathB.quadTo(q2[1].fPts[1].asSkPoint(), q2[1].fPts[2].asSkPoint()); in loop1asQuad()
3859 path->quadTo(q1[1].asSkPoint(), q1[2].asSkPoint()); in complex_to_quads()
3860 path->quadTo(q2[1].asSkPoint(), q2[2].asSkPoint()); in complex_to_quads()
|
| /external/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 | 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 | 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 | SkReduceOrder.cpp | 253 *reducePts++ = reducer.fLine[index].asSkPoint(); in Quad()
279 *reducePts++ = reducer.fQuad[index].asSkPoint(); in Cubic()
|
| D | SkPathOpsDebug.h | 210 #define PT_DEBUG_DATA(i, n) i.pt(n).asSkPoint().fX, i.pt(n).asSkPoint().fY
|
| D | SkPathOpsPoint.h | 209 SkPoint asSkPoint() const { in asSkPoint() function
|
| D | SkOpSegment.cpp | 175 path->quadTo(curvePart.fCurve.fQuad[1].asSkPoint(), end->ptT()); in addCurveTo()
178 path->conicTo(curvePart.fCurve.fConic[1].asSkPoint(), end->ptT(), in addCurveTo()
182 path->cubicTo(curvePart.fCurve.fCubic[1].asSkPoint(), in addCurveTo()
183 curvePart.fCurve.fCubic[2].asSkPoint(), end->ptT()); in addCurveTo()
|
| D | SkOpAngle.cpp | 888 lineHalf[0].set(fPart.fCurve[0].asSkPoint()); in setSpans()
889 lineHalf[1].set(fPart.fCurve[1].asSkPoint()); in setSpans()
|
| D | SkAddIntersections.cpp | 516 SkPoint iPt = ts.pt(pt).asSkPoint(); in AddIntersectTs()
|
| /external/skia/src/core/ |
| D | SkGlyphCache.cpp | 280 SkPoint pt = quad.ptAtT(roots[count]).asSkPoint(); in AddQuad()
293 SkPoint pt = cubic.ptAtT(roots[count]).asSkPoint(); in AddCubic()
|
| D | SkGeometry.cpp | 843 dst[i] = pair.pts[i].asSkPoint(); in cubic_dchop_at_intercept()
|
| /external/skia/samplecode/ |
| D | SampleAAGeometry.cpp | 396 pts[1] = dCubic[1].asSkPoint(); in set_path_verb()
397 pts[2] = dCubic[2].asSkPoint(); in set_path_verb()
415 pts[1] = dQuad[1].asSkPoint(); in set_path_verb()
|