/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkAddIntersections.cpp | 416 void CoincidenceCheck(SkTArray<SkOpContour*, true>* contourList, int total) { argument 417 int contourCount = (*contourList).count(); 419 SkOpContour* contour = (*contourList)[cIndex]; 423 SkOpContour* contour = (*contourList)[cIndex]; 427 SkOpContour* contour = (*contourList)[cIndex];
|
H A D | SkPathOpsSimplify.cpp | 12 static bool bridgeWinding(SkTArray<SkOpContour*, true>& contourList, SkPathWriter* simple) { argument 20 SkOpSegment* current = FindSortableTop(contourList, &firstContour, &index, &endIndex, 37 DebugShowActiveSpans(contourList); 86 DebugShowActiveSpans(contourList); 97 static bool bridgeXor(SkTArray<SkOpContour*, true>& contourList, SkPathWriter* simple) { argument 102 while ((current = FindUndone(contourList, &start, &end))) { 106 DebugShowActiveSpans(contourList); 143 DebugShowActiveSpans(contourList); 164 SkTArray<SkOpContour*, true> contourList; local 165 MakeContourList(contours, contourList, fals [all...] |
H A D | SkOpContour.cpp | 232 static void SkOpContour::debugShowWindingValues(const SkTArray<SkOpContour*, true>& contourList) { argument 238 for (index = 0; index < contourList.count(); ++index) { 239 total += contourList[index]->segments().count(); 242 for (index = 0; index < contourList.count(); ++index) { 243 sum += contourList[index]->debugShowWindingValues(total, ofInterest);
|
H A D | SkPathOpsOp.cpp | 129 static bool bridgeOp(SkTArray<SkOpContour*, true>& contourList, const SkPathOp op, argument 138 SkOpSegment* current = FindSortableTop(contourList, &firstContour, &index, &endIndex, 155 DebugShowActiveSpans(contourList); 204 DebugShowActiveSpans(contourList); 267 SkTArray<SkOpContour*, true> contourList; local 268 MakeContourList(contours, contourList, xorMask == kEvenOdd_PathOpsMask, 270 SkOpContour** currentPtr = contourList.begin(); 274 SkOpContour** listEnd = contourList.end(); 291 for (index = 0; index < contourList.count(); ++index) { 292 total += contourList[inde [all...] |
H A D | SkPathOpsCommon.cpp | 12 static int contourRangeCheckY(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** currentPtr, argument 21 int contourCount = contourList.count(); 28 SkOpContour* contour = contourList[cTest]; 100 SkOpSegment* FindUndone(SkTArray<SkOpContour*, true>& contourList, int* start, int* end) { argument 101 int contourCount = contourList.count(); 104 SkOpContour* contour = contourList[cIndex]; 211 void DebugShowActiveSpans(SkTArray<SkOpContour*, true>& contourList) { argument 213 for (index = 0; index < contourList.count(); ++ index) { 214 contourList[index]->debugShowActiveSpans(); 219 static SkOpSegment* findSortableTop(const SkTArray<SkOpContour*, true>& contourList, argument 256 rightAngleWinding(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** current, int* index, int* endIndex, double* tHit, SkScalar* hitDx, bool* tryAgain, bool opp) argument 273 skipVertical(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** current, int* index, int* endIndex) argument 291 FindSortableTop(const SkTArray<SkOpContour*, true>& contourList, bool* firstContour, int* indexPtr, int* endIndexPtr, SkPoint* topLeft, bool* unsortable, bool* done, bool binary) argument 347 CheckEnds(SkTArray<SkOpContour*, true>* contourList) argument 357 FixOtherTIndex(SkTArray<SkOpContour*, true>* contourList) argument 365 SortSegments(SkTArray<SkOpContour*, true>* contourList) argument [all...] |
/external/skia/src/pathops/ |
H A D | SkAddIntersections.cpp | 416 void CoincidenceCheck(SkTArray<SkOpContour*, true>* contourList, int total) { argument 417 int contourCount = (*contourList).count(); 419 SkOpContour* contour = (*contourList)[cIndex]; 423 SkOpContour* contour = (*contourList)[cIndex]; 427 SkOpContour* contour = (*contourList)[cIndex];
|
H A D | SkPathOpsSimplify.cpp | 12 static bool bridgeWinding(SkTArray<SkOpContour*, true>& contourList, SkPathWriter* simple) { argument 20 SkOpSegment* current = FindSortableTop(contourList, &firstContour, &index, &endIndex, 37 DebugShowActiveSpans(contourList); 86 DebugShowActiveSpans(contourList); 97 static bool bridgeXor(SkTArray<SkOpContour*, true>& contourList, SkPathWriter* simple) { argument 102 while ((current = FindUndone(contourList, &start, &end))) { 106 DebugShowActiveSpans(contourList); 143 DebugShowActiveSpans(contourList); 164 SkTArray<SkOpContour*, true> contourList; local 165 MakeContourList(contours, contourList, fals [all...] |
H A D | SkOpContour.cpp | 232 static void SkOpContour::debugShowWindingValues(const SkTArray<SkOpContour*, true>& contourList) { argument 238 for (index = 0; index < contourList.count(); ++index) { 239 total += contourList[index]->segments().count(); 242 for (index = 0; index < contourList.count(); ++index) { 243 sum += contourList[index]->debugShowWindingValues(total, ofInterest);
|
H A D | SkPathOpsOp.cpp | 129 static bool bridgeOp(SkTArray<SkOpContour*, true>& contourList, const SkPathOp op, argument 138 SkOpSegment* current = FindSortableTop(contourList, &firstContour, &index, &endIndex, 155 DebugShowActiveSpans(contourList); 204 DebugShowActiveSpans(contourList); 267 SkTArray<SkOpContour*, true> contourList; local 268 MakeContourList(contours, contourList, xorMask == kEvenOdd_PathOpsMask, 270 SkOpContour** currentPtr = contourList.begin(); 274 SkOpContour** listEnd = contourList.end(); 291 for (index = 0; index < contourList.count(); ++index) { 292 total += contourList[inde [all...] |
H A D | SkPathOpsCommon.cpp | 12 static int contourRangeCheckY(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** currentPtr, argument 21 int contourCount = contourList.count(); 28 SkOpContour* contour = contourList[cTest]; 100 SkOpSegment* FindUndone(SkTArray<SkOpContour*, true>& contourList, int* start, int* end) { argument 101 int contourCount = contourList.count(); 104 SkOpContour* contour = contourList[cIndex]; 211 void DebugShowActiveSpans(SkTArray<SkOpContour*, true>& contourList) { argument 213 for (index = 0; index < contourList.count(); ++ index) { 214 contourList[index]->debugShowActiveSpans(); 219 static SkOpSegment* findSortableTop(const SkTArray<SkOpContour*, true>& contourList, argument 256 rightAngleWinding(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** current, int* index, int* endIndex, double* tHit, SkScalar* hitDx, bool* tryAgain, bool opp) argument 273 skipVertical(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** current, int* index, int* endIndex) argument 291 FindSortableTop(const SkTArray<SkOpContour*, true>& contourList, bool* firstContour, int* indexPtr, int* endIndexPtr, SkPoint* topLeft, bool* unsortable, bool* done, bool binary) argument 347 CheckEnds(SkTArray<SkOpContour*, true>* contourList) argument 357 FixOtherTIndex(SkTArray<SkOpContour*, true>* contourList) argument 365 SortSegments(SkTArray<SkOpContour*, true>* contourList) argument [all...] |