| ... | ... | @@ -6,11 +6,11 @@ As mentionned in the readme, the simulator and its environment run in a simple f |
|
|
|
2. Order the netlist according to the dependencies via a topological sort (`graph.ml`, `scheduler.ml`, see [the scheduler doc](/Functions#scheduler))
|
|
|
|
3. Simulate the netlist in a sequential fashion (`simulator.ml`, see [the simulator doc](Functions/#simulator))
|
|
|
|
1. Initialize the memory (currently the ROM cannot be inputted from the user)
|
|
|
|
The memory is represented by its id. Memory is implemented via hash-tables, see [the corresponding part](#Memory).
|
|
|
|
2. Take the input, see [Input](#Input).
|
|
|
|
3. Make the combinatorial computations for a cycle, see [Computations](#Computations).
|
|
|
|
4. Write into the registers (rising edge of the clock), see [Memory](#Memory).
|
|
|
|
5. Give the output, see [Output](#Output).
|
|
|
|
The memory is represented by its id. Memory is implemented via hash-tables, see [the corresponding part](#iemory).
|
|
|
|
2. Take the input, see [Input](#input).
|
|
|
|
3. Make the combinatorial computations for a cycle, see [Computations](#computations).
|
|
|
|
4. Write into the registers (rising edge of the clock), see [Memory](#memory).
|
|
|
|
5. Give the output, see [Output](#output).
|
|
|
|
6. Go back to 2. if there are other steps to simulate.
|
|
|
|
|
|
|
|
# Memory
|
| ... | ... | |
