114     list_insert<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, prev, next, &fHead, &fTail);  in insert()
118     list_remove<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, &fHead, &fTail);  in remove()
290     list_insert<Edge, &Edge::fLeft, &Edge::fRight>(edge, prev, next, &fHead, &fTail);  in insert()
296     list_remove<Edge, &Edge::fLeft, &Edge::fRight>(edge, &fHead, &fTail);  in remove()
331     while (v != vertices.fTail) {  in emitMonotonePoly()
380         , fTail(nullptr)  in Poly()
409     if (!fTail) {  in addEdge()
410         fHead = fTail = alloc->make<MonotonePoly>(e, side, fWinding);  in addEdge()
412     } else if (e->fBottom == fTail->fLastEdge->fBottom) {  in addEdge()
414     } else if (side == fTail->fSide) {  in addEdge()
415         fTail->addEdge(e);  in addEdge()
418         e = alloc->make<Edge>(fTail->fLastEdge->fBottom, e->fBottom, 1, EdgeType::kInner);  in addEdge()
419         fTail->addEdge(e);  in addEdge()
426             m->fPrev = fTail;  in addEdge()
427             fTail->fNext = m;  in addEdge()
428             fTail = m;  in addEdge()
643     for (prev = edges->fTail; prev != nullptr; prev = prev->fLeft) {  in FindEnclosingEdges()
1008             v->fID = mesh->fTail->fID + 1.0f;  in makeSortedVertex()
1108         Vertex* prev = contour->fTail;  in sanitizeContours()
1164         Vertex* prev = contour->fTail;  in buildEdges()
1229     VertexList back(slow->fNext, vertices->fTail);  in merge_sort()
1230     front.fTail->fNext = back.fHead->fPrev = nullptr;  in merge_sort()
1235     vertices->fHead = vertices->fTail = nullptr;  in merge_sort()
1347     SkASSERT(!activeEdges.fHead && !activeEdges.fTail);  in simplify()
1422                         if (leftPoly->fTail && leftPoly->fTail->fSide == kLeft_Side) {  in tessellate()