o 4a]@ã@s ddlmZdd„Zdd„ZdS)é)Úc_astcCsªt|tjƒsJ‚t|jtjƒs|St g|jj¡}d}|jjp gD].}t|tjtjfƒr>|j  |¡t ||jƒ|jd}q!|durI|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 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éÿÿÿÿ) Ú isinstancerZSwitchÚstmtZCompoundZcoordZ block_itemsÚCaseÚDefaultÚappendÚ_extract_nested_caseÚstmts)Z switch_nodeZ new_compoundZ last_caseÚchild©r únhome/ych/rk3568/buildroot/output/rockchip_rk3568/host/lib/python3.10/site-packages/pycparser/ast_transforms.pyÚfix_switch_cases s3   rcCs>t|jdtjtjfƒr| |j ¡¡t|d|ƒdSdS)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 r csþr N)Úrrr r r r r Ús  V