Home
last modified time | relevance | path

Searched refs:SkDQuad (Results 1 – 25 of 41) sorted by relevance

12

/external/skia/src/pathops/
DSkPathOpsTSect.cpp10 int SkIntersections::intersect(const SkDQuad& quad1, const SkDQuad& quad2) { in intersect()
11 SkTSect<SkDQuad, SkDQuad> sect1(quad1 in intersect()
13 SkTSect<SkDQuad, SkDQuad> sect2(quad2 in intersect()
15 SkTSect<SkDQuad, SkDQuad>::BinarySearch(&sect1, &sect2, this); in intersect()
19 int SkIntersections::intersect(const SkDConic& conic, const SkDQuad& quad) { in intersect()
20 SkTSect<SkDConic, SkDQuad> sect1(conic in intersect()
22 SkTSect<SkDQuad, SkDConic> sect2(quad in intersect()
24 SkTSect<SkDConic, SkDQuad>::BinarySearch(&sect1, &sect2, this); in intersect()
37 int SkIntersections::intersect(const SkDCubic& cubic, const SkDQuad& quad) { in intersect()
38 SkTSect<SkDCubic, SkDQuad> sect1(cubic in intersect()
[all …]
DSkPathOpsQuad.h16 const SkDQuad& first() const { return (const SkDQuad&) pts[0]; } in first()
17 const SkDQuad& second() const { return (const SkDQuad&) pts[2]; } in second()
21 struct SkDQuad { struct
45 SkDQuad flip() const { in flip() argument
46 SkDQuad result = {{fPts[2], fPts[1], fPts[0]} SkDEBUGPARAMS(fDebugGlobalState) }; in flip()
52 const SkDQuad& set(const SkPoint pts[kPointCount] in set() argument
80 bool hullIntersects(const SkDQuad& , bool* isLinear) const; argument
91 SkDQuad subDivide(double t1, double t2) const;
92 static SkDQuad SubDivide(const SkPoint a[kPointCount], double t1, double t2) { in SubDivide() argument
93 SkDQuad quad; in SubDivide()
[all …]
DSkPathOpsQuad.cpp43 bool SkDQuad::hullIntersects(const SkDQuad& q2, bool* isLinear) const { in hullIntersects()
81 bool SkDQuad::hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects()
85 bool SkDQuad::hullIntersects(const SkDCubic& cubic, bool* isLinear) const { in hullIntersects()
98 void SkDQuad::otherPts(int oddMan, const SkDPoint* endPt[2]) const { in otherPts()
106 int SkDQuad::AddValidTs(double s[], int realRoots, double* t) { in AddValidTs()
134 int SkDQuad::RootsValidT(double A, double B, double C, double t[2]) { in RootsValidT()
149 int SkDQuad::RootsReal(const double A, const double B, const double C, double s[2]) { in RootsReal()
175 bool SkDQuad::isLinear(int startIndex, int endIndex) const { in isLinear()
189 SkDVector SkDQuad::dxdyAtT(double t) const { in dxdyAtT()
207 SkDPoint SkDQuad::ptAtT(double t) const { in ptAtT()
[all …]
DSkIntersections.h170 SkDQuad quad; in quadHorizontal()
177 SkDQuad quad; in quadVertical()
184 SkDQuad quad; in quadLine()
244 int horizontal(const SkDQuad&, double left, double right, double y, bool flipped);
245 int horizontal(const SkDQuad&, double left, double right, double y, double tRange[2]);
251 static int HorizontalIntercept(const SkDQuad& quad, SkScalar y, double* roots);
259 int intersect(const SkDQuad&, const SkDLine&);
260 int intersect(const SkDQuad&, const SkDQuad&);
262 int intersect(const SkDConic&, const SkDQuad&);
265 int intersect(const SkDCubic&, const SkDQuad&);
[all …]
DSkReduceOrder.cpp17 static int coincident_line(const SkDQuad& quad, SkDQuad& reduction) { in coincident_line()
22 static int reductionLineCount(const SkDQuad& reduction) { in reductionLineCount()
26 static int vertical_line(const SkDQuad& quad, SkDQuad& reduction) { in vertical_line()
32 static int horizontal_line(const SkDQuad& quad, SkDQuad& reduction) { in horizontal_line()
38 static int check_linear(const SkDQuad& quad, in check_linear()
39 int minX, int maxX, int minY, int maxY, SkDQuad& reduction) { in check_linear()
55 int SkReduceOrder::reduce(const SkDQuad& quad) { in reduce()
247 SkDQuad quad; in Quad()
DSkDQuadLineIntersection.cpp97 LineQuadraticIntersections(const SkDQuad& q, const SkDLine& l, SkIntersections* i) in LineQuadraticIntersections()
105 LineQuadraticIntersections(const SkDQuad& q) in LineQuadraticIntersections()
166 return SkDQuad::RootsValidT(A, 2 * B, C, roots); in intersectRay()
195 return SkDQuad::RootsValidT(D, 2 * E, F, roots); in horizontalIntersect()
251 return SkDQuad::RootsValidT(D, 2 * E, F, roots); in verticalIntersect()
417 const SkDQuad& fQuad;
423 int SkIntersections::horizontal(const SkDQuad& quad, double left, double right, double y, in horizontal()
430 int SkIntersections::vertical(const SkDQuad& quad, double top, double bottom, double x, in vertical()
437 int SkIntersections::intersect(const SkDQuad& quad, const SkDLine& line) { in intersect()
443 int SkIntersections::intersectRay(const SkDQuad& quad, const SkDLine& line) { in intersectRay()
[all …]
DSkLineParameters.h91 bool quadEndPoints(const SkDQuad& pts) { in quadEndPoints()
110 void quadEndPoints(const SkDQuad& pts, int s, int e) { in quadEndPoints()
116 double quadPart(const SkDQuad& part) { in quadPart()
146 void quadDistanceY(const SkDQuad& pts, SkDQuad& distance) const { in quadDistanceY()
159 double controlPtDistance(const SkDQuad& pts) const { in controlPtDistance()
DSkPathOpsConic.h19 SkDQuad fPts;
59 return SkDQuad::AddValidTs(s, realRoots, t); in AddValidTs()
69 bool hullIntersects(const SkDQuad& quad, bool* isLinear) const { in hullIntersects()
98 return SkDQuad::RootsReal(A, B, C, t); in RootsReal()
102 return SkDQuad::RootsValidT(A, B, C, s); in RootsValidT()
DSkPathOpsRect.cpp13 void SkDRect::setBounds(const SkDQuad& curve, const SkDQuad& sub, double startT, double endT) { in setBounds()
19 roots = SkDQuad::FindExtrema(&sub[0].fX, tValues); in setBounds()
22 roots += SkDQuad::FindExtrema(&sub[0].fY, &tValues[roots]); in setBounds()
DSkPathOpsCurve.h30 void set(const SkDQuad& quad) { in set()
31 for (int index = 0; index < SkDQuad::kPointCount; ++index) { in set()
51 SkDQuad fQuad;
109 SkDQuad quad; in dquad_xy_at_t()
189 SkDQuad quad; in dquad_dxdy_at_t()
270 SkDQuad quad; in quad_is_vertical()
272 SkDQuad dst = quad.subDivide(startT, endT); in quad_is_vertical()
308 SkDQuad quad; in quad_intersect_ray()
373 SkDQuad quad; in quad_intercept_h()
378 SkDQuad quad; in quad_intercept_v()
DSkPathOpsRect.h62 void setBounds(const SkDQuad& curve) { in setBounds()
66 void setBounds(const SkDQuad& curve, const SkDQuad& sub, double tStart, double tEnd);
DSkDCubicToQuads.cpp35 SkDQuad SkDCubic::toQuad() const { in toQuad()
36 SkDQuad quad; in toQuad()
DSkReduceOrder.h24 int reduce(const SkDQuad& quad);
31 SkDQuad fQuad;
DSkPathOpsCubic.cpp202 bool SkDCubic::hullIntersects(const SkDQuad& quad, bool* isLinear) const { in hullIntersects()
213 return ((const SkDQuad *) this)->isLinear(0, 2); in isLinear()
383 int foundRoots = SkDQuad::AddValidTs(s, realRoots, t); in RootsValidT()
427 return SkDQuad::RootsReal(B, C, D, s); in RootsReal()
432 int num = SkDQuad::RootsReal(A, B, C, s); in RootsReal()
442 int num = SkDQuad::RootsReal(A, A + B, -D, s); in RootsReal()
532 return SkDQuad::RootsValidT(Bx * Cy - By * Cx, Ax * Cy - Ay * Cx, Ax * By - Ay * Bx, tValues); in findInflections()
561 return SkDQuad::RootsValidT(A, B, C, tValues); in FindExtrema()
DSkPathOpsDebug.h403 struct SkDQuad;
406 void DumpQ(const SkDQuad& quad1, const SkDQuad& quad2, int testNo);
407 void DumpT(const SkDQuad& quad, double t);
DSkPathOpsCubic.h80 bool hullIntersects(const SkDQuad& c2, bool* isLinear) const;
132 SkDQuad toQuad() const;
/external/skia/tests/
DPathOpsDebug.cpp176 void SkDQuad::dump() const { in dump()
181 void SkDQuad::dumpID(int id) const { in dumpID()
187 void SkDQuad::dumpInner() const { in dumpInner()
414 SkDQuad quad; in DontCallDebugSpan()
417 SkTSect<SkDQuad, SkDQuad> q1q2(quad SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
418 SkTSect<SkDQuad, SkDConic> q1k2(quad SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
419 SkTSect<SkDQuad, SkDCubic> q1c2(quad SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
420 SkTSect<SkDConic, SkDQuad> k1q2(conic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
423 SkTSect<SkDCubic, SkDQuad> c1q2(cubic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
444 SkDQuad quad; in DontCallDebugT()
[all …]
DPathOpsAngleIdeas.cpp41 static double testArc(skiatest::Reporter* reporter, const SkDQuad& quad, const SkDQuad& arcRef, in testArc()
43 SkDQuad arc = arcRef; in testArc()
74 static void orderQuads(skiatest::Reporter* reporter, const SkDQuad& quad, double radius, in orderQuads()
89 SkDQuad cQuad; in orderQuads()
106 static double quadAngle(skiatest::Reporter* reporter, const SkDQuad& quad, double t) { in quadAngle()
118 static void setQuadHullSweep(const SkDQuad& quad, SkDVector sweep[2]) { in setQuadHullSweep()
123 static double distEndRatio(double dist, const SkDQuad& quad) { in distEndRatio()
129 static bool checkParallel(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2)… in checkParallel()
163 static int quadHullsOverlap(skiatest::Reporter* reporter, const SkDQuad& quad1, in quadHullsOverlap()
164 const SkDQuad& quad2) { in quadHullsOverlap()
[all …]
DPathOpsQuadIntersectionTest.cpp18 SkDQuad quad1; in standardTestCases()
22 SkDQuad quad2; in standardTestCases()
337 SkDQuad quad1; in oneOffTest1()
341 SkDQuad quad2; in oneOffTest1()
389 SkDQuad quad1; in coincidentTestOne()
393 SkDQuad quad2; in coincidentTestOne()
418 SkDQuad quad1, quad2; in intersectionFinder()
540 SkDQuad quad1; in DEF_TEST()
543 SkDQuad quad2; in DEF_TEST()
555 SkDQuad quad1, quad2; in DEF_TEST()
DPathOpsQuadReduceOrderTest.cpp23 SkDQuad quad; in oneOffTest()
53 SkDQuad quad; in standardTestCases()
62 SkDQuad quad; in standardTestCases()
DPathOpsTestCommon.h32 void CubicToQuads(const SkDCubic& cubic, double precision, SkTArray<SkDQuad, true>& quads);
39 bool ValidQuad(const SkDQuad& quad);
DPathOpsTestCommon.cpp133 void CubicToQuads(const SkDCubic& cubic, double precision, SkTArray<SkDQuad, true>& quads) { in CubicToQuads() argument
137 SkDQuad quad = cubic.toQuad(); in CubicToQuads()
147 SkDQuad quad = part.toQuad(); in CubicToQuads()
166 SkTArray<SkDQuad, true> quads; in CubicPathToQuads()
317 bool ValidQuad(const SkDQuad& quad) { in ValidQuad()
DPathOpsQuadLineIntersectionThreadedTest.cpp16 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line, in doIntersect()
43 static void testLineIntersect(skiatest::Reporter* reporter, const SkDQuad& quad, in testLineIntersect()
85 SkDQuad quad; in testQuadLineIntersectMain()
DPathOpsQuadLineIntersectionTest.cpp31 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line, in doIntersect()
83 SkDQuad quad; in testOneOffs()
112 SkDQuad quad; in DEF_TEST()
DPathOpsDRectTest.cpp31 static void setRawBounds(const SkDQuad& quad, SkDRect* rect) { in setRawBounds()
49 SkDQuad quad; in DEF_TEST()

12