xref: /dpdk/lib/graph/version.map (revision 25a2a0dc3de31ca0a6fbc9371cf3dd85dfd74b07)
1DPDK_25 {
2	global:
3
4	__rte_graph_mcore_dispatch_sched_node_enqueue;
5	__rte_graph_mcore_dispatch_sched_wq_process;
6	__rte_node_register;
7	__rte_node_stream_alloc;
8	__rte_node_stream_alloc_size;
9	rte_graph_clone;
10	rte_graph_cluster_stats_create;
11	rte_graph_cluster_stats_destroy;
12	rte_graph_cluster_stats_get;
13	rte_graph_cluster_stats_reset;
14	rte_graph_create;
15	rte_graph_destroy;
16	rte_graph_dump;
17	rte_graph_export;
18	rte_graph_from_name;
19	rte_graph_id_to_name;
20	rte_graph_list_dump;
21	rte_graph_lookup;
22	rte_graph_max_count;
23	rte_graph_model_is_valid;
24	rte_graph_model_mcore_dispatch_core_bind;
25	rte_graph_model_mcore_dispatch_core_unbind;
26	rte_graph_model_mcore_dispatch_node_lcore_affinity_set;
27	rte_graph_node_get;
28	rte_graph_node_get_by_name;
29	rte_graph_obj_dump;
30	rte_graph_walk;
31	rte_graph_worker_model_get;
32	rte_graph_worker_model_no_check_get;
33	rte_graph_worker_model_set;
34	rte_node_clone;
35	rte_node_dump;
36	rte_node_edge_count;
37	rte_node_edge_get;
38	rte_node_edge_shrink;
39	rte_node_edge_update;
40	rte_node_enqueue;
41	rte_node_enqueue_next;
42	rte_node_enqueue_x1;
43	rte_node_enqueue_x2;
44	rte_node_enqueue_x4;
45	rte_node_from_name;
46	rte_node_id_to_name;
47	rte_node_list_dump;
48	rte_node_max_count;
49	rte_node_next_stream_get;
50	rte_node_next_stream_move;
51	rte_node_next_stream_put;
52
53	local: *;
54};
55
56EXPERIMENTAL {
57	global:
58
59	# added in 24.11
60	rte_node_xstat_increment;
61};
62