File: //opt/saltstack/salt/lib/python3.10/site-packages/pycparser/__pycache__/c_generator.cpython-310.pyc
o
;j�P � @ s2 d dl mZmZmZ ddlmZ G dd� d�ZdS )� )�Callable�List�Optional� )�c_astc @ s� e Zd ZU dZeed< eed< d�deddfdd�Zdefd d
�Z d e
j defd d
�Z d e
e
j defdd�Zde
jdefdd�Zde
jdefdd�Zde
jdefdd�Zde
jdefdd�Zde
jdefdd�Zde
jdefdd �Zde
jdefd d �Z i d d �d!d"�d#d$�d%d&�d'd(�d)d*�d+d*�d,d-�d.d-�d/d-�d0d-�d1d2�d3d2�d4d5�d6d5�d7d8�d9d8�d:d8i�Z de
j defd;d<�Z de
j defd=d>�Z!de
j"defd?d@�Z#de
j defdAdB�Z$d�de
j%dCedefdDdE�Z&de
j'defdFdG�Z(de
j)defdHdI�Z*de
j+defdJdK�Z,de
j-defdLdM�Z.de
j/defdNdO�Z0de
j1defdPdQ�Z2de
j3defdRdS�Z4de
j5defdTdU�Z6de
j7defdVdW�Z8de
j9defdXdY�Z:de
j;defdZd[�Z<de
j=defd\d]�Z>de
j?defd^d_�Z@de
jAdefd`da�ZBde
jCdefdbdc�ZDde
jEdefddde�ZFde
jGdefdfdg�ZHde
jIdefdhdi�ZJde
jKdefdjdk�ZLde
jMdefdldm�ZNde
jOdefdndo�ZPde
jQdefdpdq�ZRde
jSdefdrds�ZTde
jUdefdtdu�ZVde
jWdefdvdw�ZXde
jYdefdxdy�ZZde
j[defdzd{�Z\de
j]defd|d}�Z^de
j_defd~d�Z`de
jadefd�d��Zbde
jcdefd�d��Zdde
jedefd�d��Zfde
jgdefd�d��Zhde
jidefd�d��Zjde
jkdefd�d��Zlde
jmdefd�d��Znde
jodefd�d��Zpde
jae
jeB e
j1B d�edefd�d��Zqd�ere
j defd�d��Zsd�ere
j5 defd�d��Ztd�de
j d�edefd�d��Zude
j%defd�d��Zvg d�fde
j d�ere
j d�edefd�d��Zwde
j d�exe
j gef defd�d��Zyde
j defd�d��Zzde
j defd�d��Z{dS )��
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.
� indent_level�reduce_parenthesesF�returnNc C s d| _ || _dS )z�Constructs C-code generator
reduce_parentheses:
if True, eliminates needless parentheses on binary operators
r N)r r )�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_indent�nodec C s d|j j }t| || j�|�S )NZvisit_)� __class__�__name__�getattr�
generic_visit)r r �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_visit�nc C � |j S r )�value�r r# r r r
�visit_Constant/ � zCGenerator.visit_Constantc C r$ r ��namer& r r r
�visit_ID2 r( zCGenerator.visit_IDc C s d}|j r |d|j 7 }|S )Nz#pragmar )�string)r r# �retr r r
� visit_Pragma5 s zCGenerator.visit_Pragmac 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 )r1 r* �typer �field)r r# Zsrefr r r
�visit_StructRef? s zCGenerator.visit_StructRefc C s6 | � |j�}|jd ur| �|j�nd}|d | d S )Nr �(�))r1 r* �argsr )r r# Zfrefr8 r r r
�visit_FuncCallC s zCGenerator.visit_FuncCallc C sz |j dkr d| �|j�� d�S dkr! | �|j�}|� d�S dkr/| �|j�}|� d�S | �|j�}|j � |� �S )N�sizeofzsizeof(r7 zp++z++zp--z--)�opr �exprr1 )r r# �operandr r r
�
visit_UnaryOpH s
zCGenerator.visit_UnaryOpz||r z&&r �|� �^� �&� z==� z!=�>� z>=�<z<=z>>� z<<�+� �-�*� �/�%c sF �� � j� �fdd��}�� � j� �fdd��}|� d� j� d|� �S )Nc s6 �� | �p�jot| tj�o�j| j �j� j k S r ��_is_simple_noder �
isinstancer �BinaryOp�precedence_mapr; ��d�r# r r r
�<lambda>| �
��z+CGenerator.visit_BinaryOp.<locals>.<lambda>c s6 �� | �p�jot| tj�o�j| j �j� j k S r rQ rV rX r r
rY � rZ r )�_parenthesize_if�left�rightr; )r r# Zlval_str�rval_strr rX r
�visit_BinaryOpp s
� � zCGenerator.visit_BinaryOpc C s0 | � |jdd� �}| �|j�� d|j� d|� �S )Nc S s t | tj�S r )rS r �
Assignment)r# r r r
rY � � z-CGenerator.visit_Assignment.<locals>.<lambda>r )r[ Zrvaluer Zlvaluer; )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 sn | t jd� r d| �|� d S t jd� r n t jd� r$ n n
d| �|� d S | �|�S )Nr �{�}r6 r7 )r �InitListr �ExprList�Compoundr& r r r
� _visit_expr� s �*
zCGenerator._visit_expr�no_typec C sL |r|j n| �|�}|jr|d| �|j� 7 }|jr$|d| �|j� 7 }|S )Nz : � = )r* �_generate_declZbitsizer �initrk )r r# rl �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)rq �r �declr r r
r � s �
�z,CGenerator.visit_DeclList.<locals>.<genexpr>)r �decls�lenr! �r r# rp 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_typer3 rw r r r
�
visit_Typedef� s
zCGenerator.visit_Typedefc C s, d| j |jdd� d }|d | �|j� S )Nr6 F��
emit_declnamer7 r )rz Zto_typer1 r< rw r r r
�
visit_Cast� s zCGenerator.visit_Castc C �* g }|j D ]
}|�| �|�� qd�|�S �Nrr �Zexprs�appendrk 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 rt r �bodyZ param_declsr! )r r# rt r� Zknrdeclsr r r
�
visit_FuncDef� s zCGenerator.visit_FuncDefc C sn d}|j D ]/}| tjd� r || �|�7 }n tjd� r) || �|�d 7 }n || �|�d 7 }q|S )Nr r r� r� )�extr �FuncDefr �Pragma)r r# rp 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! rw r r r
�visit_Compound� s zCGenerator.visit_Compoundc C s$ d| � |j� d | � |j� d S )Nr6 z){rg )r r3 ro 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 )Nrr 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 )Nr
r r� )r< r rw 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 )Nr6 z) ? z) : r7 )rk �cond�iftrue�iffalserw 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 rw 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� )ro r r� �nextr� r� rw 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� rw r r r
� visit_While7 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 rw r r r
�
visit_DoWhile? s zCGenerator.visit_DoWhilec C s> d}|| � |j�7 }|jr|d7 }|| � |j�7 }|d7 }|S )Nz_Static_assert(�,r7 )r r� �messagerw r r r
�visit_StaticAssertH s z CGenerator.visit_StaticAssertc C s, d| � |j� d }|| j|jdd�7 }|S )Nzswitch (r� Tr� )r r� r� r� rw r r r
� visit_SwitchQ s zCGenerator.visit_Switchc C s6 d| � |j� d }|jD ] }|| j|dd�7 }q
|S )Nzcase �:
Tr� )r r< �stmtsr� �r r# rp r� r r r
�
visit_CaseV s
zCGenerator.visit_Casec C s& d}|j D ] }|| j|dd�7 }q|S )Nz default:
Tr� )r� r� r� r r r
�
visit_Default\ s
zCGenerator.visit_Defaultc C s |j d | �|j� S )Nr� )r* r� r� r& r r r
� visit_Labelb s zCGenerator.visit_Labelc C s d|j d S )Nzgoto r� r) r& r r r
�
visit_Gotoe r� zCGenerator.visit_Gotoc C r� )Nz...r r& r r r
�visit_EllipsisParamh r� z CGenerator.visit_EllipsisParamc C � | � |d�S )N�structr� r& r r r
� visit_Structk re zCGenerator.visit_Structc C s | � |j�S r )rz r3 r& r r r
�visit_Typenamen re zCGenerator.visit_Typenamec C r� )N�unionr� r& r r r
� visit_Unionq re 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/ r0 rm )r* rS r �IDr rk r< )r r# rp r* r r r
�visit_NamedInitializert s
z!CGenerator.visit_NamedInitializerc C s
| � |�S r �rz r& r r r
�visit_FuncDecl~ r zCGenerator.visit_FuncDeclc C r� �NFr| 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_PtrDecl� r� zCGenerator.visit_PtrDeclr* c C s� |dv rt |tjtjf�sJ �|j}| j}n |dks J �t |tj�s$J �|jdu r+dn|jj}| j }|d |j
p9d }|duri|d7 }|| � � 7 }| j d7 _ |d7 }|||�7 }| j d8 _ || � � d 7 }|S )
zlGenerates code for structs, unions, and enums. name should be
'struct', 'union', or 'enum'.
)r� r� r� Nr r r� r@ r� rg )
rS r �Struct�Unionru �_generate_struct_union_body�Enum�valuesZ enumerators�_generate_enum_bodyr* r r )r r# r* �membersZ
body_functionrp r r r
r� � s$ z&CGenerator._generate_struct_union_enumr� c s d� � fdd�|D ��S )Nr c 3 r� r r� rs 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_bodyr� c C s� |r | j d7 _ | �� }|r| j d8 _ | tjd� r no tjd� r) nf tjd� r2 n] tjd� r; nT tjd� rD nK tjd� rM nB tj d� rV n9 tj
d� r_ n0 tj d� rh n' tj d� rq n tj
d� rz n tjd� r� n tjd� r� n n || �|� d S tjd� r� | �|�S tjd� r� || �|� 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� r� )r r r �Declr` �Cast�UnaryOprT � TernaryOp�FuncCall�ArrayRef� StructRef�Constantr� �Typedefri r rj �If)r r# r� r� r r r
r� � s8
� �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! ry Zalignr rz r3 rw r r r
rn � s zCGenerator._generate_declT� modifiersr} c C sz | t jd� r� d}|jr|d�|j�d 7 }|| �|j�7 }|jr(|r(|jnd}t|�D ]�\}}| t jd� rr |dkrOt ||d t j
�rOd| d }|d7 }|j r`|d�|j �d 7 }|j d urm|| �|j �7 }|d
7 }nZ t j
d� r� |dkr�t ||d t j
�r�d| d }|jd ur�| �|j�nd}|d| d 7 }n' t j
d� r� |jr�d�|j�} |r�d|� �nd}
d | � |
� �}nd | }n q.|r�|d| 7 }|S t jd� r� | �|j�S t jd� r� | j|j|d
�S t jd� �r d�|j�d S t jd� �r n t j
d� �r n
t j
d� �r' n n
| 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 r r6 r7 r/ Nr0 z* rM r| )r �TypeDecl�qualsr! r r3 Zdeclname� enumerate� ArrayDeclrS �PtrDeclZ dim_qualsZdim�FuncDeclr8 r� rn �Typenamerz �IdentifierTyperc ) r r# r� r} rp Znstr�i�modifierr8 r� �suffixr r r
rz � sn
�
���
�� �) ���B�
zCGenerator._generate_type� conditionc 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.
r6 r7 )rk )r r# r� rp r r r
r[ & s
zCGenerator._parenthesize_ifc s � � |� fdd��S )z$Common use case for _parenthesize_ifc s � � | � S r )rR rV r r r
rY 4 ra z8CGenerator._parenthesize_unless_simple.<locals>.<lambda>)r[ r& r r r
r1 2 s z&CGenerator._parenthesize_unless_simplec C s t |tjtjtjtjtjf�S )zyReturns True for nodes that are "simple" - i.e. nodes that always
have higher precedence than operators.
)rS r r� r� r� r� r� r& r r r
rR 6 s �zCGenerator._is_simple_node)F)|r �
__module__� __qualname__�__doc__�int�__annotations__�boolr �strr r ZNoder r r r� r' r� r+ r� r. r� r2 r� r5 r� r9 r� r> rU rT r_ r` rb r� rd rk r� rq ZDeclListrx r� r{ r� r~ ri r� rh r� r� r� ZAlignasr� Z
Enumeratorr� r� r� ZFileASTr� rj r� ZCompoundLiteralr� ZEmptyStatementr� Z ParamListr� ZReturnr� ZBreakr� �Continuer� r� r� r� r� ZForr� ZWhiler� ZDoWhiler� Z StaticAssertr� ZSwitchr� ZCaser� ZDefaultr� ZLabelr� ZGotor� Z
EllipsisParamr� r� r� r� r� r� r� ZNamedInitializerr� r� r� r� r� r� r� r� r� r� r r� r� r� rn rz r r[ r1 rR r r r r
r s�
������ �
� � �
��������%
��
� *����
�C��
� r N)�typingr r r r r r r r r r
�<module> s