Home
last modified time | relevance | path

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

/f-stack/dpdk/lib/librte_graph/
H A Dversion.map39 rte_node_id_to_name;
H A Drte_graph.h511 char *rte_node_id_to_name(rte_node_t id);
H A Dgraph_populate.c84 parent = rte_node_id_to_name(pid); in graph_nodes_populate()
H A Dnode.c217 rte_node_id_to_name(rte_node_t id) in rte_node_id_to_name() function
/f-stack/dpdk/app/test/
H A Dtest_graph_perf.c287 rte_node_id_to_name(node_map[stage + 1][i])); in graph_node_count_edges()
399 rte_node_id_to_name(node_map[i][j])); in graph_init()
460 "%s", rte_node_id_to_name(src_nodes[i])); in graph_init()
472 rte_node_id_to_name(node_map[0][j])); in graph_init()
517 "%s", rte_node_id_to_name(snk_nodes[i])); in graph_init()
536 rte_node_id_to_name(snk_nodes[j])); in graph_init()
H A Dtest_graph.c462 char *name = rte_node_id_to_name(tm->test_node[i].idx); in test_lookup_functions()
/f-stack/dpdk/doc/guides/prog_guide/
H A Dgraph_lib.rst101 node. ``rte_node_from_name()``, ``rte_node_id_to_name()`` are the node