index-pack: learn about pack index version 2
[git/dscho.git] / index-pack.c
bloba833f640f6bb4e9eb2b876b65644b410b426dbb0
1 #include "cache.h"
2 #include "delta.h"
3 #include "pack.h"
4 #include "csum-file.h"
5 #include "blob.h"
6 #include "commit.h"
7 #include "tag.h"
8 #include "tree.h"
10 static const char index_pack_usage[] =
11 "git-index-pack [-v] [-o <index-file>] [{ ---keep | --keep=<msg> }] { <pack-file> | --stdin [--fix-thin] [<pack-file>] }";
13 struct object_entry
15 off_t offset;
16 unsigned long size;
17 unsigned int hdr_size;
18 uint32_t crc32;
19 enum object_type type;
20 enum object_type real_type;
21 unsigned char sha1[20];
24 union delta_base {
25 unsigned char sha1[20];
26 off_t offset;
30 * Even if sizeof(union delta_base) == 24 on 64-bit archs, we really want
31 * to memcmp() only the first 20 bytes.
33 #define UNION_BASE_SZ 20
35 struct delta_entry
37 union delta_base base;
38 int obj_no;
41 static struct object_entry *objects;
42 static struct delta_entry *deltas;
43 static int nr_objects;
44 static int nr_deltas;
45 static int nr_resolved_deltas;
47 static int from_stdin;
48 static int verbose;
50 static volatile sig_atomic_t progress_update;
52 static void progress_interval(int signum)
54 progress_update = 1;
57 static void setup_progress_signal(void)
59 struct sigaction sa;
60 struct itimerval v;
62 memset(&sa, 0, sizeof(sa));
63 sa.sa_handler = progress_interval;
64 sigemptyset(&sa.sa_mask);
65 sa.sa_flags = SA_RESTART;
66 sigaction(SIGALRM, &sa, NULL);
68 v.it_interval.tv_sec = 1;
69 v.it_interval.tv_usec = 0;
70 v.it_value = v.it_interval;
71 setitimer(ITIMER_REAL, &v, NULL);
75 static unsigned display_progress(unsigned n, unsigned total, unsigned last_pc)
77 unsigned percent = n * 100 / total;
78 if (percent != last_pc || progress_update) {
79 fprintf(stderr, "%4u%% (%u/%u) done\r", percent, n, total);
80 progress_update = 0;
82 return percent;
85 /* We always read in 4kB chunks. */
86 static unsigned char input_buffer[4096];
87 static unsigned int input_offset, input_len;
88 static off_t consumed_bytes;
89 static SHA_CTX input_ctx;
90 static uint32_t input_crc32;
91 static int input_fd, output_fd, pack_fd;
93 /* Discard current buffer used content. */
94 static void flush(void)
96 if (input_offset) {
97 if (output_fd >= 0)
98 write_or_die(output_fd, input_buffer, input_offset);
99 SHA1_Update(&input_ctx, input_buffer, input_offset);
100 memmove(input_buffer, input_buffer + input_offset, input_len);
101 input_offset = 0;
106 * Make sure at least "min" bytes are available in the buffer, and
107 * return the pointer to the buffer.
109 static void *fill(int min)
111 if (min <= input_len)
112 return input_buffer + input_offset;
113 if (min > sizeof(input_buffer))
114 die("cannot fill %d bytes", min);
115 flush();
116 do {
117 int ret = xread(input_fd, input_buffer + input_len,
118 sizeof(input_buffer) - input_len);
119 if (ret <= 0) {
120 if (!ret)
121 die("early EOF");
122 die("read error on input: %s", strerror(errno));
124 input_len += ret;
125 } while (input_len < min);
126 return input_buffer;
129 static void use(int bytes)
131 if (bytes > input_len)
132 die("used more bytes than were available");
133 input_crc32 = crc32(input_crc32, input_buffer + input_offset, bytes);
134 input_len -= bytes;
135 input_offset += bytes;
137 /* make sure off_t is sufficiently large not to wrap */
138 if (consumed_bytes > consumed_bytes + bytes)
139 die("pack too large for current definition of off_t");
140 consumed_bytes += bytes;
143 static const char *open_pack_file(const char *pack_name)
145 if (from_stdin) {
146 input_fd = 0;
147 if (!pack_name) {
148 static char tmpfile[PATH_MAX];
149 snprintf(tmpfile, sizeof(tmpfile),
150 "%s/tmp_pack_XXXXXX", get_object_directory());
151 output_fd = mkstemp(tmpfile);
152 pack_name = xstrdup(tmpfile);
153 } else
154 output_fd = open(pack_name, O_CREAT|O_EXCL|O_RDWR, 0600);
155 if (output_fd < 0)
156 die("unable to create %s: %s\n", pack_name, strerror(errno));
157 pack_fd = output_fd;
158 } else {
159 input_fd = open(pack_name, O_RDONLY);
160 if (input_fd < 0)
161 die("cannot open packfile '%s': %s",
162 pack_name, strerror(errno));
163 output_fd = -1;
164 pack_fd = input_fd;
166 SHA1_Init(&input_ctx);
167 return pack_name;
170 static void parse_pack_header(void)
172 struct pack_header *hdr = fill(sizeof(struct pack_header));
174 /* Header consistency check */
175 if (hdr->hdr_signature != htonl(PACK_SIGNATURE))
176 die("pack signature mismatch");
177 if (!pack_version_ok(hdr->hdr_version))
178 die("pack version %d unsupported", ntohl(hdr->hdr_version));
180 nr_objects = ntohl(hdr->hdr_entries);
181 use(sizeof(struct pack_header));
184 static void bad_object(unsigned long offset, const char *format,
185 ...) NORETURN __attribute__((format (printf, 2, 3)));
187 static void bad_object(unsigned long offset, const char *format, ...)
189 va_list params;
190 char buf[1024];
192 va_start(params, format);
193 vsnprintf(buf, sizeof(buf), format, params);
194 va_end(params);
195 die("pack has bad object at offset %lu: %s", offset, buf);
198 static void *unpack_entry_data(unsigned long offset, unsigned long size)
200 z_stream stream;
201 void *buf = xmalloc(size);
203 memset(&stream, 0, sizeof(stream));
204 stream.next_out = buf;
205 stream.avail_out = size;
206 stream.next_in = fill(1);
207 stream.avail_in = input_len;
208 inflateInit(&stream);
210 for (;;) {
211 int ret = inflate(&stream, 0);
212 use(input_len - stream.avail_in);
213 if (stream.total_out == size && ret == Z_STREAM_END)
214 break;
215 if (ret != Z_OK)
216 bad_object(offset, "inflate returned %d", ret);
217 stream.next_in = fill(1);
218 stream.avail_in = input_len;
220 inflateEnd(&stream);
221 return buf;
224 static void *unpack_raw_entry(struct object_entry *obj, union delta_base *delta_base)
226 unsigned char *p, c;
227 unsigned long size;
228 off_t base_offset;
229 unsigned shift;
230 void *data;
232 obj->offset = consumed_bytes;
233 input_crc32 = crc32(0, Z_NULL, 0);
235 p = fill(1);
236 c = *p;
237 use(1);
238 obj->type = (c >> 4) & 7;
239 size = (c & 15);
240 shift = 4;
241 while (c & 0x80) {
242 p = fill(1);
243 c = *p;
244 use(1);
245 size += (c & 0x7fUL) << shift;
246 shift += 7;
248 obj->size = size;
250 switch (obj->type) {
251 case OBJ_REF_DELTA:
252 hashcpy(delta_base->sha1, fill(20));
253 use(20);
254 break;
255 case OBJ_OFS_DELTA:
256 memset(delta_base, 0, sizeof(*delta_base));
257 p = fill(1);
258 c = *p;
259 use(1);
260 base_offset = c & 127;
261 while (c & 128) {
262 base_offset += 1;
263 if (!base_offset || MSB(base_offset, 7))
264 bad_object(obj->offset, "offset value overflow for delta base object");
265 p = fill(1);
266 c = *p;
267 use(1);
268 base_offset = (base_offset << 7) + (c & 127);
270 delta_base->offset = obj->offset - base_offset;
271 if (delta_base->offset >= obj->offset)
272 bad_object(obj->offset, "delta base offset is out of bound");
273 break;
274 case OBJ_COMMIT:
275 case OBJ_TREE:
276 case OBJ_BLOB:
277 case OBJ_TAG:
278 break;
279 default:
280 bad_object(obj->offset, "unknown object type %d", obj->type);
282 obj->hdr_size = consumed_bytes - obj->offset;
284 data = unpack_entry_data(obj->offset, obj->size);
285 obj->crc32 = input_crc32;
286 return data;
289 static void *get_data_from_pack(struct object_entry *obj)
291 unsigned long from = obj[0].offset + obj[0].hdr_size;
292 unsigned long len = obj[1].offset - from;
293 unsigned long rdy = 0;
294 unsigned char *src, *data;
295 z_stream stream;
296 int st;
298 src = xmalloc(len);
299 data = src;
300 do {
301 ssize_t n = pread(pack_fd, data + rdy, len - rdy, from + rdy);
302 if (n <= 0)
303 die("cannot pread pack file: %s", strerror(errno));
304 rdy += n;
305 } while (rdy < len);
306 data = xmalloc(obj->size);
307 memset(&stream, 0, sizeof(stream));
308 stream.next_out = data;
309 stream.avail_out = obj->size;
310 stream.next_in = src;
311 stream.avail_in = len;
312 inflateInit(&stream);
313 while ((st = inflate(&stream, Z_FINISH)) == Z_OK);
314 inflateEnd(&stream);
315 if (st != Z_STREAM_END || stream.total_out != obj->size)
316 die("serious inflate inconsistency");
317 free(src);
318 return data;
321 static int find_delta(const union delta_base *base)
323 int first = 0, last = nr_deltas;
325 while (first < last) {
326 int next = (first + last) / 2;
327 struct delta_entry *delta = &deltas[next];
328 int cmp;
330 cmp = memcmp(base, &delta->base, UNION_BASE_SZ);
331 if (!cmp)
332 return next;
333 if (cmp < 0) {
334 last = next;
335 continue;
337 first = next+1;
339 return -first-1;
342 static int find_delta_children(const union delta_base *base,
343 int *first_index, int *last_index)
345 int first = find_delta(base);
346 int last = first;
347 int end = nr_deltas - 1;
349 if (first < 0)
350 return -1;
351 while (first > 0 && !memcmp(&deltas[first - 1].base, base, UNION_BASE_SZ))
352 --first;
353 while (last < end && !memcmp(&deltas[last + 1].base, base, UNION_BASE_SZ))
354 ++last;
355 *first_index = first;
356 *last_index = last;
357 return 0;
360 static void sha1_object(const void *data, unsigned long size,
361 enum object_type type, unsigned char *sha1)
363 hash_sha1_file(data, size, typename(type), sha1);
364 if (has_sha1_file(sha1)) {
365 void *has_data;
366 enum object_type has_type;
367 unsigned long has_size;
368 has_data = read_sha1_file(sha1, &has_type, &has_size);
369 if (!has_data)
370 die("cannot read existing object %s", sha1_to_hex(sha1));
371 if (size != has_size || type != has_type ||
372 memcmp(data, has_data, size) != 0)
373 die("SHA1 COLLISION FOUND WITH %s !", sha1_to_hex(sha1));
374 free(has_data);
378 static void resolve_delta(struct object_entry *delta_obj, void *base_data,
379 unsigned long base_size, enum object_type type)
381 void *delta_data;
382 unsigned long delta_size;
383 void *result;
384 unsigned long result_size;
385 union delta_base delta_base;
386 int j, first, last;
388 delta_obj->real_type = type;
389 delta_data = get_data_from_pack(delta_obj);
390 delta_size = delta_obj->size;
391 result = patch_delta(base_data, base_size, delta_data, delta_size,
392 &result_size);
393 free(delta_data);
394 if (!result)
395 bad_object(delta_obj->offset, "failed to apply delta");
396 sha1_object(result, result_size, type, delta_obj->sha1);
397 nr_resolved_deltas++;
399 hashcpy(delta_base.sha1, delta_obj->sha1);
400 if (!find_delta_children(&delta_base, &first, &last)) {
401 for (j = first; j <= last; j++) {
402 struct object_entry *child = objects + deltas[j].obj_no;
403 if (child->real_type == OBJ_REF_DELTA)
404 resolve_delta(child, result, result_size, type);
408 memset(&delta_base, 0, sizeof(delta_base));
409 delta_base.offset = delta_obj->offset;
410 if (!find_delta_children(&delta_base, &first, &last)) {
411 for (j = first; j <= last; j++) {
412 struct object_entry *child = objects + deltas[j].obj_no;
413 if (child->real_type == OBJ_OFS_DELTA)
414 resolve_delta(child, result, result_size, type);
418 free(result);
421 static int compare_delta_entry(const void *a, const void *b)
423 const struct delta_entry *delta_a = a;
424 const struct delta_entry *delta_b = b;
425 return memcmp(&delta_a->base, &delta_b->base, UNION_BASE_SZ);
428 /* Parse all objects and return the pack content SHA1 hash */
429 static void parse_pack_objects(unsigned char *sha1)
431 int i, percent = -1;
432 struct delta_entry *delta = deltas;
433 void *data;
434 struct stat st;
437 * First pass:
438 * - find locations of all objects;
439 * - calculate SHA1 of all non-delta objects;
440 * - remember base (SHA1 or offset) for all deltas.
442 if (verbose)
443 fprintf(stderr, "Indexing %d objects.\n", nr_objects);
444 for (i = 0; i < nr_objects; i++) {
445 struct object_entry *obj = &objects[i];
446 data = unpack_raw_entry(obj, &delta->base);
447 obj->real_type = obj->type;
448 if (obj->type == OBJ_REF_DELTA || obj->type == OBJ_OFS_DELTA) {
449 nr_deltas++;
450 delta->obj_no = i;
451 delta++;
452 } else
453 sha1_object(data, obj->size, obj->type, obj->sha1);
454 free(data);
455 if (verbose)
456 percent = display_progress(i+1, nr_objects, percent);
458 objects[i].offset = consumed_bytes;
459 if (verbose)
460 fputc('\n', stderr);
462 /* Check pack integrity */
463 flush();
464 SHA1_Final(sha1, &input_ctx);
465 if (hashcmp(fill(20), sha1))
466 die("pack is corrupted (SHA1 mismatch)");
467 use(20);
469 /* If input_fd is a file, we should have reached its end now. */
470 if (fstat(input_fd, &st))
471 die("cannot fstat packfile: %s", strerror(errno));
472 if (S_ISREG(st.st_mode) &&
473 lseek(input_fd, 0, SEEK_CUR) - input_len != st.st_size)
474 die("pack has junk at the end");
476 if (!nr_deltas)
477 return;
479 /* Sort deltas by base SHA1/offset for fast searching */
480 qsort(deltas, nr_deltas, sizeof(struct delta_entry),
481 compare_delta_entry);
484 * Second pass:
485 * - for all non-delta objects, look if it is used as a base for
486 * deltas;
487 * - if used as a base, uncompress the object and apply all deltas,
488 * recursively checking if the resulting object is used as a base
489 * for some more deltas.
491 if (verbose)
492 fprintf(stderr, "Resolving %d deltas.\n", nr_deltas);
493 for (i = 0; i < nr_objects; i++) {
494 struct object_entry *obj = &objects[i];
495 union delta_base base;
496 int j, ref, ref_first, ref_last, ofs, ofs_first, ofs_last;
498 if (obj->type == OBJ_REF_DELTA || obj->type == OBJ_OFS_DELTA)
499 continue;
500 hashcpy(base.sha1, obj->sha1);
501 ref = !find_delta_children(&base, &ref_first, &ref_last);
502 memset(&base, 0, sizeof(base));
503 base.offset = obj->offset;
504 ofs = !find_delta_children(&base, &ofs_first, &ofs_last);
505 if (!ref && !ofs)
506 continue;
507 data = get_data_from_pack(obj);
508 if (ref)
509 for (j = ref_first; j <= ref_last; j++) {
510 struct object_entry *child = objects + deltas[j].obj_no;
511 if (child->real_type == OBJ_REF_DELTA)
512 resolve_delta(child, data,
513 obj->size, obj->type);
515 if (ofs)
516 for (j = ofs_first; j <= ofs_last; j++) {
517 struct object_entry *child = objects + deltas[j].obj_no;
518 if (child->real_type == OBJ_OFS_DELTA)
519 resolve_delta(child, data,
520 obj->size, obj->type);
522 free(data);
523 if (verbose)
524 percent = display_progress(nr_resolved_deltas,
525 nr_deltas, percent);
527 if (verbose && nr_resolved_deltas == nr_deltas)
528 fputc('\n', stderr);
531 static int write_compressed(int fd, void *in, unsigned int size, uint32_t *obj_crc)
533 z_stream stream;
534 unsigned long maxsize;
535 void *out;
537 memset(&stream, 0, sizeof(stream));
538 deflateInit(&stream, zlib_compression_level);
539 maxsize = deflateBound(&stream, size);
540 out = xmalloc(maxsize);
542 /* Compress it */
543 stream.next_in = in;
544 stream.avail_in = size;
545 stream.next_out = out;
546 stream.avail_out = maxsize;
547 while (deflate(&stream, Z_FINISH) == Z_OK);
548 deflateEnd(&stream);
550 size = stream.total_out;
551 write_or_die(fd, out, size);
552 *obj_crc = crc32(*obj_crc, out, size);
553 free(out);
554 return size;
557 static void append_obj_to_pack(const unsigned char *sha1, void *buf,
558 unsigned long size, enum object_type type)
560 struct object_entry *obj = &objects[nr_objects++];
561 unsigned char header[10];
562 unsigned long s = size;
563 int n = 0;
564 unsigned char c = (type << 4) | (s & 15);
565 s >>= 4;
566 while (s) {
567 header[n++] = c | 0x80;
568 c = s & 0x7f;
569 s >>= 7;
571 header[n++] = c;
572 write_or_die(output_fd, header, n);
573 obj[0].crc32 = crc32(0, Z_NULL, 0);
574 obj[0].crc32 = crc32(obj[0].crc32, header, n);
575 obj[1].offset = obj[0].offset + n;
576 obj[1].offset += write_compressed(output_fd, buf, size, &obj[0].crc32);
577 hashcpy(obj->sha1, sha1);
580 static int delta_pos_compare(const void *_a, const void *_b)
582 struct delta_entry *a = *(struct delta_entry **)_a;
583 struct delta_entry *b = *(struct delta_entry **)_b;
584 return a->obj_no - b->obj_no;
587 static void fix_unresolved_deltas(int nr_unresolved)
589 struct delta_entry **sorted_by_pos;
590 int i, n = 0, percent = -1;
593 * Since many unresolved deltas may well be themselves base objects
594 * for more unresolved deltas, we really want to include the
595 * smallest number of base objects that would cover as much delta
596 * as possible by picking the
597 * trunc deltas first, allowing for other deltas to resolve without
598 * additional base objects. Since most base objects are to be found
599 * before deltas depending on them, a good heuristic is to start
600 * resolving deltas in the same order as their position in the pack.
602 sorted_by_pos = xmalloc(nr_unresolved * sizeof(*sorted_by_pos));
603 for (i = 0; i < nr_deltas; i++) {
604 if (objects[deltas[i].obj_no].real_type != OBJ_REF_DELTA)
605 continue;
606 sorted_by_pos[n++] = &deltas[i];
608 qsort(sorted_by_pos, n, sizeof(*sorted_by_pos), delta_pos_compare);
610 for (i = 0; i < n; i++) {
611 struct delta_entry *d = sorted_by_pos[i];
612 void *data;
613 unsigned long size;
614 enum object_type type;
615 int j, first, last;
617 if (objects[d->obj_no].real_type != OBJ_REF_DELTA)
618 continue;
619 data = read_sha1_file(d->base.sha1, &type, &size);
620 if (!data)
621 continue;
623 find_delta_children(&d->base, &first, &last);
624 for (j = first; j <= last; j++) {
625 struct object_entry *child = objects + deltas[j].obj_no;
626 if (child->real_type == OBJ_REF_DELTA)
627 resolve_delta(child, data, size, type);
630 if (check_sha1_signature(d->base.sha1, data, size, typename(type)))
631 die("local object %s is corrupt", sha1_to_hex(d->base.sha1));
632 append_obj_to_pack(d->base.sha1, data, size, type);
633 free(data);
634 if (verbose)
635 percent = display_progress(nr_resolved_deltas,
636 nr_deltas, percent);
638 free(sorted_by_pos);
639 if (verbose)
640 fputc('\n', stderr);
643 static void readjust_pack_header_and_sha1(unsigned char *sha1)
645 struct pack_header hdr;
646 SHA_CTX ctx;
647 int size;
649 /* Rewrite pack header with updated object number */
650 if (lseek(output_fd, 0, SEEK_SET) != 0)
651 die("cannot seek back: %s", strerror(errno));
652 if (read_in_full(output_fd, &hdr, sizeof(hdr)) != sizeof(hdr))
653 die("cannot read pack header back: %s", strerror(errno));
654 hdr.hdr_entries = htonl(nr_objects);
655 if (lseek(output_fd, 0, SEEK_SET) != 0)
656 die("cannot seek back: %s", strerror(errno));
657 write_or_die(output_fd, &hdr, sizeof(hdr));
658 if (lseek(output_fd, 0, SEEK_SET) != 0)
659 die("cannot seek back: %s", strerror(errno));
661 /* Recompute and store the new pack's SHA1 */
662 SHA1_Init(&ctx);
663 do {
664 unsigned char *buf[4096];
665 size = xread(output_fd, buf, sizeof(buf));
666 if (size < 0)
667 die("cannot read pack data back: %s", strerror(errno));
668 SHA1_Update(&ctx, buf, size);
669 } while (size > 0);
670 SHA1_Final(sha1, &ctx);
671 write_or_die(output_fd, sha1, 20);
674 static int sha1_compare(const void *_a, const void *_b)
676 struct object_entry *a = *(struct object_entry **)_a;
677 struct object_entry *b = *(struct object_entry **)_b;
678 return hashcmp(a->sha1, b->sha1);
682 * On entry *sha1 contains the pack content SHA1 hash, on exit it is
683 * the SHA1 hash of sorted object names.
685 static const char *write_index_file(const char *index_name, unsigned char *sha1)
687 struct sha1file *f;
688 struct object_entry **sorted_by_sha, **list, **last;
689 uint32_t array[256];
690 int i, fd;
691 SHA_CTX ctx;
692 uint32_t index_version;
694 if (nr_objects) {
695 sorted_by_sha =
696 xcalloc(nr_objects, sizeof(struct object_entry *));
697 list = sorted_by_sha;
698 last = sorted_by_sha + nr_objects;
699 for (i = 0; i < nr_objects; ++i)
700 sorted_by_sha[i] = &objects[i];
701 qsort(sorted_by_sha, nr_objects, sizeof(sorted_by_sha[0]),
702 sha1_compare);
704 else
705 sorted_by_sha = list = last = NULL;
707 if (!index_name) {
708 static char tmpfile[PATH_MAX];
709 snprintf(tmpfile, sizeof(tmpfile),
710 "%s/tmp_idx_XXXXXX", get_object_directory());
711 fd = mkstemp(tmpfile);
712 index_name = xstrdup(tmpfile);
713 } else {
714 unlink(index_name);
715 fd = open(index_name, O_CREAT|O_EXCL|O_WRONLY, 0600);
717 if (fd < 0)
718 die("unable to create %s: %s", index_name, strerror(errno));
719 f = sha1fd(fd, index_name);
721 /* if last object's offset is >= 2^31 we should use index V2 */
722 index_version = (objects[nr_objects-1].offset >> 31) ? 2 : 1;
724 /* index versions 2 and above need a header */
725 if (index_version >= 2) {
726 struct pack_idx_header hdr;
727 hdr.idx_signature = htonl(PACK_IDX_SIGNATURE);
728 hdr.idx_version = htonl(index_version);
729 sha1write(f, &hdr, sizeof(hdr));
733 * Write the first-level table (the list is sorted,
734 * but we use a 256-entry lookup to be able to avoid
735 * having to do eight extra binary search iterations).
737 for (i = 0; i < 256; i++) {
738 struct object_entry **next = list;
739 while (next < last) {
740 struct object_entry *obj = *next;
741 if (obj->sha1[0] != i)
742 break;
743 next++;
745 array[i] = htonl(next - sorted_by_sha);
746 list = next;
748 sha1write(f, array, 256 * 4);
750 /* compute the SHA1 hash of sorted object names. */
751 SHA1_Init(&ctx);
754 * Write the actual SHA1 entries..
756 list = sorted_by_sha;
757 for (i = 0; i < nr_objects; i++) {
758 struct object_entry *obj = *list++;
759 if (index_version < 2) {
760 uint32_t offset = htonl(obj->offset);
761 sha1write(f, &offset, 4);
763 sha1write(f, obj->sha1, 20);
764 SHA1_Update(&ctx, obj->sha1, 20);
767 if (index_version >= 2) {
768 unsigned int nr_large_offset = 0;
770 /* write the crc32 table */
771 list = sorted_by_sha;
772 for (i = 0; i < nr_objects; i++) {
773 struct object_entry *obj = *list++;
774 uint32_t crc32_val = htonl(obj->crc32);
775 sha1write(f, &crc32_val, 4);
778 /* write the 32-bit offset table */
779 list = sorted_by_sha;
780 for (i = 0; i < nr_objects; i++) {
781 struct object_entry *obj = *list++;
782 uint32_t offset = (obj->offset <= 0x7fffffff) ?
783 obj->offset : (0x80000000 | nr_large_offset++);
784 offset = htonl(offset);
785 sha1write(f, &offset, 4);
788 /* write the large offset table */
789 list = sorted_by_sha;
790 while (nr_large_offset) {
791 struct object_entry *obj = *list++;
792 uint64_t offset = obj->offset;
793 if (offset > 0x7fffffff) {
794 uint32_t split[2];
795 split[0] = htonl(offset >> 32);
796 split[1] = htonl(offset & 0xffffffff);
797 sha1write(f, split, 8);
798 nr_large_offset--;
803 sha1write(f, sha1, 20);
804 sha1close(f, NULL, 1);
805 free(sorted_by_sha);
806 SHA1_Final(sha1, &ctx);
807 return index_name;
810 static void final(const char *final_pack_name, const char *curr_pack_name,
811 const char *final_index_name, const char *curr_index_name,
812 const char *keep_name, const char *keep_msg,
813 unsigned char *sha1)
815 const char *report = "pack";
816 char name[PATH_MAX];
817 int err;
819 if (!from_stdin) {
820 close(input_fd);
821 } else {
822 err = close(output_fd);
823 if (err)
824 die("error while closing pack file: %s", strerror(errno));
825 chmod(curr_pack_name, 0444);
828 if (keep_msg) {
829 int keep_fd, keep_msg_len = strlen(keep_msg);
830 if (!keep_name) {
831 snprintf(name, sizeof(name), "%s/pack/pack-%s.keep",
832 get_object_directory(), sha1_to_hex(sha1));
833 keep_name = name;
835 keep_fd = open(keep_name, O_RDWR|O_CREAT|O_EXCL, 0600);
836 if (keep_fd < 0) {
837 if (errno != EEXIST)
838 die("cannot write keep file");
839 } else {
840 if (keep_msg_len > 0) {
841 write_or_die(keep_fd, keep_msg, keep_msg_len);
842 write_or_die(keep_fd, "\n", 1);
844 close(keep_fd);
845 report = "keep";
849 if (final_pack_name != curr_pack_name) {
850 if (!final_pack_name) {
851 snprintf(name, sizeof(name), "%s/pack/pack-%s.pack",
852 get_object_directory(), sha1_to_hex(sha1));
853 final_pack_name = name;
855 if (move_temp_to_file(curr_pack_name, final_pack_name))
856 die("cannot store pack file");
859 chmod(curr_index_name, 0444);
860 if (final_index_name != curr_index_name) {
861 if (!final_index_name) {
862 snprintf(name, sizeof(name), "%s/pack/pack-%s.idx",
863 get_object_directory(), sha1_to_hex(sha1));
864 final_index_name = name;
866 if (move_temp_to_file(curr_index_name, final_index_name))
867 die("cannot store index file");
870 if (!from_stdin) {
871 printf("%s\n", sha1_to_hex(sha1));
872 } else {
873 char buf[48];
874 int len = snprintf(buf, sizeof(buf), "%s\t%s\n",
875 report, sha1_to_hex(sha1));
876 write_or_die(1, buf, len);
879 * Let's just mimic git-unpack-objects here and write
880 * the last part of the input buffer to stdout.
882 while (input_len) {
883 err = xwrite(1, input_buffer + input_offset, input_len);
884 if (err <= 0)
885 break;
886 input_len -= err;
887 input_offset += err;
892 int main(int argc, char **argv)
894 int i, fix_thin_pack = 0;
895 const char *curr_pack, *pack_name = NULL;
896 const char *curr_index, *index_name = NULL;
897 const char *keep_name = NULL, *keep_msg = NULL;
898 char *index_name_buf = NULL, *keep_name_buf = NULL;
899 unsigned char sha1[20];
901 for (i = 1; i < argc; i++) {
902 const char *arg = argv[i];
904 if (*arg == '-') {
905 if (!strcmp(arg, "--stdin")) {
906 from_stdin = 1;
907 } else if (!strcmp(arg, "--fix-thin")) {
908 fix_thin_pack = 1;
909 } else if (!strcmp(arg, "--keep")) {
910 keep_msg = "";
911 } else if (!prefixcmp(arg, "--keep=")) {
912 keep_msg = arg + 7;
913 } else if (!prefixcmp(arg, "--pack_header=")) {
914 struct pack_header *hdr;
915 char *c;
917 hdr = (struct pack_header *)input_buffer;
918 hdr->hdr_signature = htonl(PACK_SIGNATURE);
919 hdr->hdr_version = htonl(strtoul(arg + 14, &c, 10));
920 if (*c != ',')
921 die("bad %s", arg);
922 hdr->hdr_entries = htonl(strtoul(c + 1, &c, 10));
923 if (*c)
924 die("bad %s", arg);
925 input_len = sizeof(*hdr);
926 } else if (!strcmp(arg, "-v")) {
927 verbose = 1;
928 } else if (!strcmp(arg, "-o")) {
929 if (index_name || (i+1) >= argc)
930 usage(index_pack_usage);
931 index_name = argv[++i];
932 } else
933 usage(index_pack_usage);
934 continue;
937 if (pack_name)
938 usage(index_pack_usage);
939 pack_name = arg;
942 if (!pack_name && !from_stdin)
943 usage(index_pack_usage);
944 if (fix_thin_pack && !from_stdin)
945 die("--fix-thin cannot be used without --stdin");
946 if (!index_name && pack_name) {
947 int len = strlen(pack_name);
948 if (!has_extension(pack_name, ".pack"))
949 die("packfile name '%s' does not end with '.pack'",
950 pack_name);
951 index_name_buf = xmalloc(len);
952 memcpy(index_name_buf, pack_name, len - 5);
953 strcpy(index_name_buf + len - 5, ".idx");
954 index_name = index_name_buf;
956 if (keep_msg && !keep_name && pack_name) {
957 int len = strlen(pack_name);
958 if (!has_extension(pack_name, ".pack"))
959 die("packfile name '%s' does not end with '.pack'",
960 pack_name);
961 keep_name_buf = xmalloc(len);
962 memcpy(keep_name_buf, pack_name, len - 5);
963 strcpy(keep_name_buf + len - 5, ".keep");
964 keep_name = keep_name_buf;
967 curr_pack = open_pack_file(pack_name);
968 parse_pack_header();
969 objects = xmalloc((nr_objects + 1) * sizeof(struct object_entry));
970 deltas = xmalloc(nr_objects * sizeof(struct delta_entry));
971 if (verbose)
972 setup_progress_signal();
973 parse_pack_objects(sha1);
974 if (nr_deltas != nr_resolved_deltas) {
975 if (fix_thin_pack) {
976 int nr_unresolved = nr_deltas - nr_resolved_deltas;
977 int nr_objects_initial = nr_objects;
978 if (nr_unresolved <= 0)
979 die("confusion beyond insanity");
980 objects = xrealloc(objects,
981 (nr_objects + nr_unresolved + 1)
982 * sizeof(*objects));
983 fix_unresolved_deltas(nr_unresolved);
984 if (verbose)
985 fprintf(stderr, "%d objects were added to complete this thin pack.\n",
986 nr_objects - nr_objects_initial);
987 readjust_pack_header_and_sha1(sha1);
989 if (nr_deltas != nr_resolved_deltas)
990 die("pack has %d unresolved deltas",
991 nr_deltas - nr_resolved_deltas);
992 } else {
993 /* Flush remaining pack final 20-byte SHA1. */
994 flush();
996 free(deltas);
997 curr_index = write_index_file(index_name, sha1);
998 final(pack_name, curr_pack,
999 index_name, curr_index,
1000 keep_name, keep_msg,
1001 sha1);
1002 free(objects);
1003 free(index_name_buf);
1004 free(keep_name_buf);
1006 return 0;