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>
32 #if defined(__FreeBSD__)
36 #include "got_error.h"
37 #include "got_cancel.h"
38 #include "got_object.h"
40 #include "got_reference.h"
41 #include "got_repository_admin.h"
42 #include "got_opentemp.h"
44 #include "got_lib_deltify.h"
45 #include "got_lib_delta.h"
46 #include "got_lib_object.h"
47 #include "got_lib_object_idset.h"
48 #include "got_lib_object_cache.h"
49 #include "got_lib_deflate.h"
50 #include "got_lib_pack.h"
51 #include "got_lib_privsep.h"
52 #include "got_lib_repository.h"
53 #include "got_lib_ratelimit.h"
56 #define MIN(_a,_b) ((_a) < (_b) ? (_a) : (_b))
60 #define MAX(_a,_b) ((_a) > (_b) ? (_a) : (_b))
64 #define nitems(_a) (sizeof((_a)) / sizeof((_a)[0]))
67 struct got_pack_meta {
68 struct got_object_id id;
74 /* The best delta we picked */
75 struct got_pack_meta *head;
76 struct got_pack_meta *prev;
77 unsigned char *delta_buf; /* if not encoded in delta cache file */
78 off_t delta_offset; /* offset in delta cache file */
79 off_t delta_len; /* encoded delta length */
82 int have_reused_delta;
83 off_t reused_delta_offset; /* offset of delta in reused pack file */
84 struct got_object_id *base_obj_id;
86 /* Only used for delta window */
87 struct got_delta_table *dtab;
89 /* Only used for writing offset deltas */
93 struct got_pack_metavec {
94 struct got_pack_meta **meta;
99 static const struct got_error *
100 alloc_meta(struct got_pack_meta **new, struct got_object_id *id,
101 const char *path, int obj_type, time_t mtime)
103 const struct got_error *err = NULL;
104 struct got_pack_meta *m;
108 m = calloc(1, sizeof(*m));
110 return got_error_from_errno("calloc");
112 memcpy(&m->id, id, sizeof(m->id));
114 m->path = strdup(path);
115 if (m->path == NULL) {
116 err = got_error_from_errno("strdup");
121 m->obj_type = obj_type;
128 clear_meta(struct got_pack_meta *meta)
134 free(meta->delta_buf);
135 meta->delta_buf = NULL;
136 free(meta->base_obj_id);
137 meta->base_obj_id = NULL;
141 free_nmeta(struct got_pack_meta **meta, int nmeta)
145 for (i = 0; i < nmeta; i++)
151 delta_order_cmp(const void *pa, const void *pb)
153 struct got_pack_meta *a, *b;
156 a = *(struct got_pack_meta **)pa;
157 b = *(struct got_pack_meta **)pb;
159 if (a->obj_type != b->obj_type)
160 return a->obj_type - b->obj_type;
161 cmp = strcmp(a->path, b->path);
164 if (a->mtime != b->mtime)
165 return a->mtime - b->mtime;
166 return got_object_id_cmp(&a->id, &b->id);
170 delta_size(struct got_delta_instruction *deltas, int ndeltas)
174 for (i = 0; i < ndeltas; i++) {
176 size += GOT_DELTA_SIZE_SHIFT;
178 size += deltas[i].len + 1;
183 static const struct got_error *
184 append(unsigned char **p, size_t *len, off_t *sz, void *seg, int nseg)
188 if (*len + nseg >= *sz) {
189 while (*len + nseg >= *sz)
191 n = realloc(*p, *sz);
193 return got_error_from_errno("realloc");
196 memcpy(*p + *len, seg, nseg);
201 static const struct got_error *
202 encode_delta_in_mem(struct got_pack_meta *m, struct got_raw_object *o,
203 struct got_delta_instruction *deltas, int ndeltas,
204 off_t delta_size, off_t base_size)
206 const struct got_error *err;
207 unsigned char buf[16], *bp;
211 struct got_delta_instruction *d;
213 m->delta_buf = malloc(delta_size);
214 if (m->delta_buf == NULL)
215 return got_error_from_errno("calloc");
217 /* base object size */
218 buf[0] = base_size & GOT_DELTA_SIZE_VAL_MASK;
219 n = base_size >> GOT_DELTA_SIZE_SHIFT;
220 for (i = 1; n > 0; i++) {
221 buf[i - 1] |= GOT_DELTA_SIZE_MORE;
222 buf[i] = n & GOT_DELTA_SIZE_VAL_MASK;
223 n >>= GOT_DELTA_SIZE_SHIFT;
225 err = append(&m->delta_buf, &len, &delta_size, buf, i);
229 /* target object size */
230 buf[0] = o->size & GOT_DELTA_SIZE_VAL_MASK;
231 n = o->size >> GOT_DELTA_SIZE_SHIFT;
232 for (i = 1; n > 0; i++) {
233 buf[i - 1] |= GOT_DELTA_SIZE_MORE;
234 buf[i] = n & GOT_DELTA_SIZE_VAL_MASK;
235 n >>= GOT_DELTA_SIZE_SHIFT;
237 err = append(&m->delta_buf, &len, &delta_size, buf, i);
241 for (j = 0; j < ndeltas; j++) {
246 buf[0] = GOT_DELTA_BASE_COPY;
247 for (i = 0; i < 4; i++) {
248 /* DELTA_COPY_OFF1 ... DELTA_COPY_OFF4 */
257 if (n != GOT_DELTA_COPY_DEFAULT_LEN) {
258 /* DELTA_COPY_LEN1 ... DELTA_COPY_LEN3 */
259 for (i = 0; i < 3 && n > 0; i++) {
260 buf[0] |= 1 << (i + 4);
265 err = append(&m->delta_buf, &len, &delta_size,
269 } else if (o->f == NULL) {
271 while (n != d->len) {
272 buf[0] = (d->len - n < 127) ? d->len - n : 127;
273 err = append(&m->delta_buf, &len, &delta_size,
277 err = append(&m->delta_buf, &len, &delta_size,
278 o->data + o->hdrlen + d->offset + n,
287 if (fseeko(o->f, o->hdrlen + d->offset, SEEK_SET) == -1)
288 return got_error_from_errno("fseeko");
290 while (n != d->len) {
291 buf[0] = (d->len - n < 127) ? d->len - n : 127;
292 err = append(&m->delta_buf, &len, &delta_size,
296 r = fread(content, 1, buf[0], o->f);
298 return got_ferror(o->f, GOT_ERR_IO);
299 err = append(&m->delta_buf, &len, &delta_size,
312 static const struct got_error *
313 encode_delta(struct got_pack_meta *m, struct got_raw_object *o,
314 struct got_delta_instruction *deltas, int ndeltas,
315 off_t base_size, FILE *f)
317 unsigned char buf[16], *bp;
321 struct got_delta_instruction *d;
323 /* base object size */
324 buf[0] = base_size & GOT_DELTA_SIZE_VAL_MASK;
325 n = base_size >> GOT_DELTA_SIZE_SHIFT;
326 for (i = 1; n > 0; i++) {
327 buf[i - 1] |= GOT_DELTA_SIZE_MORE;
328 buf[i] = n & GOT_DELTA_SIZE_VAL_MASK;
329 n >>= GOT_DELTA_SIZE_SHIFT;
331 w = fwrite(buf, 1, i, f);
333 return got_ferror(f, GOT_ERR_IO);
335 /* target object size */
336 buf[0] = o->size & GOT_DELTA_SIZE_VAL_MASK;
337 n = o->size >> GOT_DELTA_SIZE_SHIFT;
338 for (i = 1; n > 0; i++) {
339 buf[i - 1] |= GOT_DELTA_SIZE_MORE;
340 buf[i] = n & GOT_DELTA_SIZE_VAL_MASK;
341 n >>= GOT_DELTA_SIZE_SHIFT;
343 w = fwrite(buf, 1, i, f);
345 return got_ferror(f, GOT_ERR_IO);
347 for (j = 0; j < ndeltas; j++) {
352 buf[0] = GOT_DELTA_BASE_COPY;
353 for (i = 0; i < 4; i++) {
354 /* DELTA_COPY_OFF1 ... DELTA_COPY_OFF4 */
363 if (n != GOT_DELTA_COPY_DEFAULT_LEN) {
364 /* DELTA_COPY_LEN1 ... DELTA_COPY_LEN3 */
365 for (i = 0; i < 3 && n > 0; i++) {
366 buf[0] |= 1 << (i + 4);
371 w = fwrite(buf, 1, bp - buf, f);
373 return got_ferror(f, GOT_ERR_IO);
374 } else if (o->f == NULL) {
376 while (n != d->len) {
377 buf[0] = (d->len - n < 127) ? d->len - n : 127;
378 w = fwrite(buf, 1, 1, f);
380 return got_ferror(f, GOT_ERR_IO);
381 w = fwrite(o->data + o->hdrlen + d->offset + n,
384 return got_ferror(f, GOT_ERR_IO);
390 if (fseeko(o->f, o->hdrlen + d->offset, SEEK_SET) == -1)
391 return got_error_from_errno("fseeko");
393 while (n != d->len) {
394 buf[0] = (d->len - n < 127) ? d->len - n : 127;
395 w = fwrite(buf, 1, 1, f);
397 return got_ferror(f, GOT_ERR_IO);
398 r = fread(content, 1, buf[0], o->f);
400 return got_ferror(o->f, GOT_ERR_IO);
401 w = fwrite(content, 1, buf[0], f);
403 return got_ferror(f, GOT_ERR_IO);
409 m->delta_len = ftello(f) - m->delta_offset;
413 static const struct got_error *
414 report_progress(got_pack_progress_cb progress_cb, void *progress_arg,
415 struct got_ratelimit *rl, int ncolored, int nfound, int ntrees,
416 off_t packfile_size, int ncommits, int nobj_total, int obj_deltify,
419 const struct got_error *err;
422 if (progress_cb == NULL)
425 err = got_ratelimit_check(&elapsed, rl);
429 return progress_cb(progress_arg, ncolored, nfound, ntrees,
430 packfile_size, ncommits, nobj_total, obj_deltify, nobj_written);
433 static const struct got_error *
434 add_meta(struct got_pack_meta *m, struct got_pack_metavec *v)
436 if (v->nmeta == v->metasz){
437 size_t newsize = 2 * v->metasz;
438 struct got_pack_meta **new;
439 new = reallocarray(v->meta, newsize, sizeof(*new));
441 return got_error_from_errno("reallocarray");
446 v->meta[v->nmeta++] = m;
450 static const struct got_error *
451 reuse_delta(int idx, struct got_pack_meta *m, struct got_pack_metavec *v,
452 struct got_object_idset *idset, struct got_pack *pack,
453 struct got_packidx *packidx, int delta_cache_fd,
454 struct got_repository *repo)
456 const struct got_error *err = NULL;
457 struct got_pack_meta *base = NULL;
458 struct got_object_id *base_obj_id = NULL;
459 off_t delta_len = 0, delta_offset = 0, delta_cache_offset = 0;
460 uint64_t base_size, result_size;
462 if (m->have_reused_delta)
465 err = got_object_read_raw_delta(&base_size, &result_size, &delta_len,
466 &delta_offset, &delta_cache_offset, &base_obj_id, delta_cache_fd,
467 packidx, idx, &m->id, repo);
471 if (delta_offset + delta_len < delta_offset)
472 return got_error(GOT_ERR_BAD_PACKFILE);
474 base = got_object_idset_get(idset, base_obj_id);
478 m->delta_len = delta_len;
479 m->delta_offset = delta_cache_offset;
481 m->size = result_size;
482 m->have_reused_delta = 1;
483 m->reused_delta_offset = delta_offset;
484 m->base_obj_id = base_obj_id;
486 err = add_meta(m, v);
492 static const struct got_error *
493 find_pack_for_reuse(struct got_packidx **best_packidx,
494 struct got_repository *repo)
496 const struct got_error *err = NULL;
497 struct got_pathlist_entry *pe;
498 const char *best_packidx_path = NULL;
501 *best_packidx = NULL;
503 TAILQ_FOREACH(pe, &repo->packidx_paths, entry) {
504 const char *path_packidx = pe->path;
505 struct got_packidx *packidx;
508 err = got_repo_get_packidx(&packidx, path_packidx, repo);
512 nobj = be32toh(packidx->hdr.fanout_table[0xff]);
513 if (nobj > nobj_max) {
514 best_packidx_path = path_packidx;
519 if (best_packidx_path) {
520 err = got_repo_get_packidx(best_packidx, best_packidx_path,
527 struct search_deltas_arg {
528 struct got_packidx *packidx;
529 struct got_pack *pack;
530 struct got_object_idset *idset;
531 struct got_pack_metavec *v;
533 struct got_repository *repo;
534 got_pack_progress_cb progress_cb;
536 struct got_ratelimit *rl;
537 got_cancel_cb cancel_cb;
545 static const struct got_error *
546 search_delta_for_object(struct got_object_id *id, void *data, void *arg)
548 const struct got_error *err;
549 struct got_pack_meta *m = data;
550 struct search_deltas_arg *a = arg;
552 struct got_object *obj = NULL;
555 err = (*a->cancel_cb)(a->cancel_arg);
560 if (!got_repo_check_packidx_bloom_filter(a->repo,
561 a->packidx->path_packidx, id))
564 obj_idx = got_packidx_get_object_idx(a->packidx, id);
569 * Opening and closing an object just to check its flags
570 * is a bit expensive. We could have an imsg which requests
571 * plain type/size information for an object without doing
572 * work such as traversing the object's entire delta chain
573 * to find the base object type, and other such info which
574 * we don't really need here.
576 err = got_object_open_from_packfile(&obj, &m->id, a->pack,
577 a->packidx, obj_idx, a->repo);
581 if (obj->flags & GOT_OBJ_FLAG_DELTIFIED) {
582 reuse_delta(obj_idx, m, a->v, a->idset, a->pack, a->packidx,
583 a->delta_cache_fd, a->repo);
586 err = report_progress(a->progress_cb, a->progress_arg, a->rl,
587 a->ncolored, a->nfound, a->ntrees, 0L, a->ncommits,
588 got_object_idset_num_elements(a->idset), a->v->nmeta, 0);
591 got_object_close(obj);
595 static const struct got_error *
596 search_deltas(struct got_pack_metavec *v, struct got_object_idset *idset,
597 int delta_cache_fd, int ncolored, int nfound, int ntrees, int ncommits,
598 struct got_repository *repo,
599 got_pack_progress_cb progress_cb, void *progress_arg,
600 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
602 const struct got_error *err = NULL;
603 char *path_packfile = NULL;
604 struct got_packidx *packidx;
605 struct got_pack *pack;
606 struct search_deltas_arg sda;
608 err = find_pack_for_reuse(&packidx, repo);
615 err = got_packidx_get_packfile_path(&path_packfile,
616 packidx->path_packidx);
620 pack = got_repo_get_cached_pack(repo, path_packfile);
622 err = got_repo_cache_pack(&pack, repo, path_packfile, packidx);
627 sda.packidx = packidx;
631 sda.delta_cache_fd = delta_cache_fd;
633 sda.progress_cb = progress_cb;
634 sda.progress_arg = progress_arg;
636 sda.cancel_cb = cancel_cb;
637 sda.cancel_arg = cancel_arg;
638 sda.ncolored = ncolored;
641 sda.ncommits = ncommits;
642 err = got_object_idset_for_each(idset, search_delta_for_object, &sda);
648 static const struct got_error *
649 pick_deltas(struct got_pack_meta **meta, int nmeta, int ncolored,
650 int nfound, int ntrees, int ncommits, int nreused, FILE *delta_cache,
651 struct got_repository *repo,
652 got_pack_progress_cb progress_cb, void *progress_arg,
653 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
655 const struct got_error *err = NULL;
656 struct got_pack_meta *m = NULL, *base = NULL;
657 struct got_raw_object *raw = NULL, *base_raw = NULL;
658 struct got_delta_instruction *deltas = NULL, *best_deltas = NULL;
659 int i, j, ndeltas, best_ndeltas;
660 off_t size, best_size;
661 const int max_base_candidates = 3;
662 size_t delta_memsize = 0;
663 const size_t max_delta_memsize = 25 * GOT_DELTA_RESULT_SIZE_CACHED_MAX;
666 qsort(meta, nmeta, sizeof(struct got_pack_meta *), delta_order_cmp);
667 for (i = 0; i < nmeta; i++) {
669 err = (*cancel_cb)(cancel_arg);
673 err = report_progress(progress_cb, progress_arg, rl,
674 ncolored, nfound, ntrees, 0L, ncommits, nreused + nmeta,
680 if (m->obj_type == GOT_OBJ_TYPE_COMMIT ||
681 m->obj_type == GOT_OBJ_TYPE_TAG)
684 err = got_object_raw_open(&raw, &outfd, repo, &m->id);
689 if (raw->f == NULL) {
690 err = got_deltify_init_mem(&m->dtab, raw->data,
691 raw->hdrlen, raw->size + raw->hdrlen);
693 err = got_deltify_init(&m->dtab, raw->f, raw->hdrlen,
694 raw->size + raw->hdrlen);
699 if (i > max_base_candidates) {
700 struct got_pack_meta *n = NULL;
701 n = meta[i - (max_base_candidates + 1)];
702 got_deltify_free(n->dtab);
706 best_size = raw->size;
708 for (j = MAX(0, i - max_base_candidates); j < i; j++) {
710 err = (*cancel_cb)(cancel_arg);
715 /* long chains make unpacking slow, avoid such bases */
716 if (base->nchain >= 128 ||
717 base->obj_type != m->obj_type)
720 err = got_object_raw_open(&base_raw, &outfd, repo,
725 if (raw->f == NULL && base_raw->f == NULL) {
726 err = got_deltify_mem_mem(&deltas, &ndeltas,
727 raw->data, raw->hdrlen,
728 raw->size + raw->hdrlen,
729 base->dtab, base_raw->data,
731 base_raw->size + base_raw->hdrlen);
732 } else if (raw->f == NULL) {
733 err = got_deltify_mem_file(&deltas, &ndeltas,
734 raw->data, raw->hdrlen,
735 raw->size + raw->hdrlen,
736 base->dtab, base_raw->f,
738 base_raw->size + base_raw->hdrlen);
739 } else if (base_raw->f == NULL) {
740 err = got_deltify_file_mem(&deltas, &ndeltas,
742 raw->size + raw->hdrlen,
743 base->dtab, base_raw->data,
745 base_raw->size + base_raw->hdrlen);
747 err = got_deltify(&deltas, &ndeltas,
749 raw->size + raw->hdrlen,
750 base->dtab, base_raw->f, base_raw->hdrlen,
751 base_raw->size + base_raw->hdrlen);
753 got_object_raw_close(base_raw);
758 size = delta_size(deltas, ndeltas);
759 if (size + 32 < best_size){
761 * if we already picked a best delta,
766 best_deltas = deltas;
767 best_ndeltas = ndeltas;
769 m->nchain = base->nchain + 1;
771 m->head = base->head;
781 if (best_ndeltas > 0) {
782 if (best_size <= GOT_DELTA_RESULT_SIZE_CACHED_MAX &&
783 delta_memsize + best_size <= max_delta_memsize) {
784 delta_memsize += best_size;
785 err = encode_delta_in_mem(m, raw, best_deltas,
786 best_ndeltas, best_size, m->prev->size);
788 m->delta_offset = ftello(delta_cache);
791 * Storing compressed delta data in the delta
792 * cache file would probably be more efficient
793 * than writing uncompressed delta data here
794 * and compressing it while writing the pack
795 * file. This would also allow for reusing
796 * deltas in their compressed form.
798 err = encode_delta(m, raw, best_deltas,
799 best_ndeltas, m->prev->size, delta_cache);
808 got_object_raw_close(raw);
812 for (i = MAX(0, nmeta - max_base_candidates); i < nmeta; i++) {
813 got_deltify_free(meta[i]->dtab);
814 meta[i]->dtab = NULL;
817 got_object_raw_close(raw);
819 got_object_raw_close(base_raw);
820 if (outfd != -1 && close(outfd) == -1 && err == NULL)
821 err = got_error_from_errno("close");
827 static const struct got_error *
828 search_packidx(int *found, struct got_object_id *id,
829 struct got_repository *repo)
831 const struct got_error *err = NULL;
832 struct got_packidx *packidx = NULL;
837 err = got_repo_search_packidx(&packidx, &idx, repo, id);
839 *found = 1; /* object is already packed */
840 else if (err->code == GOT_ERR_NO_OBJ)
845 static const struct got_error *
846 add_object(int want_meta, struct got_object_idset *idset,
847 struct got_object_id *id, const char *path, int obj_type,
848 time_t mtime, int loose_obj_only, struct got_repository *repo,
849 int *ncolored, int *nfound, int *ntrees,
850 got_pack_progress_cb progress_cb, void *progress_arg,
851 struct got_ratelimit *rl)
853 const struct got_error *err;
854 struct got_pack_meta *m = NULL;
856 if (loose_obj_only) {
858 err = search_packidx(&is_packed, id, repo);
861 if (is_packed && want_meta)
866 err = alloc_meta(&m, id, path, obj_type, mtime);
871 err = report_progress(progress_cb, progress_arg, rl,
872 *ncolored, *nfound, *ntrees, 0L, 0, 0, 0, 0);
880 err = got_object_idset_add(idset, id, m);
888 static const struct got_error *
889 load_tree_entries(struct got_object_id_queue *ids, int want_meta,
890 struct got_object_idset *idset, struct got_object_id *tree_id,
891 const char *dpath, time_t mtime, struct got_repository *repo,
892 int loose_obj_only, int *ncolored, int *nfound, int *ntrees,
893 got_pack_progress_cb progress_cb, void *progress_arg,
894 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
896 const struct got_error *err;
897 struct got_tree_object *tree;
901 err = got_object_open_as_tree(&tree, repo, tree_id);
906 err = report_progress(progress_cb, progress_arg, rl,
907 *ncolored, *nfound, *ntrees, 0L, 0, 0, 0, 0);
911 for (i = 0; i < got_object_tree_get_nentries(tree); i++) {
912 struct got_tree_entry *e = got_object_tree_get_entry(tree, i);
913 struct got_object_id *id = got_tree_entry_get_id(e);
914 mode_t mode = got_tree_entry_get_mode(e);
917 err = (*cancel_cb)(cancel_arg);
922 if (got_object_tree_entry_is_submodule(e) ||
923 got_object_idset_contains(idset, id))
926 if (asprintf(&p, "%s%s%s", dpath, dpath[0] != '\0' ? "/" : "",
927 got_tree_entry_get_name(e)) == -1) {
928 err = got_error_from_errno("asprintf");
933 struct got_object_qid *qid;
934 err = got_object_qid_alloc(&qid, id);
937 STAILQ_INSERT_TAIL(ids, qid, entry);
938 } else if (S_ISREG(mode) || S_ISLNK(mode)) {
939 err = add_object(want_meta, idset, id, p,
940 GOT_OBJ_TYPE_BLOB, mtime, loose_obj_only, repo,
941 ncolored, nfound, ntrees,
942 progress_cb, progress_arg, rl);
950 got_object_tree_close(tree);
955 static const struct got_error *
956 load_tree(int want_meta, struct got_object_idset *idset,
957 struct got_object_id *tree_id, const char *dpath, time_t mtime,
958 struct got_repository *repo, int loose_obj_only,
959 int *ncolored, int *nfound, int *ntrees,
960 got_pack_progress_cb progress_cb, void *progress_arg,
961 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
963 const struct got_error *err = NULL;
964 struct got_object_id_queue tree_ids;
965 struct got_object_qid *qid;
967 if (got_object_idset_contains(idset, tree_id))
970 err = got_object_qid_alloc(&qid, tree_id);
974 STAILQ_INIT(&tree_ids);
975 STAILQ_INSERT_TAIL(&tree_ids, qid, entry);
977 while (!STAILQ_EMPTY(&tree_ids)) {
979 err = (*cancel_cb)(cancel_arg);
984 qid = STAILQ_FIRST(&tree_ids);
985 STAILQ_REMOVE_HEAD(&tree_ids, entry);
987 if (got_object_idset_contains(idset, &qid->id)) {
988 got_object_qid_free(qid);
992 err = add_object(want_meta, idset, &qid->id, dpath,
993 GOT_OBJ_TYPE_TREE, mtime, loose_obj_only, repo,
994 ncolored, nfound, ntrees, progress_cb, progress_arg, rl);
996 got_object_qid_free(qid);
1000 err = load_tree_entries(&tree_ids, want_meta, idset, &qid->id,
1001 dpath, mtime, repo, loose_obj_only, ncolored, nfound,
1002 ntrees, progress_cb, progress_arg, rl,
1003 cancel_cb, cancel_arg);
1004 got_object_qid_free(qid);
1009 got_object_id_queue_free(&tree_ids);
1013 static const struct got_error *
1014 load_commit(int want_meta, struct got_object_idset *idset,
1015 struct got_object_id *id, struct got_repository *repo, int loose_obj_only,
1016 int *ncolored, int *nfound, int *ntrees,
1017 got_pack_progress_cb progress_cb, void *progress_arg,
1018 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
1020 const struct got_error *err;
1021 struct got_commit_object *commit;
1023 if (got_object_idset_contains(idset, id))
1026 if (loose_obj_only) {
1028 err = search_packidx(&is_packed, id, repo);
1031 if (is_packed && want_meta)
1035 err = got_object_open_as_commit(&commit, repo, id);
1039 err = add_object(want_meta, idset, id, "", GOT_OBJ_TYPE_COMMIT,
1040 got_object_commit_get_committer_time(commit),
1041 loose_obj_only, repo,
1042 ncolored, nfound, ntrees, progress_cb, progress_arg, rl);
1046 err = load_tree(want_meta, idset, got_object_commit_get_tree_id(commit),
1047 "", got_object_commit_get_committer_time(commit),
1048 repo, loose_obj_only, ncolored, nfound, ntrees,
1049 progress_cb, progress_arg, rl, cancel_cb, cancel_arg);
1051 got_object_commit_close(commit);
1055 static const struct got_error *
1056 load_tag(int want_meta, struct got_object_idset *idset,
1057 struct got_object_id *id, struct got_repository *repo, int loose_obj_only,
1058 int *ncolored, int *nfound, int *ntrees,
1059 got_pack_progress_cb progress_cb, void *progress_arg,
1060 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
1062 const struct got_error *err;
1063 struct got_tag_object *tag = NULL;
1065 if (got_object_idset_contains(idset, id))
1068 if (loose_obj_only) {
1070 err = search_packidx(&is_packed, id, repo);
1073 if (is_packed && want_meta)
1077 err = got_object_open_as_tag(&tag, repo, id);
1081 err = add_object(want_meta, idset, id, "", GOT_OBJ_TYPE_TAG,
1082 got_object_tag_get_tagger_time(tag), loose_obj_only, repo,
1083 ncolored, nfound, ntrees, progress_cb, progress_arg, rl);
1087 switch (got_object_tag_get_object_type(tag)) {
1088 case GOT_OBJ_TYPE_COMMIT:
1089 err = load_commit(want_meta, idset,
1090 got_object_tag_get_object_id(tag), repo, loose_obj_only,
1091 ncolored, nfound, ntrees, progress_cb, progress_arg, rl,
1092 cancel_cb, cancel_arg);
1094 case GOT_OBJ_TYPE_TREE:
1095 err = load_tree(want_meta, idset,
1096 got_object_tag_get_object_id(tag), "",
1097 got_object_tag_get_tagger_time(tag), repo, loose_obj_only,
1098 ncolored, nfound, ntrees, progress_cb, progress_arg, rl,
1099 cancel_cb, cancel_arg);
1106 got_object_tag_close(tag);
1110 enum findtwixt_color {
1117 static const int findtwixt_colors[] = {
1124 static const struct got_error *
1125 paint_commit(struct got_object_qid *qid, int color)
1127 if (color < 0 || color >= nitems(findtwixt_colors))
1128 return got_error(GOT_ERR_RANGE);
1130 qid->data = (void *)&findtwixt_colors[color];
1134 static const struct got_error *
1135 queue_commit_id(struct got_object_id_queue *ids, struct got_object_id *id,
1136 int color, struct got_repository *repo)
1138 const struct got_error *err;
1139 struct got_object_qid *qid;
1141 err = got_object_qid_alloc(&qid, id);
1145 STAILQ_INSERT_TAIL(ids, qid, entry);
1146 return paint_commit(qid, color);
1149 struct append_id_arg {
1150 struct got_object_id **array;
1152 struct got_object_idset *drop;
1153 struct got_object_idset *skip;
1156 static const struct got_error *
1157 append_id(struct got_object_id *id, void *data, void *arg)
1159 struct append_id_arg *a = arg;
1161 if (got_object_idset_contains(a->skip, id) ||
1162 got_object_idset_contains(a->drop, id))
1165 a->array[++a->idx] = got_object_id_dup(id);
1166 if (a->array[a->idx] == NULL)
1167 return got_error_from_errno("got_object_id_dup");
1172 static const struct got_error *
1173 queue_commit_or_tag_id(struct got_object_id *id, int color,
1174 struct got_object_id_queue *ids, struct got_repository *repo)
1176 const struct got_error *err;
1177 struct got_tag_object *tag = NULL;
1180 err = got_object_get_type(&obj_type, repo, id);
1184 if (obj_type == GOT_OBJ_TYPE_TAG) {
1185 err = got_object_open_as_tag(&tag, repo, id);
1188 obj_type = got_object_tag_get_object_type(tag);
1189 id = got_object_tag_get_object_id(tag);
1192 if (obj_type == GOT_OBJ_TYPE_COMMIT) {
1193 err = queue_commit_id(ids, id, color, repo);
1199 got_object_tag_close(tag);
1203 static const struct got_error *
1204 paint_commits(int *ncolored, struct got_object_id_queue *ids, int nids,
1205 struct got_object_idset *keep, struct got_object_idset *drop,
1206 struct got_object_idset *skip, struct got_repository *repo,
1207 got_pack_progress_cb progress_cb, void *progress_arg,
1208 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
1210 const struct got_error *err = NULL;
1211 struct got_commit_object *commit = NULL;
1212 const struct got_object_id_queue *parents;
1213 struct got_object_qid *qid;
1214 int nqueued = nids, nskip = 0;
1216 while (!STAILQ_EMPTY(ids) && nskip != nqueued) {
1220 err = cancel_cb(cancel_arg);
1225 qid = STAILQ_FIRST(ids);
1226 STAILQ_REMOVE_HEAD(ids, entry);
1228 color = *((int *)qid->data);
1229 if (color == COLOR_SKIP)
1232 if (got_object_idset_contains(skip, &qid->id)) {
1233 got_object_qid_free(qid);
1239 if (got_object_idset_contains(keep, &qid->id)) {
1240 got_object_qid_free(qid);
1243 if (got_object_idset_contains(drop, &qid->id)) {
1244 err = paint_commit(qid, COLOR_SKIP);
1250 err = got_object_idset_add(keep, &qid->id, NULL);
1255 if (got_object_idset_contains(drop, &qid->id)) {
1256 got_object_qid_free(qid);
1259 if (got_object_idset_contains(keep, &qid->id)) {
1260 err = paint_commit(qid, COLOR_SKIP);
1266 err = got_object_idset_add(drop, &qid->id, NULL);
1271 if (!got_object_idset_contains(skip, &qid->id)) {
1272 err = got_object_idset_add(skip, &qid->id,
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");