| /external/chromium_org/third_party/skia/src/pathops/ |
| SkPathOpsSimplify.cpp | 14 bool unsortable = false; local
35 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());
100 bool unsortable = false; local
105 if (!unsortable && current->done()) {
109 SkASSERT(unsortable || !current->done())
[all...] |
| SkPathOpsCommon.h | 21 bool* unsortable, bool* done);
|
| SkPathOpsOp.cpp | 141 bool unsortable = false; local
162 if (!unsortable && current->done()) {
171 SkASSERT(unsortable || !current->done());
175 &unsortable, op, xorMask, xorOpMask);
177 if (!unsortable && simple->hasMove()
194 } while (!simple->isClosed() && (!unsortable
199 if (!unsortable && !simple->isEmpty()) {
200 unsortable = current->checkSmall(min);
202 SkASSERT(unsortable || simple->isEmpty());
|
| SkOpAngle.h | 73 bool unsortable() const { function in class:SkOpAngle
|
| SkOpSegment.h | 194 bool unsortable(int index) const {
260 bool* unsortable, SkPathOp op, const int xorMiMask,
263 bool* unsortable);
264 SkOpSegment* findNextXor(int* nextStart, int* nextEnd, bool* unsortable);
266 SkOpSegment* findTop(int* tIndex, int* endIndex, bool* unsortable, bool onlySortable);
|
| SkOpSegment.cpp | [all...] |
| SkPathOpsCommon.cpp | 221 int* index, int* endIndex, SkPoint* topLeft, bool* unsortable,
252 result = topStart->findTop(index, endIndex, unsortable, onlySortable);
255 *unsortable = false;
297 int* endIndexPtr, SkPoint* topLeft, bool* unsortable, bool* done) {
298 SkOpSegment* current = findSortableTop(contourList, indexPtr, endIndexPtr, topLeft, unsortable,
324 // the simple upward projection of the unresolved points hit unsortable angles
|
| /external/skia/src/pathops/ |
| SkPathOpsSimplify.cpp | 14 bool unsortable = false; local
35 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());
100 bool unsortable = false; local
105 if (!unsortable && current->done()) {
109 SkASSERT(unsortable || !current->done())
[all...] |
| SkPathOpsCommon.h | 21 bool* unsortable, bool* done);
|
| SkPathOpsOp.cpp | 141 bool unsortable = false; local
162 if (!unsortable && current->done()) {
171 SkASSERT(unsortable || !current->done());
175 &unsortable, op, xorMask, xorOpMask);
177 if (!unsortable && simple->hasMove()
194 } while (!simple->isClosed() && (!unsortable
199 if (!unsortable && !simple->isEmpty()) {
200 unsortable = current->checkSmall(min);
202 SkASSERT(unsortable || simple->isEmpty());
|
| SkOpAngle.h | 73 bool unsortable() const { function in class:SkOpAngle
|
| SkOpSegment.h | 194 bool unsortable(int index) const {
260 bool* unsortable, SkPathOp op, const int xorMiMask,
263 bool* unsortable);
264 SkOpSegment* findNextXor(int* nextStart, int* nextEnd, bool* unsortable);
266 SkOpSegment* findTop(int* tIndex, int* endIndex, bool* unsortable, bool onlySortable);
|
| SkOpSegment.cpp | [all...] |
| SkPathOpsCommon.cpp | 221 int* index, int* endIndex, SkPoint* topLeft, bool* unsortable,
252 result = topStart->findTop(index, endIndex, unsortable, onlySortable);
255 *unsortable = false;
297 int* endIndexPtr, SkPoint* topLeft, bool* unsortable, bool* done) {
298 SkOpSegment* current = findSortableTop(contourList, indexPtr, endIndexPtr, topLeft, unsortable,
324 // the simple upward projection of the unresolved points hit unsortable angles
|
| /external/skia/tests/ |
| PathOpsAngleTest.cpp | 316 bool unsortable = false; local
329 if (angle->unsortable()) {
331 SkDebugf("%s test[%s]: angle[%d] unsortable\n", __FUNCTION__, test.name, idx);
333 unsortable = true;
343 if (unsortable || unorderable) {
|
