zynq-rs/src/eth/tx.rs

121 lines
3.4 KiB
Rust
Raw Normal View History

2019-06-22 07:34:47 +08:00
use core::ops::{Deref, DerefMut};
2019-06-09 07:02:10 +08:00
use crate::{register, register_bit, register_bits, register_bits_typed, regs::*};
2019-06-22 07:34:47 +08:00
use super::{MTU, regs};
2019-06-09 07:02:10 +08:00
/// Descriptor entry
2019-06-22 07:34:47 +08:00
pub struct DescEntry {
2019-06-09 07:02:10 +08:00
word0: DescWord0,
word1: DescWord1,
}
register!(desc_word0, DescWord0, RW, u32);
register_bits!(desc_word0, address, u32, 0, 31);
register!(desc_word1, DescWord1, RW, u32);
register_bits!(desc_word1, length, u16, 0, 13);
register_bit!(desc_word1, last_buffer, 15);
register_bit!(desc_word1, no_crc_append, 16);
register_bits!(desc_word1, csum_offload_errors, u8, 20, 22);
register_bit!(desc_word1, late_collision_tx_error, 26);
register_bit!(desc_word1, ahb_frame_corruption, 27);
register_bit!(desc_word1, retry_limit_exceeded, 29);
/// marks last descriptor in list
register_bit!(desc_word1, wrap, 30);
/// true if owned by software, false if owned by hardware
register_bit!(desc_word1, used, 31);
2019-06-10 02:28:33 +08:00
/// Number of descriptors
pub const DESCS: usize = 8;
#[repr(C)]
pub struct DescList<'a> {
2019-06-22 07:34:47 +08:00
list: &'a mut [DescEntry],
buffers: &'a mut [[u8; MTU]],
next: usize,
2019-06-10 02:28:33 +08:00
}
impl<'a> DescList<'a> {
2019-06-22 07:34:47 +08:00
pub fn new(list: &'a mut [DescEntry], buffers: &'a mut [[u8; MTU]]) -> Self {
let last = list.len().min(buffers.len()) - 1;
for (i, (entry, buffer)) in list.iter_mut().zip(buffers.iter_mut()).enumerate() {
let is_last = i == last;
let buffer_addr = &mut buffer[0] as *mut _ as u32;
assert!(buffer_addr & 0b11 == 0);
entry.word0.write(
2019-06-10 02:28:33 +08:00
DescWord0::zeroed()
.address(buffer_addr)
);
2019-06-22 07:34:47 +08:00
entry.word1.write(
2019-06-10 02:28:33 +08:00
DescWord1::zeroed()
.used(true)
2019-06-22 07:34:47 +08:00
.wrap(is_last)
2019-06-24 08:15:11 +08:00
// every frame contains 1 packet
.last_buffer(true)
);
2019-06-10 02:28:33 +08:00
);
}
2019-06-22 07:34:47 +08:00
DescList {
list,
buffers,
next: 0,
}
}
pub fn list_addr(&self) -> u32 {
&self.list[0] as *const _ as u32
}
pub fn send<'s: 'p, 'p>(&'s mut self, regs: &'p mut regs::RegisterBlock, length: usize) -> Option<PktRef<'p>> {
let list_len = self.list.len();
let entry = &mut self.list[self.next];
if entry.word1.read().used() {
entry.word1.modify(|_, w| w.length(length as u16));
let buffer = &mut self.buffers[self.next][0..length];
self.next += 1;
if self.next >= list_len {
self.next = 0;
}
Some(PktRef { entry, buffer, regs })
} else {
// Still in use by HW (sending too fast, ring exceeded)
None
}
}
}
/// Releases a buffer back to the HW upon Drop, and start the TX
/// engine
pub struct PktRef<'a> {
entry: &'a mut DescEntry,
buffer: &'a mut [u8],
regs: &'a mut regs::RegisterBlock,
}
impl<'a> Drop for PktRef<'a> {
fn drop(&mut self) {
self.entry.word1.modify(|_, w| w.used(false));
if ! self.regs.tx_status.read().tx_go() {
println!("tx start_tx");
self.regs.net_ctrl.modify(|_, w|
w.start_tx(true)
);
}
2019-06-22 07:34:47 +08:00
}
}
impl<'a> Deref for PktRef<'a> {
type Target = [u8];
fn deref(&self) -> &Self::Target {
self.buffer
}
}
impl<'a> DerefMut for PktRef<'a> {
fn deref_mut(&mut self) -> &mut <Self as Deref>::Target {
self.buffer
2019-06-10 02:28:33 +08:00
}
}