Searched refs:subdivide (Results 1 - 6 of 6) sorted by relevance
/external/chromium_org/third_party/skia/samplecode/ |
H A D | SampleCull.cpp | 30 static void subdivide(SkPath* path, SkScalar bump) { function 122 subdivide(&fPath, bump); 123 subdivide(&fPath, bump); 124 subdivide(&fPath, bump);
|
/external/skia/samplecode/ |
H A D | SampleCull.cpp | 30 static void subdivide(SkPath* path, SkScalar bump) { function 122 subdivide(&fPath, bump); 123 subdivide(&fPath, bump); 124 subdivide(&fPath, bump);
|
/external/chromium_org/third_party/skia/src/gpu/ |
H A D | 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/ |
H A D | 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/third_party/skia/src/core/ |
H A D | SkGeometry.cpp | 1384 static SkPoint* subdivide(const SkConic& src, SkPoint pts[], int level) { 1394 pts = subdivide(dst[0], pts, level); 1395 return subdivide(dst[1], pts, level); 1402 SkDEBUGCODE(SkPoint* endPts =) subdivide(*this, pts + 1, pow2);
|
/external/skia/src/core/ |
H A D | SkGeometry.cpp | 1384 static SkPoint* subdivide(const SkConic& src, SkPoint pts[], int level) { 1394 pts = subdivide(dst[0], pts, level); 1395 return subdivide(dst[1], pts, level); 1402 SkDEBUGCODE(SkPoint* endPts =) subdivide(*this, pts + 1, pow2);
|
Completed in 267 milliseconds