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, 2010, 2011 Apple Inc. All r
ights reserved. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All r
ights reserved. |
6 * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies) | 6 * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies) |
7 * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmo
bile.com/) | 7 * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmo
bile.com/) |
8 * Copyright (C) 2011 Google Inc. All rights reserved. | 8 * Copyright (C) 2011 Google Inc. All rights reserved. |
9 * | 9 * |
10 * This library is free software; you can redistribute it and/or | 10 * This library is free software; you can redistribute it and/or |
(...skipping 49 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
60 else if (node->hasRareData()) { | 60 else if (node->hasRareData()) { |
61 NodeRareData* rareData = node->rareData(); | 61 NodeRareData* rareData = node->rareData(); |
62 if (rareData->nodeLists()) | 62 if (rareData->nodeLists()) |
63 rareData->nodeLists()->adoptTreeScope(); | 63 rareData->nodeLists()->adoptTreeScope(); |
64 } | 64 } |
65 | 65 |
66 if (!node->isElementNode()) | 66 if (!node->isElementNode()) |
67 continue; | 67 continue; |
68 | 68 |
69 if (node->hasSyntheticAttrChildNodes()) { | 69 if (node->hasSyntheticAttrChildNodes()) { |
70 const WillBeHeapVector<RefPtrWillBeMember<Attr> >& attrs = toElement
(node)->attrNodeList(); | 70 WillBeHeapVector<RefPtrWillBeMember<Attr> >& attrs = *toElement(node
)->attrNodeList(); |
71 for (unsigned i = 0; i < attrs.size(); ++i) | 71 for (unsigned i = 0; i < attrs.size(); ++i) |
72 moveTreeToNewScope(*attrs[i]); | 72 moveTreeToNewScope(*attrs[i]); |
73 } | 73 } |
74 | 74 |
75 for (ShadowRoot* shadow = node->youngestShadowRoot(); shadow; shadow = s
hadow->olderShadowRoot()) { | 75 for (ShadowRoot* shadow = node->youngestShadowRoot(); shadow; shadow = s
hadow->olderShadowRoot()) { |
76 shadow->setParentTreeScope(m_newScope); | 76 shadow->setParentTreeScope(m_newScope); |
77 if (willMoveToNewDocument) | 77 if (willMoveToNewDocument) |
78 moveTreeToNewDocument(*shadow, oldDocument, newDocument); | 78 moveTreeToNewDocument(*shadow, oldDocument, newDocument); |
79 } | 79 } |
80 } | 80 } |
(...skipping 54 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
135 #ifndef NDEBUG | 135 #ifndef NDEBUG |
136 didMoveToNewDocumentWasCalled = false; | 136 didMoveToNewDocumentWasCalled = false; |
137 oldDocumentDidMoveToNewDocumentWasCalledWith = &oldDocument; | 137 oldDocumentDidMoveToNewDocumentWasCalledWith = &oldDocument; |
138 #endif | 138 #endif |
139 | 139 |
140 node.didMoveToNewDocument(oldDocument); | 140 node.didMoveToNewDocument(oldDocument); |
141 ASSERT(didMoveToNewDocumentWasCalled); | 141 ASSERT(didMoveToNewDocumentWasCalled); |
142 } | 142 } |
143 | 143 |
144 } | 144 } |
OLD | NEW |