fuzz wednesday

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 116 matching lines @@
 
     bool ptAlreadySeen(const SkOpPtT* head) const;
     SkOpPtT* prev();
     SkOpPtT* remove(const SkOpPtT* kept);
     void removeNext(const SkOpPtT* kept);
 
     const SkOpSegment* segment() const;
     SkOpSegment* segment();
 
     void setCoincident() const {
-        SkASSERT(!fDeleted);
+        SkOPASSERT(!fDeleted);
         fCoincident = true;
     }
 
     void setDeleted();
 
     void setSpan(const SkOpSpanBase* span) {
         fSpan = const_cast<SkOpSpanBase*>(span);
     }
 
     const SkOpSpanBase* span() const {
@@ skipping 400 matching lines @@
     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
     mutable bool fAlreadyAdded;
 };
 
 #endif