1 /*
2  * Copyright (c) 2020 Ori Bernstein
3  * Copyright (c) 2021 Stefan Sperling <stsp@openbsd.org>
4  *
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.
8  *
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.
16  */
17 
18 #include <sys/types.h>
19 #include <sys/uio.h>
20 #include <sys/stat.h>
21 #include <sys/time.h>
22 #include <sys/mman.h>
23 
24 #include <errno.h>
25 #include <stdint.h>
26 #include <stdio.h>
27 #include <stdlib.h>
28 #include <string.h>
29 #include <time.h>
30 #include <unistd.h>
31 #include <limits.h>
32 #include <zlib.h>
33 
34 #if defined(__FreeBSD__)
35 #include <unistd.h>
36 #endif
37 
38 #include "got_error.h"
39 #include "got_cancel.h"
40 #include "got_object.h"
41 #include "got_path.h"
42 #include "got_reference.h"
43 #include "got_repository_admin.h"
44 #include "got_opentemp.h"
45 
46 #include "got_lib_deltify.h"
47 #include "got_lib_delta.h"
48 #include "got_lib_object.h"
49 #include "got_lib_object_idset.h"
50 #include "got_lib_object_cache.h"
51 #include "got_lib_deflate.h"
52 #include "got_lib_pack.h"
53 #include "got_lib_pack_create.h"
54 #include "got_lib_privsep.h"
55 #include "got_lib_repository.h"
56 #include "got_lib_ratelimit.h"
57 #include "got_lib_inflate.h"
58 
59 #include "murmurhash2.h"
60 
61 #ifndef MIN
62 #define	MIN(_a,_b) ((_a) < (_b) ? (_a) : (_b))
63 #endif
64 
65 #ifndef MAX
66 #define	MAX(_a,_b) ((_a) > (_b) ? (_a) : (_b))
67 #endif
68 
69 #ifndef nitems
70 #define nitems(_a)	(sizeof((_a)) / sizeof((_a)[0]))
71 #endif
72 
73 struct got_pack_meta {
74 	struct got_object_id id;
75 	uint32_t path_hash;
76 	int	obj_type;
77 	off_t	size;
78 	time_t	mtime;
79 
80 	/* The best delta we picked */
81 	struct got_pack_meta *head;
82 	struct got_pack_meta *prev;
83 	unsigned char *delta_buf; /* if encoded in memory (compressed) */
84 	off_t	delta_offset;	/* offset in delta cache file (compressed) */
85 	off_t	delta_len;	/* encoded delta length */
86 	off_t	delta_compressed_len; /* encoded+compressed delta length */
87 	int	nchain;
88 
89 	off_t   reused_delta_offset; /* offset of delta in reused pack file */
90 	struct got_object_id *base_obj_id;
91 
92 	/* Only used for delta window */
93 	struct got_delta_table *dtab;
94 
95 	/* Only used for writing offset deltas */
96 	off_t	off;
97 };
98 
99 struct got_pack_metavec {
100 	struct got_pack_meta **meta;
101 	int nmeta;
102 	int metasz;
103 };
104 
105 static const struct got_error *
106 alloc_meta(struct got_pack_meta **new, struct got_object_id *id,
107     const char *path, int obj_type, time_t mtime, uint32_t seed)
108 {
109 	struct got_pack_meta *m;
110 
111 	*new = NULL;
112 
113 	m = calloc(1, sizeof(*m));
114 	if (m == NULL)
115 		return got_error_from_errno("calloc");
116 
117 	memcpy(&m->id, id, sizeof(m->id));
118 
119 	m->path_hash = murmurhash2(path, strlen(path), seed);
120 	m->obj_type = obj_type;
121 	m->mtime = mtime;
122 	*new = m;
123 	return NULL;
124 }
125 
126 static void
127 clear_meta(struct got_pack_meta *meta)
128 {
129 	if (meta == NULL)
130 		return;
131 	meta->path_hash = 0;
132 	free(meta->delta_buf);
133 	meta->delta_buf = NULL;
134 	free(meta->base_obj_id);
135 	meta->base_obj_id = NULL;
136 	meta->reused_delta_offset = 0;
137 }
138 
139 static void
140 free_nmeta(struct got_pack_meta **meta, int nmeta)
141 {
142 	int i;
143 
144 	for (i = 0; i < nmeta; i++)
145 		clear_meta(meta[i]);
146 	free(meta);
147 }
148 
149 static int
150 delta_order_cmp(const void *pa, const void *pb)
151 {
152 	struct got_pack_meta *a, *b;
153 
154 	a = *(struct got_pack_meta **)pa;
155 	b = *(struct got_pack_meta **)pb;
156 
157 	if (a->obj_type != b->obj_type)
158 		return a->obj_type - b->obj_type;
159 	if (a->path_hash < b->path_hash)
160 		return -1;
161 	if (a->path_hash > b->path_hash)
162 		return 1;
163 	if (a->mtime < b->mtime)
164 		return -1;
165 	if (a->mtime > b->mtime)
166 		return 1;
167 	return got_object_id_cmp(&a->id, &b->id);
168 }
169 
170 static off_t
171 delta_size(struct got_delta_instruction *deltas, int ndeltas)
172 {
173 	int i;
174 	off_t size = 32;
175 	for (i = 0; i < ndeltas; i++) {
176 		if (deltas[i].copy)
177 			size += GOT_DELTA_SIZE_SHIFT;
178 		else
179 			size += deltas[i].len + 1;
180 	}
181 	return size;
182 }
183 
184 static const struct got_error *
185 append(unsigned char **p, size_t *len, off_t *sz, void *seg, int nseg)
186 {
187 	char *n;
188 
189 	if (*len + nseg >= *sz) {
190 		while (*len + nseg >= *sz)
191 			*sz += *sz / 2;
192 		n = realloc(*p, *sz);
193 		if (n == NULL)
194 			return got_error_from_errno("realloc");
195 		*p = n;
196 	}
197 	memcpy(*p + *len, seg, nseg);
198 	*len += nseg;
199 	return NULL;
200 }
201 
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)
206 {
207 	const struct got_error *err;
208 	unsigned char buf[16], *bp;
209 	int i, j;
210 	size_t len = 0, compressed_len;
211 	off_t bufsize = delta_size;
212 	off_t n;
213 	struct got_delta_instruction *d;
214 	uint8_t *delta_buf;
215 
216 	delta_buf = malloc(bufsize);
217 	if (delta_buf == NULL)
218 		return got_error_from_errno("malloc");
219 
220 	/* base object size */
221 	buf[0] = base_size & GOT_DELTA_SIZE_VAL_MASK;
222 	n = base_size >> GOT_DELTA_SIZE_SHIFT;
223 	for (i = 1; n > 0; i++) {
224 		buf[i - 1] |= GOT_DELTA_SIZE_MORE;
225 		buf[i] = n & GOT_DELTA_SIZE_VAL_MASK;
226 		n >>= GOT_DELTA_SIZE_SHIFT;
227 	}
228 	err = append(&delta_buf, &len, &bufsize, buf, i);
229 	if (err)
230 		goto done;
231 
232 	/* target object size */
233 	buf[0] = o->size & GOT_DELTA_SIZE_VAL_MASK;
234 	n = o->size >> GOT_DELTA_SIZE_SHIFT;
235 	for (i = 1; n > 0; i++) {
236 		buf[i - 1] |= GOT_DELTA_SIZE_MORE;
237 		buf[i] = n & GOT_DELTA_SIZE_VAL_MASK;
238 		n >>= GOT_DELTA_SIZE_SHIFT;
239 	}
240 	err = append(&delta_buf, &len, &bufsize, buf, i);
241 	if (err)
242 		goto done;
243 
244 	for (j = 0; j < ndeltas; j++) {
245 		d = &deltas[j];
246 		if (d->copy) {
247 			n = d->offset;
248 			bp = &buf[1];
249 			buf[0] = GOT_DELTA_BASE_COPY;
250 			for (i = 0; i < 4; i++) {
251 				/* DELTA_COPY_OFF1 ... DELTA_COPY_OFF4 */
252 				buf[0] |= 1 << i;
253 				*bp++ = n & 0xff;
254 				n >>= 8;
255 				if (n == 0)
256 					break;
257 			}
258 
259 			n = d->len;
260 			if (n != GOT_DELTA_COPY_DEFAULT_LEN) {
261 				/* DELTA_COPY_LEN1 ... DELTA_COPY_LEN3 */
262 				for (i = 0; i < 3 && n > 0; i++) {
263 					buf[0] |= 1 << (i + 4);
264 					*bp++ = n & 0xff;
265 					n >>= 8;
266 				}
267 			}
268 			err = append(&delta_buf, &len, &bufsize,
269 			    buf, bp - buf);
270 			if (err)
271 				goto done;
272 		} else if (o->f == NULL) {
273 			n = 0;
274 			while (n != d->len) {
275 				buf[0] = (d->len - n < 127) ? d->len - n : 127;
276 				err = append(&delta_buf, &len, &bufsize,
277 				    buf, 1);
278 				if (err)
279 					goto done;
280 				err = append(&delta_buf, &len, &bufsize,
281 				    o->data + o->hdrlen + d->offset + n,
282 				    buf[0]);
283 				if (err)
284 					goto done;
285 				n += buf[0];
286 			}
287 		} else {
288 			char content[128];
289 			size_t r;
290 			if (fseeko(o->f, o->hdrlen + d->offset, SEEK_SET) == -1) {
291 				err = got_error_from_errno("fseeko");
292 				goto done;
293 			}
294 			n = 0;
295 			while (n != d->len) {
296 				buf[0] = (d->len - n < 127) ? d->len - n : 127;
297 				err = append(&delta_buf, &len, &bufsize,
298 				    buf, 1);
299 				if (err)
300 					goto done;
301 				r = fread(content, 1, buf[0], o->f);
302 				if (r != buf[0]) {
303 					err = got_ferror(o->f, GOT_ERR_IO);
304 					goto done;
305 				}
306 				err = append(&delta_buf, &len, &bufsize,
307 				    content, buf[0]);
308 				if (err)
309 					goto done;
310 				n += buf[0];
311 			}
312 		}
313 	}
314 
315 	err = got_deflate_to_mem_mmap(&m->delta_buf, &compressed_len,
316 	    NULL, NULL, delta_buf, 0, len);
317 	if (err)
318 		goto done;
319 
320 	m->delta_len = len;
321 	m->delta_compressed_len = compressed_len;
322 done:
323 	free(delta_buf);
324 	return err;
325 }
326 
327 static const struct got_error *
328 encode_delta(struct got_pack_meta *m, struct got_raw_object *o,
329     struct got_delta_instruction *deltas, int ndeltas,
330     off_t base_size, FILE *f)
331 {
332 	const struct got_error *err;
333 	unsigned char buf[16], *bp;
334 	int i, j;
335 	off_t n;
336 	struct got_deflate_buf zb;
337 	struct got_delta_instruction *d;
338 	off_t delta_len = 0, compressed_len = 0;
339 
340 	err = got_deflate_init(&zb, NULL, GOT_DEFLATE_BUFSIZE);
341 	if (err)
342 		return err;
343 
344 	/* base object size */
345 	buf[0] = base_size & GOT_DELTA_SIZE_VAL_MASK;
346 	n = base_size >> GOT_DELTA_SIZE_SHIFT;
347 	for (i = 1; n > 0; i++) {
348 		buf[i - 1] |= GOT_DELTA_SIZE_MORE;
349 		buf[i] = n & GOT_DELTA_SIZE_VAL_MASK;
350 		n >>= GOT_DELTA_SIZE_SHIFT;
351 	}
352 
353 	err = got_deflate_append_to_file_mmap(&zb, &compressed_len,
354 	    buf, 0, i, f, NULL);
355 	if (err)
356 		goto done;
357 	delta_len += i;
358 
359 	/* target object size */
360 	buf[0] = o->size & GOT_DELTA_SIZE_VAL_MASK;
361 	n = o->size >> GOT_DELTA_SIZE_SHIFT;
362 	for (i = 1; n > 0; i++) {
363 		buf[i - 1] |= GOT_DELTA_SIZE_MORE;
364 		buf[i] = n & GOT_DELTA_SIZE_VAL_MASK;
365 		n >>= GOT_DELTA_SIZE_SHIFT;
366 	}
367 
368 	err = got_deflate_append_to_file_mmap(&zb, &compressed_len,
369 	    buf, 0, i, f, NULL);
370 	if (err)
371 		goto done;
372 	delta_len += i;
373 
374 	for (j = 0; j < ndeltas; j++) {
375 		d = &deltas[j];
376 		if (d->copy) {
377 			n = d->offset;
378 			bp = &buf[1];
379 			buf[0] = GOT_DELTA_BASE_COPY;
380 			for (i = 0; i < 4; i++) {
381 				/* DELTA_COPY_OFF1 ... DELTA_COPY_OFF4 */
382 				buf[0] |= 1 << i;
383 				*bp++ = n & 0xff;
384 				n >>= 8;
385 				if (n == 0)
386 					break;
387 			}
388 			n = d->len;
389 			if (n != GOT_DELTA_COPY_DEFAULT_LEN) {
390 				/* DELTA_COPY_LEN1 ... DELTA_COPY_LEN3 */
391 				for (i = 0; i < 3 && n > 0; i++) {
392 					buf[0] |= 1 << (i + 4);
393 					*bp++ = n & 0xff;
394 					n >>= 8;
395 				}
396 			}
397 			err = got_deflate_append_to_file_mmap(&zb,
398 			    &compressed_len, buf, 0, bp - buf, f, NULL);
399 			if (err)
400 				goto done;
401 			delta_len += (bp - buf);
402 		} else if (o->f == NULL) {
403 			n = 0;
404 			while (n != d->len) {
405 				buf[0] = (d->len - n < 127) ? d->len - n : 127;
406 				err = got_deflate_append_to_file_mmap(&zb,
407 				    &compressed_len, buf, 0, 1, f, NULL);
408 				if (err)
409 					goto done;
410 				delta_len++;
411 				err = got_deflate_append_to_file_mmap(&zb,
412 				    &compressed_len,
413 				    o->data + o->hdrlen + d->offset + n, 0,
414 				    buf[0], f, NULL);
415 				if (err)
416 					goto done;
417 				delta_len += buf[0];
418 				n += buf[0];
419 			}
420 		} else {
421 			char content[128];
422 			size_t r;
423 			if (fseeko(o->f, o->hdrlen + d->offset, SEEK_SET) == -1) {
424 				err = got_error_from_errno("fseeko");
425 				goto done;
426 			}
427 			n = 0;
428 			while (n != d->len) {
429 				buf[0] = (d->len - n < 127) ? d->len - n : 127;
430 				err = got_deflate_append_to_file_mmap(&zb,
431 				    &compressed_len, buf, 0, 1, f, NULL);
432 				if (err)
433 					goto done;
434 				delta_len++;
435 				r = fread(content, 1, buf[0], o->f);
436 				if (r != buf[0]) {
437 					err = got_ferror(o->f, GOT_ERR_IO);
438 					goto done;
439 				}
440 				err = got_deflate_append_to_file_mmap(&zb,
441 				    &compressed_len, content, 0, buf[0], f,
442 				    NULL);
443 				if (err)
444 					goto done;
445 				delta_len += buf[0];
446 				n += buf[0];
447 			}
448 		}
449 	}
450 
451 	err = got_deflate_flush(&zb, f, NULL, &compressed_len);
452 	if (err)
453 		goto done;
454 
455 	/* sanity check */
456 	if (compressed_len != ftello(f) - m->delta_offset) {
457 		err = got_error(GOT_ERR_COMPRESSION);
458 		goto done;
459 	}
460 
461 	m->delta_len = delta_len;
462 	m->delta_compressed_len = compressed_len;
463 done:
464 	got_deflate_end(&zb);
465 	return err;
466 }
467 
468 static const struct got_error *
469 report_progress(got_pack_progress_cb progress_cb, void *progress_arg,
470     struct got_ratelimit *rl, int ncolored, int nfound, int ntrees,
471     off_t packfile_size, int ncommits, int nobj_total, int obj_deltify,
472     int nobj_written)
473 {
474 	const struct got_error *err;
475 	int elapsed;
476 
477 	if (progress_cb == NULL)
478 		return NULL;
479 
480 	err = got_ratelimit_check(&elapsed, rl);
481 	if (err || !elapsed)
482 		return err;
483 
484 	return progress_cb(progress_arg, ncolored, nfound, ntrees,
485 	    packfile_size, ncommits, nobj_total, obj_deltify, nobj_written);
486 }
487 
488 static const struct got_error *
489 add_meta(struct got_pack_meta *m, struct got_pack_metavec *v)
490 {
491 	if (v->nmeta == v->metasz){
492 		size_t newsize = 2 * v->metasz;
493 		struct got_pack_meta **new;
494 		new = reallocarray(v->meta, newsize, sizeof(*new));
495 		if (new == NULL)
496 			return got_error_from_errno("reallocarray");
497 		v->meta = new;
498 		v->metasz = newsize; 
499 	}
500 
501 	v->meta[v->nmeta++] = m;
502 	return NULL;
503 }
504 
505 static const struct got_error *
506 find_pack_for_reuse(struct got_packidx **best_packidx,
507     struct got_repository *repo)
508 {
509 	const struct got_error *err = NULL;
510 	struct got_pathlist_entry *pe;
511 	const char *best_packidx_path = NULL;
512 	int nobj_max = 0;
513 
514 	*best_packidx = NULL;
515 
516 	TAILQ_FOREACH(pe, &repo->packidx_paths, entry) {
517 		const char *path_packidx = pe->path;
518 		struct got_packidx *packidx;
519 		int nobj;
520 
521 		err = got_repo_get_packidx(&packidx, path_packidx, repo);
522 		if (err)
523 			break;
524 
525 		nobj = be32toh(packidx->hdr.fanout_table[0xff]);
526 		if (nobj > nobj_max) {
527 			best_packidx_path = path_packidx;
528 			nobj_max = nobj;
529 		}
530 	}
531 
532 	if (best_packidx_path) {
533 		err = got_repo_get_packidx(best_packidx, best_packidx_path,
534 		    repo);
535 	}
536 
537 	return err;
538 }
539 
540 struct send_id_arg {
541 	struct imsgbuf *ibuf;
542 	struct got_object_id *ids[GOT_IMSG_OBJ_ID_LIST_MAX_NIDS];
543 	size_t nids;
544 };
545 
546 static const struct got_error *
547 send_id(struct got_object_id *id, void *data, void *arg)
548 {
549 	const struct got_error *err = NULL;
550 	struct send_id_arg *a = arg;
551 
552 	a->ids[a->nids++] = id;
553 
554 	if (a->nids >= GOT_IMSG_OBJ_ID_LIST_MAX_NIDS) {
555 		err = got_privsep_send_object_idlist(a->ibuf, a->ids, a->nids);
556 		if (err)
557 			return err;
558 		a->nids = 0;
559 	}
560 
561 	return NULL;
562 }
563 
564 static const struct got_error *
565 recv_reused_delta(struct got_imsg_reused_delta *delta,
566     struct got_object_idset *idset, struct got_pack_metavec *v)
567 {
568 	struct got_pack_meta *m, *base;
569 
570 	if (delta->delta_offset + delta->delta_size < delta->delta_offset ||
571 	    delta->delta_offset +
572 	    delta->delta_compressed_size < delta->delta_offset)
573 		return got_error(GOT_ERR_BAD_PACKFILE);
574 
575 	m = got_object_idset_get(idset, &delta->id);
576 	if (m == NULL)
577 		return got_error(GOT_ERR_NO_OBJ);
578 
579 	base = got_object_idset_get(idset, &delta->base_id);
580 	if (base == NULL)
581 		return got_error(GOT_ERR_NO_OBJ);
582 
583 	m->delta_len = delta->delta_size;
584 	m->delta_compressed_len = delta->delta_compressed_size;
585 	m->delta_offset = delta->delta_out_offset;
586 	m->prev = base;
587 	m->size = delta->result_size;
588 	m->reused_delta_offset = delta->delta_offset;
589 	m->base_obj_id = got_object_id_dup(&delta->base_id);
590 	if (m->base_obj_id == NULL)
591 		return got_error_from_errno("got_object_id_dup");
592 
593 	return add_meta(m, v);
594 }
595 
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)
602 {
603 	const struct got_error *err = NULL;
604 	struct got_packidx *packidx;
605 	struct got_pack *pack;
606 	struct send_id_arg sia;
607 	struct got_imsg_reused_delta deltas[GOT_IMSG_REUSED_DELTAS_MAX_NDELTAS];
608 	size_t ndeltas, i;
609 
610 	err = find_pack_for_reuse(&packidx, repo);
611 	if (err)
612 		return err;
613 
614 	if (packidx == NULL)
615 		return NULL;
616 
617 	err = got_object_prepare_delta_reuse(&pack, packidx,
618 	    delta_cache_fd, repo);
619 	if (err)
620 		return err;
621 
622 	memset(&sia, 0, sizeof(sia));
623 	sia.ibuf = pack->privsep_child->ibuf;
624 	err = got_object_idset_for_each(idset, send_id, &sia);
625 	if (err)
626 		return err;
627 	if (sia.nids > 0) {
628 		err = got_privsep_send_object_idlist(pack->privsep_child->ibuf,
629 		    sia.ids, sia.nids);
630 		if (err)
631 			return err;
632 	}
633 	err = got_privsep_send_object_idlist_done(pack->privsep_child->ibuf);
634 	if (err)
635 		return err;
636 
637 	for (;;) {
638 		int done = 0;
639 
640 		if (cancel_cb) {
641 			err = (*cancel_cb)(cancel_arg);
642 			if (err)
643 				break;
644 		}
645 
646 		err = got_privsep_recv_reused_deltas(&done, deltas, &ndeltas,
647 		    pack->privsep_child->ibuf);
648 		if (err || done)
649 			break;
650 
651 		for (i = 0; i < ndeltas; i++) {
652 			struct got_imsg_reused_delta *delta = &deltas[i];
653 			err = recv_reused_delta(delta, idset, v);
654 			if (err)
655 				goto done;
656 		}
657 
658 		err = report_progress(progress_cb, progress_arg, rl,
659 		    ncolored, nfound, ntrees, 0L, ncommits,
660 		    got_object_idset_num_elements(idset), v->nmeta, 0);
661 		if (err)
662 			break;
663 	}
664 done:
665 	return err;
666 }
667 
668 static const struct got_error *
669 pick_deltas(struct got_pack_meta **meta, int nmeta, int ncolored,
670     int nfound, int ntrees, int ncommits, int nreused, FILE *delta_cache,
671     struct got_repository *repo,
672     got_pack_progress_cb progress_cb, void *progress_arg,
673     struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
674 {
675 	const struct got_error *err = NULL;
676 	struct got_pack_meta *m = NULL, *base = NULL;
677 	struct got_raw_object *raw = NULL, *base_raw = NULL;
678 	struct got_delta_instruction *deltas = NULL, *best_deltas = NULL;
679 	int i, j, ndeltas, best_ndeltas;
680 	off_t size, best_size;
681 	const int max_base_candidates = 3;
682 	size_t delta_memsize = 0;
683 	const size_t max_delta_memsize = 4 * GOT_DELTA_RESULT_SIZE_CACHED_MAX;
684 	int outfd = -1;
685 	uint32_t delta_seed;
686 
687 	delta_seed = arc4random();
688 
689 	qsort(meta, nmeta, sizeof(struct got_pack_meta *), delta_order_cmp);
690 	for (i = 0; i < nmeta; i++) {
691 		if (cancel_cb) {
692 			err = (*cancel_cb)(cancel_arg);
693 			if (err)
694 				break;
695 		}
696 		err = report_progress(progress_cb, progress_arg, rl,
697 		    ncolored, nfound, ntrees, 0L, ncommits, nreused + nmeta,
698 		    nreused + i, 0);
699 		if (err)
700 			goto done;
701 		m = meta[i];
702 
703 		if (m->obj_type == GOT_OBJ_TYPE_COMMIT ||
704 		    m->obj_type == GOT_OBJ_TYPE_TAG)
705 			continue;
706 
707 		err = got_object_raw_open(&raw, &outfd, repo, &m->id);
708 		if (err)
709 			goto done;
710 		m->size = raw->size;
711 
712 		if (raw->f == NULL) {
713 			err = got_deltify_init_mem(&m->dtab, raw->data,
714 			    raw->hdrlen, raw->size + raw->hdrlen, delta_seed);
715 		} else {
716 			err = got_deltify_init(&m->dtab, raw->f, raw->hdrlen,
717 			    raw->size + raw->hdrlen, delta_seed);
718 		}
719 		if (err)
720 			goto done;
721 
722 		if (i > max_base_candidates) {
723 			struct got_pack_meta *n = NULL;
724 			n = meta[i - (max_base_candidates + 1)];
725 			got_deltify_free(n->dtab);
726 			n->dtab = NULL;
727 		}
728 
729 		best_size = raw->size;
730 		best_ndeltas = 0;
731 		for (j = MAX(0, i - max_base_candidates); j < i; j++) {
732 			if (cancel_cb) {
733 				err = (*cancel_cb)(cancel_arg);
734 				if (err)
735 					goto done;
736 			}
737 			base = meta[j];
738 			/* long chains make unpacking slow, avoid such bases */
739 			if (base->nchain >= 128 ||
740 			    base->obj_type != m->obj_type)
741 				continue;
742 
743 			err = got_object_raw_open(&base_raw, &outfd, repo,
744 			    &base->id);
745 			if (err)
746 				goto done;
747 
748 			if (raw->f == NULL && base_raw->f == NULL) {
749 				err = got_deltify_mem_mem(&deltas, &ndeltas,
750 				    raw->data, raw->hdrlen,
751 				    raw->size + raw->hdrlen, delta_seed,
752 				    base->dtab, base_raw->data,
753 				    base_raw->hdrlen,
754 				    base_raw->size + base_raw->hdrlen);
755 			} else if (raw->f == NULL) {
756 				err = got_deltify_mem_file(&deltas, &ndeltas,
757 				    raw->data, raw->hdrlen,
758 				    raw->size + raw->hdrlen, delta_seed,
759 				    base->dtab, base_raw->f,
760 				    base_raw->hdrlen,
761 				    base_raw->size + base_raw->hdrlen);
762 			} else if (base_raw->f == NULL) {
763 				err = got_deltify_file_mem(&deltas, &ndeltas,
764 				    raw->f, raw->hdrlen,
765 				    raw->size + raw->hdrlen, delta_seed,
766 				    base->dtab, base_raw->data,
767 				    base_raw->hdrlen,
768 				    base_raw->size + base_raw->hdrlen);
769 			} else {
770 				err = got_deltify(&deltas, &ndeltas,
771 				    raw->f, raw->hdrlen,
772 				    raw->size + raw->hdrlen, delta_seed,
773 				    base->dtab, base_raw->f, base_raw->hdrlen,
774 				    base_raw->size + base_raw->hdrlen);
775 			}
776 			got_object_raw_close(base_raw);
777 			base_raw = NULL;
778 			if (err)
779 				goto done;
780 
781 			size = delta_size(deltas, ndeltas);
782 			if (size + 32 < best_size){
783 				/*
784 				 * if we already picked a best delta,
785 				 * replace it.
786 				 */
787 				best_size = size;
788 				free(best_deltas);
789 				best_deltas = deltas;
790 				best_ndeltas = ndeltas;
791 				deltas = NULL;
792 				m->nchain = base->nchain + 1;
793 				m->prev = base;
794 				m->head = base->head;
795 				if (m->head == NULL)
796 					m->head = base;
797 			} else {
798 				free(deltas);
799 				deltas = NULL;
800 				ndeltas = 0;
801 			}
802 		}
803 
804 		if (best_ndeltas > 0) {
805 			if (best_size <= GOT_DELTA_RESULT_SIZE_CACHED_MAX &&
806 			    delta_memsize + best_size <= max_delta_memsize) {
807 				delta_memsize += best_size;
808 				err = encode_delta_in_mem(m, raw, best_deltas,
809 				    best_ndeltas, best_size, m->prev->size);
810 			} else {
811 				m->delta_offset = ftello(delta_cache);
812 				err = encode_delta(m, raw, best_deltas,
813 				    best_ndeltas, m->prev->size, delta_cache);
814 			}
815 			free(best_deltas);
816 			best_deltas = NULL;
817 			best_ndeltas = 0;
818 			if (err)
819 				goto done;
820 		}
821 
822 		got_object_raw_close(raw);
823 		raw = NULL;
824 	}
825 done:
826 	for (i = MAX(0, nmeta - max_base_candidates); i < nmeta; i++) {
827 		got_deltify_free(meta[i]->dtab);
828 		meta[i]->dtab = NULL;
829 	}
830 	if (raw)
831 		got_object_raw_close(raw);
832 	if (base_raw)
833 		got_object_raw_close(base_raw);
834 	if (outfd != -1 && close(outfd) == -1 && err == NULL)
835 		err = got_error_from_errno("close");
836 	free(deltas);
837 	free(best_deltas);
838 	return err;
839 }
840 
841 static const struct got_error *
842 search_packidx(int *found, struct got_object_id *id,
843     struct got_repository *repo)
844 {
845 	const struct got_error *err = NULL;
846 	struct got_packidx *packidx = NULL;
847 	int idx;
848 
849 	*found = 0;
850 
851 	err = got_repo_search_packidx(&packidx, &idx, repo, id);
852 	if (err == NULL)
853 		*found = 1; /* object is already packed */
854 	else if (err->code == GOT_ERR_NO_OBJ)
855 		err = NULL;
856 	return err;
857 }
858 
859 static const struct got_error *
860 add_object(int want_meta, struct got_object_idset *idset,
861     struct got_object_id *id, const char *path, int obj_type,
862     time_t mtime, uint32_t seed, int loose_obj_only,
863     struct got_repository *repo, int *ncolored, int *nfound, int *ntrees,
864     got_pack_progress_cb progress_cb, void *progress_arg,
865     struct got_ratelimit *rl)
866 {
867 	const struct got_error *err;
868 	struct got_pack_meta *m = NULL;
869 
870 	if (loose_obj_only) {
871 		int is_packed;
872 		err = search_packidx(&is_packed, id, repo);
873 		if (err)
874 			return err;
875 		if (is_packed && want_meta)
876 			return NULL;
877 	}
878 
879 	if (want_meta) {
880 		err = alloc_meta(&m, id, path, obj_type, mtime, seed);
881 		if (err)
882 			return err;
883 
884 		(*nfound)++;
885 		err = report_progress(progress_cb, progress_arg, rl,
886 		    *ncolored, *nfound, *ntrees, 0L, 0, 0, 0, 0);
887 		if (err) {
888 			clear_meta(m);
889 			free(m);
890 			return err;
891 		}
892 	}
893 
894 	err = got_object_idset_add(idset, id, m);
895 	if (err) {
896 		clear_meta(m);
897 		free(m);
898 	}
899 	return err;
900 }
901 
902 static const struct got_error *
903 load_tree_entries(struct got_object_id_queue *ids, int want_meta,
904     struct got_object_idset *idset, struct got_object_idset *idset_exclude,
905     struct got_tree_object *tree,
906     const char *dpath, time_t mtime, uint32_t seed, struct got_repository *repo,
907     int loose_obj_only, int *ncolored, int *nfound, int *ntrees,
908     got_pack_progress_cb progress_cb, void *progress_arg,
909     struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
910 {
911 	const struct got_error *err;
912 	char *p = NULL;
913 	int i;
914 
915 	(*ntrees)++;
916 	err = report_progress(progress_cb, progress_arg, rl,
917 	    *ncolored, *nfound, *ntrees, 0L, 0, 0, 0, 0);
918 	if (err)
919 		return err;
920 
921 	for (i = 0; i < got_object_tree_get_nentries(tree); i++) {
922 		struct got_tree_entry *e = got_object_tree_get_entry(tree, i);
923 		struct got_object_id *id = got_tree_entry_get_id(e);
924 		mode_t mode = got_tree_entry_get_mode(e);
925 
926 		if (cancel_cb) {
927 			err = (*cancel_cb)(cancel_arg);
928 			if (err)
929 				break;
930 		}
931 
932 		if (got_object_tree_entry_is_submodule(e) ||
933 		    got_object_idset_contains(idset, id) ||
934 		    got_object_idset_contains(idset_exclude, id))
935 			continue;
936 
937 		/*
938 		 * If got-read-pack is crawling trees for us then
939 		 * we are only here to collect blob IDs.
940 		 */
941 		if (ids == NULL && S_ISDIR(mode))
942 			continue;
943 
944 		if (asprintf(&p, "%s%s%s", dpath,
945 		    got_path_is_root_dir(dpath) ? "" : "/",
946 		    got_tree_entry_get_name(e)) == -1) {
947 			err = got_error_from_errno("asprintf");
948 			break;
949 		}
950 
951 		if (S_ISDIR(mode)) {
952 			struct got_object_qid *qid;
953 			err = got_object_qid_alloc(&qid, id);
954 			if (err)
955 				break;
956 			qid->data = p;
957 			p = NULL;
958 			STAILQ_INSERT_TAIL(ids, qid, entry);
959 		} else if (S_ISREG(mode) || S_ISLNK(mode)) {
960 			err = add_object(want_meta,
961 			    want_meta ? idset : idset_exclude, id, p,
962 			    GOT_OBJ_TYPE_BLOB, mtime, seed, loose_obj_only,
963 			    repo, ncolored, nfound, ntrees,
964 			    progress_cb, progress_arg, rl);
965 			if (err)
966 				break;
967 			free(p);
968 			p = NULL;
969 		} else {
970 			free(p);
971 			p = NULL;
972 		}
973 	}
974 
975 	free(p);
976 	return err;
977 }
978 
979 static const struct got_error *
980 load_tree(int want_meta, struct got_object_idset *idset,
981     struct got_object_idset *idset_exclude,
982     struct got_object_id *tree_id, const char *dpath, time_t mtime,
983     uint32_t seed, struct got_repository *repo, int loose_obj_only,
984     int *ncolored, int *nfound, int *ntrees,
985     got_pack_progress_cb progress_cb, void *progress_arg,
986     struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
987 {
988 	const struct got_error *err = NULL;
989 	struct got_object_id_queue tree_ids;
990 	struct got_object_qid *qid;
991 	struct got_tree_object *tree = NULL;
992 
993 	if (got_object_idset_contains(idset, tree_id) ||
994 	    got_object_idset_contains(idset_exclude, tree_id))
995 		return NULL;
996 
997 	err = got_object_qid_alloc(&qid, tree_id);
998 	if (err)
999 		return err;
1000 	qid->data = strdup(dpath);
1001 	if (qid->data == NULL) {
1002 		err = got_error_from_errno("strdup");
1003 		got_object_qid_free(qid);
1004 		return err;
1005 	}
1006 
1007 	STAILQ_INIT(&tree_ids);
1008 	STAILQ_INSERT_TAIL(&tree_ids, qid, entry);
1009 
1010 	while (!STAILQ_EMPTY(&tree_ids)) {
1011 		const char *path;
1012 		if (cancel_cb) {
1013 			err = (*cancel_cb)(cancel_arg);
1014 			if (err)
1015 				break;
1016 		}
1017 
1018 		qid = STAILQ_FIRST(&tree_ids);
1019 		STAILQ_REMOVE_HEAD(&tree_ids, entry);
1020 		path = qid->data;
1021 
1022 		if (got_object_idset_contains(idset, &qid->id) ||
1023 		    got_object_idset_contains(idset_exclude, &qid->id)) {
1024 			free(qid->data);
1025 			got_object_qid_free(qid);
1026 			continue;
1027 		}
1028 
1029 		err = add_object(want_meta, want_meta ? idset : idset_exclude,
1030 		    &qid->id, path, GOT_OBJ_TYPE_TREE,
1031 		    mtime, seed, loose_obj_only, repo,
1032 		    ncolored, nfound, ntrees, progress_cb, progress_arg, rl);
1033 		if (err) {
1034 			free(qid->data);
1035 			got_object_qid_free(qid);
1036 			break;
1037 		}
1038 
1039 		err = got_object_open_as_tree(&tree, repo, &qid->id);
1040 		if (err) {
1041 			free(qid->data);
1042 			got_object_qid_free(qid);
1043 			break;
1044 		}
1045 
1046 		err = load_tree_entries(&tree_ids, want_meta, idset,
1047 		    idset_exclude, tree, path, mtime, seed, repo,
1048 		    loose_obj_only, ncolored, nfound, ntrees,
1049 		    progress_cb, progress_arg, rl,
1050 		    cancel_cb, cancel_arg);
1051 		free(qid->data);
1052 		got_object_qid_free(qid);
1053 		if (err)
1054 			break;
1055 
1056 		got_object_tree_close(tree);
1057 		tree = NULL;
1058 	}
1059 
1060 	STAILQ_FOREACH(qid, &tree_ids, entry)
1061 		free(qid->data);
1062 	got_object_id_queue_free(&tree_ids);
1063 	if (tree)
1064 		got_object_tree_close(tree);
1065 	return err;
1066 }
1067 
1068 static const struct got_error *
1069 load_commit(int want_meta, struct got_object_idset *idset,
1070     struct got_object_idset *idset_exclude,
1071     struct got_object_id *id, struct got_repository *repo, uint32_t seed,
1072     int loose_obj_only, int *ncolored, int *nfound, int *ntrees,
1073     got_pack_progress_cb progress_cb, void *progress_arg,
1074     struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
1075 {
1076 	const struct got_error *err;
1077 	struct got_commit_object *commit;
1078 
1079 	if (got_object_idset_contains(idset, id) ||
1080 	    got_object_idset_contains(idset_exclude, id))
1081 		return NULL;
1082 
1083 	if (loose_obj_only) {
1084 		int is_packed;
1085 		err = search_packidx(&is_packed, id, repo);
1086 		if (err)
1087 			return err;
1088 		if (is_packed && want_meta)
1089 			return NULL;
1090 	}
1091 
1092 	err = got_object_open_as_commit(&commit, repo, id);
1093 	if (err)
1094 		return err;
1095 
1096 	err = add_object(want_meta, want_meta ? idset : idset_exclude,
1097 	    id, "", GOT_OBJ_TYPE_COMMIT,
1098 	    got_object_commit_get_committer_time(commit), seed,
1099 	    loose_obj_only, repo,
1100 	    ncolored, nfound, ntrees, progress_cb, progress_arg, rl);
1101 	if (err)
1102 		goto done;
1103 
1104 	err = load_tree(want_meta, idset, idset_exclude,
1105 	    got_object_commit_get_tree_id(commit),
1106 	    "", got_object_commit_get_committer_time(commit), seed,
1107 	    repo, loose_obj_only, ncolored, nfound, ntrees,
1108 	    progress_cb, progress_arg, rl, cancel_cb, cancel_arg);
1109 done:
1110 	got_object_commit_close(commit);
1111 	return err;
1112 }
1113 
1114 static const struct got_error *
1115 load_tag(int want_meta, struct got_object_idset *idset,
1116     struct got_object_idset *idset_exclude,
1117     struct got_object_id *id, struct got_repository *repo, uint32_t seed,
1118     int loose_obj_only, int *ncolored, int *nfound, int *ntrees,
1119     got_pack_progress_cb progress_cb, void *progress_arg,
1120     struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
1121 {
1122 	const struct got_error *err;
1123 	struct got_tag_object *tag = NULL;
1124 
1125 	if (got_object_idset_contains(idset, id) ||
1126 	    got_object_idset_contains(idset_exclude, id))
1127 		return NULL;
1128 
1129 	if (loose_obj_only) {
1130 		int is_packed;
1131 		err = search_packidx(&is_packed, id, repo);
1132 		if (err)
1133 			return err;
1134 		if (is_packed && want_meta)
1135 			return NULL;
1136 	}
1137 
1138 	err = got_object_open_as_tag(&tag, repo, id);
1139 	if (err)
1140 		return err;
1141 
1142 	err = add_object(want_meta, want_meta ? idset : idset_exclude,
1143 	    id, "", GOT_OBJ_TYPE_TAG,
1144 	    got_object_tag_get_tagger_time(tag), seed, loose_obj_only, repo,
1145 	    ncolored, nfound, ntrees, progress_cb, progress_arg, rl);
1146 	if (err)
1147 		goto done;
1148 
1149 	switch (got_object_tag_get_object_type(tag)) {
1150 	case GOT_OBJ_TYPE_COMMIT:
1151 		err = load_commit(want_meta, idset, idset_exclude,
1152 		    got_object_tag_get_object_id(tag), repo, seed,
1153 		    loose_obj_only, ncolored, nfound, ntrees,
1154 		    progress_cb, progress_arg, rl, cancel_cb, cancel_arg);
1155 		break;
1156 	case GOT_OBJ_TYPE_TREE:
1157 		err = load_tree(want_meta, idset, idset_exclude,
1158 		    got_object_tag_get_object_id(tag), "",
1159 		    got_object_tag_get_tagger_time(tag), seed, repo,
1160 		    loose_obj_only, ncolored, nfound, ntrees,
1161 		    progress_cb, progress_arg, rl, cancel_cb, cancel_arg);
1162 		break;
1163 	default:
1164 		break;
1165 	}
1166 
1167 done:
1168 	got_object_tag_close(tag);
1169 	return err;
1170 }
1171 
1172 enum findtwixt_color {
1173 	COLOR_KEEP = 0,
1174 	COLOR_DROP,
1175 	COLOR_BLANK,
1176 	COLOR_SKIP,
1177 };
1178 
1179 static const int findtwixt_colors[] = {
1180 	COLOR_KEEP,
1181 	COLOR_DROP,
1182 	COLOR_BLANK,
1183 	COLOR_SKIP,
1184 };
1185 
1186 static const struct got_error *
1187 paint_commit(struct got_object_qid *qid, int color)
1188 {
1189 	if (color < 0 || color >= nitems(findtwixt_colors))
1190 		return got_error(GOT_ERR_RANGE);
1191 
1192 	qid->data = (void *)&findtwixt_colors[color];
1193 	return NULL;
1194 }
1195 
1196 static const struct got_error *
1197 queue_commit_id(struct got_object_id_queue *ids, struct got_object_id *id,
1198     int color, struct got_repository *repo)
1199 {
1200 	const struct got_error *err;
1201 	struct got_object_qid *qid;
1202 
1203 	err = got_object_qid_alloc(&qid, id);
1204 	if (err)
1205 		return err;
1206 
1207 	STAILQ_INSERT_TAIL(ids, qid, entry);
1208 	return paint_commit(qid, color);
1209 }
1210 
1211 struct append_id_arg {
1212 	struct got_object_id **array;
1213 	int idx;
1214 	struct got_object_idset *drop;
1215 	struct got_object_idset *skip;
1216 };
1217 
1218 static const struct got_error *
1219 append_id(struct got_object_id *id, void *data, void *arg)
1220 {
1221 	struct append_id_arg *a = arg;
1222 
1223 	if (got_object_idset_contains(a->skip, id) ||
1224 	    got_object_idset_contains(a->drop, id))
1225 		return NULL;
1226 
1227 	a->array[++a->idx] = got_object_id_dup(id);
1228 	if (a->array[a->idx] == NULL)
1229 		return got_error_from_errno("got_object_id_dup");
1230 
1231 	return NULL;
1232 }
1233 
1234 static const struct got_error *
1235 queue_commit_or_tag_id(struct got_object_id *id, int color,
1236     struct got_object_id_queue *ids, struct got_repository *repo)
1237 {
1238 	const struct got_error *err;
1239 	struct got_tag_object *tag = NULL;
1240 	int obj_type;
1241 
1242 	err = got_object_get_type(&obj_type, repo, id);
1243 	if (err)
1244 		return err;
1245 
1246 	if (obj_type == GOT_OBJ_TYPE_TAG) {
1247 		err = got_object_open_as_tag(&tag, repo, id);
1248 		if (err)
1249 			return err;
1250 		obj_type = got_object_tag_get_object_type(tag);
1251 		id = got_object_tag_get_object_id(tag);
1252 	}
1253 
1254 	if (obj_type == GOT_OBJ_TYPE_COMMIT) {
1255 		err = queue_commit_id(ids, id, color, repo);
1256 		if (err)
1257 			goto done;
1258 	}
1259 done:
1260 	if (tag)
1261 		got_object_tag_close(tag);
1262 	return err;
1263 }
1264 
1265 static const struct got_error *
1266 paint_commits(int *ncolored, struct got_object_id_queue *ids, int nids,
1267     struct got_object_idset *keep, struct got_object_idset *drop,
1268     struct got_object_idset *skip, struct got_repository *repo,
1269     got_pack_progress_cb progress_cb, void *progress_arg,
1270     struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
1271 {
1272 	const struct got_error *err = NULL;
1273 	struct got_commit_object *commit = NULL;
1274 	const struct got_object_id_queue *parents;
1275 	struct got_object_qid *qid;
1276 	int nqueued = nids, nskip = 0;
1277 
1278 	while (!STAILQ_EMPTY(ids) && nskip != nqueued) {
1279 		int color;
1280 
1281 		if (cancel_cb) {
1282 			err = cancel_cb(cancel_arg);
1283 			if (err)
1284 				break;
1285 		}
1286 
1287 		qid = STAILQ_FIRST(ids);
1288 		STAILQ_REMOVE_HEAD(ids, entry);
1289 		nqueued--;
1290 		color = *((int *)qid->data);
1291 		if (color == COLOR_SKIP)
1292 			nskip--;
1293 
1294 		if (got_object_idset_contains(skip, &qid->id)) {
1295 			got_object_qid_free(qid);
1296 			continue;
1297 		}
1298 
1299 		switch (color) {
1300 		case COLOR_KEEP:
1301 			if (got_object_idset_contains(keep, &qid->id)) {
1302 				got_object_qid_free(qid);
1303 				continue;
1304 			}
1305 			if (got_object_idset_contains(drop, &qid->id)) {
1306 				err = paint_commit(qid, COLOR_SKIP);
1307 				if (err)
1308 					goto done;
1309 			} else
1310 				(*ncolored)++;
1311 			err = got_object_idset_add(keep, &qid->id, NULL);
1312 			if (err)
1313 				goto done;
1314 			break;
1315 		case COLOR_DROP:
1316 			if (got_object_idset_contains(drop, &qid->id)) {
1317 				got_object_qid_free(qid);
1318 				continue;
1319 			}
1320 			if (got_object_idset_contains(keep, &qid->id)) {
1321 				err = paint_commit(qid, COLOR_SKIP);
1322 				if (err)
1323 					goto done;
1324 			} else
1325 				(*ncolored)++;
1326 			err = got_object_idset_add(drop, &qid->id, NULL);
1327 			if (err)
1328 				goto done;
1329 			break;
1330 		case COLOR_SKIP:
1331 			if (!got_object_idset_contains(skip, &qid->id)) {
1332 				err = got_object_idset_add(skip, &qid->id,
1333 				    NULL);
1334 				if (err)
1335 					goto done;
1336 			}
1337 			break;
1338 		default:
1339 			/* should not happen */
1340 			err = got_error_fmt(GOT_ERR_NOT_IMPL,
1341 			    "%s invalid commit color %d", __func__, color);
1342 			goto done;
1343 		}
1344 
1345 		err = report_progress(progress_cb, progress_arg, rl,
1346 		    *ncolored, 0, 0, 0L, 0, 0, 0, 0);
1347 		if (err)
1348 			break;
1349 
1350 
1351 		err = got_object_open_as_commit(&commit, repo, &qid->id);
1352 		if (err)
1353 			break;
1354 
1355 		parents = got_object_commit_get_parent_ids(commit);
1356 		if (parents) {
1357 			struct got_object_qid *pid;
1358 			color = *((int *)qid->data);
1359 			STAILQ_FOREACH(pid, parents, entry) {
1360 				err = queue_commit_id(ids, &pid->id, color,
1361 				    repo);
1362 				if (err)
1363 					break;
1364 				nqueued++;
1365 				if (color == COLOR_SKIP)
1366 					nskip++;
1367 			}
1368 		}
1369 
1370 		got_object_commit_close(commit);
1371 		commit = NULL;
1372 		got_object_qid_free(qid);
1373 	}
1374 done:
1375 	if (commit)
1376 		got_object_commit_close(commit);
1377 	return err;
1378 }
1379 
1380 static const struct got_error *
1381 findtwixt(struct got_object_id ***res, int *nres, int *ncolored,
1382     struct got_object_id **head, int nhead,
1383     struct got_object_id **tail, int ntail,
1384     struct got_repository *repo,
1385     got_pack_progress_cb progress_cb, void *progress_arg,
1386     struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
1387 {
1388 	const struct got_error *err = NULL;
1389 	struct got_object_id_queue ids;
1390 	struct got_object_idset *keep, *drop, *skip = NULL;
1391 	int i, nkeep;
1392 
1393 	STAILQ_INIT(&ids);
1394 	*res = NULL;
1395 	*nres = 0;
1396 	*ncolored = 0;
1397 
1398 	keep = got_object_idset_alloc();
1399 	if (keep == NULL)
1400 		return got_error_from_errno("got_object_idset_alloc");
1401 
1402 	drop = got_object_idset_alloc();
1403 	if (drop == NULL) {
1404 		err = got_error_from_errno("got_object_idset_alloc");
1405 		goto done;
1406 	}
1407 
1408 	skip = got_object_idset_alloc();
1409 	if (skip == NULL) {
1410 		err = got_error_from_errno("got_object_idset_alloc");
1411 		goto done;
1412 	}
1413 
1414 	for (i = 0; i < nhead; i++) {
1415 		struct got_object_id *id = head[i];
1416 		if (id == NULL)
1417 			continue;
1418 		err = queue_commit_or_tag_id(id, COLOR_KEEP, &ids, repo);
1419 		if (err)
1420 			goto done;
1421 	}		
1422 
1423 	for (i = 0; i < ntail; i++) {
1424 		struct got_object_id *id = tail[i];
1425 		if (id == NULL)
1426 			continue;
1427 		err = queue_commit_or_tag_id(id, COLOR_DROP, &ids, repo);
1428 		if (err)
1429 			goto done;
1430 	}
1431 
1432 	err = paint_commits(ncolored, &ids, nhead + ntail,
1433 	    keep, drop, skip, repo, progress_cb, progress_arg, rl,
1434 	    cancel_cb, cancel_arg);
1435 	if (err)
1436 		goto done;
1437 
1438 	nkeep = got_object_idset_num_elements(keep);
1439 	if (nkeep > 0) {
1440 		struct append_id_arg arg;
1441 		arg.array = calloc(nkeep, sizeof(struct got_object_id *));
1442 		if (arg.array == NULL) {
1443 			err = got_error_from_errno("calloc");
1444 			goto done;
1445 		}
1446 		arg.idx = -1;
1447 		arg.skip = skip;
1448 		arg.drop = drop;
1449 		err = got_object_idset_for_each(keep, append_id, &arg);
1450 		if (err) {
1451 			free(arg.array);
1452 			goto done;
1453 		}
1454 		*res = arg.array;
1455 		*nres = arg.idx + 1;
1456 	}
1457 done:
1458 	got_object_idset_free(keep);
1459 	got_object_idset_free(drop);
1460 	if (skip)
1461 		got_object_idset_free(skip);
1462 	got_object_id_queue_free(&ids);
1463 	return err;
1464 }
1465 
1466 struct load_packed_obj_arg {
1467 	/* output parameters: */
1468 	struct got_object_id *id;
1469 	char *dpath;
1470 	time_t mtime;
1471 
1472 	/* input parameters: */
1473 	uint32_t seed;
1474 	int want_meta;
1475 	struct got_object_idset *idset;
1476 	struct got_object_idset *idset_exclude;
1477 	int loose_obj_only;
1478 	int *ncolored;
1479 	int *nfound;
1480 	int *ntrees;
1481 	got_pack_progress_cb progress_cb;
1482 	void *progress_arg;
1483 	struct got_ratelimit *rl;
1484 	got_cancel_cb cancel_cb;
1485 	void *cancel_arg;
1486 };
1487 
1488 static const struct got_error *
1489 load_packed_commit_id(void *arg, time_t mtime, struct got_object_id *id,
1490     struct got_repository *repo)
1491 {
1492 	struct load_packed_obj_arg *a = arg;
1493 
1494 	if (got_object_idset_contains(a->idset, id) ||
1495 	    got_object_idset_contains(a->idset_exclude, id))
1496 		return NULL;
1497 
1498 	return add_object(a->want_meta,
1499 	    a->want_meta ? a->idset : a->idset_exclude,
1500 	    id, "", GOT_OBJ_TYPE_COMMIT, mtime, a->seed, a->loose_obj_only,
1501 	    repo, a->ncolored, a->nfound, a->ntrees,
1502 	    a->progress_cb, a->progress_arg, a->rl);
1503 }
1504 
1505 static const struct got_error *
1506 load_packed_tree_ids(void *arg, struct got_tree_object *tree, time_t mtime,
1507     struct got_object_id *id, const char *dpath, struct got_repository *repo)
1508 {
1509 	const struct got_error *err;
1510 	struct load_packed_obj_arg *a = arg;
1511 	const char *relpath;
1512 
1513 	/*
1514 	 * When we receive a tree's ID and path but not the tree itself,
1515 	 * this tree object was not found in the pack file. This is the
1516 	 * last time we are being called for this optimized traversal.
1517 	 * Return from here and switch to loading objects the slow way.
1518 	 */
1519 	if (tree == NULL) {
1520 		free(a->id);
1521 		a->id = got_object_id_dup(id);
1522 		if (a->id == NULL) {
1523 			err = got_error_from_errno("got_object_id_dup");
1524 			free(a->dpath);
1525 			a->dpath = NULL;
1526 			return err;
1527 		}
1528 
1529 		free(a->dpath);
1530 		a->dpath = strdup(dpath);
1531 		if (a->dpath == NULL) {
1532 			err = got_error_from_errno("strdup");
1533 			free(a->id);
1534 			a->id = NULL;
1535 			return err;
1536 		}
1537 
1538 		a->mtime = mtime;
1539 		return NULL;
1540 	}
1541 
1542 	if (got_object_idset_contains(a->idset, id) ||
1543 	    got_object_idset_contains(a->idset_exclude, id))
1544 		return NULL;
1545 
1546 	relpath = dpath;
1547 	while (relpath[0] == '/')
1548 		relpath++;
1549 
1550 	err = add_object(a->want_meta,
1551 	    a->want_meta ? a->idset : a->idset_exclude,
1552 	    id, relpath, GOT_OBJ_TYPE_TREE, mtime, a->seed,
1553 	    a->loose_obj_only, repo, a->ncolored, a->nfound, a->ntrees,
1554 	    a->progress_cb, a->progress_arg, a->rl);
1555 	if (err)
1556 		return err;
1557 
1558 	return load_tree_entries(NULL, a->want_meta, a->idset,
1559 	    a->idset_exclude, tree, dpath, mtime, a->seed, repo,
1560 	    a->loose_obj_only, a->ncolored, a->nfound, a->ntrees,
1561 	    a->progress_cb, a->progress_arg, a->rl,
1562 	    a->cancel_cb, a->cancel_arg);
1563 }
1564 
1565 static const struct got_error *
1566 load_packed_object_ids(int *found_all_objects,
1567     struct got_object_id **ours, int nours,
1568     struct got_object_id **theirs, int ntheirs,
1569     int want_meta, uint32_t seed, struct got_object_idset *idset,
1570     struct got_object_idset *idset_exclude, int loose_obj_only,
1571     struct got_repository *repo, struct got_packidx *packidx,
1572     int *ncolored, int *nfound, int *ntrees,
1573     got_pack_progress_cb progress_cb, void *progress_arg,
1574     struct got_ratelimit *rl, got_cancel_cb cancel_cb, void *cancel_arg)
1575 {
1576 	const struct got_error *err = NULL;
1577 	struct load_packed_obj_arg lpa;
1578 
1579 	memset(&lpa, 0, sizeof(lpa));
1580 	lpa.seed = seed;
1581 	lpa.want_meta = want_meta;
1582 	lpa.idset = idset;
1583 	lpa.idset_exclude = idset_exclude;
1584 	lpa.loose_obj_only = loose_obj_only;
1585 	lpa.ncolored = ncolored;
1586 	lpa.nfound = nfound;
1587 	lpa.ntrees = ntrees;
1588 	lpa.progress_cb = progress_cb;
1589 	lpa.progress_arg = progress_arg;
1590 	lpa.rl = rl;
1591 	lpa.cancel_cb = cancel_cb;
1592 	lpa.cancel_arg = cancel_arg;
1593 
1594 	/* Attempt to load objects via got-read-pack, as far as possible. */
1595 	err = got_object_enumerate(found_all_objects, load_packed_commit_id,
1596 	   load_packed_tree_ids, &lpa, ours, nours, theirs, ntheirs,
1597 	   packidx, repo);
1598 	if (err)
1599 		return err;
1600 
1601 	if (lpa.id == NULL)
1602 		return NULL;
1603 
1604 	/*
1605 	 * An incomplete tree hierarchy was present in the pack file
1606 	 * and caused loading to be aborted.
1607 	 * Continue loading trees the slow way.
1608 	 */
1609 	err = load_tree(want_meta, idset, idset_exclude,
1610 	    lpa.id, lpa.dpath, lpa.mtime, seed, repo, loose_obj_only,
1611 	    ncolored, nfound, ntrees, progress_cb, progress_arg, rl,
1612 	    cancel_cb, cancel_arg);
1613 	free(lpa.id);
1614 	free(lpa.dpath);
1615 	return err;
1616 }
1617 
1618 static const struct got_error *
1619 find_pack_for_enumeration(struct got_packidx **best_packidx,
1620     struct got_object_id **ids, int nids, struct got_repository *repo)
1621 {
1622 	const struct got_error *err = NULL;
1623 	struct got_pathlist_entry *pe;
1624 	const char *best_packidx_path = NULL;
1625 	int nobj_max = 0;
1626 	int ncommits_max = 0;
1627 
1628 	*best_packidx = NULL;
1629 
1630 	/*
1631 	 * Find the largest pack which contains at least some of the
1632 	 * commits and tags we are interested in.
1633 	 */
1634 	TAILQ_FOREACH(pe, &repo->packidx_paths, entry) {
1635 		const char *path_packidx = pe->path;
1636 		struct got_packidx *packidx;
1637 		int nobj, i, idx, ncommits = 0;
1638 
1639 		err = got_repo_get_packidx(&packidx, path_packidx, repo);
1640 		if (err)
1641 			break;
1642 
1643 		nobj = be32toh(packidx->hdr.fanout_table[0xff]);
1644 		if (nobj <= nobj_max)
1645 			continue;
1646 
1647 		for (i = 0; i < nids; i++) {
1648 			idx = got_packidx_get_object_idx(packidx, ids[i]);
1649 			if (idx != -1)
1650 				ncommits++;
1651 		}
1652 		if (ncommits > ncommits_max) {
1653 			best_packidx_path = path_packidx;
1654 			nobj_max = nobj;
1655 			ncommits_max = ncommits;
1656 		}
1657 	}
1658 
1659 	if (best_packidx_path && err == NULL) {
1660 		err = got_repo_get_packidx(best_packidx, best_packidx_path,
1661 		    repo);
1662 	}
1663 
1664 	return err;
1665 }
1666 
1667 static const struct got_error *
1668 load_object_ids(int *ncolored, int *nfound, int *ntrees,
1669     struct got_object_idset *idset, struct got_object_id **theirs, int ntheirs,
1670     struct got_object_id **ours, int nours, struct got_repository *repo,
1671     uint32_t seed, int loose_obj_only, got_pack_progress_cb progress_cb,
1672     void *progress_arg, struct got_ratelimit *rl, got_cancel_cb cancel_cb,
1673     void *cancel_arg)
1674 {
1675 	const struct got_error *err = NULL;
1676 	struct got_object_id **ids = NULL;
1677 	struct got_packidx *packidx = NULL;
1678 	int i, nobj = 0, obj_type, found_all_objects = 0;
1679 	struct got_object_idset *idset_exclude;
1680 
1681 	idset_exclude = got_object_idset_alloc();
1682 	if (idset_exclude == NULL)
1683 		return got_error_from_errno("got_object_idset_alloc");
1684 
1685 	*ncolored = 0;
1686 	*nfound = 0;
1687 	*ntrees = 0;
1688 
1689 	err = findtwixt(&ids, &nobj, ncolored, ours, nours, theirs, ntheirs,
1690 	    repo, progress_cb, progress_arg, rl, cancel_cb, cancel_arg);
1691 	if (err)
1692 		goto done;
1693 
1694 	err = find_pack_for_enumeration(&packidx, theirs, ntheirs, repo);
1695 	if (err)
1696 		goto done;
1697 	if (packidx) {
1698 		err = load_packed_object_ids(&found_all_objects,
1699 		    theirs, ntheirs, NULL, 0, 0, seed, idset, idset_exclude,
1700 		    loose_obj_only, repo, packidx, ncolored, nfound, ntrees,
1701 		    progress_cb, progress_arg, rl, cancel_cb, cancel_arg);
1702 		if (err)
1703 			goto done;
1704 	}
1705 
1706 	for (i = 0; i < ntheirs; i++) {
1707 		struct got_object_id *id = theirs[i];
1708 		if (id == NULL)
1709 			continue;
1710 		err = got_object_get_type(&obj_type, repo, id);
1711 		if (err)
1712 			return err;
1713 		if (obj_type == GOT_OBJ_TYPE_COMMIT) {
1714 			if (!found_all_objects) {
1715 				err = load_commit(0, idset, idset_exclude,
1716 				    id, repo, seed, loose_obj_only,
1717 				    ncolored, nfound, ntrees,
1718 				    progress_cb, progress_arg, rl,
1719 				    cancel_cb, cancel_arg);
1720 				if (err)
1721 					goto done;
1722 			}
1723 		} else if (obj_type == GOT_OBJ_TYPE_TAG) {
1724 			err = load_tag(0, idset, idset_exclude, id, repo,
1725 			    seed, loose_obj_only, ncolored, nfound, ntrees,
1726 			    progress_cb, progress_arg, rl,
1727 			    cancel_cb, cancel_arg);
1728 			if (err)
1729 				goto done;
1730 		}
1731 	}
1732 
1733 	found_all_objects = 0;
1734 	err = find_pack_for_enumeration(&packidx, ids, nobj, repo);
1735 	if (err)
1736 		goto done;
1737 	if (packidx) {
1738 		err = load_packed_object_ids(&found_all_objects, ids,
1739 		    nobj, theirs, ntheirs, 1, seed, idset, idset_exclude,
1740 		    loose_obj_only, repo, packidx, ncolored, nfound, ntrees,
1741 		    progress_cb, progress_arg, rl, cancel_cb, cancel_arg);
1742 		if (err)
1743 			goto done;
1744 	}
1745 
1746 	if (!found_all_objects) {
1747 		for (i = 0; i < nobj; i++) {
1748 			err = load_commit(1, idset, idset_exclude, ids[i],
1749 			    repo, seed, loose_obj_only, ncolored, nfound,
1750 			    ntrees, progress_cb, progress_arg, rl,
1751 			    cancel_cb, cancel_arg);
1752 			if (err)
1753 				goto done;
1754 		}
1755 	}
1756 
1757 	for (i = 0; i < nours; i++) {
1758 		struct got_object_id *id = ours[i];
1759 		struct got_pack_meta *m;
1760 		if (id == NULL)
1761 			continue;
1762 		m = got_object_idset_get(idset, id);
1763 		if (m == NULL) {
1764 			err = got_object_get_type(&obj_type, repo, id);
1765 			if (err)
1766 				goto done;
1767 		} else
1768 			obj_type = m->obj_type;
1769 		if (obj_type != GOT_OBJ_TYPE_TAG)
1770 			continue;
1771 		err = load_tag(1, idset, idset_exclude, id, repo,
1772 		    seed, loose_obj_only, ncolored, nfound, ntrees,
1773 		    progress_cb, progress_arg, rl, cancel_cb, cancel_arg);
1774 		if (err)
1775 			goto done;
1776 	}
1777 done:
1778 	for (i = 0; i < nobj; i++) {
1779 		free(ids[i]);
1780 	}
1781 	free(ids);
1782 	got_object_idset_free(idset_exclude);
1783 	return err;
1784 }
1785 
1786 const struct got_error *
1787 hwrite(FILE *f, void *buf, off_t len, SHA1_CTX *ctx)
1788 {
1789 	size_t n;
1790 
1791 	SHA1Update(ctx, buf, len);
1792 	n = fwrite(buf, 1, len, f);
1793 	if (n != len)
1794 		return got_ferror(f, GOT_ERR_IO);
1795 	return NULL;
1796 }
1797 
1798 const struct got_error *
1799 hcopy(FILE *fsrc, FILE *fdst, off_t len, SHA1_CTX *ctx)
1800 {
1801 	unsigned char buf[65536];
1802 	off_t remain = len;
1803 	size_t n;
1804 
1805 	while (remain > 0) {
1806 		size_t copylen = MIN(sizeof(buf), remain);
1807 		n = fread(buf, 1, copylen, fsrc);
1808 		if (n != copylen)
1809 			return got_ferror(fsrc, GOT_ERR_IO);
1810 		SHA1Update(ctx, buf, copylen);
1811 		n = fwrite(buf, 1, copylen, fdst);
1812 		if (n != copylen)
1813 			return got_ferror(fdst, GOT_ERR_IO);
1814 		remain -= copylen;
1815 	}
1816 
1817 	return NULL;
1818 }
1819 
1820 const struct got_error *
1821 hcopy_mmap(uint8_t *src, off_t src_offset, size_t src_size,
1822     FILE *fdst, off_t len, SHA1_CTX *ctx)
1823 {
1824 	size_t n;
1825 
1826 	if (src_offset + len > src_size)
1827 		return got_error(GOT_ERR_RANGE);
1828 
1829 	SHA1Update(ctx, src + src_offset, len);
1830 	n = fwrite(src + src_offset, 1, len, fdst);
1831 	if (n != len)
1832 		return got_ferror(fdst, GOT_ERR_IO);
1833 
1834 	return NULL;
1835 }
1836 
1837 static void
1838 putbe32(char *b, uint32_t n)
1839 {
1840 	b[0] = n >> 24;
1841 	b[1] = n >> 16;
1842 	b[2] = n >> 8;
1843 	b[3] = n >> 0;
1844 }
1845 
1846 static int
1847 write_order_cmp(const void *pa, const void *pb)
1848 {
1849 	struct got_pack_meta *a, *b, *ahd, *bhd;
1850 
1851 	a = *(struct got_pack_meta **)pa;
1852 	b = *(struct got_pack_meta **)pb;
1853 	ahd = (a->head == NULL) ? a : a->head;
1854 	bhd = (b->head == NULL) ? b : b->head;
1855 	if (bhd->mtime < ahd->mtime)
1856 		return -1;
1857 	if (bhd->mtime > ahd->mtime)
1858 		return 1;
1859 	if (bhd < ahd)
1860 		return -1;
1861 	if (bhd > ahd)
1862 		return 1;
1863 	if (a->nchain != b->nchain)
1864 		return a->nchain - b->nchain;
1865 	if (a->mtime < b->mtime)
1866 		return -1;
1867 	if (a->mtime > b->mtime)
1868 		return 1;
1869 	return got_object_id_cmp(&a->id, &b->id);
1870 }
1871 
1872 static int
1873 reuse_write_order_cmp(const void *pa, const void *pb)
1874 {
1875 	struct got_pack_meta *a, *b;
1876 
1877 	a = *(struct got_pack_meta **)pa;
1878 	b = *(struct got_pack_meta **)pb;
1879 
1880 	if (a->reused_delta_offset < b->reused_delta_offset)
1881 		return -1;
1882 	if (a->reused_delta_offset > b->reused_delta_offset)
1883 		return 1;
1884 	return 0;
1885 }
1886 
1887 static const struct got_error *
1888 packhdr(int *hdrlen, char *hdr, size_t bufsize, int obj_type, size_t len)
1889 {
1890 	size_t i;
1891 
1892 	*hdrlen = 0;
1893 
1894 	hdr[0] = obj_type << 4;
1895 	hdr[0] |= len & 0xf;
1896 	len >>= 4;
1897 	for (i = 1; len != 0; i++){
1898 		if (i >= bufsize)
1899 			return got_error(GOT_ERR_NO_SPACE);
1900 		hdr[i - 1] |= GOT_DELTA_SIZE_MORE;
1901 		hdr[i] = len & GOT_DELTA_SIZE_VAL_MASK;
1902 		len >>= GOT_DELTA_SIZE_SHIFT;
1903 	}
1904 
1905 	*hdrlen = i;
1906 	return NULL;
1907 }
1908 
1909 static int
1910 packoff(char *hdr, off_t off)
1911 {
1912 	int i, j;
1913 	char rbuf[8];
1914 
1915 	rbuf[0] = off & GOT_DELTA_SIZE_VAL_MASK;
1916 	for (i = 1; (off >>= GOT_DELTA_SIZE_SHIFT) != 0; i++) {
1917 		rbuf[i] = (--off & GOT_DELTA_SIZE_VAL_MASK) |
1918 		    GOT_DELTA_SIZE_MORE;
1919 	}
1920 
1921 	j = 0;
1922 	while (i > 0)
1923 		hdr[j++] = rbuf[--i];
1924 	return j;
1925 }
1926 
1927 static const struct got_error *
1928 deltahdr(off_t *packfile_size, SHA1_CTX *ctx, FILE *packfile,
1929     struct got_pack_meta *m)
1930 {
1931 	const struct got_error *err;
1932 	char buf[32];
1933 	int nh;
1934 
1935 	if (m->prev->off != 0) {
1936 		err = packhdr(&nh, buf, sizeof(buf),
1937 		    GOT_OBJ_TYPE_OFFSET_DELTA, m->delta_len);
1938 		if (err)
1939 			return err;
1940 		nh += packoff(buf + nh, m->off - m->prev->off);
1941 		err = hwrite(packfile, buf, nh, ctx);
1942 		if (err)
1943 			return err;
1944 		*packfile_size += nh;
1945 	} else {
1946 		err = packhdr(&nh, buf, sizeof(buf),
1947 		    GOT_OBJ_TYPE_REF_DELTA, m->delta_len);
1948 		if (err)
1949 			return err;
1950 		err = hwrite(packfile, buf, nh, ctx);
1951 		if (err)
1952 			return err;
1953 		*packfile_size += nh;
1954 		err = hwrite(packfile, m->prev->id.sha1,
1955 		    sizeof(m->prev->id.sha1), ctx);
1956 		if (err)
1957 			return err;
1958 		*packfile_size += sizeof(m->prev->id.sha1);
1959 	}
1960 
1961 	return NULL;
1962 }
1963 
1964 static const struct got_error *
1965 write_packed_object(off_t *packfile_size, FILE *packfile,
1966     FILE *delta_cache, uint8_t *delta_cache_map, size_t delta_cache_size,
1967     struct got_pack_meta *m, int *outfd, SHA1_CTX *ctx,
1968     struct got_repository *repo)
1969 {
1970 	const struct got_error *err = NULL;
1971 	struct got_deflate_checksum csum;
1972 	char buf[32];
1973 	int nh;
1974 	struct got_raw_object *raw = NULL;
1975 	off_t outlen;
1976 
1977 	csum.output_sha1 = ctx;
1978 	csum.output_crc = NULL;
1979 
1980 	m->off = ftello(packfile);
1981 	if (m->delta_len == 0) {
1982 		err = got_object_raw_open(&raw, outfd, repo, &m->id);
1983 		if (err)
1984 			goto done;
1985 		err = packhdr(&nh, buf, sizeof(buf),
1986 		    m->obj_type, raw->size);
1987 		if (err)
1988 			goto done;
1989 		err = hwrite(packfile, buf, nh, ctx);
1990 		if (err)
1991 			goto done;
1992 		*packfile_size += nh;
1993 		if (raw->f == NULL) {
1994 			err = got_deflate_to_file_mmap(&outlen,
1995 			    raw->data + raw->hdrlen, 0, raw->size,
1996 			    packfile, &csum);
1997 			if (err)
1998 				goto done;
1999 		} else {
2000 			if (fseeko(raw->f, raw->hdrlen, SEEK_SET)
2001 			    == -1) {
2002 				err = got_error_from_errno("fseeko");
2003 				goto done;
2004 			}
2005 			err = got_deflate_to_file(&outlen, raw->f,
2006 			    raw->size, packfile, &csum);
2007 			if (err)
2008 				goto done;
2009 		}
2010 		*packfile_size += outlen;
2011 		got_object_raw_close(raw);
2012 		raw = NULL;
2013 	} else if (m->delta_buf) {
2014 		err = deltahdr(packfile_size, ctx, packfile, m);
2015 		if (err)
2016 			goto done;
2017 		err = hwrite(packfile, m->delta_buf,
2018 		    m->delta_compressed_len, ctx);
2019 		if (err)
2020 			goto done;
2021 		*packfile_size += m->delta_compressed_len;
2022 		free(m->delta_buf);
2023 		m->delta_buf = NULL;
2024 	} else if (delta_cache_map) {
2025 		err = deltahdr(packfile_size, ctx, packfile, m);
2026 		if (err)
2027 			goto done;
2028 		err = hcopy_mmap(delta_cache_map, m->delta_offset,
2029 		    delta_cache_size, packfile, m->delta_compressed_len,
2030 		    ctx);
2031 		if (err)
2032 			goto done;
2033 		*packfile_size += m->delta_compressed_len;
2034 	} else {
2035 		if (fseeko(delta_cache, m->delta_offset, SEEK_SET)
2036 		    == -1) {
2037 			err = got_error_from_errno("fseeko");
2038 			goto done;
2039 		}
2040 		err = deltahdr(packfile_size, ctx, packfile, m);
2041 		if (err)
2042 			goto done;
2043 		err = hcopy(delta_cache, packfile,
2044 		    m->delta_compressed_len, ctx);
2045 		if (err)
2046 			goto done;
2047 		*packfile_size += m->delta_compressed_len;
2048 	}
2049 done:
2050 	if (raw)
2051 		got_object_raw_close(raw);
2052 	return err;
2053 }
2054 
2055 static const struct got_error *
2056 genpack(uint8_t *pack_sha1, FILE *packfile, FILE *delta_cache,
2057     struct got_pack_meta **deltify, int ndeltify,
2058     struct got_pack_meta **reuse, int nreuse,
2059     int ncolored, int nfound, int ntrees, int nours,
2060     struct got_repository *repo,
2061     got_pack_progress_cb progress_cb, void *progress_arg,
2062     struct got_ratelimit *rl,
2063     got_cancel_cb cancel_cb, void *cancel_arg)
2064 {
2065 	const struct got_error *err = NULL;
2066 	int i;
2067 	SHA1_CTX ctx;
2068 	struct got_pack_meta *m;
2069 	char buf[32];
2070 	size_t n;
2071 	off_t packfile_size = 0;
2072 	int outfd = -1;
2073 	int delta_cache_fd = -1;
2074 	uint8_t *delta_cache_map = NULL;
2075 	size_t delta_cache_size = 0;
2076 
2077 	SHA1Init(&ctx);
2078 
2079 #ifndef GOT_PACK_NO_MMAP
2080 	delta_cache_fd = dup(fileno(delta_cache));
2081 	if (delta_cache_fd != -1) {
2082 		struct stat sb;
2083 		if (fstat(delta_cache_fd, &sb) == -1) {
2084 			err = got_error_from_errno("fstat");
2085 			goto done;
2086 		}
2087 		if (sb.st_size > 0 && sb.st_size <= SIZE_MAX) {
2088 			delta_cache_map = mmap(NULL, sb.st_size,
2089 			    PROT_READ, MAP_PRIVATE, delta_cache_fd, 0);
2090 			if (delta_cache_map == MAP_FAILED) {
2091 				if (errno != ENOMEM) {
2092 					err = got_error_from_errno("mmap");
2093 					goto done;
2094 				}
2095 				delta_cache_map = NULL; /* fallback on stdio */
2096 			} else
2097 				delta_cache_size = (size_t)sb.st_size;
2098 		}
2099 	}
2100 #endif
2101 	err = hwrite(packfile, "PACK", 4, &ctx);
2102 	if (err)
2103 		goto done;
2104 	putbe32(buf, GOT_PACKFILE_VERSION);
2105 	err = hwrite(packfile, buf, 4, &ctx);
2106 	if (err)
2107 		goto done;
2108 	putbe32(buf, ndeltify + nreuse);
2109 	err = hwrite(packfile, buf, 4, &ctx);
2110 	if (err)
2111 		goto done;
2112 
2113 	qsort(deltify, ndeltify, sizeof(struct got_pack_meta *),
2114 	    write_order_cmp);
2115 	for (i = 0; i < ndeltify; i++) {
2116 		err = report_progress(progress_cb, progress_arg, rl,
2117 		    ncolored, nfound, ntrees, packfile_size, nours,
2118 		    ndeltify + nreuse, ndeltify + nreuse, i);
2119 		if (err)
2120 			goto done;
2121 		m = deltify[i];
2122 		err = write_packed_object(&packfile_size, packfile,
2123 		    delta_cache, delta_cache_map, delta_cache_size,
2124 		    m, &outfd, &ctx, repo);
2125 		if (err)
2126 			goto done;
2127 	}
2128 
2129 	qsort(reuse, nreuse, sizeof(struct got_pack_meta *),
2130 	    reuse_write_order_cmp);
2131 	for (i = 0; i < nreuse; i++) {
2132 		err = report_progress(progress_cb, progress_arg, rl,
2133 		    ncolored, nfound, ntrees, packfile_size, nours,
2134 		    ndeltify + nreuse, ndeltify + nreuse, ndeltify + i);
2135 		if (err)
2136 			goto done;
2137 		m = reuse[i];
2138 		err = write_packed_object(&packfile_size, packfile,
2139 		    delta_cache, delta_cache_map, delta_cache_size,
2140 		    m, &outfd, &ctx, repo);
2141 		if (err)
2142 			goto done;
2143 	}
2144 
2145 	SHA1Final(pack_sha1, &ctx);
2146 	n = fwrite(pack_sha1, 1, SHA1_DIGEST_LENGTH, packfile);
2147 	if (n != SHA1_DIGEST_LENGTH)
2148 		err = got_ferror(packfile, GOT_ERR_IO);
2149 	packfile_size += SHA1_DIGEST_LENGTH;
2150 	packfile_size += sizeof(struct got_packfile_hdr);
2151 	if (progress_cb) {
2152 		err = progress_cb(progress_arg, ncolored, nfound, ntrees,
2153 		    packfile_size, nours, ndeltify + nreuse,
2154 		    ndeltify + nreuse, ndeltify + nreuse);
2155 		if (err)
2156 			goto done;
2157 	}
2158 done:
2159 	if (outfd != -1 && close(outfd) == -1 && err == NULL)
2160 		err = got_error_from_errno("close");
2161 	if (delta_cache_map && munmap(delta_cache_map, delta_cache_size) == -1)
2162 		err = got_error_from_errno("munmap");
2163 	if (delta_cache_fd != -1 && close(delta_cache_fd) == -1 && err == NULL)
2164 		err = got_error_from_errno("close");
2165 	return err;
2166 }
2167 
2168 static const struct got_error *
2169 add_meta_idset_cb(struct got_object_id *id, void *data, void *arg)
2170 {
2171 	struct got_pack_meta *m = data;
2172 	struct got_pack_metavec *v = arg;
2173 
2174 	if (m->reused_delta_offset != 0)
2175 		return NULL;
2176 
2177 	return add_meta(m, v);
2178 }
2179 
2180 const struct got_error *
2181 got_pack_create(uint8_t *packsha1, FILE *packfile,
2182     struct got_object_id **theirs, int ntheirs,
2183     struct got_object_id **ours, int nours,
2184     struct got_repository *repo, int loose_obj_only, int allow_empty,
2185     got_pack_progress_cb progress_cb, void *progress_arg,
2186     got_cancel_cb cancel_cb, void *cancel_arg)
2187 {
2188 	const struct got_error *err;
2189 	int delta_cache_fd = -1;
2190 	FILE *delta_cache = NULL;
2191 	struct got_object_idset *idset;
2192 	struct got_ratelimit rl;
2193 	struct got_pack_metavec deltify, reuse;
2194 	int ncolored = 0, nfound = 0, ntrees = 0;
2195 	size_t ndeltify;
2196 	uint32_t seed;
2197 
2198 	seed = arc4random();
2199 
2200 	memset(&deltify, 0, sizeof(deltify));
2201 	memset(&reuse, 0, sizeof(reuse));
2202 
2203 	got_ratelimit_init(&rl, 0, 500);
2204 
2205 	idset = got_object_idset_alloc();
2206 	if (idset == NULL)
2207 		return got_error_from_errno("got_object_idset_alloc");
2208 
2209 	err = load_object_ids(&ncolored, &nfound, &ntrees, idset, theirs,
2210 	    ntheirs, ours, nours, repo, seed, loose_obj_only,
2211 	    progress_cb, progress_arg, &rl, cancel_cb, cancel_arg);
2212 	if (err)
2213 		goto done;
2214 
2215 	if (progress_cb) {
2216 		err = progress_cb(progress_arg, ncolored, nfound, ntrees,
2217 		    0L, nours, got_object_idset_num_elements(idset), 0, 0);
2218 		if (err)
2219 			goto done;
2220 	}
2221 
2222 	if (got_object_idset_num_elements(idset) == 0 && !allow_empty) {
2223 		err = got_error(GOT_ERR_CANNOT_PACK);
2224 		goto done;
2225 	}
2226 
2227 	delta_cache_fd = got_opentempfd();
2228 	if (delta_cache_fd == -1) {
2229 		err = got_error_from_errno("got_opentemp");
2230 		goto done;
2231 	}
2232 
2233 	reuse.metasz = 64;
2234 	reuse.meta = calloc(reuse.metasz,
2235 	    sizeof(struct got_pack_meta *));
2236 	if (reuse.meta == NULL) {
2237 		err = got_error_from_errno("calloc");
2238 		goto done;
2239 	}
2240 
2241 	err = search_deltas(&reuse, idset, delta_cache_fd, ncolored, nfound,
2242 	    ntrees, nours, repo, progress_cb, progress_arg, &rl,
2243 	    cancel_cb, cancel_arg);
2244 	if (err)
2245 		goto done;
2246 
2247 	delta_cache = fdopen(delta_cache_fd, "a+");
2248 	if (delta_cache == NULL) {
2249 		err = got_error_from_errno("fdopen");
2250 		goto done;
2251 	}
2252 	delta_cache_fd = -1;
2253 
2254 	if (fseeko(delta_cache, 0L, SEEK_END) == -1) {
2255 		err = got_error_from_errno("fseeko");
2256 		goto done;
2257 	}
2258 
2259 	ndeltify = got_object_idset_num_elements(idset) - reuse.nmeta;
2260 	if (ndeltify > 0) {
2261 		deltify.meta = calloc(ndeltify, sizeof(struct got_pack_meta *));
2262 		if (deltify.meta == NULL) {
2263 			err = got_error_from_errno("calloc");
2264 			goto done;
2265 		}
2266 		deltify.metasz = ndeltify;
2267 
2268 		err = got_object_idset_for_each(idset, add_meta_idset_cb,
2269 		    &deltify);
2270 		if (err)
2271 			goto done;
2272 		if (deltify.nmeta > 0) {
2273 			err = pick_deltas(deltify.meta, deltify.nmeta,
2274 			    ncolored, nfound, ntrees, nours, reuse.nmeta,
2275 			    delta_cache, repo, progress_cb, progress_arg, &rl,
2276 			    cancel_cb, cancel_arg);
2277 			if (err)
2278 				goto done;
2279 		}
2280 	}
2281 
2282 	if (fflush(delta_cache) == EOF) {
2283 		err = got_error_from_errno("fflush");
2284 		goto done;
2285 	}
2286 	err = genpack(packsha1, packfile, delta_cache, deltify.meta,
2287 	    deltify.nmeta, reuse.meta, reuse.nmeta, ncolored, nfound, ntrees,
2288 	    nours, repo, progress_cb, progress_arg, &rl,
2289 	    cancel_cb, cancel_arg);
2290 	if (err)
2291 		goto done;
2292 done:
2293 	free_nmeta(deltify.meta, deltify.nmeta);
2294 	free_nmeta(reuse.meta, reuse.nmeta);
2295 	got_object_idset_free(idset);
2296 	if (delta_cache_fd != -1 && close(delta_cache_fd) == -1 && err == NULL)
2297 		err = got_error_from_errno("close");
2298 	if (delta_cache && fclose(delta_cache) == EOF && err == NULL)
2299 		err = got_error_from_errno("fclose");
2300 	return err;
2301 }