[oilpan] The Node hierarchy should have correct accept method chains

Source/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 13 matching lines @@
  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  */
 
 #ifndef Visitor_h
 #define Visitor_h
 
+#include <wtf/Deque.h>
 #include <wtf/Forward.h>
 #include <wtf/HashTraits.h>
 #include <wtf/HashSet.h>
 
 namespace WebCore {
 
 template<typename T> class Member;
 
 #ifndef NDEBUG
 #define DECLARE_GC_TYPE_MARKER         \
@@ skipping 74 matching lines @@
     }
 
     template<typename T, size_t N>
     void visit(const Vector<Member<T>, N>& vector)
     {
         for (typename Vector<Member<T>, N>::const_iterator it = vector.begin(); it != vector.end(); ++it)
             visit(*it);
     }
 
     template<typename T>
-    void visit(const HashSet<Member<T> >& vector)
+    void visit(const HashSet<Member<T> >& hashSet)
     {
-        for (typename HashSet<Member<T> >::const_iterator it = vector.begin(); it != vector.end(); ++it)
+        for (typename HashSet<Member<T> >::const_iterator it = hashSet.begin(); it != hashSet.end(); ++it)
             visit(*it);
     }
 
+    template<typename T>
+    void visit(const Deque<Member<T> >& deque)
+    {
+        for (typename Deque<Member<T> >::const_iterator it = deque.begin(); it != deque.end(); ++it)
+            visit(*it);
+    }
+
     // This method adds the object to the set of objects that should have their
     // accept method called. Since not all objects have vtables we have to have
     // the callback as an explicit argument, but we can use the templated
     // one-argument visit method above to automatically provide the callback
     // function.
     virtual void visit(const void*, AcceptCallback) = 0;
 
     // If the object calls this during the regular accept callback, then the
     // WeakPointerCallback argument may be called later, when the strong roots
     // have all been found. The WeakPointerCallback will normally use isAlive
@@ skipping 130 matching lines @@
 public:
     virtual void accept(Visitor*) = 0;
     virtual ~HeapVisitable()
     {
     }
 };
 
 }
 
 #endif