fix fuzzers

src/pathops/SkDCubicLineIntersection.cpp

 /*
  * Copyright 2012 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 "SkPathOpsCubic.h"
 #include "SkPathOpsCurve.h"
 #include "SkPathOpsLine.h"
@@ skipping 104 matching lines @@
             }
             fIntersections->setCoincident(index);
         }
     }
 
     // see parallel routine in line quadratic intersections
     int intersectRay(double roots[3]) {
         double adj = fLine[1].fX - fLine[0].fX;
         double opp = fLine[1].fY - fLine[0].fY;
         SkDCubic c;
+        SkDEBUGCODE(c.fDebugGlobalState = fIntersections->globalState());
         for (int n = 0; n < 4; ++n) {
             c[n].fX = (fCubic[n].fY - fLine[0].fY) * adj - (fCubic[n].fX - fLine[0].fX) * opp;
         }
         double A, B, C, D;
         SkDCubic::Coefficients(&c[0].fX, &A, &B, &C, &D);
         int count = SkDCubic::RootsValidT(A, B, C, D, roots);
         for (int index = 0; index < count; ++index) {
             SkDPoint calcPt = c.ptAtT(roots[index]);
             if (!approximately_zero(calcPt.fX)) {
                 for (int n = 0; n < 4; ++n) {
@@ skipping 310 matching lines @@
 
 // SkDCubic accessors to Intersection utilities
 
 int SkDCubic::horizontalIntersect(double yIntercept, double roots[3]) const {
     return LineCubicIntersections::HorizontalIntersect(*this, yIntercept, roots);
 }
 
 int SkDCubic::verticalIntersect(double xIntercept, double roots[3]) const {
     return LineCubicIntersections::VerticalIntersect(*this, xIntercept, roots);
 }