Struct Table

#[repr(C)]
pub struct Table<const ITEM_COUNT: usize> {
    pub items: [LinearItem; ITEM_COUNT],
}

A table of linked list items.

Fields

items: [LinearItem; ITEM_COUNT]

The items.

Implementations

impl<const ITEM_COUNT: usize> Table<ITEM_COUNT>

pub fn new(items: [LinearItem; ITEM_COUNT]) -> Self

Create a new table.

pub unsafe fn new_ping_pong<W: Word>( request: Request, peri_addr: *mut W, buffer: &mut [W], direction: Dir, ) -> Table<2>

Create a ping-pong linked-list table.

This uses two linked-list items, one for each half of the buffer.

pub fn link(&mut self, run_mode: RunMode)

Link the table as given by the run mode.

pub fn len(&self) -> usize

The number of linked list items.

pub fn transfer_count(&self) -> usize

The total transfer count of the table in number of words.

pub fn link_indices(&mut self, first: usize, second: usize)

Link items of given indices together: first -> second.

pub fn link_sequential(&mut self)

Link items sequentially.

pub fn link_repeat(&mut self)

Link last to first item.

pub fn unlink(&mut self)

Unlink all items.

pub fn base_address(&self) -> u16

Linked list base address (upper 16 address bits).

pub fn offset_address(&self, index: usize) -> u16

Linked list offset address (lower 16 address bits) at the selected index.