rtic/book/en/src/by-example/timer-queue.md

112 lines
4.9 KiB
Markdown
Raw Normal View History

2018-11-03 17:02:41 +01:00
# Timer queue
2019-08-21 10:17:27 +02:00
In contrast with the `spawn` API, which immediately spawns a software task onto
the scheduler, the `schedule` API can be used to schedule a task to run some
time in the future.
To use the `schedule` API a monotonic timer must be first defined using the
`monotonic` argument of the `#[app]` attribute. This argument takes a path to a
type that implements the [`Monotonic`] trait. The associated type, `Instant`, of
this trait represents a timestamp in arbitrary units and it's used extensively
in the `schedule` API -- it is suggested to model this type after [the one in
the standard library][std-instant].
Although not shown in the trait definition (due to limitations in the trait /
type system) the subtraction of two `Instant`s should return some `Duration`
type (see [`core::time::Duration`]) and this `Duration` type must implement the
`TryInto<u32>` trait. The implementation of this trait must convert the
`Duration` value, which uses some arbitrary unit of time, into the "system timer
(SYST) clock cycles" time unit. The result of the conversion must be a 32-bit
integer. If the result of the conversion doesn't fit in a 32-bit number then the
operation must return an error, any error type.
2019-09-17 19:55:55 +02:00
[`Monotonic`]: ../../../api/rtfm/trait.Monotonic.html
2019-08-21 10:17:27 +02:00
[std-instant]: https://doc.rust-lang.org/std/time/struct.Instant.html
[`core::time::Duration`]: https://doc.rust-lang.org/core/time/struct.Duration.html
For ARMv7+ targets the `rtfm` crate provides a `Monotonic` implementation based
on the built-in CYCle CouNTer (CYCCNT). Note that this is a 32-bit timer clocked
at the frequency of the CPU and as such it is not suitable for tracking time
spans in the order of seconds.
To be able to schedule a software task from a context the name of the task must
first appear in the `schedule` argument of the context attribute. When
scheduling a task the (user-defined) `Instant` at which the task should be
executed must be passed as the first argument of the `schedule` invocation.
2018-11-03 17:02:41 +01:00
The example below schedules two tasks from `init`: `foo` and `bar`. `foo` is
scheduled to run 8 million clock cycles in the future. Next, `bar` is scheduled
2019-08-21 10:17:27 +02:00
to run 4 million clock cycles in the future. Thus `bar` runs before `foo` since
it was scheduled to run first.
2018-11-03 17:02:41 +01:00
> **IMPORTANT**: The examples that use the `schedule` API or the `Instant`
> abstraction will **not** properly work on QEMU because the Cortex-M cycle
> counter functionality has not been implemented in `qemu-system-arm`.
``` rust
2019-02-11 21:40:53 +01:00
{{#include ../../../../examples/schedule.rs}}
2018-11-03 17:02:41 +01:00
```
2019-08-21 10:17:27 +02:00
Running the program on real hardware produces the following output in the
console:
2018-11-03 17:02:41 +01:00
``` text
2019-02-11 21:40:53 +01:00
{{#include ../../../../ci/expected/schedule.run}}
2018-11-03 17:02:41 +01:00
```
2019-08-21 10:17:27 +02:00
When the `schedule` API is being used the runtime internally uses the `SysTick`
interrupt handler and the system timer peripheral (`SYST`) so neither can be
used by the application. This is accomplished by changing the type of
`init::Context.core` from `cortex_m::Peripherals` to `rtfm::Peripherals`. The
latter structure contains all the fields of the former minus the `SYST` one.
2018-11-03 17:02:41 +01:00
## Periodic tasks
Software tasks have access to the `Instant` at which they were scheduled to run
through the `scheduled` variable. This information and the `schedule` API can be
used to implement periodic tasks as shown in the example below.
``` rust
2019-02-11 21:40:53 +01:00
{{#include ../../../../examples/periodic.rs}}
2018-11-03 17:02:41 +01:00
```
This is the output produced by the example. Note that there is zero drift /
jitter even though `schedule.foo` was invoked at the *end* of `foo`. Using
`Instant::now` instead of `scheduled` would have resulted in drift / jitter.
``` text
2019-02-11 21:40:53 +01:00
{{#include ../../../../ci/expected/periodic.run}}
2018-11-03 17:02:41 +01:00
```
## Baseline
For the tasks scheduled from `init` we have exact information about their
`scheduled` time. For hardware tasks there's no `scheduled` time because these
2018-12-21 21:52:57 +01:00
tasks are asynchronous in nature. For hardware tasks the runtime provides a
2018-11-03 17:02:41 +01:00
`start` time, which indicates the time at which the task handler started
executing.
Note that `start` is **not** equal to the arrival time of the event that fired
the task. Depending on the priority of the task and the load of the system the
`start` time could be very far off from the event arrival time.
What do you think will be the value of `scheduled` for software tasks that are
*spawned* instead of scheduled? The answer is that spawned tasks inherit the
*baseline* time of the context that spawned it. The baseline of hardware tasks
2019-08-21 10:17:27 +02:00
is their `start` time, the baseline of software tasks is their `scheduled` time
and the baseline of `init` is the system start time or time zero
(`Instant::zero()`). `idle` doesn't really have a baseline but tasks spawned
from it will use `Instant::now()` as their baseline time.
2018-11-03 17:02:41 +01:00
The example below showcases the different meanings of the *baseline*.
``` rust
2019-02-11 21:40:53 +01:00
{{#include ../../../../examples/baseline.rs}}
2018-11-03 17:02:41 +01:00
```
Running the program on real hardware produces the following output in the console:
``` text
2019-02-11 21:40:53 +01:00
{{#include ../../../../ci/expected/baseline.run}}
2018-11-03 17:02:41 +01:00
```