1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
use rust_hdl_core::prelude::*;
use std::collections::BTreeMap;

#[derive(LogicBlock)]
pub struct ROM<D: Synth, const N: usize> {
    pub address: Signal<In, Bits<N>>,
    pub data: Signal<Out, D>,
    _sim: Box<BTreeMap<Bits<N>, D>>,
}

impl<D: Synth, const N: usize> ROM<D, N> {
    pub fn new(values: BTreeMap<Bits<N>, D>) -> Self {
        Self {
            address: Signal::default(),
            data: Signal::new_with_default(D::default()),
            _sim: Box::new(values),
        }
    }
}

pub fn make_btree_from_iterable<I: Iterator<Item = D>, D: Synth, const N: usize>(
    v: I,
) -> BTreeMap<Bits<N>, D> {
    let mut values = BTreeMap::new();
    for (index, val) in v.enumerate() {
        let address: Bits<N> = index.to_bits();
        values.insert(address, val);
    }
    values
}

impl<I: Iterator<Item = D>, D: Synth, const N: usize> From<I> for ROM<D, N> {
    fn from(v: I) -> Self {
        Self::new(make_btree_from_iterable(v))
    }
}

impl<D: Synth, const N: usize> Logic for ROM<D, N> {
    fn update(&mut self) {
        self.data.next = *self._sim.get(&self.address.val()).unwrap_or(&D::default());
    }

    fn connect(&mut self) {
        self.data.connect();
    }

    fn hdl(&self) -> Verilog {
        let cases = self
            ._sim
            .iter()
            .map(|x| {
                format!(
                    "  {}: data = {};",
                    x.0.verilog().to_string(),
                    x.1.verilog().to_string()
                )
            })
            .collect::<Vec<_>>()
            .join("\n");
        Verilog::Custom(format!(
            "\
always @*
case (address)
  {cases}
  default: data = {default};
endcase
        ",
            cases = cases,
            default = D::default().verilog().to_string()
        ))
    }
}