harden and speed up path op unit tests

tests/PathOpsAngleTest.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 "SkOpSegment.h"
 #include "SkTArray.h"
 #include "Test.h"
 
 static const SkPoint cubics[][4] = {
 /* 0 */    {{0, 1}, {2, 6}, {4, 2}, {5, 3}},
 /* 1 */    {{10, 234}, {10, 229.581726f}, {13.5817204f, 226}, {18, 226}},
 /* 2 */    {{132, 11419}, {130.89543151855469f, 11419}, {130, 11418.1044921875f}, {130, 11417}},
 /* 3 */    {{130.04275512695312f, 11417.4130859375f}, {130.23307800292969f, 11418.3193359375f},
                     {131.03709411621094f, 11419}, {132, 11419}},
@@ skipping 224 matching lines @@
         SkOpSegment* seg, int* ts, const SkPoint& startPt) {
     SkPoint start, end;
     const SkPoint* data = set[idx].ptData;
     bool useIntersectPt = startPt.fX != 0 || startPt.fY != 0;
     if (useIntersectPt) {
         start = startPt;
         end = set[idx].endPt;
     }
     switch(set[idx].ptCount) {
         case 2: {
+            SkASSERT(ValidPoints(data, 2));
             seg->addLine(data, false, false);
             SkDLine dLine;
             dLine.set(set[idx].ptData);
+            SkASSERT(ValidLine(dLine));
             if (useIntersectPt) {
                 break;
             }
             start = dLine.xyAtT(set[idx].tStart).asSkPoint();
             end = dLine.xyAtT(set[idx].tEnd).asSkPoint();
             } break;
         case 3: {
+            SkASSERT(ValidPoints(data, 3));
             seg->addQuad(data, false, false);
             SkDQuad dQuad;
             dQuad.set(set[idx].ptData);
+            SkASSERT(ValidQuad(dQuad));
              if (useIntersectPt) {
                 break;
             }
             start = dQuad.xyAtT(set[idx].tStart).asSkPoint();
             end = dQuad.xyAtT(set[idx].tEnd).asSkPoint();
             } break;
         case 4: {
+            SkASSERT(ValidPoints(data, 4));
             seg->addCubic(data, false, false);
             SkDCubic dCubic;
             dCubic.set(set[idx].ptData);
+            SkASSERT(ValidCubic(dCubic));
             if (useIntersectPt) {
                 break;
             }
             start = dCubic.xyAtT(set[idx].tStart).asSkPoint();
             end = dCubic.xyAtT(set[idx].tEnd).asSkPoint();
             } break;
     }
     double tStart = set[idx].tStart;
     double tEnd = set[idx].tEnd;
     seg->addT(NULL, start, tStart);
@@ skipping 178 matching lines @@
     }
 }
 #endif
 
 #include "TestClassDef.h"
 DEFINE_TESTCLASS_SHORT(PathOpsAngleTest)
 
 DEFINE_TESTCLASS_SHORT(PathOpsAngleTestOne)
 
 // DEFINE_TESTCLASS_SHORT(PathOpsAngleFindSlop)