rte_soring.h(3)

📦

version 25.11.3 · 4 versions

25.11.3 · ubuntu resolute, ubuntu stonking (latest)
25.11 · centos-stream 9
26.03 · nixos 26.05, nixpkgs unstable
25.11 · centos-stream 10, ubuntu resolute

🌸 rte_soring.h(3) — Library Functions Manual 🌸

okay bestie, gather round, because this is the rte_soring.h page and it is a lot 💖 it's the DPDK soring (Staged Ordered Ring) header, and she's got macros, functions, the whole wardrobe. no cap, this is part 1 of 3 so buckle up, we are NOT done at the end of this 🫶

✨ NAME ✨

rte_soring.h — literally the file. that's the name. iconic of her.

🎀 SYNOPSIS 🎀

#include <rte_ring.h>

💅 Macros

#define RTE_SORING_ST_BIT   30
#define RTE_SORING_ELEM_MAX   (RTE_BIT32(RTE_SORING_ST_BIT) - 1)

🌈 Functions

__rte_experimental ssize_t rte_soring_get_memsize (const struct
    rte_soring_param *prm)
__rte_experimental int rte_soring_init (struct rte_soring *r, const
    struct rte_soring_param *prm)
__rte_experimental unsigned int rte_soring_count (const struct
    rte_soring *r)
__rte_experimental unsigned int rte_soring_free_count (const struct
    rte_soring *r)
__rte_experimental void rte_soring_dump (FILE *f, const struct
    rte_soring *r)
__rte_experimental uint32_t rte_soring_enqueue_bulk (struct rte_soring
    *r, const void *objs, uint32_t n, uint32_t *free_space)
__rte_experimental uint32_t rte_soring_enqueux_bulk (struct rte_soring
    *r, const void *objs, const void *meta, uint32_t n, uint32_t
    *free_space)
__rte_experimental uint32_t rte_soring_enqueue_burst (struct rte_soring
    *r, const void *objs, uint32_t n, uint32_t *free_space)
__rte_experimental uint32_t rte_soring_enqueux_burst (struct rte_soring
    *r, const void *objs, const void *meta, uint32_t n, uint32_t
    *free_space)
__rte_experimental uint32_t rte_soring_dequeue_bulk (struct rte_soring
    *r, void *objs, uint32_t num, uint32_t *available)
__rte_experimental uint32_t rte_soring_dequeux_bulk (struct rte_soring
    *r, void *objs, void *meta, uint32_t num, uint32_t *available)
__rte_experimental uint32_t rte_soring_dequeue_burst (struct rte_soring
    *r, void *objs, uint32_t num, uint32_t *available)
__rte_experimental uint32_t rte_soring_dequeux_burst (struct rte_soring
    *r, void *objs, void *meta, uint32_t num, uint32_t *available)
__rte_experimental uint32_t rte_soring_acquire_bulk (struct rte_soring
    *r, void *objs, uint32_t stage, uint32_t num, uint32_t *ftoken,
    uint32_t *available)
__rte_experimental uint32_t rte_soring_acquirx_bulk (struct rte_soring
    *r, void *objs, void *meta, uint32_t stage, uint32_t num, uint32_t
    *ftoken, uint32_t *available)
__rte_experimental uint32_t rte_soring_acquire_burst (struct rte_soring
    *r, void *objs, uint32_t stage, uint32_t num, uint32_t *ftoken,
    uint32_t *available)
__rte_experimental uint32_t rte_soring_acquirx_burst (struct rte_soring
    *r, void *objs, void *meta, uint32_t stage, uint32_t num, uint32_t
    *ftoken, uint32_t *available)
__rte_experimental void rte_soring_release (struct rte_soring *r, const
    void *objs, uint32_t stage, uint32_t n, uint32_t ftoken)
__rte_experimental void rte_soring_releasx (struct rte_soring *r, const
    void *objs, const void *meta, uint32_t stage, uint32_t n, uint32_t
    ftoken)

🦋 Detailed Description 🦋

so this file is literally the definition of the DPDK soring (that's Staged Ordered Ring, say it with your chest) public API. brief rundown because bestie you deserve context:

enqueue/dequeue behaves exactly like a conventional rte_ring — any rte_ring sync types work, all of them, etc. ✨ but ALSO, plot twist, there can be multiple stages. for each stage there's an acquire (start) and a release (finish) operation. once some elems are 'acquired', the user can safely assume they have exclusive possession of those elems until 'release' for them is done. 💅

heads up though: as of right now, the user has to release exactly the same number of elems they acquired before. no take-backs, no leftovers, fr.

after 'release', elems can be 'acquired' by the next stage and/or dequeued (in the case of the last stage).

extra debugging can be enabled with the RTE_SORING_DEBUG macro 🐛

Definition in file rte_soring.h.

🧚 Macro Definition Documentation 🧚

`#define RTE_SORING_ST_BIT 30`

the upper 2 bits are used for status 👑

Definition at line 33 of file rte_soring.h.

`#define RTE_SORING_ELEM_MAX (RTE_BIT32(RTE_SORING_ST_BIT) - 1)`

the max possible number of elements in the soring. that's the ceiling, bestie, we don't go above it 🎀

Definition at line 36 of file rte_soring.h.

⭐ Function Documentation ⭐

Warning 💀 EXPERIMENTAL: this API may change without prior notice.

okay so every single function down here carries that same warning, so I'm putting it up top once, and then you mentally stamp it on every entry below, k? every. single. one. 📌

🫶 `rte_soring_get_memsize`

__rte_experimental ssize_t rte_soring_get_memsize (const struct
    rte_soring_param * prm)

Warning EXPERIMENTAL: this API may change without prior notice.

calculate the memory size needed for a soring 💖

this function returns the number of bytes needed for a soring, given the expected parameters for it. this value is the sum of the size of the internal metadata plus the size of the memory needed by the actual soring elements and their metadata. and the value is aligned to a cache line size ✨ (she's tidy like that).

Parameters

prm — pointer to the structure that contains soring creation parameters.

Returns

the memory size needed for the soring on success 💅
-EINVAL if the provided parameter values are invalid 😭

🌸 `rte_soring_init`

__rte_experimental int rte_soring_init (struct rte_soring * r, const struct
    rte_soring_param * prm)

Warning EXPERIMENTAL: this API may change without prior notice.

initialize a soring structure 🎀

initialize a soring structure in memory pointed by "r". the size of the memory area must be large enough to store the soring internal structures plus the objects and metadata tables. and it is strongly advised to use rte_soring_get_memsize() to get the appropriate size. do not eyeball it, bestie, use the function 🙈

Parameters

r — pointer to the soring structure.
prm — pointer to the structure that contains soring creation parameters.

Returns

0 on success, or a negative error code.

🌈 `rte_soring_count`

__rte_experimental unsigned int rte_soring_count (const struct rte_soring *
    r)

Warning EXPERIMENTAL: this API may change without prior notice.

return the total number of filled entries in a soring 💖

Parameters

r — a pointer to the soring structure.

Returns

the number of entries in the soring.

✨ `rte_soring_free_count`

__rte_experimental unsigned int rte_soring_free_count (const struct
    rte_soring * r)

Warning EXPERIMENTAL: this API may change without prior notice.

return the total number of unfilled entries in a soring 🦋 (the empty seats, the available vibes).

Parameters

r — a pointer to the soring structure.

Returns

the number of free entries in the soring.

💜 `rte_soring_dump`

__rte_experimental void rte_soring_dump (FILE * f, const struct rte_soring *
    r)

Warning EXPERIMENTAL: this API may change without prior notice.

dump the status of the soring 📋 spill the tea, soring, what's your status.

Parameters

f — a pointer to a file for output
r — pointer to the soring structure.

🎀 `rte_soring_enqueue_bulk`

__rte_experimental uint32_t rte_soring_enqueue_bulk (struct rte_soring * r,
    const void * objs, uint32_t n, uint32_t * free_space)

Warning EXPERIMENTAL: this API may change without prior notice.

enqueue several objects on the soring. enqueues exactly the requested number of objects or none — it's all or nothing, she does not do half measures 💅

Parameters

r — a pointer to the soring structure.
objs — a pointer to an array of objects to enqueue. the size of objects to enqueue must be the same value as the 'elem_size' parameter used while creating the soring. otherwise the results are undefined 💀
n — the number of objects to add in the soring from the 'objs'.
free_space — if non-NULL, returns the amount of space in the soring after the enqueue operation has finished.

Returns

actual number of objects enqueued, either 0 or n.

🌟 `rte_soring_enqueux_bulk`

__rte_experimental uint32_t rte_soring_enqueux_bulk (struct rte_soring * r,
    const void * objs, const void * meta, uint32_t n, uint32_t * free_space)

Warning EXPERIMENTAL: this API may change without prior notice.

enqueue several objects plus metadata on the soring. enqueues exactly the requested number of objects or none ✨

Parameters

r — a pointer to the soring structure.
objs — a pointer to an array of objects to enqueue. the size of objects to enqueue must be the same value as the 'elem_size' parameter used while creating the soring. otherwise the results are undefined 💀
meta — a pointer to an array of metadata values for each object to enqueue. note that if the user isn't using object metadata values, then this parameter can be NULL. the size of elements in this array must be the same value as the 'meta_size' parameter used while creating the soring. if the user created the soring with a 'meta_size' value equal to zero, then the 'meta' parameter should be NULL. otherwise the results are undefined 🙈
n — the number of objects to add in the soring from the 'objs'.
free_space — if non-NULL, returns the amount of space in the soring after the enqueue operation has finished.

Returns

actual number of objects enqueued, either 0 or n.

🦋 `rte_soring_enqueue_burst`

__rte_experimental uint32_t rte_soring_enqueue_burst (struct rte_soring * r,
    const void * objs, uint32_t n, uint32_t * free_space)

Warning EXPERIMENTAL: this API may change without prior notice.

enqueue several objects on the soring. enqueues up to the requested number of objects — see, burst is flexible, bulk is strict. know the difference bestie 🫶

Parameters

r — a pointer to the soring structure.
objs — a pointer to an array of objects to enqueue. the size of objects to enqueue must be the same value as the 'elem_size' parameter used while creating the soring. otherwise the results are undefined 💀
n — the number of objects to add in the soring from the 'objs'.
free_space — if non-NULL, returns the amount of space in the soring after the enqueue operation has finished.

Returns

actual number of objects enqueued.

💖 `rte_soring_enqueux_burst`

__rte_experimental uint32_t rte_soring_enqueux_burst (struct rte_soring * r,
    const void * objs, const void * meta, uint32_t n, uint32_t * free_space)

Warning EXPERIMENTAL: this API may change without prior notice.

enqueue several objects plus metadata on the soring. enqueues up to the requested number of objects ✨

Parameters

r — a pointer to the soring structure.
objs — a pointer to an array of objects to enqueue. the size of objects to enqueue must be the same value as the 'elem_size' parameter used while creating the soring. otherwise the results are undefined 💀
meta — a pointer to an array of metadata values for each object to enqueue. note that if the user isn't using object metadata values, then this parameter can be NULL. the size of elements in this array must be the same value as the 'meta_size' parameter used while creating the soring. if the user created the soring with a 'meta_size' value equal to zero, then the 'meta' parameter should be NULL. otherwise the results are undefined 🙈
n — the number of objects to add in the soring from the 'objs'.
free_space — if non-NULL, returns the amount of space in the soring after the enqueue operation has finished.

Returns

actual number of objects enqueued.

🔥 `rte_soring_dequeue_bulk`

__rte_experimental uint32_t rte_soring_dequeue_bulk (struct rte_soring * r,
    void * objs, uint32_t num, uint32_t * available)

Warning EXPERIMENTAL: this API may change without prior notice.

dequeue several objects from the soring. dequeues exactly the requested number of objects or none 💅

and that's where part 1 runs out, bestie — there's more coming in part 2, don't go anywhere, we are SO not finished 😭

Parameters

r — a pointer to the soring structure 💖
objs — a pointer to an array of objects to dequeue. Size of objects to enqueue must be the same value as the elem_size parameter you used while creating the soring. If it's not, the results are undefined — like, genuinely don't 🙈
num — the number of objects to dequeue from the soring into the objs.
available — if it's non-NULL, it gives you back the number of remaining soring entries after the dequeue has finished. cute little receipt ✨

Returns

Actual number of objects dequeued, either 0 or num.

`__rte_experimental uint32_t rte_soring_dequeux_bulk(struct rte_soring * r, void * objs, void * meta, uint32_t num, uint32_t * available)`

⚠️ EXPERIMENTAL: this API may change without prior notice. she's still in her testing era 💅

Dequeue several objects plus metadata from the soring. Bestie, it's all-or-nothing: it dequeues exactly the requested number of objects, or none. No in-between, that's the vibe 🎀

Parameters

r — a pointer to the soring structure.
objs — a pointer to an array of objects to dequeue. Size of objects to enqueue must be the same value as the elem_size parameter used while creating the soring. Otherwise the results are undefined 🫠
meta — a pointer to an array of metadata values, one for each object to dequeue. Quick note: if you're not using object metadata values, this parameter can be NULL. The size of the elements in this array must be the same value as the meta_size parameter used while creating the soring. And if you created the soring with meta_size equal to zero, then meta should be NULL. Otherwise the results are undefined, fr fr.
num — the number of objects to dequeue from the soring into the objs.
available — if non-NULL, returns the number of remaining soring entries after the dequeue has finished.

Returns

Actual number of objects dequeued, either 0 or num.

`__rte_experimental uint32_t rte_soring_dequeue_burst(struct rte_soring * r, void * objs, uint32_t num, uint32_t * available)`

⚠️ EXPERIMENTAL: this API may change without prior notice.

Dequeue several objects from the soring — and this one is the chill version, she dequeues up to the requested number of objects 🌸

Parameters

r — a pointer to the soring structure.
objs — a pointer to an array of objects to dequeue. Size of objects to enqueue must be the same value as the elem_size parameter used while creating the soring. Otherwise the results are undefined.
num — the number of objects to dequeue from the soring into the objs.
available — if non-NULL, returns the number of remaining soring entries after the dequeue has finished.

Returns

Actual number of objects dequeued. (Could be fewer than num, that's just her.)

`__rte_experimental uint32_t rte_soring_dequeux_burst(struct rte_soring * r, void * objs, void * meta, uint32_t num, uint32_t * available)`

⚠️ EXPERIMENTAL: this API may change without prior notice.

Dequeue several objects plus metadata from the soring, up to the requested number of objects 💫 it's giving "burst but make it fancy."

Parameters

r — a pointer to the soring structure.
objs — a pointer to an array of objects to dequeue. Size of objects to enqueue must be the same value as the elem_size parameter used while creating the soring. Otherwise the results are undefined.
meta — a pointer to an array of metadata values for each object to dequeue. Note that if the user isn't using object metadata values, this parameter can be NULL. The size of the elements in this array must be the same value as the meta_size parameter used while creating the soring. If the user created the soring with meta_size equal to zero, then meta should be NULL. Otherwise the results are undefined 😭
num — the number of objects to dequeue from the soring into the objs.
available — if non-NULL, returns the number of remaining soring entries after the dequeue has finished.

Returns

Actual number of objects dequeued.

`__rte_experimental uint32_t rte_soring_acquire_bulk(struct rte_soring * r, void * objs, uint32_t stage, uint32_t num, uint32_t * ftoken, uint32_t * available)`

⚠️ EXPERIMENTAL: this API may change without prior notice.

Acquire several objects from the soring for a given stage 🎯 Again: exactly the requested number of objects, or none. Iconic commitment, honestly. 👑

Parameters

r — a pointer to the soring structure.
objs — a pointer to an array of objects to acquire. Size of objects must be the same value as the elem_size parameter used while creating the soring. Otherwise the results are undefined.
stage — the stage to acquire objects for.
num — the number of objects to acquire.
ftoken — a pointer to the opaque token value used by the release() op. You, bestie, have to store this value somewhere, and hand it back later to release(). Don't lose it 💀
available — if non-NULL, returns the number of remaining soring entries for the given stage after the acquire has finished.

Returns

Actual number of objects acquired, either 0 or num.

`__rte_experimental uint32_t rte_soring_acquirx_bulk(struct rte_soring * r, void * objs, void * meta, uint32_t stage, uint32_t num, uint32_t * ftoken, uint32_t * available)`

⚠️ EXPERIMENTAL: this API may change without prior notice.

Acquire several objects plus metadata from the soring for a given stage. Acquires exactly the requested number of objects, or none — the x in the name is the main character energy ✨

Parameters

r — a pointer to the soring structure.
objs — a pointer to an array of objects to acquire. Size of objects must be the same value as the elem_size parameter used while creating the soring. Otherwise the results are undefined.
meta — a pointer to an array of metadata values for each acquired object. Note that if the user isn't using object metadata values, this parameter can be NULL. The size of the elements in this array must be the same value as the meta_size parameter used while creating the soring. If the user created the soring with meta_size equal to zero, then meta should be NULL. Otherwise the results are undefined 🙈
stage — the stage to acquire objects for.
num — the number of objects to acquire.
ftoken — a pointer to the opaque token value used by the release() op. You have to store this value somewhere and later provide it to the release(). Guard it with your life 🫶
available — if non-NULL, returns the number of remaining soring entries for the given stage after the acquire has finished.

Returns

Actual number of objects acquired, either 0 or num.

`__rte_experimental uint32_t rte_soring_acquire_burst(struct rte_soring * r, void * objs, uint32_t stage, uint32_t num, uint32_t * ftoken, uint32_t * available)`

⚠️ EXPERIMENTAL: this API may change without prior notice.

Acquire several objects from the soring for a given stage — up to the requested number of objects this time 🌈 she's flexible like that.

Parameters

r — a pointer to the soring structure.
objs — a pointer to an array of objects to acquire. Size of objects must be the same value as the elem_size parameter used while creating the soring. Otherwise the results are undefined.
stage — the stage to acquire objects for.
num — the number of objects to acquire.
ftoken — a pointer to the opaque token value used by the release() op. The user has to store this value somewhere, and later provide it to the release(). No storing it in your camera roll and forgetting, okay 😭
available — if non-NULL, returns the number of remaining soring entries for the given stage after the acquire has finished.

Returns

Actual number of objects acquired.

`__rte_experimental uint32_t rte_soring_acquirx_burst(struct rte_soring * r, void * objs, void * meta, uint32_t stage, uint32_t num, uint32_t * ftoken, uint32_t * available)`

⚠️ EXPERIMENTAL: this API may change without prior notice.

Acquire several objects plus metadata from the soring for a given stage, up to the requested number of objects 💜 the deluxe combo, the full set, the whole package.

Parameters

r — a pointer to the soring structure.
objs — a pointer to an array of objects to acquire. Size of objects must be the same value as the elem_size parameter used while creating the soring. Otherwise the results are undefined.
meta — a pointer to an array of metadata values for each acquired object. Note that if the user isn't using object metadata values, this parameter can be NULL. The size of the elements in this array must be the same value as the meta_size parameter used while creating the soring. If the user created the soring with meta_size equal to zero, then meta should be NULL. Otherwise the results are undefined 💀
stage — the stage to acquire objects for.
num — the number of objects to acquire.
ftoken — a pointer to the opaque token value used by the release() op. The user has to store this value somewhere, and later provide it to the release(). Treasure it. Put it in a little box. 🎀
available — if non-NULL, returns the number of remaining soring entries for the given stage after the acquire has finished.

Returns

Actual number of objects acquired.

`__rte_experimental void rte_soring_release(struct rte_soring * r, const void * objs, uint32_t stage, uint32_t n, uint32_t ftoken)`

⚠️ EXPERIMENTAL: this API may change without prior notice.

Release several objects for a given stage back to the soring 🦋 Heads up though: this means these objects become available for the next stage or for dequeue. You're handing them back to the group chat, they're circulating again.

Parameters

r — a pointer to the soring structure.
objs — a pointer to an array of objects to release. Note that unless the user needs to overwrite soring objects, this parameter can be NULL. Size of objects must be the same value as the elem_size parameter used while creating the soring. Otherwise the results are undefined.
stage — the current stage.
n — the number of objects to release. Has to be the same value as what was returned by the acquire() op. Matching values only, bestie, it's a duo costume situation 👯
ftoken — the opaque token value obtained from the acquire() op.

`__rte_experimental void rte_soring_releasx(struct rte_soring * r, const void * objs, const void * meta, uint32_t stage, uint32_t n, uint32_t ftoken)`

⚠️ EXPERIMENTAL: this API may change without prior notice.

Release several objects plus metadata for a given stage back to the soring 🌸 And yeah, same deal as before: this means these objects become available for the next stage or dequeue. She's back in circulation, periodt.

💖 Parameters 💖

okay bestie, here's the tea on every single argument this release op takes ☕✨ no skipping, we list them ALL:

r — a pointer to the soring structure. that's it, that's the whole vibe 🫶
objs — a pointer to an array of objects you wanna release. important note: unless you actually need to overwrite the soring objects, this parameter can be NULL. but the size of your objects has to be the exact same value as the elem_size parameter you used when you created the soring 🎀 if it isn't?? the results are undefined — like, no cap, undefined. we don't do that here 💀
meta — a pointer to an array of metadata values, one for each object you're releasing. another note: if you're not using object metadata values at all, then this parameter can be NULL, easy. but the size of the elements in this array has to match the meta_size parameter you used when creating the soring ✨ and if you created the soring with meta_size equal to zero, then meta should be NULL. otherwise the results are undefined — periodt, don't test it 🙈
stage — the current stage. just... the stage 🦋
n — the number of objects to release. this one has to be the same value as what the acquire() op returned. no creative liberties allowed, bestie 💅
ftoken — the opaque 'token' value you got from the acquire() op. opaque means don't peek inside it, just hand it back like a good girlie 🔥

👑 Author 👑

generated automatically by Doxygen for DPDK from the source code. i did NOT hand-write that part, the robots handled it and honestly? they ate 🤖✨

aaaaand that's a wrap on rte_soring.h(3) — sourced from DPDK, Version 25.11.3, and this whole glow-up was brought to you by the rte_soring.h(3) page itself 🌸 go forth and sort, you absolute icon, i'm literally so proud of you 🎀💖🦋

📦 where this page comes from

ubuntu resolute: dpdk-doc 25.11.3-0ubuntu0.26.04.1 · BSD-3-Clause
ubuntu stonking: dpdk-doc 25.11.3-1 · BSD-3-Clause
💖 girlified by deepseek-ai/DeepSeek-V4.1-Flash on 2026-11-03: a language model's rewrite of the original, under its terms

rte_soring.h(3)

🌸 rte_soring.h(3) — Library Functions Manual 🌸

✨ NAME ✨

🎀 SYNOPSIS 🎀

💅 Macros

🌈 Functions

🦋 Detailed Description 🦋

🧚 Macro Definition Documentation 🧚

#define RTE_SORING_ST_BIT 30

#define RTE_SORING_ELEM_MAX (RTE_BIT32(RTE_SORING_ST_BIT) - 1)

⭐ Function Documentation ⭐

🫶 rte_soring_get_memsize

🌸 rte_soring_init

🌈 rte_soring_count

✨ rte_soring_free_count

💜 rte_soring_dump

🎀 rte_soring_enqueue_bulk

🌟 rte_soring_enqueux_bulk

🦋 rte_soring_enqueue_burst

💖 rte_soring_enqueux_burst

🔥 rte_soring_dequeue_bulk

__rte_experimental uint32_t rte_soring_dequeux_bulk(struct rte_soring * r, void * objs, void * meta, uint32_t num, uint32_t * available)

__rte_experimental uint32_t rte_soring_dequeue_burst(struct rte_soring * r, void * objs, uint32_t num, uint32_t * available)

__rte_experimental uint32_t rte_soring_dequeux_burst(struct rte_soring * r, void * objs, void * meta, uint32_t num, uint32_t * available)

__rte_experimental uint32_t rte_soring_acquire_bulk(struct rte_soring * r, void * objs, uint32_t stage, uint32_t num, uint32_t * ftoken, uint32_t * available)

__rte_experimental uint32_t rte_soring_acquirx_bulk(struct rte_soring * r, void * objs, void * meta, uint32_t stage, uint32_t num, uint32_t * ftoken, uint32_t * available)

__rte_experimental uint32_t rte_soring_acquire_burst(struct rte_soring * r, void * objs, uint32_t stage, uint32_t num, uint32_t * ftoken, uint32_t * available)

__rte_experimental uint32_t rte_soring_acquirx_burst(struct rte_soring * r, void * objs, void * meta, uint32_t stage, uint32_t num, uint32_t * ftoken, uint32_t * available)

__rte_experimental void rte_soring_release(struct rte_soring * r, const void * objs, uint32_t stage, uint32_t n, uint32_t ftoken)

__rte_experimental void rte_soring_releasx(struct rte_soring * r, const void * objs, const void * meta, uint32_t stage, uint32_t n, uint32_t ftoken)

💖 Parameters 💖

👑 Author 👑

`#define RTE_SORING_ST_BIT 30`

`#define RTE_SORING_ELEM_MAX (RTE_BIT32(RTE_SORING_ST_BIT) - 1)`

🫶 `rte_soring_get_memsize`

🌸 `rte_soring_init`

🌈 `rte_soring_count`

✨ `rte_soring_free_count`

💜 `rte_soring_dump`

🎀 `rte_soring_enqueue_bulk`

🌟 `rte_soring_enqueux_bulk`

🦋 `rte_soring_enqueue_burst`

💖 `rte_soring_enqueux_burst`

🔥 `rte_soring_dequeue_bulk`

`__rte_experimental uint32_t rte_soring_dequeux_bulk(struct rte_soring * r, void * objs, void * meta, uint32_t num, uint32_t * available)`

`__rte_experimental uint32_t rte_soring_dequeue_burst(struct rte_soring * r, void * objs, uint32_t num, uint32_t * available)`

`__rte_experimental uint32_t rte_soring_dequeux_burst(struct rte_soring * r, void * objs, void * meta, uint32_t num, uint32_t * available)`

`__rte_experimental uint32_t rte_soring_acquire_bulk(struct rte_soring * r, void * objs, uint32_t stage, uint32_t num, uint32_t * ftoken, uint32_t * available)`

`__rte_experimental uint32_t rte_soring_acquirx_bulk(struct rte_soring * r, void * objs, void * meta, uint32_t stage, uint32_t num, uint32_t * ftoken, uint32_t * available)`

`__rte_experimental uint32_t rte_soring_acquire_burst(struct rte_soring * r, void * objs, uint32_t stage, uint32_t num, uint32_t * ftoken, uint32_t * available)`

`__rte_experimental uint32_t rte_soring_acquirx_burst(struct rte_soring * r, void * objs, void * meta, uint32_t stage, uint32_t num, uint32_t * ftoken, uint32_t * available)`

`__rte_experimental void rte_soring_release(struct rte_soring * r, const void * objs, uint32_t stage, uint32_t n, uint32_t ftoken)`

`__rte_experimental void rte_soring_releasx(struct rte_soring * r, const void * objs, const void * meta, uint32_t stage, uint32_t n, uint32_t ftoken)`