InlinedVisitor: Migrate xml to use inlined tracing

Source/core/xml/XPathNodeSet.h

 /*
  * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org>
  *
  * 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 21 matching lines @@
 
 namespace blink {
 
 namespace XPath {
 
 class NodeSet : public NoBaseWillBeGarbageCollected<NodeSet> {
     WTF_MAKE_FAST_ALLOCATED_WILL_BE_REMOVED;
 public:
     static PassOwnPtrWillBeRawPtr<NodeSet> create() { return adoptPtrWillBeNoop(new NodeSet); }
     static PassOwnPtrWillBeRawPtr<NodeSet> create(const NodeSet&);
-    void trace(Visitor* visitor) { visitor->trace(m_nodes); }
+    DEFINE_INLINE_TRACE() { visitor->trace(m_nodes); }
 
     size_t size() const { return m_nodes.size(); }
     bool isEmpty() const { return !m_nodes.size(); }
     Node* operator[](unsigned i) const { return m_nodes.at(i).get(); }
     void reserveCapacity(size_t newCapacity) { m_nodes.reserveCapacity(newCapacity); }
     void clear() { m_nodes.clear(); }
     void swap(NodeSet& other) { std::swap(m_isSorted, other.m_isSorted); std::swap(m_subtreesAreDisjoint, other.m_subtreesAreDisjoint); m_nodes.swap(other.m_nodes); }
 
     // NodeSet itself does not verify that nodes in it are unique.
     void append(PassRefPtrWillBeRawPtr<Node> node) { m_nodes.append(node); }
@@ skipping 25 matching lines @@
 
     bool m_isSorted;
     bool m_subtreesAreDisjoint;
     WillBeHeapVector<RefPtrWillBeMember<Node> > m_nodes;
 };
 
 }
 
 }
 #endif // XPathNodeSet_h