The hardware accelerated Rust RTOS

A concurrency framework for building real-time systems.

• Tasks as the unit of concurrency ¹. Tasks can be event triggered (fired in response to asynchronous stimuli) or spawned by the application on demand.

• Message passing between tasks. Specifically, messages can be passed to software tasks at spawn time.

• A timer queue ². Software tasks can be delayed or scheduled to continue running at some time in the future. This feature can be used to implement periodic tasks.

• Support for prioritization of tasks and, thus, preemptive multitasking.

• Efficient and data race free memory sharing through fine-grained priority based critical sections ¹.

• Deadlock free execution guaranteed at compile time. This is a stronger guarantee than what's provided by the standard Mutex abstraction.

• Minimal scheduling overhead. The task scheduler has minimal software footprint; the hardware does the bulk of the scheduling.

• Highly efficient memory usage: All the tasks share a single call stack and there's no hard dependency on a dynamic memory allocator.

• All Cortex-M devices are fully supported.

• Most RISC-V devices are supported. Refer to the RTIC book to learn more about RISC-V backends, their particularities, and their limitations.

• This task model is amenable to known WCET (Worst Case Execution Time) analysis and scheduling analysis techniques.

Documentation for the development version.

Join us and talk about RTIC in the Matrix room.

Weekly meeting minutes can be found over at RTIC HackMD

New features and big changes should go through the RFC process in the dedicated RFC repository.

To check all tests locally, make sure you got QEMU (and ESP32 QEMU if so desired) then:

$ cargo xtask ci

To only format code before PR (included in ci above):

$ cargo xtask fmt

Clippy lints:

$ cargo xtask clippy

and so on. See cargo xtask --help for all options.

This crate is based on the Real-Time For the Masses language created by the Embedded Systems group at Luleå University of Technology, led by Prof. Per Lindgren.

All source code (including code snippets) is licensed under either of

• Apache License, Version 2.0 (LICENSE-APACHE or https://www.apache.org/licenses/LICENSE-2.0)
• MIT license (LICENSE-MIT or https://opensource.org/licenses/MIT)

at your option.

The written prose contained within the book is licensed under the terms of the Creative Commons CC-BY-SA v4.0 license (LICENSE-CC-BY-SA or https://creativecommons.org/licenses/by-sa/4.0/legalcode).

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be licensed as above, without any additional terms or conditions.