/usr/lib/python2.6/site-packages/pycparser
Edit: /usr/lib/python2.6/site-packages/pycparser/ast_transforms.pyc (2816B)
Ńň
KVc @ s& d d k l Z d Z d Z d S( i ( t c_astc C ső t | t i p t t | i t i p | St i g | i i } d } x | i i D] } t | t i t i
f o1 | i i | t | | i | i d } q` | d j o | i i | q` | i
i | q` W| | _ | S( sÜ 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.
i˙˙˙˙N( t
isinstanceR t Switcht AssertionErrort stmtt Compoundt coordt Nonet block_itemst Caset Defaultt appendt _extract_nested_caset stmts( t switch_nodet new_compoundt last_caset child( ( s< /usr/lib/python2.6/site-packages/pycparser/ast_transforms.pyt fix_switch_cases
s 3
c C sR t | i d t i t i f o+ | i | i i t | d | n d S( s Recursively extract consecutive Case statements that are made nested
by the parser and add them to the stmts_list.
i i˙˙˙˙N( R R
R R R
R t popR ( t case_nodet
stmts_list( ( s< /usr/lib/python2.6/site-packages/pycparser/ast_transforms.pyR b s #N( t R R R ( ( ( s< /usr/lib/python2.6/site-packages/pycparser/ast_transforms.pyt
s U