Home
last modified time | relevance | path

Searched refs:unorderable (Results 1 - 6 of 6) sorted by relevance

/third_party/skia/src/pathops/
H A DSkPathOpsCommon.cpp28 bool unorderable = false; in AngleWinding() local
35 unorderable |= angle->unorderable(); in AngleWinding()
36 if ((computeWinding = unorderable || (angle == firstAngle && loop))) { in AngleWinding()
37 break; // if we get here, there's no winding, loop is unorderable in AngleWinding()
43 // if the angle loop contains an unorderable span, the angle order may be useless in AngleWinding()
63 *sortablePtr = !unorderable; in AngleWinding()
H A DSkOpSegment.cpp413 // at this point, the span is already ordered, or unorderable
439 if (prior->unorderable() || angle->unorderable() || next->unorderable()) { in computeSum()
466 if (prior->unorderable() || angle->unorderable() || next->unorderable()) { in computeSum()
574 if (angle->unorderable()) { in findNextOp()
680 if (angle->unorderable()) { in findNextWinding()
769 if (!angle || angle->unorderable()) { in findNextXor()
[all...]
H A DSkOpAngle.h94 bool unorderable() const { in unorderable() function in SkOpAngle
117 int orderable(SkOpAngle* rh); // false == this < rh ; true == this > rh; -1 == unorderable
H A DSkOpAngle.cpp849 // it's likely that a pair of the angles are unorderable in merge()
913 goto unorderable; in orderable()
922 goto unorderable; in orderable()
929 goto unorderable; in orderable()
935 unorderable: in orderable()
H A DSkPathOpsDebug.cpp1333 if (next->unorderable()) { in debugValidate()
/third_party/skia/tests/
H A DPathOpsDebug.cpp568 if (unorderable()) { in dumpOne()
569 SkDebugf(" unorderable"); in dumpOne()

Completed in 13 milliseconds