1 #include "git-compat-util.h"
11 #include "object-file.h"
12 #include "object-store.h"
13 #include "hash-lookup.h"
17 #include "run-command.h"
18 #include "repository.h"
19 #include "chunk-format.h"
21 #include "pack-bitmap.h"
24 #include "list-objects.h"
26 #define MIDX_SIGNATURE 0x4d494458 /* "MIDX" */
27 #define MIDX_VERSION 1
28 #define MIDX_BYTE_FILE_VERSION 4
29 #define MIDX_BYTE_HASH_VERSION 5
30 #define MIDX_BYTE_NUM_CHUNKS 6
31 #define MIDX_BYTE_NUM_PACKS 8
32 #define MIDX_HEADER_SIZE 12
33 #define MIDX_MIN_SIZE (MIDX_HEADER_SIZE + the_hash_algo->rawsz)
35 #define MIDX_CHUNK_ALIGNMENT 4
36 #define MIDX_CHUNKID_PACKNAMES 0x504e414d /* "PNAM" */
37 #define MIDX_CHUNKID_OIDFANOUT 0x4f494446 /* "OIDF" */
38 #define MIDX_CHUNKID_OIDLOOKUP 0x4f49444c /* "OIDL" */
39 #define MIDX_CHUNKID_OBJECTOFFSETS 0x4f4f4646 /* "OOFF" */
40 #define MIDX_CHUNKID_LARGEOFFSETS 0x4c4f4646 /* "LOFF" */
41 #define MIDX_CHUNKID_REVINDEX 0x52494458 /* "RIDX" */
42 #define MIDX_CHUNK_FANOUT_SIZE (sizeof(uint32_t) * 256)
43 #define MIDX_CHUNK_OFFSET_WIDTH (2 * sizeof(uint32_t))
44 #define MIDX_CHUNK_LARGE_OFFSET_WIDTH (sizeof(uint64_t))
45 #define MIDX_LARGE_OFFSET_NEEDED 0x80000000
47 #define PACK_EXPIRED UINT_MAX
49 const unsigned char *get_midx_checksum(struct multi_pack_index
*m
)
51 return m
->data
+ m
->data_len
- the_hash_algo
->rawsz
;
54 void get_midx_filename(struct strbuf
*out
, const char *object_dir
)
56 strbuf_addf(out
, "%s/pack/multi-pack-index", object_dir
);
59 void get_midx_rev_filename(struct strbuf
*out
, struct multi_pack_index
*m
)
61 get_midx_filename(out
, m
->object_dir
);
62 strbuf_addf(out
, "-%s.rev", hash_to_hex(get_midx_checksum(m
)));
65 static int midx_read_oid_fanout(const unsigned char *chunk_start
,
66 size_t chunk_size
, void *data
)
68 struct multi_pack_index
*m
= data
;
69 m
->chunk_oid_fanout
= (uint32_t *)chunk_start
;
71 if (chunk_size
!= 4 * 256) {
72 error(_("multi-pack-index OID fanout is of the wrong size"));
78 struct multi_pack_index
*load_multi_pack_index(const char *object_dir
, int local
)
80 struct multi_pack_index
*m
= NULL
;
84 void *midx_map
= NULL
;
85 uint32_t hash_version
;
86 struct strbuf midx_name
= STRBUF_INIT
;
88 const char *cur_pack_name
;
89 struct chunkfile
*cf
= NULL
;
91 get_midx_filename(&midx_name
, object_dir
);
93 fd
= git_open(midx_name
.buf
);
98 error_errno(_("failed to read %s"), midx_name
.buf
);
102 midx_size
= xsize_t(st
.st_size
);
104 if (midx_size
< MIDX_MIN_SIZE
) {
105 error(_("multi-pack-index file %s is too small"), midx_name
.buf
);
109 strbuf_release(&midx_name
);
111 midx_map
= xmmap(NULL
, midx_size
, PROT_READ
, MAP_PRIVATE
, fd
, 0);
114 FLEX_ALLOC_STR(m
, object_dir
, object_dir
);
116 m
->data_len
= midx_size
;
119 m
->signature
= get_be32(m
->data
);
120 if (m
->signature
!= MIDX_SIGNATURE
)
121 die(_("multi-pack-index signature 0x%08x does not match signature 0x%08x"),
122 m
->signature
, MIDX_SIGNATURE
);
124 m
->version
= m
->data
[MIDX_BYTE_FILE_VERSION
];
125 if (m
->version
!= MIDX_VERSION
)
126 die(_("multi-pack-index version %d not recognized"),
129 hash_version
= m
->data
[MIDX_BYTE_HASH_VERSION
];
130 if (hash_version
!= oid_version(the_hash_algo
)) {
131 error(_("multi-pack-index hash version %u does not match version %u"),
132 hash_version
, oid_version(the_hash_algo
));
135 m
->hash_len
= the_hash_algo
->rawsz
;
137 m
->num_chunks
= m
->data
[MIDX_BYTE_NUM_CHUNKS
];
139 m
->num_packs
= get_be32(m
->data
+ MIDX_BYTE_NUM_PACKS
);
141 cf
= init_chunkfile(NULL
);
143 if (read_table_of_contents(cf
, m
->data
, midx_size
,
144 MIDX_HEADER_SIZE
, m
->num_chunks
))
147 if (pair_chunk(cf
, MIDX_CHUNKID_PACKNAMES
, &m
->chunk_pack_names
) == CHUNK_NOT_FOUND
)
148 die(_("multi-pack-index missing required pack-name chunk"));
149 if (read_chunk(cf
, MIDX_CHUNKID_OIDFANOUT
, midx_read_oid_fanout
, m
) == CHUNK_NOT_FOUND
)
150 die(_("multi-pack-index missing required OID fanout chunk"));
151 if (pair_chunk(cf
, MIDX_CHUNKID_OIDLOOKUP
, &m
->chunk_oid_lookup
) == CHUNK_NOT_FOUND
)
152 die(_("multi-pack-index missing required OID lookup chunk"));
153 if (pair_chunk(cf
, MIDX_CHUNKID_OBJECTOFFSETS
, &m
->chunk_object_offsets
) == CHUNK_NOT_FOUND
)
154 die(_("multi-pack-index missing required object offsets chunk"));
156 pair_chunk(cf
, MIDX_CHUNKID_LARGEOFFSETS
, &m
->chunk_large_offsets
);
158 if (git_env_bool("GIT_TEST_MIDX_READ_RIDX", 1))
159 pair_chunk(cf
, MIDX_CHUNKID_REVINDEX
, &m
->chunk_revindex
);
161 m
->num_objects
= ntohl(m
->chunk_oid_fanout
[255]);
163 CALLOC_ARRAY(m
->pack_names
, m
->num_packs
);
164 CALLOC_ARRAY(m
->packs
, m
->num_packs
);
166 cur_pack_name
= (const char *)m
->chunk_pack_names
;
167 for (i
= 0; i
< m
->num_packs
; i
++) {
168 m
->pack_names
[i
] = cur_pack_name
;
170 cur_pack_name
+= strlen(cur_pack_name
) + 1;
172 if (i
&& strcmp(m
->pack_names
[i
], m
->pack_names
[i
- 1]) <= 0)
173 die(_("multi-pack-index pack names out of order: '%s' before '%s'"),
174 m
->pack_names
[i
- 1],
178 trace2_data_intmax("midx", the_repository
, "load/num_packs", m
->num_packs
);
179 trace2_data_intmax("midx", the_repository
, "load/num_objects", m
->num_objects
);
186 strbuf_release(&midx_name
);
189 munmap(midx_map
, midx_size
);
195 void close_midx(struct multi_pack_index
*m
)
204 munmap((unsigned char *)m
->data
, m
->data_len
);
206 for (i
= 0; i
< m
->num_packs
; i
++) {
208 m
->packs
[i
]->multi_pack_index
= 0;
210 FREE_AND_NULL(m
->packs
);
211 FREE_AND_NULL(m
->pack_names
);
215 int prepare_midx_pack(struct repository
*r
, struct multi_pack_index
*m
, uint32_t pack_int_id
)
217 struct strbuf pack_name
= STRBUF_INIT
;
218 struct packed_git
*p
;
220 if (pack_int_id
>= m
->num_packs
)
221 die(_("bad pack-int-id: %u (%u total packs)"),
222 pack_int_id
, m
->num_packs
);
224 if (m
->packs
[pack_int_id
])
227 strbuf_addf(&pack_name
, "%s/pack/%s", m
->object_dir
,
228 m
->pack_names
[pack_int_id
]);
230 p
= add_packed_git(pack_name
.buf
, pack_name
.len
, m
->local
);
231 strbuf_release(&pack_name
);
236 p
->multi_pack_index
= 1;
237 m
->packs
[pack_int_id
] = p
;
238 install_packed_git(r
, p
);
239 list_add_tail(&p
->mru
, &r
->objects
->packed_git_mru
);
244 int bsearch_midx(const struct object_id
*oid
, struct multi_pack_index
*m
, uint32_t *result
)
246 return bsearch_hash(oid
->hash
, m
->chunk_oid_fanout
, m
->chunk_oid_lookup
,
247 the_hash_algo
->rawsz
, result
);
250 struct object_id
*nth_midxed_object_oid(struct object_id
*oid
,
251 struct multi_pack_index
*m
,
254 if (n
>= m
->num_objects
)
257 oidread(oid
, m
->chunk_oid_lookup
+ st_mult(m
->hash_len
, n
));
261 off_t
nth_midxed_offset(struct multi_pack_index
*m
, uint32_t pos
)
263 const unsigned char *offset_data
;
266 offset_data
= m
->chunk_object_offsets
+ (off_t
)pos
* MIDX_CHUNK_OFFSET_WIDTH
;
267 offset32
= get_be32(offset_data
+ sizeof(uint32_t));
269 if (m
->chunk_large_offsets
&& offset32
& MIDX_LARGE_OFFSET_NEEDED
) {
270 if (sizeof(off_t
) < sizeof(uint64_t))
271 die(_("multi-pack-index stores a 64-bit offset, but off_t is too small"));
273 offset32
^= MIDX_LARGE_OFFSET_NEEDED
;
274 return get_be64(m
->chunk_large_offsets
+
275 st_mult(sizeof(uint64_t), offset32
));
281 uint32_t nth_midxed_pack_int_id(struct multi_pack_index
*m
, uint32_t pos
)
283 return get_be32(m
->chunk_object_offsets
+
284 (off_t
)pos
* MIDX_CHUNK_OFFSET_WIDTH
);
287 int fill_midx_entry(struct repository
*r
,
288 const struct object_id
*oid
,
289 struct pack_entry
*e
,
290 struct multi_pack_index
*m
)
293 uint32_t pack_int_id
;
294 struct packed_git
*p
;
296 if (!bsearch_midx(oid
, m
, &pos
))
299 if (pos
>= m
->num_objects
)
302 pack_int_id
= nth_midxed_pack_int_id(m
, pos
);
304 if (prepare_midx_pack(r
, m
, pack_int_id
))
306 p
= m
->packs
[pack_int_id
];
309 * We are about to tell the caller where they can locate the
310 * requested object. We better make sure the packfile is
311 * still here and can be accessed before supplying that
312 * answer, as it may have been deleted since the MIDX was
315 if (!is_pack_valid(p
))
318 if (oidset_size(&p
->bad_objects
) &&
319 oidset_contains(&p
->bad_objects
, oid
))
322 e
->offset
= nth_midxed_offset(m
, pos
);
328 /* Match "foo.idx" against either "foo.pack" _or_ "foo.idx". */
329 static int cmp_idx_or_pack_name(const char *idx_or_pack_name
,
330 const char *idx_name
)
332 /* Skip past any initial matching prefix. */
333 while (*idx_name
&& *idx_name
== *idx_or_pack_name
) {
339 * If we didn't match completely, we may have matched "pack-1234." and
340 * be left with "idx" and "pack" respectively, which is also OK. We do
341 * not have to check for "idx" and "idx", because that would have been
342 * a complete match (and in that case these strcmps will be false, but
343 * we'll correctly return 0 from the final strcmp() below.
345 * Technically this matches "fooidx" and "foopack", but we'd never have
346 * such names in the first place.
348 if (!strcmp(idx_name
, "idx") && !strcmp(idx_or_pack_name
, "pack"))
352 * This not only checks for a complete match, but also orders based on
353 * the first non-identical character, which means our ordering will
354 * match a raw strcmp(). That makes it OK to use this to binary search
355 * a naively-sorted list.
357 return strcmp(idx_or_pack_name
, idx_name
);
360 int midx_contains_pack(struct multi_pack_index
*m
, const char *idx_or_pack_name
)
362 uint32_t first
= 0, last
= m
->num_packs
;
364 while (first
< last
) {
365 uint32_t mid
= first
+ (last
- first
) / 2;
369 current
= m
->pack_names
[mid
];
370 cmp
= cmp_idx_or_pack_name(idx_or_pack_name
, current
);
383 int prepare_multi_pack_index_one(struct repository
*r
, const char *object_dir
, int local
)
385 struct multi_pack_index
*m
;
386 struct multi_pack_index
*m_search
;
388 prepare_repo_settings(r
);
389 if (!r
->settings
.core_multi_pack_index
)
392 for (m_search
= r
->objects
->multi_pack_index
; m_search
; m_search
= m_search
->next
)
393 if (!strcmp(object_dir
, m_search
->object_dir
))
396 m
= load_multi_pack_index(object_dir
, local
);
399 struct multi_pack_index
*mp
= r
->objects
->multi_pack_index
;
404 r
->objects
->multi_pack_index
= m
;
411 static size_t write_midx_header(struct hashfile
*f
,
412 unsigned char num_chunks
,
415 hashwrite_be32(f
, MIDX_SIGNATURE
);
416 hashwrite_u8(f
, MIDX_VERSION
);
417 hashwrite_u8(f
, oid_version(the_hash_algo
));
418 hashwrite_u8(f
, num_chunks
);
419 hashwrite_u8(f
, 0); /* unused */
420 hashwrite_be32(f
, num_packs
);
422 return MIDX_HEADER_SIZE
;
426 uint32_t orig_pack_int_id
;
428 struct packed_git
*p
;
429 unsigned expired
: 1;
432 static int pack_info_compare(const void *_a
, const void *_b
)
434 struct pack_info
*a
= (struct pack_info
*)_a
;
435 struct pack_info
*b
= (struct pack_info
*)_b
;
436 return strcmp(a
->pack_name
, b
->pack_name
);
439 static int idx_or_pack_name_cmp(const void *_va
, const void *_vb
)
441 const char *pack_name
= _va
;
442 const struct pack_info
*compar
= _vb
;
444 return cmp_idx_or_pack_name(pack_name
, compar
->pack_name
);
447 struct write_midx_context
{
448 struct pack_info
*info
;
451 struct multi_pack_index
*m
;
452 struct progress
*progress
;
453 unsigned pack_paths_checked
;
455 struct pack_midx_entry
*entries
;
459 uint32_t *pack_order
;
460 unsigned large_offsets_needed
:1;
461 uint32_t num_large_offsets
;
463 int preferred_pack_idx
;
465 struct string_list
*to_include
;
468 static void add_pack_to_midx(const char *full_path
, size_t full_path_len
,
469 const char *file_name
, void *data
)
471 struct write_midx_context
*ctx
= data
;
473 if (ends_with(file_name
, ".idx")) {
474 display_progress(ctx
->progress
, ++ctx
->pack_paths_checked
);
476 * Note that at most one of ctx->m and ctx->to_include are set,
477 * so we are testing midx_contains_pack() and
478 * string_list_has_string() independently (guarded by the
479 * appropriate NULL checks).
481 * We could support passing to_include while reusing an existing
482 * MIDX, but don't currently since the reuse process drags
483 * forward all packs from an existing MIDX (without checking
484 * whether or not they appear in the to_include list).
486 * If we added support for that, these next two conditional
487 * should be performed independently (likely checking
488 * to_include before the existing MIDX).
490 if (ctx
->m
&& midx_contains_pack(ctx
->m
, file_name
))
492 else if (ctx
->to_include
&&
493 !string_list_has_string(ctx
->to_include
, file_name
))
496 ALLOC_GROW(ctx
->info
, ctx
->nr
+ 1, ctx
->alloc
);
498 ctx
->info
[ctx
->nr
].p
= add_packed_git(full_path
,
502 if (!ctx
->info
[ctx
->nr
].p
) {
503 warning(_("failed to add packfile '%s'"),
508 if (open_pack_index(ctx
->info
[ctx
->nr
].p
)) {
509 warning(_("failed to open pack-index '%s'"),
511 close_pack(ctx
->info
[ctx
->nr
].p
);
512 FREE_AND_NULL(ctx
->info
[ctx
->nr
].p
);
516 ctx
->info
[ctx
->nr
].pack_name
= xstrdup(file_name
);
517 ctx
->info
[ctx
->nr
].orig_pack_int_id
= ctx
->nr
;
518 ctx
->info
[ctx
->nr
].expired
= 0;
523 struct pack_midx_entry
{
524 struct object_id oid
;
525 uint32_t pack_int_id
;
528 unsigned preferred
: 1;
531 static int midx_oid_compare(const void *_a
, const void *_b
)
533 const struct pack_midx_entry
*a
= (const struct pack_midx_entry
*)_a
;
534 const struct pack_midx_entry
*b
= (const struct pack_midx_entry
*)_b
;
535 int cmp
= oidcmp(&a
->oid
, &b
->oid
);
540 /* Sort objects in a preferred pack first when multiple copies exist. */
541 if (a
->preferred
> b
->preferred
)
543 if (a
->preferred
< b
->preferred
)
546 if (a
->pack_mtime
> b
->pack_mtime
)
548 else if (a
->pack_mtime
< b
->pack_mtime
)
551 return a
->pack_int_id
- b
->pack_int_id
;
554 static int nth_midxed_pack_midx_entry(struct multi_pack_index
*m
,
555 struct pack_midx_entry
*e
,
558 if (pos
>= m
->num_objects
)
561 nth_midxed_object_oid(&e
->oid
, m
, pos
);
562 e
->pack_int_id
= nth_midxed_pack_int_id(m
, pos
);
563 e
->offset
= nth_midxed_offset(m
, pos
);
565 /* consider objects in midx to be from "old" packs */
570 static void fill_pack_entry(uint32_t pack_int_id
,
571 struct packed_git
*p
,
573 struct pack_midx_entry
*entry
,
576 if (nth_packed_object_id(&entry
->oid
, p
, cur_object
) < 0)
577 die(_("failed to locate object %d in packfile"), cur_object
);
579 entry
->pack_int_id
= pack_int_id
;
580 entry
->pack_mtime
= p
->mtime
;
582 entry
->offset
= nth_packed_object_offset(p
, cur_object
);
583 entry
->preferred
= !!preferred
;
587 struct pack_midx_entry
*entries
;
591 static void midx_fanout_grow(struct midx_fanout
*fanout
, size_t nr
)
594 BUG("negative growth in midx_fanout_grow() (%"PRIuMAX
" < %"PRIuMAX
")",
595 (uintmax_t)nr
, (uintmax_t)fanout
->nr
);
596 ALLOC_GROW(fanout
->entries
, nr
, fanout
->alloc
);
599 static void midx_fanout_sort(struct midx_fanout
*fanout
)
601 QSORT(fanout
->entries
, fanout
->nr
, midx_oid_compare
);
604 static void midx_fanout_add_midx_fanout(struct midx_fanout
*fanout
,
605 struct multi_pack_index
*m
,
609 uint32_t start
= 0, end
;
613 start
= ntohl(m
->chunk_oid_fanout
[cur_fanout
- 1]);
614 end
= ntohl(m
->chunk_oid_fanout
[cur_fanout
]);
616 for (cur_object
= start
; cur_object
< end
; cur_object
++) {
617 if ((preferred_pack
> -1) &&
618 (preferred_pack
== nth_midxed_pack_int_id(m
, cur_object
))) {
620 * Objects from preferred packs are added
626 midx_fanout_grow(fanout
, fanout
->nr
+ 1);
627 nth_midxed_pack_midx_entry(m
,
628 &fanout
->entries
[fanout
->nr
],
630 fanout
->entries
[fanout
->nr
].preferred
= 0;
635 static void midx_fanout_add_pack_fanout(struct midx_fanout
*fanout
,
636 struct pack_info
*info
,
641 struct packed_git
*pack
= info
[cur_pack
].p
;
642 uint32_t start
= 0, end
;
646 start
= get_pack_fanout(pack
, cur_fanout
- 1);
647 end
= get_pack_fanout(pack
, cur_fanout
);
649 for (cur_object
= start
; cur_object
< end
; cur_object
++) {
650 midx_fanout_grow(fanout
, fanout
->nr
+ 1);
651 fill_pack_entry(cur_pack
,
654 &fanout
->entries
[fanout
->nr
],
661 * It is possible to artificially get into a state where there are many
662 * duplicate copies of objects. That can create high memory pressure if
663 * we are to create a list of all objects before de-duplication. To reduce
664 * this memory pressure without a significant performance drop, automatically
665 * group objects by the first byte of their object id. Use the IDX fanout
666 * tables to group the data, copy to a local array, then sort.
668 * Copy only the de-duplicated entries (selected by most-recent modified time
669 * of a packfile containing the object).
671 static struct pack_midx_entry
*get_sorted_entries(struct multi_pack_index
*m
,
672 struct pack_info
*info
,
674 uint32_t *nr_objects
,
677 uint32_t cur_fanout
, cur_pack
, cur_object
;
678 uint32_t alloc_objects
, total_objects
= 0;
679 struct midx_fanout fanout
= { 0 };
680 struct pack_midx_entry
*deduplicated_entries
= NULL
;
681 uint32_t start_pack
= m
? m
->num_packs
: 0;
683 for (cur_pack
= start_pack
; cur_pack
< nr_packs
; cur_pack
++)
684 total_objects
+= info
[cur_pack
].p
->num_objects
;
687 * As we de-duplicate by fanout value, we expect the fanout
688 * slices to be evenly distributed, with some noise. Hence,
689 * allocate slightly more than one 256th.
691 alloc_objects
= fanout
.alloc
= total_objects
> 3200 ? total_objects
/ 200 : 16;
693 ALLOC_ARRAY(fanout
.entries
, fanout
.alloc
);
694 ALLOC_ARRAY(deduplicated_entries
, alloc_objects
);
697 for (cur_fanout
= 0; cur_fanout
< 256; cur_fanout
++) {
701 midx_fanout_add_midx_fanout(&fanout
, m
, cur_fanout
,
704 for (cur_pack
= start_pack
; cur_pack
< nr_packs
; cur_pack
++) {
705 int preferred
= cur_pack
== preferred_pack
;
706 midx_fanout_add_pack_fanout(&fanout
,
708 preferred
, cur_fanout
);
711 if (-1 < preferred_pack
&& preferred_pack
< start_pack
)
712 midx_fanout_add_pack_fanout(&fanout
, info
,
716 midx_fanout_sort(&fanout
);
719 * The batch is now sorted by OID and then mtime (descending).
720 * Take only the first duplicate.
722 for (cur_object
= 0; cur_object
< fanout
.nr
; cur_object
++) {
723 if (cur_object
&& oideq(&fanout
.entries
[cur_object
- 1].oid
,
724 &fanout
.entries
[cur_object
].oid
))
727 ALLOC_GROW(deduplicated_entries
, *nr_objects
+ 1, alloc_objects
);
728 memcpy(&deduplicated_entries
[*nr_objects
],
729 &fanout
.entries
[cur_object
],
730 sizeof(struct pack_midx_entry
));
735 free(fanout
.entries
);
736 return deduplicated_entries
;
739 static int write_midx_pack_names(struct hashfile
*f
, void *data
)
741 struct write_midx_context
*ctx
= data
;
743 unsigned char padding
[MIDX_CHUNK_ALIGNMENT
];
746 for (i
= 0; i
< ctx
->nr
; i
++) {
749 if (ctx
->info
[i
].expired
)
752 if (i
&& strcmp(ctx
->info
[i
].pack_name
, ctx
->info
[i
- 1].pack_name
) <= 0)
753 BUG("incorrect pack-file order: %s before %s",
754 ctx
->info
[i
- 1].pack_name
,
755 ctx
->info
[i
].pack_name
);
757 writelen
= strlen(ctx
->info
[i
].pack_name
) + 1;
758 hashwrite(f
, ctx
->info
[i
].pack_name
, writelen
);
762 /* add padding to be aligned */
763 i
= MIDX_CHUNK_ALIGNMENT
- (written
% MIDX_CHUNK_ALIGNMENT
);
764 if (i
< MIDX_CHUNK_ALIGNMENT
) {
765 memset(padding
, 0, sizeof(padding
));
766 hashwrite(f
, padding
, i
);
772 static int write_midx_oid_fanout(struct hashfile
*f
,
775 struct write_midx_context
*ctx
= data
;
776 struct pack_midx_entry
*list
= ctx
->entries
;
777 struct pack_midx_entry
*last
= ctx
->entries
+ ctx
->entries_nr
;
782 * Write the first-level table (the list is sorted,
783 * but we use a 256-entry lookup to be able to avoid
784 * having to do eight extra binary search iterations).
786 for (i
= 0; i
< 256; i
++) {
787 struct pack_midx_entry
*next
= list
;
789 while (next
< last
&& next
->oid
.hash
[0] == i
) {
794 hashwrite_be32(f
, count
);
801 static int write_midx_oid_lookup(struct hashfile
*f
,
804 struct write_midx_context
*ctx
= data
;
805 unsigned char hash_len
= the_hash_algo
->rawsz
;
806 struct pack_midx_entry
*list
= ctx
->entries
;
809 for (i
= 0; i
< ctx
->entries_nr
; i
++) {
810 struct pack_midx_entry
*obj
= list
++;
812 if (i
< ctx
->entries_nr
- 1) {
813 struct pack_midx_entry
*next
= list
;
814 if (oidcmp(&obj
->oid
, &next
->oid
) >= 0)
815 BUG("OIDs not in order: %s >= %s",
816 oid_to_hex(&obj
->oid
),
817 oid_to_hex(&next
->oid
));
820 hashwrite(f
, obj
->oid
.hash
, (int)hash_len
);
826 static int write_midx_object_offsets(struct hashfile
*f
,
829 struct write_midx_context
*ctx
= data
;
830 struct pack_midx_entry
*list
= ctx
->entries
;
831 uint32_t i
, nr_large_offset
= 0;
833 for (i
= 0; i
< ctx
->entries_nr
; i
++) {
834 struct pack_midx_entry
*obj
= list
++;
836 if (ctx
->pack_perm
[obj
->pack_int_id
] == PACK_EXPIRED
)
837 BUG("object %s is in an expired pack with int-id %d",
838 oid_to_hex(&obj
->oid
),
841 hashwrite_be32(f
, ctx
->pack_perm
[obj
->pack_int_id
]);
843 if (ctx
->large_offsets_needed
&& obj
->offset
>> 31)
844 hashwrite_be32(f
, MIDX_LARGE_OFFSET_NEEDED
| nr_large_offset
++);
845 else if (!ctx
->large_offsets_needed
&& obj
->offset
>> 32)
846 BUG("object %s requires a large offset (%"PRIx64
") but the MIDX is not writing large offsets!",
847 oid_to_hex(&obj
->oid
),
850 hashwrite_be32(f
, (uint32_t)obj
->offset
);
856 static int write_midx_large_offsets(struct hashfile
*f
,
859 struct write_midx_context
*ctx
= data
;
860 struct pack_midx_entry
*list
= ctx
->entries
;
861 struct pack_midx_entry
*end
= ctx
->entries
+ ctx
->entries_nr
;
862 uint32_t nr_large_offset
= ctx
->num_large_offsets
;
864 while (nr_large_offset
) {
865 struct pack_midx_entry
*obj
;
869 BUG("too many large-offset objects");
872 offset
= obj
->offset
;
877 hashwrite_be64(f
, offset
);
885 static int write_midx_revindex(struct hashfile
*f
,
888 struct write_midx_context
*ctx
= data
;
891 for (i
= 0; i
< ctx
->entries_nr
; i
++)
892 hashwrite_be32(f
, ctx
->pack_order
[i
]);
897 struct midx_pack_order_data
{
903 static int midx_pack_order_cmp(const void *va
, const void *vb
)
905 const struct midx_pack_order_data
*a
= va
, *b
= vb
;
906 if (a
->pack
< b
->pack
)
908 else if (a
->pack
> b
->pack
)
910 else if (a
->offset
< b
->offset
)
912 else if (a
->offset
> b
->offset
)
918 static uint32_t *midx_pack_order(struct write_midx_context
*ctx
)
920 struct midx_pack_order_data
*data
;
921 uint32_t *pack_order
;
924 trace2_region_enter("midx", "midx_pack_order", the_repository
);
926 ALLOC_ARRAY(data
, ctx
->entries_nr
);
927 for (i
= 0; i
< ctx
->entries_nr
; i
++) {
928 struct pack_midx_entry
*e
= &ctx
->entries
[i
];
930 data
[i
].pack
= ctx
->pack_perm
[e
->pack_int_id
];
932 data
[i
].pack
|= (1U << 31);
933 data
[i
].offset
= e
->offset
;
936 QSORT(data
, ctx
->entries_nr
, midx_pack_order_cmp
);
938 ALLOC_ARRAY(pack_order
, ctx
->entries_nr
);
939 for (i
= 0; i
< ctx
->entries_nr
; i
++)
940 pack_order
[i
] = data
[i
].nr
;
943 trace2_region_leave("midx", "midx_pack_order", the_repository
);
948 static void write_midx_reverse_index(char *midx_name
, unsigned char *midx_hash
,
949 struct write_midx_context
*ctx
)
951 struct strbuf buf
= STRBUF_INIT
;
952 const char *tmp_file
;
954 trace2_region_enter("midx", "write_midx_reverse_index", the_repository
);
956 strbuf_addf(&buf
, "%s-%s.rev", midx_name
, hash_to_hex(midx_hash
));
958 tmp_file
= write_rev_file_order(NULL
, ctx
->pack_order
, ctx
->entries_nr
,
959 midx_hash
, WRITE_REV
);
961 if (finalize_object_file(tmp_file
, buf
.buf
))
962 die(_("cannot store reverse index file"));
964 strbuf_release(&buf
);
966 trace2_region_leave("midx", "write_midx_reverse_index", the_repository
);
969 static void clear_midx_files_ext(const char *object_dir
, const char *ext
,
970 unsigned char *keep_hash
);
972 static int midx_checksum_valid(struct multi_pack_index
*m
)
974 return hashfile_checksum_valid(m
->data
, m
->data_len
);
977 static void prepare_midx_packing_data(struct packing_data
*pdata
,
978 struct write_midx_context
*ctx
)
982 trace2_region_enter("midx", "prepare_midx_packing_data", the_repository
);
984 memset(pdata
, 0, sizeof(struct packing_data
));
985 prepare_packing_data(the_repository
, pdata
);
987 for (i
= 0; i
< ctx
->entries_nr
; i
++) {
988 struct pack_midx_entry
*from
= &ctx
->entries
[ctx
->pack_order
[i
]];
989 struct object_entry
*to
= packlist_alloc(pdata
, &from
->oid
);
991 oe_set_in_pack(pdata
, to
,
992 ctx
->info
[ctx
->pack_perm
[from
->pack_int_id
]].p
);
995 trace2_region_leave("midx", "prepare_midx_packing_data", the_repository
);
998 static int add_ref_to_pending(const char *refname
,
999 const struct object_id
*oid
,
1000 int flag
, void *cb_data
)
1002 struct rev_info
*revs
= (struct rev_info
*)cb_data
;
1003 struct object_id peeled
;
1004 struct object
*object
;
1006 if ((flag
& REF_ISSYMREF
) && (flag
& REF_ISBROKEN
)) {
1007 warning("symbolic ref is dangling: %s", refname
);
1011 if (!peel_iterated_oid(oid
, &peeled
))
1014 object
= parse_object_or_die(oid
, refname
);
1015 if (object
->type
!= OBJ_COMMIT
)
1018 add_pending_object(revs
, object
, "");
1019 if (bitmap_is_preferred_refname(revs
->repo
, refname
))
1020 object
->flags
|= NEEDS_BITMAP
;
1024 struct bitmap_commit_cb
{
1025 struct commit
**commits
;
1026 size_t commits_nr
, commits_alloc
;
1028 struct write_midx_context
*ctx
;
1031 static const struct object_id
*bitmap_oid_access(size_t index
,
1032 const void *_entries
)
1034 const struct pack_midx_entry
*entries
= _entries
;
1035 return &entries
[index
].oid
;
1038 static void bitmap_show_commit(struct commit
*commit
, void *_data
)
1040 struct bitmap_commit_cb
*data
= _data
;
1041 int pos
= oid_pos(&commit
->object
.oid
, data
->ctx
->entries
,
1042 data
->ctx
->entries_nr
,
1047 ALLOC_GROW(data
->commits
, data
->commits_nr
+ 1, data
->commits_alloc
);
1048 data
->commits
[data
->commits_nr
++] = commit
;
1051 static int read_refs_snapshot(const char *refs_snapshot
,
1052 struct rev_info
*revs
)
1054 struct strbuf buf
= STRBUF_INIT
;
1055 struct object_id oid
;
1056 FILE *f
= xfopen(refs_snapshot
, "r");
1058 while (strbuf_getline(&buf
, f
) != EOF
) {
1059 struct object
*object
;
1061 char *hex
= buf
.buf
;
1062 const char *end
= NULL
;
1064 if (buf
.len
&& *buf
.buf
== '+') {
1069 if (parse_oid_hex(hex
, &oid
, &end
) < 0)
1070 die(_("could not parse line: %s"), buf
.buf
);
1072 die(_("malformed line: %s"), buf
.buf
);
1074 object
= parse_object_or_die(&oid
, NULL
);
1076 object
->flags
|= NEEDS_BITMAP
;
1078 add_pending_object(revs
, object
, "");
1082 strbuf_release(&buf
);
1086 static struct commit
**find_commits_for_midx_bitmap(uint32_t *indexed_commits_nr_p
,
1087 const char *refs_snapshot
,
1088 struct write_midx_context
*ctx
)
1090 struct rev_info revs
;
1091 struct bitmap_commit_cb cb
= {0};
1093 trace2_region_enter("midx", "find_commits_for_midx_bitmap",
1098 repo_init_revisions(the_repository
, &revs
, NULL
);
1099 if (refs_snapshot
) {
1100 read_refs_snapshot(refs_snapshot
, &revs
);
1102 setup_revisions(0, NULL
, &revs
, NULL
);
1103 for_each_ref(add_ref_to_pending
, &revs
);
1107 * Skipping promisor objects here is intentional, since it only excludes
1108 * them from the list of reachable commits that we want to select from
1109 * when computing the selection of MIDX'd commits to receive bitmaps.
1111 * Reachability bitmaps do require that their objects be closed under
1112 * reachability, but fetching any objects missing from promisors at this
1113 * point is too late. But, if one of those objects can be reached from
1114 * an another object that is included in the bitmap, then we will
1115 * complain later that we don't have reachability closure (and fail
1118 fetch_if_missing
= 0;
1119 revs
.exclude_promisor_objects
= 1;
1121 if (prepare_revision_walk(&revs
))
1122 die(_("revision walk setup failed"));
1124 traverse_commit_list(&revs
, bitmap_show_commit
, NULL
, &cb
);
1125 if (indexed_commits_nr_p
)
1126 *indexed_commits_nr_p
= cb
.commits_nr
;
1128 release_revisions(&revs
);
1130 trace2_region_leave("midx", "find_commits_for_midx_bitmap",
1136 static int write_midx_bitmap(const char *midx_name
,
1137 const unsigned char *midx_hash
,
1138 struct packing_data
*pdata
,
1139 struct commit
**commits
,
1140 uint32_t commits_nr
,
1141 uint32_t *pack_order
,
1145 uint16_t options
= 0;
1146 struct pack_idx_entry
**index
;
1147 char *bitmap_name
= xstrfmt("%s-%s.bitmap", midx_name
,
1148 hash_to_hex(midx_hash
));
1150 trace2_region_enter("midx", "write_midx_bitmap", the_repository
);
1152 if (flags
& MIDX_WRITE_BITMAP_HASH_CACHE
)
1153 options
|= BITMAP_OPT_HASH_CACHE
;
1155 if (flags
& MIDX_WRITE_BITMAP_LOOKUP_TABLE
)
1156 options
|= BITMAP_OPT_LOOKUP_TABLE
;
1159 * Build the MIDX-order index based on pdata.objects (which is already
1160 * in MIDX order; c.f., 'midx_pack_order_cmp()' for the definition of
1163 ALLOC_ARRAY(index
, pdata
->nr_objects
);
1164 for (i
= 0; i
< pdata
->nr_objects
; i
++)
1165 index
[i
] = &pdata
->objects
[i
].idx
;
1167 bitmap_writer_show_progress(flags
& MIDX_PROGRESS
);
1168 bitmap_writer_build_type_index(pdata
, index
, pdata
->nr_objects
);
1171 * bitmap_writer_finish expects objects in lex order, but pack_order
1172 * gives us exactly that. use it directly instead of re-sorting the
1175 * This changes the order of objects in 'index' between
1176 * bitmap_writer_build_type_index and bitmap_writer_finish.
1178 * The same re-ordering takes place in the single-pack bitmap code via
1179 * write_idx_file(), which is called by finish_tmp_packfile(), which
1180 * happens between bitmap_writer_build_type_index() and
1181 * bitmap_writer_finish().
1183 for (i
= 0; i
< pdata
->nr_objects
; i
++)
1184 index
[pack_order
[i
]] = &pdata
->objects
[i
].idx
;
1186 bitmap_writer_select_commits(commits
, commits_nr
, -1);
1187 ret
= bitmap_writer_build(pdata
);
1191 bitmap_writer_set_checksum(midx_hash
);
1192 bitmap_writer_finish(index
, pdata
->nr_objects
, bitmap_name
, options
);
1198 trace2_region_leave("midx", "write_midx_bitmap", the_repository
);
1203 static struct multi_pack_index
*lookup_multi_pack_index(struct repository
*r
,
1204 const char *object_dir
)
1206 struct multi_pack_index
*result
= NULL
;
1207 struct multi_pack_index
*cur
;
1208 char *obj_dir_real
= real_pathdup(object_dir
, 1);
1209 struct strbuf cur_path_real
= STRBUF_INIT
;
1211 /* Ensure the given object_dir is local, or a known alternate. */
1212 find_odb(r
, obj_dir_real
);
1214 for (cur
= get_multi_pack_index(r
); cur
; cur
= cur
->next
) {
1215 strbuf_realpath(&cur_path_real
, cur
->object_dir
, 1);
1216 if (!strcmp(obj_dir_real
, cur_path_real
.buf
)) {
1224 strbuf_release(&cur_path_real
);
1228 static int write_midx_internal(const char *object_dir
,
1229 struct string_list
*packs_to_include
,
1230 struct string_list
*packs_to_drop
,
1231 const char *preferred_pack_name
,
1232 const char *refs_snapshot
,
1235 struct strbuf midx_name
= STRBUF_INIT
;
1236 unsigned char midx_hash
[GIT_MAX_RAWSZ
];
1238 struct hashfile
*f
= NULL
;
1239 struct lock_file lk
;
1240 struct write_midx_context ctx
= { 0 };
1241 int pack_name_concat_len
= 0;
1242 int dropped_packs
= 0;
1244 struct chunkfile
*cf
;
1246 trace2_region_enter("midx", "write_midx_internal", the_repository
);
1248 get_midx_filename(&midx_name
, object_dir
);
1249 if (safe_create_leading_directories(midx_name
.buf
))
1250 die_errno(_("unable to create leading directories of %s"),
1253 if (!packs_to_include
) {
1255 * Only reference an existing MIDX when not filtering which
1256 * packs to include, since all packs and objects are copied
1257 * blindly from an existing MIDX if one is present.
1259 ctx
.m
= lookup_multi_pack_index(the_repository
, object_dir
);
1262 if (ctx
.m
&& !midx_checksum_valid(ctx
.m
)) {
1263 warning(_("ignoring existing multi-pack-index; checksum mismatch"));
1268 ctx
.alloc
= ctx
.m
? ctx
.m
->num_packs
: 16;
1270 ALLOC_ARRAY(ctx
.info
, ctx
.alloc
);
1273 for (i
= 0; i
< ctx
.m
->num_packs
; i
++) {
1274 ALLOC_GROW(ctx
.info
, ctx
.nr
+ 1, ctx
.alloc
);
1276 ctx
.info
[ctx
.nr
].orig_pack_int_id
= i
;
1277 ctx
.info
[ctx
.nr
].pack_name
= xstrdup(ctx
.m
->pack_names
[i
]);
1278 ctx
.info
[ctx
.nr
].p
= ctx
.m
->packs
[i
];
1279 ctx
.info
[ctx
.nr
].expired
= 0;
1281 if (flags
& MIDX_WRITE_REV_INDEX
) {
1283 * If generating a reverse index, need to have
1284 * packed_git's loaded to compare their
1285 * mtimes and object count.
1287 if (prepare_midx_pack(the_repository
, ctx
.m
, i
)) {
1288 error(_("could not load pack"));
1293 if (open_pack_index(ctx
.m
->packs
[i
]))
1294 die(_("could not open index for %s"),
1295 ctx
.m
->packs
[i
]->pack_name
);
1296 ctx
.info
[ctx
.nr
].p
= ctx
.m
->packs
[i
];
1303 ctx
.pack_paths_checked
= 0;
1304 if (flags
& MIDX_PROGRESS
)
1305 ctx
.progress
= start_delayed_progress(_("Adding packfiles to multi-pack-index"), 0);
1307 ctx
.progress
= NULL
;
1309 ctx
.to_include
= packs_to_include
;
1311 for_each_file_in_pack_dir(object_dir
, add_pack_to_midx
, &ctx
);
1312 stop_progress(&ctx
.progress
);
1314 if ((ctx
.m
&& ctx
.nr
== ctx
.m
->num_packs
) &&
1315 !(packs_to_include
|| packs_to_drop
)) {
1316 struct bitmap_index
*bitmap_git
;
1318 int want_bitmap
= flags
& MIDX_WRITE_BITMAP
;
1320 bitmap_git
= prepare_midx_bitmap_git(ctx
.m
);
1321 bitmap_exists
= bitmap_git
&& bitmap_is_midx(bitmap_git
);
1322 free_bitmap_index(bitmap_git
);
1324 if (bitmap_exists
|| !want_bitmap
) {
1326 * The correct MIDX already exists, and so does a
1327 * corresponding bitmap (or one wasn't requested).
1330 clear_midx_files_ext(object_dir
, ".bitmap",
1336 if (preferred_pack_name
) {
1337 ctx
.preferred_pack_idx
= -1;
1339 for (i
= 0; i
< ctx
.nr
; i
++) {
1340 if (!cmp_idx_or_pack_name(preferred_pack_name
,
1341 ctx
.info
[i
].pack_name
)) {
1342 ctx
.preferred_pack_idx
= i
;
1347 if (ctx
.preferred_pack_idx
== -1)
1348 warning(_("unknown preferred pack: '%s'"),
1349 preferred_pack_name
);
1350 } else if (ctx
.nr
&&
1351 (flags
& (MIDX_WRITE_REV_INDEX
| MIDX_WRITE_BITMAP
))) {
1352 struct packed_git
*oldest
= ctx
.info
[ctx
.preferred_pack_idx
].p
;
1353 ctx
.preferred_pack_idx
= 0;
1355 if (packs_to_drop
&& packs_to_drop
->nr
)
1356 BUG("cannot write a MIDX bitmap during expiration");
1359 * set a preferred pack when writing a bitmap to ensure that
1360 * the pack from which the first object is selected in pseudo
1361 * pack-order has all of its objects selected from that pack
1362 * (and not another pack containing a duplicate)
1364 for (i
= 1; i
< ctx
.nr
; i
++) {
1365 struct packed_git
*p
= ctx
.info
[i
].p
;
1367 if (!oldest
->num_objects
|| p
->mtime
< oldest
->mtime
) {
1369 ctx
.preferred_pack_idx
= i
;
1373 if (!oldest
->num_objects
) {
1375 * If all packs are empty; unset the preferred index.
1376 * This is acceptable since there will be no duplicate
1377 * objects to resolve, so the preferred value doesn't
1380 ctx
.preferred_pack_idx
= -1;
1384 * otherwise don't mark any pack as preferred to avoid
1385 * interfering with expiration logic below
1387 ctx
.preferred_pack_idx
= -1;
1390 if (ctx
.preferred_pack_idx
> -1) {
1391 struct packed_git
*preferred
= ctx
.info
[ctx
.preferred_pack_idx
].p
;
1392 if (!preferred
->num_objects
) {
1393 error(_("cannot select preferred pack %s with no objects"),
1394 preferred
->pack_name
);
1400 ctx
.entries
= get_sorted_entries(ctx
.m
, ctx
.info
, ctx
.nr
, &ctx
.entries_nr
,
1401 ctx
.preferred_pack_idx
);
1403 ctx
.large_offsets_needed
= 0;
1404 for (i
= 0; i
< ctx
.entries_nr
; i
++) {
1405 if (ctx
.entries
[i
].offset
> 0x7fffffff)
1406 ctx
.num_large_offsets
++;
1407 if (ctx
.entries
[i
].offset
> 0xffffffff)
1408 ctx
.large_offsets_needed
= 1;
1411 QSORT(ctx
.info
, ctx
.nr
, pack_info_compare
);
1413 if (packs_to_drop
&& packs_to_drop
->nr
) {
1415 int missing_drops
= 0;
1417 for (i
= 0; i
< ctx
.nr
&& drop_index
< packs_to_drop
->nr
; i
++) {
1418 int cmp
= strcmp(ctx
.info
[i
].pack_name
,
1419 packs_to_drop
->items
[drop_index
].string
);
1423 ctx
.info
[i
].expired
= 1;
1424 } else if (cmp
> 0) {
1425 error(_("did not see pack-file %s to drop"),
1426 packs_to_drop
->items
[drop_index
].string
);
1431 ctx
.info
[i
].expired
= 0;
1435 if (missing_drops
) {
1442 * pack_perm stores a permutation between pack-int-ids from the
1443 * previous multi-pack-index to the new one we are writing:
1445 * pack_perm[old_id] = new_id
1447 ALLOC_ARRAY(ctx
.pack_perm
, ctx
.nr
);
1448 for (i
= 0; i
< ctx
.nr
; i
++) {
1449 if (ctx
.info
[i
].expired
) {
1451 ctx
.pack_perm
[ctx
.info
[i
].orig_pack_int_id
] = PACK_EXPIRED
;
1453 ctx
.pack_perm
[ctx
.info
[i
].orig_pack_int_id
] = i
- dropped_packs
;
1457 for (i
= 0; i
< ctx
.nr
; i
++) {
1458 if (!ctx
.info
[i
].expired
)
1459 pack_name_concat_len
+= strlen(ctx
.info
[i
].pack_name
) + 1;
1462 /* Check that the preferred pack wasn't expired (if given). */
1463 if (preferred_pack_name
) {
1464 struct pack_info
*preferred
= bsearch(preferred_pack_name
,
1467 idx_or_pack_name_cmp
);
1469 uint32_t perm
= ctx
.pack_perm
[preferred
->orig_pack_int_id
];
1470 if (perm
== PACK_EXPIRED
)
1471 warning(_("preferred pack '%s' is expired"),
1472 preferred_pack_name
);
1476 if (pack_name_concat_len
% MIDX_CHUNK_ALIGNMENT
)
1477 pack_name_concat_len
+= MIDX_CHUNK_ALIGNMENT
-
1478 (pack_name_concat_len
% MIDX_CHUNK_ALIGNMENT
);
1480 hold_lock_file_for_update(&lk
, midx_name
.buf
, LOCK_DIE_ON_ERROR
);
1481 f
= hashfd(get_lock_file_fd(&lk
), get_lock_file_path(&lk
));
1483 if (ctx
.nr
- dropped_packs
== 0) {
1484 error(_("no pack files to index."));
1489 if (!ctx
.entries_nr
) {
1490 if (flags
& MIDX_WRITE_BITMAP
)
1491 warning(_("refusing to write multi-pack .bitmap without any objects"));
1492 flags
&= ~(MIDX_WRITE_REV_INDEX
| MIDX_WRITE_BITMAP
);
1495 cf
= init_chunkfile(f
);
1497 add_chunk(cf
, MIDX_CHUNKID_PACKNAMES
, pack_name_concat_len
,
1498 write_midx_pack_names
);
1499 add_chunk(cf
, MIDX_CHUNKID_OIDFANOUT
, MIDX_CHUNK_FANOUT_SIZE
,
1500 write_midx_oid_fanout
);
1501 add_chunk(cf
, MIDX_CHUNKID_OIDLOOKUP
,
1502 (size_t)ctx
.entries_nr
* the_hash_algo
->rawsz
,
1503 write_midx_oid_lookup
);
1504 add_chunk(cf
, MIDX_CHUNKID_OBJECTOFFSETS
,
1505 (size_t)ctx
.entries_nr
* MIDX_CHUNK_OFFSET_WIDTH
,
1506 write_midx_object_offsets
);
1508 if (ctx
.large_offsets_needed
)
1509 add_chunk(cf
, MIDX_CHUNKID_LARGEOFFSETS
,
1510 (size_t)ctx
.num_large_offsets
* MIDX_CHUNK_LARGE_OFFSET_WIDTH
,
1511 write_midx_large_offsets
);
1513 if (flags
& (MIDX_WRITE_REV_INDEX
| MIDX_WRITE_BITMAP
)) {
1514 ctx
.pack_order
= midx_pack_order(&ctx
);
1515 add_chunk(cf
, MIDX_CHUNKID_REVINDEX
,
1516 ctx
.entries_nr
* sizeof(uint32_t),
1517 write_midx_revindex
);
1520 write_midx_header(f
, get_num_chunks(cf
), ctx
.nr
- dropped_packs
);
1521 write_chunkfile(cf
, &ctx
);
1523 finalize_hashfile(f
, midx_hash
, FSYNC_COMPONENT_PACK_METADATA
,
1524 CSUM_FSYNC
| CSUM_HASH_IN_STREAM
);
1527 if (flags
& MIDX_WRITE_REV_INDEX
&&
1528 git_env_bool("GIT_TEST_MIDX_WRITE_REV", 0))
1529 write_midx_reverse_index(midx_name
.buf
, midx_hash
, &ctx
);
1531 if (flags
& MIDX_WRITE_BITMAP
) {
1532 struct packing_data pdata
;
1533 struct commit
**commits
;
1534 uint32_t commits_nr
;
1536 if (!ctx
.entries_nr
)
1537 BUG("cannot write a bitmap without any objects");
1539 prepare_midx_packing_data(&pdata
, &ctx
);
1541 commits
= find_commits_for_midx_bitmap(&commits_nr
, refs_snapshot
, &ctx
);
1544 * The previous steps translated the information from
1545 * 'entries' into information suitable for constructing
1546 * bitmaps. We no longer need that array, so clear it to
1547 * reduce memory pressure.
1549 FREE_AND_NULL(ctx
.entries
);
1552 if (write_midx_bitmap(midx_name
.buf
, midx_hash
, &pdata
,
1553 commits
, commits_nr
, ctx
.pack_order
,
1555 error(_("could not write multi-pack bitmap"));
1561 * NOTE: Do not use ctx.entries beyond this point, since it might
1562 * have been freed in the previous if block.
1566 close_object_store(the_repository
->objects
);
1568 if (commit_lock_file(&lk
) < 0)
1569 die_errno(_("could not write multi-pack-index"));
1571 clear_midx_files_ext(object_dir
, ".bitmap", midx_hash
);
1572 clear_midx_files_ext(object_dir
, ".rev", midx_hash
);
1575 for (i
= 0; i
< ctx
.nr
; i
++) {
1576 if (ctx
.info
[i
].p
) {
1577 close_pack(ctx
.info
[i
].p
);
1578 free(ctx
.info
[i
].p
);
1580 free(ctx
.info
[i
].pack_name
);
1585 free(ctx
.pack_perm
);
1586 free(ctx
.pack_order
);
1587 strbuf_release(&midx_name
);
1589 trace2_region_leave("midx", "write_midx_internal", the_repository
);
1594 int write_midx_file(const char *object_dir
,
1595 const char *preferred_pack_name
,
1596 const char *refs_snapshot
,
1599 return write_midx_internal(object_dir
, NULL
, NULL
, preferred_pack_name
,
1600 refs_snapshot
, flags
);
1603 int write_midx_file_only(const char *object_dir
,
1604 struct string_list
*packs_to_include
,
1605 const char *preferred_pack_name
,
1606 const char *refs_snapshot
,
1609 return write_midx_internal(object_dir
, packs_to_include
, NULL
,
1610 preferred_pack_name
, refs_snapshot
, flags
);
1613 struct clear_midx_data
{
1618 static void clear_midx_file_ext(const char *full_path
, size_t full_path_len UNUSED
,
1619 const char *file_name
, void *_data
)
1621 struct clear_midx_data
*data
= _data
;
1623 if (!(starts_with(file_name
, "multi-pack-index-") &&
1624 ends_with(file_name
, data
->ext
)))
1626 if (data
->keep
&& !strcmp(data
->keep
, file_name
))
1629 if (unlink(full_path
))
1630 die_errno(_("failed to remove %s"), full_path
);
1633 static void clear_midx_files_ext(const char *object_dir
, const char *ext
,
1634 unsigned char *keep_hash
)
1636 struct clear_midx_data data
;
1637 memset(&data
, 0, sizeof(struct clear_midx_data
));
1640 data
.keep
= xstrfmt("multi-pack-index-%s%s",
1641 hash_to_hex(keep_hash
), ext
);
1644 for_each_file_in_pack_dir(object_dir
,
1645 clear_midx_file_ext
,
1651 void clear_midx_file(struct repository
*r
)
1653 struct strbuf midx
= STRBUF_INIT
;
1655 get_midx_filename(&midx
, r
->objects
->odb
->path
);
1657 if (r
->objects
&& r
->objects
->multi_pack_index
) {
1658 close_midx(r
->objects
->multi_pack_index
);
1659 r
->objects
->multi_pack_index
= NULL
;
1662 if (remove_path(midx
.buf
))
1663 die(_("failed to clear multi-pack-index at %s"), midx
.buf
);
1665 clear_midx_files_ext(r
->objects
->odb
->path
, ".bitmap", NULL
);
1666 clear_midx_files_ext(r
->objects
->odb
->path
, ".rev", NULL
);
1668 strbuf_release(&midx
);
1671 static int verify_midx_error
;
1673 __attribute__((format (printf
, 1, 2)))
1674 static void midx_report(const char *fmt
, ...)
1677 verify_midx_error
= 1;
1679 vfprintf(stderr
, fmt
, ap
);
1680 fprintf(stderr
, "\n");
1684 struct pair_pos_vs_id
1687 uint32_t pack_int_id
;
1690 static int compare_pair_pos_vs_id(const void *_a
, const void *_b
)
1692 struct pair_pos_vs_id
*a
= (struct pair_pos_vs_id
*)_a
;
1693 struct pair_pos_vs_id
*b
= (struct pair_pos_vs_id
*)_b
;
1695 return b
->pack_int_id
- a
->pack_int_id
;
1699 * Limit calls to display_progress() for performance reasons.
1700 * The interval here was arbitrarily chosen.
1702 #define SPARSE_PROGRESS_INTERVAL (1 << 12)
1703 #define midx_display_sparse_progress(progress, n) \
1705 uint64_t _n = (n); \
1706 if ((_n & (SPARSE_PROGRESS_INTERVAL - 1)) == 0) \
1707 display_progress(progress, _n); \
1710 int verify_midx_file(struct repository
*r
, const char *object_dir
, unsigned flags
)
1712 struct pair_pos_vs_id
*pairs
= NULL
;
1714 struct progress
*progress
= NULL
;
1715 struct multi_pack_index
*m
= load_multi_pack_index(object_dir
, 1);
1716 verify_midx_error
= 0;
1721 struct strbuf filename
= STRBUF_INIT
;
1723 get_midx_filename(&filename
, object_dir
);
1725 if (!stat(filename
.buf
, &sb
)) {
1726 error(_("multi-pack-index file exists, but failed to parse"));
1729 strbuf_release(&filename
);
1733 if (!midx_checksum_valid(m
))
1734 midx_report(_("incorrect checksum"));
1736 if (flags
& MIDX_PROGRESS
)
1737 progress
= start_delayed_progress(_("Looking for referenced packfiles"),
1739 for (i
= 0; i
< m
->num_packs
; i
++) {
1740 if (prepare_midx_pack(r
, m
, i
))
1741 midx_report("failed to load pack in position %d", i
);
1743 display_progress(progress
, i
+ 1);
1745 stop_progress(&progress
);
1747 for (i
= 0; i
< 255; i
++) {
1748 uint32_t oid_fanout1
= ntohl(m
->chunk_oid_fanout
[i
]);
1749 uint32_t oid_fanout2
= ntohl(m
->chunk_oid_fanout
[i
+ 1]);
1751 if (oid_fanout1
> oid_fanout2
)
1752 midx_report(_("oid fanout out of order: fanout[%d] = %"PRIx32
" > %"PRIx32
" = fanout[%d]"),
1753 i
, oid_fanout1
, oid_fanout2
, i
+ 1);
1756 if (m
->num_objects
== 0) {
1757 midx_report(_("the midx contains no oid"));
1759 * Remaining tests assume that we have objects, so we can
1765 if (flags
& MIDX_PROGRESS
)
1766 progress
= start_sparse_progress(_("Verifying OID order in multi-pack-index"),
1767 m
->num_objects
- 1);
1768 for (i
= 0; i
< m
->num_objects
- 1; i
++) {
1769 struct object_id oid1
, oid2
;
1771 nth_midxed_object_oid(&oid1
, m
, i
);
1772 nth_midxed_object_oid(&oid2
, m
, i
+ 1);
1774 if (oidcmp(&oid1
, &oid2
) >= 0)
1775 midx_report(_("oid lookup out of order: oid[%d] = %s >= %s = oid[%d]"),
1776 i
, oid_to_hex(&oid1
), oid_to_hex(&oid2
), i
+ 1);
1778 midx_display_sparse_progress(progress
, i
+ 1);
1780 stop_progress(&progress
);
1783 * Create an array mapping each object to its packfile id. Sort it
1784 * to group the objects by packfile. Use this permutation to visit
1785 * each of the objects and only require 1 packfile to be open at a
1788 ALLOC_ARRAY(pairs
, m
->num_objects
);
1789 for (i
= 0; i
< m
->num_objects
; i
++) {
1791 pairs
[i
].pack_int_id
= nth_midxed_pack_int_id(m
, i
);
1794 if (flags
& MIDX_PROGRESS
)
1795 progress
= start_sparse_progress(_("Sorting objects by packfile"),
1797 display_progress(progress
, 0); /* TODO: Measure QSORT() progress */
1798 QSORT(pairs
, m
->num_objects
, compare_pair_pos_vs_id
);
1799 stop_progress(&progress
);
1801 if (flags
& MIDX_PROGRESS
)
1802 progress
= start_sparse_progress(_("Verifying object offsets"), m
->num_objects
);
1803 for (i
= 0; i
< m
->num_objects
; i
++) {
1804 struct object_id oid
;
1805 struct pack_entry e
;
1806 off_t m_offset
, p_offset
;
1808 if (i
> 0 && pairs
[i
-1].pack_int_id
!= pairs
[i
].pack_int_id
&&
1809 m
->packs
[pairs
[i
-1].pack_int_id
])
1811 close_pack_fd(m
->packs
[pairs
[i
-1].pack_int_id
]);
1812 close_pack_index(m
->packs
[pairs
[i
-1].pack_int_id
]);
1815 nth_midxed_object_oid(&oid
, m
, pairs
[i
].pos
);
1817 if (!fill_midx_entry(r
, &oid
, &e
, m
)) {
1818 midx_report(_("failed to load pack entry for oid[%d] = %s"),
1819 pairs
[i
].pos
, oid_to_hex(&oid
));
1823 if (open_pack_index(e
.p
)) {
1824 midx_report(_("failed to load pack-index for packfile %s"),
1829 m_offset
= e
.offset
;
1830 p_offset
= find_pack_entry_one(oid
.hash
, e
.p
);
1832 if (m_offset
!= p_offset
)
1833 midx_report(_("incorrect object offset for oid[%d] = %s: %"PRIx64
" != %"PRIx64
),
1834 pairs
[i
].pos
, oid_to_hex(&oid
), m_offset
, p_offset
);
1836 midx_display_sparse_progress(progress
, i
+ 1);
1838 stop_progress(&progress
);
1844 return verify_midx_error
;
1847 int expire_midx_packs(struct repository
*r
, const char *object_dir
, unsigned flags
)
1849 uint32_t i
, *count
, result
= 0;
1850 struct string_list packs_to_drop
= STRING_LIST_INIT_DUP
;
1851 struct multi_pack_index
*m
= lookup_multi_pack_index(r
, object_dir
);
1852 struct progress
*progress
= NULL
;
1857 CALLOC_ARRAY(count
, m
->num_packs
);
1859 if (flags
& MIDX_PROGRESS
)
1860 progress
= start_delayed_progress(_("Counting referenced objects"),
1862 for (i
= 0; i
< m
->num_objects
; i
++) {
1863 int pack_int_id
= nth_midxed_pack_int_id(m
, i
);
1864 count
[pack_int_id
]++;
1865 display_progress(progress
, i
+ 1);
1867 stop_progress(&progress
);
1869 if (flags
& MIDX_PROGRESS
)
1870 progress
= start_delayed_progress(_("Finding and deleting unreferenced packfiles"),
1872 for (i
= 0; i
< m
->num_packs
; i
++) {
1874 display_progress(progress
, i
+ 1);
1879 if (prepare_midx_pack(r
, m
, i
))
1882 if (m
->packs
[i
]->pack_keep
|| m
->packs
[i
]->is_cruft
)
1885 pack_name
= xstrdup(m
->packs
[i
]->pack_name
);
1886 close_pack(m
->packs
[i
]);
1888 string_list_insert(&packs_to_drop
, m
->pack_names
[i
]);
1889 unlink_pack_path(pack_name
, 0);
1892 stop_progress(&progress
);
1896 if (packs_to_drop
.nr
)
1897 result
= write_midx_internal(object_dir
, NULL
, &packs_to_drop
, NULL
, NULL
, flags
);
1899 string_list_clear(&packs_to_drop
, 0);
1904 struct repack_info
{
1906 uint32_t referenced_objects
;
1907 uint32_t pack_int_id
;
1910 static int compare_by_mtime(const void *a_
, const void *b_
)
1912 const struct repack_info
*a
, *b
;
1914 a
= (const struct repack_info
*)a_
;
1915 b
= (const struct repack_info
*)b_
;
1917 if (a
->mtime
< b
->mtime
)
1919 if (a
->mtime
> b
->mtime
)
1924 static int fill_included_packs_all(struct repository
*r
,
1925 struct multi_pack_index
*m
,
1926 unsigned char *include_pack
)
1928 uint32_t i
, count
= 0;
1929 int pack_kept_objects
= 0;
1931 repo_config_get_bool(r
, "repack.packkeptobjects", &pack_kept_objects
);
1933 for (i
= 0; i
< m
->num_packs
; i
++) {
1934 if (prepare_midx_pack(r
, m
, i
))
1936 if (!pack_kept_objects
&& m
->packs
[i
]->pack_keep
)
1938 if (m
->packs
[i
]->is_cruft
)
1941 include_pack
[i
] = 1;
1948 static int fill_included_packs_batch(struct repository
*r
,
1949 struct multi_pack_index
*m
,
1950 unsigned char *include_pack
,
1953 uint32_t i
, packs_to_repack
;
1955 struct repack_info
*pack_info
;
1956 int pack_kept_objects
= 0;
1958 CALLOC_ARRAY(pack_info
, m
->num_packs
);
1960 repo_config_get_bool(r
, "repack.packkeptobjects", &pack_kept_objects
);
1962 for (i
= 0; i
< m
->num_packs
; i
++) {
1963 pack_info
[i
].pack_int_id
= i
;
1965 if (prepare_midx_pack(r
, m
, i
))
1968 pack_info
[i
].mtime
= m
->packs
[i
]->mtime
;
1971 for (i
= 0; i
< m
->num_objects
; i
++) {
1972 uint32_t pack_int_id
= nth_midxed_pack_int_id(m
, i
);
1973 pack_info
[pack_int_id
].referenced_objects
++;
1976 QSORT(pack_info
, m
->num_packs
, compare_by_mtime
);
1979 packs_to_repack
= 0;
1980 for (i
= 0; total_size
< batch_size
&& i
< m
->num_packs
; i
++) {
1981 int pack_int_id
= pack_info
[i
].pack_int_id
;
1982 struct packed_git
*p
= m
->packs
[pack_int_id
];
1983 size_t expected_size
;
1987 if (!pack_kept_objects
&& p
->pack_keep
)
1991 if (open_pack_index(p
) || !p
->num_objects
)
1994 expected_size
= (size_t)(p
->pack_size
1995 * pack_info
[i
].referenced_objects
);
1996 expected_size
/= p
->num_objects
;
1998 if (expected_size
>= batch_size
)
2002 total_size
+= expected_size
;
2003 include_pack
[pack_int_id
] = 1;
2008 if (packs_to_repack
< 2)
2014 int midx_repack(struct repository
*r
, const char *object_dir
, size_t batch_size
, unsigned flags
)
2018 unsigned char *include_pack
;
2019 struct child_process cmd
= CHILD_PROCESS_INIT
;
2021 struct strbuf base_name
= STRBUF_INIT
;
2022 struct multi_pack_index
*m
= lookup_multi_pack_index(r
, object_dir
);
2025 * When updating the default for these configuration
2026 * variables in builtin/repack.c, these must be adjusted
2029 int delta_base_offset
= 1;
2030 int use_delta_islands
= 0;
2035 CALLOC_ARRAY(include_pack
, m
->num_packs
);
2038 if (fill_included_packs_batch(r
, m
, include_pack
, batch_size
))
2040 } else if (fill_included_packs_all(r
, m
, include_pack
))
2043 repo_config_get_bool(r
, "repack.usedeltabaseoffset", &delta_base_offset
);
2044 repo_config_get_bool(r
, "repack.usedeltaislands", &use_delta_islands
);
2046 strvec_push(&cmd
.args
, "pack-objects");
2048 strbuf_addstr(&base_name
, object_dir
);
2049 strbuf_addstr(&base_name
, "/pack/pack");
2050 strvec_push(&cmd
.args
, base_name
.buf
);
2052 if (delta_base_offset
)
2053 strvec_push(&cmd
.args
, "--delta-base-offset");
2054 if (use_delta_islands
)
2055 strvec_push(&cmd
.args
, "--delta-islands");
2057 if (flags
& MIDX_PROGRESS
)
2058 strvec_push(&cmd
.args
, "--progress");
2060 strvec_push(&cmd
.args
, "-q");
2062 strbuf_release(&base_name
);
2065 cmd
.in
= cmd
.out
= -1;
2067 if (start_command(&cmd
)) {
2068 error(_("could not start pack-objects"));
2073 cmd_in
= xfdopen(cmd
.in
, "w");
2075 for (i
= 0; i
< m
->num_objects
; i
++) {
2076 struct object_id oid
;
2077 uint32_t pack_int_id
= nth_midxed_pack_int_id(m
, i
);
2079 if (!include_pack
[pack_int_id
])
2082 nth_midxed_object_oid(&oid
, m
, i
);
2083 fprintf(cmd_in
, "%s\n", oid_to_hex(&oid
));
2087 if (finish_command(&cmd
)) {
2088 error(_("could not finish pack-objects"));
2093 result
= write_midx_internal(object_dir
, NULL
, NULL
, NULL
, NULL
, flags
);