Lines Matching refs:fHead
228 VertexList() : fHead(nullptr), fTail(nullptr) {} in VertexList()
229 VertexList(Vertex* head, Vertex* tail) : fHead(head), fTail(tail) {} in VertexList()
230 Vertex* fHead; member
233 list_insert<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, prev, next, &fHead, &fTail); in insert()
239 if (!list.fHead) { in append()
243 fTail->fNext = list.fHead; in append()
244 list.fHead->fPrev = fTail; in append()
246 fHead = list.fHead; in append()
251 insert(v, nullptr, fHead); in prepend()
254 list_remove<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, &fHead, &fTail); in remove()
257 if (fHead && fTail) { in close()
258 fTail->fNext = fHead; in close()
259 fHead->fPrev = fTail; in close()
440 EdgeList() : fHead(nullptr), fTail(nullptr) {} in EdgeList()
441 Edge* fHead; member
444 list_insert<Edge, &Edge::fLeft, &Edge::fRight>(edge, prev, next, &fHead, &fTail); in insert()
450 list_remove<Edge, &Edge::fLeft, &Edge::fRight>(edge, &fHead, &fTail); in remove()
453 while (fHead) { in removeAll()
454 this->remove(fHead); in removeAll()
458 if (fHead && fTail) { in close()
459 fTail->fRight = fHead; in close()
460 fHead->fLeft = fTail; in close()
464 return edge->fLeft || edge->fRight || fHead == edge; in contains()
507 , fHead(nullptr) in Poly()
563 Vertex* first = vertices.fHead; in emit()
612 fHead = fTail = alloc.make<MonotonePoly>(e, side); in addEdge()
640 for (MonotonePoly* m = fHead; m != nullptr; m = m->fNext) { in emit()
648 MonotonePoly* fHead; member
777 if (contour->fHead) { in path_to_contours()
841 Edge* next = prev ? prev->fRight : edges->fHead; in insert_edge()
1175 Vertex* nextV = prevV ? prevV->fNext : mesh->fHead; in create_sorted_vertex()
1189 v->fID = mesh->fHead->fID - 1.0f; in create_sorted_vertex()
1277 SkASSERT(contour->fHead); in sanitize_contours()
1282 for (Vertex* v = contour->fHead; v;) { in sanitize_contours()
1287 Vertex* nextWrap = next ? next : contour->fHead; in sanitize_contours()
1306 if (!mesh->fHead) { in merge_coincident_vertices()
1310 for (Vertex* v = mesh->fHead->fNext; v;) { in merge_coincident_vertices()
1330 for (Vertex* v = contour->fHead; v;) { in build_edges()
1341 for (Vertex* outer = mesh->fHead; outer; outer = outer->fNext) { in connect_partners()
1356 Vertex* a = front->fHead; in sorted_merge()
1357 Vertex* b = back->fHead; in sorted_merge()
1362 a = front->fHead; in sorted_merge()
1366 b = back->fHead; in sorted_merge()
1381 for (Vertex* v = result->fHead; v; v = v->fNext) { in sorted_merge()
1391 Vertex* slow = vertices->fHead; in merge_sort()
1406 VertexList front(vertices->fHead, slow); in merge_sort()
1408 front.fTail->fNext = back.fHead->fPrev = nullptr; in merge_sort()
1413 vertices->fHead = vertices->fTail = nullptr; in merge_sort()
1419 for (Vertex* v = mesh.fHead; v; v = v->fNext) { in dump_mesh()
1460 Edge* left = edges->fHead; in validate_edge_list()
1477 for (Vertex* v = mesh->fHead; v != nullptr; v = v->fNext) { in simplify()
1524 SkASSERT(!activeEdges.fHead && !activeEdges.fTail); in simplify()
1534 for (Vertex* v = vertices.fHead; v != nullptr; v = v->fNext) { in tessellate()
1628 for (Edge* e = activeEdges.fHead; e != nullptr; e = e->fRight) { in tessellate()
1641 for (Vertex* v = mesh.fHead; v != nullptr; v = v->fNext) { in remove_non_boundary_edges()
1710 for (Edge* e = boundary->fHead; e != nullptr;) { in simplify_boundary()
1733 e = boundary->fHead; // join->fLeft ? join->fLeft : join; in simplify_boundary()
1812 for (Vertex* v = mesh->fHead; v != nullptr; v = v->fNext) { in collapse_overlap_regions()
1871 if (!boundary->fHead || !boundary->fHead->fRight || !boundary->fHead->fRight->fRight) { in stroke_boundary()
1887 for (Edge* e = boundary->fHead; e != nullptr; e = e->fRight) { in stroke_boundary()
2000 if (!inversion(innerVertices.fTail, innerVertices.fHead, prevEdge, c)) { in stroke_boundary()
2003 if (!inversion(outerVertices.fTail, outerVertices.fHead, prevEdge, c)) { in stroke_boundary()
2013 for (Vertex* v = innerVertices.fHead; v && v->fNext; v = v->fNext) { in stroke_boundary()
2016 connect(innerVertices.fTail, innerVertices.fHead, Edge::Type::kInner, c, alloc, innerWinding); in stroke_boundary()
2017 for (Vertex* v = outerVertices.fHead; v && v->fNext; v = v->fNext) { in stroke_boundary()
2020 connect(outerVertices.fTail, outerVertices.fHead, Edge::Type::kOuter, c, alloc, outerWinding); in stroke_boundary()
2064 for (Vertex* v = inMesh.fHead; v; v = v->fNext) { in extract_boundaries()
2080 Vertex* v = contours[i].fHead; in contours_to_mesh()
2093 if (!vertices || !vertices->fHead) { in sort_mesh()
2104 for (Vertex* v = vertices->fHead; v != nullptr; v = v->fNext) { in sort_mesh()
2149 outerMesh->fHead = outerMesh->fTail = nullptr; in contours_to_polys()
2205 for (Vertex* v = outerMesh.fHead; v; v = v->fNext) { in count_outer_mesh_points()
2214 for (Vertex* v = outerMesh.fHead; v; v = v->fNext) { in outer_mesh_to_triangles()