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 PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in intersect()
12 SkTSect<SkDQuad, SkDQuad> sect2(quad2 PATH_OPS_DEBUG_T_SECT_PARAMS(2)); in intersect()
13 SkTSect<SkDQuad, SkDQuad>::BinarySearch(&sect1, &sect2, this); in intersect()
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(&sect1, &sect2, this); in intersect()
31 int SkIntersections::intersect(const SkDCubic& cubic, const SkDQuad& quad) { in intersect()
32 SkTSect<SkDCubic, SkDQuad> sect1(cubic PATH_OPS_DEBUG_T_SECT_PARAMS(1)); 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
43 SkDQuad flip() const { in flip() argument
44 SkDQuad result = {{fPts[2], fPts[1], fPts[0]}}; in flip()
50 const SkDQuad& set(const SkPoint pts[kPointCount]) { in set() argument
72 bool hullIntersects(const SkDQuad& , bool* isLinear) const;
83 SkDQuad subDivide(double t1, double t2) const;
84 static SkDQuad SubDivide(const SkPoint a[kPointCount], double t1, double t2) { in SubDivide() argument
85 SkDQuad quad; in SubDivide()
[all …]
DSkPathOpsQuad.cpp21 bool SkDQuad::hullIntersects(const SkDQuad& q2, bool* isLinear) const { in hullIntersects()
51 bool SkDQuad::hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects()
55 bool SkDQuad::hullIntersects(const SkDCubic& cubic, bool* isLinear) const { in hullIntersects()
68 void SkDQuad::otherPts(int oddMan, const SkDPoint* endPt[2]) const { in otherPts()
76 int SkDQuad::AddValidTs(double s[], int realRoots, double* t) { in AddValidTs()
104 int SkDQuad::RootsValidT(double A, double B, double C, double t[2]) { in RootsValidT()
119 int SkDQuad::RootsReal(const double A, const double B, const double C, double s[2]) { in RootsReal()
145 bool SkDQuad::isLinear(int startIndex, int endIndex) const { in isLinear()
159 SkDVector SkDQuad::dxdyAtT(double t) const { in dxdyAtT()
177 SkDPoint SkDQuad::ptAtT(double t) const { in ptAtT()
[all …]
DSkIntersections.h160 SkDQuad quad; in quadHorizontal()
167 SkDQuad quad; in quadVertical()
174 SkDQuad quad; in quadLine()
235 int horizontal(const SkDQuad&, double left, double right, double y, bool flipped);
236 int horizontal(const SkDQuad&, double left, double right, double y, double tRange[2]);
242 static int HorizontalIntercept(const SkDQuad& quad, SkScalar y, double* roots);
250 int intersect(const SkDQuad&, const SkDLine&);
251 int intersect(const SkDQuad&, const SkDQuad&);
253 int intersect(const SkDConic&, const SkDQuad&);
256 int intersect(const SkDCubic&, const SkDQuad&);
[all …]
DSkReduceOrder.cpp16 static int coincident_line(const SkDQuad& quad, SkDQuad& reduction) { in coincident_line()
21 static int reductionLineCount(const SkDQuad& reduction) { in reductionLineCount()
25 static int vertical_line(const SkDQuad& quad, SkDQuad& reduction) { in vertical_line()
31 static int horizontal_line(const SkDQuad& quad, SkDQuad& reduction) { in horizontal_line()
37 static int check_linear(const SkDQuad& quad, in check_linear()
38 int minX, int maxX, int minY, int maxY, SkDQuad& reduction) { in check_linear()
54 int SkReduceOrder::reduce(const SkDQuad& quad) { in reduce()
244 SkDQuad quad; in Quad()
DSkDQuadLineIntersection.cpp96 LineQuadraticIntersections(const SkDQuad& q, const SkDLine& l, SkIntersections* i) in LineQuadraticIntersections()
104 LineQuadraticIntersections(const SkDQuad& q) in LineQuadraticIntersections()
165 return SkDQuad::RootsValidT(A, 2 * B, C, roots); in intersectRay()
194 return SkDQuad::RootsValidT(D, 2 * E, F, roots); in horizontalIntersect()
250 return SkDQuad::RootsValidT(D, 2 * E, F, roots); in verticalIntersect()
401 const SkDQuad& fQuad;
407 int SkIntersections::horizontal(const SkDQuad& quad, double left, double right, double y, in horizontal()
414 int SkIntersections::vertical(const SkDQuad& quad, double top, double bottom, double x, in vertical()
421 int SkIntersections::intersect(const SkDQuad& quad, const SkDLine& line) { in intersect()
427 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;
51 return SkDQuad::AddValidTs(s, realRoots, t); in AddValidTs()
61 bool hullIntersects(const SkDQuad& quad, bool* isLinear) const { in hullIntersects()
90 return SkDQuad::RootsReal(A, B, C, t); in RootsReal()
94 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;
93 SkDQuad quad; in dquad_xy_at_t()
149 SkDQuad quad; in dquad_dxdy_at_t()
206 SkDQuad quad; in quad_is_vertical()
208 SkDQuad dst = quad.subDivide(startT, endT); in quad_is_vertical()
244 SkDQuad quad; in quad_intersect_ray()
285 SkDQuad quad; in quad_intercept_h()
290 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.h22 int reduce(const SkDQuad& quad);
29 SkDQuad fQuad;
DSkPathOpsDebug.h233 struct SkDQuad;
236 void DumpQ(const SkDQuad& quad1, const SkDQuad& quad2, int testNo);
237 void DumpT(const SkDQuad& quad, double t);
/external/skia/tests/
DPathOpsDebug.cpp164 void SkDQuad::dump() const { in dump()
169 void SkDQuad::dumpID(int id) const { in dumpID()
174 void SkDQuad::dumpInner() const { in dumpInner()
381 SkDQuad quad; in DontCallDebugSpan()
384 SkTSect<SkDQuad, SkDQuad> q1q2(quad PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
385 SkTSect<SkDQuad, SkDConic> q1k2(quad PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
386 SkTSect<SkDQuad, SkDCubic> q1c2(quad PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
387 SkTSect<SkDConic, SkDQuad> k1q2(conic PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
390 SkTSect<SkDCubic, SkDQuad> c1q2(cubic PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
411 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()
80 const SkDQuad circle[8] = {{{{ r, 0}, { r, -s}, { m, -m}}}, in orderQuads()
104 static double quadAngle(skiatest::Reporter* reporter, const SkDQuad& quad, double t) { in quadAngle()
116 static void setQuadHullSweep(const SkDQuad& quad, SkDVector sweep[2]) { in setQuadHullSweep()
121 static double distEndRatio(double dist, const SkDQuad& quad) { in distEndRatio()
127 static bool checkParallel(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2)… in checkParallel()
161 static int quadHullsOverlap(skiatest::Reporter* reporter, const SkDQuad& quad1, in quadHullsOverlap()
162 const SkDQuad& quad2) { in quadHullsOverlap()
[all …]
DPathOpsQuadIntersectionTest.cpp17 const SkDQuad& quad1 = quadraticTests[index][0]; in standardTestCases()
19 const SkDQuad& quad2 = quadraticTests[index][1]; in standardTestCases()
55 static const SkDQuad testSet[] = {
326 const SkDQuad& quad1 = testSet[outer]; in oneOffTest1()
328 const SkDQuad& quad2 = testSet[inner]; in oneOffTest1()
358 static const SkDQuad coincidentTestSet[] = {
374 const SkDQuad& quad1 = coincidentTestSet[test1]; in coincidentTestOne()
376 const SkDQuad& quad2 = coincidentTestSet[test2]; in coincidentTestOne()
398 const SkDQuad& quad1 = testSet[test1]; in intersectionFinder()
399 const SkDQuad& quad2 = testSet[test2]; in intersectionFinder()
[all …]
DPathOpsQuadIntersectionTestData.h9 extern const SkDQuad quadraticLines[];
10 extern const SkDQuad quadraticPoints[];
11 extern const SkDQuad quadraticModEpsilonLines[];
12 extern const SkDQuad quadraticTests[][2];
DPathOpsQuadIntersectionTestData.cpp10 const SkDQuad quadraticPoints[] = {
19 const SkDQuad quadraticLines[] = {
52 const SkDQuad quadraticModEpsilonLines[] = {
85 const SkDQuad quadraticTests[][2] = {
DPathOpsQuadReduceOrderTest.cpp13 static const SkDQuad testSet[] = {
22 const SkDQuad& quad = testSet[index]; in oneOffTest()
50 const SkDQuad& quad = quadraticLines[index]; in standardTestCases()
57 const SkDQuad& quad = quadraticModEpsilonLines[index]; in standardTestCases()
DPathOpsQuadLineIntersectionTest.cpp16 SkDQuad quad;
31 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line, in doIntersect()
59 SkDQuad quad;
82 const SkDQuad& quad = oneOffs[index].quad; in testOneOffs()
109 const SkDQuad& quad = lineQuadTests[index].quad; in DEF_TEST()
DPathOpsDRectTest.cpp14 static const SkDQuad quadTests[] = {
31 static void setRawBounds(const SkDQuad& quad, SkDRect* rect) { in setRawBounds()
48 const SkDQuad& quad = quadTests[index]; in DEF_TEST()
DPathOpsTestCommon.h17 void CubicToQuads(const SkDCubic& cubic, double precision, SkTArray<SkDQuad, true>& quads);
24 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.cpp14 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line, in doIntersect()
41 static void testLineIntersect(skiatest::Reporter* reporter, const SkDQuad& quad, in testLineIntersect()
83 SkDQuad quad = {{{(double) ax, (double) ay}, {(double) bx, (double) by}, in testQuadLineIntersectMain()

12