File: //opt/alt/python38/lib/python3.8/site-packages/pycparser/__pycache__/c_generator.cpython-38.pyc
U
ӗ_5 � @ s d dl mZ G dd� de�ZdS )� )�c_astc @ s� e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zdd� Zd d � Zdld d �Zd!d"� Zd#d$� Zd%d&� Zd'd(� Zd)d*� Zd+d,� Zd-d.� Zd/d0� Zd1d2� Zd3d4� Z d5d6� Z d7d8� Z d9d:� Z d;d<� Z d=d>� Z!d?d@� Z"dAdB� Z#dCdD� Z$dEdF� Z%dGdH� Z&dIdJ� Z'dKdL� Z(dMdN� Z)dOdP� Z*dQdR� Z+dSdT� Z,dUdV� Z-dWdX� Z.dYdZ� Z/d[d\� Z0d]d^� Z1dmd_d`�Z2dadb� Z3g fdcdd�Z4dedf� Z5dgdh� Z6didj� Z7dkS )n�
CGeneratorz� Uses the same visitor pattern as c_ast.NodeVisitor, but modified to
return a value from each visit method, using string accumulation in
generic_visit.
c C s
d| _ d S )N� �� indent_level��self� r �F/opt/alt/python38/lib/python3.8/site-packages/pycparser/c_generator.py�__init__ s zCGenerator.__init__c C s
d| j S �N� r r r r r
� _make_indent s zCGenerator._make_indentc C s d|j j }t| || j�|�S )NZvisit_)� __class__�__name__�getattr�
generic_visit)r �node�methodr r r
�visit s zCGenerator.visitc s, |d kr dS d� � fdd�|�� D ��S d S )N� c 3 s | ]\}}� � |�V qd S �N�r )�.0Zc_name�cr r r
� <genexpr># s z+CGenerator.generic_visit.<locals>.<genexpr>)�join�children)r r r r r
r s zCGenerator.generic_visitc C s |j S r )�value�r �nr r r
�visit_Constant% s zCGenerator.visit_Constantc C s |j S r ��namer r r r
�visit_ID( s zCGenerator.visit_IDc C s$ | � |j�}|d | �|j� d S )N�[�])�_parenthesize_unless_simpler# r Z subscript)r r Zarrrefr r r
�visit_ArrayRef+ s zCGenerator.visit_ArrayRefc C s" | � |j�}||j | �|j� S r )r' r# �typer �field)r r Zsrefr r r
�visit_StructRef/ s zCGenerator.visit_StructRefc C s$ | � |j�}|d | �|j� d S )N�(�))r' r# r �args)r r Zfrefr r r
�visit_FuncCall3 s zCGenerator.visit_FuncCallc C s\ | � |j�}|jdkr d| S |jdkr0d| S |jdkrJd| �|j� S d|j|f S d S )Nzp++z%s++zp--z%s--�sizeofz
sizeof(%s)z%s%s)r' �expr�opr )r r Zoperandr r r
�
visit_UnaryOp7 s
zCGenerator.visit_UnaryOpc s< � � |j� fdd��}� � |j� fdd��}d||j|f S )Nc s � � | � S r ��_is_simple_node��dr r r
�<lambda>F � z+CGenerator.visit_BinaryOp.<locals>.<lambda>c s � � | � S r r4 r6 r r r
r8 H r9 �%s %s %s)�_parenthesize_if�left�rightr2 )r r Zlval_str�rval_strr r r
�visit_BinaryOpD s
�
�zCGenerator.visit_BinaryOpc C s* | � |jdd� �}d| �|j�|j|f S )Nc S s t | tj�S r )�
isinstancer �
Assignment)r r r r
r8 N r9 z-CGenerator.visit_Assignment.<locals>.<lambda>r: )r; Zrvaluer Zlvaluer2 )r r r> r r r
�visit_AssignmentK s
�zCGenerator.visit_Assignmentc C s d� |j�S r )r �namesr r r r
�visit_IdentifierTypeQ s z CGenerator.visit_IdentifierTypec C sJ t |tj�r d| �|� d S t |tj�r<d| �|� d S | �|�S d S )N�{�}r, r- )r@ r ZInitListr �ExprListr r r r
� _visit_exprT s
zCGenerator._visit_exprFc C sL |r
|j n| �|�}|jr.|d| �|j� 7 }|jrH|d| �|j� 7 }|S )N� : � = )r# �_generate_declZbitsizer �initrH )r r �no_type�sr r r
�
visit_Decl\ s zCGenerator.visit_Declc sL � � |jd �}t|j�dkrH|dd�� fdd�|jdd � D �� 7 }|S )Nr r �, c 3 s | ]}� j |d d�V qdS )T)rM N)rO )r �declr r r
r i s �z,CGenerator.visit_DeclList.<locals>.<genexpr>)r �decls�lenr �r r rN r r r
�visit_DeclListf s � zCGenerator.visit_DeclListc C s2 d}|j r |d�|j �d 7 }|| �|j�7 }|S )Nr r
)�storager �_generate_typer) rT r r r
�
visit_Typedefm s
zCGenerator.visit_Typedefc C s( d| � |j� d }|d | �|j� S )Nr, r- r
)rW Zto_typer' r1 rT r r r
�
visit_Casts s zCGenerator.visit_Castc C s* g }|j D ]}|�| �|�� q
d�|�S �NrP ��exprs�appendrH r �r r Zvisited_subexprsr1 r r r
�visit_ExprListw s
zCGenerator.visit_ExprListc C s* g }|j D ]}|�| �|�� q
d�|�S rZ r[ r^ r r r
�visit_InitList} s
zCGenerator.visit_InitListc C s� d}|j r|d|j 7 }|jr�|d7 }t|jj�D ]H\}}||j 7 }|jr^|d| �|j� 7 }|t|jj�d kr2|d7 }q2|d7 }|S )N�enumr
z {rJ r rP rF )r# �values� enumerateZ enumeratorsr r rS )r r rN �iZ
enumeratorr r r
�
visit_Enum� s
zCGenerator.visit_Enumc sj � � |j�}d� _� � |j�}|jrVd�� fdd�|jD ��}|d | d | d S |d | d S d S )Nr �;
c 3 s | ]}� � |�V qd S r r )r �pr r r
r � s z+CGenerator.visit_FuncDef.<locals>.<genexpr>�
)r rQ r �bodyZ param_declsr )r r rQ ri Zknrdeclsr r r
�
visit_FuncDef� s zCGenerator.visit_FuncDefc C sB d}|j D ]2}t|tj�r*|| �|�7 }q
|| �|�d 7 }q
|S )Nr rf )�extr@ r ZFuncDefr )r r rN rk r r r
�
visit_FileAST� s
zCGenerator.visit_FileASTc s` � � � d }� jd7 _|jr>|d�� fdd�|jD ��7 }� jd8 _|� � � d 7 }|S )N�{
� r c 3 s | ]}� � |�V qd S r )�_generate_stmt)r �stmtr r r
r � s z,CGenerator.visit_Compound.<locals>.<genexpr>z}
)r r Z block_itemsr rT r r r
�visit_Compound� s zCGenerator.visit_Compoundc C s dS )N�;r r r r r
�visit_EmptyStatement� s z CGenerator.visit_EmptyStatementc s d� � fdd�|jD ��S )NrP c 3 s | ]}� � |�V qd S r r )r �paramr r r
r � s z-CGenerator.visit_ParamList.<locals>.<genexpr>)r �paramsr r r r
�visit_ParamList� s zCGenerator.visit_ParamListc C s& d}|j r |d| �|j � 7 }|d S )N�returnr
rr )r1 r rT r r r
� visit_Return� s zCGenerator.visit_Returnc C s dS )Nzbreak;r r r r r
� visit_Break� s zCGenerator.visit_Breakc C s dS )Nz continue;r r r r r
�visit_Continue� s zCGenerator.visit_Continuec C s8 | � |j�d }|| � |j�d 7 }|| � |j�7 }|S )Nz ? rI )rH �cond�iftrue�iffalserT r r r
�visit_TernaryOp� s zCGenerator.visit_TernaryOpc C sd d}|j r|| �|j �7 }|d7 }|| j|jdd�7 }|jr`|| �� d 7 }|| j|jdd�7 }|S )Nzif (�)
T��
add_indentzelse
)r{ r ro r| r} r rT r r r
�visit_If� s zCGenerator.visit_Ifc C s~ d}|j r|| �|j �7 }|d7 }|jr<|d| �|j� 7 }|d7 }|jr^|d| �|j� 7 }|d7 }|| j|jdd�7 }|S )Nzfor (rr r
r Tr� )rL r r{ �nextro rp rT r r r
� visit_For� s zCGenerator.visit_Forc C s: d}|j r|| �|j �7 }|d7 }|| j|jdd�7 }|S )N�while (r Tr� )r{ r ro rp rT r r r
� visit_While� s zCGenerator.visit_Whilec C sJ d}|| j |jdd�7 }|| �� d 7 }|jr>|| �|j�7 }|d7 }|S )Nzdo
Tr� r� z);)ro rp r r{ r rT r r r
�
visit_DoWhile� s zCGenerator.visit_DoWhilec C s, d| � |j� d }|| j|jdd�7 }|S )Nzswitch (r Tr� )r r{ ro rp rT r r r
� visit_Switch� s zCGenerator.visit_Switchc C s6 d| � |j� d }|jD ]}|| j|dd�7 }q|S )Nzcase �:
Tr� )r r1 �stmtsro �r r rN rp r r r
�
visit_Case� s
zCGenerator.visit_Casec C s& d}|j D ]}|| j|dd�7 }q
|S )Nz default:
Tr� )r� ro r� r r r
�
visit_Default� s
zCGenerator.visit_Defaultc C s |j d | �|j� S )Nr� )r# ro rp r r r r
� visit_Label� s zCGenerator.visit_Labelc C s d|j d S )Nzgoto rr r" r r r r
�
visit_Goto� s zCGenerator.visit_Gotoc C s dS )Nz...r r r r r
�visit_EllipsisParam� s z CGenerator.visit_EllipsisParamc C s | � |d�S )N�struct��_generate_struct_unionr r r r
� visit_Struct s zCGenerator.visit_Structc C s | � |j�S r )rW r) r r r r
�visit_Typename s zCGenerator.visit_Typenamec C s | � |d�S )N�unionr� r r r r
� visit_Union s zCGenerator.visit_Unionc C sb d}|j D ]>}t|tj�r*|d|j 7 }q
t|tj�r
|d|j d 7 }q
|d| �|j� 7 }|S )Nr �.r% r& rJ )r# r@ r �ID�Constantr r r1 )r r rN r# r r r
�visit_NamedInitializer s
z!CGenerator.visit_NamedInitializerc C s
| � |�S r )rW r r r r
�visit_FuncDecl s zCGenerator.visit_FuncDeclc C s~ |d |j pd }|jrz|d7 }|| �� 7 }| jd7 _|d7 }|jD ]}|| �|�7 }qH| jd8 _|| �� d 7 }|S )ze Generates code for structs and unions. name should be either
'struct' or union.
r
r rh rn rm rF )r# rR r r ro )r r r# rN rQ r r r
r� s
z!CGenerator._generate_struct_unionc C s� t |�}|r| jd7 _| �� }|r4| jd8 _|tjtjtjtjtjtj tj
tj tj tj
tjtjtjf
kr�|| �|� d S |tjfkr�| �|�S || �|� d S dS )z� Generation from a statement node. This method exists as a wrapper
for individual visit_* methods to handle different treatment of
some statements in this context.
rn rf rh N)r) r r r �DeclrA ZCastZUnaryOpZBinaryOpZ TernaryOp�FuncCall�ArrayRef� StructRefr� r� ZTypedefrG r ZCompound)r r r� �typ�indentr r r
ro ( s2 �
zCGenerator._generate_stmtc C sH d}|j rd�|j �d }|jr4|d�|j�d 7 }|| �|j�7 }|S )z& Generation from a Decl node.
r r
)Zfuncspecr rV rW r) rT r r r
rK D s zCGenerator._generate_declc C s� t |�}|tjk�rHd}|jr2|d�|j�d 7 }|| �|j �7 }|jrN|jnd}t|�D ]�\}}t|tj �r�|dkr�t||d tj
�r�d| d }|d| �|j � d 7 }qZt|tj �r�|dkr�t||d tj
�r�d| d }|d| �|j
� d 7 }qZt|tj
�rZ|j�r(d d�|j�|f }qZd
| }qZ|�rD|d| 7 }|S |tjk�r`| �|j �S |tjk�rx| �|j �S |tjk�r�d�|j�d S |tj tj
tj fk�r�| �|j ||g �S | �|�S d S ) z� Recursive generation from a type node. n is the type node.
modifiers collects the PtrDecl, ArrayDecl and FuncDecl modifiers
encountered on the way down to a TypeDecl, to allow proper
generation from it.
r r
r r r, r- r% r& z* %s %s�*N)r) r ZTypeDeclZqualsr r Zdeclnamerc r@ Z ArrayDeclZPtrDeclZdimZFuncDeclr. r� rK ZTypenamerW ZIdentifierTyperC )r r � modifiersr� rN Znstrrd �modifierr r r
rW M s@
zCGenerator._generate_typec C s& | � |�}||�r d| d S |S dS )z� Visits 'n' and returns its string representation, parenthesized
if the condition function applied to the node returns True.
r, r- N)rH )r r Z conditionrN r r r
r; { s
zCGenerator._parenthesize_ifc s � � |� fdd��S )z. Common use case for _parenthesize_if
c s � � | � S r r4 r6 r r r
r8 � r9 z8CGenerator._parenthesize_unless_simple.<locals>.<lambda>)r; r r r r
r' � s z&CGenerator._parenthesize_unless_simplec C s t |tjtjtjtjtjf�S )z~ Returns True for nodes that are "simple" - i.e. nodes that always
have higher precedence than operators.
)r@ r r� r� r� r� r� r r r r
r5 � s �zCGenerator._is_simple_nodeN)F)F)8r �
__module__� __qualname__�__doc__r r r r r! r$ r( r+ r/ r3 r? rB rD rH rO rU rX rY r_ r` re rj rl rq rs rv rx ry rz r~ r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ro rK rW r; r' r5 r r r r
r sj
.
r N)r r �objectr r r r r
�<module> s