epoger@google.com | ec3ed6a | 2011-07-28 14:26:00 +0000 | [diff] [blame] | 1 | |
| 2 | /* |
| 3 | * Copyright 2011 Google Inc. |
| 4 | * |
| 5 | * Use of this source code is governed by a BSD-style license that can be |
| 6 | * found in the LICENSE file. |
| 7 | */ |
reed@google.com | 5c3d147 | 2011-02-22 19:12:23 +0000 | [diff] [blame] | 8 | #ifndef SkClipStack_DEFINED |
| 9 | #define SkClipStack_DEFINED |
| 10 | |
| 11 | #include "SkDeque.h" |
bsalomon@google.com | 8a98e3b | 2012-11-29 21:05:13 +0000 | [diff] [blame] | 12 | #include "SkPath.h" |
| 13 | #include "SkRect.h" |
reed@google.com | 5c3d147 | 2011-02-22 19:12:23 +0000 | [diff] [blame] | 14 | #include "SkRegion.h" |
robertphillips@google.com | 46f9350 | 2012-08-07 15:38:08 +0000 | [diff] [blame] | 15 | #include "SkTDArray.h" |
reed@google.com | 5c3d147 | 2011-02-22 19:12:23 +0000 | [diff] [blame] | 16 | |
reed@google.com | 5c3d147 | 2011-02-22 19:12:23 +0000 | [diff] [blame] | 17 | |
robertphillips@google.com | 4c2a2f7 | 2012-07-24 22:07:50 +0000 | [diff] [blame] | 18 | // Because a single save/restore state can have multiple clips, this class |
| 19 | // stores the stack depth (fSaveCount) and clips (fDeque) separately. |
| 20 | // Each clip in fDeque stores the stack state to which it belongs |
| 21 | // (i.e., the fSaveCount in force when it was added). Restores are thus |
| 22 | // implemented by removing clips from fDeque that have an fSaveCount larger |
| 23 | // then the freshly decremented count. |
ctguil@chromium.org | 7ffb1b2 | 2011-03-15 21:27:08 +0000 | [diff] [blame] | 24 | class SK_API SkClipStack { |
reed@google.com | 5c3d147 | 2011-02-22 19:12:23 +0000 | [diff] [blame] | 25 | public: |
bsalomon@google.com | 8a98e3b | 2012-11-29 21:05:13 +0000 | [diff] [blame] | 26 | enum BoundsType { |
| 27 | // The bounding box contains all the pixels that can be written to |
| 28 | kNormal_BoundsType, |
| 29 | // The bounding box contains all the pixels that cannot be written to. |
| 30 | // The real bound extends out to infinity and all the pixels outside |
| 31 | // of the bound can be written to. Note that some of the pixels inside |
| 32 | // the bound may also be writeable but all pixels that cannot be |
| 33 | // written to are guaranteed to be inside. |
| 34 | kInsideOut_BoundsType |
| 35 | }; |
| 36 | |
| 37 | class Element { |
| 38 | public: |
| 39 | enum Type { |
| 40 | //!< This element makes the clip empty (regardless of previous elements). |
| 41 | kEmpty_Type, |
| 42 | //!< This element combines a rect with the current clip using a set operation |
| 43 | kRect_Type, |
| 44 | //!< This element combines a path with the current clip using a set operation |
| 45 | kPath_Type, |
| 46 | }; |
| 47 | |
| 48 | Element() { |
| 49 | this->initCommon(0, SkRegion::kReplace_Op, false); |
| 50 | this->setEmpty(); |
| 51 | } |
| 52 | |
| 53 | Element(const SkRect& rect, SkRegion::Op op, bool doAA) { |
| 54 | this->initRect(0, rect, op, doAA); |
| 55 | } |
| 56 | |
| 57 | Element(const SkPath& path, SkRegion::Op op, bool doAA) { |
| 58 | this->initPath(0, path, op, doAA); |
| 59 | } |
| 60 | |
bsalomon@google.com | 8182fa0 | 2012-12-04 14:06:06 +0000 | [diff] [blame] | 61 | bool operator== (const Element& element) const { |
| 62 | if (this == &element) { |
| 63 | return true; |
| 64 | } |
| 65 | if (fOp != element.fOp || |
| 66 | fType != element.fType || |
| 67 | fDoAA != element.fDoAA || |
| 68 | fSaveCount != element.fSaveCount) { |
| 69 | return false; |
| 70 | } |
| 71 | switch (fType) { |
| 72 | case kPath_Type: |
| 73 | return fPath == element.fPath; |
| 74 | case kRect_Type: |
| 75 | return fRect == element.fRect; |
| 76 | case kEmpty_Type: |
| 77 | return true; |
| 78 | default: |
| 79 | SkDEBUGFAIL("Unexpected type."); |
| 80 | return false; |
| 81 | } |
| 82 | } |
| 83 | bool operator!= (const Element& element) const { return !(*this == element); } |
| 84 | |
bsalomon@google.com | 8a98e3b | 2012-11-29 21:05:13 +0000 | [diff] [blame] | 85 | //!< Call to get the type of the clip element. |
| 86 | Type getType() const { return fType; } |
| 87 | |
| 88 | //!< Call if getType() is kPath to get the path. |
| 89 | const SkPath& getPath() const { return fPath; } |
| 90 | |
| 91 | //!< Call if getType() is kRect to get the rect. |
| 92 | const SkRect& getRect() const { return fRect; } |
| 93 | |
| 94 | //!< Call if getType() is not kEmpty to get the set operation used to combine this element. |
| 95 | SkRegion::Op getOp() const { return fOp; } |
| 96 | |
| 97 | /** If getType() is not kEmpty this indicates whether the clip shape should be anti-aliased |
| 98 | when it is rasterized. */ |
| 99 | bool isAA() const { return fDoAA; } |
| 100 | |
bsalomon@google.com | c6b3e48 | 2012-12-07 20:43:52 +0000 | [diff] [blame] | 101 | //!< Inverts the fill of the clip shape. Note that a kEmpty element remains kEmpty. |
| 102 | void invertShapeFillType(); |
| 103 | |
| 104 | //!< Sets the set operation represented by the element. |
bsalomon@google.com | 8182fa0 | 2012-12-04 14:06:06 +0000 | [diff] [blame] | 105 | void setOp(SkRegion::Op op) { fOp = op; } |
| 106 | |
bsalomon@google.com | 8a98e3b | 2012-11-29 21:05:13 +0000 | [diff] [blame] | 107 | /** The GenID can be used by clip stack clients to cache representations of the clip. The |
| 108 | ID corresponds to the set of clip elements up to and including this element within the |
| 109 | stack not to the element itself. That is the same clip path in different stacks will |
| 110 | have a different ID since the elements produce different clip result in the context of |
| 111 | their stacks. */ |
| 112 | int32_t getGenID() const { return fGenID; } |
| 113 | |
bsalomon@google.com | 8182fa0 | 2012-12-04 14:06:06 +0000 | [diff] [blame] | 114 | /** |
| 115 | * Gets the bounds of the clip element, either the rect or path bounds. (Whether the shape |
| 116 | * is inverse filled is not considered.) |
| 117 | */ |
| 118 | const SkRect& getBounds() const { |
| 119 | static const SkRect kEmpty = { 0, 0, 0, 0 }; |
| 120 | switch (fType) { |
| 121 | case kRect_Type: |
| 122 | return fRect; |
| 123 | case kPath_Type: |
| 124 | return fPath.getBounds(); |
| 125 | case kEmpty_Type: |
| 126 | return kEmpty; |
| 127 | default: |
| 128 | SkDEBUGFAIL("Unexpected type."); |
| 129 | return kEmpty; |
| 130 | } |
| 131 | } |
| 132 | |
| 133 | /** |
| 134 | * Conservatively checks whether the clip shape contains the rect param. (Whether the shape |
| 135 | * is inverse filled is not considered.) |
| 136 | */ |
| 137 | bool contains(const SkRect& rect) const { |
| 138 | switch (fType) { |
| 139 | case kRect_Type: |
| 140 | return fRect.contains(rect); |
| 141 | case kPath_Type: |
| 142 | return fPath.conservativelyContainsRect(rect); |
| 143 | case kEmpty_Type: |
| 144 | return false; |
| 145 | default: |
| 146 | SkDEBUGFAIL("Unexpected type."); |
| 147 | return false; |
| 148 | } |
| 149 | } |
| 150 | |
| 151 | /** |
| 152 | * Is the clip shape inverse filled. |
| 153 | */ |
| 154 | bool isInverseFilled() const { |
| 155 | return kPath_Type == fType && fPath.isInverseFillType(); |
| 156 | } |
| 157 | |
bsalomon@google.com | 8a98e3b | 2012-11-29 21:05:13 +0000 | [diff] [blame] | 158 | private: |
| 159 | friend class SkClipStack; |
| 160 | |
| 161 | SkPath fPath; |
| 162 | SkRect fRect; |
| 163 | int fSaveCount; // save count of stack when this element was added. |
| 164 | SkRegion::Op fOp; |
| 165 | Type fType; |
| 166 | bool fDoAA; |
| 167 | |
| 168 | /* fFiniteBoundType and fFiniteBound are used to incrementally update the clip stack's |
| 169 | bound. When fFiniteBoundType is kNormal_BoundsType, fFiniteBound represents the |
| 170 | conservative bounding box of the pixels that aren't clipped (i.e., any pixels that can be |
| 171 | drawn to are inside the bound). When fFiniteBoundType is kInsideOut_BoundsType (which |
| 172 | occurs when a clip is inverse filled), fFiniteBound represents the conservative bounding |
| 173 | box of the pixels that _are_ clipped (i.e., any pixels that cannot be drawn to are inside |
| 174 | the bound). When fFiniteBoundType is kInsideOut_BoundsType the actual bound is the |
| 175 | infinite plane. This behavior of fFiniteBoundType and fFiniteBound is required so that we |
| 176 | can capture the cancelling out of the extensions to infinity when two inverse filled |
| 177 | clips are Booleaned together. */ |
| 178 | SkClipStack::BoundsType fFiniteBoundType; |
| 179 | SkRect fFiniteBound; |
skia.committer@gmail.com | c3d7d90 | 2012-11-30 02:01:24 +0000 | [diff] [blame] | 180 | |
bsalomon@google.com | 8a98e3b | 2012-11-29 21:05:13 +0000 | [diff] [blame] | 181 | // When element is applied to the previous elements in the stack is the result known to be |
| 182 | // equivalent to a single rect intersection? IIOW, is the clip effectively a rectangle. |
| 183 | bool fIsIntersectionOfRects; |
| 184 | |
| 185 | int fGenID; |
| 186 | |
| 187 | Element(int saveCount) { |
| 188 | this->initCommon(saveCount, SkRegion::kReplace_Op, false); |
| 189 | this->setEmpty(); |
| 190 | } |
| 191 | |
| 192 | Element(int saveCount, const SkRect& rect, SkRegion::Op op, bool doAA) { |
| 193 | this->initRect(saveCount, rect, op, doAA); |
| 194 | } |
| 195 | |
| 196 | Element(int saveCount, const SkPath& path, SkRegion::Op op, bool doAA) { |
| 197 | this->initPath(saveCount, path, op, doAA); |
| 198 | } |
| 199 | |
| 200 | void initCommon(int saveCount, SkRegion::Op op, bool doAA) { |
| 201 | fSaveCount = saveCount; |
| 202 | fOp = op; |
| 203 | fDoAA = doAA; |
| 204 | // A default of inside-out and empty bounds means the bounds are effectively void as it |
| 205 | // indicates that nothing is known to be outside the clip. |
| 206 | fFiniteBoundType = kInsideOut_BoundsType; |
| 207 | fFiniteBound.setEmpty(); |
| 208 | fIsIntersectionOfRects = false; |
| 209 | fGenID = kInvalidGenID; |
| 210 | } |
| 211 | |
| 212 | void initRect(int saveCount, const SkRect& rect, SkRegion::Op op, bool doAA) { |
| 213 | fRect = rect; |
| 214 | fType = kRect_Type; |
| 215 | this->initCommon(saveCount, op, doAA); |
| 216 | } |
| 217 | |
| 218 | void initPath(int saveCount, const SkPath& path, SkRegion::Op op, bool doAA) { |
| 219 | fPath = path; |
| 220 | fType = kPath_Type; |
| 221 | this->initCommon(saveCount, op, doAA); |
| 222 | } |
| 223 | |
| 224 | void setEmpty() { |
| 225 | fType = kEmpty_Type; |
| 226 | fFiniteBound.setEmpty(); |
| 227 | fFiniteBoundType = kNormal_BoundsType; |
| 228 | fIsIntersectionOfRects = false; |
| 229 | fRect.setEmpty(); |
| 230 | fPath.reset(); |
| 231 | fGenID = kEmptyGenID; |
| 232 | } |
| 233 | |
| 234 | // All Element methods below are only used within SkClipStack.cpp |
| 235 | inline void checkEmpty() const; |
bsalomon@google.com | 8a98e3b | 2012-11-29 21:05:13 +0000 | [diff] [blame] | 236 | inline bool canBeIntersectedInPlace(int saveCount, SkRegion::Op op) const; |
| 237 | /* This method checks to see if two rect clips can be safely merged into one. The issue here |
skia.committer@gmail.com | c3d7d90 | 2012-11-30 02:01:24 +0000 | [diff] [blame] | 238 | is that to be strictly correct all the edges of the resulting rect must have the same |
bsalomon@google.com | 8a98e3b | 2012-11-29 21:05:13 +0000 | [diff] [blame] | 239 | anti-aliasing. */ |
| 240 | bool rectRectIntersectAllowed(const SkRect& newR, bool newAA) const; |
| 241 | /** Determines possible finite bounds for the Element given the previous element of the |
| 242 | stack */ |
| 243 | void updateBoundAndGenID(const Element* prior); |
| 244 | // The different combination of fill & inverse fill when combining bounding boxes |
| 245 | enum FillCombo { |
| 246 | kPrev_Cur_FillCombo, |
| 247 | kPrev_InvCur_FillCombo, |
| 248 | kInvPrev_Cur_FillCombo, |
| 249 | kInvPrev_InvCur_FillCombo |
| 250 | }; |
| 251 | // per-set operation functions used by updateBoundAndGenID(). |
| 252 | inline void combineBoundsDiff(FillCombo combination, const SkRect& prevFinite); |
| 253 | inline void combineBoundsXOR(int combination, const SkRect& prevFinite); |
| 254 | inline void combineBoundsUnion(int combination, const SkRect& prevFinite); |
| 255 | inline void combineBoundsIntersection(int combination, const SkRect& prevFinite); |
| 256 | inline void combineBoundsRevDiff(int combination, const SkRect& prevFinite); |
| 257 | }; |
| 258 | |
reed@google.com | 5c3d147 | 2011-02-22 19:12:23 +0000 | [diff] [blame] | 259 | SkClipStack(); |
vandebo@chromium.org | 1e1c36f | 2011-05-03 16:26:09 +0000 | [diff] [blame] | 260 | SkClipStack(const SkClipStack& b); |
robertphillips@google.com | cc6493b | 2012-07-26 18:39:13 +0000 | [diff] [blame] | 261 | explicit SkClipStack(const SkRect& r); |
robertphillips@google.com | 641f8b1 | 2012-07-31 19:15:58 +0000 | [diff] [blame] | 262 | explicit SkClipStack(const SkIRect& r); |
vandebo@chromium.org | 610f716 | 2012-03-14 18:34:15 +0000 | [diff] [blame] | 263 | ~SkClipStack(); |
reed@google.com | 5c3d147 | 2011-02-22 19:12:23 +0000 | [diff] [blame] | 264 | |
vandebo@chromium.org | 1e1c36f | 2011-05-03 16:26:09 +0000 | [diff] [blame] | 265 | SkClipStack& operator=(const SkClipStack& b); |
| 266 | bool operator==(const SkClipStack& b) const; |
| 267 | bool operator!=(const SkClipStack& b) const { return !(*this == b); } |
| 268 | |
reed@google.com | 5c3d147 | 2011-02-22 19:12:23 +0000 | [diff] [blame] | 269 | void reset(); |
| 270 | |
| 271 | int getSaveCount() const { return fSaveCount; } |
| 272 | void save(); |
| 273 | void restore(); |
| 274 | |
robertphillips@google.com | 607fe07 | 2012-07-24 13:54:00 +0000 | [diff] [blame] | 275 | /** |
| 276 | * getBounds places the current finite bound in its first parameter. In its |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 277 | * second, it indicates which kind of bound is being returned. If |
robertphillips@google.com | 7b11289 | 2012-07-31 15:18:21 +0000 | [diff] [blame] | 278 | * 'canvFiniteBound' is a normal bounding box then it encloses all writeable |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 279 | * pixels. If 'canvFiniteBound' is an inside out bounding box then it |
robertphillips@google.com | 607fe07 | 2012-07-24 13:54:00 +0000 | [diff] [blame] | 280 | * encloses all the un-writeable pixels and the true/normal bound is the |
robertphillips@google.com | 4c2a2f7 | 2012-07-24 22:07:50 +0000 | [diff] [blame] | 281 | * infinite plane. isIntersectionOfRects is an optional parameter |
robertphillips@google.com | 7b11289 | 2012-07-31 15:18:21 +0000 | [diff] [blame] | 282 | * that is true if 'canvFiniteBound' resulted from an intersection of rects. |
robertphillips@google.com | 607fe07 | 2012-07-24 13:54:00 +0000 | [diff] [blame] | 283 | */ |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 284 | void getBounds(SkRect* canvFiniteBound, |
robertphillips@google.com | 4c2a2f7 | 2012-07-24 22:07:50 +0000 | [diff] [blame] | 285 | BoundsType* boundType, |
| 286 | bool* isIntersectionOfRects = NULL) const; |
robertphillips@google.com | 607fe07 | 2012-07-24 13:54:00 +0000 | [diff] [blame] | 287 | |
bsalomon@google.com | 3ab43d5 | 2012-10-11 19:39:09 +0000 | [diff] [blame] | 288 | /** |
| 289 | * Takes an input rect in device space and conservatively clips it to the |
| 290 | * clip-stack. If false is returned then the rect does not intersect the |
| 291 | * clip and is unmodified. |
| 292 | */ |
| 293 | bool intersectRectWithClip(SkRect* devRect) const; |
| 294 | |
junov@chromium.org | 8cdf0f5 | 2012-12-12 17:58:15 +0000 | [diff] [blame^] | 295 | /** |
| 296 | * Returns true if the input rect in device space is entirely contained |
| 297 | * by the clip. A return value of false does not guarantee that the rect |
| 298 | * is not contained by the clip. |
| 299 | */ |
| 300 | bool quickContains(const SkRect& devRect) const; |
| 301 | |
reed@google.com | 115d931 | 2012-05-16 18:50:40 +0000 | [diff] [blame] | 302 | void clipDevRect(const SkIRect& ir, SkRegion::Op op) { |
reed@google.com | 5c3d147 | 2011-02-22 19:12:23 +0000 | [diff] [blame] | 303 | SkRect r; |
| 304 | r.set(ir); |
reed@google.com | 0017708 | 2011-10-12 14:34:30 +0000 | [diff] [blame] | 305 | this->clipDevRect(r, op, false); |
reed@google.com | 5c3d147 | 2011-02-22 19:12:23 +0000 | [diff] [blame] | 306 | } |
reed@google.com | 0017708 | 2011-10-12 14:34:30 +0000 | [diff] [blame] | 307 | void clipDevRect(const SkRect&, SkRegion::Op, bool doAA); |
| 308 | void clipDevPath(const SkPath&, SkRegion::Op, bool doAA); |
reed@google.com | 0557d9e | 2012-08-16 15:59:59 +0000 | [diff] [blame] | 309 | // An optimized version of clipDevRect(emptyRect, kIntersect, ...) |
| 310 | void clipEmpty(); |
reed@google.com | 5c3d147 | 2011-02-22 19:12:23 +0000 | [diff] [blame] | 311 | |
robertphillips@google.com | cc6493b | 2012-07-26 18:39:13 +0000 | [diff] [blame] | 312 | /** |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 313 | * isWideOpen returns true if the clip state corresponds to the infinite |
robertphillips@google.com | cc6493b | 2012-07-26 18:39:13 +0000 | [diff] [blame] | 314 | * plane (i.e., draws are not limited at all) |
| 315 | */ |
| 316 | bool isWideOpen() const; |
| 317 | |
robertphillips@google.com | 46f9350 | 2012-08-07 15:38:08 +0000 | [diff] [blame] | 318 | /** |
| 319 | * Add a callback function that will be called whenever a clip state |
| 320 | * is no longer viable. This will occur whenever restore |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 321 | * is called or when a clipDevRect or clipDevPath call updates the |
robertphillips@google.com | 46f9350 | 2012-08-07 15:38:08 +0000 | [diff] [blame] | 322 | * clip within an existing save/restore state. Each clip state is |
| 323 | * represented by a unique generation ID. |
| 324 | */ |
| 325 | typedef void (*PFPurgeClipCB)(int genID, void* data); |
| 326 | void addPurgeClipCallback(PFPurgeClipCB callback, void* data) const; |
| 327 | |
| 328 | /** |
| 329 | * Remove a callback added earlier via addPurgeClipCallback |
| 330 | */ |
| 331 | void removePurgeClipCallback(PFPurgeClipCB callback, void* data) const; |
| 332 | |
| 333 | /** |
| 334 | * The generation ID has three reserved values to indicate special |
bsalomon@google.com | e8ca6c6 | 2012-11-07 21:19:10 +0000 | [diff] [blame] | 335 | * (potentially ignorable) cases |
robertphillips@google.com | 46f9350 | 2012-08-07 15:38:08 +0000 | [diff] [blame] | 336 | */ |
| 337 | static const int32_t kInvalidGenID = 0; |
| 338 | static const int32_t kEmptyGenID = 1; // no pixels writeable |
| 339 | static const int32_t kWideOpenGenID = 2; // all pixels writeable |
| 340 | |
robertphillips@google.com | 73e7102 | 2012-08-09 18:10:49 +0000 | [diff] [blame] | 341 | int32_t getTopmostGenID() const; |
| 342 | |
robertphillips@google.com | 52cb2c7 | 2012-07-16 18:52:29 +0000 | [diff] [blame] | 343 | public: |
| 344 | class Iter { |
reed@google.com | 5c3d147 | 2011-02-22 19:12:23 +0000 | [diff] [blame] | 345 | public: |
robertphillips@google.com | 52cb2c7 | 2012-07-16 18:52:29 +0000 | [diff] [blame] | 346 | enum IterStart { |
robertphillips@google.com | 80214e2 | 2012-07-20 15:33:18 +0000 | [diff] [blame] | 347 | kBottom_IterStart = SkDeque::Iter::kFront_IterStart, |
| 348 | kTop_IterStart = SkDeque::Iter::kBack_IterStart |
robertphillips@google.com | 52cb2c7 | 2012-07-16 18:52:29 +0000 | [diff] [blame] | 349 | }; |
| 350 | |
bsalomon@google.com | d302f14 | 2011-03-03 13:54:13 +0000 | [diff] [blame] | 351 | /** |
| 352 | * Creates an uninitialized iterator. Must be reset() |
| 353 | */ |
robertphillips@google.com | 52cb2c7 | 2012-07-16 18:52:29 +0000 | [diff] [blame] | 354 | Iter(); |
bsalomon@google.com | d302f14 | 2011-03-03 13:54:13 +0000 | [diff] [blame] | 355 | |
robertphillips@google.com | 52cb2c7 | 2012-07-16 18:52:29 +0000 | [diff] [blame] | 356 | Iter(const SkClipStack& stack, IterStart startLoc); |
reed@google.com | 5c3d147 | 2011-02-22 19:12:23 +0000 | [diff] [blame] | 357 | |
bsalomon@google.com | 8182fa0 | 2012-12-04 14:06:06 +0000 | [diff] [blame] | 358 | /** |
| 359 | * Return the clip element for this iterator. If next()/prev() returns NULL, then the |
| 360 | * iterator is done. |
| 361 | */ |
| 362 | const Element* next(); |
| 363 | const Element* prev(); |
reed@google.com | 5c3d147 | 2011-02-22 19:12:23 +0000 | [diff] [blame] | 364 | |
| 365 | /** |
bsalomon@google.com | 8182fa0 | 2012-12-04 14:06:06 +0000 | [diff] [blame] | 366 | * Moves the iterator to the topmost element with the specified RegionOp and returns that |
| 367 | * element. If no clip element with that op is found, the first element is returned. |
reed@google.com | 5c3d147 | 2011-02-22 19:12:23 +0000 | [diff] [blame] | 368 | */ |
bsalomon@google.com | 8182fa0 | 2012-12-04 14:06:06 +0000 | [diff] [blame] | 369 | const Element* skipToTopmost(SkRegion::Op op); |
robertphillips@google.com | 5836b6d | 2012-07-18 12:06:15 +0000 | [diff] [blame] | 370 | |
| 371 | /** |
bsalomon@google.com | d302f14 | 2011-03-03 13:54:13 +0000 | [diff] [blame] | 372 | * Restarts the iterator on a clip stack. |
| 373 | */ |
robertphillips@google.com | 52cb2c7 | 2012-07-16 18:52:29 +0000 | [diff] [blame] | 374 | void reset(const SkClipStack& stack, IterStart startLoc); |
bsalomon@google.com | d302f14 | 2011-03-03 13:54:13 +0000 | [diff] [blame] | 375 | |
reed@google.com | 5c3d147 | 2011-02-22 19:12:23 +0000 | [diff] [blame] | 376 | private: |
robertphillips@google.com | 5836b6d | 2012-07-18 12:06:15 +0000 | [diff] [blame] | 377 | const SkClipStack* fStack; |
robertphillips@google.com | 5836b6d | 2012-07-18 12:06:15 +0000 | [diff] [blame] | 378 | SkDeque::Iter fIter; |
robertphillips@google.com | 52cb2c7 | 2012-07-16 18:52:29 +0000 | [diff] [blame] | 379 | }; |
| 380 | |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 381 | /** |
robertphillips@google.com | 80214e2 | 2012-07-20 15:33:18 +0000 | [diff] [blame] | 382 | * The B2TIter iterates from the bottom of the stack to the top. |
| 383 | * It inherits privately from Iter to prevent access to reverse iteration. |
| 384 | */ |
| 385 | class B2TIter : private Iter { |
robertphillips@google.com | 52cb2c7 | 2012-07-16 18:52:29 +0000 | [diff] [blame] | 386 | public: |
robertphillips@google.com | 80214e2 | 2012-07-20 15:33:18 +0000 | [diff] [blame] | 387 | B2TIter() {} |
robertphillips@google.com | 52cb2c7 | 2012-07-16 18:52:29 +0000 | [diff] [blame] | 388 | |
| 389 | /** |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 390 | * Wrap Iter's 2 parameter ctor to force initialization to the |
robertphillips@google.com | 80214e2 | 2012-07-20 15:33:18 +0000 | [diff] [blame] | 391 | * beginning of the deque/bottom of the stack |
robertphillips@google.com | 52cb2c7 | 2012-07-16 18:52:29 +0000 | [diff] [blame] | 392 | */ |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 393 | B2TIter(const SkClipStack& stack) |
robertphillips@google.com | 80214e2 | 2012-07-20 15:33:18 +0000 | [diff] [blame] | 394 | : INHERITED(stack, kBottom_IterStart) { |
robertphillips@google.com | 52cb2c7 | 2012-07-16 18:52:29 +0000 | [diff] [blame] | 395 | } |
| 396 | |
robertphillips@google.com | 52cb2c7 | 2012-07-16 18:52:29 +0000 | [diff] [blame] | 397 | using Iter::next; |
| 398 | |
| 399 | /** |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 400 | * Wrap Iter::reset to force initialization to the |
robertphillips@google.com | 80214e2 | 2012-07-20 15:33:18 +0000 | [diff] [blame] | 401 | * beginning of the deque/bottom of the stack |
robertphillips@google.com | 52cb2c7 | 2012-07-16 18:52:29 +0000 | [diff] [blame] | 402 | */ |
| 403 | void reset(const SkClipStack& stack) { |
robertphillips@google.com | 80214e2 | 2012-07-20 15:33:18 +0000 | [diff] [blame] | 404 | this->INHERITED::reset(stack, kBottom_IterStart); |
robertphillips@google.com | 52cb2c7 | 2012-07-16 18:52:29 +0000 | [diff] [blame] | 405 | } |
| 406 | |
| 407 | private: |
| 408 | |
| 409 | typedef Iter INHERITED; |
reed@google.com | 5c3d147 | 2011-02-22 19:12:23 +0000 | [diff] [blame] | 410 | }; |
| 411 | |
robertphillips@google.com | 607fe07 | 2012-07-24 13:54:00 +0000 | [diff] [blame] | 412 | /** |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 413 | * GetConservativeBounds returns a conservative bound of the current clip. |
| 414 | * Since this could be the infinite plane (if inverse fills were involved) the |
| 415 | * maxWidth and maxHeight parameters can be used to limit the returned bound |
robertphillips@google.com | 607fe07 | 2012-07-24 13:54:00 +0000 | [diff] [blame] | 416 | * to the expected drawing area. Similarly, the offsetX and offsetY parameters |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 417 | * allow the caller to offset the returned bound to account for translated |
robertphillips@google.com | 607fe07 | 2012-07-24 13:54:00 +0000 | [diff] [blame] | 418 | * drawing areas (i.e., those resulting from a saveLayer). For finite bounds, |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 419 | * the translation (+offsetX, +offsetY) is applied before the clamp to the |
robertphillips@google.com | 607fe07 | 2012-07-24 13:54:00 +0000 | [diff] [blame] | 420 | * maximum rectangle: [0,maxWidth) x [0,maxHeight). |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 421 | * isIntersectionOfRects is an optional parameter that is true when |
robertphillips@google.com | 641f8b1 | 2012-07-31 19:15:58 +0000 | [diff] [blame] | 422 | * 'devBounds' is the result of an intersection of rects. In this case |
| 423 | * 'devBounds' is the exact answer/clip. |
robertphillips@google.com | 607fe07 | 2012-07-24 13:54:00 +0000 | [diff] [blame] | 424 | */ |
| 425 | void getConservativeBounds(int offsetX, |
| 426 | int offsetY, |
| 427 | int maxWidth, |
| 428 | int maxHeight, |
robertphillips@google.com | 7b11289 | 2012-07-31 15:18:21 +0000 | [diff] [blame] | 429 | SkRect* devBounds, |
robertphillips@google.com | 4c2a2f7 | 2012-07-24 22:07:50 +0000 | [diff] [blame] | 430 | bool* isIntersectionOfRects = NULL) const; |
robertphillips@google.com | 607fe07 | 2012-07-24 13:54:00 +0000 | [diff] [blame] | 431 | |
reed@google.com | 5c3d147 | 2011-02-22 19:12:23 +0000 | [diff] [blame] | 432 | private: |
robertphillips@google.com | 52cb2c7 | 2012-07-16 18:52:29 +0000 | [diff] [blame] | 433 | friend class Iter; |
reed@google.com | 5c3d147 | 2011-02-22 19:12:23 +0000 | [diff] [blame] | 434 | |
| 435 | SkDeque fDeque; |
| 436 | int fSaveCount; |
robertphillips@google.com | 46f9350 | 2012-08-07 15:38:08 +0000 | [diff] [blame] | 437 | |
| 438 | // Generation ID for the clip stack. This is incremented for each |
| 439 | // clipDevRect and clipDevPath call. 0 is reserved to indicate an |
| 440 | // invalid ID. |
| 441 | static int32_t gGenID; |
| 442 | |
| 443 | struct ClipCallbackData { |
| 444 | PFPurgeClipCB fCallback; |
| 445 | void* fData; |
| 446 | |
| 447 | friend bool operator==(const ClipCallbackData& a, |
| 448 | const ClipCallbackData& b) { |
| 449 | return a.fCallback == b.fCallback && a.fData == b.fData; |
| 450 | } |
| 451 | }; |
| 452 | |
| 453 | mutable SkTDArray<ClipCallbackData> fCallbackData; |
| 454 | |
| 455 | /** |
bsalomon@google.com | 9128edc | 2012-11-29 18:58:19 +0000 | [diff] [blame] | 456 | * Invoke all the purge callbacks passing in element's generation ID. |
robertphillips@google.com | 46f9350 | 2012-08-07 15:38:08 +0000 | [diff] [blame] | 457 | */ |
bsalomon@google.com | 9128edc | 2012-11-29 18:58:19 +0000 | [diff] [blame] | 458 | void purgeClip(Element* element); |
robertphillips@google.com | 46f9350 | 2012-08-07 15:38:08 +0000 | [diff] [blame] | 459 | |
| 460 | /** |
| 461 | * Return the next unique generation ID. |
| 462 | */ |
| 463 | static int32_t GetNextGenID(); |
reed@google.com | 5c3d147 | 2011-02-22 19:12:23 +0000 | [diff] [blame] | 464 | }; |
| 465 | |
| 466 | #endif |
| 467 | |