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 2081 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2092 it->value->invalidateCache(attrName); | 2092 it->value->invalidateCache(attrName); |
2093 | 2093 |
2094 if (attrName) | 2094 if (attrName) |
2095 return; | 2095 return; |
2096 | 2096 |
2097 TagNodeListCacheNS::iterator tagCacheEnd = m_tagNodeListCacheNS.end(); | 2097 TagNodeListCacheNS::iterator tagCacheEnd = m_tagNodeListCacheNS.end(); |
2098 for (TagNodeListCacheNS::iterator it = m_tagNodeListCacheNS.begin(); it != t
agCacheEnd; ++it) | 2098 for (TagNodeListCacheNS::iterator it = m_tagNodeListCacheNS.begin(); it != t
agCacheEnd; ++it) |
2099 it->value->invalidateCache(); | 2099 it->value->invalidateCache(); |
2100 } | 2100 } |
2101 | 2101 |
2102 void Node::getSubresourceURLs(ListHashSet<KURL>& urls) const | |
2103 { | |
2104 addSubresourceAttributeURLs(urls); | |
2105 } | |
2106 | |
2107 Node* Node::enclosingLinkEventParentOrSelf() | 2102 Node* Node::enclosingLinkEventParentOrSelf() |
2108 { | 2103 { |
2109 for (Node* node = this; node; node = node->parentOrShadowHostNode()) { | 2104 for (Node* node = this; node; node = node->parentOrShadowHostNode()) { |
2110 // For imagemaps, the enclosing link node is the associated area element
not the image itself. | 2105 // For imagemaps, the enclosing link node is the associated area element
not the image itself. |
2111 // So we don't let images be the enclosingLinkNode, even though isLink s
ometimes returns true | 2106 // So we don't let images be the enclosingLinkNode, even though isLink s
ometimes returns true |
2112 // for them. | 2107 // for them. |
2113 if (node->isLink() && !node->hasTagName(imgTag)) | 2108 if (node->isLink() && !node->hasTagName(imgTag)) |
2114 return node; | 2109 return node; |
2115 } | 2110 } |
2116 | 2111 |
(...skipping 646 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2763 node->showTreeForThis(); | 2758 node->showTreeForThis(); |
2764 } | 2759 } |
2765 | 2760 |
2766 void showNodePath(const WebCore::Node* node) | 2761 void showNodePath(const WebCore::Node* node) |
2767 { | 2762 { |
2768 if (node) | 2763 if (node) |
2769 node->showNodePathForThis(); | 2764 node->showNodePathForThis(); |
2770 } | 2765 } |
2771 | 2766 |
2772 #endif | 2767 #endif |
OLD | NEW |