Lines Matching defs:cur
137 for (int cur = 0; cur < fBisectors.count(); prev = cur, ++cur) { in computeBisectors() local
369 for (int cur = 0; cur < fNorms.count(); ++cur) { in extractFromPath() local
385 for (int cur = 0; cur < fNorms.count(); ++cur) { in extractFromPath() local
427 for (int cur = ring.numPts() - 2; cur >= 0; --cur) { in fanRing() local
445 for (int cur = 0; cur < numPts; ++cur) { in createOuterRing() local
600 for (int cur = 0; cur < lastRing.numPts(); ++cur) { in createInsetRing() local
646 for (int cur = 1; cur < lastRing.numPts()-1; ++cur) { in createInsetRing() local
664 int cur = lastRing.numPts()-1; in createInsetRing() local
763 for (int cur = 0; cur < fPts.count(); ++cur) { in computeNormals() local
774 for (int cur = 0; cur < fPts.count(); prev = cur, ++cur) { in computeBisectors() local
798 SkPoint cur = tess.point(fPts[1].fIndex) - tess.point(fPts[0].fIndex); in isConvex() local
963 for (int cur = 0; cur < fPts.count(); ++cur) { in draw() local