SkChopCubicAt2 using Sk2s-- 2x faster

tests/GeometryTest.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 "SkGeometry.h"
 #include "Test.h"
 #include "SkRandom.h"
@@ skipping 40 matching lines @@
         for (int j = 0; j < 3; ++j) {
             pts[j].set(rand.nextSScalar1() * 100, rand.nextSScalar1() * 100);
         }
         const SkScalar dt = SK_Scalar1 / 128;
         SkScalar t = dt;
         for (int j = 1; j < 128; ++j) {
             SkPoint r0;
             SkEvalQuadAt(pts, t, &r0);
             SkPoint r1 = SkEvalQuadAt(pts, t);
             check_pairs(reporter, i, t, "quad-pos", r0.fX, r0.fY, r1.fX, r1.fY);
-
+            
             SkVector v0;
             SkEvalQuadAt(pts, t, NULL, &v0);
             SkVector v1 = SkEvalQuadTangentAt(pts, t);
             check_pairs(reporter, i, t, "quad-tan", v0.fX, v0.fY, v1.fX, v1.fY);
-
+            
             SkPoint dst0[5], dst1[5];
             SkChopQuadAt(pts,  dst0, t);
             SkChopQuadAt2(pts, dst1, t);
             for (int k = 0; k < 5; ++k) {
                 check_pairs(reporter, i, t, "chop-quad",
                             dst0[k].fX, dst0[k].fY, dst1[k].fX, dst1[k].fY);
             }
-
+            
             t += dt;
         }
     }
+}
+
+static void test_cubicat(skiatest::Reporter* reporter) {
+    SkRandom rand;
+    for (int i = 0; i < 1000; ++i) {
+        SkPoint pts[4];
+        for (int j = 0; j < 4; ++j) {
+            pts[j].set(rand.nextSScalar1() * 100, rand.nextSScalar1() * 100);
+        }
+        const SkScalar dt = SK_Scalar1 / 128;
+        SkScalar t = dt;
+        for (int j = 1; j < 128; ++j) {
+            SkPoint dst0[7], dst1[7];
+            SkChopCubicAt(pts,  dst0, t);
+            SkChopCubicAt2(pts, dst1, t);
+            for (int k = 0; k < 7; ++k) {
+                check_pairs(reporter, i, t, "chop-cubic",
+                            dst0[k].fX, dst0[k].fY, dst1[k].fX, dst1[k].fY);
+            }
+            
+            t += dt;
+        }
+    }
 }
 
 static void test_conic_eval_pos(skiatest::Reporter* reporter, const SkConic& conic, SkScalar t) {
     SkPoint p0, p1;
     conic.evalAt(t, &p0, NULL);
     p1 = conic.evalAt(t);
     check_pairs(reporter, 0, t, "conic-pos", p0.fX, p0.fY, p1.fX, p1.fY);
 }
 
 static void test_conic_eval_tan(skiatest::Reporter* reporter, const SkConic& conic, SkScalar t) {
@@ skipping 61 matching lines @@
         { SkIntToScalar(3), SkIntToScalar(1), },
         { SkIntToScalar(3), SkIntToScalar(3) },
     };
     for (int i = 0; i < 4; ++i) {
         REPORTER_ASSERT(reporter, nearly_equal(cubic[i], dst[i]));
     }
 
     testChopCubic(reporter);
     test_evalquadat(reporter);
     test_conic(reporter);
+    test_cubicat(reporter);
 }