fix path ops fuzz buster

src/pathops/SkOpSpan.h

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #ifndef SkOpSpan_DEFINED
 #define SkOpSpan_DEFINED
 
 #include "SkPathOpsDebug.h"
@@ skipping 30 matching lines @@
         }
         
         SkOpPtT* oldNext = this->fNext;
         SkASSERT(this != opp);
         this->fNext = opp;
         SkASSERT(oppPrev != oldNext);
         oppPrev->fNext = oldNext;
     }
 
     bool alias() const;
+    bool collapsed(const SkOpPtT* ) const;
     bool contains(const SkOpPtT* ) const;
     SkOpPtT* contains(const SkOpSegment* );
     SkOpContour* contour() const;
 
     int debugID() const {
         return SkDEBUGRELEASE(fID, -1);
     }
 
     const SkOpAngle* debugAngle(int id) const;
     SkOpContour* debugContour(int id);
@@ skipping 198 matching lines @@
     }
 
     SkOpPtT* ptT() {
         return &fPtT;
     }
 
     SkOpSegment* segment() const {
         return fSegment;
     }
 
+    void setAligned() {
+        fAligned = true;
+    }
+
     void setChased(bool chased) {
         fChased = chased;
     }
 
     SkOpPtT* setCoinEnd(SkOpSpanBase* oldCoinEnd, SkOpSegment* oppSegment);
 
     void setFromAngle(SkOpAngle* angle) {
         fFromAngle = angle;
     }
 
@@ skipping 212 matching lines @@
     SkOpSpanBase* fNext;  // next intersection point
     int fWindSum;  // accumulated from contours surrounding this one.
     int fOppSum;  // for binary operators: the opposite winding sum
     int fWindValue;  // 0 == canceled; 1 == normal; >1 == coincident
     int fOppValue;  // normally 0 -- when binary coincident edges combine, opp value goes here
     int fTopTTry; // specifies direction and t value to try next
     bool fDone;  // if set, this span to next higher T has been processed
 };
 
 #endif