Home
last modified time | relevance | path

Searched refs:node_patterns (Results 1 – 6 of 6) sorted by relevance

/f-stack/dpdk/app/test/
H A Dtest_graph_perf.c322 char **node_patterns; in graph_init() local
345 node_patterns = malloc(sizeof(char *) * in graph_init()
347 if (node_patterns == NULL) { in graph_init()
381 node_patterns[graph_data->nb_nodes] = in graph_init()
397 snprintf(node_patterns[graph_data->nb_nodes], in graph_init()
444 if (node_patterns[graph_data->nb_nodes] == NULL) { in graph_init()
566 gconf.node_patterns = (const char **)(uintptr_t)node_patterns; in graph_init()
577 free(node_patterns[i]); in graph_init()
580 free(node_patterns); in graph_init()
586 free(node_patterns[i]); in graph_init()
[all …]
H A Dtest_graph.c59 const char *node_patterns[] = { variable
617 .node_patterns = node_patterns_dummy, in test_create_graph()
636 gconf.node_patterns = node_patterns; in test_create_graph()
724 rte_node_t id = rte_node_from_name(node_patterns[i]); in graph_cluster_stats_cb_t()
728 node_patterns[i], obj_stats[i], in graph_cluster_stats_cb_t()
735 node_patterns[i], fn_calls[i], in graph_cluster_stats_cb_t()
/f-stack/dpdk/examples/l3fwd-graph/
H A Dmain.c741 const char **node_patterns; in main() local
997 node_patterns = malloc((MAX_RX_QUEUE_PER_LCORE + nb_patterns) * in main()
998 sizeof(*node_patterns)); in main()
999 if (!node_patterns) in main()
1001 memcpy(node_patterns, default_patterns, in main()
1002 nb_patterns * sizeof(*node_patterns)); in main()
1005 graph_conf.node_patterns = node_patterns; in main()
1022 graph_conf.node_patterns[nb_patterns + i] = in main()
1112 free(node_patterns); in main()
/f-stack/dpdk/doc/guides/sample_app_ug/
H A Dl3_forward_graph.rst210 const char **node_patterns;
219 node_patterns = malloc((MAX_RX_QUEUE_PER_LCORE + nb_patterns) *
220 sizeof(*node_patterns));
221 memcpy(node_patterns, default_patterns,
222 nb_patterns * sizeof(*node_patterns));
227 graph_conf.node_patterns = node_patterns;
238 graph_conf.node_patterns[nb_patterns + i] =
/f-stack/dpdk/lib/librte_graph/
H A Drte_graph.h165 const char **node_patterns; member
H A Dgraph.c295 pattern = prm->node_patterns[i]; in rte_graph_create()