2 5aa81393 2020-01-06 stsp * Copyright (c) 2018, 2019, 2020 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 8b925c6c 2022-07-16 thomas #include <sys/queue.h>
21 56e0773d 2019-11-28 stsp #include <limits.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 <zlib.h>
26 372ccdbb 2018-06-10 stsp #include <ctype.h>
28 dd038bc6 2021-09-21 thomas.ad #include "got_compat.h"
30 372ccdbb 2018-06-10 stsp #include "got_error.h"
31 372ccdbb 2018-06-10 stsp #include "got_object.h"
32 6fb7cd11 2019-08-22 stsp #include "got_cancel.h"
33 372ccdbb 2018-06-10 stsp #include "got_commit_graph.h"
34 324d37e7 2019-05-11 stsp #include "got_path.h"
36 372ccdbb 2018-06-10 stsp #include "got_lib_delta.h"
37 63581804 2018-07-09 stsp #include "got_lib_inflate.h"
38 372ccdbb 2018-06-10 stsp #include "got_lib_object.h"
39 372ccdbb 2018-06-10 stsp #include "got_lib_object_idset.h"
40 827e685d 2024-03-30 thomas #include "got_lib_object_qid.h"
42 827e685d 2024-03-30 thomas #ifndef nitems
43 827e685d 2024-03-30 thomas #define nitems(_a) (sizeof((_a)) / sizeof((_a)[0]))
46 372ccdbb 2018-06-10 stsp struct got_commit_graph_node {
47 372ccdbb 2018-06-10 stsp struct got_object_id id;
49 827e685d 2024-03-30 thomas /* Used for topological sorting. */
50 827e685d 2024-03-30 thomas struct got_commit_graph_node *parents[2];
51 827e685d 2024-03-30 thomas struct got_commit_graph_node **more_parents;
52 827e685d 2024-03-30 thomas int nparents;
53 827e685d 2024-03-30 thomas int indegree;
55 ca6e02ac 2020-01-07 stsp /* Used only during iteration. */
56 ca6e02ac 2020-01-07 stsp time_t timestamp;
57 372ccdbb 2018-06-10 stsp TAILQ_ENTRY(got_commit_graph_node) entry;
60 9ba79e04 2018-06-11 stsp TAILQ_HEAD(got_commit_graph_iter_list, got_commit_graph_node);
62 b565f6f8 2018-07-23 stsp struct got_commit_graph_branch_tip {
63 32777563 2018-11-07 stsp struct got_object_id *commit_id;
64 32777563 2018-11-07 stsp struct got_commit_object *commit;
65 32777563 2018-11-07 stsp struct got_commit_graph_node *new_node;
68 372ccdbb 2018-06-10 stsp struct got_commit_graph {
69 372ccdbb 2018-06-10 stsp /* The set of all commits we have traversed. */
70 372ccdbb 2018-06-10 stsp struct got_object_idset *node_ids;
73 0ed6ed4c 2018-06-13 stsp #define GOT_COMMIT_GRAPH_FIRST_PARENT_TRAVERSAL 0x01
74 827e685d 2024-03-30 thomas #define GOT_COMMIT_GRAPH_TOPOSORT 0x02
77 372ccdbb 2018-06-10 stsp * A set of object IDs of known parent commits which we have not yet
78 372ccdbb 2018-06-10 stsp * traversed. Each commit ID in this set represents a branch in commit
79 372ccdbb 2018-06-10 stsp * history: Either the first-parent branch of the head node, or another
80 372ccdbb 2018-06-10 stsp * branch corresponding to a traversed merge commit for which we have
81 372ccdbb 2018-06-10 stsp * not traversed a branch point commit yet.
83 372ccdbb 2018-06-10 stsp * Whenever we add a commit with a matching ID to the graph, we remove
84 372ccdbb 2018-06-10 stsp * its corresponding element from this set, and add new elements for
85 372ccdbb 2018-06-10 stsp * each of that commit's parent commits which were not traversed yet.
87 372ccdbb 2018-06-10 stsp * When API users ask us to fetch more commits, we fetch commits from
88 372ccdbb 2018-06-10 stsp * all currently open branches. This allows API users to process
89 372ccdbb 2018-06-10 stsp * commits in linear order even though the history contains branches.
91 372ccdbb 2018-06-10 stsp struct got_object_idset *open_branches;
93 32777563 2018-11-07 stsp /* Array of branch tips for fetch_commits_from_open_branches(). */
94 b565f6f8 2018-07-23 stsp struct got_commit_graph_branch_tip *tips;
97 31cedeaf 2018-09-15 stsp /* Path of tree entry of interest to the API user. */
101 94489f7d 2020-01-04 stsp * Nodes which will be passed to the API user next, sorted by
102 827e685d 2024-03-30 thomas * commit timestamp. Sorted in topological order only if topological
103 827e685d 2024-03-30 thomas * sorting was requested.
105 9ba79e04 2018-06-11 stsp struct got_commit_graph_iter_list iter_list;
108 31cedeaf 2018-09-15 stsp static const struct got_error *
109 41fa1437 2018-11-05 stsp detect_changed_path(int *changed, struct got_commit_object *commit,
110 31cedeaf 2018-09-15 stsp struct got_object_id *commit_id, const char *path,
111 31cedeaf 2018-09-15 stsp struct got_repository *repo)
113 31cedeaf 2018-09-15 stsp const struct got_error *err = NULL;
114 41fa1437 2018-11-05 stsp struct got_commit_object *pcommit = NULL;
115 31cedeaf 2018-09-15 stsp struct got_tree_object *tree = NULL, *ptree = NULL;
116 31cedeaf 2018-09-15 stsp struct got_object_qid *pid;
118 31cedeaf 2018-09-15 stsp if (got_path_is_root_dir(path)) {
119 31cedeaf 2018-09-15 stsp *changed = 1;
120 31cedeaf 2018-09-15 stsp return NULL;
123 31cedeaf 2018-09-15 stsp *changed = 0;
125 dbdddfee 2021-06-23 naddy pid = STAILQ_FIRST(&commit->parent_ids);
126 31cedeaf 2018-09-15 stsp if (pid == NULL) {
127 31cedeaf 2018-09-15 stsp struct got_object_id *obj_id;
128 945f9229 2022-04-16 thomas err = got_object_id_by_path(&obj_id, repo, commit, path);
130 d1451975 2018-11-11 stsp if (err->code == GOT_ERR_NO_TREE_ENTRY)
131 fd1d2703 2018-11-04 stsp err = NULL;
133 fd1d2703 2018-11-04 stsp *changed = 1; /* The path was created in this commit. */
134 31cedeaf 2018-09-15 stsp free(obj_id);
135 0e9101d5 2018-11-18 stsp return err;
138 0e9101d5 2018-11-18 stsp err = got_object_open_as_tree(&tree, repo, commit->tree_id);
140 0e9101d5 2018-11-18 stsp return err;
142 ec242592 2022-04-22 thomas err = got_object_open_as_commit(&pcommit, repo, &pid->id);
146 0e9101d5 2018-11-18 stsp err = got_object_open_as_tree(&ptree, repo, pcommit->tree_id);
150 81a966c0 2018-11-18 stsp err = got_object_tree_path_changed(changed, tree, ptree, path, repo);
153 31cedeaf 2018-09-15 stsp got_object_tree_close(tree);
155 31cedeaf 2018-09-15 stsp got_object_tree_close(ptree);
156 31cedeaf 2018-09-15 stsp if (pcommit)
157 41fa1437 2018-11-05 stsp got_object_commit_close(pcommit);
158 31cedeaf 2018-09-15 stsp return err;
161 4626e416 2018-06-10 stsp static void
162 9ba79e04 2018-06-11 stsp add_node_to_iter_list(struct got_commit_graph *graph,
163 ca6e02ac 2020-01-07 stsp struct got_commit_graph_node *node, time_t committer_time)
165 4bd3f2bb 2018-06-10 stsp struct got_commit_graph_node *n, *next;
167 ca6e02ac 2020-01-07 stsp node->timestamp = committer_time;
169 94489f7d 2020-01-04 stsp n = TAILQ_FIRST(&graph->iter_list);
170 bee6b577 2018-09-19 stsp while (n) {
171 bee6b577 2018-09-19 stsp next = TAILQ_NEXT(n, entry);
172 73026088 2018-11-18 stsp if (next && node->timestamp >= next->timestamp) {
173 bee6b577 2018-09-19 stsp TAILQ_INSERT_BEFORE(next, node, entry);
178 93e45b7c 2018-09-24 stsp TAILQ_INSERT_TAIL(&graph->iter_list, node, entry);
181 0ed6ed4c 2018-06-13 stsp static const struct got_error *
182 ca6e02ac 2020-01-07 stsp add_node(struct got_commit_graph_node **new_node,
183 ca6e02ac 2020-01-07 stsp struct got_commit_graph *graph, struct got_object_id *commit_id,
184 ca6e02ac 2020-01-07 stsp struct got_repository *repo)
186 ca6e02ac 2020-01-07 stsp const struct got_error *err = NULL;
187 ca6e02ac 2020-01-07 stsp struct got_commit_graph_node *node;
189 ca6e02ac 2020-01-07 stsp *new_node = NULL;
191 ca6e02ac 2020-01-07 stsp node = calloc(1, sizeof(*node));
192 ca6e02ac 2020-01-07 stsp if (node == NULL)
193 ca6e02ac 2020-01-07 stsp return got_error_from_errno("calloc");
195 ca6e02ac 2020-01-07 stsp memcpy(&node->id, commit_id, sizeof(node->id));
196 827e685d 2024-03-30 thomas node->nparents = -1;
197 827e685d 2024-03-30 thomas err = got_object_idset_add(graph->node_ids, &node->id, node);
199 ca6e02ac 2020-01-07 stsp free(node);
201 ca6e02ac 2020-01-07 stsp *new_node = node;
202 ca6e02ac 2020-01-07 stsp return err;
206 ca6e02ac 2020-01-07 stsp * Ask got-read-pack to traverse first-parent history until a commit is
207 ca6e02ac 2020-01-07 stsp * encountered which modified graph->path, or until the pack file runs
208 ca6e02ac 2020-01-07 stsp * out of relevant commits. This is faster than sending an individual
209 ca6e02ac 2020-01-07 stsp * request for each commit stored in the pack file.
211 ca6e02ac 2020-01-07 stsp static const struct got_error *
212 ca6e02ac 2020-01-07 stsp packed_first_parent_traversal(int *ncommits_traversed,
213 ca6e02ac 2020-01-07 stsp struct got_commit_graph *graph, struct got_object_id *commit_id,
214 ca6e02ac 2020-01-07 stsp struct got_repository *repo)
216 ca6e02ac 2020-01-07 stsp const struct got_error *err = NULL;
217 ca6e02ac 2020-01-07 stsp struct got_object_id_queue traversed_commits;
218 ca6e02ac 2020-01-07 stsp struct got_object_qid *qid;
220 dbdddfee 2021-06-23 naddy STAILQ_INIT(&traversed_commits);
221 ca6e02ac 2020-01-07 stsp *ncommits_traversed = 0;
223 ca6e02ac 2020-01-07 stsp err = got_traverse_packed_commits(&traversed_commits,
224 ca6e02ac 2020-01-07 stsp commit_id, graph->path, repo);
226 ca6e02ac 2020-01-07 stsp return err;
228 ca6e02ac 2020-01-07 stsp /* Add all traversed commits to the graph... */
229 dbdddfee 2021-06-23 naddy STAILQ_FOREACH(qid, &traversed_commits, entry) {
230 ec242592 2022-04-22 thomas if (got_object_idset_contains(graph->open_branches, &qid->id))
232 ec242592 2022-04-22 thomas if (got_object_idset_contains(graph->node_ids, &qid->id))
235 ca6e02ac 2020-01-07 stsp (*ncommits_traversed)++;
237 ca6e02ac 2020-01-07 stsp /* ... except the last commit is the new branch tip. */
238 dbdddfee 2021-06-23 naddy if (STAILQ_NEXT(qid, entry) == NULL) {
239 ca6e02ac 2020-01-07 stsp err = got_object_idset_add(graph->open_branches,
240 ec242592 2022-04-22 thomas &qid->id, NULL);
244 99c6f580 2022-09-05 thomas err = got_object_idset_add(graph->node_ids, &qid->id, NULL);
249 ca6e02ac 2020-01-07 stsp got_object_id_queue_free(&traversed_commits);
250 ca6e02ac 2020-01-07 stsp return err;
253 ca6e02ac 2020-01-07 stsp static const struct got_error *
254 32c85d2c 2020-01-06 stsp close_branch(struct got_commit_graph *graph, struct got_object_id *commit_id)
256 32c85d2c 2020-01-06 stsp const struct got_error *err;
258 32c85d2c 2020-01-06 stsp err = got_object_idset_remove(NULL, graph->open_branches, commit_id);
259 32c85d2c 2020-01-06 stsp if (err && err->code != GOT_ERR_NO_OBJ)
260 32c85d2c 2020-01-06 stsp return err;
261 32c85d2c 2020-01-06 stsp return NULL;
264 32c85d2c 2020-01-06 stsp static const struct got_error *
265 14159a7b 2020-01-04 stsp advance_branch(struct got_commit_graph *graph, struct got_object_id *commit_id,
266 14159a7b 2020-01-04 stsp struct got_commit_object *commit, struct got_repository *repo)
268 0ed6ed4c 2018-06-13 stsp const struct got_error *err;
269 0ed6ed4c 2018-06-13 stsp struct got_object_qid *qid;
270 bae38d30 2024-02-11 thomas struct got_object_id *merged_id = NULL;
272 32c85d2c 2020-01-06 stsp err = close_branch(graph, commit_id);
274 32c85d2c 2020-01-06 stsp return err;
276 0ed6ed4c 2018-06-13 stsp if (graph->flags & GOT_COMMIT_GRAPH_FIRST_PARENT_TRAVERSAL) {
277 dbdddfee 2021-06-23 naddy qid = STAILQ_FIRST(&commit->parent_ids);
278 9b88e78c 2018-11-18 stsp if (qid == NULL ||
279 ec242592 2022-04-22 thomas got_object_idset_contains(graph->open_branches, &qid->id))
280 0ed6ed4c 2018-06-13 stsp return NULL;
282 ca6e02ac 2020-01-07 stsp * The root directory always changes by definition, and when
283 ca6e02ac 2020-01-07 stsp * logging the root we want to traverse consecutive commits
284 ca6e02ac 2020-01-07 stsp * even if they point at the same tree.
285 ca6e02ac 2020-01-07 stsp * But if we are looking for a specific path then we can avoid
286 ca6e02ac 2020-01-07 stsp * fetching packed commits which did not modify the path and
287 ca6e02ac 2020-01-07 stsp * only fetch their IDs. This speeds up 'got blame'.
289 ca6e02ac 2020-01-07 stsp if (!got_path_is_root_dir(graph->path) &&
290 ca6e02ac 2020-01-07 stsp (commit->flags & GOT_COMMIT_FLAG_PACKED)) {
291 ca6e02ac 2020-01-07 stsp int ncommits = 0;
292 ca6e02ac 2020-01-07 stsp err = packed_first_parent_traversal(&ncommits,
293 ec242592 2022-04-22 thomas graph, &qid->id, repo);
294 ca6e02ac 2020-01-07 stsp if (err || ncommits > 0)
295 ca6e02ac 2020-01-07 stsp return err;
297 9b88e78c 2018-11-18 stsp return got_object_idset_add(graph->open_branches,
298 ec242592 2022-04-22 thomas &qid->id, NULL);
302 bee6b577 2018-09-19 stsp * If we are graphing commits for a specific path, skip branches
303 bee6b577 2018-09-19 stsp * which do not contribute any content to this path.
305 7a62478b 2018-11-18 stsp if (commit->nparents > 1 && !got_path_is_root_dir(graph->path)) {
306 bae38d30 2024-02-11 thomas err = got_object_id_by_path(&merged_id, repo, commit, graph->path);
307 bae38d30 2024-02-11 thomas if (err && err->code != GOT_ERR_NO_TREE_ENTRY)
308 bae38d30 2024-02-11 thomas return err;
309 bae38d30 2024-02-11 thomas /* The requested path does not exist in this merge commit. */
311 bae38d30 2024-02-11 thomas if (commit->nparents > 1 && !got_path_is_root_dir(graph->path) &&
312 bae38d30 2024-02-11 thomas merged_id != NULL) {
313 bae38d30 2024-02-11 thomas struct got_object_id *prev_id = NULL;
314 bee6b577 2018-09-19 stsp int branches_differ = 0;
317 dbdddfee 2021-06-23 naddy STAILQ_FOREACH(qid, &commit->parent_ids, entry) {
318 945f9229 2022-04-16 thomas struct got_object_id *id = NULL;
319 945f9229 2022-04-16 thomas struct got_commit_object *pcommit = NULL;
321 8e291695 2020-01-04 stsp if (got_object_idset_contains(graph->open_branches,
322 ec242592 2022-04-22 thomas &qid->id))
325 945f9229 2022-04-16 thomas err = got_object_open_as_commit(&pcommit, repo,
326 ec242592 2022-04-22 thomas &qid->id);
327 945f9229 2022-04-16 thomas if (err) {
328 945f9229 2022-04-16 thomas free(merged_id);
329 945f9229 2022-04-16 thomas free(prev_id);
330 945f9229 2022-04-16 thomas return err;
332 945f9229 2022-04-16 thomas err = got_object_id_by_path(&id, repo, pcommit,
333 bee6b577 2018-09-19 stsp graph->path);
334 945f9229 2022-04-16 thomas got_object_commit_close(pcommit);
335 945f9229 2022-04-16 thomas pcommit = NULL;
337 d1451975 2018-11-11 stsp if (err->code == GOT_ERR_NO_TREE_ENTRY) {
338 bee6b577 2018-09-19 stsp branches_differ = 1;
341 6dcdad08 2018-11-18 stsp free(merged_id);
342 6dcdad08 2018-11-18 stsp free(prev_id);
343 bee6b577 2018-09-19 stsp return err;
346 bee6b577 2018-09-19 stsp if (prev_id) {
347 bee6b577 2018-09-19 stsp if (!branches_differ &&
348 d2c2d781 2018-11-18 stsp got_object_id_cmp(id, prev_id) != 0)
349 bee6b577 2018-09-19 stsp branches_differ = 1;
350 6dcdad08 2018-11-18 stsp free(prev_id);
352 6dcdad08 2018-11-18 stsp prev_id = id;
355 bee6b577 2018-09-19 stsp * If a branch has created the merged content we can
356 bee6b577 2018-09-19 stsp * skip any other branches.
358 bee6b577 2018-09-19 stsp if (got_object_id_cmp(merged_id, id) == 0) {
359 b36429ab 2018-11-05 stsp err = got_object_idset_add(graph->open_branches,
360 ec242592 2022-04-22 thomas &qid->id, NULL);
361 6dcdad08 2018-11-18 stsp free(merged_id);
363 b36429ab 2018-11-05 stsp return err;
367 6dcdad08 2018-11-18 stsp free(prev_id);
368 6dcdad08 2018-11-18 stsp prev_id = NULL;
369 6dcdad08 2018-11-18 stsp free(merged_id);
370 6dcdad08 2018-11-18 stsp merged_id = NULL;
373 bee6b577 2018-09-19 stsp * If the path's content is the same on all branches,
374 bee6b577 2018-09-19 stsp * follow the first parent only.
376 bee6b577 2018-09-19 stsp if (!branches_differ) {
377 dbdddfee 2021-06-23 naddy qid = STAILQ_FIRST(&commit->parent_ids);
378 bee6b577 2018-09-19 stsp if (qid == NULL)
379 bee6b577 2018-09-19 stsp return NULL;
380 8e291695 2020-01-04 stsp if (got_object_idset_contains(graph->open_branches,
381 ec242592 2022-04-22 thomas &qid->id))
382 b36429ab 2018-11-05 stsp return NULL;
383 8e291695 2020-01-04 stsp if (got_object_idset_contains(graph->node_ids,
384 ec242592 2022-04-22 thomas &qid->id))
385 998ff57f 2018-11-18 stsp return NULL; /* parent already traversed */
386 b36429ab 2018-11-05 stsp return got_object_idset_add(graph->open_branches,
387 ec242592 2022-04-22 thomas &qid->id, NULL);
391 dbdddfee 2021-06-23 naddy STAILQ_FOREACH(qid, &commit->parent_ids, entry) {
392 ec242592 2022-04-22 thomas if (got_object_idset_contains(graph->open_branches, &qid->id))
394 ec242592 2022-04-22 thomas if (got_object_idset_contains(graph->node_ids, &qid->id))
395 998ff57f 2018-11-18 stsp continue; /* parent already traversed */
396 ec242592 2022-04-22 thomas err = got_object_idset_add(graph->open_branches, &qid->id,
399 0ed6ed4c 2018-06-13 stsp return err;
402 b43fbaa0 2018-06-11 stsp return NULL;
405 de56b2d7 2020-01-04 stsp const struct got_error *
406 c4d7a9c4 2018-06-11 stsp got_commit_graph_open(struct got_commit_graph **graph,
407 3d509237 2020-01-04 stsp const char *path, int first_parent_traversal)
409 22220781 2020-01-04 stsp const struct got_error *err = NULL;
411 3ddcebf3 2020-01-04 stsp *graph = calloc(1, sizeof(**graph));
412 3d509237 2020-01-04 stsp if (*graph == NULL)
413 3ddcebf3 2020-01-04 stsp return got_error_from_errno("calloc");
415 88cdb9c6 2020-01-04 stsp TAILQ_INIT(&(*graph)->iter_list);
417 3ddcebf3 2020-01-04 stsp (*graph)->path = strdup(path);
418 3ddcebf3 2020-01-04 stsp if ((*graph)->path == NULL) {
419 3ddcebf3 2020-01-04 stsp err = got_error_from_errno("strdup");
423 3ddcebf3 2020-01-04 stsp (*graph)->node_ids = got_object_idset_alloc();
424 3ddcebf3 2020-01-04 stsp if ((*graph)->node_ids == NULL) {
425 3ddcebf3 2020-01-04 stsp err = got_error_from_errno("got_object_idset_alloc");
429 3ddcebf3 2020-01-04 stsp (*graph)->open_branches = got_object_idset_alloc();
430 3ddcebf3 2020-01-04 stsp if ((*graph)->open_branches == NULL) {
431 3ddcebf3 2020-01-04 stsp err = got_error_from_errno("got_object_idset_alloc");
435 0ed6ed4c 2018-06-13 stsp if (first_parent_traversal)
436 0ed6ed4c 2018-06-13 stsp (*graph)->flags |= GOT_COMMIT_GRAPH_FIRST_PARENT_TRAVERSAL;
439 22220781 2020-01-04 stsp got_commit_graph_close(*graph);
440 22220781 2020-01-04 stsp *graph = NULL;
442 22220781 2020-01-04 stsp return err;
445 32777563 2018-11-07 stsp struct add_branch_tip_arg {
446 b565f6f8 2018-07-23 stsp struct got_commit_graph_branch_tip *tips;
448 32777563 2018-11-07 stsp struct got_repository *repo;
449 32777563 2018-11-07 stsp struct got_commit_graph *graph;
452 cb103d04 2018-11-07 stsp static const struct got_error *
453 32777563 2018-11-07 stsp add_branch_tip(struct got_object_id *commit_id, void *data, void *arg)
455 32777563 2018-11-07 stsp const struct got_error *err;
456 32777563 2018-11-07 stsp struct add_branch_tip_arg *a = arg;
457 32777563 2018-11-07 stsp struct got_commit_graph_node *new_node;
458 32777563 2018-11-07 stsp struct got_commit_object *commit;
460 32777563 2018-11-07 stsp err = got_object_open_as_commit(&commit, a->repo, commit_id);
462 32777563 2018-11-07 stsp return err;
464 ca6e02ac 2020-01-07 stsp err = add_node(&new_node, a->graph, commit_id, a->repo);
465 07894e99 2022-09-04 thomas if (err) {
466 07894e99 2022-09-04 thomas got_object_commit_close(commit);
467 32777563 2018-11-07 stsp return err;
470 07894e99 2022-09-04 thomas a->tips[a->ntips].commit_id = &new_node->id;
471 32777563 2018-11-07 stsp a->tips[a->ntips].commit = commit;
472 32777563 2018-11-07 stsp a->tips[a->ntips].new_node = new_node;
473 b565f6f8 2018-07-23 stsp a->ntips++;
475 cb103d04 2018-11-07 stsp return NULL;
478 1142eae9 2018-06-11 stsp static const struct got_error *
479 57eecd46 2020-01-04 stsp fetch_commits_from_open_branches(struct got_commit_graph *graph,
480 6fb7cd11 2019-08-22 stsp struct got_repository *repo, got_cancel_cb cancel_cb, void *cancel_arg)
482 372ccdbb 2018-06-10 stsp const struct got_error *err;
483 32777563 2018-11-07 stsp struct add_branch_tip_arg arg;
484 32777563 2018-11-07 stsp int i, ntips;
486 32777563 2018-11-07 stsp ntips = got_object_idset_num_elements(graph->open_branches);
487 32777563 2018-11-07 stsp if (ntips == 0)
488 372ccdbb 2018-06-10 stsp return NULL;
490 32777563 2018-11-07 stsp /* (Re-)allocate branch tips array if necessary. */
491 32777563 2018-11-07 stsp if (graph->ntips < ntips) {
492 b565f6f8 2018-07-23 stsp struct got_commit_graph_branch_tip *tips;
493 5e50c36a 2018-11-08 stsp tips = recallocarray(graph->tips, graph->ntips, ntips,
494 5e50c36a 2018-11-08 stsp sizeof(*tips));
495 b565f6f8 2018-07-23 stsp if (tips == NULL)
496 638f9024 2019-05-13 stsp return got_error_from_errno("recallocarray");
497 b565f6f8 2018-07-23 stsp graph->tips = tips;
498 32777563 2018-11-07 stsp graph->ntips = ntips;
500 b565f6f8 2018-07-23 stsp arg.tips = graph->tips;
501 32777563 2018-11-07 stsp arg.ntips = 0; /* add_branch_tip() will increment */
502 32777563 2018-11-07 stsp arg.repo = repo;
503 32777563 2018-11-07 stsp arg.graph = graph;
504 32777563 2018-11-07 stsp err = got_object_idset_for_each(graph->open_branches, add_branch_tip,
509 b565f6f8 2018-07-23 stsp for (i = 0; i < arg.ntips; i++) {
510 372ccdbb 2018-06-10 stsp struct got_object_id *commit_id;
511 41fa1437 2018-11-05 stsp struct got_commit_object *commit;
512 32777563 2018-11-07 stsp struct got_commit_graph_node *new_node;
513 13a851c1 2020-01-04 stsp int changed;
515 6fb7cd11 2019-08-22 stsp if (cancel_cb) {
516 6fb7cd11 2019-08-22 stsp err = (*cancel_cb)(cancel_arg);
521 32777563 2018-11-07 stsp commit_id = arg.tips[i].commit_id;
522 32777563 2018-11-07 stsp commit = arg.tips[i].commit;
523 32777563 2018-11-07 stsp new_node = arg.tips[i].new_node;
525 13a851c1 2020-01-04 stsp err = detect_changed_path(&changed, commit, commit_id,
526 13a851c1 2020-01-04 stsp graph->path, repo);
528 13a851c1 2020-01-04 stsp if (err->code != GOT_ERR_NO_OBJ)
531 13a851c1 2020-01-04 stsp * History of the path stops here on the current
532 13a851c1 2020-01-04 stsp * branch. Keep going on other branches.
534 32c85d2c 2020-01-06 stsp err = close_branch(graph, commit_id);
539 f3933be6 2022-09-04 thomas if (changed) {
540 ca6e02ac 2020-01-07 stsp add_node_to_iter_list(graph, new_node,
541 ca6e02ac 2020-01-07 stsp got_object_commit_get_committer_time(commit));
542 f3933be6 2022-09-04 thomas arg.tips[i].new_node = NULL;
544 14159a7b 2020-01-04 stsp err = advance_branch(graph, commit_id, commit, repo);
549 f3933be6 2022-09-04 thomas for (i = 0; i < arg.ntips; i++) {
550 32777563 2018-11-07 stsp got_object_commit_close(arg.tips[i].commit);
551 f3933be6 2022-09-04 thomas free(arg.tips[i].new_node);
553 372ccdbb 2018-06-10 stsp return err;
557 372ccdbb 2018-06-10 stsp got_commit_graph_close(struct got_commit_graph *graph)
559 599785e8 2022-09-04 thomas struct got_commit_graph_node *node;
561 599785e8 2022-09-04 thomas while ((node = TAILQ_FIRST(&graph->iter_list))) {
562 599785e8 2022-09-04 thomas TAILQ_REMOVE(&graph->iter_list, node, entry);
563 827e685d 2024-03-30 thomas free(node->more_parents);
564 599785e8 2022-09-04 thomas free(node);
567 22220781 2020-01-04 stsp if (graph->open_branches)
568 22220781 2020-01-04 stsp got_object_idset_free(graph->open_branches);
569 22220781 2020-01-04 stsp if (graph->node_ids)
570 22220781 2020-01-04 stsp got_object_idset_free(graph->node_ids);
571 b565f6f8 2018-07-23 stsp free(graph->tips);
572 31cedeaf 2018-09-15 stsp free(graph->path);
573 372ccdbb 2018-06-10 stsp free(graph);
576 e06005c3 2024-03-30 thomas static const struct got_error *
577 e06005c3 2024-03-30 thomas remove_branch_tip(struct got_object_id *commit_id, void *data, void *arg)
579 e06005c3 2024-03-30 thomas struct got_object_idset *open_branches = arg;
581 e06005c3 2024-03-30 thomas return got_object_idset_remove(NULL, open_branches, commit_id);
584 372ccdbb 2018-06-10 stsp const struct got_error *
585 0279329d 2024-03-30 thomas got_commit_graph_bfsort(struct got_commit_graph *graph,
586 6fb7cd11 2019-08-22 stsp struct got_object_id *id, struct got_repository *repo,
587 6fb7cd11 2019-08-22 stsp got_cancel_cb cancel_cb, void *cancel_arg)
589 31cedeaf 2018-09-15 stsp const struct got_error *err = NULL;
590 e06005c3 2024-03-30 thomas struct got_commit_graph_node *node;
592 827e685d 2024-03-30 thomas graph->flags &= ~GOT_COMMIT_GRAPH_TOPOSORT;
594 e06005c3 2024-03-30 thomas /* Clear left-over state from previous iteration attempts. */
595 e06005c3 2024-03-30 thomas while ((node = TAILQ_FIRST(&graph->iter_list)))
596 e06005c3 2024-03-30 thomas TAILQ_REMOVE(&graph->iter_list, node, entry);
597 e06005c3 2024-03-30 thomas err = got_object_idset_for_each(graph->open_branches,
598 e06005c3 2024-03-30 thomas remove_branch_tip, graph->open_branches);
600 e06005c3 2024-03-30 thomas return err;
602 3ff3126d 2020-01-04 stsp err = got_object_idset_add(graph->open_branches, id, NULL);
604 7e33c8c5 2020-01-04 stsp return err;
606 3ff3126d 2020-01-04 stsp /* Locate first commit which changed graph->path. */
607 94489f7d 2020-01-04 stsp while (TAILQ_EMPTY(&graph->iter_list) &&
608 3ff3126d 2020-01-04 stsp got_object_idset_num_elements(graph->open_branches) > 0) {
609 3ff3126d 2020-01-04 stsp err = fetch_commits_from_open_branches(graph, repo,
610 3ff3126d 2020-01-04 stsp cancel_cb, cancel_arg);
612 7e33c8c5 2020-01-04 stsp return err;
615 94489f7d 2020-01-04 stsp if (TAILQ_EMPTY(&graph->iter_list)) {
616 5175b31a 2020-01-04 stsp const char *path;
617 5175b31a 2020-01-04 stsp if (got_path_is_root_dir(graph->path))
618 5175b31a 2020-01-04 stsp return got_error_no_obj(id);
619 5175b31a 2020-01-04 stsp path = graph->path;
620 5175b31a 2020-01-04 stsp while (path[0] == '/')
622 5175b31a 2020-01-04 stsp return got_error_path(path, GOT_ERR_NO_TREE_ENTRY);
625 7e33c8c5 2020-01-04 stsp return NULL;
628 372ccdbb 2018-06-10 stsp const struct got_error *
629 7210b715 2022-09-11 thomas got_commit_graph_iter_next(struct got_object_id *id,
630 ee780d5c 2020-01-04 stsp struct got_commit_graph *graph, struct got_repository *repo,
631 ee780d5c 2020-01-04 stsp got_cancel_cb cancel_cb, void *cancel_arg)
633 ee780d5c 2020-01-04 stsp const struct got_error *err = NULL;
634 827e685d 2024-03-30 thomas struct got_commit_graph_node *node, *pnode;
637 df8cd9c6 2020-01-05 stsp node = TAILQ_FIRST(&graph->iter_list);
638 df8cd9c6 2020-01-05 stsp if (node == NULL) {
639 2c7f8870 2018-09-19 stsp /* We are done iterating, or iteration was not started. */
640 9ba79e04 2018-06-11 stsp return got_error(GOT_ERR_ITER_COMPLETED);
643 827e685d 2024-03-30 thomas if (graph->flags & GOT_COMMIT_GRAPH_TOPOSORT) {
644 827e685d 2024-03-30 thomas /* At least one node with in-degree zero must exist. */
645 827e685d 2024-03-30 thomas while (node->indegree != 0)
646 827e685d 2024-03-30 thomas node = TAILQ_NEXT(node, entry);
648 827e685d 2024-03-30 thomas while (TAILQ_NEXT(node, entry) == NULL &&
649 827e685d 2024-03-30 thomas got_object_idset_num_elements(graph->open_branches) > 0) {
650 827e685d 2024-03-30 thomas err = fetch_commits_from_open_branches(graph, repo,
651 827e685d 2024-03-30 thomas cancel_cb, cancel_arg);
653 827e685d 2024-03-30 thomas return err;
657 7210b715 2022-09-11 thomas memcpy(id, &node->id, sizeof(*id));
659 94489f7d 2020-01-04 stsp TAILQ_REMOVE(&graph->iter_list, node, entry);
660 827e685d 2024-03-30 thomas if (graph->flags & GOT_COMMIT_GRAPH_TOPOSORT) {
661 827e685d 2024-03-30 thomas /* When visiting a commit decrement in-degree of all parents. */
662 827e685d 2024-03-30 thomas for (i = 0; i < node->nparents; i++) {
663 827e685d 2024-03-30 thomas if (i < nitems(node->parents))
664 827e685d 2024-03-30 thomas pnode = node->parents[i];
666 827e685d 2024-03-30 thomas pnode = node->more_parents[i];
667 827e685d 2024-03-30 thomas pnode->indegree--;
670 d68b9737 2022-09-05 thomas free(node);
671 372ccdbb 2018-06-10 stsp return NULL;
674 7210b715 2022-09-11 thomas static const struct got_error *
675 7210b715 2022-09-11 thomas find_yca_add_id(struct got_object_id **yca_id, struct got_commit_graph *graph,
676 7210b715 2022-09-11 thomas struct got_object_idset *commit_ids, struct got_repository *repo,
677 7210b715 2022-09-11 thomas got_cancel_cb cancel_cb, void *cancel_arg)
679 7210b715 2022-09-11 thomas const struct got_error *err = NULL;
680 7210b715 2022-09-11 thomas struct got_object_id id;
682 7210b715 2022-09-11 thomas err = got_commit_graph_iter_next(&id, graph, repo, cancel_cb,
683 7210b715 2022-09-11 thomas cancel_arg);
685 7210b715 2022-09-11 thomas return err;
687 7210b715 2022-09-11 thomas if (got_object_idset_contains(commit_ids, &id)) {
688 7210b715 2022-09-11 thomas *yca_id = got_object_id_dup(&id);
689 7210b715 2022-09-11 thomas if (*yca_id == NULL)
690 7210b715 2022-09-11 thomas err = got_error_from_errno("got_object_id_dup");
691 7210b715 2022-09-11 thomas return err;
694 7210b715 2022-09-11 thomas return got_object_idset_add(commit_ids, &id, NULL);
698 a4c8ed77 2023-05-25 thomas * Sets *yca_id to the youngest common ancestor of commit_id and
699 a4c8ed77 2023-05-25 thomas * commit_id2. Returns got_error(GOT_ERR_ANCESTRY) if they have no
700 a4c8ed77 2023-05-25 thomas * common ancestors.
702 a4c8ed77 2023-05-25 thomas * If first_parent_traversal is nonzero, only linear history is considered.
703 807c60e9 2024-03-30 thomas * If toposort is set then sort commits in topological order before
704 807c60e9 2024-03-30 thomas * traversing them.
706 a9833bc9 2019-05-13 stsp const struct got_error *
707 a9833bc9 2019-05-13 stsp got_commit_graph_find_youngest_common_ancestor(struct got_object_id **yca_id,
708 a9833bc9 2019-05-13 stsp struct got_object_id *commit_id, struct got_object_id *commit_id2,
709 807c60e9 2024-03-30 thomas int first_parent_traversal, int toposort, struct got_repository *repo,
710 807c60e9 2024-03-30 thomas got_cancel_cb cancel_cb, void *cancel_arg)
712 a9833bc9 2019-05-13 stsp const struct got_error *err = NULL;
713 a9833bc9 2019-05-13 stsp struct got_commit_graph *graph = NULL, *graph2 = NULL;
714 a9833bc9 2019-05-13 stsp int completed = 0, completed2 = 0;
715 a9833bc9 2019-05-13 stsp struct got_object_idset *commit_ids;
717 a9833bc9 2019-05-13 stsp *yca_id = NULL;
719 a9833bc9 2019-05-13 stsp commit_ids = got_object_idset_alloc();
720 a9833bc9 2019-05-13 stsp if (commit_ids == NULL)
721 638f9024 2019-05-13 stsp return got_error_from_errno("got_object_idset_alloc");
723 768705e3 2021-09-27 thomas err = got_commit_graph_open(&graph, "/", first_parent_traversal);
727 768705e3 2021-09-27 thomas err = got_commit_graph_open(&graph2, "/", first_parent_traversal);
731 807c60e9 2024-03-30 thomas if (toposort) {
732 807c60e9 2024-03-30 thomas err = got_commit_graph_toposort(graph, commit_id, repo,
733 807c60e9 2024-03-30 thomas cancel_cb, cancel_arg);
735 807c60e9 2024-03-30 thomas goto done;
737 807c60e9 2024-03-30 thomas err = got_commit_graph_toposort(graph2, commit_id2, repo,
738 807c60e9 2024-03-30 thomas cancel_cb, cancel_arg);
740 807c60e9 2024-03-30 thomas goto done;
742 0279329d 2024-03-30 thomas err = got_commit_graph_bfsort(graph, commit_id, repo,
743 807c60e9 2024-03-30 thomas cancel_cb, cancel_arg);
745 807c60e9 2024-03-30 thomas goto done;
747 0279329d 2024-03-30 thomas err = got_commit_graph_bfsort(graph2, commit_id2, repo,
748 807c60e9 2024-03-30 thomas cancel_cb, cancel_arg);
750 807c60e9 2024-03-30 thomas goto done;
754 6fb7cd11 2019-08-22 stsp if (cancel_cb) {
755 6fb7cd11 2019-08-22 stsp err = (*cancel_cb)(cancel_arg);
760 a9833bc9 2019-05-13 stsp if (!completed) {
761 7210b715 2022-09-11 thomas err = find_yca_add_id(yca_id, graph, commit_ids, repo,
762 ee780d5c 2020-01-04 stsp cancel_cb, cancel_arg);
764 ee780d5c 2020-01-04 stsp if (err->code != GOT_ERR_ITER_COMPLETED)
766 ee780d5c 2020-01-04 stsp err = NULL;
767 ee780d5c 2020-01-04 stsp completed = 1;
769 7210b715 2022-09-11 thomas if (*yca_id)
773 a9833bc9 2019-05-13 stsp if (!completed2) {
774 7210b715 2022-09-11 thomas err = find_yca_add_id(yca_id, graph2, commit_ids, repo,
775 ee780d5c 2020-01-04 stsp cancel_cb, cancel_arg);
777 ee780d5c 2020-01-04 stsp if (err->code != GOT_ERR_ITER_COMPLETED)
779 ee780d5c 2020-01-04 stsp err = NULL;
780 ee780d5c 2020-01-04 stsp completed2 = 1;
782 7210b715 2022-09-11 thomas if (*yca_id)
786 a9833bc9 2019-05-13 stsp if (completed && completed2) {
787 a9833bc9 2019-05-13 stsp err = got_error(GOT_ERR_ANCESTRY);
792 a9833bc9 2019-05-13 stsp got_object_idset_free(commit_ids);
794 a9833bc9 2019-05-13 stsp got_commit_graph_close(graph);
795 a9833bc9 2019-05-13 stsp if (graph2)
796 a9833bc9 2019-05-13 stsp got_commit_graph_close(graph2);
797 827e685d 2024-03-30 thomas return err;
801 827e685d 2024-03-30 thomas * Sort the graph for traversal in topological order.
803 827e685d 2024-03-30 thomas * This implementation is based on the description of topological sorting
804 827e685d 2024-03-30 thomas * of git commits by Derrick Stolee at
805 827e685d 2024-03-30 thomas * https://github.blog/2022-08-30-gits-database-internals-ii-commit-history-queries/#topological-sorting
806 827e685d 2024-03-30 thomas * which reads as follows:
808 827e685d 2024-03-30 thomas * The basic algorithm for topological sorting is Kahn’s algorithm which
809 827e685d 2024-03-30 thomas * follows two big steps:
810 827e685d 2024-03-30 thomas * 1. Walk all reachable commits, counting the number of times a commit appears
811 827e685d 2024-03-30 thomas * as a parent of another commit. Call these numbers the in-degree of the
812 827e685d 2024-03-30 thomas * commit, referencing the number of incoming edges.
813 827e685d 2024-03-30 thomas * 2. Walk the reachable commits, but only visit a commit if its in-degree
814 827e685d 2024-03-30 thomas * value is zero. When visiting a commit, decrement the in-degree value of
815 827e685d 2024-03-30 thomas * each parent.
817 827e685d 2024-03-30 thomas * This algorithm works because at least one of our starting points will
818 827e685d 2024-03-30 thomas * have in-degree zero, and then decrementing the in-degree value is similar
819 827e685d 2024-03-30 thomas * to deleting the commit from the graph, always having at least one commit
820 827e685d 2024-03-30 thomas * with in-degree zero.
822 827e685d 2024-03-30 thomas const struct got_error *
823 827e685d 2024-03-30 thomas got_commit_graph_toposort(struct got_commit_graph *graph,
824 827e685d 2024-03-30 thomas struct got_object_id *id, struct got_repository *repo,
825 827e685d 2024-03-30 thomas got_cancel_cb cancel_cb, void *cancel_arg)
827 827e685d 2024-03-30 thomas const struct got_error *err = NULL;
828 827e685d 2024-03-30 thomas struct got_commit_graph_node *node = NULL, *pnode = NULL;
829 827e685d 2024-03-30 thomas struct got_commit_object *commit = NULL;
830 827e685d 2024-03-30 thomas struct got_object_id_queue commits;
831 827e685d 2024-03-30 thomas const struct got_object_id_queue *parent_ids;
832 827e685d 2024-03-30 thomas struct got_object_qid *qid = NULL, *pid;
835 827e685d 2024-03-30 thomas STAILQ_INIT(&commits);
837 827e685d 2024-03-30 thomas if (graph->flags & GOT_COMMIT_GRAPH_FIRST_PARENT_TRAVERSAL)
838 0279329d 2024-03-30 thomas return got_commit_graph_bfsort(graph, id, repo,
839 827e685d 2024-03-30 thomas cancel_cb, cancel_arg);
841 827e685d 2024-03-30 thomas /* Clear left-over state from previous iteration attempts. */
842 827e685d 2024-03-30 thomas while ((node = TAILQ_FIRST(&graph->iter_list)))
843 827e685d 2024-03-30 thomas TAILQ_REMOVE(&graph->iter_list, node, entry);
844 827e685d 2024-03-30 thomas err = got_object_idset_for_each(graph->open_branches,
845 827e685d 2024-03-30 thomas remove_branch_tip, graph->open_branches);
847 827e685d 2024-03-30 thomas return err;
849 827e685d 2024-03-30 thomas graph->flags |= GOT_COMMIT_GRAPH_TOPOSORT;
852 827e685d 2024-03-30 thomas * Sorting the commit graph in topological order requires visiting
853 827e685d 2024-03-30 thomas * every reachable commit. This is very expensive but there are
854 827e685d 2024-03-30 thomas * ways to speed this up significantly in the future:
855 827e685d 2024-03-30 thomas * 1) Run this loop in got-read-pack if possible.
856 827e685d 2024-03-30 thomas * 2) Use Git's commit-graph file to compute the result incrementally.
857 827e685d 2024-03-30 thomas * See the blog post linked above for details.
859 827e685d 2024-03-30 thomas err = got_object_qid_alloc_partial(&qid);
861 827e685d 2024-03-30 thomas return err;
862 827e685d 2024-03-30 thomas memcpy(&qid->id, id, sizeof(qid->id));
863 827e685d 2024-03-30 thomas STAILQ_INSERT_TAIL(&commits, qid, entry);
864 827e685d 2024-03-30 thomas while (!STAILQ_EMPTY(&commits)) {
865 827e685d 2024-03-30 thomas if (cancel_cb) {
866 827e685d 2024-03-30 thomas err = (*cancel_cb)(cancel_arg);
871 827e685d 2024-03-30 thomas qid = STAILQ_FIRST(&commits);
872 827e685d 2024-03-30 thomas STAILQ_REMOVE_HEAD(&commits, entry);
873 827e685d 2024-03-30 thomas err = got_object_open_as_commit(&commit, repo, &qid->id);
877 827e685d 2024-03-30 thomas node = got_object_idset_get(graph->node_ids, &qid->id);
878 827e685d 2024-03-30 thomas if (node == NULL) {
879 827e685d 2024-03-30 thomas err = add_node(&node, graph, id, repo);
882 827e685d 2024-03-30 thomas TAILQ_INSERT_TAIL(&graph->iter_list, node, entry);
885 827e685d 2024-03-30 thomas got_object_qid_free(qid);
886 827e685d 2024-03-30 thomas qid = NULL;
888 827e685d 2024-03-30 thomas if (node->timestamp != 0) /* already traversed once */
889 827e685d 2024-03-30 thomas continue;
891 827e685d 2024-03-30 thomas if (node->nparents == -1) {
892 827e685d 2024-03-30 thomas node->nparents = got_object_commit_get_nparents(commit);
893 827e685d 2024-03-30 thomas if (node->nparents > nitems(node->parents)) {
894 827e685d 2024-03-30 thomas node->more_parents = calloc(node->nparents,
895 827e685d 2024-03-30 thomas sizeof(*node->more_parents));
896 827e685d 2024-03-30 thomas if (node->more_parents == NULL) {
897 827e685d 2024-03-30 thomas err = got_error_from_errno("calloc");
904 827e685d 2024-03-30 thomas node->timestamp = got_object_commit_get_committer_time(commit);
905 827e685d 2024-03-30 thomas parent_ids = got_object_commit_get_parent_ids(commit);
907 827e685d 2024-03-30 thomas STAILQ_FOREACH(pid, parent_ids, entry) {
908 827e685d 2024-03-30 thomas if (cancel_cb) {
909 827e685d 2024-03-30 thomas err = (*cancel_cb)(cancel_arg);
911 827e685d 2024-03-30 thomas goto done;
915 827e685d 2024-03-30 thomas * Increment the in-degree counter every time a given
916 827e685d 2024-03-30 thomas * commit appears as the parent of another commit.
918 827e685d 2024-03-30 thomas pnode = got_object_idset_get(graph->node_ids, &pid->id);
919 827e685d 2024-03-30 thomas if (pnode == NULL) {
920 827e685d 2024-03-30 thomas err = add_node(&pnode, graph, &pid->id, repo);
922 827e685d 2024-03-30 thomas goto done;
923 827e685d 2024-03-30 thomas TAILQ_INSERT_TAIL(&graph->iter_list, pnode,
926 827e685d 2024-03-30 thomas pnode->indegree++;
929 827e685d 2024-03-30 thomas * Cache parent pointers on the node to make future
930 827e685d 2024-03-30 thomas * in-degree updates easier.
932 827e685d 2024-03-30 thomas if (node->nparents <= nitems(node->parents)) {
933 827e685d 2024-03-30 thomas node->parents[i] = pnode;
935 827e685d 2024-03-30 thomas node->more_parents[i] = pnode;
936 827e685d 2024-03-30 thomas if (i < nitems(node->parents))
937 827e685d 2024-03-30 thomas node->parents[i] = pnode;
941 827e685d 2024-03-30 thomas /* Keep traversing through all parent commits. */
942 827e685d 2024-03-30 thomas err = got_object_qid_alloc_partial(&qid);
944 827e685d 2024-03-30 thomas goto done;
945 827e685d 2024-03-30 thomas memcpy(&qid->id, &pid->id, sizeof(qid->id));
946 827e685d 2024-03-30 thomas STAILQ_INSERT_TAIL(&commits, qid, entry);
947 827e685d 2024-03-30 thomas qid = NULL;
950 827e685d 2024-03-30 thomas got_object_commit_close(commit);
951 827e685d 2024-03-30 thomas commit = NULL;
954 827e685d 2024-03-30 thomas if (commit)
955 827e685d 2024-03-30 thomas got_object_commit_close(commit);
956 827e685d 2024-03-30 thomas got_object_qid_free(qid);
957 827e685d 2024-03-30 thomas got_object_id_queue_free(&commits);
958 a9833bc9 2019-05-13 stsp return err;
