remove sprintf

tests/PathOpsQuadLineIntersectionThreadedTest.cpp

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #include "PathOpsExtendedTest.h"
 #include "PathOpsThreadedCommon.h"
 #include "SkIntersections.h"
 #include "SkPathOpsLine.h"
 #include "SkPathOpsQuad.h"
 #include "SkReduceOrder.h"
+#include "SkString.h"
 
 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line,
                        bool& flipped) {
     int result;
     flipped = false;
     if (line[0].fX == line[1].fX) {
         double top = line[0].fY;
         double bottom = line[1].fY;
         flipped = top > bottom;
         if (flipped) {
@@ skipping 10 matching lines @@
         result = intersections.horizontal(quad, left, right, line[0].fY, flipped);
     } else {
         intersections.intersect(quad, line);
         result = intersections.used();
     }
     return result;
 }
 
 static void testLineIntersect(skiatest::Reporter* reporter, const SkDQuad& quad,
                               const SkDLine& line, const double x, const double y) {
-    char pathStr[1024];
-    sk_bzero(pathStr, sizeof(pathStr));
-    char* str = pathStr;
-    str += sprintf(str, "    path.moveTo(%1.9g, %1.9g);\n", quad[0].fX, quad[0].fY);
-    str += sprintf(str, "    path.quadTo(%1.9g, %1.9g, %1.9g, %1.9g);\n", quad[1].fX,
+    SkString pathStr;
+    pathStr.appendf("    path.moveTo(%1.9g, %1.9g);\n", quad[0].fX, quad[0].fY);
+    pathStr.appendf("    path.quadTo(%1.9g, %1.9g, %1.9g, %1.9g);\n", quad[1].fX,
             quad[1].fY, quad[2].fX, quad[2].fY);
-    str += sprintf(str, "    path.moveTo(%1.9g, %1.9g);\n", line[0].fX, line[0].fY);
-    str += sprintf(str, "    path.lineTo(%1.9g, %1.9g);\n", line[1].fX, line[1].fY);
+    pathStr.appendf("    path.moveTo(%1.9g, %1.9g);\n", line[0].fX, line[0].fY);
+    pathStr.appendf("    path.lineTo(%1.9g, %1.9g);\n", line[1].fX, line[1].fY);
 
     SkIntersections intersections;
     bool flipped = false;
     int result = doIntersect(intersections, quad, line, flipped);
     bool found = false;
     for (int index = 0; index < result; ++index) {
         double quadT = intersections[0][index];
         SkDPoint quadXY = quad.ptAtT(quadT);
         double lineT = intersections[1][index];
         SkDPoint lineXY = line.ptAtT(lineT);
@@ skipping 57 matching lines @@
             for (int c = 0 ; c < 16; ++c) {
                 *testRunner.fRunnables.append() = new PathOpsThreadedRunnable(
                         &testQuadLineIntersectMain, a, b, c, 0, &testRunner);
             }
             if (!reporter->allowExtendedTest()) goto finish;
         }
     }
 finish:
     testRunner.render();
 }