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