fix fuzzer bug

src/pathops/SkDConicLineIntersection.cpp

 /*
  * Copyright 2015 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #include "SkIntersections.h"
 #include "SkPathOpsConic.h"
 #include "SkPathOpsCurve.h"
 #include "SkPathOpsLine.h"
@@ skipping 62 matching lines @@
         this->addExactHorizontalEndPoints(left, right, axisIntercept);
         if (fAllowNear) {
             this->addNearHorizontalEndPoints(left, right, axisIntercept);
         }
         double roots[2];
         int count = this->horizontalIntersect(axisIntercept, roots);
         for (int index = 0; index < count; ++index) {
             double conicT = roots[index];
             SkDPoint pt = fConic.ptAtT(conicT);
             SkDEBUGCODE_(double conicVals[] = { fConic[0].fY, fConic[1].fY, fConic[2].fY });
-            SkASSERT(close_to(pt.fY, axisIntercept, conicVals));
+            SkOPOBJASSERT(fIntersections, close_to(pt.fY, axisIntercept, conicVals));
             double lineT = (pt.fX - left) / (right - left);
             if (this->pinTs(&conicT, &lineT, &pt, kPointInitialized)
                     && this->uniqueAnswer(conicT, pt)) {
                 fIntersections->insert(conicT, lineT, pt);
             }
         }
         if (flipped) {
             fIntersections->flip();
         }
         this->checkCoincident();
@@ skipping 57 matching lines @@
         this->addExactVerticalEndPoints(top, bottom, axisIntercept);
         if (fAllowNear) {
             this->addNearVerticalEndPoints(top, bottom, axisIntercept);
         }
         double roots[2];
         int count = this->verticalIntersect(axisIntercept, roots);
         for (int index = 0; index < count; ++index) {
             double conicT = roots[index];
             SkDPoint pt = fConic.ptAtT(conicT);
             SkDEBUGCODE_(double conicVals[] = { fConic[0].fX, fConic[1].fX, fConic[2].fX });
-            SkASSERT((fIntersections->debugGlobalState() &&
-                fIntersections->debugGlobalState()->debugSkipAssert()) ||
-                close_to(pt.fX, axisIntercept, conicVals));
+            SkOPOBJASSERT(fIntersections, close_to(pt.fX, axisIntercept, conicVals));
             double lineT = (pt.fY - top) / (bottom - top);
             if (this->pinTs(&conicT, &lineT, &pt, kPointInitialized)
                     && this->uniqueAnswer(conicT, pt)) {
                 fIntersections->insert(conicT, lineT, pt);
             }
         }
         if (flipped) {
             fIntersections->flip();
         }
         this->checkCoincident();
@@ skipping 203 matching lines @@
 
 int SkIntersections::HorizontalIntercept(const SkDConic& conic, SkScalar y, double* roots) {
     LineConicIntersections c(conic);
     return c.horizontalIntersect(y, roots);
 }
 
 int SkIntersections::VerticalIntercept(const SkDConic& conic, SkScalar x, double* roots) {
     LineConicIntersections c(conic);
     return c.verticalIntersect(x, roots);
 }