> -----Original Message----- > From: Huichao cai <chcch...@163.com> > Sent: Thursday, November 7, 2024 1:35 PM > To: Jerin Jacob <jer...@marvell.com>; Kiran Kumar Kokkilagadda > <kirankum...@marvell.com>; Nithin Kumar Dabilpuram > <ndabilpu...@marvell.com>; yanzhirun_...@163.com > Cc: dev@dpdk.org > Subject: [EXTERNAL] [PATCH] graph: optimize graph search when scheduling > nodes > > In the function __rte_graph_ccore_ispatch_stched_node_dequeue, use a slower > loop to search for the graph, modify the search logic to record the result of > the > first search, and use this record for subsequent searches to improve search > speed > In the function __rte_graph_ccore_ispatch_stched_node_dequeue, > use a slower loop to search for the graph, modify the search logic to record > the > result of the first search, and use this record for subsequent searches to > improve search speed. > > Signed-off-by: Huichao cai <chcch...@163.com> > --- > return graph != NULL ? __graph_sched_node_enqueue(node, graph) : > false; } diff --git a/lib/graph/rte_graph_worker_common.h > b/lib/graph/rte_graph_worker_common.h > index a518af2..4c2432b 100644 > --- a/lib/graph/rte_graph_worker_common.h > +++ b/lib/graph/rte_graph_worker_common.h > @@ -110,6 +110,7 @@ struct __rte_cache_aligned rte_node { > unsigned int lcore_id; /**< Node running lcore. */ > uint64_t total_sched_objs; /**< Number of objects > scheduled. */ > uint64_t total_sched_fail; /**< Number of scheduled > failure. */ > + struct rte_graph *graph; /**< Graph corresponding to > lcore_id. */
Is n't breaking the ABI? Also, please change commit as following for mcore specific changes graph: mcore: ... > } dispatch; > }; > rte_graph_off_t xstat_off; /**< Offset to xstat counters. */ > -- > 1.8.3.1