Lines Matching defs:top
128 int top() const { return fTop; }
282 y -= fBounds.top();
602 int topA = iterA.top();
605 int topB = iterB.top();
612 SkASSERT(iterBot == iter.top());
626 int top, bot;
629 top = topA;
638 top = topB;
646 top = topA; // or topB, since topA == topB
652 if (top >= fBounds.fBottom) {
659 SkASSERT(top < bot);
663 } else if (top >= fBounds.fTop) {
811 * top.
951 dump_one_row(iter.data(), width, iter.bottom() - iter.top() + 1);
1138 // Look to trim away empty rows from the top.
1187 // removing from the bottom is easier than from the top, as we don't
1202 // making us valid after the Builder. Since we build from top to bottom, its
1357 int top = r.fTop - offsetY;
1358 if (top > prevBot) {
1360 currY->fY = top - 1;
1552 y -= fBounds.y(); // our yoffs values are relative to the top
1585 bool SkAAClip::quickContains(int left, int top, int right, int bottom) const {
1589 if (!fBounds.contains(SkIRect{left, top, right, bottom})) {
1594 const uint8_t* row = this->findRow(top, &lastY);