summaryrefslogtreecommitdiff
path: root/pack-redundant.c
diff options
context:
space:
mode:
authorShawn O. Pearce <spearce@spearce.org>2007-05-26 01:24:19 -0400
committerJunio C Hamano <junkio@cox.net>2007-05-26 20:28:08 -0700
commitd079837eeeadc37d266113a1fd2deb0a01aaee91 (patch)
tree96af52e5f25b1152674763a1c819d892bd75f9bb /pack-redundant.c
parent99b5a79e1329468bee26ae3bd9070c47418279d0 (diff)
downloadgit-d079837eeeadc37d266113a1fd2deb0a01aaee91.tar.gz
Lazily open pack index files on demand
In some repository configurations the user may have many packfiles, but all of the recent commits/trees/tags/blobs are likely to be in the most recent packfile (the one with the newest mtime). It is therefore common to be able to complete an entire operation by accessing only one packfile, even if there are 25 packfiles available to the repository. Rather than opening and mmaping the corresponding .idx file for every pack found, we now only open and map the .idx when we suspect there might be an object of interest in there. Of course we cannot known in advance which packfile contains an object, so we still need to scan the entire packed_git list to locate anything. But odds are users want to access objects in the most recently created packfiles first, and that may be all they ever need for the current operation. Junio observed in b867092f that placing recent packfiles before older ones can slightly improve access times for recent objects, without degrading it for historical object access. This change improves upon Junio's observations by trying even harder to avoid the .idx files that we won't need. Signed-off-by: Shawn O. Pearce <spearce@spearce.org> Signed-off-by: Junio C Hamano <junkio@cox.net>
Diffstat (limited to 'pack-redundant.c')
-rw-r--r--pack-redundant.c3
1 files changed, 3 insertions, 0 deletions
diff --git a/pack-redundant.c b/pack-redundant.c
index 87077e150c..06173206f0 100644
--- a/pack-redundant.c
+++ b/pack-redundant.c
@@ -550,6 +550,9 @@ static struct pack_list * add_pack(struct packed_git *p)
l.pack = p;
llist_init(&l.all_objects);
+ if (!p->index_data && open_pack_index(p))
+ return NULL;
+
base = p->index_data;
base += 256 * 4 + ((p->index_version < 2) ? 4 : 8);
step = (p->index_version < 2) ? 24 : 20;