rtic/examples/nested.rs

129 lines
3 KiB
Rust
Raw Normal View History

//! Nesting claims and how the preemption threshold works
//!
//! If you run this program you'll hit the breakpoints as indicated by the
//! letters in the comments: A, then B, then C, etc.
#![deny(unsafe_code)]
#![deny(warnings)]
#![no_std]
extern crate cortex_m_rtfm as rtfm;
extern crate stm32f103xx;
use rtfm::{app, Resource, Threshold};
2018-04-16 21:32:52 +02:00
use stm32f103xx::Interrupt;
app! {
device: stm32f103xx,
resources: {
static LOW: u64 = 0;
static HIGH: u64 = 0;
},
tasks: {
EXTI0: {
path: exti0,
priority: 1,
resources: [LOW, HIGH],
},
EXTI1: {
path: exti1,
priority: 2,
resources: [LOW],
},
EXTI2: {
path: exti2,
priority: 3,
resources: [HIGH],
},
},
}
fn init(_p: init::Peripherals, _r: init::Resources) {}
fn idle() -> ! {
2017-07-28 05:40:47 +02:00
// A
rtfm::bkpt();
// Sets task `exti0` as pending
//
2017-07-28 05:40:47 +02:00
// Because `exti0` has higher priority than `idle` it will be executed
// immediately
rtfm::set_pending(Interrupt::EXTI0); // ~> exti0
loop {
rtfm::wfi();
}
}
2017-07-29 07:34:00 +02:00
#[allow(non_snake_case)]
2018-08-24 16:31:04 +02:00
fn exti0(
t: &mut Threshold,
EXTI0::Resources {
LOW: mut low,
HIGH: mut high,
}: EXTI0::Resources,
) {
2017-07-28 05:40:47 +02:00
// Because this task has a priority of 1 the preemption threshold `t` also
// starts at 1
2017-07-28 05:40:47 +02:00
// B
rtfm::bkpt();
2017-07-28 05:40:47 +02:00
// Because `exti1` has higher priority than `exti0` it can preempt it
rtfm::set_pending(Interrupt::EXTI1); // ~> exti1
2017-07-28 05:40:47 +02:00
// A claim creates a critical section
2018-08-24 16:31:04 +02:00
low.claim_mut(t, |_low, t| {
2017-07-28 05:40:47 +02:00
// This claim increases the preemption threshold to 2
//
// 2 is just high enough to not race with task `exti1` for access to the
// `LOW` resource
2017-07-28 05:40:47 +02:00
// D
rtfm::bkpt();
2017-07-28 05:40:47 +02:00
// Now `exti1` can't preempt this task because its priority is equal to
// the current preemption threshold
rtfm::set_pending(Interrupt::EXTI1);
2017-07-28 05:40:47 +02:00
// But `exti2` can, because its priority is higher than the current
// preemption threshold
rtfm::set_pending(Interrupt::EXTI2); // ~> exti2
2017-07-28 05:40:47 +02:00
// F
rtfm::bkpt();
2017-07-28 05:40:47 +02:00
// Claims can be nested
2018-08-24 16:31:04 +02:00
high.claim_mut(t, |_high, _| {
// This claim increases the preemption threshold to 3
2017-07-28 05:40:47 +02:00
// Now `exti2` can't preempt this task
rtfm::set_pending(Interrupt::EXTI2);
2017-07-28 05:40:47 +02:00
// G
rtfm::bkpt();
});
2017-07-28 05:40:47 +02:00
// Upon leaving the critical section the preemption threshold drops back
// to 2 and `exti2` immediately preempts this task
// ~> exti2
});
2017-07-28 05:40:47 +02:00
// Once again the preemption threshold drops but this time to 1. Now the
// pending `exti1` task can preempt this task
// ~> exti1
}
fn exti1(_t: &mut Threshold, _r: EXTI1::Resources) {
2017-07-28 05:40:47 +02:00
// C, I
rtfm::bkpt();
}
fn exti2(_t: &mut Threshold, _r: EXTI2::Resources) {
2017-07-28 05:40:47 +02:00
// E, H
rtfm::bkpt();
}