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