NameDictionary's key type is now Handle<Name> instead of Name*.

src/objects-inl.h

Index: src/objects-inl.h
diff --git a/src/objects-inl.h b/src/objects-inl.h
index bc201320605a0349aa93ec489e1eb08df7be8a1b..741621e9982301a3a32f2de0c76968de65b98fc4 100644
--- a/src/objects-inl.h
+++ b/src/objects-inl.h
@@ -6648,7 +6648,7 @@ Handle<Object> NumberDictionaryShape::AsHandle(Isolate* isolate, uint32_t key) {
 }
 
 
-bool NameDictionaryShape::IsMatch(Name* key, Object* other) {
+bool NameDictionaryShape::IsMatch(Handle<Name> key, Object* other) {
   // We know that all entries in a hash table had their hash keys created.
   // Use that knowledge to have fast failure.
   if (key->Hash() != Name::cast(other)->Hash()) return false;
@@ -6656,26 +6656,26 @@ bool NameDictionaryShape::IsMatch(Name* key, Object* other) {
 }
 
 
-uint32_t NameDictionaryShape::Hash(Name* key) {
+uint32_t NameDictionaryShape::Hash(Handle<Name> key) {
   return key->Hash();
 }
 
 
-uint32_t NameDictionaryShape::HashForObject(Name* key, Object* other) {
+uint32_t NameDictionaryShape::HashForObject(Handle<Name> key, Object* other) {
   return Name::cast(other)->Hash();
 }
 
 
-MaybeObject* NameDictionaryShape::AsObject(Heap* heap, Name* key) {
+MaybeObject* NameDictionaryShape::AsObject(Heap* heap, Handle<Name> key) {
   ASSERT(key->IsUniqueName());
-  return key;
+  return *key;
 }
 
 
-Handle<Object> NameDictionaryShape::AsHandle(Isolate* isolate, Name* key) {
+Handle<Object> NameDictionaryShape::AsHandle(Isolate* isolate,
+                                             Handle<Name> key) {
   ASSERT(key->IsUniqueName());
-  // TODO(ishell): Convert Name* to Handle<Name> to avoid re-wrapping here.
-  return handle(key, isolate);
+  return key;
 }