| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
| 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
| 4 * (C) 2001 Dirk Mueller (mueller@kde.org) | 4 * (C) 2001 Dirk Mueller (mueller@kde.org) |
| 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2013 Apple Inc. All rights
reserved. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2013 Apple Inc. All rights
reserved. |
| 6 * | 6 * |
| 7 * This library is free software; you can redistribute it and/or | 7 * This library is free software; you can redistribute it and/or |
| 8 * modify it under the terms of the GNU Library General Public | 8 * modify it under the terms of the GNU Library General Public |
| 9 * License as published by the Free Software Foundation; either | 9 * License as published by the Free Software Foundation; either |
| 10 * version 2 of the License, or (at your option) any later version. | 10 * version 2 of the License, or (at your option) any later version. |
| (...skipping 581 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 592 } | 592 } |
| 593 | 593 |
| 594 void ContainerNode::parserRemoveChild(Node& oldChild) | 594 void ContainerNode::parserRemoveChild(Node& oldChild) |
| 595 { | 595 { |
| 596 ASSERT(oldChild.parentNode() == this); | 596 ASSERT(oldChild.parentNode() == this); |
| 597 ASSERT(!oldChild.isDocumentFragment()); | 597 ASSERT(!oldChild.isDocumentFragment()); |
| 598 | 598 |
| 599 Node* prev = oldChild.previousSibling(); | 599 Node* prev = oldChild.previousSibling(); |
| 600 Node* next = oldChild.nextSibling(); | 600 Node* next = oldChild.nextSibling(); |
| 601 | 601 |
| 602 oldChild.updateAncestorConnectedSubframeCountForRemoval(); | 602 if (oldChild.connectedSubframeCount()) |
| 603 ChildFrameDisconnector(oldChild).disconnect(); |
| 603 | 604 |
| 604 ChildListMutationScope(*this).willRemoveChild(oldChild); | 605 ChildListMutationScope(*this).willRemoveChild(oldChild); |
| 605 oldChild.notifyMutationObserversNodeWillDetach(); | 606 oldChild.notifyMutationObserversNodeWillDetach(); |
| 606 | 607 |
| 607 removeBetween(prev, next, oldChild); | 608 removeBetween(prev, next, oldChild); |
| 608 | 609 |
| 609 notifyNodeRemoved(oldChild); | 610 notifyNodeRemoved(oldChild); |
| 610 childrenChanged(ChildrenChange::forRemoval(oldChild, prev, next, ChildrenCha
ngeSourceParser)); | 611 childrenChanged(ChildrenChange::forRemoval(oldChild, prev, next, ChildrenCha
ngeSourceParser)); |
| 611 } | 612 } |
| 612 | 613 |
| (...skipping 851 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1464 return true; | 1465 return true; |
| 1465 | 1466 |
| 1466 if (node->isElementNode() && toElement(node)->shadow()) | 1467 if (node->isElementNode() && toElement(node)->shadow()) |
| 1467 return true; | 1468 return true; |
| 1468 | 1469 |
| 1469 return false; | 1470 return false; |
| 1470 } | 1471 } |
| 1471 #endif | 1472 #endif |
| 1472 | 1473 |
| 1473 } // namespace blink | 1474 } // namespace blink |
| OLD | NEW |