remove unused reduce order code

tests/PathOpsCubicQuadIntersectionTest.cpp

 /*
  * Copyright 2013 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #include "PathOpsTestCommon.h"
 #include "SkIntersections.h"
 #include "SkPathOpsCubic.h"
 #include "SkPathOpsQuad.h"
@@ skipping 41 matching lines @@
 
 static void PathOpsCubicQuadIntersectionTest(skiatest::Reporter* reporter) {
     for (size_t index = 0; index < quadCubicTests_count; ++index) {
         int iIndex = static_cast<int>(index);
         const SkDCubic& cubic = quadCubicTests[index].cubic;
         SkASSERT(ValidCubic(cubic));
         const SkDQuad& quad = quadCubicTests[index].quad;
         SkASSERT(ValidQuad(quad));
         SkReduceOrder reduce1;
         SkReduceOrder reduce2;
-        int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics,
-                SkReduceOrder::kFill_Style);
-        int order2 = reduce2.reduce(quad, SkReduceOrder::kFill_Style);
+        int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics);
+        int order2 = reduce2.reduce(quad);
         if (order1 != 4) {
             SkDebugf("[%d] cubic order=%d\n", iIndex, order1);
             REPORTER_ASSERT(reporter, 0);
         }
         if (order2 != 3) {
             SkDebugf("[%d] quad order=%d\n", iIndex, order2);
             REPORTER_ASSERT(reporter, 0);
         }
         SkIntersections i;
         int roots = i.intersect(cubic, quad);
@@ skipping 17 matching lines @@
                     __FUNCTION__, iIndex, pt, xy1.fX, xy1.fY);
             }
             REPORTER_ASSERT(reporter, found);
         }
         reporter->bumpTestCount();
     }
 }
 
 #include "TestClassDef.h"
 DEFINE_TESTCLASS_SHORT(PathOpsCubicQuadIntersectionTest)