Lines Matching refs:left
99 assert_sentinel(runs[3], false); // left
289 if (runs[3] == SkRegion_kRunTypeSentinel) { // should be first left...
294 assert_sentinel(runs[3], false); // left
308 assert_sentinel(stop[-4], false); // last left
373 // appear as a left-inteval (runs[0]) and should abort the search.
669 static void assert_valid_pair(int left, int rite)
671 SkASSERT(left == SkRegion_kRunTypeSentinel || left < rite);
674 #define assert_valid_pair(left, rite)
705 int inside, left, rite SK_INIT_TO_AVOID_WARNING;
716 left = a_left;
725 left = b_left;
734 left = a_left; // or b_left
754 SkASSERT(left <= rite);
762 fLeft = left;
791 int left = rec.fLeft;
794 // add left,rite to our dst buffer (checking for coincidence
796 left < rite) { // skip if equal
797 if (firstInterval || *(dst - 1) < left) {
798 *dst++ = (SkRegionPriv::RunType)(left);
1484 SkRegion::Spanerator::Spanerator(const SkRegion& rgn, int y, int left,
1492 right > r.fLeft && left < r.fRight) {
1494 if (left < r.fLeft) {
1495 left = r.fLeft;
1500 fLeft = left;
1512 // runs[0..1] is to the left of the span, so continue
1513 if (runs[1] <= left) {
1519 fLeft = left;
1528 bool SkRegion::Spanerator::next(int* left, int* right) {
1535 if (left) {
1536 *left = fLeft;
1553 if (left) {
1554 *left = std::max(fLeft, runs[0]);