Add REPORTF test macro.

tests/PathCoverageTest.cpp

 /*
  * Copyright 2011 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #include "Test.h"
 #include "TestClassDef.h"
 #include "SkMath.h"
@@ skipping 119 matching lines @@
                     quadraticPointCount_EC(path, SkIntToScalar(1));
             estimatedCount =
                     quadraticPointCount_CE(path);
         }
         // Allow estimated to be high by a factor of two, but no less than
         // the computed value.
         bool isAccurate = (estimatedCount >= computedCount) &&
             (estimatedCount <= 2 * computedCount);
 
         if (!isAccurate) {
-            SkString errorDescription;
-            errorDescription.printf(
-                "Curve from %.2f %.2f through %.2f %.2f to %.2f %.2f "
-                "computes %d, estimates %d\n",
-                path[0].fX, path[0].fY, path[1].fX, path[1].fY,
-                path[2].fX, path[2].fY, computedCount, estimatedCount);
+            REPORTF(reporter,
+                    ("Curve from %.2f %.2f through %.2f %.2f to %.2f %.2f "
+                     "computes %d, estimates %d\n",
+                     path[0].fX, path[0].fY, path[1].fX, path[1].fY,
+                     path[2].fX, path[2].fY, computedCount, estimatedCount));
             numErrors++;
-            reporter->reportFailed(errorDescription);
         }
     }
 
     return (numErrors == 0);
 }
 
 
 
 static void TestQuadPointCount(skiatest::Reporter* reporter) {
     one_d_pe(gXY, SK_ARRAY_COUNT(gXY), reporter);
     one_d_pe(gSawtooth, SK_ARRAY_COUNT(gSawtooth), reporter);
     one_d_pe(gOvalish, SK_ARRAY_COUNT(gOvalish), reporter);
     one_d_pe(gSharpSawtooth, SK_ARRAY_COUNT(gSharpSawtooth), reporter);
     one_d_pe(gRibbon, SK_ARRAY_COUNT(gRibbon), reporter);
 }
 
 DEF_TEST(PathCoverage, reporter) {
     TestQuadPointCount(reporter);
 
 }