2 372ccdbb 2018-06-10 stsp * Copyright (c) 2018 Stefan Sperling <stsp@openbsd.org>
4 372ccdbb 2018-06-10 stsp * Permission to use, copy, modify, and distribute this software for any
5 372ccdbb 2018-06-10 stsp * purpose with or without fee is hereby granted, provided that the above
6 372ccdbb 2018-06-10 stsp * copyright notice and this permission notice appear in all copies.
8 372ccdbb 2018-06-10 stsp * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
9 372ccdbb 2018-06-10 stsp * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
10 372ccdbb 2018-06-10 stsp * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
11 372ccdbb 2018-06-10 stsp * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
12 372ccdbb 2018-06-10 stsp * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
13 372ccdbb 2018-06-10 stsp * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
14 372ccdbb 2018-06-10 stsp * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
17 372ccdbb 2018-06-10 stsp #include <sys/types.h>
18 372ccdbb 2018-06-10 stsp #include <sys/stat.h>
19 372ccdbb 2018-06-10 stsp #include <sys/queue.h>
20 372ccdbb 2018-06-10 stsp #include <sys/stdint.h>
22 372ccdbb 2018-06-10 stsp #include <stdio.h>
23 372ccdbb 2018-06-10 stsp #include <stdlib.h>
24 372ccdbb 2018-06-10 stsp #include <string.h>
25 372ccdbb 2018-06-10 stsp #include <sha1.h>
26 372ccdbb 2018-06-10 stsp #include <zlib.h>
27 372ccdbb 2018-06-10 stsp #include <ctype.h>
29 372ccdbb 2018-06-10 stsp #include "got_error.h"
30 372ccdbb 2018-06-10 stsp #include "got_object.h"
31 372ccdbb 2018-06-10 stsp #include "got_commit_graph.h"
33 372ccdbb 2018-06-10 stsp #include "got_lib_delta.h"
34 63581804 2018-07-09 stsp #include "got_lib_inflate.h"
35 372ccdbb 2018-06-10 stsp #include "got_lib_object.h"
36 372ccdbb 2018-06-10 stsp #include "got_lib_object_idset.h"
38 372ccdbb 2018-06-10 stsp struct got_commit_graph_node {
39 372ccdbb 2018-06-10 stsp struct got_object_id id;
42 372ccdbb 2018-06-10 stsp * Each graph node corresponds to a commit object.
43 f4ceb45e 2018-07-23 stsp * Graph vertices are modelled with an adjacency list.
44 f4ceb45e 2018-07-23 stsp * Adjacencies of a graph node are parent (older) commits.
46 b43fbaa0 2018-06-11 stsp int nparents;
47 79f35eb3 2018-06-11 stsp struct got_object_id_queue parent_ids;
49 b43fbaa0 2018-06-11 stsp time_t commit_timestamp;
51 372ccdbb 2018-06-10 stsp /* Used during graph iteration. */
52 372ccdbb 2018-06-10 stsp TAILQ_ENTRY(got_commit_graph_node) entry;
55 9ba79e04 2018-06-11 stsp TAILQ_HEAD(got_commit_graph_iter_list, got_commit_graph_node);
57 b565f6f8 2018-07-23 stsp struct got_commit_graph_branch_tip {
58 b565f6f8 2018-07-23 stsp struct got_object_id id;
59 b565f6f8 2018-07-23 stsp struct got_commit_graph_node *node;
62 372ccdbb 2018-06-10 stsp struct got_commit_graph {
63 372ccdbb 2018-06-10 stsp /* The set of all commits we have traversed. */
64 372ccdbb 2018-06-10 stsp struct got_object_idset *node_ids;
66 372ccdbb 2018-06-10 stsp /* The commit at which traversal began (youngest commit in node_ids). */
67 372ccdbb 2018-06-10 stsp struct got_commit_graph_node *head_node;
70 0ed6ed4c 2018-06-13 stsp #define GOT_COMMIT_GRAPH_FIRST_PARENT_TRAVERSAL 0x01
73 372ccdbb 2018-06-10 stsp * A set of object IDs of known parent commits which we have not yet
74 372ccdbb 2018-06-10 stsp * traversed. Each commit ID in this set represents a branch in commit
75 372ccdbb 2018-06-10 stsp * history: Either the first-parent branch of the head node, or another
76 372ccdbb 2018-06-10 stsp * branch corresponding to a traversed merge commit for which we have
77 372ccdbb 2018-06-10 stsp * not traversed a branch point commit yet.
79 372ccdbb 2018-06-10 stsp * Whenever we add a commit with a matching ID to the graph, we remove
80 372ccdbb 2018-06-10 stsp * its corresponding element from this set, and add new elements for
81 372ccdbb 2018-06-10 stsp * each of that commit's parent commits which were not traversed yet.
83 372ccdbb 2018-06-10 stsp * When API users ask us to fetch more commits, we fetch commits from
84 372ccdbb 2018-06-10 stsp * all currently open branches. This allows API users to process
85 372ccdbb 2018-06-10 stsp * commits in linear order even though the history contains branches.
87 372ccdbb 2018-06-10 stsp struct got_object_idset *open_branches;
89 b565f6f8 2018-07-23 stsp /* Copy of known branch tips for fetch_commits_from_open_branches(). */
90 b565f6f8 2018-07-23 stsp struct got_commit_graph_branch_tip *tips;
91 b565f6f8 2018-07-23 stsp size_t ntips;
92 b565f6f8 2018-07-23 stsp #define GOT_COMMIT_GRAPH_MIN_TIPS 100 /* minimum amount of tips to allocate */
94 372ccdbb 2018-06-10 stsp /* The next commit to return when the API user asks for one. */
95 372ccdbb 2018-06-10 stsp struct got_commit_graph_node *iter_node;
97 9ba79e04 2018-06-11 stsp /* The graph iteration list contains all nodes in sorted order. */
98 9ba79e04 2018-06-11 stsp struct got_commit_graph_iter_list iter_list;
101 372ccdbb 2018-06-10 stsp static struct got_commit_graph *
102 372ccdbb 2018-06-10 stsp alloc_graph(void)
104 372ccdbb 2018-06-10 stsp struct got_commit_graph *graph;
106 372ccdbb 2018-06-10 stsp graph = calloc(1, sizeof(*graph));
107 372ccdbb 2018-06-10 stsp if (graph == NULL)
108 372ccdbb 2018-06-10 stsp return NULL;
110 60f2eee1 2018-07-08 stsp graph->node_ids = got_object_idset_alloc();
111 372ccdbb 2018-06-10 stsp if (graph->node_ids == NULL) {
112 372ccdbb 2018-06-10 stsp free(graph);
113 372ccdbb 2018-06-10 stsp return NULL;
116 60f2eee1 2018-07-08 stsp graph->open_branches = got_object_idset_alloc();
117 372ccdbb 2018-06-10 stsp if (graph->open_branches == NULL) {
118 372ccdbb 2018-06-10 stsp got_object_idset_free(graph->node_ids);
119 372ccdbb 2018-06-10 stsp free(graph);
120 372ccdbb 2018-06-10 stsp return NULL;
123 31920504 2018-06-11 stsp TAILQ_INIT(&graph->iter_list);
124 372ccdbb 2018-06-10 stsp return graph;
129 372ccdbb 2018-06-10 stsp is_head_node(struct got_commit_graph_node *node)
131 372ccdbb 2018-06-10 stsp return node->nchildren == 0;
135 372ccdbb 2018-06-10 stsp is_merge_point(struct got_commit_graph_node *node)
137 b43fbaa0 2018-06-11 stsp return node->nparents > 1;
141 372ccdbb 2018-06-10 stsp is_branch_point(struct got_commit_graph_node *node)
143 372ccdbb 2018-06-10 stsp return node->nchildren > 1;
147 372ccdbb 2018-06-10 stsp is_root_node(struct got_commit_graph_node *node)
149 b43fbaa0 2018-06-11 stsp return node->nparents == 0;
153 4626e416 2018-06-10 stsp static void
154 9ba79e04 2018-06-11 stsp add_node_to_iter_list(struct got_commit_graph *graph,
155 9ba79e04 2018-06-11 stsp struct got_commit_graph_node *node,
156 9ba79e04 2018-06-11 stsp struct got_commit_graph_node *child_node)
158 4bd3f2bb 2018-06-10 stsp struct got_commit_graph_node *n, *next;
160 31920504 2018-06-11 stsp if (TAILQ_EMPTY(&graph->iter_list)) {
161 31920504 2018-06-11 stsp TAILQ_INSERT_TAIL(&graph->iter_list, node, entry);
165 fe8df4c2 2018-06-16 stsp /* Ensure that an iteration in progress will see this new commit. */
166 fe8df4c2 2018-06-16 stsp if (graph->iter_node) {
167 fe8df4c2 2018-06-16 stsp n = graph->iter_node;
168 fe8df4c2 2018-06-16 stsp while (n) {
169 fe8df4c2 2018-06-16 stsp next = TAILQ_NEXT(n, entry);
170 fe8df4c2 2018-06-16 stsp if (next &&
171 fe8df4c2 2018-06-16 stsp node->commit_timestamp >= next->commit_timestamp) {
172 fe8df4c2 2018-06-16 stsp TAILQ_INSERT_BEFORE(next, node, entry);
177 fe8df4c2 2018-06-16 stsp TAILQ_INSERT_AFTER(&graph->iter_list, graph->iter_node,
178 fe8df4c2 2018-06-16 stsp node, entry);
183 58e5f354 2018-06-11 stsp * If a child node is known, begin looping over the list there
184 a37db869 2018-06-11 stsp * instead of beginning from the list head.
186 58e5f354 2018-06-11 stsp n = child_node ? child_node : TAILQ_FIRST(&graph->iter_list);
188 d2312330 2018-06-11 stsp /* Insert into list based on committer timestamp. */
190 d2312330 2018-06-11 stsp if (node->commit_timestamp == n->commit_timestamp) {
191 d2312330 2018-06-11 stsp TAILQ_INSERT_AFTER(&graph->iter_list, n, node, entry);
193 d2312330 2018-06-11 stsp } else if (node->commit_timestamp < n->commit_timestamp) {
194 4bd3f2bb 2018-06-10 stsp next = TAILQ_NEXT(n, entry);
195 4bd3f2bb 2018-06-10 stsp if (next == NULL) {
196 31920504 2018-06-11 stsp TAILQ_INSERT_AFTER(&graph->iter_list, n,
197 4bd3f2bb 2018-06-10 stsp node, entry);
200 b43fbaa0 2018-06-11 stsp if (node->commit_timestamp >= next->commit_timestamp) {
201 4bd3f2bb 2018-06-10 stsp TAILQ_INSERT_BEFORE(next, node, entry);
205 4bd3f2bb 2018-06-10 stsp TAILQ_INSERT_BEFORE(n, node, entry);
208 9ba79e04 2018-06-11 stsp n = TAILQ_NEXT(n, entry);
209 9ba79e04 2018-06-11 stsp } while (n);
212 372ccdbb 2018-06-10 stsp static const struct got_error *
213 79f35eb3 2018-06-11 stsp add_vertex(struct got_object_id_queue *ids, struct got_object_id *id)
215 79f35eb3 2018-06-11 stsp struct got_object_qid *qid;
217 79f35eb3 2018-06-11 stsp qid = calloc(1, sizeof(*qid));
218 79f35eb3 2018-06-11 stsp if (qid == NULL)
219 b43fbaa0 2018-06-11 stsp return got_error_from_errno();
221 79f35eb3 2018-06-11 stsp qid->id = got_object_id_dup(id);
222 79f35eb3 2018-06-11 stsp if (qid->id == NULL) {
223 b43fbaa0 2018-06-11 stsp const struct got_error *err = got_error_from_errno();
224 fa2f6902 2018-07-23 stsp got_object_qid_free(qid);
225 b43fbaa0 2018-06-11 stsp return err;
228 79f35eb3 2018-06-11 stsp SIMPLEQ_INSERT_TAIL(ids, qid, entry);
229 0ed6ed4c 2018-06-13 stsp return NULL;
232 0ed6ed4c 2018-06-13 stsp static const struct got_error *
233 0ed6ed4c 2018-06-13 stsp advance_open_branches(struct got_commit_graph *graph,
234 0ed6ed4c 2018-06-13 stsp struct got_commit_graph_node *node,
235 0ed6ed4c 2018-06-13 stsp struct got_object_id *commit_id, struct got_commit_object *commit)
237 0ed6ed4c 2018-06-13 stsp const struct got_error *err;
238 0ed6ed4c 2018-06-13 stsp struct got_object_qid *qid;
240 e7c810ea 2018-06-22 stsp err = got_object_idset_remove(NULL, graph->open_branches, commit_id);
241 0ed6ed4c 2018-06-13 stsp if (err && err->code != GOT_ERR_NO_OBJ)
242 0ed6ed4c 2018-06-13 stsp return err;
244 0ed6ed4c 2018-06-13 stsp if (graph->flags & GOT_COMMIT_GRAPH_FIRST_PARENT_TRAVERSAL) {
245 0ed6ed4c 2018-06-13 stsp qid = SIMPLEQ_FIRST(&commit->parent_ids);
246 0ed6ed4c 2018-06-13 stsp if (qid == NULL)
247 0ed6ed4c 2018-06-13 stsp return NULL;
248 0ed6ed4c 2018-06-13 stsp err = got_object_idset_add(NULL, graph->open_branches, qid->id,
250 0ed6ed4c 2018-06-13 stsp if (err && err->code != GOT_ERR_OBJ_EXISTS)
251 0ed6ed4c 2018-06-13 stsp return err;
252 0ed6ed4c 2018-06-13 stsp return NULL;
255 0ed6ed4c 2018-06-13 stsp SIMPLEQ_FOREACH(qid, &commit->parent_ids, entry) {
256 0ed6ed4c 2018-06-13 stsp if (got_object_idset_get(graph->node_ids, qid->id))
257 0ed6ed4c 2018-06-13 stsp continue; /* parent already traversed */
258 0ed6ed4c 2018-06-13 stsp err = got_object_idset_add(NULL, graph->open_branches,
259 0ed6ed4c 2018-06-13 stsp qid->id, node);
260 0ed6ed4c 2018-06-13 stsp if (err && err->code != GOT_ERR_OBJ_EXISTS)
261 0ed6ed4c 2018-06-13 stsp return err;
264 b43fbaa0 2018-06-11 stsp return NULL;
267 fb5b9d5a 2018-07-23 stsp static void
268 fb5b9d5a 2018-07-23 stsp free_node(struct got_commit_graph_node *node)
270 fb5b9d5a 2018-07-23 stsp while (!SIMPLEQ_EMPTY(&node->parent_ids)) {
271 fb5b9d5a 2018-07-23 stsp struct got_object_qid *pid = SIMPLEQ_FIRST(&node->parent_ids);
272 fb5b9d5a 2018-07-23 stsp SIMPLEQ_REMOVE_HEAD(&node->parent_ids, entry);
273 fa2f6902 2018-07-23 stsp got_object_qid_free(pid);
275 fb5b9d5a 2018-07-23 stsp free(node);
278 b43fbaa0 2018-06-11 stsp static const struct got_error *
279 372ccdbb 2018-06-10 stsp add_node(struct got_commit_graph_node **new_node,
280 372ccdbb 2018-06-10 stsp struct got_commit_graph *graph, struct got_object_id *commit_id,
281 9ba79e04 2018-06-11 stsp struct got_commit_object *commit, struct got_commit_graph_node *child_node)
283 372ccdbb 2018-06-10 stsp const struct got_error *err = NULL;
284 f4ceb45e 2018-07-23 stsp struct got_commit_graph_node *node;
285 fa2f6902 2018-07-23 stsp struct got_object_qid *pid;
287 372ccdbb 2018-06-10 stsp *new_node = NULL;
289 372ccdbb 2018-06-10 stsp node = calloc(1, sizeof(*node));
290 372ccdbb 2018-06-10 stsp if (node == NULL)
291 372ccdbb 2018-06-10 stsp return got_error_from_errno();
293 372ccdbb 2018-06-10 stsp memcpy(&node->id, commit_id, sizeof(node->id));
294 b43fbaa0 2018-06-11 stsp SIMPLEQ_INIT(&node->parent_ids);
295 fa2f6902 2018-07-23 stsp SIMPLEQ_FOREACH(pid, &commit->parent_ids, entry) {
296 fa2f6902 2018-07-23 stsp err = add_vertex(&node->parent_ids, pid->id);
298 fb5b9d5a 2018-07-23 stsp free_node(node);
299 b43fbaa0 2018-06-11 stsp return err;
301 b43fbaa0 2018-06-11 stsp node->nparents++;
303 788c352e 2018-06-16 stsp node->commit_timestamp = mktime(&commit->tm_committer);
304 4e845d01 2018-07-22 stsp if (node->commit_timestamp == -1) {
305 fb5b9d5a 2018-07-23 stsp free_node(node);
306 788c352e 2018-06-16 stsp return got_error_from_errno();
309 f4ceb45e 2018-07-23 stsp err = got_object_idset_add(NULL, graph->node_ids, &node->id, node);
311 f4ceb45e 2018-07-23 stsp if (err->code == GOT_ERR_OBJ_EXISTS)
312 f4ceb45e 2018-07-23 stsp err = NULL;
313 fb5b9d5a 2018-07-23 stsp free_node(node);
314 372ccdbb 2018-06-10 stsp return err;
317 f4ceb45e 2018-07-23 stsp add_node_to_iter_list(graph, node, child_node);
318 f4ceb45e 2018-07-23 stsp err = advance_open_branches(graph, node, commit_id, commit);
320 f4ceb45e 2018-07-23 stsp free_node(node);
322 f4ceb45e 2018-07-23 stsp *new_node = node;
324 c4d7a9c4 2018-06-11 stsp return err;
327 c4d7a9c4 2018-06-11 stsp const struct got_error *
328 c4d7a9c4 2018-06-11 stsp got_commit_graph_open(struct got_commit_graph **graph,
329 0ed6ed4c 2018-06-13 stsp struct got_object_id *commit_id, int first_parent_traversal,
330 0ed6ed4c 2018-06-13 stsp struct got_repository *repo)
332 c4d7a9c4 2018-06-11 stsp const struct got_error *err = NULL;
333 c4d7a9c4 2018-06-11 stsp struct got_commit_object *commit;
335 c4d7a9c4 2018-06-11 stsp *graph = NULL;
337 be6a1b5a 2018-06-11 stsp err = got_object_open_as_commit(&commit, repo, commit_id);
339 372ccdbb 2018-06-10 stsp return err;
341 372ccdbb 2018-06-10 stsp *graph = alloc_graph();
342 372ccdbb 2018-06-10 stsp if (*graph == NULL) {
343 372ccdbb 2018-06-10 stsp got_object_commit_close(commit);
344 372ccdbb 2018-06-10 stsp return got_error_from_errno();
347 0ed6ed4c 2018-06-13 stsp if (first_parent_traversal)
348 0ed6ed4c 2018-06-13 stsp (*graph)->flags |= GOT_COMMIT_GRAPH_FIRST_PARENT_TRAVERSAL;
350 372ccdbb 2018-06-10 stsp err = add_node(&(*graph)->head_node, *graph, commit_id, commit, NULL);
351 b43fbaa0 2018-06-11 stsp got_object_commit_close(commit);
353 372ccdbb 2018-06-10 stsp got_commit_graph_close(*graph);
354 372ccdbb 2018-06-10 stsp *graph = NULL;
355 372ccdbb 2018-06-10 stsp return err;
358 372ccdbb 2018-06-10 stsp return NULL;
361 b565f6f8 2018-07-23 stsp struct gather_branch_tips_arg {
362 b565f6f8 2018-07-23 stsp struct got_commit_graph_branch_tip *tips;
366 372ccdbb 2018-06-10 stsp static void
367 b565f6f8 2018-07-23 stsp gather_branch_tips(struct got_object_id *id, void *data, void *arg)
369 b565f6f8 2018-07-23 stsp struct gather_branch_tips_arg *a = arg;
370 b565f6f8 2018-07-23 stsp memcpy(&a->tips[a->ntips].id, id, sizeof(*id));
371 b565f6f8 2018-07-23 stsp a->tips[a->ntips].node = data;
372 b565f6f8 2018-07-23 stsp a->ntips++;
375 1142eae9 2018-06-11 stsp static const struct got_error *
376 1142eae9 2018-06-11 stsp fetch_commits_from_open_branches(int *ncommits, int *wanted_id_added,
377 1142eae9 2018-06-11 stsp struct got_commit_graph *graph, struct got_repository *repo,
378 1142eae9 2018-06-11 stsp struct got_object_id *wanted_id)
380 372ccdbb 2018-06-10 stsp const struct got_error *err;
381 b565f6f8 2018-07-23 stsp struct gather_branch_tips_arg arg;
384 372ccdbb 2018-06-10 stsp *ncommits = 0;
385 1142eae9 2018-06-11 stsp if (wanted_id_added)
386 1142eae9 2018-06-11 stsp *wanted_id_added = 0;
388 b565f6f8 2018-07-23 stsp arg.ntips = got_object_idset_num_elements(graph->open_branches);
389 b565f6f8 2018-07-23 stsp if (arg.ntips == 0)
390 372ccdbb 2018-06-10 stsp return NULL;
393 372ccdbb 2018-06-10 stsp * Adding nodes to the graph might change the graph's open
394 372ccdbb 2018-06-10 stsp * branches state. Create a local copy of the current state.
396 b565f6f8 2018-07-23 stsp if (graph->ntips < arg.ntips) {
397 b565f6f8 2018-07-23 stsp struct got_commit_graph_branch_tip *tips;
398 b565f6f8 2018-07-23 stsp if (arg.ntips < GOT_COMMIT_GRAPH_MIN_TIPS)
399 b565f6f8 2018-07-23 stsp arg.ntips = GOT_COMMIT_GRAPH_MIN_TIPS;
400 b565f6f8 2018-07-23 stsp tips = reallocarray(graph->tips, arg.ntips, sizeof(*tips));
401 b565f6f8 2018-07-23 stsp if (tips == NULL)
402 b565f6f8 2018-07-23 stsp return got_error_from_errno();
403 b565f6f8 2018-07-23 stsp graph->tips = tips;
404 b565f6f8 2018-07-23 stsp graph->ntips = arg.ntips;
406 b565f6f8 2018-07-23 stsp arg.ntips = 0; /* reset; gather_branch_tips() will increment */
407 b565f6f8 2018-07-23 stsp arg.tips = graph->tips;
408 b565f6f8 2018-07-23 stsp got_object_idset_for_each(graph->open_branches,
409 b565f6f8 2018-07-23 stsp gather_branch_tips, &arg);
411 b565f6f8 2018-07-23 stsp for (i = 0; i < arg.ntips; i++) {
412 372ccdbb 2018-06-10 stsp struct got_object_id *commit_id;
413 372ccdbb 2018-06-10 stsp struct got_commit_graph_node *child_node, *new_node;
414 372ccdbb 2018-06-10 stsp struct got_commit_object *commit;
416 b565f6f8 2018-07-23 stsp commit_id = &graph->tips[i].id;
417 b565f6f8 2018-07-23 stsp child_node = graph->tips[i].node;
419 be6a1b5a 2018-06-11 stsp err = got_object_open_as_commit(&commit, repo, commit_id);
423 9ba79e04 2018-06-11 stsp err = add_node(&new_node, graph, commit_id, commit, child_node);
424 b43fbaa0 2018-06-11 stsp got_object_commit_close(commit);
427 372ccdbb 2018-06-10 stsp if (new_node)
428 372ccdbb 2018-06-10 stsp (*ncommits)++;
429 1142eae9 2018-06-11 stsp if (wanted_id && got_object_id_cmp(commit_id, wanted_id) == 0)
430 1142eae9 2018-06-11 stsp *wanted_id_added = 1;
433 372ccdbb 2018-06-10 stsp return err;
436 372ccdbb 2018-06-10 stsp const struct got_error *
437 372ccdbb 2018-06-10 stsp got_commit_graph_fetch_commits(int *nfetched, struct got_commit_graph *graph,
438 372ccdbb 2018-06-10 stsp int limit, struct got_repository *repo)
440 372ccdbb 2018-06-10 stsp const struct got_error *err;
441 1142eae9 2018-06-11 stsp int ncommits;
443 372ccdbb 2018-06-10 stsp *nfetched = 0;
445 1142eae9 2018-06-11 stsp while (*nfetched < limit) {
446 1142eae9 2018-06-11 stsp err = fetch_commits_from_open_branches(&ncommits, NULL,
447 1142eae9 2018-06-11 stsp graph, repo, NULL);
449 372ccdbb 2018-06-10 stsp return err;
450 372ccdbb 2018-06-10 stsp if (ncommits == 0)
452 1142eae9 2018-06-11 stsp *nfetched += ncommits;
455 372ccdbb 2018-06-10 stsp return NULL;
458 1142eae9 2018-06-11 stsp const struct got_error *
459 1142eae9 2018-06-11 stsp got_commit_graph_fetch_commits_up_to(int *nfetched,
460 1142eae9 2018-06-11 stsp struct got_commit_graph *graph, struct got_object_id *wanted_id,
461 1142eae9 2018-06-11 stsp struct got_repository *repo)
463 1142eae9 2018-06-11 stsp const struct got_error *err;
464 1142eae9 2018-06-11 stsp int ncommits, wanted_id_added = 0;
466 1142eae9 2018-06-11 stsp *nfetched = 0;
468 6e0c0f9a 2018-06-11 stsp if (got_object_idset_get(graph->node_ids, wanted_id) != NULL)
469 6e0c0f9a 2018-06-11 stsp return NULL;
471 1142eae9 2018-06-11 stsp while (!wanted_id_added) {
472 1142eae9 2018-06-11 stsp err = fetch_commits_from_open_branches(&ncommits,
473 1142eae9 2018-06-11 stsp &wanted_id_added, graph, repo, wanted_id);
475 1142eae9 2018-06-11 stsp return err;
476 1142eae9 2018-06-11 stsp if (ncommits == 0)
477 1142eae9 2018-06-11 stsp return NULL;
478 1142eae9 2018-06-11 stsp *nfetched += ncommits;
481 1142eae9 2018-06-11 stsp return NULL;
484 372ccdbb 2018-06-10 stsp static void
485 fb5b9d5a 2018-07-23 stsp free_node_iter(struct got_object_id *id, void *data, void *arg)
487 372ccdbb 2018-06-10 stsp struct got_commit_graph_node *node = data;
488 fb5b9d5a 2018-07-23 stsp free_node(node);
492 372ccdbb 2018-06-10 stsp got_commit_graph_close(struct got_commit_graph *graph)
494 372ccdbb 2018-06-10 stsp got_object_idset_free(graph->open_branches);
495 fb5b9d5a 2018-07-23 stsp got_object_idset_for_each(graph->node_ids, free_node_iter, NULL);
496 372ccdbb 2018-06-10 stsp got_object_idset_free(graph->node_ids);
497 b565f6f8 2018-07-23 stsp free(graph->tips);
498 372ccdbb 2018-06-10 stsp free(graph);
501 372ccdbb 2018-06-10 stsp const struct got_error *
502 372ccdbb 2018-06-10 stsp got_commit_graph_iter_start(struct got_commit_graph *graph,
503 372ccdbb 2018-06-10 stsp struct got_object_id *id)
505 9ba79e04 2018-06-11 stsp struct got_commit_graph_node *start_node;
507 372ccdbb 2018-06-10 stsp start_node = got_object_idset_get(graph->node_ids, id);
508 372ccdbb 2018-06-10 stsp if (start_node == NULL)
509 372ccdbb 2018-06-10 stsp return got_error(GOT_ERR_NO_OBJ);
511 372ccdbb 2018-06-10 stsp graph->iter_node = start_node;
512 372ccdbb 2018-06-10 stsp return NULL;
515 372ccdbb 2018-06-10 stsp const struct got_error *
516 b43fbaa0 2018-06-11 stsp got_commit_graph_iter_next(struct got_object_id **id,
517 b43fbaa0 2018-06-11 stsp struct got_commit_graph *graph)
519 9ba79e04 2018-06-11 stsp *id = NULL;
521 372ccdbb 2018-06-10 stsp if (graph->iter_node == NULL) {
522 372ccdbb 2018-06-10 stsp /* We are done interating, or iteration was not started. */
523 9ba79e04 2018-06-11 stsp return got_error(GOT_ERR_ITER_COMPLETED);
526 9ba79e04 2018-06-11 stsp if (graph->iter_node ==
527 9ba79e04 2018-06-11 stsp TAILQ_LAST(&graph->iter_list, got_commit_graph_iter_list) &&
528 9ba79e04 2018-06-11 stsp got_object_idset_num_elements(graph->open_branches) == 0) {
529 9ba79e04 2018-06-11 stsp *id = &graph->iter_node->id;
530 9ba79e04 2018-06-11 stsp /* We are done interating. */
531 9ba79e04 2018-06-11 stsp graph->iter_node = NULL;
532 372ccdbb 2018-06-10 stsp return NULL;
535 9ba79e04 2018-06-11 stsp if (TAILQ_NEXT(graph->iter_node, entry) == NULL)
536 372ccdbb 2018-06-10 stsp return got_error(GOT_ERR_ITER_NEED_MORE);
538 372ccdbb 2018-06-10 stsp *id = &graph->iter_node->id;
539 9ba79e04 2018-06-11 stsp graph->iter_node = TAILQ_NEXT(graph->iter_node, entry);
540 372ccdbb 2018-06-10 stsp return NULL;
