Lines Matching refs:rgn
156 bool SkRegion::op(const SkIRect& rect, const SkRegion& rgn, Op op) {
159 return this->op(tmp, rgn, op);
162 bool SkRegion::op(const SkRegion& rgn, const SkIRect& rect, Op op) {
165 return this->op(rgn, tmp, op);
291 SkDebugf("setRuns: rgn [");
379 bool SkRegion::contains(const SkRegion& rgn) const
381 if (this->isEmpty() || rgn.isEmpty() || !fBounds.contains(rgn.fBounds))
389 tmp.op(*this, rgn, kUnion_Op);
436 bool SkRegion::intersects(const SkRegion& rgn) const {
437 if (this->isEmpty() || rgn.isEmpty()) {
441 if (!SkIRect::Intersects(fBounds, rgn.fBounds)) {
445 if (this->isRect() && rgn.isRect()) {
453 return tmp.op(*this, rgn, kIntersect_Op);
1116 SkDebugf(" rgn: empty\n");
1119 SkDebugf(" rgn: [%d %d %d %d]", fBounds.fLeft, fBounds.fTop, fBounds.fRight, fBounds.fBottom);
1134 SkRegion::Iterator::Iterator(const SkRegion& rgn) {
1135 this->reset(rgn);
1146 void SkRegion::Iterator::reset(const SkRegion& rgn) {
1147 fRgn = &rgn;
1148 if (rgn.isEmpty()) {
1152 if (rgn.isRect()) {
1153 rgn.fBounds;
1156 fRuns = rgn.fRunHead->readonly_runs();
1194 } else { // end of rgn
1201 SkRegion::Cliperator::Cliperator(const SkRegion& rgn, const SkIRect& clip)
1202 : fIter(rgn), fClip(clip), fDone(true) {
1258 SkRegion::Spanerator::Spanerator(const SkRegion& rgn, int y, int left,
1260 SkDEBUGCODE(rgn.validate();)
1262 const SkIRect& r = rgn.getBounds();
1265 if (!rgn.isEmpty() && y >= r.fTop && y < r.fBottom &&
1267 if (rgn.isRect()) {
1276 fRuns = NULL; // means we're a rect, not a rgn
1280 rgn.fRunHead->readonly_runs(), y);
