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

/external/skia/src/pathops/
H A DSkOpBuilder.cpp54 SkOpContourHead contourHead; local
55 SkOpGlobalState globalState(&contourHead, &allocator SkDEBUGPARAMS(false)
57 SkOpEdgeBuilder builder(*path, &contourHead, &globalState);
61 if (!contourHead.count()) {
64 if (!contourHead.next()) {
67 contourHead.joinAllSegments();
68 contourHead.resetReverse();
72 while ((topSpan = FindSortableTop(&contourHead))) {
93 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
250 SkOpContour* contour = contourHead;
368 SkOpSpan* SkOpSegment::findSortableTop(SkOpContour* contourHead) { argument
379 if (span->sortableTop(contourHead)) {
386 SkOpSpan* SkOpContour::findSortableTop(SkOpContour* contourHead) { argument
395 SkOpSpan* result = testSegment->findSortableTop(contourHead);
407 SkOpSpan* FindSortableTop(SkOpContourHead* contourHead) { argument
409 SkOpContour* contour = contourHead;
414 SkOpSpan* result = contour->findSortableTop(contourHead);
H A DSkPathOpsTypes.h69 SkOpContourHead* contourHead() { function in class:SkOpGlobalState
162 void setContourHead(SkOpContourHead* contourHead) { argument
163 fContourHead = contourHead;
/external/skqp/src/pathops/
H A DSkOpBuilder.cpp54 SkOpContourHead contourHead; local
55 SkOpGlobalState globalState(&contourHead, &allocator SkDEBUGPARAMS(false)
57 SkOpEdgeBuilder builder(*path, &contourHead, &globalState);
61 if (!contourHead.count()) {
64 if (!contourHead.next()) {
67 contourHead.joinAllSegments();
68 contourHead.resetReverse();
72 while ((topSpan = FindSortableTop(&contourHead))) {
93 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
250 SkOpContour* contour = contourHead;
368 SkOpSpan* SkOpSegment::findSortableTop(SkOpContour* contourHead) { argument
379 if (span->sortableTop(contourHead)) {
386 SkOpSpan* SkOpContour::findSortableTop(SkOpContour* contourHead) { argument
395 SkOpSpan* result = testSegment->findSortableTop(contourHead);
407 SkOpSpan* FindSortableTop(SkOpContourHead* contourHead) { argument
409 SkOpContour* contour = contourHead;
414 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 221 milliseconds