fix fuzzers

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 87 matching lines @@
         this->addExactEndPoints();
         if (fAllowNear) {
             this->addNearEndPoints();
         }
         double rootVals[2];
         int roots = this->intersectRay(rootVals);
         for (int index = 0; index < roots; ++index) {
             double conicT = rootVals[index];
             double lineT = this->findLineT(conicT);
 #ifdef SK_DEBUG
-            if (!fIntersections->debugGlobalState()
-                    || !fIntersections->debugGlobalState()->debugSkipAssert()) {
+            if (!fIntersections->globalState()
+                    || !fIntersections->globalState()->debugSkipAssert()) {
                 SkDEBUGCODE(SkDPoint conicPt = fConic.ptAtT(conicT));
                 SkDEBUGCODE(SkDPoint linePt = fLine->ptAtT(lineT));
                 SkASSERT(conicPt.approximatelyDEqual(linePt));
             }
 #endif
             SkDPoint pt;
             if (this->pinTs(&conicT, &lineT, &pt, kPointUninitialized)
                     && this->uniqueAnswer(conicT, pt)) {
                 fIntersections->insert(conicT, lineT, pt);
             }
@@ skipping 255 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);
 }