29 node_dump(FILE *f, struct node *n)  in node_dump()  argument
33 	fprintf(f, "node <%s>\n", n->name);  in node_dump()
34 	fprintf(f, "  id=%" PRIu32 "\n", n->id);  in node_dump()
35 	fprintf(f, "  flags=0x%" PRIx64 "\n", n->flags);  in node_dump()
36 	fprintf(f, "  addr=%p\n", n);  in node_dump()
37 	fprintf(f, "  process=%p\n", n->process);  in node_dump()
38 	fprintf(f, "  nb_edges=%d\n", n->nb_edges);  in node_dump()
40 	for (i = 0; i < n->nb_edges; i++)  in node_dump()
41 		fprintf(f, "     edge[%d] <%s>\n", i, n->next_nodes[i]);  in node_dump()
49 	struct rte_node *n;  in rte_graph_obj_dump()  local
63 	rte_graph_foreach_node(count, off, g, n) {  in rte_graph_obj_dump()
64 		if (!all && n->idx == 0)  in rte_graph_obj_dump()
66 		fprintf(f, "     node[%d] <%s>\n", count, n->name);  in rte_graph_obj_dump()
67 		fprintf(f, "       fence=0x%" PRIx64 "\n", n->fence);  in rte_graph_obj_dump()
68 		fprintf(f, "       objs=%p\n", n->objs);  in rte_graph_obj_dump()
69 		fprintf(f, "       process=%p\n", n->process);  in rte_graph_obj_dump()
70 		fprintf(f, "       id=0x%" PRIx32 "\n", n->id);  in rte_graph_obj_dump()
71 		fprintf(f, "       offset=0x%" PRIx32 "\n", n->off);  in rte_graph_obj_dump()
72 		fprintf(f, "       nb_edges=%" PRId32 "\n", n->nb_edges);  in rte_graph_obj_dump()
73 		fprintf(f, "       realloc_count=%d\n", n->realloc_count);  in rte_graph_obj_dump()
74 		fprintf(f, "       size=%d\n", n->size);  in rte_graph_obj_dump()
75 		fprintf(f, "       idx=%d\n", n->idx);  in rte_graph_obj_dump()
76 		fprintf(f, "       total_objs=%" PRId64 "\n", n->total_objs);  in rte_graph_obj_dump()
77 		fprintf(f, "       total_calls=%" PRId64 "\n", n->total_calls);  in rte_graph_obj_dump()
78 		for (i = 0; i < n->nb_edges; i++)  in rte_graph_obj_dump()
80 				n->nodes[i]->name);  in rte_graph_obj_dump()