mirror/rtic
1
0
Fork 0
mirror of https://github.com/rtic-rs/rtic.git synced 2024-11-23 20:22:51 +01:00
Code Issues Projects Releases Packages Wiki Activity

Make debug asserts into asserts to help find the issue (#931)

Browse source
This commit is contained in:
Emil Fresk 2024-05-01 20:33:42 +02:00 committed by GitHub
parent d9a76b6575
commit deafcc4382
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
2 changed files with 6 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
rtic-sync/Cargo.toml
View file

@ -1,6 +1,6 @@
[package] [package]
name = "rtic-sync" name = "rtic-sync"
version = "1.3.0" version = "1.3.1-alpha.1"
edition = "2021" edition = "2021"
authors = [ authors = [

10
rtic-sync/src/channel.rs
View file

@ -75,7 +75,7 @@ impl<T, const N: usize> Channel<T, N> {
pub fn split(&mut self) -> (Sender<'_, T, N>, Receiver<'_, T, N>) { pub fn split(&mut self) -> (Sender<'_, T, N>, Receiver<'_, T, N>) {
// Fill free queue // Fill free queue
for idx in 0..N as u8 { for idx in 0..N as u8 {
debug_assert!(!self.freeq.get_mut().is_full()); assert!(!self.freeq.get_mut().is_full());
// SAFETY: This safe as the loop goes from 0 to the capacity of the underlying queue. // SAFETY: This safe as the loop goes from 0 to the capacity of the underlying queue.
unsafe { unsafe {
@ -83,7 +83,7 @@ impl<T, const N: usize> Channel<T, N> {
} }
} }
debug_assert!(self.freeq.get_mut().is_full()); assert!(self.freeq.get_mut().is_full());
// There is now 1 sender // There is now 1 sender
*self.num_senders.get_mut() = 1; *self.num_senders.get_mut() = 1;
@ -224,7 +224,7 @@ impl<'a, T, const N: usize> Sender<'a, T, N> {
// Write the value into the ready queue. // Write the value into the ready queue.
critical_section::with(|cs| { critical_section::with(|cs| {
debug_assert!(!self.0.access(cs).readyq.is_full()); assert!(!self.0.access(cs).readyq.is_full());
unsafe { self.0.access(cs).readyq.push_back_unchecked(idx) } unsafe { self.0.access(cs).readyq.push_back_unchecked(idx) }
}); });
@ -312,7 +312,7 @@ impl<'a, T, const N: usize> Sender<'a, T, N> {
} }
} }
debug_assert!(!self.0.access(cs).freeq.is_empty()); assert!(!self.0.access(cs).freeq.is_empty());
// Get index as the queue is guaranteed not empty and the wait queue is empty // Get index as the queue is guaranteed not empty and the wait queue is empty
let idx = unsafe { self.0.access(cs).freeq.pop_front_unchecked() }; let idx = unsafe { self.0.access(cs).freeq.pop_front_unchecked() };
@ -423,7 +423,7 @@ impl<'a, T, const N: usize> Receiver<'a, T, N> {
// Return the index to the free queue after we've read the value. // Return the index to the free queue after we've read the value.
critical_section::with(|cs| { critical_section::with(|cs| {
debug_assert!(!self.0.access(cs).freeq.is_full()); assert!(!self.0.access(cs).freeq.is_full());
unsafe { self.0.access(cs).freeq.push_back_unchecked(rs) } unsafe { self.0.access(cs).freeq.push_back_unchecked(rs) }
}); });