Index: Source/core/dom/ContainerNode.cpp |
diff --git a/Source/core/dom/ContainerNode.cpp b/Source/core/dom/ContainerNode.cpp |
index de26f39296561d3a869f262d17d61db40e0818ac..bb09d26eaa10163977e9b0953145629d828881b0 100644 |
--- a/Source/core/dom/ContainerNode.cpp |
+++ b/Source/core/dom/ContainerNode.cpp |
@@ -103,7 +103,7 @@ void ContainerNode::takeAllChildrenFrom(ContainerNode* oldParent) |
// FIXME: Together with adoptNode above, the tree scope might get updated recursively twice |
// (if the document changed or oldParent was in a shadow tree, AND *this is in a shadow tree). |
// Can we do better? |
- treeScope().adoptIfNeeded(child.get()); |
+ treeScope()->adoptIfNeeded(child.get()); |
parserAppendChild(child.get()); |
} |
} |
@@ -261,7 +261,7 @@ void ContainerNode::insertBefore(PassRefPtr<Node> newChild, Node* refChild, Exce |
if (child->parentNode()) |
break; |
- treeScope().adoptIfNeeded(child); |
+ treeScope()->adoptIfNeeded(child); |
insertBeforeCommon(next.get(), child); |
@@ -389,7 +389,7 @@ void ContainerNode::replaceChild(PassRefPtr<Node> newChild, Node* oldChild, Exce |
if (child->parentNode()) |
break; |
- treeScope().adoptIfNeeded(child); |
+ treeScope()->adoptIfNeeded(child); |
// Add child before "next". |
{ |
@@ -620,7 +620,7 @@ void ContainerNode::appendChild(PassRefPtr<Node> newChild, ExceptionState& es) |
if (child->parentNode()) |
break; |
- treeScope().adoptIfNeeded(child); |
+ treeScope()->adoptIfNeeded(child); |
// Append child to the end of the list |
{ |
@@ -649,7 +649,7 @@ void ContainerNode::parserAppendChild(PassRefPtr<Node> newChild) |
NoEventDispatchAssertion assertNoEventDispatch; |
// FIXME: This method should take a PassRefPtr. |
appendChildToContainer(newChild.get(), this); |
- treeScope().adoptIfNeeded(newChild.get()); |
+ treeScope()->adoptIfNeeded(newChild.get()); |
} |
newChild->updateAncestorConnectedSubframeCountForInsertion(); |