InlinedVisitor: Migrate html to use inlined tracing

Source/core/html/parser/HTMLFormattingElementList.h

 /*
  * Copyright (C) 2010 Google, Inc. All Rights Reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 59 matching lines @@
             // callers should check isMarker() before calling element().
             ASSERT(m_item);
             return m_item->element();
         }
         void replaceElement(PassRefPtrWillBeRawPtr<HTMLStackItem> item) { m_item = item; }
 
         // Needed for use with Vector.  These are super-hot and must be inline.
         bool operator==(Element* element) const { return !m_item ? !element : m_item->element() == element; }
         bool operator!=(Element* element) const { return !m_item ? !!element : m_item->element() != element; }
 
-        void trace(Visitor* visitor) { visitor->trace(m_item); }
+        DEFINE_INLINE_TRACE() { visitor->trace(m_item); }
 
     private:
         RefPtrWillBeMember<HTMLStackItem> m_item;
     };
 
     class Bookmark {
     public:
         explicit Bookmark(Entry* entry)
             : m_hasBeenMoved(false)
             , m_mark(entry)
@@ skipping 27 matching lines @@
     Bookmark bookmarkFor(Element*);
     void swapTo(Element* oldElement, PassRefPtrWillBeRawPtr<HTMLStackItem> newItem, const Bookmark&);
 
     void appendMarker();
     // clearToLastMarker also clears the marker (per the HTML5 spec).
     void clearToLastMarker();
 
     const Entry& at(size_t i) const { return m_entries[i]; }
     Entry& at(size_t i) { return m_entries[i]; }
 
-    void trace(Visitor* visitor) { visitor->trace(m_entries); }
+    DEFINE_INLINE_TRACE() { visitor->trace(m_entries); }
 
 #ifndef NDEBUG
     void show();
 #endif
 
 private:
     Entry* first() { return &at(0); }
 
     // http://www.whatwg.org/specs/web-apps/current-work/multipage/parsing.html#list-of-active-formatting-elements
     // These functions enforce the "Noah's Ark" condition, which removes redundant mis-nested elements.
     void tryToEnsureNoahsArkConditionQuickly(HTMLStackItem*, WillBeHeapVector<RawPtrWillBeMember<HTMLStackItem>>& remainingCandiates);
     void ensureNoahsArkCondition(HTMLStackItem*);
 
     WillBeHeapVector<Entry> m_entries;
 };
 
 } // namespace blink
 
 WTF_ALLOW_MOVE_AND_INIT_WITH_MEM_FUNCTIONS(blink::HTMLFormattingElementList::Entry);
 
 #endif // HTMLFormattingElementList_h