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];
423 int currIndex = 0;
428 (*insetPolygon)[currIndex],
431 currIndex++;
436 if (currIndex >= 1 &&
437 SkPointPriv::EqualsWithinTolerance((*insetPolygon)[0], (*insetPolygon)[currIndex],
1127 uint16_t prevIndex, uint16_t currIndex, uint16_t nextIndex) {
1129 inputPolygonVerts[currIndex] - inputPolygonVerts[prevIndex],
1159 for (int currIndex = 0, prevIndex = inputPolygonSize - 1;
1160 currIndex < inputPolygonSize;
1161 prevIndex = currIndex, ++currIndex) {
1162 if (!inputPolygonVerts[currIndex].isFinite()) {
1165 int nextIndex = (currIndex + 1) % inputPolygonSize;
1166 if (!compute_offset_vector(inputPolygonVerts[currIndex], inputPolygonVerts[nextIndex],
1167 offset, winding, &normals[currIndex])) {
1170 if (currIndex > 0) {
1173 prevIndex, currIndex, nextIndex)) {
1176 if (!SkComputeRadialSteps(normals[prevIndex], normals[currIndex], offset,
1206 for (int currIndex = 0, prevIndex = inputPolygonSize - 1;
1207 currIndex < inputPolygonSize;
1208 prevIndex = currIndex, ++currIndex) {
1209 int nextIndex = (currIndex + 1) % inputPolygonSize;
1212 prevIndex, currIndex, nextIndex)) {
1216 if (!SkComputeRadialSteps(prevNormal, normals[currIndex], offset,
1225 inputPolygonVerts[currIndex] + prevNormal,
1226 inputPolygonVerts[currIndex] + currNormal,
1227 currIndex, currIndex);
1237 inputPolygonVerts[currIndex] + prevNormal,
1238 inputPolygonVerts[currIndex] + normals[currIndex],
1239 currIndex, currIndex);
1250 inputPolygonVerts[currIndex] + normals[currIndex],
1251 inputPolygonVerts[nextIndex] + normals[currIndex],
1252 currIndex, nextIndex);
1357 int currIndex = 0;
1365 (*offsetPolygon)[currIndex],
1371 currIndex++;
1376 if (currIndex >= 1 &&
1377 SkPointPriv::EqualsWithinTolerance((*offsetPolygon)[0], (*offsetPolygon)[currIndex],
1581 for (int currIndex = 0; currIndex < polygonSize; ++currIndex) {
1582 int nextIndex = (currIndex + 1) % polygonSize;
1584 SkDEBUGCODE(memset(&triangulationVertices[currIndex], 0, sizeof(TriangulationVertex)));
1585 triangulationVertices[currIndex].fPosition = polygonVerts[currIndex];
1586 triangulationVertices[currIndex].fIndex = currIndex;
1587 triangulationVertices[currIndex].fPrevIndex = prevIndex;
1588 triangulationVertices[currIndex].fNextIndex = nextIndex;
1589 SkVector v1 = polygonVerts[nextIndex] - polygonVerts[currIndex];
1591 triangulationVertices[currIndex].fVertexType = TriangulationVertex::VertexType::kConvex;
1593 triangulationVertices[currIndex].fVertexType = TriangulationVertex::VertexType::kReflex;
1596 prevIndex = currIndex;
1608 for (int currIndex = 0; currIndex < polygonSize; prevIndex = currIndex, ++currIndex) {
1609 TriangulationVertex::VertexType currType = triangulationVertices[currIndex].fVertexType;
1611 int nextIndex = (currIndex + 1) % polygonSize;
1618 convexList.addToHead(&triangulationVertices[currIndex]);
1620 convexList.addToTail(&triangulationVertices[currIndex]);
1624 reflexHash.add(&triangulationVertices[currIndex]);
