Dictionary::GenerateNewEnumerationIndices() and Dictionary::EnsureCapacity() handlified.

src/objects.h

Index: src/objects.h
diff --git a/src/objects.h b/src/objects.h
index ac8f7493bcb7afdfd91d46acc27105cd54d58bd9..f97805345a14a84b38da7db788ad1c942269c4b6 100644
--- a/src/objects.h
+++ b/src/objects.h
@@ -4070,8 +4070,6 @@ class Dictionary: public HashTable<Derived, Shape, Key> {
       PretenureFlag pretenure = NOT_TENURED);
 
   // Ensure enough space for n additional elements.
-  MUST_USE_RESULT MaybeObject* EnsureCapacity(int n, Key key);
-
   static Handle<Derived> EnsureCapacity(Handle<Derived> obj, int n, Key key);
 
 #ifdef OBJECT_PRINT
@@ -4115,7 +4113,7 @@ class Dictionary: public HashTable<Derived, Shape, Key> {
       uint32_t hash);
 
   // Generate new enumeration indices to avoid enumeration index overflow.
-  MUST_USE_RESULT MaybeObject* GenerateNewEnumerationIndices();
+  static void GenerateNewEnumerationIndices(Handle<Derived> dictionary);
   static const int kMaxNumberKeyIndex = DerivedHashTable::kPrefixStartIndex;
   static const int kNextEnumerationIndexIndex = kMaxNumberKeyIndex + 1;
 };
@@ -4138,6 +4136,8 @@ class NameDictionaryShape : public BaseShape<Name*> {
 class NameDictionary: public Dictionary<NameDictionary,
                                         NameDictionaryShape,
                                         Name*> {
+  typedef Dictionary<
+      NameDictionary, NameDictionaryShape, Name*> DerivedDictionary;
  public:
   static inline NameDictionary* cast(Object* obj) {
     ASSERT(obj->IsDictionary());
@@ -4146,7 +4146,7 @@ class NameDictionary: public Dictionary<NameDictionary,
 
   // Copies enumerable keys to preallocated fixed array.
   void CopyEnumKeysTo(FixedArray* storage);
-  static void DoGenerateNewEnumerationIndices(
+  inline static void DoGenerateNewEnumerationIndices(
       Handle<NameDictionary> dictionary);
 
   // Find entry for key, otherwise return kNotFound. Optimized version of