Home
last modified time | relevance | path

Searched refs:rte_node (Results 1 – 21 of 21) sorted by relevance

/dpdk/lib/graph/
H A Drte_graph_worker.h54 struct rte_node { struct
85 struct rte_node *nodes[] __rte_cache_min_aligned; /**< Next nodes. */ argument
119 struct rte_node *node, uint16_t req_size);
137 struct rte_node *node; in rte_graph_walk()
243 static __rte_always_inline struct rte_node *
244 __rte_node_next_node_get(struct rte_node *node, rte_edge_t next) in __rte_node_next_node_get()
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()
[all …]
H A Dgraph_populate.c37 sz += sizeof(struct rte_node); in graph_fp_mem_calc_size()
74 struct rte_node *node = RTE_PTR_ADD(graph, off); in graph_nodes_populate()
89 off += sizeof(struct rte_node); in graph_nodes_populate()
96 off += sizeof(struct rte_node *) * nb_edges; in graph_nodes_populate()
103 struct rte_node *
108 struct rte_node *node; in graph_node_id_to_ptr()
117 struct rte_node *
122 struct rte_node *node; in graph_node_name_to_ptr()
136 struct rte_node *node; in graph_node_nexts_populate()
159 struct rte_node *node; in graph_src_nodes_populate()
[all …]
H A Drte_graph.h73 struct rte_node; /**< Node object */
100 struct rte_node *node, void **objs,
120 struct rte_node *node);
136 struct rte_node *node);
361 struct rte_node *rte_graph_node_get(rte_graph_t graph_id, rte_node_t node_id);
375 struct rte_node *rte_graph_node_get_by_name(const char *graph,
H A Dgraph.c215 struct rte_node *node; in graph_mem_fixup_node_ctx()
416 struct rte_node *
419 struct rte_node *node; in rte_graph_node_get()
438 struct rte_node *
441 struct rte_node *node; in rte_graph_node_get_by_name()
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.h303 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 Dgraph_stats.c27 struct rte_node *nodes[];
118 cluster_node_size += cluster->nb_graphs * sizeof(struct rte_node *); in stats_mem_init()
142 struct rte_node *node; in stats_mem_populate()
335 struct rte_node *node; in cluster_node_arregate_stats()
H A Dnode.c64 RTE_BUILD_BUG_ON((offsetof(struct rte_node, nodes) - in __rte_node_register()
65 offsetof(struct rte_node, ctx)) != in __rte_node_register()
H A Dgraph_debug.c49 struct rte_node *n; in rte_graph_obj_dump()
/dpdk/app/test/
H A Dtest_graph.c33 struct rte_node *node, void **objs,
37 struct rte_node *node, void **objs,
41 struct rte_node *node, void **objs,
45 struct rte_node *node, void **objs,
49 struct rte_node *node, void **objs,
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()
135 struct rte_node *node, void **objs, 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()
/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/doc/guides/prog_guide/
H A Dgraph_lib.rst216 The fast-path object for the node is ``struct rte_node``.
220 ``struct rte_node *`` memory.
224 ``struct rte_node*``. ``rte_graph_foreach_node()`` iterator function works on
331 the ``rte_node`` objects.
347 there are packets received. Each ``rte_node`` works only on one Rx port and
349 a rte_node is cloned from ethdev_rx_base_node as ``ethdev_rx-X-Y`` in
351 Each graph needs to be associated with a unique rte_node for a (port, rx_queue).
357 node->ctx. For each (port X), this ``rte_node`` is cloned from
362 based on graph id to each rte_node instance. Each graph needs to be associated
363 with a rte_node for each (port).
/dpdk/doc/guides/rel_notes/
H A Drelease_20_05.rst267 * **Added the rte_node library.**
269 Added the ``rte_node`` library that consists of nodes used by the