Lines Matching refs:left
160 // calculated from a arbitrary bit in that byte, calculate the left most bit.
169 // Calculate left byte and mask
289 void SkRectClipBlitter::blitH(int left, int y, int width) {
296 int right = left + width;
298 if (left < fClipRect.fLeft) {
299 left = fClipRect.fLeft;
305 width = right - left;
307 fBlitter->blitH(left, y, width);
311 void SkRectClipBlitter::blitAntiH(int left, int y, const SkAlpha aa[],
313 if (!y_in_rect(y, fClipRect) || left >= fClipRect.fRight) {
317 int x0 = left;
318 int x1 = left + compute_anti_width(runs);
368 void SkRectClipBlitter::blitRect(int left, int y, int width, int height) {
371 r.set(left, y, left + width, y + height);
377 void SkRectClipBlitter::blitAntiRect(int left, int y, int width, int height,
382 r.set(left, y, left + width + 2, y + height);
384 if (r.fLeft != left) {
385 SkASSERT(r.fLeft > left);
388 if (r.fRight != left + width + 2) {
389 SkASSERT(r.fRight < left + width + 2);
395 if (r.fLeft == left) {
398 SkASSERT(r.fLeft == left + width + 1);
426 int left, right;
428 while (span.next(&left, &right)) {
429 SkASSERT(left < right);
430 fBlitter->blitH(left, y, right - left);
438 int left, right;
442 while (span.next(&left, &right)) {
443 SkASSERT(x <= left);
444 SkASSERT(left < right);
445 SkASSERT(left >= bounds.fLeft && right <= bounds.fRight);
447 SkAlphaRuns::Break((int16_t*)runs, (uint8_t*)aa, left - x, right - left);
449 // now zero before left
450 if (left > prevRite) {
453 ((int16_t*)runs)[index] = SkToS16(left - prevRite);
