156 bool SkRegion::op(const SkIRect& rect, const SkRegion& rgn, Op op) {  in op()  argument
159     return this->op(tmp, rgn, op);  in op()
162 bool SkRegion::op(const SkRegion& rgn, const SkIRect& rect, Op op) {  in op()  argument
165     return this->op(rgn, tmp, op);  in op()
379 bool SkRegion::contains(const SkRegion& rgn) const  in contains()
381     if (this->isEmpty() || rgn.isEmpty() || !fBounds.contains(rgn.fBounds))  in contains()
389     tmp.op(*this, rgn, kUnion_Op);  in contains()
436 bool SkRegion::intersects(const SkRegion& rgn) const {  in intersects()
437     if (this->isEmpty() || rgn.isEmpty()) {  in intersects()
441     if (!SkIRect::Intersects(fBounds, rgn.fBounds)) {  in intersects()
445     if (this->isRect() && rgn.isRect()) {  in intersects()
453     return tmp.op(*this, rgn, kIntersect_Op);  in intersects()
1134 SkRegion::Iterator::Iterator(const SkRegion& rgn) {  in Iterator()  argument
1135     this->reset(rgn);  in Iterator()
1146 void SkRegion::Iterator::reset(const SkRegion& rgn) {  in reset()  argument
1147     fRgn = &rgn;  in reset()
1148     if (rgn.isEmpty()) {  in reset()
1152         if (rgn.isRect()) {  in reset()
1153             fRect = rgn.fBounds;  in reset()
1156             fRuns = rgn.fRunHead->readonly_runs();  in reset()
1201 SkRegion::Cliperator::Cliperator(const SkRegion& rgn, const SkIRect& clip)  in Cliperator()  argument
1202         : fIter(rgn), fClip(clip), fDone(true) {  in Cliperator()
1258 SkRegion::Spanerator::Spanerator(const SkRegion& rgn, int y, int left,  in Spanerator()  argument
1260     SkDEBUGCODE(rgn.validate();)  in Spanerator()
1262     const SkIRect& r = rgn.getBounds();  in Spanerator()
1265     if (!rgn.isEmpty() && y >= r.fTop && y < r.fBottom &&  in Spanerator()
1267         if (rgn.isRect()) {  in Spanerator()
1280                                               rgn.fRunHead->readonly_runs(), y);  in Spanerator()