]> git.ipfire.org Git - thirdparty/git.git/blame - pack-write.c
pack-write: pass 'struct packing_data' to 'stage_tmp_packfiles'
[thirdparty/git.git] / pack-write.c
CommitLineData
8b0eca7c
DH
1#include "cache.h"
2#include "pack.h"
aa7e44bf 3#include "csum-file.h"
33add2ad 4#include "remote.h"
aa7e44bf 5
ebcfb379
JH
6void reset_pack_idx_option(struct pack_idx_option *opts)
7{
8 memset(opts, 0, sizeof(*opts));
9 opts->version = 2;
10 opts->off32_limit = 0x7fffffff;
11}
aa7e44bf
GB
12
13static int sha1_compare(const void *_a, const void *_b)
14{
15 struct pack_idx_entry *a = *(struct pack_idx_entry **)_a;
16 struct pack_idx_entry *b = *(struct pack_idx_entry **)_b;
e6a492b7 17 return oidcmp(&a->oid, &b->oid);
aa7e44bf
GB
18}
19
3c9fc074
JH
20static int cmp_uint32(const void *a_, const void *b_)
21{
22 uint32_t a = *((uint32_t *)a_);
23 uint32_t b = *((uint32_t *)b_);
24
25 return (a < b) ? -1 : (a != b);
26}
27
fb956c1f
JH
28static int need_large_offset(off_t offset, const struct pack_idx_option *opts)
29{
3c9fc074
JH
30 uint32_t ofsval;
31
32 if ((offset >> 31) || (opts->off32_limit < offset))
33 return 1;
34 if (!opts->anomaly_nr)
35 return 0;
36 ofsval = offset;
37 return !!bsearch(&ofsval, opts->anomaly, opts->anomaly_nr,
38 sizeof(ofsval), cmp_uint32);
fb956c1f
JH
39}
40
aa7e44bf 41/*
e2bfa50a
JB
42 * The *sha1 contains the pack content SHA1 hash.
43 * The objects array passed in will be sorted by SHA1 on exit.
aa7e44bf 44 */
3bb72562 45const char *write_idx_file(const char *index_name, struct pack_idx_entry **objects,
ebcfb379 46 int nr_objects, const struct pack_idx_option *opts,
1190a1ac 47 const unsigned char *sha1)
aa7e44bf 48{
98a3beab 49 struct hashfile *f;
aa7e44bf
GB
50 struct pack_idx_entry **sorted_by_sha, **list, **last;
51 off_t last_obj_offset = 0;
aa7e44bf 52 int i, fd;
aa7e44bf
GB
53 uint32_t index_version;
54
55 if (nr_objects) {
56 sorted_by_sha = objects;
57 list = sorted_by_sha;
58 last = sorted_by_sha + nr_objects;
59 for (i = 0; i < nr_objects; ++i) {
60 if (objects[i]->offset > last_obj_offset)
61 last_obj_offset = objects[i]->offset;
62 }
9ed0d8d6 63 QSORT(sorted_by_sha, nr_objects, sha1_compare);
aa7e44bf
GB
64 }
65 else
66 sorted_by_sha = list = last = NULL;
67
e337a04d
JH
68 if (opts->flags & WRITE_IDX_VERIFY) {
69 assert(index_name);
98a3beab 70 f = hashfd_check(index_name);
aa7e44bf 71 } else {
e337a04d 72 if (!index_name) {
594fa999
JK
73 struct strbuf tmp_file = STRBUF_INIT;
74 fd = odb_mkstemp(&tmp_file, "pack/tmp_idx_XXXXXX");
75 index_name = strbuf_detach(&tmp_file, NULL);
e337a04d
JH
76 } else {
77 unlink(index_name);
66e905b7 78 fd = xopen(index_name, O_CREAT|O_EXCL|O_WRONLY, 0600);
e337a04d 79 }
98a3beab 80 f = hashfd(fd, index_name);
aa7e44bf 81 }
aa7e44bf
GB
82
83 /* if last object's offset is >= 2^31 we should use index V2 */
fb956c1f 84 index_version = need_large_offset(last_obj_offset, opts) ? 2 : opts->version;
aa7e44bf
GB
85
86 /* index versions 2 and above need a header */
87 if (index_version >= 2) {
88 struct pack_idx_header hdr;
89 hdr.idx_signature = htonl(PACK_IDX_SIGNATURE);
90 hdr.idx_version = htonl(index_version);
98a3beab 91 hashwrite(f, &hdr, sizeof(hdr));
aa7e44bf
GB
92 }
93
94 /*
95 * Write the first-level table (the list is sorted,
96 * but we use a 256-entry lookup to be able to avoid
97 * having to do eight extra binary search iterations).
98 */
99 for (i = 0; i < 256; i++) {
100 struct pack_idx_entry **next = list;
101 while (next < last) {
102 struct pack_idx_entry *obj = *next;
e6a492b7 103 if (obj->oid.hash[0] != i)
aa7e44bf
GB
104 break;
105 next++;
106 }
06d43fad 107 hashwrite_be32(f, next - sorted_by_sha);
aa7e44bf
GB
108 list = next;
109 }
aa7e44bf 110
aa7e44bf
GB
111 /*
112 * Write the actual SHA1 entries..
113 */
114 list = sorted_by_sha;
115 for (i = 0; i < nr_objects; i++) {
116 struct pack_idx_entry *obj = *list++;
389cf68c
RS
117 if (index_version < 2)
118 hashwrite_be32(f, obj->offset);
98a3beab 119 hashwrite(f, obj->oid.hash, the_hash_algo->rawsz);
68be2fea 120 if ((opts->flags & WRITE_IDX_STRICT) &&
4a7e27e9 121 (i && oideq(&list[-2]->oid, &obj->oid)))
68be2fea 122 die("The same object %s appears twice in the pack",
e6a492b7 123 oid_to_hex(&obj->oid));
aa7e44bf
GB
124 }
125
126 if (index_version >= 2) {
127 unsigned int nr_large_offset = 0;
128
129 /* write the crc32 table */
130 list = sorted_by_sha;
131 for (i = 0; i < nr_objects; i++) {
132 struct pack_idx_entry *obj = *list++;
389cf68c 133 hashwrite_be32(f, obj->crc32);
aa7e44bf
GB
134 }
135
136 /* write the 32-bit offset table */
137 list = sorted_by_sha;
138 for (i = 0; i < nr_objects; i++) {
139 struct pack_idx_entry *obj = *list++;
fb956c1f
JH
140 uint32_t offset;
141
142 offset = (need_large_offset(obj->offset, opts)
143 ? (0x80000000 | nr_large_offset++)
144 : obj->offset);
389cf68c 145 hashwrite_be32(f, offset);
aa7e44bf
GB
146 }
147
148 /* write the large offset table */
149 list = sorted_by_sha;
150 while (nr_large_offset) {
151 struct pack_idx_entry *obj = *list++;
152 uint64_t offset = obj->offset;
fb956c1f
JH
153
154 if (!need_large_offset(offset, opts))
155 continue;
970909c2 156 hashwrite_be64(f, offset);
fb956c1f 157 nr_large_offset--;
aa7e44bf
GB
158 }
159 }
160
98a3beab 161 hashwrite(f, sha1, the_hash_algo->rawsz);
020406ea
NS
162 finalize_hashfile(f, NULL, FSYNC_COMPONENT_PACK_METADATA,
163 CSUM_HASH_IN_STREAM | CSUM_CLOSE |
164 ((opts->flags & WRITE_IDX_VERIFY) ? 0 : CSUM_FSYNC));
aa7e44bf
GB
165 return index_name;
166}
8b0eca7c 167
8ef50d99
TB
168static int pack_order_cmp(const void *va, const void *vb, void *ctx)
169{
170 struct pack_idx_entry **objects = ctx;
171
172 off_t oa = objects[*(uint32_t*)va]->offset;
173 off_t ob = objects[*(uint32_t*)vb]->offset;
174
175 if (oa < ob)
176 return -1;
177 if (oa > ob)
178 return 1;
179 return 0;
180}
181
182static void write_rev_header(struct hashfile *f)
183{
184 uint32_t oid_version;
185 switch (hash_algo_by_ptr(the_hash_algo)) {
186 case GIT_HASH_SHA1:
187 oid_version = 1;
188 break;
189 case GIT_HASH_SHA256:
190 oid_version = 2;
191 break;
192 default:
193 die("write_rev_header: unknown hash version");
194 }
195
196 hashwrite_be32(f, RIDX_SIGNATURE);
197 hashwrite_be32(f, RIDX_VERSION);
198 hashwrite_be32(f, oid_version);
199}
200
201static void write_rev_index_positions(struct hashfile *f,
a587b5a7 202 uint32_t *pack_order,
8ef50d99
TB
203 uint32_t nr_objects)
204{
8ef50d99 205 uint32_t i;
8ef50d99
TB
206 for (i = 0; i < nr_objects; i++)
207 hashwrite_be32(f, pack_order[i]);
8ef50d99
TB
208}
209
210static void write_rev_trailer(struct hashfile *f, const unsigned char *hash)
211{
212 hashwrite(f, hash, the_hash_algo->rawsz);
213}
214
215const char *write_rev_file(const char *rev_name,
216 struct pack_idx_entry **objects,
217 uint32_t nr_objects,
218 const unsigned char *hash,
219 unsigned flags)
a587b5a7
TB
220{
221 uint32_t *pack_order;
222 uint32_t i;
223 const char *ret;
224
8fe8bae9
ÆAB
225 if (!(flags & WRITE_REV) && !(flags & WRITE_REV_VERIFY))
226 return NULL;
227
a587b5a7
TB
228 ALLOC_ARRAY(pack_order, nr_objects);
229 for (i = 0; i < nr_objects; i++)
230 pack_order[i] = i;
231 QSORT_S(pack_order, nr_objects, pack_order_cmp, objects);
232
233 ret = write_rev_file_order(rev_name, pack_order, nr_objects, hash,
234 flags);
235
236 free(pack_order);
237
238 return ret;
239}
240
241const char *write_rev_file_order(const char *rev_name,
242 uint32_t *pack_order,
243 uint32_t nr_objects,
244 const unsigned char *hash,
245 unsigned flags)
8ef50d99
TB
246{
247 struct hashfile *f;
248 int fd;
249
250 if ((flags & WRITE_REV) && (flags & WRITE_REV_VERIFY))
251 die(_("cannot both write and verify reverse index"));
252
253 if (flags & WRITE_REV) {
254 if (!rev_name) {
255 struct strbuf tmp_file = STRBUF_INIT;
256 fd = odb_mkstemp(&tmp_file, "pack/tmp_rev_XXXXXX");
257 rev_name = strbuf_detach(&tmp_file, NULL);
258 } else {
259 unlink(rev_name);
66e905b7 260 fd = xopen(rev_name, O_CREAT|O_EXCL|O_WRONLY, 0600);
8ef50d99
TB
261 }
262 f = hashfd(fd, rev_name);
263 } else if (flags & WRITE_REV_VERIFY) {
264 struct stat statbuf;
265 if (stat(rev_name, &statbuf)) {
266 if (errno == ENOENT) {
267 /* .rev files are optional */
268 return NULL;
269 } else
270 die_errno(_("could not stat: %s"), rev_name);
271 }
272 f = hashfd_check(rev_name);
273 } else
274 return NULL;
275
276 write_rev_header(f);
277
a587b5a7 278 write_rev_index_positions(f, pack_order, nr_objects);
8ef50d99
TB
279 write_rev_trailer(f, hash);
280
281 if (rev_name && adjust_shared_perm(rev_name) < 0)
282 die(_("failed to make %s readable"), rev_name);
283
020406ea
NS
284 finalize_hashfile(f, NULL, FSYNC_COMPONENT_PACK_METADATA,
285 CSUM_HASH_IN_STREAM | CSUM_CLOSE |
286 ((flags & WRITE_IDX_VERIFY) ? 0 : CSUM_FSYNC));
8ef50d99
TB
287
288 return rev_name;
289}
290
98a3beab 291off_t write_pack_header(struct hashfile *f, uint32_t nr_entries)
c0ad4657
JH
292{
293 struct pack_header hdr;
294
295 hdr.hdr_signature = htonl(PACK_SIGNATURE);
296 hdr.hdr_version = htonl(PACK_VERSION);
297 hdr.hdr_entries = htonl(nr_entries);
98a3beab 298 hashwrite(f, &hdr, sizeof(hdr));
c0ad4657
JH
299 return sizeof(hdr);
300}
301
abeb40e5
NP
302/*
303 * Update pack header with object_count and compute new SHA1 for pack data
304 * associated to pack_fd, and write that SHA1 at the end. That new SHA1
305 * is also returned in new_pack_sha1.
306 *
307 * If partial_pack_sha1 is non null, then the SHA1 of the existing pack
308 * (without the header update) is computed and validated against the
309 * one provided in partial_pack_sha1. The validation is performed at
310 * partial_pack_offset bytes in the pack file. The SHA1 of the remaining
311 * data (i.e. from partial_pack_offset to the end) is then computed and
312 * returned in partial_pack_sha1.
313 *
314 * Note that new_pack_sha1 is updated last, so both new_pack_sha1 and
315 * partial_pack_sha1 can refer to the same buffer if the caller is not
316 * interested in the resulting SHA1 of pack data above partial_pack_offset.
317 */
8b0eca7c 318void fixup_pack_header_footer(int pack_fd,
81c58cd4 319 unsigned char *new_pack_hash,
8b0eca7c 320 const char *pack_name,
abeb40e5 321 uint32_t object_count,
81c58cd4 322 unsigned char *partial_pack_hash,
abeb40e5 323 off_t partial_pack_offset)
8b0eca7c 324{
d35825da 325 int aligned_sz, buf_sz = 8 * 1024;
81c58cd4 326 git_hash_ctx old_hash_ctx, new_hash_ctx;
8b0eca7c
DH
327 struct pack_header hdr;
328 char *buf;
90dca671 329 ssize_t read_result;
8b0eca7c 330
81c58cd4 331 the_hash_algo->init_fn(&old_hash_ctx);
332 the_hash_algo->init_fn(&new_hash_ctx);
abeb40e5 333
8b0eca7c 334 if (lseek(pack_fd, 0, SEEK_SET) != 0)
d824cbba 335 die_errno("Failed seeking to start of '%s'", pack_name);
90dca671
JK
336 read_result = read_in_full(pack_fd, &hdr, sizeof(hdr));
337 if (read_result < 0)
d824cbba 338 die_errno("Unable to reread header of '%s'", pack_name);
90dca671
JK
339 else if (read_result != sizeof(hdr))
340 die_errno("Unexpected short read for header of '%s'",
341 pack_name);
8b0eca7c 342 if (lseek(pack_fd, 0, SEEK_SET) != 0)
d824cbba 343 die_errno("Failed seeking to start of '%s'", pack_name);
81c58cd4 344 the_hash_algo->update_fn(&old_hash_ctx, &hdr, sizeof(hdr));
8b0eca7c 345 hdr.hdr_entries = htonl(object_count);
81c58cd4 346 the_hash_algo->update_fn(&new_hash_ctx, &hdr, sizeof(hdr));
8b0eca7c 347 write_or_die(pack_fd, &hdr, sizeof(hdr));
abeb40e5 348 partial_pack_offset -= sizeof(hdr);
8b0eca7c
DH
349
350 buf = xmalloc(buf_sz);
d35825da 351 aligned_sz = buf_sz - sizeof(hdr);
8b0eca7c 352 for (;;) {
abeb40e5 353 ssize_t m, n;
81c58cd4 354 m = (partial_pack_hash && partial_pack_offset < aligned_sz) ?
d35825da 355 partial_pack_offset : aligned_sz;
abeb40e5 356 n = xread(pack_fd, buf, m);
8b0eca7c
DH
357 if (!n)
358 break;
359 if (n < 0)
d824cbba 360 die_errno("Failed to checksum '%s'", pack_name);
81c58cd4 361 the_hash_algo->update_fn(&new_hash_ctx, buf, n);
abeb40e5 362
d35825da
NP
363 aligned_sz -= n;
364 if (!aligned_sz)
365 aligned_sz = buf_sz;
366
81c58cd4 367 if (!partial_pack_hash)
abeb40e5
NP
368 continue;
369
81c58cd4 370 the_hash_algo->update_fn(&old_hash_ctx, buf, n);
abeb40e5
NP
371 partial_pack_offset -= n;
372 if (partial_pack_offset == 0) {
81c58cd4 373 unsigned char hash[GIT_MAX_RAWSZ];
374 the_hash_algo->final_fn(hash, &old_hash_ctx);
67947c34 375 if (!hasheq(hash, partial_pack_hash))
abeb40e5
NP
376 die("Unexpected checksum for %s "
377 "(disk corruption?)", pack_name);
378 /*
379 * Now let's compute the SHA1 of the remainder of the
380 * pack, which also means making partial_pack_offset
381 * big enough not to matter anymore.
382 */
81c58cd4 383 the_hash_algo->init_fn(&old_hash_ctx);
abeb40e5
NP
384 partial_pack_offset = ~partial_pack_offset;
385 partial_pack_offset -= MSB(partial_pack_offset, 1);
386 }
8b0eca7c
DH
387 }
388 free(buf);
389
81c58cd4 390 if (partial_pack_hash)
391 the_hash_algo->final_fn(partial_pack_hash, &old_hash_ctx);
392 the_hash_algo->final_fn(new_pack_hash, &new_hash_ctx);
393 write_or_die(pack_fd, new_pack_hash, the_hash_algo->rawsz);
020406ea 394 fsync_component_or_die(FSYNC_COMPONENT_PACK, pack_fd, pack_name);
8b0eca7c 395}
106764e6 396
5476e1ef 397char *index_pack_lockfile(int ip_out, int *is_well_formed)
106764e6 398{
81c58cd4 399 char packname[GIT_MAX_HEXSZ + 6];
400 const int len = the_hash_algo->hexsz + 6;
106764e6
SP
401
402 /*
6e180cdc 403 * The first thing we expect from index-pack's output
106764e6
SP
404 * is "pack\t%40s\n" or "keep\t%40s\n" (46 bytes) where
405 * %40s is the newly created pack SHA1 name. In the "keep"
406 * case, we need it to remove the corresponding .keep file
407 * later on. If we don't get that then tough luck with it.
408 */
81c58cd4 409 if (read_in_full(ip_out, packname, len) == len && packname[len-1] == '\n') {
d7731444 410 const char *name;
5476e1ef
JT
411
412 if (is_well_formed)
413 *is_well_formed = 1;
81c58cd4 414 packname[len-1] = 0;
d7731444
RS
415 if (skip_prefix(packname, "keep\t", &name))
416 return xstrfmt("%s/pack/pack-%s.keep",
417 get_object_directory(), name);
5476e1ef 418 return NULL;
106764e6 419 }
5476e1ef
JT
420 if (is_well_formed)
421 *is_well_formed = 0;
106764e6
SP
422 return NULL;
423}
f965c525
NP
424
425/*
426 * The per-object header is a pretty dense thing, which is
427 * - first byte: low four bits are "size", then three bits of "type",
428 * and the high bit is "size continues".
429 * - each byte afterwards: low seven bits are size continuation,
430 * with the high bit being "size continues"
431 */
7202a6fa
JK
432int encode_in_pack_object_header(unsigned char *hdr, int hdr_len,
433 enum object_type type, uintmax_t size)
f965c525
NP
434{
435 int n = 1;
436 unsigned char c;
437
438 if (type < OBJ_COMMIT || type > OBJ_REF_DELTA)
439 die("bad type %d", type);
440
441 c = (type << 4) | (size & 15);
442 size >>= 4;
443 while (size) {
7202a6fa
JK
444 if (n == hdr_len)
445 die("object size is too enormous to format");
f965c525
NP
446 *hdr++ = c | 0x80;
447 c = size & 0x7f;
448 size >>= 7;
449 n++;
450 }
451 *hdr = c;
452 return n;
453}
cdf9db3c 454
98a3beab 455struct hashfile *create_tmp_packfile(char **pack_tmp_name)
cdf9db3c 456{
594fa999 457 struct strbuf tmpname = STRBUF_INIT;
cdf9db3c
JH
458 int fd;
459
594fa999
JK
460 fd = odb_mkstemp(&tmpname, "pack/tmp_pack_XXXXXX");
461 *pack_tmp_name = strbuf_detach(&tmpname, NULL);
98a3beab 462 return hashfd(fd, *pack_tmp_name);
cdf9db3c 463}
0e990530 464
66833f0e
ÆAB
465static void rename_tmp_packfile(struct strbuf *name_prefix, const char *source,
466 const char *ext)
467{
468 size_t name_prefix_len = name_prefix->len;
469
470 strbuf_addstr(name_prefix, ext);
471 if (rename(source, name_prefix->buf))
472 die_errno("unable to rename temporary file to '%s'",
473 name_prefix->buf);
474 strbuf_setlen(name_prefix, name_prefix_len);
475}
476
2ec02dd5
ÆAB
477void rename_tmp_packfile_idx(struct strbuf *name_buffer,
478 char **idx_tmp_name)
479{
480 rename_tmp_packfile(name_buffer, *idx_tmp_name, "idx");
481}
482
483void stage_tmp_packfiles(struct strbuf *name_buffer,
0e990530
JH
484 const char *pack_tmp_name,
485 struct pack_idx_entry **written_list,
486 uint32_t nr_written,
1c573cdd 487 struct packing_data *to_pack,
0e990530 488 struct pack_idx_option *pack_idx_opts,
2ec02dd5
ÆAB
489 unsigned char hash[],
490 char **idx_tmp_name)
0e990530 491{
2ec02dd5 492 const char *rev_tmp_name = NULL;
0e990530
JH
493
494 if (adjust_shared_perm(pack_tmp_name))
495 die_errno("unable to make temporary pack file readable");
496
2ec02dd5
ÆAB
497 *idx_tmp_name = (char *)write_idx_file(NULL, written_list, nr_written,
498 pack_idx_opts, hash);
499 if (adjust_shared_perm(*idx_tmp_name))
0e990530
JH
500 die_errno("unable to make temporary index file readable");
501
8ef50d99
TB
502 rev_tmp_name = write_rev_file(NULL, written_list, nr_written, hash,
503 pack_idx_opts->flags);
504
66833f0e 505 rename_tmp_packfile(name_buffer, pack_tmp_name, "pack");
66833f0e
ÆAB
506 if (rev_tmp_name)
507 rename_tmp_packfile(name_buffer, rev_tmp_name, "rev");
0e990530 508}
33add2ad
CC
509
510void write_promisor_file(const char *promisor_name, struct ref **sought, int nr_sought)
511{
7c99bc23 512 int i, err;
33add2ad
CC
513 FILE *output = xfopen(promisor_name, "w");
514
515 for (i = 0; i < nr_sought; i++)
516 fprintf(output, "%s %s\n", oid_to_hex(&sought[i]->old_oid),
517 sought[i]->name);
7c99bc23
CC
518
519 err = ferror(output);
520 err |= fclose(output);
521 if (err)
522 die(_("could not write '%s' promisor file"), promisor_name);
33add2ad 523}