3
gwU5 @ 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 Zdld d Zd!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^ Z1dmd_d`Z2dadb Z3g fdcddZ4dedf Z5dgdh Z6didj Z7dkS )n
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 !/usr/lib/python3.6/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 kr dS dj fdd|j D S d S )N c 3 s | ]\}} j |V qd S )N)r ).0Zc_namec)r r r # s z+CGenerator.generic_visit..)joinZchildren)r r r )r r r s zCGenerator.generic_visitc C s |j S )N)value)r nr r r visit_Constant% s zCGenerator.visit_Constantc C s |j S )N)name)r r r r r visit_ID( s zCGenerator.visit_IDc C s$ | j |j}|d | j|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 | j|j S )N)r r typer Zfield)r r Zsrefr r r visit_StructRef/ s zCGenerator.visit_StructRefc C s$ | j |j}|d | j|j d S )N())r r r args)r r Zfrefr r r visit_FuncCall3 s zCGenerator.visit_FuncCallc C s\ | j |j}|jdkr d| S |jdkr0d| S |jdkrJd| j|j S d|j|f S d S )Nzp++z%s++zp--z%s--Zsizeofz
sizeof(%s)z%s%s)r expropr )r r Zoperandr r r
visit_UnaryOp7 s
zCGenerator.visit_UnaryOpc s< j |j fdd} j |j fdd}d||j|f S )Nc s j | S )N)_is_simple_node)d)r r r F s z+CGenerator.visit_BinaryOp..c s j | S )N)r* )r+ )r r r r, H s z%s %s %s)_parenthesize_ifleftrightr( )r r Zlval_strrval_strr )r r visit_BinaryOpD s
zCGenerator.visit_BinaryOpc C s* | j |jdd }d| j|j|j|f S )Nc S s t | tjS )N)
isinstancer
Assignment)r r r r r, N s z-CGenerator.visit_Assignment..z%s %s %s)r- Zrvaluer Zlvaluer( )r r r0 r r r visit_AssignmentK s
zCGenerator.visit_Assignmentc C s dj |jS )Nr
)r names)r r r r r visit_IdentifierTypeQ s z CGenerator.visit_IdentifierTypec C sJ t |tjr d| j| d S t |tjr.)r declslenr )r r r> r )r r visit_DeclListf s
zCGenerator.visit_DeclListc C s2 d}|j r |dj|j d 7 }|| j|j7 }|S )Nr r
)storager _generate_typer! )r r r> r r r
visit_Typedefm s
zCGenerator.visit_Typedefc C s( d| j |j d }|d | j|j S )Nr# r$ r
)rE Zto_typer r' )r r r> r r r
visit_Casts s zCGenerator.visit_Castc C s. g }x |j D ]}|j| j| q W dj|S )Nz, )exprsappendr: r )r r visited_subexprsr' r r r visit_ExprListw s zCGenerator.visit_ExprListc C s. g }x |j D ]}|j| j| q W dj|S )Nz, )rH rI r: r )r r rJ r' r r r visit_InitList} s zCGenerator.visit_InitListc C s d}|j r|d|j 7 }|jr|d7 }xXt|jjD ]H\}}||j 7 }|jr`|d| j|j 7 }|t|jjd kr4|d7 }q4W |d7 }|S )Nenumr
z {z = r z, r8 )r values enumerateZ enumeratorsr r rB )r r r> iZ
enumeratorr r r
visit_Enum s
zCGenerator.visit_Enumc sj j |j}d _ j |j}|jrVdj fdd|jD }|d | d | d S |d | d S d S )Nr z;
c 3 s | ]} j |V qd S )N)r )r p)r r r r s z+CGenerator.visit_FuncDef..
)r r@ r bodyZ param_declsr )r r r@ rT Zknrdeclsr )r r
visit_FuncDef s zCGenerator.visit_FuncDefc C sF d}x<|j D ]2}t|tjr,|| j|7 }q || j|d 7 }q W |S )Nr z;
)extr2 r ZFuncDefr )r r r> rV r r r
visit_FileAST s zCGenerator.visit_FileASTc s` j d } jd7 _|jr>|dj fdd|jD 7 } jd8 _| j d 7 }|S )Nz{
r c 3 s | ]} j |V qd S )N)_generate_stmt)r stmt)r r r r s z,CGenerator.visit_Compound..z}
)r r Z block_itemsr )r r r> r )r r visit_Compound s zCGenerator.visit_Compoundc C s dS )N;r )r r r r r visit_EmptyStatement s z CGenerator.visit_EmptyStatementc s dj fdd|jD S )Nz, c 3 s | ]} j |V qd S )N)r )r Zparam)r r r r s z-CGenerator.visit_ParamList..)r Zparams)r r r )r r visit_ParamList s zCGenerator.visit_ParamListc C s& d}|j r |d| j|j 7 }|d S )Nreturnr
r\ )r' r )r r r> r r r visit_Return s zCGenerator.visit_Returnc C s dS )Nzbreak;r )r r r r r visit_Break s zCGenerator.visit_Breakc C s dS )Nz continue;r )r r r r r visit_Continue s zCGenerator.visit_Continuec C s8 | j |jd }|| j |jd 7 }|| j |j7 }|S )Nz ? z : )r: condiftrueiffalse)r r r> r r r visit_TernaryOp s zCGenerator.visit_TernaryOpc C sd d}|j r|| j|j 7 }|d7 }|| j|jdd7 }|jr`|| j d 7 }|| j|jdd7 }|S )Nzif (z)
T)
add_indentzelse
)rc r rY rd re r )r r r> r r r visit_If s zCGenerator.visit_Ifc C s~ d}|j r|| j|j 7 }|d7 }|jr<|d| j|j 7 }|d7 }|jr^|d| j|j 7 }|d7 }|| j|jdd7 }|S )Nzfor (r\ r
z)
T)rg )r< r rc nextrY rZ )r r r> r r r visit_For s zCGenerator.visit_Forc C s: d}|j r|| j|j 7 }|d7 }|| j|jdd7 }|S )Nzwhile (z)
T)rg )rc r rY rZ )r r r> r r r visit_While s zCGenerator.visit_Whilec C sJ d}|| j |jdd7 }|| j d 7 }|jr>|| j|j7 }|d7 }|S )Nzdo
T)rg zwhile (z);)rY rZ r rc r )r r r> r r r
visit_DoWhile s zCGenerator.visit_DoWhilec C s, d| j |j d }|| j|jdd7 }|S )Nzswitch (z)
T)rg )r rc rY rZ )r r r> r r r visit_Switch s zCGenerator.visit_Switchc C s: d| j |j d }x |jD ]}|| j|dd7 }q W |S )Nzcase z:
T)rg )r r' stmtsrY )r r r> rZ r r r
visit_Case s zCGenerator.visit_Casec C s* d}x |j D ]}|| j|dd7 }q W |S )Nz default:
T)rg )rn rY )r r r> rZ r r r
visit_Default s zCGenerator.visit_Defaultc C s |j d | j|j S )Nz:
)r rY rZ )r r r r r visit_Label s zCGenerator.visit_Labelc C s d|j d S )Nzgoto r\ )r )r r r r r
visit_Goto s zCGenerator.visit_Gotoc C s dS )Nz...r )r r r r r visit_EllipsisParam s z CGenerator.visit_EllipsisParamc C s | j |dS )Nstruct)_generate_struct_union)r r r r r visit_Struct s zCGenerator.visit_Structc C s | j |jS )N)rE r! )r r r r r visit_Typename s zCGenerator.visit_Typenamec C s | j |dS )Nunion)ru )r r r r r visit_Union s zCGenerator.visit_Unionc C sf d}xH|j D ]>}t|tjr,|d|j 7 }q t|tjr |d|j d 7 }q W |d| j|j 7 }|S )Nr .r r z = )r r2 r IDConstantr r r' )r r r> r r r r visit_NamedInitializer s z!CGenerator.visit_NamedInitializerc C s
| j |S )N)rE )r r r r r visit_FuncDecl s zCGenerator.visit_FuncDeclc C s |d |j pd }|jr~|d7 }|| j 7 }| jd7 _|d7 }x |jD ]}|| j|7 }qJW | jd8 _|| j d 7 }|S )ze Generates code for structs and unions. name should be either
'struct' or union.
r
r rS rX z{
r8 )r rA r r rY )r r r r> r@ r r r ru s z!CGenerator._generate_struct_unionc C s t |}|r| jd7 _| j }|r4| jd8 _|tjtjtjtjtjtj tj
tj tj tj
tjtjtjf
kr|| j| d S |tjfkr| j|S || j| 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.
rX z;
rS N)r! r r r Declr3 ZCastZUnaryOpZBinaryOpZ TernaryOpFuncCallArrayRef StructRefr| r{ ZTypedefr9 r ZCompound)r r rg typindentr r r rY ( s
zCGenerator._generate_stmtc C sH d}|j rdj|j d }|jr4|dj|jd 7 }|| j|j7 }|S )z& Generation from a Decl node.
r r
)Zfuncspecr rD rE r! )r r r> r r r r; D s zCGenerator._generate_declc C s t |}|tjkrNd}|jr2|dj|jd 7 }|| j|j 7 }|jrN|jnd}xt|D ]\}}t|tj r|dkrt||d tj
rd| d }|d| j|j d 7 }q\t|tj r|dkrt||d tj
rd| d }|d| j|j
d 7 }q\t|tj
r\|jr,d dj|j|f }q\d
| }q\W |rJ|d| 7 }|S |tjkrf| j|j S |tjkr~| j|j S |tjkrdj|jd S |tj tj
tj fkr| j|j ||g S | j|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*N)r! r ZTypeDeclZqualsr r ZdeclnamerO r2 Z ArrayDeclZPtrDeclZdimZFuncDeclr% r r; ZTypenamerE ZIdentifierTyper5 )r r Z modifiersr r> ZnstrrP Zmodifierr r r rE M s@ zCGenerator._generate_typec C s& | j |}||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)r: )r r Z conditionr> r r r r- { s
zCGenerator._parenthesize_ifc s j | fddS )z. Common use case for _parenthesize_if
c s j | S )N)r* )r+ )r r r r, s z8CGenerator._parenthesize_unless_simple..)r- )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.
)r2 r r| r{ r r r )r r r r r r* s zCGenerator._is_simple_nodeN)F)F)8r
__module__ __qualname____doc__r r r r r r r r" r& r) r1 r4 r6 r: r? rC rF rG rK rL rQ rU rW r[ r] r^ r` ra rb rf rh rj rk rl rm ro rp rq rr rs rv rw ry r} r~ ru rY r; rE r- r r* r r r r r sj
.
r N)r r objectr r r r r s