MCPcopy Create free account
hub / github.com/git/git / next_interesting_parent

Function next_interesting_parent

graph.c:476–497  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

474}
475
476static struct commit_list *next_interesting_parent(struct git_graph *graph,
477 struct commit_list *orig)
478{
479 struct commit_list *list;
480
481 /*
482 * If revs->first_parent_only is set, only the first
483 * parent is interesting. None of the others are.
484 */
485 if (graph->revs->first_parent_only)
486 return NULL;
487
488 /*
489 * Return the next interesting commit after orig
490 */
491 for (list = orig->next; list; list = list->next) {
492 if (graph_is_interesting(graph, list->item))
493 return list;
494 }
495
496 return NULL;
497}
498
499static struct commit_list *first_interesting_parent(struct git_graph *graph)
500{

Callers 4

first_interesting_parentFunction · 0.85
graph_update_columnsFunction · 0.85
graph_updateFunction · 0.85

Calls 1

graph_is_interestingFunction · 0.85

Tested by

no test coverage detected