[turbofan] Make FieldAccess::name usable in practice.

test/unittests/compiler/change-lowering-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/code-stubs.h"
 #include "src/compiler/change-lowering.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/linkage.h"
 #include "src/compiler/node-properties.h"
 #include "src/compiler/simplified-operator.h"
@@ skipping 164 matching lines @@
   Node* value = Parameter(Type::TaggedPointer());
   Reduction r =
       Reduce(graph()->NewNode(simplified()->ChangeTaggedToUint32(), value));
   ASSERT_TRUE(r.Changed());
   EXPECT_THAT(r.replacement(), IsChangeFloat64ToUint32(
                                    IsLoadHeapNumber(value, graph()->start())));
 }
 
 
 TARGET_TEST_P(ChangeLoweringCommonTest, StoreFieldSmi) {
-  FieldAccess access = {kTaggedBase, FixedArrayBase::kHeaderSize,
-                        Handle<Name>::null(), Type::Any(),
-                        MachineType::AnyTagged()};
+  FieldAccess access = {kTaggedBase, FixedArrayBase::kHeaderSize, nullptr,
+                        Type::Any(), MachineType::AnyTagged()};
   Node* p0 = Parameter(Type::TaggedPointer());
   Node* p1 = Parameter(Type::TaggedSigned());
   Node* store = graph()->NewNode(simplified()->StoreField(access), p0, p1,
                                  graph()->start(), graph()->start());
   Reduction r = Reduce(store);
 
   ASSERT_TRUE(r.Changed());
   EXPECT_THAT(
       r.replacement(),
       IsStore(StoreRepresentation(MachineType::AnyTagged(), kNoWriteBarrier),
               p0, IsIntPtrConstant(access.offset - access.tag()), p1,
               graph()->start(), graph()->start()));
 }
 
 
 TARGET_TEST_P(ChangeLoweringCommonTest, StoreFieldTagged) {
-  FieldAccess access = {kTaggedBase, FixedArrayBase::kHeaderSize,
-                        Handle<Name>::null(), Type::Any(),
-                        MachineType::AnyTagged()};
+  FieldAccess access = {kTaggedBase, FixedArrayBase::kHeaderSize, nullptr,
+                        Type::Any(), MachineType::AnyTagged()};
   Node* p0 = Parameter(Type::TaggedPointer());
   Node* p1 = Parameter(Type::Tagged());
   Node* store = graph()->NewNode(simplified()->StoreField(access), p0, p1,
                                  graph()->start(), graph()->start());
   Reduction r = Reduce(store);
 
   ASSERT_TRUE(r.Changed());
   EXPECT_THAT(
       r.replacement(),
       IsStore(StoreRepresentation(MachineType::AnyTagged(), kFullWriteBarrier),
               p0, IsIntPtrConstant(access.offset - access.tag()), p1,
               graph()->start(), graph()->start()));
 }
 
 
 TARGET_TEST_P(ChangeLoweringCommonTest, LoadField) {
-  FieldAccess access = {kTaggedBase, FixedArrayBase::kHeaderSize,
-                        Handle<Name>::null(), Type::Any(),
-                        MachineType::AnyTagged()};
+  FieldAccess access = {kTaggedBase, FixedArrayBase::kHeaderSize, nullptr,
+                        Type::Any(), MachineType::AnyTagged()};
   Node* p0 = Parameter(Type::TaggedPointer());
   Node* load = graph()->NewNode(simplified()->LoadField(access), p0,
                                 graph()->start(), graph()->start());
   Reduction r = Reduce(load);
 
   ASSERT_TRUE(r.Changed());
   Matcher<Node*> index_match = IsIntPtrConstant(access.offset - access.tag());
   EXPECT_THAT(r.replacement(),
               IsLoad(MachineType::AnyTagged(), p0,
                      IsIntPtrConstant(access.offset - access.tag()),
@@ skipping 381 matching lines @@
                       CaptureEq(&branch),
                       IsBranch(IsUint32LessThanOrEqual(
                                    value, IsInt32Constant(Smi::kMaxValue)),
                                graph()->start()))),
                   AllOf(CaptureEq(&if_false), IsIfFalse(CaptureEq(&branch))))));
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8