43 int SkGetPolygonWinding(const SkPoint* polygonVerts, int polygonSize) {  in SkGetPolygonWinding()  argument
44     if (polygonSize < 3) {  in SkGetPolygonWinding()
51     for (int curr = 2; curr < polygonSize; ++curr) {  in SkGetPolygonWinding()
171 bool SkIsConvexPolygon(const SkPoint* polygonVerts, int polygonSize) {  in SkIsConvexPolygon()  argument
172     if (polygonSize < 3) {  in SkIsConvexPolygon()
179     int prevIndex = polygonSize - 1;  in SkIsConvexPolygon()
187     for (int i = 0; i < polygonSize; ++i) {  in SkIsConvexPolygon()
213         nextIndex = (currIndex + 1) % polygonSize;  in SkIsConvexPolygon()
1049 bool SkIsSimplePolygon(const SkPoint* polygon, int polygonSize) {  in SkIsSimplePolygon()  argument
1050     if (polygonSize < 3) {  in SkIsSimplePolygon()
1055     if (polygonSize > std::numeric_limits<uint16_t>::max()) {  in SkIsSimplePolygon()
1060     if (SkIsConvexPolygon(polygon, polygonSize)) {  in SkIsSimplePolygon()
1064     SkTDPQueue <Vertex, Vertex::Left> vertexQueue(polygonSize);  in SkIsSimplePolygon()
1065     for (int i = 0; i < polygonSize; ++i) {  in SkIsSimplePolygon()
1072         newVertex.fPrevIndex = (i - 1 + polygonSize) % polygonSize;  in SkIsSimplePolygon()
1073         newVertex.fNextIndex = (i + 1) % polygonSize;  in SkIsSimplePolygon()
1086     ActiveEdgeList sweepLine(polygonSize);  in SkIsSimplePolygon()
1576 bool SkTriangulateSimplePolygon(const SkPoint* polygonVerts, uint16_t* indexMap, int polygonSize,  in SkTriangulateSimplePolygon()  argument
1578     if (polygonSize < 3) {  in SkTriangulateSimplePolygon()
1582     if (polygonSize >= std::numeric_limits<uint16_t>::max()) {  in SkTriangulateSimplePolygon()
1588     if (!bounds.setBoundsCheck(polygonVerts, polygonSize)) {  in SkTriangulateSimplePolygon()
1594     int winding = SkGetPolygonWinding(polygonVerts, polygonSize);  in SkTriangulateSimplePolygon()
1600     SkAutoSTMalloc<64, TriangulationVertex> triangulationVertices(polygonSize);  in SkTriangulateSimplePolygon()
1601     int prevIndex = polygonSize - 1;  in SkTriangulateSimplePolygon()
1603     for (int currIndex = 0; currIndex < polygonSize; ++currIndex) {  in SkTriangulateSimplePolygon()
1604         int nextIndex = (currIndex + 1) % polygonSize;  in SkTriangulateSimplePolygon()
1626     if (!reflexHash.init(bounds, polygonSize)) {  in SkTriangulateSimplePolygon()
1629     prevIndex = polygonSize - 1;  in SkTriangulateSimplePolygon()
1630     for (int currIndex = 0; currIndex < polygonSize; prevIndex = currIndex, ++currIndex) {  in SkTriangulateSimplePolygon()
1633             int nextIndex = (currIndex + 1) % polygonSize;  in SkTriangulateSimplePolygon()
1657     triangleIndices->setReserve(triangleIndices->count() + 3 * (polygonSize - 2));  in SkTriangulateSimplePolygon()
1658     int vertexCount = polygonSize;  in SkTriangulateSimplePolygon()