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