check for wide-open inside quickContains

src/core/SkClipStack.cpp

 /*
  * Copyright 2011 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #include "SkAtomics.h"
 #include "SkCanvas.h"
 #include "SkClipStack.h"
@@ skipping 603 matching lines @@
         return;
     }
 
     *canvFiniteBound = element->fFiniteBound;
     *boundType = element->fFiniteBoundType;
     if (isIntersectionOfRects) {
         *isIntersectionOfRects = element->fIsIntersectionOfRects;
     }
 }
 
-bool SkClipStack::quickContains(const SkRect& rect) const {
+bool SkClipStack::internalQuickContains(const SkRect& rect) const {
 
     Iter iter(*this, Iter::kTop_IterStart);
     const Element* element = iter.prev();
     while (element != nullptr) {
         if (SkRegion::kIntersect_Op != element->getOp() && SkRegion::kReplace_Op != element->getOp())
             return false;
         if (element->isInverseFilled()) {
             // Part of 'rect' could be trimmed off by the inverse-filled clip element
             if (SkRect::Intersects(element->getBounds(), rect)) {
                 return false;
             }
         } else {
             if (!element->contains(rect)) {
                 return false;
             }
         }
         if (SkRegion::kReplace_Op == element->getOp()) {
             break;
         }
         element = iter.prev();
     }
     return true;
 }
 
-bool SkClipStack::quickContains(const SkRRect& rrect) const {
+bool SkClipStack::internalQuickContains(const SkRRect& rrect) const {
 
     Iter iter(*this, Iter::kTop_IterStart);
     const Element* element = iter.prev();
     while (element != nullptr) {
         if (SkRegion::kIntersect_Op != element->getOp() && SkRegion::kReplace_Op != element->getOp())
             return false;
         if (element->isInverseFilled()) {
             // Part of 'rrect' could be trimmed off by the inverse-filled clip element
             if (SkRect::Intersects(element->getBounds(), rrect.getBounds())) {
                 return false;
@@ skipping 104 matching lines @@
     Element* element = (Element*) fDeque.back();
 
     if (element && element->canBeIntersectedInPlace(fSaveCount, SkRegion::kIntersect_Op)) {
         element->setEmpty();
     }
     new (fDeque.push_back()) Element(fSaveCount);
 
     ((Element*)fDeque.back())->fGenID = kEmptyGenID;
 }
 
-bool SkClipStack::isWideOpen() const {
-    return this->getTopmostGenID() == kWideOpenGenID;
-}
-
 ///////////////////////////////////////////////////////////////////////////////
 
 SkClipStack::Iter::Iter() : fStack(nullptr) {
 }
 
 SkClipStack::Iter::Iter(const SkClipStack& stack, IterStart startLoc)
     : fStack(&stack) {
     this->reset(stack, startLoc);
 }
 
@@ skipping 148 matching lines @@
 
 void SkClipStack::dump() const {
     B2TIter iter(*this);
     const Element* e;
     while ((e = iter.next())) {
         e->dump();
         SkDebugf("\n");
     }
 }
 #endif