Lines Matching defs:runs
49 const int16_t runs[]) {
74 int runSize = bounds.width() + 1; // +1 so we can set runs[bounds.width()] = 0
76 int16_t* runs = reinterpret_cast<int16_t*>(storage);
77 SkAlpha* alphas = reinterpret_cast<SkAlpha*>(runs + runSize);
79 runs[0] = 1;
80 runs[1] = bounds.width() - 2;
81 runs[bounds.width() - 1] = 1;
82 runs[bounds.width()] = 0;
96 this->blitAntiH(bounds.fLeft, bounds.fTop, alphas, runs);
107 this->blitAntiH(bounds.fLeft, bounds.fBottom - 1, alphas, runs);
115 int16_t runs[2];
116 runs[0] = 1;
117 runs[1] = 0;
120 this->blitAntiH(x, y++, &alpha, runs);
258 int16_t* runs = runStorage.get();
261 sk_memset16((uint16_t*)runs, 1, width);
262 runs[width] = 0;
267 this->blitAntiH(clip.fLeft, y, aa, runs);
311 const int16_t runs[]) {}
327 static int compute_anti_width(const int16_t runs[]) {
331 int count = runs[0];
338 runs += count;
374 const int16_t runs[]) {
380 int x1 = left + compute_anti_width(runs);
389 SkAlphaRuns::BreakAt((int16_t*)runs, (uint8_t*)aa, dx);
390 runs += dx;
395 SkASSERT(x0 < x1 && runs[x1 - x0] == 0);
398 SkAlphaRuns::BreakAt((int16_t*)runs, (uint8_t*)aa, x1 - x0);
399 ((int16_t*)runs)[x1 - x0] = 0;
402 SkASSERT(x0 < x1 && runs[x1 - x0] == 0);
403 SkASSERT(compute_anti_width(runs) == x1 - x0);
405 fBlitter->blitAntiH(x0, y, aa, runs);
497 const int16_t runs[]) {
498 int width = compute_anti_width(runs);
509 SkAlphaRuns::Break((int16_t*)runs, (uint8_t*)aa, left - x, right - left);
514 ((uint8_t*)aa)[index] = 0; // skip runs after right
515 ((int16_t*)runs)[index] = SkToS16(left - prevRite);
522 ((int16_t*)runs)[prevRite - x] = 0;
525 int skip = runs[0];
528 runs += skip;
531 fBlitter->blitAntiH(x, y, aa, runs);
851 void SkRectClipCheckBlitter::blitAntiH(int x, int y, const SkAlpha aa[], const int16_t runs[]) {
852 const int16_t* iter = runs;
855 int width = iter - runs;
857 fBlitter->blitAntiH(x, y, aa, runs);