/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkAddIntersections.cpp | 436 void CoincidenceCheck(SkTArray<SkOpContour*, true>* contourList, int total) { argument 437 int contourCount = (*contourList).count(); 439 SkOpContour* contour = (*contourList)[cIndex]; 443 SkOpContour* contour = (*contourList)[cIndex]; 447 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, SkOpAngle::kUnaryWinding, &firstContour, 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 | SkPathOpsOp.cpp | 138 static bool bridgeOp(SkTArray<SkOpContour*, true>& contourList, const SkPathOp op, argument 147 SkOpSegment* current = FindSortableTop(contourList, SkOpAngle::kBinarySingle, &firstContour, 164 DebugShowActiveSpans(contourList); 217 DebugShowActiveSpans(contourList); 280 SkTArray<SkOpContour*, true> contourList; local 281 MakeContourList(contours, contourList, xorMask == kEvenOdd_PathOpsMask, 283 SkOpContour** currentPtr = contourList.begin(); 287 SkOpContour** listEnd = contourList.end(); 304 for (index = 0; index < contourList.count(); ++index) { 305 total += contourList[inde [all...] |
H A D | SkOpContour.cpp | 359 void SkOpContour::debugShowWindingValues(const SkTArray<SkOpContour*, true>& contourList) { argument 365 for (index = 0; index < contourList.count(); ++index) { 366 total += contourList[index]->segments().count(); 369 for (index = 0; index < contourList.count(); ++index) { 370 sum += contourList[index]->debugShowWindingValues(total, ofInterest);
|
H A D | SkPathOpsCommon.cpp | 13 static int contourRangeCheckY(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** currentPtr, argument 22 int contourCount = contourList.count(); 29 SkOpContour* contour = contourList[cTest]; 101 SkOpSegment* FindUndone(SkTArray<SkOpContour*, true>& contourList, int* start, int* end) { argument 102 int contourCount = contourList.count(); 105 SkOpContour* contour = contourList[cIndex]; 212 void DebugShowActiveSpans(SkTArray<SkOpContour*, true>& contourList) { argument 214 for (index = 0; index < contourList.count(); ++ index) { 215 contourList[index]->debugShowActiveSpans(); 220 static SkOpSegment* findSortableTop(const SkTArray<SkOpContour*, true>& contourList, argument 260 rightAngleWinding(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** current, int* index, int* endIndex, double* tHit, SkScalar* hitDx, bool* tryAgain, bool opp) argument 277 skipVertical(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** current, int* index, int* endIndex) argument 295 FindSortableTop(const SkTArray<SkOpContour*, true>& contourList, SkOpAngle::IncludeType angleIncludeType, bool* firstContour, int* indexPtr, int* endIndexPtr, SkPoint* topLeft, bool* unsortable, bool* done) argument 354 checkEnds(SkTArray<SkOpContour*, true>* contourList) argument 365 checkTiny(SkTArray<SkOpContour*, true>* contourList) argument 373 fixOtherTIndex(SkTArray<SkOpContour*, true>* contourList) argument 381 joinCoincidence(SkTArray<SkOpContour*, true>* contourList) argument 389 sortSegments(SkTArray<SkOpContour*, true>* contourList) argument [all...] |
/external/skia/src/pathops/ |
H A D | SkAddIntersections.cpp | 436 void CoincidenceCheck(SkTArray<SkOpContour*, true>* contourList, int total) { argument 437 int contourCount = (*contourList).count(); 439 SkOpContour* contour = (*contourList)[cIndex]; 443 SkOpContour* contour = (*contourList)[cIndex]; 447 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, SkOpAngle::kUnaryWinding, &firstContour, 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 | SkPathOpsOp.cpp | 138 static bool bridgeOp(SkTArray<SkOpContour*, true>& contourList, const SkPathOp op, argument 147 SkOpSegment* current = FindSortableTop(contourList, SkOpAngle::kBinarySingle, &firstContour, 164 DebugShowActiveSpans(contourList); 217 DebugShowActiveSpans(contourList); 280 SkTArray<SkOpContour*, true> contourList; local 281 MakeContourList(contours, contourList, xorMask == kEvenOdd_PathOpsMask, 283 SkOpContour** currentPtr = contourList.begin(); 287 SkOpContour** listEnd = contourList.end(); 304 for (index = 0; index < contourList.count(); ++index) { 305 total += contourList[inde [all...] |
H A D | SkOpContour.cpp | 359 void SkOpContour::debugShowWindingValues(const SkTArray<SkOpContour*, true>& contourList) { argument 365 for (index = 0; index < contourList.count(); ++index) { 366 total += contourList[index]->segments().count(); 369 for (index = 0; index < contourList.count(); ++index) { 370 sum += contourList[index]->debugShowWindingValues(total, ofInterest);
|
H A D | SkPathOpsCommon.cpp | 13 static int contourRangeCheckY(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** currentPtr, argument 22 int contourCount = contourList.count(); 29 SkOpContour* contour = contourList[cTest]; 101 SkOpSegment* FindUndone(SkTArray<SkOpContour*, true>& contourList, int* start, int* end) { argument 102 int contourCount = contourList.count(); 105 SkOpContour* contour = contourList[cIndex]; 212 void DebugShowActiveSpans(SkTArray<SkOpContour*, true>& contourList) { argument 214 for (index = 0; index < contourList.count(); ++ index) { 215 contourList[index]->debugShowActiveSpans(); 220 static SkOpSegment* findSortableTop(const SkTArray<SkOpContour*, true>& contourList, argument 260 rightAngleWinding(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** current, int* index, int* endIndex, double* tHit, SkScalar* hitDx, bool* tryAgain, bool opp) argument 277 skipVertical(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** current, int* index, int* endIndex) argument 295 FindSortableTop(const SkTArray<SkOpContour*, true>& contourList, SkOpAngle::IncludeType angleIncludeType, bool* firstContour, int* indexPtr, int* endIndexPtr, SkPoint* topLeft, bool* unsortable, bool* done) argument 354 checkEnds(SkTArray<SkOpContour*, true>* contourList) argument 365 checkTiny(SkTArray<SkOpContour*, true>* contourList) argument 373 fixOtherTIndex(SkTArray<SkOpContour*, true>* contourList) argument 381 joinCoincidence(SkTArray<SkOpContour*, true>* contourList) argument 389 sortSegments(SkTArray<SkOpContour*, true>* contourList) argument [all...] |