| 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 * | 8 * |
| 9 * This library is free software; you can redistribute it and/or | 9 * This library is free software; you can redistribute it and/or |
| 10 * modify it under the terms of the GNU Library General Public | 10 * modify it under the terms of the GNU Library General Public |
| (...skipping 2077 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2088 const AtomicString& Node::interfaceName() const | 2088 const AtomicString& Node::interfaceName() const |
| 2089 { | 2089 { |
| 2090 return eventNames().interfaceForNode; | 2090 return eventNames().interfaceForNode; |
| 2091 } | 2091 } |
| 2092 | 2092 |
| 2093 ScriptExecutionContext* Node::scriptExecutionContext() const | 2093 ScriptExecutionContext* Node::scriptExecutionContext() const |
| 2094 { | 2094 { |
| 2095 return document(); | 2095 return document(); |
| 2096 } | 2096 } |
| 2097 | 2097 |
| 2098 Node::InsertionNotificationRequest Node::insertedInto(ContainerNode* insertionPo
int) | |
| 2099 { | |
| 2100 ASSERT(insertionPoint->inDocument() || isContainerNode()); | |
| 2101 if (insertionPoint->inDocument()) | |
| 2102 setFlag(InDocumentFlag); | |
| 2103 if (parentOrHostNode()->isInShadowTree()) | |
| 2104 setFlag(IsInShadowTreeFlag); | |
| 2105 return InsertionDone; | |
| 2106 } | |
| 2107 | |
| 2108 void Node::removedFrom(ContainerNode* insertionPoint) | |
| 2109 { | |
| 2110 ASSERT(insertionPoint->inDocument() || isContainerNode()); | |
| 2111 if (insertionPoint->inDocument()) | |
| 2112 clearFlag(InDocumentFlag); | |
| 2113 if (isInShadowTree() && !treeScope()->rootNode()->isShadowRoot()) | |
| 2114 clearFlag(IsInShadowTreeFlag); | |
| 2115 } | |
| 2116 | |
| 2117 void Node::didMoveToNewDocument(Document* oldDocument) | 2098 void Node::didMoveToNewDocument(Document* oldDocument) |
| 2118 { | 2099 { |
| 2119 TreeScopeAdopter::ensureDidMoveToNewDocumentWasCalled(oldDocument); | 2100 TreeScopeAdopter::ensureDidMoveToNewDocumentWasCalled(oldDocument); |
| 2120 | 2101 |
| 2121 // FIXME: Event listener types for this node should be set on the new owner
document here. | 2102 // FIXME: Event listener types for this node should be set on the new owner
document here. |
| 2122 | 2103 |
| 2123 const EventListenerVector& wheelListeners = getEventListeners(eventNames().m
ousewheelEvent); | 2104 const EventListenerVector& wheelListeners = getEventListeners(eventNames().m
ousewheelEvent); |
| 2124 for (size_t i = 0; i < wheelListeners.size(); ++i) { | 2105 for (size_t i = 0; i < wheelListeners.size(); ++i) { |
| 2125 oldDocument->didRemoveWheelEventHandler(); | 2106 oldDocument->didRemoveWheelEventHandler(); |
| 2126 document()->didAddWheelEventHandler(); | 2107 document()->didAddWheelEventHandler(); |
| (...skipping 570 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2697 node->showTreeForThis(); | 2678 node->showTreeForThis(); |
| 2698 } | 2679 } |
| 2699 | 2680 |
| 2700 void showNodePath(const WebCore::Node* node) | 2681 void showNodePath(const WebCore::Node* node) |
| 2701 { | 2682 { |
| 2702 if (node) | 2683 if (node) |
| 2703 node->showNodePathForThis(); | 2684 node->showNodePathForThis(); |
| 2704 } | 2685 } |
| 2705 | 2686 |
| 2706 #endif | 2687 #endif |
| OLD | NEW |