Lines Matching defs:curr
51 for (int curr = 2; curr < polygonSize; ++curr) {
52 SkVector v1 = polygonVerts[curr] - polygonVerts[0];
354 for (int curr = 0; curr < inputPolygonSize; prev = curr, ++curr) {
355 int next = (curr + 1) % inputPolygonSize;
356 if (!inputPolygonVerts[curr].isFinite()) {
360 if (compute_side(inputPolygonVerts[prev], inputPolygonVerts[curr] - inputPolygonVerts[prev],
364 SkVector v = inputPolygonVerts[next] - inputPolygonVerts[curr];
367 edgeData[curr].fPrev = &edgeData[prev];
368 edgeData[curr].fNext = &edgeData[next];
369 edgeData[curr].fOffset.fP0 = inputPolygonVerts[curr] + perp;
370 edgeData[curr].fOffset.fV = v;
371 edgeData[curr].init();
414 // if prev to right side of curr
711 ActiveEdge *curr = top->fChild[1];
720 if (!curr) {
727 parent->fChild[dir] = curr = this->allocate(p0, v, index0, index1);
728 SkASSERT(curr);
729 if (!curr) {
732 curr->fAbove = pred;
733 curr->fBelow = succ;
735 pred->fBelow = curr;
738 succ->fAbove = curr;
742 if (curr == parent->fChild[last]) {
749 } else if (IsRed(curr->fChild[0]) && IsRed(curr->fChild[1])) {
751 curr->fRed = true;
752 curr->fChild[0]->fRed = false;
753 curr->fChild[1]->fRed = false;
756 if (curr == parent->fChild[last]) {
767 if (curr->fIndex0 == index0) {
768 side = compute_side(curr->fSegment.fP0, curr->fSegment.fV, p1);
770 side = compute_side(curr->fSegment.fP0, curr->fSegment.fV, p0);
778 succ = curr;
780 pred = curr;
788 parent = curr;
789 curr = curr->fChild[dir];
808 ActiveEdge* curr = &fTreeHead;
813 while (curr->fChild[dir] != nullptr) {
815 curr = curr->fChild[dir];
817 if (curr->equals(index0, index1)) {
818 found = curr;
823 if (curr->fIndex1 == index1) {
824 side = compute_side(curr->fSegment.fP0, curr->fSegment.fV, p0);
826 side = compute_side(curr->fSegment.fP0, curr->fSegment.fV, p1);
865 ActiveEdge* curr = &fTreeHead;
872 while (curr->fChild[dir] != nullptr) {
877 parent = curr;
878 curr = curr->fChild[dir];
880 if (curr->equals(index0, index1)) {
881 found = curr;
886 if (curr->fIndex1 == index1) {
887 side = compute_side(curr->fSegment.fP0, curr->fSegment.fV, p0);
889 side = compute_side(curr->fSegment.fP0, curr->fSegment.fV, p1);
898 if (!IsRed(curr) && !IsRed(curr->fChild[dir])) {
899 if (IsRed(curr->fChild[!dir])) {
900 parent = parent->fChild[last] = SingleRotation(curr, dir);
909 curr->fRed = true;
920 curr->fRed = grandparent->fChild[dir2]->fRed = true;
936 if (found != curr) {
937 found->fSegment = curr->fSegment;
938 found->fIndex0 = curr->fIndex0;
939 found->fIndex1 = curr->fIndex1;
940 found->fAbove = curr->fAbove;
949 pred->fBelow = curr->fBelow;
951 parent->fChild[parent->fChild[1] == curr] = curr->fChild[!curr->fChild[0]];
954 curr->fAbove = reinterpret_cast<ActiveEdge*>(0xdeadbeefll);
955 curr->fBelow = reinterpret_cast<ActiveEdge*>(0xdeadbeefll);