]>
Commit | Line | Data |
---|---|---|
5579f44d | 1 | #include "git-compat-util.h" |
32a8f510 | 2 | #include "environment.h" |
f394e093 | 3 | #include "gettext.h" |
41771fa4 | 4 | #include "hex.h" |
8b0eca7c | 5 | #include "pack.h" |
aa7e44bf | 6 | #include "csum-file.h" |
33add2ad | 7 | #include "remote.h" |
d9fef9d9 | 8 | #include "chunk-format.h" |
5dfaf49a TB |
9 | #include "pack-mtimes.h" |
10 | #include "oidmap.h" | |
5dfaf49a | 11 | #include "pack-objects.h" |
75f273d9 | 12 | #include "pack-revindex.h" |
65156bb7 | 13 | #include "wrapper.h" |
aa7e44bf | 14 | |
ebcfb379 JH |
15 | void reset_pack_idx_option(struct pack_idx_option *opts) |
16 | { | |
17 | memset(opts, 0, sizeof(*opts)); | |
18 | opts->version = 2; | |
19 | opts->off32_limit = 0x7fffffff; | |
20 | } | |
aa7e44bf GB |
21 | |
22 | static int sha1_compare(const void *_a, const void *_b) | |
23 | { | |
24 | struct pack_idx_entry *a = *(struct pack_idx_entry **)_a; | |
25 | struct pack_idx_entry *b = *(struct pack_idx_entry **)_b; | |
e6a492b7 | 26 | return oidcmp(&a->oid, &b->oid); |
aa7e44bf GB |
27 | } |
28 | ||
3c9fc074 JH |
29 | static int cmp_uint32(const void *a_, const void *b_) |
30 | { | |
31 | uint32_t a = *((uint32_t *)a_); | |
32 | uint32_t b = *((uint32_t *)b_); | |
33 | ||
34 | return (a < b) ? -1 : (a != b); | |
35 | } | |
36 | ||
fb956c1f JH |
37 | static int need_large_offset(off_t offset, const struct pack_idx_option *opts) |
38 | { | |
3c9fc074 JH |
39 | uint32_t ofsval; |
40 | ||
41 | if ((offset >> 31) || (opts->off32_limit < offset)) | |
42 | return 1; | |
43 | if (!opts->anomaly_nr) | |
44 | return 0; | |
45 | ofsval = offset; | |
46 | return !!bsearch(&ofsval, opts->anomaly, opts->anomaly_nr, | |
47 | sizeof(ofsval), cmp_uint32); | |
fb956c1f JH |
48 | } |
49 | ||
aa7e44bf | 50 | /* |
e2bfa50a JB |
51 | * The *sha1 contains the pack content SHA1 hash. |
52 | * The objects array passed in will be sorted by SHA1 on exit. | |
aa7e44bf | 53 | */ |
3bb72562 | 54 | const char *write_idx_file(const char *index_name, struct pack_idx_entry **objects, |
ebcfb379 | 55 | int nr_objects, const struct pack_idx_option *opts, |
1190a1ac | 56 | const unsigned char *sha1) |
aa7e44bf | 57 | { |
98a3beab | 58 | struct hashfile *f; |
aa7e44bf GB |
59 | struct pack_idx_entry **sorted_by_sha, **list, **last; |
60 | off_t last_obj_offset = 0; | |
aa7e44bf | 61 | int i, fd; |
aa7e44bf GB |
62 | uint32_t index_version; |
63 | ||
64 | if (nr_objects) { | |
65 | sorted_by_sha = objects; | |
66 | list = sorted_by_sha; | |
67 | last = sorted_by_sha + nr_objects; | |
68 | for (i = 0; i < nr_objects; ++i) { | |
69 | if (objects[i]->offset > last_obj_offset) | |
70 | last_obj_offset = objects[i]->offset; | |
71 | } | |
9ed0d8d6 | 72 | QSORT(sorted_by_sha, nr_objects, sha1_compare); |
aa7e44bf GB |
73 | } |
74 | else | |
75 | sorted_by_sha = list = last = NULL; | |
76 | ||
e337a04d JH |
77 | if (opts->flags & WRITE_IDX_VERIFY) { |
78 | assert(index_name); | |
98a3beab | 79 | f = hashfd_check(index_name); |
aa7e44bf | 80 | } else { |
e337a04d | 81 | if (!index_name) { |
594fa999 JK |
82 | struct strbuf tmp_file = STRBUF_INIT; |
83 | fd = odb_mkstemp(&tmp_file, "pack/tmp_idx_XXXXXX"); | |
84 | index_name = strbuf_detach(&tmp_file, NULL); | |
e337a04d JH |
85 | } else { |
86 | unlink(index_name); | |
66e905b7 | 87 | fd = xopen(index_name, O_CREAT|O_EXCL|O_WRONLY, 0600); |
e337a04d | 88 | } |
98a3beab | 89 | f = hashfd(fd, index_name); |
aa7e44bf | 90 | } |
aa7e44bf GB |
91 | |
92 | /* if last object's offset is >= 2^31 we should use index V2 */ | |
fb956c1f | 93 | index_version = need_large_offset(last_obj_offset, opts) ? 2 : opts->version; |
aa7e44bf GB |
94 | |
95 | /* index versions 2 and above need a header */ | |
96 | if (index_version >= 2) { | |
97 | struct pack_idx_header hdr; | |
98 | hdr.idx_signature = htonl(PACK_IDX_SIGNATURE); | |
99 | hdr.idx_version = htonl(index_version); | |
98a3beab | 100 | hashwrite(f, &hdr, sizeof(hdr)); |
aa7e44bf GB |
101 | } |
102 | ||
103 | /* | |
104 | * Write the first-level table (the list is sorted, | |
105 | * but we use a 256-entry lookup to be able to avoid | |
106 | * having to do eight extra binary search iterations). | |
107 | */ | |
108 | for (i = 0; i < 256; i++) { | |
109 | struct pack_idx_entry **next = list; | |
110 | while (next < last) { | |
111 | struct pack_idx_entry *obj = *next; | |
e6a492b7 | 112 | if (obj->oid.hash[0] != i) |
aa7e44bf GB |
113 | break; |
114 | next++; | |
115 | } | |
06d43fad | 116 | hashwrite_be32(f, next - sorted_by_sha); |
aa7e44bf GB |
117 | list = next; |
118 | } | |
aa7e44bf | 119 | |
aa7e44bf GB |
120 | /* |
121 | * Write the actual SHA1 entries.. | |
122 | */ | |
123 | list = sorted_by_sha; | |
124 | for (i = 0; i < nr_objects; i++) { | |
125 | struct pack_idx_entry *obj = *list++; | |
389cf68c RS |
126 | if (index_version < 2) |
127 | hashwrite_be32(f, obj->offset); | |
98a3beab | 128 | hashwrite(f, obj->oid.hash, the_hash_algo->rawsz); |
68be2fea | 129 | if ((opts->flags & WRITE_IDX_STRICT) && |
4a7e27e9 | 130 | (i && oideq(&list[-2]->oid, &obj->oid))) |
68be2fea | 131 | die("The same object %s appears twice in the pack", |
e6a492b7 | 132 | oid_to_hex(&obj->oid)); |
aa7e44bf GB |
133 | } |
134 | ||
135 | if (index_version >= 2) { | |
136 | unsigned int nr_large_offset = 0; | |
137 | ||
138 | /* write the crc32 table */ | |
139 | list = sorted_by_sha; | |
140 | for (i = 0; i < nr_objects; i++) { | |
141 | struct pack_idx_entry *obj = *list++; | |
389cf68c | 142 | hashwrite_be32(f, obj->crc32); |
aa7e44bf GB |
143 | } |
144 | ||
145 | /* write the 32-bit offset table */ | |
146 | list = sorted_by_sha; | |
147 | for (i = 0; i < nr_objects; i++) { | |
148 | struct pack_idx_entry *obj = *list++; | |
fb956c1f JH |
149 | uint32_t offset; |
150 | ||
151 | offset = (need_large_offset(obj->offset, opts) | |
152 | ? (0x80000000 | nr_large_offset++) | |
153 | : obj->offset); | |
389cf68c | 154 | hashwrite_be32(f, offset); |
aa7e44bf GB |
155 | } |
156 | ||
157 | /* write the large offset table */ | |
158 | list = sorted_by_sha; | |
159 | while (nr_large_offset) { | |
160 | struct pack_idx_entry *obj = *list++; | |
161 | uint64_t offset = obj->offset; | |
fb956c1f JH |
162 | |
163 | if (!need_large_offset(offset, opts)) | |
164 | continue; | |
970909c2 | 165 | hashwrite_be64(f, offset); |
fb956c1f | 166 | nr_large_offset--; |
aa7e44bf GB |
167 | } |
168 | } | |
169 | ||
98a3beab | 170 | hashwrite(f, sha1, the_hash_algo->rawsz); |
020406ea NS |
171 | finalize_hashfile(f, NULL, FSYNC_COMPONENT_PACK_METADATA, |
172 | CSUM_HASH_IN_STREAM | CSUM_CLOSE | | |
173 | ((opts->flags & WRITE_IDX_VERIFY) ? 0 : CSUM_FSYNC)); | |
aa7e44bf GB |
174 | return index_name; |
175 | } | |
8b0eca7c | 176 | |
8ef50d99 TB |
177 | static int pack_order_cmp(const void *va, const void *vb, void *ctx) |
178 | { | |
179 | struct pack_idx_entry **objects = ctx; | |
180 | ||
181 | off_t oa = objects[*(uint32_t*)va]->offset; | |
182 | off_t ob = objects[*(uint32_t*)vb]->offset; | |
183 | ||
184 | if (oa < ob) | |
185 | return -1; | |
186 | if (oa > ob) | |
187 | return 1; | |
188 | return 0; | |
189 | } | |
190 | ||
191 | static void write_rev_header(struct hashfile *f) | |
192 | { | |
8ef50d99 TB |
193 | hashwrite_be32(f, RIDX_SIGNATURE); |
194 | hashwrite_be32(f, RIDX_VERSION); | |
d9fef9d9 | 195 | hashwrite_be32(f, oid_version(the_hash_algo)); |
8ef50d99 TB |
196 | } |
197 | ||
198 | static void write_rev_index_positions(struct hashfile *f, | |
a587b5a7 | 199 | uint32_t *pack_order, |
8ef50d99 TB |
200 | uint32_t nr_objects) |
201 | { | |
8ef50d99 | 202 | uint32_t i; |
8ef50d99 TB |
203 | for (i = 0; i < nr_objects; i++) |
204 | hashwrite_be32(f, pack_order[i]); | |
8ef50d99 TB |
205 | } |
206 | ||
207 | static void write_rev_trailer(struct hashfile *f, const unsigned char *hash) | |
208 | { | |
209 | hashwrite(f, hash, the_hash_algo->rawsz); | |
210 | } | |
211 | ||
212 | const char *write_rev_file(const char *rev_name, | |
213 | struct pack_idx_entry **objects, | |
214 | uint32_t nr_objects, | |
215 | const unsigned char *hash, | |
216 | unsigned flags) | |
a587b5a7 TB |
217 | { |
218 | uint32_t *pack_order; | |
219 | uint32_t i; | |
220 | const char *ret; | |
221 | ||
8fe8bae9 ÆAB |
222 | if (!(flags & WRITE_REV) && !(flags & WRITE_REV_VERIFY)) |
223 | return NULL; | |
224 | ||
a587b5a7 TB |
225 | ALLOC_ARRAY(pack_order, nr_objects); |
226 | for (i = 0; i < nr_objects; i++) | |
227 | pack_order[i] = i; | |
228 | QSORT_S(pack_order, nr_objects, pack_order_cmp, objects); | |
229 | ||
230 | ret = write_rev_file_order(rev_name, pack_order, nr_objects, hash, | |
231 | flags); | |
232 | ||
233 | free(pack_order); | |
234 | ||
235 | return ret; | |
236 | } | |
237 | ||
238 | const char *write_rev_file_order(const char *rev_name, | |
239 | uint32_t *pack_order, | |
240 | uint32_t nr_objects, | |
241 | const unsigned char *hash, | |
242 | unsigned flags) | |
8ef50d99 TB |
243 | { |
244 | struct hashfile *f; | |
245 | int fd; | |
246 | ||
247 | if ((flags & WRITE_REV) && (flags & WRITE_REV_VERIFY)) | |
248 | die(_("cannot both write and verify reverse index")); | |
249 | ||
250 | if (flags & WRITE_REV) { | |
251 | if (!rev_name) { | |
252 | struct strbuf tmp_file = STRBUF_INIT; | |
253 | fd = odb_mkstemp(&tmp_file, "pack/tmp_rev_XXXXXX"); | |
254 | rev_name = strbuf_detach(&tmp_file, NULL); | |
255 | } else { | |
256 | unlink(rev_name); | |
66e905b7 | 257 | fd = xopen(rev_name, O_CREAT|O_EXCL|O_WRONLY, 0600); |
8ef50d99 TB |
258 | } |
259 | f = hashfd(fd, rev_name); | |
260 | } else if (flags & WRITE_REV_VERIFY) { | |
261 | struct stat statbuf; | |
262 | if (stat(rev_name, &statbuf)) { | |
263 | if (errno == ENOENT) { | |
264 | /* .rev files are optional */ | |
265 | return NULL; | |
266 | } else | |
267 | die_errno(_("could not stat: %s"), rev_name); | |
268 | } | |
269 | f = hashfd_check(rev_name); | |
270 | } else | |
271 | return NULL; | |
272 | ||
273 | write_rev_header(f); | |
274 | ||
a587b5a7 | 275 | write_rev_index_positions(f, pack_order, nr_objects); |
8ef50d99 TB |
276 | write_rev_trailer(f, hash); |
277 | ||
278 | if (rev_name && adjust_shared_perm(rev_name) < 0) | |
279 | die(_("failed to make %s readable"), rev_name); | |
280 | ||
020406ea NS |
281 | finalize_hashfile(f, NULL, FSYNC_COMPONENT_PACK_METADATA, |
282 | CSUM_HASH_IN_STREAM | CSUM_CLOSE | | |
283 | ((flags & WRITE_IDX_VERIFY) ? 0 : CSUM_FSYNC)); | |
8ef50d99 TB |
284 | |
285 | return rev_name; | |
286 | } | |
287 | ||
5dfaf49a TB |
288 | static void write_mtimes_header(struct hashfile *f) |
289 | { | |
290 | hashwrite_be32(f, MTIMES_SIGNATURE); | |
291 | hashwrite_be32(f, MTIMES_VERSION); | |
292 | hashwrite_be32(f, oid_version(the_hash_algo)); | |
293 | } | |
294 | ||
295 | /* | |
296 | * Writes the object mtimes of "objects" for use in a .mtimes file. | |
297 | * Note that objects must be in lexicographic (index) order, which is | |
298 | * the expected ordering of these values in the .mtimes file. | |
299 | */ | |
300 | static void write_mtimes_objects(struct hashfile *f, | |
301 | struct packing_data *to_pack, | |
302 | struct pack_idx_entry **objects, | |
303 | uint32_t nr_objects) | |
304 | { | |
305 | uint32_t i; | |
306 | for (i = 0; i < nr_objects; i++) { | |
307 | struct object_entry *e = (struct object_entry*)objects[i]; | |
308 | hashwrite_be32(f, oe_cruft_mtime(to_pack, e)); | |
309 | } | |
310 | } | |
311 | ||
312 | static void write_mtimes_trailer(struct hashfile *f, const unsigned char *hash) | |
313 | { | |
314 | hashwrite(f, hash, the_hash_algo->rawsz); | |
315 | } | |
316 | ||
c4125835 TB |
317 | static char *write_mtimes_file(struct packing_data *to_pack, |
318 | struct pack_idx_entry **objects, | |
319 | uint32_t nr_objects, | |
320 | const unsigned char *hash) | |
5dfaf49a | 321 | { |
82db195e | 322 | struct strbuf tmp_file = STRBUF_INIT; |
c4125835 | 323 | char *mtimes_name; |
5dfaf49a TB |
324 | struct hashfile *f; |
325 | int fd; | |
326 | ||
327 | if (!to_pack) | |
328 | BUG("cannot call write_mtimes_file with NULL packing_data"); | |
329 | ||
82db195e DS |
330 | fd = odb_mkstemp(&tmp_file, "pack/tmp_mtimes_XXXXXX"); |
331 | mtimes_name = strbuf_detach(&tmp_file, NULL); | |
5dfaf49a TB |
332 | f = hashfd(fd, mtimes_name); |
333 | ||
334 | write_mtimes_header(f); | |
335 | write_mtimes_objects(f, to_pack, objects, nr_objects); | |
336 | write_mtimes_trailer(f, hash); | |
337 | ||
338 | if (adjust_shared_perm(mtimes_name) < 0) | |
339 | die(_("failed to make %s readable"), mtimes_name); | |
340 | ||
341 | finalize_hashfile(f, NULL, FSYNC_COMPONENT_PACK_METADATA, | |
342 | CSUM_HASH_IN_STREAM | CSUM_CLOSE | CSUM_FSYNC); | |
343 | ||
344 | return mtimes_name; | |
345 | } | |
346 | ||
98a3beab | 347 | off_t write_pack_header(struct hashfile *f, uint32_t nr_entries) |
c0ad4657 JH |
348 | { |
349 | struct pack_header hdr; | |
350 | ||
351 | hdr.hdr_signature = htonl(PACK_SIGNATURE); | |
352 | hdr.hdr_version = htonl(PACK_VERSION); | |
353 | hdr.hdr_entries = htonl(nr_entries); | |
98a3beab | 354 | hashwrite(f, &hdr, sizeof(hdr)); |
c0ad4657 JH |
355 | return sizeof(hdr); |
356 | } | |
357 | ||
abeb40e5 NP |
358 | /* |
359 | * Update pack header with object_count and compute new SHA1 for pack data | |
360 | * associated to pack_fd, and write that SHA1 at the end. That new SHA1 | |
361 | * is also returned in new_pack_sha1. | |
362 | * | |
363 | * If partial_pack_sha1 is non null, then the SHA1 of the existing pack | |
364 | * (without the header update) is computed and validated against the | |
365 | * one provided in partial_pack_sha1. The validation is performed at | |
366 | * partial_pack_offset bytes in the pack file. The SHA1 of the remaining | |
367 | * data (i.e. from partial_pack_offset to the end) is then computed and | |
368 | * returned in partial_pack_sha1. | |
369 | * | |
370 | * Note that new_pack_sha1 is updated last, so both new_pack_sha1 and | |
371 | * partial_pack_sha1 can refer to the same buffer if the caller is not | |
372 | * interested in the resulting SHA1 of pack data above partial_pack_offset. | |
373 | */ | |
8b0eca7c | 374 | void fixup_pack_header_footer(int pack_fd, |
81c58cd4 | 375 | unsigned char *new_pack_hash, |
8b0eca7c | 376 | const char *pack_name, |
abeb40e5 | 377 | uint32_t object_count, |
81c58cd4 | 378 | unsigned char *partial_pack_hash, |
abeb40e5 | 379 | off_t partial_pack_offset) |
8b0eca7c | 380 | { |
d35825da | 381 | int aligned_sz, buf_sz = 8 * 1024; |
81c58cd4 | 382 | git_hash_ctx old_hash_ctx, new_hash_ctx; |
8b0eca7c DH |
383 | struct pack_header hdr; |
384 | char *buf; | |
90dca671 | 385 | ssize_t read_result; |
8b0eca7c | 386 | |
81c58cd4 | 387 | the_hash_algo->init_fn(&old_hash_ctx); |
388 | the_hash_algo->init_fn(&new_hash_ctx); | |
abeb40e5 | 389 | |
8b0eca7c | 390 | if (lseek(pack_fd, 0, SEEK_SET) != 0) |
d824cbba | 391 | die_errno("Failed seeking to start of '%s'", pack_name); |
90dca671 JK |
392 | read_result = read_in_full(pack_fd, &hdr, sizeof(hdr)); |
393 | if (read_result < 0) | |
d824cbba | 394 | die_errno("Unable to reread header of '%s'", pack_name); |
90dca671 JK |
395 | else if (read_result != sizeof(hdr)) |
396 | die_errno("Unexpected short read for header of '%s'", | |
397 | pack_name); | |
8b0eca7c | 398 | if (lseek(pack_fd, 0, SEEK_SET) != 0) |
d824cbba | 399 | die_errno("Failed seeking to start of '%s'", pack_name); |
81c58cd4 | 400 | the_hash_algo->update_fn(&old_hash_ctx, &hdr, sizeof(hdr)); |
8b0eca7c | 401 | hdr.hdr_entries = htonl(object_count); |
81c58cd4 | 402 | the_hash_algo->update_fn(&new_hash_ctx, &hdr, sizeof(hdr)); |
8b0eca7c | 403 | write_or_die(pack_fd, &hdr, sizeof(hdr)); |
abeb40e5 | 404 | partial_pack_offset -= sizeof(hdr); |
8b0eca7c DH |
405 | |
406 | buf = xmalloc(buf_sz); | |
d35825da | 407 | aligned_sz = buf_sz - sizeof(hdr); |
8b0eca7c | 408 | for (;;) { |
abeb40e5 | 409 | ssize_t m, n; |
81c58cd4 | 410 | m = (partial_pack_hash && partial_pack_offset < aligned_sz) ? |
d35825da | 411 | partial_pack_offset : aligned_sz; |
abeb40e5 | 412 | n = xread(pack_fd, buf, m); |
8b0eca7c DH |
413 | if (!n) |
414 | break; | |
415 | if (n < 0) | |
d824cbba | 416 | die_errno("Failed to checksum '%s'", pack_name); |
81c58cd4 | 417 | the_hash_algo->update_fn(&new_hash_ctx, buf, n); |
abeb40e5 | 418 | |
d35825da NP |
419 | aligned_sz -= n; |
420 | if (!aligned_sz) | |
421 | aligned_sz = buf_sz; | |
422 | ||
81c58cd4 | 423 | if (!partial_pack_hash) |
abeb40e5 NP |
424 | continue; |
425 | ||
81c58cd4 | 426 | the_hash_algo->update_fn(&old_hash_ctx, buf, n); |
abeb40e5 NP |
427 | partial_pack_offset -= n; |
428 | if (partial_pack_offset == 0) { | |
81c58cd4 | 429 | unsigned char hash[GIT_MAX_RAWSZ]; |
430 | the_hash_algo->final_fn(hash, &old_hash_ctx); | |
67947c34 | 431 | if (!hasheq(hash, partial_pack_hash)) |
abeb40e5 NP |
432 | die("Unexpected checksum for %s " |
433 | "(disk corruption?)", pack_name); | |
434 | /* | |
435 | * Now let's compute the SHA1 of the remainder of the | |
436 | * pack, which also means making partial_pack_offset | |
437 | * big enough not to matter anymore. | |
438 | */ | |
81c58cd4 | 439 | the_hash_algo->init_fn(&old_hash_ctx); |
abeb40e5 NP |
440 | partial_pack_offset = ~partial_pack_offset; |
441 | partial_pack_offset -= MSB(partial_pack_offset, 1); | |
442 | } | |
8b0eca7c DH |
443 | } |
444 | free(buf); | |
445 | ||
81c58cd4 | 446 | if (partial_pack_hash) |
447 | the_hash_algo->final_fn(partial_pack_hash, &old_hash_ctx); | |
448 | the_hash_algo->final_fn(new_pack_hash, &new_hash_ctx); | |
449 | write_or_die(pack_fd, new_pack_hash, the_hash_algo->rawsz); | |
020406ea | 450 | fsync_component_or_die(FSYNC_COMPONENT_PACK, pack_fd, pack_name); |
8b0eca7c | 451 | } |
106764e6 | 452 | |
5476e1ef | 453 | char *index_pack_lockfile(int ip_out, int *is_well_formed) |
106764e6 | 454 | { |
81c58cd4 | 455 | char packname[GIT_MAX_HEXSZ + 6]; |
456 | const int len = the_hash_algo->hexsz + 6; | |
106764e6 SP |
457 | |
458 | /* | |
6e180cdc | 459 | * The first thing we expect from index-pack's output |
106764e6 SP |
460 | * is "pack\t%40s\n" or "keep\t%40s\n" (46 bytes) where |
461 | * %40s is the newly created pack SHA1 name. In the "keep" | |
462 | * case, we need it to remove the corresponding .keep file | |
463 | * later on. If we don't get that then tough luck with it. | |
464 | */ | |
81c58cd4 | 465 | if (read_in_full(ip_out, packname, len) == len && packname[len-1] == '\n') { |
d7731444 | 466 | const char *name; |
5476e1ef JT |
467 | |
468 | if (is_well_formed) | |
469 | *is_well_formed = 1; | |
81c58cd4 | 470 | packname[len-1] = 0; |
d7731444 RS |
471 | if (skip_prefix(packname, "keep\t", &name)) |
472 | return xstrfmt("%s/pack/pack-%s.keep", | |
473 | get_object_directory(), name); | |
5476e1ef | 474 | return NULL; |
106764e6 | 475 | } |
5476e1ef JT |
476 | if (is_well_formed) |
477 | *is_well_formed = 0; | |
106764e6 SP |
478 | return NULL; |
479 | } | |
f965c525 NP |
480 | |
481 | /* | |
482 | * The per-object header is a pretty dense thing, which is | |
483 | * - first byte: low four bits are "size", then three bits of "type", | |
484 | * and the high bit is "size continues". | |
485 | * - each byte afterwards: low seven bits are size continuation, | |
486 | * with the high bit being "size continues" | |
487 | */ | |
7202a6fa JK |
488 | int encode_in_pack_object_header(unsigned char *hdr, int hdr_len, |
489 | enum object_type type, uintmax_t size) | |
f965c525 NP |
490 | { |
491 | int n = 1; | |
492 | unsigned char c; | |
493 | ||
494 | if (type < OBJ_COMMIT || type > OBJ_REF_DELTA) | |
495 | die("bad type %d", type); | |
496 | ||
497 | c = (type << 4) | (size & 15); | |
498 | size >>= 4; | |
499 | while (size) { | |
7202a6fa JK |
500 | if (n == hdr_len) |
501 | die("object size is too enormous to format"); | |
f965c525 NP |
502 | *hdr++ = c | 0x80; |
503 | c = size & 0x7f; | |
504 | size >>= 7; | |
505 | n++; | |
506 | } | |
507 | *hdr = c; | |
508 | return n; | |
509 | } | |
cdf9db3c | 510 | |
98a3beab | 511 | struct hashfile *create_tmp_packfile(char **pack_tmp_name) |
cdf9db3c | 512 | { |
594fa999 | 513 | struct strbuf tmpname = STRBUF_INIT; |
cdf9db3c JH |
514 | int fd; |
515 | ||
594fa999 JK |
516 | fd = odb_mkstemp(&tmpname, "pack/tmp_pack_XXXXXX"); |
517 | *pack_tmp_name = strbuf_detach(&tmpname, NULL); | |
98a3beab | 518 | return hashfd(fd, *pack_tmp_name); |
cdf9db3c | 519 | } |
0e990530 | 520 | |
66833f0e ÆAB |
521 | static void rename_tmp_packfile(struct strbuf *name_prefix, const char *source, |
522 | const char *ext) | |
523 | { | |
524 | size_t name_prefix_len = name_prefix->len; | |
525 | ||
526 | strbuf_addstr(name_prefix, ext); | |
527 | if (rename(source, name_prefix->buf)) | |
528 | die_errno("unable to rename temporary file to '%s'", | |
529 | name_prefix->buf); | |
530 | strbuf_setlen(name_prefix, name_prefix_len); | |
531 | } | |
532 | ||
2ec02dd5 ÆAB |
533 | void rename_tmp_packfile_idx(struct strbuf *name_buffer, |
534 | char **idx_tmp_name) | |
535 | { | |
536 | rename_tmp_packfile(name_buffer, *idx_tmp_name, "idx"); | |
537 | } | |
538 | ||
539 | void stage_tmp_packfiles(struct strbuf *name_buffer, | |
0e990530 JH |
540 | const char *pack_tmp_name, |
541 | struct pack_idx_entry **written_list, | |
542 | uint32_t nr_written, | |
1c573cdd | 543 | struct packing_data *to_pack, |
0e990530 | 544 | struct pack_idx_option *pack_idx_opts, |
2ec02dd5 ÆAB |
545 | unsigned char hash[], |
546 | char **idx_tmp_name) | |
0e990530 | 547 | { |
2ec02dd5 | 548 | const char *rev_tmp_name = NULL; |
c4125835 | 549 | char *mtimes_tmp_name = NULL; |
0e990530 JH |
550 | |
551 | if (adjust_shared_perm(pack_tmp_name)) | |
552 | die_errno("unable to make temporary pack file readable"); | |
553 | ||
2ec02dd5 ÆAB |
554 | *idx_tmp_name = (char *)write_idx_file(NULL, written_list, nr_written, |
555 | pack_idx_opts, hash); | |
556 | if (adjust_shared_perm(*idx_tmp_name)) | |
0e990530 JH |
557 | die_errno("unable to make temporary index file readable"); |
558 | ||
8ef50d99 TB |
559 | rev_tmp_name = write_rev_file(NULL, written_list, nr_written, hash, |
560 | pack_idx_opts->flags); | |
561 | ||
5dfaf49a | 562 | if (pack_idx_opts->flags & WRITE_MTIMES) { |
82db195e | 563 | mtimes_tmp_name = write_mtimes_file(to_pack, written_list, |
5dfaf49a TB |
564 | nr_written, |
565 | hash); | |
566 | } | |
567 | ||
66833f0e | 568 | rename_tmp_packfile(name_buffer, pack_tmp_name, "pack"); |
66833f0e ÆAB |
569 | if (rev_tmp_name) |
570 | rename_tmp_packfile(name_buffer, rev_tmp_name, "rev"); | |
5dfaf49a TB |
571 | if (mtimes_tmp_name) |
572 | rename_tmp_packfile(name_buffer, mtimes_tmp_name, "mtimes"); | |
3969e6c5 TB |
573 | |
574 | free((char *)rev_tmp_name); | |
c4125835 | 575 | free(mtimes_tmp_name); |
0e990530 | 576 | } |
33add2ad CC |
577 | |
578 | void write_promisor_file(const char *promisor_name, struct ref **sought, int nr_sought) | |
579 | { | |
7c99bc23 | 580 | int i, err; |
33add2ad CC |
581 | FILE *output = xfopen(promisor_name, "w"); |
582 | ||
583 | for (i = 0; i < nr_sought; i++) | |
584 | fprintf(output, "%s %s\n", oid_to_hex(&sought[i]->old_oid), | |
585 | sought[i]->name); | |
7c99bc23 CC |
586 | |
587 | err = ferror(output); | |
588 | err |= fclose(output); | |
589 | if (err) | |
590 | die(_("could not write '%s' promisor file"), promisor_name); | |
33add2ad | 591 | } |