summaryrefslogtreecommitdiff
path: root/notes-merge.h
diff options
context:
space:
mode:
authorLibravatar Junio C Hamano <gitster@pobox.com>2018-08-02 15:30:43 -0700
committerLibravatar Junio C Hamano <gitster@pobox.com>2018-08-02 15:30:43 -0700
commitae533c4a92aef6ab180441dbb76ef83521fc87d6 (patch)
tree0e722c62f6fb4a7d053bdb9bcb37115d8946336b /notes-merge.h
parentMerge branch 'jt/fetch-nego-tip' (diff)
parentblock alloc: add validations around cache_entry lifecyle (diff)
downloadtgif-ae533c4a92aef6ab180441dbb76ef83521fc87d6.tar.xz
Merge branch 'jm/cache-entry-from-mem-pool'
For a large tree, the index needs to hold many cache entries allocated on heap. These cache entries are now allocated out of a dedicated memory pool to amortize malloc(3) overhead. * jm/cache-entry-from-mem-pool: block alloc: add validations around cache_entry lifecyle block alloc: allocate cache entries from mem_pool mem-pool: fill out functionality mem-pool: add life cycle management functions mem-pool: only search head block for available space block alloc: add lifecycle APIs for cache_entry structs read-cache: teach make_cache_entry to take object_id read-cache: teach refresh_cache_entry to take istate
Diffstat (limited to 'notes-merge.h')
0 files changed, 0 insertions, 0 deletions