diff options
| -rw-r--r-- | embassy-stm32/src/dma/gpdma/ringbuffered.rs | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/embassy-stm32/src/dma/gpdma/ringbuffered.rs b/embassy-stm32/src/dma/gpdma/ringbuffered.rs index c98f2bb80..136eca1c3 100644 --- a/embassy-stm32/src/dma/gpdma/ringbuffered.rs +++ b/embassy-stm32/src/dma/gpdma/ringbuffered.rs | |||
| @@ -67,7 +67,7 @@ impl<'a, W: Word> ReadableRingBuffer<'a, W, 2> { | |||
| 67 | options: TransferOptions, | 67 | options: TransferOptions, |
| 68 | ) -> Self { | 68 | ) -> Self { |
| 69 | let channel: Peri<'a, AnyChannel> = channel.into(); | 69 | let channel: Peri<'a, AnyChannel> = channel.into(); |
| 70 | let table = Self::simple_ring_buffer_table(request, peri_addr, buffer); | 70 | let table = Self::new_ping_pong_table(request, peri_addr, buffer); |
| 71 | 71 | ||
| 72 | Self { | 72 | Self { |
| 73 | channel, | 73 | channel, |
| @@ -101,7 +101,7 @@ impl<'a, W: Word, const L: usize> ReadableRingBuffer<'a, W, L> { | |||
| 101 | /// Create a new simple linked-list table. | 101 | /// Create a new simple linked-list table. |
| 102 | /// | 102 | /// |
| 103 | /// This uses two linked-list items, one for each half of the buffer. | 103 | /// This uses two linked-list items, one for each half of the buffer. |
| 104 | pub unsafe fn simple_ring_buffer_table(request: Request, peri_addr: *mut W, buffer: &mut [W]) -> Table<2> { | 104 | pub unsafe fn new_ping_pong_table(request: Request, peri_addr: *mut W, buffer: &mut [W]) -> Table<2> { |
| 105 | // Buffer halves should be the same length. | 105 | // Buffer halves should be the same length. |
| 106 | let half_len = buffer.len() / 2; | 106 | let half_len = buffer.len() / 2; |
| 107 | assert_eq!(half_len * 2, buffer.len()); | 107 | assert_eq!(half_len * 2, buffer.len()); |
| @@ -246,7 +246,7 @@ impl<'a, W: Word> WritableRingBuffer<'a, W, 2> { | |||
| 246 | options: TransferOptions, | 246 | options: TransferOptions, |
| 247 | ) -> Self { | 247 | ) -> Self { |
| 248 | let channel: Peri<'a, AnyChannel> = channel.into(); | 248 | let channel: Peri<'a, AnyChannel> = channel.into(); |
| 249 | let table = Self::simple_ring_buffer_table(request, peri_addr, buffer); | 249 | let table = Self::new_ping_pong_table(request, peri_addr, buffer); |
| 250 | 250 | ||
| 251 | Self { | 251 | Self { |
| 252 | channel, | 252 | channel, |
| @@ -280,7 +280,7 @@ impl<'a, W: Word, const L: usize> WritableRingBuffer<'a, W, L> { | |||
| 280 | /// Create a new simple linked-list table. | 280 | /// Create a new simple linked-list table. |
| 281 | /// | 281 | /// |
| 282 | /// This uses two linked-list items, one for each half of the buffer. | 282 | /// This uses two linked-list items, one for each half of the buffer. |
| 283 | pub unsafe fn simple_ring_buffer_table(request: Request, peri_addr: *mut W, buffer: &[W]) -> Table<2> { | 283 | pub unsafe fn new_ping_pong_table(request: Request, peri_addr: *mut W, buffer: &[W]) -> Table<2> { |
| 284 | // Buffer halves should be the same length. | 284 | // Buffer halves should be the same length. |
| 285 | let half_len = buffer.len() / 2; | 285 | let half_len = buffer.len() / 2; |
| 286 | assert_eq!(half_len * 2, buffer.len()); | 286 | assert_eq!(half_len * 2, buffer.len()); |