Sometimes naive is best. */
| 465 | |
| 466 | /* Sometimes naive is best. */ |
| 467 | static struct hook_node *get_best_candidate(struct hook_node *graph) |
| 468 | { |
| 469 | struct hook_node *best = NULL; |
| 470 | |
| 471 | for (size_t i = 0; i < tal_count(graph); i++) { |
| 472 | if (graph[i].finished) |
| 473 | continue; |
| 474 | if (graph[i].num_incoming != 0) |
| 475 | continue; |
| 476 | if (!best |
| 477 | || best->hook->plugin->index > graph[i].hook->plugin->index) |
| 478 | best = &graph[i]; |
| 479 | } |
| 480 | return best; |
| 481 | } |
| 482 | |
| 483 | static struct plugin **plugin_hook_make_ordered(const tal_t *ctx, |
| 484 | struct plugin_hook *hook) |
no outgoing calls
no test coverage detected