Lines Matching refs:Element
20 SkClipStack::Element::Element(const Element& that) { in Element() function in SkClipStack::Element
46 SkClipStack::Element::~Element() { in ~Element()
55 bool SkClipStack::Element::operator== (const Element& element) const { in operator ==()
78 const SkRect& SkClipStack::Element::getBounds() const { in getBounds()
94 bool SkClipStack::Element::contains(const SkRect& rect) const { in contains()
110 bool SkClipStack::Element::contains(const SkRRect& rrect) const { in contains()
127 void SkClipStack::Element::invertShapeFillType() { in invertShapeFillType()
150 void SkClipStack::Element::initCommon(int saveCount, SkClipOp op, bool doAA) { in initCommon()
162 void SkClipStack::Element::initRect(int saveCount, const SkRect& rect, const SkMatrix& m, in initRect()
178 void SkClipStack::Element::initRRect(int saveCount, const SkRRect& rrect, const SkMatrix& m, in initRRect()
196 void SkClipStack::Element::initPath(int saveCount, const SkPath& path, const SkMatrix& m, in initPath()
215 void SkClipStack::Element::initAsPath(int saveCount, const SkPath& path, const SkMatrix& m, in initAsPath()
223 void SkClipStack::Element::asDeviceSpacePath(SkPath* path) const { in asDeviceSpacePath()
243 void SkClipStack::Element::setEmpty() { in setEmpty()
254 void SkClipStack::Element::checkEmpty() const { in checkEmpty()
263 bool SkClipStack::Element::canBeIntersectedInPlace(int saveCount, SkClipOp op) const { in canBeIntersectedInPlace()
275 bool SkClipStack::Element::rectRectIntersectAllowed(const SkRect& newR, bool newAA) const { in rectRectIntersectAllowed()
303 void SkClipStack::Element::combineBoundsDiff(FillCombo combination, const SkRect& prevFinite) { in combineBoundsDiff()
345 void SkClipStack::Element::combineBoundsXOR(int combination, const SkRect& prevFinite) { in combineBoundsXOR()
378 void SkClipStack::Element::combineBoundsUnion(int combination, const SkRect& prevFinite) { in combineBoundsUnion()
408 void SkClipStack::Element::combineBoundsIntersection(int combination, const SkRect& prevFinite) { in combineBoundsIntersection()
439 void SkClipStack::Element::combineBoundsRevDiff(int combination, const SkRect& prevFinite) { in combineBoundsRevDiff()
473 void SkClipStack::Element::updateBoundAndGenID(const Element* prior) { in updateBoundAndGenID()
573 : fDeque(sizeof(Element), kDefaultElementAllocCnt) in SkClipStack()
578 : fDeque(sizeof(Element), storage, size, kDefaultElementAllocCnt) in SkClipStack()
583 : fDeque(sizeof(Element), kDefaultElementAllocCnt) { in SkClipStack()
599 for (const Element* element = (const Element*)recIter.next(); in operator =()
601 element = (const Element*)recIter.next()) { in operator =()
602 new (fDeque.push_back()) Element(*element); in operator =()
618 const Element* myElement = (const Element*)myIter.next(); in operator ==()
619 const Element* bElement = (const Element*)bIter.next(); in operator ==()
625 myElement = (const Element*)myIter.next(); in operator ==()
626 bElement = (const Element*)bIter.next(); in operator ==()
635 Element* element = (Element*)fDeque.back(); in reset()
636 element->~Element(); in reset()
654 Element* element = (Element*)fDeque.back(); in restoreTo()
658 element->~Element(); in restoreTo()
682 Element* element = (Element*)fDeque.back(); in getBounds()
704 const Element* element = iter.prev(); in internalQuickContains()
729 const Element* element = iter.prev(); in internalQuickContains()
758 while (const SkClipStack::Element* element = iter.next()) { in asPath()
760 if (element->getDeviceSpaceType() != SkClipStack::Element::DeviceSpaceType::kEmpty) { in asPath()
780 void SkClipStack::pushElement(const Element& element) { in pushElement()
783 Element* prior = (Element*) iter.prev(); in pushElement()
788 case Element::DeviceSpaceType::kEmpty: in pushElement()
791 case Element::DeviceSpaceType::kRect: in pushElement()
792 if (Element::DeviceSpaceType::kRect == element.getDeviceSpaceType()) { in pushElement()
804 Element* priorPrior = (Element*) iter.prev(); in pushElement()
820 prior = (Element*) fDeque.back(); in pushElement()
823 Element* newElement = new (fDeque.push_back()) Element(element); in pushElement()
829 Element element(fSaveCount, rrect, matrix, op, doAA); in clipRRect()
832 Element restriction(fSaveCount, fClipRestrictionRect, SkMatrix::I(), kIntersect_SkClipOp, in clipRRect()
840 Element element(fSaveCount, rect, matrix, op, doAA); in clipRect()
843 Element restriction(fSaveCount, fClipRestrictionRect, SkMatrix::I(), kIntersect_SkClipOp, in clipRect()
851 Element element(fSaveCount, path, matrix, op, doAA); in clipPath()
854 Element restriction(fSaveCount, fClipRestrictionRect, SkMatrix::I(), kIntersect_SkClipOp, in clipPath()
861 Element* element = (Element*) fDeque.back(); in clipEmpty()
866 new (fDeque.push_back()) Element(fSaveCount); in clipEmpty()
868 ((Element*)fDeque.back())->fGenID = kEmptyGenID; in clipEmpty()
881 const SkClipStack::Element* SkClipStack::Iter::next() { in next()
882 return (const SkClipStack::Element*)fIter.next(); in next()
885 const SkClipStack::Element* SkClipStack::Iter::prev() { in prev()
886 return (const SkClipStack::Element*)fIter.prev(); in prev()
889 const SkClipStack::Element* SkClipStack::Iter::skipToTopmost(SkClipOp op) { in skipToTopmost()
897 const SkClipStack::Element* element = nullptr; in skipToTopmost()
899 for (element = (const SkClipStack::Element*) fIter.prev(); in skipToTopmost()
901 element = (const SkClipStack::Element*) fIter.prev()) { in skipToTopmost()
969 const Element* back = static_cast<const Element*>(fDeque.back()); in isRRect()
970 if (back->getDeviceSpaceType() != SkClipStack::Element::DeviceSpaceType::kRect && in isRRect()
971 back->getDeviceSpaceType() != SkClipStack::Element::DeviceSpaceType::kRRect) { in isRRect()
987 SkAssertResult(static_cast<const Element*>(iter.prev()) == back); in isRRect()
988 while (const Element* prior = (const Element*)iter.prev()) { in isRRect()
1023 const Element* back = static_cast<const Element*>(fDeque.back()); in getTopmostGenID()
1032 void SkClipStack::Element::dump() const { in dump()
1083 const Element* e; in dump()