turn off debugging printfs

tests/PathOpsCubicQuadIntersectionTest.cpp

 /*
  * Copyright 2013 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #include "PathOpsTestCommon.h"
 #include "SkIntersections.h"
 #include "SkPathOpsCubic.h"
 #include "SkPathOpsQuad.h"
@@ skipping 34 matching lines @@
         }
         if (order2 != 3) {
             SkDebugf("[%d] quad order=%d\n", iIndex, order2);
             REPORTER_ASSERT(reporter, 0);
         }
         SkIntersections i;
         int roots = i.intersect(cubic, quad);
         SkASSERT(roots == quadCubicTests[index].answerCount);
         for (int pt = 0; pt < roots; ++pt) {
             double tt1 = i[0][pt];
-            SkDPoint xy1 = cubic.xyAtT(tt1);
+            SkDPoint xy1 = cubic.ptAtT(tt1);
             double tt2 = i[1][pt];
-            SkDPoint xy2 = quad.xyAtT(tt2);
+            SkDPoint xy2 = quad.ptAtT(tt2);
             if (!xy1.approximatelyEqual(xy2)) {
                 SkDebugf("%s [%d,%d] x!= t1=%g (%g,%g) t2=%g (%g,%g)\n",
                     __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
             }
             REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
             bool found = false;
             for (int idx2 = 0; idx2 < quadCubicTests[index].answerCount; ++idx2) {
                 found |= quadCubicTests[index].answers[idx2].approximatelyEqual(xy1);
             }
             REPORTER_ASSERT(reporter, found);
         }
         reporter->bumpTestCount();
     }
 }
 
 #include "TestClassDef.h"
 DEFINE_TESTCLASS_SHORT(PathOpsCubicQuadIntersectionTest)