pub struct MbufQueue { /* private fields */ }Expand description
Tail-queue of mbufs. Mirrors the C struct mhdr head and the
STAILQ_* macros that operated on it.
The container is a VecDeque; insertion at either end is O(1).
§Examples
use dynomite::io::mbuf::{MbufPool, MbufQueue};
let pool = MbufPool::default();
let mut q = MbufQueue::new();
q.push_back(pool.get());
q.push_back(pool.get());
assert_eq!(q.len(), 2);
let _ = q.pop_front();
assert_eq!(q.len(), 1);Implementations§
Source§impl MbufQueue
impl MbufQueue
Sourcepub fn push_front(&mut self, mbuf: Mbuf)
pub fn push_front(&mut self, mbuf: Mbuf)
Insert mbuf at the head. Mirrors mbuf_insert_head.
Sourcepub fn pop_front(&mut self) -> Option<Mbuf>
pub fn pop_front(&mut self) -> Option<Mbuf>
Remove and return the head buffer. Mirrors mbuf_remove
applied to the head; the C API allowed removing from any
position, but every reference call site removed the head.
Sourcepub fn back_mut(&mut self) -> Option<&mut Mbuf>
pub fn back_mut(&mut self) -> Option<&mut Mbuf>
Borrow the tail buffer mutably without removing it. Used by
the mbuf_split consumers that want to operate on the latest
chunk.
Source§impl MbufQueue
impl MbufQueue
Sourcepub fn recycle(&mut self, pool: &MbufPool)
pub fn recycle(&mut self, pool: &MbufPool)
Drain the queue into the pool, recycling every chunk.
§Examples
use dynomite::io::mbuf::{MbufPool, MbufQueue};
let pool = MbufPool::default();
let mut q = MbufQueue::new();
q.push_back(pool.get());
q.push_back(pool.get());
q.recycle(&pool);
assert!(q.is_empty());Trait Implementations§
Auto Trait Implementations§
impl Freeze for MbufQueue
impl RefUnwindSafe for MbufQueue
impl Send for MbufQueue
impl Sync for MbufQueue
impl Unpin for MbufQueue
impl UnsafeUnpin for MbufQueue
impl UnwindSafe for MbufQueue
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> FutureExt for T
impl<T> FutureExt for T
Source§fn with_context(self, otel_cx: Context) -> WithContext<Self>
fn with_context(self, otel_cx: Context) -> WithContext<Self>
Source§fn with_current_context(self) -> WithContext<Self>
fn with_current_context(self) -> WithContext<Self>
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.