1 /* SPDX-License-Identifier: BSD-3-Clause 2 * Copyright(C) 2020 Marvell International Ltd. 3 */ 4 5 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) 30 { 31 rte_edge_t i; 32 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); 39 40 for (i = 0; i < n->nb_edges; i++) 41 fprintf(f, " edge[%d] <%s>\n", i, n->next_nodes[i]); 42 } 43 44 void 45 rte_graph_obj_dump(FILE *f, struct rte_graph *g, bool all) 46 { 47 rte_node_t count; 48 rte_graph_off_t off; 49 struct rte_node *n; 50 rte_edge_t i; 51 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); 62 63 rte_graph_foreach_node(count, off, g, n) { 64 if (!all && n->idx == 0) 65 continue; 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 if (rte_graph_worker_model_get(g) == RTE_GRAPH_MODEL_MCORE_DISPATCH) { 78 fprintf(f, " total_sched_objs=%" PRId64 "\n", 79 n->dispatch.total_sched_objs); 80 fprintf(f, " total_sched_fail=%" PRId64 "\n", 81 n->dispatch.total_sched_fail); 82 } 83 fprintf(f, " total_calls=%" PRId64 "\n", n->total_calls); 84 for (i = 0; i < n->nb_edges; i++) 85 fprintf(f, " edge[%d] <%s>\n", i, 86 n->nodes[i]->name); 87 } 88 } 89