1 files changed, 7 insertions, 11 deletions
diff --git a/Source/JavaScriptCore/dfg/DFGBlockInsertionSet.cpp b/Source/JavaScriptCore/dfg/DFGBlockInsertionSet.cpp
index d57c01c70..252d638ee 100644
--- a/Source/JavaScriptCore/dfg/DFGBlockInsertionSet.cpp
+++ b/Source/JavaScriptCore/dfg/DFGBlockInsertionSet.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2013, 2014 Apple Inc. All rights reserved.
+ * Copyright (C) 2013 Apple Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
@@ -28,8 +28,6 @@
 
 #if ENABLE(DFG_JIT)
 
-#include "JSCInlines.h"
-
 namespace JSC { namespace DFG {
 
 BlockInsertionSet::BlockInsertionSet(Graph& graph)
@@ -49,21 +47,20 @@ void BlockInsertionSet::insert(size_t index, PassRefPtr<BasicBlock> block)
     insert(BlockInsertion(index, block));
 }
 
-BasicBlock* BlockInsertionSet::insert(size_t index, float executionCount)
+BasicBlock* BlockInsertionSet::insert(size_t index)
 {
     RefPtr<BasicBlock> block = adoptRef(new BasicBlock(
         UINT_MAX,
         m_graph.block(0)->variablesAtHead.numberOfArguments(),
-        m_graph.block(0)->variablesAtHead.numberOfLocals(),
-        executionCount));
+        m_graph.block(0)->variablesAtHead.numberOfLocals()));
     block->isReachable = true;
     insert(index, block);
     return block.get();
 }
 
-BasicBlock* BlockInsertionSet::insertBefore(BasicBlock* before, float executionCount)
+BasicBlock* BlockInsertionSet::insertBefore(BasicBlock* before)
 {
-    return insert(before->index, executionCount);
+    return insert(before->index);
 }
 
 bool BlockInsertionSet::execute()
@@ -71,9 +68,8 @@ bool BlockInsertionSet::execute()
     if (m_insertions.isEmpty())
         return false;
     
-    // We allow insertions to be given to us in any order. So, we need to sort them before
-    // running WTF::executeInsertions. Also, we don't really care if the sort is stable since
-    // basic block order doesn't have semantics - it's just to make code easier to read.
+    // We allow insertions to be given to us in any order. So, we need to
+    // sort them before running WTF::executeInsertions.
     std::sort(m_insertions.begin(), m_insertions.end());
 
     executeInsertions(m_graph.m_blocks, m_insertions);