2 * Copyright (c) 2020 Ori Bernstein
3 * Copyright (c) 2021 Stefan Sperling <stsp@openbsd.org>
5 * Permission to use, copy, modify, and distribute this software for any
6 * purpose with or without fee is hereby granted, provided that the above
7 * copyright notice and this permission notice appear in all copies.
9 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
10 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
11 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
12 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
13 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
14 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
15 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
18 #include <sys/types.h>
19 #include <sys/queue.h>
37 #include "got_error.h"
38 #include "got_cancel.h"
39 #include "got_object.h"
41 #include "got_reference.h"
42 #include "got_repository_admin.h"
43 #include "got_opentemp.h"
45 #include "got_lib_deltify.h"
46 #include "got_lib_delta.h"
47 #include "got_lib_object.h"
48 #include "got_lib_object_idset.h"
49 #include "got_lib_object_cache.h"
50 #include "got_lib_deflate.h"
51 #include "got_lib_pack.h"
52 #include "got_lib_privsep.h"
53 #include "got_lib_repository.h"
54 #include "got_lib_ratelimit.h"
57 #define MIN(_a,_b) ((_a) < (_b) ? (_a) : (_b))
61 #define MAX(_a,_b) ((_a) > (_b) ? (_a) : (_b))
65 #define nitems(_a) (sizeof((_a)) / sizeof((_a)[0]))
68 struct got_pack_meta {
69 struct got_object_id id;
75 /* The best delta we picked */
76 struct got_pack_meta *head;
77 struct got_pack_meta *prev;
78 unsigned char *delta_buf; /* if not encoded in delta cache file */
79 off_t delta_offset; /* offset in delta cache file */
80 off_t delta_len; /* encoded delta length */
83 int have_reused_delta;
84 off_t reused_delta_offset; /* offset of delta in reused pack file */
85 struct got_object_id *base_obj_id;
87 /* Only used for delta window */
88 struct got_delta_table *dtab;
90 /* Only used for writing offset deltas */
94 struct got_pack_metavec {
95 struct got_pack_meta **meta;
100 static const struct got_error *
101 alloc_meta(struct got_pack_meta **new, struct got_object_id *id,
102 const char *path, int obj_type, time_t mtime)
104 const struct got_error *err = NULL;
105 struct got_pack_meta *m;
109 m = calloc(1, sizeof(*m));
111 return got_error_from_errno("calloc");
113 memcpy(&m->id, id, sizeof(m->id));
115 m->path = strdup(path);
116 if (m->path == NULL) {
117 err = got_error_from_errno("strdup");
122 m->obj_type = obj_type;
129 clear_meta(struct got_pack_meta *meta)
135 free(meta->delta_buf);
136 meta->delta_buf = NULL;
137 free(meta->base_obj_id);
138 meta->base_obj_id = NULL;
142 free_nmeta(struct got_pack_meta **meta, int nmeta)
146 for (i = 0; i < nmeta; i++)
152 delta_order_cmp(const void *pa, const void *pb)
154 struct got_pack_meta *a, *b;
157 a = *(struct got_pack_meta **)pa;
158 b = *(struct got_pack_meta **)pb;
160 if (a->obj_type != b->obj_type)
161 return a->obj_type - b->obj_type;
162 cmp = strcmp(a->path, b->path);
165 if (a->mtime != b->mtime)
166 return a->mtime - b->mtime;
167 return got_object_id_cmp(&a->id, &b->id);
171 delta_size(struct got_delta_instruction *deltas, int ndeltas)
175 for (i = 0; i < ndeltas; i++) {
177 size += GOT_DELTA_SIZE_SHIFT;
179 size += deltas[i].len + 1;
184 static const struct got_error *
185 append(unsigned char **p, size_t *len, off_t *sz, void *seg, int nseg)
189 if (*len + nseg >= *sz) {
190 while (*len + nseg >= *sz)
192 n = realloc(*p, *sz);
194 return got_error_from_errno("realloc");
197 memcpy(*p + *len, seg, nseg);
202 static const struct got_error *
203 encode_delta_in_mem(struct got_pack_meta *m, struct got_raw_object *o,
204 struct got_delta_instruction *deltas, int ndeltas,
205 off_t delta_size, off_t base_size)
207 const struct got_error *err;
208 unsigned char buf[16], *bp;
212 struct got_delta_instruction *d;
214 m->delta_buf = malloc(delta_size);
215 if (m->delta_buf == NULL)
216 return got_error_from_errno("calloc");
218 /* base object size */
219 buf[0] = base_size & GOT_DELTA_SIZE_VAL_MASK;
220 n = base_size >> GOT_DELTA_SIZE_SHIFT;
221 for (i = 1; n > 0; i++) {
222 buf[i - 1] |= GOT_DELTA_SIZE_MORE;
223 buf[i] = n & GOT_DELTA_SIZE_VAL_MASK;
224 n >>= GOT_DELTA_SIZE_SHIFT;
226 err = append(&m->delta_buf, &len, &delta_size, buf, i);
230 /* target object size */
231 buf[0] = o->size & GOT_DELTA_SIZE_VAL_MASK;
232 n = o->size >> GOT_DELTA_SIZE_SHIFT;
233 for (i = 1; n > 0; i++) {
234 buf[i - 1] |= GOT_DELTA_SIZE_MORE;
235 buf[i] = n & GOT_DELTA_SIZE_VAL_MASK;
236 n >>= GOT_DELTA_SIZE_SHIFT;
238 err = append(&m->delta_buf, &len, &delta_size, buf, i);
242 for (j = 0; j < ndeltas; j++) {
247 buf[0] = GOT_DELTA_BASE_COPY;
248 for (i = 0; i < 4; i++) {
249 /* DELTA_COPY_OFF1 ... DELTA_COPY_OFF4 */
258 if (n != GOT_DELTA_COPY_DEFAULT_LEN) {
259 /* DELTA_COPY_LEN1 ... DELTA_COPY_LEN3 */
260 for (i = 0; i < 3 && n > 0; i++) {
261 buf[0] |= 1 << (i + 4);
266 err = append(&m->delta_buf, &len, &delta_size,
270 } else if (o->f == NULL) {
272 while (n != d->len) {
273 buf[0] = (d->len - n < 127) ? d->len - n : 127;
274 err = append(&m->delta_buf, &len, &delta_size,
278 err = append(&m->delta_buf, &len, &delta_size,
279 o->data + o->hdrlen + d->offset + n,
288 if (fseeko(o->f, o->hdrlen + d->offset, SEEK_SET) == -1)
289 return got_error_from_errno("fseeko");
291 while (n != d->len) {
292 buf[0] = (d->len - n < 127) ? d->len - n : 127;
293 err = append(&m->delta_buf, &len, &delta_size,
297 r = fread(content, 1, buf[0], o->f);
299 return got_ferror(o->f, GOT_ERR_IO);
300 err = append(&m->delta_buf, &len, &delta_size,
313 static const struct got_error *
314 encode_delta(struct got_pack_meta *m, struct got_raw_object *o,
315 struct got_delta_instruction *deltas, int ndeltas,
316 off_t base_size, FILE *f)
318 unsigned char buf[16], *bp;
322 struct got_delta_instruction *d;
324 /* base object size */
325 buf[0] = base_size & GOT_DELTA_SIZE_VAL_MASK;
326 n = base_size >> GOT_DELTA_SIZE_SHIFT;
327 for (i = 1; n > 0; i++) {
328 buf[i - 1] |= GOT_DELTA_SIZE_MORE;
329 buf[i] = n & GOT_DELTA_SIZE_VAL_MASK;
330 n >>= GOT_DELTA_SIZE_SHIFT;
332 w = fwrite(buf, 1, i, f);
334 return got_ferror(f, GOT_ERR_IO);
336 /* target object size */
337 buf[0] = o->size & GOT_DELTA_SIZE_VAL_MASK;
338 n = o->size >> GOT_DELTA_SIZE_SHIFT;
339 for (i = 1; n > 0; i++) {
340 buf[i - 1] |= GOT_DELTA_SIZE_MORE;
341 buf[i] = n & GOT_DELTA_SIZE_VAL_MASK;
342 n >>= GOT_DELTA_SIZE_SHIFT;
344 w = fwrite(buf, 1, i, f);
346 return got_ferror(f, GOT_ERR_IO);
348 for (j = 0; j < ndeltas; j++) {
353 buf[0] = GOT_DELTA_BASE_COPY;
354 for (i = 0; i < 4; i++) {
355 /* DELTA_COPY_OFF1 ... DELTA_COPY_OFF4 */
364 if (n != GOT_DELTA_COPY_DEFAULT_LEN) {
365 /* DELTA_COPY_LEN1 ... DELTA_COPY_LEN3 */
366 for (i = 0; i < 3 && n > 0; i++) {
367 buf[0] |= 1 << (i + 4);
372 w = fwrite(buf, 1, bp - buf, f);
374 return got_ferror(f, GOT_ERR_IO);
375 } else if (o->f == NULL) {
377 while (n != d->len) {
378 buf[0] = (d->len - n < 127) ? d->len - n : 127;
379 w = fwrite(buf, 1, 1, f);
381 return got_ferror(f, GOT_ERR_IO);
382 w = fwrite(o->data + o->hdrlen + d->offset + n,
385 return got_ferror(f, GOT_ERR_IO);
391 if (fseeko(o->f, o->hdrlen + d->offset, SEEK_SET) == -1)
392 return got_error_from_errno("fseeko");
394 while (n != d->len) {
395 buf[0] = (d->len - n < 127) ? d->len - n : 127;
396 w = fwrite(buf, 1, 1, f);
398 return got_ferror(f, GOT_ERR_IO);
399 r = fread(content, 1, buf[0], o->f);
401 return got_ferror(o->f, GOT_ERR_IO);
402 w = fwrite(content, 1, buf[0], f);
404 return got_ferror(f, GOT_ERR_IO);
410 m->delta_len = ftello(f) - m->delta_offset;
414 static const struct got_error *
415 report_progress(got_pack_progress_cb progress_cb, void *progress_arg,
416 struct got_ratelimit *rl, int ncolored, int nfound, int ntrees,
417 off_t packfile_size, int ncommits, int nobj_total, int obj_deltify,
420 const struct got_error *err;
423 if (progress_cb == NULL)
426 err = got_ratelimit_check(&elapsed, rl);
430 return progress_cb(progress_arg, ncolored, nfound, ntrees,
431 packfile_size, ncommits, nobj_total, obj_deltify, nobj_written);
434 static const struct got_error *
435 add_meta(struct got_pack_meta *m, struct got_pack_metavec *v)
437 if (v->nmeta == v->metasz){
438 size_t newsize = 2 * v->metasz;
439 struct got_pack_meta **new;
440 new = reallocarray(v->meta, newsize, sizeof(*new));
442 return got_error_from_errno("reallocarray");
447 v->meta[v->nmeta++] = m;
451 static const struct got_error *
452 reuse_delta(int idx, struct got_pack_meta *m, struct got_pack_metavec *v,
453 struct got_object_idset *idset, struct got_pack *pack,
454 struct got_packidx *packidx, int delta_cache_fd,
455 struct got_repository *repo)
457 const struct got_error *err = NULL;
458 struct got_pack_meta *base = NULL;
459 struct got_object_id *base_obj_id = NULL;
460 off_t delta_len = 0, delta_offset = 0, delta_cache_offset = 0;
461 uint64_t base_size, result_size;
463 if (m->have_reused_delta)
466 err = got_object_read_raw_delta(&base_size, &result_size, &delta_len,
467 &delta_offset, &delta_cache_offset, &base_obj_id, delta_cache_fd,
468 packidx, idx, &m->id, repo);
472 if (delta_offset + delta_len < delta_offset)
473 return got_error(GOT_ERR_BAD_PACKFILE);
475 base = got_object_idset_get(idset, base_obj_id);
479 m->delta_len = delta_len;
480 m->delta_offset = delta_cache_offset;
482 m->size = result_size;
483 m->have_reused_delta = 1;
484 m->reused_delta_offset = delta_offset;
485 m->base_obj_id = base_obj_id;
487 err = add_meta(m, v);
493 static const struct got_error *
494 find_pack_for_reuse(struct got_packidx **best_packidx,
495 struct got_repository *repo)
497 const struct got_error *err = NULL;
498 struct got_pathlist_entry *pe;
499 const char *best_packidx_path = NULL;
502 *best_packidx = NULL;
504 TAILQ_FOREACH(pe, &repo->packidx_paths, entry) {
505 const char *path_packidx = pe->path;
506 struct got_packidx *packidx;
509 err = got_repo_get_packidx(&packidx, path_packidx, repo);
513 nobj = be32toh(packidx->hdr.fanout_table[0xff]);
514 if (nobj > nobj_max) {
515 best_packidx_path = path_packidx;
520 if (best_packidx_path) {
521 err = got_repo_get_packidx(best_packidx, best_packidx_path,
528 struct search_deltas_arg {
529 struct got_packidx *packidx;
530 struct got_pack *pack;
531 struct got_object_idset *idset;
532 struct got_pack_metavec *v;
534 struct got_repository *repo;
535 got_pack_progress_cb progress_cb;
537 struct got_ratelimit *rl;
538 got_cancel_cb cancel_cb;
546 static const struct got_error *
547 search_delta_for_object(struct got_object_id *id, void *data, void *arg)
549 const struct got_error *err;
550 struct got_pack_meta *m = data;
551 struct search_deltas_arg *a = arg;
553 struct got_object *obj = NULL;
556 err = (*a->cancel_cb)(a->cancel_arg);
561 if (!got_repo_check_packidx_bloom_filter(a->repo,
562 a->packidx->path_packidx, id))
565 obj_idx = got_packidx_get_object_idx(a->packidx, id);
570 * Opening and closing an object just to check its flags
571 * is a bit expensive. We could have an imsg which requests
572 * plain type/size information for an object without doing
573 * work such as traversing the object's entire delta chain
574 * to find the base object type, and other such info which
575 * we don't really need here.
577 err = got_object_open_from_packfile(&obj, &m->id, a->pack,
578 a->packidx, obj_idx, a->repo);
582 if (obj->flags & GOT_OBJ_FLAG_DELTIFIED) {
583 reuse_delta(obj_idx, m, a->v, a->idset, a->pack, a->packidx,
584 a->delta_cache_fd, a->repo);
587 err = report_progress(a->progress_cb, a->progress_arg, a->rl,
588 a->ncolored, a->nfound, a->ntrees, 0L, a->ncommits,
589 got_object_idset_num_elements(a->idset), a->v->nmeta, 0);
592 got_object_close(obj);
596 static const struct got_error *
597 search_deltas(struct got_pack_metavec *v, struct got_object_idset *idset,
598 int delta_cache_fd, int ncolored, int nfound, int ntrees, int ncommits,
599 struct got_repository *repo,
600 got_pack_progress_cb progress_cb, void *progress_arg,
601 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
603 const struct got_error *err = NULL;
604 char *path_packfile = NULL;
605 struct got_packidx *packidx;
606 struct got_pack *pack;
607 struct search_deltas_arg sda;
609 err = find_pack_for_reuse(&packidx, repo);
616 err = got_packidx_get_packfile_path(&path_packfile,
617 packidx->path_packidx);
621 pack = got_repo_get_cached_pack(repo, path_packfile);
623 err = got_repo_cache_pack(&pack, repo, path_packfile, packidx);
628 sda.packidx = packidx;
632 sda.delta_cache_fd = delta_cache_fd;
634 sda.progress_cb = progress_cb;
635 sda.progress_arg = progress_arg;
637 sda.cancel_cb = cancel_cb;
638 sda.cancel_arg = cancel_arg;
639 sda.ncolored = ncolored;
642 sda.ncommits = ncommits;
643 err = got_object_idset_for_each(idset, search_delta_for_object, &sda);
649 static const struct got_error *
650 pick_deltas(struct got_pack_meta **meta, int nmeta, int ncolored,
651 int nfound, int ntrees, int ncommits, int nreused, FILE *delta_cache,
652 struct got_repository *repo,
653 got_pack_progress_cb progress_cb, void *progress_arg,
654 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
656 const struct got_error *err = NULL;
657 struct got_pack_meta *m = NULL, *base = NULL;
658 struct got_raw_object *raw = NULL, *base_raw = NULL;
659 struct got_delta_instruction *deltas = NULL, *best_deltas = NULL;
660 int i, j, ndeltas, best_ndeltas;
661 off_t size, best_size;
662 const int max_base_candidates = 3;
663 size_t delta_memsize = 0;
664 const size_t max_delta_memsize = 25 * GOT_DELTA_RESULT_SIZE_CACHED_MAX;
667 qsort(meta, nmeta, sizeof(struct got_pack_meta *), delta_order_cmp);
668 for (i = 0; i < nmeta; i++) {
670 err = (*cancel_cb)(cancel_arg);
674 err = report_progress(progress_cb, progress_arg, rl,
675 ncolored, nfound, ntrees, 0L, ncommits, nreused + nmeta,
681 if (m->obj_type == GOT_OBJ_TYPE_COMMIT ||
682 m->obj_type == GOT_OBJ_TYPE_TAG)
685 err = got_object_raw_open(&raw, &outfd, repo, &m->id);
690 if (raw->f == NULL) {
691 err = got_deltify_init_mem(&m->dtab, raw->data,
692 raw->hdrlen, raw->size + raw->hdrlen);
694 err = got_deltify_init(&m->dtab, raw->f, raw->hdrlen,
695 raw->size + raw->hdrlen);
700 if (i > max_base_candidates) {
701 struct got_pack_meta *n = NULL;
702 n = meta[i - (max_base_candidates + 1)];
703 got_deltify_free(n->dtab);
707 best_size = raw->size;
709 for (j = MAX(0, i - max_base_candidates); j < i; j++) {
711 err = (*cancel_cb)(cancel_arg);
716 /* long chains make unpacking slow, avoid such bases */
717 if (base->nchain >= 128 ||
718 base->obj_type != m->obj_type)
721 err = got_object_raw_open(&base_raw, &outfd, repo,
726 if (raw->f == NULL && base_raw->f == NULL) {
727 err = got_deltify_mem_mem(&deltas, &ndeltas,
728 raw->data, raw->hdrlen,
729 raw->size + raw->hdrlen,
730 base->dtab, base_raw->data,
732 base_raw->size + base_raw->hdrlen);
733 } else if (raw->f == NULL) {
734 err = got_deltify_mem_file(&deltas, &ndeltas,
735 raw->data, raw->hdrlen,
736 raw->size + raw->hdrlen,
737 base->dtab, base_raw->f,
739 base_raw->size + base_raw->hdrlen);
740 } else if (base_raw->f == NULL) {
741 err = got_deltify_file_mem(&deltas, &ndeltas,
743 raw->size + raw->hdrlen,
744 base->dtab, base_raw->data,
746 base_raw->size + base_raw->hdrlen);
748 err = got_deltify(&deltas, &ndeltas,
750 raw->size + raw->hdrlen,
751 base->dtab, base_raw->f, base_raw->hdrlen,
752 base_raw->size + base_raw->hdrlen);
754 got_object_raw_close(base_raw);
759 size = delta_size(deltas, ndeltas);
760 if (size + 32 < best_size){
762 * if we already picked a best delta,
767 best_deltas = deltas;
768 best_ndeltas = ndeltas;
770 m->nchain = base->nchain + 1;
772 m->head = base->head;
782 if (best_ndeltas > 0) {
783 if (best_size <= GOT_DELTA_RESULT_SIZE_CACHED_MAX &&
784 delta_memsize + best_size <= max_delta_memsize) {
785 delta_memsize += best_size;
786 err = encode_delta_in_mem(m, raw, best_deltas,
787 best_ndeltas, best_size, m->prev->size);
789 m->delta_offset = ftello(delta_cache);
792 * Storing compressed delta data in the delta
793 * cache file would probably be more efficient
794 * than writing uncompressed delta data here
795 * and compressing it while writing the pack
796 * file. This would also allow for reusing
797 * deltas in their compressed form.
799 err = encode_delta(m, raw, best_deltas,
800 best_ndeltas, m->prev->size, delta_cache);
809 got_object_raw_close(raw);
813 for (i = MAX(0, nmeta - max_base_candidates); i < nmeta; i++) {
814 got_deltify_free(meta[i]->dtab);
815 meta[i]->dtab = NULL;
818 got_object_raw_close(raw);
820 got_object_raw_close(base_raw);
821 if (outfd != -1 && close(outfd) == -1 && err == NULL)
822 err = got_error_from_errno("close");
828 static const struct got_error *
829 search_packidx(int *found, struct got_object_id *id,
830 struct got_repository *repo)
832 const struct got_error *err = NULL;
833 struct got_packidx *packidx = NULL;
838 err = got_repo_search_packidx(&packidx, &idx, repo, id);
840 *found = 1; /* object is already packed */
841 else if (err->code == GOT_ERR_NO_OBJ)
846 static const struct got_error *
847 add_object(int want_meta, struct got_object_idset *idset,
848 struct got_object_id *id, const char *path, int obj_type,
849 time_t mtime, int loose_obj_only, struct got_repository *repo,
850 int *ncolored, int *nfound, int *ntrees,
851 got_pack_progress_cb progress_cb, void *progress_arg,
852 struct got_ratelimit *rl)
854 const struct got_error *err;
855 struct got_pack_meta *m = NULL;
857 if (loose_obj_only) {
859 err = search_packidx(&is_packed, id, repo);
862 if (is_packed && want_meta)
867 err = alloc_meta(&m, id, path, obj_type, mtime);
872 err = report_progress(progress_cb, progress_arg, rl,
873 *ncolored, *nfound, *ntrees, 0L, 0, 0, 0, 0);
881 err = got_object_idset_add(idset, id, m);
889 static const struct got_error *
890 load_tree_entries(struct got_object_id_queue *ids, int want_meta,
891 struct got_object_idset *idset, struct got_object_id *tree_id,
892 const char *dpath, time_t mtime, struct got_repository *repo,
893 int loose_obj_only, int *ncolored, int *nfound, int *ntrees,
894 got_pack_progress_cb progress_cb, void *progress_arg,
895 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
897 const struct got_error *err;
898 struct got_tree_object *tree;
902 err = got_object_open_as_tree(&tree, repo, tree_id);
907 err = report_progress(progress_cb, progress_arg, rl,
908 *ncolored, *nfound, *ntrees, 0L, 0, 0, 0, 0);
912 for (i = 0; i < got_object_tree_get_nentries(tree); i++) {
913 struct got_tree_entry *e = got_object_tree_get_entry(tree, i);
914 struct got_object_id *id = got_tree_entry_get_id(e);
915 mode_t mode = got_tree_entry_get_mode(e);
918 err = (*cancel_cb)(cancel_arg);
923 if (got_object_tree_entry_is_submodule(e) ||
924 got_object_idset_contains(idset, id))
927 if (asprintf(&p, "%s%s%s", dpath, dpath[0] != '\0' ? "/" : "",
928 got_tree_entry_get_name(e)) == -1) {
929 err = got_error_from_errno("asprintf");
934 struct got_object_qid *qid;
935 err = got_object_qid_alloc(&qid, id);
938 STAILQ_INSERT_TAIL(ids, qid, entry);
939 } else if (S_ISREG(mode) || S_ISLNK(mode)) {
940 err = add_object(want_meta, idset, id, p,
941 GOT_OBJ_TYPE_BLOB, mtime, loose_obj_only, repo,
942 ncolored, nfound, ntrees,
943 progress_cb, progress_arg, rl);
951 got_object_tree_close(tree);
956 static const struct got_error *
957 load_tree(int want_meta, struct got_object_idset *idset,
958 struct got_object_id *tree_id, const char *dpath, time_t mtime,
959 struct got_repository *repo, int loose_obj_only,
960 int *ncolored, int *nfound, int *ntrees,
961 got_pack_progress_cb progress_cb, void *progress_arg,
962 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
964 const struct got_error *err = NULL;
965 struct got_object_id_queue tree_ids;
966 struct got_object_qid *qid;
968 if (got_object_idset_contains(idset, tree_id))
971 err = got_object_qid_alloc(&qid, tree_id);
975 STAILQ_INIT(&tree_ids);
976 STAILQ_INSERT_TAIL(&tree_ids, qid, entry);
978 while (!STAILQ_EMPTY(&tree_ids)) {
980 err = (*cancel_cb)(cancel_arg);
985 qid = STAILQ_FIRST(&tree_ids);
986 STAILQ_REMOVE_HEAD(&tree_ids, entry);
988 if (got_object_idset_contains(idset, qid->id)) {
989 got_object_qid_free(qid);
993 err = add_object(want_meta, idset, qid->id, dpath,
994 GOT_OBJ_TYPE_TREE, mtime, loose_obj_only, repo,
995 ncolored, nfound, ntrees, progress_cb, progress_arg, rl);
997 got_object_qid_free(qid);
1001 err = load_tree_entries(&tree_ids, want_meta, idset, qid->id,
1002 dpath, mtime, repo, loose_obj_only, ncolored, nfound,
1003 ntrees, progress_cb, progress_arg, rl,
1004 cancel_cb, cancel_arg);
1005 got_object_qid_free(qid);
1010 got_object_id_queue_free(&tree_ids);
1014 static const struct got_error *
1015 load_commit(int want_meta, struct got_object_idset *idset,
1016 struct got_object_id *id, struct got_repository *repo, int loose_obj_only,
1017 int *ncolored, int *nfound, int *ntrees,
1018 got_pack_progress_cb progress_cb, void *progress_arg,
1019 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
1021 const struct got_error *err;
1022 struct got_commit_object *commit;
1024 if (got_object_idset_contains(idset, id))
1027 if (loose_obj_only) {
1029 err = search_packidx(&is_packed, id, repo);
1032 if (is_packed && want_meta)
1036 err = got_object_open_as_commit(&commit, repo, id);
1040 err = add_object(want_meta, idset, id, "", GOT_OBJ_TYPE_COMMIT,
1041 got_object_commit_get_committer_time(commit),
1042 loose_obj_only, repo,
1043 ncolored, nfound, ntrees, progress_cb, progress_arg, rl);
1047 err = load_tree(want_meta, idset, got_object_commit_get_tree_id(commit),
1048 "", got_object_commit_get_committer_time(commit),
1049 repo, loose_obj_only, ncolored, nfound, ntrees,
1050 progress_cb, progress_arg, rl, cancel_cb, cancel_arg);
1052 got_object_commit_close(commit);
1056 static const struct got_error *
1057 load_tag(int want_meta, struct got_object_idset *idset,
1058 struct got_object_id *id, struct got_repository *repo, int loose_obj_only,
1059 int *ncolored, int *nfound, int *ntrees,
1060 got_pack_progress_cb progress_cb, void *progress_arg,
1061 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
1063 const struct got_error *err;
1064 struct got_tag_object *tag = NULL;
1066 if (got_object_idset_contains(idset, id))
1069 if (loose_obj_only) {
1071 err = search_packidx(&is_packed, id, repo);
1074 if (is_packed && want_meta)
1078 err = got_object_open_as_tag(&tag, repo, id);
1082 err = add_object(want_meta, idset, id, "", GOT_OBJ_TYPE_TAG,
1083 got_object_tag_get_tagger_time(tag), loose_obj_only, repo,
1084 ncolored, nfound, ntrees, progress_cb, progress_arg, rl);
1088 switch (got_object_tag_get_object_type(tag)) {
1089 case GOT_OBJ_TYPE_COMMIT:
1090 err = load_commit(want_meta, idset,
1091 got_object_tag_get_object_id(tag), repo, loose_obj_only,
1092 ncolored, nfound, ntrees, progress_cb, progress_arg, rl,
1093 cancel_cb, cancel_arg);
1095 case GOT_OBJ_TYPE_TREE:
1096 err = load_tree(want_meta, idset,
1097 got_object_tag_get_object_id(tag), "",
1098 got_object_tag_get_tagger_time(tag), repo, loose_obj_only,
1099 ncolored, nfound, ntrees, progress_cb, progress_arg, rl,
1100 cancel_cb, cancel_arg);
1107 got_object_tag_close(tag);
1111 enum findtwixt_color {
1118 static const int findtwixt_colors[] = {
1125 static const struct got_error *
1126 paint_commit(struct got_object_qid *qid, int color)
1128 if (color < 0 || color >= nitems(findtwixt_colors))
1129 return got_error(GOT_ERR_RANGE);
1131 qid->data = (void *)&findtwixt_colors[color];
1135 static const struct got_error *
1136 queue_commit_id(struct got_object_id_queue *ids, struct got_object_id *id,
1137 int color, struct got_repository *repo)
1139 const struct got_error *err;
1140 struct got_object_qid *qid;
1142 err = got_object_qid_alloc(&qid, id);
1146 STAILQ_INSERT_TAIL(ids, qid, entry);
1147 return paint_commit(qid, color);
1150 struct append_id_arg {
1151 struct got_object_id **array;
1153 struct got_object_idset *drop;
1154 struct got_object_idset *skip;
1157 static const struct got_error *
1158 append_id(struct got_object_id *id, void *data, void *arg)
1160 struct append_id_arg *a = arg;
1162 if (got_object_idset_contains(a->skip, id) ||
1163 got_object_idset_contains(a->drop, id))
1166 a->array[++a->idx] = got_object_id_dup(id);
1167 if (a->array[a->idx] == NULL)
1168 return got_error_from_errno("got_object_id_dup");
1173 static const struct got_error *
1174 queue_commit_or_tag_id(struct got_object_id *id, int color,
1175 struct got_object_id_queue *ids, struct got_repository *repo)
1177 const struct got_error *err;
1178 struct got_tag_object *tag = NULL;
1181 err = got_object_get_type(&obj_type, repo, id);
1185 if (obj_type == GOT_OBJ_TYPE_TAG) {
1186 err = got_object_open_as_tag(&tag, repo, id);
1189 obj_type = got_object_tag_get_object_type(tag);
1190 id = got_object_tag_get_object_id(tag);
1193 if (obj_type == GOT_OBJ_TYPE_COMMIT) {
1194 err = queue_commit_id(ids, id, color, repo);
1200 got_object_tag_close(tag);
1204 static const struct got_error *
1205 paint_commits(int *ncolored, struct got_object_id_queue *ids, int nids,
1206 struct got_object_idset *keep, struct got_object_idset *drop,
1207 struct got_object_idset *skip, struct got_repository *repo,
1208 got_pack_progress_cb progress_cb, void *progress_arg,
1209 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
1211 const struct got_error *err = NULL;
1212 struct got_commit_object *commit = NULL;
1213 const struct got_object_id_queue *parents;
1214 struct got_object_qid *qid;
1215 int nqueued = nids, nskip = 0;
1217 while (!STAILQ_EMPTY(ids) && nskip != nqueued) {
1221 err = cancel_cb(cancel_arg);
1226 qid = STAILQ_FIRST(ids);
1227 STAILQ_REMOVE_HEAD(ids, entry);
1229 color = *((int *)qid->data);
1230 if (color == COLOR_SKIP)
1233 if (got_object_idset_contains(skip, qid->id)) {
1234 got_object_qid_free(qid);
1240 if (got_object_idset_contains(keep, qid->id)) {
1241 got_object_qid_free(qid);
1244 if (got_object_idset_contains(drop, qid->id)) {
1245 err = paint_commit(qid, COLOR_SKIP);
1251 err = got_object_idset_add(keep, qid->id, NULL);
1256 if (got_object_idset_contains(drop, qid->id)) {
1257 got_object_qid_free(qid);
1260 if (got_object_idset_contains(keep, qid->id)) {
1261 err = paint_commit(qid, COLOR_SKIP);
1267 err = got_object_idset_add(drop, qid->id, NULL);
1272 if (!got_object_idset_contains(skip, qid->id)) {
1273 err = got_object_idset_add(skip, qid->id, NULL);
1279 /* should not happen */
1280 err = got_error_fmt(GOT_ERR_NOT_IMPL,
1281 "%s invalid commit color %d", __func__, color);
1285 err = report_progress(progress_cb, progress_arg, rl,
1286 *ncolored, 0, 0, 0L, 0, 0, 0, 0);
1291 err = got_object_open_as_commit(&commit, repo, qid->id);
1295 parents = got_object_commit_get_parent_ids(commit);
1297 struct got_object_qid *pid;
1298 color = *((int *)qid->data);
1299 STAILQ_FOREACH(pid, parents, entry) {
1300 err = queue_commit_id(ids, pid->id, color,
1305 if (color == COLOR_SKIP)
1310 got_object_commit_close(commit);
1312 got_object_qid_free(qid);
1316 got_object_commit_close(commit);
1320 static const struct got_error *
1321 findtwixt(struct got_object_id ***res, int *nres, int *ncolored,
1322 struct got_object_id **head, int nhead,
1323 struct got_object_id **tail, int ntail,
1324 struct got_repository *repo,
1325 got_pack_progress_cb progress_cb, void *progress_arg,
1326 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
1328 const struct got_error *err = NULL;
1329 struct got_object_id_queue ids;
1330 struct got_object_idset *keep, *drop, *skip = NULL;
1338 keep = got_object_idset_alloc();
1340 return got_error_from_errno("got_object_idset_alloc");
1342 drop = got_object_idset_alloc();
1344 err = got_error_from_errno("got_object_idset_alloc");
1348 skip = got_object_idset_alloc();
1350 err = got_error_from_errno("got_object_idset_alloc");
1354 for (i = 0; i < nhead; i++) {
1355 struct got_object_id *id = head[i];
1358 err = queue_commit_or_tag_id(id, COLOR_KEEP, &ids, repo);
1363 for (i = 0; i < ntail; i++) {
1364 struct got_object_id *id = tail[i];
1367 err = queue_commit_or_tag_id(id, COLOR_DROP, &ids, repo);
1372 err = paint_commits(ncolored, &ids, nhead + ntail,
1373 keep, drop, skip, repo, progress_cb, progress_arg, rl,
1374 cancel_cb, cancel_arg);
1378 nkeep = got_object_idset_num_elements(keep);
1380 struct append_id_arg arg;
1381 arg.array = calloc(nkeep, sizeof(struct got_object_id *));
1382 if (arg.array == NULL) {
1383 err = got_error_from_errno("calloc");
1389 err = got_object_idset_for_each(keep, append_id, &arg);
1395 *nres = arg.idx + 1;
1398 got_object_idset_free(keep);
1399 got_object_idset_free(drop);
1401 got_object_idset_free(skip);
1402 got_object_id_queue_free(&ids);
1406 static const struct got_error *
1407 load_object_ids(int *ncolored, int *nfound, int *ntrees,
1408 struct got_object_idset *idset, struct got_object_id **theirs, int ntheirs,
1409 struct got_object_id **ours, int nours, struct got_repository *repo,
1410 int loose_obj_only, got_pack_progress_cb progress_cb, void *progress_arg,
1411 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
1413 const struct got_error *err = NULL;
1414 struct got_object_id **ids = NULL;
1415 int i, nobj = 0, obj_type;
1421 err = findtwixt(&ids, &nobj, ncolored, ours, nours, theirs, ntheirs,
1422 repo, progress_cb, progress_arg, rl, cancel_cb, cancel_arg);
1423 if (err || nobj == 0)
1426 for (i = 0; i < ntheirs; i++) {
1427 struct got_object_id *id = theirs[i];
1430 err = got_object_get_type(&obj_type, repo, id);
1433 if (obj_type == GOT_OBJ_TYPE_COMMIT) {
1434 err = load_commit(0, idset, id, repo,
1435 loose_obj_only, ncolored, nfound, ntrees,
1436 progress_cb, progress_arg, rl,
1437 cancel_cb, cancel_arg);
1440 } else if (obj_type == GOT_OBJ_TYPE_TAG) {
1441 err = load_tag(0, idset, id, repo,
1442 loose_obj_only, ncolored, nfound, ntrees,
1443 progress_cb, progress_arg, rl,
1444 cancel_cb, cancel_arg);
1450 for (i = 0; i < nobj; i++) {
1451 err = load_commit(1, idset, ids[i], repo, loose_obj_only,
1452 ncolored, nfound, ntrees, progress_cb, progress_arg, rl,
1453 cancel_cb, cancel_arg);
1458 for (i = 0; i < nours; i++) {
1459 struct got_object_id *id = ours[i];
1460 struct got_pack_meta *m;
1463 m = got_object_idset_get(idset, id);
1465 err = got_object_get_type(&obj_type, repo, id);
1469 obj_type = m->obj_type;
1470 if (obj_type != GOT_OBJ_TYPE_TAG)
1472 err = load_tag(1, idset, id, repo, loose_obj_only,
1473 ncolored, nfound, ntrees, progress_cb, progress_arg, rl,
1474 cancel_cb, cancel_arg);
1479 for (i = 0; i < nobj; i++) {
1486 const struct got_error *
1487 hwrite(FILE *f, void *buf, int len, SHA1_CTX *ctx)
1491 SHA1Update(ctx, buf, len);
1492 n = fwrite(buf, 1, len, f);
1494 return got_ferror(f, GOT_ERR_IO);
1499 putbe32(char *b, uint32_t n)
1508 write_order_cmp(const void *pa, const void *pb)
1510 struct got_pack_meta *a, *b, *ahd, *bhd;
1512 a = *(struct got_pack_meta **)pa;
1513 b = *(struct got_pack_meta **)pb;
1514 ahd = (a->head == NULL) ? a : a->head;
1515 bhd = (b->head == NULL) ? b : b->head;
1516 if (ahd->mtime != bhd->mtime)
1517 return bhd->mtime - ahd->mtime;
1519 return (uintptr_t)bhd - (uintptr_t)ahd;
1520 if (a->nchain != b->nchain)
1521 return a->nchain - b->nchain;
1522 return a->mtime - b->mtime;
1526 reuse_write_order_cmp(const void *pa, const void *pb)
1528 struct got_pack_meta *a, *b;
1530 a = *(struct got_pack_meta **)pa;
1531 b = *(struct got_pack_meta **)pb;
1533 if (a->reused_delta_offset < b->reused_delta_offset)
1535 if (a->reused_delta_offset > b->reused_delta_offset)
1540 static const struct got_error *
1541 packhdr(int *hdrlen, char *hdr, size_t bufsize, int obj_type, size_t len)
1547 hdr[0] = obj_type << 4;
1548 hdr[0] |= len & 0xf;
1550 for (i = 1; len != 0; i++){
1552 return got_error(GOT_ERR_NO_SPACE);
1553 hdr[i - 1] |= GOT_DELTA_SIZE_MORE;
1554 hdr[i] = len & GOT_DELTA_SIZE_VAL_MASK;
1555 len >>= GOT_DELTA_SIZE_SHIFT;
1563 packoff(char *hdr, off_t off)
1568 rbuf[0] = off & GOT_DELTA_SIZE_VAL_MASK;
1569 for (i = 1; (off >>= GOT_DELTA_SIZE_SHIFT) != 0; i++) {
1570 rbuf[i] = (--off & GOT_DELTA_SIZE_VAL_MASK) |
1571 GOT_DELTA_SIZE_MORE;
1576 hdr[j++] = rbuf[--i];
1580 static const struct got_error *
1581 deltahdr(off_t *packfile_size, SHA1_CTX *ctx, FILE *packfile,
1582 struct got_pack_meta *m)
1584 const struct got_error *err;
1588 if (m->prev->off != 0) {
1589 err = packhdr(&nh, buf, sizeof(buf),
1590 GOT_OBJ_TYPE_OFFSET_DELTA, m->delta_len);
1593 nh += packoff(buf + nh, m->off - m->prev->off);
1594 err = hwrite(packfile, buf, nh, ctx);
1597 *packfile_size += nh;
1599 err = packhdr(&nh, buf, sizeof(buf),
1600 GOT_OBJ_TYPE_REF_DELTA, m->delta_len);
1603 err = hwrite(packfile, buf, nh, ctx);
1606 *packfile_size += nh;
1607 err = hwrite(packfile, m->prev->id.sha1,
1608 sizeof(m->prev->id.sha1), ctx);
1611 *packfile_size += sizeof(m->prev->id.sha1);
1617 static const struct got_error *
1618 write_packed_object(off_t *packfile_size, FILE *packfile,
1619 FILE *delta_cache, struct got_pack_meta *m, int *outfd,
1620 SHA1_CTX *ctx, struct got_repository *repo)
1622 const struct got_error *err = NULL;
1623 struct got_deflate_checksum csum;
1626 struct got_raw_object *raw = NULL;
1629 csum.output_sha1 = ctx;
1630 csum.output_crc = NULL;
1632 m->off = ftello(packfile);
1633 if (m->delta_len == 0) {
1634 err = got_object_raw_open(&raw, outfd, repo, &m->id);
1637 err = packhdr(&nh, buf, sizeof(buf),
1638 m->obj_type, raw->size);
1641 err = hwrite(packfile, buf, nh, ctx);
1644 *packfile_size += nh;
1645 if (raw->f == NULL) {
1646 err = got_deflate_to_file_mmap(&outlen,
1647 raw->data + raw->hdrlen, 0, raw->size,
1652 if (fseeko(raw->f, raw->hdrlen, SEEK_SET)
1654 err = got_error_from_errno("fseeko");
1657 err = got_deflate_to_file(&outlen, raw->f,
1658 raw->size, packfile, &csum);
1662 *packfile_size += outlen;
1663 got_object_raw_close(raw);
1665 } else if (m->delta_buf) {
1666 err = deltahdr(packfile_size, ctx, packfile, m);
1669 err = got_deflate_to_file_mmap(&outlen,
1670 m->delta_buf, 0, m->delta_len, packfile, &csum);
1673 *packfile_size += outlen;
1675 m->delta_buf = NULL;
1677 if (fseeko(delta_cache, m->delta_offset, SEEK_SET)
1679 err = got_error_from_errno("fseeko");
1682 err = deltahdr(packfile_size, ctx, packfile, m);
1685 err = got_deflate_to_file(&outlen, delta_cache,
1686 m->delta_len, packfile, &csum);
1689 *packfile_size += outlen;
1693 got_object_raw_close(raw);
1697 static const struct got_error *
1698 genpack(uint8_t *pack_sha1, FILE *packfile, FILE *delta_cache,
1699 struct got_pack_meta **deltify, int ndeltify,
1700 struct got_pack_meta **reuse, int nreuse,
1701 int ncolored, int nfound, int ntrees, int nours,
1702 struct got_repository *repo,
1703 got_pack_progress_cb progress_cb, void *progress_arg,
1704 struct got_ratelimit *rl,
1705 got_cancel_cb cancel_cb, void *cancel_arg)
1707 const struct got_error *err = NULL;
1710 struct got_pack_meta *m;
1713 off_t packfile_size = 0;
1718 err = hwrite(packfile, "PACK", 4, &ctx);
1721 putbe32(buf, GOT_PACKFILE_VERSION);
1722 err = hwrite(packfile, buf, 4, &ctx);
1725 putbe32(buf, ndeltify + nreuse);
1726 err = hwrite(packfile, buf, 4, &ctx);
1730 qsort(deltify, ndeltify, sizeof(struct got_pack_meta *),
1732 for (i = 0; i < ndeltify; i++) {
1733 err = report_progress(progress_cb, progress_arg, rl,
1734 ncolored, nfound, ntrees, packfile_size, nours,
1735 ndeltify + nreuse, ndeltify + nreuse, i);
1739 err = write_packed_object(&packfile_size, packfile,
1740 delta_cache, m, &outfd, &ctx, repo);
1745 qsort(reuse, nreuse, sizeof(struct got_pack_meta *),
1746 reuse_write_order_cmp);
1747 for (i = 0; i < nreuse; i++) {
1748 err = report_progress(progress_cb, progress_arg, rl,
1749 ncolored, nfound, ntrees, packfile_size, nours,
1750 ndeltify + nreuse, ndeltify + nreuse, ndeltify + i);
1754 err = write_packed_object(&packfile_size, packfile,
1755 delta_cache, m, &outfd, &ctx, repo);
1760 SHA1Final(pack_sha1, &ctx);
1761 n = fwrite(pack_sha1, 1, SHA1_DIGEST_LENGTH, packfile);
1762 if (n != SHA1_DIGEST_LENGTH)
1763 err = got_ferror(packfile, GOT_ERR_IO);
1764 packfile_size += SHA1_DIGEST_LENGTH;
1765 packfile_size += sizeof(struct got_packfile_hdr);
1767 err = progress_cb(progress_arg, ncolored, nfound, ntrees,
1768 packfile_size, nours, ndeltify + nreuse,
1769 ndeltify + nreuse, ndeltify + nreuse);
1774 if (outfd != -1 && close(outfd) == -1 && err == NULL)
1775 err = got_error_from_errno("close");
1779 static const struct got_error *
1780 remove_unused_object(struct got_object_id *id, void *data, void *arg)
1782 struct got_object_idset *idset = arg;
1785 got_object_idset_remove(NULL, idset, id);
1790 static const struct got_error *
1791 remove_reused_object(struct got_object_id *id, void *data, void *arg)
1793 struct got_object_idset *idset = arg;
1794 struct got_pack_meta *m = data;
1796 if (m->have_reused_delta)
1797 got_object_idset_remove(NULL, idset, id);
1802 static const struct got_error *
1803 add_meta_idset_cb(struct got_object_id *id, void *data, void *arg)
1805 struct got_pack_meta *m = data;
1806 struct got_pack_metavec *v = arg;
1808 return add_meta(m, v);
1811 const struct got_error *
1812 got_pack_create(uint8_t *packsha1, FILE *packfile,
1813 struct got_object_id **theirs, int ntheirs,
1814 struct got_object_id **ours, int nours,
1815 struct got_repository *repo, int loose_obj_only, int allow_empty,
1816 got_pack_progress_cb progress_cb, void *progress_arg,
1817 got_cancel_cb cancel_cb, void *cancel_arg)
1819 const struct got_error *err;
1820 int delta_cache_fd = -1;
1821 FILE *delta_cache = NULL;
1822 struct got_object_idset *idset;
1823 struct got_ratelimit rl;
1824 struct got_pack_metavec deltify, reuse;
1825 int ncolored = 0, nfound = 0, ntrees = 0;
1827 memset(&deltify, 0, sizeof(deltify));
1828 memset(&reuse, 0, sizeof(reuse));
1830 got_ratelimit_init(&rl, 0, 500);
1832 idset = got_object_idset_alloc();
1834 return got_error_from_errno("got_object_idset_alloc");
1836 err = load_object_ids(&ncolored, &nfound, &ntrees, idset, theirs,
1837 ntheirs, ours, nours, repo, loose_obj_only,
1838 progress_cb, progress_arg, &rl, cancel_cb, cancel_arg);
1842 err = got_object_idset_for_each(idset, remove_unused_object, idset);
1847 err = progress_cb(progress_arg, ncolored, nfound, ntrees,
1848 0L, nours, got_object_idset_num_elements(idset), 0, 0);
1853 if (got_object_idset_num_elements(idset) == 0 && !allow_empty) {
1854 err = got_error(GOT_ERR_CANNOT_PACK);
1858 delta_cache_fd = got_opentempfd();
1859 if (delta_cache_fd == -1) {
1860 err = got_error_from_errno("got_opentemp");
1865 reuse.meta = calloc(reuse.metasz,
1866 sizeof(struct got_pack_meta *));
1867 if (reuse.meta == NULL) {
1868 err = got_error_from_errno("calloc");
1872 err = search_deltas(&reuse, idset, delta_cache_fd, ncolored, nfound,
1873 ntrees, nours, repo, progress_cb, progress_arg, &rl,
1874 cancel_cb, cancel_arg);
1877 if (reuse.nmeta > 0) {
1878 err = got_object_idset_for_each(idset,
1879 remove_reused_object, idset);
1884 delta_cache = fdopen(delta_cache_fd, "a+");
1885 if (delta_cache == NULL) {
1886 err = got_error_from_errno("fdopen");
1889 delta_cache_fd = -1;
1891 if (fseeko(delta_cache, 0L, SEEK_END) == -1) {
1892 err = got_error_from_errno("fseeko");
1896 deltify.meta = calloc(got_object_idset_num_elements(idset),
1897 sizeof(struct got_pack_meta *));
1898 if (deltify.meta == NULL) {
1899 err = got_error_from_errno("calloc");
1902 deltify.metasz = got_object_idset_num_elements(idset);
1904 err = got_object_idset_for_each(idset, add_meta_idset_cb, &deltify);
1907 if (deltify.nmeta > 0) {
1908 err = pick_deltas(deltify.meta, deltify.nmeta, ncolored,
1909 nfound, ntrees, nours, reuse.nmeta, delta_cache, repo,
1910 progress_cb, progress_arg, &rl, cancel_cb, cancel_arg);
1913 if (fseeko(delta_cache, 0L, SEEK_SET) == -1) {
1914 err = got_error_from_errno("fseeko");
1919 err = genpack(packsha1, packfile, delta_cache, deltify.meta,
1920 deltify.nmeta, reuse.meta, reuse.nmeta, ncolored, nfound, ntrees,
1921 nours, repo, progress_cb, progress_arg, &rl,
1922 cancel_cb, cancel_arg);
1926 free_nmeta(deltify.meta, deltify.nmeta);
1927 free_nmeta(reuse.meta, reuse.nmeta);
1928 got_object_idset_free(idset);
1929 if (delta_cache_fd != -1 && close(delta_cache_fd) == -1 && err == NULL)
1930 err = got_error_from_errno("close");
1931 if (delta_cache && fclose(delta_cache) == EOF && err == NULL)
1932 err = got_error_from_errno("fclose");