Cross Reference: /external/skia/experimental/Intersection/SkAntiEdge.cpp

Lines Matching refs:active
350     for (SkAntiEdge* active = fEdges.begin(); active != fEdges.end(); ++active) {
351         active->calcLine();
355     SkAntiEdge* active;
357     for (active = first; active != &fTailEdge; active = active->fNext) {
358         active->fWindingSum = active->fWinding;
359         while (listTop->fLastY < active->fFirstY) {
362         for (SkAntiEdge* check = listTop; check->fFirstY <= active->fFirstY; check = check->fNext) {
363             if (check == active) {
366             if (check->fLastY <= active->fFirstY) {
369             if (check->fFirstX > active->fFirstX) {
372             if (check->fFirstX == active->fFirstX && check->fDX > active->fDX) {
375             active->fWindingSum += check->fWinding;
481     SkAntiEdge* active = first->fNext;
484     for ( ; active->fWalkY != kEDGE_TAIL_XY; active = active->fNext) {
485         active->fLinkSet = false;
486         if (yLimit <= active->fWalkY - active->fDXFlipped) {
489         if ((*activeLeft)->fWalkX > active->fWalkX) {
490             *activeLeft = active;
492         if (bottom > active->fLastY) {
493             bottom = active->fLastY;
496     *activeLast = active;
506     SkAntiEdge* active;
507     for (active = prev + 1; active != tail; ++active) {
508         if (prev->fWinding == active->fWinding) {
509             if (prev->fLastX == active->fFirstX && prev->fLastY == active->fFirstY) {
510                 prev->fLink = active;
511                 active->fLinkSet = true;
512             } else if (active->fLastX == prev->fFirstX && active->fLastY == prev->fFirstY) {
513                 active->fLink = prev;
517         prev = active;
527         for (active = prev + 1; active != tail; ++active) {
528             if (active->fLinkSet || NULL != active->fLink) {
531             if (prev->fWinding != active->fWinding) {
534             if (prev->fLastX == active->fFirstX && prev->fLastY == active->fFirstY) {
535                 prev->fLink = active;
536                 active->fLinkSet = true;
539             if (active->fLastX == prev->fFirstX && active->fLastY == prev->fFirstY) {
540                 active->fLink = prev;
569     SkAntiEdge* active;
570     for (active = first; active != &fTailEdge; active = active->fNext) {
571         if (active->fLinkSet || NULL == active->fLink) {
575         link->fFirstX = active->fFirstX;
576         link->fFirstY = active->fFirstY;
578         SkAntiEdge* next = active;
588     for (active = links.begin(); active != links.end(); ++active) {
589         *list.append() = active;
591     for (active = first; active != &fTailEdge; active = active->fNext) {
592         if (!active->fLinkSet && NULL == active->fLink) {
594             link->fFirstX = active->fFirstX;
595             link->fFirstY = active->fFirstY;
596             link->fLastX = active->fLastX;
597             link->fLastY = active->fLastY;
607     for (active = first; active != &fTailEdge; active = active->fNext) {
608         while (listTop->fLastY < active->fFirstY) {
611         for (SkAntiEdge* check = listTop; check->fFirstY < active->fLastY; check = check->fNext) {
612             if (check->fFirstX > active->fFirstX) {
615             if (check->fFirstX == active->fFirstX && check->fDX > active->fDX) {
618             if (check->fFirstY > active->fFirstY) {
619                 split(active, check->fFirstY);
621             if (check->fLastY < active->fLastY) {
622                 split(active, check->fLastY);
641         SkAntiEdge* activeLast, * active;
659                 for (active = first; active != activeLast; active = active->fNext) {
660                     if (left + SK_Fixed1 <= active->fX) {
664                     int cover = active->fDXFlipped ?
665                         active->advanceFlippedX(left) : active->advanceX(left);
666                     if (0 == active->fWindingSum) {
670                     finished &= active->fFinished;
682             for (active = first; active != activeLast; active = active->fNext) {
683                 if (xSort > active->fX || topLimit > active->fLastY) {
686                 xSort = active->fX;
687                 if (active->fWalkY < active->fLastY) {
688                     active->advanceY(top);
691             for (active = first; active != activeLast; ) {
692                 SkAntiEdge* next = active->fNext;
693                 if (top >= active->fLastY) {
694                     remove_edge(active);
696                 active = next;