Home
last modified time | relevance | path

Searched refs:unsortable (Results 1 – 22 of 22) sorted by relevance

/external/chromium_org/third_party/skia/src/pathops/
DSkPathOpsSimplify.cpp14 bool unsortable = false; in bridgeWinding() local
41 if (!unsortable && current->done()) { in bridgeWinding()
44 SkASSERT(unsortable || !current->done()); in bridgeWinding()
48 &unsortable); in bridgeWinding()
50 if (!unsortable && simple->hasMove() in bridgeWinding()
67 } while (!simple->isClosed() && (!unsortable in bridgeWinding()
108 bool unsortable = false; in bridgeXor() local
113 if (!unsortable && current->done()) { in bridgeXor()
117 SkASSERT(unsortable || !current->done()); in bridgeXor()
120 SkOpSegment* next = current->findNextXor(&nextStart, &nextEnd, &unsortable); in bridgeXor()
[all …]
DSkPathOpsOp.cpp124 bool unsortable = false; in bridgeOp() local
158 if (!unsortable && current->done()) { in bridgeOp()
161 SkASSERT(unsortable || !current->done()); in bridgeOp()
165 &unsortable, op, xorMask, xorOpMask); in bridgeOp()
167 if (!unsortable && simple->hasMove() in bridgeOp()
189 } while (!simple->isClosed() && (!unsortable in bridgeOp()
194 if (!unsortable && !simple->isEmpty()) { in bridgeOp()
195 unsortable = current->checkSmall(min); in bridgeOp()
DSkPathOpsCommon.h21 bool* unsortable, bool* done, bool* onlyVertical, bool firstPass);
DSkOpSegment.h317 bool* unsortable, SkPathOp op, int xorMiMask, int xorSuMask);
319 bool* unsortable);
320 SkOpSegment* findNextXor(int* nextStart, int* nextEnd, bool* unsortable);
324 SkOpSegment* findTop(int* tIndex, int* endIndex, bool* unsortable, bool firstPass);
DSkPathOpsCommon.cpp231 int* endIndex, SkPoint* topLeft, bool* unsortable, bool* done, bool firstPass) { in findTopSegment() argument
263 result = topStart->findTop(index, endIndex, unsortable, firstPass); in findTopSegment()
320 int* endIndexPtr, SkPoint* topLeft, bool* unsortable, bool* done, bool* onlyVertical, in FindSortableTop() argument
322 SkOpSegment* current = findTopSegment(contourList, indexPtr, endIndexPtr, topLeft, unsortable, in FindSortableTop()
DSkOpSegment.cpp2752 bool* unsortable, SkPathOp op, const int xorMiMask, in findNextOp() argument
2781 *unsortable = true; in findNextOp()
2795 *unsortable = true; in findNextOp()
2801 *unsortable = true; in findNextOp()
2811 *unsortable = true; in findNextOp()
2833 *unsortable = true; in findNextOp()
2882 int* nextEnd, bool* unsortable) { in findNextWinding() argument
2910 *unsortable = true; in findNextWinding()
2924 *unsortable = true; in findNextWinding()
2947 *unsortable = true; in findNextWinding()
[all …]
/external/skia/src/pathops/
DSkPathOpsSimplify.cpp14 bool unsortable = false; in bridgeWinding() local
41 if (!unsortable && current->done()) { in bridgeWinding()
44 SkASSERT(unsortable || !current->done()); in bridgeWinding()
48 &unsortable); in bridgeWinding()
50 if (!unsortable && simple->hasMove() in bridgeWinding()
67 } while (!simple->isClosed() && (!unsortable in bridgeWinding()
108 bool unsortable = false; in bridgeXor() local
113 if (!unsortable && current->done()) { in bridgeXor()
117 SkASSERT(unsortable || !current->done()); in bridgeXor()
120 SkOpSegment* next = current->findNextXor(&nextStart, &nextEnd, &unsortable); in bridgeXor()
[all …]
DSkPathOpsOp.cpp124 bool unsortable = false; in bridgeOp() local
158 if (!unsortable && current->done()) { in bridgeOp()
161 SkASSERT(unsortable || !current->done()); in bridgeOp()
165 &unsortable, op, xorMask, xorOpMask); in bridgeOp()
167 if (!unsortable && simple->hasMove() in bridgeOp()
189 } while (!simple->isClosed() && (!unsortable in bridgeOp()
194 if (!unsortable && !simple->isEmpty()) { in bridgeOp()
195 unsortable = current->checkSmall(min); in bridgeOp()
DSkPathOpsCommon.h21 bool* unsortable, bool* done, bool* onlyVertical, bool firstPass);
DSkOpSegment.h315 bool* unsortable, SkPathOp op, int xorMiMask, int xorSuMask);
317 bool* unsortable);
318 SkOpSegment* findNextXor(int* nextStart, int* nextEnd, bool* unsortable);
322 SkOpSegment* findTop(int* tIndex, int* endIndex, bool* unsortable, bool firstPass);
DSkPathOpsCommon.cpp231 int* endIndex, SkPoint* topLeft, bool* unsortable, bool* done, bool firstPass) { in findTopSegment() argument
263 result = topStart->findTop(index, endIndex, unsortable, firstPass); in findTopSegment()
320 int* endIndexPtr, SkPoint* topLeft, bool* unsortable, bool* done, bool* onlyVertical, in FindSortableTop() argument
322 SkOpSegment* current = findTopSegment(contourList, indexPtr, endIndexPtr, topLeft, unsortable, in FindSortableTop()
DSkOpSegment.cpp2675 bool* unsortable, SkPathOp op, const int xorMiMask, in findNextOp() argument
2704 *unsortable = true; in findNextOp()
2718 *unsortable = true; in findNextOp()
2724 *unsortable = true; in findNextOp()
2734 *unsortable = true; in findNextOp()
2756 *unsortable = true; in findNextOp()
2805 int* nextEnd, bool* unsortable) { in findNextWinding() argument
2833 *unsortable = true; in findNextWinding()
2847 *unsortable = true; in findNextWinding()
2870 *unsortable = true; in findNextWinding()
[all …]
/external/chromium_org/third_party/skia/experimental/Intersection/
DShapeOps.cpp135 bool unsortable = false; in bridgeOp() local
157 if (!unsortable && current->done()) { in bridgeOp()
161 SkASSERT(unsortable || !current->done()); in bridgeOp()
165 unsortable, op, xorMask, xorOpMask); in bridgeOp()
167 if (!unsortable && simple.hasMove() in bridgeOp()
184 } while (!simple.isClosed() && ((!unsortable) in bridgeOp()
187 SkASSERT(unsortable); in bridgeOp()
DSimplifyFindNext_Test.cpp38 bool unsortable = false; in testCommon() local
40 nextStart, nextEnd, unsortable); in testCommon()
DSimplifyFindTop_Test.cpp36 bool done, unsortable = false; in testCommon() local
38 findSortableTop(contourList, index, end, bestXY, unsortable, done, true); in testCommon()
DSimplify.cpp966 bool unsortable() const { in unsortable() function in Angle
2403 bool& unsortable, ShapeOp op, const int xorMiMask, const int xorSuMask) { in findNextOp() argument
2451 unsortable = true; in findNextOp()
2486 unsortable = true; in findNextOp()
2525 bool& unsortable) { in findNextWinding() argument
2573 unsortable = true; in findNextWinding()
2603 unsortable = true; in findNextWinding()
2639 Segment* findNextXor(int& nextStart, int& nextEnd, bool& unsortable) { in findNextXor() argument
2699 unsortable = true; in findNextXor()
2728 unsortable = true; in findNextXor()
[all …]
DIntersections.h106 bool unsortable() const { in unsortable() function
/external/skia/experimental/Intersection/
DShapeOps.cpp135 bool unsortable = false; in bridgeOp() local
157 if (!unsortable && current->done()) { in bridgeOp()
161 SkASSERT(unsortable || !current->done()); in bridgeOp()
165 unsortable, op, xorMask, xorOpMask); in bridgeOp()
167 if (!unsortable && simple.hasMove() in bridgeOp()
184 } while (!simple.isClosed() && ((!unsortable) in bridgeOp()
187 SkASSERT(unsortable); in bridgeOp()
DSimplifyFindNext_Test.cpp38 bool unsortable = false; in testCommon() local
40 nextStart, nextEnd, unsortable); in testCommon()
DSimplifyFindTop_Test.cpp36 bool done, unsortable = false; in testCommon() local
38 findSortableTop(contourList, index, end, bestXY, unsortable, done, true); in testCommon()
DSimplify.cpp966 bool unsortable() const { in unsortable() function in Angle
2403 bool& unsortable, ShapeOp op, const int xorMiMask, const int xorSuMask) { in findNextOp() argument
2451 unsortable = true; in findNextOp()
2486 unsortable = true; in findNextOp()
2525 bool& unsortable) { in findNextWinding() argument
2573 unsortable = true; in findNextWinding()
2603 unsortable = true; in findNextWinding()
2639 Segment* findNextXor(int& nextStart, int& nextEnd, bool& unsortable) { in findNextXor() argument
2699 unsortable = true; in findNextXor()
2728 unsortable = true; in findNextXor()
[all …]
DIntersections.h106 bool unsortable() const { in unsortable() function