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()
1141 uint16_t prevIndex, uint16_t currIndex, uint16_t nextIndex) { in is_reflex_vertex() argument
1143 inputPolygonVerts[currIndex] - inputPolygonVerts[prevIndex], in is_reflex_vertex()
1191 for (int currIndex = 0, prevIndex = inputPolygonSize - 1; in SkOffsetSimplePolygon() local
1192 currIndex < inputPolygonSize; in SkOffsetSimplePolygon()
1193 prevIndex = currIndex, ++currIndex) { in SkOffsetSimplePolygon()
1194 if (!inputPolygonVerts[currIndex].isFinite()) { in SkOffsetSimplePolygon()
1197 int nextIndex = (currIndex + 1) % inputPolygonSize; in SkOffsetSimplePolygon()
1198 if (!compute_offset_vector(inputPolygonVerts[currIndex], inputPolygonVerts[nextIndex], in SkOffsetSimplePolygon()
1199 offset, winding, &normals[currIndex])) { in SkOffsetSimplePolygon()
1202 if (currIndex > 0) { in SkOffsetSimplePolygon()
1205 prevIndex, currIndex, nextIndex)) { in SkOffsetSimplePolygon()
1208 if (!SkComputeRadialSteps(normals[prevIndex], normals[currIndex], offset, in SkOffsetSimplePolygon()
1238 for (int currIndex = 0, prevIndex = inputPolygonSize - 1; in SkOffsetSimplePolygon() local
1239 currIndex < inputPolygonSize; in SkOffsetSimplePolygon()
1240 prevIndex = currIndex, ++currIndex) { in SkOffsetSimplePolygon()
1241 int nextIndex = (currIndex + 1) % inputPolygonSize; in SkOffsetSimplePolygon()
1244 prevIndex, currIndex, nextIndex)) { in SkOffsetSimplePolygon()
1248 if (!SkComputeRadialSteps(prevNormal, normals[currIndex], offset, in SkOffsetSimplePolygon()
1257 inputPolygonVerts[currIndex] + prevNormal, in SkOffsetSimplePolygon()
1258 inputPolygonVerts[currIndex] + currNormal, in SkOffsetSimplePolygon()
1259 currIndex, currIndex); in SkOffsetSimplePolygon()
1269 inputPolygonVerts[currIndex] + prevNormal, in SkOffsetSimplePolygon()
1270 inputPolygonVerts[currIndex] + normals[currIndex], in SkOffsetSimplePolygon()
1271 currIndex, currIndex); in SkOffsetSimplePolygon()
1282 inputPolygonVerts[currIndex] + normals[currIndex], in SkOffsetSimplePolygon()
1283 inputPolygonVerts[nextIndex] + normals[currIndex], in SkOffsetSimplePolygon()
1284 currIndex, nextIndex); in SkOffsetSimplePolygon()
1389 int currIndex = 0; in SkOffsetSimplePolygon() local
1397 (*offsetPolygon)[currIndex], in SkOffsetSimplePolygon()
1403 currIndex++; in SkOffsetSimplePolygon()
1408 if (currIndex >= 1 && in SkOffsetSimplePolygon()
1409 SkPointPriv::EqualsWithinTolerance((*offsetPolygon)[0], (*offsetPolygon)[currIndex], in SkOffsetSimplePolygon()
1613 for (int currIndex = 0; currIndex < polygonSize; ++currIndex) { in SkTriangulateSimplePolygon() local
1614 int nextIndex = (currIndex + 1) % polygonSize; in SkTriangulateSimplePolygon()
1616 SkDEBUGCODE(memset(&triangulationVertices[currIndex], 0, sizeof(TriangulationVertex))); in SkTriangulateSimplePolygon()
1617 triangulationVertices[currIndex].fPosition = polygonVerts[currIndex]; in SkTriangulateSimplePolygon()
1618 triangulationVertices[currIndex].fIndex = currIndex; in SkTriangulateSimplePolygon()
1619 triangulationVertices[currIndex].fPrevIndex = prevIndex; in SkTriangulateSimplePolygon()
1620 triangulationVertices[currIndex].fNextIndex = nextIndex; in SkTriangulateSimplePolygon()
1621 SkVector v1 = polygonVerts[nextIndex] - polygonVerts[currIndex]; in SkTriangulateSimplePolygon()
1623 triangulationVertices[currIndex].fVertexType = TriangulationVertex::VertexType::kConvex; in SkTriangulateSimplePolygon()
1625 triangulationVertices[currIndex].fVertexType = TriangulationVertex::VertexType::kReflex; in SkTriangulateSimplePolygon()
1628 prevIndex = currIndex; in SkTriangulateSimplePolygon()
1640 for (int currIndex = 0; currIndex < polygonSize; prevIndex = currIndex, ++currIndex) { in SkTriangulateSimplePolygon() local
1641 TriangulationVertex::VertexType currType = triangulationVertices[currIndex].fVertexType; in SkTriangulateSimplePolygon()
1643 int nextIndex = (currIndex + 1) % polygonSize; in SkTriangulateSimplePolygon()
1650 convexList.addToHead(&triangulationVertices[currIndex]); in SkTriangulateSimplePolygon()
1652 convexList.addToTail(&triangulationVertices[currIndex]); in SkTriangulateSimplePolygon()
1656 reflexHash.add(&triangulationVertices[currIndex]); in SkTriangulateSimplePolygon()