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