1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
|
package firrtl.transforms
import firrtl._
import firrtl.Mappers._
import firrtl.ir._
import firrtl.annotations.{Annotation, ComponentName}
import firrtl.passes.{InferTypes, LowerTypes, MemPortUtils}
import firrtl.Utils.{kind, throwInternalError}
import firrtl.graph.{DiGraph, MutableDiGraph}
import scala.collection.mutable
/**
* Specifies a group of components, within a module, to pull out into their own module
* Components that are only connected to a group's components will also be included
*
* @param components components in this group
* @param newModule suggested name of the new module
* @param newInstance suggested name of the instance of the new module
* @param outputSuffix suggested suffix of any output ports of the new module
* @param inputSuffix suggested suffix of any input ports of the new module
*/
case class GroupAnnotation(components: Seq[ComponentName], newModule: String, newInstance: String, outputSuffix: Option[String] = None, inputSuffix: Option[String] = None) extends Annotation {
if(components.nonEmpty) {
require(components.forall(_.module == components.head.module), "All components must be in the same module.")
require(components.forall(!_.name.contains('.')), "No components can be a subcomponent.")
}
/**
* The module that all components are located in
* @return
*/
def currentModule: String = components.head.module.name
/* Only keeps components renamed to components */
def update(renames: RenameMap): Seq[Annotation] = {
val newComponents = components.flatMap{c => renames.get(c).getOrElse(Seq(c))}.collect {
case c: ComponentName => c
}
Seq(GroupAnnotation(newComponents, newModule, newInstance, outputSuffix, inputSuffix))
}
}
/**
* Splits a module into multiple modules by grouping its components via [[GroupAnnotation]]'s
*/
class GroupComponents extends firrtl.Transform {
type MSet[T] = mutable.Set[T]
def inputForm: CircuitForm = MidForm
def outputForm: CircuitForm = MidForm
override def execute(state: CircuitState): CircuitState = {
val groups = state.annotations.collect {case g: GroupAnnotation => g}
val module2group = groups.groupBy(_.currentModule)
val mnamespace = Namespace(state.circuit)
val newModules = state.circuit.modules.flatMap {
case m: Module if module2group.contains(m.name) =>
// do stuff
groupModule(m, module2group(m.name).filter(_.components.nonEmpty), mnamespace)
case other => Seq(other)
}
val cs = state.copy(circuit = state.circuit.copy(modules = newModules))
val csx = InferTypes.execute(cs)
csx
}
def groupModule(m: Module, groups: Seq[GroupAnnotation], mnamespace: Namespace): Seq[Module] = {
val namespace = Namespace(m)
val groupRoots = groups.map(_.components.map(_.name))
val totalSum = groupRoots.map(_.size).sum
val union = groupRoots.foldLeft(Set.empty[String]){(all, set) => all.union(set.toSet)}
require(groupRoots.forall{_.forall{namespace.contains}}, "All names should be in this module")
require(totalSum == union.size, "No name can be in more than one group")
require(groupRoots.forall(_.nonEmpty), "All groupRoots must by non-empty")
// Order of groups, according to their label. The label is the first root in the group
val labelOrder = groups.collect({ case g: GroupAnnotation => g.components.head.name })
// Annotations, by label
val label2annotation = groups.collect({ case g: GroupAnnotation => g.components.head.name -> g }).toMap
// Group roots, by label
// The label "" indicates the original module, and components belonging to that group will remain
// in the original module (not get moved into a new module)
val label2group: Map[String, MSet[String]] = groups.collect{
case GroupAnnotation(set, module, instance, _, _) => set.head.name -> mutable.Set(set.map(_.name):_*)
}.toMap + ("" -> mutable.Set(""))
// Name of new module containing each group, by label
val label2module: Map[String, String] =
groups.map(a => a.components.head.name -> mnamespace.newName(a.newModule)).toMap
// Name of instance of new module, by label
val label2instance: Map[String, String] =
groups.map(a => a.components.head.name -> namespace.newName(a.newInstance)).toMap
// Build set of components not in set
val notSet = label2group.map { case (key, value) => key -> union.diff(value) }
// Get all dependencies between components
val deps = getComponentConnectivity(m)
// For each node not in the set, which group (by label) can reach it
val reachableNodes = new mutable.HashMap[String, MSet[String]]()
// For each group (by label), add connectivity between nodes in set
// Populate reachableNodes with reachability, where blacklist is their notSet
label2group.foreach { case (label, set) =>
set.foreach { x =>
deps.addPairWithEdge(label, x)
}
deps.reachableFrom(label, notSet(label)) foreach { node =>
reachableNodes.getOrElseUpdate(node, mutable.Set.empty[String]) += label
}
}
// Add nodes who are reached by a single group, to that group
reachableNodes.foreach { case (node, membership) =>
if(membership.size == 1) {
label2group(membership.head) += node
} else {
label2group("") += node
}
}
applyGrouping(m, labelOrder, label2group, label2module, label2instance, label2annotation)
}
/**
* Applies datastructures to a module, to group its components into distinct modules
* @param m module to split apart
* @param labelOrder order of groups in SeqAnnotation, to make the grouping more deterministic
* @param label2group group components, by label
* @param label2module module name, by label
* @param label2instance instance name of the group's module, by label
* @param label2annotation annotation specifying the group, by label
* @return new modules, including each group's module and the new split module
*/
def applyGrouping( m: Module,
labelOrder: Seq[String],
label2group: Map[String, MSet[String]],
label2module: Map[String, String],
label2instance: Map[String, String],
label2annotation: Map[String, GroupAnnotation]
): Seq[Module] = {
// Maps node to group
val byNode = mutable.HashMap[String, String]()
label2group.foreach { case (group, nodes) =>
nodes.foreach { node =>
byNode(node) = group
}
}
val groupNamespace = label2group.map { case (head, set) => head -> Namespace(set.toSeq) }
val groupStatements = mutable.HashMap[String, mutable.ArrayBuffer[Statement]]()
val groupPorts = mutable.HashMap[String, mutable.ArrayBuffer[Port]]()
val groupPortNames = mutable.HashMap[String, mutable.HashMap[String, String]]()
label2group.keys.foreach { group =>
groupStatements(group) = new mutable.ArrayBuffer[Statement]()
groupPorts(group) = new mutable.ArrayBuffer[Port]()
groupPortNames(group) = new mutable.HashMap[String, String]()
}
def addPort(group: String, exp: Expression, d: Direction): String = {
val source = LowerTypes.loweredName(exp)
val portNames = groupPortNames(group)
val suffix = d match {
case Output => label2annotation(group).outputSuffix.getOrElse("")
case Input => label2annotation(group).inputSuffix.getOrElse("")
}
val newName = groupNamespace(group).newName(source + suffix)
val portName = portNames.getOrElseUpdate(source, newName)
groupPorts(group) += Port(NoInfo, portName, d, exp.tpe)
portName
}
def punchSignalOut(group: String, exp: Expression): String = {
val portName = addPort(group, exp, Output)
groupStatements(group) += Connect(NoInfo, WRef(portName), exp)
portName
}
// Given the sink is in a group, tidy up source references
def inGroupFixExps(group: String, added: mutable.ArrayBuffer[Statement])(e: Expression): Expression = e match {
case _: Literal => e
case _: DoPrim | _: Mux | _: ValidIf => e map inGroupFixExps(group, added)
case otherExp: Expression =>
val wref = getWRef(otherExp)
val source = wref.name
byNode(source) match {
// case 1: source in the same group as sink
case `group` => otherExp //do nothing
// case 2: source in top
case "" =>
// Add port to group's Module
val toPort = addPort(group, otherExp, Input)
// Add connection in Top to group's Module port
added += Connect(NoInfo, WSubField(WRef(label2instance(group)), toPort), otherExp)
// Return WRef with new kind (its inside the group Module now)
WRef(toPort, otherExp.tpe, PortKind, MALE)
// case 3: source in different group
case otherGroup =>
// Add port to otherGroup's Module
val fromPort = punchSignalOut(otherGroup, otherExp)
val toPort = addPort(group, otherExp, Input)
// Add connection in Top from otherGroup's port to group's port
val groupInst = label2instance(group)
val otherInst = label2instance(otherGroup)
added += Connect(NoInfo, WSubField(WRef(groupInst), toPort), WSubField(WRef(otherInst), fromPort))
// Return WRef with new kind (its inside the group Module now)
WRef(toPort, otherExp.tpe, PortKind, MALE)
}
}
// Given the sink is in the parent module, tidy up source references belonging to groups
def inTopFixExps(e: Expression): Expression = e match {
case _: DoPrim | _: Mux | _: ValidIf => e map inTopFixExps
case otherExp: Expression =>
val wref = getWRef(otherExp)
if(byNode(wref.name) != "") {
// Get the name of source's group
val otherGroup = byNode(wref.name)
// Add port to otherGroup's Module
val otherPortName = punchSignalOut(otherGroup, otherExp)
// Return WSubField (its inside the top Module still)
WSubField(WRef(label2instance(otherGroup)), otherPortName)
} else otherExp
}
def onStmt(s: Statement): Statement = {
s match {
// Sink is in a group
case r: IsDeclaration if byNode(r.name) != "" =>
val topStmts = mutable.ArrayBuffer[Statement]()
val group = byNode(r.name)
groupStatements(group) += r mapExpr inGroupFixExps(group, topStmts)
Block(topStmts)
case c: Connect if byNode(getWRef(c.loc).name) != "" =>
// Sink is in a group
val topStmts = mutable.ArrayBuffer[Statement]()
val group = byNode(getWRef(c.loc).name)
groupStatements(group) += Connect(c.info, c.loc, inGroupFixExps(group, topStmts)(c.expr))
Block(topStmts)
// TODO Attach if all are in a group?
case _: IsDeclaration | _: Connect | _: Attach =>
// Sink is in Top
val ret = s mapExpr inTopFixExps
ret
case other => other map onStmt
}
}
// Build datastructures
val newTopBody = Block(labelOrder.map(g => WDefInstance(NoInfo, label2instance(g), label2module(g), UnknownType)) ++ Seq(onStmt(m.body)))
val finalTopBody = Block(Utils.squashEmpty(newTopBody).asInstanceOf[Block].stmts.distinct)
// For all group labels (not including the original module label), return a new Module.
val newModules = labelOrder.filter(_ != "") map { group =>
Module(NoInfo, label2module(group), groupPorts(group).distinct, Block(groupStatements(group).distinct))
}
Seq(m.copy(body = finalTopBody)) ++ newModules
}
def getWRef(e: Expression): WRef = e match {
case w: WRef => w
case other =>
var w = WRef("")
other mapExpr { e => w = getWRef(e); e}
w
}
/**
* Compute how each component connects to each other component
* It is non-directioned; there is an edge from source to sink and from sink to souce
* @param m module to compute connectivity
* @return a bi-directional representation of component connectivity
*/
def getComponentConnectivity(m: Module): MutableDiGraph[String] = {
val bidirGraph = new MutableDiGraph[String]
val simNamespace = Namespace()
val simulations = new mutable.HashMap[String, Statement]
def onExpr(sink: WRef)(e: Expression): Expression = e match {
case w @ WRef(name, _, _, _) =>
bidirGraph.addPairWithEdge(sink.name, name)
bidirGraph.addPairWithEdge(name, sink.name)
w
case other => other map onExpr(sink)
}
def onStmt(stmt: Statement): Unit = stmt match {
case w: WDefInstance =>
case h: IsDeclaration => h map onExpr(WRef(h.name))
case Attach(_, exprs) => // Add edge between each expression
exprs.tail map onExpr(getWRef(exprs.head))
case Connect(_, loc, expr) =>
onExpr(getWRef(loc))(expr)
case q @ Stop(_,_, clk, en) =>
val simName = simNamespace.newTemp
simulations(simName) = q
Seq(clk, en) map onExpr(WRef(simName))
case q @ Print(_, _, args, clk, en) =>
val simName = simNamespace.newTemp
simulations(simName) = q
(args :+ clk :+ en) map onExpr(WRef(simName))
case Block(stmts) => stmts.foreach(onStmt)
case ignore @ (_: IsInvalid | EmptyStmt) => // do nothing
case other => throw new Exception(s"Unexpected Statement $other")
}
onStmt(m.body)
m.ports.foreach { p =>
bidirGraph.addPairWithEdge("", p.name)
bidirGraph.addPairWithEdge(p.name, "")
}
bidirGraph
}
}
/**
* Splits a module into multiple modules by grouping its components via [[GroupAnnotation]]'s
* Tries to deduplicate the resulting circuit
*/
class GroupAndDedup extends Transform {
def inputForm: CircuitForm = MidForm
def outputForm: CircuitForm = MidForm
override def execute(state: CircuitState): CircuitState = {
val cs = new GroupComponents().execute(state)
val csx = new DedupModules().execute(cs)
csx
}
}
|