Home
last modified time | relevance | path

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

/third_party/skia/src/pathops/
DSkPathOpsSimplify.cpp14 bool unsortable = false; in bridgeWinding() local
27 if (!unsortable && current->done()) { in bridgeWinding()
30 SkASSERT(unsortable || !current->done()); in bridgeWinding()
34 &unsortable); in bridgeWinding()
49 } while (!writer->isClosed() && (!unsortable || !start->starter(end)->done())); in bridgeWinding()
90 bool unsortable = false; in bridgeXor() local
104 if (!unsortable && current->done()) { in bridgeXor()
107 SkASSERT(unsortable || !current->done()); in bridgeXor()
111 &unsortable); in bridgeXor()
126 } while (!writer->isClosed() && (!unsortable || !start->starter(end)->done())); in bridgeXor()
DSkPathOpsOp.cpp111 bool unsortable = false; in bridgeOp() local
126 if (!unsortable && current->done()) { in bridgeOp()
129 SkASSERT(unsortable || !current->done()); in bridgeOp()
134 &unsortable, &simple, op, xorMask, xorOpMask); in bridgeOp()
136 if (!unsortable && writer->hasMove() in bridgeOp()
163 } while (!writer->isClosed() && (!unsortable || !start->starter(end)->done())); in bridgeOp()
DSkOpSegment.h215 SkOpSpanBase** nextEnd, bool* unsortable, bool* simple,
218 SkOpSpanBase** nextEnd, bool* unsortable);
219 SkOpSegment* findNextXor(SkOpSpanBase** nextStart, SkOpSpanBase** nextEnd, bool* unsortable);
DSkOpSegment.cpp539 SkOpSpanBase** nextEnd, bool* unsortable, bool* simple, in findNextOp() argument
569 *unsortable = true; in findNextOp()
575 *unsortable = true; in findNextOp()
585 *unsortable = true; in findNextOp()
646 SkOpSpanBase** nextStart, SkOpSpanBase** nextEnd, bool* unsortable) { in findNextWinding() argument
675 *unsortable = true; in findNextWinding()
681 *unsortable = true; in findNextWinding()
742 bool* unsortable) { in findNextXor() argument
770 *unsortable = true; in findNextXor()
/third_party/flutter/skia/src/pathops/
DSkPathOpsSimplify.cpp14 bool unsortable = false; in bridgeWinding() local
27 if (!unsortable && current->done()) { in bridgeWinding()
30 SkASSERT(unsortable || !current->done()); in bridgeWinding()
34 &unsortable); in bridgeWinding()
49 } while (!writer->isClosed() && (!unsortable || !start->starter(end)->done())); in bridgeWinding()
90 bool unsortable = false; in bridgeXor() local
104 if (!unsortable && current->done()) { in bridgeXor()
107 SkASSERT(unsortable || !current->done()); in bridgeXor()
111 &unsortable); in bridgeXor()
126 } while (!writer->isClosed() && (!unsortable || !start->starter(end)->done())); in bridgeXor()
DSkPathOpsOp.cpp111 bool unsortable = false; in bridgeOp() local
126 if (!unsortable && current->done()) { in bridgeOp()
129 SkASSERT(unsortable || !current->done()); in bridgeOp()
134 &unsortable, &simple, op, xorMask, xorOpMask); in bridgeOp()
136 if (!unsortable && writer->hasMove() in bridgeOp()
163 } while (!writer->isClosed() && (!unsortable || !start->starter(end)->done())); in bridgeOp()
DSkOpSegment.h215 SkOpSpanBase** nextEnd, bool* unsortable, bool* simple,
218 SkOpSpanBase** nextEnd, bool* unsortable);
219 SkOpSegment* findNextXor(SkOpSpanBase** nextStart, SkOpSpanBase** nextEnd, bool* unsortable);
DSkOpSegment.cpp539 SkOpSpanBase** nextEnd, bool* unsortable, bool* simple, in findNextOp() argument
569 *unsortable = true; in findNextOp()
575 *unsortable = true; in findNextOp()
585 *unsortable = true; in findNextOp()
646 SkOpSpanBase** nextStart, SkOpSpanBase** nextEnd, bool* unsortable) { in findNextWinding() argument
675 *unsortable = true; in findNextWinding()
681 *unsortable = true; in findNextWinding()
742 bool* unsortable) { in findNextXor() argument
770 *unsortable = true; in findNextXor()
/third_party/python/Misc/
DHISTORY5479 produced unsortable objects. (Regression was introduced by fix for 9750).