Lines Matching refs:insertionPoint
87 void ScopeContentDistribution::setInsertionPointAssignedTo(PassRefPtr<InsertionPoint> insertionPoint)
89 m_insertionPointAssignedTo = insertionPoint;
98 const Vector<RefPtr<InsertionPoint> >& ScopeContentDistribution::ensureInsertionPointList(ShadowRoot* shadowRoot)
117 void ScopeContentDistribution::registerInsertionPoint(InsertionPoint* point)
129 void ScopeContentDistribution::unregisterInsertionPoint(InsertionPoint* point)
153 InsertionPoint* ContentDistributor::findInsertionPointFor(const Node* key) const
167 InsertionPoint* insertionPoint = toInsertionPoint(node);
168 if (insertionPoint->hasDistribution()) {
169 for (size_t i = 0; i < insertionPoint->size(); ++i)
170 populate(insertionPoint->at(i), pool);
172 for (Node* fallbackNode = insertionPoint->firstChild(); fallbackNode; fallbackNode = fallbackNode->nextSibling())
193 const Vector<RefPtr<InsertionPoint> >& insertionPoints = scope->ensureInsertionPointList(root);
195 InsertionPoint* point = insertionPoints[i].get();
232 void ContentDistributor::distributeSelectionsTo(InsertionPoint* insertionPoint, const Vector<Node*>& pool, Vector<bool>& distributed)
240 if (isHTMLContentElement(insertionPoint) && !toHTMLContentElement(insertionPoint)->canSelectNode(pool, i))
245 m_nodeToInsertionPoint.add(child, insertionPoint);
249 insertionPoint->lazyReattachIfAttached();
250 insertionPoint->setDistribution(distribution);
253 void ContentDistributor::distributeNodeChildrenTo(InsertionPoint* insertionPoint, ContainerNode* containerNode)
259 InsertionPoint* innerInsertionPoint = toInsertionPoint(node);
263 m_nodeToInsertionPoint.add(innerInsertionPoint->at(i), insertionPoint);
268 m_nodeToInsertionPoint.add(child, insertionPoint);
273 m_nodeToInsertionPoint.add(node, insertionPoint);
277 insertionPoint->lazyReattachIfAttached();
278 insertionPoint->setDistribution(distribution);
