Oilpan: Remove support for tracing of off-heap ListHashSets.

Source/platform/heap/Visitor.h

 /*
  * Copyright (C) 2013 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:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
  *     * Redistributions in binary form must reproduce the above
@@ skipping 286 matching lines @@
     {
         OffHeapCollectionTraceTrait<Vector<T, inlineCapacity, WTF::DefaultAllocator> >::trace(this, vector);
     }
 
     template<typename T, typename U, typename V>
     void trace(const HashSet<T, U, V>& hashSet)
     {
         OffHeapCollectionTraceTrait<HashSet<T, U, V> >::trace(this, hashSet);
     }
 
-    template<typename T, size_t inlineCapacity, typename U>
-    void trace(const ListHashSet<T, inlineCapacity, U>& hashSet)
-    {
-        OffHeapCollectionTraceTrait<ListHashSet<T, inlineCapacity, U> >::trace(this, hashSet);
-    }
-
     template<typename T, size_t N>
     void trace(const Deque<T, N>& deque)
     {
         OffHeapCollectionTraceTrait<Deque<T, N> >::trace(this, deque);
     }
 
     template<typename T, typename U, typename V, typename W, typename X>
     void trace(const HashMap<T, U, V, W, X, WTF::DefaultAllocator>& map)
     {
         OffHeapCollectionTraceTrait<HashMap<T, U, V, W, X, WTF::DefaultAllocator> >::trace(this, map);
@@ skipping 140 matching lines @@
             HashSet& iterSet = const_cast<HashSet&>(set);
             for (typename HashSet::iterator it = iterSet.begin(), end = iterSet.end(); it != end; ++it) {
                 const T& t = *it;
                 CollectionBackingTraceTrait<WTF::ShouldBeTraced<Traits>::value, Traits::weakHandlingFlag, WTF::WeakPointersActWeak, T, Traits>::trace(visitor, const_cast<T&>(t));
             }
         }
         COMPILE_ASSERT(Traits::weakHandlingFlag == WTF::NoWeakHandlingInCollections, WeakOffHeapCollectionsConsideredDangerous0);
     }
 };
 
-template<typename T, size_t inlineCapacity, typename HashFunctions>
-struct OffHeapCollectionTraceTrait<ListHashSet<T, inlineCapacity, HashFunctions> > {
-    typedef WTF::ListHashSet<T, inlineCapacity, HashFunctions> ListHashSet;
-
-    static void trace(Visitor* visitor, const ListHashSet& set)
-    {
-        if (set.isEmpty())
-            return;
-        ListHashSet& iterSet = const_cast<ListHashSet&>(set);
-        for (typename ListHashSet::iterator it = iterSet.begin(), end = iterSet.end(); it != end; ++it)
-            visitor->trace(*it);
-    }
-};
-
 template<typename Key, typename Value, typename HashFunctions, typename KeyTraits, typename ValueTraits>
 struct OffHeapCollectionTraceTrait<WTF::HashMap<Key, Value, HashFunctions, KeyTraits, ValueTraits, WTF::DefaultAllocator> > {
     typedef WTF::HashMap<Key, Value, HashFunctions, KeyTraits, ValueTraits, WTF::DefaultAllocator> HashMap;
 
     static void trace(Visitor* visitor, const HashMap& map)
     {
         if (map.isEmpty())
             return;
         if (WTF::ShouldBeTraced<KeyTraits>::value || WTF::ShouldBeTraced<ValueTraits>::value) {
             HashMap& iterMap = const_cast<HashMap&>(map);
@@ skipping 206 matching lines @@
 struct GCInfoTrait {
     static const GCInfo* get()
     {
         return GCInfoAtBase<typename GetGarbageCollectedBase<T>::type>::get();
     }
 };
 
 }
 
 #endif