[turbofan] Add type to the allocation operator.

src/compiler/js-builtin-reducer.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/js-builtin-reducer.h"
 
 #include "src/base/bits.h"
 #include "src/code-factory.h"
 #include "src/compilation-dependencies.h"
 #include "src/compiler/access-builder.h"
@@ skipping 277 matching lines @@
 
   DCHECK_GE(map_index, Context::TYPED_ARRAY_KEY_ITERATOR_MAP_INDEX);
   DCHECK_LE(map_index, Context::GENERIC_ARRAY_VALUE_ITERATOR_MAP_INDEX);
 
   Handle<Map> map(Map::cast(native_context()->get(map_index)), isolate());
 
   // allocate new iterator
   effect = graph()->NewNode(
       common()->BeginRegion(RegionObservability::kNotObservable), effect);
   Node* value = effect = graph()->NewNode(
-      simplified()->Allocate(NOT_TENURED),
+      simplified()->Allocate(Type::OtherObject(), NOT_TENURED),
       jsgraph()->Constant(JSArrayIterator::kSize), effect, control);
-  NodeProperties::SetType(value, Type::OtherObject());
   effect = graph()->NewNode(simplified()->StoreField(AccessBuilder::ForMap()),
                             value, jsgraph()->Constant(map), effect, control);
   effect = graph()->NewNode(
       simplified()->StoreField(AccessBuilder::ForJSObjectProperties()), value,
       jsgraph()->EmptyFixedArrayConstant(), effect, control);
   effect = graph()->NewNode(
       simplified()->StoreField(AccessBuilder::ForJSObjectElements()), value,
       jsgraph()->EmptyFixedArrayConstant(), effect, control);
 
   // attach the iterator to this object
@@ skipping 1264 matching lines @@
     int capacity =
         NameDictionary::ComputeCapacity(NameDictionary::kInitialCapacity);
     DCHECK(base::bits::IsPowerOfTwo32(capacity));
     int length = NameDictionary::EntryToIndex(capacity);
     int size = NameDictionary::SizeFor(length);
 
     effect = graph()->NewNode(
         common()->BeginRegion(RegionObservability::kNotObservable), effect);
 
     Node* value = effect =
-        graph()->NewNode(simplified()->Allocate(NOT_TENURED),
+        graph()->NewNode(simplified()->Allocate(Type::Any(), NOT_TENURED),
                          jsgraph()->Constant(size), effect, control);
     effect =
         graph()->NewNode(simplified()->StoreField(AccessBuilder::ForMap()),
                          value, jsgraph()->HeapConstant(map), effect, control);
 
     // Initialize FixedArray fields.
     effect = graph()->NewNode(
         simplified()->StoreField(AccessBuilder::ForFixedArrayLength()), value,
         jsgraph()->SmiConstant(length), effect, control);
     // Initialize HashTable fields.
@@ skipping 32 matching lines @@
 
   int const instance_size = instance_map->instance_size();
   if (instance_size > kMaxRegularHeapObjectSize) return NoChange();
   dependencies()->AssumeInitialMapCantChange(instance_map);
 
   // Emit code to allocate the JSObject instance for the given
   // {instance_map}.
   effect = graph()->NewNode(
       common()->BeginRegion(RegionObservability::kNotObservable), effect);
   Node* value = effect =
-      graph()->NewNode(simplified()->Allocate(NOT_TENURED),
+      graph()->NewNode(simplified()->Allocate(Type::Any(), NOT_TENURED),
                        jsgraph()->Constant(instance_size), effect, control);
   effect =
       graph()->NewNode(simplified()->StoreField(AccessBuilder::ForMap()), value,
                        jsgraph()->HeapConstant(instance_map), effect, control);
   effect = graph()->NewNode(
       simplified()->StoreField(AccessBuilder::ForJSObjectProperties()), value,
       properties, effect, control);
   effect = graph()->NewNode(
       simplified()->StoreField(AccessBuilder::ForJSObjectElements()), value,
       jsgraph()->EmptyFixedArrayConstant(), effect, control);
@@ skipping 222 matching lines @@
     Node* effect = NodeProperties::GetEffectInput(node);
     Node* control = NodeProperties::GetControlInput(node);
 
     Node* map = jsgraph()->HeapConstant(
         handle(native_context()->string_iterator_map(), isolate()));
 
     // allocate new iterator
     effect = graph()->NewNode(
         common()->BeginRegion(RegionObservability::kNotObservable), effect);
     Node* value = effect = graph()->NewNode(
-        simplified()->Allocate(NOT_TENURED),
+        simplified()->Allocate(Type::OtherObject(), NOT_TENURED),
         jsgraph()->Constant(JSStringIterator::kSize), effect, control);
-    NodeProperties::SetType(value, Type::OtherObject());
     effect = graph()->NewNode(simplified()->StoreField(AccessBuilder::ForMap()),
                               value, map, effect, control);
     effect = graph()->NewNode(
         simplified()->StoreField(AccessBuilder::ForJSObjectProperties()), value,
         jsgraph()->EmptyFixedArrayConstant(), effect, control);
     effect = graph()->NewNode(
         simplified()->StoreField(AccessBuilder::ForJSObjectElements()), value,
         jsgraph()->EmptyFixedArrayConstant(), effect, control);
 
     // attach the iterator to this string
@@ skipping 418 matching lines @@
   return jsgraph()->simplified();
 }
 
 JSOperatorBuilder* JSBuiltinReducer::javascript() const {
   return jsgraph()->javascript();
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8