Struct SemaphoreState 

pub struct SemaphoreState { /* private fields */ }

Shared admission-control counter backing SEMAPHORE words. Clones share the backend, so every word naming one semaphore observes the same count. Lock-free atomics throughout: no mutex exists to poison, so Drop paths stay infallible on every path including unwinding. No waiter ever sleeps on the counter, so the non-blocking acquire adds zero wedge surface.

Implementations

impl SemaphoreState

pub fn try_acquire(&self) -> bool

Non-blocking acquire: true and counted when a permit was free. Compare-and-swap loop, so only a winning CAS claims a slot.

pub fn release(&self)

Release one permit. Saturating and infallible: exactly-once last-drop release (see PermitInner) keeps this exact, and the floor (never a wrap, never a panic) is the backstop.

pub fn available(&self) -> usize

Permits currently free. Exact at read time, stale the instant the caller acts on it: observability only, never admission input.

Trait Implementations

impl Debug for SemaphoreState

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

Formats the value using the given formatter.