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

/external/chromium_org/third_party/skia/src/pathops/
H A DSkPathOpsSimplify.cpp14 bool unsortable = false; local
41 if (!unsortable && current->done()) {
44 SkASSERT(unsortable || !current->done());
48 &unsortable);
50 if (!unsortable && simple->hasMove()
67 } while (!simple->isClosed() && (!unsortable
70 // SkASSERT(unsortable || simple->isEmpty());
108 bool unsortable = false; local
113 if (!unsortable && current->done()) {
117 SkASSERT(unsortable || !curren
[all...]
H A DSkPathOpsCommon.h21 bool* unsortable, bool* done, bool* onlyVertical, bool firstPass);
H A DSkPathOpsOp.cpp124 bool unsortable = false; local
158 if (!unsortable && current->done()) {
161 SkASSERT(unsortable || !current->done());
165 &unsortable, op, xorMask, xorOpMask);
167 if (!unsortable && simple->hasMove()
189 } while (!simple->isClosed() && (!unsortable
194 if (!unsortable && !simple->isEmpty()) {
195 unsortable = current->checkSmall(min);
H A DSkOpSegment.h317 bool* unsortable, SkPathOp op, int xorMiMask, int xorSuMask);
319 bool* unsortable);
320 SkOpSegment* findNextXor(int* nextStart, int* nextEnd, bool* unsortable);
324 SkOpSegment* findTop(int* tIndex, int* endIndex, bool* unsortable, bool firstPass);
H A DSkPathOpsCommon.cpp231 int* endIndex, SkPoint* topLeft, bool* unsortable, bool* done, bool firstPass) {
263 result = topStart->findTop(index, endIndex, unsortable, firstPass);
320 int* endIndexPtr, SkPoint* topLeft, bool* unsortable, bool* done, bool* onlyVertical,
322 SkOpSegment* current = findTopSegment(contourList, indexPtr, endIndexPtr, topLeft, unsortable,
353 // the simple upward projection of the unresolved points hit unsortable angles
230 findTopSegment(const SkTArray<SkOpContour*, true>& contourList, int* index, int* endIndex, SkPoint* topLeft, bool* unsortable, bool* done, bool firstPass) argument
318 FindSortableTop(const SkTArray<SkOpContour*, true>& contourList, SkOpAngle::IncludeType angleIncludeType, bool* firstContour, int* indexPtr, int* endIndexPtr, SkPoint* topLeft, bool* unsortable, bool* done, bool* onlyVertical, bool firstPass) argument
H A DSkOpSegment.cpp2752 bool* unsortable, SkPathOp op, const int xorMiMask,
2781 *unsortable = true;
2795 *unsortable = true;
2801 *unsortable = true;
2811 *unsortable = true;
2833 *unsortable = true;
2882 int* nextEnd, bool* unsortable) {
2910 *unsortable = true;
2924 *unsortable = true;
2947 *unsortable
[all...]
/external/skia/src/pathops/
H A DSkPathOpsSimplify.cpp14 bool unsortable = false; local
41 if (!unsortable && current->done()) {
44 SkASSERT(unsortable || !current->done());
48 &unsortable);
50 if (!unsortable && simple->hasMove()
67 } while (!simple->isClosed() && (!unsortable
70 // SkASSERT(unsortable || simple->isEmpty());
108 bool unsortable = false; local
113 if (!unsortable && current->done()) {
117 SkASSERT(unsortable || !curren
[all...]
H A DSkPathOpsCommon.h21 bool* unsortable, bool* done, bool* onlyVertical, bool firstPass);
H A DSkPathOpsOp.cpp124 bool unsortable = false; local
158 if (!unsortable && current->done()) {
161 SkASSERT(unsortable || !current->done());
165 &unsortable, op, xorMask, xorOpMask);
167 if (!unsortable && simple->hasMove()
189 } while (!simple->isClosed() && (!unsortable
194 if (!unsortable && !simple->isEmpty()) {
195 unsortable = current->checkSmall(min);
H A DSkOpSegment.h315 bool* unsortable, SkPathOp op, int xorMiMask, int xorSuMask);
317 bool* unsortable);
318 SkOpSegment* findNextXor(int* nextStart, int* nextEnd, bool* unsortable);
322 SkOpSegment* findTop(int* tIndex, int* endIndex, bool* unsortable, bool firstPass);
H A DSkPathOpsCommon.cpp231 int* endIndex, SkPoint* topLeft, bool* unsortable, bool* done, bool firstPass) {
263 result = topStart->findTop(index, endIndex, unsortable, firstPass);
320 int* endIndexPtr, SkPoint* topLeft, bool* unsortable, bool* done, bool* onlyVertical,
322 SkOpSegment* current = findTopSegment(contourList, indexPtr, endIndexPtr, topLeft, unsortable,
353 // the simple upward projection of the unresolved points hit unsortable angles
230 findTopSegment(const SkTArray<SkOpContour*, true>& contourList, int* index, int* endIndex, SkPoint* topLeft, bool* unsortable, bool* done, bool firstPass) argument
318 FindSortableTop(const SkTArray<SkOpContour*, true>& contourList, SkOpAngle::IncludeType angleIncludeType, bool* firstContour, int* indexPtr, int* endIndexPtr, SkPoint* topLeft, bool* unsortable, bool* done, bool* onlyVertical, bool firstPass) argument
H A DSkOpSegment.cpp2675 bool* unsortable, SkPathOp op, const int xorMiMask,
2704 *unsortable = true;
2718 *unsortable = true;
2724 *unsortable = true;
2734 *unsortable = true;
2756 *unsortable = true;
2805 int* nextEnd, bool* unsortable) {
2833 *unsortable = true;
2847 *unsortable = true;
2870 *unsortable
[all...]
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DShapeOps.cpp135 bool unsortable = false; local
157 if (!unsortable && current->done()) {
161 SkASSERT(unsortable || !current->done());
165 unsortable, op, xorMask, xorOpMask);
167 if (!unsortable && simple.hasMove()
184 } while (!simple.isClosed() && ((!unsortable)
187 SkASSERT(unsortable);
H A DSimplifyFindNext_Test.cpp38 bool unsortable = false; local
40 nextStart, nextEnd, unsortable);
H A DIntersections.h106 bool unsortable() const { function in class:Intersections
H A DSimplifyFindTop_Test.cpp36 bool done, unsortable = false; local
38 findSortableTop(contourList, index, end, bestXY, unsortable, done, true);
H A DSimplify.cpp666 bool fUnsortableStart; // set when start is part of an unsortable pair
667 bool fUnsortableEnd; // set when end is part of an unsortable pair
745 // See general unsortable comment below. This case can happen when
783 // is to mark the edges as unsortable, exclude them from this and
926 SkDebugf("%s unsortable [%d] (%1.9g,%1.9g) [%d] (%1.9g,%1.9g)\n", __FUNCTION__,
943 SkDebugf("%s all tiny unsortable [%d] (%1.9g,%1.9g) [%d] (%1.9g,%1.9g)\n", __FUNCTION__,
966 bool unsortable() const { function
2403 bool& unsortable, ShapeOp op, const int xorMiMask, const int xorSuMask) {
2451 unsortable = true;
2486 unsortable
[all...]
/external/skia/experimental/Intersection/
H A DShapeOps.cpp135 bool unsortable = false; local
157 if (!unsortable && current->done()) {
161 SkASSERT(unsortable || !current->done());
165 unsortable, op, xorMask, xorOpMask);
167 if (!unsortable && simple.hasMove()
184 } while (!simple.isClosed() && ((!unsortable)
187 SkASSERT(unsortable);
H A DSimplifyFindNext_Test.cpp38 bool unsortable = false; local
40 nextStart, nextEnd, unsortable);
H A DIntersections.h106 bool unsortable() const { function in class:Intersections
H A DSimplifyFindTop_Test.cpp36 bool done, unsortable = false; local
38 findSortableTop(contourList, index, end, bestXY, unsortable, done, true);
H A DSimplify.cpp666 bool fUnsortableStart; // set when start is part of an unsortable pair
667 bool fUnsortableEnd; // set when end is part of an unsortable pair
745 // See general unsortable comment below. This case can happen when
783 // is to mark the edges as unsortable, exclude them from this and
926 SkDebugf("%s unsortable [%d] (%1.9g,%1.9g) [%d] (%1.9g,%1.9g)\n", __FUNCTION__,
943 SkDebugf("%s all tiny unsortable [%d] (%1.9g,%1.9g) [%d] (%1.9g,%1.9g)\n", __FUNCTION__,
966 bool unsortable() const { function
2403 bool& unsortable, ShapeOp op, const int xorMiMask, const int xorSuMask) {
2451 unsortable = true;
2486 unsortable
[all...]

Completed in 253 milliseconds