| 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 96 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 107 ASSERT(isMainThread()); | 107 ASSERT(isMainThread()); |
| 108 return partitionAlloc(Partitions::getObjectModelPartition(), size); | 108 return partitionAlloc(Partitions::getObjectModelPartition(), size); |
| 109 } | 109 } |
| 110 | 110 |
| 111 void Node::operator delete(void* ptr) | 111 void Node::operator delete(void* ptr) |
| 112 { | 112 { |
| 113 ASSERT(isMainThread()); | 113 ASSERT(isMainThread()); |
| 114 partitionFree(ptr); | 114 partitionFree(ptr); |
| 115 } | 115 } |
| 116 | 116 |
| 117 bool Node::isSupported(const String& feature, const String& version) | |
| 118 { | |
| 119 return DOMImplementation::hasFeature(feature, version); | |
| 120 } | |
| 121 | |
| 122 #if DUMP_NODE_STATISTICS | 117 #if DUMP_NODE_STATISTICS |
| 123 static HashSet<Node*> liveNodeSet; | 118 static HashSet<Node*> liveNodeSet; |
| 124 #endif | 119 #endif |
| 125 | 120 |
| 126 void Node::dumpStatistics() | 121 void Node::dumpStatistics() |
| 127 { | 122 { |
| 128 #if DUMP_NODE_STATISTICS | 123 #if DUMP_NODE_STATISTICS |
| 129 size_t nodesWithRareData = 0; | 124 size_t nodesWithRareData = 0; |
| 130 | 125 |
| 131 size_t elementNodes = 0; | 126 size_t elementNodes = 0; |
| (...skipping 2504 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2636 node->showTreeForThis(); | 2631 node->showTreeForThis(); |
| 2637 } | 2632 } |
| 2638 | 2633 |
| 2639 void showNodePath(const WebCore::Node* node) | 2634 void showNodePath(const WebCore::Node* node) |
| 2640 { | 2635 { |
| 2641 if (node) | 2636 if (node) |
| 2642 node->showNodePathForThis(); | 2637 node->showNodePathForThis(); |
| 2643 } | 2638 } |
| 2644 | 2639 |
| 2645 #endif | 2640 #endif |
| OLD | NEW |