Lines Matching defs:left
226 // calculated from a arbitrary bit in that byte, calculate the left most bit.
235 // Calculate left byte and mask
302 this->blitRect(r.left(), r.top(), r.width(), r.height());
351 void SkRectClipBlitter::blitH(int left, int y, int width) {
358 int right = left + width;
360 if (left < fClipRect.fLeft) {
361 left = fClipRect.fLeft;
367 width = right - left;
369 fBlitter->blitH(left, y, width);
373 void SkRectClipBlitter::blitAntiH(int left, int y, const SkAlpha aa[],
375 if (!y_in_rect(y, fClipRect) || left >= fClipRect.fRight) {
379 int x0 = left;
380 int x1 = left + compute_anti_width(runs);
430 void SkRectClipBlitter::blitRect(int left, int y, int width, int height) {
433 r.setLTRB(left, y, left + width, y + height);
439 void SkRectClipBlitter::blitAntiRect(int left, int y, int width, int height,
444 r.setLTRB(left, y, left + width + 2, y + height);
446 if (r.fLeft != left) {
447 SkASSERT(r.fLeft > left);
450 if (r.fRight != left + width + 2) {
451 SkASSERT(r.fRight < left + width + 2);
457 if (r.fLeft == left) {
460 SkASSERT(r.fLeft == left + width + 1);
488 int left, right;
490 while (span.next(&left, &right)) {
491 SkASSERT(left < right);
492 fBlitter->blitH(left, y, right - left);
500 int left, right;
504 while (span.next(&left, &right)) {
505 SkASSERT(x <= left);
506 SkASSERT(left < right);
507 SkASSERT(left >= bounds.fLeft && right <= bounds.fRight);
509 SkAlphaRuns::Break((int16_t*)runs, (uint8_t*)aa, left - x, right - left);
511 // now zero before left
512 if (left > prevRite) {
515 ((int16_t*)runs)[index] = SkToS16(left - prevRite);