Crate maitake_sync

maitake-sync

🎶🍄 “Dancing mushroom” — asynchronous synchronization primitives from maitake

what is it?

This library is a collection of synchronization primitives for asynchronous Rust software based on core::task and core::future, with a focus on supporting #![no_std] projects. It was initially developed as part of maitake, an “async runtime construction kit” intended for use in the mycelium and mnemOS operating systems, but it may be useful for other projects as well.

To learn a bit of the backstory behind maitake-sync, see the announcement post!

Note

This is a hobby project. I’m working on it in my spare time, for my own personal use. I’m very happy to share it with the broader Rust community, and contributions and bug reports are always welcome. However, please remember that I’m working on this library for fun, and if it stops being fun…well, you get the idea.

Anyway, feel free to use and enjoy this crate, and to contribute back as much as you want to!

Synchronization primitives are tools for implementing synchronization between tasks: to control which tasks can run at any given time, and in what order, and to coordinate tasks’ access to shared resources. Typically, this synchronization involves some form of waiting. In asynchronous systems, synchronization primitives allow tasks to wait by yielding to the runtime scheduler, so that other tasks may run while they are waiting.

a tour of maitake-sync

The following synchronization primitives are provided:

• Mutex: a fairly queued, asynchronous mutual exclusion lock, for protecting shared data
• RwLock: a fairly queued, asynchronous readers-writer lock, which allows concurrent read access to shared data while ensuring write access is exclusive
• Semaphore: an asynchronous counting semaphore, for limiting the number of tasks which may run concurrently
• WaitCell, a cell that stores a single waiting task’s Waker, so that the task can be woken by another task,
• WaitQueue, a queue of waiting tasks, which are woken in first-in, first-out order
• WaitMap, a set of waiting tasks associated with keys, in which a task can be woken by its key

In addition, the util module contains a collection of general-purpose utilities for implementing synchronization primitives, and the spin module contains implementations of non-async, spinning-based synchronization primitives.

usage considerations

maitake-sync is intended primarily for use in bare-metal projects, such as operating systems, operating system components, and embedded systems. These bare-metal systems typically do not use the Rust standard library, so maitake-sync supports #![no_std] by default, and the use of liballoc is feature-flagged for systems where liballoc is unavailable.

support for atomic operations

In general, maitake-sync is a platform-agnostic library. It does not interact directly with the underlying hardware, or use platform-specific features. However, one aspect of maitake-sync’s implementation may differ slightly across different target architectures: maitake-sync relies on atomic operations integers. Sometimes, atomic operations on integers of specific widths are needed (e.g., AtomicU64), which may not be available on all architectures.

In order to work on architectures which lack atomic operations on 64-bit integers, maitake-sync uses the portable-atomic crate by Taiki Endo. This crate crate polyfills atomic operations on integers larger than the platform’s pointer width, when these are not supported in hardware.

In most cases, users of maitake-sync don’t need to be aware of maitake-sync’s use of portable-atomic. If compiling maitake-sync for a target architecture that has native support for 64-bit atomic operations (such as x86_64 or aarch64), the native atomics are used automatically. Similarly, if compiling maitake for any target that has atomic compare-and-swap operations on any size integer, but lacks 64-bit atomics (i.e., 32-bit x86 targets like i686, or 32-bit ARM targets with atomic operations), the portable-atomic polyfill is used automatically. Finally, when compiling for target architectures which lack atomic operations because they are always single-core, such as MSP430 or AVR microcontrollers, portable-atomic simply uses unsynchronized operations with interrupts temporarily disabled.

The only case where the user must be aware of portable-atomic is when compiling for targets which lack atomic operations but are not guaranteed to always be single-core. This includes ARMv6-M (thumbv6m), pre-v6 ARM (e.g., thumbv4t, thumbv5te), and RISC-V targets without the A extension. On these architectures, the user must manually enable the RUSTFLAGS configuration --cfg portable_atomic_unsafe_assume_single_core if (and only if) the specific target hardware is known to be single-core. Enabling this cfg is unsafe, as it will cause unsound behavior on multi-core systems using these architectures.

Additional configurations for some single-core systems, which determine the specific sets of interrupts that portable-atomic will disable when entering a critical section, are described here.

features

The following features are available (this list is incomplete; you can help by expanding it.)

Feature	Default	Explanation
alloc	true	Enables liballoc dependency
no-cache-pad	false	Inhibits cache padding for the CachePadded struct. When this feature is NOT enabled, the size will be determined based on target platform.
tracing	false	Enables support for tracing diagnostics. Requires liballoc.
core-error	false	Enables implementations of the core::error::Error trait for maitake-sync’s error types. Requires a nightly Rust toolchain.

Modules

• mutex
  An asynchronous mutual exclusion lock.
• rwlock
  An asynchronous readers-writer lock.
• semaphore
  An asynchronous counting semaphore.
• spin
  Synchronous spinning-based synchronization primitives.
• util
  Reusable utilities for synchronization primitives.
• wait_cell
  An atomically registered Waker, for waking a single task.
• wait_map
  A map of Wakers associated with keys, so that a task can be woken by key.
• wait_queue
  A queue of waiting tasks that can be woken in first-in, first-out order (or all at once).

Structs

• Closed
  An error indicating that a WaitCell, WaitQueue or Semaphore was closed while attempting to register a waiting task.
• Mutex
  An asynchronous mutual exclusion lock for protecting shared data.
• MutexGuard
  An RAII implementation of a “scoped lock” of a Mutex. When this structure is dropped (falls out of scope), the lock will be unlocked.
• OwnedMutexGuard
  An RAII implementation of a “scoped lock” of a Mutex. When this structure is dropped (falls out of scope), the lock will be unlocked.
• OwnedRwLockReadGuard
  Owned RAII structure used to release the shared read access of a RwLock when dropped.
• OwnedRwLockWriteGuard
  Owned RAII structure used to release the exclusive write access of a RwLock when dropped.
• RwLock
  An asynchronous readers-writer lock.
• RwLockReadGuard
  RAII structure used to release the shared read access of a RwLock when dropped.
• RwLockWriteGuard
  RAII structure used to release the exclusive write access of a RwLock when dropped.
• Semaphore
  An asynchronous counting semaphore.
• WaitCell
  An atomically registered Waker.
• WaitMap
  A map of Wakers associated with keys, allowing tasks to be woken by their key.
• WaitQueue
  A queue of waiting tasks which can be woken in first-in, first-out order, or all at once.

Type Aliases

• WaitResult
  The result of waiting on a WaitQueue or Semaphore.