From: Taylor Blau Date: Tue, 6 Aug 2024 15:37:33 +0000 (-0400) Subject: midx: teach `bsearch_midx()` about incremental MIDXs X-Git-Tag: v2.47.0-rc0~115^2~11 X-Git-Url: http://git.ipfire.org/?a=commitdiff_plain;h=88f309e095d084d730f908fe1ec01a92c63612c2;p=thirdparty%2Fgit.git midx: teach `bsearch_midx()` about incremental MIDXs Now that the special cases callers of `bsearch_midx()` have been dealt with, teach `bsearch_midx()` to handle incremental MIDX chains. The incremental MIDX-aware version of `bsearch_midx()` works by repeatedly searching for a given OID in each layer along the `->base_midx` pointer, stopping either when an exact match is found, or the end of the chain is reached. Signed-off-by: Taylor Blau Signed-off-by: Junio C Hamano --- diff --git a/midx.c b/midx.c index bd6e3f26c9..83857cbd1e 100644 --- a/midx.c +++ b/midx.c @@ -344,7 +344,10 @@ int bsearch_one_midx(const struct object_id *oid, struct multi_pack_index *m, int bsearch_midx(const struct object_id *oid, struct multi_pack_index *m, uint32_t *result) { - return bsearch_one_midx(oid, m, result); + for (; m; m = m->base_midx) + if (bsearch_one_midx(oid, m, result)) + return 1; + return 0; } struct object_id *nth_midxed_object_oid(struct object_id *oid,