| 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 30 matching lines...) Expand all Loading... |
| 41 #include "core/dom/DocumentType.h" | 41 #include "core/dom/DocumentType.h" |
| 42 #include "core/dom/Element.h" | 42 #include "core/dom/Element.h" |
| 43 #include "core/dom/ElementRareData.h" | 43 #include "core/dom/ElementRareData.h" |
| 44 #include "core/dom/ExceptionCode.h" | 44 #include "core/dom/ExceptionCode.h" |
| 45 #include "core/dom/LiveNodeList.h" | 45 #include "core/dom/LiveNodeList.h" |
| 46 #include "core/dom/NodeRareData.h" | 46 #include "core/dom/NodeRareData.h" |
| 47 #include "core/dom/NodeTraversal.h" | 47 #include "core/dom/NodeTraversal.h" |
| 48 #include "core/dom/ProcessingInstruction.h" | 48 #include "core/dom/ProcessingInstruction.h" |
| 49 #include "core/dom/Range.h" | 49 #include "core/dom/Range.h" |
| 50 #include "core/dom/StaticNodeList.h" | 50 #include "core/dom/StaticNodeList.h" |
| 51 #include "core/dom/TagNodeList.h" | |
| 52 #include "core/dom/TemplateContentDocumentFragment.h" | 51 #include "core/dom/TemplateContentDocumentFragment.h" |
| 53 #include "core/dom/Text.h" | 52 #include "core/dom/Text.h" |
| 54 #include "core/dom/TreeScopeAdopter.h" | 53 #include "core/dom/TreeScopeAdopter.h" |
| 55 #include "core/dom/UserActionElementSet.h" | 54 #include "core/dom/UserActionElementSet.h" |
| 56 #include "core/dom/WheelController.h" | 55 #include "core/dom/WheelController.h" |
| 57 #include "core/dom/shadow/ElementShadow.h" | 56 #include "core/dom/shadow/ElementShadow.h" |
| 58 #include "core/dom/shadow/InsertionPoint.h" | 57 #include "core/dom/shadow/InsertionPoint.h" |
| 59 #include "core/dom/shadow/ShadowRoot.h" | 58 #include "core/dom/shadow/ShadowRoot.h" |
| 60 #include "core/editing/htmlediting.h" | 59 #include "core/editing/htmlediting.h" |
| 61 #include "core/events/BeforeLoadEvent.h" | 60 #include "core/events/BeforeLoadEvent.h" |
| (...skipping 1841 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1903 for (NodeListAtomicNameCacheMap::const_iterator it = m_atomicNameCaches.begi
n(); it != atomicNameCacheEnd; ++it) | 1902 for (NodeListAtomicNameCacheMap::const_iterator it = m_atomicNameCaches.begi
n(); it != atomicNameCacheEnd; ++it) |
| 1904 it->value->invalidateCache(attrName); | 1903 it->value->invalidateCache(attrName); |
| 1905 | 1904 |
| 1906 NodeListNameCacheMap::const_iterator nameCacheEnd = m_nameCaches.end(); | 1905 NodeListNameCacheMap::const_iterator nameCacheEnd = m_nameCaches.end(); |
| 1907 for (NodeListNameCacheMap::const_iterator it = m_nameCaches.begin(); it != n
ameCacheEnd; ++it) | 1906 for (NodeListNameCacheMap::const_iterator it = m_nameCaches.begin(); it != n
ameCacheEnd; ++it) |
| 1908 it->value->invalidateCache(attrName); | 1907 it->value->invalidateCache(attrName); |
| 1909 | 1908 |
| 1910 if (attrName) | 1909 if (attrName) |
| 1911 return; | 1910 return; |
| 1912 | 1911 |
| 1913 TagNodeListCacheNS::iterator tagCacheEnd = m_tagNodeListCacheNS.end(); | 1912 TagCollectionCacheNS::iterator tagCacheEnd = m_tagCollectionCacheNS.end(); |
| 1914 for (TagNodeListCacheNS::iterator it = m_tagNodeListCacheNS.begin(); it != t
agCacheEnd; ++it) | 1913 for (TagCollectionCacheNS::iterator it = m_tagCollectionCacheNS.begin(); it
!= tagCacheEnd; ++it) |
| 1915 it->value->invalidateCache(); | 1914 it->value->invalidateCache(); |
| 1916 } | 1915 } |
| 1917 | 1916 |
| 1918 Node* Node::enclosingLinkEventParentOrSelf() | 1917 Node* Node::enclosingLinkEventParentOrSelf() |
| 1919 { | 1918 { |
| 1920 for (Node* node = this; node; node = node->parentOrShadowHostNode()) { | 1919 for (Node* node = this; node; node = node->parentOrShadowHostNode()) { |
| 1921 // For imagemaps, the enclosing link node is the associated area element
not the image itself. | 1920 // For imagemaps, the enclosing link node is the associated area element
not the image itself. |
| 1922 // So we don't let images be the enclosingLinkNode, even though isLink s
ometimes returns true | 1921 // So we don't let images be the enclosingLinkNode, even though isLink s
ometimes returns true |
| 1923 // for them. | 1922 // for them. |
| 1924 if (node->isLink() && !node->hasTagName(imgTag)) | 1923 if (node->isLink() && !node->hasTagName(imgTag)) |
| (...skipping 636 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2561 node->showTreeForThis(); | 2560 node->showTreeForThis(); |
| 2562 } | 2561 } |
| 2563 | 2562 |
| 2564 void showNodePath(const WebCore::Node* node) | 2563 void showNodePath(const WebCore::Node* node) |
| 2565 { | 2564 { |
| 2566 if (node) | 2565 if (node) |
| 2567 node->showNodePathForThis(); | 2566 node->showNodePathForThis(); |
| 2568 } | 2567 } |
| 2569 | 2568 |
| 2570 #endif | 2569 #endif |
| OLD | NEW |