Home
last modified time | relevance | path

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

12

/dpdk/lib/graph/
H A Dgraph.c27 struct graph *graph; in graph_from_id() local
39 struct graph *graph; in graph_next_free_id() local
52 graph_insert_ordered(struct graph * graph) graph_insert_ordered() argument
95 graph_node_add(struct graph * graph,struct node * node) graph_node_add() argument
127 node_to_graph_node(struct graph * graph,struct node * node) node_to_graph_node() argument
141 graph_node_edges_add(struct graph * graph) graph_node_edges_add() argument
165 graph_adjacency_list_update(struct graph * graph) graph_adjacency_list_update() argument
192 expand_pattern_to_node(struct graph * graph,const char * pattern) expand_pattern_to_node() argument
215 graph_cleanup(struct graph * graph) graph_cleanup() argument
227 graph_node_init(struct graph * graph) graph_node_init() argument
251 graph_node_fini(struct graph * graph) graph_node_fini() argument
264 graph_mem_fixup_node_ctx(struct rte_graph * graph) graph_mem_fixup_node_ctx() argument
295 graph_mem_fixup_secondary(struct rte_graph * graph) graph_mem_fixup_secondary() argument
307 graph_src_node_avail(struct graph * graph) graph_src_node_avail() argument
323 struct graph *graph; rte_graph_model_mcore_dispatch_core_bind() local
354 struct graph *graph; rte_graph_model_mcore_dispatch_core_unbind() local
386 struct graph *graph; rte_graph_create() local
489 struct graph *graph, *tmp; rte_graph_destroy() local
527 struct graph *graph; graph_clone() local
604 struct graph *graph; rte_graph_clone() local
619 struct graph *graph; rte_graph_from_name() local
631 struct graph *graph; rte_graph_id_to_name() local
647 struct graph *graph; rte_graph_node_get() local
670 struct graph *graph; rte_graph_node_get_by_name() local
689 __rte_node_stream_alloc(struct rte_graph * graph,struct rte_node * node) __rte_node_stream_alloc() argument
704 __rte_node_stream_alloc_size(struct rte_graph * graph,struct rte_node * node,uint16_t req_size) __rte_node_stream_alloc_size() argument
720 graph_to_dot(FILE * f,struct graph * graph) graph_to_dot() argument
776 struct graph *graph; rte_graph_export() local
792 struct graph *graph; graph_scan_dump() local
825 struct graph *graph; rte_graph_max_count() local
[all...]
H A Dgraph_private.h103 /**< Memzone to store graph data. */ argument
107 /**< Node xstats memory start offset in graph ree argument
96 struct graph { global() struct
100 namegraph global() argument
102 mzgraph global() argument
106 src_node_countgraph global() argument
112 cir_startgraph global() argument
115 idgraph global() argument
117 parent_idgraph global() argument
118 cir_maskgraph global() argument
120 lcore_idgraph global() argument
122 mem_szgraph global() argument
130 pcap_filenamegraph global() argument
[all...]
H A Dgraph_populate.c15 graph_fp_mem_calc_size(struct graph *graph) in graph_fp_mem_calc_size() argument
50 struct rte_graph *graph = _graph->graph; graph_header_popluate() local
68 struct rte_graph *graph = _graph->graph; graph_nodes_populate() local
110 graph_node_id_to_ptr(const struct rte_graph * graph,rte_node_t id) graph_node_id_to_ptr() argument
124 graph_node_name_to_ptr(const struct rte_graph * graph,const char * name) graph_node_name_to_ptr() argument
143 const struct rte_graph *graph = _graph->graph; graph_node_nexts_populate() local
163 struct rte_graph *graph = _graph->graph; graph_src_nodes_populate() local
187 graph_fp_mem_populate(struct graph * graph) graph_fp_mem_populate() argument
202 graph_fp_mem_create(struct graph * graph) graph_fp_mem_create() argument
222 graph_nodes_mem_destroy(struct rte_graph * graph) graph_nodes_mem_destroy() argument
236 graph_fp_mem_destroy(struct graph * graph) graph_fp_mem_destroy() argument
[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_model_mcore_dispatch.c13 struct rte_graph *graph = _graph->graph; in graph_sched_wq_create() local
66 struct rte_graph *graph = _graph->graph; in graph_sched_wq_destroy() local
79 __graph_sched_node_enqueue(struct rte_node *node, struct rte_graph *graph) in __graph_sched_node_enqueue()
121 struct rte_graph *graph; in __rte_graph_mcore_dispatch_sched_node_enqueue() local
131 __rte_graph_mcore_dispatch_sched_wq_process(struct rte_graph *graph) in __rte_graph_mcore_dispatch_sched_wq_process()
H A Drte_graph_worker_common.h177 __rte_node_process(struct rte_graph * graph,struct rte_node * node) __rte_node_process() argument
210 __rte_node_enqueue_tail_update(struct rte_graph * graph,struct rte_node * node) __rte_node_enqueue_tail_update() argument
237 __rte_node_enqueue_prologue(struct rte_graph * graph,struct rte_node * node,const uint16_t idx,const uint16_t space) __rte_node_enqueue_prologue() argument
289 rte_node_enqueue(struct rte_graph * graph,struct rte_node * node,rte_edge_t next,void ** objs,uint16_t nb_objs) rte_node_enqueue() argument
315 rte_node_enqueue_x1(struct rte_graph * graph,struct rte_node * node,rte_edge_t next,void * obj) rte_node_enqueue_x1() argument
344 rte_node_enqueue_x2(struct rte_graph * graph,struct rte_node * node,rte_edge_t next,void * obj0,void * obj1) rte_node_enqueue_x2() argument
378 rte_node_enqueue_x4(struct rte_graph * graph,struct rte_node * node,rte_edge_t next,void * obj0,void * obj1,void * obj2,void * obj3) rte_node_enqueue_x4() argument
411 rte_node_enqueue_next(struct rte_graph * graph,struct rte_node * node,rte_edge_t * nexts,void ** objs,uint16_t nb_objs) rte_node_enqueue_next() argument
440 rte_node_next_stream_get(struct rte_graph * graph,struct rte_node * node,rte_edge_t next,uint16_t nb_objs) rte_node_next_stream_get() argument
470 rte_node_next_stream_put(struct rte_graph * graph,struct rte_node * node,rte_edge_t next,uint16_t idx) rte_node_next_stream_put() argument
498 rte_node_next_stream_move(struct rte_graph * graph,struct rte_node * src,rte_edge_t next) rte_node_next_stream_move() argument
569 rte_graph_worker_model_no_check_get(struct rte_graph * graph) rte_graph_worker_model_no_check_get() argument
[all...]
H A Drte_graph_worker.c21 struct graph *graph; in rte_graph_worker_model_set() local
33 rte_graph_worker_model_get(struct rte_graph *graph) in rte_graph_worker_model_get()
H A Dgraph_pcap.c41 graph_pcap_exit(struct rte_graph *graph) in graph_pcap_exit()
162 graph_pcap_init(struct graph *graph) in graph_pcap_init()
192 graph_pcap_dispatch(struct rte_graph *graph, in graph_pcap_dispatch()
H A Drte_graph_worker.h26 rte_graph_walk(struct rte_graph *graph) in rte_graph_walk() argument
H A Dgraph_stats.c171 const struct rte_graph *graph = cluster->graphs[0]->graph; stats_mem_init() local
199 stats_mem_populate(struct rte_graph_cluster_stats ** stats_in,struct rte_graph * graph,struct graph_node * graph_node) stats_mem_populate() argument
268 cluster_add(struct cluster * cluster,struct graph * graph) cluster_add() argument
305 struct graph *graph; expand_pattern_to_cluster() local
331 struct graph *graph; rte_graph_cluster_stats_create() local
[all...]
H A Drte_graph_model_rtc.h18 rte_graph_walk_rtc(struct rte_graph *graph) in rte_graph_walk_rtc()
H A Drte_graph_model_mcore_dispatch.h89 rte_graph_walk_mcore_dispatch(struct rte_graph *graph) in rte_graph_walk_mcore_dispatch() argument
[all...]
/dpdk/app/test/
H A Dtest_graph.c144 node_init(const struct rte_graph *graph, struct rte_node *node) in node_init()
170 test_node_worker_source(struct rte_graph *graph, struct rte_node *node, in test_node_worker_source()
215 test_node0_worker(struct rte_graph *graph, struct rte_node *node, void **objs, in test_node0_worker()
298 test_node1_worker(struct rte_graph *graph, struct rte_node *node, void **objs, in test_node1_worker()
352 test_node2_worker(struct rte_graph *graph, struct rte_node *node, void **objs, in test_node2_worker()
408 test_node3_worker(struct rte_graph *graph, struct rte_node *node, void **objs, in test_node3_worker()
806 struct rte_graph *graph; in test_graph_model_mcore_dispatch_core_bind_unbind() local
851 struct rte_graph *graph; in test_graph_worker_model_set_get() local
876 struct rte_graph *graph = rte_graph_lookup("worker0"); in test_graph_walk() local
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() local
/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 Dkernel_rx.c109 kernel_rx_node_do(struct rte_graph *graph, struct rte_node *node, kernel_rx_node_ctx_t *ctx) in kernel_rx_node_do()
164 kernel_rx_node_process(struct rte_graph *graph, struct rte_node *node, void **objs, in kernel_rx_node_process()
190 kernel_rx_node_init(const struct rte_graph *graph, struct rte_node *node) in kernel_rx_node_init()
H A Dpkt_drop.c9 pkt_drop_process(struct rte_graph *graph, struct rte_node *node, void **objs, in pkt_drop_process()
H A Dnull.c8 null(struct rte_graph *graph, struct rte_node *node, void **objs, in null()
H A Dip4_reassembly.c43 ip4_reassembly_node_process(struct rte_graph *graph, struct rte_node *node, void **objs, in ip4_reassembly_node_process() argument
150 ip4_reassembly_node_init(const struct rte_graph * graph,struct rte_node * node) ip4_reassembly_node_init() argument
H A Dip4_lookup.c51 ip4_lookup_node_process_scalar(struct rte_graph *graph, struct rte_node *node, in ip4_lookup_node_process_scalar() argument
178 ip4_lookup_node_init(const struct rte_graph * graph,struct rte_node * node) ip4_lookup_node_init() argument
H A Dudp4_input.c118 udp4_input_node_init(const struct rte_graph *graph, struct rte_node *node) in udp4_input_node_init()
151 udp4_input_node_process_scalar(struct rte_graph *graph, struct rte_node *node, in udp4_input_node_process_scalar()
H A Dip4_local.c24 ip4_local_node_process_scalar(struct rte_graph *graph, struct rte_node *node, in ip4_local_node_process_scalar()
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 Dip6_rewrite.c34 ip6_rewrite_node_process(struct rte_graph *graph, struct rte_node *node, in ip6_rewrite_node_process()
243 ip6_rewrite_node_init(const struct rte_graph *graph, struct rte_node *node) in ip6_rewrite_node_init()

12