Home
last modified time | relevance | path

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

/external/skia/src/pathops/
DSkPathOpsSimplify.cpp15 bool unsortable = false; in bridgeWinding() local
28 if (!unsortable && current->done()) { in bridgeWinding()
31 SkASSERT(unsortable || !current->done()); in bridgeWinding()
35 &unsortable); in bridgeWinding()
37 if (!unsortable && simple->hasMove() in bridgeWinding()
62 } while (!simple->isClosed() && (!unsortable || !start->starter(end)->done())); in bridgeWinding()
107 bool unsortable = false; in bridgeXor() local
112 if (!unsortable && current->done()) { in bridgeXor()
116 SkASSERT(unsortable || !current->done()); in bridgeXor()
119 SkOpSegment* next = current->findNextXor(&nextStart, &nextEnd, &unsortable); in bridgeXor()
[all …]
DSkPathOpsOp.cpp89 bool unsortable = false; in bridgeOp() local
102 if (!unsortable && current->done()) { in bridgeOp()
105 SkASSERT(unsortable || !current->done()); in bridgeOp()
109 &unsortable, op, xorMask, xorOpMask); in bridgeOp()
111 if (!unsortable && simple->hasMove() in bridgeOp()
136 } while (!simple->isClosed() && (!unsortable || !start->starter(end)->done())); in bridgeOp()
DSkOpSegment.h205 SkOpSpanBase** nextEnd, bool* unsortable, SkPathOp op,
208 SkOpSpanBase** nextEnd, bool* unsortable);
209 SkOpSegment* findNextXor(SkOpSpanBase** nextStart, SkOpSpanBase** nextEnd, bool* unsortable);
DSkOpSegment.cpp621 SkOpSpanBase** nextEnd, bool* unsortable, SkPathOp op, int xorMiMask, int xorSuMask) { in findNextOp() argument
650 *unsortable = true; in findNextOp()
656 *unsortable = true; in findNextOp()
666 *unsortable = true; in findNextOp()
726 SkOpSpanBase** nextStart, SkOpSpanBase** nextEnd, bool* unsortable) { in findNextWinding() argument
755 *unsortable = true; in findNextWinding()
761 *unsortable = true; in findNextWinding()
822 bool* unsortable) { in findNextXor() argument
850 *unsortable = true; in findNextXor()