Home
last modified time | relevance | path

Searched refs:RTE_NODE_NAMESIZE (Results 1 – 12 of 12) sorted by relevance

/dpdk/lib/graph/
H A Dnode.c34 if (strncmp(node->name, name, RTE_NODE_NAMESIZE) == 0) in node_from_name()
47 if (strncmp(node->name, name, RTE_NODE_NAMESIZE) == 0) { in node_has_duplicate_entry()
80 sz = sizeof(struct node) + (reg->nb_edges * RTE_NODE_NAMESIZE); in __rte_node_register()
88 if (rte_strscpy(node->name, reg->name, RTE_NODE_NAMESIZE) < 0) in __rte_node_register()
98 RTE_NODE_NAMESIZE) < 0) in __rte_node_register()
121 #define SZ RTE_NODE_NAMESIZE in clone_name()
201 if (strncmp(node->name, name, RTE_NODE_NAMESIZE) == 0) in rte_node_from_name()
259 sz = sizeof(struct node) + (max_edges * RTE_NODE_NAMESIZE); in edge_update()
272 RTE_NODE_NAMESIZE) < 0) in edge_update()
H A Drte_graph.h37 #define RTE_NODE_NAMESIZE 64 /**< Max length of node name. */ macro
211 char name[RTE_NODE_NAMESIZE]; /**< Name of the node. */
428 char name[RTE_NODE_NAMESIZE]; /**< Name of the node. */
H A Dgraph_private.h50 char name[RTE_NODE_NAMESIZE]; /**< Name of the node. */
58 char next_nodes[][RTE_NODE_NAMESIZE]; /**< Names of next nodes. */
H A Drte_graph_worker.h63 char parent[RTE_NODE_NAMESIZE]; /**< Parent node name. */
64 char name[RTE_NODE_NAMESIZE]; /**< Name of the node. */
H A Dgraph_ops.c22 RTE_NODE_NAMESIZE) == 0) { in node_has_loop_edge()
H A Dgraph.c52 RTE_NODE_NAMESIZE) == 0) in graph_node_add()
451 RTE_NODE_NAMESIZE)) in rte_graph_node_get_by_name()
H A Dgraph_populate.c125 if (strncmp(name, node->name, RTE_NODE_NAMESIZE) == 0) in graph_node_name_to_ptr()
H A Dgraph_stats.c173 memcpy(cluster->stat.name, graph_node->node->name, RTE_NODE_NAMESIZE); in stats_mem_populate()
/dpdk/app/test/
H A Dtest_graph_perf.c269 char lookup_name[RTE_NODE_NAMESIZE]; in graph_node_get()
272 snprintf(lookup_name, RTE_NODE_NAMESIZE, "%s-%s", pname, nname); in graph_node_get()
296 ename[edges] = malloc(sizeof(char) * RTE_NODE_NAMESIZE); in graph_node_count_edges()
297 snprintf(ename[edges], RTE_NODE_NAMESIZE, "%s", in graph_node_count_edges()
324 char nname[RTE_NODE_NAMESIZE / 2]; in graph_init()
393 malloc(RTE_NODE_NAMESIZE); in graph_init()
409 RTE_NODE_NAMESIZE, "%s", in graph_init()
481 ename[edges] = malloc(sizeof(char) * RTE_NODE_NAMESIZE); in graph_init()
482 snprintf(ename[edges], RTE_NODE_NAMESIZE, "%s", in graph_init()
545 ename[edges] = malloc(sizeof(char) * RTE_NODE_NAMESIZE); in graph_init()
[all …]
H A Dtest_graph.c85 char name[RTE_NODE_NAMESIZE];
700 if (strncmp(node->name, node_names[i], RTE_NODE_NAMESIZE)) { in test_graph_lookup_functions()
721 if (strncmp(node->name, node_names[i], RTE_NODE_NAMESIZE)) { in test_graph_lookup_functions()
/dpdk/lib/node/
H A Dethdev_ctrl.c27 char name[RTE_NODE_NAMESIZE]; in rte_node_eth_config()
/dpdk/examples/l3fwd-graph/
H A Dmain.c82 char node_name[RTE_NODE_NAMESIZE];
975 RTE_NODE_NAMESIZE, "ethdev_rx-%u-%u", portid, in main()