Lines Matching defs:bounds
70 RowIter(const uint8_t* row, const SkIRect& bounds) {
72 fLeft = bounds.fLeft;
73 fBoundsRight = bounds.fRight;
75 fRight = bounds.fLeft + row[0];
203 static RunHead* AllocRect(const SkIRect& bounds) {
204 SkASSERT(!bounds.isEmpty());
205 int width = bounds.width();
209 yoff->fY = bounds.height() - 1;
252 Builder(const SkIRect& bounds) : fBounds(bounds) {
254 fWidth = bounds.width();
256 fMinY = bounds.fTop;
769 // we may have to trim the run to our bounds. Previously, we assert that
803 int fLeft; // cache of builder's bounds' left edge
809 * scanlines at the (relative to the bounds it was given). This allows
810 * the builder, during its finish, to trip its bounds down to the "real"
1265 bool SkAAClip::setRect(const SkIRect& bounds) {
1266 if (bounds.isEmpty()) {
1273 fBounds = bounds;
1274 fRunHead = RunHead::AllocRect(bounds);
1316 const SkIRect& bounds = rgn.getBounds();
1317 const int offsetX = bounds.fLeft;
1318 const int offsetY = bounds.fTop;
1323 yArray.setReserve(std::min(bounds.height(), 1024));
1324 xArray.setReserve(std::min(bounds.width(), 512) * 128);
1347 SkASSERT(bounds.contains(r));
1354 appendXRun(0, bounds.width() - prevRight);
1362 appendXRun(0, bounds.width());
1378 SkASSERT(prevRight <= bounds.width());
1381 appendXRun(0, bounds.width() - prevRight);
1389 fBounds = bounds;
1404 // of clip and ibounds, we create the builder with the snug bounds.
1428 SkIRect bounds = fBounds;
1438 if (other.isEmpty() || !bounds.intersect(other.fBounds)) {
1446 SkASSERT(SkIRect::Intersects(bounds, fBounds));
1447 SkASSERT(SkIRect::Intersects(bounds, other.fBounds));
1449 Builder builder(bounds);
1455 // we first see if we can restrict the bounds of new rect to our current
1456 // bounds, or note that the new rect subsumes our current clip.
1486 // Tighten bounds for "path" aaclip of the rect
1503 // We become just the rect intersected with pixel bounds (preserving fractional coords