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);
256 if (runs[3] == SkRegion::kRunTypeSentinel) { // should be first left...
261 assert_sentinel(runs[3], false); // left
275 assert_sentinel(stop[-4], false); // last left
334 // appear as a left-inteval (runs[0]) and should abort the search.
614 static void assert_valid_pair(int left, int rite)
616 SkASSERT(left == SkRegion::kRunTypeSentinel || left < rite);
619 #define assert_valid_pair(left, rite)
650 int inside, left, rite SK_INIT_TO_AVOID_WARNING;
661 left = a_left;
670 left = b_left;
679 left = a_left; // or b_left
699 SkASSERT(left <= rite);
707 fLeft = left;
725 int left = rec.fLeft;
728 // add left,rite to our dst buffer (checking for coincidence
730 left < rite) { // skip if equal
731 if (firstInterval || dst[-1] < left) {
732 *dst++ = (SkRegion::RunType)(left);
957 intervals: TOP + N * (BOTTOM INTERVALCOUNT LEFT RIGHT SENTINEL) + SENTINEL
1174 // prev-right < next-left. We rely on this optimization in places such as
1194 int left = SK_MaxS32;
1209 if (left > *runs) {
1210 left = *runs;
1229 bounds->fLeft = left;
1393 SkRegion::Spanerator::Spanerator(const SkRegion& rgn, int y, int left,
1401 right > r.fLeft && left < r.fRight) {
1403 if (left < r.fLeft) {
1404 left = r.fLeft;
1409 fLeft = left;
1421 // runs[0..1] is to the left of the span, so continue
1422 if (runs[1] <= left) {
1428 fLeft = left;
1437 bool SkRegion::Spanerator::next(int* left, int* right) {
1444 if (left) {
1445 *left = fLeft;
1462 if (left) {
1463 *left = SkMax32(fLeft, runs[0]);
