| 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 Apple Inc. All rights reserv
ed. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserv
ed. |
| 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 262 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 273 | 273 |
| 274 void ContainerNode::parserInsertBefore(PassRefPtrWillBeRawPtr<Node> newChild, No
de& nextChild) | 274 void ContainerNode::parserInsertBefore(PassRefPtrWillBeRawPtr<Node> newChild, No
de& nextChild) |
| 275 { | 275 { |
| 276 ASSERT(newChild); | 276 ASSERT(newChild); |
| 277 ASSERT(nextChild.parentNode() == this); | 277 ASSERT(nextChild.parentNode() == this); |
| 278 ASSERT(!newChild->isDocumentFragment()); | 278 ASSERT(!newChild->isDocumentFragment()); |
| 279 ASSERT(!isHTMLTemplateElement(this)); | 279 ASSERT(!isHTMLTemplateElement(this)); |
| 280 | 280 |
| 281 RefPtrWillBeRawPtr<Node> protect(this); | 281 RefPtrWillBeRawPtr<Node> protect(this); |
| 282 | 282 |
| 283 if (nextChild.previousSibling() == newChild || nextChild == newChild) // not
hing to do | 283 if (nextChild.previousSibling() == newChild || &nextChild == newChild) // no
thing to do |
| 284 return; | 284 return; |
| 285 | 285 |
| 286 if (document() != newChild->document()) | 286 if (document() != newChild->document()) |
| 287 document().adoptNode(newChild.get(), ASSERT_NO_EXCEPTION); | 287 document().adoptNode(newChild.get(), ASSERT_NO_EXCEPTION); |
| 288 | 288 |
| 289 insertBeforeCommon(nextChild, *newChild); | 289 insertBeforeCommon(nextChild, *newChild); |
| 290 | 290 |
| 291 newChild->updateAncestorConnectedSubframeCountForInsertion(); | 291 newChild->updateAncestorConnectedSubframeCountForInsertion(); |
| 292 | 292 |
| 293 ChildListMutationScope(*this).childAdded(*newChild); | 293 ChildListMutationScope(*this).childAdded(*newChild); |
| (...skipping 987 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1281 return true; | 1281 return true; |
| 1282 | 1282 |
| 1283 if (node->isElementNode() && toElement(node)->shadow()) | 1283 if (node->isElementNode() && toElement(node)->shadow()) |
| 1284 return true; | 1284 return true; |
| 1285 | 1285 |
| 1286 return false; | 1286 return false; |
| 1287 } | 1287 } |
| 1288 #endif | 1288 #endif |
| 1289 | 1289 |
| 1290 } // namespace WebCore | 1290 } // namespace WebCore |
| OLD | NEW |