a
    .c;                     @   s0   d dl mZ dd Zdd Zdd Zdd	 Zd
S )   )c_astc                 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 }qB|du r|j	| qB|j	| qB|| _| S )a   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   ZSwitchstmtZCompoundZcoordZblock_itemsCaseDefaultappend_extract_nested_casestmts)Zswitch_nodeZnew_compoundZ	last_casechild r   R/var/www/brookimports/venv/lib/python3.9/site-packages/pycparser/ast_transforms.pyfix_switch_cases   s    3r   c                 C   s:   t | jd tjtjfr6|| j  t|d | 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   r   popr	   )Z	case_nodeZ
stmts_listr   r   r   r	   c   s    r	   c                 C   s~   t | \} }|s qq | }t|tjsHz
|j}W q tyD   |  Y S 0 qd|jv rhd| jvrh| jd |jdu rz| j	|_| S )aK   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.
    _AtomicN)
_fix_atomic_specifiers_oncer   r   TypeDecltypeAttributeErrorqualsr   Zdeclnamename)declfoundtypr   r   r   fix_atomic_specifiersl   s    

r   c                 C   s   | }d}| j }|dur^t|tjr.d|jv r.q^z|}|}|j }W q tyZ   | df Y S 0 qt|tjsnJ |j |_ d|j jvr|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   ZTypenamer   r   r   r   )r   parentZgrandparentnoder   r   r   r      s"    
r   N) r   r   r	   r   r   r   r   r   r   <module>
   s   V	 