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

Source/core/dom/ElementTraversal.h

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  *           (C) 1999 Antti Koivisto (koivisto@kde.org)
  *           (C) 2001 Dirk Mueller (mueller@kde.org)
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013 Apple Inc. All rights reserved.
  * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmobile.com/)
  * Copyright (C) 2014 Samsung Electronics. All rights reserved.
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
@@ skipping 10 matching lines @@
  * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
  * Boston, MA 02110-1301, USA.
  *
  */
 
 #ifndef ElementTraversal_h
 #define ElementTraversal_h
 
 #include "core/dom/Element.h"
 #include "core/dom/NodeTraversal.h"
+#include "wtf/Allocator.h"
 
 namespace blink {
 
 class HasTagName {
+    STACK_ALLOCATED();
 public:
     explicit HasTagName(const QualifiedName& tagName) : m_tagName(tagName) { }
     bool operator() (const Element& element) const { return element.hasTagName(m_tagName); }
 private:
     const QualifiedName m_tagName;
 };
 
 template <class ElementType>
 class Traversal {
+    STATIC_ONLY(Traversal);
 public:
     using TraversalNodeType = ElementType;
     // First or last ElementType child of the node.
     static ElementType* firstChild(const ContainerNode& current) { return firstChildTemplate(current); }
     static ElementType* firstChild(const Node& current) { return firstChildTemplate(current); }
     template <class MatchFunc>
     static ElementType* firstChild(const ContainerNode&, MatchFunc);
     static ElementType* lastChild(const ContainerNode& current) { return lastChildTemplate(current); }
     static ElementType* lastChild(const Node& current) { return lastChildTemplate(current); }
     template <class MatchFunc>
@@ skipping 377 matching lines @@
 {
     ElementType* element = Traversal<ElementType>::nextSibling(current);
     while (element && !isMatch(*element))
         element = Traversal<ElementType>::nextSibling(*element);
     return element;
 }
 
 } // namespace blink
 
 #endif