1 /* 2 * Copyright (C) 2012 Google Inc. All rights reserved. 3 * 4 * Redistribution and use in source and binary forms, with or without 5 * modification, are permitted provided that the following conditions are 6 * met: 7 * 8 * * Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * * Redistributions in binary form must reproduce the above 11 * copyright notice, this list of conditions and the following disclaimer 12 * in the documentation and/or other materials provided with the 13 * distribution. 14 * * Neither the name of Google Inc. nor the names of its 15 * contributors may be used to endorse or promote products derived from 16 * this software without specific prior written permission. 17 * 18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 29 */ 30 31 #include "config.h" 32 #include "core/dom/NodeRareData.h" 33 #include "core/dom/Element.h" 34 #include "core/dom/ElementRareData.h" 35 #include "platform/heap/Handle.h" 36 37 namespace WebCore { 38 39 struct SameSizeAsNodeRareData { 40 void* m_pointer[2]; 41 OwnPtrWillBeMember<NodeMutationObserverData> m_mutationObserverData; 42 unsigned m_bitfields; 43 }; 44 45 COMPILE_ASSERT(sizeof(NodeRareData) == sizeof(SameSizeAsNodeRareData), NodeRareDataShouldStaySmall); 46 47 void NodeListsNodeData::invalidateCaches(const QualifiedName* attrName) 48 { 49 NodeListAtomicNameCacheMap::const_iterator atomicNameCacheEnd = m_atomicNameCaches.end(); 50 for (NodeListAtomicNameCacheMap::const_iterator it = m_atomicNameCaches.begin(); it != atomicNameCacheEnd; ++it) 51 it->value->invalidateCacheForAttribute(attrName); 52 53 if (attrName) 54 return; 55 56 TagCollectionCacheNS::iterator tagCacheEnd = m_tagCollectionCacheNS.end(); 57 for (TagCollectionCacheNS::iterator it = m_tagCollectionCacheNS.begin(); it != tagCacheEnd; ++it) 58 it->value->invalidateCache(); 59 } 60 61 void NodeListsNodeData::trace(Visitor* visitor) 62 { 63 visitor->trace(m_childNodeList); 64 visitor->trace(m_atomicNameCaches); 65 visitor->trace(m_tagCollectionCacheNS); 66 } 67 68 void NodeRareData::traceAfterDispatch(Visitor* visitor) 69 { 70 visitor->trace(m_mutationObserverData); 71 // Do not keep empty NodeListsNodeData objects around. 72 if (m_nodeLists && m_nodeLists->isEmpty()) 73 m_nodeLists.clear(); 74 else 75 visitor->trace(m_nodeLists); 76 } 77 78 void NodeRareData::trace(Visitor* visitor) 79 { 80 if (m_isElementRareData) 81 static_cast<ElementRareData*>(this)->traceAfterDispatch(visitor); 82 else 83 traceAfterDispatch(visitor); 84 } 85 86 void NodeRareData::finalizeGarbageCollectedObject() 87 { 88 RELEASE_ASSERT(!renderer()); 89 if (m_isElementRareData) 90 static_cast<ElementRareData*>(this)->~ElementRareData(); 91 else 92 this->~NodeRareData(); 93 } 94 95 // Ensure the 10 bits reserved for the m_connectedFrameCount cannot overflow 96 COMPILE_ASSERT(Page::maxNumberOfFrames < (1 << NodeRareData::ConnectedFrameCountBits), Frame_limit_should_fit_in_rare_data_count); 97 98 } // namespace WebCore 99