11 #include "pack-revindex.h"
12 #include "csum-file.h"
13 #include "tree-walk.h"
16 #include "list-objects.h"
17 #include "pack-objects.h"
20 #include "streaming.h"
21 #include "thread-utils.h"
22 #include "pack-bitmap.h"
24 static const char *pack_usage
[] = {
25 N_("git pack-objects --stdout [options...] [< ref-list | < object-list]"),
26 N_("git pack-objects [options...] base-name [< ref-list | < object-list]"),
31 * Objects we are going to pack are collected in the `to_pack` structure.
32 * It contains an array (dynamically expanded) of the object data, and a map
33 * that can resolve SHA1s to their position in the array.
35 static struct packing_data to_pack
;
37 static struct pack_idx_entry
**written_list
;
38 static uint32_t nr_result
, nr_written
;
41 static int reuse_delta
= 1, reuse_object
= 1;
42 static int keep_unreachable
, unpack_unreachable
, include_tag
;
43 static unsigned long unpack_unreachable_expiration
;
45 static int incremental
;
46 static int ignore_packed_keep
;
47 static int allow_ofs_delta
;
48 static struct pack_idx_option pack_idx_opts
;
49 static const char *base_name
;
50 static int progress
= 1;
51 static int window
= 10;
52 static unsigned long pack_size_limit
;
53 static int depth
= 50;
54 static int delta_search_threads
;
55 static int pack_to_stdout
;
56 static int num_preferred_base
;
57 static struct progress
*progress_state
;
58 static int pack_compression_level
= Z_DEFAULT_COMPRESSION
;
59 static int pack_compression_seen
;
61 static struct packed_git
*reuse_packfile
;
62 static uint32_t reuse_packfile_objects
;
63 static off_t reuse_packfile_offset
;
65 static int use_bitmap_index
= 1;
67 static unsigned long delta_cache_size
= 0;
68 static unsigned long max_delta_cache_size
= 256 * 1024 * 1024;
69 static unsigned long cache_max_small_delta_size
= 1000;
71 static unsigned long window_memory_limit
= 0;
76 static uint32_t written
, written_delta
;
77 static uint32_t reused
, reused_delta
;
79 static void *get_delta(struct object_entry
*entry
)
81 unsigned long size
, base_size
, delta_size
;
82 void *buf
, *base_buf
, *delta_buf
;
83 enum object_type type
;
85 buf
= read_sha1_file(entry
->idx
.sha1
, &type
, &size
);
87 die("unable to read %s", sha1_to_hex(entry
->idx
.sha1
));
88 base_buf
= read_sha1_file(entry
->delta
->idx
.sha1
, &type
, &base_size
);
90 die("unable to read %s", sha1_to_hex(entry
->delta
->idx
.sha1
));
91 delta_buf
= diff_delta(base_buf
, base_size
,
92 buf
, size
, &delta_size
, 0);
93 if (!delta_buf
|| delta_size
!= entry
->delta_size
)
94 die("delta size changed");
100 static unsigned long do_compress(void **pptr
, unsigned long size
)
104 unsigned long maxsize
;
106 memset(&stream
, 0, sizeof(stream
));
107 git_deflate_init(&stream
, pack_compression_level
);
108 maxsize
= git_deflate_bound(&stream
, size
);
111 out
= xmalloc(maxsize
);
115 stream
.avail_in
= size
;
116 stream
.next_out
= out
;
117 stream
.avail_out
= maxsize
;
118 while (git_deflate(&stream
, Z_FINISH
) == Z_OK
)
120 git_deflate_end(&stream
);
123 return stream
.total_out
;
126 static unsigned long write_large_blob_data(struct git_istream
*st
, struct sha1file
*f
,
127 const unsigned char *sha1
)
130 unsigned char ibuf
[1024 * 16];
131 unsigned char obuf
[1024 * 16];
132 unsigned long olen
= 0;
134 memset(&stream
, 0, sizeof(stream
));
135 git_deflate_init(&stream
, pack_compression_level
);
140 readlen
= read_istream(st
, ibuf
, sizeof(ibuf
));
142 die(_("unable to read %s"), sha1_to_hex(sha1
));
144 stream
.next_in
= ibuf
;
145 stream
.avail_in
= readlen
;
146 while ((stream
.avail_in
|| readlen
== 0) &&
147 (zret
== Z_OK
|| zret
== Z_BUF_ERROR
)) {
148 stream
.next_out
= obuf
;
149 stream
.avail_out
= sizeof(obuf
);
150 zret
= git_deflate(&stream
, readlen
? 0 : Z_FINISH
);
151 sha1write(f
, obuf
, stream
.next_out
- obuf
);
152 olen
+= stream
.next_out
- obuf
;
155 die(_("deflate error (%d)"), zret
);
157 if (zret
!= Z_STREAM_END
)
158 die(_("deflate error (%d)"), zret
);
162 git_deflate_end(&stream
);
167 * we are going to reuse the existing object data as is. make
168 * sure it is not corrupt.
170 static int check_pack_inflate(struct packed_git
*p
,
171 struct pack_window
**w_curs
,
174 unsigned long expect
)
177 unsigned char fakebuf
[4096], *in
;
180 memset(&stream
, 0, sizeof(stream
));
181 git_inflate_init(&stream
);
183 in
= use_pack(p
, w_curs
, offset
, &stream
.avail_in
);
185 stream
.next_out
= fakebuf
;
186 stream
.avail_out
= sizeof(fakebuf
);
187 st
= git_inflate(&stream
, Z_FINISH
);
188 offset
+= stream
.next_in
- in
;
189 } while (st
== Z_OK
|| st
== Z_BUF_ERROR
);
190 git_inflate_end(&stream
);
191 return (st
== Z_STREAM_END
&&
192 stream
.total_out
== expect
&&
193 stream
.total_in
== len
) ? 0 : -1;
196 static void copy_pack_data(struct sha1file
*f
,
197 struct packed_git
*p
,
198 struct pack_window
**w_curs
,
206 in
= use_pack(p
, w_curs
, offset
, &avail
);
208 avail
= (unsigned long)len
;
209 sha1write(f
, in
, avail
);
215 /* Return 0 if we will bust the pack-size limit */
216 static unsigned long write_no_reuse_object(struct sha1file
*f
, struct object_entry
*entry
,
217 unsigned long limit
, int usable_delta
)
219 unsigned long size
, datalen
;
220 unsigned char header
[10], dheader
[10];
222 enum object_type type
;
224 struct git_istream
*st
= NULL
;
227 if (entry
->type
== OBJ_BLOB
&&
228 entry
->size
> big_file_threshold
&&
229 (st
= open_istream(entry
->idx
.sha1
, &type
, &size
, NULL
)) != NULL
)
232 buf
= read_sha1_file(entry
->idx
.sha1
, &type
, &size
);
234 die(_("unable to read %s"), sha1_to_hex(entry
->idx
.sha1
));
237 * make sure no cached delta data remains from a
238 * previous attempt before a pack split occurred.
240 free(entry
->delta_data
);
241 entry
->delta_data
= NULL
;
242 entry
->z_delta_size
= 0;
243 } else if (entry
->delta_data
) {
244 size
= entry
->delta_size
;
245 buf
= entry
->delta_data
;
246 entry
->delta_data
= NULL
;
247 type
= (allow_ofs_delta
&& entry
->delta
->idx
.offset
) ?
248 OBJ_OFS_DELTA
: OBJ_REF_DELTA
;
250 buf
= get_delta(entry
);
251 size
= entry
->delta_size
;
252 type
= (allow_ofs_delta
&& entry
->delta
->idx
.offset
) ?
253 OBJ_OFS_DELTA
: OBJ_REF_DELTA
;
256 if (st
) /* large blob case, just assume we don't compress well */
258 else if (entry
->z_delta_size
)
259 datalen
= entry
->z_delta_size
;
261 datalen
= do_compress(&buf
, size
);
264 * The object header is a byte of 'type' followed by zero or
265 * more bytes of length.
267 hdrlen
= encode_in_pack_object_header(type
, size
, header
);
269 if (type
== OBJ_OFS_DELTA
) {
271 * Deltas with relative base contain an additional
272 * encoding of the relative offset for the delta
273 * base from this object's position in the pack.
275 off_t ofs
= entry
->idx
.offset
- entry
->delta
->idx
.offset
;
276 unsigned pos
= sizeof(dheader
) - 1;
277 dheader
[pos
] = ofs
& 127;
279 dheader
[--pos
] = 128 | (--ofs
& 127);
280 if (limit
&& hdrlen
+ sizeof(dheader
) - pos
+ datalen
+ 20 >= limit
) {
286 sha1write(f
, header
, hdrlen
);
287 sha1write(f
, dheader
+ pos
, sizeof(dheader
) - pos
);
288 hdrlen
+= sizeof(dheader
) - pos
;
289 } else if (type
== OBJ_REF_DELTA
) {
291 * Deltas with a base reference contain
292 * an additional 20 bytes for the base sha1.
294 if (limit
&& hdrlen
+ 20 + datalen
+ 20 >= limit
) {
300 sha1write(f
, header
, hdrlen
);
301 sha1write(f
, entry
->delta
->idx
.sha1
, 20);
304 if (limit
&& hdrlen
+ datalen
+ 20 >= limit
) {
310 sha1write(f
, header
, hdrlen
);
313 datalen
= write_large_blob_data(st
, f
, entry
->idx
.sha1
);
316 sha1write(f
, buf
, datalen
);
320 return hdrlen
+ datalen
;
323 /* Return 0 if we will bust the pack-size limit */
324 static unsigned long write_reuse_object(struct sha1file
*f
, struct object_entry
*entry
,
325 unsigned long limit
, int usable_delta
)
327 struct packed_git
*p
= entry
->in_pack
;
328 struct pack_window
*w_curs
= NULL
;
329 struct revindex_entry
*revidx
;
331 enum object_type type
= entry
->type
;
332 unsigned long datalen
;
333 unsigned char header
[10], dheader
[10];
337 type
= (allow_ofs_delta
&& entry
->delta
->idx
.offset
) ?
338 OBJ_OFS_DELTA
: OBJ_REF_DELTA
;
339 hdrlen
= encode_in_pack_object_header(type
, entry
->size
, header
);
341 offset
= entry
->in_pack_offset
;
342 revidx
= find_pack_revindex(p
, offset
);
343 datalen
= revidx
[1].offset
- offset
;
344 if (!pack_to_stdout
&& p
->index_version
> 1 &&
345 check_pack_crc(p
, &w_curs
, offset
, datalen
, revidx
->nr
)) {
346 error("bad packed object CRC for %s", sha1_to_hex(entry
->idx
.sha1
));
348 return write_no_reuse_object(f
, entry
, limit
, usable_delta
);
351 offset
+= entry
->in_pack_header_size
;
352 datalen
-= entry
->in_pack_header_size
;
354 if (!pack_to_stdout
&& p
->index_version
== 1 &&
355 check_pack_inflate(p
, &w_curs
, offset
, datalen
, entry
->size
)) {
356 error("corrupt packed object for %s", sha1_to_hex(entry
->idx
.sha1
));
358 return write_no_reuse_object(f
, entry
, limit
, usable_delta
);
361 if (type
== OBJ_OFS_DELTA
) {
362 off_t ofs
= entry
->idx
.offset
- entry
->delta
->idx
.offset
;
363 unsigned pos
= sizeof(dheader
) - 1;
364 dheader
[pos
] = ofs
& 127;
366 dheader
[--pos
] = 128 | (--ofs
& 127);
367 if (limit
&& hdrlen
+ sizeof(dheader
) - pos
+ datalen
+ 20 >= limit
) {
371 sha1write(f
, header
, hdrlen
);
372 sha1write(f
, dheader
+ pos
, sizeof(dheader
) - pos
);
373 hdrlen
+= sizeof(dheader
) - pos
;
375 } else if (type
== OBJ_REF_DELTA
) {
376 if (limit
&& hdrlen
+ 20 + datalen
+ 20 >= limit
) {
380 sha1write(f
, header
, hdrlen
);
381 sha1write(f
, entry
->delta
->idx
.sha1
, 20);
385 if (limit
&& hdrlen
+ datalen
+ 20 >= limit
) {
389 sha1write(f
, header
, hdrlen
);
391 copy_pack_data(f
, p
, &w_curs
, offset
, datalen
);
394 return hdrlen
+ datalen
;
397 /* Return 0 if we will bust the pack-size limit */
398 static unsigned long write_object(struct sha1file
*f
,
399 struct object_entry
*entry
,
402 unsigned long limit
, len
;
403 int usable_delta
, to_reuse
;
408 /* apply size limit if limited packsize and not first object */
409 if (!pack_size_limit
|| !nr_written
)
411 else if (pack_size_limit
<= write_offset
)
413 * the earlier object did not fit the limit; avoid
414 * mistaking this with unlimited (i.e. limit = 0).
418 limit
= pack_size_limit
- write_offset
;
421 usable_delta
= 0; /* no delta */
422 else if (!pack_size_limit
)
423 usable_delta
= 1; /* unlimited packfile */
424 else if (entry
->delta
->idx
.offset
== (off_t
)-1)
425 usable_delta
= 0; /* base was written to another pack */
426 else if (entry
->delta
->idx
.offset
)
427 usable_delta
= 1; /* base already exists in this pack */
429 usable_delta
= 0; /* base could end up in another pack */
432 to_reuse
= 0; /* explicit */
433 else if (!entry
->in_pack
)
434 to_reuse
= 0; /* can't reuse what we don't have */
435 else if (entry
->type
== OBJ_REF_DELTA
|| entry
->type
== OBJ_OFS_DELTA
)
436 /* check_object() decided it for us ... */
437 to_reuse
= usable_delta
;
438 /* ... but pack split may override that */
439 else if (entry
->type
!= entry
->in_pack_type
)
440 to_reuse
= 0; /* pack has delta which is unusable */
441 else if (entry
->delta
)
442 to_reuse
= 0; /* we want to pack afresh */
444 to_reuse
= 1; /* we have it in-pack undeltified,
445 * and we do not need to deltify it.
449 len
= write_no_reuse_object(f
, entry
, limit
, usable_delta
);
451 len
= write_reuse_object(f
, entry
, limit
, usable_delta
);
459 entry
->idx
.crc32
= crc32_end(f
);
463 enum write_one_status
{
464 WRITE_ONE_SKIP
= -1, /* already written */
465 WRITE_ONE_BREAK
= 0, /* writing this will bust the limit; not written */
466 WRITE_ONE_WRITTEN
= 1, /* normal */
467 WRITE_ONE_RECURSIVE
= 2 /* already scheduled to be written */
470 static enum write_one_status
write_one(struct sha1file
*f
,
471 struct object_entry
*e
,
478 * we set offset to 1 (which is an impossible value) to mark
479 * the fact that this object is involved in "write its base
480 * first before writing a deltified object" recursion.
482 recursing
= (e
->idx
.offset
== 1);
484 warning("recursive delta detected for object %s",
485 sha1_to_hex(e
->idx
.sha1
));
486 return WRITE_ONE_RECURSIVE
;
487 } else if (e
->idx
.offset
|| e
->preferred_base
) {
488 /* offset is non zero if object is written already. */
489 return WRITE_ONE_SKIP
;
492 /* if we are deltified, write out base object first. */
494 e
->idx
.offset
= 1; /* now recurse */
495 switch (write_one(f
, e
->delta
, offset
)) {
496 case WRITE_ONE_RECURSIVE
:
497 /* we cannot depend on this one */
502 case WRITE_ONE_BREAK
:
503 e
->idx
.offset
= recursing
;
504 return WRITE_ONE_BREAK
;
508 e
->idx
.offset
= *offset
;
509 size
= write_object(f
, e
, *offset
);
511 e
->idx
.offset
= recursing
;
512 return WRITE_ONE_BREAK
;
514 written_list
[nr_written
++] = &e
->idx
;
516 /* make sure off_t is sufficiently large not to wrap */
517 if (signed_add_overflows(*offset
, size
))
518 die("pack too large for current definition of off_t");
520 return WRITE_ONE_WRITTEN
;
523 static int mark_tagged(const char *path
, const unsigned char *sha1
, int flag
,
526 unsigned char peeled
[20];
527 struct object_entry
*entry
= packlist_find(&to_pack
, sha1
, NULL
);
531 if (!peel_ref(path
, peeled
)) {
532 entry
= packlist_find(&to_pack
, peeled
, NULL
);
539 static inline void add_to_write_order(struct object_entry
**wo
,
541 struct object_entry
*e
)
549 static void add_descendants_to_write_order(struct object_entry
**wo
,
551 struct object_entry
*e
)
553 int add_to_order
= 1;
556 struct object_entry
*s
;
557 /* add this node... */
558 add_to_write_order(wo
, endp
, e
);
559 /* all its siblings... */
560 for (s
= e
->delta_sibling
; s
; s
= s
->delta_sibling
) {
561 add_to_write_order(wo
, endp
, s
);
564 /* drop down a level to add left subtree nodes if possible */
565 if (e
->delta_child
) {
570 /* our sibling might have some children, it is next */
571 if (e
->delta_sibling
) {
572 e
= e
->delta_sibling
;
575 /* go back to our parent node */
577 while (e
&& !e
->delta_sibling
) {
578 /* we're on the right side of a subtree, keep
579 * going up until we can go right again */
583 /* done- we hit our original root node */
586 /* pass it off to sibling at this level */
587 e
= e
->delta_sibling
;
592 static void add_family_to_write_order(struct object_entry
**wo
,
594 struct object_entry
*e
)
596 struct object_entry
*root
;
598 for (root
= e
; root
->delta
; root
= root
->delta
)
600 add_descendants_to_write_order(wo
, endp
, root
);
603 static struct object_entry
**compute_write_order(void)
605 unsigned int i
, wo_end
, last_untagged
;
607 struct object_entry
**wo
= xmalloc(to_pack
.nr_objects
* sizeof(*wo
));
608 struct object_entry
*objects
= to_pack
.objects
;
610 for (i
= 0; i
< to_pack
.nr_objects
; i
++) {
611 objects
[i
].tagged
= 0;
612 objects
[i
].filled
= 0;
613 objects
[i
].delta_child
= NULL
;
614 objects
[i
].delta_sibling
= NULL
;
618 * Fully connect delta_child/delta_sibling network.
619 * Make sure delta_sibling is sorted in the original
622 for (i
= to_pack
.nr_objects
; i
> 0;) {
623 struct object_entry
*e
= &objects
[--i
];
626 /* Mark me as the first child */
627 e
->delta_sibling
= e
->delta
->delta_child
;
628 e
->delta
->delta_child
= e
;
632 * Mark objects that are at the tip of tags.
634 for_each_tag_ref(mark_tagged
, NULL
);
637 * Give the objects in the original recency order until
638 * we see a tagged tip.
640 for (i
= wo_end
= 0; i
< to_pack
.nr_objects
; i
++) {
641 if (objects
[i
].tagged
)
643 add_to_write_order(wo
, &wo_end
, &objects
[i
]);
648 * Then fill all the tagged tips.
650 for (; i
< to_pack
.nr_objects
; i
++) {
651 if (objects
[i
].tagged
)
652 add_to_write_order(wo
, &wo_end
, &objects
[i
]);
656 * And then all remaining commits and tags.
658 for (i
= last_untagged
; i
< to_pack
.nr_objects
; i
++) {
659 if (objects
[i
].type
!= OBJ_COMMIT
&&
660 objects
[i
].type
!= OBJ_TAG
)
662 add_to_write_order(wo
, &wo_end
, &objects
[i
]);
666 * And then all the trees.
668 for (i
= last_untagged
; i
< to_pack
.nr_objects
; i
++) {
669 if (objects
[i
].type
!= OBJ_TREE
)
671 add_to_write_order(wo
, &wo_end
, &objects
[i
]);
675 * Finally all the rest in really tight order
677 for (i
= last_untagged
; i
< to_pack
.nr_objects
; i
++) {
678 if (!objects
[i
].filled
)
679 add_family_to_write_order(wo
, &wo_end
, &objects
[i
]);
682 if (wo_end
!= to_pack
.nr_objects
)
683 die("ordered %u objects, expected %"PRIu32
, wo_end
, to_pack
.nr_objects
);
688 static off_t
write_reused_pack(struct sha1file
*f
)
690 unsigned char buffer
[8192];
694 if (!is_pack_valid(reuse_packfile
))
695 die("packfile is invalid: %s", reuse_packfile
->pack_name
);
697 fd
= git_open_noatime(reuse_packfile
->pack_name
);
699 die_errno("unable to open packfile for reuse: %s",
700 reuse_packfile
->pack_name
);
702 if (lseek(fd
, sizeof(struct pack_header
), SEEK_SET
) == -1)
703 die_errno("unable to seek in reused packfile");
705 if (reuse_packfile_offset
< 0)
706 reuse_packfile_offset
= reuse_packfile
->pack_size
- 20;
708 to_write
= reuse_packfile_offset
- sizeof(struct pack_header
);
711 int read_pack
= xread(fd
, buffer
, sizeof(buffer
));
714 die_errno("unable to read from reused packfile");
716 if (read_pack
> to_write
)
717 read_pack
= to_write
;
719 sha1write(f
, buffer
, read_pack
);
720 to_write
-= read_pack
;
724 written
+= reuse_packfile_objects
;
725 return reuse_packfile_offset
- sizeof(struct pack_header
);
728 static void write_pack_file(void)
733 uint32_t nr_remaining
= nr_result
;
734 time_t last_mtime
= 0;
735 struct object_entry
**write_order
;
737 if (progress
> pack_to_stdout
)
738 progress_state
= start_progress("Writing objects", nr_result
);
739 written_list
= xmalloc(to_pack
.nr_objects
* sizeof(*written_list
));
740 write_order
= compute_write_order();
743 unsigned char sha1
[20];
744 char *pack_tmp_name
= NULL
;
747 f
= sha1fd_throughput(1, "<stdout>", progress_state
);
749 f
= create_tmp_packfile(&pack_tmp_name
);
751 offset
= write_pack_header(f
, nr_remaining
);
753 die_errno("unable to write pack header");
755 if (reuse_packfile
) {
757 assert(pack_to_stdout
);
759 packfile_size
= write_reused_pack(f
);
760 offset
+= packfile_size
;
764 for (; i
< to_pack
.nr_objects
; i
++) {
765 struct object_entry
*e
= write_order
[i
];
766 if (write_one(f
, e
, &offset
) == WRITE_ONE_BREAK
)
768 display_progress(progress_state
, written
);
772 * Did we write the wrong # entries in the header?
773 * If so, rewrite it like in fast-import
775 if (pack_to_stdout
) {
776 sha1close(f
, sha1
, CSUM_CLOSE
);
777 } else if (nr_written
== nr_remaining
) {
778 sha1close(f
, sha1
, CSUM_FSYNC
);
780 int fd
= sha1close(f
, sha1
, 0);
781 fixup_pack_header_footer(fd
, sha1
, pack_tmp_name
,
782 nr_written
, sha1
, offset
);
786 if (!pack_to_stdout
) {
788 char tmpname
[PATH_MAX
];
791 * Packs are runtime accessed in their mtime
792 * order since newer packs are more likely to contain
793 * younger objects. So if we are creating multiple
794 * packs then we should modify the mtime of later ones
795 * to preserve this property.
797 if (stat(pack_tmp_name
, &st
) < 0) {
798 warning("failed to stat %s: %s",
799 pack_tmp_name
, strerror(errno
));
800 } else if (!last_mtime
) {
801 last_mtime
= st
.st_mtime
;
804 utb
.actime
= st
.st_atime
;
805 utb
.modtime
= --last_mtime
;
806 if (utime(pack_tmp_name
, &utb
) < 0)
807 warning("failed utime() on %s: %s",
808 tmpname
, strerror(errno
));
811 /* Enough space for "-<sha-1>.pack"? */
812 if (sizeof(tmpname
) <= strlen(base_name
) + 50)
813 die("pack base name '%s' too long", base_name
);
814 snprintf(tmpname
, sizeof(tmpname
), "%s-", base_name
);
815 finish_tmp_packfile(tmpname
, pack_tmp_name
,
816 written_list
, nr_written
,
817 &pack_idx_opts
, sha1
);
819 puts(sha1_to_hex(sha1
));
822 /* mark written objects as written to previous pack */
823 for (j
= 0; j
< nr_written
; j
++) {
824 written_list
[j
]->offset
= (off_t
)-1;
826 nr_remaining
-= nr_written
;
827 } while (nr_remaining
&& i
< to_pack
.nr_objects
);
831 stop_progress(&progress_state
);
832 if (written
!= nr_result
)
833 die("wrote %"PRIu32
" objects while expecting %"PRIu32
,
837 static void setup_delta_attr_check(struct git_attr_check
*check
)
839 static struct git_attr
*attr_delta
;
842 attr_delta
= git_attr("delta");
844 check
[0].attr
= attr_delta
;
847 static int no_try_delta(const char *path
)
849 struct git_attr_check check
[1];
851 setup_delta_attr_check(check
);
852 if (git_check_attr(path
, ARRAY_SIZE(check
), check
))
854 if (ATTR_FALSE(check
->value
))
860 * When adding an object, check whether we have already added it
861 * to our packing list. If so, we can skip. However, if we are
862 * being asked to excludei t, but the previous mention was to include
863 * it, make sure to adjust its flags and tweak our numbers accordingly.
865 * As an optimization, we pass out the index position where we would have
866 * found the item, since that saves us from having to look it up again a
867 * few lines later when we want to add the new entry.
869 static int have_duplicate_entry(const unsigned char *sha1
,
873 struct object_entry
*entry
;
875 entry
= packlist_find(&to_pack
, sha1
, index_pos
);
880 if (!entry
->preferred_base
)
882 entry
->preferred_base
= 1;
889 * Check whether we want the object in the pack (e.g., we do not want
890 * objects found in non-local stores if the "--local" option was used).
892 * As a side effect of this check, we will find the packed version of this
893 * object, if any. We therefore pass out the pack information to avoid having
894 * to look it up again later.
896 static int want_object_in_pack(const unsigned char *sha1
,
898 struct packed_git
**found_pack
,
901 struct packed_git
*p
;
903 if (!exclude
&& local
&& has_loose_object_nonlocal(sha1
))
909 for (p
= packed_git
; p
; p
= p
->next
) {
910 off_t offset
= find_pack_entry_one(sha1
, p
);
913 if (!is_pack_valid(p
)) {
914 warning("packfile %s cannot be accessed", p
->pack_name
);
917 *found_offset
= offset
;
924 if (local
&& !p
->pack_local
)
926 if (ignore_packed_keep
&& p
->pack_local
&& p
->pack_keep
)
934 static void create_object_entry(const unsigned char *sha1
,
935 enum object_type type
,
940 struct packed_git
*found_pack
,
943 struct object_entry
*entry
;
945 entry
= packlist_alloc(&to_pack
, sha1
, index_pos
);
950 entry
->preferred_base
= 1;
954 entry
->in_pack
= found_pack
;
955 entry
->in_pack_offset
= found_offset
;
958 entry
->no_try_delta
= no_try_delta
;
961 static int add_object_entry(const unsigned char *sha1
, enum object_type type
,
962 const char *name
, int exclude
)
964 struct packed_git
*found_pack
;
968 if (have_duplicate_entry(sha1
, exclude
, &index_pos
))
971 if (!want_object_in_pack(sha1
, exclude
, &found_pack
, &found_offset
))
974 create_object_entry(sha1
, type
, pack_name_hash(name
),
975 exclude
, name
&& no_try_delta(name
),
976 index_pos
, found_pack
, found_offset
);
978 display_progress(progress_state
, to_pack
.nr_objects
);
982 static int add_object_entry_from_bitmap(const unsigned char *sha1
,
983 enum object_type type
,
984 int flags
, uint32_t name_hash
,
985 struct packed_git
*pack
, off_t offset
)
989 if (have_duplicate_entry(sha1
, 0, &index_pos
))
992 create_object_entry(sha1
, type
, name_hash
, 0, 0, index_pos
, pack
, offset
);
994 display_progress(progress_state
, to_pack
.nr_objects
);
998 struct pbase_tree_cache
{
999 unsigned char sha1
[20];
1003 unsigned long tree_size
;
1006 static struct pbase_tree_cache
*(pbase_tree_cache
[256]);
1007 static int pbase_tree_cache_ix(const unsigned char *sha1
)
1009 return sha1
[0] % ARRAY_SIZE(pbase_tree_cache
);
1011 static int pbase_tree_cache_ix_incr(int ix
)
1013 return (ix
+1) % ARRAY_SIZE(pbase_tree_cache
);
1016 static struct pbase_tree
{
1017 struct pbase_tree
*next
;
1018 /* This is a phony "cache" entry; we are not
1019 * going to evict it nor find it through _get()
1020 * mechanism -- this is for the toplevel node that
1021 * would almost always change with any commit.
1023 struct pbase_tree_cache pcache
;
1026 static struct pbase_tree_cache
*pbase_tree_get(const unsigned char *sha1
)
1028 struct pbase_tree_cache
*ent
, *nent
;
1031 enum object_type type
;
1033 int my_ix
= pbase_tree_cache_ix(sha1
);
1034 int available_ix
= -1;
1036 /* pbase-tree-cache acts as a limited hashtable.
1037 * your object will be found at your index or within a few
1038 * slots after that slot if it is cached.
1040 for (neigh
= 0; neigh
< 8; neigh
++) {
1041 ent
= pbase_tree_cache
[my_ix
];
1042 if (ent
&& !hashcmp(ent
->sha1
, sha1
)) {
1046 else if (((available_ix
< 0) && (!ent
|| !ent
->ref
)) ||
1047 ((0 <= available_ix
) &&
1048 (!ent
&& pbase_tree_cache
[available_ix
])))
1049 available_ix
= my_ix
;
1052 my_ix
= pbase_tree_cache_ix_incr(my_ix
);
1055 /* Did not find one. Either we got a bogus request or
1056 * we need to read and perhaps cache.
1058 data
= read_sha1_file(sha1
, &type
, &size
);
1061 if (type
!= OBJ_TREE
) {
1066 /* We need to either cache or return a throwaway copy */
1068 if (available_ix
< 0)
1071 ent
= pbase_tree_cache
[available_ix
];
1072 my_ix
= available_ix
;
1076 nent
= xmalloc(sizeof(*nent
));
1077 nent
->temporary
= (available_ix
< 0);
1080 /* evict and reuse */
1081 free(ent
->tree_data
);
1084 hashcpy(nent
->sha1
, sha1
);
1085 nent
->tree_data
= data
;
1086 nent
->tree_size
= size
;
1088 if (!nent
->temporary
)
1089 pbase_tree_cache
[my_ix
] = nent
;
1093 static void pbase_tree_put(struct pbase_tree_cache
*cache
)
1095 if (!cache
->temporary
) {
1099 free(cache
->tree_data
);
1103 static int name_cmp_len(const char *name
)
1106 for (i
= 0; name
[i
] && name
[i
] != '\n' && name
[i
] != '/'; i
++)
1111 static void add_pbase_object(struct tree_desc
*tree
,
1114 const char *fullname
)
1116 struct name_entry entry
;
1119 while (tree_entry(tree
,&entry
)) {
1120 if (S_ISGITLINK(entry
.mode
))
1122 cmp
= tree_entry_len(&entry
) != cmplen
? 1 :
1123 memcmp(name
, entry
.path
, cmplen
);
1128 if (name
[cmplen
] != '/') {
1129 add_object_entry(entry
.sha1
,
1130 object_type(entry
.mode
),
1134 if (S_ISDIR(entry
.mode
)) {
1135 struct tree_desc sub
;
1136 struct pbase_tree_cache
*tree
;
1137 const char *down
= name
+cmplen
+1;
1138 int downlen
= name_cmp_len(down
);
1140 tree
= pbase_tree_get(entry
.sha1
);
1143 init_tree_desc(&sub
, tree
->tree_data
, tree
->tree_size
);
1145 add_pbase_object(&sub
, down
, downlen
, fullname
);
1146 pbase_tree_put(tree
);
1151 static unsigned *done_pbase_paths
;
1152 static int done_pbase_paths_num
;
1153 static int done_pbase_paths_alloc
;
1154 static int done_pbase_path_pos(unsigned hash
)
1157 int hi
= done_pbase_paths_num
;
1159 int mi
= (hi
+ lo
) / 2;
1160 if (done_pbase_paths
[mi
] == hash
)
1162 if (done_pbase_paths
[mi
] < hash
)
1170 static int check_pbase_path(unsigned hash
)
1172 int pos
= (!done_pbase_paths
) ? -1 : done_pbase_path_pos(hash
);
1176 if (done_pbase_paths_alloc
<= done_pbase_paths_num
) {
1177 done_pbase_paths_alloc
= alloc_nr(done_pbase_paths_alloc
);
1178 done_pbase_paths
= xrealloc(done_pbase_paths
,
1179 done_pbase_paths_alloc
*
1182 done_pbase_paths_num
++;
1183 if (pos
< done_pbase_paths_num
)
1184 memmove(done_pbase_paths
+ pos
+ 1,
1185 done_pbase_paths
+ pos
,
1186 (done_pbase_paths_num
- pos
- 1) * sizeof(unsigned));
1187 done_pbase_paths
[pos
] = hash
;
1191 static void add_preferred_base_object(const char *name
)
1193 struct pbase_tree
*it
;
1195 unsigned hash
= pack_name_hash(name
);
1197 if (!num_preferred_base
|| check_pbase_path(hash
))
1200 cmplen
= name_cmp_len(name
);
1201 for (it
= pbase_tree
; it
; it
= it
->next
) {
1203 add_object_entry(it
->pcache
.sha1
, OBJ_TREE
, NULL
, 1);
1206 struct tree_desc tree
;
1207 init_tree_desc(&tree
, it
->pcache
.tree_data
, it
->pcache
.tree_size
);
1208 add_pbase_object(&tree
, name
, cmplen
, name
);
1213 static void add_preferred_base(unsigned char *sha1
)
1215 struct pbase_tree
*it
;
1218 unsigned char tree_sha1
[20];
1220 if (window
<= num_preferred_base
++)
1223 data
= read_object_with_reference(sha1
, tree_type
, &size
, tree_sha1
);
1227 for (it
= pbase_tree
; it
; it
= it
->next
) {
1228 if (!hashcmp(it
->pcache
.sha1
, tree_sha1
)) {
1234 it
= xcalloc(1, sizeof(*it
));
1235 it
->next
= pbase_tree
;
1238 hashcpy(it
->pcache
.sha1
, tree_sha1
);
1239 it
->pcache
.tree_data
= data
;
1240 it
->pcache
.tree_size
= size
;
1243 static void cleanup_preferred_base(void)
1245 struct pbase_tree
*it
;
1251 struct pbase_tree
*this = it
;
1253 free(this->pcache
.tree_data
);
1257 for (i
= 0; i
< ARRAY_SIZE(pbase_tree_cache
); i
++) {
1258 if (!pbase_tree_cache
[i
])
1260 free(pbase_tree_cache
[i
]->tree_data
);
1261 free(pbase_tree_cache
[i
]);
1262 pbase_tree_cache
[i
] = NULL
;
1265 free(done_pbase_paths
);
1266 done_pbase_paths
= NULL
;
1267 done_pbase_paths_num
= done_pbase_paths_alloc
= 0;
1270 static void check_object(struct object_entry
*entry
)
1272 if (entry
->in_pack
) {
1273 struct packed_git
*p
= entry
->in_pack
;
1274 struct pack_window
*w_curs
= NULL
;
1275 const unsigned char *base_ref
= NULL
;
1276 struct object_entry
*base_entry
;
1277 unsigned long used
, used_0
;
1278 unsigned long avail
;
1280 unsigned char *buf
, c
;
1282 buf
= use_pack(p
, &w_curs
, entry
->in_pack_offset
, &avail
);
1285 * We want in_pack_type even if we do not reuse delta
1286 * since non-delta representations could still be reused.
1288 used
= unpack_object_header_buffer(buf
, avail
,
1289 &entry
->in_pack_type
,
1295 * Determine if this is a delta and if so whether we can
1296 * reuse it or not. Otherwise let's find out as cheaply as
1297 * possible what the actual type and size for this object is.
1299 switch (entry
->in_pack_type
) {
1301 /* Not a delta hence we've already got all we need. */
1302 entry
->type
= entry
->in_pack_type
;
1303 entry
->in_pack_header_size
= used
;
1304 if (entry
->type
< OBJ_COMMIT
|| entry
->type
> OBJ_BLOB
)
1306 unuse_pack(&w_curs
);
1309 if (reuse_delta
&& !entry
->preferred_base
)
1310 base_ref
= use_pack(p
, &w_curs
,
1311 entry
->in_pack_offset
+ used
, NULL
);
1312 entry
->in_pack_header_size
= used
+ 20;
1315 buf
= use_pack(p
, &w_curs
,
1316 entry
->in_pack_offset
+ used
, NULL
);
1322 if (!ofs
|| MSB(ofs
, 7)) {
1323 error("delta base offset overflow in pack for %s",
1324 sha1_to_hex(entry
->idx
.sha1
));
1328 ofs
= (ofs
<< 7) + (c
& 127);
1330 ofs
= entry
->in_pack_offset
- ofs
;
1331 if (ofs
<= 0 || ofs
>= entry
->in_pack_offset
) {
1332 error("delta base offset out of bound for %s",
1333 sha1_to_hex(entry
->idx
.sha1
));
1336 if (reuse_delta
&& !entry
->preferred_base
) {
1337 struct revindex_entry
*revidx
;
1338 revidx
= find_pack_revindex(p
, ofs
);
1341 base_ref
= nth_packed_object_sha1(p
, revidx
->nr
);
1343 entry
->in_pack_header_size
= used
+ used_0
;
1347 if (base_ref
&& (base_entry
= packlist_find(&to_pack
, base_ref
, NULL
))) {
1349 * If base_ref was set above that means we wish to
1350 * reuse delta data, and we even found that base
1351 * in the list of objects we want to pack. Goodie!
1353 * Depth value does not matter - find_deltas() will
1354 * never consider reused delta as the base object to
1355 * deltify other objects against, in order to avoid
1358 entry
->type
= entry
->in_pack_type
;
1359 entry
->delta
= base_entry
;
1360 entry
->delta_size
= entry
->size
;
1361 entry
->delta_sibling
= base_entry
->delta_child
;
1362 base_entry
->delta_child
= entry
;
1363 unuse_pack(&w_curs
);
1369 * This must be a delta and we already know what the
1370 * final object type is. Let's extract the actual
1371 * object size from the delta header.
1373 entry
->size
= get_size_from_delta(p
, &w_curs
,
1374 entry
->in_pack_offset
+ entry
->in_pack_header_size
);
1375 if (entry
->size
== 0)
1377 unuse_pack(&w_curs
);
1382 * No choice but to fall back to the recursive delta walk
1383 * with sha1_object_info() to find about the object type
1387 unuse_pack(&w_curs
);
1390 entry
->type
= sha1_object_info(entry
->idx
.sha1
, &entry
->size
);
1392 * The error condition is checked in prepare_pack(). This is
1393 * to permit a missing preferred base object to be ignored
1394 * as a preferred base. Doing so can result in a larger
1395 * pack file, but the transfer will still take place.
1399 static int pack_offset_sort(const void *_a
, const void *_b
)
1401 const struct object_entry
*a
= *(struct object_entry
**)_a
;
1402 const struct object_entry
*b
= *(struct object_entry
**)_b
;
1404 /* avoid filesystem trashing with loose objects */
1405 if (!a
->in_pack
&& !b
->in_pack
)
1406 return hashcmp(a
->idx
.sha1
, b
->idx
.sha1
);
1408 if (a
->in_pack
< b
->in_pack
)
1410 if (a
->in_pack
> b
->in_pack
)
1412 return a
->in_pack_offset
< b
->in_pack_offset
? -1 :
1413 (a
->in_pack_offset
> b
->in_pack_offset
);
1416 static void get_object_details(void)
1419 struct object_entry
**sorted_by_offset
;
1421 sorted_by_offset
= xcalloc(to_pack
.nr_objects
, sizeof(struct object_entry
*));
1422 for (i
= 0; i
< to_pack
.nr_objects
; i
++)
1423 sorted_by_offset
[i
] = to_pack
.objects
+ i
;
1424 qsort(sorted_by_offset
, to_pack
.nr_objects
, sizeof(*sorted_by_offset
), pack_offset_sort
);
1426 for (i
= 0; i
< to_pack
.nr_objects
; i
++) {
1427 struct object_entry
*entry
= sorted_by_offset
[i
];
1428 check_object(entry
);
1429 if (big_file_threshold
< entry
->size
)
1430 entry
->no_try_delta
= 1;
1433 free(sorted_by_offset
);
1437 * We search for deltas in a list sorted by type, by filename hash, and then
1438 * by size, so that we see progressively smaller and smaller files.
1439 * That's because we prefer deltas to be from the bigger file
1440 * to the smaller -- deletes are potentially cheaper, but perhaps
1441 * more importantly, the bigger file is likely the more recent
1442 * one. The deepest deltas are therefore the oldest objects which are
1443 * less susceptible to be accessed often.
1445 static int type_size_sort(const void *_a
, const void *_b
)
1447 const struct object_entry
*a
= *(struct object_entry
**)_a
;
1448 const struct object_entry
*b
= *(struct object_entry
**)_b
;
1450 if (a
->type
> b
->type
)
1452 if (a
->type
< b
->type
)
1454 if (a
->hash
> b
->hash
)
1456 if (a
->hash
< b
->hash
)
1458 if (a
->preferred_base
> b
->preferred_base
)
1460 if (a
->preferred_base
< b
->preferred_base
)
1462 if (a
->size
> b
->size
)
1464 if (a
->size
< b
->size
)
1466 return a
< b
? -1 : (a
> b
); /* newest first */
1470 struct object_entry
*entry
;
1472 struct delta_index
*index
;
1476 static int delta_cacheable(unsigned long src_size
, unsigned long trg_size
,
1477 unsigned long delta_size
)
1479 if (max_delta_cache_size
&& delta_cache_size
+ delta_size
> max_delta_cache_size
)
1482 if (delta_size
< cache_max_small_delta_size
)
1485 /* cache delta, if objects are large enough compared to delta size */
1486 if ((src_size
>> 20) + (trg_size
>> 21) > (delta_size
>> 10))
1494 static pthread_mutex_t read_mutex
;
1495 #define read_lock() pthread_mutex_lock(&read_mutex)
1496 #define read_unlock() pthread_mutex_unlock(&read_mutex)
1498 static pthread_mutex_t cache_mutex
;
1499 #define cache_lock() pthread_mutex_lock(&cache_mutex)
1500 #define cache_unlock() pthread_mutex_unlock(&cache_mutex)
1502 static pthread_mutex_t progress_mutex
;
1503 #define progress_lock() pthread_mutex_lock(&progress_mutex)
1504 #define progress_unlock() pthread_mutex_unlock(&progress_mutex)
1508 #define read_lock() (void)0
1509 #define read_unlock() (void)0
1510 #define cache_lock() (void)0
1511 #define cache_unlock() (void)0
1512 #define progress_lock() (void)0
1513 #define progress_unlock() (void)0
1517 static int try_delta(struct unpacked
*trg
, struct unpacked
*src
,
1518 unsigned max_depth
, unsigned long *mem_usage
)
1520 struct object_entry
*trg_entry
= trg
->entry
;
1521 struct object_entry
*src_entry
= src
->entry
;
1522 unsigned long trg_size
, src_size
, delta_size
, sizediff
, max_size
, sz
;
1524 enum object_type type
;
1527 /* Don't bother doing diffs between different types */
1528 if (trg_entry
->type
!= src_entry
->type
)
1532 * We do not bother to try a delta that we discarded on an
1533 * earlier try, but only when reusing delta data. Note that
1534 * src_entry that is marked as the preferred_base should always
1535 * be considered, as even if we produce a suboptimal delta against
1536 * it, we will still save the transfer cost, as we already know
1537 * the other side has it and we won't send src_entry at all.
1539 if (reuse_delta
&& trg_entry
->in_pack
&&
1540 trg_entry
->in_pack
== src_entry
->in_pack
&&
1541 !src_entry
->preferred_base
&&
1542 trg_entry
->in_pack_type
!= OBJ_REF_DELTA
&&
1543 trg_entry
->in_pack_type
!= OBJ_OFS_DELTA
)
1546 /* Let's not bust the allowed depth. */
1547 if (src
->depth
>= max_depth
)
1550 /* Now some size filtering heuristics. */
1551 trg_size
= trg_entry
->size
;
1552 if (!trg_entry
->delta
) {
1553 max_size
= trg_size
/2 - 20;
1556 max_size
= trg_entry
->delta_size
;
1557 ref_depth
= trg
->depth
;
1559 max_size
= (uint64_t)max_size
* (max_depth
- src
->depth
) /
1560 (max_depth
- ref_depth
+ 1);
1563 src_size
= src_entry
->size
;
1564 sizediff
= src_size
< trg_size
? trg_size
- src_size
: 0;
1565 if (sizediff
>= max_size
)
1567 if (trg_size
< src_size
/ 32)
1570 /* Load data if not already done */
1573 trg
->data
= read_sha1_file(trg_entry
->idx
.sha1
, &type
, &sz
);
1576 die("object %s cannot be read",
1577 sha1_to_hex(trg_entry
->idx
.sha1
));
1579 die("object %s inconsistent object length (%lu vs %lu)",
1580 sha1_to_hex(trg_entry
->idx
.sha1
), sz
, trg_size
);
1585 src
->data
= read_sha1_file(src_entry
->idx
.sha1
, &type
, &sz
);
1588 if (src_entry
->preferred_base
) {
1589 static int warned
= 0;
1591 warning("object %s cannot be read",
1592 sha1_to_hex(src_entry
->idx
.sha1
));
1594 * Those objects are not included in the
1595 * resulting pack. Be resilient and ignore
1596 * them if they can't be read, in case the
1597 * pack could be created nevertheless.
1601 die("object %s cannot be read",
1602 sha1_to_hex(src_entry
->idx
.sha1
));
1605 die("object %s inconsistent object length (%lu vs %lu)",
1606 sha1_to_hex(src_entry
->idx
.sha1
), sz
, src_size
);
1610 src
->index
= create_delta_index(src
->data
, src_size
);
1612 static int warned
= 0;
1614 warning("suboptimal pack - out of memory");
1617 *mem_usage
+= sizeof_delta_index(src
->index
);
1620 delta_buf
= create_delta(src
->index
, trg
->data
, trg_size
, &delta_size
, max_size
);
1624 if (trg_entry
->delta
) {
1625 /* Prefer only shallower same-sized deltas. */
1626 if (delta_size
== trg_entry
->delta_size
&&
1627 src
->depth
+ 1 >= trg
->depth
) {
1634 * Handle memory allocation outside of the cache
1635 * accounting lock. Compiler will optimize the strangeness
1636 * away when NO_PTHREADS is defined.
1638 free(trg_entry
->delta_data
);
1640 if (trg_entry
->delta_data
) {
1641 delta_cache_size
-= trg_entry
->delta_size
;
1642 trg_entry
->delta_data
= NULL
;
1644 if (delta_cacheable(src_size
, trg_size
, delta_size
)) {
1645 delta_cache_size
+= delta_size
;
1647 trg_entry
->delta_data
= xrealloc(delta_buf
, delta_size
);
1653 trg_entry
->delta
= src_entry
;
1654 trg_entry
->delta_size
= delta_size
;
1655 trg
->depth
= src
->depth
+ 1;
1660 static unsigned int check_delta_limit(struct object_entry
*me
, unsigned int n
)
1662 struct object_entry
*child
= me
->delta_child
;
1665 unsigned int c
= check_delta_limit(child
, n
+ 1);
1668 child
= child
->delta_sibling
;
1673 static unsigned long free_unpacked(struct unpacked
*n
)
1675 unsigned long freed_mem
= sizeof_delta_index(n
->index
);
1676 free_delta_index(n
->index
);
1679 freed_mem
+= n
->entry
->size
;
1688 static void find_deltas(struct object_entry
**list
, unsigned *list_size
,
1689 int window
, int depth
, unsigned *processed
)
1691 uint32_t i
, idx
= 0, count
= 0;
1692 struct unpacked
*array
;
1693 unsigned long mem_usage
= 0;
1695 array
= xcalloc(window
, sizeof(struct unpacked
));
1698 struct object_entry
*entry
;
1699 struct unpacked
*n
= array
+ idx
;
1700 int j
, max_depth
, best_base
= -1;
1709 if (!entry
->preferred_base
) {
1711 display_progress(progress_state
, *processed
);
1715 mem_usage
-= free_unpacked(n
);
1718 while (window_memory_limit
&&
1719 mem_usage
> window_memory_limit
&&
1721 uint32_t tail
= (idx
+ window
- count
) % window
;
1722 mem_usage
-= free_unpacked(array
+ tail
);
1726 /* We do not compute delta to *create* objects we are not
1729 if (entry
->preferred_base
)
1733 * If the current object is at pack edge, take the depth the
1734 * objects that depend on the current object into account
1735 * otherwise they would become too deep.
1738 if (entry
->delta_child
) {
1739 max_depth
-= check_delta_limit(entry
, 0);
1747 uint32_t other_idx
= idx
+ j
;
1749 if (other_idx
>= window
)
1750 other_idx
-= window
;
1751 m
= array
+ other_idx
;
1754 ret
= try_delta(n
, m
, max_depth
, &mem_usage
);
1758 best_base
= other_idx
;
1762 * If we decided to cache the delta data, then it is best
1763 * to compress it right away. First because we have to do
1764 * it anyway, and doing it here while we're threaded will
1765 * save a lot of time in the non threaded write phase,
1766 * as well as allow for caching more deltas within
1767 * the same cache size limit.
1769 * But only if not writing to stdout, since in that case
1770 * the network is most likely throttling writes anyway,
1771 * and therefore it is best to go to the write phase ASAP
1772 * instead, as we can afford spending more time compressing
1773 * between writes at that moment.
1775 if (entry
->delta_data
&& !pack_to_stdout
) {
1776 entry
->z_delta_size
= do_compress(&entry
->delta_data
,
1779 delta_cache_size
-= entry
->delta_size
;
1780 delta_cache_size
+= entry
->z_delta_size
;
1784 /* if we made n a delta, and if n is already at max
1785 * depth, leaving it in the window is pointless. we
1786 * should evict it first.
1788 if (entry
->delta
&& max_depth
<= n
->depth
)
1792 * Move the best delta base up in the window, after the
1793 * currently deltified object, to keep it longer. It will
1794 * be the first base object to be attempted next.
1797 struct unpacked swap
= array
[best_base
];
1798 int dist
= (window
+ idx
- best_base
) % window
;
1799 int dst
= best_base
;
1801 int src
= (dst
+ 1) % window
;
1802 array
[dst
] = array
[src
];
1810 if (count
+ 1 < window
)
1816 for (i
= 0; i
< window
; ++i
) {
1817 free_delta_index(array
[i
].index
);
1818 free(array
[i
].data
);
1825 static void try_to_free_from_threads(size_t size
)
1828 release_pack_memory(size
);
1832 static try_to_free_t old_try_to_free_routine
;
1835 * The main thread waits on the condition that (at least) one of the workers
1836 * has stopped working (which is indicated in the .working member of
1837 * struct thread_params).
1838 * When a work thread has completed its work, it sets .working to 0 and
1839 * signals the main thread and waits on the condition that .data_ready
1843 struct thread_params
{
1845 struct object_entry
**list
;
1852 pthread_mutex_t mutex
;
1853 pthread_cond_t cond
;
1854 unsigned *processed
;
1857 static pthread_cond_t progress_cond
;
1860 * Mutex and conditional variable can't be statically-initialized on Windows.
1862 static void init_threaded_search(void)
1864 init_recursive_mutex(&read_mutex
);
1865 pthread_mutex_init(&cache_mutex
, NULL
);
1866 pthread_mutex_init(&progress_mutex
, NULL
);
1867 pthread_cond_init(&progress_cond
, NULL
);
1868 old_try_to_free_routine
= set_try_to_free_routine(try_to_free_from_threads
);
1871 static void cleanup_threaded_search(void)
1873 set_try_to_free_routine(old_try_to_free_routine
);
1874 pthread_cond_destroy(&progress_cond
);
1875 pthread_mutex_destroy(&read_mutex
);
1876 pthread_mutex_destroy(&cache_mutex
);
1877 pthread_mutex_destroy(&progress_mutex
);
1880 static void *threaded_find_deltas(void *arg
)
1882 struct thread_params
*me
= arg
;
1884 while (me
->remaining
) {
1885 find_deltas(me
->list
, &me
->remaining
,
1886 me
->window
, me
->depth
, me
->processed
);
1890 pthread_cond_signal(&progress_cond
);
1894 * We must not set ->data_ready before we wait on the
1895 * condition because the main thread may have set it to 1
1896 * before we get here. In order to be sure that new
1897 * work is available if we see 1 in ->data_ready, it
1898 * was initialized to 0 before this thread was spawned
1899 * and we reset it to 0 right away.
1901 pthread_mutex_lock(&me
->mutex
);
1902 while (!me
->data_ready
)
1903 pthread_cond_wait(&me
->cond
, &me
->mutex
);
1905 pthread_mutex_unlock(&me
->mutex
);
1907 /* leave ->working 1 so that this doesn't get more work assigned */
1911 static void ll_find_deltas(struct object_entry
**list
, unsigned list_size
,
1912 int window
, int depth
, unsigned *processed
)
1914 struct thread_params
*p
;
1915 int i
, ret
, active_threads
= 0;
1917 init_threaded_search();
1919 if (!delta_search_threads
) /* --threads=0 means autodetect */
1920 delta_search_threads
= online_cpus();
1921 if (delta_search_threads
<= 1) {
1922 find_deltas(list
, &list_size
, window
, depth
, processed
);
1923 cleanup_threaded_search();
1926 if (progress
> pack_to_stdout
)
1927 fprintf(stderr
, "Delta compression using up to %d threads.\n",
1928 delta_search_threads
);
1929 p
= xcalloc(delta_search_threads
, sizeof(*p
));
1931 /* Partition the work amongst work threads. */
1932 for (i
= 0; i
< delta_search_threads
; i
++) {
1933 unsigned sub_size
= list_size
/ (delta_search_threads
- i
);
1935 /* don't use too small segments or no deltas will be found */
1936 if (sub_size
< 2*window
&& i
+1 < delta_search_threads
)
1939 p
[i
].window
= window
;
1941 p
[i
].processed
= processed
;
1943 p
[i
].data_ready
= 0;
1945 /* try to split chunks on "path" boundaries */
1946 while (sub_size
&& sub_size
< list_size
&&
1947 list
[sub_size
]->hash
&&
1948 list
[sub_size
]->hash
== list
[sub_size
-1]->hash
)
1952 p
[i
].list_size
= sub_size
;
1953 p
[i
].remaining
= sub_size
;
1956 list_size
-= sub_size
;
1959 /* Start work threads. */
1960 for (i
= 0; i
< delta_search_threads
; i
++) {
1961 if (!p
[i
].list_size
)
1963 pthread_mutex_init(&p
[i
].mutex
, NULL
);
1964 pthread_cond_init(&p
[i
].cond
, NULL
);
1965 ret
= pthread_create(&p
[i
].thread
, NULL
,
1966 threaded_find_deltas
, &p
[i
]);
1968 die("unable to create thread: %s", strerror(ret
));
1973 * Now let's wait for work completion. Each time a thread is done
1974 * with its work, we steal half of the remaining work from the
1975 * thread with the largest number of unprocessed objects and give
1976 * it to that newly idle thread. This ensure good load balancing
1977 * until the remaining object list segments are simply too short
1978 * to be worth splitting anymore.
1980 while (active_threads
) {
1981 struct thread_params
*target
= NULL
;
1982 struct thread_params
*victim
= NULL
;
1983 unsigned sub_size
= 0;
1987 for (i
= 0; !target
&& i
< delta_search_threads
; i
++)
1992 pthread_cond_wait(&progress_cond
, &progress_mutex
);
1995 for (i
= 0; i
< delta_search_threads
; i
++)
1996 if (p
[i
].remaining
> 2*window
&&
1997 (!victim
|| victim
->remaining
< p
[i
].remaining
))
2000 sub_size
= victim
->remaining
/ 2;
2001 list
= victim
->list
+ victim
->list_size
- sub_size
;
2002 while (sub_size
&& list
[0]->hash
&&
2003 list
[0]->hash
== list
[-1]->hash
) {
2009 * It is possible for some "paths" to have
2010 * so many objects that no hash boundary
2011 * might be found. Let's just steal the
2012 * exact half in that case.
2014 sub_size
= victim
->remaining
/ 2;
2017 target
->list
= list
;
2018 victim
->list_size
-= sub_size
;
2019 victim
->remaining
-= sub_size
;
2021 target
->list_size
= sub_size
;
2022 target
->remaining
= sub_size
;
2023 target
->working
= 1;
2026 pthread_mutex_lock(&target
->mutex
);
2027 target
->data_ready
= 1;
2028 pthread_cond_signal(&target
->cond
);
2029 pthread_mutex_unlock(&target
->mutex
);
2032 pthread_join(target
->thread
, NULL
);
2033 pthread_cond_destroy(&target
->cond
);
2034 pthread_mutex_destroy(&target
->mutex
);
2038 cleanup_threaded_search();
2043 #define ll_find_deltas(l, s, w, d, p) find_deltas(l, &s, w, d, p)
2046 static int add_ref_tag(const char *path
, const unsigned char *sha1
, int flag
, void *cb_data
)
2048 unsigned char peeled
[20];
2050 if (!prefixcmp(path
, "refs/tags/") && /* is a tag? */
2051 !peel_ref(path
, peeled
) && /* peelable? */
2052 packlist_find(&to_pack
, peeled
, NULL
)) /* object packed? */
2053 add_object_entry(sha1
, OBJ_TAG
, NULL
, 0);
2057 static void prepare_pack(int window
, int depth
)
2059 struct object_entry
**delta_list
;
2060 uint32_t i
, nr_deltas
;
2063 get_object_details();
2066 * If we're locally repacking then we need to be doubly careful
2067 * from now on in order to make sure no stealth corruption gets
2068 * propagated to the new pack. Clients receiving streamed packs
2069 * should validate everything they get anyway so no need to incur
2070 * the additional cost here in that case.
2072 if (!pack_to_stdout
)
2073 do_check_packed_object_crc
= 1;
2075 if (!to_pack
.nr_objects
|| !window
|| !depth
)
2078 delta_list
= xmalloc(to_pack
.nr_objects
* sizeof(*delta_list
));
2081 for (i
= 0; i
< to_pack
.nr_objects
; i
++) {
2082 struct object_entry
*entry
= to_pack
.objects
+ i
;
2085 /* This happens if we decided to reuse existing
2086 * delta from a pack. "reuse_delta &&" is implied.
2090 if (entry
->size
< 50)
2093 if (entry
->no_try_delta
)
2096 if (!entry
->preferred_base
) {
2098 if (entry
->type
< 0)
2099 die("unable to get type of object %s",
2100 sha1_to_hex(entry
->idx
.sha1
));
2102 if (entry
->type
< 0) {
2104 * This object is not found, but we
2105 * don't have to include it anyway.
2111 delta_list
[n
++] = entry
;
2114 if (nr_deltas
&& n
> 1) {
2115 unsigned nr_done
= 0;
2117 progress_state
= start_progress("Compressing objects",
2119 qsort(delta_list
, n
, sizeof(*delta_list
), type_size_sort
);
2120 ll_find_deltas(delta_list
, n
, window
+1, depth
, &nr_done
);
2121 stop_progress(&progress_state
);
2122 if (nr_done
!= nr_deltas
)
2123 die("inconsistency with delta count");
2128 static int git_pack_config(const char *k
, const char *v
, void *cb
)
2130 if (!strcmp(k
, "pack.window")) {
2131 window
= git_config_int(k
, v
);
2134 if (!strcmp(k
, "pack.windowmemory")) {
2135 window_memory_limit
= git_config_ulong(k
, v
);
2138 if (!strcmp(k
, "pack.depth")) {
2139 depth
= git_config_int(k
, v
);
2142 if (!strcmp(k
, "pack.compression")) {
2143 int level
= git_config_int(k
, v
);
2145 level
= Z_DEFAULT_COMPRESSION
;
2146 else if (level
< 0 || level
> Z_BEST_COMPRESSION
)
2147 die("bad pack compression level %d", level
);
2148 pack_compression_level
= level
;
2149 pack_compression_seen
= 1;
2152 if (!strcmp(k
, "pack.deltacachesize")) {
2153 max_delta_cache_size
= git_config_int(k
, v
);
2156 if (!strcmp(k
, "pack.deltacachelimit")) {
2157 cache_max_small_delta_size
= git_config_int(k
, v
);
2160 if (!strcmp(k
, "pack.usebitmaps")) {
2161 use_bitmap_index
= git_config_bool(k
, v
);
2164 if (!strcmp(k
, "pack.threads")) {
2165 delta_search_threads
= git_config_int(k
, v
);
2166 if (delta_search_threads
< 0)
2167 die("invalid number of threads specified (%d)",
2168 delta_search_threads
);
2170 if (delta_search_threads
!= 1)
2171 warning("no threads support, ignoring %s", k
);
2175 if (!strcmp(k
, "pack.indexversion")) {
2176 pack_idx_opts
.version
= git_config_int(k
, v
);
2177 if (pack_idx_opts
.version
> 2)
2178 die("bad pack.indexversion=%"PRIu32
,
2179 pack_idx_opts
.version
);
2182 return git_default_config(k
, v
, cb
);
2185 static void read_object_list_from_stdin(void)
2187 char line
[40 + 1 + PATH_MAX
+ 2];
2188 unsigned char sha1
[20];
2191 if (!fgets(line
, sizeof(line
), stdin
)) {
2195 die("fgets returned NULL, not EOF, not error!");
2201 if (line
[0] == '-') {
2202 if (get_sha1_hex(line
+1, sha1
))
2203 die("expected edge sha1, got garbage:\n %s",
2205 add_preferred_base(sha1
);
2208 if (get_sha1_hex(line
, sha1
))
2209 die("expected sha1, got garbage:\n %s", line
);
2211 add_preferred_base_object(line
+41);
2212 add_object_entry(sha1
, 0, line
+41, 0);
2216 #define OBJECT_ADDED (1u<<20)
2218 static void show_commit(struct commit
*commit
, void *data
)
2220 add_object_entry(commit
->object
.sha1
, OBJ_COMMIT
, NULL
, 0);
2221 commit
->object
.flags
|= OBJECT_ADDED
;
2224 static void show_object(struct object
*obj
,
2225 const struct name_path
*path
, const char *last
,
2228 char *name
= path_name(path
, last
);
2230 add_preferred_base_object(name
);
2231 add_object_entry(obj
->sha1
, obj
->type
, name
, 0);
2232 obj
->flags
|= OBJECT_ADDED
;
2235 * We will have generated the hash from the name,
2236 * but not saved a pointer to it - we can free it
2241 static void show_edge(struct commit
*commit
)
2243 add_preferred_base(commit
->object
.sha1
);
2246 struct in_pack_object
{
2248 struct object
*object
;
2254 struct in_pack_object
*array
;
2257 static void mark_in_pack_object(struct object
*object
, struct packed_git
*p
, struct in_pack
*in_pack
)
2259 in_pack
->array
[in_pack
->nr
].offset
= find_pack_entry_one(object
->sha1
, p
);
2260 in_pack
->array
[in_pack
->nr
].object
= object
;
2265 * Compare the objects in the offset order, in order to emulate the
2266 * "git rev-list --objects" output that produced the pack originally.
2268 static int ofscmp(const void *a_
, const void *b_
)
2270 struct in_pack_object
*a
= (struct in_pack_object
*)a_
;
2271 struct in_pack_object
*b
= (struct in_pack_object
*)b_
;
2273 if (a
->offset
< b
->offset
)
2275 else if (a
->offset
> b
->offset
)
2278 return hashcmp(a
->object
->sha1
, b
->object
->sha1
);
2281 static void add_objects_in_unpacked_packs(struct rev_info
*revs
)
2283 struct packed_git
*p
;
2284 struct in_pack in_pack
;
2287 memset(&in_pack
, 0, sizeof(in_pack
));
2289 for (p
= packed_git
; p
; p
= p
->next
) {
2290 const unsigned char *sha1
;
2293 if (!p
->pack_local
|| p
->pack_keep
)
2295 if (open_pack_index(p
))
2296 die("cannot open pack index");
2298 ALLOC_GROW(in_pack
.array
,
2299 in_pack
.nr
+ p
->num_objects
,
2302 for (i
= 0; i
< p
->num_objects
; i
++) {
2303 sha1
= nth_packed_object_sha1(p
, i
);
2304 o
= lookup_unknown_object(sha1
);
2305 if (!(o
->flags
& OBJECT_ADDED
))
2306 mark_in_pack_object(o
, p
, &in_pack
);
2307 o
->flags
|= OBJECT_ADDED
;
2312 qsort(in_pack
.array
, in_pack
.nr
, sizeof(in_pack
.array
[0]),
2314 for (i
= 0; i
< in_pack
.nr
; i
++) {
2315 struct object
*o
= in_pack
.array
[i
].object
;
2316 add_object_entry(o
->sha1
, o
->type
, "", 0);
2319 free(in_pack
.array
);
2322 static int has_sha1_pack_kept_or_nonlocal(const unsigned char *sha1
)
2324 static struct packed_git
*last_found
= (void *)1;
2325 struct packed_git
*p
;
2327 p
= (last_found
!= (void *)1) ? last_found
: packed_git
;
2330 if ((!p
->pack_local
|| p
->pack_keep
) &&
2331 find_pack_entry_one(sha1
, p
)) {
2335 if (p
== last_found
)
2339 if (p
== last_found
)
2345 static void loosen_unused_packed_objects(struct rev_info
*revs
)
2347 struct packed_git
*p
;
2349 const unsigned char *sha1
;
2351 for (p
= packed_git
; p
; p
= p
->next
) {
2352 if (!p
->pack_local
|| p
->pack_keep
)
2355 if (unpack_unreachable_expiration
&&
2356 p
->mtime
< unpack_unreachable_expiration
)
2359 if (open_pack_index(p
))
2360 die("cannot open pack index");
2362 for (i
= 0; i
< p
->num_objects
; i
++) {
2363 sha1
= nth_packed_object_sha1(p
, i
);
2364 if (!packlist_find(&to_pack
, sha1
, NULL
) &&
2365 !has_sha1_pack_kept_or_nonlocal(sha1
))
2366 if (force_object_loose(sha1
, p
->mtime
))
2367 die("unable to force loose object");
2372 static int get_object_list_from_bitmap(struct rev_info
*revs
)
2374 if (prepare_bitmap_walk(revs
) < 0)
2377 if (!reuse_partial_packfile_from_bitmap(
2379 &reuse_packfile_objects
,
2380 &reuse_packfile_offset
)) {
2381 assert(reuse_packfile_objects
);
2382 nr_result
+= reuse_packfile_objects
;
2385 fprintf(stderr
, "Reusing existing pack: %d, done.\n",
2386 reuse_packfile_objects
);
2391 traverse_bitmap_commit_list(&add_object_entry_from_bitmap
);
2395 static void get_object_list(int ac
, const char **av
)
2397 struct rev_info revs
;
2401 init_revisions(&revs
, NULL
);
2402 save_commit_buffer
= 0;
2403 setup_revisions(ac
, av
, &revs
, NULL
);
2405 while (fgets(line
, sizeof(line
), stdin
) != NULL
) {
2406 int len
= strlen(line
);
2407 if (len
&& line
[len
- 1] == '\n')
2412 if (!strcmp(line
, "--not")) {
2413 flags
^= UNINTERESTING
;
2416 die("not a rev '%s'", line
);
2418 if (handle_revision_arg(line
, &revs
, flags
, REVARG_CANNOT_BE_FILENAME
))
2419 die("bad revision '%s'", line
);
2422 if (use_bitmap_index
&& !get_object_list_from_bitmap(&revs
))
2425 if (prepare_revision_walk(&revs
))
2426 die("revision walk setup failed");
2427 mark_edges_uninteresting(&revs
, show_edge
);
2428 traverse_commit_list(&revs
, show_commit
, show_object
, NULL
);
2430 if (keep_unreachable
)
2431 add_objects_in_unpacked_packs(&revs
);
2432 if (unpack_unreachable
)
2433 loosen_unused_packed_objects(&revs
);
2436 static int option_parse_index_version(const struct option
*opt
,
2437 const char *arg
, int unset
)
2440 const char *val
= arg
;
2441 pack_idx_opts
.version
= strtoul(val
, &c
, 10);
2442 if (pack_idx_opts
.version
> 2)
2443 die(_("unsupported index version %s"), val
);
2444 if (*c
== ',' && c
[1])
2445 pack_idx_opts
.off32_limit
= strtoul(c
+1, &c
, 0);
2446 if (*c
|| pack_idx_opts
.off32_limit
& 0x80000000)
2447 die(_("bad index version '%s'"), val
);
2451 static int option_parse_unpack_unreachable(const struct option
*opt
,
2452 const char *arg
, int unset
)
2455 unpack_unreachable
= 0;
2456 unpack_unreachable_expiration
= 0;
2459 unpack_unreachable
= 1;
2461 unpack_unreachable_expiration
= approxidate(arg
);
2466 static int option_parse_ulong(const struct option
*opt
,
2467 const char *arg
, int unset
)
2470 die(_("option %s does not accept negative form"),
2473 if (!git_parse_ulong(arg
, opt
->value
))
2474 die(_("unable to parse value '%s' for option %s"),
2475 arg
, opt
->long_name
);
2479 #define OPT_ULONG(s, l, v, h) \
2480 { OPTION_CALLBACK, (s), (l), (v), "n", (h), \
2481 PARSE_OPT_NONEG, option_parse_ulong }
2483 int cmd_pack_objects(int argc
, const char **argv
, const char *prefix
)
2485 int use_internal_rev_list
= 0;
2487 int all_progress_implied
= 0;
2488 const char *rp_av
[6];
2490 int rev_list_unpacked
= 0, rev_list_all
= 0, rev_list_reflog
= 0;
2491 struct option pack_objects_options
[] = {
2492 OPT_SET_INT('q', "quiet", &progress
,
2493 N_("do not show progress meter"), 0),
2494 OPT_SET_INT(0, "progress", &progress
,
2495 N_("show progress meter"), 1),
2496 OPT_SET_INT(0, "all-progress", &progress
,
2497 N_("show progress meter during object writing phase"), 2),
2498 OPT_BOOL(0, "all-progress-implied",
2499 &all_progress_implied
,
2500 N_("similar to --all-progress when progress meter is shown")),
2501 { OPTION_CALLBACK
, 0, "index-version", NULL
, N_("version[,offset]"),
2502 N_("write the pack index file in the specified idx format version"),
2503 0, option_parse_index_version
},
2504 OPT_ULONG(0, "max-pack-size", &pack_size_limit
,
2505 N_("maximum size of each output pack file")),
2506 OPT_BOOL(0, "local", &local
,
2507 N_("ignore borrowed objects from alternate object store")),
2508 OPT_BOOL(0, "incremental", &incremental
,
2509 N_("ignore packed objects")),
2510 OPT_INTEGER(0, "window", &window
,
2511 N_("limit pack window by objects")),
2512 OPT_ULONG(0, "window-memory", &window_memory_limit
,
2513 N_("limit pack window by memory in addition to object limit")),
2514 OPT_INTEGER(0, "depth", &depth
,
2515 N_("maximum length of delta chain allowed in the resulting pack")),
2516 OPT_BOOL(0, "reuse-delta", &reuse_delta
,
2517 N_("reuse existing deltas")),
2518 OPT_BOOL(0, "reuse-object", &reuse_object
,
2519 N_("reuse existing objects")),
2520 OPT_BOOL(0, "delta-base-offset", &allow_ofs_delta
,
2521 N_("use OFS_DELTA objects")),
2522 OPT_INTEGER(0, "threads", &delta_search_threads
,
2523 N_("use threads when searching for best delta matches")),
2524 OPT_BOOL(0, "non-empty", &non_empty
,
2525 N_("do not create an empty pack output")),
2526 OPT_BOOL(0, "revs", &use_internal_rev_list
,
2527 N_("read revision arguments from standard input")),
2528 { OPTION_SET_INT
, 0, "unpacked", &rev_list_unpacked
, NULL
,
2529 N_("limit the objects to those that are not yet packed"),
2530 PARSE_OPT_NOARG
| PARSE_OPT_NONEG
, NULL
, 1 },
2531 { OPTION_SET_INT
, 0, "all", &rev_list_all
, NULL
,
2532 N_("include objects reachable from any reference"),
2533 PARSE_OPT_NOARG
| PARSE_OPT_NONEG
, NULL
, 1 },
2534 { OPTION_SET_INT
, 0, "reflog", &rev_list_reflog
, NULL
,
2535 N_("include objects referred by reflog entries"),
2536 PARSE_OPT_NOARG
| PARSE_OPT_NONEG
, NULL
, 1 },
2537 OPT_BOOL(0, "stdout", &pack_to_stdout
,
2538 N_("output pack to stdout")),
2539 OPT_BOOL(0, "include-tag", &include_tag
,
2540 N_("include tag objects that refer to objects to be packed")),
2541 OPT_BOOL(0, "keep-unreachable", &keep_unreachable
,
2542 N_("keep unreachable objects")),
2543 { OPTION_CALLBACK
, 0, "unpack-unreachable", NULL
, N_("time"),
2544 N_("unpack unreachable objects newer than <time>"),
2545 PARSE_OPT_OPTARG
, option_parse_unpack_unreachable
},
2546 OPT_BOOL(0, "thin", &thin
,
2547 N_("create thin packs")),
2548 OPT_BOOL(0, "honor-pack-keep", &ignore_packed_keep
,
2549 N_("ignore packs that have companion .keep file")),
2550 OPT_INTEGER(0, "compression", &pack_compression_level
,
2551 N_("pack compression level")),
2552 OPT_SET_INT(0, "keep-true-parents", &grafts_replace_parents
,
2553 N_("do not hide commits by grafts"), 0),
2554 OPT_BOOL(0, "use-bitmap-index", &use_bitmap_index
,
2555 N_("use a bitmap index if available to speed up counting objects")),
2559 read_replace_refs
= 0;
2561 reset_pack_idx_option(&pack_idx_opts
);
2562 git_config(git_pack_config
, NULL
);
2563 if (!pack_compression_seen
&& core_compression_seen
)
2564 pack_compression_level
= core_compression_level
;
2566 progress
= isatty(2);
2567 argc
= parse_options(argc
, argv
, prefix
, pack_objects_options
,
2571 base_name
= argv
[0];
2574 if (pack_to_stdout
!= !base_name
|| argc
)
2575 usage_with_options(pack_usage
, pack_objects_options
);
2577 rp_av
[rp_ac
++] = "pack-objects";
2579 use_internal_rev_list
= 1;
2580 rp_av
[rp_ac
++] = "--objects-edge";
2582 rp_av
[rp_ac
++] = "--objects";
2585 use_internal_rev_list
= 1;
2586 rp_av
[rp_ac
++] = "--all";
2588 if (rev_list_reflog
) {
2589 use_internal_rev_list
= 1;
2590 rp_av
[rp_ac
++] = "--reflog";
2592 if (rev_list_unpacked
) {
2593 use_internal_rev_list
= 1;
2594 rp_av
[rp_ac
++] = "--unpacked";
2599 if (pack_compression_level
== -1)
2600 pack_compression_level
= Z_DEFAULT_COMPRESSION
;
2601 else if (pack_compression_level
< 0 || pack_compression_level
> Z_BEST_COMPRESSION
)
2602 die("bad pack compression level %d", pack_compression_level
);
2604 if (delta_search_threads
!= 1)
2605 warning("no threads support, ignoring --threads");
2607 if (!pack_to_stdout
&& !pack_size_limit
)
2608 pack_size_limit
= pack_size_limit_cfg
;
2609 if (pack_to_stdout
&& pack_size_limit
)
2610 die("--max-pack-size cannot be used to build a pack for transfer.");
2611 if (pack_size_limit
&& pack_size_limit
< 1024*1024) {
2612 warning("minimum pack size limit is 1 MiB");
2613 pack_size_limit
= 1024*1024;
2616 if (!pack_to_stdout
&& thin
)
2617 die("--thin cannot be used to build an indexable pack.");
2619 if (keep_unreachable
&& unpack_unreachable
)
2620 die("--keep-unreachable and --unpack-unreachable are incompatible.");
2622 if (!use_internal_rev_list
|| !pack_to_stdout
|| is_repository_shallow())
2623 use_bitmap_index
= 0;
2625 if (progress
&& all_progress_implied
)
2628 prepare_packed_git();
2631 progress_state
= start_progress("Counting objects", 0);
2632 if (!use_internal_rev_list
)
2633 read_object_list_from_stdin();
2635 rp_av
[rp_ac
] = NULL
;
2636 get_object_list(rp_ac
, rp_av
);
2638 cleanup_preferred_base();
2639 if (include_tag
&& nr_result
)
2640 for_each_ref(add_ref_tag
, NULL
);
2641 stop_progress(&progress_state
);
2643 if (non_empty
&& !nr_result
)
2646 prepare_pack(window
, depth
);
2649 fprintf(stderr
, "Total %"PRIu32
" (delta %"PRIu32
"),"
2650 " reused %"PRIu32
" (delta %"PRIu32
")\n",
2651 written
, written_delta
, reused
, reused_delta
);