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

[WebKit-https.git] / Source / JavaScriptCore / dfg / DFGCombinedLiveness.h

diff --git a/Source/JavaScriptCore/dfg/DFGCombinedLiveness.h b/Source/JavaScriptCore/dfg/DFGCombinedLiveness.h
index e50065a..e1ac76d 100644 (file)
--- a/Source/JavaScriptCore/dfg/DFGCombinedLiveness.h
+++ b/Source/JavaScriptCore/dfg/DFGCombinedLiveness.h
@@ -33,7 +33,7 @@
 namespace JSC { namespace DFG {
 
 // Returns the set of nodes live at tail, both due to due DFG and due to bytecode (i.e. OSR exit).
-HashSet<Node*> liveNodesAtHead(Graph&, BasicBlock*);
+NodeSet liveNodesAtHead(Graph&, BasicBlock*);
 
 // WARNING: This currently does not reason about the liveness of shadow values. The execution
 // semantics of DFG SSA are that an Upsilon stores to the shadow value of a Phi, and the Phi loads
@@ -45,8 +45,8 @@ struct CombinedLiveness {
     
     CombinedLiveness(Graph&);
     
-    BlockMap<HashSet<Node*>> liveAtHead;
-    BlockMap<HashSet<Node*>> liveAtTail;
+    BlockMap<NodeSet> liveAtHead;
+    BlockMap<NodeSet> liveAtTail;
 };
 
 } } // namespace JSC::DFG