InlinedVisitor: Migrate xml to use inlined tracing

Source/core/xml/XPathStep.h

 /*
  * Copyright (C) 2005 Frerich Raabe <raabe@kde.org>
  * Copyright (C) 2006, 2009 Apple Inc.
  *
  * 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.
@@ skipping 58 matching lines @@
             ASSERT(o.m_mergedPredicates.isEmpty());
         }
         NodeTest& operator=(const NodeTest& o)
         {
             m_kind = o.m_kind;
             m_data = o.m_data;
             m_namespaceURI = o.m_namespaceURI;
             ASSERT(o.m_mergedPredicates.isEmpty());
             return *this;
         }
-        void trace(Visitor* visitor) { visitor->trace(m_mergedPredicates); }
+        DEFINE_INLINE_TRACE() { visitor->trace(m_mergedPredicates); }
 
         Kind kind() const { return m_kind; }
         const AtomicString& data() const { return m_data; }
         const AtomicString& namespaceURI() const { return m_namespaceURI; }
         WillBeHeapVector<OwnPtrWillBeMember<Predicate> >& mergedPredicates() { return m_mergedPredicates; }
         const WillBeHeapVector<OwnPtrWillBeMember<Predicate> >& mergedPredicates() const { return m_mergedPredicates; }
 
     private:
         Kind m_kind;
         AtomicString m_data;
         AtomicString m_namespaceURI;
 
         // When possible, we merge some or all predicates with node test for better performance.
         WillBeHeapVector<OwnPtrWillBeMember<Predicate> > m_mergedPredicates;
     };
 
     Step(Axis, const NodeTest&);
     Step(Axis, const NodeTest&, WillBeHeapVector<OwnPtrWillBeMember<Predicate> >&);
     virtual ~Step();
-    virtual void trace(Visitor*) override;
+    DECLARE_VIRTUAL_TRACE();
 
     void optimize();
 
     void evaluate(EvaluationContext&, Node* context, NodeSet&) const;
 
     Axis axis() const { return m_axis; }
     const NodeTest& nodeTest() const { return *m_nodeTest; }
 
 private:
     friend void optimizeStepPair(Step*, Step*, bool&);
     bool predicatesAreContextListInsensitive() const;
     NodeTest& nodeTest() { return *m_nodeTest; }
 
     void parseNodeTest(const String&);
     void nodesInAxis(EvaluationContext&, Node* context, NodeSet&) const;
     String namespaceFromNodetest(const String& nodeTest) const;
 
     Axis m_axis;
     OwnPtrWillBeMember<NodeTest> m_nodeTest;
     WillBeHeapVector<OwnPtrWillBeMember<Predicate> > m_predicates;
 };
 
 void optimizeStepPair(Step*, Step*, bool& dropSecondStep);
 
 } // namespace XPath
 
 } // namespace blink
 
 #endif // XPathStep_h