riscv/rocket-chip
1
0
Fork 0
Code Releases Activity

buses: name dummy buffers too

Browse Source
This commit is contained in:
Megan Wachs 2017-08-30 18:30:22 -07:00 committed by Wesley W. Terpstra
parent 3bde9506c6
commit c353f68dc0
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
src/main/scala/tilelink/Bus.scala
View File

@ -67,15 +67,15 @@ abstract class TLBusWrapper(params: TLBusParams, val busName: String)(implicit p
protected def inwardNode: TLInwardNode = xbar.node protected def inwardNode: TLInwardNode = xbar.node
protected def inwardBufNode: TLInwardNode = master_buffer.node protected def inwardBufNode: TLInwardNode = master_buffer.node
protected def bufferChain(n: Int, params: BufferParams = BufferParams.default, name: Option[String] = None): (TLInwardNode, TLOutwardNode) = { protected def bufferChain(depth: Int, params: BufferParams = BufferParams.default, name: Option[String] = None): (TLInwardNode, TLOutwardNode) = {
if (n > 0) { if (depth > 0) {
val chain = List.fill(n)(LazyModule(new TLBuffer(params))) val chain = List.fill(depth)(LazyModule(new TLBuffer(params)))
name.foreach { n => chain.zipWithIndex foreach { case(b, i) => b.suggestName(s"${busName}_${n}_${i}_TLBuffer") } } name.foreach { n => chain.zipWithIndex foreach { case(b, i) => b.suggestName(s"${busName}_${n}_${i}_TLBuffer") } }
(chain.init zip chain.tail) foreach { case(prev, next) => next.node :=* prev.node } (chain.init zip chain.tail) foreach { case(prev, next) => next.node :=* prev.node }
(chain.head.node, chain.last.node) (chain.head.node, chain.last.node)
} else { } else {
val dummy = LazyModule(new TLBuffer(BufferParams.none)) val dummy = LazyModule(new TLBuffer(BufferParams.none))
dummy.suggestName(s"${busName}_${n}_empty_TLBuffer") name.foreach { n => dummy.suggestName(s"${busName}_${n}_empty_TLBuffer")}
(dummy.node, dummy.node) (dummy.node, dummy.node)
} }
} }