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 372ccdbb 2018-06-10 stsp * Graph vertices are modelled with two separate adjacency lists:
44 372ccdbb 2018-06-10 stsp * Adjacencies of a graph node are either parent (older) commits,
45 372ccdbb 2018-06-10 stsp * and child (younger) commits.
47 b43fbaa0 2018-06-11 stsp int nparents;
48 79f35eb3 2018-06-11 stsp struct got_object_id_queue parent_ids;
49 372ccdbb 2018-06-10 stsp int nchildren;
50 79f35eb3 2018-06-11 stsp struct got_object_id_queue child_ids;
52 b43fbaa0 2018-06-11 stsp time_t commit_timestamp;
54 372ccdbb 2018-06-10 stsp /* Used during graph iteration. */
55 372ccdbb 2018-06-10 stsp TAILQ_ENTRY(got_commit_graph_node) entry;
58 9ba79e04 2018-06-11 stsp TAILQ_HEAD(got_commit_graph_iter_list, got_commit_graph_node);
60 372ccdbb 2018-06-10 stsp struct got_commit_graph {
61 372ccdbb 2018-06-10 stsp /* The set of all commits we have traversed. */
62 372ccdbb 2018-06-10 stsp struct got_object_idset *node_ids;
64 372ccdbb 2018-06-10 stsp /* The commit at which traversal began (youngest commit in node_ids). */
65 372ccdbb 2018-06-10 stsp struct got_commit_graph_node *head_node;
68 0ed6ed4c 2018-06-13 stsp #define GOT_COMMIT_GRAPH_FIRST_PARENT_TRAVERSAL 0x01
71 372ccdbb 2018-06-10 stsp * A set of object IDs of known parent commits which we have not yet
72 372ccdbb 2018-06-10 stsp * traversed. Each commit ID in this set represents a branch in commit
73 372ccdbb 2018-06-10 stsp * history: Either the first-parent branch of the head node, or another
74 372ccdbb 2018-06-10 stsp * branch corresponding to a traversed merge commit for which we have
75 372ccdbb 2018-06-10 stsp * not traversed a branch point commit yet.
77 372ccdbb 2018-06-10 stsp * Whenever we add a commit with a matching ID to the graph, we remove
78 372ccdbb 2018-06-10 stsp * its corresponding element from this set, and add new elements for
79 372ccdbb 2018-06-10 stsp * each of that commit's parent commits which were not traversed yet.
81 372ccdbb 2018-06-10 stsp * When API users ask us to fetch more commits, we fetch commits from
82 372ccdbb 2018-06-10 stsp * all currently open branches. This allows API users to process
83 372ccdbb 2018-06-10 stsp * commits in linear order even though the history contains branches.
85 372ccdbb 2018-06-10 stsp struct got_object_idset *open_branches;
87 372ccdbb 2018-06-10 stsp /* The next commit to return when the API user asks for one. */
88 372ccdbb 2018-06-10 stsp struct got_commit_graph_node *iter_node;
90 9ba79e04 2018-06-11 stsp /* The graph iteration list contains all nodes in sorted order. */
91 9ba79e04 2018-06-11 stsp struct got_commit_graph_iter_list iter_list;
94 372ccdbb 2018-06-10 stsp static struct got_commit_graph *
95 372ccdbb 2018-06-10 stsp alloc_graph(void)
97 372ccdbb 2018-06-10 stsp struct got_commit_graph *graph;
99 372ccdbb 2018-06-10 stsp graph = calloc(1, sizeof(*graph));
100 372ccdbb 2018-06-10 stsp if (graph == NULL)
101 372ccdbb 2018-06-10 stsp return NULL;
103 60f2eee1 2018-07-08 stsp graph->node_ids = got_object_idset_alloc();
104 372ccdbb 2018-06-10 stsp if (graph->node_ids == NULL) {
105 372ccdbb 2018-06-10 stsp free(graph);
106 372ccdbb 2018-06-10 stsp return NULL;
109 60f2eee1 2018-07-08 stsp graph->open_branches = got_object_idset_alloc();
110 372ccdbb 2018-06-10 stsp if (graph->open_branches == NULL) {
111 372ccdbb 2018-06-10 stsp got_object_idset_free(graph->node_ids);
112 372ccdbb 2018-06-10 stsp free(graph);
113 372ccdbb 2018-06-10 stsp return NULL;
116 31920504 2018-06-11 stsp TAILQ_INIT(&graph->iter_list);
117 372ccdbb 2018-06-10 stsp return graph;
122 372ccdbb 2018-06-10 stsp is_head_node(struct got_commit_graph_node *node)
124 372ccdbb 2018-06-10 stsp return node->nchildren == 0;
128 372ccdbb 2018-06-10 stsp is_merge_point(struct got_commit_graph_node *node)
130 b43fbaa0 2018-06-11 stsp return node->nparents > 1;
134 372ccdbb 2018-06-10 stsp is_branch_point(struct got_commit_graph_node *node)
136 372ccdbb 2018-06-10 stsp return node->nchildren > 1;
140 372ccdbb 2018-06-10 stsp is_root_node(struct got_commit_graph_node *node)
142 b43fbaa0 2018-06-11 stsp return node->nparents == 0;
146 4626e416 2018-06-10 stsp static void
147 9ba79e04 2018-06-11 stsp add_node_to_iter_list(struct got_commit_graph *graph,
148 9ba79e04 2018-06-11 stsp struct got_commit_graph_node *node,
149 9ba79e04 2018-06-11 stsp struct got_commit_graph_node *child_node)
151 4bd3f2bb 2018-06-10 stsp struct got_commit_graph_node *n, *next;
153 31920504 2018-06-11 stsp if (TAILQ_EMPTY(&graph->iter_list)) {
154 31920504 2018-06-11 stsp TAILQ_INSERT_TAIL(&graph->iter_list, node, entry);
158 fe8df4c2 2018-06-16 stsp /* Ensure that an iteration in progress will see this new commit. */
159 fe8df4c2 2018-06-16 stsp if (graph->iter_node) {
160 fe8df4c2 2018-06-16 stsp n = graph->iter_node;
161 fe8df4c2 2018-06-16 stsp while (n) {
162 fe8df4c2 2018-06-16 stsp next = TAILQ_NEXT(n, entry);
163 fe8df4c2 2018-06-16 stsp if (next &&
164 fe8df4c2 2018-06-16 stsp node->commit_timestamp >= next->commit_timestamp) {
165 fe8df4c2 2018-06-16 stsp TAILQ_INSERT_BEFORE(next, node, entry);
170 fe8df4c2 2018-06-16 stsp TAILQ_INSERT_AFTER(&graph->iter_list, graph->iter_node,
171 fe8df4c2 2018-06-16 stsp node, entry);
176 58e5f354 2018-06-11 stsp * If a child node is known, begin looping over the list there
177 a37db869 2018-06-11 stsp * instead of beginning from the list head.
179 58e5f354 2018-06-11 stsp n = child_node ? child_node : TAILQ_FIRST(&graph->iter_list);
181 d2312330 2018-06-11 stsp /* Insert into list based on committer timestamp. */
183 d2312330 2018-06-11 stsp if (node->commit_timestamp == n->commit_timestamp) {
184 d2312330 2018-06-11 stsp TAILQ_INSERT_AFTER(&graph->iter_list, n, node, entry);
186 d2312330 2018-06-11 stsp } else if (node->commit_timestamp < n->commit_timestamp) {
187 4bd3f2bb 2018-06-10 stsp next = TAILQ_NEXT(n, entry);
188 4bd3f2bb 2018-06-10 stsp if (next == NULL) {
189 31920504 2018-06-11 stsp TAILQ_INSERT_AFTER(&graph->iter_list, n,
190 4bd3f2bb 2018-06-10 stsp node, entry);
193 b43fbaa0 2018-06-11 stsp if (node->commit_timestamp >= next->commit_timestamp) {
194 4bd3f2bb 2018-06-10 stsp TAILQ_INSERT_BEFORE(next, node, entry);
198 4bd3f2bb 2018-06-10 stsp TAILQ_INSERT_BEFORE(n, node, entry);
201 9ba79e04 2018-06-11 stsp n = TAILQ_NEXT(n, entry);
202 9ba79e04 2018-06-11 stsp } while (n);
205 372ccdbb 2018-06-10 stsp static const struct got_error *
206 79f35eb3 2018-06-11 stsp add_vertex(struct got_object_id_queue *ids, struct got_object_id *id)
208 79f35eb3 2018-06-11 stsp struct got_object_qid *qid;
210 79f35eb3 2018-06-11 stsp qid = calloc(1, sizeof(*qid));
211 79f35eb3 2018-06-11 stsp if (qid == NULL)
212 b43fbaa0 2018-06-11 stsp return got_error_from_errno();
214 79f35eb3 2018-06-11 stsp qid->id = got_object_id_dup(id);
215 79f35eb3 2018-06-11 stsp if (qid->id == NULL) {
216 b43fbaa0 2018-06-11 stsp const struct got_error *err = got_error_from_errno();
218 b43fbaa0 2018-06-11 stsp return err;
221 79f35eb3 2018-06-11 stsp SIMPLEQ_INSERT_TAIL(ids, qid, entry);
222 0ed6ed4c 2018-06-13 stsp return NULL;
225 0ed6ed4c 2018-06-13 stsp static const struct got_error *
226 0ed6ed4c 2018-06-13 stsp advance_open_branches(struct got_commit_graph *graph,
227 0ed6ed4c 2018-06-13 stsp struct got_commit_graph_node *node,
228 0ed6ed4c 2018-06-13 stsp struct got_object_id *commit_id, struct got_commit_object *commit)
230 0ed6ed4c 2018-06-13 stsp const struct got_error *err;
231 0ed6ed4c 2018-06-13 stsp struct got_object_qid *qid;
233 e7c810ea 2018-06-22 stsp err = got_object_idset_remove(NULL, graph->open_branches, commit_id);
234 0ed6ed4c 2018-06-13 stsp if (err && err->code != GOT_ERR_NO_OBJ)
235 0ed6ed4c 2018-06-13 stsp return err;
237 0ed6ed4c 2018-06-13 stsp if (graph->flags & GOT_COMMIT_GRAPH_FIRST_PARENT_TRAVERSAL) {
238 0ed6ed4c 2018-06-13 stsp qid = SIMPLEQ_FIRST(&commit->parent_ids);
239 0ed6ed4c 2018-06-13 stsp if (qid == NULL)
240 0ed6ed4c 2018-06-13 stsp return NULL;
241 0ed6ed4c 2018-06-13 stsp err = got_object_idset_add(NULL, graph->open_branches, qid->id,
243 0ed6ed4c 2018-06-13 stsp if (err && err->code != GOT_ERR_OBJ_EXISTS)
244 0ed6ed4c 2018-06-13 stsp return err;
245 0ed6ed4c 2018-06-13 stsp return NULL;
248 0ed6ed4c 2018-06-13 stsp SIMPLEQ_FOREACH(qid, &commit->parent_ids, entry) {
249 0ed6ed4c 2018-06-13 stsp if (got_object_idset_get(graph->node_ids, qid->id))
250 0ed6ed4c 2018-06-13 stsp continue; /* parent already traversed */
251 0ed6ed4c 2018-06-13 stsp err = got_object_idset_add(NULL, graph->open_branches,
252 0ed6ed4c 2018-06-13 stsp qid->id, node);
253 0ed6ed4c 2018-06-13 stsp if (err && err->code != GOT_ERR_OBJ_EXISTS)
254 0ed6ed4c 2018-06-13 stsp return err;
257 b43fbaa0 2018-06-11 stsp return NULL;
260 b43fbaa0 2018-06-11 stsp static const struct got_error *
261 372ccdbb 2018-06-10 stsp add_node(struct got_commit_graph_node **new_node,
262 372ccdbb 2018-06-10 stsp struct got_commit_graph *graph, struct got_object_id *commit_id,
263 9ba79e04 2018-06-11 stsp struct got_commit_object *commit, struct got_commit_graph_node *child_node)
265 372ccdbb 2018-06-10 stsp const struct got_error *err = NULL;
266 372ccdbb 2018-06-10 stsp struct got_commit_graph_node *node, *existing_node;
267 79f35eb3 2018-06-11 stsp struct got_object_qid *qid;
269 372ccdbb 2018-06-10 stsp *new_node = NULL;
271 372ccdbb 2018-06-10 stsp node = calloc(1, sizeof(*node));
272 372ccdbb 2018-06-10 stsp if (node == NULL)
273 372ccdbb 2018-06-10 stsp return got_error_from_errno();
275 372ccdbb 2018-06-10 stsp memcpy(&node->id, commit_id, sizeof(node->id));
276 b43fbaa0 2018-06-11 stsp SIMPLEQ_INIT(&node->parent_ids);
277 372ccdbb 2018-06-10 stsp SIMPLEQ_INIT(&node->child_ids);
278 79f35eb3 2018-06-11 stsp SIMPLEQ_FOREACH(qid, &commit->parent_ids, entry) {
279 79f35eb3 2018-06-11 stsp err = add_vertex(&node->parent_ids, qid->id);
281 b43fbaa0 2018-06-11 stsp return err;
282 b43fbaa0 2018-06-11 stsp node->nparents++;
284 788c352e 2018-06-16 stsp node->commit_timestamp = mktime(&commit->tm_committer);
285 788c352e 2018-06-16 stsp if (node->commit_timestamp == -1)
286 788c352e 2018-06-16 stsp return got_error_from_errno();
288 372ccdbb 2018-06-10 stsp err = got_object_idset_add((void **)(&existing_node),
289 372ccdbb 2018-06-10 stsp graph->node_ids, &node->id, node);
290 372ccdbb 2018-06-10 stsp if (err == NULL) {
291 9ba79e04 2018-06-11 stsp add_node_to_iter_list(graph, node, child_node);
292 0ed6ed4c 2018-06-13 stsp err = advance_open_branches(graph, node, commit_id, commit);
293 372ccdbb 2018-06-10 stsp *new_node = node;
294 372ccdbb 2018-06-10 stsp } else if (err->code == GOT_ERR_OBJ_EXISTS) {
295 372ccdbb 2018-06-10 stsp err = NULL;
296 372ccdbb 2018-06-10 stsp free(node);
297 372ccdbb 2018-06-10 stsp node = existing_node;
299 372ccdbb 2018-06-10 stsp free(node);
300 372ccdbb 2018-06-10 stsp return err;
303 9ba79e04 2018-06-11 stsp if (child_node) {
304 79f35eb3 2018-06-11 stsp struct got_object_qid *cid;
306 372ccdbb 2018-06-10 stsp /* Prevent linking to self. */
307 9ba79e04 2018-06-11 stsp if (got_object_id_cmp(commit_id, &child_node->id) == 0)
308 372ccdbb 2018-06-10 stsp return got_error(GOT_ERR_BAD_OBJ_ID);
310 372ccdbb 2018-06-10 stsp /* Prevent double-linking to the same child. */
311 372ccdbb 2018-06-10 stsp SIMPLEQ_FOREACH(cid, &node->child_ids, entry) {
312 9ba79e04 2018-06-11 stsp if (got_object_id_cmp(cid->id, &child_node->id) == 0)
313 372ccdbb 2018-06-10 stsp return got_error(GOT_ERR_BAD_OBJ_ID);
316 9ba79e04 2018-06-11 stsp err = add_vertex(&node->child_ids, &child_node->id);
318 372ccdbb 2018-06-10 stsp return err;
319 372ccdbb 2018-06-10 stsp node->nchildren++;
322 c4d7a9c4 2018-06-11 stsp return err;
325 c4d7a9c4 2018-06-11 stsp const struct got_error *
326 c4d7a9c4 2018-06-11 stsp got_commit_graph_open(struct got_commit_graph **graph,
327 0ed6ed4c 2018-06-13 stsp struct got_object_id *commit_id, int first_parent_traversal,
328 0ed6ed4c 2018-06-13 stsp struct got_repository *repo)
330 c4d7a9c4 2018-06-11 stsp const struct got_error *err = NULL;
331 c4d7a9c4 2018-06-11 stsp struct got_commit_object *commit;
333 c4d7a9c4 2018-06-11 stsp *graph = NULL;
335 be6a1b5a 2018-06-11 stsp err = got_object_open_as_commit(&commit, repo, commit_id);
337 372ccdbb 2018-06-10 stsp return err;
339 372ccdbb 2018-06-10 stsp *graph = alloc_graph();
340 372ccdbb 2018-06-10 stsp if (*graph == NULL) {
341 372ccdbb 2018-06-10 stsp got_object_commit_close(commit);
342 372ccdbb 2018-06-10 stsp return got_error_from_errno();
345 0ed6ed4c 2018-06-13 stsp if (first_parent_traversal)
346 0ed6ed4c 2018-06-13 stsp (*graph)->flags |= GOT_COMMIT_GRAPH_FIRST_PARENT_TRAVERSAL;
348 372ccdbb 2018-06-10 stsp err = add_node(&(*graph)->head_node, *graph, commit_id, commit, NULL);
349 b43fbaa0 2018-06-11 stsp got_object_commit_close(commit);
351 372ccdbb 2018-06-10 stsp got_commit_graph_close(*graph);
352 372ccdbb 2018-06-10 stsp *graph = NULL;
353 372ccdbb 2018-06-10 stsp return err;
356 372ccdbb 2018-06-10 stsp return NULL;
359 372ccdbb 2018-06-10 stsp struct got_commit_graph_branch {
360 372ccdbb 2018-06-10 stsp struct got_object_id parent_id;
361 372ccdbb 2018-06-10 stsp struct got_commit_graph_node *node;
364 372ccdbb 2018-06-10 stsp struct gather_branches_arg {
365 372ccdbb 2018-06-10 stsp struct got_commit_graph_branch *branches;
366 372ccdbb 2018-06-10 stsp int nbranches;
369 372ccdbb 2018-06-10 stsp static void
370 372ccdbb 2018-06-10 stsp gather_branches(struct got_object_id *id, void *data, void *arg)
372 372ccdbb 2018-06-10 stsp struct gather_branches_arg *a = arg;
373 372ccdbb 2018-06-10 stsp memcpy(&a->branches[a->nbranches].parent_id, id, sizeof(*id));
374 372ccdbb 2018-06-10 stsp a->branches[a->nbranches].node = data;
375 372ccdbb 2018-06-10 stsp a->nbranches++;
378 1142eae9 2018-06-11 stsp static const struct got_error *
379 1142eae9 2018-06-11 stsp fetch_commits_from_open_branches(int *ncommits, int *wanted_id_added,
380 1142eae9 2018-06-11 stsp struct got_commit_graph *graph, struct got_repository *repo,
381 1142eae9 2018-06-11 stsp struct got_object_id *wanted_id)
383 372ccdbb 2018-06-10 stsp const struct got_error *err;
384 372ccdbb 2018-06-10 stsp struct got_commit_graph_branch *branches;
385 372ccdbb 2018-06-10 stsp struct gather_branches_arg arg;
388 372ccdbb 2018-06-10 stsp *ncommits = 0;
389 1142eae9 2018-06-11 stsp if (wanted_id_added)
390 1142eae9 2018-06-11 stsp *wanted_id_added = 0;
392 372ccdbb 2018-06-10 stsp arg.nbranches = got_object_idset_num_elements(graph->open_branches);
393 372ccdbb 2018-06-10 stsp if (arg.nbranches == 0)
394 372ccdbb 2018-06-10 stsp return NULL;
397 372ccdbb 2018-06-10 stsp * Adding nodes to the graph might change the graph's open
398 372ccdbb 2018-06-10 stsp * branches state. Create a local copy of the current state.
400 372ccdbb 2018-06-10 stsp branches = calloc(arg.nbranches, sizeof(*branches));
401 372ccdbb 2018-06-10 stsp if (branches == NULL)
402 372ccdbb 2018-06-10 stsp return got_error_from_errno();
403 372ccdbb 2018-06-10 stsp arg.nbranches = 0; /* reset; gather_branches() will increment */
404 372ccdbb 2018-06-10 stsp arg.branches = branches;
405 372ccdbb 2018-06-10 stsp got_object_idset_for_each(graph->open_branches, gather_branches, &arg);
407 372ccdbb 2018-06-10 stsp for (i = 0; i < arg.nbranches; i++) {
408 372ccdbb 2018-06-10 stsp struct got_object_id *commit_id;
409 372ccdbb 2018-06-10 stsp struct got_commit_graph_node *child_node, *new_node;
410 372ccdbb 2018-06-10 stsp struct got_commit_object *commit;
412 372ccdbb 2018-06-10 stsp commit_id = &branches[i].parent_id;
413 372ccdbb 2018-06-10 stsp child_node = branches[i].node;
415 be6a1b5a 2018-06-11 stsp err = got_object_open_as_commit(&commit, repo, commit_id);
419 9ba79e04 2018-06-11 stsp err = add_node(&new_node, graph, commit_id, commit, child_node);
420 b43fbaa0 2018-06-11 stsp got_object_commit_close(commit);
422 372ccdbb 2018-06-10 stsp if (err->code != GOT_ERR_OBJ_EXISTS)
424 372ccdbb 2018-06-10 stsp err = NULL;
426 372ccdbb 2018-06-10 stsp if (new_node)
427 372ccdbb 2018-06-10 stsp (*ncommits)++;
428 1142eae9 2018-06-11 stsp if (wanted_id && got_object_id_cmp(commit_id, wanted_id) == 0)
429 1142eae9 2018-06-11 stsp *wanted_id_added = 1;
432 372ccdbb 2018-06-10 stsp free(branches);
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 372ccdbb 2018-06-10 stsp free_graph_node(struct got_object_id *id, void *data, void *arg)
487 372ccdbb 2018-06-10 stsp struct got_commit_graph_node *node = data;
488 372ccdbb 2018-06-10 stsp while (!SIMPLEQ_EMPTY(&node->child_ids)) {
489 79f35eb3 2018-06-11 stsp struct got_object_qid *child = SIMPLEQ_FIRST(&node->child_ids);
490 372ccdbb 2018-06-10 stsp SIMPLEQ_REMOVE_HEAD(&node->child_ids, entry);
491 372ccdbb 2018-06-10 stsp free(child);
493 372ccdbb 2018-06-10 stsp free(node);
497 372ccdbb 2018-06-10 stsp got_commit_graph_close(struct got_commit_graph *graph)
499 372ccdbb 2018-06-10 stsp got_object_idset_free(graph->open_branches);
500 372ccdbb 2018-06-10 stsp got_object_idset_for_each(graph->node_ids, free_graph_node, NULL);
501 372ccdbb 2018-06-10 stsp got_object_idset_free(graph->node_ids);
502 372ccdbb 2018-06-10 stsp free(graph);
505 372ccdbb 2018-06-10 stsp const struct got_error *
506 372ccdbb 2018-06-10 stsp got_commit_graph_iter_start(struct got_commit_graph *graph,
507 372ccdbb 2018-06-10 stsp struct got_object_id *id)
509 9ba79e04 2018-06-11 stsp struct got_commit_graph_node *start_node;
511 372ccdbb 2018-06-10 stsp start_node = got_object_idset_get(graph->node_ids, id);
512 372ccdbb 2018-06-10 stsp if (start_node == NULL)
513 372ccdbb 2018-06-10 stsp return got_error(GOT_ERR_NO_OBJ);
515 372ccdbb 2018-06-10 stsp graph->iter_node = start_node;
516 372ccdbb 2018-06-10 stsp return NULL;
519 372ccdbb 2018-06-10 stsp const struct got_error *
520 b43fbaa0 2018-06-11 stsp got_commit_graph_iter_next(struct got_object_id **id,
521 b43fbaa0 2018-06-11 stsp struct got_commit_graph *graph)
523 9ba79e04 2018-06-11 stsp *id = NULL;
525 372ccdbb 2018-06-10 stsp if (graph->iter_node == NULL) {
526 372ccdbb 2018-06-10 stsp /* We are done interating, or iteration was not started. */
527 9ba79e04 2018-06-11 stsp return got_error(GOT_ERR_ITER_COMPLETED);
530 9ba79e04 2018-06-11 stsp if (graph->iter_node ==
531 9ba79e04 2018-06-11 stsp TAILQ_LAST(&graph->iter_list, got_commit_graph_iter_list) &&
532 9ba79e04 2018-06-11 stsp got_object_idset_num_elements(graph->open_branches) == 0) {
533 9ba79e04 2018-06-11 stsp *id = &graph->iter_node->id;
534 9ba79e04 2018-06-11 stsp /* We are done interating. */
535 9ba79e04 2018-06-11 stsp graph->iter_node = NULL;
536 372ccdbb 2018-06-10 stsp return NULL;
539 9ba79e04 2018-06-11 stsp if (TAILQ_NEXT(graph->iter_node, entry) == NULL)
540 372ccdbb 2018-06-10 stsp return got_error(GOT_ERR_ITER_NEED_MORE);
542 372ccdbb 2018-06-10 stsp *id = &graph->iter_node->id;
543 9ba79e04 2018-06-11 stsp graph->iter_node = TAILQ_NEXT(graph->iter_node, entry);
544 372ccdbb 2018-06-10 stsp return NULL;
