Lines Matching refs:Vertex
101 struct Vertex;
148 struct Vertex { struct
149 Vertex(const SkPoint& point, uint8_t alpha) in Vertex() argument
161 Vertex* fPrev; // Linked list of contours, then Y-sorted vertices. argument
162 Vertex* fNext; // " argument
169 Vertex* fPartner; // Corresponding inner or outer vertex (for AA). argument
197 inline void* emit_vertex(Vertex* v, bool emitCoverage, void* data) { in emit_vertex()
208 void* emit_triangle(Vertex* v0, Vertex* v1, Vertex* v2, bool emitCoverage, void* data) { in emit_triangle()
229 VertexList(Vertex* head, Vertex* tail) : fHead(head), fTail(tail) {} in VertexList()
230 Vertex* fHead;
231 Vertex* fTail;
232 void insert(Vertex* v, Vertex* prev, Vertex* next) { in insert()
233 list_insert<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, prev, next, &fHead, &fTail); in insert()
235 void append(Vertex* v) { in append()
250 void prepend(Vertex* v) { in prepend()
253 void remove(Vertex* v) { in remove()
254 list_remove<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, &fHead, &fTail); in remove()
278 Line(Vertex* p, Vertex* q) : Line(p->fPoint, q->fPoint) {} in Line()
342 Edge(Vertex* top, Vertex* bottom, int winding, Type type) in Edge()
366 Vertex* fTop; // The top vertex in vertex-sort-order (sweep_lt).
367 Vertex* fBottom; // The bottom vertex in vertex-sort-order.
389 bool isRightOf(Vertex* v) const { in isRightOf()
392 bool isLeftOf(Vertex* v) const { in isLeftOf()
504 Poly(Vertex* v, int winding) in Poly()
563 Vertex* first = vertices.fHead; in emit()
564 Vertex* v = first->fNext; in emit()
567 Vertex* prev = v->fPrev; in emit()
568 Vertex* curr = v; in emit()
569 Vertex* next = v->fNext; in emit()
645 Vertex* lastVertex() const { return fTail ? fTail->fLastEdge->fBottom : fFirstVertex; } in lastVertex()
646 Vertex* fFirstVertex;
664 Poly* new_poly(Poly** head, Vertex* v, int winding, SkArenaAlloc& alloc) { in new_poly()
672 Vertex* v = alloc.make<Vertex>(p, 255); in append_point_to_contour()
825 Edge* new_edge(Vertex* prev, Vertex* next, Edge::Type type, Comparator& c, SkArenaAlloc& alloc) { in new_edge()
827 Vertex* top = winding < 0 ? next : prev; in new_edge()
828 Vertex* bottom = winding < 0 ? prev : next; in new_edge()
845 void find_enclosing_edges(Vertex* v, EdgeList* edges, Edge** left, Edge** right) { in find_enclosing_edges()
863 void insert_edge_above(Edge* edge, Vertex* v, Comparator& c) { in insert_edge_above()
881 void insert_edge_below(Edge* edge, Vertex* v, Comparator& c) { in insert_edge_below()
921 void merge_collinear_edges(Edge* edge, EdgeList* activeEdges, Vertex** current, Comparator& c);
923 void rewind(EdgeList* activeEdges, Vertex** current, Vertex* dst, Comparator& c) { in rewind()
927 Vertex* v = *current; in rewind()
943 void rewind_if_necessary(Edge* edge, EdgeList* activeEdges, Vertex** current, Comparator& c) { in rewind_if_necessary()
947 Vertex* top = edge->fTop; in rewind_if_necessary()
948 Vertex* bottom = edge->fBottom; in rewind_if_necessary()
950 Vertex* leftTop = edge->fLeft->fTop; in rewind_if_necessary()
951 Vertex* leftBottom = edge->fLeft->fBottom; in rewind_if_necessary()
964 Vertex* rightTop = edge->fRight->fTop; in rewind_if_necessary()
965 Vertex* rightBottom = edge->fRight->fBottom; in rewind_if_necessary()
980 void set_top(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current, Comparator& c) { in set_top()
989 void set_bottom(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current, Comparator& c) { in set_bottom()
998 void merge_edges_above(Edge* edge, Edge* other, EdgeList* activeEdges, Vertex** current, in merge_edges_above()
1019 void merge_edges_below(Edge* edge, Edge* other, EdgeList* activeEdges, Vertex** current, in merge_edges_below()
1056 void merge_collinear_edges(Edge* edge, EdgeList* activeEdges, Vertex** current, Comparator& c) { in merge_collinear_edges()
1076 bool split_edge(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current, Comparator& c, in split_edge()
1084 Vertex* top; in split_edge()
1085 Vertex* bottom; in split_edge()
1107 bool intersect_edge_pair(Edge* left, Edge* right, EdgeList* activeEdges, Vertex** current, Comparat… in intersect_edge_pair()
1139 Edge* connect(Vertex* prev, Vertex* next, Edge::Type type, Comparator& c, SkArenaAlloc& alloc, in connect()
1152 void merge_vertices(Vertex* src, Vertex* dst, VertexList* mesh, Comparator& c, in merge_vertices()
1169 Vertex* create_sorted_vertex(const SkPoint& p, uint8_t alpha, VertexList* mesh, in create_sorted_vertex()
1170 Vertex* reference, Comparator& c, SkArenaAlloc& alloc) { in create_sorted_vertex()
1171 Vertex* prevV = reference; in create_sorted_vertex()
1175 Vertex* nextV = prevV ? prevV->fNext : mesh->fHead; in create_sorted_vertex()
1180 Vertex* v; in create_sorted_vertex()
1186 v = alloc.make<Vertex>(p, alpha); in create_sorted_vertex()
1220 bool check_for_intersection(Edge* left, Edge* right, EdgeList* activeEdges, Vertex** current, in check_for_intersection()
1228 Vertex* v; in check_for_intersection()
1230 Vertex* top = *current; in check_for_intersection()
1262 v->fPartner = alloc.make<Vertex>(p, 255 - v->fAlpha); in check_for_intersection()
1278 Vertex* prev = contour->fTail; in sanitize_contours()
1282 for (Vertex* v = contour->fHead; v;) { in sanitize_contours()
1286 Vertex* next = v->fNext; in sanitize_contours()
1287 Vertex* nextWrap = next ? next : contour->fHead; in sanitize_contours()
1310 for (Vertex* v = mesh->fHead->fNext; v;) { in merge_coincident_vertices()
1311 Vertex* next = v->fNext; in merge_coincident_vertices()
1329 Vertex* prev = contour->fTail; in build_edges()
1330 for (Vertex* v = contour->fHead; v;) { in build_edges()
1331 Vertex* next = v->fNext; in build_edges()
1341 for (Vertex* outer = mesh->fHead; outer; outer = outer->fNext) { in connect_partners()
1342 if (Vertex* inner = outer->fPartner) { in connect_partners()
1356 Vertex* a = front->fHead; in sorted_merge()
1357 Vertex* 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()
1395 Vertex* fast = slow->fNext; in merge_sort()
1419 for (Vertex* v = mesh.fHead; v; v = v->fNext) { in dump_mesh()
1421 if (Vertex* p = v->fPartner) { in dump_mesh()
1477 for (Vertex* v = mesh->fHead; v != nullptr; v = v->fNext) { in simplify()
1534 for (Vertex* v = vertices.fHead; v != nullptr; v = v->fNext) { in tessellate()
1641 for (Vertex* v = mesh.fHead; v != nullptr; v = v->fNext) { in remove_non_boundary_edges()
1677 void reconnect(Edge* edge, Vertex* src, Vertex* dst, Comparator& c) { in reconnect()
1711 Vertex* prev = prevEdge->fWinding == 1 ? prevEdge->fTop : prevEdge->fBottom; in simplify_boundary()
1712 Vertex* next = e->fWinding == 1 ? e->fBottom : e->fTop; in simplify_boundary()
1744 void reconnect_all_overlap_edges(Vertex* src, Vertex* dst, Edge* current, Comparator& c) { in reconnect_all_overlap_edges()
1768 Vertex* top = fEdge->fTop; in apply()
1769 Vertex* bottom = fEdge->fBottom; in apply()
1770 Vertex* dest = create_sorted_vertex(fPoint, fAlpha, mesh, fEdge->fTop, c, alloc); in apply()
1812 for (Vertex* v = mesh->fHead; v != nullptr; v = v->fNext) { in collapse_overlap_regions()
1855 bool inversion(Vertex* prev, Vertex* next, Edge* origEdge, Comparator& c) { in inversion()
1875 Vertex* prevV = prevEdge->fWinding > 0 ? prevEdge->fTop : prevEdge->fBottom; in stroke_boundary()
1888 Vertex* v = e->fWinding > 0 ? e->fTop : e->fBottom; in stroke_boundary()
1901 Vertex* nextV = e->fWinding > 0 ? e->fBottom : e->fTop; in stroke_boundary()
1959 Vertex* innerVertex1 = alloc.make<Vertex>(innerPoint1, 255); in stroke_boundary()
1960 Vertex* innerVertex2 = alloc.make<Vertex>(innerPoint2, 255); in stroke_boundary()
1961 Vertex* outerVertex1 = alloc.make<Vertex>(outerPoint1, 0); in stroke_boundary()
1962 Vertex* outerVertex2 = alloc.make<Vertex>(outerPoint2, 0); in stroke_boundary()
1980 Vertex* innerVertex = alloc.make<Vertex>(innerPoint, 255); in stroke_boundary()
1981 Vertex* outerVertex = alloc.make<Vertex>(outerPoint, 0); in stroke_boundary()
2013 for (Vertex* v = innerVertices.fHead; v && v->fNext; v = v->fNext) { in stroke_boundary()
2017 for (Vertex* v = outerVertices.fHead; v && v->fNext; v = v->fNext) { 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()
2104 for (Vertex* v = vertices->fHead; v != nullptr; v = v->fNext) { in sort_mesh()
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()
2216 Vertex* v0 = e->fTop; in outer_mesh_to_triangles()
2217 Vertex* v1 = e->fBottom; in outer_mesh_to_triangles()
2218 Vertex* v2 = e->fBottom->fPartner; in outer_mesh_to_triangles()
2219 Vertex* v3 = e->fTop->fPartner; in outer_mesh_to_triangles()