
Ѯh;                 @   sD   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 t  t  |  j t j  s1 |  St j g  |  j j  } d } x |  j j pa g  D] } t  | t j t j	 f  r | j j
 |  t | | j  | j d } qb | d k r | j j
 |  qb | j j
 |  qb W| |  _ |  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.
    Nr   )
isinstancer   SwitchAssertionErrorstmtCompoundcoordblock_itemsCaseDefaultappend_extract_nested_casestmts)Zswitch_nodeZnew_compoundZ	last_casechild r   ../pycparser/ast_transforms.pyfix_switch_cases   s    3	r   c             C   sM   t  |  j d t j t j f  rI | j |  j 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   Nr   )r   r   r   r   r   r   popr   )Z	case_nodeZ
stmts_listr   r   r   r   c   s    "r   c             C   s   x t  |   \ }  } | s Pq W|  } x< t | t j  sd y | j } Wq) t k
 r` |  SYq) Xq) Wd | j k r d |  j k r |  j j d  | j d k r |  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   declnamename)declfoundtypr   r   r   fix_atomic_specifiersl   s    
r!   c             C   s   |  } d } |  j  } xj | d k	 r t | t j  rF d | j k rF Py | } | } | j  } Wq t k
 r} |  d f SYq Xq Wt | t j  s t  | j  | _  d | j  j k r | j  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   parentZgrandparentnoder   r   r   r      s"    	!r   N) r   r   r   r!   r   r   r   r   r   <module>
   s   V	 