| /external/skia/experimental/Intersection/ |
| CubicBezierClip.cpp | 12 // caller should subdivide, or create degenerate if the values are too small
|
| QuadraticBezierClip.cpp | 14 // caller should subdivide, or create degenerate if the values are too small
|
| CubicConvexHull.cpp | 53 // FIXME: carry last subdivide and reduceOrder result with cubic
|
| /external/chromium_org/third_party/skia/tests/ |
| PathOpsTestCommon.cpp | 25 SkDCubic part = cubic.subDivide(tStart, tEnd);
99 SkDCubic part = cubic.subDivide(lo, hi);
|
| PathOpsAngleTest.cpp | 418 SkDLine seg = SkDLine::SubDivide(temp, data.fTStart,
425 SkDQuad seg = SkDQuad::SubDivide(temp, data.fTStart, data.fTEnd);
432 SkDCubic seg = SkDCubic::SubDivide(temp, data.fTStart, data.fTEnd);
|
| /external/skia/tests/ |
| PathOpsTestCommon.cpp | 25 SkDCubic part = cubic.subDivide(tStart, tEnd);
99 SkDCubic part = cubic.subDivide(lo, hi);
|
| PathOpsAngleTest.cpp | 418 SkDLine seg = SkDLine::SubDivide(temp, data.fTStart,
425 SkDQuad seg = SkDQuad::SubDivide(temp, data.fTStart, data.fTEnd);
432 SkDCubic seg = SkDCubic::SubDivide(temp, data.fTStart, data.fTEnd);
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| QuadraticBezierClip.cpp | 14 // caller should subdivide, or create degenerate if the values are too small
|
| CubicConvexHull.cpp | 53 // FIXME: carry last subdivide and reduceOrder result with cubic
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkPathOpsQuad.cpp | 51 SkDQuad sub = subDivide(startT, endT);
218 SkDQuad SkDQuad::subDivide(double t1, double t2) const {
240 SkDPoint SkDQuad::subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2) const {
250 SkDQuad sub = subDivide(t1, t2);
|
| SkOpSegment.h | 345 bool subDivide(int start, int end, SkPoint edge[4]) const;
346 bool subDivide(int start, int end, SkDCubic* result) const;
|
| SkPathOpsCubic.cpp | 372 SkDCubic sub = subDivide(startT, endT);
466 SkDCubic SkDCubic::subDivide(double t1, double t2) const {
505 void SkDCubic::subDivide(const SkDPoint& a, const SkDPoint& d,
523 SkDCubic sub = subDivide(t1, t2);
|
| SkDCubicIntersection.cpp | 29 SkDCubic part = cubic.subDivide(tStart, tEnd);
79 SkDCubic c1 = cubic1.subDivide(t1s, t1e);
80 SkDCubic c2 = cubic2.subDivide(t2s, t2e);
|
| /external/skia/src/pathops/ |
| SkPathOpsQuad.cpp | 51 SkDQuad sub = subDivide(startT, endT);
218 SkDQuad SkDQuad::subDivide(double t1, double t2) const {
240 SkDPoint SkDQuad::subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2) const {
250 SkDQuad sub = subDivide(t1, t2);
|
| SkOpSegment.h | 345 bool subDivide(int start, int end, SkPoint edge[4]) const;
346 bool subDivide(int start, int end, SkDCubic* result) const;
|
| SkPathOpsCubic.cpp | 372 SkDCubic sub = subDivide(startT, endT);
466 SkDCubic SkDCubic::subDivide(double t1, double t2) const {
505 void SkDCubic::subDivide(const SkDPoint& a, const SkDPoint& d,
523 SkDCubic sub = subDivide(t1, t2);
|
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrPathUtils.cpp | 50 // Each time we subdivide, d should be cut in 4. So we need to
51 // subdivide x = log4(d/tol) times. x subdivisions creates 2^(x)
478 bool subdivide = false; local
496 // We need to subdivide if d0 + d1 > tolerance but we have the sqd values. We know
501 subdivide = 2 * d0d1 + d0Sqd + d1Sqd > toleranceSqd;
504 if (!subdivide) {
|
| /external/skia/src/gpu/ |
| GrPathUtils.cpp | 50 // Each time we subdivide, d should be cut in 4. So we need to
51 // subdivide x = log4(d/tol) times. x subdivisions creates 2^(x)
478 bool subdivide = false; local
496 // We need to subdivide if d0 + d1 > tolerance but we have the sqd values. We know
501 subdivide = 2 * d0d1 + d0Sqd + d1Sqd > toleranceSqd;
504 if (!subdivide) {
|
| /external/chromium_org/content/browser/ |
| browsing_instance.h | 31 // We further subdivide a BrowsingInstance into SiteInstances, which represent
|
| /external/clang/include/clang/Lex/ |
| Pragma.h | 56 /// Note that the PragmaNamespace class can be used to subdivide pragmas, e.g.
|
| /external/kernel-headers/original/uapi/drm/ |
| savage_drm.h | 35 * Clients may subdivide regions internally, but when sharing between
|
| /hardware/intel/img/libdrm/shared-core/ |
| savage_drm.h | 35 * Clients may subdivide regions internally, but when sharing between
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/sysroot/usr/include/drm/ |
| savage_drm.h | 35 * Clients may subdivide regions internally, but when sharing between
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/drm/ |
| savage_drm.h | 35 * Clients may subdivide regions internally, but when sharing between
|
| /external/icu/icu4c/source/common/ |
| uarrsort.c | 28 * log2(8)=3 to subdivide, +1 to check for equality.
|
