Home
last modified time | relevance | path

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

/dpdk/app/test/
H A Dtest_graph_perf.c333 char **node_patterns; in graph_init() local
356 node_patterns = malloc(sizeof(char *) * in graph_init()
358 if (node_patterns == NULL) { in graph_init()
392 node_patterns[graph_data->nb_nodes] = in graph_init()
408 snprintf(node_patterns[graph_data->nb_nodes], in graph_init()
455 if (node_patterns[graph_data->nb_nodes] == NULL) { in graph_init()
577 gconf.node_patterns = (const char **)(uintptr_t)node_patterns; in graph_init()
588 free(node_patterns[i]); in graph_init()
591 free(node_patterns); in graph_init()
597 free(node_patterns[i]); in graph_init()
[all …]
H A Dtest_graph.c71 const char *node_patterns[] = { variable
635 .node_patterns = node_patterns_dummy, in test_create_graph()
654 gconf.node_patterns = node_patterns; in test_create_graph()
742 rte_node_t id = rte_node_from_name(node_patterns[i]); in graph_cluster_stats_cb_t()
746 node_patterns[i], obj_stats[i], in graph_cluster_stats_cb_t()
753 node_patterns[i], fn_calls[i], in graph_cluster_stats_cb_t()
/dpdk/examples/l3fwd-graph/
H A Dmain.c757 const char **node_patterns; in main() local
1021 node_patterns = malloc((MAX_RX_QUEUE_PER_LCORE + nb_patterns) * in main()
1022 sizeof(*node_patterns)); in main()
1023 if (!node_patterns) in main()
1025 memcpy(node_patterns, default_patterns, in main()
1026 nb_patterns * sizeof(*node_patterns)); in main()
1029 graph_conf.node_patterns = node_patterns; in main()
1046 graph_conf.node_patterns[nb_patterns + i] = in main()
1138 free(node_patterns); in main()
/dpdk/lib/graph/
H A Drte_graph.h165 const char **node_patterns; member
H A Dgraph.c295 pattern = prm->node_patterns[i]; in rte_graph_create()