Lines Matching refs:Element
19 SkClipStack::Element::Element(const Element& that) { in Element() function in SkClipStack::Element
45 SkClipStack::Element::~Element() { in ~Element()
54 bool SkClipStack::Element::operator== (const Element& element) const { in operator ==()
77 const SkRect& SkClipStack::Element::getBounds() const { in getBounds()
93 bool SkClipStack::Element::contains(const SkRect& rect) const { in contains()
109 bool SkClipStack::Element::contains(const SkRRect& rrect) const { in contains()
126 void SkClipStack::Element::invertShapeFillType() { in invertShapeFillType()
149 void SkClipStack::Element::initCommon(int saveCount, SkClipOp op, bool doAA) { in initCommon()
161 void SkClipStack::Element::initRect(int saveCount, const SkRect& rect, const SkMatrix& m, in initRect()
177 void SkClipStack::Element::initRRect(int saveCount, const SkRRect& rrect, const SkMatrix& m, in initRRect()
195 void SkClipStack::Element::initPath(int saveCount, const SkPath& path, const SkMatrix& m, in initPath()
214 void SkClipStack::Element::initAsPath(int saveCount, const SkPath& path, const SkMatrix& m, in initAsPath()
222 void SkClipStack::Element::asDeviceSpacePath(SkPath* path) const { in asDeviceSpacePath()
242 void SkClipStack::Element::setEmpty() { in setEmpty()
253 void SkClipStack::Element::checkEmpty() const { in checkEmpty()
262 bool SkClipStack::Element::canBeIntersectedInPlace(int saveCount, SkClipOp op) const { in canBeIntersectedInPlace()
274 bool SkClipStack::Element::rectRectIntersectAllowed(const SkRect& newR, bool newAA) const { in rectRectIntersectAllowed()
302 void SkClipStack::Element::combineBoundsDiff(FillCombo combination, const SkRect& prevFinite) { in combineBoundsDiff()
344 void SkClipStack::Element::combineBoundsXOR(int combination, const SkRect& prevFinite) { in combineBoundsXOR()
377 void SkClipStack::Element::combineBoundsUnion(int combination, const SkRect& prevFinite) { in combineBoundsUnion()
407 void SkClipStack::Element::combineBoundsIntersection(int combination, const SkRect& prevFinite) { in combineBoundsIntersection()
438 void SkClipStack::Element::combineBoundsRevDiff(int combination, const SkRect& prevFinite) { in combineBoundsRevDiff()
472 void SkClipStack::Element::updateBoundAndGenID(const Element* prior) { in updateBoundAndGenID()
572 : fDeque(sizeof(Element), kDefaultElementAllocCnt) in SkClipStack()
577 : fDeque(sizeof(Element), storage, size, kDefaultElementAllocCnt) in SkClipStack()
582 : fDeque(sizeof(Element), kDefaultElementAllocCnt) { in SkClipStack()
598 for (const Element* element = (const Element*)recIter.next(); in operator =()
600 element = (const Element*)recIter.next()) { in operator =()
601 new (fDeque.push_back()) Element(*element); in operator =()
617 const Element* myElement = (const Element*)myIter.next(); in operator ==()
618 const Element* bElement = (const Element*)bIter.next(); in operator ==()
624 myElement = (const Element*)myIter.next(); in operator ==()
625 bElement = (const Element*)bIter.next(); in operator ==()
634 Element* element = (Element*)fDeque.back(); in reset()
635 element->~Element(); in reset()
653 Element* element = (Element*)fDeque.back(); in restoreTo()
657 element->~Element(); in restoreTo()
681 Element* element = (Element*)fDeque.back(); in getBounds()
703 const Element* element = iter.prev(); in internalQuickContains()
728 const Element* element = iter.prev(); in internalQuickContains()
750 void SkClipStack::pushElement(const Element& element) { in pushElement()
753 Element* prior = (Element*) iter.prev(); in pushElement()
758 case Element::DeviceSpaceType::kEmpty: in pushElement()
761 case Element::DeviceSpaceType::kRect: in pushElement()
762 if (Element::DeviceSpaceType::kRect == element.getDeviceSpaceType()) { in pushElement()
774 Element* priorPrior = (Element*) iter.prev(); in pushElement()
790 prior = (Element*) fDeque.back(); in pushElement()
793 Element* newElement = new (fDeque.push_back()) Element(element); in pushElement()
799 Element element(fSaveCount, rrect, matrix, op, doAA); in clipRRect()
802 Element restriction(fSaveCount, fClipRestrictionRect, SkMatrix::I(), kIntersect_SkClipOp, in clipRRect()
810 Element element(fSaveCount, rect, matrix, op, doAA); in clipRect()
813 Element restriction(fSaveCount, fClipRestrictionRect, SkMatrix::I(), kIntersect_SkClipOp, in clipRect()
821 Element element(fSaveCount, path, matrix, op, doAA); in clipPath()
824 Element restriction(fSaveCount, fClipRestrictionRect, SkMatrix::I(), kIntersect_SkClipOp, in clipPath()
831 Element* element = (Element*) fDeque.back(); in clipEmpty()
836 new (fDeque.push_back()) Element(fSaveCount); in clipEmpty()
838 ((Element*)fDeque.back())->fGenID = kEmptyGenID; in clipEmpty()
851 const SkClipStack::Element* SkClipStack::Iter::next() { in next()
852 return (const SkClipStack::Element*)fIter.next(); in next()
855 const SkClipStack::Element* SkClipStack::Iter::prev() { in prev()
856 return (const SkClipStack::Element*)fIter.prev(); in prev()
859 const SkClipStack::Element* SkClipStack::Iter::skipToTopmost(SkClipOp op) { in skipToTopmost()
867 const SkClipStack::Element* element = nullptr; in skipToTopmost()
869 for (element = (const SkClipStack::Element*) fIter.prev(); in skipToTopmost()
871 element = (const SkClipStack::Element*) fIter.prev()) { in skipToTopmost()
933 const Element* back = static_cast<const Element*>(fDeque.back()); in isRRect()
945 if (back->getDeviceSpaceType() != SkClipStack::Element::DeviceSpaceType::kRect && in isRRect()
946 back->getDeviceSpaceType() != SkClipStack::Element::DeviceSpaceType::kRRect) { in isRRect()
968 SkAssertResult(static_cast<const Element*>(iter.prev()) == back); in isRRect()
969 while (const Element* prior = (const Element*)iter.prev()) { in isRRect()
1004 const Element* back = static_cast<const Element*>(fDeque.back()); in getTopmostGenID()
1013 void SkClipStack::Element::dump() const { in dump()
1064 const Element* e; in dump()