[Turbofan] run load elimination concurrently.

src/compiler/load-elimination.cc

 // Copyright 2016 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/load-elimination.h"
 
 #include "src/compiler/common-operator.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/node-properties.h"
 #include "src/compiler/simplified-operator.h"
@@ skipping 703 matching lines @@
   Node* const effect = NodeProperties::GetEffectInput(node);
   Node* const control = NodeProperties::GetControlInput(node);
   AbstractState const* state = node_states_.Get(effect);
   if (state == nullptr) return NoChange();
   if (access.offset == HeapObject::kMapOffset &&
       access.base_is_tagged == kTaggedBase) {
     DCHECK(IsAnyTagged(access.machine_type.representation()));
     ZoneHandleSet<Map> object_maps;
     if (state->LookupMaps(object, &object_maps) && object_maps.size() == 1) {
       Node* value = jsgraph()->HeapConstant(object_maps[0]);
+      NodeProperties::SetType(value, Type::OtherInternal());
       ReplaceWithValue(node, value, effect);
       return Replace(value);
     }
   } else {
     int field_index = FieldIndexOf(access);
     if (field_index >= 0) {
       if (Node* replacement = state->LookupField(object, field_index)) {
         // Make sure we don't resurrect dead {replacement} nodes.
         if (!replacement->IsDead()) {
           // We might need to guard the {replacement} if the type of the
           // {node} is more precise than the type of the {replacement}.
           Type* const node_type = NodeProperties::GetType(node);
           if (!NodeProperties::GetType(replacement)->Is(node_type)) {
             replacement = graph()->NewNode(common()->TypeGuard(node_type),
                                            replacement, control);
+            NodeProperties::SetType(replacement, node_type);
           }
           ReplaceWithValue(node, replacement, effect);
           return Replace(replacement);
         }
       }
       state = state->AddField(object, field_index, node, zone());
     }
   }
   Handle<Map> field_map;
   if (access.map.ToHandle(&field_map)) {
@@ skipping 49 matching lines @@
   if (state == nullptr) return NoChange();
   if (Node* replacement = state->LookupElement(object, index)) {
     // Make sure we don't resurrect dead {replacement} nodes.
     if (!replacement->IsDead()) {
       // We might need to guard the {replacement} if the type of the
       // {node} is more precise than the type of the {replacement}.
       Type* const node_type = NodeProperties::GetType(node);
       if (!NodeProperties::GetType(replacement)->Is(node_type)) {
         replacement = graph()->NewNode(common()->TypeGuard(node_type),
                                        replacement, control);
+        NodeProperties::SetType(replacement, node_type);
       }
       ReplaceWithValue(node, replacement, effect);
       return Replace(replacement);
     }
   }
   state = state->AddElement(object, index, node, zone());
   return UpdateState(node, state);
 }
 
 Reduction LoadElimination::ReduceStoreElement(Node* node) {
@@ skipping 250 matching lines @@
   return jsgraph()->common();
 }
 
 Graph* LoadElimination::graph() const { return jsgraph()->graph(); }
 
 Factory* LoadElimination::factory() const { return jsgraph()->factory(); }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8