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 2348 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2359 void Node::trace(Visitor* visitor) | 2359 void Node::trace(Visitor* visitor) |
2360 { | 2360 { |
2361 #if ENABLE(OILPAN) | 2361 #if ENABLE(OILPAN) |
2362 visitor->trace(m_parentOrShadowHostNode); | 2362 visitor->trace(m_parentOrShadowHostNode); |
2363 visitor->trace(m_previous); | 2363 visitor->trace(m_previous); |
2364 visitor->trace(m_next); | 2364 visitor->trace(m_next); |
2365 // rareData() and m_data.m_renderer share their storage. We have to trace | 2365 // rareData() and m_data.m_renderer share their storage. We have to trace |
2366 // only one of them. | 2366 // only one of them. |
2367 if (hasRareData()) | 2367 if (hasRareData()) |
2368 visitor->trace(rareData()); | 2368 visitor->trace(rareData()); |
2369 else | 2369 |
2370 visitor->trace(m_data.m_renderer); | |
2371 visitor->trace(m_treeScope); | 2370 visitor->trace(m_treeScope); |
2372 #endif | 2371 #endif |
2373 EventTarget::trace(visitor); | 2372 EventTarget::trace(visitor); |
2374 } | 2373 } |
2375 | 2374 |
2376 unsigned Node::lengthOfContents() const | 2375 unsigned Node::lengthOfContents() const |
2377 { | 2376 { |
2378 // This switch statement must be consistent with that of Range::processConte
ntsBetweenOffsets. | 2377 // This switch statement must be consistent with that of Range::processConte
ntsBetweenOffsets. |
2379 switch (nodeType()) { | 2378 switch (nodeType()) { |
2380 case Node::TEXT_NODE: | 2379 case Node::TEXT_NODE: |
(...skipping 54 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2435 node->showTreeForThis(); | 2434 node->showTreeForThis(); |
2436 } | 2435 } |
2437 | 2436 |
2438 void showNodePath(const blink::Node* node) | 2437 void showNodePath(const blink::Node* node) |
2439 { | 2438 { |
2440 if (node) | 2439 if (node) |
2441 node->showNodePathForThis(); | 2440 node->showNodePathForThis(); |
2442 } | 2441 } |
2443 | 2442 |
2444 #endif | 2443 #endif |
OLD | NEW |