Home
last modified time | relevance | path

Searched refs:nb_nodes (Results 1 – 7 of 7) sorted by relevance

/f-stack/dpdk/app/test/
H A Dtest_graph_perf.c41 uint16_t nb_nodes; member
57 for (i = 0; i < graph_data->nb_nodes; i++) in graph_get_node_data()
336 graph_data->nb_nodes = 0; in graph_init()
381 node_patterns[graph_data->nb_nodes] = in graph_init()
394 graph_data->nb_nodes++; in graph_init()
404 graph_data->nb_nodes++; in graph_init()
456 graph_data->nb_nodes++; in graph_init()
464 graph_data->nb_nodes++; in graph_init()
513 graph_data->nb_nodes++; in graph_init()
521 graph_data->nb_nodes++; in graph_init()
[all …]
/f-stack/dpdk/lib/librte_graph/
H A Dgraph_stats.c25 rte_node_t nb_nodes; member
158 cluster->nodes[cluster->nb_nodes++] = node; in stats_mem_populate()
179 cluster->nodes[cluster->nb_nodes++] = node; in stats_mem_populate()
336 for (count = 0; count < cluster->nb_nodes; count++) { in cluster_node_arregate_stats()
H A Dgraph_debug.c59 fprintf(f, " nb_nodes=%" PRId32 "\n", g->nb_nodes); in rte_graph_obj_dump()
H A Drte_graph.h346 count < graph->nb_nodes; \
H A Dgraph_populate.c56 graph->nb_nodes = _graph->node_count; in graph_header_popluate()
H A Drte_graph_worker.h40 rte_node_t nb_nodes; /**< Number of nodes in the graph. */ member
/f-stack/dpdk/lib/librte_bpf/
H A Dbpf_validate.c71 uint32_t nb_nodes; member
2037 bvf->nb_nodes++; in validate()
2052 bvf->nb_nodes, in validate()
2059 if (bvf->node_colour[BLACK] != bvf->nb_nodes) { in validate()