summaryrefslogtreecommitdiff
path: root/pack-bitmap-write.c
diff options
context:
space:
mode:
authorJeff King <peff@peff.net>2020-12-08 22:03:59 (GMT)
committerJunio C Hamano <gitster@pobox.com>2020-12-08 22:48:16 (GMT)
commit010e5eacfb004218087da054a61772da8fc40463 (patch)
treeb7ee7a6e8e3a98f53838e8b44547dd6114d0ed7a /pack-bitmap-write.c
parent4a9c5817290d347f59dd47a081be8404c3cedbe8 (diff)
downloadgit-010e5eacfb004218087da054a61772da8fc40463.zip
git-010e5eacfb004218087da054a61772da8fc40463.tar.gz
git-010e5eacfb004218087da054a61772da8fc40463.tar.bz2
pack-bitmap-write: pass ownership of intermediate bitmaps
Our algorithm to generate reachability bitmaps walks through the commit graph from the bottom up, passing bitmap data from each commit to its descendants. For a linear stretch of history like: A -- B -- C our sequence of steps is: - compute the bitmap for A by walking its trees, etc - duplicate A's bitmap as a starting point for B; we can now free A's bitmap, since we only needed it as an intermediate result - OR in any extra objects that B can reach into its bitmap - duplicate B's bitmap as a starting point for C; likewise, free B's bitmap - OR in objects for C, and so on... Rather than duplicating bitmaps and immediately freeing the original, we can just pass ownership from commit to commit. Note that this doesn't always work: - the recipient may be a merge which already has an intermediate bitmap from its other ancestor. In that case we have to OR our result into it. Note that the first ancestor to reach the merge does get to pass ownership, though. - we may have multiple children; we can only pass ownership to one of them However, it happens often enough and copying bitmaps is expensive enough that this provides a noticeable speedup. On a clone of linux.git, this reduces the time to generate bitmaps from 205s to 70s. This is about the same amount of time it took to generate bitmaps using our old "many traversals" algorithm (the previous commit measures the identical scenario as taking 63s). It unfortunately provides only a very modest reduction in the peak memory usage, though. Signed-off-by: Jeff King <peff@peff.net> Signed-off-by: Taylor Blau <me@ttaylorr.com> Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 'pack-bitmap-write.c')
-rw-r--r--pack-bitmap-write.c10
1 files changed, 8 insertions, 2 deletions
diff --git a/pack-bitmap-write.c b/pack-bitmap-write.c
index bcd059c..1eb9615 100644
--- a/pack-bitmap-write.c
+++ b/pack-bitmap-write.c
@@ -333,6 +333,7 @@ void bitmap_writer_build(struct packing_data *to_pack)
struct commit *commit = bb.commits[i-1];
struct bb_commit *ent = bb_data_at(&bb.data, commit);
struct commit *child;
+ int reused = 0;
fill_bitmap_commit(ent, commit);
@@ -348,10 +349,15 @@ void bitmap_writer_build(struct packing_data *to_pack)
if (child_ent->bitmap)
bitmap_or(child_ent->bitmap, ent->bitmap);
- else
+ else if (reused)
child_ent->bitmap = bitmap_dup(ent->bitmap);
+ else {
+ child_ent->bitmap = ent->bitmap;
+ reused = 1;
+ }
}
- bitmap_free(ent->bitmap);
+ if (!reused)
+ bitmap_free(ent->bitmap);
ent->bitmap = NULL;
}
bitmap_builder_clear(&bb);