mirror of
https://github.com/myhdl/myhdl.git
synced 2025-01-24 21:52:56 +08:00
636bc815c6
--HG-- branch : 0.8-dev
253 lines
7.4 KiB
Python
253 lines
7.4 KiB
Python
# This file is part of the myhdl library, a Python package for using
|
|
# Python as a Hardware Description Language.
|
|
#
|
|
# Copyright (C) 2003-2012 Jan Decaluwe
|
|
#
|
|
# The myhdl library is free software; you can redistribute it and/or
|
|
# modify it under the terms of the GNU Lesser General Public License as
|
|
# published by the Free Software Foundation; either version 2.1 of the
|
|
# License, or (at your option) any later version.
|
|
#
|
|
# This library is distributed in the hope that it will be useful, but
|
|
# WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
# Lesser General Public License for more details.
|
|
|
|
# You should have received a copy of the GNU Lesser General Public
|
|
# License along with this library; if not, write to the Free Software
|
|
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
""" Module with the always_seq decorator. """
|
|
|
|
|
|
import sys
|
|
import inspect
|
|
from types import FunctionType
|
|
import ast
|
|
|
|
from myhdl import AlwaysError
|
|
from myhdl._util import _isGenFunc, _dedent
|
|
from myhdl._cell_deref import _cell_deref
|
|
from myhdl._delay import delay
|
|
from myhdl._Signal import _Signal, _WaiterList,_isListOfSigs
|
|
from myhdl._Waiter import _Waiter, _EdgeWaiter, _EdgeTupleWaiter
|
|
from myhdl._instance import _Instantiator
|
|
|
|
# evacuate this later
|
|
AlwaysSeqError = AlwaysError
|
|
|
|
class _error:
|
|
pass
|
|
_error.EdgeType = "first argument should be an edge"
|
|
_error.ResetType = "reset argument should be a signal"
|
|
_error.ArgType = "decorated object should be a classic (non-generator) function"
|
|
_error.NrOfArgs = "decorated function should not have arguments"
|
|
_error.SigAugAssign = "signal assignment does not support augmented assignment"
|
|
_error.EmbeddedFunction = "embedded functions in always_seq function not supported"
|
|
|
|
class ResetSignal(_Signal):
|
|
def __init__(self, val, active, async):
|
|
""" Construct a ResetSignal.
|
|
|
|
This is to be used in conjunction with the always_seq decorator,
|
|
as the reset argument.
|
|
"""
|
|
_Signal.__init__(self, bool(val))
|
|
self.active = bool(active)
|
|
self.async = async
|
|
|
|
|
|
|
|
def always_seq(edge, reset):
|
|
if not isinstance(edge, _WaiterList):
|
|
raise AlwaysSeqError(_error.EdgeType)
|
|
edge.sig._read = True
|
|
edge.sig._used = True
|
|
if reset is not None:
|
|
if not isinstance(reset, ResetSignal):
|
|
raise AlwaysSeqError(_error.ResetType)
|
|
reset._read = True
|
|
reset._used = True
|
|
|
|
def _always_seq_decorator(func):
|
|
if not isinstance(func, FunctionType):
|
|
raise AlwaysSeqError(_error.ArgType)
|
|
if _isGenFunc(func):
|
|
raise AlwaysSeqError(_error.ArgType)
|
|
if func.func_code.co_argcount > 0:
|
|
raise AlwaysSeqError(_error.NrOfArgs)
|
|
return _AlwaysSeq(func, edge, reset)
|
|
return _always_seq_decorator
|
|
|
|
|
|
class _AlwaysSeq(_Instantiator):
|
|
|
|
def __init__(self, func, edge, reset):
|
|
self.func = func
|
|
self.senslist = senslist = [edge]
|
|
self.reset = reset
|
|
if reset is not None:
|
|
active = self.reset.active
|
|
async = self.reset.async
|
|
if async:
|
|
if active:
|
|
senslist.append(reset.posedge)
|
|
else:
|
|
senslist.append(reset.negedge)
|
|
self.gen = self.genfunc()
|
|
else:
|
|
self.gen = self.genfunc_no_reset()
|
|
if len(self.senslist) == 1:
|
|
W = _EdgeWaiter
|
|
else:
|
|
W = _EdgeTupleWaiter
|
|
self.waiter = W(self.gen)
|
|
|
|
# find symdict
|
|
# similar to always_comb, but in class constructor
|
|
varnames = func.func_code.co_varnames
|
|
symdict = {}
|
|
for n, v in func.func_globals.items():
|
|
if n not in varnames:
|
|
symdict[n] = v
|
|
# handle free variables
|
|
if func.func_code.co_freevars:
|
|
for n, c in zip(func.func_code.co_freevars, func.func_closure):
|
|
try:
|
|
obj = _cell_deref(c)
|
|
symdict[n] = obj
|
|
except NameError:
|
|
raise NameError(n)
|
|
self.symdict = symdict
|
|
|
|
# now infer outputs to be reset
|
|
s = inspect.getsource(func)
|
|
s = _dedent(s)
|
|
tree = ast.parse(s)
|
|
# print ast.dump(tree)
|
|
v = _SigNameVisitor(symdict)
|
|
v.visit(tree)
|
|
regs = self.regs = []
|
|
for n in v.outputs:
|
|
s = self.symdict[n]
|
|
if isinstance(s, _Signal):
|
|
regs.append(s)
|
|
else:
|
|
assert _isListOfSigs(s)
|
|
for e in s:
|
|
regs.append(e)
|
|
|
|
|
|
|
|
def reset_sigs(self):
|
|
for s in self.regs:
|
|
s.next = s._init
|
|
|
|
def genfunc(self):
|
|
senslist = self.senslist
|
|
if len(senslist) == 1:
|
|
senslist = senslist[0]
|
|
reset_sigs = self.reset_sigs
|
|
func = self.func
|
|
while 1:
|
|
yield senslist
|
|
if self.reset == self.reset.active:
|
|
reset_sigs()
|
|
else:
|
|
func()
|
|
|
|
def genfunc_no_reset(self):
|
|
senslist = self.senslist
|
|
assert len(senslist) == 1
|
|
func = self.func
|
|
while 1:
|
|
yield senslist
|
|
func()
|
|
|
|
|
|
|
|
|
|
# similar to always_comb, calls for refactoring
|
|
# note: make a difference between augmented assign and inout signals
|
|
|
|
INPUT, OUTPUT, INOUT = range(3)
|
|
|
|
class _SigNameVisitor(ast.NodeVisitor):
|
|
def __init__(self, symdict):
|
|
self.inputs = set()
|
|
self.outputs = set()
|
|
self.toplevel = 1
|
|
self.symdict = symdict
|
|
self.context = INPUT
|
|
|
|
def visit_Module(self, node):
|
|
|
|
for n in node.body:
|
|
self.visit(n)
|
|
|
|
def visit_FunctionDef(self, node):
|
|
if self.toplevel:
|
|
self.toplevel = 0 # skip embedded functions
|
|
for n in node.body:
|
|
self.visit(n)
|
|
else:
|
|
raise AlwaysSeqError(_error.EmbeddedFunction)
|
|
|
|
def visit_If(self, node):
|
|
if not node.orelse:
|
|
if isinstance(node.test, ast.Name) and \
|
|
node.test.id == '__debug__':
|
|
return # skip
|
|
self.generic_visit(node)
|
|
|
|
def visit_Name(self, node):
|
|
id = node.id
|
|
if id not in self.symdict:
|
|
return
|
|
s = self.symdict[id]
|
|
if isinstance(s, _Signal) or _isListOfSigs(s):
|
|
if self.context == INPUT:
|
|
self.inputs.add(id)
|
|
elif self.context == OUTPUT:
|
|
self.outputs.add(id)
|
|
elif self.context == INOUT:
|
|
raise AlwaysSeqError(_error.SigAugAssign % id)
|
|
else:
|
|
raise AssertionError("bug in always_seq")
|
|
|
|
def visit_Assign(self, node):
|
|
self.context = OUTPUT
|
|
for n in node.targets:
|
|
self.visit(n)
|
|
self.context = INPUT
|
|
self.visit(node.value)
|
|
|
|
def visit_Attribute(self, node):
|
|
self.visit(node.value)
|
|
|
|
def visit_Subscript(self, node, access=INPUT):
|
|
self.visit(node.value)
|
|
self.context = INPUT
|
|
self.visit(node.slice)
|
|
|
|
def visit_AugAssign(self, node, access=INPUT):
|
|
self.context = INOUT
|
|
self.visit(node.target)
|
|
self.context = INPUT
|
|
self.visit(node.value)
|
|
|
|
def visit_ClassDef(self, node):
|
|
pass # skip
|
|
|
|
def visit_Exec(self, node):
|
|
pass # skip
|
|
|
|
def visit_Print(self, node):
|
|
pass # skip
|
|
|
|
|
|
|
|
|
|
|
|
|