Record the HashSet/HashMap operations in DFG/FTL/B3 and replay them in a benchmark

[WebKit-https.git] / Source / JavaScriptCore / dfg / DFGAvailabilityMap.cpp

diff --git a/Source/JavaScriptCore/dfg/DFGAvailabilityMap.cpp b/Source/JavaScriptCore/dfg/DFGAvailabilityMap.cpp
index e319dc6..dabdba0 100644 (file)
--- a/Source/JavaScriptCore/dfg/DFGAvailabilityMap.cpp
+++ b/Source/JavaScriptCore/dfg/DFGAvailabilityMap.cpp
@@ -40,11 +40,11 @@ void AvailabilityMap::pruneHeap()
     if (m_heap.isEmpty())
         return;
     
     if (m_heap.isEmpty())
         return;
     

-    HashSet<Node*> possibleNodes;
+    NodeSet possibleNodes;

     
     for (unsigned i = m_locals.size(); i--;) {
         if (m_locals[i].hasNode())
     
     for (unsigned i = m_locals.size(); i--;) {
         if (m_locals[i].hasNode())

-            possibleNodes.add(m_locals[i].node());
+            possibleNodes.addVoid(m_locals[i].node());

     }
 
     closeOverNodes(
     }
 
     closeOverNodes(