]> git.ipfire.org Git - thirdparty/git.git/blame - pack-write.c
Git 2.32
[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);
78 fd = open(index_name, O_CREAT|O_EXCL|O_WRONLY, 0600);
892e723a
JK
79 if (fd < 0)
80 die_errno("unable to create '%s'", index_name);
e337a04d 81 }
98a3beab 82 f = hashfd(fd, index_name);
aa7e44bf 83 }
aa7e44bf
GB
84
85 /* if last object's offset is >= 2^31 we should use index V2 */
fb956c1f 86 index_version = need_large_offset(last_obj_offset, opts) ? 2 : opts->version;
aa7e44bf
GB
87
88 /* index versions 2 and above need a header */
89 if (index_version >= 2) {
90 struct pack_idx_header hdr;
91 hdr.idx_signature = htonl(PACK_IDX_SIGNATURE);
92 hdr.idx_version = htonl(index_version);
98a3beab 93 hashwrite(f, &hdr, sizeof(hdr));
aa7e44bf
GB
94 }
95
96 /*
97 * Write the first-level table (the list is sorted,
98 * but we use a 256-entry lookup to be able to avoid
99 * having to do eight extra binary search iterations).
100 */
101 for (i = 0; i < 256; i++) {
102 struct pack_idx_entry **next = list;
103 while (next < last) {
104 struct pack_idx_entry *obj = *next;
e6a492b7 105 if (obj->oid.hash[0] != i)
aa7e44bf
GB
106 break;
107 next++;
108 }
06d43fad 109 hashwrite_be32(f, next - sorted_by_sha);
aa7e44bf
GB
110 list = next;
111 }
aa7e44bf 112
aa7e44bf
GB
113 /*
114 * Write the actual SHA1 entries..
115 */
116 list = sorted_by_sha;
117 for (i = 0; i < nr_objects; i++) {
118 struct pack_idx_entry *obj = *list++;
389cf68c
RS
119 if (index_version < 2)
120 hashwrite_be32(f, obj->offset);
98a3beab 121 hashwrite(f, obj->oid.hash, the_hash_algo->rawsz);
68be2fea 122 if ((opts->flags & WRITE_IDX_STRICT) &&
4a7e27e9 123 (i && oideq(&list[-2]->oid, &obj->oid)))
68be2fea 124 die("The same object %s appears twice in the pack",
e6a492b7 125 oid_to_hex(&obj->oid));
aa7e44bf
GB
126 }
127
128 if (index_version >= 2) {
129 unsigned int nr_large_offset = 0;
130
131 /* write the crc32 table */
132 list = sorted_by_sha;
133 for (i = 0; i < nr_objects; i++) {
134 struct pack_idx_entry *obj = *list++;
389cf68c 135 hashwrite_be32(f, obj->crc32);
aa7e44bf
GB
136 }
137
138 /* write the 32-bit offset table */
139 list = sorted_by_sha;
140 for (i = 0; i < nr_objects; i++) {
141 struct pack_idx_entry *obj = *list++;
fb956c1f
JH
142 uint32_t offset;
143
144 offset = (need_large_offset(obj->offset, opts)
145 ? (0x80000000 | nr_large_offset++)
146 : obj->offset);
389cf68c 147 hashwrite_be32(f, offset);
aa7e44bf
GB
148 }
149
150 /* write the large offset table */
151 list = sorted_by_sha;
152 while (nr_large_offset) {
153 struct pack_idx_entry *obj = *list++;
154 uint64_t offset = obj->offset;
fb956c1f
JH
155
156 if (!need_large_offset(offset, opts))
157 continue;
970909c2 158 hashwrite_be64(f, offset);
fb956c1f 159 nr_large_offset--;
aa7e44bf
GB
160 }
161 }
162
98a3beab 163 hashwrite(f, sha1, the_hash_algo->rawsz);
cfe83216
DS
164 finalize_hashfile(f, NULL, CSUM_HASH_IN_STREAM | CSUM_CLOSE |
165 ((opts->flags & WRITE_IDX_VERIFY)
166 ? 0 : CSUM_FSYNC));
aa7e44bf
GB
167 return index_name;
168}
8b0eca7c 169
8ef50d99
TB
170static int pack_order_cmp(const void *va, const void *vb, void *ctx)
171{
172 struct pack_idx_entry **objects = ctx;
173
174 off_t oa = objects[*(uint32_t*)va]->offset;
175 off_t ob = objects[*(uint32_t*)vb]->offset;
176
177 if (oa < ob)
178 return -1;
179 if (oa > ob)
180 return 1;
181 return 0;
182}
183
184static void write_rev_header(struct hashfile *f)
185{
186 uint32_t oid_version;
187 switch (hash_algo_by_ptr(the_hash_algo)) {
188 case GIT_HASH_SHA1:
189 oid_version = 1;
190 break;
191 case GIT_HASH_SHA256:
192 oid_version = 2;
193 break;
194 default:
195 die("write_rev_header: unknown hash version");
196 }
197
198 hashwrite_be32(f, RIDX_SIGNATURE);
199 hashwrite_be32(f, RIDX_VERSION);
200 hashwrite_be32(f, oid_version);
201}
202
203static void write_rev_index_positions(struct hashfile *f,
a587b5a7 204 uint32_t *pack_order,
8ef50d99
TB
205 uint32_t nr_objects)
206{
8ef50d99 207 uint32_t i;
8ef50d99
TB
208 for (i = 0; i < nr_objects; i++)
209 hashwrite_be32(f, pack_order[i]);
8ef50d99
TB
210}
211
212static void write_rev_trailer(struct hashfile *f, const unsigned char *hash)
213{
214 hashwrite(f, hash, the_hash_algo->rawsz);
215}
216
217const char *write_rev_file(const char *rev_name,
218 struct pack_idx_entry **objects,
219 uint32_t nr_objects,
220 const unsigned char *hash,
221 unsigned flags)
a587b5a7
TB
222{
223 uint32_t *pack_order;
224 uint32_t i;
225 const char *ret;
226
227 ALLOC_ARRAY(pack_order, nr_objects);
228 for (i = 0; i < nr_objects; i++)
229 pack_order[i] = i;
230 QSORT_S(pack_order, nr_objects, pack_order_cmp, objects);
231
232 ret = write_rev_file_order(rev_name, pack_order, nr_objects, hash,
233 flags);
234
235 free(pack_order);
236
237 return ret;
238}
239
240const char *write_rev_file_order(const char *rev_name,
241 uint32_t *pack_order,
242 uint32_t nr_objects,
243 const unsigned char *hash,
244 unsigned flags)
8ef50d99
TB
245{
246 struct hashfile *f;
247 int fd;
248
249 if ((flags & WRITE_REV) && (flags & WRITE_REV_VERIFY))
250 die(_("cannot both write and verify reverse index"));
251
252 if (flags & WRITE_REV) {
253 if (!rev_name) {
254 struct strbuf tmp_file = STRBUF_INIT;
255 fd = odb_mkstemp(&tmp_file, "pack/tmp_rev_XXXXXX");
256 rev_name = strbuf_detach(&tmp_file, NULL);
257 } else {
258 unlink(rev_name);
259 fd = open(rev_name, O_CREAT|O_EXCL|O_WRONLY, 0600);
260 if (fd < 0)
261 die_errno("unable to create '%s'", rev_name);
262 }
263 f = hashfd(fd, rev_name);
264 } else if (flags & WRITE_REV_VERIFY) {
265 struct stat statbuf;
266 if (stat(rev_name, &statbuf)) {
267 if (errno == ENOENT) {
268 /* .rev files are optional */
269 return NULL;
270 } else
271 die_errno(_("could not stat: %s"), rev_name);
272 }
273 f = hashfd_check(rev_name);
274 } else
275 return NULL;
276
277 write_rev_header(f);
278
a587b5a7 279 write_rev_index_positions(f, pack_order, nr_objects);
8ef50d99
TB
280 write_rev_trailer(f, hash);
281
282 if (rev_name && adjust_shared_perm(rev_name) < 0)
283 die(_("failed to make %s readable"), rev_name);
284
285 finalize_hashfile(f, NULL, CSUM_HASH_IN_STREAM | CSUM_CLOSE |
286 ((flags & WRITE_IDX_VERIFY) ? 0 : CSUM_FSYNC));
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);
0c68d386 394 fsync_or_die(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
58892711 465void finish_tmp_packfile(struct strbuf *name_buffer,
0e990530
JH
466 const char *pack_tmp_name,
467 struct pack_idx_entry **written_list,
468 uint32_t nr_written,
469 struct pack_idx_option *pack_idx_opts,
894c0f66 470 unsigned char hash[])
0e990530 471{
8ef50d99 472 const char *idx_tmp_name, *rev_tmp_name = NULL;
58892711 473 int basename_len = name_buffer->len;
0e990530
JH
474
475 if (adjust_shared_perm(pack_tmp_name))
476 die_errno("unable to make temporary pack file readable");
477
478 idx_tmp_name = write_idx_file(NULL, written_list, nr_written,
894c0f66 479 pack_idx_opts, hash);
0e990530
JH
480 if (adjust_shared_perm(idx_tmp_name))
481 die_errno("unable to make temporary index file readable");
482
8ef50d99
TB
483 rev_tmp_name = write_rev_file(NULL, written_list, nr_written, hash,
484 pack_idx_opts->flags);
485
894c0f66 486 strbuf_addf(name_buffer, "%s.pack", hash_to_hex(hash));
0e990530 487
58892711 488 if (rename(pack_tmp_name, name_buffer->buf))
0e990530
JH
489 die_errno("unable to rename temporary pack file");
490
58892711
SH
491 strbuf_setlen(name_buffer, basename_len);
492
894c0f66 493 strbuf_addf(name_buffer, "%s.idx", hash_to_hex(hash));
58892711 494 if (rename(idx_tmp_name, name_buffer->buf))
0e990530
JH
495 die_errno("unable to rename temporary index file");
496
58892711 497 strbuf_setlen(name_buffer, basename_len);
7cc8f971 498
8ef50d99
TB
499 if (rev_tmp_name) {
500 strbuf_addf(name_buffer, "%s.rev", hash_to_hex(hash));
501 if (rename(rev_tmp_name, name_buffer->buf))
502 die_errno("unable to rename temporary reverse-index file");
503 }
504
505 strbuf_setlen(name_buffer, basename_len);
506
0e990530
JH
507 free((void *)idx_tmp_name);
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}