Lines Matching defs:step

544     int step = start->step(end);
545 SkOpSegment* other = this->isSimple(nextStart, &step); // advances nextStart
557 *nextEnd = step > 0 ? (*nextStart)->upCast()->next() : (*nextStart)->prev();
560 SkOpSpanBase* endNear = step > 0 ? (*nextStart)->upCast()->next() : (*nextStart)->prev();
564 SkASSERT((start->t() < endNear->t()) ^ (step < 0));
650 int step = start->step(end);
651 SkOpSegment* other = this->isSimple(nextStart, &step); // advances nextStart
663 *nextEnd = step > 0 ? (*nextStart)->upCast()->next() : (*nextStart)->prev();
666 SkOpSpanBase* endNear = step > 0 ? (*nextStart)->upCast()->next() : (*nextStart)->prev();
670 SkASSERT((start->t() < endNear->t()) ^ (step < 0));
746 int step = start->step(end);
747 SkOpSegment* other = this->isSimple(nextStart, &step); // advances nextStart
759 *nextEnd = step > 0 ? (*nextStart)->upCast()->next() : (*nextStart)->prev();
762 SkDEBUGCODE(SkOpSpanBase* endNear = step > 0 ? (*nextStart)->upCast()->next() \
767 SkASSERT((start->t() < endNear->t()) ^ (step < 0));
860 int step = start->step(end);
868 while ((other = other->nextChase(&start, &step, &minSpan, &last))) {
895 int step = start->step(end);
900 while ((other = other->nextChase(&start, &step, &spanStart, &last))) {
920 int step = start->step(end);
925 while ((other = other->nextChase(&start, &step, &spanStart, &last))) {
1074 int step = *stepPtr;
1075 SkOpSpanBase* endSpan = step > 0 ? origStart->upCast()->next() : origStart->prev();
1077 SkOpAngle* angle = step > 0 ? endSpan->fromAngle() : endSpan->upCast()->toAngle();
1088 otherEnd = step > 0
1113 int foundStep = foundSpan->step(otherEnd);
1119 SkOpSpan* origMin = step < 0 ? origStart->prev() : origStart->upCast();