527     uint16_t fNextIndex;  member
1090         newVertex.fNextIndex = (i + 1) % polygonSize;  in SkIsSimplePolygon()
1095         if (left(polygon[newVertex.fNextIndex], polygon[i])) {  in SkIsSimplePolygon()
1112             if (!sweepLine.insert(v.fPosition, polygon[v.fNextIndex], v.fIndex, v.fNextIndex)) {  in SkIsSimplePolygon()
1120             if (!sweepLine.remove(polygon[v.fNextIndex], v.fPosition, v.fNextIndex, v.fIndex)) {  in SkIsSimplePolygon()
1126                 if (!sweepLine.replace(polygon[v.fPrevIndex], v.fPosition, polygon[v.fNextIndex],  in SkIsSimplePolygon()
1127                                        v.fPrevIndex, v.fIndex, v.fNextIndex)) {  in SkIsSimplePolygon()
1132                 if (!sweepLine.replace(polygon[v.fNextIndex], v.fPosition, polygon[v.fPrevIndex],  in SkIsSimplePolygon()
1133                                        v.fNextIndex, v.fIndex, v.fPrevIndex)) {  in SkIsSimplePolygon()
1451     uint16_t   fNextIndex;  member
1592         SkVector v1 = polygonVerts[p->fNextIndex] - p->fPosition;  in reclassify_vertex()
1636         triangulationVertices[currIndex].fNextIndex = nextIndex;  in SkTriangulateSimplePolygon()
1697             p2 = &triangulationVertices[earVertex->fNextIndex];  in SkTriangulateSimplePolygon()
1726         p0->fNextIndex = earVertex->fNextIndex;  in SkTriangulateSimplePolygon()