pub struct PackedDescriptorChain<'m> {
    avail_wrap_counter: bool,
    index: Option<u16>,
    count: u16,
    id: Option<u16>,
    queue_size: u16,
    mem: &'m GuestMemory,
    desc_table: GuestAddress,
}

Fields§

§avail_wrap_counter: bool§index: Option<u16>

Current descriptor index within desc_table, or None if the iterator is exhausted.

§count: u16

Number of descriptors returned by the iterator already. If count reaches queue_size, the chain has a loop and is therefore invalid.

§id: Option<u16>

Buffer Id, which locates at the last descriptor in the chain

§queue_size: u16§mem: &'m GuestMemory§desc_table: GuestAddress

Implementations§

source§

impl<'m> PackedDescriptorChain<'m>

source

pub fn new( mem: &'m GuestMemory, desc_table: GuestAddress, queue_size: u16, avail_wrap_counter: bool, index: u16 ) -> PackedDescriptorChain<'m>

Construct a new iterator over a split virtqueue descriptor chain.

§Arguments
  • mem - The GuestMemory containing the descriptor chain.
  • desc_table - Guest physical address of the descriptor table.
  • queue_size - Total number of entries in the descriptor table.
  • index - The index of the first descriptor in the chain.

Trait Implementations§

source§

impl DescriptorChainIter for PackedDescriptorChain<'_>

source§

fn next(&mut self) -> Result<Option<Descriptor>>

Return the next descriptor in the chain, or None if there are no more descriptors.
source§

fn count(&self) -> u16

Return the number of descriptor has been iterated in the chain
source§

fn id(&self) -> Option<u16>

Return Packed descriptor chain buffer id if iterator reaches end, otherwise return None SplitDescriptorChainIter should return None.

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<T> Downcast for T
where T: Any,

§

fn into_any(self: Box<T>) -> Box<dyn Any>

Convert Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.
§

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>

Convert Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait.
§

fn as_any(&self) -> &(dyn Any + 'static)

Convert &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s.
§

fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

Convert &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s.
§

impl<T> DowncastSync for T
where T: Any + Send + Sync,

§

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Send + Sync>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V