291     SkOpSpan* prior = &fHead;  in calcAngles()  local
296             priorAngle->set(spanBase, prior);  in calcAngles()
308         prior = span;  in calcAngles()
434         SkOpAngle* prior = angle;  in computeSum()  local
437         SkASSERT(prior->next() == angle);  in computeSum()
439         if (prior->unorderable() || angle->unorderable() || next->unorderable()) {  in computeSum()
460         SkOpAngle* prior = firstAngle;  in computeSum()  local
462             angle = prior;  in computeSum()
463             prior = angle->previous();  in computeSum()
464             SkASSERT(prior->next() == angle);  in computeSum()
466             if (prior->unorderable() || angle->unorderable() || next->unorderable()) {  in computeSum()
479         } while (prior != firstAngle);  in computeSum()
1159     SkOpSpan* prior = nullptr;  in missingCoincidence()  local
1208                         prior = priorTest;  in missingCoincidence()
1221             SkOpPtT* oppStart = prior->ptT();  in missingCoincidence()
1237             if (this->testForCoincidence(rootPriorPtT, rootPtT, prior, spanBase, opp)) {  in missingCoincidence()
1666         const SkOpSpanBase* prior, const SkOpSpanBase* spanBase, const SkOpSegment* opp) const {  in testForCoincidence()  argument
1668     double midT = (prior->t() + spanBase->t()) / 2;  in testForCoincidence()
1680         this->subDivide(prior, spanBase, &curvePart);  in testForCoincidence()