Home
last modified time | relevance | path

Searched refs:fEdge (Results 1 – 10 of 10) sorted by relevance

/external/skia/src/gpu/
DGrAATriangulator.cpp47 : fEdge(edge), fEvent(nullptr), fPrev(prev), fNext(next) { in SSEdge()
49 Edge* fEdge; member
77 prev->fID, next->fID, e->fEdge->fTop->fID, e->fEdge->fBottom->fID, p.fX, p.fY, in makeEvent()
89 Vertex* top = edge->fEdge->fTop; in makeEvent()
90 Vertex* bottom = edge->fEdge->fBottom; in makeEvent()
94 Line line = edge->fEdge->fLine; in makeEvent()
126 if (edge->fEdge) { in dump_skel()
130 if (edge->fEdge->fTop && edge->fEdge->fBottom) { in dump_skel()
132 edge->fEdge->fTop->fID, in dump_skel()
133 edge->fEdge->fBottom->fID); in dump_skel()
[all …]
DGrAATriangulator.h32 : fEdge(edge), fPoint(point), fAlpha(alpha) {} in Event()
33 SSEdge* fEdge; member
DGrDistanceFieldGenFromVector.cpp767 switch (e.fEdge) { in GrGenerateDistanceFieldFromPath()
/external/skia/src/core/
DSkEdgeBuilder.cpp246 switch (e.fEdge) { in buildPoly()
268 switch (e.fEdge) { in buildPoly()
332 switch (e.fEdge) { in build()
DSkPathPriv.h456 Edge fEdge; member
DSkEdgeClipper.cpp574 switch (e.fEdge) { in ClipPath()
/external/skia/bench/
DPathIterBench.cpp111 handle((int)r.fEdge, r.fPts); in onDraw()
/external/skqp/src/gpu/
DGrTessellator.cpp470 : fEdge(edge), fIsOuterBoundary(isOuterBoundary), fPoint(point), fAlpha(alpha) in Event()
473 Edge* fEdge; member
1686 edge->fEvent->fEdge = nullptr; in reconnect()
1765 if (!fEdge || !fEdge->fTop || !fEdge->fBottom) { in apply()
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()
1773 reconnect_all_overlap_edges(top, dest, fEdge, c); in apply()
1774 reconnect_all_overlap_edges(bottom, dest, fEdge, c); in apply()
1782 disconnect(fEdge); in apply()
[all …]
/external/skia/src/gpu/ops/
DGrAAConvexTessellator.cpp407 switch (e.fEdge) { in extractFromPath()
/external/skia/tests/
DPathTest.cpp5633 REPORTER_ASSERT(r, SkPathEdgeIter::EdgeToVerb(e.fEdge) == v); in test_edger()