Changeset 87450 in webkit
- Timestamp:
- May 26, 2011 4:47:40 PM (13 years ago)
- Location:
- trunk/Source/JavaScriptCore
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/Source/JavaScriptCore/ChangeLog
r87448 r87450 1 2011-05-26 Geoffrey Garen <ggaren@apple.com> 2 3 Reviewed by Oliver Hunt. 4 5 Renamed heapRootMarker to heapRootVisitor to match its class name 6 https://bugs.webkit.org/show_bug.cgi?id=61584 7 8 * heap/Heap.cpp: 9 (JSC::Heap::markProtectedObjects): 10 (JSC::Heap::markTempSortVectors): 11 (JSC::Heap::markRoots): 12 1 13 2011-05-26 Geoffrey Garen <ggaren@apple.com> 2 14 -
trunk/Source/JavaScriptCore/heap/Heap.cpp
r87448 r87450 176 176 } 177 177 178 void Heap::markProtectedObjects(HeapRootVisitor& heapRoot Marker)178 void Heap::markProtectedObjects(HeapRootVisitor& heapRootVisitor) 179 179 { 180 180 ProtectCountSet::iterator end = m_protectedValues.end(); 181 181 for (ProtectCountSet::iterator it = m_protectedValues.begin(); it != end; ++it) 182 heapRoot Marker.mark(&it->first);182 heapRootVisitor.mark(&it->first); 183 183 } 184 184 … … 194 194 } 195 195 196 void Heap::markTempSortVectors(HeapRootVisitor& heapRoot Marker)196 void Heap::markTempSortVectors(HeapRootVisitor& heapRootVisitor) 197 197 { 198 198 typedef Vector<Vector<ValueStringPair>* > VectorOfValueStringVectors; … … 205 205 for (Vector<ValueStringPair>::iterator vectorIt = tempSortingVector->begin(); vectorIt != vectorEnd; ++vectorIt) { 206 206 if (vectorIt->first) 207 heapRoot Marker.mark(&vectorIt->first);207 heapRootVisitor.mark(&vectorIt->first); 208 208 } 209 209 } … … 225 225 226 226 MarkStack& visitor = m_markStack; 227 HeapRootVisitor heapRoot Marker(visitor);227 HeapRootVisitor heapRootVisitor(visitor); 228 228 229 229 // We gather conservative roots before clearing mark bits because conservative … … 243 243 visitor.drain(); 244 244 245 markProtectedObjects(heapRoot Marker);245 markProtectedObjects(heapRootVisitor); 246 246 visitor.drain(); 247 247 248 markTempSortVectors(heapRoot Marker);248 markTempSortVectors(heapRootVisitor); 249 249 visitor.drain(); 250 250 251 251 if (m_markListSet && m_markListSet->size()) 252 MarkedArgumentBuffer::markLists(heapRoot Marker, *m_markListSet);252 MarkedArgumentBuffer::markLists(heapRootVisitor, *m_markListSet); 253 253 if (m_globalData->exception) 254 heapRoot Marker.mark(&m_globalData->exception);255 visitor.drain(); 256 257 m_handleHeap.markStrongHandles(heapRoot Marker);258 visitor.drain(); 259 260 m_handleStack.mark(heapRoot Marker);254 heapRootVisitor.mark(&m_globalData->exception); 255 visitor.drain(); 256 257 m_handleHeap.markStrongHandles(heapRootVisitor); 258 visitor.drain(); 259 260 m_handleStack.mark(heapRootVisitor); 261 261 visitor.drain(); 262 262 … … 266 266 do { 267 267 lastOpaqueRootCount = visitor.opaqueRootCount(); 268 m_handleHeap.markWeakHandles(heapRoot Marker);268 m_handleHeap.markWeakHandles(heapRootVisitor); 269 269 visitor.drain(); 270 270 // If the set of opaque roots has grown, more weak handles may have become reachable.
Note: See TracChangeset
for help on using the changeset viewer.