optimize pathops coverage

src/pathops/SkOpContour.cpp

 /*
 * Copyright 2013 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 "SkOpContour.h"
 #include "SkPathWriter.h"
 #include "SkTSort.h"
@@ skipping 194 matching lines @@
             SkTSwap<double>(startT, endT);
             SkTSwap<double>(oStartT, oEndT);
         }
         bool cancel = swapOther != swapStart;
         int step = swapStart ? -1 : 1;
         int oStep = swapOther ? -1 : 1;
         double oMatchStart = cancel ? oEndT : oStartT;
         if (partial ? startT != 0 || oMatchStart != 0 : (startT == 0) != (oMatchStart == 0)) {
             bool added = false;
             if (oMatchStart != 0) {
-                added = thisOne.joinCoincidence(false, &other, oMatchStart, oStep, cancel);
+                added = thisOne.joinCoincidence(&other, oMatchStart, oStep, cancel);
             }
-            if (startT != 0 && !added) {
-                (void) other.joinCoincidence(cancel, &thisOne, startT, step, cancel);
+            if (!cancel && startT != 0 && !added) {
+                (void) other.joinCoincidence(&thisOne, startT, step, cancel);
             }
         }
         double oMatchEnd = cancel ? oStartT : oEndT;
         if (partial ? endT != 1 || oMatchEnd != 1 : (endT == 1) != (oMatchEnd == 1)) {
             bool added = false;
-            if (oMatchEnd != 1) {
-                added = thisOne.joinCoincidence(true, &other, oMatchEnd, -oStep, cancel);
-            }
-            if (endT != 1 && !added) {
-                (void) other.joinCoincidence(!cancel, &thisOne, endT, -step, cancel);
+            if (cancel && endT != 1 && !added) {
+                (void) other.joinCoincidence(&thisOne, endT, -step, cancel);
             }
         }
     }
 }
 
 void SkOpContour::calcCommonCoincidentWinding(const SkCoincidence& coincidence) {
     int thisIndex = coincidence.fSegments[0];
     SkOpSegment& thisOne = fSegments[thisIndex];
     if (thisOne.done()) {
         return;
@@ skipping 143 matching lines @@
         SkDebugf("%s empty contour\n", __FUNCTION__);
         SkASSERT(0);
         // FIXME: delete empty contour?
         return;
     }
     fBounds = fSegments.front().bounds();
     for (int index = 1; index < count; ++index) {
         fBounds.add(fSegments[index].bounds());
     }
 }