Home
last modified time | relevance | path

Searched refs:earVertex (Results 1 – 2 of 2) sorted by relevance

/external/skqp/src/utils/
DSkPolyUtils.cpp1639 TriangulationVertex* earVertex = nullptr; in SkTriangulateSimplePolygon() local
1645 earVertex = *convexIter; in SkTriangulateSimplePolygon()
1646 SkASSERT(TriangulationVertex::VertexType::kReflex != earVertex->fVertexType); in SkTriangulateSimplePolygon()
1648 p0 = &triangulationVertices[earVertex->fPrevIndex]; in SkTriangulateSimplePolygon()
1649 p2 = &triangulationVertices[earVertex->fNextIndex]; in SkTriangulateSimplePolygon()
1652 bool failed = reflexHash.checkTriangle(p0->fPosition, earVertex->fPosition, in SkTriangulateSimplePolygon()
1670 indices[1] = indexMap[earVertex->fIndex]; in SkTriangulateSimplePolygon()
1674 convexList.remove(earVertex); in SkTriangulateSimplePolygon()
1678 p0->fNextIndex = earVertex->fNextIndex; in SkTriangulateSimplePolygon()
1681 p2->fPrevIndex = earVertex->fPrevIndex; in SkTriangulateSimplePolygon()
/external/skia/src/utils/
DSkPolyUtils.cpp1661 TriangulationVertex* earVertex = nullptr; in SkTriangulateSimplePolygon() local
1667 earVertex = *convexIter; in SkTriangulateSimplePolygon()
1668 SkASSERT(TriangulationVertex::VertexType::kReflex != earVertex->fVertexType); in SkTriangulateSimplePolygon()
1670 p0 = &triangulationVertices[earVertex->fPrevIndex]; in SkTriangulateSimplePolygon()
1671 p2 = &triangulationVertices[earVertex->fNextIndex]; in SkTriangulateSimplePolygon()
1674 bool failed = reflexHash.checkTriangle(p0->fPosition, earVertex->fPosition, in SkTriangulateSimplePolygon()
1692 indices[1] = indexMap[earVertex->fIndex]; in SkTriangulateSimplePolygon()
1696 convexList.remove(earVertex); in SkTriangulateSimplePolygon()
1700 p0->fNextIndex = earVertex->fNextIndex; in SkTriangulateSimplePolygon()
1703 p2->fPrevIndex = earVertex->fPrevIndex; in SkTriangulateSimplePolygon()