Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
config:runtime [2023/01/30 21:19] – [Attributes] rajit | config:runtime [2025/05/27 18:12] (current) – [Verilog global signal prefix] rajit | ||
---|---|---|---|
Line 33: | Line 33: | ||
This specifies a limit on array sizes that also have internal sub-connections (i.e. arrays that are not just simple memories, for example). The limit should be increased as needed, but can have a performance impact if you have a very large array with internal sub-connections. | This specifies a limit on array sizes that also have internal sub-connections (i.e. arrays that are not just simple memories, for example). The limit should be increased as needed, but can have a performance impact if you have a very large array with internal sub-connections. | ||
- | ===== Attributes ===== | ||
- | ACT supports attributes on both instances and production rules. | + | ===== Circuit level selection ===== |
- | An ACT instance | + | ACT has a number of [[language: |
- | < | + | A process can be described at multiple levels of abstraction. During analysis/ |
- | bool v @ [attr=0]; | + | |
- | bool w; | + | The default level of abstraction that should be used is specified as follows: |
- | w @ [attr=5]; | + | < |
+ | begin level | ||
+ | # the default level: can be chp, prs, hse, or device | ||
+ | | ||
+ | end | ||
</ | </ | ||
+ | Beyond this, the default level can be over-ridden for any specific type as follows: | ||
+ | < | ||
+ | begin level | ||
+ | begin types | ||
+ | # the list of processes here should be modeled at the device level | ||
+ | | ||
+ | |||
+ | # these should be modeled at the chp level | ||
+ | | ||
+ | |||
+ | # etc... | ||
+ | | ||
+ | end | ||
+ | end | ||
+ | </ | ||
+ | Finally, individual instance levels can be specified as follows: | ||
+ | < | ||
+ | begin level | ||
+ | begin inst | ||
+ | | ||
+ | end | ||
+ | end | ||
+ | </ | ||
- | Instance attributes | + | Finally, ACT supports a [[language: |
+ | < | ||
+ | # set the initial refinement step to 4 | ||
+ | int act.refine_steps 4 | ||
+ | </ | ||
+ | If the current refinement step count is positive, then any '' | ||
- | Production-rule attributes | ||
- | ===== Circuit level selection | + | ===== Decomposition passes |
+ | The memory decomposition and arbiter decomposition passes are used to replace memory structures and arbiters with a separate process, and introduce communication channels to interact with that process to re-create the original user-specified functionality. The process names used for this purpose can be modified using the following configuration options. The default values are provided below. | ||
- | ===== Decomposition passes ===== | + | < |
+ | begin act | ||
+ | begin decomp | ||
+ | string mem " | ||
+ | string arbiter " | ||
+ | end | ||
+ | end | ||
+ | </ | ||
+ | ===== External Black Box Support ===== | ||
+ | |||
+ | ACT also provides a mechanism for "black box" modules---components that are defined elsewhere, like external hard macros. We assume that the external specification of the macros includes: | ||
+ | * A LEF file, for layout generation, along with bounding box information in the LEF coordinate system | ||
+ | * A SPICE file, for circuit simulation | ||
+ | * A Verilog file, for Verilog exports | ||
+ | * TBD | ||
+ | |||
+ | A process is treated as a black box if it is defined with an empty body. For example: | ||
+ | |||
+ | <code act> | ||
+ | defproc bbproc (bool? A, B, C; bool! D) { } | ||
+ | </ | ||
+ | is interpreted as a black box by default. (Note that there is a configuration parameter that can be used to turn off this behavior, in which case this component will be eventually stripped out of the design since it does not contain any circuit component.) | ||
+ | |||
+ | The location of the LEF/ | ||
+ | |||
+ | < | ||
+ | begin macros | ||
+ | begin < | ||
+ | string lef " | ||
+ | string spice " | ||
+ | string verilog " | ||
+ | int llx <val> | ||
+ | int lly <val> | ||
+ | int urx <val> | ||
+ | int ury <val> | ||
+ | end | ||
+ | end | ||
+ | </ | ||
+ | |||
+ | The expanded name is the fully expanded name for the process (in this case '' | ||
+ | |||
+ | ==== Generalized External Black Box ==== | ||
+ | |||
+ | Sometimes we require a more sophisticated model for an external black box. In particular, we might want to specify internal nodes within the black box so that the timing model for the black box can be made more precise. For this purpose, a more general black box syntax is supported. | ||
+ | |||
+ | <code act> | ||
+ | defproc bbproc (bool? A, B, C; bool! D) { bool int1, int2; } | ||
+ | </ | ||
+ | This process will also be treated as a black box, but with the understanding that there are also internal nodes that might be used to build a more sophisticated timing model. | ||
+ | |||
+ | A generalized black box body can only contain instances of signals that are of type '' |