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 1890 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1901 Node* rootNode = const_cast<Node*>(this); | 1901 Node* rootNode = const_cast<Node*>(this); |
1902 while (parentOrShadowHostOrFrameOwner(rootNode)) | 1902 while (parentOrShadowHostOrFrameOwner(rootNode)) |
1903 rootNode = parentOrShadowHostOrFrameOwner(rootNode); | 1903 rootNode = parentOrShadowHostOrFrameOwner(rootNode); |
1904 showSubTreeAcrossFrame(rootNode, this, ""); | 1904 showSubTreeAcrossFrame(rootNode, this, ""); |
1905 } | 1905 } |
1906 | 1906 |
1907 #endif | 1907 #endif |
1908 | 1908 |
1909 // -------- | 1909 // -------- |
1910 | 1910 |
1911 void NodeListsNodeData::invalidateCaches(const QualifiedName* attrName) | |
1912 { | |
1913 NodeListAtomicNameCacheMap::const_iterator atomicNameCacheEnd = m_atomicName
Caches.end(); | |
1914 for (NodeListAtomicNameCacheMap::const_iterator it = m_atomicNameCaches.begi
n(); it != atomicNameCacheEnd; ++it) | |
1915 it->value->invalidateCache(attrName); | |
1916 | |
1917 NodeListNameCacheMap::const_iterator nameCacheEnd = m_nameCaches.end(); | |
1918 for (NodeListNameCacheMap::const_iterator it = m_nameCaches.begin(); it != n
ameCacheEnd; ++it) | |
1919 it->value->invalidateCache(attrName); | |
1920 | |
1921 if (attrName) | |
1922 return; | |
1923 | |
1924 TagCollectionCacheNS::iterator tagCacheEnd = m_tagCollectionCacheNS.end(); | |
1925 for (TagCollectionCacheNS::iterator it = m_tagCollectionCacheNS.begin(); it
!= tagCacheEnd; ++it) | |
1926 it->value->invalidateCache(); | |
1927 } | |
1928 | |
1929 Node* Node::enclosingLinkEventParentOrSelf() | 1911 Node* Node::enclosingLinkEventParentOrSelf() |
1930 { | 1912 { |
1931 for (Node* node = this; node; node = node->parentOrShadowHostNode()) { | 1913 for (Node* node = this; node; node = node->parentOrShadowHostNode()) { |
1932 // For imagemaps, the enclosing link node is the associated area element
not the image itself. | 1914 // For imagemaps, the enclosing link node is the associated area element
not the image itself. |
1933 // So we don't let images be the enclosingLinkNode, even though isLink s
ometimes returns true | 1915 // So we don't let images be the enclosingLinkNode, even though isLink s
ometimes returns true |
1934 // for them. | 1916 // for them. |
1935 if (node->isLink() && !node->hasTagName(imgTag)) | 1917 if (node->isLink() && !node->hasTagName(imgTag)) |
1936 return node; | 1918 return node; |
1937 } | 1919 } |
1938 | 1920 |
(...skipping 639 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2578 node->showTreeForThis(); | 2560 node->showTreeForThis(); |
2579 } | 2561 } |
2580 | 2562 |
2581 void showNodePath(const WebCore::Node* node) | 2563 void showNodePath(const WebCore::Node* node) |
2582 { | 2564 { |
2583 if (node) | 2565 if (node) |
2584 node->showNodePathForThis(); | 2566 node->showNodePathForThis(); |
2585 } | 2567 } |
2586 | 2568 |
2587 #endif | 2569 #endif |
OLD | NEW |