Make GrAAConvexPathRender support paths with > 64K verts.

gm/convexpaths.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 "gm.h"
 #include "SkRandom.h"
 #include "SkTArray.h"
@@ skipping 102 matching lines @@
                                                          SK_Scalar1 * 100),
                                         40 * SK_Scalar1, 20 * SK_Scalar1,
                                         SkPath::kCW_Direction);
 
         fPaths.push_back().addRoundRect(SkRect::MakeXYWH(0, 0,
                                                          SK_Scalar1 * 100,
                                                          SK_Scalar1 * 100),
                                         20 * SK_Scalar1, 40 * SK_Scalar1,
                                         SkPath::kCCW_Direction);
 
+        // large number of points
+        enum {
+            kLength = 100,
+            kPtsPerSide = (1 << 12),
+        };
+        fPaths.push_back().moveTo(0, 0);

[robertphillips, 2013/05/13 19:18:05]

i = 1?

[bsalomon, 2013/05/13 19:26:06]

Done

+        for (int i = 0; i < kPtsPerSide; ++i) {
+            fPaths.back().lineTo(kLength * SkIntToScalar(i) / kPtsPerSide, 0);
+        }
+        for (int i = 0; i < kPtsPerSide; ++i) {
+            fPaths.back().lineTo(kLength, kLength * SkIntToScalar(i) / kPtsPerSide);
+        }
+        for (int i = kPtsPerSide; i > 0; --i) {
+            fPaths.back().lineTo(kLength * SkIntToScalar(i) / kPtsPerSide, kLength);
+        }
+        for (int i = kPtsPerSide; i > 0; --i) {
+            fPaths.back().lineTo(0, kLength * SkIntToScalar(i) / kPtsPerSide);
+        }
+
         // shallow diagonals
         fPaths.push_back().lineTo(100 * SK_Scalar1, SK_Scalar1);
         fPaths.back().lineTo(98 * SK_Scalar1, 100 * SK_Scalar1);
         fPaths.back().lineTo(3 * SK_Scalar1, 96 * SK_Scalar1);
 
-
         //It turns out arcTos are not automatically marked as convex and they
         //may in fact be ever so slightly concave.
         //fPaths.push_back().arcTo(SkRect::MakeXYWH(0, 0,
         //                                          50 * SK_Scalar1,
         //                                          100 * SK_Scalar1),
         //                         25 * SK_Scalar1,  130 * SK_Scalar1, false);
 
         // cubics
         fPaths.push_back().cubicTo( 1 * SK_Scalar1,  1 * SK_Scalar1,
                                    10 * SK_Scalar1,  90 * SK_Scalar1,
@@ skipping 117 matching lines @@
     typedef GM INHERITED;
     SkTArray<SkPath> fPaths;
 };
 
 //////////////////////////////////////////////////////////////////////////////
 
 static GM* MyFactory(void*) { return new ConvexPathsGM; }
 static GMRegistry reg(MyFactory);
 
 }