7 #include "object-store.h"
8 #include "hash-lookup.h"
12 #include "run-command.h"
13 #include "repository.h"
14 #include "chunk-format.h"
16 #include "pack-bitmap.h"
19 #include "list-objects.h"
21 #define MIDX_SIGNATURE 0x4d494458 /* "MIDX" */
22 #define MIDX_VERSION 1
23 #define MIDX_BYTE_FILE_VERSION 4
24 #define MIDX_BYTE_HASH_VERSION 5
25 #define MIDX_BYTE_NUM_CHUNKS 6
26 #define MIDX_BYTE_NUM_PACKS 8
27 #define MIDX_HEADER_SIZE 12
28 #define MIDX_MIN_SIZE (MIDX_HEADER_SIZE + the_hash_algo->rawsz)
30 #define MIDX_CHUNK_ALIGNMENT 4
31 #define MIDX_CHUNKID_PACKNAMES 0x504e414d /* "PNAM" */
32 #define MIDX_CHUNKID_OIDFANOUT 0x4f494446 /* "OIDF" */
33 #define MIDX_CHUNKID_OIDLOOKUP 0x4f49444c /* "OIDL" */
34 #define MIDX_CHUNKID_OBJECTOFFSETS 0x4f4f4646 /* "OOFF" */
35 #define MIDX_CHUNKID_LARGEOFFSETS 0x4c4f4646 /* "LOFF" */
36 #define MIDX_CHUNK_FANOUT_SIZE (sizeof(uint32_t) * 256)
37 #define MIDX_CHUNK_OFFSET_WIDTH (2 * sizeof(uint32_t))
38 #define MIDX_CHUNK_LARGE_OFFSET_WIDTH (sizeof(uint64_t))
39 #define MIDX_LARGE_OFFSET_NEEDED 0x80000000
41 #define PACK_EXPIRED UINT_MAX
43 static uint8_t oid_version(void)
45 switch (hash_algo_by_ptr(the_hash_algo
)) {
51 die(_("invalid hash version"));
55 const unsigned char *get_midx_checksum(struct multi_pack_index
*m
)
57 return m
->data
+ m
->data_len
- the_hash_algo
->rawsz
;
60 char *get_midx_filename(const char *object_dir
)
62 return xstrfmt("%s/pack/multi-pack-index", object_dir
);
65 char *get_midx_rev_filename(struct multi_pack_index
*m
)
67 return xstrfmt("%s/pack/multi-pack-index-%s.rev",
68 m
->object_dir
, hash_to_hex(get_midx_checksum(m
)));
71 static int midx_read_oid_fanout(const unsigned char *chunk_start
,
72 size_t chunk_size
, void *data
)
74 struct multi_pack_index
*m
= data
;
75 m
->chunk_oid_fanout
= (uint32_t *)chunk_start
;
77 if (chunk_size
!= 4 * 256) {
78 error(_("multi-pack-index OID fanout is of the wrong size"));
84 struct multi_pack_index
*load_multi_pack_index(const char *object_dir
, int local
)
86 struct multi_pack_index
*m
= NULL
;
90 void *midx_map
= NULL
;
91 uint32_t hash_version
;
92 char *midx_name
= get_midx_filename(object_dir
);
94 const char *cur_pack_name
;
95 struct chunkfile
*cf
= NULL
;
97 fd
= git_open(midx_name
);
101 if (fstat(fd
, &st
)) {
102 error_errno(_("failed to read %s"), midx_name
);
106 midx_size
= xsize_t(st
.st_size
);
108 if (midx_size
< MIDX_MIN_SIZE
) {
109 error(_("multi-pack-index file %s is too small"), midx_name
);
113 FREE_AND_NULL(midx_name
);
115 midx_map
= xmmap(NULL
, midx_size
, PROT_READ
, MAP_PRIVATE
, fd
, 0);
118 FLEX_ALLOC_STR(m
, object_dir
, object_dir
);
120 m
->data_len
= midx_size
;
123 m
->signature
= get_be32(m
->data
);
124 if (m
->signature
!= MIDX_SIGNATURE
)
125 die(_("multi-pack-index signature 0x%08x does not match signature 0x%08x"),
126 m
->signature
, MIDX_SIGNATURE
);
128 m
->version
= m
->data
[MIDX_BYTE_FILE_VERSION
];
129 if (m
->version
!= MIDX_VERSION
)
130 die(_("multi-pack-index version %d not recognized"),
133 hash_version
= m
->data
[MIDX_BYTE_HASH_VERSION
];
134 if (hash_version
!= oid_version()) {
135 error(_("multi-pack-index hash version %u does not match version %u"),
136 hash_version
, oid_version());
139 m
->hash_len
= the_hash_algo
->rawsz
;
141 m
->num_chunks
= m
->data
[MIDX_BYTE_NUM_CHUNKS
];
143 m
->num_packs
= get_be32(m
->data
+ MIDX_BYTE_NUM_PACKS
);
145 cf
= init_chunkfile(NULL
);
147 if (read_table_of_contents(cf
, m
->data
, midx_size
,
148 MIDX_HEADER_SIZE
, m
->num_chunks
))
151 if (pair_chunk(cf
, MIDX_CHUNKID_PACKNAMES
, &m
->chunk_pack_names
) == CHUNK_NOT_FOUND
)
152 die(_("multi-pack-index missing required pack-name chunk"));
153 if (read_chunk(cf
, MIDX_CHUNKID_OIDFANOUT
, midx_read_oid_fanout
, m
) == CHUNK_NOT_FOUND
)
154 die(_("multi-pack-index missing required OID fanout chunk"));
155 if (pair_chunk(cf
, MIDX_CHUNKID_OIDLOOKUP
, &m
->chunk_oid_lookup
) == CHUNK_NOT_FOUND
)
156 die(_("multi-pack-index missing required OID lookup chunk"));
157 if (pair_chunk(cf
, MIDX_CHUNKID_OBJECTOFFSETS
, &m
->chunk_object_offsets
) == CHUNK_NOT_FOUND
)
158 die(_("multi-pack-index missing required object offsets chunk"));
160 pair_chunk(cf
, MIDX_CHUNKID_LARGEOFFSETS
, &m
->chunk_large_offsets
);
162 m
->num_objects
= ntohl(m
->chunk_oid_fanout
[255]);
164 CALLOC_ARRAY(m
->pack_names
, m
->num_packs
);
165 CALLOC_ARRAY(m
->packs
, m
->num_packs
);
167 cur_pack_name
= (const char *)m
->chunk_pack_names
;
168 for (i
= 0; i
< m
->num_packs
; i
++) {
169 m
->pack_names
[i
] = cur_pack_name
;
171 cur_pack_name
+= strlen(cur_pack_name
) + 1;
173 if (i
&& strcmp(m
->pack_names
[i
], m
->pack_names
[i
- 1]) <= 0)
174 die(_("multi-pack-index pack names out of order: '%s' before '%s'"),
175 m
->pack_names
[i
- 1],
179 trace2_data_intmax("midx", the_repository
, "load/num_packs", m
->num_packs
);
180 trace2_data_intmax("midx", the_repository
, "load/num_objects", m
->num_objects
);
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
+ 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
+ sizeof(uint64_t) * offset32
);
280 uint32_t nth_midxed_pack_int_id(struct multi_pack_index
*m
, uint32_t pos
)
282 return get_be32(m
->chunk_object_offsets
+
283 (off_t
)pos
* MIDX_CHUNK_OFFSET_WIDTH
);
286 static int nth_midxed_pack_entry(struct repository
*r
,
287 struct multi_pack_index
*m
,
288 struct pack_entry
*e
,
291 uint32_t pack_int_id
;
292 struct packed_git
*p
;
294 if (pos
>= m
->num_objects
)
297 pack_int_id
= nth_midxed_pack_int_id(m
, pos
);
299 if (prepare_midx_pack(r
, m
, pack_int_id
))
301 p
= m
->packs
[pack_int_id
];
304 * We are about to tell the caller where they can locate the
305 * requested object. We better make sure the packfile is
306 * still here and can be accessed before supplying that
307 * answer, as it may have been deleted since the MIDX was
310 if (!is_pack_valid(p
))
313 if (p
->num_bad_objects
) {
315 struct object_id oid
;
316 nth_midxed_object_oid(&oid
, m
, pos
);
317 for (i
= 0; i
< p
->num_bad_objects
; i
++)
319 p
->bad_object_sha1
+ the_hash_algo
->rawsz
* i
))
323 e
->offset
= nth_midxed_offset(m
, pos
);
329 int fill_midx_entry(struct repository
* r
,
330 const struct object_id
*oid
,
331 struct pack_entry
*e
,
332 struct multi_pack_index
*m
)
336 if (!bsearch_midx(oid
, m
, &pos
))
339 return nth_midxed_pack_entry(r
, m
, e
, pos
);
342 /* Match "foo.idx" against either "foo.pack" _or_ "foo.idx". */
343 static int cmp_idx_or_pack_name(const char *idx_or_pack_name
,
344 const char *idx_name
)
346 /* Skip past any initial matching prefix. */
347 while (*idx_name
&& *idx_name
== *idx_or_pack_name
) {
353 * If we didn't match completely, we may have matched "pack-1234." and
354 * be left with "idx" and "pack" respectively, which is also OK. We do
355 * not have to check for "idx" and "idx", because that would have been
356 * a complete match (and in that case these strcmps will be false, but
357 * we'll correctly return 0 from the final strcmp() below.
359 * Technically this matches "fooidx" and "foopack", but we'd never have
360 * such names in the first place.
362 if (!strcmp(idx_name
, "idx") && !strcmp(idx_or_pack_name
, "pack"))
366 * This not only checks for a complete match, but also orders based on
367 * the first non-identical character, which means our ordering will
368 * match a raw strcmp(). That makes it OK to use this to binary search
369 * a naively-sorted list.
371 return strcmp(idx_or_pack_name
, idx_name
);
374 int midx_contains_pack(struct multi_pack_index
*m
, const char *idx_or_pack_name
)
376 uint32_t first
= 0, last
= m
->num_packs
;
378 while (first
< last
) {
379 uint32_t mid
= first
+ (last
- first
) / 2;
383 current
= m
->pack_names
[mid
];
384 cmp
= cmp_idx_or_pack_name(idx_or_pack_name
, current
);
397 int prepare_multi_pack_index_one(struct repository
*r
, const char *object_dir
, int local
)
399 struct multi_pack_index
*m
;
400 struct multi_pack_index
*m_search
;
402 prepare_repo_settings(r
);
403 if (!r
->settings
.core_multi_pack_index
)
406 for (m_search
= r
->objects
->multi_pack_index
; m_search
; m_search
= m_search
->next
)
407 if (!strcmp(object_dir
, m_search
->object_dir
))
410 m
= load_multi_pack_index(object_dir
, local
);
413 struct multi_pack_index
*mp
= r
->objects
->multi_pack_index
;
418 r
->objects
->multi_pack_index
= m
;
425 static size_t write_midx_header(struct hashfile
*f
,
426 unsigned char num_chunks
,
429 hashwrite_be32(f
, MIDX_SIGNATURE
);
430 hashwrite_u8(f
, MIDX_VERSION
);
431 hashwrite_u8(f
, oid_version());
432 hashwrite_u8(f
, num_chunks
);
433 hashwrite_u8(f
, 0); /* unused */
434 hashwrite_be32(f
, num_packs
);
436 return MIDX_HEADER_SIZE
;
440 uint32_t orig_pack_int_id
;
442 struct packed_git
*p
;
443 unsigned expired
: 1;
446 static int pack_info_compare(const void *_a
, const void *_b
)
448 struct pack_info
*a
= (struct pack_info
*)_a
;
449 struct pack_info
*b
= (struct pack_info
*)_b
;
450 return strcmp(a
->pack_name
, b
->pack_name
);
453 static int idx_or_pack_name_cmp(const void *_va
, const void *_vb
)
455 const char *pack_name
= _va
;
456 const struct pack_info
*compar
= _vb
;
458 return cmp_idx_or_pack_name(pack_name
, compar
->pack_name
);
461 struct write_midx_context
{
462 struct pack_info
*info
;
465 struct multi_pack_index
*m
;
466 struct progress
*progress
;
467 unsigned pack_paths_checked
;
469 struct pack_midx_entry
*entries
;
473 uint32_t *pack_order
;
474 unsigned large_offsets_needed
:1;
475 uint32_t num_large_offsets
;
477 int preferred_pack_idx
;
480 static void add_pack_to_midx(const char *full_path
, size_t full_path_len
,
481 const char *file_name
, void *data
)
483 struct write_midx_context
*ctx
= data
;
485 if (ends_with(file_name
, ".idx")) {
486 display_progress(ctx
->progress
, ++ctx
->pack_paths_checked
);
487 if (ctx
->m
&& midx_contains_pack(ctx
->m
, file_name
))
490 ALLOC_GROW(ctx
->info
, ctx
->nr
+ 1, ctx
->alloc
);
492 ctx
->info
[ctx
->nr
].p
= add_packed_git(full_path
,
496 if (!ctx
->info
[ctx
->nr
].p
) {
497 warning(_("failed to add packfile '%s'"),
502 if (open_pack_index(ctx
->info
[ctx
->nr
].p
)) {
503 warning(_("failed to open pack-index '%s'"),
505 close_pack(ctx
->info
[ctx
->nr
].p
);
506 FREE_AND_NULL(ctx
->info
[ctx
->nr
].p
);
510 ctx
->info
[ctx
->nr
].pack_name
= xstrdup(file_name
);
511 ctx
->info
[ctx
->nr
].orig_pack_int_id
= ctx
->nr
;
512 ctx
->info
[ctx
->nr
].expired
= 0;
517 struct pack_midx_entry
{
518 struct object_id oid
;
519 uint32_t pack_int_id
;
522 unsigned preferred
: 1;
525 static int midx_oid_compare(const void *_a
, const void *_b
)
527 const struct pack_midx_entry
*a
= (const struct pack_midx_entry
*)_a
;
528 const struct pack_midx_entry
*b
= (const struct pack_midx_entry
*)_b
;
529 int cmp
= oidcmp(&a
->oid
, &b
->oid
);
534 /* Sort objects in a preferred pack first when multiple copies exist. */
535 if (a
->preferred
> b
->preferred
)
537 if (a
->preferred
< b
->preferred
)
540 if (a
->pack_mtime
> b
->pack_mtime
)
542 else if (a
->pack_mtime
< b
->pack_mtime
)
545 return a
->pack_int_id
- b
->pack_int_id
;
548 static int nth_midxed_pack_midx_entry(struct multi_pack_index
*m
,
549 struct pack_midx_entry
*e
,
552 if (pos
>= m
->num_objects
)
555 nth_midxed_object_oid(&e
->oid
, m
, pos
);
556 e
->pack_int_id
= nth_midxed_pack_int_id(m
, pos
);
557 e
->offset
= nth_midxed_offset(m
, pos
);
559 /* consider objects in midx to be from "old" packs */
564 static void fill_pack_entry(uint32_t pack_int_id
,
565 struct packed_git
*p
,
567 struct pack_midx_entry
*entry
,
570 if (nth_packed_object_id(&entry
->oid
, p
, cur_object
) < 0)
571 die(_("failed to locate object %d in packfile"), cur_object
);
573 entry
->pack_int_id
= pack_int_id
;
574 entry
->pack_mtime
= p
->mtime
;
576 entry
->offset
= nth_packed_object_offset(p
, cur_object
);
577 entry
->preferred
= !!preferred
;
581 * It is possible to artificially get into a state where there are many
582 * duplicate copies of objects. That can create high memory pressure if
583 * we are to create a list of all objects before de-duplication. To reduce
584 * this memory pressure without a significant performance drop, automatically
585 * group objects by the first byte of their object id. Use the IDX fanout
586 * tables to group the data, copy to a local array, then sort.
588 * Copy only the de-duplicated entries (selected by most-recent modified time
589 * of a packfile containing the object).
591 static struct pack_midx_entry
*get_sorted_entries(struct multi_pack_index
*m
,
592 struct pack_info
*info
,
594 uint32_t *nr_objects
,
597 uint32_t cur_fanout
, cur_pack
, cur_object
;
598 uint32_t alloc_fanout
, alloc_objects
, total_objects
= 0;
599 struct pack_midx_entry
*entries_by_fanout
= NULL
;
600 struct pack_midx_entry
*deduplicated_entries
= NULL
;
601 uint32_t start_pack
= m
? m
->num_packs
: 0;
603 for (cur_pack
= start_pack
; cur_pack
< nr_packs
; cur_pack
++)
604 total_objects
+= info
[cur_pack
].p
->num_objects
;
607 * As we de-duplicate by fanout value, we expect the fanout
608 * slices to be evenly distributed, with some noise. Hence,
609 * allocate slightly more than one 256th.
611 alloc_objects
= alloc_fanout
= total_objects
> 3200 ? total_objects
/ 200 : 16;
613 ALLOC_ARRAY(entries_by_fanout
, alloc_fanout
);
614 ALLOC_ARRAY(deduplicated_entries
, alloc_objects
);
617 for (cur_fanout
= 0; cur_fanout
< 256; cur_fanout
++) {
618 uint32_t nr_fanout
= 0;
621 uint32_t start
= 0, end
;
624 start
= ntohl(m
->chunk_oid_fanout
[cur_fanout
- 1]);
625 end
= ntohl(m
->chunk_oid_fanout
[cur_fanout
]);
627 for (cur_object
= start
; cur_object
< end
; cur_object
++) {
628 ALLOC_GROW(entries_by_fanout
, nr_fanout
+ 1, alloc_fanout
);
629 nth_midxed_pack_midx_entry(m
,
630 &entries_by_fanout
[nr_fanout
],
632 if (nth_midxed_pack_int_id(m
, cur_object
) == preferred_pack
)
633 entries_by_fanout
[nr_fanout
].preferred
= 1;
635 entries_by_fanout
[nr_fanout
].preferred
= 0;
640 for (cur_pack
= start_pack
; cur_pack
< nr_packs
; cur_pack
++) {
641 uint32_t start
= 0, end
;
642 int preferred
= cur_pack
== preferred_pack
;
645 start
= get_pack_fanout(info
[cur_pack
].p
, cur_fanout
- 1);
646 end
= get_pack_fanout(info
[cur_pack
].p
, cur_fanout
);
648 for (cur_object
= start
; cur_object
< end
; cur_object
++) {
649 ALLOC_GROW(entries_by_fanout
, nr_fanout
+ 1, alloc_fanout
);
650 fill_pack_entry(cur_pack
,
653 &entries_by_fanout
[nr_fanout
],
659 QSORT(entries_by_fanout
, nr_fanout
, midx_oid_compare
);
662 * The batch is now sorted by OID and then mtime (descending).
663 * Take only the first duplicate.
665 for (cur_object
= 0; cur_object
< nr_fanout
; cur_object
++) {
666 if (cur_object
&& oideq(&entries_by_fanout
[cur_object
- 1].oid
,
667 &entries_by_fanout
[cur_object
].oid
))
670 ALLOC_GROW(deduplicated_entries
, *nr_objects
+ 1, alloc_objects
);
671 memcpy(&deduplicated_entries
[*nr_objects
],
672 &entries_by_fanout
[cur_object
],
673 sizeof(struct pack_midx_entry
));
678 free(entries_by_fanout
);
679 return deduplicated_entries
;
682 static int write_midx_pack_names(struct hashfile
*f
, void *data
)
684 struct write_midx_context
*ctx
= data
;
686 unsigned char padding
[MIDX_CHUNK_ALIGNMENT
];
689 for (i
= 0; i
< ctx
->nr
; i
++) {
692 if (ctx
->info
[i
].expired
)
695 if (i
&& strcmp(ctx
->info
[i
].pack_name
, ctx
->info
[i
- 1].pack_name
) <= 0)
696 BUG("incorrect pack-file order: %s before %s",
697 ctx
->info
[i
- 1].pack_name
,
698 ctx
->info
[i
].pack_name
);
700 writelen
= strlen(ctx
->info
[i
].pack_name
) + 1;
701 hashwrite(f
, ctx
->info
[i
].pack_name
, writelen
);
705 /* add padding to be aligned */
706 i
= MIDX_CHUNK_ALIGNMENT
- (written
% MIDX_CHUNK_ALIGNMENT
);
707 if (i
< MIDX_CHUNK_ALIGNMENT
) {
708 memset(padding
, 0, sizeof(padding
));
709 hashwrite(f
, padding
, i
);
715 static int write_midx_oid_fanout(struct hashfile
*f
,
718 struct write_midx_context
*ctx
= data
;
719 struct pack_midx_entry
*list
= ctx
->entries
;
720 struct pack_midx_entry
*last
= ctx
->entries
+ ctx
->entries_nr
;
725 * Write the first-level table (the list is sorted,
726 * but we use a 256-entry lookup to be able to avoid
727 * having to do eight extra binary search iterations).
729 for (i
= 0; i
< 256; i
++) {
730 struct pack_midx_entry
*next
= list
;
732 while (next
< last
&& next
->oid
.hash
[0] == i
) {
737 hashwrite_be32(f
, count
);
744 static int write_midx_oid_lookup(struct hashfile
*f
,
747 struct write_midx_context
*ctx
= data
;
748 unsigned char hash_len
= the_hash_algo
->rawsz
;
749 struct pack_midx_entry
*list
= ctx
->entries
;
752 for (i
= 0; i
< ctx
->entries_nr
; i
++) {
753 struct pack_midx_entry
*obj
= list
++;
755 if (i
< ctx
->entries_nr
- 1) {
756 struct pack_midx_entry
*next
= list
;
757 if (oidcmp(&obj
->oid
, &next
->oid
) >= 0)
758 BUG("OIDs not in order: %s >= %s",
759 oid_to_hex(&obj
->oid
),
760 oid_to_hex(&next
->oid
));
763 hashwrite(f
, obj
->oid
.hash
, (int)hash_len
);
769 static int write_midx_object_offsets(struct hashfile
*f
,
772 struct write_midx_context
*ctx
= data
;
773 struct pack_midx_entry
*list
= ctx
->entries
;
774 uint32_t i
, nr_large_offset
= 0;
776 for (i
= 0; i
< ctx
->entries_nr
; i
++) {
777 struct pack_midx_entry
*obj
= list
++;
779 if (ctx
->pack_perm
[obj
->pack_int_id
] == PACK_EXPIRED
)
780 BUG("object %s is in an expired pack with int-id %d",
781 oid_to_hex(&obj
->oid
),
784 hashwrite_be32(f
, ctx
->pack_perm
[obj
->pack_int_id
]);
786 if (ctx
->large_offsets_needed
&& obj
->offset
>> 31)
787 hashwrite_be32(f
, MIDX_LARGE_OFFSET_NEEDED
| nr_large_offset
++);
788 else if (!ctx
->large_offsets_needed
&& obj
->offset
>> 32)
789 BUG("object %s requires a large offset (%"PRIx64
") but the MIDX is not writing large offsets!",
790 oid_to_hex(&obj
->oid
),
793 hashwrite_be32(f
, (uint32_t)obj
->offset
);
799 static int write_midx_large_offsets(struct hashfile
*f
,
802 struct write_midx_context
*ctx
= data
;
803 struct pack_midx_entry
*list
= ctx
->entries
;
804 struct pack_midx_entry
*end
= ctx
->entries
+ ctx
->entries_nr
;
805 uint32_t nr_large_offset
= ctx
->num_large_offsets
;
807 while (nr_large_offset
) {
808 struct pack_midx_entry
*obj
;
812 BUG("too many large-offset objects");
815 offset
= obj
->offset
;
820 hashwrite_be64(f
, offset
);
828 struct midx_pack_order_data
{
834 static int midx_pack_order_cmp(const void *va
, const void *vb
)
836 const struct midx_pack_order_data
*a
= va
, *b
= vb
;
837 if (a
->pack
< b
->pack
)
839 else if (a
->pack
> b
->pack
)
841 else if (a
->offset
< b
->offset
)
843 else if (a
->offset
> b
->offset
)
849 static uint32_t *midx_pack_order(struct write_midx_context
*ctx
)
851 struct midx_pack_order_data
*data
;
852 uint32_t *pack_order
;
855 ALLOC_ARRAY(data
, ctx
->entries_nr
);
856 for (i
= 0; i
< ctx
->entries_nr
; i
++) {
857 struct pack_midx_entry
*e
= &ctx
->entries
[i
];
859 data
[i
].pack
= ctx
->pack_perm
[e
->pack_int_id
];
861 data
[i
].pack
|= (1U << 31);
862 data
[i
].offset
= e
->offset
;
865 QSORT(data
, ctx
->entries_nr
, midx_pack_order_cmp
);
867 ALLOC_ARRAY(pack_order
, ctx
->entries_nr
);
868 for (i
= 0; i
< ctx
->entries_nr
; i
++)
869 pack_order
[i
] = data
[i
].nr
;
875 static void write_midx_reverse_index(char *midx_name
, unsigned char *midx_hash
,
876 struct write_midx_context
*ctx
)
878 struct strbuf buf
= STRBUF_INIT
;
879 const char *tmp_file
;
881 strbuf_addf(&buf
, "%s-%s.rev", midx_name
, hash_to_hex(midx_hash
));
883 tmp_file
= write_rev_file_order(NULL
, ctx
->pack_order
, ctx
->entries_nr
,
884 midx_hash
, WRITE_REV
);
886 if (finalize_object_file(tmp_file
, buf
.buf
))
887 die(_("cannot store reverse index file"));
889 strbuf_release(&buf
);
892 static void clear_midx_files_ext(const char *object_dir
, const char *ext
,
893 unsigned char *keep_hash
);
895 static int midx_checksum_valid(struct multi_pack_index
*m
)
897 return hashfile_checksum_valid(m
->data
, m
->data_len
);
900 static void prepare_midx_packing_data(struct packing_data
*pdata
,
901 struct write_midx_context
*ctx
)
905 memset(pdata
, 0, sizeof(struct packing_data
));
906 prepare_packing_data(the_repository
, pdata
);
908 for (i
= 0; i
< ctx
->entries_nr
; i
++) {
909 struct pack_midx_entry
*from
= &ctx
->entries
[ctx
->pack_order
[i
]];
910 struct object_entry
*to
= packlist_alloc(pdata
, &from
->oid
);
912 oe_set_in_pack(pdata
, to
,
913 ctx
->info
[ctx
->pack_perm
[from
->pack_int_id
]].p
);
917 static int add_ref_to_pending(const char *refname
,
918 const struct object_id
*oid
,
919 int flag
, void *cb_data
)
921 struct rev_info
*revs
= (struct rev_info
*)cb_data
;
922 struct object
*object
;
924 if ((flag
& REF_ISSYMREF
) && (flag
& REF_ISBROKEN
)) {
925 warning("symbolic ref is dangling: %s", refname
);
929 object
= parse_object_or_die(oid
, refname
);
930 if (object
->type
!= OBJ_COMMIT
)
933 add_pending_object(revs
, object
, "");
934 if (bitmap_is_preferred_refname(revs
->repo
, refname
))
935 object
->flags
|= NEEDS_BITMAP
;
939 struct bitmap_commit_cb
{
940 struct commit
**commits
;
941 size_t commits_nr
, commits_alloc
;
943 struct write_midx_context
*ctx
;
946 static const struct object_id
*bitmap_oid_access(size_t index
,
947 const void *_entries
)
949 const struct pack_midx_entry
*entries
= _entries
;
950 return &entries
[index
].oid
;
953 static void bitmap_show_commit(struct commit
*commit
, void *_data
)
955 struct bitmap_commit_cb
*data
= _data
;
956 int pos
= oid_pos(&commit
->object
.oid
, data
->ctx
->entries
,
957 data
->ctx
->entries_nr
,
962 ALLOC_GROW(data
->commits
, data
->commits_nr
+ 1, data
->commits_alloc
);
963 data
->commits
[data
->commits_nr
++] = commit
;
966 static struct commit
**find_commits_for_midx_bitmap(uint32_t *indexed_commits_nr_p
,
967 struct write_midx_context
*ctx
)
969 struct rev_info revs
;
970 struct bitmap_commit_cb cb
= {0};
974 repo_init_revisions(the_repository
, &revs
, NULL
);
975 setup_revisions(0, NULL
, &revs
, NULL
);
976 for_each_ref(add_ref_to_pending
, &revs
);
979 * Skipping promisor objects here is intentional, since it only excludes
980 * them from the list of reachable commits that we want to select from
981 * when computing the selection of MIDX'd commits to receive bitmaps.
983 * Reachability bitmaps do require that their objects be closed under
984 * reachability, but fetching any objects missing from promisors at this
985 * point is too late. But, if one of those objects can be reached from
986 * an another object that is included in the bitmap, then we will
987 * complain later that we don't have reachability closure (and fail
990 fetch_if_missing
= 0;
991 revs
.exclude_promisor_objects
= 1;
993 if (prepare_revision_walk(&revs
))
994 die(_("revision walk setup failed"));
996 traverse_commit_list(&revs
, bitmap_show_commit
, NULL
, &cb
);
997 if (indexed_commits_nr_p
)
998 *indexed_commits_nr_p
= cb
.commits_nr
;
1003 static int write_midx_bitmap(char *midx_name
, unsigned char *midx_hash
,
1004 struct write_midx_context
*ctx
,
1007 struct packing_data pdata
;
1008 struct pack_idx_entry
**index
;
1009 struct commit
**commits
= NULL
;
1010 uint32_t i
, commits_nr
;
1011 uint16_t options
= 0;
1012 char *bitmap_name
= xstrfmt("%s-%s.bitmap", midx_name
, hash_to_hex(midx_hash
));
1015 if (flags
& MIDX_WRITE_BITMAP_HASH_CACHE
)
1016 options
|= BITMAP_OPT_HASH_CACHE
;
1018 prepare_midx_packing_data(&pdata
, ctx
);
1020 commits
= find_commits_for_midx_bitmap(&commits_nr
, ctx
);
1023 * Build the MIDX-order index based on pdata.objects (which is already
1024 * in MIDX order; c.f., 'midx_pack_order_cmp()' for the definition of
1027 ALLOC_ARRAY(index
, pdata
.nr_objects
);
1028 for (i
= 0; i
< pdata
.nr_objects
; i
++)
1029 index
[i
] = &pdata
.objects
[i
].idx
;
1031 bitmap_writer_show_progress(flags
& MIDX_PROGRESS
);
1032 bitmap_writer_build_type_index(&pdata
, index
, pdata
.nr_objects
);
1035 * bitmap_writer_finish expects objects in lex order, but pack_order
1036 * gives us exactly that. use it directly instead of re-sorting the
1039 * This changes the order of objects in 'index' between
1040 * bitmap_writer_build_type_index and bitmap_writer_finish.
1042 * The same re-ordering takes place in the single-pack bitmap code via
1043 * write_idx_file(), which is called by finish_tmp_packfile(), which
1044 * happens between bitmap_writer_build_type_index() and
1045 * bitmap_writer_finish().
1047 for (i
= 0; i
< pdata
.nr_objects
; i
++)
1048 index
[ctx
->pack_order
[i
]] = &pdata
.objects
[i
].idx
;
1050 bitmap_writer_select_commits(commits
, commits_nr
, -1);
1051 ret
= bitmap_writer_build(&pdata
);
1055 bitmap_writer_set_checksum(midx_hash
);
1056 bitmap_writer_finish(index
, pdata
.nr_objects
, bitmap_name
, options
);
1064 static int write_midx_internal(const char *object_dir
,
1065 struct string_list
*packs_to_drop
,
1066 const char *preferred_pack_name
,
1070 unsigned char midx_hash
[GIT_MAX_RAWSZ
];
1072 struct hashfile
*f
= NULL
;
1073 struct lock_file lk
;
1074 struct write_midx_context ctx
= { 0 };
1075 struct multi_pack_index
*cur
;
1076 int pack_name_concat_len
= 0;
1077 int dropped_packs
= 0;
1079 struct chunkfile
*cf
;
1081 /* Ensure the given object_dir is local, or a known alternate. */
1082 find_odb(the_repository
, object_dir
);
1084 midx_name
= get_midx_filename(object_dir
);
1085 if (safe_create_leading_directories(midx_name
))
1086 die_errno(_("unable to create leading directories of %s"),
1089 for (cur
= get_multi_pack_index(the_repository
); cur
; cur
= cur
->next
) {
1090 if (!strcmp(object_dir
, cur
->object_dir
)) {
1096 if (ctx
.m
&& !midx_checksum_valid(ctx
.m
)) {
1097 warning(_("ignoring existing multi-pack-index; checksum mismatch"));
1102 ctx
.alloc
= ctx
.m
? ctx
.m
->num_packs
: 16;
1104 ALLOC_ARRAY(ctx
.info
, ctx
.alloc
);
1107 for (i
= 0; i
< ctx
.m
->num_packs
; i
++) {
1108 ALLOC_GROW(ctx
.info
, ctx
.nr
+ 1, ctx
.alloc
);
1110 ctx
.info
[ctx
.nr
].orig_pack_int_id
= i
;
1111 ctx
.info
[ctx
.nr
].pack_name
= xstrdup(ctx
.m
->pack_names
[i
]);
1112 ctx
.info
[ctx
.nr
].p
= ctx
.m
->packs
[i
];
1113 ctx
.info
[ctx
.nr
].expired
= 0;
1115 if (flags
& MIDX_WRITE_REV_INDEX
) {
1117 * If generating a reverse index, need to have
1118 * packed_git's loaded to compare their
1119 * mtimes and object count.
1121 if (prepare_midx_pack(the_repository
, ctx
.m
, i
)) {
1122 error(_("could not load pack"));
1127 if (open_pack_index(ctx
.m
->packs
[i
]))
1128 die(_("could not open index for %s"),
1129 ctx
.m
->packs
[i
]->pack_name
);
1130 ctx
.info
[ctx
.nr
].p
= ctx
.m
->packs
[i
];
1137 ctx
.pack_paths_checked
= 0;
1138 if (flags
& MIDX_PROGRESS
)
1139 ctx
.progress
= start_delayed_progress(_("Adding packfiles to multi-pack-index"), 0);
1141 ctx
.progress
= NULL
;
1143 for_each_file_in_pack_dir(object_dir
, add_pack_to_midx
, &ctx
);
1144 stop_progress(&ctx
.progress
);
1146 if (ctx
.m
&& ctx
.nr
== ctx
.m
->num_packs
&& !packs_to_drop
) {
1147 struct bitmap_index
*bitmap_git
;
1149 int want_bitmap
= flags
& MIDX_WRITE_BITMAP
;
1151 bitmap_git
= prepare_midx_bitmap_git(ctx
.m
);
1152 bitmap_exists
= bitmap_git
&& bitmap_is_midx(bitmap_git
);
1153 free_bitmap_index(bitmap_git
);
1155 if (bitmap_exists
|| !want_bitmap
) {
1157 * The correct MIDX already exists, and so does a
1158 * corresponding bitmap (or one wasn't requested).
1161 clear_midx_files_ext(object_dir
, ".bitmap",
1167 if (preferred_pack_name
) {
1169 for (i
= 0; i
< ctx
.nr
; i
++) {
1170 if (!cmp_idx_or_pack_name(preferred_pack_name
,
1171 ctx
.info
[i
].pack_name
)) {
1172 ctx
.preferred_pack_idx
= i
;
1179 warning(_("unknown preferred pack: '%s'"),
1180 preferred_pack_name
);
1181 } else if (ctx
.nr
&&
1182 (flags
& (MIDX_WRITE_REV_INDEX
| MIDX_WRITE_BITMAP
))) {
1183 struct packed_git
*oldest
= ctx
.info
[ctx
.preferred_pack_idx
].p
;
1184 ctx
.preferred_pack_idx
= 0;
1186 if (packs_to_drop
&& packs_to_drop
->nr
)
1187 BUG("cannot write a MIDX bitmap during expiration");
1190 * set a preferred pack when writing a bitmap to ensure that
1191 * the pack from which the first object is selected in pseudo
1192 * pack-order has all of its objects selected from that pack
1193 * (and not another pack containing a duplicate)
1195 for (i
= 1; i
< ctx
.nr
; i
++) {
1196 struct packed_git
*p
= ctx
.info
[i
].p
;
1198 if (!oldest
->num_objects
|| p
->mtime
< oldest
->mtime
) {
1200 ctx
.preferred_pack_idx
= i
;
1204 if (!oldest
->num_objects
) {
1206 * If all packs are empty; unset the preferred index.
1207 * This is acceptable since there will be no duplicate
1208 * objects to resolve, so the preferred value doesn't
1211 ctx
.preferred_pack_idx
= -1;
1215 * otherwise don't mark any pack as preferred to avoid
1216 * interfering with expiration logic below
1218 ctx
.preferred_pack_idx
= -1;
1221 if (ctx
.preferred_pack_idx
> -1) {
1222 struct packed_git
*preferred
= ctx
.info
[ctx
.preferred_pack_idx
].p
;
1223 if (!preferred
->num_objects
) {
1224 error(_("cannot select preferred pack %s with no objects"),
1225 preferred
->pack_name
);
1231 ctx
.entries
= get_sorted_entries(ctx
.m
, ctx
.info
, ctx
.nr
, &ctx
.entries_nr
,
1232 ctx
.preferred_pack_idx
);
1234 ctx
.large_offsets_needed
= 0;
1235 for (i
= 0; i
< ctx
.entries_nr
; i
++) {
1236 if (ctx
.entries
[i
].offset
> 0x7fffffff)
1237 ctx
.num_large_offsets
++;
1238 if (ctx
.entries
[i
].offset
> 0xffffffff)
1239 ctx
.large_offsets_needed
= 1;
1242 QSORT(ctx
.info
, ctx
.nr
, pack_info_compare
);
1244 if (packs_to_drop
&& packs_to_drop
->nr
) {
1246 int missing_drops
= 0;
1248 for (i
= 0; i
< ctx
.nr
&& drop_index
< packs_to_drop
->nr
; i
++) {
1249 int cmp
= strcmp(ctx
.info
[i
].pack_name
,
1250 packs_to_drop
->items
[drop_index
].string
);
1254 ctx
.info
[i
].expired
= 1;
1255 } else if (cmp
> 0) {
1256 error(_("did not see pack-file %s to drop"),
1257 packs_to_drop
->items
[drop_index
].string
);
1262 ctx
.info
[i
].expired
= 0;
1266 if (missing_drops
) {
1273 * pack_perm stores a permutation between pack-int-ids from the
1274 * previous multi-pack-index to the new one we are writing:
1276 * pack_perm[old_id] = new_id
1278 ALLOC_ARRAY(ctx
.pack_perm
, ctx
.nr
);
1279 for (i
= 0; i
< ctx
.nr
; i
++) {
1280 if (ctx
.info
[i
].expired
) {
1282 ctx
.pack_perm
[ctx
.info
[i
].orig_pack_int_id
] = PACK_EXPIRED
;
1284 ctx
.pack_perm
[ctx
.info
[i
].orig_pack_int_id
] = i
- dropped_packs
;
1288 for (i
= 0; i
< ctx
.nr
; i
++) {
1289 if (!ctx
.info
[i
].expired
)
1290 pack_name_concat_len
+= strlen(ctx
.info
[i
].pack_name
) + 1;
1293 /* Check that the preferred pack wasn't expired (if given). */
1294 if (preferred_pack_name
) {
1295 struct pack_info
*preferred
= bsearch(preferred_pack_name
,
1298 idx_or_pack_name_cmp
);
1300 uint32_t perm
= ctx
.pack_perm
[preferred
->orig_pack_int_id
];
1301 if (perm
== PACK_EXPIRED
)
1302 warning(_("preferred pack '%s' is expired"),
1303 preferred_pack_name
);
1307 if (pack_name_concat_len
% MIDX_CHUNK_ALIGNMENT
)
1308 pack_name_concat_len
+= MIDX_CHUNK_ALIGNMENT
-
1309 (pack_name_concat_len
% MIDX_CHUNK_ALIGNMENT
);
1311 hold_lock_file_for_update(&lk
, midx_name
, LOCK_DIE_ON_ERROR
);
1312 f
= hashfd(get_lock_file_fd(&lk
), get_lock_file_path(&lk
));
1314 if (ctx
.nr
- dropped_packs
== 0) {
1315 error(_("no pack files to index."));
1320 cf
= init_chunkfile(f
);
1322 add_chunk(cf
, MIDX_CHUNKID_PACKNAMES
, pack_name_concat_len
,
1323 write_midx_pack_names
);
1324 add_chunk(cf
, MIDX_CHUNKID_OIDFANOUT
, MIDX_CHUNK_FANOUT_SIZE
,
1325 write_midx_oid_fanout
);
1326 add_chunk(cf
, MIDX_CHUNKID_OIDLOOKUP
,
1327 (size_t)ctx
.entries_nr
* the_hash_algo
->rawsz
,
1328 write_midx_oid_lookup
);
1329 add_chunk(cf
, MIDX_CHUNKID_OBJECTOFFSETS
,
1330 (size_t)ctx
.entries_nr
* MIDX_CHUNK_OFFSET_WIDTH
,
1331 write_midx_object_offsets
);
1333 if (ctx
.large_offsets_needed
)
1334 add_chunk(cf
, MIDX_CHUNKID_LARGEOFFSETS
,
1335 (size_t)ctx
.num_large_offsets
* MIDX_CHUNK_LARGE_OFFSET_WIDTH
,
1336 write_midx_large_offsets
);
1338 write_midx_header(f
, get_num_chunks(cf
), ctx
.nr
- dropped_packs
);
1339 write_chunkfile(cf
, &ctx
);
1341 finalize_hashfile(f
, midx_hash
, CSUM_FSYNC
| CSUM_HASH_IN_STREAM
);
1344 if (flags
& (MIDX_WRITE_REV_INDEX
| MIDX_WRITE_BITMAP
))
1345 ctx
.pack_order
= midx_pack_order(&ctx
);
1347 if (flags
& MIDX_WRITE_REV_INDEX
)
1348 write_midx_reverse_index(midx_name
, midx_hash
, &ctx
);
1349 if (flags
& MIDX_WRITE_BITMAP
) {
1350 if (write_midx_bitmap(midx_name
, midx_hash
, &ctx
, flags
) < 0) {
1351 error(_("could not write multi-pack bitmap"));
1358 close_object_store(the_repository
->objects
);
1360 commit_lock_file(&lk
);
1362 clear_midx_files_ext(object_dir
, ".bitmap", midx_hash
);
1363 clear_midx_files_ext(object_dir
, ".rev", midx_hash
);
1366 for (i
= 0; i
< ctx
.nr
; i
++) {
1367 if (ctx
.info
[i
].p
) {
1368 close_pack(ctx
.info
[i
].p
);
1369 free(ctx
.info
[i
].p
);
1371 free(ctx
.info
[i
].pack_name
);
1376 free(ctx
.pack_perm
);
1377 free(ctx
.pack_order
);
1383 int write_midx_file(const char *object_dir
,
1384 const char *preferred_pack_name
,
1387 return write_midx_internal(object_dir
, NULL
, preferred_pack_name
, flags
);
1390 struct clear_midx_data
{
1395 static void clear_midx_file_ext(const char *full_path
, size_t full_path_len
,
1396 const char *file_name
, void *_data
)
1398 struct clear_midx_data
*data
= _data
;
1400 if (!(starts_with(file_name
, "multi-pack-index-") &&
1401 ends_with(file_name
, data
->ext
)))
1403 if (data
->keep
&& !strcmp(data
->keep
, file_name
))
1406 if (unlink(full_path
))
1407 die_errno(_("failed to remove %s"), full_path
);
1410 static void clear_midx_files_ext(const char *object_dir
, const char *ext
,
1411 unsigned char *keep_hash
)
1413 struct clear_midx_data data
;
1414 memset(&data
, 0, sizeof(struct clear_midx_data
));
1417 data
.keep
= xstrfmt("multi-pack-index-%s%s",
1418 hash_to_hex(keep_hash
), ext
);
1421 for_each_file_in_pack_dir(object_dir
,
1422 clear_midx_file_ext
,
1428 void clear_midx_file(struct repository
*r
)
1430 char *midx
= get_midx_filename(r
->objects
->odb
->path
);
1432 if (r
->objects
&& r
->objects
->multi_pack_index
) {
1433 close_midx(r
->objects
->multi_pack_index
);
1434 r
->objects
->multi_pack_index
= NULL
;
1437 if (remove_path(midx
))
1438 die(_("failed to clear multi-pack-index at %s"), midx
);
1440 clear_midx_files_ext(r
->objects
->odb
->path
, ".bitmap", NULL
);
1441 clear_midx_files_ext(r
->objects
->odb
->path
, ".rev", NULL
);
1446 static int verify_midx_error
;
1448 __attribute__((format (printf
, 1, 2)))
1449 static void midx_report(const char *fmt
, ...)
1452 verify_midx_error
= 1;
1454 vfprintf(stderr
, fmt
, ap
);
1455 fprintf(stderr
, "\n");
1459 struct pair_pos_vs_id
1462 uint32_t pack_int_id
;
1465 static int compare_pair_pos_vs_id(const void *_a
, const void *_b
)
1467 struct pair_pos_vs_id
*a
= (struct pair_pos_vs_id
*)_a
;
1468 struct pair_pos_vs_id
*b
= (struct pair_pos_vs_id
*)_b
;
1470 return b
->pack_int_id
- a
->pack_int_id
;
1474 * Limit calls to display_progress() for performance reasons.
1475 * The interval here was arbitrarily chosen.
1477 #define SPARSE_PROGRESS_INTERVAL (1 << 12)
1478 #define midx_display_sparse_progress(progress, n) \
1480 uint64_t _n = (n); \
1481 if ((_n & (SPARSE_PROGRESS_INTERVAL - 1)) == 0) \
1482 display_progress(progress, _n); \
1485 int verify_midx_file(struct repository
*r
, const char *object_dir
, unsigned flags
)
1487 struct pair_pos_vs_id
*pairs
= NULL
;
1489 struct progress
*progress
= NULL
;
1490 struct multi_pack_index
*m
= load_multi_pack_index(object_dir
, 1);
1491 verify_midx_error
= 0;
1496 char *filename
= get_midx_filename(object_dir
);
1497 if (!stat(filename
, &sb
)) {
1498 error(_("multi-pack-index file exists, but failed to parse"));
1505 if (!midx_checksum_valid(m
))
1506 midx_report(_("incorrect checksum"));
1508 if (flags
& MIDX_PROGRESS
)
1509 progress
= start_delayed_progress(_("Looking for referenced packfiles"),
1511 for (i
= 0; i
< m
->num_packs
; i
++) {
1512 if (prepare_midx_pack(r
, m
, i
))
1513 midx_report("failed to load pack in position %d", i
);
1515 display_progress(progress
, i
+ 1);
1517 stop_progress(&progress
);
1519 for (i
= 0; i
< 255; i
++) {
1520 uint32_t oid_fanout1
= ntohl(m
->chunk_oid_fanout
[i
]);
1521 uint32_t oid_fanout2
= ntohl(m
->chunk_oid_fanout
[i
+ 1]);
1523 if (oid_fanout1
> oid_fanout2
)
1524 midx_report(_("oid fanout out of order: fanout[%d] = %"PRIx32
" > %"PRIx32
" = fanout[%d]"),
1525 i
, oid_fanout1
, oid_fanout2
, i
+ 1);
1528 if (m
->num_objects
== 0) {
1529 midx_report(_("the midx contains no oid"));
1531 * Remaining tests assume that we have objects, so we can
1534 return verify_midx_error
;
1537 if (flags
& MIDX_PROGRESS
)
1538 progress
= start_sparse_progress(_("Verifying OID order in multi-pack-index"),
1539 m
->num_objects
- 1);
1540 for (i
= 0; i
< m
->num_objects
- 1; i
++) {
1541 struct object_id oid1
, oid2
;
1543 nth_midxed_object_oid(&oid1
, m
, i
);
1544 nth_midxed_object_oid(&oid2
, m
, i
+ 1);
1546 if (oidcmp(&oid1
, &oid2
) >= 0)
1547 midx_report(_("oid lookup out of order: oid[%d] = %s >= %s = oid[%d]"),
1548 i
, oid_to_hex(&oid1
), oid_to_hex(&oid2
), i
+ 1);
1550 midx_display_sparse_progress(progress
, i
+ 1);
1552 stop_progress(&progress
);
1555 * Create an array mapping each object to its packfile id. Sort it
1556 * to group the objects by packfile. Use this permutation to visit
1557 * each of the objects and only require 1 packfile to be open at a
1560 ALLOC_ARRAY(pairs
, m
->num_objects
);
1561 for (i
= 0; i
< m
->num_objects
; i
++) {
1563 pairs
[i
].pack_int_id
= nth_midxed_pack_int_id(m
, i
);
1566 if (flags
& MIDX_PROGRESS
)
1567 progress
= start_sparse_progress(_("Sorting objects by packfile"),
1569 display_progress(progress
, 0); /* TODO: Measure QSORT() progress */
1570 QSORT(pairs
, m
->num_objects
, compare_pair_pos_vs_id
);
1571 stop_progress(&progress
);
1573 if (flags
& MIDX_PROGRESS
)
1574 progress
= start_sparse_progress(_("Verifying object offsets"), m
->num_objects
);
1575 for (i
= 0; i
< m
->num_objects
; i
++) {
1576 struct object_id oid
;
1577 struct pack_entry e
;
1578 off_t m_offset
, p_offset
;
1580 if (i
> 0 && pairs
[i
-1].pack_int_id
!= pairs
[i
].pack_int_id
&&
1581 m
->packs
[pairs
[i
-1].pack_int_id
])
1583 close_pack_fd(m
->packs
[pairs
[i
-1].pack_int_id
]);
1584 close_pack_index(m
->packs
[pairs
[i
-1].pack_int_id
]);
1587 nth_midxed_object_oid(&oid
, m
, pairs
[i
].pos
);
1589 if (!fill_midx_entry(r
, &oid
, &e
, m
)) {
1590 midx_report(_("failed to load pack entry for oid[%d] = %s"),
1591 pairs
[i
].pos
, oid_to_hex(&oid
));
1595 if (open_pack_index(e
.p
)) {
1596 midx_report(_("failed to load pack-index for packfile %s"),
1601 m_offset
= e
.offset
;
1602 p_offset
= find_pack_entry_one(oid
.hash
, e
.p
);
1604 if (m_offset
!= p_offset
)
1605 midx_report(_("incorrect object offset for oid[%d] = %s: %"PRIx64
" != %"PRIx64
),
1606 pairs
[i
].pos
, oid_to_hex(&oid
), m_offset
, p_offset
);
1608 midx_display_sparse_progress(progress
, i
+ 1);
1610 stop_progress(&progress
);
1614 return verify_midx_error
;
1617 int expire_midx_packs(struct repository
*r
, const char *object_dir
, unsigned flags
)
1619 uint32_t i
, *count
, result
= 0;
1620 struct string_list packs_to_drop
= STRING_LIST_INIT_DUP
;
1621 struct multi_pack_index
*m
= load_multi_pack_index(object_dir
, 1);
1622 struct progress
*progress
= NULL
;
1627 CALLOC_ARRAY(count
, m
->num_packs
);
1629 if (flags
& MIDX_PROGRESS
)
1630 progress
= start_delayed_progress(_("Counting referenced objects"),
1632 for (i
= 0; i
< m
->num_objects
; i
++) {
1633 int pack_int_id
= nth_midxed_pack_int_id(m
, i
);
1634 count
[pack_int_id
]++;
1635 display_progress(progress
, i
+ 1);
1637 stop_progress(&progress
);
1639 if (flags
& MIDX_PROGRESS
)
1640 progress
= start_delayed_progress(_("Finding and deleting unreferenced packfiles"),
1642 for (i
= 0; i
< m
->num_packs
; i
++) {
1644 display_progress(progress
, i
+ 1);
1649 if (prepare_midx_pack(r
, m
, i
))
1652 if (m
->packs
[i
]->pack_keep
)
1655 pack_name
= xstrdup(m
->packs
[i
]->pack_name
);
1656 close_pack(m
->packs
[i
]);
1658 string_list_insert(&packs_to_drop
, m
->pack_names
[i
]);
1659 unlink_pack_path(pack_name
, 0);
1662 stop_progress(&progress
);
1666 if (packs_to_drop
.nr
) {
1667 result
= write_midx_internal(object_dir
, &packs_to_drop
, NULL
, flags
);
1671 string_list_clear(&packs_to_drop
, 0);
1675 struct repack_info
{
1677 uint32_t referenced_objects
;
1678 uint32_t pack_int_id
;
1681 static int compare_by_mtime(const void *a_
, const void *b_
)
1683 const struct repack_info
*a
, *b
;
1685 a
= (const struct repack_info
*)a_
;
1686 b
= (const struct repack_info
*)b_
;
1688 if (a
->mtime
< b
->mtime
)
1690 if (a
->mtime
> b
->mtime
)
1695 static int fill_included_packs_all(struct repository
*r
,
1696 struct multi_pack_index
*m
,
1697 unsigned char *include_pack
)
1699 uint32_t i
, count
= 0;
1700 int pack_kept_objects
= 0;
1702 repo_config_get_bool(r
, "repack.packkeptobjects", &pack_kept_objects
);
1704 for (i
= 0; i
< m
->num_packs
; i
++) {
1705 if (prepare_midx_pack(r
, m
, i
))
1707 if (!pack_kept_objects
&& m
->packs
[i
]->pack_keep
)
1710 include_pack
[i
] = 1;
1717 static int fill_included_packs_batch(struct repository
*r
,
1718 struct multi_pack_index
*m
,
1719 unsigned char *include_pack
,
1722 uint32_t i
, packs_to_repack
;
1724 struct repack_info
*pack_info
= xcalloc(m
->num_packs
, sizeof(struct repack_info
));
1725 int pack_kept_objects
= 0;
1727 repo_config_get_bool(r
, "repack.packkeptobjects", &pack_kept_objects
);
1729 for (i
= 0; i
< m
->num_packs
; i
++) {
1730 pack_info
[i
].pack_int_id
= i
;
1732 if (prepare_midx_pack(r
, m
, i
))
1735 pack_info
[i
].mtime
= m
->packs
[i
]->mtime
;
1738 for (i
= 0; batch_size
&& i
< m
->num_objects
; i
++) {
1739 uint32_t pack_int_id
= nth_midxed_pack_int_id(m
, i
);
1740 pack_info
[pack_int_id
].referenced_objects
++;
1743 QSORT(pack_info
, m
->num_packs
, compare_by_mtime
);
1746 packs_to_repack
= 0;
1747 for (i
= 0; total_size
< batch_size
&& i
< m
->num_packs
; i
++) {
1748 int pack_int_id
= pack_info
[i
].pack_int_id
;
1749 struct packed_git
*p
= m
->packs
[pack_int_id
];
1750 size_t expected_size
;
1754 if (!pack_kept_objects
&& p
->pack_keep
)
1756 if (open_pack_index(p
) || !p
->num_objects
)
1759 expected_size
= (size_t)(p
->pack_size
1760 * pack_info
[i
].referenced_objects
);
1761 expected_size
/= p
->num_objects
;
1763 if (expected_size
>= batch_size
)
1767 total_size
+= expected_size
;
1768 include_pack
[pack_int_id
] = 1;
1773 if (packs_to_repack
< 2)
1779 int midx_repack(struct repository
*r
, const char *object_dir
, size_t batch_size
, unsigned flags
)
1783 unsigned char *include_pack
;
1784 struct child_process cmd
= CHILD_PROCESS_INIT
;
1786 struct strbuf base_name
= STRBUF_INIT
;
1787 struct multi_pack_index
*m
= load_multi_pack_index(object_dir
, 1);
1790 * When updating the default for these configuration
1791 * variables in builtin/repack.c, these must be adjusted
1794 int delta_base_offset
= 1;
1795 int use_delta_islands
= 0;
1800 CALLOC_ARRAY(include_pack
, m
->num_packs
);
1803 if (fill_included_packs_batch(r
, m
, include_pack
, batch_size
))
1805 } else if (fill_included_packs_all(r
, m
, include_pack
))
1808 repo_config_get_bool(r
, "repack.usedeltabaseoffset", &delta_base_offset
);
1809 repo_config_get_bool(r
, "repack.usedeltaislands", &use_delta_islands
);
1811 strvec_push(&cmd
.args
, "pack-objects");
1813 strbuf_addstr(&base_name
, object_dir
);
1814 strbuf_addstr(&base_name
, "/pack/pack");
1815 strvec_push(&cmd
.args
, base_name
.buf
);
1817 if (delta_base_offset
)
1818 strvec_push(&cmd
.args
, "--delta-base-offset");
1819 if (use_delta_islands
)
1820 strvec_push(&cmd
.args
, "--delta-islands");
1822 if (flags
& MIDX_PROGRESS
)
1823 strvec_push(&cmd
.args
, "--progress");
1825 strvec_push(&cmd
.args
, "-q");
1827 strbuf_release(&base_name
);
1830 cmd
.in
= cmd
.out
= -1;
1832 if (start_command(&cmd
)) {
1833 error(_("could not start pack-objects"));
1838 cmd_in
= xfdopen(cmd
.in
, "w");
1840 for (i
= 0; i
< m
->num_objects
; i
++) {
1841 struct object_id oid
;
1842 uint32_t pack_int_id
= nth_midxed_pack_int_id(m
, i
);
1844 if (!include_pack
[pack_int_id
])
1847 nth_midxed_object_oid(&oid
, m
, i
);
1848 fprintf(cmd_in
, "%s\n", oid_to_hex(&oid
));
1852 if (finish_command(&cmd
)) {
1853 error(_("could not finish pack-objects"));
1858 result
= write_midx_internal(object_dir
, NULL
, NULL
, flags
);