doc: announce rte_graph ABI changes for 26.11
PATCH 1/1 doc: announce rte_graph ABI changes for 26.11
The graph library internal scheduling will change from a circular buffer to a topological bitmap. This affects struct rte_graph and struct rte_node layouts.
--- doc/guides/rel_notes/deprecation.rst | 7 +++++++ 1 file changed, 7 insertions(+)
doc/guides/rel_notes/deprecation.rst +7 -0
@@ -61,6 +61,13 @@ Deprecation Notices * mempool: The object array in ``struct rte_mempool_cache`` is oversize by factor two, and will be reduced to ``RTE_MEMPOOL_CACHE_MAX_SIZE`` in DPDK 26.11. +* graph: The internal scheduling mechanism of ``struct rte_graph`` will change + in DPDK 26.11. The circular buffer fields (``head``, ``tail``, ``cir_mask``, + ``cir_start``) will be replaced with a topological bitmap scheduler. + A new field will be added to ``struct rte_node`` for the scheduling order. + The graph walk functions will process nodes in topological order using bitmap + scanning instead of the circular buffer. + * lib: will fix extending some enum/define breaking the ABI. There are multiple samples in DPDK that enum/define terminated with a ``.*MAX.*`` value which is used by iterators, and arrays holding these values are sized with this
Signature · 1 line
2.55.0
Quoted 6 lines · Robin Jarry
The graph library internal scheduling will change from a circular buffer to a topological bitmap. This affects struct
rte_graphand structrte_nodelayouts.Signed-off-by Robin Jarry <[email protected]>
Quoted 25 lines
--- doc/guides/rel_notes/deprecation.rst | 7 +++++++ 1 file changed, 7 insertions(+)doc/guides/rel_notes/deprecation.rst +7
-1@@ -61,6 +61,13 @@ Deprecation Notices * mempool: The object array in ``struct rte_mempool_cache`` is oversize by factor two, and will be reduced to ``RTE_MEMPOOL_CACHE_MAX_SIZE`` in DPDK 26.11. +* graph: The internal scheduling mechanism of ``struct rte_graph`` will change + in DPDK 26.11. The circular buffer fields (``head``, ``tail``, ``cir_mask``, + ``cir_start``) will be replaced with a topological bitmap scheduler. + A new field will be added to ``struct rte_node`` for the scheduling order. + The graph walk functions will process nodes in topological order using bitmap + scanning instead of the circular buffer. + * lib: will fix extending some enum/define breaking the ABI. There are multiple samples in DPDK that enum/define terminated with a ``.*MAX.*`` value which is used by iterators, and arrays holding these values are sized with this --2.55.0
Bruce Richardson
Acked-byQuoted 11 lines · Jerin Jacob
Quoted 6 lines · Robin Jarry
The graph library internal scheduling will change from a circular buffer to a topological bitmap. This affects struct
rte_graphand structrte_nodelayouts.Signed-off-by Robin Jarry <[email protected]>Acked-by Jerin Jacob <[email protected]>
21/07/2026 13:51, Bruce Richardson:
Quoted 11 lines · Jerin Jacob
Quoted 9 lines · Robin Jarry
Quoted 6 lines
The graph library internal scheduling will change from a circular buffer to a topological bitmap. This affects struct
rte_graphand structrte_nodelayouts.Signed-off-by Robin Jarry <[email protected]>Acked-by Jerin Jacob <[email protected]>Acked-by Bruce Richardson <[email protected]>
Applied, thanks.
Quoted 6 lines · Robin Jarry
The graph library internal scheduling will change from a circular buffer to a topological bitmap. This affects struct
rte_graphand structrte_nodelayouts.Signed-off-by Robin Jarry <[email protected]>
I would prefer those (internal) details get hidden entirely, but I guess this will affect performance.
Maybe something to rediscuss during 26.11, but for now:
Signature · 1 line
David Marchand