working on initial winding for cubics

tests/PathOpsCubicIntersectionTest.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 "PathOpsCubicIntersectionTestData.h"
 #include "PathOpsTestCommon.h"
 #include "SkGeometry.h"
 #include "SkIntersections.h"
@@ skipping 607 matching lines @@
 
 static void selfOneOff(skiatest::Reporter* reporter, int index) {
     const SkDCubic& cubic = selfSet[index];
     SkPoint c[4];
     for (int i = 0; i < 4; ++i) {
         c[i] = cubic[i].asSkPoint();
     }
     SkScalar loopT;
     SkScalar d[3];
     SkCubicType cubicType = SkClassifyCubic(c, d);
-    if (SkDCubic::ComplexBreak(c, &loopT) && cubicType == SkCubicType::kLoop_SkCubicType) {
+    SkDCubic::CubicType dType;
+    if (SkDCubic::ComplexBreak(c, &loopT, &dType) && cubicType == SkCubicType::kLoop_SkCubicType) {
         SkIntersections i;
         SkPoint twoCubics[7];
         SkChopCubicAt(c, twoCubics, loopT);
         SkDCubic chopped[2];
         chopped[0].set(&twoCubics[0]);
         chopped[1].set(&twoCubics[3]);
         int result = i.intersect(chopped[0], chopped[1]);
         REPORTER_ASSERT(reporter, result == 2);
         REPORTER_ASSERT(reporter, i.used() == 2);
         for (int index = 0; index < result; ++index) {
@@ skipping 49 matching lines @@
 }
 
 DEF_TEST(PathOpsCubicIntersection, reporter) {
     oneOffTests(reporter);
     cubicIntersectionSelfTest(reporter);
     cubicIntersectionCoinTest(reporter);
     standardTestCases(reporter);
     if (false) CubicIntersection_IntersectionFinder();
     if (false) CubicIntersection_RandTest(reporter);
 }