tree 8782811a52a8297c50f7ef591989aa9a35228355
parent 0262241e265fc615047e9156c65f805814357280
author Willy Tarreau <w@1wt.eu> 1417616728 +0100
committer Willy Tarreau <w@1wt.eu> 1419461251 +0100
encoding latin1

MEDIUM: memory: improve pool_refill_alloc() to pass a refill count

Till now this function would only allocate one entry at a time. But with
dynamic buffers we'll like to allocate the number of missing entries to
properly refill the pool.

Let's modify it to take a minimum amount of available entries. This means
that when we know we need at least a number of available entries, we can
ask to allocate all of them at once. It also ensures that we don't move
the pointers back and forth between the caller and the pool, and that we
don't call pool_gc2() for each failed malloc. Instead, it's called only
once and the malloc is only allowed to fail once.