Lines Matching defs:index
33 static void set_radii(SkVector radii[4], int index, float rad) {
35 radii[index].set(rad, rad);
1639 for (int index = 0; index < (int) (13 * nonFinitePtsCount * axisAlignedPtsCount); ++index) {
1640 int i = (int) (index % nonFinitePtsCount);
1641 int f = (int) (index % axisAlignedPtsCount);
1644 switch (index % 13) {
1663 for (int index = 0; index < (int) (11 * axisAlignedPtsCount); ++index) {
1664 int f = (int) (index % axisAlignedPtsCount);
1667 int curveSelect = index % 11;
1697 for (int index = 0; index < (int) (7 * diagonalPtsCount); ++index) {
1698 int f = (int) (index % diagonalPtsCount);
1701 int curveSelect = index % 11;
2118 int index;
2122 for (index = 1; index < tests[testIndex].fPointCount; ++index) {
2123 path.lineTo(tests[testIndex].fPoints[index].fX, tests[testIndex].fPoints[index].fY);
2161 for (index = 1; index < SkToInt(SK_ARRAY_COUNT(r1)); ++index) {
2162 path1.lineTo(r1[index].fX, r1[index].fY);
2171 for (index = 1; index < SkToInt(SK_ARRAY_COUNT(r1)); ++index) {
2172 if (index == 2) {
2175 path1.lineTo(r1[index].fX, r1[index].fY);
2182 for (index = 1; index < SkToInt(SK_ARRAY_COUNT(r1)); ++index) {
2183 path1.moveTo(r1[index - 1].fX, r1[index - 1].fY);
2184 path1.lineTo(r1[index].fX, r1[index].fY);
2192 for (index = 1; index < SkToInt(SK_ARRAY_COUNT(r1)); ++index) {
2193 if (index == 2) {
2196 path1.lineTo(r1[index].fX, r1[index].fY);
2204 for (index = 1; index < SkToInt(SK_ARRAY_COUNT(r1)); ++index) {
2205 if (index == 2) {
2208 path1.lineTo(r1[index].fX, r1[index].fY);
2423 int index;
2431 for (index = 1; index < tests[testIndex].fPointCount; ++index) {
2432 path.lineTo(tests[testIndex].fPoints[index].fX, tests[testIndex].fPoints[index].fY);
2470 for (index = 1; index < SkToInt(SK_ARRAY_COUNT(r1)); ++index) {
2471 path1.lineTo(r1[index].fX, r1[index].fY);
2486 for (index = 1; index < SkToInt(SK_ARRAY_COUNT(r1)); ++index) {
2487 if (index == 2) {
2490 path1.lineTo(r1[index].fX, r1[index].fY);
2503 for (index = 1; index < SkToInt(SK_ARRAY_COUNT(r1)); ++index) {
2504 path1.moveTo(r1[index - 1].fX, r1[index - 1].fY);
2505 path1.lineTo(r1[index].fX, r1[index].fY);
2519 for (index = 1; index < SkToInt(SK_ARRAY_COUNT(r1)); ++index) {
2520 if (index == 2) {
2523 path1.lineTo(r1[index].fX, r1[index].fY);
2537 for (index = 1; index < SkToInt(SK_ARRAY_COUNT(r1)); ++index) {
2538 if (index == 2) {
2541 path1.lineTo(r1[index].fX, r1[index].fY);
3540 // an oval rotated 90 degrees is still an oval. The start index changes from 1 to 2. Direction
4169 for (int index = 1; index < (int) SK_ARRAY_COUNT(qPts); index += 2) {
4170 p.quadTo(qPts[index], qPts[index + 1]);
4176 for (int index = 0; index < (int) SK_ARRAY_COUNT(qPts) - 2; index += 2) {
4177 SkEvalQuadAt(&qPts[index], 0.5f, &halfway, nullptr);
4185 for (int index = 1; index < (int) SK_ARRAY_COUNT(kPts); index += 2) {
4186 p.conicTo(kPts[index], kPts[index + 1], 0.5f);
4191 for (int index = 0; index < (int) SK_ARRAY_COUNT(kPts) - 2; index += 2) {
4192 SkConic conic(&kPts[index], 0.5f);
5214 for (size_t index = 0; index < count; ++index) {
5215 index < 2 ? path.moveTo(points[index]) : path.lineTo(points[index]);
5224 for (size_t index = 0; index < count; ++index) {
5225 switch (verbs[index]) {
5713 int index = (i + j*increment) % 4;
5714 e[j] = p[index];
5873 // There had been a bug when the last moveTo index > 0, the calculated point count was incorrect