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))
64 struct got_pack_meta {
65 struct got_object_id id;
71 /* The best delta we picked */
72 struct got_pack_meta *head;
73 struct got_pack_meta *prev;
74 unsigned char *delta_buf; /* if not encoded in delta cache file */
75 off_t delta_offset; /* offset in delta cache file */
76 off_t delta_len; /* encoded delta length */
79 int have_reused_delta;
80 off_t reused_delta_offset; /* offset of delta in reused pack file */
81 struct got_object_id *base_obj_id;
83 /* Only used for delta window */
84 struct got_delta_table *dtab;
86 /* Only used for writing offset deltas */
90 struct got_pack_metavec {
91 struct got_pack_meta **meta;
96 static const struct got_error *
97 alloc_meta(struct got_pack_meta **new, struct got_object_id *id,
98 const char *path, int obj_type, time_t mtime)
100 const struct got_error *err = NULL;
101 struct got_pack_meta *m;
105 m = calloc(1, sizeof(*m));
107 return got_error_from_errno("calloc");
109 memcpy(&m->id, id, sizeof(m->id));
111 m->path = strdup(path);
112 if (m->path == NULL) {
113 err = got_error_from_errno("strdup");
118 m->obj_type = obj_type;
125 clear_meta(struct got_pack_meta *meta)
131 free(meta->delta_buf);
132 meta->delta_buf = NULL;
133 free(meta->base_obj_id);
134 meta->base_obj_id = NULL;
138 free_nmeta(struct got_pack_meta **meta, int nmeta)
142 for (i = 0; i < nmeta; i++)
148 delta_order_cmp(const void *pa, const void *pb)
150 struct got_pack_meta *a, *b;
153 a = *(struct got_pack_meta **)pa;
154 b = *(struct got_pack_meta **)pb;
156 if (a->obj_type != b->obj_type)
157 return a->obj_type - b->obj_type;
158 cmp = strcmp(a->path, b->path);
161 if (a->mtime != b->mtime)
162 return a->mtime - b->mtime;
163 return got_object_id_cmp(&a->id, &b->id);
167 delta_size(struct got_delta_instruction *deltas, int ndeltas)
171 for (i = 0; i < ndeltas; i++) {
173 size += GOT_DELTA_SIZE_SHIFT;
175 size += deltas[i].len + 1;
180 static const struct got_error *
181 append(unsigned char **p, size_t *len, off_t *sz, void *seg, int nseg)
185 if (*len + nseg >= *sz) {
186 while (*len + nseg >= *sz)
188 n = realloc(*p, *sz);
190 return got_error_from_errno("realloc");
193 memcpy(*p + *len, seg, nseg);
198 static const struct got_error *
199 encode_delta_in_mem(struct got_pack_meta *m, struct got_raw_object *o,
200 struct got_delta_instruction *deltas, int ndeltas,
201 off_t delta_size, off_t base_size)
203 const struct got_error *err;
204 unsigned char buf[16], *bp;
208 struct got_delta_instruction *d;
210 m->delta_buf = malloc(delta_size);
211 if (m->delta_buf == NULL)
212 return got_error_from_errno("calloc");
214 /* base object size */
215 buf[0] = base_size & GOT_DELTA_SIZE_VAL_MASK;
216 n = base_size >> GOT_DELTA_SIZE_SHIFT;
217 for (i = 1; n > 0; i++) {
218 buf[i - 1] |= GOT_DELTA_SIZE_MORE;
219 buf[i] = n & GOT_DELTA_SIZE_VAL_MASK;
220 n >>= GOT_DELTA_SIZE_SHIFT;
222 err = append(&m->delta_buf, &len, &delta_size, buf, i);
226 /* target object size */
227 buf[0] = o->size & GOT_DELTA_SIZE_VAL_MASK;
228 n = o->size >> GOT_DELTA_SIZE_SHIFT;
229 for (i = 1; n > 0; i++) {
230 buf[i - 1] |= GOT_DELTA_SIZE_MORE;
231 buf[i] = n & GOT_DELTA_SIZE_VAL_MASK;
232 n >>= GOT_DELTA_SIZE_SHIFT;
234 err = append(&m->delta_buf, &len, &delta_size, buf, i);
238 for (j = 0; j < ndeltas; j++) {
243 buf[0] = GOT_DELTA_BASE_COPY;
244 for (i = 0; i < 4; i++) {
245 /* DELTA_COPY_OFF1 ... DELTA_COPY_OFF4 */
254 if (n != GOT_DELTA_COPY_DEFAULT_LEN) {
255 /* DELTA_COPY_LEN1 ... DELTA_COPY_LEN3 */
256 for (i = 0; i < 3 && n > 0; i++) {
257 buf[0] |= 1 << (i + 4);
262 err = append(&m->delta_buf, &len, &delta_size,
266 } else if (o->f == NULL) {
268 while (n != d->len) {
269 buf[0] = (d->len - n < 127) ? d->len - n : 127;
270 err = append(&m->delta_buf, &len, &delta_size,
274 err = append(&m->delta_buf, &len, &delta_size,
275 o->data + o->hdrlen + d->offset + n,
284 if (fseeko(o->f, o->hdrlen + d->offset, SEEK_SET) == -1)
285 return got_error_from_errno("fseeko");
287 while (n != d->len) {
288 buf[0] = (d->len - n < 127) ? d->len - n : 127;
289 err = append(&m->delta_buf, &len, &delta_size,
293 r = fread(content, 1, buf[0], o->f);
295 return got_ferror(o->f, GOT_ERR_IO);
296 err = append(&m->delta_buf, &len, &delta_size,
309 static const struct got_error *
310 encode_delta(struct got_pack_meta *m, struct got_raw_object *o,
311 struct got_delta_instruction *deltas, int ndeltas,
312 off_t base_size, FILE *f)
314 unsigned char buf[16], *bp;
318 struct got_delta_instruction *d;
320 /* base object size */
321 buf[0] = base_size & GOT_DELTA_SIZE_VAL_MASK;
322 n = base_size >> GOT_DELTA_SIZE_SHIFT;
323 for (i = 1; n > 0; i++) {
324 buf[i - 1] |= GOT_DELTA_SIZE_MORE;
325 buf[i] = n & GOT_DELTA_SIZE_VAL_MASK;
326 n >>= GOT_DELTA_SIZE_SHIFT;
328 w = fwrite(buf, 1, i, f);
330 return got_ferror(f, GOT_ERR_IO);
332 /* target object size */
333 buf[0] = o->size & GOT_DELTA_SIZE_VAL_MASK;
334 n = o->size >> GOT_DELTA_SIZE_SHIFT;
335 for (i = 1; n > 0; i++) {
336 buf[i - 1] |= GOT_DELTA_SIZE_MORE;
337 buf[i] = n & GOT_DELTA_SIZE_VAL_MASK;
338 n >>= GOT_DELTA_SIZE_SHIFT;
340 w = fwrite(buf, 1, i, f);
342 return got_ferror(f, GOT_ERR_IO);
344 for (j = 0; j < ndeltas; j++) {
349 buf[0] = GOT_DELTA_BASE_COPY;
350 for (i = 0; i < 4; i++) {
351 /* DELTA_COPY_OFF1 ... DELTA_COPY_OFF4 */
360 if (n != GOT_DELTA_COPY_DEFAULT_LEN) {
361 /* DELTA_COPY_LEN1 ... DELTA_COPY_LEN3 */
362 for (i = 0; i < 3 && n > 0; i++) {
363 buf[0] |= 1 << (i + 4);
368 w = fwrite(buf, 1, bp - buf, f);
370 return got_ferror(f, GOT_ERR_IO);
371 } else if (o->f == NULL) {
373 while (n != d->len) {
374 buf[0] = (d->len - n < 127) ? d->len - n : 127;
375 w = fwrite(buf, 1, 1, f);
377 return got_ferror(f, GOT_ERR_IO);
378 w = fwrite(o->data + o->hdrlen + d->offset + n,
381 return got_ferror(f, GOT_ERR_IO);
387 if (fseeko(o->f, o->hdrlen + d->offset, SEEK_SET) == -1)
388 return got_error_from_errno("fseeko");
390 while (n != d->len) {
391 buf[0] = (d->len - n < 127) ? d->len - n : 127;
392 w = fwrite(buf, 1, 1, f);
394 return got_ferror(f, GOT_ERR_IO);
395 r = fread(content, 1, buf[0], o->f);
397 return got_ferror(o->f, GOT_ERR_IO);
398 w = fwrite(content, 1, buf[0], f);
400 return got_ferror(f, GOT_ERR_IO);
406 m->delta_len = ftello(f) - m->delta_offset;
410 static const struct got_error *
411 report_progress(got_pack_progress_cb progress_cb, void *progress_arg,
412 struct got_ratelimit *rl, int ncolored, int nfound, int ntrees,
413 off_t packfile_size, int ncommits, int nobj_total, int obj_deltify,
416 const struct got_error *err;
419 if (progress_cb == NULL)
422 err = got_ratelimit_check(&elapsed, rl);
426 return progress_cb(progress_arg, ncolored, nfound, ntrees,
427 packfile_size, ncommits, nobj_total, obj_deltify, nobj_written);
430 static const struct got_error *
431 add_meta(struct got_pack_meta *m, struct got_pack_metavec *v)
433 if (v->nmeta == v->metasz){
434 size_t newsize = 2 * v->metasz;
435 struct got_pack_meta **new;
436 new = reallocarray(v->meta, newsize, sizeof(*new));
438 return got_error_from_errno("reallocarray");
443 v->meta[v->nmeta++] = m;
447 static const struct got_error *
448 reuse_delta(int idx, struct got_pack_meta *m, struct got_pack_metavec *v,
449 struct got_object_idset *idset, struct got_pack *pack,
450 struct got_packidx *packidx, int delta_cache_fd,
451 struct got_repository *repo)
453 const struct got_error *err = NULL;
454 struct got_pack_meta *base = NULL;
455 struct got_object_id *base_obj_id = NULL;
456 off_t delta_len = 0, delta_offset = 0, delta_cache_offset = 0;
457 uint64_t base_size, result_size;
459 if (m->have_reused_delta)
462 err = got_object_read_raw_delta(&base_size, &result_size, &delta_len,
463 &delta_offset, &delta_cache_offset, &base_obj_id, delta_cache_fd,
464 packidx, idx, &m->id, repo);
468 if (delta_offset + delta_len < delta_offset)
469 return got_error(GOT_ERR_BAD_PACKFILE);
471 base = got_object_idset_get(idset, base_obj_id);
475 m->delta_len = delta_len;
476 m->delta_offset = delta_cache_offset;
478 m->size = result_size;
479 m->have_reused_delta = 1;
480 m->reused_delta_offset = delta_offset;
481 m->base_obj_id = base_obj_id;
483 err = add_meta(m, v);
489 static const struct got_error *
490 find_pack_for_reuse(struct got_packidx **best_packidx,
491 struct got_repository *repo)
493 const struct got_error *err = NULL;
494 struct got_pathlist_entry *pe;
495 const char *best_packidx_path = NULL;
498 *best_packidx = NULL;
500 TAILQ_FOREACH(pe, &repo->packidx_paths, entry) {
501 const char *path_packidx = pe->path;
502 struct got_packidx *packidx;
505 err = got_repo_get_packidx(&packidx, path_packidx, repo);
509 nobj = be32toh(packidx->hdr.fanout_table[0xff]);
510 if (nobj > nobj_max) {
511 best_packidx_path = path_packidx;
516 if (best_packidx_path) {
517 err = got_repo_get_packidx(best_packidx, best_packidx_path,
524 struct search_deltas_arg {
525 struct got_packidx *packidx;
526 struct got_pack *pack;
527 struct got_object_idset *idset;
528 struct got_pack_metavec *v;
530 struct got_repository *repo;
531 got_pack_progress_cb progress_cb;
533 struct got_ratelimit *rl;
534 got_cancel_cb cancel_cb;
542 static const struct got_error *
543 search_delta_for_object(struct got_object_id *id, void *data, void *arg)
545 const struct got_error *err;
546 struct got_pack_meta *m = data;
547 struct search_deltas_arg *a = arg;
549 struct got_object *obj = NULL;
552 err = (*a->cancel_cb)(a->cancel_arg);
557 if (!got_repo_check_packidx_bloom_filter(a->repo,
558 a->packidx->path_packidx, id))
561 obj_idx = got_packidx_get_object_idx(a->packidx, id);
566 * Opening and closing an object just to check its flags
567 * is a bit expensive. We could have an imsg which requests
568 * plain type/size information for an object without doing
569 * work such as traversing the object's entire delta chain
570 * to find the base object type, and other such info which
571 * we don't really need here.
573 err = got_object_open_from_packfile(&obj, &m->id, a->pack,
574 a->packidx, obj_idx, a->repo);
578 if (obj->flags & GOT_OBJ_FLAG_DELTIFIED) {
579 reuse_delta(obj_idx, m, a->v, a->idset, a->pack, a->packidx,
580 a->delta_cache_fd, a->repo);
583 err = report_progress(a->progress_cb, a->progress_arg, a->rl,
584 a->ncolored, a->nfound, a->ntrees, 0L, a->ncommits,
585 got_object_idset_num_elements(a->idset), a->v->nmeta, 0);
588 got_object_close(obj);
592 static const struct got_error *
593 search_deltas(struct got_pack_metavec *v, struct got_object_idset *idset,
594 int delta_cache_fd, int ncolored, int nfound, int ntrees, int ncommits,
595 struct got_repository *repo,
596 got_pack_progress_cb progress_cb, void *progress_arg,
597 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
599 const struct got_error *err = NULL;
600 char *path_packfile = NULL;
601 struct got_packidx *packidx;
602 struct got_pack *pack;
603 struct search_deltas_arg sda;
605 err = find_pack_for_reuse(&packidx, repo);
612 err = got_packidx_get_packfile_path(&path_packfile,
613 packidx->path_packidx);
617 pack = got_repo_get_cached_pack(repo, path_packfile);
619 err = got_repo_cache_pack(&pack, repo, path_packfile, packidx);
624 sda.packidx = packidx;
628 sda.delta_cache_fd = delta_cache_fd;
630 sda.progress_cb = progress_cb;
631 sda.progress_arg = progress_arg;
633 sda.cancel_cb = cancel_cb;
634 sda.cancel_arg = cancel_arg;
635 sda.ncolored = ncolored;
638 sda.ncommits = ncommits;
639 err = got_object_idset_for_each(idset, search_delta_for_object, &sda);
645 static const struct got_error *
646 pick_deltas(struct got_pack_meta **meta, int nmeta, int ncolored,
647 int nfound, int ntrees, int ncommits, int nreused, FILE *delta_cache,
648 struct got_repository *repo,
649 got_pack_progress_cb progress_cb, void *progress_arg,
650 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
652 const struct got_error *err = NULL;
653 struct got_pack_meta *m = NULL, *base = NULL;
654 struct got_raw_object *raw = NULL, *base_raw = NULL;
655 struct got_delta_instruction *deltas = NULL, *best_deltas = NULL;
656 int i, j, ndeltas, best_ndeltas;
657 off_t size, best_size;
658 const int max_base_candidates = 3;
659 size_t delta_memsize = 0;
660 const size_t max_delta_memsize = 25 * GOT_DELTA_RESULT_SIZE_CACHED_MAX;
663 qsort(meta, nmeta, sizeof(struct got_pack_meta *), delta_order_cmp);
664 for (i = 0; i < nmeta; i++) {
666 err = (*cancel_cb)(cancel_arg);
670 err = report_progress(progress_cb, progress_arg, rl,
671 ncolored, nfound, ntrees, 0L, ncommits, nreused + nmeta,
677 if (m->obj_type == GOT_OBJ_TYPE_COMMIT ||
678 m->obj_type == GOT_OBJ_TYPE_TAG)
681 err = got_object_raw_open(&raw, &outfd, repo, &m->id);
686 if (raw->f == NULL) {
687 err = got_deltify_init_mem(&m->dtab, raw->data,
688 raw->hdrlen, raw->size + raw->hdrlen);
690 err = got_deltify_init(&m->dtab, raw->f, raw->hdrlen,
691 raw->size + raw->hdrlen);
696 if (i > max_base_candidates) {
697 struct got_pack_meta *n = NULL;
698 n = meta[i - (max_base_candidates + 1)];
699 got_deltify_free(n->dtab);
703 best_size = raw->size;
705 for (j = MAX(0, i - max_base_candidates); j < i; j++) {
707 err = (*cancel_cb)(cancel_arg);
712 /* long chains make unpacking slow, avoid such bases */
713 if (base->nchain >= 128 ||
714 base->obj_type != m->obj_type)
717 err = got_object_raw_open(&base_raw, &outfd, repo,
722 if (raw->f == NULL && base_raw->f == NULL) {
723 err = got_deltify_mem_mem(&deltas, &ndeltas,
724 raw->data, raw->hdrlen,
725 raw->size + raw->hdrlen,
726 base->dtab, base_raw->data,
728 base_raw->size + base_raw->hdrlen);
729 } else if (raw->f == NULL) {
730 err = got_deltify_mem_file(&deltas, &ndeltas,
731 raw->data, raw->hdrlen,
732 raw->size + raw->hdrlen,
733 base->dtab, base_raw->f,
735 base_raw->size + base_raw->hdrlen);
736 } else if (base_raw->f == NULL) {
737 err = got_deltify_file_mem(&deltas, &ndeltas,
739 raw->size + raw->hdrlen,
740 base->dtab, base_raw->data,
742 base_raw->size + base_raw->hdrlen);
744 err = got_deltify(&deltas, &ndeltas,
746 raw->size + raw->hdrlen,
747 base->dtab, base_raw->f, base_raw->hdrlen,
748 base_raw->size + base_raw->hdrlen);
750 got_object_raw_close(base_raw);
755 size = delta_size(deltas, ndeltas);
756 if (size + 32 < best_size){
758 * if we already picked a best delta,
763 best_deltas = deltas;
764 best_ndeltas = ndeltas;
766 m->nchain = base->nchain + 1;
768 m->head = base->head;
778 if (best_ndeltas > 0) {
779 if (best_size <= GOT_DELTA_RESULT_SIZE_CACHED_MAX &&
780 delta_memsize + best_size <= max_delta_memsize) {
781 delta_memsize += best_size;
782 err = encode_delta_in_mem(m, raw, best_deltas,
783 best_ndeltas, best_size, m->prev->size);
785 m->delta_offset = ftello(delta_cache);
788 * Storing compressed delta data in the delta
789 * cache file would probably be more efficient
790 * than writing uncompressed delta data here
791 * and compressing it while writing the pack
792 * file. This would also allow for reusing
793 * deltas in their compressed form.
795 err = encode_delta(m, raw, best_deltas,
796 best_ndeltas, m->prev->size, delta_cache);
805 got_object_raw_close(raw);
809 for (i = MAX(0, nmeta - max_base_candidates); i < nmeta; i++) {
810 got_deltify_free(meta[i]->dtab);
811 meta[i]->dtab = NULL;
814 got_object_raw_close(raw);
816 got_object_raw_close(base_raw);
817 if (outfd != -1 && close(outfd) == -1 && err == NULL)
818 err = got_error_from_errno("close");
824 static const struct got_error *
825 search_packidx(int *found, struct got_object_id *id,
826 struct got_repository *repo)
828 const struct got_error *err = NULL;
829 struct got_packidx *packidx = NULL;
834 err = got_repo_search_packidx(&packidx, &idx, repo, id);
836 *found = 1; /* object is already packed */
837 else if (err->code == GOT_ERR_NO_OBJ)
842 static const int obj_types[] = {
848 GOT_OBJ_TYPE_OFFSET_DELTA,
849 GOT_OBJ_TYPE_REF_DELTA
852 static const struct got_error *
853 add_object(int want_meta, struct got_object_idset *idset,
854 struct got_object_id *id, const char *path, int obj_type,
855 time_t mtime, int loose_obj_only, struct got_repository *repo)
857 const struct got_error *err;
858 struct got_pack_meta *m = NULL;
860 if (loose_obj_only) {
862 err = search_packidx(&is_packed, id, repo);
865 if (is_packed && want_meta)
870 err = alloc_meta(&m, id, path, obj_type, mtime);
875 return got_object_idset_add(idset, id, m);
878 static const struct got_error *
879 load_tree_entries(struct got_object_id_queue *ids, int want_meta,
880 struct got_object_idset *idset, struct got_object_id *tree_id,
881 const char *dpath, time_t mtime, struct got_repository *repo,
882 int loose_obj_only, int *ncolored, int *nfound, int *ntrees,
883 got_pack_progress_cb progress_cb, void *progress_arg,
884 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
886 const struct got_error *err;
887 struct got_tree_object *tree;
891 err = got_object_open_as_tree(&tree, repo, tree_id);
896 err = report_progress(progress_cb, progress_arg, rl,
897 *ncolored, *nfound, *ntrees, 0L, 0, 0, 0, 0);
901 for (i = 0; i < got_object_tree_get_nentries(tree); i++) {
902 struct got_tree_entry *e = got_object_tree_get_entry(tree, i);
903 struct got_object_id *id = got_tree_entry_get_id(e);
904 mode_t mode = got_tree_entry_get_mode(e);
907 err = (*cancel_cb)(cancel_arg);
912 if (got_object_tree_entry_is_submodule(e) ||
913 got_object_idset_contains(idset, id))
916 if (asprintf(&p, "%s%s%s", dpath, dpath[0] != '\0' ? "/" : "",
917 got_tree_entry_get_name(e)) == -1) {
918 err = got_error_from_errno("asprintf");
923 struct got_object_qid *qid;
924 err = got_object_qid_alloc(&qid, id);
927 STAILQ_INSERT_TAIL(ids, qid, entry);
928 } else if (S_ISREG(mode) || S_ISLNK(mode)) {
929 err = add_object(want_meta, idset, id, p,
930 GOT_OBJ_TYPE_BLOB, mtime, loose_obj_only, repo);
934 err = report_progress(progress_cb, progress_arg, rl,
935 *ncolored, *nfound, *ntrees, 0L, 0, 0, 0, 0);
943 got_object_tree_close(tree);
948 static const struct got_error *
949 load_tree(int want_meta, struct got_object_idset *idset,
950 struct got_object_id *tree_id, const char *dpath, time_t mtime,
951 struct got_repository *repo, int loose_obj_only,
952 int *ncolored, int *nfound, int *ntrees,
953 got_pack_progress_cb progress_cb, void *progress_arg,
954 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
956 const struct got_error *err = NULL;
957 struct got_object_id_queue tree_ids;
958 struct got_object_qid *qid;
960 if (got_object_idset_contains(idset, tree_id))
963 err = got_object_qid_alloc(&qid, tree_id);
967 STAILQ_INIT(&tree_ids);
968 STAILQ_INSERT_TAIL(&tree_ids, qid, entry);
970 while (!STAILQ_EMPTY(&tree_ids)) {
972 err = (*cancel_cb)(cancel_arg);
977 qid = STAILQ_FIRST(&tree_ids);
978 STAILQ_REMOVE_HEAD(&tree_ids, entry);
980 if (got_object_idset_contains(idset, qid->id)) {
981 got_object_qid_free(qid);
985 err = add_object(want_meta, idset, qid->id, dpath,
986 GOT_OBJ_TYPE_TREE, mtime, loose_obj_only, repo);
988 got_object_qid_free(qid);
993 err = report_progress(progress_cb, progress_arg, rl,
994 *ncolored, *nfound, *ntrees, 0L, 0, 0, 0, 0);
998 err = load_tree_entries(&tree_ids, want_meta, idset, qid->id,
999 dpath, mtime, repo, loose_obj_only, ncolored, nfound,
1000 ntrees, progress_cb, progress_arg, rl,
1001 cancel_cb, cancel_arg);
1002 got_object_qid_free(qid);
1007 got_object_id_queue_free(&tree_ids);
1011 static const struct got_error *
1012 load_commit(int want_meta, struct got_object_idset *idset,
1013 struct got_object_id *id, struct got_repository *repo, int loose_obj_only,
1014 int *ncolored, int *nfound, int *ntrees,
1015 got_pack_progress_cb progress_cb, void *progress_arg,
1016 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
1018 const struct got_error *err;
1019 struct got_commit_object *commit;
1021 if (got_object_idset_contains(idset, id))
1024 if (loose_obj_only) {
1026 err = search_packidx(&is_packed, id, repo);
1029 if (is_packed && want_meta)
1033 err = got_object_open_as_commit(&commit, repo, id);
1037 err = add_object(want_meta, idset, id, "", GOT_OBJ_TYPE_COMMIT,
1038 got_object_commit_get_committer_time(commit),
1039 loose_obj_only, repo);
1044 err = report_progress(progress_cb, progress_arg, rl,
1045 *ncolored, *nfound, *ntrees, 0L, 0, 0, 0, 0);
1049 err = load_tree(want_meta, idset, got_object_commit_get_tree_id(commit),
1050 "", got_object_commit_get_committer_time(commit),
1051 repo, loose_obj_only, ncolored, nfound, ntrees,
1052 progress_cb, progress_arg, rl, cancel_cb, cancel_arg);
1054 got_object_commit_close(commit);
1058 static const struct got_error *
1059 load_tag(int want_meta, struct got_object_idset *idset,
1060 struct got_object_id *id, struct got_repository *repo, int loose_obj_only,
1061 int *ncolored, int *nfound, int *ntrees,
1062 got_pack_progress_cb progress_cb, void *progress_arg,
1063 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
1065 const struct got_error *err;
1066 struct got_tag_object *tag = NULL;
1068 if (got_object_idset_contains(idset, id))
1071 if (loose_obj_only) {
1073 err = search_packidx(&is_packed, id, repo);
1076 if (is_packed && want_meta)
1080 err = got_object_open_as_tag(&tag, repo, id);
1084 err = add_object(want_meta, idset, id, "", GOT_OBJ_TYPE_TAG,
1085 got_object_tag_get_tagger_time(tag),
1086 loose_obj_only, repo);
1091 err = report_progress(progress_cb, progress_arg, rl,
1092 *ncolored, *nfound, *ntrees, 0L, 0, 0, 0, 0);
1096 switch (got_object_tag_get_object_type(tag)) {
1097 case GOT_OBJ_TYPE_COMMIT:
1098 err = load_commit(want_meta, idset,
1099 got_object_tag_get_object_id(tag), repo, loose_obj_only,
1100 ncolored, nfound, ntrees, progress_cb, progress_arg, rl,
1101 cancel_cb, cancel_arg);
1103 case GOT_OBJ_TYPE_TREE:
1104 err = load_tree(want_meta, idset,
1105 got_object_tag_get_object_id(tag), "",
1106 got_object_tag_get_tagger_time(tag), repo, loose_obj_only,
1107 ncolored, nfound, ntrees, progress_cb, progress_arg, rl,
1108 cancel_cb, cancel_arg);
1115 got_object_tag_close(tag);
1119 enum findtwixt_color {
1124 static const int findtwixt_colors[] = {
1130 static const struct got_error *
1131 queue_commit_id(struct got_object_id_queue *ids, struct got_object_id *id,
1132 int color, struct got_repository *repo)
1134 const struct got_error *err;
1135 struct got_object_qid *qid;
1137 err = got_object_qid_alloc(&qid, id);
1141 STAILQ_INSERT_TAIL(ids, qid, entry);
1142 qid->data = (void *)&findtwixt_colors[color];
1146 static const struct got_error *
1147 drop_commit(struct got_object_idset *keep, struct got_object_idset *drop,
1148 struct got_object_id *id, struct got_repository *repo,
1149 got_cancel_cb cancel_cb, void *cancel_arg)
1151 const struct got_error *err = NULL;
1152 struct got_commit_object *commit;
1153 const struct got_object_id_queue *parents;
1154 struct got_object_id_queue ids;
1155 struct got_object_qid *qid;
1159 err = got_object_qid_alloc(&qid, id);
1162 STAILQ_INSERT_HEAD(&ids, qid, entry);
1164 while (!STAILQ_EMPTY(&ids)) {
1166 err = (*cancel_cb)(cancel_arg);
1171 qid = STAILQ_FIRST(&ids);
1172 STAILQ_REMOVE_HEAD(&ids, entry);
1174 if (got_object_idset_contains(drop, qid->id)) {
1175 got_object_qid_free(qid);
1179 err = got_object_idset_add(drop, qid->id,
1180 (void *)&obj_types[GOT_OBJ_TYPE_COMMIT]);
1182 got_object_qid_free(qid);
1186 if (!got_object_idset_contains(keep, qid->id)) {
1187 got_object_qid_free(qid);
1191 err = got_object_open_as_commit(&commit, repo, qid->id);
1192 got_object_qid_free(qid);
1196 parents = got_object_commit_get_parent_ids(commit);
1198 err = got_object_id_queue_copy(parents, &ids);
1200 got_object_commit_close(commit);
1204 got_object_commit_close(commit);
1207 got_object_id_queue_free(&ids);
1211 struct append_id_arg {
1212 struct got_object_id **array;
1216 static const struct got_error *
1217 append_id(struct got_object_id *id, void *data, void *arg)
1219 struct append_id_arg *a = arg;
1221 a->array[a->idx] = got_object_id_dup(id);
1222 if (a->array[a->idx] == NULL)
1223 return got_error_from_errno("got_object_id_dup");
1229 static const struct got_error *
1230 findtwixt(struct got_object_id ***res, int *nres, int *ncolored,
1231 struct got_object_id **head, int nhead,
1232 struct got_object_id **tail, int ntail,
1233 struct got_repository *repo,
1234 got_pack_progress_cb progress_cb, void *progress_arg,
1235 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
1237 const struct got_error *err = NULL;
1238 struct got_object_id_queue ids;
1239 struct got_object_idset *keep, *drop;
1240 struct got_object_qid *qid;
1241 int i, ncolor, nkeep, obj_type;
1248 keep = got_object_idset_alloc();
1250 return got_error_from_errno("got_object_idset_alloc");
1252 drop = got_object_idset_alloc();
1254 err = got_error_from_errno("got_object_idset_alloc");
1258 for (i = 0; i < nhead; i++) {
1259 struct got_object_id *id = head[i];
1262 err = got_object_get_type(&obj_type, repo, id);
1265 if (obj_type != GOT_OBJ_TYPE_COMMIT)
1267 err = queue_commit_id(&ids, id, COLOR_KEEP, repo);
1271 for (i = 0; i < ntail; i++) {
1272 struct got_object_id *id = tail[i];
1275 err = got_object_get_type(&obj_type, repo, id);
1278 if (obj_type != GOT_OBJ_TYPE_COMMIT)
1280 err = queue_commit_id(&ids, id, COLOR_DROP, repo);
1285 while (!STAILQ_EMPTY(&ids)) {
1287 qid = STAILQ_FIRST(&ids);
1288 qcolor = *((int *)qid->data);
1290 if (got_object_idset_contains(drop, qid->id))
1291 ncolor = COLOR_DROP;
1292 else if (got_object_idset_contains(keep, qid->id))
1293 ncolor = COLOR_KEEP;
1295 ncolor = COLOR_BLANK;
1298 err = report_progress(progress_cb, progress_arg, rl,
1299 *ncolored, 0, 0, 0L, 0, 0, 0, 0);
1303 if (ncolor == COLOR_DROP || (ncolor == COLOR_KEEP &&
1304 qcolor == COLOR_KEEP)) {
1305 STAILQ_REMOVE_HEAD(&ids, entry);
1306 got_object_qid_free(qid);
1310 if (ncolor == COLOR_KEEP && qcolor == COLOR_DROP) {
1311 err = drop_commit(keep, drop, qid->id, repo,
1312 cancel_cb, cancel_arg);
1315 } else if (ncolor == COLOR_BLANK) {
1316 struct got_commit_object *commit;
1317 struct got_object_id *id;
1318 const struct got_object_id_queue *parents;
1319 struct got_object_qid *pid;
1321 id = got_object_id_dup(qid->id);
1323 err = got_error_from_errno("got_object_id_dup");
1326 if (qcolor == COLOR_KEEP)
1327 err = got_object_idset_add(keep, id,
1328 (void *)&obj_types[GOT_OBJ_TYPE_COMMIT]);
1330 err = got_object_idset_add(drop, id,
1331 (void *)&obj_types[GOT_OBJ_TYPE_COMMIT]);
1337 err = got_object_open_as_commit(&commit, repo, id);
1342 parents = got_object_commit_get_parent_ids(commit);
1344 STAILQ_FOREACH(pid, parents, entry) {
1345 err = queue_commit_id(&ids, pid->id,
1353 got_object_commit_close(commit);
1356 /* should not happen */
1357 err = got_error_fmt(GOT_ERR_NOT_IMPL,
1358 "%s ncolor=%d qcolor=%d", __func__, ncolor, qcolor);
1362 STAILQ_REMOVE_HEAD(&ids, entry);
1363 got_object_qid_free(qid);
1366 nkeep = got_object_idset_num_elements(keep);
1368 struct append_id_arg arg;
1369 arg.array = calloc(nkeep, sizeof(struct got_object_id *));
1370 if (arg.array == NULL) {
1371 err = got_error_from_errno("calloc");
1375 err = got_object_idset_for_each(keep, append_id, &arg);
1384 got_object_idset_free(keep);
1385 got_object_idset_free(drop);
1386 got_object_id_queue_free(&ids);
1390 static const struct got_error *
1391 load_object_ids(int *ncolored, int *nfound, int *ntrees,
1392 struct got_object_idset *idset, struct got_object_id **theirs, int ntheirs,
1393 struct got_object_id **ours, int nours, struct got_repository *repo,
1394 int loose_obj_only, got_pack_progress_cb progress_cb, void *progress_arg,
1395 struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
1397 const struct got_error *err = NULL;
1398 struct got_object_id **ids = NULL;
1399 int i, nobj = 0, obj_type;
1405 err = findtwixt(&ids, &nobj, ncolored, ours, nours, theirs, ntheirs,
1406 repo, progress_cb, progress_arg, rl, cancel_cb, cancel_arg);
1407 if (err || nobj == 0)
1410 for (i = 0; i < ntheirs; i++) {
1411 struct got_object_id *id = theirs[i];
1414 err = got_object_get_type(&obj_type, repo, id);
1417 if (obj_type != GOT_OBJ_TYPE_COMMIT)
1419 err = load_commit(0, idset, id, repo, loose_obj_only,
1420 ncolored, nfound, ntrees, progress_cb, progress_arg, rl,
1421 cancel_cb, cancel_arg);
1426 for (i = 0; i < ntheirs; i++) {
1427 struct got_object_id *id = theirs[i];
1428 struct got_pack_meta *m;
1431 m = got_object_idset_get(idset, id);
1433 err = got_object_get_type(&obj_type, repo, id);
1437 obj_type = m->obj_type;
1438 if (obj_type != GOT_OBJ_TYPE_TAG)
1440 err = load_tag(0, idset, id, repo, loose_obj_only,
1441 ncolored, nfound, ntrees, progress_cb, progress_arg, rl,
1442 cancel_cb, cancel_arg);
1447 for (i = 0; i < nobj; i++) {
1448 err = load_commit(1, idset, ids[i], repo, loose_obj_only,
1449 ncolored, nfound, ntrees, progress_cb, progress_arg, rl,
1450 cancel_cb, cancel_arg);
1455 for (i = 0; i < nours; i++) {
1456 struct got_object_id *id = ours[i];
1457 struct got_pack_meta *m;
1460 m = got_object_idset_get(idset, id);
1462 err = got_object_get_type(&obj_type, repo, id);
1466 obj_type = m->obj_type;
1467 if (obj_type != GOT_OBJ_TYPE_TAG)
1469 err = load_tag(1, idset, id, repo, loose_obj_only,
1470 ncolored, nfound, ntrees, progress_cb, progress_arg, rl,
1471 cancel_cb, cancel_arg);
1476 for (i = 0; i < nobj; i++) {
1483 const struct got_error *
1484 hwrite(FILE *f, void *buf, int len, SHA1_CTX *ctx)
1488 SHA1Update(ctx, buf, len);
1489 n = fwrite(buf, 1, len, f);
1491 return got_ferror(f, GOT_ERR_IO);
1496 putbe32(char *b, uint32_t n)
1505 write_order_cmp(const void *pa, const void *pb)
1507 struct got_pack_meta *a, *b, *ahd, *bhd;
1509 a = *(struct got_pack_meta **)pa;
1510 b = *(struct got_pack_meta **)pb;
1511 ahd = (a->head == NULL) ? a : a->head;
1512 bhd = (b->head == NULL) ? b : b->head;
1513 if (ahd->mtime != bhd->mtime)
1514 return bhd->mtime - ahd->mtime;
1516 return (uintptr_t)bhd - (uintptr_t)ahd;
1517 if (a->nchain != b->nchain)
1518 return a->nchain - b->nchain;
1519 return a->mtime - b->mtime;
1523 reuse_write_order_cmp(const void *pa, const void *pb)
1525 struct got_pack_meta *a, *b;
1527 a = *(struct got_pack_meta **)pa;
1528 b = *(struct got_pack_meta **)pb;
1530 if (a->reused_delta_offset < b->reused_delta_offset)
1532 if (a->reused_delta_offset > b->reused_delta_offset)
1537 static const struct got_error *
1538 packhdr(int *hdrlen, char *hdr, size_t bufsize, int obj_type, size_t len)
1544 hdr[0] = obj_type << 4;
1545 hdr[0] |= len & 0xf;
1547 for (i = 1; len != 0; i++){
1549 return got_error(GOT_ERR_NO_SPACE);
1550 hdr[i - 1] |= GOT_DELTA_SIZE_MORE;
1551 hdr[i] = len & GOT_DELTA_SIZE_VAL_MASK;
1552 len >>= GOT_DELTA_SIZE_SHIFT;
1560 packoff(char *hdr, off_t off)
1565 rbuf[0] = off & GOT_DELTA_SIZE_VAL_MASK;
1566 for (i = 1; (off >>= GOT_DELTA_SIZE_SHIFT) != 0; i++) {
1567 rbuf[i] = (--off & GOT_DELTA_SIZE_VAL_MASK) |
1568 GOT_DELTA_SIZE_MORE;
1573 hdr[j++] = rbuf[--i];
1577 static const struct got_error *
1578 deltahdr(off_t *packfile_size, SHA1_CTX *ctx, FILE *packfile,
1579 struct got_pack_meta *m)
1581 const struct got_error *err;
1585 if (m->prev->off != 0) {
1586 err = packhdr(&nh, buf, sizeof(buf),
1587 GOT_OBJ_TYPE_OFFSET_DELTA, m->delta_len);
1590 nh += packoff(buf + nh, m->off - m->prev->off);
1591 err = hwrite(packfile, buf, nh, ctx);
1594 *packfile_size += nh;
1596 err = packhdr(&nh, buf, sizeof(buf),
1597 GOT_OBJ_TYPE_REF_DELTA, m->delta_len);
1600 err = hwrite(packfile, buf, nh, ctx);
1603 *packfile_size += nh;
1604 err = hwrite(packfile, m->prev->id.sha1,
1605 sizeof(m->prev->id.sha1), ctx);
1608 *packfile_size += sizeof(m->prev->id.sha1);
1614 static const struct got_error *
1615 write_packed_object(off_t *packfile_size, FILE *packfile,
1616 FILE *delta_cache, struct got_pack_meta *m, int *outfd,
1617 SHA1_CTX *ctx, struct got_repository *repo)
1619 const struct got_error *err = NULL;
1620 struct got_deflate_checksum csum;
1623 struct got_raw_object *raw = NULL;
1626 csum.output_sha1 = ctx;
1627 csum.output_crc = NULL;
1629 m->off = ftello(packfile);
1630 if (m->delta_len == 0) {
1631 err = got_object_raw_open(&raw, outfd, repo, &m->id);
1634 err = packhdr(&nh, buf, sizeof(buf),
1635 m->obj_type, raw->size);
1638 err = hwrite(packfile, buf, nh, ctx);
1641 *packfile_size += nh;
1642 if (raw->f == NULL) {
1643 err = got_deflate_to_file_mmap(&outlen,
1644 raw->data + raw->hdrlen, 0, raw->size,
1649 if (fseeko(raw->f, raw->hdrlen, SEEK_SET)
1651 err = got_error_from_errno("fseeko");
1654 err = got_deflate_to_file(&outlen, raw->f,
1655 raw->size, packfile, &csum);
1659 *packfile_size += outlen;
1660 got_object_raw_close(raw);
1662 } else if (m->delta_buf) {
1663 err = deltahdr(packfile_size, ctx, packfile, m);
1666 err = got_deflate_to_file_mmap(&outlen,
1667 m->delta_buf, 0, m->delta_len, packfile, &csum);
1670 *packfile_size += outlen;
1672 m->delta_buf = NULL;
1674 if (fseeko(delta_cache, m->delta_offset, SEEK_SET)
1676 err = got_error_from_errno("fseeko");
1679 err = deltahdr(packfile_size, ctx, packfile, m);
1682 err = got_deflate_to_file(&outlen, delta_cache,
1683 m->delta_len, packfile, &csum);
1686 *packfile_size += outlen;
1690 got_object_raw_close(raw);
1694 static const struct got_error *
1695 genpack(uint8_t *pack_sha1, FILE *packfile, FILE *delta_cache,
1696 struct got_pack_meta **deltify, int ndeltify,
1697 struct got_pack_meta **reuse, int nreuse,
1698 int ncolored, int nfound, int ntrees, int nours,
1699 struct got_repository *repo,
1700 got_pack_progress_cb progress_cb, void *progress_arg,
1701 struct got_ratelimit *rl,
1702 got_cancel_cb cancel_cb, void *cancel_arg)
1704 const struct got_error *err = NULL;
1707 struct got_pack_meta *m;
1710 off_t packfile_size = 0;
1715 err = hwrite(packfile, "PACK", 4, &ctx);
1718 putbe32(buf, GOT_PACKFILE_VERSION);
1719 err = hwrite(packfile, buf, 4, &ctx);
1722 putbe32(buf, ndeltify + nreuse);
1723 err = hwrite(packfile, buf, 4, &ctx);
1727 qsort(deltify, ndeltify, sizeof(struct got_pack_meta *),
1729 for (i = 0; i < ndeltify; i++) {
1730 err = report_progress(progress_cb, progress_arg, rl,
1731 ncolored, nfound, ntrees, packfile_size, nours,
1732 ndeltify + nreuse, ndeltify + nreuse, i);
1736 err = write_packed_object(&packfile_size, packfile,
1737 delta_cache, m, &outfd, &ctx, repo);
1742 qsort(reuse, nreuse, sizeof(struct got_pack_meta *),
1743 reuse_write_order_cmp);
1744 for (i = 0; i < nreuse; i++) {
1745 err = report_progress(progress_cb, progress_arg, rl,
1746 ncolored, nfound, ntrees, packfile_size, nours,
1747 ndeltify + nreuse, ndeltify + nreuse, ndeltify + i);
1751 err = write_packed_object(&packfile_size, packfile,
1752 delta_cache, m, &outfd, &ctx, repo);
1757 SHA1Final(pack_sha1, &ctx);
1758 n = fwrite(pack_sha1, 1, SHA1_DIGEST_LENGTH, packfile);
1759 if (n != SHA1_DIGEST_LENGTH)
1760 err = got_ferror(packfile, GOT_ERR_IO);
1761 packfile_size += SHA1_DIGEST_LENGTH;
1762 packfile_size += sizeof(struct got_packfile_hdr);
1764 err = progress_cb(progress_arg, ncolored, nfound, ntrees,
1765 packfile_size, nours, ndeltify + nreuse,
1766 ndeltify + nreuse, ndeltify + nreuse);
1771 if (outfd != -1 && close(outfd) == -1 && err == NULL)
1772 err = got_error_from_errno("close");
1776 static const struct got_error *
1777 remove_unused_object(struct got_object_idset_element *entry, void *arg)
1779 struct got_object_idset *idset = arg;
1781 if (got_object_idset_get_element_data(entry) == NULL)
1782 got_object_idset_remove_element(idset, entry);
1787 static const struct got_error *
1788 remove_reused_object(struct got_object_idset_element *entry, void *arg)
1790 struct got_object_idset *idset = arg;
1791 struct got_pack_meta *m;
1793 m = got_object_idset_get_element_data(entry);
1794 if (m->have_reused_delta)
1795 got_object_idset_remove_element(idset, entry);
1800 static const struct got_error *
1801 add_meta_idset_cb(struct got_object_id *id, void *data, void *arg)
1803 struct got_pack_meta *m = data;
1804 struct got_pack_metavec *v = arg;
1806 return add_meta(m, v);
1809 const struct got_error *
1810 got_pack_create(uint8_t *packsha1, FILE *packfile,
1811 struct got_object_id **theirs, int ntheirs,
1812 struct got_object_id **ours, int nours,
1813 struct got_repository *repo, int loose_obj_only, int allow_empty,
1814 got_pack_progress_cb progress_cb, void *progress_arg,
1815 got_cancel_cb cancel_cb, void *cancel_arg)
1817 const struct got_error *err;
1818 int delta_cache_fd = -1;
1819 FILE *delta_cache = NULL;
1820 struct got_object_idset *idset;
1821 struct got_ratelimit rl;
1822 struct got_pack_metavec deltify, reuse;
1823 int ncolored = 0, nfound = 0, ntrees = 0;
1825 memset(&deltify, 0, sizeof(deltify));
1826 memset(&reuse, 0, sizeof(reuse));
1828 got_ratelimit_init(&rl, 0, 500);
1830 idset = got_object_idset_alloc();
1832 return got_error_from_errno("got_object_idset_alloc");
1834 err = load_object_ids(&ncolored, &nfound, &ntrees, idset, theirs,
1835 ntheirs, ours, nours, repo, loose_obj_only,
1836 progress_cb, progress_arg, &rl, cancel_cb, cancel_arg);
1840 err = got_object_idset_for_each_element(idset,
1841 remove_unused_object, idset);
1846 err = progress_cb(progress_arg, ncolored, nfound, ntrees,
1847 0L, nours, got_object_idset_num_elements(idset), 0, 0);
1852 if (got_object_idset_num_elements(idset) == 0 && !allow_empty) {
1853 err = got_error(GOT_ERR_CANNOT_PACK);
1857 delta_cache_fd = got_opentempfd();
1858 if (delta_cache_fd == -1) {
1859 err = got_error_from_errno("got_opentemp");
1864 reuse.meta = calloc(reuse.metasz,
1865 sizeof(struct got_pack_meta *));
1866 if (reuse.meta == NULL) {
1867 err = got_error_from_errno("calloc");
1871 err = search_deltas(&reuse, idset, delta_cache_fd, ncolored, nfound,
1872 ntrees, nours, repo, progress_cb, progress_arg, &rl,
1873 cancel_cb, cancel_arg);
1876 if (reuse.nmeta > 0) {
1877 err = got_object_idset_for_each_element(idset,
1878 remove_reused_object, idset);
1883 delta_cache = fdopen(delta_cache_fd, "a+");
1884 if (delta_cache == NULL) {
1885 err = got_error_from_errno("fdopen");
1888 delta_cache_fd = -1;
1890 if (fseeko(delta_cache, 0L, SEEK_END) == -1) {
1891 err = got_error_from_errno("fseeko");
1895 deltify.meta = calloc(got_object_idset_num_elements(idset),
1896 sizeof(struct got_pack_meta *));
1897 if (deltify.meta == NULL) {
1898 err = got_error_from_errno("calloc");
1901 deltify.metasz = got_object_idset_num_elements(idset);
1903 err = got_object_idset_for_each(idset, add_meta_idset_cb, &deltify);
1906 if (deltify.nmeta > 0) {
1907 err = pick_deltas(deltify.meta, deltify.nmeta, ncolored,
1908 nfound, ntrees, nours, reuse.nmeta, delta_cache, repo,
1909 progress_cb, progress_arg, &rl, cancel_cb, cancel_arg);
1912 if (fseeko(delta_cache, 0L, SEEK_SET) == -1) {
1913 err = got_error_from_errno("fseeko");
1918 err = genpack(packsha1, packfile, delta_cache, deltify.meta,
1919 deltify.nmeta, reuse.meta, reuse.nmeta, ncolored, nfound, ntrees,
1920 nours, repo, progress_cb, progress_arg, &rl,
1921 cancel_cb, cancel_arg);
1925 free_nmeta(deltify.meta, deltify.nmeta);
1926 free_nmeta(reuse.meta, reuse.nmeta);
1927 got_object_idset_free(idset);
1928 if (delta_cache_fd != -1 && close(delta_cache_fd) == -1 && err == NULL)
1929 err = got_error_from_errno("close");
1930 if (delta_cache && fclose(delta_cache) == EOF && err == NULL)
1931 err = got_error_from_errno("fclose");