Lines Matching refs:rIndex
269 int rIndex, iIndex; in assemble() local
270 for (rIndex = 0; rIndex < linkCount; ++rIndex) { in assemble()
271 sLink[rIndex] = eLink[rIndex] = SK_MaxS32; in assemble()
279 for (rIndex = 0; rIndex < endCount - 1; ++rIndex) { in assemble()
280 const SkOpPtT* oPtT = runs[rIndex]; in assemble()
281 for (iIndex = rIndex + 1; iIndex < endCount; ++iIndex) { in assemble()
295 for (rIndex = 0; rIndex < entries; ++rIndex) { in assemble()
296 int pair = sortedDist[rIndex]; in assemble()
322 for (rIndex = 0; rIndex < linkCount; ++rIndex) { in assemble()
323 int s = sLink[rIndex]; in assemble()
324 int e = eLink[rIndex]; in assemble()
326 s < 0 ? ~s : s, rIndex, rIndex, e < 0 ? 'e' : 's', e < 0 ? ~e : e); in assemble()
329 rIndex = 0; in assemble()
333 int sIndex = sLink[rIndex]; in assemble()
335 sLink[rIndex] = SK_MaxS32; in assemble()
351 const SkPath& contour = fPartials[rIndex]; in assemble()
380 SkDebugf("%s rIndex=%d eIndex=%s%d close=%d\n", __FUNCTION__, rIndex, in assemble()
382 sIndex == ((rIndex != eIndex) ^ forward ? eIndex : ~eIndex)); in assemble()
384 if (sIndex == ((rIndex != eIndex) ^ forward ? eIndex : ~eIndex)) { in assemble()
389 eIndex = eLink[rIndex]; in assemble()
391 eLink[rIndex] = SK_MaxS32; in assemble()
393 SkASSERT(sLink[eIndex] == rIndex); in assemble()
396 SkASSERT(eLink[~eIndex] == ~rIndex); in assemble()
400 eIndex = sLink[rIndex]; in assemble()
402 sLink[rIndex] = SK_MaxS32; in assemble()
404 SkASSERT(eLink[eIndex] == rIndex); in assemble()
407 SkASSERT(sLink[~eIndex] == ~rIndex); in assemble()
411 rIndex = eIndex; in assemble()
412 if (rIndex < 0) { in assemble()
414 rIndex = ~rIndex; in assemble()
417 for (rIndex = 0; rIndex < linkCount; ++rIndex) { in assemble()
418 if (sLink[rIndex] != SK_MaxS32) { in assemble()
422 } while (rIndex < linkCount); in assemble()
424 for (rIndex = 0; rIndex < linkCount; ++rIndex) { in assemble()
425 SkASSERT(sLink[rIndex] == SK_MaxS32); in assemble()
426 SkASSERT(eLink[rIndex] == SK_MaxS32); in assemble()