File: //opt/saltstack/salt/lib/python3.10/site-packages/pycparser/__pycache__/c_generator.cpython-310.pyc
o
�N�glE � @ s d dl mZ G dd� de�ZdS )� )�c_astc @ s~ e Zd ZdZd�dd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zi dd�dd �d d �d d �d!d"�d#d$�d%d$�d&d'�d(d'�d)d'�d*d'�d+d,�d-d,�d.d/�d0d/�d1d2�d3d2�d4d2i�Zd5d6� Zd7d8� Zd9d:� Zd;d<� Zd�d=d>�Zd?d@� ZdAdB� ZdCdD� ZdEdF� ZdGdH� ZdIdJ� ZdKdL� ZdMdN� Z dOdP� Z dQdR� Z dSdT� Z dUdV� Z dWdX� Z!dYdZ� 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� Z0dwdx� Z1dydz� Z2d{d|� Z3d}d~� Z4dd�� Z5d�d�� Z6d�d�� Z7d�d�� Z8d�d�� Z9d�d�� Z:d�d�� 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 �I/opt/saltstack/salt/lib/python3.10/site-packages/pycparser/c_generator.py�__init__ s
zCGenerator.__init__c C s
d| j S �N� )r �r r r r � _make_indent �
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 u rdS d� � fdd�|�� 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 � |j S r )�value�r �nr r r �visit_Constant) � zCGenerator.visit_Constantc C r r ��namer! r r r �visit_ID, r$ 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 �$ | � |j�}|d | �|j� d S )N�[�])�_parenthesize_unless_simpler& r Z subscript)r r" Zarrrefr r r �visit_ArrayRef5 � 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 r+ )N�(�))r. r& r �args)r r" Zfrefr r r �visit_FuncCall= r0 zCGenerator.visit_FuncCallc C sX |j dkr
d| �|j� S | �|j�}|j dkr d| S |j dkr%d| S d|j |f 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_UnaryOpz||r z&&r �|� �^� �&� z==� z!=�>� z>=�<z<=z>>� z<<�+� �-�*� �/�%c s@ �� � j� �fdd��}�� � j� �fdd��}d|� j|f S )Nc s6 �� | �p�jot| tj�o�j| j �j� j k S r ��_is_simple_noder �
isinstancer �BinaryOp�precedence_mapr9 ��d�r" r r r �<lambda>k �
�z+CGenerator.visit_BinaryOp.<locals>.<lambda>c s6 �� | �p�jot| tj�o�j| j �j� j k S r rO rT rV r r rW w rX �%s %s %s)�_parenthesize_if�left�rightr9 )r r" Zlval_str�rval_strr rV r �visit_BinaryOp_ s
� �zCGenerator.visit_BinaryOpc C s* | � |jdd� �}d| �|j�|j|f S )Nc S s t | tj�S r )rQ r �
Assignment)r" r r r rW � z-CGenerator.visit_Assignment.<locals>.<lambda>rY )rZ Zrvaluer Zlvaluer9 )r r" r] r r r �visit_Assignment| s
�zCGenerator.visit_Assignmentc C s d� |j�S r )r �namesr! r r r �visit_IdentifierType� � z CGenerator.visit_IdentifierTypec C sF t |tj�rd| �|� d S t |tj�r d| �|� d S | �|�S )N�{�}r4 r5 )rQ r ZInitListr �ExprListr! r r r � _visit_expr� s
zCGenerator._visit_exprc C sL |r|j n| �|�}|jr|d| �|j� 7 }|jr$|d| �|j� 7 }|S )Nz : � = )r& �_generate_declZbitsizer �initrh )r r" �no_type�sr r r �
visit_Decl� s
zCGenerator.visit_Declc sL � � |jd �}t|j�dkr$|dd�� fdd�|jdd � D �� 7 }|S )Nr r �, c 3 s � | ]
}� j |d d�V qdS )T)rl N)rn �r �declr
r r r � s � �z,CGenerator.visit_DeclList.<locals>.<genexpr>)r �decls�lenr �r r" rm 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_typer1 rt r r r �
visit_Typedef� s zCGenerator.visit_Typedefc C s, d| j |jdd� d }|d | �|j� S )Nr4 F��
emit_declnamer5 r )rw Zto_typer. r: rt r r r �
visit_Cast� s zCGenerator.visit_Castc C �* g }|j D ]
}|�| �|�� qd�|�S �Nro �Zexprs�appendrh r �r r" Zvisited_subexprsr: r r r �visit_ExprList� �
zCGenerator.visit_ExprListc C r| r} r~ r� r r r �visit_InitList� r� zCGenerator.visit_InitListc C � | j |dd�S )N�enumr% ��_generate_struct_union_enumr! r r r �
visit_Enum� � zCGenerator.visit_Enumc C s d� | �|j��S )Nz _Alignas({}))�formatr � alignmentr! r r r �
visit_Alignas� s zCGenerator.visit_Alignasc C s8 |j s
dj| �� |jd�S dj| �� |j| �|j �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 sf � � |j�}d� _� � |j�}|jr+d�� fdd�|jD ��}|d | d | d S |d | d S )Nr �;
c 3 � � | ]}� � |�V qd S r r )r �pr
r r r � � � z+CGenerator.visit_FuncDef.<locals>.<genexpr>�
)r rq r �bodyZ param_declsr )r r" rq r� Zknrdeclsr r
r �
visit_FuncDef� s zCGenerator.visit_FuncDefc C sb d}|j D ])}t|tj�r|| �|�7 }qt|tj�r%|| �|�d 7 }q|| �|�d 7 }q|S )Nr r� r� )�extrQ r ZFuncDefr ZPragma)r r" rm 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 r� r ��_generate_stmt)r �stmtr
r r r � r� z,CGenerator.visit_Compound.<locals>.<genexpr>z}
)r r Z block_itemsr rt r r
r �visit_Compound� s zCGenerator.visit_Compoundc C s$ d| � |j� d | � |j� d S )Nr4 z){rf )r r1 rk r! r r r �visit_CompoundLiteral� s $z CGenerator.visit_CompoundLiteralc C � dS )N�;r r! r r r �visit_EmptyStatement� � z CGenerator.visit_EmptyStatementc s d� � fdd�|jD ��S )Nro c 3 r� 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� )r: r rt r r r � visit_Return� s zCGenerator.visit_Returnc C r� )Nzbreak;r r! r r r � visit_Break� r� zCGenerator.visit_Breakc C r� )Nz continue;r r! r r r �visit_Continue� r� zCGenerator.visit_Continuec C sH d| � |j� d }|d| � |j� d 7 }|d| � |j� d 7 }|S )Nr4 z) ? z) : r5 )rh �cond�iftrue�iffalsert r r r �visit_TernaryOp� s zCGenerator.visit_TernaryOpc C sd d}|j r
|| �|j �7 }|d7 }|| j|jdd�7 }|jr0|| �� d 7 }|| j|jdd�7 }|S )Nzif (�)
T��
add_indentzelse
)r� r r� 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 (r� r r� Tr� )rk r r� �nextr� r� 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 r� r� 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);)r� r� r r� r rt r r r �
visit_DoWhile s zCGenerator.visit_DoWhilec C s> d}|| � |j�7 }|jr|d7 }|| � |j�7 }|d7 }|S )Nz_Static_assert(�,r5 )r r� �messagert 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� rt r r r � visit_Switch- s zCGenerator.visit_Switchc C s6 d| � |j� d }|jD ] }|| j|dd�7 }q
|S )Nzcase �:
Tr� )r r: �stmtsr� �r r" rm 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 r� zCGenerator.visit_Gotoc C r� )Nz...r r! r r r �visit_EllipsisParamD r� z CGenerator.visit_EllipsisParamc C � | � |d�S )N�structr� r! r r r � visit_StructG rd zCGenerator.visit_Structc C s | � |j�S r )rw r1 r! r r r �visit_TypenameJ rd zCGenerator.visit_Typenamec C r� )N�unionr� r! r r r � visit_UnionM rd zCGenerator.visit_Unionc C sZ d}|j D ]}t|tj�r|d|j 7 }q|d| �|� d 7 }q|d| �|j� 7 }|S )Nr �.r, r- ri )r& rQ r �IDr rh r: )r r" rm r& r r r �visit_NamedInitializerP s
z!CGenerator.visit_NamedInitializerc C s
| � |�S r �rw r! r r r �visit_FuncDeclZ r zCGenerator.visit_FuncDeclc C r� �NFry r� r! r r r �visit_ArrayDecl] r� zCGenerator.visit_ArrayDeclc C r� r� r� r! r r r �visit_TypeDecl` r� zCGenerator.visit_TypeDeclc C r� r� r� r! r r r �
visit_PtrDeclc r� zCGenerator.visit_PtrDeclc C s� |dv r |j }| j}n|dksJ �|jdu rdn|jj}| j}|d |jp&d }|durV|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� rf )rr �_generate_struct_union_body�valuesZ enumerators�_generate_enum_bodyr& r r )r r" r& �membersZ
body_functionrm r r r r� f s z&CGenerator._generate_struct_union_enumc s d� � fdd�|D ��S )Nr c 3 r� r r� rp 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 r� 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 _| �� }|r| jd8 _|tjtjtjtjtjtj tj
tj tj tj
tjtjtjf
v rA|| �|� d S |tjfv rL| �|�S |tjfv rY|| �|� S || �|� d S )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� )r1 r r r �Declr_ ZCastZUnaryOprR Z TernaryOp�FuncCall�ArrayRef� StructRef�Constantr� ZTypedefrg r ZCompoundZIf)r r" r� �typr� r r r r� � s �
zCGenerator._generate_stmtc C sf d}|j r
d�|j �d }|jr|d�|j�d 7 }|jr)|| �|jd �d 7 }|| �|j�7 }|S )z& Generation from a Decl node.
r r r )Zfuncspecr rv Zalignr rw r1 rt r r r rj � s zCGenerator._generate_declTc C s� t |�}|tjkr�d}|jr|d�|j�d 7 }|| �|j �7 }|jr(|r(|jnd}t|�D ]\}}t|tj �rh|dkrLt||d tj
�rLd| d }|d7 }|j r]|d�|j �d 7 }|| �|j �d 7 }q.t|tj
�r�|dkr�t||d tj
�r�d| d }|d| �|j� d 7 }q.t|tj
�r�|jr�d d�|j�|r�d| ndf }q.d
| }q.|r�|d| 7 }|S |tjkr�| �|j �S |tjkr�| j|j |d �S |tjkr�d�|j�d S |tj tj
tj
fv r�| j|j ||g |d �S | �|�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 r4 r5 r, r- z* %s%srK ry )r1 r ZTypeDeclZqualsr r Zdeclname� enumeraterQ Z ArrayDeclZPtrDeclZ dim_qualsZdimZFuncDeclr6 r� rj ZTypenamerw ZIdentifierTyperb ) r r" � modifiersrz r� rm Znstr�i�modifierr r r rw � sT
� � ��
�
zCGenerator._generate_typec C s" | � |�}||�rd| d S |S )z� Visits 'n' and returns its string representation, parenthesized
if the condition function applied to the node returns True.
r4 r5 )rh )r r" Z conditionrm r r r rZ � s
zCGenerator._parenthesize_ifc s � � |� fdd��S )z. Common use case for _parenthesize_if
c s � � | � S r )rP rT r
r r rW � r` z8CGenerator._parenthesize_unless_simple.<locals>.<lambda>)rZ 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.
)rQ r r� r� r� r� r� r! r r r rP � s �zCGenerator._is_simple_nodeN)F)Cr �
__module__� __qualname__�__doc__r
r r r r# r' r* r/ r3 r7 r< rS r^ ra rc rh rn ru rx 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� r� rj rw rZ r. rP r r r r r s�
������� � � � �
�
� � � � � �
5
r N)r r �objectr r r r r �<module> s