Implement in-place rehashing of HashTable.

src/objects.h

Index: src/objects.h
diff --git a/src/objects.h b/src/objects.h
index 97d1e5d0a32da82ac9aff3fe86f283ecf36a7812..af5936681aa79312390ad15ff1cc9298f17ceae0 100644
--- a/src/objects.h
+++ b/src/objects.h
@@ -3466,6 +3466,8 @@ class HashTable: public FixedArray {
   inline int FindEntry(Key key);
   int FindEntry(Isolate* isolate, Key key);
 
+  void Rehash(Key key);

[Michael Starzinger, 2013/09/12 09:39:16]

nit: Let's add a short one-liner comment saying that this is an in-place
rehashing implementation, to contrast it with the existing Rehash() function.

+
  protected:
   // Find the entry at which to insert element with the given key that
   // has the given hash value.
@@ -3512,6 +3514,13 @@ class HashTable: public FixedArray {
     return (last + number) & (size - 1);
   }
 
+  // Returns _expected_ if one of entries given by the first _probe_ probes is
+  // equal to  _expected_. Otherwise, returns the entry given by the probe
+  // number _probe_.
+  uint32_t EntryForProbe(Key key, Object* k, int probe, uint32_t expected);
+
+  void Swap(uint32_t entry1, uint32_t entry2, WriteBarrierMode mode);
+
   // Rehashes this hash-table into the new table.
   MUST_USE_RESULT MaybeObject* Rehash(HashTable* new_table, Key key);