2017-04-21 07:24:54 +02:00
|
|
|
extern crate cortex_m_rtfm as rtfm;
|
2017-04-10 05:42:17 +02:00
|
|
|
|
2017-05-08 19:05:42 +02:00
|
|
|
use rtfm::{CMax, C2, P1, P2, P3, PMax, Resource, T1, T2, T3, TMax};
|
2017-04-10 05:42:17 +02:00
|
|
|
|
|
|
|
static R1: Resource<i32, C2> = Resource::new(0);
|
|
|
|
|
2017-04-22 04:24:28 +02:00
|
|
|
// You don't need to raise the ceiling to access a resource with ceiling equal
|
|
|
|
// to the task priority.
|
2017-05-08 19:05:42 +02:00
|
|
|
fn j1(prio: P2, thr: T2) {
|
|
|
|
thr.raise(&R1, |_| {});
|
2017-04-10 05:42:17 +02:00
|
|
|
//~^ error
|
|
|
|
|
|
|
|
// OK
|
2017-05-08 19:05:42 +02:00
|
|
|
let r1 = R1.access(&prio, &thr);
|
2017-04-10 05:42:17 +02:00
|
|
|
}
|
|
|
|
|
2017-04-22 04:24:28 +02:00
|
|
|
// You CAN access a resource with ceiling C from a task with priority P if C > P
|
2017-05-08 19:05:42 +02:00
|
|
|
// if you raise the preemption threshold first
|
|
|
|
fn j2(prio: P1, thr: T1) {
|
2017-04-10 05:42:17 +02:00
|
|
|
// OK
|
2017-05-08 19:05:42 +02:00
|
|
|
thr.raise(&R1, |thr| { let r1 = R1.access(&prio, thr); })
|
2017-04-10 05:42:17 +02:00
|
|
|
}
|
|
|
|
|
2017-05-08 19:05:42 +02:00
|
|
|
static R2: Resource<i32, CMax> = Resource::new(0);
|
2017-04-10 05:42:17 +02:00
|
|
|
|
2017-05-08 19:05:42 +02:00
|
|
|
// Tasks with priority less than P16 can't access a resource with ceiling CMax
|
|
|
|
fn j4(prio: P1, thr: T1) {
|
|
|
|
thr.raise(&R2, |thr| {});
|
2017-04-22 04:24:28 +02:00
|
|
|
//~^ error
|
2017-04-10 05:42:17 +02:00
|
|
|
}
|
|
|
|
|
2017-05-08 19:05:42 +02:00
|
|
|
// Only tasks with priority P16 can directly access a resource with ceiling CMax
|
|
|
|
fn j5(prio: PMax, thr: TMax) {
|
2017-04-10 05:42:17 +02:00
|
|
|
// OK
|
2017-05-08 19:05:42 +02:00
|
|
|
let r2 = R2.access(&prio, &thr);
|
2017-04-10 05:42:17 +02:00
|
|
|
}
|