o
    ⹏i                     @   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   U/home/ubuntu/veenaModal/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




"
