2018-11-04 18:50:42 +01:00
|
|
|
//! IMPLEMENTATION DETAILS. DO NOT USE ANYTHING IN THIS MODULE
|
|
|
|
|
|
|
|
#[cfg(not(debug_assertions))]
|
|
|
|
use core::hint;
|
|
|
|
use core::{cell::Cell, ptr, u8};
|
2018-11-03 17:02:41 +01:00
|
|
|
|
|
|
|
#[cfg(armv7m)]
|
|
|
|
use cortex_m::register::basepri;
|
|
|
|
pub use cortex_m::{
|
|
|
|
asm::wfi, interrupt, peripheral::scb::SystemHandler, peripheral::syst::SystClkSource,
|
|
|
|
peripheral::Peripherals,
|
|
|
|
};
|
|
|
|
pub use heapless::consts;
|
2018-12-16 01:11:54 +01:00
|
|
|
use heapless::spsc::{Queue, SingleCore};
|
2018-11-03 17:02:41 +01:00
|
|
|
|
|
|
|
#[cfg(feature = "timer-queue")]
|
|
|
|
pub use crate::tq::{isr as sys_tick, NotReady, TimerQueue};
|
|
|
|
|
2018-12-16 01:11:54 +01:00
|
|
|
pub type FreeQueue<N> = Queue<u8, N, usize, SingleCore>;
|
|
|
|
pub type ReadyQueue<T, N> = Queue<(T, u8), N, usize, SingleCore>;
|
2018-11-03 17:02:41 +01:00
|
|
|
|
|
|
|
#[cfg(armv7m)]
|
|
|
|
#[inline(always)]
|
|
|
|
pub fn run<F>(f: F)
|
|
|
|
where
|
|
|
|
F: FnOnce(),
|
|
|
|
{
|
|
|
|
let initial = basepri::read();
|
|
|
|
f();
|
|
|
|
unsafe { basepri::write(initial) }
|
|
|
|
}
|
|
|
|
|
|
|
|
#[cfg(not(armv7m))]
|
|
|
|
#[inline(always)]
|
|
|
|
pub fn run<F>(f: F)
|
|
|
|
where
|
|
|
|
F: FnOnce(),
|
|
|
|
{
|
|
|
|
f();
|
|
|
|
}
|
|
|
|
|
2019-02-16 00:22:00 +01:00
|
|
|
// Newtype over `Cell` that forbids mutation through a shared reference
|
|
|
|
pub struct Priority {
|
|
|
|
inner: Cell<u8>,
|
|
|
|
}
|
|
|
|
|
|
|
|
impl Priority {
|
|
|
|
#[inline(always)]
|
|
|
|
pub unsafe fn new(value: u8) -> Self {
|
2019-02-16 00:26:07 +01:00
|
|
|
Priority {
|
|
|
|
inner: Cell::new(value),
|
|
|
|
}
|
2019-02-16 00:22:00 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// these two methods are used by claim (see below) but can't be used from the RTFM application
|
|
|
|
#[inline(always)]
|
|
|
|
fn set(&self, value: u8) {
|
|
|
|
self.inner.set(value)
|
|
|
|
}
|
|
|
|
|
|
|
|
#[inline(always)]
|
|
|
|
fn get(&self) -> u8 {
|
|
|
|
self.inner.get()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-11-03 17:02:41 +01:00
|
|
|
// TODO(MaybeUninit) Until core::mem::MaybeUninit is stabilized we use our own (inefficient)
|
|
|
|
// implementation
|
|
|
|
pub struct MaybeUninit<T> {
|
|
|
|
value: Option<T>,
|
|
|
|
}
|
|
|
|
|
|
|
|
impl<T> MaybeUninit<T> {
|
|
|
|
pub const fn uninitialized() -> Self {
|
|
|
|
MaybeUninit { value: None }
|
|
|
|
}
|
|
|
|
|
|
|
|
pub unsafe fn get_ref(&self) -> &T {
|
|
|
|
if let Some(x) = self.value.as_ref() {
|
|
|
|
x
|
|
|
|
} else {
|
2018-11-04 18:50:42 +01:00
|
|
|
match () {
|
|
|
|
// Try to catch UB when compiling in release with debug assertions enabled
|
|
|
|
#[cfg(debug_assertions)]
|
|
|
|
() => unreachable!(),
|
|
|
|
#[cfg(not(debug_assertions))]
|
|
|
|
() => hint::unreachable_unchecked(),
|
|
|
|
}
|
2018-11-03 17:02:41 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
pub unsafe fn get_mut(&mut self) -> &mut T {
|
|
|
|
if let Some(x) = self.value.as_mut() {
|
|
|
|
x
|
|
|
|
} else {
|
2018-11-04 18:50:42 +01:00
|
|
|
match () {
|
|
|
|
// Try to catch UB when compiling in release with debug assertions enabled
|
|
|
|
#[cfg(debug_assertions)]
|
|
|
|
() => unreachable!(),
|
|
|
|
#[cfg(not(debug_assertions))]
|
|
|
|
() => hint::unreachable_unchecked(),
|
|
|
|
}
|
2018-11-03 17:02:41 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
pub fn set(&mut self, val: T) {
|
2018-11-04 18:50:42 +01:00
|
|
|
// NOTE(volatile) we have observed UB when this uses a plain `ptr::write`
|
|
|
|
unsafe { ptr::write_volatile(&mut self.value, Some(val)) }
|
2018-11-03 17:02:41 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#[inline(always)]
|
|
|
|
pub fn assert_send<T>()
|
|
|
|
where
|
|
|
|
T: Send,
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
#[inline(always)]
|
|
|
|
pub fn assert_sync<T>()
|
|
|
|
where
|
|
|
|
T: Sync,
|
|
|
|
{
|
|
|
|
}
|
2018-11-04 18:50:42 +01:00
|
|
|
|
|
|
|
#[cfg(armv7m)]
|
|
|
|
#[inline(always)]
|
|
|
|
pub unsafe fn claim<T, R, F>(
|
|
|
|
ptr: *mut T,
|
2019-02-16 00:22:00 +01:00
|
|
|
priority: &Priority,
|
2018-11-04 18:50:42 +01:00
|
|
|
ceiling: u8,
|
|
|
|
nvic_prio_bits: u8,
|
|
|
|
f: F,
|
|
|
|
) -> R
|
|
|
|
where
|
|
|
|
F: FnOnce(&mut T) -> R,
|
|
|
|
{
|
|
|
|
let current = priority.get();
|
|
|
|
|
|
|
|
if priority.get() < ceiling {
|
|
|
|
if ceiling == (1 << nvic_prio_bits) {
|
|
|
|
priority.set(u8::MAX);
|
|
|
|
let r = interrupt::free(|_| f(&mut *ptr));
|
|
|
|
priority.set(current);
|
|
|
|
r
|
|
|
|
} else {
|
|
|
|
priority.set(ceiling);
|
|
|
|
basepri::write(logical2hw(ceiling, nvic_prio_bits));
|
|
|
|
let r = f(&mut *ptr);
|
|
|
|
basepri::write(logical2hw(current, nvic_prio_bits));
|
|
|
|
priority.set(current);
|
|
|
|
r
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
f(&mut *ptr)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#[cfg(not(armv7m))]
|
|
|
|
#[inline(always)]
|
|
|
|
pub unsafe fn claim<T, R, F>(
|
|
|
|
ptr: *mut T,
|
2019-02-16 00:22:00 +01:00
|
|
|
priority: &Priority,
|
2018-11-04 18:50:42 +01:00
|
|
|
ceiling: u8,
|
|
|
|
_nvic_prio_bits: u8,
|
|
|
|
f: F,
|
|
|
|
) -> R
|
|
|
|
where
|
|
|
|
F: FnOnce(&mut T) -> R,
|
|
|
|
{
|
|
|
|
let current = priority.get();
|
|
|
|
|
|
|
|
if priority.get() < ceiling {
|
|
|
|
priority.set(u8::MAX);
|
|
|
|
let r = interrupt::free(|_| f(&mut *ptr));
|
|
|
|
priority.set(current);
|
|
|
|
r
|
|
|
|
} else {
|
|
|
|
f(&mut *ptr)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#[cfg(armv7m)]
|
|
|
|
#[inline]
|
|
|
|
fn logical2hw(logical: u8, nvic_prio_bits: u8) -> u8 {
|
|
|
|
((1 << nvic_prio_bits) - logical) << (8 - nvic_prio_bits)
|
|
|
|
}
|