Documentation/gitprotocol-v2.txt: fix a slight inconsistency in format
[git/gitster.git] / pack-write.c
blob336372974872882a235598d254c876e31c49b24a
1 #include "cache.h"
2 #include "pack.h"
3 #include "csum-file.h"
4 #include "remote.h"
5 #include "chunk-format.h"
6 #include "pack-mtimes.h"
7 #include "oidmap.h"
8 #include "pack-objects.h"
10 void reset_pack_idx_option(struct pack_idx_option *opts)
12 memset(opts, 0, sizeof(*opts));
13 opts->version = 2;
14 opts->off32_limit = 0x7fffffff;
17 static int sha1_compare(const void *_a, const void *_b)
19 struct pack_idx_entry *a = *(struct pack_idx_entry **)_a;
20 struct pack_idx_entry *b = *(struct pack_idx_entry **)_b;
21 return oidcmp(&a->oid, &b->oid);
24 static int cmp_uint32(const void *a_, const void *b_)
26 uint32_t a = *((uint32_t *)a_);
27 uint32_t b = *((uint32_t *)b_);
29 return (a < b) ? -1 : (a != b);
32 static int need_large_offset(off_t offset, const struct pack_idx_option *opts)
34 uint32_t ofsval;
36 if ((offset >> 31) || (opts->off32_limit < offset))
37 return 1;
38 if (!opts->anomaly_nr)
39 return 0;
40 ofsval = offset;
41 return !!bsearch(&ofsval, opts->anomaly, opts->anomaly_nr,
42 sizeof(ofsval), cmp_uint32);
46 * The *sha1 contains the pack content SHA1 hash.
47 * The objects array passed in will be sorted by SHA1 on exit.
49 const char *write_idx_file(const char *index_name, struct pack_idx_entry **objects,
50 int nr_objects, const struct pack_idx_option *opts,
51 const unsigned char *sha1)
53 struct hashfile *f;
54 struct pack_idx_entry **sorted_by_sha, **list, **last;
55 off_t last_obj_offset = 0;
56 int i, fd;
57 uint32_t index_version;
59 if (nr_objects) {
60 sorted_by_sha = objects;
61 list = sorted_by_sha;
62 last = sorted_by_sha + nr_objects;
63 for (i = 0; i < nr_objects; ++i) {
64 if (objects[i]->offset > last_obj_offset)
65 last_obj_offset = objects[i]->offset;
67 QSORT(sorted_by_sha, nr_objects, sha1_compare);
69 else
70 sorted_by_sha = list = last = NULL;
72 if (opts->flags & WRITE_IDX_VERIFY) {
73 assert(index_name);
74 f = hashfd_check(index_name);
75 } else {
76 if (!index_name) {
77 struct strbuf tmp_file = STRBUF_INIT;
78 fd = odb_mkstemp(&tmp_file, "pack/tmp_idx_XXXXXX");
79 index_name = strbuf_detach(&tmp_file, NULL);
80 } else {
81 unlink(index_name);
82 fd = xopen(index_name, O_CREAT|O_EXCL|O_WRONLY, 0600);
84 f = hashfd(fd, index_name);
87 /* if last object's offset is >= 2^31 we should use index V2 */
88 index_version = need_large_offset(last_obj_offset, opts) ? 2 : opts->version;
90 /* index versions 2 and above need a header */
91 if (index_version >= 2) {
92 struct pack_idx_header hdr;
93 hdr.idx_signature = htonl(PACK_IDX_SIGNATURE);
94 hdr.idx_version = htonl(index_version);
95 hashwrite(f, &hdr, sizeof(hdr));
99 * Write the first-level table (the list is sorted,
100 * but we use a 256-entry lookup to be able to avoid
101 * having to do eight extra binary search iterations).
103 for (i = 0; i < 256; i++) {
104 struct pack_idx_entry **next = list;
105 while (next < last) {
106 struct pack_idx_entry *obj = *next;
107 if (obj->oid.hash[0] != i)
108 break;
109 next++;
111 hashwrite_be32(f, next - sorted_by_sha);
112 list = next;
116 * Write the actual SHA1 entries..
118 list = sorted_by_sha;
119 for (i = 0; i < nr_objects; i++) {
120 struct pack_idx_entry *obj = *list++;
121 if (index_version < 2)
122 hashwrite_be32(f, obj->offset);
123 hashwrite(f, obj->oid.hash, the_hash_algo->rawsz);
124 if ((opts->flags & WRITE_IDX_STRICT) &&
125 (i && oideq(&list[-2]->oid, &obj->oid)))
126 die("The same object %s appears twice in the pack",
127 oid_to_hex(&obj->oid));
130 if (index_version >= 2) {
131 unsigned int nr_large_offset = 0;
133 /* write the crc32 table */
134 list = sorted_by_sha;
135 for (i = 0; i < nr_objects; i++) {
136 struct pack_idx_entry *obj = *list++;
137 hashwrite_be32(f, obj->crc32);
140 /* write the 32-bit offset table */
141 list = sorted_by_sha;
142 for (i = 0; i < nr_objects; i++) {
143 struct pack_idx_entry *obj = *list++;
144 uint32_t offset;
146 offset = (need_large_offset(obj->offset, opts)
147 ? (0x80000000 | nr_large_offset++)
148 : obj->offset);
149 hashwrite_be32(f, offset);
152 /* write the large offset table */
153 list = sorted_by_sha;
154 while (nr_large_offset) {
155 struct pack_idx_entry *obj = *list++;
156 uint64_t offset = obj->offset;
158 if (!need_large_offset(offset, opts))
159 continue;
160 hashwrite_be64(f, offset);
161 nr_large_offset--;
165 hashwrite(f, sha1, the_hash_algo->rawsz);
166 finalize_hashfile(f, NULL, FSYNC_COMPONENT_PACK_METADATA,
167 CSUM_HASH_IN_STREAM | CSUM_CLOSE |
168 ((opts->flags & WRITE_IDX_VERIFY) ? 0 : CSUM_FSYNC));
169 return index_name;
172 static int pack_order_cmp(const void *va, const void *vb, void *ctx)
174 struct pack_idx_entry **objects = ctx;
176 off_t oa = objects[*(uint32_t*)va]->offset;
177 off_t ob = objects[*(uint32_t*)vb]->offset;
179 if (oa < ob)
180 return -1;
181 if (oa > ob)
182 return 1;
183 return 0;
186 static void write_rev_header(struct hashfile *f)
188 hashwrite_be32(f, RIDX_SIGNATURE);
189 hashwrite_be32(f, RIDX_VERSION);
190 hashwrite_be32(f, oid_version(the_hash_algo));
193 static void write_rev_index_positions(struct hashfile *f,
194 uint32_t *pack_order,
195 uint32_t nr_objects)
197 uint32_t i;
198 for (i = 0; i < nr_objects; i++)
199 hashwrite_be32(f, pack_order[i]);
202 static void write_rev_trailer(struct hashfile *f, const unsigned char *hash)
204 hashwrite(f, hash, the_hash_algo->rawsz);
207 const char *write_rev_file(const char *rev_name,
208 struct pack_idx_entry **objects,
209 uint32_t nr_objects,
210 const unsigned char *hash,
211 unsigned flags)
213 uint32_t *pack_order;
214 uint32_t i;
215 const char *ret;
217 if (!(flags & WRITE_REV) && !(flags & WRITE_REV_VERIFY))
218 return NULL;
220 ALLOC_ARRAY(pack_order, nr_objects);
221 for (i = 0; i < nr_objects; i++)
222 pack_order[i] = i;
223 QSORT_S(pack_order, nr_objects, pack_order_cmp, objects);
225 ret = write_rev_file_order(rev_name, pack_order, nr_objects, hash,
226 flags);
228 free(pack_order);
230 return ret;
233 const char *write_rev_file_order(const char *rev_name,
234 uint32_t *pack_order,
235 uint32_t nr_objects,
236 const unsigned char *hash,
237 unsigned flags)
239 struct hashfile *f;
240 int fd;
242 if ((flags & WRITE_REV) && (flags & WRITE_REV_VERIFY))
243 die(_("cannot both write and verify reverse index"));
245 if (flags & WRITE_REV) {
246 if (!rev_name) {
247 struct strbuf tmp_file = STRBUF_INIT;
248 fd = odb_mkstemp(&tmp_file, "pack/tmp_rev_XXXXXX");
249 rev_name = strbuf_detach(&tmp_file, NULL);
250 } else {
251 unlink(rev_name);
252 fd = xopen(rev_name, O_CREAT|O_EXCL|O_WRONLY, 0600);
254 f = hashfd(fd, rev_name);
255 } else if (flags & WRITE_REV_VERIFY) {
256 struct stat statbuf;
257 if (stat(rev_name, &statbuf)) {
258 if (errno == ENOENT) {
259 /* .rev files are optional */
260 return NULL;
261 } else
262 die_errno(_("could not stat: %s"), rev_name);
264 f = hashfd_check(rev_name);
265 } else
266 return NULL;
268 write_rev_header(f);
270 write_rev_index_positions(f, pack_order, nr_objects);
271 write_rev_trailer(f, hash);
273 if (rev_name && adjust_shared_perm(rev_name) < 0)
274 die(_("failed to make %s readable"), rev_name);
276 finalize_hashfile(f, NULL, FSYNC_COMPONENT_PACK_METADATA,
277 CSUM_HASH_IN_STREAM | CSUM_CLOSE |
278 ((flags & WRITE_IDX_VERIFY) ? 0 : CSUM_FSYNC));
280 return rev_name;
283 static void write_mtimes_header(struct hashfile *f)
285 hashwrite_be32(f, MTIMES_SIGNATURE);
286 hashwrite_be32(f, MTIMES_VERSION);
287 hashwrite_be32(f, oid_version(the_hash_algo));
291 * Writes the object mtimes of "objects" for use in a .mtimes file.
292 * Note that objects must be in lexicographic (index) order, which is
293 * the expected ordering of these values in the .mtimes file.
295 static void write_mtimes_objects(struct hashfile *f,
296 struct packing_data *to_pack,
297 struct pack_idx_entry **objects,
298 uint32_t nr_objects)
300 uint32_t i;
301 for (i = 0; i < nr_objects; i++) {
302 struct object_entry *e = (struct object_entry*)objects[i];
303 hashwrite_be32(f, oe_cruft_mtime(to_pack, e));
307 static void write_mtimes_trailer(struct hashfile *f, const unsigned char *hash)
309 hashwrite(f, hash, the_hash_algo->rawsz);
312 static const char *write_mtimes_file(struct packing_data *to_pack,
313 struct pack_idx_entry **objects,
314 uint32_t nr_objects,
315 const unsigned char *hash)
317 struct strbuf tmp_file = STRBUF_INIT;
318 const char *mtimes_name;
319 struct hashfile *f;
320 int fd;
322 if (!to_pack)
323 BUG("cannot call write_mtimes_file with NULL packing_data");
325 fd = odb_mkstemp(&tmp_file, "pack/tmp_mtimes_XXXXXX");
326 mtimes_name = strbuf_detach(&tmp_file, NULL);
327 f = hashfd(fd, mtimes_name);
329 write_mtimes_header(f);
330 write_mtimes_objects(f, to_pack, objects, nr_objects);
331 write_mtimes_trailer(f, hash);
333 if (adjust_shared_perm(mtimes_name) < 0)
334 die(_("failed to make %s readable"), mtimes_name);
336 finalize_hashfile(f, NULL, FSYNC_COMPONENT_PACK_METADATA,
337 CSUM_HASH_IN_STREAM | CSUM_CLOSE | CSUM_FSYNC);
339 return mtimes_name;
342 off_t write_pack_header(struct hashfile *f, uint32_t nr_entries)
344 struct pack_header hdr;
346 hdr.hdr_signature = htonl(PACK_SIGNATURE);
347 hdr.hdr_version = htonl(PACK_VERSION);
348 hdr.hdr_entries = htonl(nr_entries);
349 hashwrite(f, &hdr, sizeof(hdr));
350 return sizeof(hdr);
354 * Update pack header with object_count and compute new SHA1 for pack data
355 * associated to pack_fd, and write that SHA1 at the end. That new SHA1
356 * is also returned in new_pack_sha1.
358 * If partial_pack_sha1 is non null, then the SHA1 of the existing pack
359 * (without the header update) is computed and validated against the
360 * one provided in partial_pack_sha1. The validation is performed at
361 * partial_pack_offset bytes in the pack file. The SHA1 of the remaining
362 * data (i.e. from partial_pack_offset to the end) is then computed and
363 * returned in partial_pack_sha1.
365 * Note that new_pack_sha1 is updated last, so both new_pack_sha1 and
366 * partial_pack_sha1 can refer to the same buffer if the caller is not
367 * interested in the resulting SHA1 of pack data above partial_pack_offset.
369 void fixup_pack_header_footer(int pack_fd,
370 unsigned char *new_pack_hash,
371 const char *pack_name,
372 uint32_t object_count,
373 unsigned char *partial_pack_hash,
374 off_t partial_pack_offset)
376 int aligned_sz, buf_sz = 8 * 1024;
377 git_hash_ctx old_hash_ctx, new_hash_ctx;
378 struct pack_header hdr;
379 char *buf;
380 ssize_t read_result;
382 the_hash_algo->init_fn(&old_hash_ctx);
383 the_hash_algo->init_fn(&new_hash_ctx);
385 if (lseek(pack_fd, 0, SEEK_SET) != 0)
386 die_errno("Failed seeking to start of '%s'", pack_name);
387 read_result = read_in_full(pack_fd, &hdr, sizeof(hdr));
388 if (read_result < 0)
389 die_errno("Unable to reread header of '%s'", pack_name);
390 else if (read_result != sizeof(hdr))
391 die_errno("Unexpected short read for header of '%s'",
392 pack_name);
393 if (lseek(pack_fd, 0, SEEK_SET) != 0)
394 die_errno("Failed seeking to start of '%s'", pack_name);
395 the_hash_algo->update_fn(&old_hash_ctx, &hdr, sizeof(hdr));
396 hdr.hdr_entries = htonl(object_count);
397 the_hash_algo->update_fn(&new_hash_ctx, &hdr, sizeof(hdr));
398 write_or_die(pack_fd, &hdr, sizeof(hdr));
399 partial_pack_offset -= sizeof(hdr);
401 buf = xmalloc(buf_sz);
402 aligned_sz = buf_sz - sizeof(hdr);
403 for (;;) {
404 ssize_t m, n;
405 m = (partial_pack_hash && partial_pack_offset < aligned_sz) ?
406 partial_pack_offset : aligned_sz;
407 n = xread(pack_fd, buf, m);
408 if (!n)
409 break;
410 if (n < 0)
411 die_errno("Failed to checksum '%s'", pack_name);
412 the_hash_algo->update_fn(&new_hash_ctx, buf, n);
414 aligned_sz -= n;
415 if (!aligned_sz)
416 aligned_sz = buf_sz;
418 if (!partial_pack_hash)
419 continue;
421 the_hash_algo->update_fn(&old_hash_ctx, buf, n);
422 partial_pack_offset -= n;
423 if (partial_pack_offset == 0) {
424 unsigned char hash[GIT_MAX_RAWSZ];
425 the_hash_algo->final_fn(hash, &old_hash_ctx);
426 if (!hasheq(hash, partial_pack_hash))
427 die("Unexpected checksum for %s "
428 "(disk corruption?)", pack_name);
430 * Now let's compute the SHA1 of the remainder of the
431 * pack, which also means making partial_pack_offset
432 * big enough not to matter anymore.
434 the_hash_algo->init_fn(&old_hash_ctx);
435 partial_pack_offset = ~partial_pack_offset;
436 partial_pack_offset -= MSB(partial_pack_offset, 1);
439 free(buf);
441 if (partial_pack_hash)
442 the_hash_algo->final_fn(partial_pack_hash, &old_hash_ctx);
443 the_hash_algo->final_fn(new_pack_hash, &new_hash_ctx);
444 write_or_die(pack_fd, new_pack_hash, the_hash_algo->rawsz);
445 fsync_component_or_die(FSYNC_COMPONENT_PACK, pack_fd, pack_name);
448 char *index_pack_lockfile(int ip_out, int *is_well_formed)
450 char packname[GIT_MAX_HEXSZ + 6];
451 const int len = the_hash_algo->hexsz + 6;
454 * The first thing we expect from index-pack's output
455 * is "pack\t%40s\n" or "keep\t%40s\n" (46 bytes) where
456 * %40s is the newly created pack SHA1 name. In the "keep"
457 * case, we need it to remove the corresponding .keep file
458 * later on. If we don't get that then tough luck with it.
460 if (read_in_full(ip_out, packname, len) == len && packname[len-1] == '\n') {
461 const char *name;
463 if (is_well_formed)
464 *is_well_formed = 1;
465 packname[len-1] = 0;
466 if (skip_prefix(packname, "keep\t", &name))
467 return xstrfmt("%s/pack/pack-%s.keep",
468 get_object_directory(), name);
469 return NULL;
471 if (is_well_formed)
472 *is_well_formed = 0;
473 return NULL;
477 * The per-object header is a pretty dense thing, which is
478 * - first byte: low four bits are "size", then three bits of "type",
479 * and the high bit is "size continues".
480 * - each byte afterwards: low seven bits are size continuation,
481 * with the high bit being "size continues"
483 int encode_in_pack_object_header(unsigned char *hdr, int hdr_len,
484 enum object_type type, uintmax_t size)
486 int n = 1;
487 unsigned char c;
489 if (type < OBJ_COMMIT || type > OBJ_REF_DELTA)
490 die("bad type %d", type);
492 c = (type << 4) | (size & 15);
493 size >>= 4;
494 while (size) {
495 if (n == hdr_len)
496 die("object size is too enormous to format");
497 *hdr++ = c | 0x80;
498 c = size & 0x7f;
499 size >>= 7;
500 n++;
502 *hdr = c;
503 return n;
506 struct hashfile *create_tmp_packfile(char **pack_tmp_name)
508 struct strbuf tmpname = STRBUF_INIT;
509 int fd;
511 fd = odb_mkstemp(&tmpname, "pack/tmp_pack_XXXXXX");
512 *pack_tmp_name = strbuf_detach(&tmpname, NULL);
513 return hashfd(fd, *pack_tmp_name);
516 static void rename_tmp_packfile(struct strbuf *name_prefix, const char *source,
517 const char *ext)
519 size_t name_prefix_len = name_prefix->len;
521 strbuf_addstr(name_prefix, ext);
522 if (rename(source, name_prefix->buf))
523 die_errno("unable to rename temporary file to '%s'",
524 name_prefix->buf);
525 strbuf_setlen(name_prefix, name_prefix_len);
528 void rename_tmp_packfile_idx(struct strbuf *name_buffer,
529 char **idx_tmp_name)
531 rename_tmp_packfile(name_buffer, *idx_tmp_name, "idx");
534 void stage_tmp_packfiles(struct strbuf *name_buffer,
535 const char *pack_tmp_name,
536 struct pack_idx_entry **written_list,
537 uint32_t nr_written,
538 struct packing_data *to_pack,
539 struct pack_idx_option *pack_idx_opts,
540 unsigned char hash[],
541 char **idx_tmp_name)
543 const char *rev_tmp_name = NULL;
544 const char *mtimes_tmp_name = NULL;
546 if (adjust_shared_perm(pack_tmp_name))
547 die_errno("unable to make temporary pack file readable");
549 *idx_tmp_name = (char *)write_idx_file(NULL, written_list, nr_written,
550 pack_idx_opts, hash);
551 if (adjust_shared_perm(*idx_tmp_name))
552 die_errno("unable to make temporary index file readable");
554 rev_tmp_name = write_rev_file(NULL, written_list, nr_written, hash,
555 pack_idx_opts->flags);
557 if (pack_idx_opts->flags & WRITE_MTIMES) {
558 mtimes_tmp_name = write_mtimes_file(to_pack, written_list,
559 nr_written,
560 hash);
563 rename_tmp_packfile(name_buffer, pack_tmp_name, "pack");
564 if (rev_tmp_name)
565 rename_tmp_packfile(name_buffer, rev_tmp_name, "rev");
566 if (mtimes_tmp_name)
567 rename_tmp_packfile(name_buffer, mtimes_tmp_name, "mtimes");
570 void write_promisor_file(const char *promisor_name, struct ref **sought, int nr_sought)
572 int i, err;
573 FILE *output = xfopen(promisor_name, "w");
575 for (i = 0; i < nr_sought; i++)
576 fprintf(output, "%s %s\n", oid_to_hex(&sought[i]->old_oid),
577 sought[i]->name);
579 err = ferror(output);
580 err |= fclose(output);
581 if (err)
582 die(_("could not write '%s' promisor file"), promisor_name);