🔐 Sid Gifari File Manager Pro
v8.0.5 | 2026-06-14 14:31:04 | PHP 8.1.34
📂
/ (Root)
/
usr
/
lib
/
python3.9
/
site-packages
/
pycparser
/
__pycache__
📍 /usr/lib/python3.9/site-packages/pycparser/__pycache__
🔄 Refresh
✏️
Editing: c_generator.cpython-39.pyc
Read Only
a ��_^< � @ 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 � Zd d � Zd}d!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^� Z1d_d`� Z2dadb� Z3dcdd� Z4dedf� Z5dgdh� Z6didj� Z7dkdl� Z8dmdn� Z9d~dodp�Z:dqdr� Z;g dsfdtdu�Z<dvdw� Z=dxdy� Z>dzd{� Z?d|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. c C s d| _ d S )N� �� indent_level��self� r �9/usr/lib/python3.9/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 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>)�joinZchildren)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_ArrayRef1 s zCGenerator.visit_ArrayRefc C s" | � |j�}||j | �|j� S r )r* r# �typer Zfield)r r Zsrefr r r �visit_StructRef5 s zCGenerator.visit_StructRefc C s$ | � |j�}|d | �|j� d S )N�(�))r* r# r �args)r r Zfrefr r r �visit_FuncCall9 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--Zsizeofz sizeof(%s)z%s%s)r* �expr�opr )r r �operandr r r � visit_UnaryOp= s zCGenerator.visit_UnaryOpc s< � � |j� fdd��}� � |j� fdd��}d||j|f S )Nc s � � | � S r ��_is_simple_node��dr r r �<lambda>L r z+CGenerator.visit_BinaryOp.<locals>.<lambda>c s � � | � S r r6 r8 r r r r: N r �%s %s %s)�_parenthesize_if�left�rightr3 )r r Zlval_str�rval_strr r r �visit_BinaryOpJ 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 r: T r z-CGenerator.visit_Assignment.<locals>.<lambda>r; )r< Zrvaluer Zlvaluer3 )r r r? r r r �visit_AssignmentQ s �zCGenerator.visit_Assignmentc C s d� |j�S r )r �namesr r r r �visit_IdentifierTypeW 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/ )rA r ZInitListr �ExprListr r r r � _visit_exprZ s zCGenerator._visit_exprFc C sL |r |j n| �|�}|jr.|d| �|j� 7 }|jrH|d| �|j� 7 }|S )Nz : � = )r# �_generate_declZbitsizer �initrI )r r �no_type�sr r r � visit_Declb 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 o s �z,CGenerator.visit_DeclList.<locals>.<genexpr>)r �decls�lenr �r r rN r r r �visit_DeclListl s � zCGenerator.visit_DeclListc C s2 d}|j r |d�|j �d 7 }|| �|j�7 }|S )Nr r )�storager �_generate_typer, rU r r r � visit_Typedefs s zCGenerator.visit_Typedefc C s, d| j |jdd� d }|d | �|j� S )Nr. F�� emit_declnamer/ r )rX Zto_typer* r2 rU r r r � visit_Casty s zCGenerator.visit_Castc C s* g }|j D ]}|�| �|�� q d�|�S �NrP �Zexprs�appendrI r �r r Zvisited_subexprsr2 r r r �visit_ExprList} s zCGenerator.visit_ExprListc C s* g }|j D ]}|�| �|�� q d�|�S r] r^ 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< |j sdj| �� |jd�S dj| �� |j| �|j �d�S d S )Nz{indent}{name}, )�indentr# z{indent}{name} = {value}, )rg r# r )r �formatr 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 rR r �bodyZ param_declsr )r r rR rm 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 rl rj )�extrA r ZFuncDefr ZPragma)r r rN ro 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 � r z,CGenerator.visit_Compound.<locals>.<genexpr>z} )r r Z block_itemsr rU r r r �visit_Compound� s zCGenerator.visit_Compoundc C s$ d| � |j� d | � |j� d S )Nr. z){rG )r r, rL 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 )NrP c 3 s | ]}� � |�V qd S r r )r Zparamr 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 rx )r2 r rU 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 )Nr. z) ? z) : r/ )rI �cond�iftrue�iffalserU 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 rt r� r� r rU 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 (rx r r� Tr� )rL r r� �nextrt ru rU 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 rt ru rU 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);)rt ru r r� r rU r r r � visit_DoWhile� s zCGenerator.visit_DoWhilec C s, d| � |j� d }|| j|jdd�7 }|S )Nzswitch (r� Tr� )r r� rt ru rU r r r � visit_Switch� s zCGenerator.visit_Switchc C s6 d| � |j� d }|jD ]}|| j|dd�7 }q|S )Nzcase �: Tr� )r r2 �stmtsrt �r r rN ru r r r � visit_Case� s zCGenerator.visit_Casec C s& d}|j D ]}|| j|dd�7 }q |S )Nz default: Tr� )r� rt r� r r r � visit_Default s zCGenerator.visit_Defaultc C s |j d | �|j� S )Nr� )r# rt ru r r r r � visit_Label s zCGenerator.visit_Labelc C s d|j d S )Nzgoto rx 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�structrd r r r r � visit_Struct s zCGenerator.visit_Structc C s | � |j�S r )rX r, r r r r �visit_Typename s zCGenerator.visit_Typenamec C s | � |d�S )N�unionrd r r r r � visit_Union 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) rJ )r# rA r �IDr rI r2 )r r rN r# r r r �visit_NamedInitializer s z!CGenerator.visit_NamedInitializerc C s | � |�S r �rX r r r r �visit_FuncDecl# s zCGenerator.visit_FuncDeclc C s | j |dd�S �NFrZ 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_PtrDecl, 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� rc Nr r rl rr rq rG )rS �_generate_struct_union_body�valuesZ enumerators�_generate_enum_bodyr# r r )r r r# �membersZ body_functionrN r r r re / s z&CGenerator._generate_struct_union_enumc s d� � fdd�|D ��S )Nr c 3 s | ]}� � |�V qd S r rs rQ r r r r H r z9CGenerator._generate_struct_union_body.<locals>.<genexpr>�r �r r� r r r r� G 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 L r z1CGenerator._generate_enum_body.<locals>.<genexpr>���rl r� r� r r r r� J 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 || �|� 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. rr rj rl N)r, r r r �DeclrB ZCastZUnaryOpZBinaryOpZ TernaryOp�FuncCall�ArrayRef� StructRef�Constantr� ZTypedefrH r ZCompound)r r r� �typrg r r r rt N s � 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 rW rX r, rU r r r rK j 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 r. r/ r( r) z* %s%s�*rZ N)r, r ZTypeDeclZqualsr r Zdeclname� enumeraterA Z ArrayDeclZPtrDeclZ dim_qualsZdimZFuncDeclr0 r� rK ZTypenamerX ZIdentifierTyperD ) r r � modifiersr[ r� rN Znstr�i�modifierr r r rX s 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. r. r/ N)rI )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 r6 r8 r r r r: � r 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. )rA r r� r� r� r� r� r r r r r7 � s �zCGenerator._is_simple_nodeN)F)F)@r � __module__� __qualname__�__doc__r r r r r! r$ r' r+ r- r1 r5 r@ rC rE rI rO rV rY r\ ra rb rf ri rn rp rv rw ry r{ r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� re r� r� rt rK rX r< r* r7 r r r r r sz 5 r N)r r �objectr r r r r �<module> s
💾 Save Changes
❌ Cancel