fix fuzzers

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 "SkIntersections.h"
 #include "SkOpContour.h"
 #include "SkOpSegment.h"
@@ skipping 63 matching lines @@
     for (int index = 0; index < 100000; ++index) {
         SkDLine line = {{{0, 0}, {ran.nextRangeF(0.0001f, 1000), ran.nextRangeF(0.0001f, 1000)}}};
         float t = ran.nextRangeF(0.0001f, 1);
         SkDPoint dPt = line.ptAtT(t);
         float t2 = ran.nextRangeF(0.0001f, 1);
         SkDPoint qPt = line.ptAtT(t2);
         float t3 = ran.nextRangeF(0.0001f, 1);
         SkDPoint qPt2 = line.ptAtT(t3);
         qPt.fX += qPt2.fY;
         qPt.fY -= qPt2.fX;
-        SkDQuad quad = {{line[0], dPt, qPt}};
+        QuadPts q = {{line[0], dPt, qPt}};
+        SkDQuad quad;
+        quad.debugSet(q.fPts);
         // binary search for maximum movement of quad[1] towards test that still has 1 intersection
         double moveT = 0.5f;
         double deltaT = moveT / 2;
         SkDPoint last;
         do {
             last = quad[1];
             quad[1].fX = dPt.fX - line[1].fY * moveT;
             quad[1].fY = dPt.fY + line[1].fX * moveT;
             SkIntersections i;
             i.intersect(quad, line);
@@ skipping 121 matching lines @@
 };
 
 class PathOpsSegmentTester {
 public:
     static void DebugReset(SkOpSegment* segment) {
         segment->debugReset();
     }
 };
 
 struct CircleData {
-    const SkDCubic fPts;
+    const CubicPts fPts;
     const int fPtCount;
     SkPoint fShortPts[4];
 };
 
 static CircleData circleDataSet[] = {
     { {{{313.0155029296875, 207.90290832519531}, {320.05078125, 227.58743286132812}}}, 2, {} },
     { {{{313.0155029296875, 207.90290832519531}, {313.98246891063195, 219.33615203830394},
             {320.05078125, 227.58743286132812}}}, 3, {} },
 };
 
@@ skipping 22 matching lines @@
         }
     }
     SkOpSegment* first = contour.first();
     first->debugAddAngle(0, 1);
     SkOpSegment* next = first->next();
     next->debugAddAngle(0, 1);
     PathOpsAngleTester::Orderable(*first->debugLastAngle(), *next->debugLastAngle());
 }
 
 struct IntersectData {
-    const SkDCubic fPts;
+    const CubicPts fPts;
     const int fPtCount;
     double fTStart;
     double fTEnd;
     SkPoint fShortPts[4];
 };
 
 static IntersectData intersectDataSet1[] = {
     { {{{322.935669,231.030273}, {312.832214,220.393295}, {312.832214,203.454178}}}, 3,
             0.865309956, 0.154740299, {} },
     { {{{322.12738,233.397751}, {295.718353,159.505829}}}, 2,
@@ skipping 238 matching lines @@
         SkOpSegment* first = contour.first();
         first->debugAddAngle(0, 1);
         SkOpSegment* next = first->next();
         next->debugAddAngle(0, 1);
         /* int result = */
             PathOpsAngleTester::AllOnOneSide(*first->debugLastAngle(), *next->debugLastAngle());
   //      SkDebugf("i=%d result=%d\n", i , result);
   //      SkDebugf("");
     }
 }