128 lines
3.3 KiB
Python
128 lines
3.3 KiB
Python
from migen.fhdl.structure import *
|
|
from migen.fhdl.structure import _Operator, _Slice, _Assign, _StatementList
|
|
|
|
class Namespace:
|
|
def __init__(self):
|
|
self.counts = {}
|
|
self.sigs = {}
|
|
|
|
def get_name(self, sig):
|
|
try:
|
|
n = self.sigs[sig]
|
|
if n:
|
|
return sig.name + "_" + str(n)
|
|
else:
|
|
return sig.name
|
|
except KeyError:
|
|
try:
|
|
n = self.counts[sig.name]
|
|
except KeyError:
|
|
n = 0
|
|
self.sigs[sig] = n
|
|
self.counts[sig.name] = n + 1
|
|
if n:
|
|
return sig.name + "_" + str(n)
|
|
else:
|
|
return sig.name
|
|
|
|
def list_signals(node):
|
|
if node is None:
|
|
return set()
|
|
elif isinstance(node, Constant):
|
|
return set()
|
|
elif isinstance(node, Signal):
|
|
return {node}
|
|
elif isinstance(node, _Operator):
|
|
l = list(map(list_signals, node.operands))
|
|
return set().union(*l)
|
|
elif isinstance(node, _Slice):
|
|
return list_signals(node.value)
|
|
elif isinstance(node, Cat):
|
|
l = list(map(list_signals, node.l))
|
|
return set().union(*l)
|
|
elif isinstance(node, Replicate):
|
|
return list_signals(node.v)
|
|
elif isinstance(node, _Assign):
|
|
return list_signals(node.l) | list_signals(node.r)
|
|
elif isinstance(node, _StatementList):
|
|
l = list(map(list_signals, node.l))
|
|
return set().union(*l)
|
|
elif isinstance(node, If):
|
|
return list_signals(node.cond) | list_signals(node.t) | list_signals(node.f)
|
|
elif isinstance(node, Case):
|
|
l = list(map(lambda x: list_signals(x[1]), node.cases))
|
|
return list_signals(node.test).union(*l).union(list_signals(node.default))
|
|
elif isinstance(node, Fragment):
|
|
return list_signals(node.comb) | list_signals(node.sync)
|
|
else:
|
|
raise TypeError
|
|
|
|
def list_targets(node):
|
|
if node is None:
|
|
return set()
|
|
elif isinstance(node, Signal):
|
|
return {node}
|
|
elif isinstance(node, _Slice):
|
|
return list_targets(node.value)
|
|
elif isinstance(node, Cat):
|
|
l = list(map(list_targets, node.l))
|
|
return set().union(*l)
|
|
elif isinstance(node, _Assign):
|
|
return list_targets(node.l)
|
|
elif isinstance(node, _StatementList):
|
|
l = list(map(list_targets, node.l))
|
|
return set().union(*l)
|
|
elif isinstance(node, If):
|
|
return list_targets(node.t) | list_targets(node.f)
|
|
elif isinstance(node, Case):
|
|
l = list(map(lambda x: list_targets(x[1]), node.cases))
|
|
return list_targets(node.default).union(*l)
|
|
elif isinstance(node, Fragment):
|
|
return list_targets(node.comb) | list_targets(node.sync)
|
|
else:
|
|
raise TypeError
|
|
|
|
def group_by_targets(sl):
|
|
groups = []
|
|
for statement in sl.l:
|
|
targets = list_targets(statement)
|
|
processed = False
|
|
for g in groups:
|
|
if not targets.isdisjoint(g[0]):
|
|
g[0].update(targets)
|
|
g[1].append(statement)
|
|
processed = True
|
|
break
|
|
if not processed:
|
|
groups.append((targets, [statement]))
|
|
return groups
|
|
|
|
def list_inst_outs(i):
|
|
if isinstance(i, Fragment):
|
|
return list_inst_outs(i.instances)
|
|
else:
|
|
l = []
|
|
for x in i:
|
|
l += list(map(lambda x: x[1], list(x.outs.items())))
|
|
return set(l)
|
|
|
|
def is_variable(node):
|
|
if isinstance(node, Signal):
|
|
return node.variable
|
|
elif isinstance(node, _Slice):
|
|
return is_variable(node.value)
|
|
elif isinstance(node, Cat):
|
|
arevars = list(map(is_variable, node.l))
|
|
r = arevars[0]
|
|
for x in arevars:
|
|
if x != r:
|
|
raise TypeError
|
|
return r
|
|
else:
|
|
raise TypeError
|
|
|
|
def insert_reset(rst, sl):
|
|
targets = list_targets(sl)
|
|
resetcode = [t.eq(t.reset) for t in targets]
|
|
return If(rst, *resetcode).Else(*sl.l)
|