11 graph_dump(FILE *f, struct graph *g)  in graph_dump()  argument
16 	fprintf(f, "graph <%s>\n", g->name);  in graph_dump()
17 	fprintf(f, "  id=%" PRIu32 "\n", g->id);  in graph_dump()
18 	fprintf(f, "  cir_start=%" PRIu32 "\n", g->cir_start);  in graph_dump()
19 	fprintf(f, "  cir_mask=%" PRIu32 "\n", g->cir_mask);  in graph_dump()
20 	fprintf(f, "  addr=%p\n", g);  in graph_dump()
21 	fprintf(f, "  graph=%p\n", g->graph);  in graph_dump()
22 	fprintf(f, "  mem_sz=%zu\n", g->mem_sz);  in graph_dump()
23 	fprintf(f, "  node_count=%" PRIu32 "\n", g->node_count);  in graph_dump()
24 	fprintf(f, "  src_node_count=%" PRIu32 "\n", g->src_node_count);  in graph_dump()
27 		fprintf(f, "     node[%d] <%s>\n", i++, graph_node->node->name);  in graph_dump()
31 node_dump(FILE *f, struct node *n)  in node_dump()  argument
35 	fprintf(f, "node <%s>\n", n->name);  in node_dump()
36 	fprintf(f, "  id=%" PRIu32 "\n", n->id);  in node_dump()
37 	fprintf(f, "  flags=0x%" PRIx64 "\n", n->flags);  in node_dump()
38 	fprintf(f, "  addr=%p\n", n);  in node_dump()
39 	fprintf(f, "  process=%p\n", n->process);  in node_dump()
40 	fprintf(f, "  nb_edges=%d\n", n->nb_edges);  in node_dump()
43 		fprintf(f, "     edge[%d] <%s>\n", i, n->next_nodes[i]);  in node_dump()
47 rte_graph_obj_dump(FILE *f, struct rte_graph *g, bool all)  in rte_graph_obj_dump()  argument
54 	fprintf(f, "graph <%s> @ %p\n", g->name, g);  in rte_graph_obj_dump()
55 	fprintf(f, "  id=%" PRIu32 "\n", g->id);  in rte_graph_obj_dump()
56 	fprintf(f, "  head=%" PRId32 "\n", (int32_t)g->head);  in rte_graph_obj_dump()
57 	fprintf(f, "  tail=%" PRId32 "\n", (int32_t)g->tail);  in rte_graph_obj_dump()
58 	fprintf(f, "  cir_mask=0x%" PRIx32 "\n", g->cir_mask);  in rte_graph_obj_dump()
59 	fprintf(f, "  nb_nodes=%" PRId32 "\n", g->nb_nodes);  in rte_graph_obj_dump()
60 	fprintf(f, "  socket=%d\n", g->socket);  in rte_graph_obj_dump()
61 	fprintf(f, "  fence=0x%" PRIx64 "\n", g->fence);  in rte_graph_obj_dump()
62 	fprintf(f, "  nodes_start=0x%" PRIx32 "\n", g->nodes_start);  in rte_graph_obj_dump()
63 	fprintf(f, "  cir_start=%p\n", g->cir_start);  in rte_graph_obj_dump()
68 		fprintf(f, "     node[%d] <%s>\n", count, n->name);  in rte_graph_obj_dump()
69 		fprintf(f, "       fence=0x%" PRIx64 "\n", n->fence);  in rte_graph_obj_dump()
70 		fprintf(f, "       objs=%p\n", n->objs);  in rte_graph_obj_dump()
71 		fprintf(f, "       process=%p\n", n->process);  in rte_graph_obj_dump()
72 		fprintf(f, "       id=0x%" PRIx32 "\n", n->id);  in rte_graph_obj_dump()
73 		fprintf(f, "       offset=0x%" PRIx32 "\n", n->off);  in rte_graph_obj_dump()
74 		fprintf(f, "       nb_edges=%" PRId32 "\n", n->nb_edges);  in rte_graph_obj_dump()
75 		fprintf(f, "       realloc_count=%d\n", n->realloc_count);  in rte_graph_obj_dump()
76 		fprintf(f, "       size=%d\n", n->size);  in rte_graph_obj_dump()
77 		fprintf(f, "       idx=%d\n", n->idx);  in rte_graph_obj_dump()
78 		fprintf(f, "       total_objs=%" PRId64 "\n", n->total_objs);  in rte_graph_obj_dump()
79 		fprintf(f, "       total_calls=%" PRId64 "\n", n->total_calls);  in rte_graph_obj_dump()
81 			fprintf(f, "          edge[%d] <%s>\n", i,  in rte_graph_obj_dump()