B CrX[o)ã@s@ddlZddlmZGdd„deƒZGdd„deƒZdZdZdS) éN)ÚTemplatec@s(eZdZd dd„Zd dd„Zdd„ZdS) ÚASTCodeGeneratorú _c_ast.cfgcCs ||_dd„| |¡Dƒ|_dS)zN Initialize the code generator from a configuration file. cSsg|]\}}t||ƒ‘qS©)ÚNodeCfg)Ú.0ÚnameÚcontentsrrú1lib/python3.7/site-packages/pycparser/_ast_gen.pyú sz-ASTCodeGenerator.__init__..N)Ú cfg_filenameÚ parse_cfgfileÚnode_cfg)Úselfr rrr Ú__init__szASTCodeGenerator.__init__NcCsHttƒj|jd}|t7}x|jD]}|| ¡d7}q"W| |¡dS)z< Generates the code into file, an open file buffer. )r z N)rÚ_PROLOGUE_COMMENTZ substituter Ú_PROLOGUE_CODErÚgenerate_sourceÚwrite)rÚfileÚsrcrrrr Úgenerates   zASTCodeGenerator.generatec csÈt|dƒ´}x¬|D]¤}| ¡}|r| d¡r.q| d¡}| d¡}| d¡}|dksd||ksd||krttd||fƒ‚|d|…}||d|…}|r¨d d „| d ¡Dƒng} || fVqWWdQRXdS) ze Parse the configuration file and yield pairs of (name, contents) for each node. Úrú#ú:ú[ú]ézInvalid line in %s: %s NcSsg|] }| ¡‘qSr)Ústrip)rÚvrrr r 7sz2ASTCodeGenerator.parse_cfgfile..ú,)ÚopenrÚ startswithÚfindÚ RuntimeErrorÚsplit) rÚfilenameÚfÚlineZcolon_iZ lbracket_iZ rbracket_irÚvalZvallistrrr r &s      zASTCodeGenerator.parse_cfgfile)r)N)Ú__name__Ú __module__Ú __qualname__rrr rrrr rs  rc@s@eZdZdZdd„Zdd„Zdd„Zdd „Zd d „Zd d „Z dS)rzº Node configuration. name: node name contents: a list of contents - attributes and child nodes See comment at the top of the configuration file for details. cCs‚||_g|_g|_g|_g|_x^|D]V}| d¡}|j |¡| d¡rV|j |¡q$| d¡rn|j |¡q$|j |¡q$WdS)NÚ*z**)rÚ all_entriesÚattrÚchildÚ seq_childÚrstripÚappendÚendswith)rrr ÚentryZ clean_entryrrr rCs     zNodeCfg.__init__cCs<| ¡}|d| ¡7}|d| ¡7}|d| ¡7}|S)NÚ )Ú _gen_initÚ _gen_childrenÚ _gen_iterÚ_gen_attr_names)rrrrr rUs zNodeCfg.generate_sourcecCsŽd|j}|jrDd |j¡}d dd„|jDƒ¡}|d7}d|}nd}d}|d |7}|d |7}x$|jd gD]}|d ||f7}qrW|S) Nzclass %s(Node): z, css|]}d |¡VqdS)z'{0}'N)Úformat)rÚerrr ú bsz$NodeCfg._gen_init..z, 'coord', '__weakref__'z(self, %s, coord=None)z'coord', '__weakref__'z(self, coord=None)z __slots__ = (%s) z def __init__%s: Zcoordz self.%s = %s )rr.Újoin)rrÚargsÚslotsZarglistrrrr r7]s     zNodeCfg._gen_initcCsld}|jr`|d7}x |jD]}|dt|d7}qWx |jD]}|dt|d7}q.ú))r>r/)rrrrr r:¤szNodeCfg._gen_attr_namesN) r*r+r,Ú__doc__rrr7r8r9r:rrrr r;sra¾#----------------------------------------------------------------- # ** ATTENTION ** # This code was automatically generated from the file: # $cfg_filename # # Do not modify it directly. Modify the configuration file and # run the generator again. # ** ** *** ** ** # # pycparser: c_ast.py # # AST Node classes. # # Eli Bendersky [https://eli.thegreenplace.net/] # License: BSD #----------------------------------------------------------------- aX import sys def _repr(obj): """ Get the representation of an object, with dedicated pprint-like format for lists. """ if isinstance(obj, list): return '[' + (',\n '.join((_repr(e).replace('\n', '\n ') for e in obj))) + '\n]' else: return repr(obj) class Node(object): __slots__ = () """ Abstract base class for AST nodes. """ def __repr__(self): """ Generates a python representation of the current node """ result = self.__class__.__name__ + '(' indent = '' separator = '' for name in self.__slots__[:-2]: result += separator result += indent result += name + '=' + (_repr(getattr(self, name)).replace('\n', '\n ' + (' ' * (len(name) + len(self.__class__.__name__))))) separator = ',' indent = '\n ' + (' ' * len(self.__class__.__name__)) result += indent + ')' return result def children(self): """ A sequence of all children that are Nodes """ pass def show(self, buf=sys.stdout, offset=0, attrnames=False, nodenames=False, showcoord=False, _my_node_name=None): """ Pretty print the Node and all its attributes and children (recursively) to a buffer. buf: Open IO buffer into which the Node is printed. offset: Initial offset (amount of leading spaces) attrnames: True if you want to see the attribute names in name=value pairs. False to only see the values. nodenames: True if you want to see the actual node names within their parents. showcoord: Do you want the coordinates of each Node to be displayed. """ lead = ' ' * offset if nodenames and _my_node_name is not None: buf.write(lead + self.__class__.__name__+ ' <' + _my_node_name + '>: ') else: buf.write(lead + self.__class__.__name__+ ': ') if self.attr_names: if attrnames: nvlist = [(n, getattr(self,n)) for n in self.attr_names] attrstr = ', '.join('%s=%s' % nv for nv in nvlist) else: vlist = [getattr(self, n) for n in self.attr_names] attrstr = ', '.join('%s' % v for v in vlist) buf.write(attrstr) if showcoord: buf.write(' (at %s)' % self.coord) buf.write('\n') for (child_name, child) in self.children(): child.show( buf, offset=offset + 2, attrnames=attrnames, nodenames=nodenames, showcoord=showcoord, _my_node_name=child_name) class NodeVisitor(object): """ A base NodeVisitor class for visiting c_ast nodes. Subclass it and define your own visit_XXX methods, where XXX is the class name you want to visit with these methods. For example: class ConstantVisitor(NodeVisitor): def __init__(self): self.values = [] def visit_Constant(self, node): self.values.append(node.value) Creates a list of values of all the constant nodes encountered below the given node. To use it: cv = ConstantVisitor() cv.visit(node) Notes: * generic_visit() will be called for AST nodes for which no visit_XXX method was defined. * The children of nodes for which a visit_XXX was defined will not be visited - if you need this, call generic_visit() on the node. You can use: NodeVisitor.generic_visit(self, node) * Modeled after Python's own AST visiting facilities (the ast module of Python 3.0) """ _method_cache = None def visit(self, node): """ Visit a node. """ if self._method_cache is None: self._method_cache = {} visitor = self._method_cache.get(node.__class__.__name__, None) if visitor is None: method = 'visit_' + node.__class__.__name__ visitor = getattr(self, method, self.generic_visit) self._method_cache[node.__class__.__name__] = visitor return visitor(node) def generic_visit(self, node): """ Called if no explicit visitor function exists for a node. Implements preorder visiting of the node. """ for c in node: self.visit(c) )ZpprintÚstringrÚobjectrrrrrrrr Ú s *