File: //var/opt/nydus/ops/pycparser/__pycache__/c_generator.cpython-39.pyc
a
�,�h~E � @ s d dl mZ G dd� de�ZdS )� )�c_astc @ s6 e Zd ZdZd�dd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdddd d d d d d d d d d d!d!d"d"d"d#�Zd$d%� Zd&d'� Zd(d)� Zd*d+� Zd�d,d-�Zd.d/� Zd0d1� Zd2d3� Zd4d5� Zd6d7� Zd8d9� Zd:d;� Zd<d=� Z d>d?� Z d@dA� Z dBdC� Z dDdE� Z dFdG� Z!dHdI� Z"dJdK� Z#dLdM� Z$dNdO� Z%dPdQ� Z&dRdS� Z'dTdU� Z(dVdW� Z)dXdY� Z*dZd[� Z+d\d]� Z,d^d_� Z-d`da� Z.dbdc� Z/ddde� Z0dfdg� Z1dhdi� Z2djdk� Z3dldm� Z4dndo� Z5dpdq� Z6drds� Z7dtdu� Z8dvdw� Z9dxdy� Z:dzd{� Z;d|d}� Z<d�d~d�Z=d�d�� Z>g d�fd�d��Z?d�d�� Z@d�d�� ZAd�d�� ZBd�S )��
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.
Fc C s d| _ || _dS )z� Constructs C-code generator
reduce_parentheses:
if True, eliminates needless parentheses on binary operators
� N)� indent_level�reduce_parentheses)�selfr � r �F/opt/nydus/tmp/pip-target-wkfpz8uv/lib/python/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 )N�visit_)� __class__�__name__�getattr�
generic_visit)r �node�methodr r r �visit s zCGenerator.visitc s, |d u r dS d� � fdd�|�� D ��S d S )N� c 3 s | ]\}}� � |�V qd S �N�r )�.0Zc_name�cr
r r � <genexpr>' � 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 d}|j r|d|j 7 }|S )Nz#pragmar )�string)r r" �retr r r � visit_Pragma/ s zCGenerator.visit_Pragmac C s$ | � |j�}|d | �|j� d S )N�[�])�_parenthesize_unless_simpler% r Z subscript)r r" Zarrrefr r r �visit_ArrayRef5 s zCGenerator.visit_ArrayRefc C s" | � |j�}||j | �|j� S r )r, r% �typer �field)r r" Zsrefr r r �visit_StructRef9 s zCGenerator.visit_StructRefc C s$ | � |j�}|d | �|j� d S )N�(�))r, r% r �args)r r" Zfrefr r r �visit_FuncCall= s zCGenerator.visit_FuncCallc C s\ |j dkrd| �|j� S | �|j�}|j dkr8d| S |j dkrJd| S d|j |f S d S )N�sizeofz
sizeof(%s)zp++z%s++zp--z%s--z%s%s)�opr �exprr, )r r" �operandr r r �
visit_UnaryOpA s
zCGenerator.visit_UnaryOpr r � � � � � � � � )z||z&&�|�^�&z==z!=�>z>=�<z<=z>>z<<�+�-�*�/�%c s@ �� � j� �fdd��}�� � j� �fdd��}d|� j|f S )Nc s6 �� | �p2�jo2t| tj�o2�j| j �j� j k S r ��_is_simple_noder �
isinstancer �BinaryOp�precedence_mapr6 ��d�r" r r r �<lambda>k s
�z+CGenerator.visit_BinaryOp.<locals>.<lambda>c s6 �� | �p2�jo2t| tj�o2�j| j �j� j k S r rL rQ rS r r rT w s
��%s %s %s)�_parenthesize_if�left�rightr6 )r r" Zlval_str�rval_strr rS r �visit_BinaryOp_ s
� �zCGenerator.visit_BinaryOpc C s* | � |jdd� �}d| �|j�|j|f S )Nc S s t | tj�S r )rN r �
Assignment)r" r r r rT r z-CGenerator.visit_Assignment.<locals>.<lambda>rU )rV Zrvaluer Zlvaluer6 )r r" rY r r r �visit_Assignment| s
�zCGenerator.visit_Assignmentc C s d� |j�S r )r �namesr! r r r �visit_IdentifierType� s z CGenerator.visit_IdentifierTypec C sP t |tj�r d| �|� d S t |tjtjf�rBd| �|� d S | �|�S d S )N�{�}r1 r2 )rN r ZInitListr �ExprList�Compoundr! r r r � _visit_expr� s
zCGenerator._visit_exprc C sL |r
|j n| �|�}|jr.|d| �|j� 7 }|jrH|d| �|j� 7 }|S )Nz : � = )r% �_generate_declZbitsizer �initrc )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)rg N)ri �r �declr
r r r � s �z,CGenerator.visit_DeclList.<locals>.<genexpr>)r �decls�lenr �r r" rh r r
r �visit_DeclList� s � zCGenerator.visit_DeclListc C s2 d}|j r |d�|j �d 7 }|| �|j�7 }|S )Nr r )�storager �_generate_typer. ro r r r �
visit_Typedef� s zCGenerator.visit_Typedefc C s, d| j |jdd� d }|d | �|j� S )Nr1 F��
emit_declnamer2 r )rr Zto_typer, r7 ro r r r �
visit_Cast� s zCGenerator.visit_Castc C s* g }|j D ]}|�| �|�� q
d�|�S �Nrj ��exprs�appendrc r �r r" Zvisited_subexprsr7 r r r �visit_ExprList� s
zCGenerator.visit_ExprListc C s* g }|j D ]}|�| �|�� q
d�|�S rw rx r{ r r r �visit_InitList� s
zCGenerator.visit_InitListc C s | j |dd�S )N�enumr$ ��_generate_struct_union_enumr! r r r �
visit_Enum� s zCGenerator.visit_Enumc C s d� | �|j��S )Nz _Alignas({}))�formatr � alignmentr! r r r �
visit_Alignas� s zCGenerator.visit_Alignasc C s< |j sdj| �� |jd�S dj| �� |j| �|j �d�S d S )Nz{indent}{name},
)�indentr% z{indent}{name} = {value},
)r� r% r )r r� r r% r r! r r r �visit_Enumerator� s �
�zCGenerator.visit_Enumeratorc 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 � r z+CGenerator.visit_FuncDef.<locals>.<genexpr>�
)r rl r �bodyZ param_declsr )r r" rl r� Zknrdeclsr r
r �
visit_FuncDef� s zCGenerator.visit_FuncDefc C sb d}|j D ]R}t|tj�r*|| �|�7 }q
t|tj�rJ|| �|�d 7 }q
|| �|�d 7 }q
|S )Nr r� r� )�extrN r ZFuncDefr ZPragma)r r" rh r� r r r �
visit_FileAST� s
zCGenerator.visit_FileASTc s` � � � d }� jd7 _|jr>|d�� fdd�|jD ��7 }� jd8 _|� � � d 7 }|S )N�{
r: r c 3 s | ]}� � |�V qd S r ��_generate_stmt)r �stmtr
r r r � r z,CGenerator.visit_Compound.<locals>.<genexpr>z}
)r r Z block_itemsr ro r r
r �visit_Compound� s zCGenerator.visit_Compoundc C s$ d| � |j� d | � |j� d S )Nr1 z){r` )r r. rf r! r r r �visit_CompoundLiteral� s z CGenerator.visit_CompoundLiteralc C s dS )N�;r r! r r r �visit_EmptyStatement� s z CGenerator.visit_EmptyStatementc s d� � fdd�|jD ��S )Nrj c 3 s | ]}� � |�V qd S r r )r �paramr
r r r � r 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 r� )r7 r ro 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 sH d| � |j� d }|d| � |j� d 7 }|d| � |j� d 7 }|S )Nr1 z) ? z) : r2 )rc �cond�iftrue�iffalsero 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 r� r� r� r ro 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 (r� r r� Tr� )rf r r� �nextr� r� ro 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 r� r� ro 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);)r� r� r r� r ro r r r �
visit_DoWhile s zCGenerator.visit_DoWhilec C s> d}|| � |j�7 }|jr2|d7 }|| � |j�7 }|d7 }|S )Nz_Static_assert(�,r2 )r r� �messagero r r r �visit_StaticAssert$ s z CGenerator.visit_StaticAssertc C s, d| � |j� d }|| j|jdd�7 }|S )Nzswitch (r� Tr� )r r� r� r� ro r r r � visit_Switch- s zCGenerator.visit_Switchc C s6 d| � |j� d }|jD ]}|| j|dd�7 }q|S )Nzcase �:
Tr� )r r7 �stmtsr� �r r" rh r� r r r �
visit_Case2 s
zCGenerator.visit_Casec C s& d}|j D ]}|| j|dd�7 }q
|S )Nz default:
Tr� )r� r� r� r r r �
visit_Default8 s
zCGenerator.visit_Defaultc C s |j d | �|j� S )Nr� )r% r� r� r! r r r � visit_Label> s zCGenerator.visit_Labelc C s d|j d S )Nzgoto r� r$ r! r r r �
visit_GotoA s zCGenerator.visit_Gotoc C s dS )Nz...r r! r r r �visit_EllipsisParamD s z CGenerator.visit_EllipsisParamc C s | � |d�S )N�structr r! r r r � visit_StructG s zCGenerator.visit_Structc C s | � |j�S r )rr r. r! r r r �visit_TypenameJ s zCGenerator.visit_Typenamec C s | � |d�S )N�unionr r! r r r � visit_UnionM s zCGenerator.visit_Unionc C sZ d}|j D ]6}t|tj�r*|d|j 7 }q
|d| �|� d 7 }q
|d| �|j� 7 }|S )Nr �.r* r+ rd )r% rN r �IDr rc r7 )r r" rh r% r r r �visit_NamedInitializerP s
z!CGenerator.visit_NamedInitializerc C s
| � |�S r �rr r! r r r �visit_FuncDeclZ s zCGenerator.visit_FuncDeclc C s | j |dd�S �NFrt r� r! r r r �visit_ArrayDecl] s zCGenerator.visit_ArrayDeclc C s | j |dd�S r� r� r! r r r �visit_TypeDecl` s zCGenerator.visit_TypeDeclc C s | j |dd�S r� r� r! r r r �
visit_PtrDeclc s zCGenerator.visit_PtrDeclc C s� |dv r|j }| j}n(|dks"J �|jdu r0dn|jj}| j}|d |jpLd }|dur�|d7 }|| �� 7 }| jd7 _|d7 }|||�7 }| jd8 _|| �� d 7 }|S )
zq Generates code for structs, unions, and enums. name should be
'struct', 'union', or 'enum'.
)r� r� r~ Nr r r� r: r� r` )rm �_generate_struct_union_body�valuesZ enumerators�_generate_enum_bodyr% r r )r r" r% �membersZ
body_functionrh r r r r� f s z&CGenerator._generate_struct_union_enumc s d� � fdd�|D ��S )Nr c 3 s | ]}� � |�V qd S r r� rk r
r r r r z9CGenerator._generate_struct_union_body.<locals>.<genexpr>�r �r r� r r
r r� ~ s z&CGenerator._generate_struct_union_bodyc s$ d� � fdd�|D ��d d� d S )Nr c 3 s | ]}� � |�V qd S r r )r r r
r r r � r z1CGenerator._generate_enum_body.<locals>.<genexpr>���r� r� r� r r
r r� � s z CGenerator._generate_enum_bodyc C s� t |�}|r| jd7 _| �� }|r4| jd8 _|tjtjtjtjtjtj tj
tj tj tj
tjtjtjf
v r�|| �|� d S |tjfv r�| �|�S |tjfv r�|| �|� 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.
r: r� r� N)r. r r r �Declr[ ZCast�UnaryOprO Z TernaryOp�FuncCall�ArrayRef� StructRef�Constantr� ZTypedefra r rb �If)r r" r� �typr� r r r r� � s �
zCGenerator._generate_stmtc C sf d}|j rd�|j �d }|jr4|d�|j�d 7 }|jrR|| �|jd �d 7 }|| �|j�7 }|S )z& Generation from a Decl node.
r r r )Zfuncspecr rq Zalignr rr r. ro r r r re � s zCGenerator._generate_declTc C s t |�}|tjk�r�d}|jr2|d�|j�d 7 }|| �|j �7 }|jrR|rR|jnd}t|�D �]\}}t|tj �r�|dkr�t||d tj
�r�d| d }|d7 }|j r�|d�|j �d 7 }|| �|j �d 7 }q^t|tj
��r(|dk�rt||d tj
��rd| d }|d| �|j� d 7 }q^t|tj
�r^|j�r`d d�|j�|�rVd| ndf }q^d
| }q^|�r||d| 7 }|S |tjk�r�| �|j �S |tjk�r�| j|j |d �S |tjk�r�d�|j�d S |tj tj
tj
fv �r�| j|j ||g |d �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 r1 r2 r* r+ z* %s%srI rt N)r. r ZTypeDeclZqualsr r Zdeclname� enumeraterN Z ArrayDeclZPtrDeclZ dim_qualsZdimZFuncDeclr3 r� re ZTypenamerr ZIdentifierTyper] ) r r" � modifiersru r� rh Znstr�i�modifierr r r rr � sR �
� �
�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.
r1 r2 N)rc )r r" � conditionrh r r r rV � s
zCGenerator._parenthesize_ifc s � � |� fdd��S )z. Common use case for _parenthesize_if
c s � � | � S r )rM rQ r
r r rT � r z8CGenerator._parenthesize_unless_simple.<locals>.<lambda>)rV 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.
)rN r r� r� r� r� r� r! r r r rM � s �zCGenerator._is_simple_nodeN)F)F)F)Cr �
__module__� __qualname__�__doc__r
r r r r# r& r) r- r0 r4 r9 rP rZ r\ r^ rc ri rp rs rv r| r} r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� re rr rV r, rM r r r r r s�
�
5
r N)r r �objectr r r r r �<module> s