Haskellator/README.md
Yehowshua Immanuel c12fb235f4 improve README
2024-12-11 13:46:18 -05:00

99 lines
3.7 KiB
Markdown
Raw Permalink Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

# What is it?
Haskellator is an experimental tool designed to unlock new possibilities in processing RTL (Register-Transfer Level) netlists. It aims to enhance simulation efficiency, offer insightful change analysis, and explore experimental synthesis techniques.
### Key Features:
- **Sparse Simulation**:
Traditional open-source RTL simulators store signal values every time a signal changes.
HaskellatorSim will save signal states only if theyve changed
within the last host CPU second of simulation. This approach compresses the simulation
data whilst enabling quick recomputation of any gaps when viewing saved simulations.
This requires access to the RTLIL sources and simulation save files to fill in any gaps.
- **Change Condition Analysis**:
Haskellator will provide tools to analyze and trace the cause of signal changes during
simulation. By forming hypotheses about which signals influenced a change, it offers a
"git-blame" style feature for simulations. This functionality also requires access to
the original RTLIL sources and simulation save files.
- **Experimental Synthesis Techniques**:
We hope to explore the potential of using reinforcement learning neural networks to
optimize synthesis passes for input netlists. The synthesized netlist could be placed
and routed to determine fmax, which could be used as the score the neural network will
learn to optimize.
These are just a few of the concepts we're experimenting with. The broader goal is to
explore innovative ideas, develop a high-quality tool that can evolve with community
input, and just have fun!
# Status
Right now Haskellator can successfully parse RTLIL emitted from
Amaranth lang as well as RTLIL emitted from running Yosys
over large VexRISCV designs.
You can generate an RTLIL corpus to test Haskellator against right
from this repo by doing the following:
```bash
git clone --recursive git@github.com:JoyOfHardware/Haskellator.git
pushd rtlil-corpus; nix-shell; exit; popd
```
Now run a command like the following to parse some rtlil into Haskell
data structures found in `src/RTLILParser/AST.hs`.
```bash
nix-shell
rtlil-parse rtlil-corpus/corpus/gpio.il gpio.hs
Output written to gpio.hs
```
# Usage
## Run and Build With Nix(Linux and MacOS)
The following will allow you to see a pretty printed
AST for the given input `il` file.
```bash
git clone --recursive git@github.com:JoyOfHardware/Haskellator.git
$ nix-shell
$ rtlil-parse rtlil_file.il parsed_ast.hs
```
# TODO
- [ ] automated CICD on gitea on personal servers
- [ ] update to have support for four state logic by converting 'X' and 'Z' to zero
- [ ] validation pass that checks that `ConstantInteger Int` is
32 bits, that is, within range \[-2147483648, 2147483648)
- [ ] Reverse/repair cell-stmt
# Limitations
- Does not support propagating non-two state logic, that is, no
support for X or Z values. Default behavior is to successfully
parser such input. In the future, we will have validation phases
that reject circuits with X or Z values.
We may eventually support initializing X and Z values to 0.
- All cycles in circuit graphs must have at one D Flip-Flop on the
cycle path. This requirement necesarily pre-cludes simulation of
circuits such as NAND level-resolution SRAMs. The main reason for
this restriction is to avoid having to handle metastability in
simulation.
I have yet to evaluate the implications of how this affects
multi-clock domain circuits and their associated primitives such
as asynchronous FIFOs, but I plan to make sure simulation of such
circuits is possible and correct.
# Sponsors
<p align="center">
<a href="https://NLnet.nl">
<img src="assets/nlnet_logo.png" width="269" alt="Logo NLnet">
</a>
</p>