summaryrefslogtreecommitdiff
path: root/core/src/main/scala/chisel3/experimental
diff options
context:
space:
mode:
authorJack2022-04-26 02:53:08 +0000
committerJack2022-04-26 02:53:08 +0000
commit3a6cc75d72cbf890bbd45a002c31d16abfc6896d (patch)
tree298a39cbdbcd7e89953d75dbd840884f29ff7699 /core/src/main/scala/chisel3/experimental
parentbe1ac06bf20c6c3d84c8ce5b0a50e2980e546e7e (diff)
parentd5a964f6e7beea1f38f9623224fc65e2397e1fe7 (diff)
Merge branch '3.5.x' into 3.5-release
Diffstat (limited to 'core/src/main/scala/chisel3/experimental')
-rw-r--r--core/src/main/scala/chisel3/experimental/dataview/package.scala55
-rw-r--r--core/src/main/scala/chisel3/experimental/hierarchy/Lookupable.scala16
-rw-r--r--core/src/main/scala/chisel3/experimental/package.scala28
3 files changed, 65 insertions, 34 deletions
diff --git a/core/src/main/scala/chisel3/experimental/dataview/package.scala b/core/src/main/scala/chisel3/experimental/dataview/package.scala
index 891ecb81..c583c516 100644
--- a/core/src/main/scala/chisel3/experimental/dataview/package.scala
+++ b/core/src/main/scala/chisel3/experimental/dataview/package.scala
@@ -97,11 +97,16 @@ package object dataview {
val targetContains: Data => Boolean = implicitly[DataProduct[T]].dataSet(target)
// Resulting bindings for each Element of the View
- val childBindings =
+ // Kept separate from Aggregates for totality checking
+ val elementBindings =
new mutable.HashMap[Data, mutable.ListBuffer[Element]] ++
viewFieldLookup.view.collect { case (elt: Element, _) => elt }
.map(_ -> new mutable.ListBuffer[Element])
+ // Record any Aggregates that correspond 1:1 for reification
+ // Using Data instead of Aggregate to avoid unnecessary checks
+ val aggregateMappings = mutable.ArrayBuffer.empty[(Data, Data)]
+
def viewFieldName(d: Data): String =
viewFieldLookup.get(d).map(_ + " ").getOrElse("") + d.toString
@@ -130,7 +135,7 @@ package object dataview {
s"View field $fieldName has width ${vwidth} that is incompatible with target value $tex's width ${twidth}"
)
}
- childBindings(vex) += tex
+ elementBindings(vex) += tex
}
mapping.foreach {
@@ -145,7 +150,7 @@ package object dataview {
}
getMatchedFields(aa, ba).foreach {
case (aelt: Element, belt: Element) => onElt(aelt, belt)
- case _ => // Ignore matching of Aggregates
+ case (t, v) => aggregateMappings += (v -> t)
}
}
@@ -155,7 +160,7 @@ package object dataview {
val targetSeen: Option[mutable.Set[Data]] = if (total) Some(mutable.Set.empty[Data]) else None
- val resultBindings = childBindings.map {
+ val elementResult = elementBindings.map {
case (data, targets) =>
val targetsx = targets match {
case collection.Seq(target: Element) => target
@@ -183,23 +188,25 @@ package object dataview {
}
view match {
- case elt: Element => view.bind(ViewBinding(resultBindings(elt)))
+ case elt: Element => view.bind(ViewBinding(elementResult(elt)))
case agg: Aggregate =>
- // We record total Data mappings to provide a better .toTarget
- val topt = target match {
- case d: Data if total => Some(d)
+ // Don't forget the potential mapping of the view to the target!
+ target match {
+ case d: Data if total =>
+ aggregateMappings += (agg -> d)
case _ =>
- // Record views that don't have the simpler .toTarget for later renaming
- Builder.unnamedViews += view
- None
}
- // TODO We must also record children as unnamed, some could be namable but this requires changes to the Binding
+
+ val fullResult = elementResult ++ aggregateMappings
+
+ // We need to record any Aggregates that don't have a 1-1 mapping (including the view
+ // itself)
getRecursiveFields.lazily(view, "_").foreach {
- case (agg: Aggregate, _) if agg != view =>
- Builder.unnamedViews += agg
+ case (unnamed: Aggregate, _) if !fullResult.contains(unnamed) =>
+ Builder.unnamedViews += unnamed
case _ => // Do nothing
}
- agg.bind(AggregateViewBinding(resultBindings, topt))
+ agg.bind(AggregateViewBinding(fullResult))
}
}
@@ -208,8 +215,8 @@ package object dataview {
private def unfoldView(elt: Element): LazyList[Element] = {
def rec(e: Element): LazyList[Element] = e.topBindingOpt match {
case Some(ViewBinding(target)) => target #:: rec(target)
- case Some(AggregateViewBinding(mapping, _)) =>
- val target = mapping(e)
+ case Some(avb: AggregateViewBinding) =>
+ val target = avb.lookup(e).get
target #:: rec(target)
case Some(_) | None => LazyList.empty
}
@@ -246,15 +253,11 @@ package object dataview {
*/
private[chisel3] def reifySingleData(data: Data): Option[Data] = {
val candidate: Option[Data] =
- data.binding.collect { // First check if this is a total mapping of an Aggregate
- case AggregateViewBinding(_, Some(t)) => t
- }.orElse { // Otherwise look via top binding
- data.topBindingOpt match {
- case None => None
- case Some(ViewBinding(target)) => Some(target)
- case Some(AggregateViewBinding(lookup, _)) => lookup.get(data)
- case Some(_) => None
- }
+ data.topBindingOpt match {
+ case None => None
+ case Some(ViewBinding(target)) => Some(target)
+ case Some(AggregateViewBinding(lookup)) => lookup.get(data)
+ case Some(_) => None
}
candidate.flatMap { d =>
// Candidate may itself be a view, keep tracing in those cases
diff --git a/core/src/main/scala/chisel3/experimental/hierarchy/Lookupable.scala b/core/src/main/scala/chisel3/experimental/hierarchy/Lookupable.scala
index 60290f83..46a38e7c 100644
--- a/core/src/main/scala/chisel3/experimental/hierarchy/Lookupable.scala
+++ b/core/src/main/scala/chisel3/experimental/hierarchy/Lookupable.scala
@@ -173,12 +173,12 @@ object Lookupable {
// We have to lookup the target(s) of the view since they may need to be underlying into the current context
val newBinding = data.topBinding match {
case ViewBinding(target) => ViewBinding(lookupData(reify(target)))
- case avb @ AggregateViewBinding(map, targetOpt) =>
+ case avb @ AggregateViewBinding(map) =>
data match {
- case _: Element => ViewBinding(lookupData(reify(map(data))))
+ case e: Element => ViewBinding(lookupData(reify(avb.lookup(e).get)))
case _: Aggregate =>
// Provide a 1:1 mapping if possible
- val singleTargetOpt = targetOpt.filter(_ => avb == data.binding.get).flatMap(reifySingleData)
+ val singleTargetOpt = map.get(data).filter(_ => avb == data.binding.get).flatMap(reifySingleData)
singleTargetOpt match {
case Some(singleTarget) => // It is 1:1!
// This is a little tricky because the values in newMap need to point to Elements of newTarget
@@ -187,15 +187,15 @@ object Lookupable {
case (res, from) =>
(res: Data) -> mapRootAndExtractSubField(map(from), _ => newTarget)
}.toMap
- AggregateViewBinding(newMap, Some(newTarget))
+ AggregateViewBinding(newMap + (result -> newTarget))
case None => // No 1:1 mapping so we have to do a flat binding
// Just remap each Element of this aggregate
val newMap = coiterate(result, data).map {
// Upcast res to Data since Maps are invariant in the Key type parameter
- case (res, from) => (res: Data) -> lookupData(reify(map(from)))
+ case (res, from) => (res: Data) -> lookupData(reify(avb.lookup(from).get))
}.toMap
- AggregateViewBinding(newMap, None)
+ AggregateViewBinding(newMap)
}
}
}
@@ -204,8 +204,8 @@ object Lookupable {
// We must also mark non-1:1 and child Aggregates in the view for renaming
newBinding match {
case _: ViewBinding => // Do nothing
- case AggregateViewBinding(_, target) =>
- if (target.isEmpty) {
+ case AggregateViewBinding(childMap) =>
+ if (!childMap.contains(result)) {
Builder.unnamedViews += result
}
// Binding does not capture 1:1 for child aggregates views
diff --git a/core/src/main/scala/chisel3/experimental/package.scala b/core/src/main/scala/chisel3/experimental/package.scala
index ce258a25..9b9c83f4 100644
--- a/core/src/main/scala/chisel3/experimental/package.scala
+++ b/core/src/main/scala/chisel3/experimental/package.scala
@@ -57,6 +57,34 @@ package object experimental {
type Direction = ActualDirection
val Direction = ActualDirection
+ /** The same as [[IO]] except there is no prefix for the name of the val */
+ def FlatIO[T <: Record](gen: => T)(implicit sourceInfo: SourceInfo, compileOptions: CompileOptions): T = noPrefix {
+ import dataview._
+ def coerceDirection(d: Data) = {
+ import chisel3.{SpecifiedDirection => SD}
+ DataMirror.specifiedDirectionOf(gen) match {
+ case SD.Flip => Flipped(d)
+ case SD.Input => Input(d)
+ case SD.Output => Output(d)
+ case _ => d
+ }
+ }
+ val ports: Seq[Data] =
+ gen.elements.toSeq.reverse.map {
+ case (name, data) =>
+ val p = IO(coerceDirection(chiselTypeClone(data).asInstanceOf[Data]))
+ p.suggestName(name)
+ p
+
+ }
+
+ implicit val dv: DataView[Seq[Data], T] = DataView.mapping(
+ _ => chiselTypeClone(gen).asInstanceOf[T],
+ (seq, rec) => seq.zip(rec.elements.toSeq.reverse).map { case (port, (_, field)) => port -> field }
+ )
+ ports.viewAs[T]
+ }
+
implicit class ChiselRange(val sc: StringContext) extends AnyVal {
import scala.language.experimental.macros