Remove more bits of the Oilpan tracing system

sky/engine/wtf/ListHashSet.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 167 matching lines @@
         void remove(ValuePeekInType value) { return remove(find(value)); }
         void remove(iterator);
         void clear();
         template<typename Collection>
         void removeAll(const Collection& other) { WTF::removeAll(*this, other); }
 
         ValuePassOutType take(iterator);
         ValuePassOutType take(ValuePeekInType);
         ValuePassOutType takeFirst();
 
-        void trace(typename Allocator::Visitor*);
-
     private:
         void unlink(Node*);
         void unlinkAndDelete(Node*);
         void appendNode(Node*);
         void prependNode(Node*);
         void insertNodeBefore(Node* beforeNode, Node* newNode);
         void deleteAllNodes();
         Allocator* allocator() const { return this->m_allocatorProvider.get(); }
         void createAllocatorIfNeeded() { this->m_allocatorProvider.createAllocatorIfNeeded(); }
         void deallocate(Node* node) const { this->m_allocatorProvider.deallocate(node); }
@@ skipping 123 matching lines @@
             }
 
             fastFree(node);
         }
 
         bool inPool(Node* node)
         {
             return node >= pool() && node < pastPool();
         }
 
-        static void traceValue(typename DefaultAllocator::Visitor* visitor, Node* node) { }
-
     private:
         Node* pool() { return reinterpret_cast_ptr<Node*>(m_pool.buffer); }
         Node* pastPool() { return pool() + m_poolSize; }
 
         Node* m_freeList;
         bool m_isDoneWithInitialFreeList;
 #if defined(MEMORY_SANITIZER_INITIAL_SIZE)
         // The allocation pool for nodes is one big chunk that ASAN has no
         // insight into, so it can cloak errors. Make it as small as possible
         // to force nodes to be allocated individually where ASAN can see them.
@@ skipping 621 matching lines @@
     template<typename T, size_t inlineCapacity, typename U, typename V>
     void ListHashSet<T, inlineCapacity, U, V>::deleteAllNodes()
     {
         if (!m_head)
             return;
 
         for (Node* node = m_head, *next = m_head->next(); node; node = next, next = node ? node->next() : 0)
             node->destroy(this->allocator());
     }
 
-    template<typename T, size_t inlineCapacity, typename U, typename V>
-    void ListHashSet<T, inlineCapacity, U, V>::trace(typename Allocator::Visitor* visitor)
-    {
-        COMPILE_ASSERT(HashTraits<T>::weakHandlingFlag == NoWeakHandlingInCollections, ListHashSetDoesNotSupportWeakness);
-        // This marks all the nodes and their contents live that can be
-        // accessed through the HashTable. That includes m_head and m_tail
-        // so we do not have to explicitly trace them here.
-        m_impl.trace(visitor);
-    }
-
-#if !ENABLE(OILPAN)
-    template<typename T, size_t U, typename V>
-    struct NeedsTracing<ListHashSet<T, U, V> > {
-        static const bool value = false;
-    };
-#endif
-
 } // namespace WTF
 
 using WTF::ListHashSet;
 
 #endif /* WTF_ListHashSet_h */