| 34 | } |
| 35 | |
| 36 | static rte_graph_t |
| 37 | graph_next_free_id(void) |
| 38 | { |
| 39 | struct graph *graph; |
| 40 | rte_graph_t id = 0; |
| 41 | |
| 42 | STAILQ_FOREACH(graph, &graph_list, next) { |
| 43 | if (id < graph->id) |
| 44 | break; |
| 45 | id = graph->id + 1; |
| 46 | } |
| 47 | |
| 48 | return id; |
| 49 | } |
| 50 | |
| 51 | static void |
| 52 | graph_insert_ordered(struct graph *graph) |
no outgoing calls
no test coverage detected