Your IP : 216.73.216.213
I�]�
� @ s, d d l m 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 D]� } t | t j t j f � r� | j j
| � t | | j � | j d } q\ | d k r� | j j
| � q\ | j j
| � q\ 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 it 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 b s "r N)� r r r r r r r �<module>
s U