![[tokkee]](http://tokkee.org/images/avatar.png){kind=avatar}
1 #include "builtin.h"
2 #include "cache.h"
3 #include "attr.h"
4 #include "object.h"
5 #include "blob.h"
6 #include "commit.h"
7 #include "tag.h"
8 #include "tree.h"
9 #include "delta.h"
10 #include "pack.h"
11 #include "pack-revindex.h"
12 #include "csum-file.h"
13 #include "tree-walk.h"
14 #include "diff.h"
15 #include "revision.h"
16 #include "list-objects.h"
17 #include "progress.h"
18 #include "refs.h"
20 #ifdef THREADED_DELTA_SEARCH
21 #include "thread-utils.h"
22 #include <pthread.h>
23 #endif
25 static const char pack_usage[] = "\
26 git pack-objects [{ -q | --progress | --all-progress }] \n\
27 [--max-pack-size=N] [--local] [--incremental] \n\
28 [--window=N] [--window-memory=N] [--depth=N] \n\
29 [--no-reuse-delta] [--no-reuse-object] [--delta-base-offset] \n\
30 [--threads=N] [--non-empty] [--revs [--unpacked | --all]*] [--reflog] \n\
31 [--stdout | base-name] [--include-tag] \n\
32 [--keep-unreachable | --unpack-unreachable] \n\
33 [<ref-list | <object-list]";
35 struct object_entry {
36 struct pack_idx_entry idx;
37 unsigned long size; /* uncompressed size */
38 struct packed_git *in_pack; /* already in pack */
39 off_t in_pack_offset;
40 struct object_entry *delta; /* delta base object */
41 struct object_entry *delta_child; /* deltified objects who bases me */
42 struct object_entry *delta_sibling; /* other deltified objects who
43 * uses the same base as me
44 */
45 void *delta_data; /* cached delta (uncompressed) */
46 unsigned long delta_size; /* delta data size (uncompressed) */
47 unsigned long z_delta_size; /* delta data size (compressed) */
48 unsigned int hash; /* name hint hash */
49 enum object_type type;
50 enum object_type in_pack_type; /* could be delta */
51 unsigned char in_pack_header_size;
52 unsigned char preferred_base; /* we do not pack this, but is available
53 * to be used as the base object to delta
54 * objects against.
55 */
56 unsigned char no_try_delta;
57 };
59 /*
60 * Objects we are going to pack are collected in objects array (dynamically
61 * expanded). nr_objects & nr_alloc controls this array. They are stored
62 * in the order we see -- typically rev-list --objects order that gives us
63 * nice "minimum seek" order.
64 */
65 static struct object_entry *objects;
66 static struct pack_idx_entry **written_list;
67 static uint32_t nr_objects, nr_alloc, nr_result, nr_written;
69 static int non_empty;
70 static int reuse_delta = 1, reuse_object = 1;
71 static int keep_unreachable, unpack_unreachable, include_tag;
72 static int local;
73 static int incremental;
74 static int ignore_packed_keep;
75 static int allow_ofs_delta;
76 static const char *base_name;
77 static int progress = 1;
78 static int window = 10;
79 static uint32_t pack_size_limit, pack_size_limit_cfg;
80 static int depth = 50;
81 static int delta_search_threads;
82 static int pack_to_stdout;
83 static int num_preferred_base;
84 static struct progress *progress_state;
85 static int pack_compression_level = Z_DEFAULT_COMPRESSION;
86 static int pack_compression_seen;
88 static unsigned long delta_cache_size = 0;
89 static unsigned long max_delta_cache_size = 0;
90 static unsigned long cache_max_small_delta_size = 1000;
92 static unsigned long window_memory_limit = 0;
94 /*
95 * The object names in objects array are hashed with this hashtable,
96 * to help looking up the entry by object name.
97 * This hashtable is built after all the objects are seen.
98 */
99 static int *object_ix;
100 static int object_ix_hashsz;
102 /*
103 * stats
104 */
105 static uint32_t written, written_delta;
106 static uint32_t reused, reused_delta;
109 static void *get_delta(struct object_entry *entry)
110 {
111 unsigned long size, base_size, delta_size;
112 void *buf, *base_buf, *delta_buf;
113 enum object_type type;
115 buf = read_sha1_file(entry->idx.sha1, &type, &size);
116 if (!buf)
117 die("unable to read %s", sha1_to_hex(entry->idx.sha1));
118 base_buf = read_sha1_file(entry->delta->idx.sha1, &type, &base_size);
119 if (!base_buf)
120 die("unable to read %s", sha1_to_hex(entry->delta->idx.sha1));
121 delta_buf = diff_delta(base_buf, base_size,
122 buf, size, &delta_size, 0);
123 if (!delta_buf || delta_size != entry->delta_size)
124 die("delta size changed");
125 free(buf);
126 free(base_buf);
127 return delta_buf;
128 }
130 static unsigned long do_compress(void **pptr, unsigned long size)
131 {
132 z_stream stream;
133 void *in, *out;
134 unsigned long maxsize;
136 memset(&stream, 0, sizeof(stream));
137 deflateInit(&stream, pack_compression_level);
138 maxsize = deflateBound(&stream, size);
140 in = *pptr;
141 out = xmalloc(maxsize);
142 *pptr = out;
144 stream.next_in = in;
145 stream.avail_in = size;
146 stream.next_out = out;
147 stream.avail_out = maxsize;
148 while (deflate(&stream, Z_FINISH) == Z_OK)
149 ; /* nothing */
150 deflateEnd(&stream);
152 free(in);
153 return stream.total_out;
154 }
156 /*
157 * The per-object header is a pretty dense thing, which is
158 * - first byte: low four bits are "size", then three bits of "type",
159 * and the high bit is "size continues".
160 * - each byte afterwards: low seven bits are size continuation,
161 * with the high bit being "size continues"
162 */
163 static int encode_header(enum object_type type, unsigned long size, unsigned char *hdr)
164 {
165 int n = 1;
166 unsigned char c;
168 if (type < OBJ_COMMIT || type > OBJ_REF_DELTA)
169 die("bad type %d", type);
171 c = (type << 4) | (size & 15);
172 size >>= 4;
173 while (size) {
174 *hdr++ = c | 0x80;
175 c = size & 0x7f;
176 size >>= 7;
177 n++;
178 }
179 *hdr = c;
180 return n;
181 }
183 /*
184 * we are going to reuse the existing object data as is. make
185 * sure it is not corrupt.
186 */
187 static int check_pack_inflate(struct packed_git *p,
188 struct pack_window **w_curs,
189 off_t offset,
190 off_t len,
191 unsigned long expect)
192 {
193 z_stream stream;
194 unsigned char fakebuf[4096], *in;
195 int st;
197 memset(&stream, 0, sizeof(stream));
198 git_inflate_init(&stream);
199 do {
200 in = use_pack(p, w_curs, offset, &stream.avail_in);
201 stream.next_in = in;
202 stream.next_out = fakebuf;
203 stream.avail_out = sizeof(fakebuf);
204 st = git_inflate(&stream, Z_FINISH);
205 offset += stream.next_in - in;
206 } while (st == Z_OK || st == Z_BUF_ERROR);
207 git_inflate_end(&stream);
208 return (st == Z_STREAM_END &&
209 stream.total_out == expect &&
210 stream.total_in == len) ? 0 : -1;
211 }
213 static void copy_pack_data(struct sha1file *f,
214 struct packed_git *p,
215 struct pack_window **w_curs,
216 off_t offset,
217 off_t len)
218 {
219 unsigned char *in;
220 unsigned int avail;
222 while (len) {
223 in = use_pack(p, w_curs, offset, &avail);
224 if (avail > len)
225 avail = (unsigned int)len;
226 sha1write(f, in, avail);
227 offset += avail;
228 len -= avail;
229 }
230 }
232 static unsigned long write_object(struct sha1file *f,
233 struct object_entry *entry,
234 off_t write_offset)
235 {
236 unsigned long size, limit, datalen;
237 void *buf;
238 unsigned char header[10], dheader[10];
239 unsigned hdrlen;
240 enum object_type type;
241 int usable_delta, to_reuse;
243 if (!pack_to_stdout)
244 crc32_begin(f);
246 type = entry->type;
248 /* write limit if limited packsize and not first object */
249 if (!pack_size_limit || !nr_written)
250 limit = 0;
251 else if (pack_size_limit <= write_offset)
252 /*
253 * the earlier object did not fit the limit; avoid
254 * mistaking this with unlimited (i.e. limit = 0).
255 */
256 limit = 1;
257 else
258 limit = pack_size_limit - write_offset;
260 if (!entry->delta)
261 usable_delta = 0; /* no delta */
262 else if (!pack_size_limit)
263 usable_delta = 1; /* unlimited packfile */
264 else if (entry->delta->idx.offset == (off_t)-1)
265 usable_delta = 0; /* base was written to another pack */
266 else if (entry->delta->idx.offset)
267 usable_delta = 1; /* base already exists in this pack */
268 else
269 usable_delta = 0; /* base could end up in another pack */
271 if (!reuse_object)
272 to_reuse = 0; /* explicit */
273 else if (!entry->in_pack)
274 to_reuse = 0; /* can't reuse what we don't have */
275 else if (type == OBJ_REF_DELTA || type == OBJ_OFS_DELTA)
276 /* check_object() decided it for us ... */
277 to_reuse = usable_delta;
278 /* ... but pack split may override that */
279 else if (type != entry->in_pack_type)
280 to_reuse = 0; /* pack has delta which is unusable */
281 else if (entry->delta)
282 to_reuse = 0; /* we want to pack afresh */
283 else
284 to_reuse = 1; /* we have it in-pack undeltified,
285 * and we do not need to deltify it.
286 */
288 if (!to_reuse) {
289 no_reuse:
290 if (!usable_delta) {
291 buf = read_sha1_file(entry->idx.sha1, &type, &size);
292 if (!buf)
293 die("unable to read %s", sha1_to_hex(entry->idx.sha1));
294 /*
295 * make sure no cached delta data remains from a
296 * previous attempt before a pack split occurred.
297 */
298 free(entry->delta_data);
299 entry->delta_data = NULL;
300 entry->z_delta_size = 0;
301 } else if (entry->delta_data) {
302 size = entry->delta_size;
303 buf = entry->delta_data;
304 entry->delta_data = NULL;
305 type = (allow_ofs_delta && entry->delta->idx.offset) ?
306 OBJ_OFS_DELTA : OBJ_REF_DELTA;
307 } else {
308 buf = get_delta(entry);
309 size = entry->delta_size;
310 type = (allow_ofs_delta && entry->delta->idx.offset) ?
311 OBJ_OFS_DELTA : OBJ_REF_DELTA;
312 }
314 if (entry->z_delta_size)
315 datalen = entry->z_delta_size;
316 else
317 datalen = do_compress(&buf, size);
319 /*
320 * The object header is a byte of 'type' followed by zero or
321 * more bytes of length.
322 */
323 hdrlen = encode_header(type, size, header);
325 if (type == OBJ_OFS_DELTA) {
326 /*
327 * Deltas with relative base contain an additional
328 * encoding of the relative offset for the delta
329 * base from this object's position in the pack.
330 */
331 off_t ofs = entry->idx.offset - entry->delta->idx.offset;
332 unsigned pos = sizeof(dheader) - 1;
333 dheader[pos] = ofs & 127;
334 while (ofs >>= 7)
335 dheader[--pos] = 128 | (--ofs & 127);
336 if (limit && hdrlen + sizeof(dheader) - pos + datalen + 20 >= limit) {
337 free(buf);
338 return 0;
339 }
340 sha1write(f, header, hdrlen);
341 sha1write(f, dheader + pos, sizeof(dheader) - pos);
342 hdrlen += sizeof(dheader) - pos;
343 } else if (type == OBJ_REF_DELTA) {
344 /*
345 * Deltas with a base reference contain
346 * an additional 20 bytes for the base sha1.
347 */
348 if (limit && hdrlen + 20 + datalen + 20 >= limit) {
349 free(buf);
350 return 0;
351 }
352 sha1write(f, header, hdrlen);
353 sha1write(f, entry->delta->idx.sha1, 20);
354 hdrlen += 20;
355 } else {
356 if (limit && hdrlen + datalen + 20 >= limit) {
357 free(buf);
358 return 0;
359 }
360 sha1write(f, header, hdrlen);
361 }
362 sha1write(f, buf, datalen);
363 free(buf);
364 }
365 else {
366 struct packed_git *p = entry->in_pack;
367 struct pack_window *w_curs = NULL;
368 struct revindex_entry *revidx;
369 off_t offset;
371 if (entry->delta)
372 type = (allow_ofs_delta && entry->delta->idx.offset) ?
373 OBJ_OFS_DELTA : OBJ_REF_DELTA;
374 hdrlen = encode_header(type, entry->size, header);
376 offset = entry->in_pack_offset;
377 revidx = find_pack_revindex(p, offset);
378 datalen = revidx[1].offset - offset;
379 if (!pack_to_stdout && p->index_version > 1 &&
380 check_pack_crc(p, &w_curs, offset, datalen, revidx->nr)) {
381 error("bad packed object CRC for %s", sha1_to_hex(entry->idx.sha1));
382 unuse_pack(&w_curs);
383 goto no_reuse;
384 }
386 offset += entry->in_pack_header_size;
387 datalen -= entry->in_pack_header_size;
388 if (!pack_to_stdout && p->index_version == 1 &&
389 check_pack_inflate(p, &w_curs, offset, datalen, entry->size)) {
390 error("corrupt packed object for %s", sha1_to_hex(entry->idx.sha1));
391 unuse_pack(&w_curs);
392 goto no_reuse;
393 }
395 if (type == OBJ_OFS_DELTA) {
396 off_t ofs = entry->idx.offset - entry->delta->idx.offset;
397 unsigned pos = sizeof(dheader) - 1;
398 dheader[pos] = ofs & 127;
399 while (ofs >>= 7)
400 dheader[--pos] = 128 | (--ofs & 127);
401 if (limit && hdrlen + sizeof(dheader) - pos + datalen + 20 >= limit) {
402 unuse_pack(&w_curs);
403 return 0;
404 }
405 sha1write(f, header, hdrlen);
406 sha1write(f, dheader + pos, sizeof(dheader) - pos);
407 hdrlen += sizeof(dheader) - pos;
408 reused_delta++;
409 } else if (type == OBJ_REF_DELTA) {
410 if (limit && hdrlen + 20 + datalen + 20 >= limit) {
411 unuse_pack(&w_curs);
412 return 0;
413 }
414 sha1write(f, header, hdrlen);
415 sha1write(f, entry->delta->idx.sha1, 20);
416 hdrlen += 20;
417 reused_delta++;
418 } else {
419 if (limit && hdrlen + datalen + 20 >= limit) {
420 unuse_pack(&w_curs);
421 return 0;
422 }
423 sha1write(f, header, hdrlen);
424 }
425 copy_pack_data(f, p, &w_curs, offset, datalen);
426 unuse_pack(&w_curs);
427 reused++;
428 }
429 if (usable_delta)
430 written_delta++;
431 written++;
432 if (!pack_to_stdout)
433 entry->idx.crc32 = crc32_end(f);
434 return hdrlen + datalen;
435 }
437 static int write_one(struct sha1file *f,
438 struct object_entry *e,
439 off_t *offset)
440 {
441 unsigned long size;
443 /* offset is non zero if object is written already. */
444 if (e->idx.offset || e->preferred_base)
445 return 1;
447 /* if we are deltified, write out base object first. */
448 if (e->delta && !write_one(f, e->delta, offset))
449 return 0;
451 e->idx.offset = *offset;
452 size = write_object(f, e, *offset);
453 if (!size) {
454 e->idx.offset = 0;
455 return 0;
456 }
457 written_list[nr_written++] = &e->idx;
459 /* make sure off_t is sufficiently large not to wrap */
460 if (*offset > *offset + size)
461 die("pack too large for current definition of off_t");
462 *offset += size;
463 return 1;
464 }
466 /* forward declaration for write_pack_file */
467 static int adjust_perm(const char *path, mode_t mode);
469 static void write_pack_file(void)
470 {
471 uint32_t i = 0, j;
472 struct sha1file *f;
473 off_t offset;
474 struct pack_header hdr;
475 uint32_t nr_remaining = nr_result;
476 time_t last_mtime = 0;
478 if (progress > pack_to_stdout)
479 progress_state = start_progress("Writing objects", nr_result);
480 written_list = xmalloc(nr_objects * sizeof(*written_list));
482 do {
483 unsigned char sha1[20];
484 char *pack_tmp_name = NULL;
486 if (pack_to_stdout) {
487 f = sha1fd_throughput(1, "<stdout>", progress_state);
488 } else {
489 char tmpname[PATH_MAX];
490 int fd;
491 fd = odb_mkstemp(tmpname, sizeof(tmpname),
492 "pack/tmp_pack_XXXXXX");
493 pack_tmp_name = xstrdup(tmpname);
494 f = sha1fd(fd, pack_tmp_name);
495 }
497 hdr.hdr_signature = htonl(PACK_SIGNATURE);
498 hdr.hdr_version = htonl(PACK_VERSION);
499 hdr.hdr_entries = htonl(nr_remaining);
500 sha1write(f, &hdr, sizeof(hdr));
501 offset = sizeof(hdr);
502 nr_written = 0;
503 for (; i < nr_objects; i++) {
504 if (!write_one(f, objects + i, &offset))
505 break;
506 display_progress(progress_state, written);
507 }
509 /*
510 * Did we write the wrong # entries in the header?
511 * If so, rewrite it like in fast-import
512 */
513 if (pack_to_stdout) {
514 sha1close(f, sha1, CSUM_CLOSE);
515 } else if (nr_written == nr_remaining) {
516 sha1close(f, sha1, CSUM_FSYNC);
517 } else {
518 int fd = sha1close(f, sha1, 0);
519 fixup_pack_header_footer(fd, sha1, pack_tmp_name,
520 nr_written, sha1, offset);
521 close(fd);
522 }
524 if (!pack_to_stdout) {
525 mode_t mode = umask(0);
526 struct stat st;
527 char *idx_tmp_name, tmpname[PATH_MAX];
529 umask(mode);
530 mode = 0444 & ~mode;
532 idx_tmp_name = write_idx_file(NULL, written_list,
533 nr_written, sha1);
535 snprintf(tmpname, sizeof(tmpname), "%s-%s.pack",
536 base_name, sha1_to_hex(sha1));
537 free_pack_by_name(tmpname);
538 if (adjust_perm(pack_tmp_name, mode))
539 die("unable to make temporary pack file readable: %s",
540 strerror(errno));
541 if (rename(pack_tmp_name, tmpname))
542 die("unable to rename temporary pack file: %s",
543 strerror(errno));
545 /*
546 * Packs are runtime accessed in their mtime
547 * order since newer packs are more likely to contain
548 * younger objects. So if we are creating multiple
549 * packs then we should modify the mtime of later ones
550 * to preserve this property.
551 */
552 if (stat(tmpname, &st) < 0) {
553 warning("failed to stat %s: %s",
554 tmpname, strerror(errno));
555 } else if (!last_mtime) {
556 last_mtime = st.st_mtime;
557 } else {
558 struct utimbuf utb;
559 utb.actime = st.st_atime;
560 utb.modtime = --last_mtime;
561 if (utime(tmpname, &utb) < 0)
562 warning("failed utime() on %s: %s",
563 tmpname, strerror(errno));
564 }
566 snprintf(tmpname, sizeof(tmpname), "%s-%s.idx",
567 base_name, sha1_to_hex(sha1));
568 if (adjust_perm(idx_tmp_name, mode))
569 die("unable to make temporary index file readable: %s",
570 strerror(errno));
571 if (rename(idx_tmp_name, tmpname))
572 die("unable to rename temporary index file: %s",
573 strerror(errno));
575 free(idx_tmp_name);
576 free(pack_tmp_name);
577 puts(sha1_to_hex(sha1));
578 }
580 /* mark written objects as written to previous pack */
581 for (j = 0; j < nr_written; j++) {
582 written_list[j]->offset = (off_t)-1;
583 }
584 nr_remaining -= nr_written;
585 } while (nr_remaining && i < nr_objects);
587 free(written_list);
588 stop_progress(&progress_state);
589 if (written != nr_result)
590 die("wrote %"PRIu32" objects while expecting %"PRIu32,
591 written, nr_result);
592 /*
593 * We have scanned through [0 ... i). Since we have written
594 * the correct number of objects, the remaining [i ... nr_objects)
595 * items must be either already written (due to out-of-order delta base)
596 * or a preferred base. Count those which are neither and complain if any.
597 */
598 for (j = 0; i < nr_objects; i++) {
599 struct object_entry *e = objects + i;
600 j += !e->idx.offset && !e->preferred_base;
601 }
602 if (j)
603 die("wrote %"PRIu32" objects as expected but %"PRIu32
604 " unwritten", written, j);
605 }
607 static int locate_object_entry_hash(const unsigned char *sha1)
608 {
609 int i;
610 unsigned int ui;
611 memcpy(&ui, sha1, sizeof(unsigned int));
612 i = ui % object_ix_hashsz;
613 while (0 < object_ix[i]) {
614 if (!hashcmp(sha1, objects[object_ix[i] - 1].idx.sha1))
615 return i;
616 if (++i == object_ix_hashsz)
617 i = 0;
618 }
619 return -1 - i;
620 }
622 static struct object_entry *locate_object_entry(const unsigned char *sha1)
623 {
624 int i;
626 if (!object_ix_hashsz)
627 return NULL;
629 i = locate_object_entry_hash(sha1);
630 if (0 <= i)
631 return &objects[object_ix[i]-1];
632 return NULL;
633 }
635 static void rehash_objects(void)
636 {
637 uint32_t i;
638 struct object_entry *oe;
640 object_ix_hashsz = nr_objects * 3;
641 if (object_ix_hashsz < 1024)
642 object_ix_hashsz = 1024;
643 object_ix = xrealloc(object_ix, sizeof(int) * object_ix_hashsz);
644 memset(object_ix, 0, sizeof(int) * object_ix_hashsz);
645 for (i = 0, oe = objects; i < nr_objects; i++, oe++) {
646 int ix = locate_object_entry_hash(oe->idx.sha1);
647 if (0 <= ix)
648 continue;
649 ix = -1 - ix;
650 object_ix[ix] = i + 1;
651 }
652 }
654 static unsigned name_hash(const char *name)
655 {
656 unsigned c, hash = 0;
658 if (!name)
659 return 0;
661 /*
662 * This effectively just creates a sortable number from the
663 * last sixteen non-whitespace characters. Last characters
664 * count "most", so things that end in ".c" sort together.
665 */
666 while ((c = *name++) != 0) {
667 if (isspace(c))
668 continue;
669 hash = (hash >> 2) + (c << 24);
670 }
671 return hash;
672 }
674 static void setup_delta_attr_check(struct git_attr_check *check)
675 {
676 static struct git_attr *attr_delta;
678 if (!attr_delta)
679 attr_delta = git_attr("delta", 5);
681 check[0].attr = attr_delta;
682 }
684 static int no_try_delta(const char *path)
685 {
686 struct git_attr_check check[1];
688 setup_delta_attr_check(check);
689 if (git_checkattr(path, ARRAY_SIZE(check), check))
690 return 0;
691 if (ATTR_FALSE(check->value))
692 return 1;
693 return 0;
694 }
696 static int add_object_entry(const unsigned char *sha1, enum object_type type,
697 const char *name, int exclude)
698 {
699 struct object_entry *entry;
700 struct packed_git *p, *found_pack = NULL;
701 off_t found_offset = 0;
702 int ix;
703 unsigned hash = name_hash(name);
705 ix = nr_objects ? locate_object_entry_hash(sha1) : -1;
706 if (ix >= 0) {
707 if (exclude) {
708 entry = objects + object_ix[ix] - 1;
709 if (!entry->preferred_base)
710 nr_result--;
711 entry->preferred_base = 1;
712 }
713 return 0;
714 }
716 if (!exclude && local && has_loose_object_nonlocal(sha1))
717 return 0;
719 for (p = packed_git; p; p = p->next) {
720 off_t offset = find_pack_entry_one(sha1, p);
721 if (offset) {
722 if (!found_pack) {
723 found_offset = offset;
724 found_pack = p;
725 }
726 if (exclude)
727 break;
728 if (incremental)
729 return 0;
730 if (local && !p->pack_local)
731 return 0;
732 if (ignore_packed_keep && p->pack_local && p->pack_keep)
733 return 0;
734 }
735 }
737 if (nr_objects >= nr_alloc) {
738 nr_alloc = (nr_alloc + 1024) * 3 / 2;
739 objects = xrealloc(objects, nr_alloc * sizeof(*entry));
740 }
742 entry = objects + nr_objects++;
743 memset(entry, 0, sizeof(*entry));
744 hashcpy(entry->idx.sha1, sha1);
745 entry->hash = hash;
746 if (type)
747 entry->type = type;
748 if (exclude)
749 entry->preferred_base = 1;
750 else
751 nr_result++;
752 if (found_pack) {
753 entry->in_pack = found_pack;
754 entry->in_pack_offset = found_offset;
755 }
757 if (object_ix_hashsz * 3 <= nr_objects * 4)
758 rehash_objects();
759 else
760 object_ix[-1 - ix] = nr_objects;
762 display_progress(progress_state, nr_objects);
764 if (name && no_try_delta(name))
765 entry->no_try_delta = 1;
767 return 1;
768 }
770 struct pbase_tree_cache {
771 unsigned char sha1[20];
772 int ref;
773 int temporary;
774 void *tree_data;
775 unsigned long tree_size;
776 };
778 static struct pbase_tree_cache *(pbase_tree_cache[256]);
779 static int pbase_tree_cache_ix(const unsigned char *sha1)
780 {
781 return sha1[0] % ARRAY_SIZE(pbase_tree_cache);
782 }
783 static int pbase_tree_cache_ix_incr(int ix)
784 {
785 return (ix+1) % ARRAY_SIZE(pbase_tree_cache);
786 }
788 static struct pbase_tree {
789 struct pbase_tree *next;
790 /* This is a phony "cache" entry; we are not
791 * going to evict it nor find it through _get()
792 * mechanism -- this is for the toplevel node that
793 * would almost always change with any commit.
794 */
795 struct pbase_tree_cache pcache;
796 } *pbase_tree;
798 static struct pbase_tree_cache *pbase_tree_get(const unsigned char *sha1)
799 {
800 struct pbase_tree_cache *ent, *nent;
801 void *data;
802 unsigned long size;
803 enum object_type type;
804 int neigh;
805 int my_ix = pbase_tree_cache_ix(sha1);
806 int available_ix = -1;
808 /* pbase-tree-cache acts as a limited hashtable.
809 * your object will be found at your index or within a few
810 * slots after that slot if it is cached.
811 */
812 for (neigh = 0; neigh < 8; neigh++) {
813 ent = pbase_tree_cache[my_ix];
814 if (ent && !hashcmp(ent->sha1, sha1)) {
815 ent->ref++;
816 return ent;
817 }
818 else if (((available_ix < 0) && (!ent || !ent->ref)) ||
819 ((0 <= available_ix) &&
820 (!ent && pbase_tree_cache[available_ix])))
821 available_ix = my_ix;
822 if (!ent)
823 break;
824 my_ix = pbase_tree_cache_ix_incr(my_ix);
825 }
827 /* Did not find one. Either we got a bogus request or
828 * we need to read and perhaps cache.
829 */
830 data = read_sha1_file(sha1, &type, &size);
831 if (!data)
832 return NULL;
833 if (type != OBJ_TREE) {
834 free(data);
835 return NULL;
836 }
838 /* We need to either cache or return a throwaway copy */
840 if (available_ix < 0)
841 ent = NULL;
842 else {
843 ent = pbase_tree_cache[available_ix];
844 my_ix = available_ix;
845 }
847 if (!ent) {
848 nent = xmalloc(sizeof(*nent));
849 nent->temporary = (available_ix < 0);
850 }
851 else {
852 /* evict and reuse */
853 free(ent->tree_data);
854 nent = ent;
855 }
856 hashcpy(nent->sha1, sha1);
857 nent->tree_data = data;
858 nent->tree_size = size;
859 nent->ref = 1;
860 if (!nent->temporary)
861 pbase_tree_cache[my_ix] = nent;
862 return nent;
863 }
865 static void pbase_tree_put(struct pbase_tree_cache *cache)
866 {
867 if (!cache->temporary) {
868 cache->ref--;
869 return;
870 }
871 free(cache->tree_data);
872 free(cache);
873 }
875 static int name_cmp_len(const char *name)
876 {
877 int i;
878 for (i = 0; name[i] && name[i] != '\n' && name[i] != '/'; i++)
879 ;
880 return i;
881 }
883 static void add_pbase_object(struct tree_desc *tree,
884 const char *name,
885 int cmplen,
886 const char *fullname)
887 {
888 struct name_entry entry;
889 int cmp;
891 while (tree_entry(tree,&entry)) {
892 if (S_ISGITLINK(entry.mode))
893 continue;
894 cmp = tree_entry_len(entry.path, entry.sha1) != cmplen ? 1 :
895 memcmp(name, entry.path, cmplen);
896 if (cmp > 0)
897 continue;
898 if (cmp < 0)
899 return;
900 if (name[cmplen] != '/') {
901 add_object_entry(entry.sha1,
902 object_type(entry.mode),
903 fullname, 1);
904 return;
905 }
906 if (S_ISDIR(entry.mode)) {
907 struct tree_desc sub;
908 struct pbase_tree_cache *tree;
909 const char *down = name+cmplen+1;
910 int downlen = name_cmp_len(down);
912 tree = pbase_tree_get(entry.sha1);
913 if (!tree)
914 return;
915 init_tree_desc(&sub, tree->tree_data, tree->tree_size);
917 add_pbase_object(&sub, down, downlen, fullname);
918 pbase_tree_put(tree);
919 }
920 }
921 }
923 static unsigned *done_pbase_paths;
924 static int done_pbase_paths_num;
925 static int done_pbase_paths_alloc;
926 static int done_pbase_path_pos(unsigned hash)
927 {
928 int lo = 0;
929 int hi = done_pbase_paths_num;
930 while (lo < hi) {
931 int mi = (hi + lo) / 2;
932 if (done_pbase_paths[mi] == hash)
933 return mi;
934 if (done_pbase_paths[mi] < hash)
935 hi = mi;
936 else
937 lo = mi + 1;
938 }
939 return -lo-1;
940 }
942 static int check_pbase_path(unsigned hash)
943 {
944 int pos = (!done_pbase_paths) ? -1 : done_pbase_path_pos(hash);
945 if (0 <= pos)
946 return 1;
947 pos = -pos - 1;
948 if (done_pbase_paths_alloc <= done_pbase_paths_num) {
949 done_pbase_paths_alloc = alloc_nr(done_pbase_paths_alloc);
950 done_pbase_paths = xrealloc(done_pbase_paths,
951 done_pbase_paths_alloc *
952 sizeof(unsigned));
953 }
954 done_pbase_paths_num++;
955 if (pos < done_pbase_paths_num)
956 memmove(done_pbase_paths + pos + 1,
957 done_pbase_paths + pos,
958 (done_pbase_paths_num - pos - 1) * sizeof(unsigned));
959 done_pbase_paths[pos] = hash;
960 return 0;
961 }
963 static void add_preferred_base_object(const char *name)
964 {
965 struct pbase_tree *it;
966 int cmplen;
967 unsigned hash = name_hash(name);
969 if (!num_preferred_base || check_pbase_path(hash))
970 return;
972 cmplen = name_cmp_len(name);
973 for (it = pbase_tree; it; it = it->next) {
974 if (cmplen == 0) {
975 add_object_entry(it->pcache.sha1, OBJ_TREE, NULL, 1);
976 }
977 else {
978 struct tree_desc tree;
979 init_tree_desc(&tree, it->pcache.tree_data, it->pcache.tree_size);
980 add_pbase_object(&tree, name, cmplen, name);
981 }
982 }
983 }
985 static void add_preferred_base(unsigned char *sha1)
986 {
987 struct pbase_tree *it;
988 void *data;
989 unsigned long size;
990 unsigned char tree_sha1[20];
992 if (window <= num_preferred_base++)
993 return;
995 data = read_object_with_reference(sha1, tree_type, &size, tree_sha1);
996 if (!data)
997 return;
999 for (it = pbase_tree; it; it = it->next) {
1000 if (!hashcmp(it->pcache.sha1, tree_sha1)) {
1001 free(data);
1002 return;
1003 }
1004 }
1006 it = xcalloc(1, sizeof(*it));
1007 it->next = pbase_tree;
1008 pbase_tree = it;
1010 hashcpy(it->pcache.sha1, tree_sha1);
1011 it->pcache.tree_data = data;
1012 it->pcache.tree_size = size;
1013 }
1015 static void check_object(struct object_entry *entry)
1016 {
1017 if (entry->in_pack) {
1018 struct packed_git *p = entry->in_pack;
1019 struct pack_window *w_curs = NULL;
1020 const unsigned char *base_ref = NULL;
1021 struct object_entry *base_entry;
1022 unsigned long used, used_0;
1023 unsigned int avail;
1024 off_t ofs;
1025 unsigned char *buf, c;
1027 buf = use_pack(p, &w_curs, entry->in_pack_offset, &avail);
1029 /*
1030 * We want in_pack_type even if we do not reuse delta
1031 * since non-delta representations could still be reused.
1032 */
1033 used = unpack_object_header_buffer(buf, avail,
1034 &entry->in_pack_type,
1035 &entry->size);
1036 if (used == 0)
1037 goto give_up;
1039 /*
1040 * Determine if this is a delta and if so whether we can
1041 * reuse it or not. Otherwise let's find out as cheaply as
1042 * possible what the actual type and size for this object is.
1043 */
1044 switch (entry->in_pack_type) {
1045 default:
1046 /* Not a delta hence we've already got all we need. */
1047 entry->type = entry->in_pack_type;
1048 entry->in_pack_header_size = used;
1049 if (entry->type < OBJ_COMMIT || entry->type > OBJ_BLOB)
1050 goto give_up;
1051 unuse_pack(&w_curs);
1052 return;
1053 case OBJ_REF_DELTA:
1054 if (reuse_delta && !entry->preferred_base)
1055 base_ref = use_pack(p, &w_curs,
1056 entry->in_pack_offset + used, NULL);
1057 entry->in_pack_header_size = used + 20;
1058 break;
1059 case OBJ_OFS_DELTA:
1060 buf = use_pack(p, &w_curs,
1061 entry->in_pack_offset + used, NULL);
1062 used_0 = 0;
1063 c = buf[used_0++];
1064 ofs = c & 127;
1065 while (c & 128) {
1066 ofs += 1;
1067 if (!ofs || MSB(ofs, 7)) {
1068 error("delta base offset overflow in pack for %s",
1069 sha1_to_hex(entry->idx.sha1));
1070 goto give_up;
1071 }
1072 c = buf[used_0++];
1073 ofs = (ofs << 7) + (c & 127);
1074 }
1075 ofs = entry->in_pack_offset - ofs;
1076 if (ofs <= 0 || ofs >= entry->in_pack_offset) {
1077 error("delta base offset out of bound for %s",
1078 sha1_to_hex(entry->idx.sha1));
1079 goto give_up;
1080 }
1081 if (reuse_delta && !entry->preferred_base) {
1082 struct revindex_entry *revidx;
1083 revidx = find_pack_revindex(p, ofs);
1084 if (!revidx)
1085 goto give_up;
1086 base_ref = nth_packed_object_sha1(p, revidx->nr);
1087 }
1088 entry->in_pack_header_size = used + used_0;
1089 break;
1090 }
1092 if (base_ref && (base_entry = locate_object_entry(base_ref))) {
1093 /*
1094 * If base_ref was set above that means we wish to
1095 * reuse delta data, and we even found that base
1096 * in the list of objects we want to pack. Goodie!
1097 *
1098 * Depth value does not matter - find_deltas() will
1099 * never consider reused delta as the base object to
1100 * deltify other objects against, in order to avoid
1101 * circular deltas.
1102 */
1103 entry->type = entry->in_pack_type;
1104 entry->delta = base_entry;
1105 entry->delta_size = entry->size;
1106 entry->delta_sibling = base_entry->delta_child;
1107 base_entry->delta_child = entry;
1108 unuse_pack(&w_curs);
1109 return;
1110 }
1112 if (entry->type) {
1113 /*
1114 * This must be a delta and we already know what the
1115 * final object type is. Let's extract the actual
1116 * object size from the delta header.
1117 */
1118 entry->size = get_size_from_delta(p, &w_curs,
1119 entry->in_pack_offset + entry->in_pack_header_size);
1120 if (entry->size == 0)
1121 goto give_up;
1122 unuse_pack(&w_curs);
1123 return;
1124 }
1126 /*
1127 * No choice but to fall back to the recursive delta walk
1128 * with sha1_object_info() to find about the object type
1129 * at this point...
1130 */
1131 give_up:
1132 unuse_pack(&w_curs);
1133 }
1135 entry->type = sha1_object_info(entry->idx.sha1, &entry->size);
1136 /*
1137 * The error condition is checked in prepare_pack(). This is
1138 * to permit a missing preferred base object to be ignored
1139 * as a preferred base. Doing so can result in a larger
1140 * pack file, but the transfer will still take place.
1141 */
1142 }
1144 static int pack_offset_sort(const void *_a, const void *_b)
1145 {
1146 const struct object_entry *a = *(struct object_entry **)_a;
1147 const struct object_entry *b = *(struct object_entry **)_b;
1149 /* avoid filesystem trashing with loose objects */
1150 if (!a->in_pack && !b->in_pack)
1151 return hashcmp(a->idx.sha1, b->idx.sha1);
1153 if (a->in_pack < b->in_pack)
1154 return -1;
1155 if (a->in_pack > b->in_pack)
1156 return 1;
1157 return a->in_pack_offset < b->in_pack_offset ? -1 :
1158 (a->in_pack_offset > b->in_pack_offset);
1159 }
1161 static void get_object_details(void)
1162 {
1163 uint32_t i;
1164 struct object_entry **sorted_by_offset;
1166 sorted_by_offset = xcalloc(nr_objects, sizeof(struct object_entry *));
1167 for (i = 0; i < nr_objects; i++)
1168 sorted_by_offset[i] = objects + i;
1169 qsort(sorted_by_offset, nr_objects, sizeof(*sorted_by_offset), pack_offset_sort);
1171 for (i = 0; i < nr_objects; i++)
1172 check_object(sorted_by_offset[i]);
1174 free(sorted_by_offset);
1175 }
1177 /*
1178 * We search for deltas in a list sorted by type, by filename hash, and then
1179 * by size, so that we see progressively smaller and smaller files.
1180 * That's because we prefer deltas to be from the bigger file
1181 * to the smaller -- deletes are potentially cheaper, but perhaps
1182 * more importantly, the bigger file is likely the more recent
1183 * one. The deepest deltas are therefore the oldest objects which are
1184 * less susceptible to be accessed often.
1185 */
1186 static int type_size_sort(const void *_a, const void *_b)
1187 {
1188 const struct object_entry *a = *(struct object_entry **)_a;
1189 const struct object_entry *b = *(struct object_entry **)_b;
1191 if (a->type > b->type)
1192 return -1;
1193 if (a->type < b->type)
1194 return 1;
1195 if (a->hash > b->hash)
1196 return -1;
1197 if (a->hash < b->hash)
1198 return 1;
1199 if (a->preferred_base > b->preferred_base)
1200 return -1;
1201 if (a->preferred_base < b->preferred_base)
1202 return 1;
1203 if (a->size > b->size)
1204 return -1;
1205 if (a->size < b->size)
1206 return 1;
1207 return a < b ? -1 : (a > b); /* newest first */
1208 }
1210 struct unpacked {
1211 struct object_entry *entry;
1212 void *data;
1213 struct delta_index *index;
1214 unsigned depth;
1215 };
1217 static int delta_cacheable(unsigned long src_size, unsigned long trg_size,
1218 unsigned long delta_size)
1219 {
1220 if (max_delta_cache_size && delta_cache_size + delta_size > max_delta_cache_size)
1221 return 0;
1223 if (delta_size < cache_max_small_delta_size)
1224 return 1;
1226 /* cache delta, if objects are large enough compared to delta size */
1227 if ((src_size >> 20) + (trg_size >> 21) > (delta_size >> 10))
1228 return 1;
1230 return 0;
1231 }
1233 #ifdef THREADED_DELTA_SEARCH
1235 static pthread_mutex_t read_mutex = PTHREAD_MUTEX_INITIALIZER;
1236 #define read_lock() pthread_mutex_lock(&read_mutex)
1237 #define read_unlock() pthread_mutex_unlock(&read_mutex)
1239 static pthread_mutex_t cache_mutex = PTHREAD_MUTEX_INITIALIZER;
1240 #define cache_lock() pthread_mutex_lock(&cache_mutex)
1241 #define cache_unlock() pthread_mutex_unlock(&cache_mutex)
1243 static pthread_mutex_t progress_mutex = PTHREAD_MUTEX_INITIALIZER;
1244 #define progress_lock() pthread_mutex_lock(&progress_mutex)
1245 #define progress_unlock() pthread_mutex_unlock(&progress_mutex)
1247 #else
1249 #define read_lock() (void)0
1250 #define read_unlock() (void)0
1251 #define cache_lock() (void)0
1252 #define cache_unlock() (void)0
1253 #define progress_lock() (void)0
1254 #define progress_unlock() (void)0
1256 #endif
1258 static int try_delta(struct unpacked *trg, struct unpacked *src,
1259 unsigned max_depth, unsigned long *mem_usage)
1260 {
1261 struct object_entry *trg_entry = trg->entry;
1262 struct object_entry *src_entry = src->entry;
1263 unsigned long trg_size, src_size, delta_size, sizediff, max_size, sz;
1264 unsigned ref_depth;
1265 enum object_type type;
1266 void *delta_buf;
1268 /* Don't bother doing diffs between different types */
1269 if (trg_entry->type != src_entry->type)
1270 return -1;
1272 /*
1273 * We do not bother to try a delta that we discarded
1274 * on an earlier try, but only when reusing delta data.
1275 */
1276 if (reuse_delta && trg_entry->in_pack &&
1277 trg_entry->in_pack == src_entry->in_pack &&
1278 trg_entry->in_pack_type != OBJ_REF_DELTA &&
1279 trg_entry->in_pack_type != OBJ_OFS_DELTA)
1280 return 0;
1282 /* Let's not bust the allowed depth. */
1283 if (src->depth >= max_depth)
1284 return 0;
1286 /* Now some size filtering heuristics. */
1287 trg_size = trg_entry->size;
1288 if (!trg_entry->delta) {
1289 max_size = trg_size/2 - 20;
1290 ref_depth = 1;
1291 } else {
1292 max_size = trg_entry->delta_size;
1293 ref_depth = trg->depth;
1294 }
1295 max_size = (uint64_t)max_size * (max_depth - src->depth) /
1296 (max_depth - ref_depth + 1);
1297 if (max_size == 0)
1298 return 0;
1299 src_size = src_entry->size;
1300 sizediff = src_size < trg_size ? trg_size - src_size : 0;
1301 if (sizediff >= max_size)
1302 return 0;
1303 if (trg_size < src_size / 32)
1304 return 0;
1306 /* Load data if not already done */
1307 if (!trg->data) {
1308 read_lock();
1309 trg->data = read_sha1_file(trg_entry->idx.sha1, &type, &sz);
1310 read_unlock();
1311 if (!trg->data)
1312 die("object %s cannot be read",
1313 sha1_to_hex(trg_entry->idx.sha1));
1314 if (sz != trg_size)
1315 die("object %s inconsistent object length (%lu vs %lu)",
1316 sha1_to_hex(trg_entry->idx.sha1), sz, trg_size);
1317 *mem_usage += sz;
1318 }
1319 if (!src->data) {
1320 read_lock();
1321 src->data = read_sha1_file(src_entry->idx.sha1, &type, &sz);
1322 read_unlock();
1323 if (!src->data)
1324 die("object %s cannot be read",
1325 sha1_to_hex(src_entry->idx.sha1));
1326 if (sz != src_size)
1327 die("object %s inconsistent object length (%lu vs %lu)",
1328 sha1_to_hex(src_entry->idx.sha1), sz, src_size);
1329 *mem_usage += sz;
1330 }
1331 if (!src->index) {
1332 src->index = create_delta_index(src->data, src_size);
1333 if (!src->index) {
1334 static int warned = 0;
1335 if (!warned++)
1336 warning("suboptimal pack - out of memory");
1337 return 0;
1338 }
1339 *mem_usage += sizeof_delta_index(src->index);
1340 }
1342 delta_buf = create_delta(src->index, trg->data, trg_size, &delta_size, max_size);
1343 if (!delta_buf)
1344 return 0;
1346 if (trg_entry->delta) {
1347 /* Prefer only shallower same-sized deltas. */
1348 if (delta_size == trg_entry->delta_size &&
1349 src->depth + 1 >= trg->depth) {
1350 free(delta_buf);
1351 return 0;
1352 }
1353 }
1355 /*
1356 * Handle memory allocation outside of the cache
1357 * accounting lock. Compiler will optimize the strangeness
1358 * away when THREADED_DELTA_SEARCH is not defined.
1359 */
1360 free(trg_entry->delta_data);
1361 cache_lock();
1362 if (trg_entry->delta_data) {
1363 delta_cache_size -= trg_entry->delta_size;
1364 trg_entry->delta_data = NULL;
1365 }
1366 if (delta_cacheable(src_size, trg_size, delta_size)) {
1367 delta_cache_size += delta_size;
1368 cache_unlock();
1369 trg_entry->delta_data = xrealloc(delta_buf, delta_size);
1370 } else {
1371 cache_unlock();
1372 free(delta_buf);
1373 }
1375 trg_entry->delta = src_entry;
1376 trg_entry->delta_size = delta_size;
1377 trg->depth = src->depth + 1;
1379 return 1;
1380 }
1382 static unsigned int check_delta_limit(struct object_entry *me, unsigned int n)
1383 {
1384 struct object_entry *child = me->delta_child;
1385 unsigned int m = n;
1386 while (child) {
1387 unsigned int c = check_delta_limit(child, n + 1);
1388 if (m < c)
1389 m = c;
1390 child = child->delta_sibling;
1391 }
1392 return m;
1393 }
1395 static unsigned long free_unpacked(struct unpacked *n)
1396 {
1397 unsigned long freed_mem = sizeof_delta_index(n->index);
1398 free_delta_index(n->index);
1399 n->index = NULL;
1400 if (n->data) {
1401 freed_mem += n->entry->size;
1402 free(n->data);
1403 n->data = NULL;
1404 }
1405 n->entry = NULL;
1406 n->depth = 0;
1407 return freed_mem;
1408 }
1410 static void find_deltas(struct object_entry **list, unsigned *list_size,
1411 int window, int depth, unsigned *processed)
1412 {
1413 uint32_t i, idx = 0, count = 0;
1414 struct unpacked *array;
1415 unsigned long mem_usage = 0;
1417 array = xcalloc(window, sizeof(struct unpacked));
1419 for (;;) {
1420 struct object_entry *entry;
1421 struct unpacked *n = array + idx;
1422 int j, max_depth, best_base = -1;
1424 progress_lock();
1425 if (!*list_size) {
1426 progress_unlock();
1427 break;
1428 }
1429 entry = *list++;
1430 (*list_size)--;
1431 if (!entry->preferred_base) {
1432 (*processed)++;
1433 display_progress(progress_state, *processed);
1434 }
1435 progress_unlock();
1437 mem_usage -= free_unpacked(n);
1438 n->entry = entry;
1440 while (window_memory_limit &&
1441 mem_usage > window_memory_limit &&
1442 count > 1) {
1443 uint32_t tail = (idx + window - count) % window;
1444 mem_usage -= free_unpacked(array + tail);
1445 count--;
1446 }
1448 /* We do not compute delta to *create* objects we are not
1449 * going to pack.
1450 */
1451 if (entry->preferred_base)
1452 goto next;
1454 /*
1455 * If the current object is at pack edge, take the depth the
1456 * objects that depend on the current object into account
1457 * otherwise they would become too deep.
1458 */
1459 max_depth = depth;
1460 if (entry->delta_child) {
1461 max_depth -= check_delta_limit(entry, 0);
1462 if (max_depth <= 0)
1463 goto next;
1464 }
1466 j = window;
1467 while (--j > 0) {
1468 int ret;
1469 uint32_t other_idx = idx + j;
1470 struct unpacked *m;
1471 if (other_idx >= window)
1472 other_idx -= window;
1473 m = array + other_idx;
1474 if (!m->entry)
1475 break;
1476 ret = try_delta(n, m, max_depth, &mem_usage);
1477 if (ret < 0)
1478 break;
1479 else if (ret > 0)
1480 best_base = other_idx;
1481 }
1483 /*
1484 * If we decided to cache the delta data, then it is best
1485 * to compress it right away. First because we have to do
1486 * it anyway, and doing it here while we're threaded will
1487 * save a lot of time in the non threaded write phase,
1488 * as well as allow for caching more deltas within
1489 * the same cache size limit.
1490 * ...
1491 * But only if not writing to stdout, since in that case
1492 * the network is most likely throttling writes anyway,
1493 * and therefore it is best to go to the write phase ASAP
1494 * instead, as we can afford spending more time compressing
1495 * between writes at that moment.
1496 */
1497 if (entry->delta_data && !pack_to_stdout) {
1498 entry->z_delta_size = do_compress(&entry->delta_data,
1499 entry->delta_size);
1500 cache_lock();
1501 delta_cache_size -= entry->delta_size;
1502 delta_cache_size += entry->z_delta_size;
1503 cache_unlock();
1504 }
1506 /* if we made n a delta, and if n is already at max
1507 * depth, leaving it in the window is pointless. we
1508 * should evict it first.
1509 */
1510 if (entry->delta && max_depth <= n->depth)
1511 continue;
1513 /*
1514 * Move the best delta base up in the window, after the
1515 * currently deltified object, to keep it longer. It will
1516 * be the first base object to be attempted next.
1517 */
1518 if (entry->delta) {
1519 struct unpacked swap = array[best_base];
1520 int dist = (window + idx - best_base) % window;
1521 int dst = best_base;
1522 while (dist--) {
1523 int src = (dst + 1) % window;
1524 array[dst] = array[src];
1525 dst = src;
1526 }
1527 array[dst] = swap;
1528 }
1530 next:
1531 idx++;
1532 if (count + 1 < window)
1533 count++;
1534 if (idx >= window)
1535 idx = 0;
1536 }
1538 for (i = 0; i < window; ++i) {
1539 free_delta_index(array[i].index);
1540 free(array[i].data);
1541 }
1542 free(array);
1543 }
1545 #ifdef THREADED_DELTA_SEARCH
1547 /*
1548 * The main thread waits on the condition that (at least) one of the workers
1549 * has stopped working (which is indicated in the .working member of
1550 * struct thread_params).
1551 * When a work thread has completed its work, it sets .working to 0 and
1552 * signals the main thread and waits on the condition that .data_ready
1553 * becomes 1.
1554 */
1556 struct thread_params {
1557 pthread_t thread;
1558 struct object_entry **list;
1559 unsigned list_size;
1560 unsigned remaining;
1561 int window;
1562 int depth;
1563 int working;
1564 int data_ready;
1565 pthread_mutex_t mutex;
1566 pthread_cond_t cond;
1567 unsigned *processed;
1568 };
1570 static pthread_cond_t progress_cond = PTHREAD_COND_INITIALIZER;
1572 static void *threaded_find_deltas(void *arg)
1573 {
1574 struct thread_params *me = arg;
1576 while (me->remaining) {
1577 find_deltas(me->list, &me->remaining,
1578 me->window, me->depth, me->processed);
1580 progress_lock();
1581 me->working = 0;
1582 pthread_cond_signal(&progress_cond);
1583 progress_unlock();
1585 /*
1586 * We must not set ->data_ready before we wait on the
1587 * condition because the main thread may have set it to 1
1588 * before we get here. In order to be sure that new
1589 * work is available if we see 1 in ->data_ready, it
1590 * was initialized to 0 before this thread was spawned
1591 * and we reset it to 0 right away.
1592 */
1593 pthread_mutex_lock(&me->mutex);
1594 while (!me->data_ready)
1595 pthread_cond_wait(&me->cond, &me->mutex);
1596 me->data_ready = 0;
1597 pthread_mutex_unlock(&me->mutex);
1598 }
1599 /* leave ->working 1 so that this doesn't get more work assigned */
1600 return NULL;
1601 }
1603 static void ll_find_deltas(struct object_entry **list, unsigned list_size,
1604 int window, int depth, unsigned *processed)
1605 {
1606 struct thread_params p[delta_search_threads];
1607 int i, ret, active_threads = 0;
1609 if (delta_search_threads <= 1) {
1610 find_deltas(list, &list_size, window, depth, processed);
1611 return;
1612 }
1613 if (progress > pack_to_stdout)
1614 fprintf(stderr, "Delta compression using up to %d threads.\n",
1615 delta_search_threads);
1617 /* Partition the work amongst work threads. */
1618 for (i = 0; i < delta_search_threads; i++) {
1619 unsigned sub_size = list_size / (delta_search_threads - i);
1621 /* don't use too small segments or no deltas will be found */
1622 if (sub_size < 2*window && i+1 < delta_search_threads)
1623 sub_size = 0;
1625 p[i].window = window;
1626 p[i].depth = depth;
1627 p[i].processed = processed;
1628 p[i].working = 1;
1629 p[i].data_ready = 0;
1631 /* try to split chunks on "path" boundaries */
1632 while (sub_size && sub_size < list_size &&
1633 list[sub_size]->hash &&
1634 list[sub_size]->hash == list[sub_size-1]->hash)
1635 sub_size++;
1637 p[i].list = list;
1638 p[i].list_size = sub_size;
1639 p[i].remaining = sub_size;
1641 list += sub_size;
1642 list_size -= sub_size;
1643 }
1645 /* Start work threads. */
1646 for (i = 0; i < delta_search_threads; i++) {
1647 if (!p[i].list_size)
1648 continue;
1649 pthread_mutex_init(&p[i].mutex, NULL);
1650 pthread_cond_init(&p[i].cond, NULL);
1651 ret = pthread_create(&p[i].thread, NULL,
1652 threaded_find_deltas, &p[i]);
1653 if (ret)
1654 die("unable to create thread: %s", strerror(ret));
1655 active_threads++;
1656 }
1658 /*
1659 * Now let's wait for work completion. Each time a thread is done
1660 * with its work, we steal half of the remaining work from the
1661 * thread with the largest number of unprocessed objects and give
1662 * it to that newly idle thread. This ensure good load balancing
1663 * until the remaining object list segments are simply too short
1664 * to be worth splitting anymore.
1665 */
1666 while (active_threads) {
1667 struct thread_params *target = NULL;
1668 struct thread_params *victim = NULL;
1669 unsigned sub_size = 0;
1671 progress_lock();
1672 for (;;) {
1673 for (i = 0; !target && i < delta_search_threads; i++)
1674 if (!p[i].working)
1675 target = &p[i];
1676 if (target)
1677 break;
1678 pthread_cond_wait(&progress_cond, &progress_mutex);
1679 }
1681 for (i = 0; i < delta_search_threads; i++)
1682 if (p[i].remaining > 2*window &&
1683 (!victim || victim->remaining < p[i].remaining))
1684 victim = &p[i];
1685 if (victim) {
1686 sub_size = victim->remaining / 2;
1687 list = victim->list + victim->list_size - sub_size;
1688 while (sub_size && list[0]->hash &&
1689 list[0]->hash == list[-1]->hash) {
1690 list++;
1691 sub_size--;
1692 }
1693 if (!sub_size) {
1694 /*
1695 * It is possible for some "paths" to have
1696 * so many objects that no hash boundary
1697 * might be found. Let's just steal the
1698 * exact half in that case.
1699 */
1700 sub_size = victim->remaining / 2;
1701 list -= sub_size;
1702 }
1703 target->list = list;
1704 victim->list_size -= sub_size;
1705 victim->remaining -= sub_size;
1706 }
1707 target->list_size = sub_size;
1708 target->remaining = sub_size;
1709 target->working = 1;
1710 progress_unlock();
1712 pthread_mutex_lock(&target->mutex);
1713 target->data_ready = 1;
1714 pthread_cond_signal(&target->cond);
1715 pthread_mutex_unlock(&target->mutex);
1717 if (!sub_size) {
1718 pthread_join(target->thread, NULL);
1719 pthread_cond_destroy(&target->cond);
1720 pthread_mutex_destroy(&target->mutex);
1721 active_threads--;
1722 }
1723 }
1724 }
1726 #else
1727 #define ll_find_deltas(l, s, w, d, p) find_deltas(l, &s, w, d, p)
1728 #endif
1730 static int add_ref_tag(const char *path, const unsigned char *sha1, int flag, void *cb_data)
1731 {
1732 unsigned char peeled[20];
1734 if (!prefixcmp(path, "refs/tags/") && /* is a tag? */
1735 !peel_ref(path, peeled) && /* peelable? */
1736 !is_null_sha1(peeled) && /* annotated tag? */
1737 locate_object_entry(peeled)) /* object packed? */
1738 add_object_entry(sha1, OBJ_TAG, NULL, 0);
1739 return 0;
1740 }
1742 static void prepare_pack(int window, int depth)
1743 {
1744 struct object_entry **delta_list;
1745 uint32_t i, nr_deltas;
1746 unsigned n;
1748 get_object_details();
1750 /*
1751 * If we're locally repacking then we need to be doubly careful
1752 * from now on in order to make sure no stealth corruption gets
1753 * propagated to the new pack. Clients receiving streamed packs
1754 * should validate everything they get anyway so no need to incur
1755 * the additional cost here in that case.
1756 */
1757 if (!pack_to_stdout)
1758 do_check_packed_object_crc = 1;
1760 if (!nr_objects || !window || !depth)
1761 return;
1763 delta_list = xmalloc(nr_objects * sizeof(*delta_list));
1764 nr_deltas = n = 0;
1766 for (i = 0; i < nr_objects; i++) {
1767 struct object_entry *entry = objects + i;
1769 if (entry->delta)
1770 /* This happens if we decided to reuse existing
1771 * delta from a pack. "reuse_delta &&" is implied.
1772 */
1773 continue;
1775 if (entry->size < 50)
1776 continue;
1778 if (entry->no_try_delta)
1779 continue;
1781 if (!entry->preferred_base) {
1782 nr_deltas++;
1783 if (entry->type < 0)
1784 die("unable to get type of object %s",
1785 sha1_to_hex(entry->idx.sha1));
1786 } else {
1787 if (entry->type < 0) {
1788 /*
1789 * This object is not found, but we
1790 * don't have to include it anyway.
1791 */
1792 continue;
1793 }
1794 }
1796 delta_list[n++] = entry;
1797 }
1799 if (nr_deltas && n > 1) {
1800 unsigned nr_done = 0;
1801 if (progress)
1802 progress_state = start_progress("Compressing objects",
1803 nr_deltas);
1804 qsort(delta_list, n, sizeof(*delta_list), type_size_sort);
1805 ll_find_deltas(delta_list, n, window+1, depth, &nr_done);
1806 stop_progress(&progress_state);
1807 if (nr_done != nr_deltas)
1808 die("inconsistency with delta count");
1809 }
1810 free(delta_list);
1811 }
1813 static int git_pack_config(const char *k, const char *v, void *cb)
1814 {
1815 if(!strcmp(k, "pack.window")) {
1816 window = git_config_int(k, v);
1817 return 0;
1818 }
1819 if (!strcmp(k, "pack.windowmemory")) {
1820 window_memory_limit = git_config_ulong(k, v);
1821 return 0;
1822 }
1823 if (!strcmp(k, "pack.depth")) {
1824 depth = git_config_int(k, v);
1825 return 0;
1826 }
1827 if (!strcmp(k, "pack.compression")) {
1828 int level = git_config_int(k, v);
1829 if (level == -1)
1830 level = Z_DEFAULT_COMPRESSION;
1831 else if (level < 0 || level > Z_BEST_COMPRESSION)
1832 die("bad pack compression level %d", level);
1833 pack_compression_level = level;
1834 pack_compression_seen = 1;
1835 return 0;
1836 }
1837 if (!strcmp(k, "pack.deltacachesize")) {
1838 max_delta_cache_size = git_config_int(k, v);
1839 return 0;
1840 }
1841 if (!strcmp(k, "pack.deltacachelimit")) {
1842 cache_max_small_delta_size = git_config_int(k, v);
1843 return 0;
1844 }
1845 if (!strcmp(k, "pack.threads")) {
1846 delta_search_threads = git_config_int(k, v);
1847 if (delta_search_threads < 0)
1848 die("invalid number of threads specified (%d)",
1849 delta_search_threads);
1850 #ifndef THREADED_DELTA_SEARCH
1851 if (delta_search_threads != 1)
1852 warning("no threads support, ignoring %s", k);
1853 #endif
1854 return 0;
1855 }
1856 if (!strcmp(k, "pack.indexversion")) {
1857 pack_idx_default_version = git_config_int(k, v);
1858 if (pack_idx_default_version > 2)
1859 die("bad pack.indexversion=%"PRIu32,
1860 pack_idx_default_version);
1861 return 0;
1862 }
1863 if (!strcmp(k, "pack.packsizelimit")) {
1864 pack_size_limit_cfg = git_config_ulong(k, v);
1865 return 0;
1866 }
1867 return git_default_config(k, v, cb);
1868 }
1870 static void read_object_list_from_stdin(void)
1871 {
1872 char line[40 + 1 + PATH_MAX + 2];
1873 unsigned char sha1[20];
1875 for (;;) {
1876 if (!fgets(line, sizeof(line), stdin)) {
1877 if (feof(stdin))
1878 break;
1879 if (!ferror(stdin))
1880 die("fgets returned NULL, not EOF, not error!");
1881 if (errno != EINTR)
1882 die("fgets: %s", strerror(errno));
1883 clearerr(stdin);
1884 continue;
1885 }
1886 if (line[0] == '-') {
1887 if (get_sha1_hex(line+1, sha1))
1888 die("expected edge sha1, got garbage:\n %s",
1889 line);
1890 add_preferred_base(sha1);
1891 continue;
1892 }
1893 if (get_sha1_hex(line, sha1))
1894 die("expected sha1, got garbage:\n %s", line);
1896 add_preferred_base_object(line+41);
1897 add_object_entry(sha1, 0, line+41, 0);
1898 }
1899 }
1901 #define OBJECT_ADDED (1u<<20)
1903 static void show_commit(struct commit *commit, void *data)
1904 {
1905 add_object_entry(commit->object.sha1, OBJ_COMMIT, NULL, 0);
1906 commit->object.flags |= OBJECT_ADDED;
1907 }
1909 static void show_object(struct object *obj, const struct name_path *path, const char *last)
1910 {
1911 char *name = path_name(path, last);
1913 add_preferred_base_object(name);
1914 add_object_entry(obj->sha1, obj->type, name, 0);
1915 obj->flags |= OBJECT_ADDED;
1917 /*
1918 * We will have generated the hash from the name,
1919 * but not saved a pointer to it - we can free it
1920 */
1921 free((char *)name);
1922 }
1924 static void show_edge(struct commit *commit)
1925 {
1926 add_preferred_base(commit->object.sha1);
1927 }
1929 struct in_pack_object {
1930 off_t offset;
1931 struct object *object;
1932 };
1934 struct in_pack {
1935 int alloc;
1936 int nr;
1937 struct in_pack_object *array;
1938 };
1940 static void mark_in_pack_object(struct object *object, struct packed_git *p, struct in_pack *in_pack)
1941 {
1942 in_pack->array[in_pack->nr].offset = find_pack_entry_one(object->sha1, p);
1943 in_pack->array[in_pack->nr].object = object;
1944 in_pack->nr++;
1945 }
1947 /*
1948 * Compare the objects in the offset order, in order to emulate the
1949 * "git rev-list --objects" output that produced the pack originally.
1950 */
1951 static int ofscmp(const void *a_, const void *b_)
1952 {
1953 struct in_pack_object *a = (struct in_pack_object *)a_;
1954 struct in_pack_object *b = (struct in_pack_object *)b_;
1956 if (a->offset < b->offset)
1957 return -1;
1958 else if (a->offset > b->offset)
1959 return 1;
1960 else
1961 return hashcmp(a->object->sha1, b->object->sha1);
1962 }
1964 static void add_objects_in_unpacked_packs(struct rev_info *revs)
1965 {
1966 struct packed_git *p;
1967 struct in_pack in_pack;
1968 uint32_t i;
1970 memset(&in_pack, 0, sizeof(in_pack));
1972 for (p = packed_git; p; p = p->next) {
1973 const unsigned char *sha1;
1974 struct object *o;
1976 if (!p->pack_local || p->pack_keep)
1977 continue;
1978 if (open_pack_index(p))
1979 die("cannot open pack index");
1981 ALLOC_GROW(in_pack.array,
1982 in_pack.nr + p->num_objects,
1983 in_pack.alloc);
1985 for (i = 0; i < p->num_objects; i++) {
1986 sha1 = nth_packed_object_sha1(p, i);
1987 o = lookup_unknown_object(sha1);
1988 if (!(o->flags & OBJECT_ADDED))
1989 mark_in_pack_object(o, p, &in_pack);
1990 o->flags |= OBJECT_ADDED;
1991 }
1992 }
1994 if (in_pack.nr) {
1995 qsort(in_pack.array, in_pack.nr, sizeof(in_pack.array[0]),
1996 ofscmp);
1997 for (i = 0; i < in_pack.nr; i++) {
1998 struct object *o = in_pack.array[i].object;
1999 add_object_entry(o->sha1, o->type, "", 0);
2000 }
2001 }
2002 free(in_pack.array);
2003 }
2005 static int has_sha1_pack_kept_or_nonlocal(const unsigned char *sha1)
2006 {
2007 static struct packed_git *last_found = (void *)1;
2008 struct packed_git *p;
2010 p = (last_found != (void *)1) ? last_found : packed_git;
2012 while (p) {
2013 if ((!p->pack_local || p->pack_keep) &&
2014 find_pack_entry_one(sha1, p)) {
2015 last_found = p;
2016 return 1;
2017 }
2018 if (p == last_found)
2019 p = packed_git;
2020 else
2021 p = p->next;
2022 if (p == last_found)
2023 p = p->next;
2024 }
2025 return 0;
2026 }
2028 static void loosen_unused_packed_objects(struct rev_info *revs)
2029 {
2030 struct packed_git *p;
2031 uint32_t i;
2032 const unsigned char *sha1;
2034 for (p = packed_git; p; p = p->next) {
2035 if (!p->pack_local || p->pack_keep)
2036 continue;
2038 if (open_pack_index(p))
2039 die("cannot open pack index");
2041 for (i = 0; i < p->num_objects; i++) {
2042 sha1 = nth_packed_object_sha1(p, i);
2043 if (!locate_object_entry(sha1) &&
2044 !has_sha1_pack_kept_or_nonlocal(sha1))
2045 if (force_object_loose(sha1, p->mtime))
2046 die("unable to force loose object");
2047 }
2048 }
2049 }
2051 static void get_object_list(int ac, const char **av)
2052 {
2053 struct rev_info revs;
2054 char line[1000];
2055 int flags = 0;
2057 init_revisions(&revs, NULL);
2058 save_commit_buffer = 0;
2059 setup_revisions(ac, av, &revs, NULL);
2061 while (fgets(line, sizeof(line), stdin) != NULL) {
2062 int len = strlen(line);
2063 if (len && line[len - 1] == '\n')
2064 line[--len] = 0;
2065 if (!len)
2066 break;
2067 if (*line == '-') {
2068 if (!strcmp(line, "--not")) {
2069 flags ^= UNINTERESTING;
2070 continue;
2071 }
2072 die("not a rev '%s'", line);
2073 }
2074 if (handle_revision_arg(line, &revs, flags, 1))
2075 die("bad revision '%s'", line);
2076 }
2078 if (prepare_revision_walk(&revs))
2079 die("revision walk setup failed");
2080 mark_edges_uninteresting(revs.commits, &revs, show_edge);
2081 traverse_commit_list(&revs, show_commit, show_object, NULL);
2083 if (keep_unreachable)
2084 add_objects_in_unpacked_packs(&revs);
2085 if (unpack_unreachable)
2086 loosen_unused_packed_objects(&revs);
2087 }
2089 static int adjust_perm(const char *path, mode_t mode)
2090 {
2091 if (chmod(path, mode))
2092 return -1;
2093 return adjust_shared_perm(path);
2094 }
2096 int cmd_pack_objects(int argc, const char **argv, const char *prefix)
2097 {
2098 int use_internal_rev_list = 0;
2099 int thin = 0;
2100 uint32_t i;
2101 const char **rp_av;
2102 int rp_ac_alloc = 64;
2103 int rp_ac;
2105 rp_av = xcalloc(rp_ac_alloc, sizeof(*rp_av));
2107 rp_av[0] = "pack-objects";
2108 rp_av[1] = "--objects"; /* --thin will make it --objects-edge */
2109 rp_ac = 2;
2111 git_config(git_pack_config, NULL);
2112 if (!pack_compression_seen && core_compression_seen)
2113 pack_compression_level = core_compression_level;
2115 progress = isatty(2);
2116 for (i = 1; i < argc; i++) {
2117 const char *arg = argv[i];
2119 if (*arg != '-')
2120 break;
2122 if (!strcmp("--non-empty", arg)) {
2123 non_empty = 1;
2124 continue;
2125 }
2126 if (!strcmp("--local", arg)) {
2127 local = 1;
2128 continue;
2129 }
2130 if (!strcmp("--incremental", arg)) {
2131 incremental = 1;
2132 continue;
2133 }
2134 if (!strcmp("--honor-pack-keep", arg)) {
2135 ignore_packed_keep = 1;
2136 continue;
2137 }
2138 if (!prefixcmp(arg, "--compression=")) {
2139 char *end;
2140 int level = strtoul(arg+14, &end, 0);
2141 if (!arg[14] || *end)
2142 usage(pack_usage);
2143 if (level == -1)
2144 level = Z_DEFAULT_COMPRESSION;
2145 else if (level < 0 || level > Z_BEST_COMPRESSION)
2146 die("bad pack compression level %d", level);
2147 pack_compression_level = level;
2148 continue;
2149 }
2150 if (!prefixcmp(arg, "--max-pack-size=")) {
2151 char *end;
2152 pack_size_limit_cfg = 0;
2153 pack_size_limit = strtoul(arg+16, &end, 0) * 1024 * 1024;
2154 if (!arg[16] || *end)
2155 usage(pack_usage);
2156 continue;
2157 }
2158 if (!prefixcmp(arg, "--window=")) {
2159 char *end;
2160 window = strtoul(arg+9, &end, 0);
2161 if (!arg[9] || *end)
2162 usage(pack_usage);
2163 continue;
2164 }
2165 if (!prefixcmp(arg, "--window-memory=")) {
2166 if (!git_parse_ulong(arg+16, &window_memory_limit))
2167 usage(pack_usage);
2168 continue;
2169 }
2170 if (!prefixcmp(arg, "--threads=")) {
2171 char *end;
2172 delta_search_threads = strtoul(arg+10, &end, 0);
2173 if (!arg[10] || *end || delta_search_threads < 0)
2174 usage(pack_usage);
2175 #ifndef THREADED_DELTA_SEARCH
2176 if (delta_search_threads != 1)
2177 warning("no threads support, "
2178 "ignoring %s", arg);
2179 #endif
2180 continue;
2181 }
2182 if (!prefixcmp(arg, "--depth=")) {
2183 char *end;
2184 depth = strtoul(arg+8, &end, 0);
2185 if (!arg[8] || *end)
2186 usage(pack_usage);
2187 continue;
2188 }
2189 if (!strcmp("--progress", arg)) {
2190 progress = 1;
2191 continue;
2192 }
2193 if (!strcmp("--all-progress", arg)) {
2194 progress = 2;
2195 continue;
2196 }
2197 if (!strcmp("-q", arg)) {
2198 progress = 0;
2199 continue;
2200 }
2201 if (!strcmp("--no-reuse-delta", arg)) {
2202 reuse_delta = 0;
2203 continue;
2204 }
2205 if (!strcmp("--no-reuse-object", arg)) {
2206 reuse_object = reuse_delta = 0;
2207 continue;
2208 }
2209 if (!strcmp("--delta-base-offset", arg)) {
2210 allow_ofs_delta = 1;
2211 continue;
2212 }
2213 if (!strcmp("--stdout", arg)) {
2214 pack_to_stdout = 1;
2215 continue;
2216 }
2217 if (!strcmp("--revs", arg)) {
2218 use_internal_rev_list = 1;
2219 continue;
2220 }
2221 if (!strcmp("--keep-unreachable", arg)) {
2222 keep_unreachable = 1;
2223 continue;
2224 }
2225 if (!strcmp("--unpack-unreachable", arg)) {
2226 unpack_unreachable = 1;
2227 continue;
2228 }
2229 if (!strcmp("--include-tag", arg)) {
2230 include_tag = 1;
2231 continue;
2232 }
2233 if (!strcmp("--unpacked", arg) ||
2234 !strcmp("--reflog", arg) ||
2235 !strcmp("--all", arg)) {
2236 use_internal_rev_list = 1;
2237 if (rp_ac >= rp_ac_alloc - 1) {
2238 rp_ac_alloc = alloc_nr(rp_ac_alloc);
2239 rp_av = xrealloc(rp_av,
2240 rp_ac_alloc * sizeof(*rp_av));
2241 }
2242 rp_av[rp_ac++] = arg;
2243 continue;
2244 }
2245 if (!strcmp("--thin", arg)) {
2246 use_internal_rev_list = 1;
2247 thin = 1;
2248 rp_av[1] = "--objects-edge";
2249 continue;
2250 }
2251 if (!prefixcmp(arg, "--index-version=")) {
2252 char *c;
2253 pack_idx_default_version = strtoul(arg + 16, &c, 10);
2254 if (pack_idx_default_version > 2)
2255 die("bad %s", arg);
2256 if (*c == ',')
2257 pack_idx_off32_limit = strtoul(c+1, &c, 0);
2258 if (*c || pack_idx_off32_limit & 0x80000000)
2259 die("bad %s", arg);
2260 continue;
2261 }
2262 usage(pack_usage);
2263 }
2265 /* Traditionally "pack-objects [options] base extra" failed;
2266 * we would however want to take refs parameter that would
2267 * have been given to upstream rev-list ourselves, which means
2268 * we somehow want to say what the base name is. So the
2269 * syntax would be:
2270 *
2271 * pack-objects [options] base <refs...>
2272 *
2273 * in other words, we would treat the first non-option as the
2274 * base_name and send everything else to the internal revision
2275 * walker.
2276 */
2278 if (!pack_to_stdout)
2279 base_name = argv[i++];
2281 if (pack_to_stdout != !base_name)
2282 usage(pack_usage);
2284 if (!pack_to_stdout && !pack_size_limit)
2285 pack_size_limit = pack_size_limit_cfg;
2287 if (pack_to_stdout && pack_size_limit)
2288 die("--max-pack-size cannot be used to build a pack for transfer.");
2290 if (!pack_to_stdout && thin)
2291 die("--thin cannot be used to build an indexable pack.");
2293 if (keep_unreachable && unpack_unreachable)
2294 die("--keep-unreachable and --unpack-unreachable are incompatible.");
2296 #ifdef THREADED_DELTA_SEARCH
2297 if (!delta_search_threads) /* --threads=0 means autodetect */
2298 delta_search_threads = online_cpus();
2299 #endif
2301 prepare_packed_git();
2303 if (progress)
2304 progress_state = start_progress("Counting objects", 0);
2305 if (!use_internal_rev_list)
2306 read_object_list_from_stdin();
2307 else {
2308 rp_av[rp_ac] = NULL;
2309 get_object_list(rp_ac, rp_av);
2310 }
2311 if (include_tag && nr_result)
2312 for_each_ref(add_ref_tag, NULL);
2313 stop_progress(&progress_state);
2315 if (non_empty && !nr_result)
2316 return 0;
2317 if (nr_result)
2318 prepare_pack(window, depth);
2319 write_pack_file();
2320 if (progress)
2321 fprintf(stderr, "Total %"PRIu32" (delta %"PRIu32"),"
2322 " reused %"PRIu32" (delta %"PRIu32")\n",
2323 written, written_delta, reused, reused_delta);
2324 return 0;
2325 }