Lines Matching defs:InsertionPoint
32 #include "core/dom/shadow/InsertionPoint.h"
45 InsertionPoint::InsertionPoint(const QualifiedName& tagName, Document& document)
52 InsertionPoint::~InsertionPoint()
56 void InsertionPoint::setDistribution(ContentDistribution& distribution)
99 void InsertionPoint::attach(const AttachContext& context)
113 void InsertionPoint::detach(const AttachContext& context)
121 void InsertionPoint::willRecalcStyle(StyleRecalcChange change)
129 bool InsertionPoint::shouldUseFallbackElements() const
134 bool InsertionPoint::canBeActive() const
138 return !Traversal<InsertionPoint>::firstAncestor(*this);
141 bool InsertionPoint::isActive() const
152 const WillBeHeapVector<RefPtrWillBeMember<InsertionPoint> >& insertionPoints = shadowRoot->descendantInsertionPoints();
154 InsertionPoint* point = insertionPoints[i].get();
161 bool InsertionPoint::isShadowInsertionPoint() const
166 bool InsertionPoint::isContentInsertionPoint() const
171 PassRefPtrWillBeRawPtr<StaticNodeList> InsertionPoint::getDistributedNodes()
183 bool InsertionPoint::rendererIsNeeded(const RenderStyle& style)
188 void InsertionPoint::childrenChanged(const ChildrenChange& change)
197 Node::InsertionNotificationRequest InsertionPoint::insertedInto(ContainerNode* insertionPoint)
199 HTMLElement::insertedInto(insertionPoint);
203 if (canBeActive() && !m_registeredWithShadowRoot && insertionPoint->treeScope().rootNode() == root) {
215 void InsertionPoint::removedFrom(ContainerNode* insertionPoint)
219 root = insertionPoint->containingShadowRoot();
232 if (m_registeredWithShadowRoot && insertionPoint->treeScope().rootNode() == root) {
242 HTMLElement::removedFrom(insertionPoint);
245 void InsertionPoint::trace(Visitor* visitor)
251 const InsertionPoint* resolveReprojection(const Node* projectedNode)
254 const InsertionPoint* insertionPoint = 0;
262 const InsertionPoint* insertedTo = shadow->finalDestinationInsertionPointFor(projectedNode);
267 insertionPoint = insertedTo;
269 return insertionPoint;
272 void collectDestinationInsertionPoints(const Node& node, WillBeHeapVector<RawPtrWillBeMember<InsertionPoint>, 8>& results)
