sfcX/src/test/scala/firrtlTests/graph, branch sfc-scala3 Scala FIRRTL Compiler for chiselX Change to Apache 2.0 License (#1901) 2020-09-17T01:52:16+00:00 Chick Markley 2020-09-17T01:52:16+00:00 ecb96e83324ea17cf38b7b90753d745d3c7f51bd 






All of src/ formatted with scalafmt
2020-08-15T02:47:53+00:00

chick

2020-08-15T02:47:53+00:00

6fc742bfaf5ee508a34189400a1a7dbffe3f1cac












Delete outdated scalastyle configuration comments from source
2020-07-14T19:55:35+00:00

Albert Magyar

2020-07-14T18:29:05+00:00

63bfb32c72e4db52bd376b3fd96bb0247ee167fb












[RFC] Factor out common test classes; package them (#1412)
2020-03-17T20:26:40+00:00

David Biancolin

2020-03-17T20:26:40+00:00

ba1f24345ac5ab20c669c73b871920001ac3a8ed

* Pull out common test utilities into a separate package

* Project a fat jar for test utilities

Co-authored-by: Albert Magyar <albert.magyar@gmail.com>




* Pull out common test utilities into a separate package

* Project a fat jar for test utilities

Co-authored-by: Albert Magyar <albert.magyar@gmail.com>






Add test case for reachableFrom behavior w.r.t. including root
2020-02-19T02:29:44+00:00

Albert Magyar

2020-02-19T02:29:44+00:00

b9a1ccfd0c7ba082a193d50933de52c4eea6a1c0












Create a simple generic GraphViz renderer for DiGraph (#1034)
2019-02-27T00:07:33+00:00

Chick Markley

2019-02-27T00:07:33+00:00

aec54ed72d02932f8fdb3aa857e82a23507aecd2

* Create a simple generic graphviz renderer for DiGraph
There are three basic kinds
- A simple default renderer
- A ranked renderer that places nodes in columns based on depth from sources
- A sub-graph render for graphs that contain a loop
  - Renders just nodes that are part of first loop found
  - Plus the neighbors of the loop
  - Loop edges are shown in red.

* Create a simple generic graphviz renderer for DiGraph
- Moved the graph loop finder into DiGraph
- Fixed scala doc per Edward's comments





* Create a simple generic graphviz renderer for DiGraph
There are three basic kinds
- A simple default renderer
- A ranked renderer that places nodes in columns based on depth from sources
- A sub-graph render for graphs that contain a loop
  - Renders just nodes that are part of first loop found
  - Plus the neighbors of the loop
  - Loop edges are shown in red.

* Create a simple generic graphviz renderer for DiGraph
- Moved the graph loop finder into DiGraph
- Fixed scala doc per Edward's comments







Make DiGraph.linearize be iterative instead of recursive (#785)
2018-04-11T17:19:16+00:00

Jack Koenig

2018-04-11T17:19:16+00:00

27ee6fbbdf2b1854503ef51ffc0e2108a939d50c

Also make DiGraphTests more ScalaTest-y





Also make DiGraphTests more ScalaTest-y







CyclicException identifies a problem node. (#778)
2018-04-02T17:23:37+00:00

Chick Markley

2018-04-02T17:23:37+00:00

6ec5df16a38a7b53494ed3f52da039b8fa62175e

Needed for special handling in Treadle.
Small refactor that allows users of DiGraph#linearize
to return the first node found in a cycle.
Fixed RemoveWiresTransfrom to handle this.
Added test to show usage of this feature.




Needed for special handling in Treadle.
Small refactor that allows users of DiGraph#linearize
to return the first node found in a cycle.
Fixed RemoveWiresTransfrom to handle this.
Added test to show usage of this feature.






Add graph summation "+" to DiGraph (#744)
2018-02-23T23:03:42+00:00

Schuyler Eldridge

2018-02-23T23:03:42+00:00

f295adc5e71e8970d8223552c4e9d0447bd72d1a

* Add DiGraph sum and DiGraph sum test

Signed-off-by: Schuyler Eldridge <schuyler.eldridge@ibm.com>

* Make DiGraph sum deterministic

Signed-off-by: Schuyler Eldridge <schuyler.eldridge@ibm.com>

* Remove ordered hashes/sets from DiGraphTests

Signed-off-by: Schuyler Eldridge <schuyler.eldridge@ibm.com>





* Add DiGraph sum and DiGraph sum test

Signed-off-by: Schuyler Eldridge <schuyler.eldridge@ibm.com>

* Make DiGraph sum deterministic

Signed-off-by: Schuyler Eldridge <schuyler.eldridge@ibm.com>

* Remove ordered hashes/sets from DiGraphTests

Signed-off-by: Schuyler Eldridge <schuyler.eldridge@ibm.com>







WiringTransform Refactor (#648)
2018-01-15T23:53:28+00:00

Schuyler Eldridge

2018-01-15T23:53:28+00:00

347cc522e96f8090d53b3b042af646e4a0e765b2

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>




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>