/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkPathOpsTightBounds.cpp | 17 SkTArray<SkOpContour*, true> contourList; local 18 MakeContourList(contours, contourList, false, false); 19 SkOpContour** currentPtr = contourList.begin(); 24 SkOpContour** listEnd = contourList.end();
|
H A D | SkAddIntersections.cpp | 437 bool CoincidenceCheck(SkTArray<SkOpContour*, true>* contourList, int total) { argument 438 int contourCount = (*contourList).count(); 440 SkOpContour* contour = (*contourList)[cIndex]; 444 SkOpContour* contour = (*contourList)[cIndex]; 448 SkOpContour* contour = (*contourList)[cIndex]; 454 SkOpContour* contour = (*contourList)[cIndex];
|
H A D | SkPathOpsSimplify.cpp | 12 static bool bridgeWinding(SkTArray<SkOpContour*, true>& contourList, SkPathWriter* simple) { argument 24 SkOpSegment* current = FindSortableTop(contourList, SkOpAngle::kUnaryWinding, &firstContour, 94 DebugShowActiveSpans(contourList); 105 static bool bridgeXor(SkTArray<SkOpContour*, true>& contourList, SkPathWriter* simple) { argument 110 while ((current = FindUndone(contourList, &start, &end))) { 114 DebugShowActiveSpans(contourList); 151 DebugShowActiveSpans(contourList); 172 SkTArray<SkOpContour*, true> contourList; local 173 MakeContourList(contours, contourList, false, false); 174 SkOpContour** currentPtr = contourList [all...] |
H A D | SkPathOpsOp.cpp | 121 static bool bridgeOp(SkTArray<SkOpContour*, true>& contourList, const SkPathOp op, argument 134 SkOpSegment* current = FindSortableTop(contourList, SkOpAngle::kBinarySingle, &firstContour, 173 DebugShowActiveSpans(contourList); 218 DebugShowActiveSpans(contourList); 281 SkTArray<SkOpContour*, true> contourList; local 282 MakeContourList(contours, contourList, xorMask == kEvenOdd_PathOpsMask, 284 SkOpContour** currentPtr = contourList.begin(); 288 SkOpContour** listEnd = contourList.end(); 305 for (index = 0; index < contourList.count(); ++index) { 306 total += contourList[inde [all...] |
H A D | SkPathOpsCommon.cpp | 13 static void alignMultiples(SkTArray<SkOpContour*, true>* contourList, argument 15 int contourCount = (*contourList).count(); 17 SkOpContour* contour = (*contourList)[cTest]; 24 static void alignCoincidence(SkTArray<SkOpContour*, true>* contourList, argument 26 int contourCount = (*contourList).count(); 28 SkOpContour* contour = (*contourList)[cTest]; 36 static int contourRangeCheckY(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** currentPtr, argument 45 int contourCount = contourList.count(); 52 SkOpContour* contour = contourList[cTest]; 124 SkOpSegment* FindUndone(SkTArray<SkOpContour*, true>& contourList, in argument 222 DebugShowActiveSpans(SkTArray<SkOpContour*, true>& contourList) argument 230 findTopSegment(const SkTArray<SkOpContour*, true>& contourList, int* index, int* endIndex, SkPoint* topLeft, bool* unsortable, bool* done, bool firstPass) argument 277 rightAngleWinding(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** currentPtr, int* indexPtr, int* endIndexPtr, double* tHit, SkScalar* hitDx, bool* tryAgain, bool* onlyVertical, bool opp) argument 298 skipVertical(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** current, int* index, int* endIndex) 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 389 calcAngles(SkTArray<SkOpContour*, true>* contourList) argument 400 checkDuplicates(SkTArray<SkOpContour*, true>* contourList) argument 408 checkEnds(SkTArray<SkOpContour*, true>* contourList) argument 418 checkMultiples(SkTArray<SkOpContour*, true>* contourList) argument 430 checkSmall(SkTArray<SkOpContour*, true>* contourList) argument 439 checkTiny(SkTArray<SkOpContour*, true>* contourList) argument 447 fixOtherTIndex(SkTArray<SkOpContour*, true>* contourList) argument 455 joinCoincidence(SkTArray<SkOpContour*, true>* contourList) argument 463 sortAngles(SkTArray<SkOpContour*, true>* contourList) argument 471 sortSegments(SkTArray<SkOpContour*, true>* contourList) argument [all...] |
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | SimplifyFindTop_Test.cpp | 21 SkTDArray<SimplifyFindTopTest::Contour*> contourList; local 22 makeContourList(contours, contourList, false, false); 23 addIntersectTs(contourList[0], contourList[0]); 26 addIntersectTs(contourList[0], contourList[1]); 27 addIntersectTs(contourList[1], contourList[1]); 29 fixOtherTIndex(contourList); 31 SimplifyFindTopTest::Segment* topStart = findTopContour(contourList); [all...] |
H A D | SimplifyFindNext_Test.cpp | 23 SkTDArray<SimplifyFindNextTest::Contour*> contourList; local 24 makeContourList(contours, contourList, false, false); 25 addIntersectTs(contourList[0], contourList[0]); 28 addIntersectTs(contourList[0], contourList[1]); 29 addIntersectTs(contourList[1], contourList[1]); 31 fixOtherTIndex(contourList);
|
H A D | ShapeOps.cpp | 132 static bool bridgeOp(SkTDArray<Contour*>& contourList, const ShapeOp op, argument 141 Segment* current = findSortableTop(contourList, firstContour, index, endIndex, topLeft, 158 debugShowActiveSpans(contourList); 203 debugShowActiveSpans(contourList); 230 SkTDArray<Op::Contour*> contourList; local 231 makeContourList(contours, contourList, xorMask == kEvenOdd_Mask, 233 Op::Contour** currentPtr = contourList.begin(); 237 Op::Contour** listEnd = contourList.end(); 254 for (index = 0; index < contourList.count(); ++index) { 255 total += contourList[inde [all...] |
/external/skia/experimental/Intersection/ |
H A D | SimplifyFindTop_Test.cpp | 21 SkTDArray<SimplifyFindTopTest::Contour*> contourList; local 22 makeContourList(contours, contourList, false, false); 23 addIntersectTs(contourList[0], contourList[0]); 26 addIntersectTs(contourList[0], contourList[1]); 27 addIntersectTs(contourList[1], contourList[1]); 29 fixOtherTIndex(contourList); 31 SimplifyFindTopTest::Segment* topStart = findTopContour(contourList); [all...] |
H A D | SimplifyFindNext_Test.cpp | 23 SkTDArray<SimplifyFindNextTest::Contour*> contourList; local 24 makeContourList(contours, contourList, false, false); 25 addIntersectTs(contourList[0], contourList[0]); 28 addIntersectTs(contourList[0], contourList[1]); 29 addIntersectTs(contourList[1], contourList[1]); 31 fixOtherTIndex(contourList);
|
H A D | ShapeOps.cpp | 132 static bool bridgeOp(SkTDArray<Contour*>& contourList, const ShapeOp op, argument 141 Segment* current = findSortableTop(contourList, firstContour, index, endIndex, topLeft, 158 debugShowActiveSpans(contourList); 203 debugShowActiveSpans(contourList); 230 SkTDArray<Op::Contour*> contourList; local 231 makeContourList(contours, contourList, xorMask == kEvenOdd_Mask, 233 Op::Contour** currentPtr = contourList.begin(); 237 Op::Contour** listEnd = contourList.end(); 254 for (index = 0; index < contourList.count(); ++index) { 255 total += contourList[inde [all...] |
/external/skia/src/pathops/ |
H A D | SkAddIntersections.cpp | 437 void CoincidenceCheck(SkTArray<SkOpContour*, true>* contourList, int total) { argument 438 int contourCount = (*contourList).count(); 440 SkOpContour* contour = (*contourList)[cIndex]; 444 SkOpContour* contour = (*contourList)[cIndex]; 448 SkOpContour* contour = (*contourList)[cIndex]; 452 SkOpContour* contour = (*contourList)[cIndex];
|
H A D | SkPathOpsSimplify.cpp | 12 static bool bridgeWinding(SkTArray<SkOpContour*, true>& contourList, SkPathWriter* simple) { argument 24 SkOpSegment* current = FindSortableTop(contourList, SkOpAngle::kUnaryWinding, &firstContour, 94 DebugShowActiveSpans(contourList); 105 static bool bridgeXor(SkTArray<SkOpContour*, true>& contourList, SkPathWriter* simple) { argument 110 while ((current = FindUndone(contourList, &start, &end))) { 114 DebugShowActiveSpans(contourList); 151 DebugShowActiveSpans(contourList); 172 SkTArray<SkOpContour*, true> contourList; local 173 MakeContourList(contours, contourList, false, false); 174 SkOpContour** currentPtr = contourList [all...] |
H A D | SkPathOpsOp.cpp | 121 static bool bridgeOp(SkTArray<SkOpContour*, true>& contourList, const SkPathOp op, argument 134 SkOpSegment* current = FindSortableTop(contourList, SkOpAngle::kBinarySingle, &firstContour, 173 DebugShowActiveSpans(contourList); 218 DebugShowActiveSpans(contourList); 281 SkTArray<SkOpContour*, true> contourList; local 282 MakeContourList(contours, contourList, xorMask == kEvenOdd_PathOpsMask, 284 SkOpContour** currentPtr = contourList.begin(); 288 SkOpContour** listEnd = contourList.end(); 305 for (index = 0; index < contourList.count(); ++index) { 306 total += contourList[inde [all...] |
H A D | SkPathOpsCommon.cpp | 13 static void alignMultiples(SkTArray<SkOpContour*, true>* contourList, argument 15 int contourCount = (*contourList).count(); 17 SkOpContour* contour = (*contourList)[cTest]; 24 static void alignCoincidence(SkTArray<SkOpContour*, true>* contourList, argument 26 int contourCount = (*contourList).count(); 28 SkOpContour* contour = (*contourList)[cTest]; 36 static int contourRangeCheckY(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** currentPtr, argument 45 int contourCount = contourList.count(); 52 SkOpContour* contour = contourList[cTest]; 124 SkOpSegment* FindUndone(SkTArray<SkOpContour*, true>& contourList, in argument 222 DebugShowActiveSpans(SkTArray<SkOpContour*, true>& contourList) argument 230 findTopSegment(const SkTArray<SkOpContour*, true>& contourList, int* index, int* endIndex, SkPoint* topLeft, bool* unsortable, bool* done, bool firstPass) argument 277 rightAngleWinding(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** currentPtr, int* indexPtr, int* endIndexPtr, double* tHit, SkScalar* hitDx, bool* tryAgain, bool* onlyVertical, bool opp) argument 298 skipVertical(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** current, int* index, int* endIndex) 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 389 calcAngles(SkTArray<SkOpContour*, true>* contourList) argument 400 checkDuplicates(SkTArray<SkOpContour*, true>* contourList) argument 408 checkEnds(SkTArray<SkOpContour*, true>* contourList) argument 418 checkMultiples(SkTArray<SkOpContour*, true>* contourList) argument 430 checkSmall(SkTArray<SkOpContour*, true>* contourList) argument 439 checkTiny(SkTArray<SkOpContour*, true>* contourList) argument 447 fixOtherTIndex(SkTArray<SkOpContour*, true>* contourList) argument 455 joinCoincidence(SkTArray<SkOpContour*, true>* contourList) argument 463 sortAngles(SkTArray<SkOpContour*, true>* contourList) argument 471 sortSegments(SkTArray<SkOpContour*, true>* contourList) argument [all...] |