Remove more bits of the Oilpan tracing system

sky/engine/wtf/LinkedHashSet.h

 /*
  * Copyright (C) 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All rights reserved.
  * Copyright (C) 2011, Benjamin Poulain <ikipou@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 227 matching lines @@
 
     AddResult insertBefore(ValuePeekInType beforeValue, ValuePeekInType newValue);
     AddResult insertBefore(iterator it, ValuePeekInType newValue) { return m_impl.template add<NodeHashFunctions>(newValue, it.node()); }
 
     void remove(ValuePeekInType);
     void remove(iterator);
     void clear() { m_impl.clear(); }
     template<typename Collection>
     void removeAll(const Collection& other) { WTF::removeAll(*this, other); }
 
-    void trace(typename Allocator::Visitor* visitor) { m_impl.trace(visitor); }
-
     int64_t modifications() const { return m_impl.modifications(); }
     void checkModifications(int64_t mods) const { m_impl.checkModifications(mods); }
 
 private:
     Node* anchor() { return reinterpret_cast<Node*>(&m_anchor); }
     const Node* anchor() const { return reinterpret_cast<const Node*>(&m_anchor); }
     Node* firstNode() { return reinterpret_cast<Node*>(m_anchor.m_next); }
     const Node* firstNode() const { return reinterpret_cast<const Node*>(m_anchor.m_next); }
     Node* lastNode() { return reinterpret_cast<Node*>(m_anchor.m_prev); }
     const Node* lastNode() const { return reinterpret_cast<const Node*>(m_anchor.m_prev); }
@@ skipping 460 matching lines @@
 // instead.
 template<typename ValueType, typename T, typename U>
 void deleteAllValues(const LinkedHashSet<ValueType, T, U>& set)
 {
     typedef typename LinkedHashSet<ValueType, T, U>::const_iterator iterator;
     iterator end = set.end();
     for (iterator it = set.begin(); it != end; ++it)
         delete *it;
 }
 
-#if !ENABLE(OILPAN)
-template<typename T, typename U, typename V>
-struct NeedsTracing<LinkedHashSet<T, U, V> > {
-    static const bool value = false;
-};
-#endif
-
 }
 
 using WTF::LinkedHashSet;
 
 #endif /* WTF_LinkedHashSet_h */