treewide: remove cache.h inclusion due to object-file.h changes
[alt-git.git] / pack-write.c
blobd9b460fab4c858a5c848e781edeaf982c37b6528
1 #include "git-compat-util.h"
2 #include "environment.h"
3 #include "gettext.h"
4 #include "hex.h"
5 #include "pack.h"
6 #include "csum-file.h"
7 #include "remote.h"
8 #include "chunk-format.h"
9 #include "pack-mtimes.h"
10 #include "oidmap.h"
11 #include "pack-objects.h"
12 #include "pack-revindex.h"
14 void reset_pack_idx_option(struct pack_idx_option *opts)
16 memset(opts, 0, sizeof(*opts));
17 opts->version = 2;
18 opts->off32_limit = 0x7fffffff;
21 static int sha1_compare(const void *_a, const void *_b)
23 struct pack_idx_entry *a = *(struct pack_idx_entry **)_a;
24 struct pack_idx_entry *b = *(struct pack_idx_entry **)_b;
25 return oidcmp(&a->oid, &b->oid);
28 static int cmp_uint32(const void *a_, const void *b_)
30 uint32_t a = *((uint32_t *)a_);
31 uint32_t b = *((uint32_t *)b_);
33 return (a < b) ? -1 : (a != b);
36 static int need_large_offset(off_t offset, const struct pack_idx_option *opts)
38 uint32_t ofsval;
40 if ((offset >> 31) || (opts->off32_limit < offset))
41 return 1;
42 if (!opts->anomaly_nr)
43 return 0;
44 ofsval = offset;
45 return !!bsearch(&ofsval, opts->anomaly, opts->anomaly_nr,
46 sizeof(ofsval), cmp_uint32);
50 * The *sha1 contains the pack content SHA1 hash.
51 * The objects array passed in will be sorted by SHA1 on exit.
53 const char *write_idx_file(const char *index_name, struct pack_idx_entry **objects,
54 int nr_objects, const struct pack_idx_option *opts,
55 const unsigned char *sha1)
57 struct hashfile *f;
58 struct pack_idx_entry **sorted_by_sha, **list, **last;
59 off_t last_obj_offset = 0;
60 int i, fd;
61 uint32_t index_version;
63 if (nr_objects) {
64 sorted_by_sha = objects;
65 list = sorted_by_sha;
66 last = sorted_by_sha + nr_objects;
67 for (i = 0; i < nr_objects; ++i) {
68 if (objects[i]->offset > last_obj_offset)
69 last_obj_offset = objects[i]->offset;
71 QSORT(sorted_by_sha, nr_objects, sha1_compare);
73 else
74 sorted_by_sha = list = last = NULL;
76 if (opts->flags & WRITE_IDX_VERIFY) {
77 assert(index_name);
78 f = hashfd_check(index_name);
79 } else {
80 if (!index_name) {
81 struct strbuf tmp_file = STRBUF_INIT;
82 fd = odb_mkstemp(&tmp_file, "pack/tmp_idx_XXXXXX");
83 index_name = strbuf_detach(&tmp_file, NULL);
84 } else {
85 unlink(index_name);
86 fd = xopen(index_name, O_CREAT|O_EXCL|O_WRONLY, 0600);
88 f = hashfd(fd, index_name);
91 /* if last object's offset is >= 2^31 we should use index V2 */
92 index_version = need_large_offset(last_obj_offset, opts) ? 2 : opts->version;
94 /* index versions 2 and above need a header */
95 if (index_version >= 2) {
96 struct pack_idx_header hdr;
97 hdr.idx_signature = htonl(PACK_IDX_SIGNATURE);
98 hdr.idx_version = htonl(index_version);
99 hashwrite(f, &hdr, sizeof(hdr));
103 * Write the first-level table (the list is sorted,
104 * but we use a 256-entry lookup to be able to avoid
105 * having to do eight extra binary search iterations).
107 for (i = 0; i < 256; i++) {
108 struct pack_idx_entry **next = list;
109 while (next < last) {
110 struct pack_idx_entry *obj = *next;
111 if (obj->oid.hash[0] != i)
112 break;
113 next++;
115 hashwrite_be32(f, next - sorted_by_sha);
116 list = next;
120 * Write the actual SHA1 entries..
122 list = sorted_by_sha;
123 for (i = 0; i < nr_objects; i++) {
124 struct pack_idx_entry *obj = *list++;
125 if (index_version < 2)
126 hashwrite_be32(f, obj->offset);
127 hashwrite(f, obj->oid.hash, the_hash_algo->rawsz);
128 if ((opts->flags & WRITE_IDX_STRICT) &&
129 (i && oideq(&list[-2]->oid, &obj->oid)))
130 die("The same object %s appears twice in the pack",
131 oid_to_hex(&obj->oid));
134 if (index_version >= 2) {
135 unsigned int nr_large_offset = 0;
137 /* write the crc32 table */
138 list = sorted_by_sha;
139 for (i = 0; i < nr_objects; i++) {
140 struct pack_idx_entry *obj = *list++;
141 hashwrite_be32(f, obj->crc32);
144 /* write the 32-bit offset table */
145 list = sorted_by_sha;
146 for (i = 0; i < nr_objects; i++) {
147 struct pack_idx_entry *obj = *list++;
148 uint32_t offset;
150 offset = (need_large_offset(obj->offset, opts)
151 ? (0x80000000 | nr_large_offset++)
152 : obj->offset);
153 hashwrite_be32(f, offset);
156 /* write the large offset table */
157 list = sorted_by_sha;
158 while (nr_large_offset) {
159 struct pack_idx_entry *obj = *list++;
160 uint64_t offset = obj->offset;
162 if (!need_large_offset(offset, opts))
163 continue;
164 hashwrite_be64(f, offset);
165 nr_large_offset--;
169 hashwrite(f, sha1, the_hash_algo->rawsz);
170 finalize_hashfile(f, NULL, FSYNC_COMPONENT_PACK_METADATA,
171 CSUM_HASH_IN_STREAM | CSUM_CLOSE |
172 ((opts->flags & WRITE_IDX_VERIFY) ? 0 : CSUM_FSYNC));
173 return index_name;
176 static int pack_order_cmp(const void *va, const void *vb, void *ctx)
178 struct pack_idx_entry **objects = ctx;
180 off_t oa = objects[*(uint32_t*)va]->offset;
181 off_t ob = objects[*(uint32_t*)vb]->offset;
183 if (oa < ob)
184 return -1;
185 if (oa > ob)
186 return 1;
187 return 0;
190 static void write_rev_header(struct hashfile *f)
192 hashwrite_be32(f, RIDX_SIGNATURE);
193 hashwrite_be32(f, RIDX_VERSION);
194 hashwrite_be32(f, oid_version(the_hash_algo));
197 static void write_rev_index_positions(struct hashfile *f,
198 uint32_t *pack_order,
199 uint32_t nr_objects)
201 uint32_t i;
202 for (i = 0; i < nr_objects; i++)
203 hashwrite_be32(f, pack_order[i]);
206 static void write_rev_trailer(struct hashfile *f, const unsigned char *hash)
208 hashwrite(f, hash, the_hash_algo->rawsz);
211 const char *write_rev_file(const char *rev_name,
212 struct pack_idx_entry **objects,
213 uint32_t nr_objects,
214 const unsigned char *hash,
215 unsigned flags)
217 uint32_t *pack_order;
218 uint32_t i;
219 const char *ret;
221 if (!(flags & WRITE_REV) && !(flags & WRITE_REV_VERIFY))
222 return NULL;
224 ALLOC_ARRAY(pack_order, nr_objects);
225 for (i = 0; i < nr_objects; i++)
226 pack_order[i] = i;
227 QSORT_S(pack_order, nr_objects, pack_order_cmp, objects);
229 ret = write_rev_file_order(rev_name, pack_order, nr_objects, hash,
230 flags);
232 free(pack_order);
234 return ret;
237 const char *write_rev_file_order(const char *rev_name,
238 uint32_t *pack_order,
239 uint32_t nr_objects,
240 const unsigned char *hash,
241 unsigned flags)
243 struct hashfile *f;
244 int fd;
246 if ((flags & WRITE_REV) && (flags & WRITE_REV_VERIFY))
247 die(_("cannot both write and verify reverse index"));
249 if (flags & WRITE_REV) {
250 if (!rev_name) {
251 struct strbuf tmp_file = STRBUF_INIT;
252 fd = odb_mkstemp(&tmp_file, "pack/tmp_rev_XXXXXX");
253 rev_name = strbuf_detach(&tmp_file, NULL);
254 } else {
255 unlink(rev_name);
256 fd = xopen(rev_name, O_CREAT|O_EXCL|O_WRONLY, 0600);
258 f = hashfd(fd, rev_name);
259 } else if (flags & WRITE_REV_VERIFY) {
260 struct stat statbuf;
261 if (stat(rev_name, &statbuf)) {
262 if (errno == ENOENT) {
263 /* .rev files are optional */
264 return NULL;
265 } else
266 die_errno(_("could not stat: %s"), rev_name);
268 f = hashfd_check(rev_name);
269 } else
270 return NULL;
272 write_rev_header(f);
274 write_rev_index_positions(f, pack_order, nr_objects);
275 write_rev_trailer(f, hash);
277 if (rev_name && adjust_shared_perm(rev_name) < 0)
278 die(_("failed to make %s readable"), rev_name);
280 finalize_hashfile(f, NULL, FSYNC_COMPONENT_PACK_METADATA,
281 CSUM_HASH_IN_STREAM | CSUM_CLOSE |
282 ((flags & WRITE_IDX_VERIFY) ? 0 : CSUM_FSYNC));
284 return rev_name;
287 static void write_mtimes_header(struct hashfile *f)
289 hashwrite_be32(f, MTIMES_SIGNATURE);
290 hashwrite_be32(f, MTIMES_VERSION);
291 hashwrite_be32(f, oid_version(the_hash_algo));
295 * Writes the object mtimes of "objects" for use in a .mtimes file.
296 * Note that objects must be in lexicographic (index) order, which is
297 * the expected ordering of these values in the .mtimes file.
299 static void write_mtimes_objects(struct hashfile *f,
300 struct packing_data *to_pack,
301 struct pack_idx_entry **objects,
302 uint32_t nr_objects)
304 uint32_t i;
305 for (i = 0; i < nr_objects; i++) {
306 struct object_entry *e = (struct object_entry*)objects[i];
307 hashwrite_be32(f, oe_cruft_mtime(to_pack, e));
311 static void write_mtimes_trailer(struct hashfile *f, const unsigned char *hash)
313 hashwrite(f, hash, the_hash_algo->rawsz);
316 static const char *write_mtimes_file(struct packing_data *to_pack,
317 struct pack_idx_entry **objects,
318 uint32_t nr_objects,
319 const unsigned char *hash)
321 struct strbuf tmp_file = STRBUF_INIT;
322 const char *mtimes_name;
323 struct hashfile *f;
324 int fd;
326 if (!to_pack)
327 BUG("cannot call write_mtimes_file with NULL packing_data");
329 fd = odb_mkstemp(&tmp_file, "pack/tmp_mtimes_XXXXXX");
330 mtimes_name = strbuf_detach(&tmp_file, NULL);
331 f = hashfd(fd, mtimes_name);
333 write_mtimes_header(f);
334 write_mtimes_objects(f, to_pack, objects, nr_objects);
335 write_mtimes_trailer(f, hash);
337 if (adjust_shared_perm(mtimes_name) < 0)
338 die(_("failed to make %s readable"), mtimes_name);
340 finalize_hashfile(f, NULL, FSYNC_COMPONENT_PACK_METADATA,
341 CSUM_HASH_IN_STREAM | CSUM_CLOSE | CSUM_FSYNC);
343 return mtimes_name;
346 off_t write_pack_header(struct hashfile *f, uint32_t nr_entries)
348 struct pack_header hdr;
350 hdr.hdr_signature = htonl(PACK_SIGNATURE);
351 hdr.hdr_version = htonl(PACK_VERSION);
352 hdr.hdr_entries = htonl(nr_entries);
353 hashwrite(f, &hdr, sizeof(hdr));
354 return sizeof(hdr);
358 * Update pack header with object_count and compute new SHA1 for pack data
359 * associated to pack_fd, and write that SHA1 at the end. That new SHA1
360 * is also returned in new_pack_sha1.
362 * If partial_pack_sha1 is non null, then the SHA1 of the existing pack
363 * (without the header update) is computed and validated against the
364 * one provided in partial_pack_sha1. The validation is performed at
365 * partial_pack_offset bytes in the pack file. The SHA1 of the remaining
366 * data (i.e. from partial_pack_offset to the end) is then computed and
367 * returned in partial_pack_sha1.
369 * Note that new_pack_sha1 is updated last, so both new_pack_sha1 and
370 * partial_pack_sha1 can refer to the same buffer if the caller is not
371 * interested in the resulting SHA1 of pack data above partial_pack_offset.
373 void fixup_pack_header_footer(int pack_fd,
374 unsigned char *new_pack_hash,
375 const char *pack_name,
376 uint32_t object_count,
377 unsigned char *partial_pack_hash,
378 off_t partial_pack_offset)
380 int aligned_sz, buf_sz = 8 * 1024;
381 git_hash_ctx old_hash_ctx, new_hash_ctx;
382 struct pack_header hdr;
383 char *buf;
384 ssize_t read_result;
386 the_hash_algo->init_fn(&old_hash_ctx);
387 the_hash_algo->init_fn(&new_hash_ctx);
389 if (lseek(pack_fd, 0, SEEK_SET) != 0)
390 die_errno("Failed seeking to start of '%s'", pack_name);
391 read_result = read_in_full(pack_fd, &hdr, sizeof(hdr));
392 if (read_result < 0)
393 die_errno("Unable to reread header of '%s'", pack_name);
394 else if (read_result != sizeof(hdr))
395 die_errno("Unexpected short read for header of '%s'",
396 pack_name);
397 if (lseek(pack_fd, 0, SEEK_SET) != 0)
398 die_errno("Failed seeking to start of '%s'", pack_name);
399 the_hash_algo->update_fn(&old_hash_ctx, &hdr, sizeof(hdr));
400 hdr.hdr_entries = htonl(object_count);
401 the_hash_algo->update_fn(&new_hash_ctx, &hdr, sizeof(hdr));
402 write_or_die(pack_fd, &hdr, sizeof(hdr));
403 partial_pack_offset -= sizeof(hdr);
405 buf = xmalloc(buf_sz);
406 aligned_sz = buf_sz - sizeof(hdr);
407 for (;;) {
408 ssize_t m, n;
409 m = (partial_pack_hash && partial_pack_offset < aligned_sz) ?
410 partial_pack_offset : aligned_sz;
411 n = xread(pack_fd, buf, m);
412 if (!n)
413 break;
414 if (n < 0)
415 die_errno("Failed to checksum '%s'", pack_name);
416 the_hash_algo->update_fn(&new_hash_ctx, buf, n);
418 aligned_sz -= n;
419 if (!aligned_sz)
420 aligned_sz = buf_sz;
422 if (!partial_pack_hash)
423 continue;
425 the_hash_algo->update_fn(&old_hash_ctx, buf, n);
426 partial_pack_offset -= n;
427 if (partial_pack_offset == 0) {
428 unsigned char hash[GIT_MAX_RAWSZ];
429 the_hash_algo->final_fn(hash, &old_hash_ctx);
430 if (!hasheq(hash, partial_pack_hash))
431 die("Unexpected checksum for %s "
432 "(disk corruption?)", pack_name);
434 * Now let's compute the SHA1 of the remainder of the
435 * pack, which also means making partial_pack_offset
436 * big enough not to matter anymore.
438 the_hash_algo->init_fn(&old_hash_ctx);
439 partial_pack_offset = ~partial_pack_offset;
440 partial_pack_offset -= MSB(partial_pack_offset, 1);
443 free(buf);
445 if (partial_pack_hash)
446 the_hash_algo->final_fn(partial_pack_hash, &old_hash_ctx);
447 the_hash_algo->final_fn(new_pack_hash, &new_hash_ctx);
448 write_or_die(pack_fd, new_pack_hash, the_hash_algo->rawsz);
449 fsync_component_or_die(FSYNC_COMPONENT_PACK, pack_fd, pack_name);
452 char *index_pack_lockfile(int ip_out, int *is_well_formed)
454 char packname[GIT_MAX_HEXSZ + 6];
455 const int len = the_hash_algo->hexsz + 6;
458 * The first thing we expect from index-pack's output
459 * is "pack\t%40s\n" or "keep\t%40s\n" (46 bytes) where
460 * %40s is the newly created pack SHA1 name. In the "keep"
461 * case, we need it to remove the corresponding .keep file
462 * later on. If we don't get that then tough luck with it.
464 if (read_in_full(ip_out, packname, len) == len && packname[len-1] == '\n') {
465 const char *name;
467 if (is_well_formed)
468 *is_well_formed = 1;
469 packname[len-1] = 0;
470 if (skip_prefix(packname, "keep\t", &name))
471 return xstrfmt("%s/pack/pack-%s.keep",
472 get_object_directory(), name);
473 return NULL;
475 if (is_well_formed)
476 *is_well_formed = 0;
477 return NULL;
481 * The per-object header is a pretty dense thing, which is
482 * - first byte: low four bits are "size", then three bits of "type",
483 * and the high bit is "size continues".
484 * - each byte afterwards: low seven bits are size continuation,
485 * with the high bit being "size continues"
487 int encode_in_pack_object_header(unsigned char *hdr, int hdr_len,
488 enum object_type type, uintmax_t size)
490 int n = 1;
491 unsigned char c;
493 if (type < OBJ_COMMIT || type > OBJ_REF_DELTA)
494 die("bad type %d", type);
496 c = (type << 4) | (size & 15);
497 size >>= 4;
498 while (size) {
499 if (n == hdr_len)
500 die("object size is too enormous to format");
501 *hdr++ = c | 0x80;
502 c = size & 0x7f;
503 size >>= 7;
504 n++;
506 *hdr = c;
507 return n;
510 struct hashfile *create_tmp_packfile(char **pack_tmp_name)
512 struct strbuf tmpname = STRBUF_INIT;
513 int fd;
515 fd = odb_mkstemp(&tmpname, "pack/tmp_pack_XXXXXX");
516 *pack_tmp_name = strbuf_detach(&tmpname, NULL);
517 return hashfd(fd, *pack_tmp_name);
520 static void rename_tmp_packfile(struct strbuf *name_prefix, const char *source,
521 const char *ext)
523 size_t name_prefix_len = name_prefix->len;
525 strbuf_addstr(name_prefix, ext);
526 if (rename(source, name_prefix->buf))
527 die_errno("unable to rename temporary file to '%s'",
528 name_prefix->buf);
529 strbuf_setlen(name_prefix, name_prefix_len);
532 void rename_tmp_packfile_idx(struct strbuf *name_buffer,
533 char **idx_tmp_name)
535 rename_tmp_packfile(name_buffer, *idx_tmp_name, "idx");
538 void stage_tmp_packfiles(struct strbuf *name_buffer,
539 const char *pack_tmp_name,
540 struct pack_idx_entry **written_list,
541 uint32_t nr_written,
542 struct packing_data *to_pack,
543 struct pack_idx_option *pack_idx_opts,
544 unsigned char hash[],
545 char **idx_tmp_name)
547 const char *rev_tmp_name = NULL;
548 const char *mtimes_tmp_name = NULL;
550 if (adjust_shared_perm(pack_tmp_name))
551 die_errno("unable to make temporary pack file readable");
553 *idx_tmp_name = (char *)write_idx_file(NULL, written_list, nr_written,
554 pack_idx_opts, hash);
555 if (adjust_shared_perm(*idx_tmp_name))
556 die_errno("unable to make temporary index file readable");
558 rev_tmp_name = write_rev_file(NULL, written_list, nr_written, hash,
559 pack_idx_opts->flags);
561 if (pack_idx_opts->flags & WRITE_MTIMES) {
562 mtimes_tmp_name = write_mtimes_file(to_pack, written_list,
563 nr_written,
564 hash);
567 rename_tmp_packfile(name_buffer, pack_tmp_name, "pack");
568 if (rev_tmp_name)
569 rename_tmp_packfile(name_buffer, rev_tmp_name, "rev");
570 if (mtimes_tmp_name)
571 rename_tmp_packfile(name_buffer, mtimes_tmp_name, "mtimes");
574 void write_promisor_file(const char *promisor_name, struct ref **sought, int nr_sought)
576 int i, err;
577 FILE *output = xfopen(promisor_name, "w");
579 for (i = 0; i < nr_sought; i++)
580 fprintf(output, "%s %s\n", oid_to_hex(&sought[i]->old_oid),
581 sought[i]->name);
583 err = ferror(output);
584 err |= fclose(output);
585 if (err)
586 die(_("could not write '%s' promisor file"), promisor_name);