Lines Matching defs:count
61 * Data runs are packed [count, alpha]
193 // 2 bytes per segment, where each segment can store up to 255 for count
276 void addRun(int x, int y, U8CPU alpha, int count) {
277 SkASSERT(count > 0);
279 SkASSERT(fBounds.contains(x + count - 1, y));
292 SkASSERT(0 == row->fData->count());
308 AppendRun(data, alpha, count);
309 row->fWidth += count;
385 dataSize += row->fData->count();
398 RunHead* head = RunHead::Alloc(fRows.count(), dataSize);
413 size_t n = row->fData->count();
430 for (y = 0; y < fRows.count(); ++y) {
434 int count = data.count();
435 SkASSERT(!(count & 1));
437 for (int x = 0; x < count; x += 2) {
448 for (int i = 0; i < fRows.count(); ++i) {
452 int count = row.fData->count();
454 SkASSERT(!(count & 1));
456 for (int x = 0; x < count; x += 2) {
479 int count = fRows.count();
480 if (count > 0) {
481 this->flushRowH(&fRows[count - 1]);
483 if (count > 1) {
485 Row* prev = &fRows[count - 2];
486 Row* curr = &fRows[count - 1];
496 fRows.removeShuffle(count - 1);
513 static void AppendRun(SkTDArray<uint8_t>& data, U8CPU alpha, int count) {
515 int n = count;
522 count -= n;
523 } while (count > 0);
763 int count = *runs;
764 if (count <= 0) {
776 int localCount = count;
780 SkASSERT(gap <= count);
784 int right = x + count;
795 runs += count;
796 alpha += count;
797 x += count;
1326 auto appendXRun = [&xArray](uint8_t value, int count) {
1327 SkASSERT(count >= 0);
1328 while (count > 0) {
1329 int n = count;
1336 count -= n;
1361 currY->fOffset = xArray.count();
1367 currY->fOffset = xArray.count();
1384 RunHead* head = RunHead::Alloc(yArray.count(), xArray.bytes());
1599 int count;
1600 row = this->findX(row, left, &count);
1604 if (count >= rectWidth) {
1607 rectWidth -= count;
1609 count = row[0];
1637 // load the next count
1649 // add 1 so we can store the terminating run count of 0
1650 int count = fAAClipBounds.width() + 1;
1653 fScanlineScratch = sk_malloc_throw(count * sizeof(SkPMColor));
1655 fAA = (SkAlpha*)(fRuns + count);