Searched refs:r1Count (Results 1 - 4 of 4) sorted by relevance
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkDQuadIntersection.cpp | 472 int r1Count = addValidRoots(roots1, rootCount, roots1Copy); local 474 for (index = 0; index < r1Count; ++index) { 485 if (r1Count == r2Count && r1Count <= 1) { 486 if (r1Count == 1 && used() == 0) { 501 for (index = 0; index < r1Count; ++index) { 530 if (r1Count && r2Count && !foundSomething) { 538 for (index = 0; index < r1Count; ++index) { 553 } while (++used < r1Count);
|
/external/skia/src/pathops/ |
H A D | SkDQuadIntersection.cpp | 472 int r1Count = addValidRoots(roots1, rootCount, roots1Copy); local 474 for (index = 0; index < r1Count; ++index) { 485 if (r1Count == r2Count && r1Count <= 1) { 486 if (r1Count == 1 && used() == 0) { 501 for (index = 0; index < r1Count; ++index) { 530 if (r1Count && r2Count && !foundSomething) { 538 for (index = 0; index < r1Count; ++index) { 553 } while (++used < r1Count);
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | QuadraticImplicit.cpp | 460 int r1Count = addValidRoots(roots1, rootCount, roots1Copy); 462 for (index = 0; index < r1Count; ++index) { 473 if (r1Count == r2Count && r1Count <= 1) { 474 if (r1Count == 1) { 482 r1Count = addValidRoots(roots1, rootCount, roots1Copy); 483 if (r1Count == 0) { 495 SkASSERT(r1Count == 1 && r2Count == 1); 504 r1Count = addValidRoots(roots1, rootCount, roots1Copy); 517 for (index = 0; index < r1Count; [all...] |
/external/skia/experimental/Intersection/ |
H A D | QuadraticImplicit.cpp | 460 int r1Count = addValidRoots(roots1, rootCount, roots1Copy); 462 for (index = 0; index < r1Count; ++index) { 473 if (r1Count == r2Count && r1Count <= 1) { 474 if (r1Count == 1) { 482 r1Count = addValidRoots(roots1, rootCount, roots1Copy); 483 if (r1Count == 0) { 495 SkASSERT(r1Count == 1 && r2Count == 1); 504 r1Count = addValidRoots(roots1, rootCount, roots1Copy); 517 for (index = 0; index < r1Count; [all...] |
Completed in 219 milliseconds