| 474 | } |
| 475 | |
| 476 | static 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 | |
| 499 | static struct commit_list *first_interesting_parent(struct git_graph *graph) |
| 500 | { |
no test coverage detected