rtic/book/en/src/by-example/app.md

33 lines
2.3 KiB
Markdown
Raw Normal View History

2021-09-22 13:22:45 +02:00
# The `#[app]` attribute and an RTIC application
2018-11-03 17:02:41 +01:00
2021-09-22 13:22:45 +02:00
## Requirements on the `app` attribute
2018-11-03 17:02:41 +01:00
2023-01-28 21:57:43 +01:00
All RTIC applications use the [`app`] attribute (`#[app(..)]`). This attribute only applies to a `mod`-item containing the RTIC application. The `app` attribute has a mandatory `device` argument that takes a *path* as a value. This must be a full path pointing to a *peripheral access crate* (PAC) generated using [`svd2rust`] **v0.14.x** or newer.
2023-01-28 21:57:43 +01:00
The `app` attribute will expand into a suitable entry point and thus replaces the use of the [`cortex_m_rt::entry`] attribute.
2023-02-24 22:28:02 +01:00
[`app`]: ../../../api/rtic_macros/attr.app.html
[`svd2rust`]: https://crates.io/crates/svd2rust
2023-02-24 22:28:02 +01:00
[`cortex_m_rt::entry`]: https://docs.rs/cortex-m-rt-macros/latest/cortex_m_rt_macros/attr.entry.html
2023-01-28 21:57:43 +01:00
## Structure and zero-cost concurrency
2023-02-03 20:26:00 +01:00
An RTIC `app` is an executable system model for single-core applications, declaring a set of `local` and `shared` resources operated on by a set of `init`, `idle`, *hardware* and *software* tasks. In short the `init` task runs before any other task returning the set of `local` and `shared` resources. Tasks run preemptively based on their associated static priority, `idle` has the lowest priority (and can be used for background work, and/or to put the system to sleep until woken by some event). Hardware tasks are bound to underlying hardware interrupts, while software tasks are scheduled by asynchronous executors (one for each software task priority).
2023-01-28 21:57:43 +01:00
At compile time the task/resource model is analyzed under the Stack Resource Policy (SRP) and executable code generated with the following outstanding properties:
- guaranteed race-free resource access and deadlock-free execution on a single-shared stack
- hardware task scheduling is performed directly by the hardware, and
- software task scheduling is performed by auto generated async executors tailored to the application.
Overall, the generated code infers no additional overhead in comparison to a hand-written implementation, thus in Rust terms RTIC offers a zero-cost abstraction to concurrency.
2021-09-22 13:22:45 +02:00
## An RTIC application example
2018-11-03 17:02:41 +01:00
2021-12-14 22:46:15 +01:00
To give a flavour of RTIC, the following example contains commonly used features.
In the following sections we will go through each feature in detail.
2018-11-03 17:02:41 +01:00
``` rust
2023-01-28 21:57:43 +01:00
{{#include ../../../../rtic/examples/common.rs}}
2018-11-03 17:02:41 +01:00
```