OLD | NEW |
1 /* | 1 /* |
2 * Copyright 2013 Google Inc. | 2 * Copyright 2013 Google Inc. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
6 */ | 6 */ |
7 | 7 |
8 #include "SkMutex.h" | 8 #include "SkMutex.h" |
9 #include "SkOpCoincidence.h" | 9 #include "SkOpCoincidence.h" |
10 #include "SkOpContour.h" | 10 #include "SkOpContour.h" |
(...skipping 804 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
815 // mark coincidence | 815 // mark coincidence |
816 #if DEBUG_COINCIDENCE | 816 #if DEBUG_COINCIDENCE |
817 // SkDebugf("%s coinSpan=%d endSpan=%d oppSpan=%d oppEndSpan=%d\
n", __FUNCTION__, | 817 // SkDebugf("%s coinSpan=%d endSpan=%d oppSpan=%d oppEndSpan=%d\
n", __FUNCTION__, |
818 // rootPriorPtT->debugID(), rootPtT->debugID(), rootOppS
tart->debugID(), | 818 // rootPriorPtT->debugID(), rootPtT->debugID(), rootOppS
tart->debugID(), |
819 // rootOppEnd->debugID()); | 819 // rootOppEnd->debugID()); |
820 #endif | 820 #endif |
821 log->record(kMissingCoin_Glitch, id, priorPtT, ptT, oppStart, op
pEnd); | 821 log->record(kMissingCoin_Glitch, id, priorPtT, ptT, oppStart, op
pEnd); |
822 // coincidences->add(rootPriorPtT, rootPtT, rootOppStart, root
OppEnd); | 822 // coincidences->add(rootPriorPtT, rootPtT, rootOppStart, root
OppEnd); |
823 // } | 823 // } |
824 #if DEBUG_COINCIDENCE | 824 #if DEBUG_COINCIDENCE |
825 // SkASSERT(coincidences->contains(rootPriorPtT, rootPtT, rootOpp
Start, rootOppEnd) | 825 // SkASSERT(coincidences->contains(rootPriorPtT, rootPtT, rootOpp
Start, rootOppEnd); |
826 #endif | 826 #endif |
827 // result = true; | 827 // result = true; |
828 } | 828 } |
829 swapBack: | 829 swapBack: |
830 if (swapped) { | 830 if (swapped) { |
831 SkTSwap(priorPtT, ptT); | 831 SkTSwap(priorPtT, ptT); |
832 } | 832 } |
833 } | 833 } |
834 } while ((spanBase = spanBase->final() ? nullptr : spanBase->upCast()->next(
))); | 834 } while ((spanBase = spanBase->final() ? nullptr : spanBase->upCast()->next(
))); |
835 DebugClearVisited(&fHead); | 835 DebugClearVisited(&fHead); |
(...skipping 1631 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2467 #endif | 2467 #endif |
2468 SkPath::FillType fillType = path.getFillType(); | 2468 SkPath::FillType fillType = path.getFillType(); |
2469 SkASSERT(fillType >= SkPath::kWinding_FillType && fillType <= SkPath::kInver
seEvenOdd_FillType); | 2469 SkASSERT(fillType >= SkPath::kWinding_FillType && fillType <= SkPath::kInver
seEvenOdd_FillType); |
2470 if (includeDeclaration) { | 2470 if (includeDeclaration) { |
2471 SkDebugf(" SkPath %s;\n", name); | 2471 SkDebugf(" SkPath %s;\n", name); |
2472 } | 2472 } |
2473 SkDebugf(" %s.setFillType(SkPath::%s);\n", name, gFillTypeStr[fillType]); | 2473 SkDebugf(" %s.setFillType(SkPath::%s);\n", name, gFillTypeStr[fillType]); |
2474 iter.setPath(path); | 2474 iter.setPath(path); |
2475 showPathContours(iter, name); | 2475 showPathContours(iter, name); |
2476 } | 2476 } |
OLD | NEW |