Lines Matching refs:unsortable
924 // abort early before sorting if an unsortable (not an unorderable) angle is found
1485 bool* unsortable, SkPathOp op, const int xorMiMask,
1517 *unsortable = true;
1531 *unsortable = true;
1541 *unsortable = true;
1576 *unsortable = true;
1617 int* nextEnd, bool* unsortable) {
1648 *unsortable = true;
1667 *unsortable = true;
1697 *unsortable = true;
1737 SkOpSegment* SkOpSegment::findNextXor(int* nextStart, int* nextEnd, bool* unsortable) {
1795 *unsortable = true;
1819 *unsortable = true;
1870 // a) mark spans with either end unsortable as done, or
1872 // when encountering an unsortable span
1877 SkOpSegment* SkOpSegment::findTop(int* tIndexPtr, int* endIndexPtr, bool* unsortable,
1885 *unsortable = true;
1909 // *unsortable = true;
1915 *unsortable = true;
1946 SkASSERT(!onlySortable || !angle->unsortable());
2431 // note that just because a span has one end that is unsortable, that's
2434 // FIXME: if abs(start - end) > 1, mark intermediates as unsortable on both ends
2640 unsortable so that this info is available for early
2642 // adjacent spans that unsortable. However, this makes it difficult to later
2656 sortable &= !(angle.unsortable() || (orderKind == kMustBeOrdered_SortAngleKind
2662 if (angles[angleIndex].unsortable() || (orderKind == kMustBeOrdered_SortAngleKind
2678 // set segments to unsortable if angle is unsortable, but do not set all angles
2681 // perhaps some classes of unsortable angles should make all shared angles unsortable, but
2683 // OPTIMIZATION: check earlier when angles are added to input if any are unsortable
2692 if (angle.unsortable()) {
3168 angle.unsortable() ? "*** UNSORTABLE *** " : "");
