B CrX[ @s ddlmZddZddZdS))c_astcCst|tjstt|jtjs"|Stg|jj}d}xh|jjD]\}t|tjtj frz|j |t ||j|jd}q@|dkr|j |q@|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 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) isinstancerZSwitchAssertionErrorZstmtZCompoundZcoordZ block_itemsCaseDefaultappend_extract_nested_casestmts)Z switch_nodeZ new_compoundZ last_caseZchildr 7lib/python3.7/site-packages/pycparser/ast_transforms.pyfix_switch_cases s3   r cCs:t|jdtjtjfr6||jt|d|dS)z Recursively extract consecutive Case statements that are made nested by the parser and add them to the stmts_list. rN)rr rrrrpopr )Z case_nodeZ stmts_listr r r r bsr N)rr r r r r r  s U