2023-07-03 22:57:33 +02:00
|
|
|
use core::cell::{RefCell, RefMut};
|
2023-03-20 21:19:14 +01:00
|
|
|
use core::future::poll_fn;
|
2023-05-30 02:09:52 +02:00
|
|
|
use core::marker::PhantomData;
|
2021-08-06 00:08:24 +02:00
|
|
|
use core::ops::{Deref, DerefMut};
|
2023-03-20 21:19:14 +01:00
|
|
|
use core::task::Poll;
|
2021-08-06 00:08:24 +02:00
|
|
|
|
2022-06-12 22:15:44 +02:00
|
|
|
pub use bxcan;
|
2023-04-06 16:20:34 +02:00
|
|
|
use bxcan::{Data, ExtendedId, Frame, Id, StandardId};
|
2023-07-28 13:23:22 +02:00
|
|
|
use embassy_hal_internal::{into_ref, PeripheralRef};
|
2023-05-30 02:09:52 +02:00
|
|
|
use futures::FutureExt;
|
2021-08-06 00:08:24 +02:00
|
|
|
|
2022-02-10 21:38:03 +01:00
|
|
|
use crate::gpio::sealed::AFType;
|
2023-06-19 23:05:59 +02:00
|
|
|
use crate::interrupt::typelevel::Interrupt;
|
2023-04-06 16:20:34 +02:00
|
|
|
use crate::pac::can::vals::{Lec, RirIde};
|
2022-06-12 22:15:44 +02:00
|
|
|
use crate::rcc::RccPeripheral;
|
2023-04-06 16:20:34 +02:00
|
|
|
use crate::time::Hertz;
|
2023-05-30 02:09:52 +02:00
|
|
|
use crate::{interrupt, peripherals, Peripheral};
|
|
|
|
|
2023-07-25 11:07:09 +02:00
|
|
|
/// Contains CAN frame and additional metadata.
|
|
|
|
///
|
|
|
|
/// Timestamp is available if `time` feature is enabled.
|
2023-07-31 09:32:17 +02:00
|
|
|
#[derive(Debug, Clone, PartialEq, Eq)]
|
2023-07-25 11:07:09 +02:00
|
|
|
#[cfg_attr(feature = "defmt", derive(defmt::Format))]
|
|
|
|
pub struct Envelope {
|
|
|
|
#[cfg(feature = "time")]
|
|
|
|
pub ts: embassy_time::Instant,
|
|
|
|
pub frame: bxcan::Frame,
|
|
|
|
}
|
|
|
|
|
2023-05-30 02:09:52 +02:00
|
|
|
/// Interrupt handler.
|
|
|
|
pub struct TxInterruptHandler<T: Instance> {
|
|
|
|
_phantom: PhantomData<T>,
|
|
|
|
}
|
|
|
|
|
2023-06-19 23:05:59 +02:00
|
|
|
impl<T: Instance> interrupt::typelevel::Handler<T::TXInterrupt> for TxInterruptHandler<T> {
|
2023-05-30 02:09:52 +02:00
|
|
|
unsafe fn on_interrupt() {
|
|
|
|
T::regs().tsr().write(|v| {
|
|
|
|
v.set_rqcp(0, true);
|
|
|
|
v.set_rqcp(1, true);
|
|
|
|
v.set_rqcp(2, true);
|
|
|
|
});
|
|
|
|
|
|
|
|
T::state().tx_waker.wake();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
pub struct Rx0InterruptHandler<T: Instance> {
|
|
|
|
_phantom: PhantomData<T>,
|
|
|
|
}
|
|
|
|
|
2023-06-19 23:05:59 +02:00
|
|
|
impl<T: Instance> interrupt::typelevel::Handler<T::RX0Interrupt> for Rx0InterruptHandler<T> {
|
2023-05-30 02:09:52 +02:00
|
|
|
unsafe fn on_interrupt() {
|
2023-05-31 04:14:25 +02:00
|
|
|
// info!("rx0 irq");
|
2023-05-30 02:09:52 +02:00
|
|
|
Can::<T>::receive_fifo(RxFifo::Fifo0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
pub struct Rx1InterruptHandler<T: Instance> {
|
|
|
|
_phantom: PhantomData<T>,
|
|
|
|
}
|
|
|
|
|
2023-06-19 23:05:59 +02:00
|
|
|
impl<T: Instance> interrupt::typelevel::Handler<T::RX1Interrupt> for Rx1InterruptHandler<T> {
|
2023-05-30 02:09:52 +02:00
|
|
|
unsafe fn on_interrupt() {
|
2023-05-31 04:14:25 +02:00
|
|
|
// info!("rx1 irq");
|
2023-05-30 02:09:52 +02:00
|
|
|
Can::<T>::receive_fifo(RxFifo::Fifo1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
pub struct SceInterruptHandler<T: Instance> {
|
|
|
|
_phantom: PhantomData<T>,
|
|
|
|
}
|
|
|
|
|
2023-06-19 23:05:59 +02:00
|
|
|
impl<T: Instance> interrupt::typelevel::Handler<T::SCEInterrupt> for SceInterruptHandler<T> {
|
2023-05-30 02:09:52 +02:00
|
|
|
unsafe fn on_interrupt() {
|
2023-05-31 04:14:25 +02:00
|
|
|
// info!("sce irq");
|
2023-05-30 02:09:52 +02:00
|
|
|
let msr = T::regs().msr();
|
|
|
|
let msr_val = msr.read();
|
|
|
|
|
|
|
|
if msr_val.erri() {
|
|
|
|
msr.modify(|v| v.set_erri(true));
|
|
|
|
T::state().err_waker.wake();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2021-08-06 00:08:24 +02:00
|
|
|
|
2022-07-23 01:29:35 +02:00
|
|
|
pub struct Can<'d, T: Instance> {
|
2023-06-22 17:17:51 +02:00
|
|
|
pub can: RefCell<bxcan::Can<BxcanInstance<'d, T>>>,
|
2021-08-06 00:08:24 +02:00
|
|
|
}
|
|
|
|
|
2023-04-06 16:20:34 +02:00
|
|
|
#[derive(Debug)]
|
2023-07-28 13:22:24 +02:00
|
|
|
#[cfg_attr(feature = "defmt", derive(defmt::Format))]
|
2023-04-06 16:20:34 +02:00
|
|
|
pub enum BusError {
|
|
|
|
Stuff,
|
|
|
|
Form,
|
|
|
|
Acknowledge,
|
|
|
|
BitRecessive,
|
|
|
|
BitDominant,
|
|
|
|
Crc,
|
|
|
|
Software,
|
|
|
|
BusOff,
|
|
|
|
BusPassive,
|
|
|
|
BusWarning,
|
|
|
|
}
|
|
|
|
|
2023-07-28 13:22:24 +02:00
|
|
|
#[derive(Debug)]
|
|
|
|
#[cfg_attr(feature = "defmt", derive(defmt::Format))]
|
|
|
|
pub enum TryReadError {
|
|
|
|
/// Bus error
|
|
|
|
BusError(BusError),
|
|
|
|
/// Receive buffer is empty
|
|
|
|
Empty,
|
|
|
|
}
|
|
|
|
|
|
|
|
#[derive(Debug)]
|
|
|
|
#[cfg_attr(feature = "defmt", derive(defmt::Format))]
|
|
|
|
pub enum TryWriteError {
|
|
|
|
/// All transmit mailboxes are full
|
|
|
|
Full,
|
|
|
|
}
|
|
|
|
|
2022-07-23 01:29:35 +02:00
|
|
|
impl<'d, T: Instance> Can<'d, T> {
|
2022-09-22 04:29:57 +02:00
|
|
|
/// Creates a new Bxcan instance, keeping the peripheral in sleep mode.
|
|
|
|
/// You must call [Can::enable_non_blocking] to use the peripheral.
|
2023-05-31 04:14:25 +02:00
|
|
|
pub fn new(
|
2022-09-22 04:29:57 +02:00
|
|
|
peri: impl Peripheral<P = T> + 'd,
|
|
|
|
rx: impl Peripheral<P = impl RxPin<T>> + 'd,
|
|
|
|
tx: impl Peripheral<P = impl TxPin<T>> + 'd,
|
2023-06-19 23:05:59 +02:00
|
|
|
_irqs: impl interrupt::typelevel::Binding<T::TXInterrupt, TxInterruptHandler<T>>
|
|
|
|
+ interrupt::typelevel::Binding<T::RX0Interrupt, Rx0InterruptHandler<T>>
|
|
|
|
+ interrupt::typelevel::Binding<T::RX1Interrupt, Rx1InterruptHandler<T>>
|
|
|
|
+ interrupt::typelevel::Binding<T::SCEInterrupt, SceInterruptHandler<T>>
|
2023-05-30 02:09:52 +02:00
|
|
|
+ 'd,
|
2022-09-22 04:29:57 +02:00
|
|
|
) -> Self {
|
2023-05-30 02:09:52 +02:00
|
|
|
into_ref!(peri, rx, tx);
|
2022-09-22 04:29:57 +02:00
|
|
|
|
2023-06-19 03:07:26 +02:00
|
|
|
rx.set_as_af(rx.af_num(), AFType::Input);
|
|
|
|
tx.set_as_af(tx.af_num(), AFType::OutputPushPull);
|
2022-09-22 04:29:57 +02:00
|
|
|
|
2023-10-11 21:38:41 +02:00
|
|
|
T::enable_and_reset();
|
2022-09-22 04:29:57 +02:00
|
|
|
|
2023-06-19 23:05:59 +02:00
|
|
|
{
|
2023-05-31 04:14:25 +02:00
|
|
|
use crate::pac::can::vals::{Errie, Fmpie, Tmeie};
|
|
|
|
|
|
|
|
T::regs().ier().write(|w| {
|
|
|
|
// TODO: fix metapac
|
|
|
|
|
2023-06-29 01:51:19 +02:00
|
|
|
w.set_errie(Errie::from_bits(1));
|
|
|
|
w.set_fmpie(0, Fmpie::from_bits(1));
|
|
|
|
w.set_fmpie(1, Fmpie::from_bits(1));
|
|
|
|
w.set_tmeie(Tmeie::from_bits(1));
|
2023-05-31 04:14:25 +02:00
|
|
|
});
|
|
|
|
|
|
|
|
T::regs().mcr().write(|w| {
|
|
|
|
// Enable timestamps on rx messages
|
|
|
|
|
|
|
|
w.set_ttcm(true);
|
2023-06-19 23:05:59 +02:00
|
|
|
});
|
2023-05-31 04:14:25 +02:00
|
|
|
}
|
|
|
|
|
2023-05-30 02:09:52 +02:00
|
|
|
unsafe {
|
2023-06-19 23:05:59 +02:00
|
|
|
T::TXInterrupt::unpend();
|
|
|
|
T::TXInterrupt::enable();
|
2023-03-20 21:19:14 +01:00
|
|
|
|
2023-06-19 23:05:59 +02:00
|
|
|
T::RX0Interrupt::unpend();
|
|
|
|
T::RX0Interrupt::enable();
|
2023-03-20 21:19:14 +01:00
|
|
|
|
2023-06-19 23:05:59 +02:00
|
|
|
T::RX1Interrupt::unpend();
|
|
|
|
T::RX1Interrupt::enable();
|
2023-03-20 21:19:14 +01:00
|
|
|
|
2023-06-19 23:05:59 +02:00
|
|
|
T::SCEInterrupt::unpend();
|
|
|
|
T::SCEInterrupt::enable();
|
2023-05-30 02:09:52 +02:00
|
|
|
}
|
2023-03-20 21:19:14 +01:00
|
|
|
|
2023-06-19 03:07:26 +02:00
|
|
|
rx.set_as_af(rx.af_num(), AFType::Input);
|
|
|
|
tx.set_as_af(tx.af_num(), AFType::OutputPushPull);
|
2022-09-22 04:29:57 +02:00
|
|
|
|
2023-04-06 16:20:34 +02:00
|
|
|
let can = bxcan::Can::builder(BxcanInstance(peri)).leave_disabled();
|
2023-06-22 17:17:51 +02:00
|
|
|
let can_ref_cell = RefCell::new(can);
|
|
|
|
Self { can: can_ref_cell }
|
2023-04-06 16:20:34 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
pub fn set_bitrate(&mut self, bitrate: u32) {
|
|
|
|
let bit_timing = Self::calc_bxcan_timings(T::frequency(), bitrate).unwrap();
|
2023-07-03 22:57:33 +02:00
|
|
|
self.can
|
|
|
|
.borrow_mut()
|
|
|
|
.modify_config()
|
|
|
|
.set_bit_timing(bit_timing)
|
|
|
|
.leave_disabled();
|
2022-09-22 04:29:57 +02:00
|
|
|
}
|
2023-03-20 21:19:14 +01:00
|
|
|
|
2023-07-24 16:46:03 +02:00
|
|
|
/// Enables the peripheral and synchronizes with the bus.
|
|
|
|
///
|
|
|
|
/// This will wait for 11 consecutive recessive bits (bus idle state).
|
|
|
|
/// Contrary to enable method from bxcan library, this will not freeze the executor while waiting.
|
|
|
|
pub async fn enable(&mut self) {
|
|
|
|
while self.borrow_mut().enable_non_blocking().is_err() {
|
|
|
|
// SCE interrupt is only generated for entering sleep mode, but not leaving.
|
|
|
|
// Yield to allow other tasks to execute while can bus is initializing.
|
|
|
|
embassy_futures::yield_now().await;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2023-05-31 04:14:25 +02:00
|
|
|
/// Queues the message to be sent but exerts backpressure
|
|
|
|
pub async fn write(&mut self, frame: &Frame) -> bxcan::TransmitStatus {
|
2023-07-28 13:22:24 +02:00
|
|
|
CanTx { can: &self.can }.write(frame).await
|
|
|
|
}
|
2023-06-21 00:39:00 +02:00
|
|
|
|
2023-07-28 13:22:24 +02:00
|
|
|
/// Attempts to transmit a frame without blocking.
|
|
|
|
///
|
|
|
|
/// Returns [Err(TryWriteError::Full)] if all transmit mailboxes are full.
|
|
|
|
pub fn try_write(&mut self, frame: &Frame) -> Result<bxcan::TransmitStatus, TryWriteError> {
|
|
|
|
CanTx { can: &self.can }.try_write(frame)
|
2023-03-20 21:19:14 +01:00
|
|
|
}
|
|
|
|
|
2023-07-28 13:22:24 +02:00
|
|
|
/// Waits for a specific transmit mailbox to become empty
|
2023-05-31 04:14:25 +02:00
|
|
|
pub async fn flush(&self, mb: bxcan::Mailbox) {
|
2023-07-28 13:22:24 +02:00
|
|
|
CanTx { can: &self.can }.flush(mb).await
|
|
|
|
}
|
2023-06-21 00:39:00 +02:00
|
|
|
|
2023-07-28 13:22:24 +02:00
|
|
|
/// Waits until any of the transmit mailboxes become empty
|
|
|
|
pub async fn flush_any(&self) {
|
|
|
|
CanTx { can: &self.can }.flush_any().await
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Waits until all of the transmit mailboxes become empty
|
|
|
|
pub async fn flush_all(&self) {
|
|
|
|
CanTx { can: &self.can }.flush_all().await
|
2023-03-20 21:19:14 +01:00
|
|
|
}
|
|
|
|
|
2023-05-31 04:14:25 +02:00
|
|
|
/// Returns a tuple of the time the message was received and the message frame
|
2023-07-25 11:07:09 +02:00
|
|
|
pub async fn read(&mut self) -> Result<Envelope, BusError> {
|
2023-07-28 13:22:24 +02:00
|
|
|
CanRx { can: &self.can }.read().await
|
|
|
|
}
|
2023-06-21 00:39:00 +02:00
|
|
|
|
2023-07-28 13:22:24 +02:00
|
|
|
/// Attempts to read a can frame without blocking.
|
|
|
|
///
|
|
|
|
/// Returns [Err(TryReadError::Empty)] if there are no frames in the rx queue.
|
2023-07-31 09:29:20 +02:00
|
|
|
pub fn try_read(&mut self) -> Result<Envelope, TryReadError> {
|
2023-07-28 13:22:24 +02:00
|
|
|
CanRx { can: &self.can }.try_read()
|
2023-04-06 16:20:34 +02:00
|
|
|
}
|
|
|
|
|
2023-07-28 13:22:24 +02:00
|
|
|
/// Waits while receive queue is empty.
|
|
|
|
pub async fn wait_not_empty(&mut self) {
|
|
|
|
CanRx { can: &self.can }.wait_not_empty().await
|
2023-04-06 16:20:34 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
unsafe fn receive_fifo(fifo: RxFifo) {
|
2023-07-25 11:07:09 +02:00
|
|
|
// Generate timestamp as early as possible
|
|
|
|
#[cfg(feature = "time")]
|
|
|
|
let ts = embassy_time::Instant::now();
|
|
|
|
|
2023-04-06 16:20:34 +02:00
|
|
|
let state = T::state();
|
|
|
|
let regs = T::regs();
|
|
|
|
let fifo_idx = match fifo {
|
|
|
|
RxFifo::Fifo0 => 0usize,
|
2023-05-30 02:09:52 +02:00
|
|
|
RxFifo::Fifo1 => 1usize,
|
2023-04-06 16:20:34 +02:00
|
|
|
};
|
|
|
|
let rfr = regs.rfr(fifo_idx);
|
|
|
|
let fifo = regs.rx(fifo_idx);
|
|
|
|
|
2023-05-30 02:09:52 +02:00
|
|
|
loop {
|
|
|
|
// If there are no pending messages, there is nothing to do
|
|
|
|
if rfr.read().fmp() == 0 {
|
|
|
|
return;
|
|
|
|
}
|
2023-04-06 16:20:34 +02:00
|
|
|
|
2023-05-30 02:09:52 +02:00
|
|
|
let rir = fifo.rir().read();
|
|
|
|
let id = if rir.ide() == RirIde::STANDARD {
|
|
|
|
Id::from(StandardId::new_unchecked(rir.stid()))
|
|
|
|
} else {
|
2023-06-16 14:56:28 +02:00
|
|
|
let stid = (rir.stid() & 0x7FF) as u32;
|
|
|
|
let exid = rir.exid() & 0x3FFFF;
|
2023-08-06 22:00:39 +02:00
|
|
|
let id = (stid << 18) | (exid);
|
2023-06-16 14:56:28 +02:00
|
|
|
Id::from(ExtendedId::new_unchecked(id))
|
2023-05-30 02:09:52 +02:00
|
|
|
};
|
|
|
|
let data_len = fifo.rdtr().read().dlc() as usize;
|
|
|
|
let mut data: [u8; 8] = [0; 8];
|
|
|
|
data[0..4].copy_from_slice(&fifo.rdlr().read().0.to_ne_bytes());
|
|
|
|
data[4..8].copy_from_slice(&fifo.rdhr().read().0.to_ne_bytes());
|
|
|
|
|
|
|
|
let frame = Frame::new_data(id, Data::new(&data[0..data_len]).unwrap());
|
2023-07-25 11:07:09 +02:00
|
|
|
let envelope = Envelope {
|
|
|
|
#[cfg(feature = "time")]
|
|
|
|
ts,
|
|
|
|
frame,
|
|
|
|
};
|
2023-05-30 02:09:52 +02:00
|
|
|
|
|
|
|
rfr.modify(|v| v.set_rfom(true));
|
|
|
|
|
|
|
|
/*
|
|
|
|
NOTE: consensus was reached that if rx_queue is full, packets should be dropped
|
|
|
|
*/
|
2023-07-25 11:07:09 +02:00
|
|
|
let _ = state.rx_queue.try_send(envelope);
|
2023-04-06 16:20:34 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2023-05-31 04:14:25 +02:00
|
|
|
pub const fn calc_bxcan_timings(periph_clock: Hertz, can_bitrate: u32) -> Option<u32> {
|
2023-04-06 16:20:34 +02:00
|
|
|
const BS1_MAX: u8 = 16;
|
|
|
|
const BS2_MAX: u8 = 8;
|
|
|
|
const MAX_SAMPLE_POINT_PERMILL: u16 = 900;
|
|
|
|
|
|
|
|
let periph_clock = periph_clock.0;
|
|
|
|
|
|
|
|
if can_bitrate < 1000 {
|
|
|
|
return None;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Ref. "Automatic Baudrate Detection in CANopen Networks", U. Koppe, MicroControl GmbH & Co. KG
|
|
|
|
// CAN in Automation, 2003
|
|
|
|
//
|
|
|
|
// According to the source, optimal quanta per bit are:
|
|
|
|
// Bitrate Optimal Maximum
|
|
|
|
// 1000 kbps 8 10
|
|
|
|
// 500 kbps 16 17
|
|
|
|
// 250 kbps 16 17
|
|
|
|
// 125 kbps 16 17
|
|
|
|
let max_quanta_per_bit: u8 = if can_bitrate >= 1_000_000 { 10 } else { 17 };
|
|
|
|
|
|
|
|
// Computing (prescaler * BS):
|
|
|
|
// BITRATE = 1 / (PRESCALER * (1 / PCLK) * (1 + BS1 + BS2)) -- See the Reference Manual
|
|
|
|
// BITRATE = PCLK / (PRESCALER * (1 + BS1 + BS2)) -- Simplified
|
|
|
|
// let:
|
|
|
|
// BS = 1 + BS1 + BS2 -- Number of time quanta per bit
|
|
|
|
// PRESCALER_BS = PRESCALER * BS
|
|
|
|
// ==>
|
|
|
|
// PRESCALER_BS = PCLK / BITRATE
|
|
|
|
let prescaler_bs = periph_clock / can_bitrate;
|
|
|
|
|
|
|
|
// Searching for such prescaler value so that the number of quanta per bit is highest.
|
|
|
|
let mut bs1_bs2_sum = max_quanta_per_bit - 1;
|
|
|
|
while (prescaler_bs % (1 + bs1_bs2_sum) as u32) != 0 {
|
|
|
|
if bs1_bs2_sum <= 2 {
|
|
|
|
return None; // No solution
|
|
|
|
}
|
|
|
|
bs1_bs2_sum -= 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
let prescaler = prescaler_bs / (1 + bs1_bs2_sum) as u32;
|
|
|
|
if (prescaler < 1) || (prescaler > 1024) {
|
|
|
|
return None; // No solution
|
|
|
|
}
|
|
|
|
|
|
|
|
// Now we have a constraint: (BS1 + BS2) == bs1_bs2_sum.
|
|
|
|
// We need to find such values so that the sample point is as close as possible to the optimal value,
|
|
|
|
// which is 87.5%, which is 7/8.
|
|
|
|
//
|
|
|
|
// Solve[(1 + bs1)/(1 + bs1 + bs2) == 7/8, bs2] (* Where 7/8 is 0.875, the recommended sample point location *)
|
|
|
|
// {{bs2 -> (1 + bs1)/7}}
|
|
|
|
//
|
|
|
|
// Hence:
|
|
|
|
// bs2 = (1 + bs1) / 7
|
|
|
|
// bs1 = (7 * bs1_bs2_sum - 1) / 8
|
|
|
|
//
|
|
|
|
// Sample point location can be computed as follows:
|
|
|
|
// Sample point location = (1 + bs1) / (1 + bs1 + bs2)
|
|
|
|
//
|
|
|
|
// Since the optimal solution is so close to the maximum, we prepare two solutions, and then pick the best one:
|
|
|
|
// - With rounding to nearest
|
|
|
|
// - With rounding to zero
|
|
|
|
let mut bs1 = ((7 * bs1_bs2_sum - 1) + 4) / 8; // Trying rounding to nearest first
|
|
|
|
let mut bs2 = bs1_bs2_sum - bs1;
|
2023-05-31 04:14:25 +02:00
|
|
|
core::assert!(bs1_bs2_sum > bs1);
|
2023-04-06 16:20:34 +02:00
|
|
|
|
|
|
|
let sample_point_permill = 1000 * ((1 + bs1) / (1 + bs1 + bs2)) as u16;
|
|
|
|
if sample_point_permill > MAX_SAMPLE_POINT_PERMILL {
|
|
|
|
// Nope, too far; now rounding to zero
|
|
|
|
bs1 = (7 * bs1_bs2_sum - 1) / 8;
|
|
|
|
bs2 = bs1_bs2_sum - bs1;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Check is BS1 and BS2 are in range
|
|
|
|
if (bs1 < 1) || (bs1 > BS1_MAX) || (bs2 < 1) || (bs2 > BS2_MAX) {
|
|
|
|
return None;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Check if final bitrate matches the requested
|
|
|
|
if can_bitrate != (periph_clock / (prescaler * (1 + bs1 + bs2) as u32)) {
|
|
|
|
return None;
|
|
|
|
}
|
|
|
|
|
|
|
|
// One is recommended by DS-015, CANOpen, and DeviceNet
|
|
|
|
let sjw = 1;
|
|
|
|
|
|
|
|
// Pack into BTR register values
|
2023-08-06 22:00:39 +02:00
|
|
|
Some((sjw - 1) << 24 | (bs1 as u32 - 1) << 16 | (bs2 as u32 - 1) << 20 | (prescaler - 1))
|
2023-04-06 16:20:34 +02:00
|
|
|
}
|
2023-06-22 17:17:51 +02:00
|
|
|
|
|
|
|
pub fn split<'c>(&'c self) -> (CanTx<'c, 'd, T>, CanRx<'c, 'd, T>) {
|
|
|
|
(CanTx { can: &self.can }, CanRx { can: &self.can })
|
|
|
|
}
|
2023-06-22 17:49:33 +02:00
|
|
|
|
|
|
|
pub fn as_mut(&self) -> RefMut<'_, bxcan::Can<BxcanInstance<'d, T>>> {
|
|
|
|
self.can.borrow_mut()
|
|
|
|
}
|
2023-06-22 17:17:51 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
pub struct CanTx<'c, 'd, T: Instance> {
|
|
|
|
can: &'c RefCell<bxcan::Can<BxcanInstance<'d, T>>>,
|
|
|
|
}
|
|
|
|
|
|
|
|
impl<'c, 'd, T: Instance> CanTx<'c, 'd, T> {
|
|
|
|
pub async fn write(&mut self, frame: &Frame) -> bxcan::TransmitStatus {
|
|
|
|
poll_fn(|cx| {
|
|
|
|
T::state().tx_waker.register(cx.waker());
|
|
|
|
if let Ok(status) = self.can.borrow_mut().transmit(frame) {
|
|
|
|
return Poll::Ready(status);
|
|
|
|
}
|
|
|
|
|
|
|
|
Poll::Pending
|
|
|
|
})
|
|
|
|
.await
|
|
|
|
}
|
|
|
|
|
2023-07-28 13:22:24 +02:00
|
|
|
/// Attempts to transmit a frame without blocking.
|
|
|
|
///
|
|
|
|
/// Returns [Err(TryWriteError::Full)] if all transmit mailboxes are full.
|
|
|
|
pub fn try_write(&mut self, frame: &Frame) -> Result<bxcan::TransmitStatus, TryWriteError> {
|
|
|
|
self.can.borrow_mut().transmit(frame).map_err(|_| TryWriteError::Full)
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Waits for a specific transmit mailbox to become empty
|
2023-06-22 17:17:51 +02:00
|
|
|
pub async fn flush(&self, mb: bxcan::Mailbox) {
|
|
|
|
poll_fn(|cx| {
|
|
|
|
T::state().tx_waker.register(cx.waker());
|
|
|
|
if T::regs().tsr().read().tme(mb.index()) {
|
|
|
|
return Poll::Ready(());
|
|
|
|
}
|
|
|
|
|
|
|
|
Poll::Pending
|
|
|
|
})
|
|
|
|
.await;
|
|
|
|
}
|
2023-07-28 13:22:24 +02:00
|
|
|
|
|
|
|
/// Waits until any of the transmit mailboxes become empty
|
|
|
|
pub async fn flush_any(&self) {
|
|
|
|
poll_fn(|cx| {
|
|
|
|
T::state().tx_waker.register(cx.waker());
|
|
|
|
|
|
|
|
let tsr = T::regs().tsr().read();
|
|
|
|
if tsr.tme(bxcan::Mailbox::Mailbox0.index())
|
|
|
|
|| tsr.tme(bxcan::Mailbox::Mailbox1.index())
|
|
|
|
|| tsr.tme(bxcan::Mailbox::Mailbox2.index())
|
|
|
|
{
|
|
|
|
return Poll::Ready(());
|
|
|
|
}
|
|
|
|
|
|
|
|
Poll::Pending
|
|
|
|
})
|
|
|
|
.await;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Waits until all of the transmit mailboxes become empty
|
|
|
|
pub async fn flush_all(&self) {
|
|
|
|
poll_fn(|cx| {
|
|
|
|
T::state().tx_waker.register(cx.waker());
|
|
|
|
|
|
|
|
let tsr = T::regs().tsr().read();
|
|
|
|
if tsr.tme(bxcan::Mailbox::Mailbox0.index())
|
|
|
|
&& tsr.tme(bxcan::Mailbox::Mailbox1.index())
|
|
|
|
&& tsr.tme(bxcan::Mailbox::Mailbox2.index())
|
|
|
|
{
|
|
|
|
return Poll::Ready(());
|
|
|
|
}
|
|
|
|
|
|
|
|
Poll::Pending
|
|
|
|
})
|
|
|
|
.await;
|
|
|
|
}
|
2023-06-22 17:17:51 +02:00
|
|
|
}
|
|
|
|
|
2023-07-03 23:48:07 +02:00
|
|
|
#[allow(dead_code)]
|
2023-06-22 17:17:51 +02:00
|
|
|
pub struct CanRx<'c, 'd, T: Instance> {
|
|
|
|
can: &'c RefCell<bxcan::Can<BxcanInstance<'d, T>>>,
|
|
|
|
}
|
|
|
|
|
|
|
|
impl<'c, 'd, T: Instance> CanRx<'c, 'd, T> {
|
2023-07-25 11:07:09 +02:00
|
|
|
pub async fn read(&mut self) -> Result<Envelope, BusError> {
|
2023-06-22 17:17:51 +02:00
|
|
|
poll_fn(|cx| {
|
|
|
|
T::state().err_waker.register(cx.waker());
|
2023-08-11 11:58:22 +02:00
|
|
|
if let Poll::Ready(envelope) = T::state().rx_queue.receive().poll_unpin(cx) {
|
2023-07-25 11:07:09 +02:00
|
|
|
return Poll::Ready(Ok(envelope));
|
2023-06-22 17:17:51 +02:00
|
|
|
} else if let Some(err) = self.curr_error() {
|
|
|
|
return Poll::Ready(Err(err));
|
|
|
|
}
|
|
|
|
|
|
|
|
Poll::Pending
|
|
|
|
})
|
|
|
|
.await
|
|
|
|
}
|
|
|
|
|
2023-07-28 13:22:24 +02:00
|
|
|
/// Attempts to read a CAN frame without blocking.
|
|
|
|
///
|
|
|
|
/// Returns [Err(TryReadError::Empty)] if there are no frames in the rx queue.
|
2023-07-31 09:29:20 +02:00
|
|
|
pub fn try_read(&mut self) -> Result<Envelope, TryReadError> {
|
2023-08-11 11:58:22 +02:00
|
|
|
if let Ok(envelope) = T::state().rx_queue.try_receive() {
|
2023-07-28 13:22:24 +02:00
|
|
|
return Ok(envelope);
|
|
|
|
}
|
|
|
|
|
|
|
|
if let Some(err) = self.curr_error() {
|
|
|
|
return Err(TryReadError::BusError(err));
|
|
|
|
}
|
|
|
|
|
|
|
|
Err(TryReadError::Empty)
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Waits while receive queue is empty.
|
|
|
|
pub async fn wait_not_empty(&mut self) {
|
2023-08-11 11:15:17 +02:00
|
|
|
poll_fn(|cx| T::state().rx_queue.poll_ready_to_receive(cx)).await
|
2023-07-28 13:22:24 +02:00
|
|
|
}
|
|
|
|
|
2023-06-22 17:17:51 +02:00
|
|
|
fn curr_error(&self) -> Option<BusError> {
|
|
|
|
let err = { T::regs().esr().read() };
|
|
|
|
if err.boff() {
|
|
|
|
return Some(BusError::BusOff);
|
|
|
|
} else if err.epvf() {
|
|
|
|
return Some(BusError::BusPassive);
|
|
|
|
} else if err.ewgf() {
|
|
|
|
return Some(BusError::BusWarning);
|
|
|
|
} else if let Some(err) = err.lec().into_bus_err() {
|
|
|
|
return Some(err);
|
|
|
|
}
|
|
|
|
None
|
|
|
|
}
|
2023-04-06 16:20:34 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
enum RxFifo {
|
|
|
|
Fifo0,
|
2023-05-30 02:09:52 +02:00
|
|
|
Fifo1,
|
2021-08-06 00:08:24 +02:00
|
|
|
}
|
|
|
|
|
2022-07-23 01:29:35 +02:00
|
|
|
impl<'d, T: Instance> Drop for Can<'d, T> {
|
2021-08-06 10:37:32 +02:00
|
|
|
fn drop(&mut self) {
|
|
|
|
// Cannot call `free()` because it moves the instance.
|
|
|
|
// Manually reset the peripheral.
|
2023-06-19 03:07:26 +02:00
|
|
|
T::regs().mcr().write(|w| w.set_reset(true));
|
2021-08-06 10:37:32 +02:00
|
|
|
T::disable();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-07-23 01:29:35 +02:00
|
|
|
impl<'d, T: Instance> Deref for Can<'d, T> {
|
2023-07-03 22:57:33 +02:00
|
|
|
type Target = RefCell<bxcan::Can<BxcanInstance<'d, T>>>;
|
2021-08-06 00:08:24 +02:00
|
|
|
|
|
|
|
fn deref(&self) -> &Self::Target {
|
|
|
|
&self.can
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-07-23 01:29:35 +02:00
|
|
|
impl<'d, T: Instance> DerefMut for Can<'d, T> {
|
2021-08-06 00:08:24 +02:00
|
|
|
fn deref_mut(&mut self) -> &mut Self::Target {
|
|
|
|
&mut self.can
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
pub(crate) mod sealed {
|
2023-05-30 02:09:52 +02:00
|
|
|
use embassy_sync::blocking_mutex::raw::CriticalSectionRawMutex;
|
|
|
|
use embassy_sync::channel::Channel;
|
2023-03-20 21:19:14 +01:00
|
|
|
use embassy_sync::waitqueue::AtomicWaker;
|
2023-04-06 16:20:34 +02:00
|
|
|
|
2023-07-25 11:07:09 +02:00
|
|
|
use super::Envelope;
|
|
|
|
|
2023-03-20 21:19:14 +01:00
|
|
|
pub struct State {
|
|
|
|
pub tx_waker: AtomicWaker,
|
2023-04-06 16:20:34 +02:00
|
|
|
pub err_waker: AtomicWaker,
|
2023-07-25 11:07:09 +02:00
|
|
|
pub rx_queue: Channel<CriticalSectionRawMutex, Envelope, 32>,
|
2023-03-20 21:19:14 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
impl State {
|
|
|
|
pub const fn new() -> Self {
|
|
|
|
Self {
|
|
|
|
tx_waker: AtomicWaker::new(),
|
2023-04-06 16:20:34 +02:00
|
|
|
err_waker: AtomicWaker::new(),
|
2023-05-30 02:09:52 +02:00
|
|
|
rx_queue: Channel::new(),
|
2023-03-20 21:19:14 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-08-06 10:37:32 +02:00
|
|
|
pub trait Instance {
|
2022-07-23 01:29:35 +02:00
|
|
|
const REGISTERS: *mut bxcan::RegisterBlock;
|
|
|
|
|
2021-08-06 11:59:16 +02:00
|
|
|
fn regs() -> &'static crate::pac::can::Can;
|
2023-03-20 21:19:14 +01:00
|
|
|
fn state() -> &'static State;
|
2021-08-06 10:37:32 +02:00
|
|
|
}
|
2021-08-06 00:08:24 +02:00
|
|
|
}
|
|
|
|
|
2023-03-20 21:19:14 +01:00
|
|
|
pub trait TXInstance {
|
2023-06-19 23:05:59 +02:00
|
|
|
type TXInterrupt: crate::interrupt::typelevel::Interrupt;
|
2023-03-20 21:19:14 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
pub trait RX0Instance {
|
2023-06-19 23:05:59 +02:00
|
|
|
type RX0Interrupt: crate::interrupt::typelevel::Interrupt;
|
2023-03-20 21:19:14 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
pub trait RX1Instance {
|
2023-06-19 23:05:59 +02:00
|
|
|
type RX1Interrupt: crate::interrupt::typelevel::Interrupt;
|
2023-03-20 21:19:14 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
pub trait SCEInstance {
|
2023-06-19 23:05:59 +02:00
|
|
|
type SCEInterrupt: crate::interrupt::typelevel::Interrupt;
|
2023-03-20 21:19:14 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
pub trait InterruptableInstance: TXInstance + RX0Instance + RX1Instance + SCEInstance {}
|
|
|
|
pub trait Instance: sealed::Instance + RccPeripheral + InterruptableInstance + 'static {}
|
2021-08-06 00:08:24 +02:00
|
|
|
|
2022-07-23 14:00:19 +02:00
|
|
|
pub struct BxcanInstance<'a, T>(PeripheralRef<'a, T>);
|
2022-07-23 01:29:35 +02:00
|
|
|
|
|
|
|
unsafe impl<'d, T: Instance> bxcan::Instance for BxcanInstance<'d, T> {
|
|
|
|
const REGISTERS: *mut bxcan::RegisterBlock = T::REGISTERS;
|
|
|
|
}
|
|
|
|
|
2022-02-26 01:40:43 +01:00
|
|
|
foreach_peripheral!(
|
2021-08-06 11:59:16 +02:00
|
|
|
(can, $inst:ident) => {
|
2021-08-06 10:37:32 +02:00
|
|
|
impl sealed::Instance for peripherals::$inst {
|
2023-06-19 03:07:26 +02:00
|
|
|
const REGISTERS: *mut bxcan::RegisterBlock = crate::pac::$inst.as_ptr() as *mut _;
|
2022-07-23 01:29:35 +02:00
|
|
|
|
2021-08-06 11:59:16 +02:00
|
|
|
fn regs() -> &'static crate::pac::can::Can {
|
2021-08-06 10:37:32 +02:00
|
|
|
&crate::pac::$inst
|
|
|
|
}
|
2023-03-20 21:19:14 +01:00
|
|
|
|
|
|
|
fn state() -> &'static sealed::State {
|
|
|
|
static STATE: sealed::State = sealed::State::new();
|
|
|
|
&STATE
|
|
|
|
}
|
2021-08-06 10:37:32 +02:00
|
|
|
}
|
2021-08-06 00:08:24 +02:00
|
|
|
|
|
|
|
impl Instance for peripherals::$inst {}
|
|
|
|
|
2023-03-20 21:19:14 +01:00
|
|
|
foreach_interrupt!(
|
|
|
|
($inst,can,CAN,TX,$irq:ident) => {
|
|
|
|
impl TXInstance for peripherals::$inst {
|
2023-06-19 23:05:59 +02:00
|
|
|
type TXInterrupt = crate::interrupt::typelevel::$irq;
|
2023-03-20 21:19:14 +01:00
|
|
|
}
|
|
|
|
};
|
|
|
|
($inst,can,CAN,RX0,$irq:ident) => {
|
|
|
|
impl RX0Instance for peripherals::$inst {
|
2023-06-19 23:05:59 +02:00
|
|
|
type RX0Interrupt = crate::interrupt::typelevel::$irq;
|
2023-03-20 21:19:14 +01:00
|
|
|
}
|
|
|
|
};
|
|
|
|
($inst,can,CAN,RX1,$irq:ident) => {
|
|
|
|
impl RX1Instance for peripherals::$inst {
|
2023-06-19 23:05:59 +02:00
|
|
|
type RX1Interrupt = crate::interrupt::typelevel::$irq;
|
2023-03-20 21:19:14 +01:00
|
|
|
}
|
|
|
|
};
|
|
|
|
($inst,can,CAN,SCE,$irq:ident) => {
|
|
|
|
impl SCEInstance for peripherals::$inst {
|
2023-06-19 23:05:59 +02:00
|
|
|
type SCEInterrupt = crate::interrupt::typelevel::$irq;
|
2023-03-20 21:19:14 +01:00
|
|
|
}
|
|
|
|
};
|
|
|
|
);
|
|
|
|
|
|
|
|
impl InterruptableInstance for peripherals::$inst {}
|
2021-08-06 00:08:24 +02:00
|
|
|
};
|
|
|
|
);
|
|
|
|
|
2022-02-26 01:40:43 +01:00
|
|
|
foreach_peripheral!(
|
2021-08-06 11:59:16 +02:00
|
|
|
(can, CAN) => {
|
2022-07-23 01:29:35 +02:00
|
|
|
unsafe impl<'d> bxcan::FilterOwner for BxcanInstance<'d, peripherals::CAN> {
|
2021-08-06 00:08:24 +02:00
|
|
|
const NUM_FILTER_BANKS: u8 = 14;
|
|
|
|
}
|
|
|
|
};
|
2022-02-28 22:43:21 +01:00
|
|
|
// CAN1 and CAN2 is a combination of master and slave instance.
|
|
|
|
// CAN1 owns the filter bank and needs to be enabled in order
|
|
|
|
// for CAN2 to receive messages.
|
2021-08-06 11:59:16 +02:00
|
|
|
(can, CAN1) => {
|
2022-03-03 20:51:34 +01:00
|
|
|
cfg_if::cfg_if! {
|
|
|
|
if #[cfg(all(
|
2022-03-05 09:43:47 +01:00
|
|
|
any(stm32l4, stm32f72, stm32f73),
|
2022-03-03 20:51:34 +01:00
|
|
|
not(any(stm32l49, stm32l4a))
|
|
|
|
))] {
|
|
|
|
// Most L4 devices and some F7 devices use the name "CAN1"
|
|
|
|
// even if there is no "CAN2" peripheral.
|
2022-07-23 01:29:35 +02:00
|
|
|
unsafe impl<'d> bxcan::FilterOwner for BxcanInstance<'d, peripherals::CAN1> {
|
2022-03-03 20:51:34 +01:00
|
|
|
const NUM_FILTER_BANKS: u8 = 14;
|
|
|
|
}
|
|
|
|
} else {
|
2022-07-23 01:29:35 +02:00
|
|
|
unsafe impl<'d> bxcan::FilterOwner for BxcanInstance<'d, peripherals::CAN1> {
|
2022-03-03 20:51:34 +01:00
|
|
|
const NUM_FILTER_BANKS: u8 = 28;
|
|
|
|
}
|
2022-07-23 01:29:35 +02:00
|
|
|
unsafe impl<'d> bxcan::MasterInstance for BxcanInstance<'d, peripherals::CAN1> {}
|
2022-03-03 20:51:34 +01:00
|
|
|
}
|
2021-08-06 00:08:24 +02:00
|
|
|
}
|
|
|
|
};
|
2021-08-14 23:13:50 +02:00
|
|
|
(can, CAN3) => {
|
2022-07-23 01:29:35 +02:00
|
|
|
unsafe impl<'d> bxcan::FilterOwner for BxcanInstance<'d, peripherals::CAN3> {
|
2021-08-14 23:13:50 +02:00
|
|
|
const NUM_FILTER_BANKS: u8 = 14;
|
|
|
|
}
|
|
|
|
};
|
2021-08-06 00:08:24 +02:00
|
|
|
);
|
|
|
|
|
2022-02-10 21:38:03 +01:00
|
|
|
pin_trait!(RxPin, Instance);
|
|
|
|
pin_trait!(TxPin, Instance);
|
2023-03-20 21:19:14 +01:00
|
|
|
|
|
|
|
trait Index {
|
|
|
|
fn index(&self) -> usize;
|
|
|
|
}
|
|
|
|
|
|
|
|
impl Index for bxcan::Mailbox {
|
|
|
|
fn index(&self) -> usize {
|
|
|
|
match self {
|
|
|
|
bxcan::Mailbox::Mailbox0 => 0,
|
|
|
|
bxcan::Mailbox::Mailbox1 => 1,
|
|
|
|
bxcan::Mailbox::Mailbox2 => 2,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2023-04-06 16:20:34 +02:00
|
|
|
|
|
|
|
trait IntoBusError {
|
|
|
|
fn into_bus_err(self) -> Option<BusError>;
|
|
|
|
}
|
|
|
|
|
|
|
|
impl IntoBusError for Lec {
|
|
|
|
fn into_bus_err(self) -> Option<BusError> {
|
|
|
|
match self {
|
|
|
|
Lec::STUFF => Some(BusError::Stuff),
|
|
|
|
Lec::FORM => Some(BusError::Form),
|
|
|
|
Lec::ACK => Some(BusError::Acknowledge),
|
|
|
|
Lec::BITRECESSIVE => Some(BusError::BitRecessive),
|
|
|
|
Lec::BITDOMINANT => Some(BusError::BitDominant),
|
|
|
|
Lec::CRC => Some(BusError::Crc),
|
|
|
|
Lec::CUSTOM => Some(BusError::Software),
|
|
|
|
_ => None,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|