[turbofan] Performance enhancements for escape analysis

test/unittests/compiler/escape-analysis-unittest.cc

 // Copyright 2015 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "src/bit-vector.h"
 #include "src/compiler/escape-analysis.h"
 #include "src/compiler/escape-analysis-reducer.h"
 #include "src/compiler/graph-visualizer.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/node-properties.h"
@@ skipping 172 matching lines @@
 
 TEST_F(EscapeAnalysisTest, StraightNonEscape) {
   Node* object1 = Constant(1);
   BeginRegion();
   Node* allocation = Allocate(Constant(kPointerSize));
   Store(AccessAtIndex(0), allocation, object1);
   Node* finish = FinishRegion(allocation);
   Node* load = Load(AccessAtIndex(0), finish);
   Node* result = Return(load);
   EndGraph();
+
   Analysis();
 
   ExpectVirtual(allocation);
   ExpectReplacement(load, object1);
 
   Transformation();
 
   ASSERT_EQ(object1, NodeProperties::GetValueInput(result, 0));
 }
 
 
 TEST_F(EscapeAnalysisTest, StraightEscape) {
   Node* object1 = Constant(1);
   BeginRegion();
   Node* allocation = Allocate(Constant(kPointerSize));
   Store(AccessAtIndex(0), allocation, object1);
   Node* finish = FinishRegion(allocation);
   Node* load = Load(AccessAtIndex(0), finish);
   Node* result = Return(allocation);
   EndGraph();
+  graph()->end()->AppendInput(zone(), load);
+
   Analysis();
 
   ExpectEscaped(allocation);
   ExpectReplacement(load, object1);
 
   Transformation();
 
   ASSERT_EQ(allocation, NodeProperties::GetValueInput(result, 0));
 }
 
@@ skipping 36 matching lines @@
   Branch();
   Node* ifFalse = IfFalse();
   Node* ifTrue = IfTrue();
   Node* effect1 = Store(AccessAtIndex(0), allocation, object1, finish, ifFalse);
   Node* effect2 = Store(AccessAtIndex(0), allocation, object2, finish, ifTrue);
   Node* merge = Merge2(ifFalse, ifTrue);
   Node* phi = graph()->NewNode(common()->EffectPhi(2), effect1, effect2, merge);
   Node* load = Load(AccessAtIndex(0), finish, phi, merge);
   Node* result = Return(load, phi);
   EndGraph();
+  graph()->end()->AppendInput(zone(), result);
+
   Analysis();
 
   ExpectVirtual(allocation);
   ExpectReplacementPhi(load, object1, object2);
   Node* replacement_phi = escape_analysis()->GetReplacement(load);
 
   Transformation();
 
   ASSERT_EQ(replacement_phi, NodeProperties::GetValueInput(result, 0));
 }
 
 
 TEST_F(EscapeAnalysisTest, DanglingLoadOrder) {
   Node* object1 = Constant(1);
   Node* object2 = Constant(2);
   Node* allocation = Allocate(Constant(kPointerSize));
   Node* store1 = Store(AccessAtIndex(0), allocation, object1);
   Node* load1 = Load(AccessAtIndex(0), allocation);
-  Store(AccessAtIndex(0), allocation, object2);
+  Node* store2 = Store(AccessAtIndex(0), allocation, object2);
   Node* load2 = Load(AccessAtIndex(0), allocation, store1);
   Node* result = Return(load2);
   EndGraph();
+  graph()->end()->AppendInput(zone(), store2);
+  graph()->end()->AppendInput(zone(), load1);
 
   Analysis();
 
   ExpectVirtual(allocation);
   ExpectReplacement(load1, object1);
   ExpectReplacement(load2, object1);
 
   Transformation();
 
   ASSERT_EQ(object1, NodeProperties::GetValueInput(result, 0));
@@ skipping 79 matching lines @@
   ASSERT_EQ(object1, NodeProperties::GetValueInput(object_state, 0));
   ASSERT_EQ(object_state, NodeProperties::GetValueInput(object_state, 1));
 
   Node* object_state2 = NodeProperties::GetValueInput(state_values1, 0);
   ASSERT_EQ(object_state, object_state2);
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8