On Wed, Jun 20, 2018 at 1:17 PM Jameson Miller <jam...@microsoft.com> wrote: > > Instead of searching all memory blocks for available space to fulfill > a memory request, only search the head block. If the head block does > not have space, assume that previous block would most likely not be > able to fulfill request either. This could potentially lead to more > memory fragmentation, but also avoids searching memory blocks that > probably will not be able to fulfill request.
Do we have any numbers on performance or memory pressure here? (I would think benchmarking fast-import would suffice as that is where the mem pool originated) > This pattern will benefit consumers that are able to generate a good > estimate for how much memory will be needed, or if they are performing > fixed sized allocations, so that once a block is exhausted it will > never be able to fulfill a future request. Would this be a good candidate to contain parts of https://public-inbox.org/git/dm5pr21mb07803e8d2627676788659e63ce...@dm5pr21mb0780.namprd21.prod.outlook.com/ ?
