Home
last modified time | relevance | path

Searched refs:rte_graph (Results 1 – 23 of 23) sorted by relevance

/dpdk/lib/graph/
H A Drte_graph_worker.h36 struct rte_graph { struct
118 void __rte_node_stream_alloc_size(struct rte_graph *graph,
132 rte_graph_walk(struct rte_graph *graph) in rte_graph_walk()
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 Dgraph_populate.c21 sz = sizeof(struct rte_graph); in graph_fp_mem_calc_size()
49 struct rte_graph *graph = _graph->graph; in graph_header_popluate()
67 struct rte_graph *graph = _graph->graph; in graph_nodes_populate()
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()
157 struct rte_graph *graph = _graph->graph; in graph_src_nodes_populate()
214 graph_nodes_mem_destroy(struct rte_graph *graph) in graph_nodes_mem_destroy()
H A Drte_graph.h74 struct rte_graph; /**< Graph object */
99 typedef uint16_t (*rte_node_process_t)(struct rte_graph *graph,
119 typedef int (*rte_node_init_t)(const struct rte_graph *graph,
135 typedef void (*rte_node_fini_t)(const struct rte_graph *graph,
298 struct rte_graph *rte_graph_lookup(const char *name);
340 void rte_graph_obj_dump(FILE *f, struct rte_graph *graph, bool all);
H A Dgraph.c212 static struct rte_graph *
213 graph_mem_fixup_node_ctx(struct rte_graph *graph) in graph_mem_fixup_node_ctx()
238 static struct rte_graph *
239 graph_mem_fixup_secondary(struct rte_graph *graph) in graph_mem_fixup_secondary()
247 struct rte_graph *
251 struct rte_graph *rc = NULL; in rte_graph_lookup()
461 __rte_node_stream_alloc(struct rte_graph *graph, struct rte_node *node) in __rte_node_stream_alloc()
476 __rte_node_stream_alloc_size(struct rte_graph *graph, struct rte_node *node, in __rte_node_stream_alloc_size()
H A Dgraph_private.h89 struct rte_graph *graph;
303 struct rte_node *graph_node_id_to_ptr(const struct rte_graph *graph,
319 struct rte_node *graph_node_name_to_ptr(const struct rte_graph *graph,
H A Dmeson.build18 headers = files('rte_graph.h', 'rte_graph_worker.h')
H A Dgraph_stats.c137 struct rte_graph *graph, struct graph_node *graph_node) in stats_mem_populate()
302 struct rte_graph *graph_fp = graph->graph; in rte_graph_cluster_stats_create()
H A Dgraph_debug.c45 rte_graph_obj_dump(FILE *f, struct rte_graph *g, bool all) in rte_graph_obj_dump()
/dpdk/app/test/
H A Dtest_graph.c32 static uint16_t test_node_worker_source(struct rte_graph *graph,
36 static uint16_t test_node0_worker(struct rte_graph *graph,
40 static uint16_t test_node1_worker(struct rte_graph *graph,
44 static uint16_t test_node2_worker(struct rte_graph *graph,
48 static uint16_t test_node3_worker(struct rte_graph *graph,
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()
[all …]
H A Dtest_graph_perf.c78 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()
/dpdk/lib/node/
H A Dethdev_tx.c15 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 Dethdev_rx.c17 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 Dnull.c8 null(struct rte_graph *graph, struct rte_node *node, void **objs, in null()
H A Dpkt_drop.c9 pkt_drop_process(struct rte_graph *graph, struct rte_node *node, void **objs, in pkt_drop_process()
H A Dip4_lookup.c51 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 Dip4_rewrite.c34 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 Dpkt_cls.c30 pkt_cls_node_process(struct rte_graph *graph, struct rte_node *node, in pkt_cls_node_process()
H A Dip4_lookup_neon.h10 ip4_lookup_node_process_vec(struct rte_graph *graph, struct rte_node *node, in ip4_lookup_node_process_vec()
H A Dip4_lookup_sse.h10 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 Dmain.c90 struct rte_graph *graph;
678 struct rte_graph *graph; in graph_main_loop()
/dpdk/doc/api/
H A Ddoxy-api-index.md200 * [graph] (@ref rte_graph.h):
/dpdk/doc/guides/prog_guide/
H A Dgraph_lib.rst208 struct rte_graph *graph = rte_graph_lookup("worker0");
225 ``struct rte_graph *`` fast-path graph object while others works on graph ID or name.
/dpdk/doc/guides/rel_notes/
H A Drelease_20_05.rst257 * **Added the rte_graph library.**
270 ``rte_graph`` library. Each node performs a specific packet processing