remove duplicate linked list adjustment

tests/PathOpsBuilderTest.cpp

 /*
  * Copyright 2014 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 "PathOpsTestCommon.h"
 #include "SkBitmap.h"
@@ skipping 253 matching lines @@
     inner.addRect(757798030.f, 30, 757798030.f+100, 30+60); // <rect x="757798030" y="30" width="100" height="60" />
     clipRect.addPath(inner);
 
     SkOpBuilder builder;
     builder.add(clipCircle, kUnion_SkPathOp);
     builder.add(clipRect, kDifference_SkPathOp);
     SkPath result;
     builder.resolve(&result);
 }
 
+#include "SkParsePath.h"
+
+DEF_TEST(fuzzTNG, reporter) {

[reed1, 2015/08/31 21:11:01]

can we tie this test to a bug or even CL? Your description in the CL was very
detalied. Perhaps some of that should be referenced from here, to justify/motive
this test.

+    const char* pathStrs[] = {
+"M360,-2147483648.000000000000000000000000000000000000000000000000000001 A3240,3240 0.0 0 11 256,256 L100000000,4140 Z",
+"M360,4140 A11,-1 0.0 0 0 6840,4140 L100,512 L32,16 L360,1024 Z",
+"M360,4140 A3240,1000000001 32768 1024 128 100000000.000000000000000000000000000000000000000000000000000001,512 Z",
+"M127,321 L6840,270 L-21474836481,100000000 L2551,64 Z",
+"M-128,4140 Z",
+    };
+    SkPath clip[SK_ARRAY_COUNT(pathStrs)];
+    SkOpBuilder builder;
+    for (size_t i = 0; i < SK_ARRAY_COUNT(pathStrs); ++i) {
+        SkParsePath::FromSVGString(pathStrs[i], &clip[i]);
+        builder.add(clip[i], kUnion_SkPathOp);
+    }
+    SkPath result;
+    builder.resolve(&result);
+    SkPath path;
+    SkParsePath::FromSVGString("M-315,7425 L4096,7425 L-1000000001,-315 L-315,7425 Z", &path);
+    builder.add(path, kDifference_SkPathOp);
+    testPathOp(reporter, result, path, kDifference_SkPathOp, __FUNCTION__);
+}