Lines Matching refs:left
19 * [ Bottom, X-Intervals, [Left, Right]..., X-Sentinel ]
56 assert_sentinel(runs[3], false); // left
143 bool SkRegion::setRect(int32_t left, int32_t top,
145 if (left >= right || top >= bottom) {
149 fBounds.set(left, top, right, bottom);
255 if (runs[3] == SkRegion::kRunTypeSentinel) { // should be first left...
260 assert_sentinel(runs[3], false); // left
274 assert_sentinel(stop[-4], false); // last left
333 // appear as a left-inteval (runs[0]) and should abort the search.
613 static void assert_valid_pair(int left, int rite)
615 SkASSERT(left == SkRegion::kRunTypeSentinel || left < rite);
618 #define assert_valid_pair(left, rite)
649 int inside, left, rite SK_INIT_TO_AVOID_WARNING;
660 left = a_left;
669 left = b_left;
678 left = a_left; // or b_left
698 SkASSERT(left <= rite);
706 fLeft = left;
724 int left = rec.fLeft;
727 // add left,rite to our dst buffer (checking for coincidence
729 left < rite) { // skip if equal
730 if (firstInterval || dst[-1] < left) {
731 *dst++ = (SkRegion::RunType)(left);
956 intervals: TOP + N * (BOTTOM INTERVALCOUNT LEFT RIGHT SENTINEL) + SENTINEL
1170 // prev-right < next-left. We rely on this optimization in places such as
1190 int left = SK_MaxS32;
1205 if (left > *runs) {
1206 left = *runs;
1225 bounds->fLeft = left;
1389 SkRegion::Spanerator::Spanerator(const SkRegion& rgn, int y, int left,
1397 right > r.fLeft && left < r.fRight) {
1399 if (left < r.fLeft) {
1400 left = r.fLeft;
1405 fLeft = left;
1417 // runs[0..1] is to the left of the span, so continue
1418 if (runs[1] <= left) {
1424 fLeft = left;
1433 bool SkRegion::Spanerator::next(int* left, int* right) {
1440 if (left) {
1441 *left = fLeft;
1458 if (left) {
1459 *left = SkMax32(fLeft, runs[0]);
