Make classes and structures in core/dom fast-allocated.

Source/core/dom/NodeListsNodeData.h

 /*
  * Copyright (C) 2008, 2010 Apple Inc. All rights reserved.
  * Copyright (C) 2008 David Smith <catfish.man@gmail.com>
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
  * version 2 of the License, or (at your option) any later version.
  *
  * This library is distributed in the hope that it will be useful,
@@ skipping 62 matching lines @@
     void removeEmptyChildNodeList(EmptyNodeList* list)
     {
         ASSERT(m_childNodeList == list);
         if (deleteThisAndUpdateNodeRareDataIfAboutToRemoveLastList(list->ownerNode()))
             return;
         m_childNodeList = nullptr;
     }
 #endif
 
     struct NodeListAtomicCacheMapEntryHash {
+        STATIC_ONLY(NodeListAtomicCacheMapEntryHash);
         static unsigned hash(const std::pair<unsigned char, StringImpl*>& entry)
         {
             return DefaultHash<StringImpl*>::Hash::hash(entry.second) + entry.first;
         }
         static bool equal(const std::pair<unsigned char, StringImpl*>& a, const std::pair<unsigned char, StringImpl*>& b) { return a == b; }
         static const bool safeToCompareToEmptyOrDeleted = DefaultHash<StringImpl*>::Hash::safeToCompareToEmptyOrDeleted;
     };
 
     // Oilpan: keep a weak reference to the collection objects.
     // Explicit object unregistration in a non-Oilpan setting
@@ skipping 165 matching lines @@
 template <typename Collection>
 inline Collection* ContainerNode::cachedCollection(CollectionType type)
 {
     NodeListsNodeData* nodeLists = this->nodeLists();
     return nodeLists ? nodeLists->cached<Collection>(type) : 0;
 }
 
 } // namespace blink
 
 #endif // NodeListsNodeData_h