Small hash tables currently go straight from having 4 elements to
having 2048.  Make the step a bit smaller by going to 64 instead.
Reimplement bdd::zip's reloc queue to be a bit less stupid when the
number of relocs starts to pick up.  This should be moderately faster.
It also moves the bulk of the structure from the malloc heap to the GC
one, which should mean that going out of memory leads to a timeout
rather than OOM kill.
Fix a memory leak.
Make sure we run the destructor when necessary during a hash table
move.  Shouldn't make any difference at the moment, because the
destructors are all no-ops, but might be important in future.
Yet another new implementation of bdd::zip.  This is much like the
current one, except that it avoids duplicating the zipInternalTs quite
as much.
Try to reduce the number of OOM kills a bit by impsing an arbitrary
limit on the number of relocs we'll handle in a zip operation.  If we
hit this then we're probably going to timeout anyway, so just pull it
forwards a bit.
Fix OPTIMIZE=y build.
Merge github.com:sos22/SLI