Lines Matching refs:currIndex
180 int currIndex = 0; in SkIsConvexPolygon() local
183 SkVector v0 = polygonVerts[currIndex] - polygonVerts[prevIndex]; in SkIsConvexPolygon()
184 SkVector v1 = polygonVerts[nextIndex] - polygonVerts[currIndex]; in SkIsConvexPolygon()
185 SkVector w0 = polygonVerts[currIndex] - origin; in SkIsConvexPolygon()
211 prevIndex = currIndex; in SkIsConvexPolygon()
212 currIndex = nextIndex; in SkIsConvexPolygon()
213 nextIndex = (currIndex + 1) % polygonSize; in SkIsConvexPolygon()
215 v1 = polygonVerts[nextIndex] - polygonVerts[currIndex]; in SkIsConvexPolygon()
436 int currIndex = 0; in SkInsetConvexPolygon() local
441 (*insetPolygon)[currIndex], in SkInsetConvexPolygon()
444 currIndex++; in SkInsetConvexPolygon()
449 if (currIndex >= 1 && in SkInsetConvexPolygon()
450 SkPointPriv::EqualsWithinTolerance((*insetPolygon)[0], (*insetPolygon)[currIndex], in SkInsetConvexPolygon()
1140 uint16_t prevIndex, uint16_t currIndex, uint16_t nextIndex) { in is_reflex_vertex() argument
1142 inputPolygonVerts[currIndex] - inputPolygonVerts[prevIndex], in is_reflex_vertex()
1181 for (int currIndex = 0, prevIndex = inputPolygonSize - 1; in SkOffsetSimplePolygon() local
1182 currIndex < inputPolygonSize; in SkOffsetSimplePolygon()
1183 prevIndex = currIndex, ++currIndex) { in SkOffsetSimplePolygon()
1184 if (!inputPolygonVerts[currIndex].isFinite()) { in SkOffsetSimplePolygon()
1187 int nextIndex = (currIndex + 1) % inputPolygonSize; in SkOffsetSimplePolygon()
1188 if (!compute_offset_vector(inputPolygonVerts[currIndex], inputPolygonVerts[nextIndex], in SkOffsetSimplePolygon()
1189 offset, winding, &normals[currIndex])) { in SkOffsetSimplePolygon()
1192 if (currIndex > 0) { in SkOffsetSimplePolygon()
1195 prevIndex, currIndex, nextIndex)) { in SkOffsetSimplePolygon()
1198 if (!SkComputeRadialSteps(normals[prevIndex], normals[currIndex], offset, in SkOffsetSimplePolygon()
1228 for (int currIndex = 0, prevIndex = inputPolygonSize - 1; in SkOffsetSimplePolygon() local
1229 currIndex < inputPolygonSize; in SkOffsetSimplePolygon()
1230 prevIndex = currIndex, ++currIndex) { in SkOffsetSimplePolygon()
1231 int nextIndex = (currIndex + 1) % inputPolygonSize; in SkOffsetSimplePolygon()
1234 prevIndex, currIndex, nextIndex)) { in SkOffsetSimplePolygon()
1238 if (!SkComputeRadialSteps(prevNormal, normals[currIndex], offset, in SkOffsetSimplePolygon()
1247 inputPolygonVerts[currIndex] + prevNormal, in SkOffsetSimplePolygon()
1248 inputPolygonVerts[currIndex] + currNormal, in SkOffsetSimplePolygon()
1249 currIndex, currIndex); in SkOffsetSimplePolygon()
1259 inputPolygonVerts[currIndex] + prevNormal, in SkOffsetSimplePolygon()
1260 inputPolygonVerts[currIndex] + normals[currIndex], in SkOffsetSimplePolygon()
1261 currIndex, currIndex); in SkOffsetSimplePolygon()
1272 inputPolygonVerts[currIndex] + normals[currIndex], in SkOffsetSimplePolygon()
1273 inputPolygonVerts[nextIndex] + normals[currIndex], in SkOffsetSimplePolygon()
1274 currIndex, nextIndex); in SkOffsetSimplePolygon()
1379 int currIndex = 0; in SkOffsetSimplePolygon() local
1387 (*offsetPolygon)[currIndex], in SkOffsetSimplePolygon()
1393 currIndex++; in SkOffsetSimplePolygon()
1398 if (currIndex >= 1 && in SkOffsetSimplePolygon()
1399 SkPointPriv::EqualsWithinTolerance((*offsetPolygon)[0], (*offsetPolygon)[currIndex], in SkOffsetSimplePolygon()
1603 for (int currIndex = 0; currIndex < polygonSize; ++currIndex) { in SkTriangulateSimplePolygon() local
1604 int nextIndex = (currIndex + 1) % polygonSize; in SkTriangulateSimplePolygon()
1606 SkDEBUGCODE(memset(&triangulationVertices[currIndex], 0, sizeof(TriangulationVertex))); in SkTriangulateSimplePolygon()
1607 triangulationVertices[currIndex].fPosition = polygonVerts[currIndex]; in SkTriangulateSimplePolygon()
1608 triangulationVertices[currIndex].fIndex = currIndex; in SkTriangulateSimplePolygon()
1609 triangulationVertices[currIndex].fPrevIndex = prevIndex; in SkTriangulateSimplePolygon()
1610 triangulationVertices[currIndex].fNextIndex = nextIndex; in SkTriangulateSimplePolygon()
1611 SkVector v1 = polygonVerts[nextIndex] - polygonVerts[currIndex]; in SkTriangulateSimplePolygon()
1613 triangulationVertices[currIndex].fVertexType = TriangulationVertex::VertexType::kConvex; in SkTriangulateSimplePolygon()
1615 triangulationVertices[currIndex].fVertexType = TriangulationVertex::VertexType::kReflex; in SkTriangulateSimplePolygon()
1618 prevIndex = currIndex; in SkTriangulateSimplePolygon()
1630 for (int currIndex = 0; currIndex < polygonSize; prevIndex = currIndex, ++currIndex) { in SkTriangulateSimplePolygon() local
1631 TriangulationVertex::VertexType currType = triangulationVertices[currIndex].fVertexType; in SkTriangulateSimplePolygon()
1633 int nextIndex = (currIndex + 1) % polygonSize; in SkTriangulateSimplePolygon()
1640 convexList.addToHead(&triangulationVertices[currIndex]); in SkTriangulateSimplePolygon()
1642 convexList.addToTail(&triangulationVertices[currIndex]); in SkTriangulateSimplePolygon()
1646 reflexHash.add(&triangulationVertices[currIndex]); in SkTriangulateSimplePolygon()