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