| /third_party/skia/src/pathops/ |
| D | SkPathOpsConic.h | 13 struct SkDConic { struct
36 SkDConic flip() const { in flip() argument
37 SkDConic result = {{{fPts[2], fPts[1], fPts[0]} in flip()
48 const SkDConic& set(const SkPoint pts[kPointCount], SkScalar weight in set() argument
73 bool hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects() argument
109 SkDConic subDivide(double t1, double t2) const; argument
110 void subDivide(double t1, double t2, SkDConic* c) const { *c = this->subDivide(t1, t2); } in subDivide() argument
112 static SkDConic SubDivide(const SkPoint a[kPointCount], SkScalar weight, double t1, double t2) { in SubDivide() argument
113 SkDConic conic; in SubDivide()
124 SkDConic conic; in SubDivide() argument
[all …]
|
| D | SkDConicLineIntersection.cpp | 19 LineConicIntersections(const SkDConic& c, const SkDLine& l, SkIntersections* i) in LineConicIntersections()
27 LineConicIntersections(const SkDConic& c) in LineConicIntersections()
179 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addExactEndPoints()
190 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addNearEndPoints()
220 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addExactHorizontalEndPoints()
231 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addNearHorizontalEndPoints()
246 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addExactVerticalEndPoints()
257 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addNearVerticalEndPoints()
341 const SkDConic& fConic;
347 int SkIntersections::horizontal(const SkDConic& conic, double left, double right, double y, in horizontal()
[all …]
|
| D | SkPathOpsConic.cpp | 32 int SkDConic::FindExtrema(const double src[], SkScalar w, double t[1]) { in FindExtrema()
50 SkDVector SkDConic::dxdyAtT(double t) const { in dxdyAtT()
84 bool SkDConic::hullIntersects(const SkDCubic& cubic, bool* isLinear) const { in hullIntersects()
88 SkDPoint SkDConic::ptAtT(double t) const { in ptAtT()
124 SkDConic SkDConic::subDivide(double t1, double t2) const { in subDivide()
163 SkDConic dst = {{{{ax / az, ay / az}, {bx / bz, by / bz}, {cx / cz, cy / cz}} in subDivide()
169 SkDPoint SkDConic::subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2, in subDivide()
171 SkDConic chopped = this->subDivide(t1, t2); in subDivide()
|
| D | SkIntersections.h | 59 SkDConic conic; in conicHorizontal()
67 SkDConic conic; in conicVertical()
74 SkDConic conic; in conicLine()
247 int horizontal(const SkDConic&, double left, double right, double y, bool flipped);
252 static int HorizontalIntercept(const SkDConic& conic, SkScalar y, double* roots);
261 int intersect(const SkDConic&, const SkDLine&);
262 int intersect(const SkDConic&, const SkDQuad&);
263 int intersect(const SkDConic&, const SkDConic&);
266 int intersect(const SkDCubic&, const SkDConic&);
270 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 | SkPathOpsRect.h | 52 void setBounds(const SkDConic& curve) { in setBounds()
56 void setBounds(const SkDConic& curve, const SkDConic& sub, double tStart, double tEnd);
|
| D | SkPathOpsCurve.h | 52 SkDConic fConic;
115 SkDConic conic; in dconic_xy_at_t()
195 SkDConic conic; in dconic_dxdy_at_t()
277 SkDConic conic; in conic_is_vertical()
279 SkDConic dst = conic.subDivide(startT, endT); in conic_is_vertical()
315 SkDConic conic; in conic_intersect_ray()
389 SkDConic conic; in conic_intercept_h()
394 SkDConic conic; in conic_intercept_v()
|
| D | SkPathOpsQuad.h | 82 bool hullIntersects(const SkDConic& , bool* isLinear) const;
157 bool hullIntersects(const SkDConic& conic, bool* isLinear) const override;
|
| D | SkPathOpsDebug.h | 30 struct SkDConic;
450 void Dump(const SkDConic& );
451 void DumpID(const SkDConic& , int id);
|
| D | SkPathOpsTCurve.h | 30 virtual bool hullIntersects(const SkDConic& , bool* isLinear) const = 0;
|
| D | SkPathOpsCubic.h | 80 bool hullIntersects(const SkDConic& c, bool* isLinear) const;
210 bool hullIntersects(const SkDConic& conic, bool* isLinear) const override;
|
| D | SkPathOpsQuad.cpp | 85 bool SkDQuad::hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects()
406 bool SkTQuad::hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects()
|
| D | SkPathOpsAsWinding.cpp | 128 SkDConic conic; in left_edge()
131 roots = SkDConic::FindExtrema(&conic[0].fX, weight, &t); in left_edge()
|
| D | SkPathOpsCurve.cpp | 64 SkDConic dCurve; in setConicBounds()
|
| D | SkPathOpsCubic.cpp | 206 bool SkDCubic::hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects()
746 bool SkTCubic::hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects()
|
| D | SkPathOpsTSect.cpp | 2093 int SkIntersections::intersect(const SkDConic& c, const SkDQuad& q) { in intersect()
2102 int SkIntersections::intersect(const SkDConic& c1, const SkDConic& c2) { in intersect()
2120 int SkIntersections::intersect(const SkDCubic& cu, const SkDConic& co) { in intersect()
|
| D | SkPathOpsTypes.h | 564 struct SkDConic;
|
| D | SkAddIntersections.cpp | 287 SkDConic conic1, conic2; in AddIntersectTs()
|
| /third_party/skia/tests/ |
| D | PathOpsConicIntersectionTest.cpp | 47 static void chopCompare(const SkConic chopped[2], const SkDConic dChopped[2]) { in chopCompare()
116 static void writeDPng(const SkDConic& dC, const char* name) { in writeDPng()
118 SkDConic dConic = {{{ {dC.fPts[0].fX * scale, dC.fPts[0].fY * scale }, in writeDPng()
145 SkDConic chopped = dConic.subDivide(tIndex / (double) chops, in writeDPng()
158 static void chopBothWays(const SkDConic& dConic, double t, const char* name) { in chopBothWays()
165 SkDConic dChopped[2]; in chopBothWays()
181 const SkDConic frame0[] = {
186 const SkDConic frame1[] = {
193 const SkDConic frame2[] = {
200 const SkDConic frame3[] = {
[all …]
|
| D | PathOpsConicLineIntersectionTest.cpp | 34 static int doIntersect(SkIntersections& intersections, const SkDConic& conic, const SkDLine& line, in doIntersect()
77 SkDConic conic; in testOneOffs()
105 SkDConic conic; in DEF_TEST()
|
| D | PathOpsTestCommon.h | 34 bool ValidConic(const SkDConic& cubic);
|
| D | PathOpsCubicConicIntersectionTest.cpp | 51 SkDConic conic; in cubicConicIntersection()
|
| D | PathOpsConicQuadIntersectionTest.cpp | 36 SkDConic conic; in conicQuadIntersection()
|
| D | PathOpsTestCommon.cpp | 263 bool ValidConic(const SkDConic& conic) { in ValidConic()
264 for (int index = 0; index < SkDConic::kPointCount; ++index) { in ValidConic()
|
| D | PathOpsDebug.cpp | 67 void SkDConic::dump() const { in dump()
72 void SkDConic::dumpID(int id) const { in dumpID()
77 void SkDConic::dumpInner() const { in dumpInner()
1487 void Dump(const SkDConic& conic) { in Dump()
1491 void DumpID(const SkDConic& conic, int id) { in DumpID()
|