| Index: src/pathops/SkPathOpsCommon.cpp
|
| diff --git a/src/pathops/SkPathOpsCommon.cpp b/src/pathops/SkPathOpsCommon.cpp
|
| index 0fa5ce0c9202378ce59314070c0754303081506c..5a30c3a98eeded8f567af0db378977f3a3eaf04d 100644
|
| --- a/src/pathops/SkPathOpsCommon.cpp
|
| +++ b/src/pathops/SkPathOpsCommon.cpp
|
| @@ -138,7 +138,7 @@ SkOpSegment* FindChase(SkTDArray<SkOpSpan*>& chase, int& tIndex, int& endIndex)
|
| SkOpSegment::kMayBeUnordered_SortAngleKind);
|
| int angleCount = sorted.count();
|
| #if DEBUG_SORT
|
| - sorted[0]->segment()->debugShowSort(__FUNCTION__, sorted, 0, 0, 0);
|
| + sorted[0]->segment()->debugShowSort(__FUNCTION__, sorted, 0, 0, 0, sortable);
|
| #endif
|
| if (!sortable) {
|
| continue;
|
| @@ -162,7 +162,7 @@ SkOpSegment* FindChase(SkTDArray<SkOpSpan*>& chase, int& tIndex, int& endIndex)
|
| winding += spanWinding;
|
| }
|
| #if DEBUG_SORT
|
| - segment->debugShowSort(__FUNCTION__, sorted, firstIndex, winding, 0);
|
| + segment->debugShowSort(__FUNCTION__, sorted, firstIndex, winding, 0, sortable);
|
| #endif
|
| // we care about first sign and whether wind sum indicates this
|
| // edge is inside or outside. Maybe need to pass span winding
|
|
|