| /external/skia/src/gpu/ |
| H A D | GrPathUtils.h | 25 /// Since we divide by tol if we're computing exact worst-case bounds,
29 GrScalar tol);
30 /// Since we divide by tol if we're computing exact worst-case bounds,
32 uint32_t quadraticPointCount(const GrPoint points[], GrScalar tol);
39 /// Since we divide by tol if we're computing exact worst-case bounds,
41 uint32_t cubicPointCount(const GrPoint points[], GrScalar tol);
|
| H A D | GrPathUtils.cpp | 41 GrScalar tol) {
42 if (tol < gMinCurveTol) {
43 tol = gMinCurveTol;
45 GrAssert(tol > 0);
48 if (d <= tol) {
52 // subdivide x = log4(d/tol) times. x subdivisions creates 2^(x)
55 int temp = SkScalarCeil(SkScalarSqrt(SkScalarDiv(d, tol)));
93 GrScalar tol) {
94 if (tol < gMinCurveTol) {
95 tol
40 quadraticPointCount(const GrPoint points[], GrScalar tol) argument
92 cubicPointCount(const GrPoint points[], GrScalar tol) argument
148 worstCasePointCount(const GrPath& path, int* subpaths, GrScalar tol) argument
[all...] |
| H A D | GrTesselatedPathRenderer.cpp | 364 GrScalar tol = GR_Scalar1; local
365 tol = GrPathUtils::scaleToleranceToSrc(tol, viewM, path.getBounds());
366 GrScalar tolSqd = GrMul(tol, tol);
369 int maxPts = GrPathUtils::worstCasePointCount(path, &subpathCnt, tol);
417 GrPathUtils::quadraticPointCount(pts, tol));
423 GrPathUtils::cubicPointCount(pts, tol));
|
| H A D | GrDefaultPathRenderer.cpp | 346 GrScalar tol = GR_Scalar1; local
347 tol = GrPathUtils::scaleToleranceToSrc(tol, viewM, path.getBounds());
356 tol,
|
| /external/skia/tests/ |
| H A D | ClipCubicTest.cpp | 45 float tol) {
47 if (SkScalarAbs(c0[i].fX - c1[i].fX) > SkFloatToScalar(tol) ||
48 SkScalarAbs(c0[i].fY - c1[i].fY) > SkFloatToScalar(tol)
84 const float tol = SkFloatToScalar(1e-4); local
92 0, 0, 2, 3, 1, 10, 4, 12, shouldbe), tol));
100 0, 0, 2, 3, 1, 10, 4, 12, shouldbe), tol));
108 0, 0, 2, 3, 1, 10, 4, 12, shouldbe), tol));
126 shouldbe), tol));
138 shouldbe), tol));
150 shouldbe), tol));
43 CurvesAreEqual(const SkPoint c0[4], const SkPoint c1[4], float tol) argument
[all...] |
| H A D | PathCoverageTest.cpp | 59 static inline uint32_t compute_pointCount(SkScalar d, SkScalar tol) { argument
60 if (d < tol) {
63 int temp = SkScalarCeil(SkScalarSqrt(SkScalarDiv(d, tol)));
69 uint32_t quadraticPointCount_EE(const SkPoint points[], SkScalar tol) { argument
74 uint32_t quadraticPointCount_EC(const SkPoint points[], SkScalar tol) { argument
76 return compute_pointCount(SkIntToScalar(distance), tol);
79 uint32_t quadraticPointCount_CE(const SkPoint points[], SkScalar tol) { argument
84 uint32_t quadraticPointCount_CC(const SkPoint points[], SkScalar tol) { argument
86 return compute_pointCount(distance, tol);
|
| /external/skia/src/core/ |
| H A D | SkCubicClipper.cpp | 39 const SkScalar tol = SK_Scalar1 / 16384; // This leaves 2 fixed noise bits. local
59 converged = SkScalarAbs(t1 - t0) <= tol; // NaN-safe
89 const SkScalar tol = SK_Scalar1 / 65536; // 1 for fixed, 1e-5 for float.
106 } while (!(SkScalarAbs(tPos - tNeg) <= tol)); // Nan-safe
|
| /external/skia/include/core/ |
| H A D | SkPoint.h | 318 /** Return true if this and the given point are componentwise within tol.
320 bool equalsWithinTolerance(const SkPoint& v, SkScalar tol) const {
321 return SkScalarNearlyZero(fX - v.fX, tol)
322 && SkScalarNearlyZero(fY - v.fY, tol);
|