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()
26 	STAILQ_FOREACH(graph_node, &g->node_list, next)  in graph_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()
65 	rte_graph_foreach_node(count, off, g, n) {  in rte_graph_obj_dump()