185     Edge* prevEdge = boundary->fTail;  in simplifyBoundary()  local
187     get_edge_normal(prevEdge, &prevNormal);  in simplifyBoundary()
189         Vertex* prev = prevEdge->fWinding == 1 ? prevEdge->fTop : prevEdge->fBottom;  in simplifyBoundary()
192         double distNext = prevEdge->dist(next->fPoint);  in simplifyBoundary()
197             boundary->remove(prevEdge);  in simplifyBoundary()
199             prevEdge = boundary->fTail;  in simplifyBoundary()
201             if (prevEdge) {  in simplifyBoundary()
202                 get_edge_normal(prevEdge, &prevNormal);  in simplifyBoundary()
212             boundary->remove(prevEdge);  in simplifyBoundary()
215                 prevEdge = join->fLeft;  in simplifyBoundary()
218                 prevEdge = boundary->fTail;  in simplifyBoundary()
221             get_edge_normal(prevEdge, &prevNormal);  in simplifyBoundary()
223             prevEdge = e;  in simplifyBoundary()
252     SSEdge* prevEdge = fEdge->fPrev->fPrev;  in apply()  local
254     if (!prevEdge || !nextEdge || !prevEdge->fEdge || !nextEdge->fEdge) {  in apply()
268     prevEdge->fNext = nextEdge->fPrev = ssv;  in apply()
269     ssv->fPrev = prevEdge;  in apply()
271     if (!prevEdge->fEdge || !nextEdge->fEdge) {  in apply()
274     if (prevEdge->fEvent) {  in apply()
275         prevEdge->fEvent->fEdge = nullptr;  in apply()
280     if (prevEdge->fPrev == nextEdge->fNext) {  in apply()
281         triangulator->connectSSEdge(prevEdge->fPrev->fVertex, dest, c);  in apply()
282         prevEdge->fEdge = nextEdge->fEdge = nullptr;  in apply()
284         triangulator->computeBisector(prevEdge->fEdge, nextEdge->fEdge, dest);  in apply()
285         SkASSERT(prevEdge != fEdge && nextEdge != fEdge);  in apply()
287             triangulator->makeEvent(prevEdge, events);  in apply()
290             triangulator->makeEvent(prevEdge, prevEdge->fPrev->fVertex, nextEdge, dest, events, c);  in apply()
291             triangulator->makeEvent(nextEdge, nextEdge->fNext->fVertex, prevEdge, dest, events, c);  in apply()
417     Edge* prevEdge = boundary->fTail;  in strokeBoundary()  local
418     Vertex* prevV = prevEdge->fWinding > 0 ? prevEdge->fTop : prevEdge->fBottom;  in strokeBoundary()
420     get_edge_normal(prevEdge, &prevNormal);  in strokeBoundary()
422     Line prevInner(prevEdge->fLine);  in strokeBoundary()
424     Line prevOuter(prevEdge->fLine);  in strokeBoundary()
440         if (!prevEdge->fLine.nearParallel(e->fLine) && prevInner.intersect(inner, &innerPoint) &&  in strokeBoundary()
510                 if (!inversion(innerVertices.fTail, innerVertex1, prevEdge, c)) {  in strokeBoundary()
513                 if (!inversion(outerVertices.fTail, outerVertex1, prevEdge, c)) {  in strokeBoundary()
527                 if (!inversion(innerVertices.fTail, innerVertex, prevEdge, c)) {  in strokeBoundary()
530                 if (!inversion(outerVertices.fTail, outerVertex, prevEdge, c)) {  in strokeBoundary()
540         prevEdge = e;  in strokeBoundary()
543     if (!inversion(innerVertices.fTail, innerVertices.fHead, prevEdge, c)) {  in strokeBoundary()
546     if (!inversion(outerVertices.fTail, outerVertices.fHead, prevEdge, c)) {  in strokeBoundary()