/external/skia/src/core/ |
H A D | SkMath.cpp | 247 int quad = ((unsigned)radians / (kTableSize * 256)) & 3; local 259 int quad = ((unsigned)radians / kTableSize) & 3; local 262 if (quad & 1) { 265 if (quad & 2) { 268 if (((quad - 1) & 2) == 0) {
|
H A D | SkMatrix.cpp | 1077 SkPoint quad[4]; local 1079 src.toQuad(quad); 1080 this->mapPoints(quad, quad, 4); 1081 dst->set(quad, 4);
|
/external/skia/src/pathops/ |
H A D | SkDCubicIntersection.cpp | 30 SkDQuad quad = part.toQuad(); local 33 int order = reducer->reduce(quad); 42 part[3].fX, part[3].fY, quad[0].fX, quad[0].fY, 43 quad[1].fX, quad[1].fY, quad[2].fX, quad[2].fY); 291 // quad/quad a [all...] |
H A D | SkDCubicToQuads.cpp | 25 mid-point approx of cubic: a quad that shares the same anchors with the cubic and has the 80 SkDQuad quad; local 81 quad[0] = fPts[0]; 84 quad[1].fX = (fromC1.fX + fromC2.fX) / 2; 85 quad[1].fY = (fromC1.fY + fromC2.fY) / 2; 86 quad[2] = fPts[3]; 87 return quad;
|
H A D | SkDQuadIntersection.cpp | 21 static int findRoots(const SkDQuadImplicit& i, const SkDQuad& quad, double roots[4], argument 24 const SkDQuad& q = flip ? (flipped = quad.flip()) : quad; 243 // FIXME ? should this measure both and then use the quad that is the flattest as the line? 416 // see if either quad is really a line
|
H A D | SkDQuadLineIntersection.cpp | 110 solve by rotating line+quad so line is horizontal, then finding the roots 111 set up matrix to rotate quad to x-axis 122 quad[n].fY' = (quad[n].fY - line[0].fY) * A - (quad[n].fX - line[0].fX) * O 247 // FIXME: see if line end is nearly on quad 273 // FIXME: see if line end is nearly on quad 299 // FIXME: see if line end is nearly on quad 354 int SkIntersections::horizontal(const SkDQuad& quad, double left, double right, double y, argument 357 LineQuadraticIntersections q(quad, lin 361 vertical(const SkDQuad& quad, double top, double bottom, double x, bool flipped) argument 368 intersect(const SkDQuad& quad, const SkDLine& line) argument 374 intersectRay(const SkDQuad& quad, const SkDLine& line) argument [all...] |
H A D | SkIntersections.cpp | 153 SkDQuad quad; local 154 quad.set(pts); 156 return intersectRay(quad, line); 197 SkDQuad quad; local 198 quad.set(a); 199 return vertical(quad, top, bottom, x, flipped);
|
H A D | SkIntersections.h | 89 SkDQuad quad; local 90 quad.set(b); 92 return intersect(cubic, quad); 150 SkDQuad quad; local 151 quad.set(a); 153 return horizontal(quad, left, right, y, flipped); 157 SkDQuad quad; local 158 quad.set(a); 160 return vertical(quad, top, bottom, x, flipped); 164 SkDQuad quad; local [all...] |
H A D | SkPathOpsBounds.cpp | 27 SkDQuad quad; local 28 quad.set(a); 30 dRect.setBounds(quad);
|
H A D | SkPathOpsCurve.h | 22 SkDQuad quad; local 23 quad.set(a); 24 return quad.ptAtT(t); 66 SkDQuad quad; local 67 quad.set(a); 68 return quad.dxdyAtT(t); 104 SkDQuad quad; local 105 quad.set(a); 106 SkDPoint topPt = quad.top(startT, endT); 132 SkDQuad quad; local 160 SkDQuad quad; local [all...] |
H A D | SkPathOpsQuad.cpp | 335 void SkDQuad::SetABC(const double* quad, double* a, double* b, double* c) { argument 336 *a = quad[0]; // a = A 337 *b = 2 * quad[2]; // b = 2*B 338 *c = quad[4]; // c = C
|
H A D | SkPathOpsQuad.h | 48 static void SetABC(const double* quad, double* a, double* b, double* c); 51 SkDQuad quad; local 52 quad.set(a); 53 return quad.subDivide(t1, t2); 58 SkDQuad quad; local 59 quad.set(pts); 60 return quad.subDivide(a, c, t1, t2);
|
H A D | SkPathOpsRect.cpp | 17 void SkDRect::setBounds(const SkDQuad& quad) { argument 18 set(quad[0]); 19 add(quad[2]); 22 if (!between(quad[0].fX, quad[1].fX, quad[2].fX)) { 23 roots = SkDQuad::FindExtrema(quad[0].fX, quad[1].fX, quad[2].fX, tValues); 25 if (!between(quad[ 33 setRawBounds(const SkDQuad& quad) argument [all...] |
H A D | SkReduceOrder.cpp | 16 static int coincident_line(const SkDQuad& quad, SkDQuad& reduction) { argument 17 reduction[0] = reduction[1] = quad[0]; 25 static int vertical_line(const SkDQuad& quad, SkDQuad& reduction) { argument 26 reduction[0] = quad[0]; 27 reduction[1] = quad[2]; 31 static int horizontal_line(const SkDQuad& quad, SkDQuad& reduction) { argument 32 reduction[0] = quad[0]; 33 reduction[1] = quad[2]; 37 static int check_linear(const SkDQuad& quad, argument 41 while (quad[startInde 63 reduce(const SkDQuad& quad) argument 262 SkDQuad quad; local [all...] |
/external/skia/src/utils/ |
H A D | SkCullPoints.cpp | 47 static void toQuad(const SkIRect& r, SkIPoint quad[4]) { argument 48 SkASSERT(quad); 50 quad[0].set(r.fLeft, r.fTop); 51 quad[1].set(r.fRight, r.fTop); 52 quad[2].set(r.fRight, r.fBottom); 53 quad[3].set(r.fLeft, r.fBottom);
|
/external/skia/tests/ |
H A D | PathOpsAngleIdeas.cpp | 41 static double testArc(skiatest::Reporter* reporter, const SkDQuad& quad, const SkDQuad& arcRef, argument 44 SkDVector offset = {quad[0].fX, quad[0].fY}; 49 i.intersect(arc, quad); 58 i.intersect(arc, quad); 62 i.intersect(arc, quad); 74 static void orderQuads(skiatest::Reporter* reporter, const SkDQuad& quad, double radius, argument 89 double t = testArc(reporter, quad, circle[octant], octant); 104 static double quadAngle(skiatest::Reporter* reporter, const SkDQuad& quad, double t) { argument 105 const SkDVector& pt = quad 116 setQuadHullSweep(const SkDQuad& quad, SkDVector sweep[2]) argument 121 distEndRatio(double dist, const SkDQuad& quad) argument 258 maxDist(const SkDQuad& quad) argument 274 maxQuad(const SkDQuad& quad) argument 416 makeSegment(const SkDQuad& quad, SkPoint shortQuad[3], SkOpSegment* result) argument [all...] |
H A D | PathOpsAngleTest.cpp | 85 SkDQuad quad = {{line[0], dPt, qPt}}; local 86 // binary search for maximum movement of quad[1] towards test that still has 1 intersection 91 last = quad[1]; 92 quad[1].fX = dPt.fX - line[1].fY * moveT; 93 quad[1].fY = dPt.fY + line[1].fX * moveT; 95 i.intersect(quad, line); 103 } while (last.asSkPoint() != quad[1].asSkPoint());
|
H A D | PathOpsCubicQuadIntersectionTest.cpp | 17 SkDQuad quad; member in struct:quadCubic 64 const SkDQuad& quad = quadCubicTests[index].quad; local 65 SkASSERT(ValidQuad(quad)); 69 int order2 = reduce2.reduce(quad); 75 SkDebugf("[%d] quad order=%d\n", iIndex, order2); 79 int roots = i.intersect(cubic, quad); 85 SkDPoint xy2 = quad.ptAtT(tt2); 118 // determine that slop required after quad/quad find [all...] |
H A D | PathOpsCubicReduceOrderTest.cpp | 173 const SkDQuad& quad = quadraticPoints[index]; local 174 SkASSERT(ValidQuad(quad)); 175 SkDCubic cubic = quad.toCubic(); 178 SkDebugf("[%d] point quad order=%d\n", static_cast<int>(index), order); 183 const SkDQuad& quad = quadraticLines[index]; local 184 SkASSERT(ValidQuad(quad)); 185 SkDCubic cubic = quad.toCubic(); 188 SkDebugf("[%d] line quad order=%d\n", static_cast<int>(index), order); 193 const SkDQuad& quad = quadraticModEpsilonLines[index]; local 194 SkASSERT(ValidQuad(quad)); [all...] |
H A D | PathOpsCubicToQuadsTest.cpp | 35 const SkDQuad& quad = quadTests[index]; local 36 SkASSERT(ValidQuad(quad)); 37 SkDCubic cubic = quad.toCubic();
|
H A D | PathOpsDQuadTest.cpp | 41 const SkDQuad& quad = tests[index]; local 42 SkASSERT(ValidQuad(quad)); 43 bool result = quad.pointInHull(inPoint[index]); 48 result = quad.pointInHull(outPoint[index]);
|
H A D | PathOpsDRectTest.cpp | 62 const SkDQuad& quad = quadTests[index]; local 63 SkASSERT(ValidQuad(quad)); 64 rect.setRawBounds(quad); 65 REPORTER_ASSERT(reporter, rect.fLeft == SkTMin(quad[0].fX, 66 SkTMin(quad[1].fX, quad[2].fX))); 67 REPORTER_ASSERT(reporter, rect.fTop == SkTMin(quad[0].fY, 68 SkTMin(quad[1].fY, quad[2].fY))); 69 REPORTER_ASSERT(reporter, rect.fRight == SkTMax(quad[ [all...] |
H A D | PathOpsDebug.cpp | 713 SkDebugf("<div id=\"quad%d\">\n", testNo); 725 SkDebugf(" quad%d,", testNo); 740 void DumpT(const SkDQuad& quad, double t) { argument 741 SkDLine line = {{quad.ptAtT(t), quad[0]}};
|
H A D | PathOpsQuadLineIntersectionTest.cpp | 16 SkDQuad quad; member in struct:lineQuad 21 // quad line results 31 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line, argument 42 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped); 50 result = intersections.horizontal(quad, left, right, line[0].fY, flipped); 52 intersections.intersect(quad, line); 59 SkDQuad quad; member in struct:oneLineQuad 82 const SkDQuad& quad = oneOffs[index].quad; local 83 SkASSERT(ValidQuad(quad)); 109 const SkDQuad& quad = lineQuadTests[index].quad; local [all...] |
H A D | PathOpsQuadLineIntersectionThreadedTest.cpp | 14 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line, argument 25 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped); 33 result = intersections.horizontal(quad, left, right, line[0].fY, flipped); 35 intersections.intersect(quad, line); 41 static void testLineIntersect(skiatest::Reporter* reporter, const SkDQuad& quad, argument 46 str += sprintf(str, " path.moveTo(%1.9g, %1.9g);\n", quad[0].fX, quad[0].fY); 47 str += sprintf(str, " path.quadTo(%1.9g, %1.9g, %1.9g, %1.9g);\n", quad[1].fX, 48 quad[1].fY, quad[ 83 SkDQuad quad = {{{(double) ax, (double) ay}, {(double) bx, (double) by}, local [all...] |