Module Hardcaml__.Signal_graph

Create a Signal_graph.t from a list of signals (commonly, circuit outputs).

Traverse the graph and find all inputs. Badly formed inputs (no name, or multiple names) return an error.

Return the outputs of the signal graph. If validate is true, then the outputs are checked for compatibility with circuit outputs.

Visit all signals in the graph, starting at the outputs, in a depth-first manner. Each signal is visited only once. f_before is called before recursing on each signal's fan-in. Similiarly, f_after is called after recursing on the fan-in.

If deps is provided it will be used to compute signal dependencies rather than the default definition. This is useful for terminating traversals based on some condition on signals, e.g., if it's a register or a memory.

Fold across all signals in the graph, starting at the outputs. Each signal is visited only once.

Return a list of all signals in the graph for whom f signal returns true.

Iterate over all signals in the graph.

Retuns an error if the graph has a combinational loop, that is, a path from a signal back to itself that doesn't pass though a register, memory or instantiation.

normalize_uids t creates a copy of t that is identical to t except the uids are numbered starting at 1.

Fan-out of each signal in the signal graph. The fan-out of a signal is the set of signals it drives.

Fan-in of each signal in the signal graph. The fan-in of a signal is the set of signals that drive it.

topological_sort t sorts the signals in t so that all the signals in deps s occur before s.

Signal dependencies used for scheduling. Breaks loops through sequential elements like registers and memories.

Final layer of combinational nodes which sit on the path between the outputs and any driving register or memory.