def _analyzeGens(top, absnames): genlist = [] for g in top: if isinstance(g, _UserCode): tree = g elif isinstance(g, (_AlwaysComb, _AlwaysSeq, _Always)): f = g.func tree = _makeAST(f) tree.symdict = f.__globals__.copy() tree.callstack = [] # handle free variables tree.nonlocaldict = {} if f.__code__.co_freevars: for n, c in zip(f.__code__.co_freevars, f.__closure__): obj = _cell_deref(c) tree.symdict[n] = obj # currently, only intbv as automatic nonlocals (until Python 3.0) if isinstance(obj, intbv): tree.nonlocaldict[n] = obj tree.name = absnames.get(id(g), str(_Label("BLOCK"))).upper() v = _AttrRefTransformer(tree) v.visit(tree) v = _FirstPassVisitor(tree) v.visit(tree) if isinstance(g, _AlwaysComb): v = _AnalyzeAlwaysCombVisitor(tree, g.senslist) elif isinstance(g, _AlwaysSeq): v = _AnalyzeAlwaysSeqVisitor(tree, g.senslist, g.reset, g.sigregs, g.varregs) else: v = _AnalyzeAlwaysDecoVisitor(tree, g.senslist) v.visit(tree) else: # @instance f = g.gen.gi_frame tree = _makeAST(f) tree.symdict = f.f_globals.copy() tree.symdict.update(f.f_locals) tree.nonlocaldict = {} tree.callstack = [] tree.name = absnames.get(id(g), str(_Label("BLOCK"))).upper() v = _AttrRefTransformer(tree) v.visit(tree) v = _FirstPassVisitor(tree) v.visit(tree) v = _AnalyzeBlockVisitor(tree) v.visit(tree) genlist.append(tree) return genlist
def _analyzeTopFunc(func, *args, **kwargs): tree = _makeAST(func) v = _AnalyzeTopFuncVisitor(func, tree, *args, **kwargs) v.visit(tree) objs = [] for name, obj in v.fullargdict.items(): if not isinstance(obj, _Signal): objs.append((name, obj)) # create ports for any signal in the top instance if it was buried in an # object passed as in argument # TODO: This will not work for nested objects in the top level for name, obj in objs: if not hasattr(obj, '__dict__'): continue for attr, attrobj in vars(obj).items(): if isinstance(attrobj, _Signal): signame = attrobj._name if not signame: signame = name + '_' + attr attrobj._name = signame v.argdict[signame] = attrobj v.argnames.append(signame) return v
def _resolveRefs(symdict, arg): gens = _flatten(arg) data = Data() data.symdict = symdict v = _AttrRefTransformer(data) for gen in gens: func = _genfunc(gen) tree = _makeAST(func) v.visit(tree) return data.objlist
def _analyzeTopFunc(func, *args, **kwargs): tree = _makeAST(func) v = _AnalyzeTopFuncVisitor(func, tree, *args, **kwargs) v.visit(tree) objs = [] for name, obj in v.fullargdict.items(): if not isinstance(obj, _Signal): objs.append((name, obj)) # create ports for any signal in the top instance if it was buried in an # object passed as in argument # now expand the interface objects for name, obj in objs: if hasattr(obj, '__dict__'): # must be an interface object (probably ...?) expandinterface(v, name, obj) return v
def visit_Call(self, node): self.visit(node.func) f = self.getObj(node.func) node.obj = None if f is print: self.visit_Print(node) return self.access = _access.UNKNOWN for arg in node.args: self.visit(arg) for kw in node.keywords: self.visit(kw) self.access = _access.INPUT argsAreInputs = True if type(f) is type and issubclass(f, intbv): node.obj = self.getVal(node) elif f is concat: node.obj = self.getVal(node) elif f is len: self.access = _access.UNKNOWN node.obj = int(0) # XXX elif f is bool: node.obj = bool() elif f in _flatten(integer_types): node.obj = int(-1) # elif f in (posedge , negedge): ## node.obj = _EdgeDetector() elif f is ord: node.obj = int(-1) if not (isinstance(node.args[0], ast.Str) and (len(node.args[0].s) == 1)): self.raiseError(node, _error.NotSupported, "ord: expect string argument with length 1") elif f is delay: node.obj = delay(0) # suprize: identity comparison on unbound methods doesn't work in python 2.5?? elif f == intbv.signed: obj = node.func.value.obj if len(obj): M = 2 ** (len(obj) - 1) node.obj = intbv(-1, min=-M, max=M) else: node.obj = intbv(-1) elif f in myhdlObjects: pass elif f in builtinObjects: pass elif type(f) is FunctionType: argsAreInputs = False tree = _makeAST(f) fname = f.__name__ tree.name = _Label(fname) tree.symdict = f.__globals__.copy() tree.nonlocaldict = {} if fname in self.tree.callstack: self.raiseError(node, _error.NotSupported, "Recursive call") tree.callstack = self.tree.callstack[:] tree.callstack.append(fname) # handle free variables if f.__code__.co_freevars: for n, c in zip(f.__code__.co_freevars, f.__closure__): obj = c.cell_contents if not isinstance(obj, (integer_types, _Signal)): self.raiseError(node, _error.FreeVarTypeError, n) tree.symdict[n] = obj v = _FirstPassVisitor(tree) v.visit(tree) v = _AnalyzeFuncVisitor(tree, node.args, node.keywords) v.visit(tree) node.obj = tree.returnObj node.tree = tree tree.argnames = argnames = _get_argnames(tree.body[0]) # extend argument list with keyword arguments on the correct position node.args.extend([None] * len(node.keywords)) for kw in node.keywords: node.args[argnames.index(kw.arg)] = kw.value for n, arg in zip(argnames, node.args): if n in tree.outputs: self.access = _access.OUTPUT self.visit(arg) self.access = _access.INPUT if n in tree.inputs: self.visit(arg) elif type(f) is MethodType: self.raiseError(node, _error.NotSupported, "method call: '%s'" % f.__name__) else: debug_info = [e for e in ast.iter_fields(node.func)] raise AssertionError("Unexpected callable %s" % str(debug_info)) if argsAreInputs: for arg in node.args: self.visit(arg)
def visit_Call(self, node): self.visit(node.func) f = self.getObj(node.func) node.obj = None if f is print: self.visit_Print(node) return self.access = _access.UNKNOWN for arg in node.args: self.visit(arg) for kw in node.keywords: self.visit(kw) self.access = _access.INPUT argsAreInputs = True if type(f) is type and issubclass(f, intbv): node.obj = self.getVal(node) elif f is concat: node.obj = self.getVal(node) elif f is len: self.access = _access.UNKNOWN node.obj = int(0) # XXX elif f is bool: node.obj = bool() elif f in _flatten(integer_types): node.obj = int(-1) # elif f in (posedge , negedge): # # node.obj = _EdgeDetector() elif f is ord: node.obj = int(-1) if not (isinstance(node.args[0], ast.Str) and (len(node.args[0].s) == 1)): self.raiseError(node, _error.NotSupported, "ord: expect string argument with length 1") elif f is delay: node.obj = delay(0) # suprize: identity comparison on unbound methods doesn't work in python 2.5?? elif f == intbv.signed: obj = node.func.value.obj if len(obj): M = 2**(len(obj) - 1) node.obj = intbv(-1, min=-M, max=M) else: node.obj = intbv(-1) elif f in myhdlObjects: pass elif f in builtinObjects: pass elif type(f) is FunctionType: argsAreInputs = False tree = _makeAST(f) fname = f.__name__ tree.name = _Label(fname) tree.symdict = f.__globals__.copy() tree.nonlocaldict = {} if fname in self.tree.callstack: self.raiseError(node, _error.NotSupported, "Recursive call") tree.callstack = self.tree.callstack[:] tree.callstack.append(fname) # handle free variables if f.__code__.co_freevars: for n, c in zip(f.__code__.co_freevars, f.__closure__): obj = c.cell_contents if not isinstance(obj, (integer_types, _Signal)): self.raiseError(node, _error.FreeVarTypeError, n) tree.symdict[n] = obj v = _FirstPassVisitor(tree) v.visit(tree) v = _AnalyzeFuncVisitor(tree, node.args, node.keywords) v.visit(tree) node.obj = tree.returnObj node.tree = tree tree.argnames = argnames = _get_argnames(tree.body[0]) # extend argument list with keyword arguments on the correct position node.args.extend([None] * len(node.keywords)) for kw in node.keywords: node.args[argnames.index(kw.arg)] = kw.value for n, arg in zip(argnames, node.args): if n in tree.outputs: self.access = _access.OUTPUT self.visit(arg) self.access = _access.INPUT if n in tree.inputs: self.visit(arg) elif type(f) is MethodType: self.raiseError(node, _error.NotSupported, "method call: '%s'" % f.__name__) else: debug_info = [e for e in ast.iter_fields(node.func)] raise AssertionError("Unexpected callable %s" % str(debug_info)) if argsAreInputs: for arg in node.args: self.visit(arg)
def ast(self): return _makeAST(self.func)
def ast(self): return _makeAST(self.funcobj)
def ast(self): return _makeAST(self.gen.gi_frame)