§
    ¢”j  ã                   ó*  — d dl mZmZmZmZ ddlmZ dej        dej        fd„Zdej	        ej
        z  deej                 dd	fd
„Zdej        ej        z  dej        ej        z  fd„Zdej        ej        z  deej        ej        z  ef         fd„Zd	S )é    )ÚAnyÚListÚTupleÚcasté   )Úc_astÚswitch_nodeÚreturnc                 ó&  — t          | t          j        ¦  «        sJ ‚t          | j        t          j        ¦  «        s| S t          j        g | j        j        ¦  «        }d}| j        j        pg D ]œ}t          |t          j        t          j        f¦  «        r=|j         	                    |¦  «         t          ||j        ¦  «         |j        d         }Œe|€|j         	                    |¦  «         Œ‚|j         	                    |¦  «         Œ�|| _        | 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Úchilds       úg/var/www/finuniver-perm.ru/html/portfolio/venv/lib/python3.11/site-packages/pycparser/ast_transforms.pyÚfix_switch_casesr      s  € õf �k¥5¤<Ñ0Ô0Ð0Ð0Ð0Ý�kÔ&­¬Ñ7Ô7ð ØÐõ ”> " kÔ&6Ô&<Ñ=Ô=€Lð 48€Ið
 Ô!Ô-Ð3°ð .ð .ˆÝ�e�eœj­%¬-Ð8Ñ9Ô9ð 	.ð
 Ô$×+Ò+¨EÑ2Ô2Ð2Ý  ¨Ô(@ÑAÔAÐAØ$Ô0°Ô4ˆIˆIð Ð ØÔ(×/Ò/°Ñ6Ô6Ð6Ð6à”×&Ò& uÑ-Ô-Ð-Ð-à#€KÔØÐó    Ú	case_nodeÚ
stmts_listNc                 ó  — t          | j        d         t          j        t          j        f¦  «        rS| 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   Únesteds      r   r   r   e   sw   € õ �)”/ !Ô$¥u¤zµ5´=Ð&AÑBÔBð <Ø”×$Ò$Ñ&Ô&ˆØ×Ò˜&Ñ!Ô!Ð!Ý�T¥# vÑ.Ô.°
Ñ;Ô;Ð;Ð;Ð;ð<ð <r   Údeclc                 óT  — 	 t          | ¦  «        \  } }|snŒ| }t          |t          j        ¦  «        s5	 |j        }n# t
          $ r | cY S w xY wt          |t          j        ¦  «        ¯5d|j        v r#d| j        vr| j                             d¦  «         |j        €| 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Ú_Atomic)
Ú_fix_atomic_specifiers_oncer   r   ÚTypeDeclÚtypeÚAttributeErrorÚqualsr   ÚdeclnameÚname)r#   ÚfoundÚtyps      r   Úfix_atomic_specifiersr/   q   sÒ   € ðÝ1°$Ñ7Ô7‰ˆˆeØð 	Øðð €CÝ˜�eœnÑ-Ô-ð ð	Ø”(ˆCˆCøÝð 	ð 	ð 	ØˆKˆKˆKð	øøøõ ˜�eœnÑ-Ô-ð ð
 �C”IÐÐ )°4´:Ð"=Ð"=ØŒ
×Ò˜)Ñ$Ô$Ð$Ø
„|ÐØ”yˆŒà€Ks   µ= ½AÁAc                 óŠ  — | }d}| j         }|�Gt          |t          j        ¦  «        r
d|j        v rn#	 |}|}|j         }n# t
          $ r | dfcY S w xY w|­Gt          |t          j        ¦  «        sJ ‚|€J ‚|j         t          t          |¦  «        _         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   ÚTypenamer*   r)   r'   r   r   r   )r#   ÚparentÚgrandparentÚnodes       r   r&   r&   “   sö   € ð €FØ€KØ”	€DØ
Ð
Ý�d�EœNÑ+Ô+ð 	°	¸T¼ZÐ0GÐ0GØð	Ø ˆKØˆFØ”9ˆDˆDøÝð 	ð 	ð 	ð ˜�;ÐÐÐð		øøøð Ð
õ �f�eœnÑ-Ô-Ð-Ð-Ð-ØÐ"Ð"Ð"Ø"&¤)…D�ˆkÑÔÔØ˜œ	œÐ'Ð'ØŒ	Œ×Ò˜yÑ)Ô)Ð)Ø�ˆ:Ðs   ³? ¿AÁA)Útypingr   r   r   r   Ú r   r   r   r   r   ÚNoder   ÚDeclÚTypedefr/   Úboolr&   © r   r   ú<module>r<      s'  ðð *Ð )Ð )Ð )Ð )Ð )Ð )Ð )Ð )Ð )Ð )Ð )à Ð Ð Ð Ð Ð ðS %¤,ð S°5´<ð Sð Sð Sð Sðl	<ØŒz˜EœMÑ)ð	<Ø7;¸E¼JÔ7Gð	<à	ð	<ð 	<ð 	<ð 	<ðØ
Œ*�u”}Ñ
$ðà
„Z�%”-Ñðð ð ð ðDØ
Œ*�u”}Ñ
$ðà
ˆ5Œ:˜œÑ% tÐ+Ô,ðð ð ð ð ð r   