| 6 | #include "graph_private.h" |
| 7 | |
| 8 | void |
| 9 | graph_dump(FILE *f, struct graph *g) |
| 10 | { |
| 11 | struct graph_node *graph_node; |
| 12 | rte_edge_t i = 0; |
| 13 | |
| 14 | fprintf(f, "graph <%s>\n", g->name); |
| 15 | fprintf(f, " id=%" PRIu32 "\n", g->id); |
| 16 | fprintf(f, " cir_start=%" PRIu32 "\n", g->cir_start); |
| 17 | fprintf(f, " cir_mask=%" PRIu32 "\n", g->cir_mask); |
| 18 | fprintf(f, " addr=%p\n", g); |
| 19 | fprintf(f, " graph=%p\n", g->graph); |
| 20 | fprintf(f, " mem_sz=%zu\n", g->mem_sz); |
| 21 | fprintf(f, " node_count=%" PRIu32 "\n", g->node_count); |
| 22 | fprintf(f, " src_node_count=%" PRIu32 "\n", g->src_node_count); |
| 23 | |
| 24 | STAILQ_FOREACH(graph_node, &g->node_list, next) |
| 25 | fprintf(f, " node[%d] <%s>\n", i++, graph_node->node->name); |
| 26 | } |
| 27 | |
| 28 | void |
| 29 | node_dump(FILE *f, struct node *n) |