2011-06-07  Geoffrey Garen  <ggaren@apple.com>

        Reviewed by Sam Weinig.

        Renamed some more marks to visits
        https://bugs.webkit.org/show_bug.cgi?id=62254

        * heap/HandleHeap.cpp:
        (JSC::HandleHeap::visitStrongHandles):
        (JSC::HandleHeap::visitWeakHandles):
        * heap/HandleHeap.h:
        * heap/HandleStack.cpp:
        (JSC::HandleStack::visit):
        * heap/HandleStack.h:
        * heap/Heap.cpp:
        (JSC::Heap::markProtectedObjects):
        (JSC::Heap::markTempSortVectors):
        (JSC::Heap::markRoots):
        * heap/HeapRootVisitor.h:
        (JSC::HeapRootVisitor::visit):
        * runtime/ArgList.cpp:
        (JSC::MarkedArgumentBuffer::markLists):


git-svn-id: http://svn.webkit.org/repository/webkit/trunk@88324 268f45cc-cd09-0410-ab3c-d52691b4dbfc
diff --git a/Source/JavaScriptCore/heap/Heap.cpp b/Source/JavaScriptCore/heap/Heap.cpp
index 866bf91..f3c0456 100644
--- a/Source/JavaScriptCore/heap/Heap.cpp
+++ b/Source/JavaScriptCore/heap/Heap.cpp
@@ -177,7 +177,7 @@
 {
     ProtectCountSet::iterator end = m_protectedValues.end();
     for (ProtectCountSet::iterator it = m_protectedValues.begin(); it != end; ++it)
-        heapRootVisitor.mark(&it->first);
+        heapRootVisitor.visit(&it->first);
 }
 
 void Heap::pushTempSortVector(Vector<ValueStringPair>* tempVector)
@@ -202,7 +202,7 @@
         Vector<ValueStringPair>::iterator vectorEnd = tempSortingVector->end();
         for (Vector<ValueStringPair>::iterator vectorIt = tempSortingVector->begin(); vectorIt != vectorEnd; ++vectorIt) {
             if (vectorIt->first)
-                heapRootVisitor.mark(&vectorIt->first);
+                heapRootVisitor.visit(&vectorIt->first);
         }
     }
 }
@@ -249,13 +249,13 @@
     if (m_markListSet && m_markListSet->size())
         MarkedArgumentBuffer::markLists(heapRootVisitor, *m_markListSet);
     if (m_globalData->exception)
-        heapRootVisitor.mark(&m_globalData->exception);
+        heapRootVisitor.visit(&m_globalData->exception);
     visitor.drain();
 
-    m_handleHeap.markStrongHandles(heapRootVisitor);
+    m_handleHeap.visitStrongHandles(heapRootVisitor);
     visitor.drain();
 
-    m_handleStack.mark(heapRootVisitor);
+    m_handleStack.visit(heapRootVisitor);
     visitor.drain();
 
     // Weak handles must be marked last, because their owners use the set of
@@ -263,7 +263,7 @@
     int lastOpaqueRootCount;
     do {
         lastOpaqueRootCount = visitor.opaqueRootCount();
-        m_handleHeap.markWeakHandles(heapRootVisitor);
+        m_handleHeap.visitWeakHandles(heapRootVisitor);
         visitor.drain();
     // If the set of opaque roots has grown, more weak handles may have become reachable.
     } while (lastOpaqueRootCount != visitor.opaqueRootCount());