Searched defs:contourHead (Results 1 - 5 of 5) sorted by relevance

/external/skia/src/pathops/
H A DSkOpBuilder.cpp56 SkOpContourHead contourHead; local
57 SkOpGlobalState globalState(&contourHead, &allocator SkDEBUGPARAMS(false)
59 SkOpEdgeBuilder builder(*path, &contourHead, &globalState);
63 if (!contourHead.count()) {
66 if (!contourHead.next()) {
69 contourHead.joinAllSegments();
70 contourHead.resetReverse();
74 while ((topSpan = FindSortableTop(&contourHead))) {
95 SkOpContour* test = &contourHead;
H A DSkPathOpsCommon.cpp88 SkOpSpan* FindUndone(SkOpContourHead* contourHead) { argument
89 SkOpContour* contour = contourHead;
190 SkOpContourHead* contourHead = static_cast<SkOpContourHead*>(contour); local
191 contour->globalState()->setContourHead(contourHead);
192 *contourList = contourHead;
H A DSkOpSpan.cpp366 SkOpContour* contourHead = globals->contourHead(); local
368 while (!this->sortableTop(contourHead) && ++windTry < SkOpGlobalState::kMaxWindingTries) {
H A DSkPathOpsWinding.cpp235 bool SkOpSpan::sortableTop(SkOpContour* contourHead) { argument
251 SkOpContour* contour = contourHead;
369 SkOpSpan* SkOpSegment::findSortableTop(SkOpContour* contourHead) { argument
380 if (span->sortableTop(contourHead)) {
387 SkOpSpan* SkOpContour::findSortableTop(SkOpContour* contourHead) { argument
396 SkOpSpan* result = testSegment->findSortableTop(contourHead);
408 SkOpSpan* FindSortableTop(SkOpContourHead* contourHead) { argument
410 SkOpContour* contour = contourHead;
415 SkOpSpan* result = contour->findSortableTop(contourHead);
H A DSkPathOpsTypes.h69 SkOpContourHead* contourHead() { function in class:SkOpGlobalState
162 void setContourHead(SkOpContourHead* contourHead) { argument
163 fContourHead = contourHead;

Completed in 96 milliseconds