Lines Matching refs:currIndex
191 int currIndex = 0; in SkIsConvexPolygon() local
194 SkVector v0 = polygonVerts[currIndex] - polygonVerts[prevIndex]; in SkIsConvexPolygon()
195 SkVector v1 = polygonVerts[nextIndex] - polygonVerts[currIndex]; in SkIsConvexPolygon()
196 SkVector w0 = polygonVerts[currIndex] - origin; in SkIsConvexPolygon()
222 prevIndex = currIndex; in SkIsConvexPolygon()
223 currIndex = nextIndex; in SkIsConvexPolygon()
224 nextIndex = (currIndex + 1) % polygonSize; in SkIsConvexPolygon()
226 v1 = polygonVerts[nextIndex] - polygonVerts[currIndex]; in SkIsConvexPolygon()
447 int currIndex = 0; in SkInsetConvexPolygon() local
452 (*insetPolygon)[currIndex], in SkInsetConvexPolygon()
455 currIndex++; in SkInsetConvexPolygon()
460 if (currIndex >= 1 && in SkInsetConvexPolygon()
461 SkPointPriv::EqualsWithinTolerance((*insetPolygon)[0], (*insetPolygon)[currIndex], in SkInsetConvexPolygon()
1157 uint16_t prevIndex, uint16_t currIndex, uint16_t nextIndex) { in is_reflex_vertex() argument
1159 inputPolygonVerts[currIndex] - inputPolygonVerts[prevIndex], in is_reflex_vertex()
1207 for (int currIndex = 0, prevIndex = inputPolygonSize - 1; in SkOffsetSimplePolygon() local
1208 currIndex < inputPolygonSize; in SkOffsetSimplePolygon()
1209 prevIndex = currIndex, ++currIndex) { in SkOffsetSimplePolygon()
1210 if (!inputPolygonVerts[currIndex].isFinite()) { in SkOffsetSimplePolygon()
1213 int nextIndex = (currIndex + 1) % inputPolygonSize; in SkOffsetSimplePolygon()
1214 if (!compute_offset_vector(inputPolygonVerts[currIndex], inputPolygonVerts[nextIndex], in SkOffsetSimplePolygon()
1215 offset, winding, &normals[currIndex])) { in SkOffsetSimplePolygon()
1218 if (currIndex > 0) { in SkOffsetSimplePolygon()
1221 prevIndex, currIndex, nextIndex)) { in SkOffsetSimplePolygon()
1224 if (!SkComputeRadialSteps(normals[prevIndex], normals[currIndex], offset, in SkOffsetSimplePolygon()
1254 for (int currIndex = 0, prevIndex = inputPolygonSize - 1; in SkOffsetSimplePolygon() local
1255 currIndex < inputPolygonSize; in SkOffsetSimplePolygon()
1256 prevIndex = currIndex, ++currIndex) { in SkOffsetSimplePolygon()
1257 int nextIndex = (currIndex + 1) % inputPolygonSize; in SkOffsetSimplePolygon()
1260 prevIndex, currIndex, nextIndex)) { in SkOffsetSimplePolygon()
1264 if (!SkComputeRadialSteps(prevNormal, normals[currIndex], offset, in SkOffsetSimplePolygon()
1273 inputPolygonVerts[currIndex] + prevNormal, in SkOffsetSimplePolygon()
1274 inputPolygonVerts[currIndex] + currNormal, in SkOffsetSimplePolygon()
1275 currIndex, currIndex); in SkOffsetSimplePolygon()
1285 inputPolygonVerts[currIndex] + prevNormal, in SkOffsetSimplePolygon()
1286 inputPolygonVerts[currIndex] + normals[currIndex], in SkOffsetSimplePolygon()
1287 currIndex, currIndex); in SkOffsetSimplePolygon()
1298 inputPolygonVerts[currIndex] + normals[currIndex], in SkOffsetSimplePolygon()
1299 inputPolygonVerts[nextIndex] + normals[currIndex], in SkOffsetSimplePolygon()
1300 currIndex, nextIndex); in SkOffsetSimplePolygon()
1405 int currIndex = 0; in SkOffsetSimplePolygon() local
1413 (*offsetPolygon)[currIndex], in SkOffsetSimplePolygon()
1419 currIndex++; in SkOffsetSimplePolygon()
1424 if (currIndex >= 1 && in SkOffsetSimplePolygon()
1425 SkPointPriv::EqualsWithinTolerance((*offsetPolygon)[0], (*offsetPolygon)[currIndex], in SkOffsetSimplePolygon()
1629 for (int currIndex = 0; currIndex < polygonSize; ++currIndex) { in SkTriangulateSimplePolygon() local
1630 int nextIndex = (currIndex + 1) % polygonSize; in SkTriangulateSimplePolygon()
1632 triangulationVertices[currIndex] = TriangulationVertex{}; in SkTriangulateSimplePolygon()
1633 triangulationVertices[currIndex].fPosition = polygonVerts[currIndex]; in SkTriangulateSimplePolygon()
1634 triangulationVertices[currIndex].fIndex = currIndex; in SkTriangulateSimplePolygon()
1635 triangulationVertices[currIndex].fPrevIndex = prevIndex; in SkTriangulateSimplePolygon()
1636 triangulationVertices[currIndex].fNextIndex = nextIndex; in SkTriangulateSimplePolygon()
1637 SkVector v1 = polygonVerts[nextIndex] - polygonVerts[currIndex]; in SkTriangulateSimplePolygon()
1639 triangulationVertices[currIndex].fVertexType = TriangulationVertex::VertexType::kConvex; in SkTriangulateSimplePolygon()
1641 triangulationVertices[currIndex].fVertexType = TriangulationVertex::VertexType::kReflex; in SkTriangulateSimplePolygon()
1644 prevIndex = currIndex; in SkTriangulateSimplePolygon()
1656 for (int currIndex = 0; currIndex < polygonSize; prevIndex = currIndex, ++currIndex) { in SkTriangulateSimplePolygon() local
1657 TriangulationVertex::VertexType currType = triangulationVertices[currIndex].fVertexType; in SkTriangulateSimplePolygon()
1659 int nextIndex = (currIndex + 1) % polygonSize; in SkTriangulateSimplePolygon()
1666 convexList.addToHead(&triangulationVertices[currIndex]); in SkTriangulateSimplePolygon()
1668 convexList.addToTail(&triangulationVertices[currIndex]); in SkTriangulateSimplePolygon()
1672 reflexHash.add(&triangulationVertices[currIndex]); in SkTriangulateSimplePolygon()