| /external/skia/src/pathops/ |
| D | SkPathOpsTSect.cpp | 17 int SkIntersections::intersect(const SkDConic& conic, const SkDQuad& quad) { in intersect()
18 SkTSect<SkDConic, SkDQuad> sect1(conic PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in intersect()
19 SkTSect<SkDQuad, SkDConic> sect2(quad PATH_OPS_DEBUG_T_SECT_PARAMS(2)); in intersect()
20 SkTSect<SkDConic, SkDQuad>::BinarySearch(§1, §2, this); in intersect()
24 int SkIntersections::intersect(const SkDConic& conic1, const SkDConic& conic2) { in intersect()
25 SkTSect<SkDConic, SkDConic> sect1(conic1 PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in intersect()
26 SkTSect<SkDConic, SkDConic> sect2(conic2 PATH_OPS_DEBUG_T_SECT_PARAMS(2)); in intersect()
27 SkTSect<SkDConic, SkDConic>::BinarySearch(§1, §2, this); in intersect()
38 int SkIntersections::intersect(const SkDCubic& cubic, const SkDConic& conic) { in intersect()
39 SkTSect<SkDCubic, SkDConic> sect1(cubic PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in intersect()
[all …]
|
| D | SkPathOpsConic.h | 14 struct SkDConic { struct
34 SkDConic flip() const { in flip() argument
35 SkDConic result = {{{fPts[2], fPts[1], fPts[0]}}, fWeight}; in flip()
41 const SkDConic& set(const SkPoint pts[kPointCount], SkScalar weight) { in set() argument
65 bool hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects() argument
97 SkDConic subDivide(double t1, double t2) const; argument
99 static SkDConic SubDivide(const SkPoint a[kPointCount], SkScalar weight, double t1, double t2) { in SubDivide() argument
100 SkDConic conic; in SubDivide()
111 SkDConic conic; in SubDivide() argument
|
| D | SkDConicLineIntersection.cpp | 18 LineConicIntersections(const SkDConic& c, const SkDLine& l, SkIntersections* i) in LineConicIntersections()
26 LineConicIntersections(const SkDConic& c) in LineConicIntersections()
173 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addExactEndPoints()
184 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addNearEndPoints()
199 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addExactHorizontalEndPoints()
210 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addNearHorizontalEndPoints()
225 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addExactVerticalEndPoints()
236 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addNearVerticalEndPoints()
320 const SkDConic& fConic;
326 int SkIntersections::horizontal(const SkDConic& conic, double left, double right, double y, in horizontal()
[all …]
|
| D | SkPathOpsConic.cpp | 31 int SkDConic::FindExtrema(const double src[], SkScalar w, double t[1]) { in FindExtrema()
46 SkDVector SkDConic::dxdyAtT(double t) const { in dxdyAtT()
72 bool SkDConic::hullIntersects(const SkDCubic& cubic, bool* isLinear) const { in hullIntersects()
76 SkDPoint SkDConic::ptAtT(double t) const { in ptAtT()
86 SkDConic SkDConic::subDivide(double t1, double t2) const { in subDivide()
104 SkDConic dst = {{{{ax / az, ay / az}, {bx / bz, by / bz}, {cx / cz, cy / cz}}}, w }; in subDivide()
108 SkDPoint SkDConic::subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2, in subDivide()
110 SkDConic chopped = this->subDivide(t1, t2); in subDivide()
|
| D | SkIntersections.h | 55 SkDConic conic; in conicHorizontal()
63 SkDConic conic; in conicVertical()
70 SkDConic conic; in conicLine()
234 int horizontal(const SkDConic&, double left, double right, double y, bool flipped);
239 static int HorizontalIntercept(const SkDConic& conic, SkScalar y, double* roots);
248 int intersect(const SkDConic&, const SkDLine&);
249 int intersect(const SkDConic&, const SkDQuad&);
250 int intersect(const SkDConic&, const SkDConic&);
253 int intersect(const SkDCubic&, const SkDConic&);
257 int intersectRay(const SkDConic&, const SkDLine&);
[all …]
|
| D | SkPathOpsRect.cpp | 30 void SkDRect::setBounds(const SkDConic& curve, const SkDConic& sub, double startT, double endT) { in setBounds()
36 roots = SkDConic::FindExtrema(&sub[0].fX, sub.fWeight, tValues); in setBounds()
39 roots += SkDConic::FindExtrema(&sub[0].fY, sub.fWeight, &tValues[roots]); in setBounds()
|
| D | SkPathOpsCurve.h | 52 SkDConic fConic;
99 SkDConic conic; in dconic_xy_at_t()
155 SkDConic conic; in dconic_dxdy_at_t()
213 SkDConic conic; in conic_is_vertical()
215 SkDConic dst = conic.subDivide(startT, endT); in conic_is_vertical()
251 SkDConic conic; in conic_intersect_ray()
295 SkDConic conic; in conic_intercept_h()
300 SkDConic conic; in conic_intercept_v()
|
| D | SkPathOpsRect.h | 51 void setBounds(const SkDConic& curve) { in setBounds()
55 void setBounds(const SkDConic& curve, const SkDConic& sub, double tStart, double tEnd);
|
| D | SkConicLineIntersection.cpp | 13 LineConicIntersections(const SkDConic& c, const SkDLine& l, SkIntersections* i) in LineConicIntersections()
30 int SkIntersections::intersectRay(const SkDConic& conic, const SkDLine& line) { in intersectRay()
|
| D | SkPathOpsCurve.cpp | 13 SkDConic dCurve; in setConicBounds()
|
| D | SkPathOpsQuad.h | 66 bool hullIntersects(const SkDConic& , bool* isLinear) const;
|
| D | SkPathOpsCubic.h | 83 bool hullIntersects(const SkDConic& c, bool* isLinear) const;
|
| D | SkPathOpsQuad.cpp | 51 bool SkDQuad::hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects()
|
| D | SkPathOpsTypes.h | 454 struct SkDConic;
|
| D | SkAddIntersections.cpp | 286 SkDConic conic1, conic2; in AddIntersectTs()
|
| D | SkPathOpsCubic.cpp | 209 bool SkDCubic::hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects()
|
| D | SkOpSegment.cpp | 1544 edge->fPts[1] = SkDConic::SubDivide(fPts, fWeight, sub[0], sub[1], in subDivide()
1594 edge->fConic[1] = SkDConic::SubDivide(fPts, fWeight, edge->fQuad[0], edge->fQuad[2], in subDivide()
|
| /external/skia/tests/ |
| D | PathOpsDebug.cpp | 51 void SkDConic::dump() const { in dump()
56 void SkDConic::dumpID(int id) const { in dumpID()
61 void SkDConic::dumpInner() const { in dumpInner()
365 SkDConic conic; in DontCallDebugSpan()
368 SkTSect<SkDQuad, SkDConic> q1k2(quad PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
370 SkTSect<SkDConic, SkDQuad> k1q2(conic PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
371 SkTSect<SkDConic, SkDConic> k1k2(conic PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
372 SkTSect<SkDConic, SkDCubic> k1c2(conic PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
374 SkTSect<SkDCubic, SkDConic> c1k2(cubic PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
395 SkDConic conic; in DontCallDebugT()
[all …]
|
| D | PathOpsConicIntersectionTest.cpp | 19 static const SkDConic testSet[] = {
29 static void oneOff(skiatest::Reporter* reporter, const SkDConic& c1, const SkDConic& c2, in oneOff()
55 const SkDConic& c1 = testSet[outer]; in oneOff()
56 const SkDConic& c2 = testSet[inner]; in oneOff()
|
| D | PathOpsConicLineIntersectionTest.cpp | 16 SkDConic conic;
31 static int doIntersect(SkIntersections& intersections, const SkDConic& conic, const SkDLine& line, in doIntersect()
59 SkDConic conic;
71 const SkDConic& conic = oneOffs[index].conic; in testOneOffs()
98 const SkDConic& conic = lineConicTests[index].conic; in DEF_TEST()
|
| D | PathOpsTestCommon.h | 19 bool ValidConic(const SkDConic& cubic);
|
| D | PathOpsTestCommon.cpp | 268 bool ValidConic(const SkDConic& conic) { in ValidConic()
269 for (int index = 0; index < SkDConic::kPointCount; ++index) { in ValidConic()
|