| Index: src/pathops/SkOpSegment.cpp
|
| diff --git a/src/pathops/SkOpSegment.cpp b/src/pathops/SkOpSegment.cpp
|
| index 20f0013230f0bfa1094ae603641705b1eba224af..87023261c59d159594f21b0ce86e0400c1f295c0 100644
|
| --- a/src/pathops/SkOpSegment.cpp
|
| +++ b/src/pathops/SkOpSegment.cpp
|
| @@ -9,8 +9,6 @@
|
| #include "SkOpSegment.h"
|
| #include "SkPathWriter.h"
|
|
|
| -#define FAIL_IF(cond) do { if (cond) return false; } while (false)
|
| -
|
| /*
|
| After computing raw intersections, post process all segments to:
|
| - find small collections of points that can be collapsed to a single point
|
| @@ -163,10 +161,7 @@ bool SkOpSegment::activeWinding(SkOpSpanBase* start, SkOpSpanBase* end, int* sum
|
|
|
| bool SkOpSegment::addCurveTo(const SkOpSpanBase* start, const SkOpSpanBase* end,
|
| SkPathWriter* path) const {
|
| - if (start->starter(end)->alreadyAdded()) {
|
| - SkDEBUGF(("same curve added twice aborted pathops\n"));
|
| - return false;
|
| - }
|
| + FAIL_IF(start->starter(end)->alreadyAdded());
|
| SkOpCurve edge;
|
| const SkPoint* ePtr;
|
| SkScalar eWeight;
|
|
|