Home
last modified time | relevance | path

Searched defs:graph (Results 1 – 23 of 23) sorted by relevance

/f-stack/dpdk/lib/librte_graph/
H A Dgraph_private.h78 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 Dgraph.c164 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 Dgraph_populate.c16 graph_fp_mem_calc_size(struct graph *graph) in graph_fp_mem_calc_size()
51 struct rte_graph *graph = _graph->graph; in graph_header_popluate() local
69 struct rte_graph *graph = _graph->graph; in graph_nodes_populate() local
106 graph_node_id_to_ptr(const struct rte_graph *graph, rte_node_t id) in graph_node_id_to_ptr()
120 graph_node_name_to_ptr(const struct rte_graph *graph, const char *name) in graph_node_name_to_ptr()
139 const struct rte_graph *graph = _graph->graph; in graph_node_nexts_populate() local
159 struct rte_graph *graph = _graph->graph; in graph_src_nodes_populate() local
183 graph_fp_mem_populate(struct graph *graph) in graph_fp_mem_populate()
196 graph_fp_mem_create(struct graph *graph) in graph_fp_mem_create()
216 graph_nodes_mem_destroy(struct rte_graph *graph) in graph_nodes_mem_destroy()
[all …]
H A Dgraph_ops.c35 graph_node_has_loop_edge(struct graph *graph) in graph_node_has_loop_edge()
47 graph_src_nodes_count(struct graph *graph) in graph_src_nodes_count()
64 graph_node_has_edge_to_src_node(struct graph *graph) in graph_node_has_edge_to_src_node()
87 graph_nodes_count(struct graph *graph) in graph_nodes_count()
99 graph_mark_nodes_as_not_visited(struct graph *graph) in graph_mark_nodes_as_not_visited()
108 graph_bfs(struct graph *graph, struct graph_node *start) in graph_bfs()
144 graph_has_isolated_node(struct graph *graph) in graph_has_isolated_node()
H A Drte_graph_worker.h132 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 Dgraph_stats.c137 struct rte_graph *graph, struct graph_node *graph_node) in stats_mem_populate()
203 cluster_add(struct cluster *cluster, struct graph *graph) in cluster_add()
241 struct graph *graph; in expand_pattern_to_cluster() local
267 struct graph *graph; in rte_graph_cluster_stats_create() local
H A Drte_graph.h343 #define rte_graph_foreach_node(count, off, graph, node) \ argument
/f-stack/dpdk/app/test/
H A Dtest_graph.c131 node_init(const struct rte_graph *graph, struct rte_node *node) in node_init()
157 test_node_worker_source(struct rte_graph *graph, struct rte_node *node, in test_node_worker_source()
202 test_node0_worker(struct rte_graph *graph, struct rte_node *node, void **objs, in test_node0_worker()
285 test_node1_worker(struct rte_graph *graph, struct rte_node *node, void **objs, in test_node1_worker()
339 test_node2_worker(struct rte_graph *graph, struct rte_node *node, void **objs, in test_node2_worker()
395 test_node3_worker(struct rte_graph *graph, struct rte_node *node, void **objs, in test_node3_worker()
648 struct rte_graph *graph = rte_graph_lookup("worker0"); in test_graph_walk() local
H A Dtest_graph_perf.c67 test_node_ctx_init(const struct rte_graph *graph, struct rte_node *node) in test_node_ctx_init()
94 test_perf_node_worker_source(struct rte_graph *graph, struct rte_node *node, in test_perf_node_worker_source()
123 test_perf_node_worker_source_burst_one(struct rte_graph *graph, in test_perf_node_worker_source_burst_one()
154 test_perf_node_worker(struct rte_graph *graph, struct rte_node *node, in test_perf_node_worker()
219 test_perf_node_sink(struct rte_graph *graph, struct rte_node *node, void **objs, in test_perf_node_sink()
605 struct rte_graph *graph; in _graph_perf_wrapper() local
/f-stack/dpdk/lib/librte_node/
H A Dethdev_tx.c16 ethdev_tx_node_process(struct rte_graph *graph, struct rte_node *node, in ethdev_tx_node_process()
40 ethdev_tx_node_init(const struct rte_graph *graph, struct rte_node *node) in ethdev_tx_node_init()
H A Dethdev_rx.c18 ethdev_rx_node_process_inline(struct rte_graph *graph, struct rte_node *node, in ethdev_rx_node_process_inline()
42 ethdev_rx_node_process(struct rte_graph *graph, struct rte_node *node, in ethdev_rx_node_process()
180 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.c10 pkt_drop_process(struct rte_graph *graph, struct rte_node *node, void **objs, in pkt_drop_process()
H A Dip4_lookup.c56 ip4_lookup_node_process_scalar(struct rte_graph *graph, struct rte_node *node, in ip4_lookup_node_process_scalar()
183 ip4_lookup_node_init(const struct rte_graph *graph, struct rte_node *node) in ip4_lookup_node_init()
H A Dip4_rewrite.c38 ip4_rewrite_node_process(struct rte_graph *graph, struct rte_node *node, in ip4_rewrite_node_process()
263 ip4_rewrite_node_init(const struct rte_graph *graph, struct rte_node *node) in ip4_rewrite_node_init()
H A Dpkt_cls.c34 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()
/f-stack/freebsd/arm64/coresight/
H A Dcoresight_acpi.c66 cs_acpi_validate_dsd_graph(const union acpi_object *graph) in cs_acpi_validate_dsd_graph()
228 const union acpi_object *graph_list, *graph; in cs_get_coresight_graph() local
302 const union acpi_object *graph; in coresight_acpi_get_ports() local
/f-stack/app/redis-5.0.5/src/
H A Dlatency.c520 sds graph = sdsempty(); in latencyCommandGenSparkeline() local
592 sds graph; in latencyCommand() local
/f-stack/dpdk/examples/l3fwd-graph/
H A Dmain.c90 struct rte_graph *graph; member
699 struct rte_graph *graph; in graph_main_loop() local
/f-stack/freebsd/contrib/octeon-sdk/
H A Dcvmx-dfa.h537 static inline void cvmx_dfa_write_edge_sm(const cvmx_dfa_graph_t *graph, in cvmx_dfa_write_edge_sm()
583 static inline void cvmx_dfa_write_node_lg(const cvmx_dfa_graph_t *graph, in cvmx_dfa_write_node_lg()
714 static inline void cvmx_dfa_submit(const cvmx_dfa_graph_t *graph, int start_node, in cvmx_dfa_submit()
/f-stack/dpdk/drivers/net/mlx5/
H A Dmlx5_flow.c242 const struct mlx5_flow_expand_node graph[], in mlx5_flow_expand_rss()