a
_^< @ s d dl mZ G dd deZdS ) )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~dodpZ:dqdr Z;g dsfdtduZdzd{ 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_levelself 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 nodemethodr r r
visit s zCGenerator.visitc s, |d u r dS d fdd| D S d S )N c 3 s | ]\}} |V qd S Nr ).0Zc_namecr r r
# z+CGenerator.generic_visit..)joinZchildren)r r r r r
r s zCGenerator.generic_visitc C s |j S r )valuer 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* expropr )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_nodedr r r
L r z+CGenerator.visit_BinaryOp..c s | S r r6 r8 r r r
r: N r %s %s %s)_parenthesize_ifleftrightr3 )r r Zlval_strrval_strr r r
visit_BinaryOpJ s
zCGenerator.visit_BinaryOpc C s* | |jdd }d| |j|j|f S )Nc S s t | tjS r )
isinstancer
Assignment)r r r r
r: T r z-CGenerator.visit_Assignment..r; )r< Zrvaluer Zlvaluer3 )r r r? r r r
visit_AssignmentQ s
zCGenerator.visit_Assignmentc C s d |jS r )r namesr r r r
visit_IdentifierTypeW s z CGenerator.visit_IdentifierTypec C sJ t |tjr d| | d S t |tjr.)r declslenr r r rN r r r
visit_DeclListl s zCGenerator.visit_DeclListc C s2 d}|j r |d|j d 7 }|| |j7 }|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 ZexprsappendrI 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 |ddS )Nenumr" _generate_struct_union_enumr r r r
visit_Enum s zCGenerator.visit_Enumc C s< |j sdj| |jdS dj| |j| |j dS 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..
)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|tjr*|| |7 }q
t|tjrJ|| |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..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..)r paramsr r r r
visit_ParamList s zCGenerator.visit_ParamListc C s& d}|j r |d| |j 7 }|d S )Nreturnr
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 condiftrueiffalserU r r r
visit_TernaryOp s zCGenerator.visit_TernaryOpc C sd d}|j r|| |j 7 }|d7 }|| j|jdd7 }|jr`|| d 7 }|| j|jdd7 }|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|jdd7 }|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|jdd7 }|S )Nwhile (r Tr )r r rt ru rU r r r
visit_While s
zCGenerator.visit_Whilec C sJ d}|| j |jdd7 }|| d 7 }|jr>|| |j7 }|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|jdd7 }|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|dd7 }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|dd7 }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 | |dS )Nstructrd r r r r
visit_Struct s zCGenerator.visit_Structc C s | |jS r )rX r, r r r r
visit_Typename s zCGenerator.visit_Typenamec C s | |dS )Nunionrd r r r r
visit_Union s zCGenerator.visit_Unionc C sZ d}|j D ]6}t|tjr*|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 |ddS NFrZ r r r r r
visit_ArrayDecl& s zCGenerator.visit_ArrayDeclc C s | j |ddS r r r r r r
visit_TypeDecl) s zCGenerator.visit_TypeDeclc C s | j |ddS r r r r r r
visit_PtrDecl, s zCGenerator.visit_PtrDeclc C s |dv r|j }| j}n |jdu r$dn|jj}| j}|d |jp@d }|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 Nr
r rl rr rq rG )rS _generate_struct_union_bodyvaluesZ 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..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..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 TernaryOpFuncCallArrayRef StructRefConstantr 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|jd 7 }|| |j7 }|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 |}|tjkrd}|jr2|d|jd 7 }|| |j 7 }|jrR|rR|jnd}t|D ]\}}t|tj r|dkrt||d tj
rd| d }|d7 }|j r|d|j d 7 }|| |j d 7 }q^t|tj
r(|dkrt||d tj
rd| d }|d| |j d 7 }q^t|tj
r^|jr`d d|j|rVd| ndf }q^d
| }q^|r||d| 7 }|S |tjkr| |j S |tjkr| j|j |d S |tjkrd|jd 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 Znstrimodifierr 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 | fddS )z. Common use case for _parenthesize_if
c s | S r r6 r8 r r r
r: r z8CGenerator._parenthesize_unless_simple..)r< r r r r
r* s z&CGenerator._parenthesize_unless_simplec C s t |tjtjtjtjtjfS )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
s