| 32 | } |
| 33 | |
| 34 | int |
| 35 | graph_node_has_loop_edge(struct graph *graph) |
| 36 | { |
| 37 | struct graph_node *graph_node; |
| 38 | |
| 39 | STAILQ_FOREACH(graph_node, &graph->node_list, next) |
| 40 | if (node_has_loop_edge(graph_node->node)) |
| 41 | return 1; |
| 42 | |
| 43 | return 0; |
| 44 | } |
| 45 | |
| 46 | rte_node_t |
| 47 | graph_src_nodes_count(struct graph *graph) |
no test coverage detected