1 /* SPDX-License-Identifier: BSD-3-Clause
2 * Copyright(C) 2020 Marvell International Ltd.
6 #include "graph_private.h"
9 graph_dump(FILE *f, struct graph *g)
11 struct graph_node *graph_node;
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);
24 STAILQ_FOREACH(graph_node, &g->node_list, next)
25 fprintf(f, " node[%d] <%s>\n", i++, graph_node->node->name);
29 node_dump(FILE *f, struct node *n)
33 fprintf(f, "node <%s>\n", n->name);
34 fprintf(f, " id=%" PRIu32 "\n", n->id);
35 fprintf(f, " flags=0x%" PRIx64 "\n", n->flags);
36 fprintf(f, " addr=%p\n", n);
37 fprintf(f, " process=%p\n", n->process);
38 fprintf(f, " nb_edges=%d\n", n->nb_edges);
40 for (i = 0; i < n->nb_edges; i++)
41 fprintf(f, " edge[%d] <%s>\n", i, n->next_nodes[i]);
45 rte_graph_obj_dump(FILE *f, struct rte_graph *g, bool all)
52 fprintf(f, "graph <%s> @ %p\n", g->name, g);
53 fprintf(f, " id=%" PRIu32 "\n", g->id);
54 fprintf(f, " head=%" PRId32 "\n", (int32_t)g->head);
55 fprintf(f, " tail=%" PRId32 "\n", (int32_t)g->tail);
56 fprintf(f, " cir_mask=0x%" PRIx32 "\n", g->cir_mask);
57 fprintf(f, " nb_nodes=%" PRId32 "\n", g->nb_nodes);
58 fprintf(f, " socket=%d\n", g->socket);
59 fprintf(f, " fence=0x%" PRIx64 "\n", g->fence);
60 fprintf(f, " nodes_start=0x%" PRIx32 "\n", g->nodes_start);
61 fprintf(f, " cir_start=%p\n", g->cir_start);
63 rte_graph_foreach_node(count, off, g, n) {
64 if (!all && n->idx == 0)
66 fprintf(f, " node[%d] <%s>\n", count, n->name);
67 fprintf(f, " fence=0x%" PRIx64 "\n", n->fence);
68 fprintf(f, " objs=%p\n", n->objs);
69 fprintf(f, " process=%p\n", n->process);
70 fprintf(f, " id=0x%" PRIx32 "\n", n->id);
71 fprintf(f, " offset=0x%" PRIx32 "\n", n->off);
72 fprintf(f, " nb_edges=%" PRId32 "\n", n->nb_edges);
73 fprintf(f, " realloc_count=%d\n", n->realloc_count);
74 fprintf(f, " size=%d\n", n->size);
75 fprintf(f, " idx=%d\n", n->idx);
76 fprintf(f, " total_objs=%" PRId64 "\n", n->total_objs);
77 fprintf(f, " total_calls=%" PRId64 "\n", n->total_calls);
78 for (i = 0; i < n->nb_edges; i++)
79 fprintf(f, " edge[%d] <%s>\n", i,