HEX

File: //usr/local/CyberCP/lib64/python3.10/site-packages/pycparser/__pycache__/_ast_gen.cpython-310.pyc
o

�h;)�@s8ddlmZGdd�de�ZGdd�de�ZdZdZdS)	�)�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�E/usr/local/CyberCP/lib/python3.10/site-packages/pycparser/_ast_gen.py�
<listcomp>s�z-ASTCodeGenerator.__init__.<locals>.<listcomp>N)�cfg_filename�
parse_cfgfile�node_cfg)�selfrrrr
�__init__s�zASTCodeGenerator.__init__NcCsDtt�j|jd�}|t7}|jD]
}||��d7}q|�|�dS)z< Generates the code into file, an open file buffer.
        )rz

N)r�_PROLOGUE_COMMENT�
substituter�_PROLOGUE_CODEr�generate_source�write)r�file�srcrrrr
�generates�
zASTCodeGenerator.generatec
cs��t|d��^}|D]R}|��}|r|�d�rq	|�d�}|�d�}|�d�}|dks2||ks2||kr:td||f��|d|�}||d|�}|rTd	d
�|�d�D�ng}	||	fVq	Wd�dS1sgwYdS)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
r6sz2ASTCodeGenerator.parse_cfgfile.<locals>.<listcomp>�,)�openr�
startswith�find�RuntimeError�split)
r�filename�f�line�colon_i�
lbracket_i�
rbracket_ir�val�vallistrrr
r
%s"�


�"�zASTCodeGenerator.parse_cfgfile)r)N)�__name__�
__module__�__qualname__rrr
rrrr
rs

rc@s@eZdZdZdd�Zdd�Zdd�Zdd	�Zd
d�Zdd
�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|_|D]+}|�d�}|j�|�|�d�r*|j�|�q|�d�r6|j�|�q|j�|�qdS)N�*z**)r�all_entries�attr�child�	seq_child�rstrip�append�endswith)rrr	�entry�clean_entryrrr
rBs


�zNodeCfg.__init__cCs<|��}|d|��7}|d|��7}|d|��7}|S)N�
)�	_gen_init�
_gen_children�	_gen_iter�_gen_attr_names�rrrrr
rTs
zNodeCfg.generate_sourcecCs�d|j}|jr"d�|j�}d�dd�|jD��}|d7}d|}nd}d}|d	|7}|d
|7}|jdgD]
}|d||f7}q8|S)
Nzclass %s(Node):
z, css�|]}d�|�VqdS)z'{0}'N)�format)r�errr
�	<genexpr>`s�z$NodeCfg._gen_init.<locals>.<genexpr>z, 'coord', '__weakref__'z(self, %s, coord=None)z'coord', '__weakref__'z(self, coord=None)z    __slots__ = (%s)
z    def __init__%s:
�coordz        self.%s = %s
)rr3�join)rr�args�slots�arglistrrrr
r=[s

zNodeCfg._gen_initcCsfd}|jr-|d7}|jD]}|dt|d�7}q|jD]}|dt|d�7}q|d7}|S|d7}|S)Nz    def children(self):
z        nodelist = []
zV        if self.%(child)s is not None: nodelist.append(("%(child)s", self.%(child)s))
�r5zu        for i, child in enumerate(self.%(child)s or []):
            nodelist.append(("%(child)s[%%d]" %% i, child))
z        return tuple(nodelist)
z        return ()
�r3r5�dictr6�rrr5r6rrr
r>os"
�
��zNodeCfg._gen_childrencCsjd}|jr/|jD]}|dt|d�7}q|jD]}|dt|d�7}q|js-|js-|d7}|S|d7}|S)Nz    def __iter__(self):
zH        if self.%(child)s is not None:
            yield self.%(child)s
rJzE        for child in (self.%(child)s or []):
            yield child
z        return
        yield
rKrMrrr
r?�s*
�
��	��zNodeCfg._gen_itercCs"dd�dd�|jD��d}|S)Nz    attr_names = (�css�|]}d|VqdS)z%r, Nr)r�nmrrr
rD�s�z*NodeCfg._gen_attr_names.<locals>.<genexpr>�))rFr4rArrr
r@�szNodeCfg._gen_attr_namesN)
r/r0r1�__doc__rrr=r>r?r@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
#-----------------------------------------------------------------

a3
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)

N)�stringr�objectrrrrrrrr
�<module>s*n�