1 /*
2  * Copyright (c) 2018, 2019, 2020 Stefan Sperling <stsp@openbsd.org>
3  *
4  * Permission to use, copy, modify, and distribute this software for any
5  * purpose with or without fee is hereby granted, provided that the above
6  * copyright notice and this permission notice appear in all copies.
7  *
8  * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
9  * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
10  * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
11  * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
12  * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
13  * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
14  * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
15  */
16 
17 #include <sys/types.h>
18 #include <sys/stat.h>
19 #include <sys/queue.h>
20 #include <sys/stdint.h>
21 
22 #include <limits.h>
23 #include <stdio.h>
24 #include <stdlib.h>
25 #include <string.h>
26 #include <sha1.h>
27 #include <sha2.h>
28 #include <zlib.h>
29 #include <ctype.h>
30 
31 #include "got_error.h"
32 #include "got_object.h"
33 #include "got_cancel.h"
34 #include "got_commit_graph.h"
35 #include "got_path.h"
36 
37 #include "got_lib_delta.h"
38 #include "got_lib_inflate.h"
39 #include "got_lib_object.h"
40 #include "got_lib_object_idset.h"
41 
42 struct got_commit_graph_node {
43 	struct got_object_id id;
44 
45 	/* Used only during iteration. */
46 	time_t timestamp;
47 	TAILQ_ENTRY(got_commit_graph_node) entry;
48 };
49 
50 TAILQ_HEAD(got_commit_graph_iter_list, got_commit_graph_node);
51 
52 struct got_commit_graph_branch_tip {
53 	struct got_object_id *commit_id;
54 	struct got_commit_object *commit;
55 	struct got_commit_graph_node *new_node;
56 };
57 
58 struct got_commit_graph {
59 	/* The set of all commits we have traversed. */
60 	struct got_object_idset *node_ids;
61 
62 	int flags;
63 #define GOT_COMMIT_GRAPH_FIRST_PARENT_TRAVERSAL		0x01
64 
65 	/*
66 	 * A set of object IDs of known parent commits which we have not yet
67 	 * traversed. Each commit ID in this set represents a branch in commit
68 	 * history: Either the first-parent branch of the head node, or another
69 	 * branch corresponding to a traversed merge commit for which we have
70 	 * not traversed a branch point commit yet.
71 	 *
72 	 * Whenever we add a commit with a matching ID to the graph, we remove
73 	 * its corresponding element from this set, and add new elements for
74 	 * each of that commit's parent commits which were not traversed yet.
75 	 *
76 	 * When API users ask us to fetch more commits, we fetch commits from
77 	 * all currently open branches. This allows API users to process
78 	 * commits in linear order even though the history contains branches.
79 	 */
80 	struct got_object_idset *open_branches;
81 
82 	/* Array of branch tips for fetch_commits_from_open_branches(). */
83 	struct got_commit_graph_branch_tip *tips;
84 	int ntips;
85 
86 	/* Path of tree entry of interest to the API user. */
87 	char *path;
88 
89 	/*
90 	 * Nodes which will be passed to the API user next, sorted by
91 	 * commit timestmap.
92 	 */
93 	struct got_commit_graph_iter_list iter_list;
94 };
95 
96 static const struct got_error *
97 detect_changed_path(int *changed, struct got_commit_object *commit,
98     struct got_object_id *commit_id, const char *path,
99     struct got_repository *repo)
100 {
101 	const struct got_error *err = NULL;
102 	struct got_commit_object *pcommit = NULL;
103 	struct got_tree_object *tree = NULL, *ptree = NULL;
104 	struct got_object_qid *pid;
105 
106 	if (got_path_is_root_dir(path)) {
107 		*changed = 1;
108 		return NULL;
109 	}
110 
111 	*changed = 0;
112 
113 	pid = STAILQ_FIRST(&commit->parent_ids);
114 	if (pid == NULL) {
115 		struct got_object_id *obj_id;
116 		err = got_object_id_by_path(&obj_id, repo, commit, path);
117 		if (err) {
118 			if (err->code == GOT_ERR_NO_TREE_ENTRY)
119 				err = NULL;
120 		} else
121 			*changed = 1; /* The path was created in this commit. */
122 		free(obj_id);
123 		return err;
124 	}
125 
126 	err = got_object_open_as_tree(&tree, repo, commit->tree_id);
127 	if (err)
128 		return err;
129 
130 	err = got_object_open_as_commit(&pcommit, repo, &pid->id);
131 	if (err)
132 		goto done;
133 
134 	err = got_object_open_as_tree(&ptree, repo, pcommit->tree_id);
135 	if (err)
136 		goto done;
137 
138 	err = got_object_tree_path_changed(changed, tree, ptree, path, repo);
139 done:
140 	if (tree)
141 		got_object_tree_close(tree);
142 	if (ptree)
143 		got_object_tree_close(ptree);
144 	if (pcommit)
145 		got_object_commit_close(pcommit);
146 	return err;
147 }
148 
149 static void
150 add_node_to_iter_list(struct got_commit_graph *graph,
151     struct got_commit_graph_node *node, time_t committer_time)
152 {
153 	struct got_commit_graph_node *n, *next;
154 
155 	node->timestamp = committer_time;
156 
157 	n = TAILQ_FIRST(&graph->iter_list);
158 	while (n) {
159 		next = TAILQ_NEXT(n, entry);
160 		if (next && node->timestamp >= next->timestamp) {
161 			TAILQ_INSERT_BEFORE(next, node, entry);
162 			return;
163 		}
164 		n = next;
165 	}
166 	TAILQ_INSERT_TAIL(&graph->iter_list, node, entry);
167 }
168 
169 static const struct got_error *
170 add_node(struct got_commit_graph_node **new_node,
171     struct got_commit_graph *graph, struct got_object_id *commit_id,
172     struct got_repository *repo)
173 {
174 	const struct got_error *err = NULL;
175 	struct got_commit_graph_node *node;
176 
177 	*new_node = NULL;
178 
179 	node = calloc(1, sizeof(*node));
180 	if (node == NULL)
181 		return got_error_from_errno("calloc");
182 
183 	memcpy(&node->id, commit_id, sizeof(node->id));
184 	err = got_object_idset_add(graph->node_ids, &node->id, NULL);
185 	if (err)
186 		free(node);
187 	else
188 		*new_node = node;
189 	return err;
190 }
191 
192 /*
193  * Ask got-read-pack to traverse first-parent history until a commit is
194  * encountered which modified graph->path, or until the pack file runs
195  * out of relevant commits. This is faster than sending an individual
196  * request for each commit stored in the pack file.
197  */
198 static const struct got_error *
199 packed_first_parent_traversal(int *ncommits_traversed,
200     struct got_commit_graph *graph, struct got_object_id *commit_id,
201     struct got_repository *repo)
202 {
203 	const struct got_error *err = NULL;
204 	struct got_object_id_queue traversed_commits;
205 	struct got_object_qid *qid;
206 
207 	STAILQ_INIT(&traversed_commits);
208 	*ncommits_traversed = 0;
209 
210 	err = got_traverse_packed_commits(&traversed_commits,
211 	    commit_id, graph->path, repo);
212 	if (err)
213 		return err;
214 
215 	/* Add all traversed commits to the graph... */
216 	STAILQ_FOREACH(qid, &traversed_commits, entry) {
217 		if (got_object_idset_contains(graph->open_branches, &qid->id))
218 			continue;
219 		if (got_object_idset_contains(graph->node_ids, &qid->id))
220 			continue;
221 
222 		(*ncommits_traversed)++;
223 
224 		/* ... except the last commit is the new branch tip. */
225 		if (STAILQ_NEXT(qid, entry) == NULL) {
226 			err = got_object_idset_add(graph->open_branches,
227 			    &qid->id, NULL);
228 			break;
229 		}
230 
231 		err = got_object_idset_add(graph->node_ids, &qid->id, NULL);
232 		if (err)
233 			break;
234 	}
235 
236 	got_object_id_queue_free(&traversed_commits);
237 	return err;
238 }
239 
240 static const struct got_error *
241 close_branch(struct got_commit_graph *graph, struct got_object_id *commit_id)
242 {
243 	const struct got_error *err;
244 
245 	err = got_object_idset_remove(NULL, graph->open_branches, commit_id);
246 	if (err && err->code != GOT_ERR_NO_OBJ)
247 		return err;
248 	return NULL;
249 }
250 
251 static const struct got_error *
252 advance_branch(struct got_commit_graph *graph, struct got_object_id *commit_id,
253     struct got_commit_object *commit, struct got_repository *repo)
254 {
255 	const struct got_error *err;
256 	struct got_object_qid *qid;
257 
258 	err = close_branch(graph, commit_id);
259 	if (err)
260 		return err;
261 
262 	if (graph->flags & GOT_COMMIT_GRAPH_FIRST_PARENT_TRAVERSAL) {
263 		qid = STAILQ_FIRST(&commit->parent_ids);
264 		if (qid == NULL ||
265 		    got_object_idset_contains(graph->open_branches, &qid->id))
266 			return NULL;
267 		/*
268 		 * The root directory always changes by definition, and when
269 		 * logging the root we want to traverse consecutive commits
270 		 * even if they point at the same tree.
271 		 * But if we are looking for a specific path then we can avoid
272 		 * fetching packed commits which did not modify the path and
273 		 * only fetch their IDs. This speeds up 'got blame'.
274 		 */
275 		if (!got_path_is_root_dir(graph->path) &&
276 		    (commit->flags & GOT_COMMIT_FLAG_PACKED)) {
277 			int ncommits = 0;
278 			err = packed_first_parent_traversal(&ncommits,
279 			    graph, &qid->id, repo);
280 			if (err || ncommits > 0)
281 				return err;
282 		}
283 		return got_object_idset_add(graph->open_branches,
284 		    &qid->id, NULL);
285 	}
286 
287 	/*
288 	 * If we are graphing commits for a specific path, skip branches
289 	 * which do not contribute any content to this path.
290 	 */
291 	if (commit->nparents > 1 && !got_path_is_root_dir(graph->path)) {
292 		struct got_object_id *merged_id, *prev_id = NULL;
293 		int branches_differ = 0;
294 
295 		err = got_object_id_by_path(&merged_id, repo, commit,
296 		    graph->path);
297 		if (err)
298 			return err;
299 
300 		STAILQ_FOREACH(qid, &commit->parent_ids, entry) {
301 			struct got_object_id *id = NULL;
302 			struct got_commit_object *pcommit = NULL;
303 
304 			if (got_object_idset_contains(graph->open_branches,
305 			    &qid->id))
306 				continue;
307 
308 			err = got_object_open_as_commit(&pcommit, repo,
309 			    &qid->id);
310 			if (err) {
311 				free(merged_id);
312 				free(prev_id);
313 				return err;
314 			}
315 			err = got_object_id_by_path(&id, repo, pcommit,
316 			    graph->path);
317 			got_object_commit_close(pcommit);
318 			pcommit = NULL;
319 			if (err) {
320 				if (err->code == GOT_ERR_NO_TREE_ENTRY) {
321 					branches_differ = 1;
322 					continue;
323 				}
324 				free(merged_id);
325 				free(prev_id);
326 				return err;
327 			}
328 
329 			if (prev_id) {
330 				if (!branches_differ &&
331 				    got_object_id_cmp(id, prev_id) != 0)
332 					branches_differ = 1;
333 				free(prev_id);
334 			}
335 			prev_id = id;
336 
337 			/*
338 			 * If a branch has created the merged content we can
339 			 * skip any other branches.
340 			 */
341 			if (got_object_id_cmp(merged_id, id) == 0) {
342 				err = got_object_idset_add(graph->open_branches,
343 				    &qid->id, NULL);
344 				free(merged_id);
345 				free(id);
346 				return err;
347 			}
348 		}
349 
350 		free(prev_id);
351 		prev_id = NULL;
352 		free(merged_id);
353 		merged_id = NULL;
354 
355 		/*
356 		 * If the path's content is the same on all branches,
357 		 * follow the first parent only.
358 		 */
359 		if (!branches_differ) {
360 			qid = STAILQ_FIRST(&commit->parent_ids);
361 			if (qid == NULL)
362 				return NULL;
363 			if (got_object_idset_contains(graph->open_branches,
364 			    &qid->id))
365 				return NULL;
366 			if (got_object_idset_contains(graph->node_ids,
367 			    &qid->id))
368 				return NULL; /* parent already traversed */
369 			return got_object_idset_add(graph->open_branches,
370 			    &qid->id, NULL);
371 		}
372 	}
373 
374 	STAILQ_FOREACH(qid, &commit->parent_ids, entry) {
375 		if (got_object_idset_contains(graph->open_branches, &qid->id))
376 			continue;
377 		if (got_object_idset_contains(graph->node_ids, &qid->id))
378 			continue; /* parent already traversed */
379 		err = got_object_idset_add(graph->open_branches, &qid->id,
380 		    NULL);
381 		if (err)
382 			return err;
383 	}
384 
385 	return NULL;
386 }
387 
388 const struct got_error *
389 got_commit_graph_open(struct got_commit_graph **graph,
390     const char *path, int first_parent_traversal)
391 {
392 	const struct got_error *err = NULL;
393 
394 	*graph = calloc(1, sizeof(**graph));
395 	if (*graph == NULL)
396 		return got_error_from_errno("calloc");
397 
398 	TAILQ_INIT(&(*graph)->iter_list);
399 
400 	(*graph)->path = strdup(path);
401 	if ((*graph)->path == NULL) {
402 		err = got_error_from_errno("strdup");
403 		goto done;
404 	}
405 
406 	(*graph)->node_ids = got_object_idset_alloc();
407 	if ((*graph)->node_ids == NULL) {
408 		err = got_error_from_errno("got_object_idset_alloc");
409 		goto done;
410 	}
411 
412 	(*graph)->open_branches = got_object_idset_alloc();
413 	if ((*graph)->open_branches == NULL) {
414 		err = got_error_from_errno("got_object_idset_alloc");
415 		goto done;
416 	}
417 
418 	if (first_parent_traversal)
419 		(*graph)->flags |= GOT_COMMIT_GRAPH_FIRST_PARENT_TRAVERSAL;
420 done:
421 	if (err) {
422 		got_commit_graph_close(*graph);
423 		*graph = NULL;
424 	}
425 	return err;
426 }
427 
428 struct add_branch_tip_arg {
429 	struct got_commit_graph_branch_tip *tips;
430 	int ntips;
431 	struct got_repository *repo;
432 	struct got_commit_graph *graph;
433 };
434 
435 static const struct got_error *
436 add_branch_tip(struct got_object_id *commit_id, void *data, void *arg)
437 {
438 	const struct got_error *err;
439 	struct add_branch_tip_arg *a = arg;
440 	struct got_commit_graph_node *new_node;
441 	struct got_commit_object *commit;
442 
443 	err = got_object_open_as_commit(&commit, a->repo, commit_id);
444 	if (err)
445 		return err;
446 
447 	err = add_node(&new_node, a->graph, commit_id, a->repo);
448 	if (err) {
449 		got_object_commit_close(commit);
450 		return err;
451 	}
452 
453 	a->tips[a->ntips].commit_id = &new_node->id;
454 	a->tips[a->ntips].commit = commit;
455 	a->tips[a->ntips].new_node = new_node;
456 	a->ntips++;
457 
458 	return NULL;
459 }
460 
461 static const struct got_error *
462 fetch_commits_from_open_branches(struct got_commit_graph *graph,
463     struct got_repository *repo, got_cancel_cb cancel_cb, void *cancel_arg)
464 {
465 	const struct got_error *err;
466 	struct add_branch_tip_arg arg;
467 	int i, ntips;
468 
469 	ntips = got_object_idset_num_elements(graph->open_branches);
470 	if (ntips == 0)
471 		return NULL;
472 
473 	/* (Re-)allocate branch tips array if necessary. */
474 	if (graph->ntips < ntips) {
475 		struct got_commit_graph_branch_tip *tips;
476 		tips = recallocarray(graph->tips, graph->ntips, ntips,
477 		    sizeof(*tips));
478 		if (tips == NULL)
479 			return got_error_from_errno("recallocarray");
480 		graph->tips = tips;
481 		graph->ntips = ntips;
482 	}
483 	arg.tips = graph->tips;
484 	arg.ntips = 0; /* add_branch_tip() will increment */
485 	arg.repo = repo;
486 	arg.graph = graph;
487 	err = got_object_idset_for_each(graph->open_branches, add_branch_tip,
488 	    &arg);
489 	if (err)
490 		goto done;
491 
492 	for (i = 0; i < arg.ntips; i++) {
493 		struct got_object_id *commit_id;
494 		struct got_commit_object *commit;
495 		struct got_commit_graph_node *new_node;
496 		int changed;
497 
498 		if (cancel_cb) {
499 			err = (*cancel_cb)(cancel_arg);
500 			if (err)
501 				break;
502 		}
503 
504 		commit_id = arg.tips[i].commit_id;
505 		commit = arg.tips[i].commit;
506 		new_node = arg.tips[i].new_node;
507 
508 		err = detect_changed_path(&changed, commit, commit_id,
509 		    graph->path, repo);
510 		if (err) {
511 			if (err->code != GOT_ERR_NO_OBJ)
512 				break;
513 			/*
514 			 * History of the path stops here on the current
515 			 * branch. Keep going on other branches.
516 			 */
517 			err = close_branch(graph, commit_id);
518 			if (err)
519 				break;
520 			continue;
521 		}
522 		if (changed) {
523 			add_node_to_iter_list(graph, new_node,
524 			    got_object_commit_get_committer_time(commit));
525 			arg.tips[i].new_node = NULL;
526 		}
527 		err = advance_branch(graph, commit_id, commit, repo);
528 		if (err)
529 			break;
530 	}
531 done:
532 	for (i = 0; i < arg.ntips; i++) {
533 		got_object_commit_close(arg.tips[i].commit);
534 		free(arg.tips[i].new_node);
535 	}
536 	return err;
537 }
538 
539 void
540 got_commit_graph_close(struct got_commit_graph *graph)
541 {
542 	struct got_commit_graph_node *node;
543 
544 	while ((node = TAILQ_FIRST(&graph->iter_list))) {
545 		TAILQ_REMOVE(&graph->iter_list, node, entry);
546 		free(node);
547 	}
548 
549 	if (graph->open_branches)
550 		got_object_idset_free(graph->open_branches);
551 	if (graph->node_ids)
552 		got_object_idset_free(graph->node_ids);
553 	free(graph->tips);
554 	free(graph->path);
555 	free(graph);
556 }
557 
558 const struct got_error *
559 got_commit_graph_iter_start(struct got_commit_graph *graph,
560     struct got_object_id *id, struct got_repository *repo,
561     got_cancel_cb cancel_cb, void *cancel_arg)
562 {
563 	const struct got_error *err = NULL;
564 
565 	if (!TAILQ_EMPTY(&graph->iter_list))
566 		return got_error(GOT_ERR_ITER_BUSY);
567 
568 	err = got_object_idset_add(graph->open_branches, id, NULL);
569 	if (err)
570 		return err;
571 
572 	/* Locate first commit which changed graph->path. */
573 	while (TAILQ_EMPTY(&graph->iter_list) &&
574 	    got_object_idset_num_elements(graph->open_branches) > 0) {
575 		err = fetch_commits_from_open_branches(graph, repo,
576 		    cancel_cb, cancel_arg);
577 		if (err)
578 			return err;
579 	}
580 
581 	if (TAILQ_EMPTY(&graph->iter_list)) {
582 		const char *path;
583 		if (got_path_is_root_dir(graph->path))
584 			return got_error_no_obj(id);
585 		path = graph->path;
586 		while (path[0] == '/')
587 			path++;
588 		return got_error_path(path, GOT_ERR_NO_TREE_ENTRY);
589 	}
590 
591 	return NULL;
592 }
593 
594 const struct got_error *
595 got_commit_graph_iter_next(struct got_object_id *id,
596     struct got_commit_graph *graph, struct got_repository *repo,
597     got_cancel_cb cancel_cb, void *cancel_arg)
598 {
599 	const struct got_error *err = NULL;
600 	struct got_commit_graph_node *node;
601 
602 	node = TAILQ_FIRST(&graph->iter_list);
603 	if (node == NULL) {
604 		/* We are done iterating, or iteration was not started. */
605 		return got_error(GOT_ERR_ITER_COMPLETED);
606 	}
607 
608 	while (TAILQ_NEXT(node, entry) == NULL &&
609 	    got_object_idset_num_elements(graph->open_branches) > 0) {
610 		err = fetch_commits_from_open_branches(graph, repo,
611 		    cancel_cb, cancel_arg);
612 		if (err)
613 			return err;
614 	}
615 
616 	memcpy(id, &node->id, sizeof(*id));
617 
618 	TAILQ_REMOVE(&graph->iter_list, node, entry);
619 	free(node);
620 	return NULL;
621 }
622 
623 static const struct got_error *
624 find_yca_add_id(struct got_object_id **yca_id, struct got_commit_graph *graph,
625     struct got_object_idset *commit_ids, struct got_repository *repo,
626     got_cancel_cb cancel_cb, void *cancel_arg)
627 {
628 	const struct got_error *err = NULL;
629 	struct got_object_id id;
630 
631 	err = got_commit_graph_iter_next(&id, graph, repo, cancel_cb,
632 	    cancel_arg);
633 	if (err)
634 		return err;
635 
636 	if (got_object_idset_contains(commit_ids, &id)) {
637 		*yca_id = got_object_id_dup(&id);
638 		if (*yca_id == NULL)
639 			err = got_error_from_errno("got_object_id_dup");
640 		return err;
641 	}
642 
643 	return got_object_idset_add(commit_ids, &id, NULL);
644 }
645 
646 /*
647  * Sets *yca_id to the youngest common ancestor of commit_id and
648  * commit_id2. Returns got_error(GOT_ERR_ANCESTRY) if they have no
649  * common ancestors.
650  *
651  * If first_parent_traversal is nonzero, only linear history is considered.
652  */
653 const struct got_error *
654 got_commit_graph_find_youngest_common_ancestor(struct got_object_id **yca_id,
655     struct got_object_id *commit_id, struct got_object_id *commit_id2,
656     int first_parent_traversal,
657     struct got_repository *repo, got_cancel_cb cancel_cb, void *cancel_arg)
658 {
659 	const struct got_error *err = NULL;
660 	struct got_commit_graph *graph = NULL, *graph2 = NULL;
661 	int completed = 0, completed2 = 0;
662 	struct got_object_idset *commit_ids;
663 
664 	*yca_id = NULL;
665 
666 	commit_ids = got_object_idset_alloc();
667 	if (commit_ids == NULL)
668 		return got_error_from_errno("got_object_idset_alloc");
669 
670 	err = got_commit_graph_open(&graph, "/", first_parent_traversal);
671 	if (err)
672 		goto done;
673 
674 	err = got_commit_graph_open(&graph2, "/", first_parent_traversal);
675 	if (err)
676 		goto done;
677 
678 	err = got_commit_graph_iter_start(graph, commit_id, repo,
679 	    cancel_cb, cancel_arg);
680 	if (err)
681 		goto done;
682 
683 	err = got_commit_graph_iter_start(graph2, commit_id2, repo,
684 	    cancel_cb, cancel_arg);
685 	if (err)
686 		goto done;
687 
688 	for (;;) {
689 		if (cancel_cb) {
690 			err = (*cancel_cb)(cancel_arg);
691 			if (err)
692 				break;
693 		}
694 
695 		if (!completed) {
696 			err = find_yca_add_id(yca_id, graph, commit_ids, repo,
697 			    cancel_cb, cancel_arg);
698 			if (err) {
699 				if (err->code != GOT_ERR_ITER_COMPLETED)
700 					break;
701 				err = NULL;
702 				completed = 1;
703 			}
704 			if (*yca_id)
705 				break;
706 		}
707 
708 		if (!completed2) {
709 			err = find_yca_add_id(yca_id, graph2, commit_ids, repo,
710 			    cancel_cb, cancel_arg);
711 			if (err) {
712 				if (err->code != GOT_ERR_ITER_COMPLETED)
713 					break;
714 				err = NULL;
715 				completed2 = 1;
716 			}
717 			if (*yca_id)
718 				break;
719 		}
720 
721 		if (completed && completed2) {
722 			err = got_error(GOT_ERR_ANCESTRY);
723 			break;
724 		}
725 	}
726 done:
727 	got_object_idset_free(commit_ids);
728 	if (graph)
729 		got_commit_graph_close(graph);
730 	if (graph2)
731 		got_commit_graph_close(graph2);
732 	return err;
733 }