o
    'òvi  ã                   @   s®   d dl mZmZmZmZ ddlmZ dejdejfdd„Zdej	ej
B d	eej dd
fdd„ZdejejB dejejB fdd„ZdejejB deejejB ef fdd„Zd
S )é    )ÚAnyÚListÚTupleÚcasté   )Úc_astÚswitch_nodeÚreturnc                 C   sª   t | tjƒsJ ‚t | jtjƒs| S t g | jj¡}d}| jjp g D ].}t |tjtjfƒr>|j 	|¡ t
||jƒ |jd }q!|du rI|j 	|¡ q!|j 	|¡ q!|| _| S )a3  The 'case' statements in a 'switch' come out of parsing with one
    child node, so subsequent statements are just tucked to the parent
    Compound. Additionally, consecutive (fall-through) case statements
    come out messy. This is a peculiarity of the C grammar. The following:

        switch (myvar) {
            case 10:
                k = 10;
                p = k + 1;
                return 10;
            case 20:
            case 30:
                return 20;
            default:
                break;
        }

    Creates this tree (pseudo-dump):

        Switch
            ID: myvar
            Compound:
                Case 10:
                    k = 10
                p = k + 1
                return 10
                Case 20:
                    Case 30:
                        return 20
                Default:
                    break

    The goal of this transform is to fix this mess, turning it into the
    following:

        Switch
            ID: myvar
            Compound:
                Case 10:
                    k = 10
                    p = k + 1
                    return 10
                Case 20:
                Case 30:
                    return 20
                Default:
                    break

    A fixed AST node is returned. The argument may be modified.
    Néÿÿÿÿ)Ú
isinstancer   ÚSwitchÚstmtÚCompoundÚcoordÚblock_itemsÚCaseÚDefaultÚappendÚ_extract_nested_caseÚstmts)r   Únew_compoundÚ	last_caseÚchild© r   úW/home/air/biblejyuku/back/venv/lib/python3.10/site-packages/pycparser/ast_transforms.pyÚfix_switch_cases   s   3r   Ú	case_nodeÚ
stmts_listNc                 C   sD   t | jd tjtjfƒr | j ¡ }| |¡ ttt	|ƒ|ƒ dS dS )z{Recursively extract consecutive Case statements that are made nested
    by the parser and add them to the stmts_list.
    r   N)
r   r   r   r   r   Úpopr   r   r   r   )r   r   Únestedr   r   r   r   e   s
   

ýr   Údeclc                 C   sŠ   	 t | ƒ\} }|s
nq| }t|tjƒs*z|j}W n ty#   |  Y S w t|tjƒrd|jv r:d| jvr:| j d¡ |jdu rC| j	|_| S )a:  Atomic specifiers like _Atomic(type) are unusually structured,
    conferring a qualifier upon the contained type.

    This function fixes a decl with atomic specifiers to have a sane AST
    structure, by removing spurious Typename->TypeDecl pairs and attaching
    the _Atomic qualifier in the right place.
    TÚ_AtomicN)
Ú_fix_atomic_specifiers_oncer   r   ÚTypeDeclÚtypeÚAttributeErrorÚqualsr   ÚdeclnameÚname)r    ÚfoundÚtypr   r   r   Úfix_atomic_specifiersq   s$   ý
ÿý
r+   c                 C   s°   | }d}| j }|dur2t|tjƒrd|jv rnz	|}|}|j }W n ty-   | df Y S w |dust|tjƒs:J ‚|dus@J ‚|j tt|ƒ_ d|j jvrT|j j 	d¡ | dfS )z~Performs one 'fix' round of atomic specifiers.
    Returns (modified_decl, found) where found is True iff a fix was made.
    Nr!   FT)
r$   r   r   ÚTypenamer&   r%   r#   r   r   r   )r    ÚparentÚgrandparentÚnoder   r   r   r"   “   s(   
üùr"   )Útypingr   r   r   r   Ú r   r   r   r   r   ÚNoder   ÚDeclÚTypedefr+   Úboolr"   r   r   r   r   Ú<module>   s(   	V
ÿÿ
þ
ÿ

þ"
ÿþ