| /dpdk/lib/graph/ |
| H A D | graph.c | 164 graph_cleanup(struct graph *graph) in graph_cleanup()
176 graph_node_init(struct graph *graph) in graph_node_init()
200 graph_node_fini(struct graph *graph) in graph_node_fini()
264 struct graph *graph; in rte_graph_create() local
360 struct graph *graph, *tmp; in rte_graph_destroy() local
393 struct graph *graph; in rte_graph_from_name() local
405 struct graph *graph; in rte_graph_id_to_name() local
420 struct graph *graph; in rte_graph_node_get() local
442 struct graph *graph; in rte_graph_node_get_by_name() local
530 struct graph *graph; in rte_graph_export() local
[all …]
|
| H A D | graph_private.h | 78 struct graph { struct
82 /**< Name of the graph. */ argument
84 /**< Memzone to store graph data. */ argument
85 rte_graph_off_t nodes_start; argument
88 /**< Number of source nodes in a graph. */ argument
89 struct rte_graph *graph; argument
94 /**< Circular buffer start offset in graph reel. */ argument
97 rte_graph_t id; argument
100 /**< Memory size of the graph. */ argument
104 /**< Nodes in a graph. */ argument
|
| H A D | graph_populate.c | 14 graph_fp_mem_calc_size(struct graph *graph) in graph_fp_mem_calc_size()
49 struct rte_graph *graph = _graph->graph; in graph_header_popluate() local
67 struct rte_graph *graph = _graph->graph; in graph_nodes_populate() local
104 graph_node_id_to_ptr(const struct rte_graph *graph, rte_node_t id) in graph_node_id_to_ptr()
118 graph_node_name_to_ptr(const struct rte_graph *graph, const char *name) in graph_node_name_to_ptr()
137 const struct rte_graph *graph = _graph->graph; in graph_node_nexts_populate() local
157 struct rte_graph *graph = _graph->graph; in graph_src_nodes_populate() local
181 graph_fp_mem_populate(struct graph *graph) in graph_fp_mem_populate()
194 graph_fp_mem_create(struct graph *graph) in graph_fp_mem_create()
214 graph_nodes_mem_destroy(struct rte_graph *graph) in graph_nodes_mem_destroy()
[all …]
|
| H A D | graph_ops.c | 34 graph_node_has_loop_edge(struct graph *graph) in graph_node_has_loop_edge()
46 graph_src_nodes_count(struct graph *graph) in graph_src_nodes_count()
63 graph_node_has_edge_to_src_node(struct graph *graph) in graph_node_has_edge_to_src_node()
86 graph_nodes_count(struct graph *graph) in graph_nodes_count()
98 graph_mark_nodes_as_not_visited(struct graph *graph) in graph_mark_nodes_as_not_visited()
107 graph_bfs(struct graph *graph, struct graph_node *start) in graph_bfs()
143 graph_has_isolated_node(struct graph *graph) in graph_has_isolated_node()
|
| H A D | rte_graph_worker.h | 132 rte_graph_walk(struct rte_graph *graph) in rte_graph_walk()
191 __rte_node_enqueue_tail_update(struct rte_graph *graph, struct rte_node *node) in __rte_node_enqueue_tail_update()
218 __rte_node_enqueue_prologue(struct rte_graph *graph, struct rte_node *node, in __rte_node_enqueue_prologue()
271 rte_node_enqueue(struct rte_graph *graph, struct rte_node *node, in rte_node_enqueue()
298 rte_node_enqueue_x1(struct rte_graph *graph, struct rte_node *node, in rte_node_enqueue_x1()
328 rte_node_enqueue_x2(struct rte_graph *graph, struct rte_node *node, in rte_node_enqueue_x2()
363 rte_node_enqueue_x4(struct rte_graph *graph, struct rte_node *node, in rte_node_enqueue_x4()
397 rte_node_enqueue_next(struct rte_graph *graph, struct rte_node *node, in rte_node_enqueue_next()
427 rte_node_next_stream_get(struct rte_graph *graph, struct rte_node *node, in rte_node_next_stream_get()
458 rte_node_next_stream_put(struct rte_graph *graph, struct rte_node *node, in rte_node_next_stream_put()
[all …]
|
| H A D | graph_stats.c | 137 struct rte_graph *graph, struct graph_node *graph_node) in stats_mem_populate()
206 cluster_add(struct cluster *cluster, struct graph *graph) in cluster_add()
243 struct graph *graph; in expand_pattern_to_cluster() local
269 struct graph *graph; in rte_graph_cluster_stats_create() local
|
| H A D | rte_graph.h | 343 #define rte_graph_foreach_node(count, off, graph, node) \ argument
|
| /dpdk/app/test/ |
| H A D | test_graph.c | 143 node_init(const struct rte_graph *graph, struct rte_node *node) in node_init()
169 test_node_worker_source(struct rte_graph *graph, struct rte_node *node, in test_node_worker_source()
214 test_node0_worker(struct rte_graph *graph, struct rte_node *node, void **objs, in test_node0_worker()
297 test_node1_worker(struct rte_graph *graph, struct rte_node *node, void **objs, in test_node1_worker()
351 test_node2_worker(struct rte_graph *graph, struct rte_node *node, void **objs, in test_node2_worker()
407 test_node3_worker(struct rte_graph *graph, struct rte_node *node, void **objs, in test_node3_worker()
666 struct rte_graph *graph = rte_graph_lookup("worker0"); in test_graph_walk() local
|
| H A D | test_graph_perf.c | 78 test_node_ctx_init(const struct rte_graph *graph, struct rte_node *node) in test_node_ctx_init()
105 test_perf_node_worker_source(struct rte_graph *graph, struct rte_node *node, in test_perf_node_worker_source()
134 test_perf_node_worker_source_burst_one(struct rte_graph *graph, in test_perf_node_worker_source_burst_one()
165 test_perf_node_worker(struct rte_graph *graph, struct rte_node *node, in test_perf_node_worker()
230 test_perf_node_sink(struct rte_graph *graph, struct rte_node *node, void **objs, in test_perf_node_sink()
616 struct rte_graph *graph; in _graph_perf_wrapper() local
|
| /dpdk/lib/node/ |
| H A D | ethdev_tx.c | 15 ethdev_tx_node_process(struct rte_graph *graph, struct rte_node *node, in ethdev_tx_node_process()
39 ethdev_tx_node_init(const struct rte_graph *graph, struct rte_node *node) in ethdev_tx_node_init()
|
| H A D | ethdev_rx.c | 17 ethdev_rx_node_process_inline(struct rte_graph *graph, struct rte_node *node, in ethdev_rx_node_process_inline()
41 ethdev_rx_node_process(struct rte_graph *graph, struct rte_node *node, in ethdev_rx_node_process()
179 ethdev_rx_node_init(const struct rte_graph *graph, struct rte_node *node) in ethdev_rx_node_init()
|
| H A D | pkt_drop.c | 9 pkt_drop_process(struct rte_graph *graph, struct rte_node *node, void **objs, in pkt_drop_process()
|
| H A D | null.c | 8 null(struct rte_graph *graph, struct rte_node *node, void **objs, in null()
|
| H A D | ip4_lookup.c | 51 ip4_lookup_node_process_scalar(struct rte_graph *graph, struct rte_node *node, in ip4_lookup_node_process_scalar()
178 ip4_lookup_node_init(const struct rte_graph *graph, struct rte_node *node) in ip4_lookup_node_init()
|
| H A D | ip4_rewrite.c | 34 ip4_rewrite_node_process(struct rte_graph *graph, struct rte_node *node, in ip4_rewrite_node_process()
259 ip4_rewrite_node_init(const struct rte_graph *graph, struct rte_node *node) in ip4_rewrite_node_init()
|
| H A D | pkt_cls.c | 30 pkt_cls_node_process(struct rte_graph *graph, struct rte_node *node, in pkt_cls_node_process()
|
| H A D | ip4_lookup_neon.h | 10 ip4_lookup_node_process_vec(struct rte_graph *graph, struct rte_node *node, in ip4_lookup_node_process_vec()
|
| H A D | ip4_lookup_sse.h | 10 ip4_lookup_node_process_vec(struct rte_graph *graph, struct rte_node *node, in ip4_lookup_node_process_vec()
|
| /dpdk/examples/l3fwd-graph/ |
| H A D | main.c | 90 struct rte_graph *graph; member
678 struct rte_graph *graph; in graph_main_loop() local
|
| /dpdk/drivers/net/mlx5/ |
| H A D | mlx5_flow.c | 321 mlx5_flow_expand_rss_skip_explicit(const struct mlx5_flow_expand_node graph[], in mlx5_flow_expand_rss_skip_explicit()
370 const struct mlx5_flow_expand_node graph[], in mlx5_flow_expand_rss()
10889 const struct mlx5_flow_expand_node graph[], in mlx5_flow_expand_rss_adjust_node()
|