Lines Matching defs:rIndex
241 int rIndex, iIndex;
242 for (rIndex = 0; rIndex < count; ++rIndex) {
243 sLink[rIndex] = eLink[rIndex] = SK_MaxS32;
249 for (rIndex = 0; rIndex < ends - 1; ++rIndex) {
250 const SkOpContour* oContour = runs[rIndex >> 1];
251 const SkPoint& oPt = rIndex & 1 ? oContour->end() : oContour->start();
252 const int row = rIndex < count - 1 ? rIndex * ends : (ends - rIndex - 2)
253 * ends - rIndex - 1;
254 for (iIndex = rIndex + 1; iIndex < ends; ++iIndex) {
265 for (rIndex = 0; rIndex < entries; ++rIndex) {
266 sortedDist[rIndex] = rIndex;
270 for (rIndex = 0; rIndex < entries; ++rIndex) {
271 int pair = sortedDist[rIndex];
298 for (rIndex = 0; rIndex < count; ++rIndex) {
299 int s = sLink[rIndex];
300 int e = eLink[rIndex];
302 s < 0 ? ~s : s, rIndex, rIndex, e < 0 ? 'e' : 's', e < 0 ? ~e : e);
305 rIndex = 0;
309 int sIndex = sLink[rIndex];
311 sLink[rIndex] = SK_MaxS32;
327 const SkOpContour* contour = runs[rIndex];
339 SkDebugf("%s rIndex=%d eIndex=%s%d close=%d\n", __FUNCTION__, rIndex,
341 sIndex == ((rIndex != eIndex) ^ forward ? eIndex : ~eIndex));
343 if (sIndex == ((rIndex != eIndex) ^ forward ? eIndex : ~eIndex)) {
348 eIndex = eLink[rIndex];
350 eLink[rIndex] = SK_MaxS32;
352 SkASSERT(sLink[eIndex] == rIndex);
355 SkASSERT(eLink[~eIndex] == ~rIndex);
359 eIndex = sLink[rIndex];
361 sLink[rIndex] = SK_MaxS32;
363 SkASSERT(eLink[eIndex] == rIndex);
366 SkASSERT(sLink[~eIndex] == ~rIndex);
370 rIndex = eIndex;
371 if (rIndex < 0) {
373 rIndex = ~rIndex;
376 for (rIndex = 0; rIndex < count; ++rIndex) {
377 if (sLink[rIndex] != SK_MaxS32) {
381 } while (rIndex < count);
383 for (rIndex = 0; rIndex < count; ++rIndex) {
384 SkASSERT(sLink[rIndex] == SK_MaxS32);
385 SkASSERT(eLink[rIndex] == SK_MaxS32);
