Turbofan: Make type feedback vector a Node.

src/compiler/js-typed-lowering.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/code-factory.h"
 #include "src/compiler/access-builder.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/js-typed-lowering.h"
 #include "src/compiler/linkage.h"
 #include "src/compiler/node-matchers.h"
@@ skipping 918 matching lines @@
       simplified()->StoreField(AccessBuilder::ForContextSlot(access.index())));
   node->RemoveInput(2);
   DCHECK_EQ(4, node->InputCount());
   return Changed(node);
 }
 
 
 Reduction JSTypedLowering::ReduceJSLoadDynamicGlobal(Node* node) {
   DCHECK_EQ(IrOpcode::kJSLoadDynamicGlobal, node->opcode());
   DynamicGlobalAccess const& access = DynamicGlobalAccessOf(node->op());
+  Node* const vector = NodeProperties::GetValueInput(node, 0);
   Node* const context = NodeProperties::GetContextInput(node);
   Node* const state1 = NodeProperties::GetFrameStateInput(node, 0);
   Node* const state2 = NodeProperties::GetFrameStateInput(node, 1);
   Node* const effect = NodeProperties::GetEffectInput(node);
   Node* const control = NodeProperties::GetControlInput(node);
   if (access.RequiresFullCheck()) return NoChange();
 
   // Perform checks whether the fast mode applies, by looking for any extension
   // object which might shadow the optimistic declaration.
   uint32_t bitset = access.check_bitset();
@@ skipping 15 matching lines @@
     check_true = if_true;
   }
 
   // Fast case, because variable is not shadowed. Perform global object load.
   Unique<Name> name = Unique<Name>::CreateUninitialized(access.name());
   Node* global = graph()->NewNode(
       javascript()->LoadContext(0, Context::GLOBAL_OBJECT_INDEX, true), context,
       context, effect);
   Node* fast = graph()->NewNode(
       javascript()->LoadNamed(name, access.feedback(), access.mode()), global,
-      context, state1, state2, global, check_true);
+      vector, context, state1, state2, global, check_true);
 
   // Slow case, because variable potentially shadowed. Perform dynamic lookup.
   uint32_t check_bitset = DynamicGlobalAccess::kFullCheckRequired;
   Node* slow = graph()->NewNode(
       javascript()->LoadDynamicGlobal(access.name(), check_bitset,
                                       access.feedback(), access.mode()),
-      context, context, state1, state2, effect, check_false);
+      vector, context, context, state1, state2, effect, check_false);
 
   // Replace value, effect and control uses accordingly.
   Node* new_control =
       graph()->NewNode(common()->Merge(2), check_true, check_false);
   Node* new_effect =
       graph()->NewNode(common()->EffectPhi(2), fast, slow, new_control);
   Node* new_value = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), fast,
                                      slow, new_control);
   ReplaceWithValue(node, new_value, new_effect, new_control);
   return Changed(new_value);
@@ skipping 619 matching lines @@
 }
 
 
 MachineOperatorBuilder* JSTypedLowering::machine() const {
   return jsgraph()->machine();
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8