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 2427 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2438 { | 2438 { |
2439 unsigned count = connectedSubframeCount(); | 2439 unsigned count = connectedSubframeCount(); |
2440 | 2440 |
2441 if (!count) | 2441 if (!count) |
2442 return; | 2442 return; |
2443 | 2443 |
2444 for (Node* node = parentOrShadowHostNode(); node; node = node->parentOrShado
wHostNode()) | 2444 for (Node* node = parentOrShadowHostNode(); node; node = node->parentOrShado
wHostNode()) |
2445 node->incrementConnectedSubframeCount(count); | 2445 node->incrementConnectedSubframeCount(count); |
2446 } | 2446 } |
2447 | 2447 |
2448 PassRefPtrWillBeRawPtr<NodeList> Node::getDestinationInsertionPoints() | 2448 PassRefPtrWillBeRawPtr<StaticNodeList> Node::getDestinationInsertionPoints() |
2449 { | 2449 { |
2450 document().updateDistributionForNodeIfNeeded(this); | 2450 document().updateDistributionForNodeIfNeeded(this); |
2451 WillBeHeapVector<RawPtrWillBeMember<InsertionPoint>, 8> insertionPoints; | 2451 WillBeHeapVector<RawPtrWillBeMember<InsertionPoint>, 8> insertionPoints; |
2452 collectDestinationInsertionPoints(*this, insertionPoints); | 2452 collectDestinationInsertionPoints(*this, insertionPoints); |
2453 WillBeHeapVector<RefPtrWillBeMember<Node> > filteredInsertionPoints; | 2453 WillBeHeapVector<RefPtrWillBeMember<Node> > filteredInsertionPoints; |
2454 for (size_t i = 0; i < insertionPoints.size(); ++i) { | 2454 for (size_t i = 0; i < insertionPoints.size(); ++i) { |
2455 InsertionPoint* insertionPoint = insertionPoints[i]; | 2455 InsertionPoint* insertionPoint = insertionPoints[i]; |
2456 ASSERT(insertionPoint->containingShadowRoot()); | 2456 ASSERT(insertionPoint->containingShadowRoot()); |
2457 if (insertionPoint->containingShadowRoot()->type() != ShadowRoot::UserAg
entShadowRoot) | 2457 if (insertionPoint->containingShadowRoot()->type() != ShadowRoot::UserAg
entShadowRoot) |
2458 filteredInsertionPoints.append(insertionPoint); | 2458 filteredInsertionPoints.append(insertionPoint); |
(...skipping 115 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2574 node->showTreeForThis(); | 2574 node->showTreeForThis(); |
2575 } | 2575 } |
2576 | 2576 |
2577 void showNodePath(const WebCore::Node* node) | 2577 void showNodePath(const WebCore::Node* node) |
2578 { | 2578 { |
2579 if (node) | 2579 if (node) |
2580 node->showNodePathForThis(); | 2580 node->showNodePathForThis(); |
2581 } | 2581 } |
2582 | 2582 |
2583 #endif | 2583 #endif |
OLD | NEW |