summaryrefslogtreecommitdiff
path: root/bisect.c
diff options
context:
space:
mode:
authorLibravatar René Scharfe <rene.scharfe@lsrfire.ath.cx>2011-10-24 23:59:14 +0200
committerLibravatar Junio C Hamano <gitster@pobox.com>2011-10-26 15:25:59 -0700
commitdebed2a6291a29fd7b0e96f63fbf0142ed3280eb (patch)
tree89aac247843d0ca266dcf854bf656976189281f8 /bisect.c
parentMerge branch 'maint' (diff)
downloadtgif-debed2a6291a29fd7b0e96f63fbf0142ed3280eb.tar.xz
read-cache.c: allocate index entries individually
The code to estimate the in-memory size of the index based on its on-disk representation is subtly wrong for certain architecture-dependent struct layouts. Instead of fixing it, replace the code to keep the index entries in a single large block of memory and allocate each entry separately instead. This is both simpler and more flexible, as individual entries can now be freed. Actually using that added flexibility is left for a later patch. Suggested-by: Junio C Hamano <gitster@pobox.com> Signed-off-by: Rene Scharfe <rene.scharfe@lsrfire.ath.cx> Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 'bisect.c')
0 files changed, 0 insertions, 0 deletions