]>
Commit | Line | Data |
---|---|---|
a3407730 | 1 | #include "cache.h" |
c4d25228 | 2 | #include "config.h" |
fc59e748 | 3 | #include "csum-file.h" |
396f2570 | 4 | #include "dir.h" |
fc59e748 | 5 | #include "lockfile.h" |
396f2570 | 6 | #include "packfile.h" |
4d80560c | 7 | #include "object-store.h" |
3715a633 | 8 | #include "sha1-lookup.h" |
a3407730 | 9 | #include "midx.h" |
144d7033 | 10 | #include "progress.h" |
d829223a | 11 | #include "trace2.h" |
ce1e4a10 | 12 | #include "run-command.h" |
18e449f8 | 13 | #include "repository.h" |
a3407730 | 14 | |
fc59e748 DS |
15 | #define MIDX_SIGNATURE 0x4d494458 /* "MIDX" */ |
16 | #define MIDX_VERSION 1 | |
4d80560c DS |
17 | #define MIDX_BYTE_FILE_VERSION 4 |
18 | #define MIDX_BYTE_HASH_VERSION 5 | |
19 | #define MIDX_BYTE_NUM_CHUNKS 6 | |
20 | #define MIDX_BYTE_NUM_PACKS 8 | |
fc59e748 | 21 | #define MIDX_HEADER_SIZE 12 |
aaa95dfa | 22 | #define MIDX_MIN_SIZE (MIDX_HEADER_SIZE + the_hash_algo->rawsz) |
fc59e748 | 23 | |
662148c4 | 24 | #define MIDX_MAX_CHUNKS 5 |
32f3c541 DS |
25 | #define MIDX_CHUNK_ALIGNMENT 4 |
26 | #define MIDX_CHUNKID_PACKNAMES 0x504e414d /* "PNAM" */ | |
d7cacf29 | 27 | #define MIDX_CHUNKID_OIDFANOUT 0x4f494446 /* "OIDF" */ |
0d5b3a5e | 28 | #define MIDX_CHUNKID_OIDLOOKUP 0x4f49444c /* "OIDL" */ |
662148c4 DS |
29 | #define MIDX_CHUNKID_OBJECTOFFSETS 0x4f4f4646 /* "OOFF" */ |
30 | #define MIDX_CHUNKID_LARGEOFFSETS 0x4c4f4646 /* "LOFF" */ | |
32f3c541 | 31 | #define MIDX_CHUNKLOOKUP_WIDTH (sizeof(uint32_t) + sizeof(uint64_t)) |
d7cacf29 | 32 | #define MIDX_CHUNK_FANOUT_SIZE (sizeof(uint32_t) * 256) |
662148c4 DS |
33 | #define MIDX_CHUNK_OFFSET_WIDTH (2 * sizeof(uint32_t)) |
34 | #define MIDX_CHUNK_LARGE_OFFSET_WIDTH (sizeof(uint64_t)) | |
35 | #define MIDX_LARGE_OFFSET_NEEDED 0x80000000 | |
32f3c541 | 36 | |
19575c7c DS |
37 | #define PACK_EXPIRED UINT_MAX |
38 | ||
d9607542 DS |
39 | static uint8_t oid_version(void) |
40 | { | |
41 | switch (hash_algo_by_ptr(the_hash_algo)) { | |
42 | case GIT_HASH_SHA1: | |
43 | return 1; | |
44 | case GIT_HASH_SHA256: | |
45 | return 2; | |
46 | default: | |
47 | die(_("invalid hash version")); | |
48 | } | |
49 | } | |
50 | ||
fc59e748 DS |
51 | static char *get_midx_filename(const char *object_dir) |
52 | { | |
53 | return xstrfmt("%s/pack/multi-pack-index", object_dir); | |
54 | } | |
55 | ||
2cf489a3 | 56 | struct multi_pack_index *load_multi_pack_index(const char *object_dir, int local) |
4d80560c DS |
57 | { |
58 | struct multi_pack_index *m = NULL; | |
59 | int fd; | |
60 | struct stat st; | |
61 | size_t midx_size; | |
62 | void *midx_map = NULL; | |
63 | uint32_t hash_version; | |
64 | char *midx_name = get_midx_filename(object_dir); | |
32f3c541 | 65 | uint32_t i; |
3227565c | 66 | const char *cur_pack_name; |
4d80560c DS |
67 | |
68 | fd = git_open(midx_name); | |
69 | ||
70 | if (fd < 0) | |
71 | goto cleanup_fail; | |
72 | if (fstat(fd, &st)) { | |
73 | error_errno(_("failed to read %s"), midx_name); | |
74 | goto cleanup_fail; | |
75 | } | |
76 | ||
77 | midx_size = xsize_t(st.st_size); | |
78 | ||
79 | if (midx_size < MIDX_MIN_SIZE) { | |
80 | error(_("multi-pack-index file %s is too small"), midx_name); | |
81 | goto cleanup_fail; | |
82 | } | |
83 | ||
84 | FREE_AND_NULL(midx_name); | |
85 | ||
86 | midx_map = xmmap(NULL, midx_size, PROT_READ, MAP_PRIVATE, fd, 0); | |
6c7ff7cf | 87 | close(fd); |
4d80560c | 88 | |
577314ca | 89 | FLEX_ALLOC_STR(m, object_dir, object_dir); |
4d80560c DS |
90 | m->data = midx_map; |
91 | m->data_len = midx_size; | |
2cf489a3 | 92 | m->local = local; |
4d80560c DS |
93 | |
94 | m->signature = get_be32(m->data); | |
53ad0407 DS |
95 | if (m->signature != MIDX_SIGNATURE) |
96 | die(_("multi-pack-index signature 0x%08x does not match signature 0x%08x"), | |
4d80560c | 97 | m->signature, MIDX_SIGNATURE); |
4d80560c DS |
98 | |
99 | m->version = m->data[MIDX_BYTE_FILE_VERSION]; | |
53ad0407 DS |
100 | if (m->version != MIDX_VERSION) |
101 | die(_("multi-pack-index version %d not recognized"), | |
4d80560c | 102 | m->version); |
4d80560c DS |
103 | |
104 | hash_version = m->data[MIDX_BYTE_HASH_VERSION]; | |
d9607542 DS |
105 | if (hash_version != oid_version()) { |
106 | error(_("multi-pack-index hash version %u does not match version %u"), | |
107 | hash_version, oid_version()); | |
108 | goto cleanup_fail; | |
109 | } | |
aaa95dfa | 110 | m->hash_len = the_hash_algo->rawsz; |
4d80560c DS |
111 | |
112 | m->num_chunks = m->data[MIDX_BYTE_NUM_CHUNKS]; | |
113 | ||
114 | m->num_packs = get_be32(m->data + MIDX_BYTE_NUM_PACKS); | |
115 | ||
32f3c541 DS |
116 | for (i = 0; i < m->num_chunks; i++) { |
117 | uint32_t chunk_id = get_be32(m->data + MIDX_HEADER_SIZE + | |
118 | MIDX_CHUNKLOOKUP_WIDTH * i); | |
119 | uint64_t chunk_offset = get_be64(m->data + MIDX_HEADER_SIZE + 4 + | |
120 | MIDX_CHUNKLOOKUP_WIDTH * i); | |
121 | ||
d3f8e211 DS |
122 | if (chunk_offset >= m->data_len) |
123 | die(_("invalid chunk offset (too large)")); | |
124 | ||
32f3c541 DS |
125 | switch (chunk_id) { |
126 | case MIDX_CHUNKID_PACKNAMES: | |
127 | m->chunk_pack_names = m->data + chunk_offset; | |
128 | break; | |
129 | ||
d7cacf29 DS |
130 | case MIDX_CHUNKID_OIDFANOUT: |
131 | m->chunk_oid_fanout = (uint32_t *)(m->data + chunk_offset); | |
132 | break; | |
133 | ||
0d5b3a5e DS |
134 | case MIDX_CHUNKID_OIDLOOKUP: |
135 | m->chunk_oid_lookup = m->data + chunk_offset; | |
136 | break; | |
137 | ||
662148c4 DS |
138 | case MIDX_CHUNKID_OBJECTOFFSETS: |
139 | m->chunk_object_offsets = m->data + chunk_offset; | |
140 | break; | |
141 | ||
142 | case MIDX_CHUNKID_LARGEOFFSETS: | |
143 | m->chunk_large_offsets = m->data + chunk_offset; | |
144 | break; | |
145 | ||
32f3c541 DS |
146 | case 0: |
147 | die(_("terminating multi-pack-index chunk id appears earlier than expected")); | |
148 | break; | |
149 | ||
150 | default: | |
151 | /* | |
152 | * Do nothing on unrecognized chunks, allowing future | |
153 | * extensions to add optional chunks. | |
154 | */ | |
155 | break; | |
156 | } | |
157 | } | |
158 | ||
159 | if (!m->chunk_pack_names) | |
160 | die(_("multi-pack-index missing required pack-name chunk")); | |
d7cacf29 DS |
161 | if (!m->chunk_oid_fanout) |
162 | die(_("multi-pack-index missing required OID fanout chunk")); | |
0d5b3a5e DS |
163 | if (!m->chunk_oid_lookup) |
164 | die(_("multi-pack-index missing required OID lookup chunk")); | |
662148c4 DS |
165 | if (!m->chunk_object_offsets) |
166 | die(_("multi-pack-index missing required object offsets chunk")); | |
32f3c541 | 167 | |
d7cacf29 DS |
168 | m->num_objects = ntohl(m->chunk_oid_fanout[255]); |
169 | ||
3227565c | 170 | m->pack_names = xcalloc(m->num_packs, sizeof(*m->pack_names)); |
3715a633 | 171 | m->packs = xcalloc(m->num_packs, sizeof(*m->packs)); |
3227565c DS |
172 | |
173 | cur_pack_name = (const char *)m->chunk_pack_names; | |
174 | for (i = 0; i < m->num_packs; i++) { | |
175 | m->pack_names[i] = cur_pack_name; | |
176 | ||
177 | cur_pack_name += strlen(cur_pack_name) + 1; | |
178 | ||
8e72a3c3 DS |
179 | if (i && strcmp(m->pack_names[i], m->pack_names[i - 1]) <= 0) |
180 | die(_("multi-pack-index pack names out of order: '%s' before '%s'"), | |
3227565c DS |
181 | m->pack_names[i - 1], |
182 | m->pack_names[i]); | |
3227565c DS |
183 | } |
184 | ||
d829223a JH |
185 | trace2_data_intmax("midx", the_repository, "load/num_packs", m->num_packs); |
186 | trace2_data_intmax("midx", the_repository, "load/num_objects", m->num_objects); | |
187 | ||
4d80560c DS |
188 | return m; |
189 | ||
190 | cleanup_fail: | |
191 | free(m); | |
192 | free(midx_name); | |
193 | if (midx_map) | |
194 | munmap(midx_map, midx_size); | |
195 | if (0 <= fd) | |
196 | close(fd); | |
197 | return NULL; | |
198 | } | |
199 | ||
1dcd9f20 | 200 | void close_midx(struct multi_pack_index *m) |
a40498a1 DS |
201 | { |
202 | uint32_t i; | |
1dcd9f20 DS |
203 | |
204 | if (!m) | |
205 | return; | |
206 | ||
a40498a1 | 207 | munmap((unsigned char *)m->data, m->data_len); |
a40498a1 DS |
208 | |
209 | for (i = 0; i < m->num_packs; i++) { | |
af96fe33 DS |
210 | if (m->packs[i]) |
211 | m->packs[i]->multi_pack_index = 0; | |
a40498a1 DS |
212 | } |
213 | FREE_AND_NULL(m->packs); | |
214 | FREE_AND_NULL(m->pack_names); | |
215 | } | |
216 | ||
64404a24 | 217 | int prepare_midx_pack(struct repository *r, struct multi_pack_index *m, uint32_t pack_int_id) |
3715a633 DS |
218 | { |
219 | struct strbuf pack_name = STRBUF_INIT; | |
af96fe33 | 220 | struct packed_git *p; |
3715a633 DS |
221 | |
222 | if (pack_int_id >= m->num_packs) | |
d355e46a | 223 | die(_("bad pack-int-id: %u (%u total packs)"), |
cc6af73c | 224 | pack_int_id, m->num_packs); |
3715a633 DS |
225 | |
226 | if (m->packs[pack_int_id]) | |
227 | return 0; | |
228 | ||
229 | strbuf_addf(&pack_name, "%s/pack/%s", m->object_dir, | |
230 | m->pack_names[pack_int_id]); | |
231 | ||
af96fe33 | 232 | p = add_packed_git(pack_name.buf, pack_name.len, m->local); |
3715a633 | 233 | strbuf_release(&pack_name); |
af96fe33 DS |
234 | |
235 | if (!p) | |
236 | return 1; | |
237 | ||
238 | p->multi_pack_index = 1; | |
239 | m->packs[pack_int_id] = p; | |
240 | install_packed_git(r, p); | |
241 | list_add_tail(&p->mru, &r->objects->packed_git_mru); | |
242 | ||
243 | return 0; | |
3715a633 DS |
244 | } |
245 | ||
246 | int bsearch_midx(const struct object_id *oid, struct multi_pack_index *m, uint32_t *result) | |
247 | { | |
248 | return bsearch_hash(oid->hash, m->chunk_oid_fanout, m->chunk_oid_lookup, | |
aaa95dfa | 249 | the_hash_algo->rawsz, result); |
3715a633 DS |
250 | } |
251 | ||
8aac67a1 DS |
252 | struct object_id *nth_midxed_object_oid(struct object_id *oid, |
253 | struct multi_pack_index *m, | |
254 | uint32_t n) | |
255 | { | |
256 | if (n >= m->num_objects) | |
257 | return NULL; | |
258 | ||
259 | hashcpy(oid->hash, m->chunk_oid_lookup + m->hash_len * n); | |
260 | return oid; | |
261 | } | |
262 | ||
3715a633 DS |
263 | static off_t nth_midxed_offset(struct multi_pack_index *m, uint32_t pos) |
264 | { | |
265 | const unsigned char *offset_data; | |
266 | uint32_t offset32; | |
267 | ||
268 | offset_data = m->chunk_object_offsets + pos * MIDX_CHUNK_OFFSET_WIDTH; | |
269 | offset32 = get_be32(offset_data + sizeof(uint32_t)); | |
270 | ||
271 | if (m->chunk_large_offsets && offset32 & MIDX_LARGE_OFFSET_NEEDED) { | |
d8ac9ee1 | 272 | if (sizeof(off_t) < sizeof(uint64_t)) |
3715a633 DS |
273 | die(_("multi-pack-index stores a 64-bit offset, but off_t is too small")); |
274 | ||
275 | offset32 ^= MIDX_LARGE_OFFSET_NEEDED; | |
276 | return get_be64(m->chunk_large_offsets + sizeof(uint64_t) * offset32); | |
277 | } | |
278 | ||
279 | return offset32; | |
280 | } | |
281 | ||
282 | static uint32_t nth_midxed_pack_int_id(struct multi_pack_index *m, uint32_t pos) | |
283 | { | |
284 | return get_be32(m->chunk_object_offsets + pos * MIDX_CHUNK_OFFSET_WIDTH); | |
285 | } | |
286 | ||
64404a24 DS |
287 | static int nth_midxed_pack_entry(struct repository *r, |
288 | struct multi_pack_index *m, | |
289 | struct pack_entry *e, | |
290 | uint32_t pos) | |
3715a633 DS |
291 | { |
292 | uint32_t pack_int_id; | |
293 | struct packed_git *p; | |
294 | ||
295 | if (pos >= m->num_objects) | |
296 | return 0; | |
297 | ||
298 | pack_int_id = nth_midxed_pack_int_id(m, pos); | |
299 | ||
64404a24 | 300 | if (prepare_midx_pack(r, m, pack_int_id)) |
506ec2fb | 301 | return 0; |
3715a633 DS |
302 | p = m->packs[pack_int_id]; |
303 | ||
304 | /* | |
305 | * We are about to tell the caller where they can locate the | |
306 | * requested object. We better make sure the packfile is | |
307 | * still here and can be accessed before supplying that | |
308 | * answer, as it may have been deleted since the MIDX was | |
309 | * loaded! | |
310 | */ | |
311 | if (!is_pack_valid(p)) | |
312 | return 0; | |
313 | ||
c39b02ae DS |
314 | if (p->num_bad_objects) { |
315 | uint32_t i; | |
316 | struct object_id oid; | |
317 | nth_midxed_object_oid(&oid, m, pos); | |
318 | for (i = 0; i < p->num_bad_objects; i++) | |
e43d2dcc JK |
319 | if (hasheq(oid.hash, |
320 | p->bad_object_sha1 + the_hash_algo->rawsz * i)) | |
c39b02ae DS |
321 | return 0; |
322 | } | |
323 | ||
3715a633 DS |
324 | e->offset = nth_midxed_offset(m, pos); |
325 | e->p = p; | |
326 | ||
327 | return 1; | |
328 | } | |
329 | ||
64404a24 DS |
330 | int fill_midx_entry(struct repository * r, |
331 | const struct object_id *oid, | |
332 | struct pack_entry *e, | |
333 | struct multi_pack_index *m) | |
3715a633 DS |
334 | { |
335 | uint32_t pos; | |
336 | ||
337 | if (!bsearch_midx(oid, m, &pos)) | |
338 | return 0; | |
339 | ||
64404a24 | 340 | return nth_midxed_pack_entry(r, m, e, pos); |
3715a633 DS |
341 | } |
342 | ||
013fd7ad JK |
343 | /* Match "foo.idx" against either "foo.pack" _or_ "foo.idx". */ |
344 | static int cmp_idx_or_pack_name(const char *idx_or_pack_name, | |
345 | const char *idx_name) | |
346 | { | |
347 | /* Skip past any initial matching prefix. */ | |
348 | while (*idx_name && *idx_name == *idx_or_pack_name) { | |
349 | idx_name++; | |
350 | idx_or_pack_name++; | |
351 | } | |
352 | ||
353 | /* | |
354 | * If we didn't match completely, we may have matched "pack-1234." and | |
355 | * be left with "idx" and "pack" respectively, which is also OK. We do | |
356 | * not have to check for "idx" and "idx", because that would have been | |
357 | * a complete match (and in that case these strcmps will be false, but | |
358 | * we'll correctly return 0 from the final strcmp() below. | |
359 | * | |
360 | * Technically this matches "fooidx" and "foopack", but we'd never have | |
361 | * such names in the first place. | |
362 | */ | |
363 | if (!strcmp(idx_name, "idx") && !strcmp(idx_or_pack_name, "pack")) | |
364 | return 0; | |
365 | ||
366 | /* | |
367 | * This not only checks for a complete match, but also orders based on | |
368 | * the first non-identical character, which means our ordering will | |
369 | * match a raw strcmp(). That makes it OK to use this to binary search | |
370 | * a naively-sorted list. | |
371 | */ | |
372 | return strcmp(idx_or_pack_name, idx_name); | |
373 | } | |
374 | ||
375 | int midx_contains_pack(struct multi_pack_index *m, const char *idx_or_pack_name) | |
a40498a1 DS |
376 | { |
377 | uint32_t first = 0, last = m->num_packs; | |
378 | ||
379 | while (first < last) { | |
380 | uint32_t mid = first + (last - first) / 2; | |
381 | const char *current; | |
382 | int cmp; | |
383 | ||
384 | current = m->pack_names[mid]; | |
013fd7ad | 385 | cmp = cmp_idx_or_pack_name(idx_or_pack_name, current); |
a40498a1 DS |
386 | if (!cmp) |
387 | return 1; | |
388 | if (cmp > 0) { | |
389 | first = mid + 1; | |
390 | continue; | |
391 | } | |
392 | last = mid; | |
393 | } | |
394 | ||
395 | return 0; | |
396 | } | |
397 | ||
2cf489a3 | 398 | int prepare_multi_pack_index_one(struct repository *r, const char *object_dir, int local) |
c4d25228 | 399 | { |
29e2016b | 400 | struct multi_pack_index *m; |
c4d25228 | 401 | struct multi_pack_index *m_search; |
c4d25228 | 402 | |
18e449f8 DS |
403 | prepare_repo_settings(r); |
404 | if (!r->settings.core_multi_pack_index) | |
c4d25228 DS |
405 | return 0; |
406 | ||
29e2016b | 407 | for (m_search = r->objects->multi_pack_index; m_search; m_search = m_search->next) |
c4d25228 DS |
408 | if (!strcmp(object_dir, m_search->object_dir)) |
409 | return 1; | |
410 | ||
29e2016b | 411 | m = load_multi_pack_index(object_dir, local); |
c4d25228 | 412 | |
29e2016b | 413 | if (m) { |
59552fb3 TB |
414 | struct multi_pack_index *mp = r->objects->multi_pack_index; |
415 | if (mp) { | |
416 | m->next = mp->next; | |
417 | mp->next = m; | |
418 | } else | |
419 | r->objects->multi_pack_index = m; | |
c4d25228 DS |
420 | return 1; |
421 | } | |
422 | ||
423 | return 0; | |
424 | } | |
425 | ||
fc59e748 DS |
426 | static size_t write_midx_header(struct hashfile *f, |
427 | unsigned char num_chunks, | |
428 | uint32_t num_packs) | |
429 | { | |
fc59e748 | 430 | hashwrite_be32(f, MIDX_SIGNATURE); |
014f1447 RS |
431 | hashwrite_u8(f, MIDX_VERSION); |
432 | hashwrite_u8(f, oid_version()); | |
433 | hashwrite_u8(f, num_chunks); | |
434 | hashwrite_u8(f, 0); /* unused */ | |
fc59e748 DS |
435 | hashwrite_be32(f, num_packs); |
436 | ||
437 | return MIDX_HEADER_SIZE; | |
438 | } | |
439 | ||
d01bf2e6 DS |
440 | struct pack_info { |
441 | uint32_t orig_pack_int_id; | |
442 | char *pack_name; | |
443 | struct packed_git *p; | |
19575c7c | 444 | unsigned expired : 1; |
d01bf2e6 DS |
445 | }; |
446 | ||
447 | static int pack_info_compare(const void *_a, const void *_b) | |
448 | { | |
449 | struct pack_info *a = (struct pack_info *)_a; | |
450 | struct pack_info *b = (struct pack_info *)_b; | |
451 | return strcmp(a->pack_name, b->pack_name); | |
452 | } | |
453 | ||
577dc496 | 454 | struct write_midx_context { |
d01bf2e6 | 455 | struct pack_info *info; |
396f2570 | 456 | uint32_t nr; |
d01bf2e6 | 457 | uint32_t alloc; |
a40498a1 | 458 | struct multi_pack_index *m; |
840cef0c WB |
459 | struct progress *progress; |
460 | unsigned pack_paths_checked; | |
396f2570 DS |
461 | }; |
462 | ||
463 | static void add_pack_to_midx(const char *full_path, size_t full_path_len, | |
464 | const char *file_name, void *data) | |
465 | { | |
577dc496 | 466 | struct write_midx_context *ctx = data; |
396f2570 DS |
467 | |
468 | if (ends_with(file_name, ".idx")) { | |
577dc496 DS |
469 | display_progress(ctx->progress, ++ctx->pack_paths_checked); |
470 | if (ctx->m && midx_contains_pack(ctx->m, file_name)) | |
a40498a1 DS |
471 | return; |
472 | ||
577dc496 | 473 | ALLOC_GROW(ctx->info, ctx->nr + 1, ctx->alloc); |
396f2570 | 474 | |
577dc496 DS |
475 | ctx->info[ctx->nr].p = add_packed_git(full_path, |
476 | full_path_len, | |
477 | 0); | |
fe1ed56f | 478 | |
577dc496 | 479 | if (!ctx->info[ctx->nr].p) { |
396f2570 DS |
480 | warning(_("failed to add packfile '%s'"), |
481 | full_path); | |
482 | return; | |
483 | } | |
484 | ||
577dc496 | 485 | if (open_pack_index(ctx->info[ctx->nr].p)) { |
fe1ed56f DS |
486 | warning(_("failed to open pack-index '%s'"), |
487 | full_path); | |
577dc496 DS |
488 | close_pack(ctx->info[ctx->nr].p); |
489 | FREE_AND_NULL(ctx->info[ctx->nr].p); | |
fe1ed56f DS |
490 | return; |
491 | } | |
492 | ||
577dc496 DS |
493 | ctx->info[ctx->nr].pack_name = xstrdup(file_name); |
494 | ctx->info[ctx->nr].orig_pack_int_id = ctx->nr; | |
495 | ctx->info[ctx->nr].expired = 0; | |
496 | ctx->nr++; | |
396f2570 DS |
497 | } |
498 | } | |
499 | ||
fe1ed56f DS |
500 | struct pack_midx_entry { |
501 | struct object_id oid; | |
502 | uint32_t pack_int_id; | |
503 | time_t pack_mtime; | |
504 | uint64_t offset; | |
505 | }; | |
506 | ||
507 | static int midx_oid_compare(const void *_a, const void *_b) | |
508 | { | |
509 | const struct pack_midx_entry *a = (const struct pack_midx_entry *)_a; | |
510 | const struct pack_midx_entry *b = (const struct pack_midx_entry *)_b; | |
511 | int cmp = oidcmp(&a->oid, &b->oid); | |
512 | ||
513 | if (cmp) | |
514 | return cmp; | |
515 | ||
516 | if (a->pack_mtime > b->pack_mtime) | |
517 | return -1; | |
518 | else if (a->pack_mtime < b->pack_mtime) | |
519 | return 1; | |
520 | ||
521 | return a->pack_int_id - b->pack_int_id; | |
522 | } | |
523 | ||
a40498a1 | 524 | static int nth_midxed_pack_midx_entry(struct multi_pack_index *m, |
a40498a1 DS |
525 | struct pack_midx_entry *e, |
526 | uint32_t pos) | |
527 | { | |
528 | if (pos >= m->num_objects) | |
529 | return 1; | |
530 | ||
531 | nth_midxed_object_oid(&e->oid, m, pos); | |
d01bf2e6 | 532 | e->pack_int_id = nth_midxed_pack_int_id(m, pos); |
a40498a1 DS |
533 | e->offset = nth_midxed_offset(m, pos); |
534 | ||
535 | /* consider objects in midx to be from "old" packs */ | |
536 | e->pack_mtime = 0; | |
537 | return 0; | |
538 | } | |
539 | ||
fe1ed56f DS |
540 | static void fill_pack_entry(uint32_t pack_int_id, |
541 | struct packed_git *p, | |
542 | uint32_t cur_object, | |
543 | struct pack_midx_entry *entry) | |
544 | { | |
0763671b | 545 | if (nth_packed_object_id(&entry->oid, p, cur_object) < 0) |
fe1ed56f DS |
546 | die(_("failed to locate object %d in packfile"), cur_object); |
547 | ||
548 | entry->pack_int_id = pack_int_id; | |
549 | entry->pack_mtime = p->mtime; | |
550 | ||
551 | entry->offset = nth_packed_object_offset(p, cur_object); | |
552 | } | |
553 | ||
554 | /* | |
555 | * It is possible to artificially get into a state where there are many | |
556 | * duplicate copies of objects. That can create high memory pressure if | |
557 | * we are to create a list of all objects before de-duplication. To reduce | |
558 | * this memory pressure without a significant performance drop, automatically | |
559 | * group objects by the first byte of their object id. Use the IDX fanout | |
560 | * tables to group the data, copy to a local array, then sort. | |
561 | * | |
562 | * Copy only the de-duplicated entries (selected by most-recent modified time | |
563 | * of a packfile containing the object). | |
564 | */ | |
a40498a1 | 565 | static struct pack_midx_entry *get_sorted_entries(struct multi_pack_index *m, |
d01bf2e6 | 566 | struct pack_info *info, |
fe1ed56f DS |
567 | uint32_t nr_packs, |
568 | uint32_t *nr_objects) | |
569 | { | |
570 | uint32_t cur_fanout, cur_pack, cur_object; | |
571 | uint32_t alloc_fanout, alloc_objects, total_objects = 0; | |
572 | struct pack_midx_entry *entries_by_fanout = NULL; | |
573 | struct pack_midx_entry *deduplicated_entries = NULL; | |
a40498a1 | 574 | uint32_t start_pack = m ? m->num_packs : 0; |
fe1ed56f | 575 | |
a40498a1 | 576 | for (cur_pack = start_pack; cur_pack < nr_packs; cur_pack++) |
d01bf2e6 | 577 | total_objects += info[cur_pack].p->num_objects; |
fe1ed56f DS |
578 | |
579 | /* | |
580 | * As we de-duplicate by fanout value, we expect the fanout | |
581 | * slices to be evenly distributed, with some noise. Hence, | |
582 | * allocate slightly more than one 256th. | |
583 | */ | |
584 | alloc_objects = alloc_fanout = total_objects > 3200 ? total_objects / 200 : 16; | |
585 | ||
586 | ALLOC_ARRAY(entries_by_fanout, alloc_fanout); | |
587 | ALLOC_ARRAY(deduplicated_entries, alloc_objects); | |
588 | *nr_objects = 0; | |
589 | ||
590 | for (cur_fanout = 0; cur_fanout < 256; cur_fanout++) { | |
591 | uint32_t nr_fanout = 0; | |
592 | ||
a40498a1 DS |
593 | if (m) { |
594 | uint32_t start = 0, end; | |
595 | ||
596 | if (cur_fanout) | |
597 | start = ntohl(m->chunk_oid_fanout[cur_fanout - 1]); | |
598 | end = ntohl(m->chunk_oid_fanout[cur_fanout]); | |
599 | ||
600 | for (cur_object = start; cur_object < end; cur_object++) { | |
601 | ALLOC_GROW(entries_by_fanout, nr_fanout + 1, alloc_fanout); | |
d01bf2e6 | 602 | nth_midxed_pack_midx_entry(m, |
a40498a1 DS |
603 | &entries_by_fanout[nr_fanout], |
604 | cur_object); | |
605 | nr_fanout++; | |
606 | } | |
607 | } | |
608 | ||
609 | for (cur_pack = start_pack; cur_pack < nr_packs; cur_pack++) { | |
fe1ed56f DS |
610 | uint32_t start = 0, end; |
611 | ||
612 | if (cur_fanout) | |
d01bf2e6 DS |
613 | start = get_pack_fanout(info[cur_pack].p, cur_fanout - 1); |
614 | end = get_pack_fanout(info[cur_pack].p, cur_fanout); | |
fe1ed56f DS |
615 | |
616 | for (cur_object = start; cur_object < end; cur_object++) { | |
617 | ALLOC_GROW(entries_by_fanout, nr_fanout + 1, alloc_fanout); | |
d01bf2e6 | 618 | fill_pack_entry(cur_pack, info[cur_pack].p, cur_object, &entries_by_fanout[nr_fanout]); |
fe1ed56f DS |
619 | nr_fanout++; |
620 | } | |
621 | } | |
622 | ||
623 | QSORT(entries_by_fanout, nr_fanout, midx_oid_compare); | |
624 | ||
625 | /* | |
626 | * The batch is now sorted by OID and then mtime (descending). | |
627 | * Take only the first duplicate. | |
628 | */ | |
629 | for (cur_object = 0; cur_object < nr_fanout; cur_object++) { | |
e43d2dcc JK |
630 | if (cur_object && oideq(&entries_by_fanout[cur_object - 1].oid, |
631 | &entries_by_fanout[cur_object].oid)) | |
fe1ed56f DS |
632 | continue; |
633 | ||
634 | ALLOC_GROW(deduplicated_entries, *nr_objects + 1, alloc_objects); | |
635 | memcpy(&deduplicated_entries[*nr_objects], | |
636 | &entries_by_fanout[cur_object], | |
637 | sizeof(struct pack_midx_entry)); | |
638 | (*nr_objects)++; | |
639 | } | |
640 | } | |
641 | ||
642 | free(entries_by_fanout); | |
643 | return deduplicated_entries; | |
644 | } | |
645 | ||
b4d94142 | 646 | static size_t write_midx_pack_names(struct hashfile *f, void *data) |
32f3c541 | 647 | { |
b4d94142 | 648 | struct write_midx_context *ctx = data; |
32f3c541 DS |
649 | uint32_t i; |
650 | unsigned char padding[MIDX_CHUNK_ALIGNMENT]; | |
651 | size_t written = 0; | |
652 | ||
b4d94142 | 653 | for (i = 0; i < ctx->nr; i++) { |
19575c7c DS |
654 | size_t writelen; |
655 | ||
b4d94142 | 656 | if (ctx->info[i].expired) |
19575c7c | 657 | continue; |
32f3c541 | 658 | |
b4d94142 | 659 | if (i && strcmp(ctx->info[i].pack_name, ctx->info[i - 1].pack_name) <= 0) |
32f3c541 | 660 | BUG("incorrect pack-file order: %s before %s", |
b4d94142 DS |
661 | ctx->info[i - 1].pack_name, |
662 | ctx->info[i].pack_name); | |
32f3c541 | 663 | |
b4d94142 DS |
664 | writelen = strlen(ctx->info[i].pack_name) + 1; |
665 | hashwrite(f, ctx->info[i].pack_name, writelen); | |
32f3c541 DS |
666 | written += writelen; |
667 | } | |
668 | ||
669 | /* add padding to be aligned */ | |
670 | i = MIDX_CHUNK_ALIGNMENT - (written % MIDX_CHUNK_ALIGNMENT); | |
671 | if (i < MIDX_CHUNK_ALIGNMENT) { | |
672 | memset(padding, 0, sizeof(padding)); | |
673 | hashwrite(f, padding, i); | |
674 | written += i; | |
675 | } | |
676 | ||
677 | return written; | |
678 | } | |
679 | ||
d7cacf29 DS |
680 | static size_t write_midx_oid_fanout(struct hashfile *f, |
681 | struct pack_midx_entry *objects, | |
682 | uint32_t nr_objects) | |
683 | { | |
684 | struct pack_midx_entry *list = objects; | |
685 | struct pack_midx_entry *last = objects + nr_objects; | |
686 | uint32_t count = 0; | |
687 | uint32_t i; | |
688 | ||
689 | /* | |
690 | * Write the first-level table (the list is sorted, | |
691 | * but we use a 256-entry lookup to be able to avoid | |
692 | * having to do eight extra binary search iterations). | |
693 | */ | |
694 | for (i = 0; i < 256; i++) { | |
695 | struct pack_midx_entry *next = list; | |
696 | ||
697 | while (next < last && next->oid.hash[0] == i) { | |
698 | count++; | |
699 | next++; | |
700 | } | |
701 | ||
702 | hashwrite_be32(f, count); | |
703 | list = next; | |
704 | } | |
705 | ||
706 | return MIDX_CHUNK_FANOUT_SIZE; | |
707 | } | |
708 | ||
0d5b3a5e DS |
709 | static size_t write_midx_oid_lookup(struct hashfile *f, unsigned char hash_len, |
710 | struct pack_midx_entry *objects, | |
711 | uint32_t nr_objects) | |
712 | { | |
713 | struct pack_midx_entry *list = objects; | |
714 | uint32_t i; | |
715 | size_t written = 0; | |
716 | ||
717 | for (i = 0; i < nr_objects; i++) { | |
718 | struct pack_midx_entry *obj = list++; | |
719 | ||
720 | if (i < nr_objects - 1) { | |
721 | struct pack_midx_entry *next = list; | |
722 | if (oidcmp(&obj->oid, &next->oid) >= 0) | |
723 | BUG("OIDs not in order: %s >= %s", | |
724 | oid_to_hex(&obj->oid), | |
725 | oid_to_hex(&next->oid)); | |
726 | } | |
727 | ||
728 | hashwrite(f, obj->oid.hash, (int)hash_len); | |
729 | written += hash_len; | |
730 | } | |
731 | ||
732 | return written; | |
733 | } | |
734 | ||
662148c4 | 735 | static size_t write_midx_object_offsets(struct hashfile *f, int large_offset_needed, |
d01bf2e6 | 736 | uint32_t *perm, |
662148c4 DS |
737 | struct pack_midx_entry *objects, uint32_t nr_objects) |
738 | { | |
739 | struct pack_midx_entry *list = objects; | |
740 | uint32_t i, nr_large_offset = 0; | |
741 | size_t written = 0; | |
742 | ||
743 | for (i = 0; i < nr_objects; i++) { | |
744 | struct pack_midx_entry *obj = list++; | |
745 | ||
19575c7c DS |
746 | if (perm[obj->pack_int_id] == PACK_EXPIRED) |
747 | BUG("object %s is in an expired pack with int-id %d", | |
748 | oid_to_hex(&obj->oid), | |
749 | obj->pack_int_id); | |
750 | ||
d01bf2e6 | 751 | hashwrite_be32(f, perm[obj->pack_int_id]); |
662148c4 DS |
752 | |
753 | if (large_offset_needed && obj->offset >> 31) | |
754 | hashwrite_be32(f, MIDX_LARGE_OFFSET_NEEDED | nr_large_offset++); | |
755 | else if (!large_offset_needed && obj->offset >> 32) | |
756 | BUG("object %s requires a large offset (%"PRIx64") but the MIDX is not writing large offsets!", | |
757 | oid_to_hex(&obj->oid), | |
758 | obj->offset); | |
759 | else | |
760 | hashwrite_be32(f, (uint32_t)obj->offset); | |
761 | ||
762 | written += MIDX_CHUNK_OFFSET_WIDTH; | |
763 | } | |
764 | ||
765 | return written; | |
766 | } | |
767 | ||
768 | static size_t write_midx_large_offsets(struct hashfile *f, uint32_t nr_large_offset, | |
769 | struct pack_midx_entry *objects, uint32_t nr_objects) | |
770 | { | |
61b0fcbb | 771 | struct pack_midx_entry *list = objects, *end = objects + nr_objects; |
662148c4 DS |
772 | size_t written = 0; |
773 | ||
774 | while (nr_large_offset) { | |
61b0fcbb JK |
775 | struct pack_midx_entry *obj; |
776 | uint64_t offset; | |
777 | ||
778 | if (list >= end) | |
779 | BUG("too many large-offset objects"); | |
780 | ||
781 | obj = list++; | |
782 | offset = obj->offset; | |
662148c4 DS |
783 | |
784 | if (!(offset >> 31)) | |
785 | continue; | |
786 | ||
ef1b853c | 787 | written += hashwrite_be64(f, offset); |
662148c4 DS |
788 | |
789 | nr_large_offset--; | |
790 | } | |
791 | ||
792 | return written; | |
793 | } | |
794 | ||
19575c7c | 795 | static int write_midx_internal(const char *object_dir, struct multi_pack_index *m, |
840cef0c | 796 | struct string_list *packs_to_drop, unsigned flags) |
a3407730 | 797 | { |
32f3c541 | 798 | unsigned char cur_chunk, num_chunks = 0; |
fc59e748 | 799 | char *midx_name; |
396f2570 | 800 | uint32_t i; |
fc59e748 DS |
801 | struct hashfile *f = NULL; |
802 | struct lock_file lk; | |
577dc496 | 803 | struct write_midx_context ctx = { 0 }; |
32f3c541 DS |
804 | uint32_t *pack_perm = NULL; |
805 | uint64_t written = 0; | |
806 | uint32_t chunk_ids[MIDX_MAX_CHUNKS + 1]; | |
807 | uint64_t chunk_offsets[MIDX_MAX_CHUNKS + 1]; | |
662148c4 | 808 | uint32_t nr_entries, num_large_offsets = 0; |
fe1ed56f | 809 | struct pack_midx_entry *entries = NULL; |
840cef0c | 810 | struct progress *progress = NULL; |
662148c4 | 811 | int large_offsets_needed = 0; |
dba6175c | 812 | int pack_name_concat_len = 0; |
19575c7c DS |
813 | int dropped_packs = 0; |
814 | int result = 0; | |
fc59e748 DS |
815 | |
816 | midx_name = get_midx_filename(object_dir); | |
d5e1961c | 817 | if (safe_create_leading_directories(midx_name)) |
fc59e748 DS |
818 | die_errno(_("unable to create leading directories of %s"), |
819 | midx_name); | |
fc59e748 | 820 | |
19575c7c | 821 | if (m) |
577dc496 | 822 | ctx.m = m; |
19575c7c | 823 | else |
577dc496 DS |
824 | ctx.m = load_multi_pack_index(object_dir, 1); |
825 | ||
826 | ctx.nr = 0; | |
827 | ctx.alloc = ctx.m ? ctx.m->num_packs : 16; | |
828 | ctx.info = NULL; | |
829 | ALLOC_ARRAY(ctx.info, ctx.alloc); | |
830 | ||
831 | if (ctx.m) { | |
832 | for (i = 0; i < ctx.m->num_packs; i++) { | |
833 | ALLOC_GROW(ctx.info, ctx.nr + 1, ctx.alloc); | |
834 | ||
835 | ctx.info[ctx.nr].orig_pack_int_id = i; | |
836 | ctx.info[ctx.nr].pack_name = xstrdup(ctx.m->pack_names[i]); | |
837 | ctx.info[ctx.nr].p = NULL; | |
838 | ctx.info[ctx.nr].expired = 0; | |
839 | ctx.nr++; | |
a40498a1 DS |
840 | } |
841 | } | |
842 | ||
577dc496 | 843 | ctx.pack_paths_checked = 0; |
840cef0c | 844 | if (flags & MIDX_PROGRESS) |
577dc496 | 845 | ctx.progress = start_delayed_progress(_("Adding packfiles to multi-pack-index"), 0); |
840cef0c | 846 | else |
577dc496 | 847 | ctx.progress = NULL; |
840cef0c | 848 | |
577dc496 DS |
849 | for_each_file_in_pack_dir(object_dir, add_pack_to_midx, &ctx); |
850 | stop_progress(&ctx.progress); | |
396f2570 | 851 | |
577dc496 | 852 | if (ctx.m && ctx.nr == ctx.m->num_packs && !packs_to_drop) |
a40498a1 DS |
853 | goto cleanup; |
854 | ||
577dc496 | 855 | entries = get_sorted_entries(ctx.m, ctx.info, ctx.nr, &nr_entries); |
a40498a1 | 856 | |
662148c4 DS |
857 | for (i = 0; i < nr_entries; i++) { |
858 | if (entries[i].offset > 0x7fffffff) | |
859 | num_large_offsets++; | |
860 | if (entries[i].offset > 0xffffffff) | |
861 | large_offsets_needed = 1; | |
862 | } | |
fe1ed56f | 863 | |
577dc496 | 864 | QSORT(ctx.info, ctx.nr, pack_info_compare); |
d01bf2e6 | 865 | |
19575c7c DS |
866 | if (packs_to_drop && packs_to_drop->nr) { |
867 | int drop_index = 0; | |
868 | int missing_drops = 0; | |
869 | ||
577dc496 DS |
870 | for (i = 0; i < ctx.nr && drop_index < packs_to_drop->nr; i++) { |
871 | int cmp = strcmp(ctx.info[i].pack_name, | |
19575c7c DS |
872 | packs_to_drop->items[drop_index].string); |
873 | ||
874 | if (!cmp) { | |
875 | drop_index++; | |
577dc496 | 876 | ctx.info[i].expired = 1; |
19575c7c DS |
877 | } else if (cmp > 0) { |
878 | error(_("did not see pack-file %s to drop"), | |
879 | packs_to_drop->items[drop_index].string); | |
880 | drop_index++; | |
881 | missing_drops++; | |
882 | i--; | |
883 | } else { | |
577dc496 | 884 | ctx.info[i].expired = 0; |
19575c7c DS |
885 | } |
886 | } | |
887 | ||
888 | if (missing_drops) { | |
889 | result = 1; | |
890 | goto cleanup; | |
891 | } | |
892 | } | |
893 | ||
d01bf2e6 DS |
894 | /* |
895 | * pack_perm stores a permutation between pack-int-ids from the | |
896 | * previous multi-pack-index to the new one we are writing: | |
897 | * | |
898 | * pack_perm[old_id] = new_id | |
899 | */ | |
577dc496 DS |
900 | ALLOC_ARRAY(pack_perm, ctx.nr); |
901 | for (i = 0; i < ctx.nr; i++) { | |
902 | if (ctx.info[i].expired) { | |
19575c7c | 903 | dropped_packs++; |
577dc496 | 904 | pack_perm[ctx.info[i].orig_pack_int_id] = PACK_EXPIRED; |
19575c7c | 905 | } else { |
577dc496 | 906 | pack_perm[ctx.info[i].orig_pack_int_id] = i - dropped_packs; |
19575c7c | 907 | } |
d01bf2e6 DS |
908 | } |
909 | ||
577dc496 DS |
910 | for (i = 0; i < ctx.nr; i++) { |
911 | if (!ctx.info[i].expired) | |
912 | pack_name_concat_len += strlen(ctx.info[i].pack_name) + 1; | |
19575c7c | 913 | } |
dba6175c DS |
914 | |
915 | if (pack_name_concat_len % MIDX_CHUNK_ALIGNMENT) | |
916 | pack_name_concat_len += MIDX_CHUNK_ALIGNMENT - | |
917 | (pack_name_concat_len % MIDX_CHUNK_ALIGNMENT); | |
918 | ||
fc59e748 DS |
919 | hold_lock_file_for_update(&lk, midx_name, LOCK_DIE_ON_ERROR); |
920 | f = hashfd(lk.tempfile->fd, lk.tempfile->filename.buf); | |
921 | FREE_AND_NULL(midx_name); | |
922 | ||
577dc496 DS |
923 | if (ctx.m) |
924 | close_midx(ctx.m); | |
a40498a1 | 925 | |
32f3c541 | 926 | cur_chunk = 0; |
662148c4 | 927 | num_chunks = large_offsets_needed ? 5 : 4; |
32f3c541 | 928 | |
577dc496 | 929 | if (ctx.nr - dropped_packs == 0) { |
796d61cd DR |
930 | error(_("no pack files to index.")); |
931 | result = 1; | |
932 | goto cleanup; | |
933 | } | |
934 | ||
577dc496 | 935 | written = write_midx_header(f, num_chunks, ctx.nr - dropped_packs); |
32f3c541 DS |
936 | |
937 | chunk_ids[cur_chunk] = MIDX_CHUNKID_PACKNAMES; | |
938 | chunk_offsets[cur_chunk] = written + (num_chunks + 1) * MIDX_CHUNKLOOKUP_WIDTH; | |
939 | ||
940 | cur_chunk++; | |
d7cacf29 | 941 | chunk_ids[cur_chunk] = MIDX_CHUNKID_OIDFANOUT; |
dba6175c | 942 | chunk_offsets[cur_chunk] = chunk_offsets[cur_chunk - 1] + pack_name_concat_len; |
32f3c541 | 943 | |
d7cacf29 DS |
944 | cur_chunk++; |
945 | chunk_ids[cur_chunk] = MIDX_CHUNKID_OIDLOOKUP; | |
946 | chunk_offsets[cur_chunk] = chunk_offsets[cur_chunk - 1] + MIDX_CHUNK_FANOUT_SIZE; | |
947 | ||
0d5b3a5e | 948 | cur_chunk++; |
662148c4 | 949 | chunk_ids[cur_chunk] = MIDX_CHUNKID_OBJECTOFFSETS; |
aaa95dfa | 950 | chunk_offsets[cur_chunk] = chunk_offsets[cur_chunk - 1] + nr_entries * the_hash_algo->rawsz; |
0d5b3a5e | 951 | |
662148c4 DS |
952 | cur_chunk++; |
953 | chunk_offsets[cur_chunk] = chunk_offsets[cur_chunk - 1] + nr_entries * MIDX_CHUNK_OFFSET_WIDTH; | |
954 | if (large_offsets_needed) { | |
955 | chunk_ids[cur_chunk] = MIDX_CHUNKID_LARGEOFFSETS; | |
956 | ||
957 | cur_chunk++; | |
958 | chunk_offsets[cur_chunk] = chunk_offsets[cur_chunk - 1] + | |
959 | num_large_offsets * MIDX_CHUNK_LARGE_OFFSET_WIDTH; | |
960 | } | |
961 | ||
962 | chunk_ids[cur_chunk] = 0; | |
963 | ||
32f3c541 DS |
964 | for (i = 0; i <= num_chunks; i++) { |
965 | if (i && chunk_offsets[i] < chunk_offsets[i - 1]) | |
966 | BUG("incorrect chunk offsets: %"PRIu64" before %"PRIu64, | |
967 | chunk_offsets[i - 1], | |
968 | chunk_offsets[i]); | |
969 | ||
970 | if (chunk_offsets[i] % MIDX_CHUNK_ALIGNMENT) | |
971 | BUG("chunk offset %"PRIu64" is not properly aligned", | |
972 | chunk_offsets[i]); | |
973 | ||
974 | hashwrite_be32(f, chunk_ids[i]); | |
ef1b853c | 975 | hashwrite_be64(f, chunk_offsets[i]); |
32f3c541 DS |
976 | |
977 | written += MIDX_CHUNKLOOKUP_WIDTH; | |
978 | } | |
979 | ||
840cef0c | 980 | if (flags & MIDX_PROGRESS) |
efdd2f0d | 981 | progress = start_delayed_progress(_("Writing chunks to multi-pack-index"), |
840cef0c | 982 | num_chunks); |
32f3c541 DS |
983 | for (i = 0; i < num_chunks; i++) { |
984 | if (written != chunk_offsets[i]) | |
985 | BUG("incorrect chunk offset (%"PRIu64" != %"PRIu64") for chunk id %"PRIx32, | |
986 | chunk_offsets[i], | |
987 | written, | |
988 | chunk_ids[i]); | |
989 | ||
990 | switch (chunk_ids[i]) { | |
991 | case MIDX_CHUNKID_PACKNAMES: | |
b4d94142 | 992 | written += write_midx_pack_names(f, &ctx); |
32f3c541 DS |
993 | break; |
994 | ||
d7cacf29 DS |
995 | case MIDX_CHUNKID_OIDFANOUT: |
996 | written += write_midx_oid_fanout(f, entries, nr_entries); | |
997 | break; | |
998 | ||
0d5b3a5e | 999 | case MIDX_CHUNKID_OIDLOOKUP: |
aaa95dfa | 1000 | written += write_midx_oid_lookup(f, the_hash_algo->rawsz, entries, nr_entries); |
0d5b3a5e DS |
1001 | break; |
1002 | ||
662148c4 | 1003 | case MIDX_CHUNKID_OBJECTOFFSETS: |
d01bf2e6 | 1004 | written += write_midx_object_offsets(f, large_offsets_needed, pack_perm, entries, nr_entries); |
662148c4 DS |
1005 | break; |
1006 | ||
1007 | case MIDX_CHUNKID_LARGEOFFSETS: | |
1008 | written += write_midx_large_offsets(f, num_large_offsets, entries, nr_entries); | |
1009 | break; | |
1010 | ||
32f3c541 DS |
1011 | default: |
1012 | BUG("trying to write unknown chunk id %"PRIx32, | |
1013 | chunk_ids[i]); | |
1014 | } | |
840cef0c WB |
1015 | |
1016 | display_progress(progress, i + 1); | |
32f3c541 | 1017 | } |
840cef0c | 1018 | stop_progress(&progress); |
32f3c541 DS |
1019 | |
1020 | if (written != chunk_offsets[num_chunks]) | |
1021 | BUG("incorrect final offset %"PRIu64" != %"PRIu64, | |
1022 | written, | |
1023 | chunk_offsets[num_chunks]); | |
fc59e748 DS |
1024 | |
1025 | finalize_hashfile(f, NULL, CSUM_FSYNC | CSUM_HASH_IN_STREAM); | |
1026 | commit_lock_file(&lk); | |
1027 | ||
a40498a1 | 1028 | cleanup: |
577dc496 DS |
1029 | for (i = 0; i < ctx.nr; i++) { |
1030 | if (ctx.info[i].p) { | |
1031 | close_pack(ctx.info[i].p); | |
1032 | free(ctx.info[i].p); | |
396f2570 | 1033 | } |
577dc496 | 1034 | free(ctx.info[i].pack_name); |
396f2570 DS |
1035 | } |
1036 | ||
577dc496 | 1037 | free(ctx.info); |
fe1ed56f | 1038 | free(entries); |
a40498a1 DS |
1039 | free(pack_perm); |
1040 | free(midx_name); | |
19575c7c DS |
1041 | return result; |
1042 | } | |
1043 | ||
efbc3aee | 1044 | int write_midx_file(const char *object_dir, unsigned flags) |
19575c7c | 1045 | { |
840cef0c | 1046 | return write_midx_internal(object_dir, NULL, NULL, flags); |
a3407730 | 1047 | } |
525e18c0 | 1048 | |
1dcd9f20 | 1049 | void clear_midx_file(struct repository *r) |
525e18c0 | 1050 | { |
3b2f8a02 | 1051 | char *midx = get_midx_filename(r->objects->odb->path); |
1dcd9f20 DS |
1052 | |
1053 | if (r->objects && r->objects->multi_pack_index) { | |
1054 | close_midx(r->objects->multi_pack_index); | |
1055 | r->objects->multi_pack_index = NULL; | |
1056 | } | |
525e18c0 | 1057 | |
d5e1961c | 1058 | if (remove_path(midx)) |
525e18c0 | 1059 | die(_("failed to clear multi-pack-index at %s"), midx); |
525e18c0 DS |
1060 | |
1061 | free(midx); | |
1062 | } | |
56ee7ff1 DS |
1063 | |
1064 | static int verify_midx_error; | |
1065 | ||
d4bf1d88 DS |
1066 | static void midx_report(const char *fmt, ...) |
1067 | { | |
1068 | va_list ap; | |
1069 | verify_midx_error = 1; | |
1070 | va_start(ap, fmt); | |
1071 | vfprintf(stderr, fmt, ap); | |
1072 | fprintf(stderr, "\n"); | |
1073 | va_end(ap); | |
1074 | } | |
1075 | ||
5ae18df9 JH |
1076 | struct pair_pos_vs_id |
1077 | { | |
1078 | uint32_t pos; | |
1079 | uint32_t pack_int_id; | |
1080 | }; | |
1081 | ||
1082 | static int compare_pair_pos_vs_id(const void *_a, const void *_b) | |
1083 | { | |
1084 | struct pair_pos_vs_id *a = (struct pair_pos_vs_id *)_a; | |
1085 | struct pair_pos_vs_id *b = (struct pair_pos_vs_id *)_b; | |
1086 | ||
1087 | return b->pack_int_id - a->pack_int_id; | |
1088 | } | |
1089 | ||
430efb8a JH |
1090 | /* |
1091 | * Limit calls to display_progress() for performance reasons. | |
1092 | * The interval here was arbitrarily chosen. | |
1093 | */ | |
1094 | #define SPARSE_PROGRESS_INTERVAL (1 << 12) | |
1095 | #define midx_display_sparse_progress(progress, n) \ | |
1096 | do { \ | |
1097 | uint64_t _n = (n); \ | |
1098 | if ((_n & (SPARSE_PROGRESS_INTERVAL - 1)) == 0) \ | |
1099 | display_progress(progress, _n); \ | |
1100 | } while (0) | |
1101 | ||
efbc3aee | 1102 | int verify_midx_file(struct repository *r, const char *object_dir, unsigned flags) |
56ee7ff1 | 1103 | { |
5ae18df9 | 1104 | struct pair_pos_vs_id *pairs = NULL; |
d4bf1d88 | 1105 | uint32_t i; |
ad60096d | 1106 | struct progress *progress = NULL; |
56ee7ff1 DS |
1107 | struct multi_pack_index *m = load_multi_pack_index(object_dir, 1); |
1108 | verify_midx_error = 0; | |
1109 | ||
d9607542 DS |
1110 | if (!m) { |
1111 | int result = 0; | |
1112 | struct stat sb; | |
1113 | char *filename = get_midx_filename(object_dir); | |
1114 | if (!stat(filename, &sb)) { | |
1115 | error(_("multi-pack-index file exists, but failed to parse")); | |
1116 | result = 1; | |
1117 | } | |
1118 | free(filename); | |
1119 | return result; | |
1120 | } | |
56ee7ff1 | 1121 | |
ad60096d | 1122 | if (flags & MIDX_PROGRESS) |
efdd2f0d | 1123 | progress = start_delayed_progress(_("Looking for referenced packfiles"), |
ad60096d | 1124 | m->num_packs); |
d4bf1d88 | 1125 | for (i = 0; i < m->num_packs; i++) { |
64404a24 | 1126 | if (prepare_midx_pack(r, m, i)) |
d4bf1d88 | 1127 | midx_report("failed to load pack in position %d", i); |
430efb8a JH |
1128 | |
1129 | display_progress(progress, i + 1); | |
d4bf1d88 | 1130 | } |
430efb8a | 1131 | stop_progress(&progress); |
d4bf1d88 | 1132 | |
2f23d3f3 DS |
1133 | for (i = 0; i < 255; i++) { |
1134 | uint32_t oid_fanout1 = ntohl(m->chunk_oid_fanout[i]); | |
1135 | uint32_t oid_fanout2 = ntohl(m->chunk_oid_fanout[i + 1]); | |
1136 | ||
1137 | if (oid_fanout1 > oid_fanout2) | |
1138 | midx_report(_("oid fanout out of order: fanout[%d] = %"PRIx32" > %"PRIx32" = fanout[%d]"), | |
1139 | i, oid_fanout1, oid_fanout2, i + 1); | |
1140 | } | |
1141 | ||
796d61cd DR |
1142 | if (m->num_objects == 0) { |
1143 | midx_report(_("the midx contains no oid")); | |
1144 | /* | |
1145 | * Remaining tests assume that we have objects, so we can | |
1146 | * return here. | |
1147 | */ | |
1148 | return verify_midx_error; | |
1149 | } | |
1150 | ||
ad60096d WB |
1151 | if (flags & MIDX_PROGRESS) |
1152 | progress = start_sparse_progress(_("Verifying OID order in multi-pack-index"), | |
1153 | m->num_objects - 1); | |
55c5648d DS |
1154 | for (i = 0; i < m->num_objects - 1; i++) { |
1155 | struct object_id oid1, oid2; | |
1156 | ||
1157 | nth_midxed_object_oid(&oid1, m, i); | |
1158 | nth_midxed_object_oid(&oid2, m, i + 1); | |
1159 | ||
1160 | if (oidcmp(&oid1, &oid2) >= 0) | |
1161 | midx_report(_("oid lookup out of order: oid[%d] = %s >= %s = oid[%d]"), | |
1162 | i, oid_to_hex(&oid1), oid_to_hex(&oid2), i + 1); | |
430efb8a JH |
1163 | |
1164 | midx_display_sparse_progress(progress, i + 1); | |
55c5648d | 1165 | } |
430efb8a | 1166 | stop_progress(&progress); |
55c5648d | 1167 | |
5ae18df9 JH |
1168 | /* |
1169 | * Create an array mapping each object to its packfile id. Sort it | |
1170 | * to group the objects by packfile. Use this permutation to visit | |
1171 | * each of the objects and only require 1 packfile to be open at a | |
1172 | * time. | |
1173 | */ | |
1174 | ALLOC_ARRAY(pairs, m->num_objects); | |
1175 | for (i = 0; i < m->num_objects; i++) { | |
1176 | pairs[i].pos = i; | |
1177 | pairs[i].pack_int_id = nth_midxed_pack_int_id(m, i); | |
1178 | } | |
1179 | ||
ad60096d WB |
1180 | if (flags & MIDX_PROGRESS) |
1181 | progress = start_sparse_progress(_("Sorting objects by packfile"), | |
1182 | m->num_objects); | |
5ae18df9 JH |
1183 | display_progress(progress, 0); /* TODO: Measure QSORT() progress */ |
1184 | QSORT(pairs, m->num_objects, compare_pair_pos_vs_id); | |
1185 | stop_progress(&progress); | |
1186 | ||
ad60096d WB |
1187 | if (flags & MIDX_PROGRESS) |
1188 | progress = start_sparse_progress(_("Verifying object offsets"), m->num_objects); | |
cc6af73c DS |
1189 | for (i = 0; i < m->num_objects; i++) { |
1190 | struct object_id oid; | |
1191 | struct pack_entry e; | |
1192 | off_t m_offset, p_offset; | |
1193 | ||
5ae18df9 JH |
1194 | if (i > 0 && pairs[i-1].pack_int_id != pairs[i].pack_int_id && |
1195 | m->packs[pairs[i-1].pack_int_id]) | |
1196 | { | |
1197 | close_pack_fd(m->packs[pairs[i-1].pack_int_id]); | |
1198 | close_pack_index(m->packs[pairs[i-1].pack_int_id]); | |
1199 | } | |
1200 | ||
1201 | nth_midxed_object_oid(&oid, m, pairs[i].pos); | |
1202 | ||
64404a24 | 1203 | if (!fill_midx_entry(r, &oid, &e, m)) { |
cc6af73c | 1204 | midx_report(_("failed to load pack entry for oid[%d] = %s"), |
5ae18df9 | 1205 | pairs[i].pos, oid_to_hex(&oid)); |
cc6af73c DS |
1206 | continue; |
1207 | } | |
1208 | ||
1209 | if (open_pack_index(e.p)) { | |
1210 | midx_report(_("failed to load pack-index for packfile %s"), | |
1211 | e.p->pack_name); | |
1212 | break; | |
1213 | } | |
1214 | ||
1215 | m_offset = e.offset; | |
1216 | p_offset = find_pack_entry_one(oid.hash, e.p); | |
1217 | ||
1218 | if (m_offset != p_offset) | |
1219 | midx_report(_("incorrect object offset for oid[%d] = %s: %"PRIx64" != %"PRIx64), | |
5ae18df9 | 1220 | pairs[i].pos, oid_to_hex(&oid), m_offset, p_offset); |
144d7033 | 1221 | |
430efb8a | 1222 | midx_display_sparse_progress(progress, i + 1); |
cc6af73c | 1223 | } |
144d7033 | 1224 | stop_progress(&progress); |
cc6af73c | 1225 | |
5ae18df9 JH |
1226 | free(pairs); |
1227 | ||
56ee7ff1 DS |
1228 | return verify_midx_error; |
1229 | } | |
cff97116 | 1230 | |
efbc3aee | 1231 | int expire_midx_packs(struct repository *r, const char *object_dir, unsigned flags) |
cff97116 | 1232 | { |
19575c7c DS |
1233 | uint32_t i, *count, result = 0; |
1234 | struct string_list packs_to_drop = STRING_LIST_INIT_DUP; | |
1235 | struct multi_pack_index *m = load_multi_pack_index(object_dir, 1); | |
8dc18f89 | 1236 | struct progress *progress = NULL; |
19575c7c DS |
1237 | |
1238 | if (!m) | |
1239 | return 0; | |
1240 | ||
1241 | count = xcalloc(m->num_packs, sizeof(uint32_t)); | |
8dc18f89 WB |
1242 | |
1243 | if (flags & MIDX_PROGRESS) | |
efdd2f0d | 1244 | progress = start_delayed_progress(_("Counting referenced objects"), |
8dc18f89 | 1245 | m->num_objects); |
19575c7c DS |
1246 | for (i = 0; i < m->num_objects; i++) { |
1247 | int pack_int_id = nth_midxed_pack_int_id(m, i); | |
1248 | count[pack_int_id]++; | |
8dc18f89 | 1249 | display_progress(progress, i + 1); |
19575c7c | 1250 | } |
8dc18f89 | 1251 | stop_progress(&progress); |
19575c7c | 1252 | |
8dc18f89 | 1253 | if (flags & MIDX_PROGRESS) |
efdd2f0d | 1254 | progress = start_delayed_progress(_("Finding and deleting unreferenced packfiles"), |
8dc18f89 | 1255 | m->num_packs); |
19575c7c DS |
1256 | for (i = 0; i < m->num_packs; i++) { |
1257 | char *pack_name; | |
8dc18f89 | 1258 | display_progress(progress, i + 1); |
19575c7c DS |
1259 | |
1260 | if (count[i]) | |
1261 | continue; | |
1262 | ||
1263 | if (prepare_midx_pack(r, m, i)) | |
1264 | continue; | |
1265 | ||
1266 | if (m->packs[i]->pack_keep) | |
1267 | continue; | |
1268 | ||
1269 | pack_name = xstrdup(m->packs[i]->pack_name); | |
1270 | close_pack(m->packs[i]); | |
1271 | ||
1272 | string_list_insert(&packs_to_drop, m->pack_names[i]); | |
1273 | unlink_pack_path(pack_name, 0); | |
1274 | free(pack_name); | |
1275 | } | |
8dc18f89 | 1276 | stop_progress(&progress); |
19575c7c DS |
1277 | |
1278 | free(count); | |
1279 | ||
1280 | if (packs_to_drop.nr) | |
840cef0c | 1281 | result = write_midx_internal(object_dir, m, &packs_to_drop, flags); |
19575c7c DS |
1282 | |
1283 | string_list_clear(&packs_to_drop, 0); | |
1284 | return result; | |
cff97116 | 1285 | } |
2af890bb | 1286 | |
ce1e4a10 DS |
1287 | struct repack_info { |
1288 | timestamp_t mtime; | |
1289 | uint32_t referenced_objects; | |
1290 | uint32_t pack_int_id; | |
1291 | }; | |
1292 | ||
1293 | static int compare_by_mtime(const void *a_, const void *b_) | |
2af890bb | 1294 | { |
ce1e4a10 DS |
1295 | const struct repack_info *a, *b; |
1296 | ||
1297 | a = (const struct repack_info *)a_; | |
1298 | b = (const struct repack_info *)b_; | |
1299 | ||
1300 | if (a->mtime < b->mtime) | |
1301 | return -1; | |
1302 | if (a->mtime > b->mtime) | |
1303 | return 1; | |
1304 | return 0; | |
1305 | } | |
1306 | ||
3ce4ca0a DS |
1307 | static int fill_included_packs_all(struct repository *r, |
1308 | struct multi_pack_index *m, | |
ce1e4a10 DS |
1309 | unsigned char *include_pack) |
1310 | { | |
3ce4ca0a DS |
1311 | uint32_t i, count = 0; |
1312 | int pack_kept_objects = 0; | |
1313 | ||
1314 | repo_config_get_bool(r, "repack.packkeptobjects", &pack_kept_objects); | |
1315 | ||
1316 | for (i = 0; i < m->num_packs; i++) { | |
1317 | if (prepare_midx_pack(r, m, i)) | |
1318 | continue; | |
1319 | if (!pack_kept_objects && m->packs[i]->pack_keep) | |
1320 | continue; | |
ce1e4a10 | 1321 | |
ce1e4a10 | 1322 | include_pack[i] = 1; |
3ce4ca0a DS |
1323 | count++; |
1324 | } | |
ce1e4a10 | 1325 | |
3ce4ca0a | 1326 | return count < 2; |
ce1e4a10 DS |
1327 | } |
1328 | ||
1329 | static int fill_included_packs_batch(struct repository *r, | |
1330 | struct multi_pack_index *m, | |
1331 | unsigned char *include_pack, | |
1332 | size_t batch_size) | |
1333 | { | |
1334 | uint32_t i, packs_to_repack; | |
1335 | size_t total_size; | |
1336 | struct repack_info *pack_info = xcalloc(m->num_packs, sizeof(struct repack_info)); | |
3ce4ca0a DS |
1337 | int pack_kept_objects = 0; |
1338 | ||
1339 | repo_config_get_bool(r, "repack.packkeptobjects", &pack_kept_objects); | |
ce1e4a10 DS |
1340 | |
1341 | for (i = 0; i < m->num_packs; i++) { | |
1342 | pack_info[i].pack_int_id = i; | |
1343 | ||
1344 | if (prepare_midx_pack(r, m, i)) | |
1345 | continue; | |
1346 | ||
1347 | pack_info[i].mtime = m->packs[i]->mtime; | |
1348 | } | |
1349 | ||
1350 | for (i = 0; batch_size && i < m->num_objects; i++) { | |
1351 | uint32_t pack_int_id = nth_midxed_pack_int_id(m, i); | |
1352 | pack_info[pack_int_id].referenced_objects++; | |
1353 | } | |
1354 | ||
1355 | QSORT(pack_info, m->num_packs, compare_by_mtime); | |
1356 | ||
1357 | total_size = 0; | |
1358 | packs_to_repack = 0; | |
1359 | for (i = 0; total_size < batch_size && i < m->num_packs; i++) { | |
1360 | int pack_int_id = pack_info[i].pack_int_id; | |
1361 | struct packed_git *p = m->packs[pack_int_id]; | |
1362 | size_t expected_size; | |
1363 | ||
1364 | if (!p) | |
1365 | continue; | |
3ce4ca0a DS |
1366 | if (!pack_kept_objects && p->pack_keep) |
1367 | continue; | |
ce1e4a10 DS |
1368 | if (open_pack_index(p) || !p->num_objects) |
1369 | continue; | |
1370 | ||
1371 | expected_size = (size_t)(p->pack_size | |
1372 | * pack_info[i].referenced_objects); | |
1373 | expected_size /= p->num_objects; | |
1374 | ||
1375 | if (expected_size >= batch_size) | |
1376 | continue; | |
1377 | ||
1378 | packs_to_repack++; | |
1379 | total_size += expected_size; | |
1380 | include_pack[pack_int_id] = 1; | |
1381 | } | |
1382 | ||
1383 | free(pack_info); | |
1384 | ||
1eb22c7d | 1385 | if (packs_to_repack < 2) |
ce1e4a10 DS |
1386 | return 1; |
1387 | ||
2af890bb DS |
1388 | return 0; |
1389 | } | |
ce1e4a10 | 1390 | |
efbc3aee | 1391 | int midx_repack(struct repository *r, const char *object_dir, size_t batch_size, unsigned flags) |
ce1e4a10 DS |
1392 | { |
1393 | int result = 0; | |
1394 | uint32_t i; | |
1395 | unsigned char *include_pack; | |
1396 | struct child_process cmd = CHILD_PROCESS_INIT; | |
6af3b00a | 1397 | FILE *cmd_in; |
ce1e4a10 DS |
1398 | struct strbuf base_name = STRBUF_INIT; |
1399 | struct multi_pack_index *m = load_multi_pack_index(object_dir, 1); | |
1400 | ||
e11d86de SLN |
1401 | /* |
1402 | * When updating the default for these configuration | |
1403 | * variables in builtin/repack.c, these must be adjusted | |
1404 | * to match. | |
1405 | */ | |
1406 | int delta_base_offset = 1; | |
1407 | int use_delta_islands = 0; | |
1408 | ||
ce1e4a10 DS |
1409 | if (!m) |
1410 | return 0; | |
1411 | ||
1412 | include_pack = xcalloc(m->num_packs, sizeof(unsigned char)); | |
1413 | ||
1414 | if (batch_size) { | |
1415 | if (fill_included_packs_batch(r, m, include_pack, batch_size)) | |
1416 | goto cleanup; | |
3ce4ca0a | 1417 | } else if (fill_included_packs_all(r, m, include_pack)) |
ce1e4a10 DS |
1418 | goto cleanup; |
1419 | ||
e11d86de SLN |
1420 | repo_config_get_bool(r, "repack.usedeltabaseoffset", &delta_base_offset); |
1421 | repo_config_get_bool(r, "repack.usedeltaislands", &use_delta_islands); | |
1422 | ||
c972bf4c | 1423 | strvec_push(&cmd.args, "pack-objects"); |
ce1e4a10 DS |
1424 | |
1425 | strbuf_addstr(&base_name, object_dir); | |
1426 | strbuf_addstr(&base_name, "/pack/pack"); | |
c972bf4c | 1427 | strvec_push(&cmd.args, base_name.buf); |
64d80e7d | 1428 | |
e11d86de | 1429 | if (delta_base_offset) |
c972bf4c | 1430 | strvec_push(&cmd.args, "--delta-base-offset"); |
e11d86de | 1431 | if (use_delta_islands) |
c972bf4c | 1432 | strvec_push(&cmd.args, "--delta-islands"); |
e11d86de | 1433 | |
64d80e7d | 1434 | if (flags & MIDX_PROGRESS) |
c972bf4c | 1435 | strvec_push(&cmd.args, "--progress"); |
64d80e7d | 1436 | else |
c972bf4c | 1437 | strvec_push(&cmd.args, "-q"); |
64d80e7d | 1438 | |
ce1e4a10 DS |
1439 | strbuf_release(&base_name); |
1440 | ||
1441 | cmd.git_cmd = 1; | |
1442 | cmd.in = cmd.out = -1; | |
1443 | ||
1444 | if (start_command(&cmd)) { | |
1445 | error(_("could not start pack-objects")); | |
1446 | result = 1; | |
1447 | goto cleanup; | |
1448 | } | |
1449 | ||
6af3b00a RS |
1450 | cmd_in = xfdopen(cmd.in, "w"); |
1451 | ||
ce1e4a10 DS |
1452 | for (i = 0; i < m->num_objects; i++) { |
1453 | struct object_id oid; | |
1454 | uint32_t pack_int_id = nth_midxed_pack_int_id(m, i); | |
1455 | ||
1456 | if (!include_pack[pack_int_id]) | |
1457 | continue; | |
1458 | ||
1459 | nth_midxed_object_oid(&oid, m, i); | |
6af3b00a | 1460 | fprintf(cmd_in, "%s\n", oid_to_hex(&oid)); |
ce1e4a10 | 1461 | } |
6af3b00a | 1462 | fclose(cmd_in); |
ce1e4a10 DS |
1463 | |
1464 | if (finish_command(&cmd)) { | |
1465 | error(_("could not finish pack-objects")); | |
1466 | result = 1; | |
1467 | goto cleanup; | |
1468 | } | |
1469 | ||
840cef0c | 1470 | result = write_midx_internal(object_dir, m, NULL, flags); |
ce1e4a10 DS |
1471 | m = NULL; |
1472 | ||
1473 | cleanup: | |
1474 | if (m) | |
1475 | close_midx(m); | |
1476 | free(include_pack); | |
1477 | return result; | |
1478 | } |