Lines Matching defs:index
57 for (int index = 0; index < chaseArray.count(); ++index) {
58 const SkOpSpanBase* entry = chaseArray[index];
233 for (int index = 0; index < count; ++index) {
234 this->add(dict.fDict[index]);
240 for (int index = 0; index < count; ++index) {
241 CoinDictEntry* entry = &fDict[index];
368 for (int index = 0; index < glitches.fGlitches.count(); ++index) {
369 const SpanGlitch& glitch = glitches.fGlitches[index];
372 for (int index = 0; index < kGlitchType_Count; ++index) {
373 SkDebugf(mask & (1 << index) ? "x" : "-");
376 for (int index = 0; index < glitches.fGlitches.count(); ++index) {
377 const SpanGlitch& glitch = glitches.fGlitches[index];
378 SkDebugf("%02d: ", index);
567 for (int index = 0; index < (int) SK_ARRAY_COUNT(fDebugLoopCount); ++index) {
568 SkIntersections::DebugLoop looper = (SkIntersections::DebugLoop) index;
569 if (fDebugLoopCount[index] >= i->debugLoopCount(looper)) {
572 fDebugLoopCount[index] = i->debugLoopCount(looper);
573 fDebugWorstVerb[index * 2] = wt.segment()->verb();
574 fDebugWorstVerb[index * 2 + 1] = wn.segment()->verb();
575 sk_bzero(&fDebugWorstPts[index * 8], sizeof(SkPoint) * 8);
576 memcpy(&fDebugWorstPts[index * 2 * 4], wt.pts(),
578 memcpy(&fDebugWorstPts[(index * 2 + 1) * 4], wn.pts(),
580 fDebugWorstWeight[index * 2] = wt.weight();
581 fDebugWorstWeight[index * 2 + 1] = wn.weight();
587 for (int index = 0; index < (int) SK_ARRAY_COUNT(fDebugLoopCount); ++index) {
588 if (fDebugLoopCount[index] >= local->fDebugLoopCount[index]) {
591 fDebugLoopCount[index] = local->fDebugLoopCount[index];
592 fDebugWorstVerb[index * 2] = local->fDebugWorstVerb[index * 2];
593 fDebugWorstVerb[index * 2 + 1] = local->fDebugWorstVerb[index * 2 + 1];
594 memcpy(&fDebugWorstPts[index * 2 * 4], &local->fDebugWorstPts[index * 2 * 4],
596 fDebugWorstWeight[index * 2] = local->fDebugWorstWeight[index * 2];
597 fDebugWorstWeight[index * 2 + 1] = local->fDebugWorstWeight[index * 2 + 1];
609 for (int index = 0; index <= ptCount; ++index) {
610 SkDPoint::Dump((&pts)[index]);
611 if (index < ptCount - 1) {
630 for (int index = 0; index < (int) SK_ARRAY_COUNT(fDebugLoopCount); ++index) {
631 SkDebugf("%s: %d\n", loops[index], fDebugLoopCount[index]);
632 dump_curve(fDebugWorstVerb[index * 2], fDebugWorstPts[index * 2 * 4],
633 fDebugWorstWeight[index * 2]);
634 dump_curve(fDebugWorstVerb[index * 2 + 1], fDebugWorstPts[(index * 2 + 1) * 4],
635 fDebugWorstWeight[index * 2 + 1]);
672 void SkIntersections::debugBumpLoopCount(DebugLoop index) {
673 fDebugLoopCount[index]++;
676 int SkIntersections::debugLoopCount(DebugLoop index) const {
677 return fDebugLoopCount[index];
1098 void SkOpSegment::debugSetCoinT(int index, SkScalar t) const {
1099 if (fDebugBaseMax < 0 || fDebugBaseIndex == index) {
1100 fDebugBaseIndex = index;
1106 if (fDebugLastMax < 0 || fDebugLastIndex == index) {
1107 fDebugLastIndex = index;
1487 for (int index = 0; index < i.used(); ++index) {
1488 double t = i[0][index];
1492 SkDPoint oppPt = i.pt(index);
1756 for (int index = 1; index < overlaps.count(); ++index) { // combine overlaps before continuing
1757 const SkCoincidentSpans* test = overlaps[index];
2126 int index = 0;
2129 ++index;
2136 for (int check = 0; check < index; ++check) {
2359 int index = 0;
2361 span->debugSetCoinT(index++);
2550 void SkOpSpanBase::debugSetCoinT(int index) const {
2555 ptT->debugSetCoinT(index);
2683 for (int index = 0; index < fUsed; ++index) {
2684 if (fIsCoincident[0] & (1 << index)) {
2688 if (fIsCoincident[1] & (1 << index)) {
2719 for (int index = 0; index < links; ++index) {
2739 for (int index = 0; index < links; ++index) {
2790 void SkOpPtT::debugSetCoinT(int index) const {
2792 this->segment()->debugSetCoinT(index, fT);
2831 for (int index = 0; index < count; ++index) {
2832 output_scalar(pts[index].fX);
2834 output_scalar(pts[index].fY);
2835 if (index + 1 < count) {