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