| Index: Source/core/dom/shadow/InsertionPoint.cpp
|
| diff --git a/Source/core/dom/shadow/InsertionPoint.cpp b/Source/core/dom/shadow/InsertionPoint.cpp
|
| index c26fef579fb1bbdc9d6988a81bc9f62e7102c55d..72c71c3dae2ab7544dfaaed3206bc611b8a906ad 100644
|
| --- a/Source/core/dom/shadow/InsertionPoint.cpp
|
| +++ b/Source/core/dom/shadow/InsertionPoint.cpp
|
| @@ -152,7 +152,7 @@ bool InsertionPoint::isActive() const
|
| return true;
|
|
|
| // Slow path only when there are more than one shadow elements in a shadow tree. That should be a rare case.
|
| - const Vector<RefPtr<InsertionPoint> >& insertionPoints = shadowRoot->descendantInsertionPoints();
|
| + const WillBeHeapVector<RefPtrWillBeMember<InsertionPoint> >& insertionPoints = shadowRoot->descendantInsertionPoints();
|
| for (size_t i = 0; i < insertionPoints.size(); ++i) {
|
| InsertionPoint* point = insertionPoints[i].get();
|
| if (isHTMLShadowElement(*point))
|
| @@ -245,6 +245,12 @@ void InsertionPoint::removedFrom(ContainerNode* insertionPoint)
|
| HTMLElement::removedFrom(insertionPoint);
|
| }
|
|
|
| +void InsertionPoint::trace(Visitor* visitor)
|
| +{
|
| + visitor->trace(m_distribution);
|
| + HTMLElement::trace(visitor);
|
| +}
|
| +
|
| const InsertionPoint* resolveReprojection(const Node* projectedNode)
|
| {
|
| ASSERT(projectedNode);
|
| @@ -266,7 +272,7 @@ const InsertionPoint* resolveReprojection(const Node* projectedNode)
|
| return insertionPoint;
|
| }
|
|
|
| -void collectDestinationInsertionPoints(const Node& node, Vector<InsertionPoint*, 8>& results)
|
| +void collectDestinationInsertionPoints(const Node& node, WillBeHeapVector<RawPtrWillBeMember<InsertionPoint>, 8>& results)
|
| {
|
| const Node* current = &node;
|
| ElementShadow* lastElementShadow = 0;
|
|
|