U °–_ð ã@s ddlmZdd„Zdd„ZdS)é)Úc_astcCs–t|jtjƒs|St g|jj¡}d}|jjD]\}t|tjtjfƒrh|j |¡t ||jƒ|jd}q.|dkr~|j |¡q.|j  |¡q.||_|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. Néÿÿÿÿ) Ú isinstanceZstmtrZCompoundZcoordZ block_itemsÚCaseÚDefaultÚappendÚ_extract_nested_caseÚstmts)Z switch_nodeZ new_compoundZ last_caseZchild©r ú/ast_transforms.pyÚfix_switch_cases s4    r cCs:t|jdtjtjfƒr6| |j ¡¡t|d|ƒdS)z€ Recursively extract consecutive Case statements that are made nested by the parser and add them to the stmts_list. érN)rr rrrrÚpopr)Z case_nodeZ stmts_listr r r rbsrN)Úrr rr r r r Ú s U