passes
Infers the widths of all signals with unknown widths
Infers the widths of all signals with unknown widths
Is a global width inference algorithm - Instances of the same module with unknown input port widths will be assigned the largest width of all assignments to each of its instance ports - If you don't want the global inference behavior, then be sure to define all your input widths
Infers the smallest width is larger than all assigned widths to a signal - Note that this means that dummy assignments that are overwritten by last-connect-semantics can still influence width inference - E.g. wire x: UInt x <= UInt<5>(15) x <= UInt<1>(1)
Since width inference occurs before lowering, it infers x's width to be 5 but with an assignment of UInt(1):
wire x: UInt<5> x <= UInt<1>(1)
Uses firrtl.constraint package to infer widths
Indicates that something should be inlined
Inline instances as indicated by existing InlineAnnotations
Inline instances as indicated by existing InlineAnnotations
Only use on legal Firrtl. Specifically, the restriction of instance loops must have been checked, or else this pass can infinitely recurse.
Pass is simple transform that is generally part of a larger Transform Has an UnknownForm, because larger Transform should specify form
Replaces IntervalType with SIntType, three AST walks: 1) Align binary points
Replaces IntervalType with SIntType, three AST walks: 1) Align binary points
Replaces IntervalType with SIntType, three AST walks: 1) Align binary points
Replaces IntervalType with SIntType, three AST walks: 1) Align binary points
Reports errors for any references that are not fully initialized
Reports errors for any references that are not fully initialized
Assumes single connection (ie. no last connect semantics)
,This pass looks for firrtl.WVoids left behind by ExpandWhens
Replaces FixedType with SIntType, and correctly aligns all binary points
Expand Whens
Expand Whens
This pass does the following things: $ - Remove last connect semantics $ - Remove conditional blocks $ - Eliminate concept of scoping $ - Consolidate attaches
Assumes all references are declared
,Assumes bulk connects and isInvalids have been expanded
Flattens Bundles and Vecs.
Flattens Bundles and Vecs. - Some implicit bundle types remain, but with a limited depth:
Removes all firrtl.WSubAccess from circuit
Remove ValidIf and replace IsInvalid with a connection to zero
Replaces constant firrtl.WSubAccess with firrtl.WSubIndex TODO Fold in to High Firrtl Const Prop
Verilog has the width of (a % b) = Max(W(a), W(b)) FIRRTL has the width of (a % b) = Min(W(a), W(b)), which makes more sense, but nevertheless is a problem when emitting verilog
Verilog has the width of (a % b) = Max(W(a), W(b)) FIRRTL has the width of (a % b) = Min(W(a), W(b)), which makes more sense, but nevertheless is a problem when emitting verilog
This pass finds every instance of (a % b) and: 1) adds a temporary node equal to (a % b) with width Max(W(a), W(b)) 2) replaces the reference to (a % b) with a bitslice of the temporary node to get back down to width Min(W(a), W(b))
This is technically incorrect firrtl, but allows the verilog emitter to emit correct verilog without needing to add temporary nodes
Makes changes to the Firrtl AST to make Verilog emission easier
Makes changes to the Firrtl AST to make Verilog emission easier
- For each instance, adds wires to connect to each port
The result of this pass is NOT legal Firrtl
Handles dynamic accesses to zero-length vectors.
Handles dynamic accesses to zero-length vectors.
Replaces "source" references to elements of zero-length vectors with always-invalid validif
,Removes attaches that become degenerate after zero-length-accessor removal
,Removes signals resulting from accesses to a zero-length vector from attach groups
,Removes assignments that use a zero-length vector as a sink
Given a mask, return a bitmask corresponding to the desired datatype.
Given a mask, return a bitmask corresponding to the desired datatype. Requirements:
wire mask: {x: UInt<1>, y: UInt<1>}
wire data: {x: UInt<2>, y: SInt<2>}
// this would return:
cat(cat(mask.x, mask.x), cat(mask.y, mask.y))
Resolve name collisions that would occur in the old LowerTypes pass
Resolve name collisions that would occur in the old LowerTypes pass
(Since version FIRRTL 1.4.0) Uniquify is now part of LowerTypes
wire a = { b, c }[2]
wire a_0This lowers to:
wire a__0_b wire a__0_c wire a__1_b wire a__1_c wire a_0
There wouldn't be a collision even if we didn't map a -> a_, but there WOULD be collisions in references a[0] and a_0 so we still have to rename a
Must be run after InferTypes because ir.DefNodes need type