DependencyManager
Related Doc:
package options
The type used to express dependencies: a class which itself has dependencies.
The type used to express dependencies: a class which itself has dependencies.
A method that will create a copy of this DependencyManager, but with different requirements.
A method that will create a copy of this DependencyManager, but with different requirements. This is used to solve sub-problems arising from invalidations.
A sequence of firrtl.Transforms that have been run.
A sequence of firrtl.Transforms that have been run. Internally, this will be converted to an ordered set.
Existing transform objects that have already been constructed
An identifier of this TransformLike that can be used for logging and informational printing
An identifier of this TransformLike that can be used for logging and informational printing
Requested TransformLikes that should be run.
Requested TransformLikes that should be run. Internally, this will be converted to a set based on the ordering defined here.
Store of conversions between classes and objects.
Store of conversions between classes and objects. Objects that do not exist in the map will be lazily constructed.
This colormap uses Colorbrewer's 4-class OrRd color scheme
This colormap uses Colorbrewer's 4-class OrRd color scheme
Convert all prerequisites, dependents, and invalidates to a Graphviz representation.
A directed graph consisting of all prerequisites, including prerequisites derived from dependents
All transforms that must run after this transform
All transforms that must run after this transform
This is a means of prerequisite injection into some other transform. Normally a transform will define its own prerequisites. Dependents exist for two main situations:
First, they improve the composition of optional transforms. If some first transform is optional (e.g., an expensive validation check), you would like to be able to conditionally cause it to run. If it is listed as a prerequisite on some other, second transform then it must always run before that second transform. There's no way to turn it off. However, by listing the second transform as a dependent of the first transform, the first transform will only run (and be treated as a prerequisite of the second transform) if included in a list of target transforms that should be run.
Second, an external library would like to inject some first transform before a second transform inside FIRRTL. In this situation, the second transform cannot have any knowledge of external libraries. The use of a dependent here allows for prerequisite injection into FIRRTL proper.
The use of a Seq here is to preserve input order. Internally, this will be converted to a private, ordered Set.
firrtl.passes.CheckTypes for an example of an optional checking firrtl.Transform
A version of the transformOrder that flattens the transforms of any internal DependencyManagers.
A directed graph consisting of invalidation edges
A function that, given *another* transform (parameter a) will return true if this transform invalidates/undos the
effects of the *other* transform (parameter a).
A function that, given *another* transform (parameter a) will return true if this transform invalidates/undos the
effects of the *other* transform (parameter a).
transform
All transform that must run before this transform
All transform that must run before this transform
The use of a Seq here is to preserve input order. Internally, this will be converted to a private, ordered Set.
A mathematical transform on some type
A mathematical transform on some type
an output object of the same type
An ordering of TransformLikes that causes the requested targets to be executed starting from the currentState.
An ordering of TransformLikes that causes the requested targets to be executed starting from the currentState. This ordering respects prerequisites, dependents, and invalidates of all constituent TransformLikes. This uses an algorithm that attempts to reduce the number of re-lowerings due to invalidations. Re-lowerings are implemented as new DependencyManagers.
DependencyManagerException if a cycle exists in either the dependencyGraph or the invalidateGraph.
A sequence of wrappers to apply to the resulting TransformLike sequence.
A sequence of wrappers to apply to the resulting TransformLike sequence. This can be used to, e.g., add automated pre-processing and post-processing.
A TransformLike that resolves a linear ordering of dependencies based on requirements.
the type over which this transforms
the type of the TransformLike