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