Struct IrqWaitCell 

pub struct IrqWaitCell { /* private fields */ }

Pending-bit plus single-waiter hard-IRQ event cell.

Implementations

impl IrqWaitCell

pub const fn new() -> Self

Creates an empty notification cell.

pub fn register<'cell>( &'cell self, registration: &IrqWaitRegistration, ) -> IrqRegisterResult<'cell>

Registers one stable waiter, consuming an earlier IRQ when present.

pub fn notify(&self) -> IrqNotifyResult

Wakes the sole registered thread or publishes one coalesced pending bit.

This operation performs a bounded number of atomics and at most one trusted direct wake. After repeated contention, it atomically installs the sticky pending state and may retain one harmless extra service pass after waking the displaced waiter. It never scans a wait queue or allocates.

The whole claim-to-release section runs non-preemptible, mirroring Linux’s irq_work execution boundary: hard IRQ context is inherently non-preemptible, and ordinary task context enters a preemption scope, matching how irq_workd disables migration around the claim. This bounds how long a draining waiter can observe a Notifying claim.

pub fn is_pending(&self) -> bool

Reports whether an IRQ is coalesced for the next registration.

Trait Implementations

impl Debug for IrqWaitCell

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for IrqWaitCell

fn default() -> Self

Returns the “default value” for a type.

impl Drop for IrqWaitCell

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.