Implement in-place rehashing of HashTable.

Implement in-place rehashing of HashTable.

The algorithm puts elements into correct positions in  multiple iterations.
On the first iteration it tries to put elements at entries specified by
their first hash probe. On the second iteration -- by the second
hash probe, and so on. Overall it does O(k*n) memory accesses, where
k is the maximum number of probes required for an element and n is the
capacity of the hash table. The expectation is that k will be small.

R=mstarzinger@chromium.org

Committed: https://code.google.com/p/v8/source/detail?r=16678

[ulan, 2013-09-10 12:14:14]

Please take a look.

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

LGTM.

https://codereview.chromium.org/23658031/diff/5001/src/objects.h
File src/objects.h (right):

https://codereview.chromium.org/23658031/diff/5001/src/objects.h#newcode3469
src/objects.h:3469: void Rehash(Key key);
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.

[ulan, 2013-09-12 11:03:39]

Committed patchset #3 manually as r16678 (presubmit successful).