| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2018-03-27 | Change throwInternalError to use a String instead of Option[String] (#777) | Jack Koenig | |
| 2018-03-21 | GroupModule Transform (#766) | Adam Izraelevitz | |
| * Added grouping pass * Added InfoMagnet and infomappers * Changed return type of execute to allow final CircuitState inspection * Updated dedup. Now is name-agnostic * Added GroupAndDedup transform | |||
| 2018-01-15 | WiringTransform Refactor (#648) | Schuyler Eldridge | |
| Massive refactoring to WiringTransform with the use of a new EulerTour class to speed things up via fast least common ancestor (LCA) queries. Changes include (but are not limited to): * Use lowest common ancestor when wiring * Add EulerTour class with naive and Berkman-Vishkin RMQ * Adds LCA method for Instance Graph * Enables "Two Sources" using "Top" wiring test as this is now valid * Remove TopAnnotation from WiringTransform * Represent WiringTransform sink as `Seq[Named]` * Remove WiringUtils.countInstances, fix imports * Support sources under sinks in WiringTransform * Enable internal module wiring * Support Wiring of Aggregates h/t @edcote fixes #728 Signed-off-by: Schuyler Eldridge <schuyler.eldridge@ibm.com> Reviewed-by: Jack Koenig<jack.koenig3@gmail.com> | |||
| 2017-12-29 | Add NodeCount analysis for helping with performance debugging | Jack Koenig | |
| 2017-11-10 | Make digraph methods deterministic (#653) | Albert Magyar | |
| 2017-09-05 | Make InstanceGraph track module hierarchies not contained in the top-level ↵ | Albert Magyar | |
| hierarchy | |||
| 2017-03-17 | Add utilites for digraphs and netlist analyses | Albert Magyar | |
 |
index : sfcX | |
| Scala FIRRTL Compiler for chiselX |
| aboutsummaryrefslogtreecommitdiff |