[turbofan] Track multiple maps for LoadElimination.

src/compiler/effect-control-linearizer.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/compiler/effect-control-linearizer.h"
 
 #include "src/code-factory.h"
 #include "src/compiler/access-builder.h"
 #include "src/compiler/compiler-source-position-table.h"
 #include "src/compiler/js-graph.h"
@@ skipping 1184 matching lines @@
   control = effect = graph()->NewNode(
       common()->DeoptimizeUnless(DeoptimizeReason::kOutOfBounds), check,
       frame_state, effect, control);
 
   return ValueEffectControl(index, effect, control);
 }
 
 EffectControlLinearizer::ValueEffectControl
 EffectControlLinearizer::LowerCheckMaps(Node* node, Node* frame_state,
                                         Node* effect, Node* control) {
+  CheckMapsParameters const& p = CheckMapsParametersOf(node->op());
   Node* value = node->InputAt(0);
 
   // Load the current map of the {value}.
   Node* value_map = effect = graph()->NewNode(
       simplified()->LoadField(AccessBuilder::ForMap()), value, effect, control);
 
-  int const map_count = node->op()->ValueInputCount() - 1;
+  ZoneHandleSet<Map> const& maps = p.maps();
+  int const map_count = static_cast<int>(maps.size());
   Node** controls = temp_zone()->NewArray<Node*>(map_count);
   Node** effects = temp_zone()->NewArray<Node*>(map_count + 1);
 
   for (int i = 0; i < map_count; ++i) {
-    Node* map = node->InputAt(1 + i);
+    Node* map = jsgraph()->HeapConstant(maps[i]);
 
     Node* check = graph()->NewNode(machine()->WordEqual(), value_map, map);
     if (i == map_count - 1) {
       controls[i] = effects[i] = graph()->NewNode(
           common()->DeoptimizeUnless(DeoptimizeReason::kWrongMap), check,
           frame_state, effect, control);
     } else {
       control = graph()->NewNode(common()->Branch(), check, control);
       controls[i] = graph()->NewNode(common()->IfTrue(), control);
       control = graph()->NewNode(common()->IfFalse(), control);
@@ skipping 1768 matching lines @@
                        vfalse0, control);
 
   return ValueEffectControl(value, effect, control);
 }
 
 EffectControlLinearizer::ValueEffectControl
 EffectControlLinearizer::LowerTransitionElementsKind(Node* node, Node* effect,
                                                      Node* control) {
   ElementsTransition const transition = ElementsTransitionOf(node->op());
   Node* object = node->InputAt(0);
-  Node* source_map = node->InputAt(1);
-  Node* target_map = node->InputAt(2);
+  Node* source_map = jsgraph()->HeapConstant(transition.source());
+  Node* target_map = jsgraph()->HeapConstant(transition.target());
 
   // Load the current map of {object}.
   Node* object_map = effect =
       graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), object,
                        effect, control);
 
   // Check if {object_map} is the same as {source_map}.
   Node* check =
       graph()->NewNode(machine()->WordEqual(), object_map, source_map);
   Node* branch =
       graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control);
 
   // Migrate the {object} from {source_map} to {target_map}.
   Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
   Node* etrue = effect;
   {
-    switch (transition) {
+    switch (transition.mode()) {
       case ElementsTransition::kFastTransition: {
         // In-place migration of {object}, just store the {target_map}.
         etrue =
             graph()->NewNode(simplified()->StoreField(AccessBuilder::ForMap()),
                              object, target_map, etrue, if_true);
         break;
       }
       case ElementsTransition::kSlowTransition: {
         // Instance migration, call out to the runtime for {object}.
         Operator::Properties properties =
@@ skipping 586 matching lines @@
         isolate(), graph()->zone(), callable.descriptor(), 0, flags,
         Operator::kEliminatable);
     to_number_operator_.set(common()->Call(desc));
   }
   return to_number_operator_.get();
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8