turn off debugging printfs

src/pathops/SkDQuadIntersection.cpp

 // Another approach is to start with the implicit form of one curve and solve
 // (seek implicit coefficients in QuadraticParameter.cpp
 // by substituting in the parametric form of the other.
 // The downside of this approach is that early rejects are difficult to come by.
 // http://planetmath.org/encyclopedia/GaloisTheoreticDerivationOfTheQuarticFormula.html#step
 
 
 #include "SkDQuadImplicit.h"
 #include "SkIntersections.h"
 #include "SkPathOpsLine.h"
@@ skipping 102 matching lines @@
     }
     return false;
 }
 
 // returns false if there's more than one intercept or the intercept doesn't match the point
 // returns true if the intercept was successfully added or if the
 // original quads need to be subdivided
 static bool add_intercept(const SkDQuad& q1, const SkDQuad& q2, double tMin, double tMax,
                           SkIntersections* i, bool* subDivide) {
     double tMid = (tMin + tMax) / 2;
-    SkDPoint mid = q2.xyAtT(tMid);
+    SkDPoint mid = q2.ptAtT(tMid);
     SkDLine line;
     line[0] = line[1] = mid;
     SkDVector dxdy = q2.dxdyAtT(tMid);
     line[0] -= dxdy;
     line[1] += dxdy;
     SkIntersections rootTs;
     rootTs.allowNear(false);
     int roots = rootTs.intersect(q1, line);
     if (roots == 0) {
         if (subDivide) {
             *subDivide = true;
         }
         return true;
     }
     if (roots == 2) {
         return false;
     }
-    SkDPoint pt2 = q1.xyAtT(rootTs[0][0]);
+    SkDPoint pt2 = q1.ptAtT(rootTs[0][0]);
     if (!pt2.approximatelyEqualHalf(mid)) {
         return false;
     }
     i->insertSwap(rootTs[0][0], tMid, pt2);
     return true;
 }
 
 static bool is_linear_inner(const SkDQuad& q1, double t1s, double t1e, const SkDQuad& q2,
                             double t2s, double t2e, SkIntersections* i, bool* subDivide) {
     SkDQuad hull = q1.subDivide(t1s, t1e);
     SkDLine line = {{hull[2], hull[0]}};
     const SkDLine* testLines[] = { &line, (const SkDLine*) &hull[0], (const SkDLine*) &hull[1] };
     const size_t kTestCount = SK_ARRAY_COUNT(testLines);
     SkSTArray<kTestCount * 2, double, true> tsFound;
     for (size_t index = 0; index < kTestCount; ++index) {
         SkIntersections rootTs;
         rootTs.allowNear(false);
         int roots = rootTs.intersect(q2, *testLines[index]);
         for (int idx2 = 0; idx2 < roots; ++idx2) {
             double t = rootTs[0][idx2];
 #ifdef SK_DEBUG
-            SkDPoint qPt = q2.xyAtT(t);
-            SkDPoint lPt = testLines[index]->xyAtT(rootTs[1][idx2]);
+            SkDPoint qPt = q2.ptAtT(t);
+            SkDPoint lPt = testLines[index]->ptAtT(rootTs[1][idx2]);
             SkASSERT(qPt.approximatelyEqual(lPt));
 #endif
             if (approximately_negative(t - t2s) || approximately_positive(t - t2e)) {
                 continue;
             }
             tsFound.push_back(rootTs[0][idx2]);
         }
     }
     int tCount = tsFound.count();
     if (tCount <= 0) {
         return true;
     }
     double tMin, tMax;
     if (tCount == 1) {
         tMin = tMax = tsFound[0];
     } else {
         SkASSERT(tCount > 1);
         SkTQSort<double>(tsFound.begin(), tsFound.end() - 1);
         tMin = tsFound[0];
         tMax = tsFound[tsFound.count() - 1];
     }
-    SkDPoint end = q2.xyAtT(t2s);
+    SkDPoint end = q2.ptAtT(t2s);
     bool startInTriangle = hull.pointInHull(end);
     if (startInTriangle) {
         tMin = t2s;
     }
-    end = q2.xyAtT(t2e);
+    end = q2.ptAtT(t2e);
     bool endInTriangle = hull.pointInHull(end);
     if (endInTriangle) {
         tMax = t2e;
     }
     int split = 0;
     SkDVector dxy1, dxy2;
     if (tMin != tMax || tCount > 2) {
         dxy2 = q2.dxdyAtT(tMin);
         for (int index = 1; index < tCount; ++index) {
             dxy1 = dxy2;
@@ skipping 81 matching lines @@
 // each time through the loop, this computes values it had from the last loop
 // if i == j == 1, the center values are still good
 // otherwise, for i != 1 or j != 1, four of the values are still good
 // and if i == 1 ^ j == 1, an additional value is good
 static bool binary_search(const SkDQuad& quad1, const SkDQuad& quad2, double* t1Seed,
                           double* t2Seed, SkDPoint* pt) {
     double tStep = ROUGH_EPSILON;
     SkDPoint t1[3], t2[3];
     int calcMask = ~0;
     do {
-        if (calcMask & (1 << 1)) t1[1] = quad1.xyAtT(*t1Seed);
-        if (calcMask & (1 << 4)) t2[1] = quad2.xyAtT(*t2Seed);
+        if (calcMask & (1 << 1)) t1[1] = quad1.ptAtT(*t1Seed);
+        if (calcMask & (1 << 4)) t2[1] = quad2.ptAtT(*t2Seed);
         if (t1[1].approximatelyEqual(t2[1])) {
             *pt = t1[1];
     #if ONE_OFF_DEBUG
             SkDebugf("%s t1=%1.9g t2=%1.9g (%1.9g,%1.9g) == (%1.9g,%1.9g)\n", __FUNCTION__,
                     t1Seed, t2Seed, t1[1].fX, t1[1].fY, t1[2].fX, t1[2].fY);
     #endif
             return true;
         }
-        if (calcMask & (1 << 0)) t1[0] = quad1.xyAtT(*t1Seed - tStep);
-        if (calcMask & (1 << 2)) t1[2] = quad1.xyAtT(*t1Seed + tStep);
-        if (calcMask & (1 << 3)) t2[0] = quad2.xyAtT(*t2Seed - tStep);
-        if (calcMask & (1 << 5)) t2[2] = quad2.xyAtT(*t2Seed + tStep);
+        if (calcMask & (1 << 0)) t1[0] = quad1.ptAtT(*t1Seed - tStep);
+        if (calcMask & (1 << 2)) t1[2] = quad1.ptAtT(*t1Seed + tStep);
+        if (calcMask & (1 << 3)) t2[0] = quad2.ptAtT(*t2Seed - tStep);
+        if (calcMask & (1 << 5)) t2[2] = quad2.ptAtT(*t2Seed + tStep);
         double dist[3][3];
         // OPTIMIZE: using calcMask value permits skipping some distance calcuations
         //   if prior loop's results are moved to correct slot for reuse
         dist[1][1] = t1[1].distanceSquared(t2[1]);
         int best_i = 1, best_j = 1;
         for (int i = 0; i < 3; ++i) {
             for (int j = 0; j < 3; ++j) {
                 if (i == 1 && j == 1) {
                     continue;
                 }
@@ skipping 99 matching lines @@
     bool flip1 = q1[2] == q2[0];
     bool flip2 = q1[0] == q2[2];
     bool useCubic = q1[0] == q2[0];
     double roots1[4];
     int rootCount = findRoots(i2, q1, roots1, useCubic, flip1, 0);
     // OPTIMIZATION: could short circuit here if all roots are < 0 or > 1
     double roots1Copy[4];
     int r1Count = addValidRoots(roots1, rootCount, roots1Copy);
     SkDPoint pts1[4];
     for (index = 0; index < r1Count; ++index) {
-        pts1[index] = q1.xyAtT(roots1Copy[index]);
+        pts1[index] = q1.ptAtT(roots1Copy[index]);
     }
     double roots2[4];
     int rootCount2 = findRoots(i1, q2, roots2, useCubic, flip2, 0);
     double roots2Copy[4];
     int r2Count = addValidRoots(roots2, rootCount2, roots2Copy);
     SkDPoint pts2[4];
     for (index = 0; index < r2Count; ++index) {
-        pts2[index] = q2.xyAtT(roots2Copy[index]);
+        pts2[index] = q2.ptAtT(roots2Copy[index]);
     }
     if (r1Count == r2Count && r1Count <= 1) {
         if (r1Count == 1) {
             if (pts1[0].approximatelyEqualHalf(pts2[0])) {
                 insert(roots1Copy[0], roots2Copy[0], pts1[0]);
             } else if (pts1[0].moreRoughlyEqual(pts2[0])) {
                 // experiment: try to find intersection by chasing t
                 rootCount = findRoots(i2, q1, roots1, useCubic, flip1, 0);
                 (void) addValidRoots(roots1, rootCount, roots1Copy);
                 rootCount2 = findRoots(i1, q2, roots2, useCubic, flip2, 0);
@@ skipping 56 matching lines @@
         }
         if (lowestIndex < 0) {
             break;
         }
         insert(roots1Copy[lowestIndex], roots2Copy[closest[lowestIndex]],
                 pts1[lowestIndex]);
         closest[lowestIndex] = -1;
     } while (++used < r1Count);
     return fUsed;
 }