Lines Matching defs:g
9 graph_dump(FILE *f, struct graph *g)
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)
54 rte_graph_obj_dump(FILE *f, struct rte_graph *g, bool all)
61 fprintf(f, "graph <%s> @ %p\n", g->name, g);
62 fprintf(f, " id=%" PRIu32 "\n", g->id);
63 fprintf(f, " head=%" PRId32 "\n", (int32_t)g->head);
64 fprintf(f, " tail=%" PRId32 "\n", (int32_t)g->tail);
65 fprintf(f, " cir_mask=0x%" PRIx32 "\n", g->cir_mask);
66 fprintf(f, " nb_nodes=%" PRId32 "\n", g->nb_nodes);
67 fprintf(f, " socket=%d\n", g->socket);
68 fprintf(f, " fence=0x%" PRIx64 "\n", g->fence);
69 fprintf(f, " nodes_start=0x%" PRIx32 "\n", g->nodes_start);
70 fprintf(f, " cir_start=%p\n", g->cir_start);
72 rte_graph_foreach_node(count, off, g, n) {
86 if (rte_graph_worker_model_get(g) == RTE_GRAPH_MODEL_MCORE_DISPATCH) {