[turbofan] Remember types for deoptimization during simplified lowering.

test/unittests/compiler/state-values-utils-unittest.cc

 // Copyright 2014 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/compiler/state-values-utils.h"
 #include "test/unittests/compiler/graph-unittest.h"
 #include "test/unittests/compiler/node-test-utils.h"
 #include "test/unittests/test-utils.h"
 #include "testing/gmock/include/gmock/gmock.h"
 
@@ skipping 14 matching lines @@
 
 
 TEST_F(StateValuesIteratorTest, SimpleIteration) {
   NodeVector inputs(zone());
   const int count = 10;
   for (int i = 0; i < count; i++) {
     inputs.push_back(Int32Constant(i));
   }
   Node* state_values = StateValuesFromVector(&inputs);
   int i = 0;
-  for (Node* node : StateValuesAccess(state_values)) {
-    EXPECT_THAT(node, IsInt32Constant(i));
+  for (StateValuesAccess::TypedNode node : StateValuesAccess(state_values)) {
+    EXPECT_THAT(node.node, IsInt32Constant(i));
     i++;
   }
   EXPECT_EQ(count, i);
 }
 
 
 TEST_F(StateValuesIteratorTest, EmptyIteration) {
   NodeVector inputs(zone());
   Node* state_values = StateValuesFromVector(&inputs);
-  for (Node* node : StateValuesAccess(state_values)) {
+  for (auto node : StateValuesAccess(state_values)) {
     USE(node);
     FAIL();
   }
 }
 
 
 TEST_F(StateValuesIteratorTest, NestedIteration) {
   NodeVector inputs(zone());
   int count = 0;
   for (int i = 0; i < 8; i++) {
@@ skipping 18 matching lines @@
           nested_inputs.push_back(Int32Constant(count++));
         }
       }
       inputs.push_back(StateValuesFromVector(&nested_inputs));
     } else {
       inputs.push_back(Int32Constant(count++));
     }
   }
   Node* state_values = StateValuesFromVector(&inputs);
   int i = 0;
-  for (Node* node : StateValuesAccess(state_values)) {
-    EXPECT_THAT(node, IsInt32Constant(i));
+  for (StateValuesAccess::TypedNode node : StateValuesAccess(state_values)) {
+    EXPECT_THAT(node.node, IsInt32Constant(i));
     i++;
   }
   EXPECT_EQ(count, i);
 }
 
 
 TEST_F(StateValuesIteratorTest, TreeFromVector) {
   int sizes[] = {0, 1, 2, 100, 5000, 30000};
   TRACED_FOREACH(int, count, sizes) {
     JSOperatorBuilder javascript(zone());
     MachineOperatorBuilder machine(zone());
     JSGraph jsgraph(isolate(), graph(), common(), &javascript, &machine);
 
     // Generate the input vector.
     NodeVector inputs(zone());
     for (int i = 0; i < count; i++) {
       inputs.push_back(Int32Constant(i));
     }
 
     // Build the tree.
     StateValuesCache builder(&jsgraph);
     Node* values_node = builder.GetNodeForValues(
         inputs.size() == 0 ? nullptr : &(inputs.front()), inputs.size());
 
     // Check the tree contents with vector.
     int i = 0;
-    for (Node* node : StateValuesAccess(values_node)) {
-      EXPECT_THAT(node, IsInt32Constant(i));
+    for (StateValuesAccess::TypedNode node : StateValuesAccess(values_node)) {
+      EXPECT_THAT(node.node, IsInt32Constant(i));
       i++;
     }
     EXPECT_EQ(inputs.size(), static_cast<size_t>(i));
   }
 }
 
 
 TEST_F(StateValuesIteratorTest, BuildTreeIdentical) {
   int sizes[] = {0, 1, 2, 100, 5000, 30000};
   TRACED_FOREACH(int, count, sizes) {
@@ skipping 15 matching lines @@
         inputs.size() == 0 ? nullptr : &(inputs.front()), inputs.size());
 
     // The trees should be equal since the data was the same.
     EXPECT_EQ(node1, node2);
   }
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8