7 #include "object-store.h"
8 #include "sha1-lookup.h"
11 #define MIDX_SIGNATURE 0x4d494458 /* "MIDX" */
12 #define MIDX_VERSION 1
13 #define MIDX_BYTE_FILE_VERSION 4
14 #define MIDX_BYTE_HASH_VERSION 5
15 #define MIDX_BYTE_NUM_CHUNKS 6
16 #define MIDX_BYTE_NUM_PACKS 8
17 #define MIDX_HASH_VERSION 1
18 #define MIDX_HEADER_SIZE 12
19 #define MIDX_HASH_LEN 20
20 #define MIDX_MIN_SIZE (MIDX_HEADER_SIZE + MIDX_HASH_LEN)
22 #define MIDX_MAX_CHUNKS 5
23 #define MIDX_CHUNK_ALIGNMENT 4
24 #define MIDX_CHUNKID_PACKNAMES 0x504e414d /* "PNAM" */
25 #define MIDX_CHUNKID_OIDFANOUT 0x4f494446 /* "OIDF" */
26 #define MIDX_CHUNKID_OIDLOOKUP 0x4f49444c /* "OIDL" */
27 #define MIDX_CHUNKID_OBJECTOFFSETS 0x4f4f4646 /* "OOFF" */
28 #define MIDX_CHUNKID_LARGEOFFSETS 0x4c4f4646 /* "LOFF" */
29 #define MIDX_CHUNKLOOKUP_WIDTH (sizeof(uint32_t) + sizeof(uint64_t))
30 #define MIDX_CHUNK_FANOUT_SIZE (sizeof(uint32_t) * 256)
31 #define MIDX_CHUNK_OFFSET_WIDTH (2 * sizeof(uint32_t))
32 #define MIDX_CHUNK_LARGE_OFFSET_WIDTH (sizeof(uint64_t))
33 #define MIDX_LARGE_OFFSET_NEEDED 0x80000000
35 static char *get_midx_filename(const char *object_dir
)
37 return xstrfmt("%s/pack/multi-pack-index", object_dir
);
40 struct multi_pack_index
*load_multi_pack_index(const char *object_dir
, int local
)
42 struct multi_pack_index
*m
= NULL
;
46 void *midx_map
= NULL
;
47 uint32_t hash_version
;
48 char *midx_name
= get_midx_filename(object_dir
);
50 const char *cur_pack_name
;
52 fd
= git_open(midx_name
);
57 error_errno(_("failed to read %s"), midx_name
);
61 midx_size
= xsize_t(st
.st_size
);
63 if (midx_size
< MIDX_MIN_SIZE
) {
64 error(_("multi-pack-index file %s is too small"), midx_name
);
68 FREE_AND_NULL(midx_name
);
70 midx_map
= xmmap(NULL
, midx_size
, PROT_READ
, MAP_PRIVATE
, fd
, 0);
72 FLEX_ALLOC_MEM(m
, object_dir
, object_dir
, strlen(object_dir
));
75 m
->data_len
= midx_size
;
78 m
->signature
= get_be32(m
->data
);
79 if (m
->signature
!= MIDX_SIGNATURE
)
80 die(_("multi-pack-index signature 0x%08x does not match signature 0x%08x"),
81 m
->signature
, MIDX_SIGNATURE
);
83 m
->version
= m
->data
[MIDX_BYTE_FILE_VERSION
];
84 if (m
->version
!= MIDX_VERSION
)
85 die(_("multi-pack-index version %d not recognized"),
88 hash_version
= m
->data
[MIDX_BYTE_HASH_VERSION
];
89 if (hash_version
!= MIDX_HASH_VERSION
)
90 die(_("hash version %u does not match"), hash_version
);
91 m
->hash_len
= MIDX_HASH_LEN
;
93 m
->num_chunks
= m
->data
[MIDX_BYTE_NUM_CHUNKS
];
95 m
->num_packs
= get_be32(m
->data
+ MIDX_BYTE_NUM_PACKS
);
97 for (i
= 0; i
< m
->num_chunks
; i
++) {
98 uint32_t chunk_id
= get_be32(m
->data
+ MIDX_HEADER_SIZE
+
99 MIDX_CHUNKLOOKUP_WIDTH
* i
);
100 uint64_t chunk_offset
= get_be64(m
->data
+ MIDX_HEADER_SIZE
+ 4 +
101 MIDX_CHUNKLOOKUP_WIDTH
* i
);
103 if (chunk_offset
>= m
->data_len
)
104 die(_("invalid chunk offset (too large)"));
107 case MIDX_CHUNKID_PACKNAMES
:
108 m
->chunk_pack_names
= m
->data
+ chunk_offset
;
111 case MIDX_CHUNKID_OIDFANOUT
:
112 m
->chunk_oid_fanout
= (uint32_t *)(m
->data
+ chunk_offset
);
115 case MIDX_CHUNKID_OIDLOOKUP
:
116 m
->chunk_oid_lookup
= m
->data
+ chunk_offset
;
119 case MIDX_CHUNKID_OBJECTOFFSETS
:
120 m
->chunk_object_offsets
= m
->data
+ chunk_offset
;
123 case MIDX_CHUNKID_LARGEOFFSETS
:
124 m
->chunk_large_offsets
= m
->data
+ chunk_offset
;
128 die(_("terminating multi-pack-index chunk id appears earlier than expected"));
133 * Do nothing on unrecognized chunks, allowing future
134 * extensions to add optional chunks.
140 if (!m
->chunk_pack_names
)
141 die(_("multi-pack-index missing required pack-name chunk"));
142 if (!m
->chunk_oid_fanout
)
143 die(_("multi-pack-index missing required OID fanout chunk"));
144 if (!m
->chunk_oid_lookup
)
145 die(_("multi-pack-index missing required OID lookup chunk"));
146 if (!m
->chunk_object_offsets
)
147 die(_("multi-pack-index missing required object offsets chunk"));
149 m
->num_objects
= ntohl(m
->chunk_oid_fanout
[255]);
151 m
->pack_names
= xcalloc(m
->num_packs
, sizeof(*m
->pack_names
));
152 m
->packs
= xcalloc(m
->num_packs
, sizeof(*m
->packs
));
154 cur_pack_name
= (const char *)m
->chunk_pack_names
;
155 for (i
= 0; i
< m
->num_packs
; i
++) {
156 m
->pack_names
[i
] = cur_pack_name
;
158 cur_pack_name
+= strlen(cur_pack_name
) + 1;
160 if (i
&& strcmp(m
->pack_names
[i
], m
->pack_names
[i
- 1]) <= 0)
161 die(_("multi-pack-index pack names out of order: '%s' before '%s'"),
162 m
->pack_names
[i
- 1],
172 munmap(midx_map
, midx_size
);
178 static void close_midx(struct multi_pack_index
*m
)
181 munmap((unsigned char *)m
->data
, m
->data_len
);
185 for (i
= 0; i
< m
->num_packs
; i
++) {
187 close_pack(m
->packs
[i
]);
191 FREE_AND_NULL(m
->packs
);
192 FREE_AND_NULL(m
->pack_names
);
195 int prepare_midx_pack(struct multi_pack_index
*m
, uint32_t pack_int_id
)
197 struct strbuf pack_name
= STRBUF_INIT
;
199 if (pack_int_id
>= m
->num_packs
)
200 BUG("bad pack-int-id");
202 if (m
->packs
[pack_int_id
])
205 strbuf_addf(&pack_name
, "%s/pack/%s", m
->object_dir
,
206 m
->pack_names
[pack_int_id
]);
208 m
->packs
[pack_int_id
] = add_packed_git(pack_name
.buf
, pack_name
.len
, m
->local
);
209 strbuf_release(&pack_name
);
210 return !m
->packs
[pack_int_id
];
213 int bsearch_midx(const struct object_id
*oid
, struct multi_pack_index
*m
, uint32_t *result
)
215 return bsearch_hash(oid
->hash
, m
->chunk_oid_fanout
, m
->chunk_oid_lookup
,
216 MIDX_HASH_LEN
, result
);
219 struct object_id
*nth_midxed_object_oid(struct object_id
*oid
,
220 struct multi_pack_index
*m
,
223 if (n
>= m
->num_objects
)
226 hashcpy(oid
->hash
, m
->chunk_oid_lookup
+ m
->hash_len
* n
);
230 static off_t
nth_midxed_offset(struct multi_pack_index
*m
, uint32_t pos
)
232 const unsigned char *offset_data
;
235 offset_data
= m
->chunk_object_offsets
+ pos
* MIDX_CHUNK_OFFSET_WIDTH
;
236 offset32
= get_be32(offset_data
+ sizeof(uint32_t));
238 if (m
->chunk_large_offsets
&& offset32
& MIDX_LARGE_OFFSET_NEEDED
) {
239 if (sizeof(offset32
) < sizeof(uint64_t))
240 die(_("multi-pack-index stores a 64-bit offset, but off_t is too small"));
242 offset32
^= MIDX_LARGE_OFFSET_NEEDED
;
243 return get_be64(m
->chunk_large_offsets
+ sizeof(uint64_t) * offset32
);
249 static uint32_t nth_midxed_pack_int_id(struct multi_pack_index
*m
, uint32_t pos
)
251 return get_be32(m
->chunk_object_offsets
+ pos
* MIDX_CHUNK_OFFSET_WIDTH
);
254 static int nth_midxed_pack_entry(struct multi_pack_index
*m
, struct pack_entry
*e
, uint32_t pos
)
256 uint32_t pack_int_id
;
257 struct packed_git
*p
;
259 if (pos
>= m
->num_objects
)
262 pack_int_id
= nth_midxed_pack_int_id(m
, pos
);
264 if (prepare_midx_pack(m
, pack_int_id
))
265 die(_("error preparing packfile from multi-pack-index"));
266 p
= m
->packs
[pack_int_id
];
269 * We are about to tell the caller where they can locate the
270 * requested object. We better make sure the packfile is
271 * still here and can be accessed before supplying that
272 * answer, as it may have been deleted since the MIDX was
275 if (!is_pack_valid(p
))
278 if (p
->num_bad_objects
) {
280 struct object_id oid
;
281 nth_midxed_object_oid(&oid
, m
, pos
);
282 for (i
= 0; i
< p
->num_bad_objects
; i
++)
283 if (!hashcmp(oid
.hash
,
284 p
->bad_object_sha1
+ the_hash_algo
->rawsz
* i
))
288 e
->offset
= nth_midxed_offset(m
, pos
);
294 int fill_midx_entry(const struct object_id
*oid
, struct pack_entry
*e
, struct multi_pack_index
*m
)
298 if (!bsearch_midx(oid
, m
, &pos
))
301 return nth_midxed_pack_entry(m
, e
, pos
);
304 int midx_contains_pack(struct multi_pack_index
*m
, const char *idx_name
)
306 uint32_t first
= 0, last
= m
->num_packs
;
308 while (first
< last
) {
309 uint32_t mid
= first
+ (last
- first
) / 2;
313 current
= m
->pack_names
[mid
];
314 cmp
= strcmp(idx_name
, current
);
327 int prepare_multi_pack_index_one(struct repository
*r
, const char *object_dir
, int local
)
329 struct multi_pack_index
*m
;
330 struct multi_pack_index
*m_search
;
333 if (repo_config_get_bool(r
, "core.multipackindex", &config_value
) ||
337 for (m_search
= r
->objects
->multi_pack_index
; m_search
; m_search
= m_search
->next
)
338 if (!strcmp(object_dir
, m_search
->object_dir
))
341 m
= load_multi_pack_index(object_dir
, local
);
344 m
->next
= r
->objects
->multi_pack_index
;
345 r
->objects
->multi_pack_index
= m
;
352 static size_t write_midx_header(struct hashfile
*f
,
353 unsigned char num_chunks
,
356 unsigned char byte_values
[4];
358 hashwrite_be32(f
, MIDX_SIGNATURE
);
359 byte_values
[0] = MIDX_VERSION
;
360 byte_values
[1] = MIDX_HASH_VERSION
;
361 byte_values
[2] = num_chunks
;
362 byte_values
[3] = 0; /* unused */
363 hashwrite(f
, byte_values
, sizeof(byte_values
));
364 hashwrite_be32(f
, num_packs
);
366 return MIDX_HEADER_SIZE
;
370 struct packed_git
**list
;
374 uint32_t alloc_names
;
375 size_t pack_name_concat_len
;
376 struct multi_pack_index
*m
;
379 static void add_pack_to_midx(const char *full_path
, size_t full_path_len
,
380 const char *file_name
, void *data
)
382 struct pack_list
*packs
= (struct pack_list
*)data
;
384 if (ends_with(file_name
, ".idx")) {
385 if (packs
->m
&& midx_contains_pack(packs
->m
, file_name
))
388 ALLOC_GROW(packs
->list
, packs
->nr
+ 1, packs
->alloc_list
);
389 ALLOC_GROW(packs
->names
, packs
->nr
+ 1, packs
->alloc_names
);
391 packs
->list
[packs
->nr
] = add_packed_git(full_path
,
395 if (!packs
->list
[packs
->nr
]) {
396 warning(_("failed to add packfile '%s'"),
401 if (open_pack_index(packs
->list
[packs
->nr
])) {
402 warning(_("failed to open pack-index '%s'"),
404 close_pack(packs
->list
[packs
->nr
]);
405 FREE_AND_NULL(packs
->list
[packs
->nr
]);
409 packs
->names
[packs
->nr
] = xstrdup(file_name
);
410 packs
->pack_name_concat_len
+= strlen(file_name
) + 1;
416 uint32_t pack_int_id
;
420 static int pack_pair_compare(const void *_a
, const void *_b
)
422 struct pack_pair
*a
= (struct pack_pair
*)_a
;
423 struct pack_pair
*b
= (struct pack_pair
*)_b
;
424 return strcmp(a
->pack_name
, b
->pack_name
);
427 static void sort_packs_by_name(char **pack_names
, uint32_t nr_packs
, uint32_t *perm
)
430 struct pack_pair
*pairs
;
432 ALLOC_ARRAY(pairs
, nr_packs
);
434 for (i
= 0; i
< nr_packs
; i
++) {
435 pairs
[i
].pack_int_id
= i
;
436 pairs
[i
].pack_name
= pack_names
[i
];
439 QSORT(pairs
, nr_packs
, pack_pair_compare
);
441 for (i
= 0; i
< nr_packs
; i
++) {
442 pack_names
[i
] = pairs
[i
].pack_name
;
443 perm
[pairs
[i
].pack_int_id
] = i
;
449 struct pack_midx_entry
{
450 struct object_id oid
;
451 uint32_t pack_int_id
;
456 static int midx_oid_compare(const void *_a
, const void *_b
)
458 const struct pack_midx_entry
*a
= (const struct pack_midx_entry
*)_a
;
459 const struct pack_midx_entry
*b
= (const struct pack_midx_entry
*)_b
;
460 int cmp
= oidcmp(&a
->oid
, &b
->oid
);
465 if (a
->pack_mtime
> b
->pack_mtime
)
467 else if (a
->pack_mtime
< b
->pack_mtime
)
470 return a
->pack_int_id
- b
->pack_int_id
;
473 static int nth_midxed_pack_midx_entry(struct multi_pack_index
*m
,
475 struct pack_midx_entry
*e
,
478 if (pos
>= m
->num_objects
)
481 nth_midxed_object_oid(&e
->oid
, m
, pos
);
482 e
->pack_int_id
= pack_perm
[nth_midxed_pack_int_id(m
, pos
)];
483 e
->offset
= nth_midxed_offset(m
, pos
);
485 /* consider objects in midx to be from "old" packs */
490 static void fill_pack_entry(uint32_t pack_int_id
,
491 struct packed_git
*p
,
493 struct pack_midx_entry
*entry
)
495 if (!nth_packed_object_oid(&entry
->oid
, p
, cur_object
))
496 die(_("failed to locate object %d in packfile"), cur_object
);
498 entry
->pack_int_id
= pack_int_id
;
499 entry
->pack_mtime
= p
->mtime
;
501 entry
->offset
= nth_packed_object_offset(p
, cur_object
);
505 * It is possible to artificially get into a state where there are many
506 * duplicate copies of objects. That can create high memory pressure if
507 * we are to create a list of all objects before de-duplication. To reduce
508 * this memory pressure without a significant performance drop, automatically
509 * group objects by the first byte of their object id. Use the IDX fanout
510 * tables to group the data, copy to a local array, then sort.
512 * Copy only the de-duplicated entries (selected by most-recent modified time
513 * of a packfile containing the object).
515 static struct pack_midx_entry
*get_sorted_entries(struct multi_pack_index
*m
,
516 struct packed_git
**p
,
519 uint32_t *nr_objects
)
521 uint32_t cur_fanout
, cur_pack
, cur_object
;
522 uint32_t alloc_fanout
, alloc_objects
, total_objects
= 0;
523 struct pack_midx_entry
*entries_by_fanout
= NULL
;
524 struct pack_midx_entry
*deduplicated_entries
= NULL
;
525 uint32_t start_pack
= m
? m
->num_packs
: 0;
527 for (cur_pack
= start_pack
; cur_pack
< nr_packs
; cur_pack
++)
528 total_objects
+= p
[cur_pack
]->num_objects
;
531 * As we de-duplicate by fanout value, we expect the fanout
532 * slices to be evenly distributed, with some noise. Hence,
533 * allocate slightly more than one 256th.
535 alloc_objects
= alloc_fanout
= total_objects
> 3200 ? total_objects
/ 200 : 16;
537 ALLOC_ARRAY(entries_by_fanout
, alloc_fanout
);
538 ALLOC_ARRAY(deduplicated_entries
, alloc_objects
);
541 for (cur_fanout
= 0; cur_fanout
< 256; cur_fanout
++) {
542 uint32_t nr_fanout
= 0;
545 uint32_t start
= 0, end
;
548 start
= ntohl(m
->chunk_oid_fanout
[cur_fanout
- 1]);
549 end
= ntohl(m
->chunk_oid_fanout
[cur_fanout
]);
551 for (cur_object
= start
; cur_object
< end
; cur_object
++) {
552 ALLOC_GROW(entries_by_fanout
, nr_fanout
+ 1, alloc_fanout
);
553 nth_midxed_pack_midx_entry(m
, perm
,
554 &entries_by_fanout
[nr_fanout
],
560 for (cur_pack
= start_pack
; cur_pack
< nr_packs
; cur_pack
++) {
561 uint32_t start
= 0, end
;
564 start
= get_pack_fanout(p
[cur_pack
], cur_fanout
- 1);
565 end
= get_pack_fanout(p
[cur_pack
], cur_fanout
);
567 for (cur_object
= start
; cur_object
< end
; cur_object
++) {
568 ALLOC_GROW(entries_by_fanout
, nr_fanout
+ 1, alloc_fanout
);
569 fill_pack_entry(perm
[cur_pack
], p
[cur_pack
], cur_object
, &entries_by_fanout
[nr_fanout
]);
574 QSORT(entries_by_fanout
, nr_fanout
, midx_oid_compare
);
577 * The batch is now sorted by OID and then mtime (descending).
578 * Take only the first duplicate.
580 for (cur_object
= 0; cur_object
< nr_fanout
; cur_object
++) {
581 if (cur_object
&& !oidcmp(&entries_by_fanout
[cur_object
- 1].oid
,
582 &entries_by_fanout
[cur_object
].oid
))
585 ALLOC_GROW(deduplicated_entries
, *nr_objects
+ 1, alloc_objects
);
586 memcpy(&deduplicated_entries
[*nr_objects
],
587 &entries_by_fanout
[cur_object
],
588 sizeof(struct pack_midx_entry
));
593 free(entries_by_fanout
);
594 return deduplicated_entries
;
597 static size_t write_midx_pack_names(struct hashfile
*f
,
602 unsigned char padding
[MIDX_CHUNK_ALIGNMENT
];
605 for (i
= 0; i
< num_packs
; i
++) {
606 size_t writelen
= strlen(pack_names
[i
]) + 1;
608 if (i
&& strcmp(pack_names
[i
], pack_names
[i
- 1]) <= 0)
609 BUG("incorrect pack-file order: %s before %s",
613 hashwrite(f
, pack_names
[i
], writelen
);
617 /* add padding to be aligned */
618 i
= MIDX_CHUNK_ALIGNMENT
- (written
% MIDX_CHUNK_ALIGNMENT
);
619 if (i
< MIDX_CHUNK_ALIGNMENT
) {
620 memset(padding
, 0, sizeof(padding
));
621 hashwrite(f
, padding
, i
);
628 static size_t write_midx_oid_fanout(struct hashfile
*f
,
629 struct pack_midx_entry
*objects
,
632 struct pack_midx_entry
*list
= objects
;
633 struct pack_midx_entry
*last
= objects
+ nr_objects
;
638 * Write the first-level table (the list is sorted,
639 * but we use a 256-entry lookup to be able to avoid
640 * having to do eight extra binary search iterations).
642 for (i
= 0; i
< 256; i
++) {
643 struct pack_midx_entry
*next
= list
;
645 while (next
< last
&& next
->oid
.hash
[0] == i
) {
650 hashwrite_be32(f
, count
);
654 return MIDX_CHUNK_FANOUT_SIZE
;
657 static size_t write_midx_oid_lookup(struct hashfile
*f
, unsigned char hash_len
,
658 struct pack_midx_entry
*objects
,
661 struct pack_midx_entry
*list
= objects
;
665 for (i
= 0; i
< nr_objects
; i
++) {
666 struct pack_midx_entry
*obj
= list
++;
668 if (i
< nr_objects
- 1) {
669 struct pack_midx_entry
*next
= list
;
670 if (oidcmp(&obj
->oid
, &next
->oid
) >= 0)
671 BUG("OIDs not in order: %s >= %s",
672 oid_to_hex(&obj
->oid
),
673 oid_to_hex(&next
->oid
));
676 hashwrite(f
, obj
->oid
.hash
, (int)hash_len
);
683 static size_t write_midx_object_offsets(struct hashfile
*f
, int large_offset_needed
,
684 struct pack_midx_entry
*objects
, uint32_t nr_objects
)
686 struct pack_midx_entry
*list
= objects
;
687 uint32_t i
, nr_large_offset
= 0;
690 for (i
= 0; i
< nr_objects
; i
++) {
691 struct pack_midx_entry
*obj
= list
++;
693 hashwrite_be32(f
, obj
->pack_int_id
);
695 if (large_offset_needed
&& obj
->offset
>> 31)
696 hashwrite_be32(f
, MIDX_LARGE_OFFSET_NEEDED
| nr_large_offset
++);
697 else if (!large_offset_needed
&& obj
->offset
>> 32)
698 BUG("object %s requires a large offset (%"PRIx64
") but the MIDX is not writing large offsets!",
699 oid_to_hex(&obj
->oid
),
702 hashwrite_be32(f
, (uint32_t)obj
->offset
);
704 written
+= MIDX_CHUNK_OFFSET_WIDTH
;
710 static size_t write_midx_large_offsets(struct hashfile
*f
, uint32_t nr_large_offset
,
711 struct pack_midx_entry
*objects
, uint32_t nr_objects
)
713 struct pack_midx_entry
*list
= objects
;
716 while (nr_large_offset
) {
717 struct pack_midx_entry
*obj
= list
++;
718 uint64_t offset
= obj
->offset
;
723 hashwrite_be32(f
, offset
>> 32);
724 hashwrite_be32(f
, offset
& 0xffffffffUL
);
725 written
+= 2 * sizeof(uint32_t);
733 int write_midx_file(const char *object_dir
)
735 unsigned char cur_chunk
, num_chunks
= 0;
738 struct hashfile
*f
= NULL
;
740 struct pack_list packs
;
741 uint32_t *pack_perm
= NULL
;
742 uint64_t written
= 0;
743 uint32_t chunk_ids
[MIDX_MAX_CHUNKS
+ 1];
744 uint64_t chunk_offsets
[MIDX_MAX_CHUNKS
+ 1];
745 uint32_t nr_entries
, num_large_offsets
= 0;
746 struct pack_midx_entry
*entries
= NULL
;
747 int large_offsets_needed
= 0;
749 midx_name
= get_midx_filename(object_dir
);
750 if (safe_create_leading_directories(midx_name
)) {
752 die_errno(_("unable to create leading directories of %s"),
756 packs
.m
= load_multi_pack_index(object_dir
, 1);
759 packs
.alloc_list
= packs
.m
? packs
.m
->num_packs
: 16;
760 packs
.alloc_names
= packs
.alloc_list
;
763 packs
.pack_name_concat_len
= 0;
764 ALLOC_ARRAY(packs
.list
, packs
.alloc_list
);
765 ALLOC_ARRAY(packs
.names
, packs
.alloc_names
);
768 for (i
= 0; i
< packs
.m
->num_packs
; i
++) {
769 ALLOC_GROW(packs
.list
, packs
.nr
+ 1, packs
.alloc_list
);
770 ALLOC_GROW(packs
.names
, packs
.nr
+ 1, packs
.alloc_names
);
772 packs
.list
[packs
.nr
] = NULL
;
773 packs
.names
[packs
.nr
] = xstrdup(packs
.m
->pack_names
[i
]);
774 packs
.pack_name_concat_len
+= strlen(packs
.names
[packs
.nr
]) + 1;
779 for_each_file_in_pack_dir(object_dir
, add_pack_to_midx
, &packs
);
781 if (packs
.m
&& packs
.nr
== packs
.m
->num_packs
)
784 if (packs
.pack_name_concat_len
% MIDX_CHUNK_ALIGNMENT
)
785 packs
.pack_name_concat_len
+= MIDX_CHUNK_ALIGNMENT
-
786 (packs
.pack_name_concat_len
% MIDX_CHUNK_ALIGNMENT
);
788 ALLOC_ARRAY(pack_perm
, packs
.nr
);
789 sort_packs_by_name(packs
.names
, packs
.nr
, pack_perm
);
791 entries
= get_sorted_entries(packs
.m
, packs
.list
, pack_perm
, packs
.nr
, &nr_entries
);
793 for (i
= 0; i
< nr_entries
; i
++) {
794 if (entries
[i
].offset
> 0x7fffffff)
796 if (entries
[i
].offset
> 0xffffffff)
797 large_offsets_needed
= 1;
800 hold_lock_file_for_update(&lk
, midx_name
, LOCK_DIE_ON_ERROR
);
801 f
= hashfd(lk
.tempfile
->fd
, lk
.tempfile
->filename
.buf
);
802 FREE_AND_NULL(midx_name
);
808 num_chunks
= large_offsets_needed
? 5 : 4;
810 written
= write_midx_header(f
, num_chunks
, packs
.nr
);
812 chunk_ids
[cur_chunk
] = MIDX_CHUNKID_PACKNAMES
;
813 chunk_offsets
[cur_chunk
] = written
+ (num_chunks
+ 1) * MIDX_CHUNKLOOKUP_WIDTH
;
816 chunk_ids
[cur_chunk
] = MIDX_CHUNKID_OIDFANOUT
;
817 chunk_offsets
[cur_chunk
] = chunk_offsets
[cur_chunk
- 1] + packs
.pack_name_concat_len
;
820 chunk_ids
[cur_chunk
] = MIDX_CHUNKID_OIDLOOKUP
;
821 chunk_offsets
[cur_chunk
] = chunk_offsets
[cur_chunk
- 1] + MIDX_CHUNK_FANOUT_SIZE
;
824 chunk_ids
[cur_chunk
] = MIDX_CHUNKID_OBJECTOFFSETS
;
825 chunk_offsets
[cur_chunk
] = chunk_offsets
[cur_chunk
- 1] + nr_entries
* MIDX_HASH_LEN
;
828 chunk_offsets
[cur_chunk
] = chunk_offsets
[cur_chunk
- 1] + nr_entries
* MIDX_CHUNK_OFFSET_WIDTH
;
829 if (large_offsets_needed
) {
830 chunk_ids
[cur_chunk
] = MIDX_CHUNKID_LARGEOFFSETS
;
833 chunk_offsets
[cur_chunk
] = chunk_offsets
[cur_chunk
- 1] +
834 num_large_offsets
* MIDX_CHUNK_LARGE_OFFSET_WIDTH
;
837 chunk_ids
[cur_chunk
] = 0;
839 for (i
= 0; i
<= num_chunks
; i
++) {
840 if (i
&& chunk_offsets
[i
] < chunk_offsets
[i
- 1])
841 BUG("incorrect chunk offsets: %"PRIu64
" before %"PRIu64
,
842 chunk_offsets
[i
- 1],
845 if (chunk_offsets
[i
] % MIDX_CHUNK_ALIGNMENT
)
846 BUG("chunk offset %"PRIu64
" is not properly aligned",
849 hashwrite_be32(f
, chunk_ids
[i
]);
850 hashwrite_be32(f
, chunk_offsets
[i
] >> 32);
851 hashwrite_be32(f
, chunk_offsets
[i
]);
853 written
+= MIDX_CHUNKLOOKUP_WIDTH
;
856 for (i
= 0; i
< num_chunks
; i
++) {
857 if (written
!= chunk_offsets
[i
])
858 BUG("incorrect chunk offset (%"PRIu64
" != %"PRIu64
") for chunk id %"PRIx32
,
863 switch (chunk_ids
[i
]) {
864 case MIDX_CHUNKID_PACKNAMES
:
865 written
+= write_midx_pack_names(f
, packs
.names
, packs
.nr
);
868 case MIDX_CHUNKID_OIDFANOUT
:
869 written
+= write_midx_oid_fanout(f
, entries
, nr_entries
);
872 case MIDX_CHUNKID_OIDLOOKUP
:
873 written
+= write_midx_oid_lookup(f
, MIDX_HASH_LEN
, entries
, nr_entries
);
876 case MIDX_CHUNKID_OBJECTOFFSETS
:
877 written
+= write_midx_object_offsets(f
, large_offsets_needed
, entries
, nr_entries
);
880 case MIDX_CHUNKID_LARGEOFFSETS
:
881 written
+= write_midx_large_offsets(f
, num_large_offsets
, entries
, nr_entries
);
885 BUG("trying to write unknown chunk id %"PRIx32
,
890 if (written
!= chunk_offsets
[num_chunks
])
891 BUG("incorrect final offset %"PRIu64
" != %"PRIu64
,
893 chunk_offsets
[num_chunks
]);
895 finalize_hashfile(f
, NULL
, CSUM_FSYNC
| CSUM_HASH_IN_STREAM
);
896 commit_lock_file(&lk
);
899 for (i
= 0; i
< packs
.nr
; i
++) {
901 close_pack(packs
.list
[i
]);
904 free(packs
.names
[i
]);
915 void clear_midx_file(const char *object_dir
)
917 char *midx
= get_midx_filename(object_dir
);
919 if (remove_path(midx
)) {
921 die(_("failed to clear multi-pack-index at %s"), midx
);
927 static int verify_midx_error
;
929 int verify_midx_file(const char *object_dir
)
931 struct multi_pack_index
*m
= load_multi_pack_index(object_dir
, 1);
932 verify_midx_error
= 0;
937 return verify_midx_error
;