null

Home

Sort by

Searched refs:unsortable (Results 1 - 8 of 8) sorted by relevance

/external/skia/src/pathops/
H A D	SkPathOpsSimplify.cpp	`14 bool unsortable = false; local 27 if (!unsortable && current->done()) { 30 SkASSERT(unsortable \|\| !current->done()); 34 &unsortable); 49 } while (!simple->isClosed() && (!unsortable \|\| !start->starter(end)->done())); 87 bool unsortable = false; local 97 if (!unsortable && current->done()) { 100 SkASSERT(unsortable \|\| !current->done()); 104 &unsortable); 119 } while (!simple->isClosed() && (!unsortable \|\| !star [all...]`
H A D	SkPathOpsOp.cpp	`100 bool unsortable = false; local 113 if (!unsortable && current->done()) { 116 SkASSERT(unsortable \|\| !current->done()); 120 &unsortable, op, xorMask, xorOpMask); 122 if (!unsortable && simple->hasMove() 145 } while (!simple->isClosed() && (!unsortable \|\| !start->starter(end)->done()));`
H A D	SkOpSegment.cpp	521 SkOpSpanBase** nextEnd, bool* unsortable, SkPathOp op, int xorMiMask, int xorSuMask) { 550 unsortable = true; 556 unsortable = true; 566 unsortable = true; 626 SkOpSpanBase* nextStart, SkOpSpanBase** nextEnd, bool* unsortable) { 655 unsortable = true; 661 unsortable = true; 722 bool* unsortable) { 750 unsortable = true; 520 findNextOp(SkTDArray<SkOpSpanBase>* chase, SkOpSpanBase nextStart, SkOpSpanBase nextEnd, bool* unsortable, SkPathOp op, int xorMiMask, int xorSuMask) argument 625 findNextWinding(SkTDArray<SkOpSpanBase> chase, SkOpSpanBase nextStart, SkOpSpanBase nextEnd, bool* unsortable) argument 721 findNextXor(SkOpSpanBase nextStart, SkOpSpanBase nextEnd, bool* unsortable) argument
H A D	SkOpSegment.h	`215 SkOpSpanBase** nextEnd, bool* unsortable, SkPathOp op, 218 SkOpSpanBase** nextEnd, bool* unsortable); 219 SkOpSegment* findNextXor(SkOpSpanBase nextStart, SkOpSpanBase nextEnd, bool* unsortable);`
/external/skqp/src/pathops/
H A D	SkPathOpsSimplify.cpp	`14 bool unsortable = false; local 27 if (!unsortable && current->done()) { 30 SkASSERT(unsortable \|\| !current->done()); 34 &unsortable); 49 } while (!simple->isClosed() && (!unsortable \|\| !start->starter(end)->done())); 87 bool unsortable = false; local 97 if (!unsortable && current->done()) { 100 SkASSERT(unsortable \|\| !current->done()); 104 &unsortable); 119 } while (!simple->isClosed() && (!unsortable \|\| !star [all...]`
H A D	SkPathOpsOp.cpp	`100 bool unsortable = false; local 113 if (!unsortable && current->done()) { 116 SkASSERT(unsortable \|\| !current->done()); 120 &unsortable, op, xorMask, xorOpMask); 122 if (!unsortable && simple->hasMove() 145 } while (!simple->isClosed() && (!unsortable \|\| !start->starter(end)->done()));`
H A D	SkOpSegment.cpp	521 SkOpSpanBase** nextEnd, bool* unsortable, SkPathOp op, int xorMiMask, int xorSuMask) { 550 unsortable = true; 556 unsortable = true; 566 unsortable = true; 626 SkOpSpanBase* nextStart, SkOpSpanBase** nextEnd, bool* unsortable) { 655 unsortable = true; 661 unsortable = true; 722 bool* unsortable) { 750 unsortable = true; 520 findNextOp(SkTDArray<SkOpSpanBase>* chase, SkOpSpanBase nextStart, SkOpSpanBase nextEnd, bool* unsortable, SkPathOp op, int xorMiMask, int xorSuMask) argument 625 findNextWinding(SkTDArray<SkOpSpanBase> chase, SkOpSpanBase nextStart, SkOpSpanBase nextEnd, bool* unsortable) argument 721 findNextXor(SkOpSpanBase nextStart, SkOpSpanBase nextEnd, bool* unsortable) argument
H A D	SkOpSegment.h	`215 SkOpSpanBase** nextEnd, bool* unsortable, SkPathOp op, 218 SkOpSpanBase** nextEnd, bool* unsortable); 219 SkOpSegment* findNextXor(SkOpSpanBase nextStart, SkOpSpanBase nextEnd, bool* unsortable);`

Completed in 583 milliseconds