95     line.fC = -(dest->fPoint.fX * line.fA  + dest->fPoint.fY * line.fB);  in makeEvent()
99     if (line.intersect(bisector.fLine, &p) && !c.sweep_lt(p, top->fPoint) &&  in makeEvent()
100                                                c.sweep_lt(p, bottom->fPoint)) {  in makeEvent()
191         double distPrev = e->dist(prev->fPoint);  in simplifyBoundary()
192         double distNext = prevEdge->dist(next->fPoint);  in simplifyBoundary()
207             if (prev->fPoint != next->fPoint) {  in simplifyBoundary()
257     Vertex* dest = triangulator->makeSortedVertex(fPoint, fAlpha, mesh, prev, c);  in apply()
262              fPoint.fX, fPoint.fY, fAlpha);  in apply()
402     int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1;  in inversion()
439         TESS_LOG("stroking vertex %g (%g, %g)\n", v->fID, v->fPoint.fX, v->fPoint.fY);  in strokeBoundary()
448                 Line tangent(v->fPoint, v->fPoint + SkPoint::Make(bisector.fA, bisector.fB));  in strokeBoundary()
465                     Line prevTangent(prevV->fPoint,  in strokeBoundary()
466                                      prevV->fPoint + SkVector::Make(prevOuter.fA, prevOuter.fB));  in strokeBoundary()
467                     Line nextTangent(nextV->fPoint,  in strokeBoundary()
468                                      nextV->fPoint + SkVector::Make(outer.fA, outer.fB));  in strokeBoundary()
482                     Line prevTangent(prevV->fPoint,  in strokeBoundary()
483                                      prevV->fPoint + SkVector::Make(prevInner.fA, prevInner.fB));  in strokeBoundary()
484                     Line nextTangent(nextV->fPoint,  in strokeBoundary()
485                                      nextV->fPoint + SkVector::Make(inner.fA, inner.fB));  in strokeBoundary()