OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2011 Google Inc. All rights reserved. | 2 * Copyright (C) 2011 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Neither the name of Google Inc. nor the names of its | 10 * * Neither the name of Google Inc. nor the names of its |
(...skipping 70 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
81 if (hasRareData()) | 81 if (hasRareData()) |
82 clearRareData(); | 82 clearRareData(); |
83 } | 83 } |
84 | 84 |
85 void ShadowRoot::visitWith(Visitor* visitor) const | 85 void ShadowRoot::visitWith(Visitor* visitor) const |
86 { | 86 { |
87 // FIXME(oilpan): need explicit AcceptTrait node instantiation because other
wise compiler can't decide between TreeScope::accept and Node::accept. | 87 // FIXME(oilpan): need explicit AcceptTrait node instantiation because other
wise compiler can't decide between TreeScope::accept and Node::accept. |
88 visitor->visit(this, &AcceptTrait<Node>::accept); | 88 visitor->visit(this, &AcceptTrait<Node>::accept); |
89 } | 89 } |
90 | 90 |
91 void ShadowRoot::acceptHeapVisitor(Visitor* visitor) const | |
92 { | |
93 DocumentFragment::acceptHeapVisitor(visitor); | |
94 TreeScope::accept(visitor); | |
95 } | |
96 | |
97 PassRefPtr<Node> ShadowRoot::cloneNode(bool, ExceptionCode& ec) | 91 PassRefPtr<Node> ShadowRoot::cloneNode(bool, ExceptionCode& ec) |
98 { | 92 { |
99 ec = DATA_CLONE_ERR; | 93 ec = DATA_CLONE_ERR; |
100 return 0; | 94 return 0; |
101 } | 95 } |
102 | 96 |
103 String ShadowRoot::innerHTML() const | 97 String ShadowRoot::innerHTML() const |
104 { | 98 { |
105 return createMarkup(this, ChildrenOnly); | 99 return createMarkup(this, ChildrenOnly); |
106 } | 100 } |
(...skipping 145 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
252 void ShadowRoot::reportMemoryUsage(MemoryObjectInfo* memoryObjectInfo) const | 246 void ShadowRoot::reportMemoryUsage(MemoryObjectInfo* memoryObjectInfo) const |
253 { | 247 { |
254 MemoryClassInfo info(memoryObjectInfo, this, WebCoreMemoryTypes::DOM); | 248 MemoryClassInfo info(memoryObjectInfo, this, WebCoreMemoryTypes::DOM); |
255 DocumentFragment::reportMemoryUsage(memoryObjectInfo); | 249 DocumentFragment::reportMemoryUsage(memoryObjectInfo); |
256 TreeScope::reportMemoryUsage(memoryObjectInfo); | 250 TreeScope::reportMemoryUsage(memoryObjectInfo); |
257 info.addMember(m_prev, "prev"); | 251 info.addMember(m_prev, "prev"); |
258 info.addMember(m_next, "next"); | 252 info.addMember(m_next, "next"); |
259 info.addMember(m_scopeDistribution, "scopeDistribution"); | 253 info.addMember(m_scopeDistribution, "scopeDistribution"); |
260 } | 254 } |
261 | 255 |
| 256 void ShadowRoot::acceptHeapVisitor(Visitor* visitor) const |
| 257 { |
| 258 DocumentFragment::acceptHeapVisitor(visitor); |
| 259 TreeScope::accept(visitor); |
262 } | 260 } |
| 261 |
| 262 } |
OLD | NEW |