Home
last modified time | relevance | path

Searched refs:contourList (Results 1 – 16 of 16) sorted by relevance

/external/skia/src/pathops/
DSkPathOpsCommon.cpp13 static int contourRangeCheckY(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** curren… in contourRangeCheckY() argument
22 int contourCount = contourList.count(); in contourRangeCheckY()
29 SkOpContour* contour = contourList[cTest]; in contourRangeCheckY()
101 SkOpSegment* FindUndone(SkTArray<SkOpContour*, true>& contourList, int* start, int* end) { in FindUndone() argument
102 int contourCount = contourList.count(); in FindUndone()
105 SkOpContour* contour = contourList[cIndex]; in FindUndone()
212 void DebugShowActiveSpans(SkTArray<SkOpContour*, true>& contourList) { in DebugShowActiveSpans() argument
214 for (index = 0; index < contourList.count(); ++ index) { in DebugShowActiveSpans()
215 contourList[index]->debugShowActiveSpans(); in DebugShowActiveSpans()
220 static SkOpSegment* findSortableTop(const SkTArray<SkOpContour*, true>& contourList, in findSortableTop() argument
[all …]
DSkPathOpsSimplify.cpp12 static bool bridgeWinding(SkTArray<SkOpContour*, true>& contourList, SkPathWriter* simple) { in bridgeWinding() argument
20 SkOpSegment* current = FindSortableTop(contourList, SkOpAngle::kUnaryWinding, &firstContour, in bridgeWinding()
37 DebugShowActiveSpans(contourList); in bridgeWinding()
86 DebugShowActiveSpans(contourList); in bridgeWinding()
97 static bool bridgeXor(SkTArray<SkOpContour*, true>& contourList, SkPathWriter* simple) { in bridgeXor() argument
102 while ((current = FindUndone(contourList, &start, &end))) { in bridgeXor()
106 DebugShowActiveSpans(contourList); in bridgeXor()
143 DebugShowActiveSpans(contourList); in bridgeXor()
164 SkTArray<SkOpContour*, true> contourList; in Simplify() local
165 MakeContourList(contours, contourList, false, false); in Simplify()
[all …]
DSkPathOpsOp.cpp138 static bool bridgeOp(SkTArray<SkOpContour*, true>& contourList, const SkPathOp op, in bridgeOp() argument
147 SkOpSegment* current = FindSortableTop(contourList, SkOpAngle::kBinarySingle, &firstContour, in bridgeOp()
164 DebugShowActiveSpans(contourList); in bridgeOp()
217 DebugShowActiveSpans(contourList); in bridgeOp()
280 SkTArray<SkOpContour*, true> contourList; in Op() local
281 MakeContourList(contours, contourList, xorMask == kEvenOdd_PathOpsMask, in Op()
283 SkOpContour** currentPtr = contourList.begin(); in Op()
287 SkOpContour** listEnd = contourList.end(); in Op()
304 for (index = 0; index < contourList.count(); ++index) { in Op()
305 total += contourList[index]->segments().count(); in Op()
[all …]
DSkPathOpsCommon.h22 SkOpSegment* FindUndone(SkTArray<SkOpContour*, true>& contourList, int* start, int* end);
28 void DebugShowActiveSpans(SkTArray<SkOpContour*, true>& contourList);
DSkOpContour.cpp359 void SkOpContour::debugShowWindingValues(const SkTArray<SkOpContour*, true>& contourList) { in debugShowWindingValues() argument
365 for (index = 0; index < contourList.count(); ++index) { in debugShowWindingValues()
366 total += contourList[index]->segments().count(); in debugShowWindingValues()
369 for (index = 0; index < contourList.count(); ++index) { in debugShowWindingValues()
370 sum += contourList[index]->debugShowWindingValues(total, ofInterest); in debugShowWindingValues()
DSkAddIntersections.h16 void CoincidenceCheck(SkTArray<SkOpContour*, true>* contourList, int total);
DSkAddIntersections.cpp436 void CoincidenceCheck(SkTArray<SkOpContour*, true>* contourList, int total) { in CoincidenceCheck() argument
437 int contourCount = (*contourList).count(); in CoincidenceCheck()
439 SkOpContour* contour = (*contourList)[cIndex]; in CoincidenceCheck()
443 SkOpContour* contour = (*contourList)[cIndex]; in CoincidenceCheck()
447 SkOpContour* contour = (*contourList)[cIndex]; in CoincidenceCheck()
DSkOpContour.h242 static void debugShowWindingValues(const SkTArray<SkOpContour*, true>& contourList);
/external/chromium_org/third_party/skia/src/pathops/
DSkPathOpsCommon.cpp13 static int contourRangeCheckY(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** curren… in contourRangeCheckY() argument
22 int contourCount = contourList.count(); in contourRangeCheckY()
29 SkOpContour* contour = contourList[cTest]; in contourRangeCheckY()
101 SkOpSegment* FindUndone(SkTArray<SkOpContour*, true>& contourList, int* start, int* end) { in FindUndone() argument
102 int contourCount = contourList.count(); in FindUndone()
105 SkOpContour* contour = contourList[cIndex]; in FindUndone()
212 void DebugShowActiveSpans(SkTArray<SkOpContour*, true>& contourList) { in DebugShowActiveSpans() argument
214 for (index = 0; index < contourList.count(); ++ index) { in DebugShowActiveSpans()
215 contourList[index]->debugShowActiveSpans(); in DebugShowActiveSpans()
220 static SkOpSegment* findSortableTop(const SkTArray<SkOpContour*, true>& contourList, in findSortableTop() argument
[all …]
DSkPathOpsSimplify.cpp12 static bool bridgeWinding(SkTArray<SkOpContour*, true>& contourList, SkPathWriter* simple) { in bridgeWinding() argument
20 SkOpSegment* current = FindSortableTop(contourList, SkOpAngle::kUnaryWinding, &firstContour, in bridgeWinding()
37 DebugShowActiveSpans(contourList); in bridgeWinding()
86 DebugShowActiveSpans(contourList); in bridgeWinding()
97 static bool bridgeXor(SkTArray<SkOpContour*, true>& contourList, SkPathWriter* simple) { in bridgeXor() argument
102 while ((current = FindUndone(contourList, &start, &end))) { in bridgeXor()
106 DebugShowActiveSpans(contourList); in bridgeXor()
143 DebugShowActiveSpans(contourList); in bridgeXor()
164 SkTArray<SkOpContour*, true> contourList; in Simplify() local
165 MakeContourList(contours, contourList, false, false); in Simplify()
[all …]
DSkPathOpsOp.cpp138 static bool bridgeOp(SkTArray<SkOpContour*, true>& contourList, const SkPathOp op, in bridgeOp() argument
147 SkOpSegment* current = FindSortableTop(contourList, SkOpAngle::kBinarySingle, &firstContour, in bridgeOp()
164 DebugShowActiveSpans(contourList); in bridgeOp()
217 DebugShowActiveSpans(contourList); in bridgeOp()
280 SkTArray<SkOpContour*, true> contourList; in Op() local
281 MakeContourList(contours, contourList, xorMask == kEvenOdd_PathOpsMask, in Op()
283 SkOpContour** currentPtr = contourList.begin(); in Op()
287 SkOpContour** listEnd = contourList.end(); in Op()
304 for (index = 0; index < contourList.count(); ++index) { in Op()
305 total += contourList[index]->segments().count(); in Op()
[all …]
DSkPathOpsCommon.h22 SkOpSegment* FindUndone(SkTArray<SkOpContour*, true>& contourList, int* start, int* end);
28 void DebugShowActiveSpans(SkTArray<SkOpContour*, true>& contourList);
DSkOpContour.cpp359 void SkOpContour::debugShowWindingValues(const SkTArray<SkOpContour*, true>& contourList) { in debugShowWindingValues() argument
365 for (index = 0; index < contourList.count(); ++index) { in debugShowWindingValues()
366 total += contourList[index]->segments().count(); in debugShowWindingValues()
369 for (index = 0; index < contourList.count(); ++index) { in debugShowWindingValues()
370 sum += contourList[index]->debugShowWindingValues(total, ofInterest); in debugShowWindingValues()
DSkAddIntersections.h16 void CoincidenceCheck(SkTArray<SkOpContour*, true>* contourList, int total);
DSkAddIntersections.cpp436 void CoincidenceCheck(SkTArray<SkOpContour*, true>* contourList, int total) { in CoincidenceCheck() argument
437 int contourCount = (*contourList).count(); in CoincidenceCheck()
439 SkOpContour* contour = (*contourList)[cIndex]; in CoincidenceCheck()
443 SkOpContour* contour = (*contourList)[cIndex]; in CoincidenceCheck()
447 SkOpContour* contour = (*contourList)[cIndex]; in CoincidenceCheck()
DSkOpContour.h242 static void debugShowWindingValues(const SkTArray<SkOpContour*, true>& contourList);