summaryrefslogtreecommitdiff
path: root/sha1collisiondetection
diff options
context:
space:
mode:
authorLibravatar Jameson Miller <jamill@microsoft.com>2018-07-02 19:49:33 +0000
committerLibravatar Junio C Hamano <gitster@pobox.com>2018-07-03 10:58:27 -0700
commit8fb8e3f63654df20926f665486d2edea2fff0243 (patch)
tree0caa9ae0e3539c25dfba99b58d14097f29acd0ae /sha1collisiondetection
parentblock alloc: add lifecycle APIs for cache_entry structs (diff)
downloadtgif-8fb8e3f63654df20926f665486d2edea2fff0243.tar.xz
mem-pool: only search head block for available space
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. 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. Signed-off-by: Jameson Miller <jamill@microsoft.com> Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 'sha1collisiondetection')
0 files changed, 0 insertions, 0 deletions