pPjTUdZddlmZddlmZmZddlmZddlm Z ddl m Z m Z m ZddlZddlmZdd lmZdd lmZmZmZmZmZdd lmZdd lmZdd lm Z!ddl"m#Z#m$Z$m%Z%ddl&m'Z'm(Z(m)Z)m*Z*ddl+m,Z,ddl-m.Z.ddl/m0Z0e rddl1m2Z2m3Z3e4e5e6egdffZ7de8d<dZ9de8d<dZ:de8d<gdZ;de8d<d.dZd1d Z?d2d!Z@d1d"ZA d3d#ZBe5eCeezezezedzfZDde8d$<e5eCeCeezezezedzfZEde8d%<d4d&ZF d5d'ZGd.d(ZH d6d)ZId.d*ZJ d7d+ZKd.d,ZLd8d-ZMy)9aTop-level logic for the semantic analyzer. The semantic analyzer binds names, resolves imports, detects various special constructs that don't have dedicated AST nodes after parse (such as 'cast' which looks like a call), populates symbol tables, and performs various simple consistency checks. Semantic analysis of each SCC (strongly connected component; import cycle) is performed in one unit. Each module is analyzed as multiple separate *targets*; the module top level is one target and each function is a target. Nested functions are not separate targets, however. This is mostly identical to targets used by mypy daemon (but classes aren't targets in semantic analysis). We first analyze each module top level in an SCC. If we encounter some names that we can't bind because the target of the name may not have been processed yet, we *defer* the current target for further processing. Deferred targets will be analyzed additional times until everything can be bound, or we reach a maximum number of iterations. We keep track of a set of incomplete namespaces, i.e. namespaces that we haven't finished populating yet. References to these namespaces cause a deferral if they can't be satisfied. Initially every module in the SCC will be incomplete. ) annotations)CallableIterator) nullcontext)groupby) TYPE_CHECKINGFinal TypeAliasN)FineGrainedDeferredNode)Errors) DecoratorFuncDefMypyFileOverloadedFuncDefTypeInfo)Options)ClassDefContext) dataclasses)SemanticAnalyzerapply_semantic_analyzer_patches#remove_imported_names_from_symtable)add_type_promotioncalculate_class_abstract_statuscalculate_class_varscheck_protocol_status)#infer_decorator_signature_if_simple)find_dataclass_transform_spec)TypeArgumentAnalyzer)GraphState _TypeAliasPatchesr MAX_ITERATIONS CORE_WARMUP)typing_collections_abcbuiltinsabc collectionszcollections.abc core_modulescg}t|||t|||t|t|||t |||t |||t ||d|vrt|dt|dk\rQ||dj}|j}|j|j|j|jyy)zPerform semantic analysis for all modules in a SCC (import cycle). Assume that reachability analysis has already been performed. The scc will be processed roughly in the order the modules are included in the list. r)r)type_expression_parse_count(type_expression_full_parse_success_count(type_expression_full_parse_failure_countN)process_top_levelsprocess_functionsrapply_class_plugin_hookscheck_type_argumentscalculate_class_propertiescheck_blockerscleanup_builtin_scclenmanagersemantic_analyzer add_statsr/r0r1)graphsccerrorspatchesr:analyzers V/home/oem/CyberBrain26-unified/.venv/lib/python3.12/site-packages/mypy/semanal_main.pysemantic_analysis_for_sccrCOsGuc7+eS'*$G,UC0V,uc625#SE*-. 3x1}A-'',,(0(L(L5=5f5f5=5f5f  c`|jJt|jjdy)a8Remove imported names from builtins namespace. This way names imported from typing in builtins.pyi aren't available by default (without importing them). We can only do this after processing the whole SCC is finished, when the imported names aren't needed for processing builtins.pyi itself. Nr))treernames)states rBr8r8vs( :: !! !' (8(8*ErDc Zg}td|Drt||jg||jj}|D]`}t |j trt|||j|j j|j |j|bt|t||jg|jjt|||jjt||jg|jjy)aSemantically analyze only selected nodes in a given module. This essentially mirrors the logic of semantic_analysis_for_scc() except that we process only some targets. This is used in fine-grained incremental mode, when propagating an update. c3PK|]}t|jt ywN) isinstancenoder).0ns rB z0semantic_analysis_for_targets..s 7A:affh ' 7s$&N)anyr2idr:r;rLrMrprocess_top_level_functionfullnameactive_typeinforr4r?check_type_arguments_in_targetsr6)rHnodesr=r@rArOs rBsemantic_analysis_for_targetsrXsG 7 775588*g6}}..H   affh ' " eUXXqvv@Q@QSZ  $G,UUXXJ 0D0DE#E5%--2F2FGuuxxj%--2F2FGrDc tt|}|D]D}||}|jJ|jjj |jFjj j||jtfdtDr"ttttzz d}d}|jj}|jjr%|dz }|tkDrN|jJ|j|j|j 5|j#dddn|r$|jj jg}d} rwj%} || }|jJt'| | ||jd||\} } } || z }| xs| } | s%|jj j)| rw|r |rJdtt|| }r%|j*jy#1swYxYw)Nc3&K|]}|v ywrK)rNmworklists rBrPz%process_top_levels..s /Q1= /Frr.%Must not defer during final iteration)listreversedrFr:r; prepare_fileincomplete_namespacesupdatecopyallr,r&deferral_debug_contextclearr$ file_contextoptions report_hangpopsemantic_analyze_targetdiscard saved_locals)r=r>r@rRrHfinal_iteration iterationrA all_deferred any_progressnext_iddeferred incompleteprogressr]s @rBr2r2s x} CAb zz%%% ''44UZZ@A  MM''..s3xxzH /, //D,/0;>>OI}}..H ##))+ Q ~ %::) ))&&uzz5==A '$$& '   MM / / 5 5 7"$  llnG'NE::) ))-D%T?G. *Hj( H $L'38L 33;;GD # L%L L#./**; @ !7 ' 's IIc# Kt|dDcgc]\}}|t|f}}}|Dchc] \}}| | c}} d}|r|t|k\r td||\}}||Ed{|j |At fd|j ddDr|dz }h|Ed{|j | j|d}|ryycc}}wcc}}w7|7;w)zMake sure that superclass methods are always processed before subclass methods. This algorithm is not very optimal, but it is simple and should work well for lists that are already almost correctly ordered. c |dS)Nr[xs rBz&order_by_subclassing..s qtrDkeyNrz"Cannot order method targets by MROc3&K|]}|v ywrKr[)rNparentremaining_infoss rBrPz'order_by_subclassing..sIVv(Ir^r.)rr`r9 ValueErrorrlrQmrorn) targetskggroupedinfo_ next_group next_infogrouprs @rBorder_by_subclassingrs)0^(LM147|MGM+2Gad6FtGOJ  W %AB B":. 5     KK #  Iy}}QR7HI I !OJ  J * )  NG  sDC4C$C4 C*C*0C43C04AC46C27*C4"C42C4c g}|D]W}||j}|Jtt|d}|j|D cgc] \}}} |||| fc} }}Yt |D]V\}}}} ||j j } t|tttfsJ|t| |||||| |Xycc} }}w)Nc*|dj|dfS)Nr.r)liner{s rBr}z#process_functions.. sAaDIIqQRtCTrDr~) rFsortedget_all_leaf_targetsextendrr:r;rLrrr rS) r=r>r@ all_targetsmodulerFrtargetrM active_typerAs rBr3r3sK  V}!!-d39TURY Z Z5NVT;ffdK 0 Z   .B+-N )k=((::$*;Y GHN$NH" eFmVVT;   [sCc d}d}|g} |jj|jj|d} | r| dz } | tk(rN|j J|j |j |j5|jdddno| s|r|r|jj|t|||||||\} }} |s%|jjj||r | rJd| sd}| r|jj||jjy#1swYxYw)zAnalyze single top-level function or method. Process the body of the function (including nested functions) again and again, until all names have been resolved (or iteration limit reached). FTrr.Nr_) rgrhrcaddr$rFrirjrkrnrmr:ro) rArHrrrMrr@rprvrurqrws rBrSrSsBOJxH ##))+ ""&&v.I Q  &::) ))&&uzz5==A '$$& ' J?  * * 2 26 :)@ FE4ow* &*h MM / / 7 7 ?  H!H H<"O' * ""**62 !' ' 's EE  TargetInfoFullTargetInfocg}|jD]J\}}}t|jttt fs-|j ||j|fL|S)zEReturn all leaf targets in a symbol table (module-level and methods).)local_definitionsrLrMrrr append)fileresultrTrMrs rBrrTsZ!F'+'='='?>#$ dii'+ MrDc |jjj||f|j}|J|jj}t g|_t g|_|j|_ t |_ d|_ |jd5|} t| tr | j} |j!| ||||j"|t|tr t%||dddd|_|`|j*r|g|j,|jfSg|j,|jfS#1swYQxYw)zSemantically analyze a single target. Return tuple with these items: - list of deferred targets - was some definition incomplete (need to run another pass) - were any new names defined (or placeholders replaced) NFr7) file_noderjr)r:processed_targetsrrFr;set global_declsnonlocal_declsrGglobalsimportsrw wrap_contextrLr funcrefresh_partialrjr statement cur_mod_noderurv) rrrHrMrrpr@rFrA refresh_nodes rBrmrm]sK  MM##**FF+;< ::D   }}..H UGH"ugHzzHuHH   5  1@ lI .',,L    MM# !  dI & /h ?@$Hx,,h.?.???8&&(9(9991@@s 'AEEc|D]}||}|jsJt||j|jj|j|jj j }|j5tjjj|jj5|jj|ddddddy#1swYxYw#1swYxYwrK) rFrrjis_typeshed_filer:r; named_typermypyrHstrict_optional_setstrict_optionalaccept)r=r>r?rrHrAs rBr5r5s ,f zzz'  MM JJ ' ' 6 MM + + 6 6      ! ,!!55emm6S6ST , !!(+ , , , , , , , ,s$>C;C/C;/C8 4C;;D c 2|jsJt||j|jj|j|jj j }|j5tjjj|jj5|D]}d}t|jttfr |j}|j |j"|f}|j$r|j$j'|n t)5|du|_|jj-|ddd ddddddy#1swYxYw#1swYxYw#1swYyxYw)zCheck type arguments against type variable bounds and restrictions. This mirrors the logic in check_type_arguments() except that we process only some targets. This is used in fine grained incremental mode. N)rFrrjrr:r;rrrrHrrrLrMrrrRrUscope saved_scoperrecurse_into_functionsr)rrHr?rArrsaveds rBrVrVsH :::#  ##EMM2 ''22 H     1 ZZ   1 1%--2O2O P 1! 1;?fkkG5F+GH!;;D6#9#94@8> V\\--e4+-16:$6FH3KK&&x011  1 1 1 111  1 1 1 1s=8>F 6A>F4%E5  F$F 5E> :FF F  Fc d}d}|r|dksJd|dz }d}|D]}||}|j}|sJ|j5|jD]\\}} }t| jt s"t |jj|| j|j||r[d}^ ddd|ryy#1swYxYw)a3Apply class plugin hooks within a SCC. We run these after to the main semantic analysis so that the hooks don't need to deal with incomplete definitions such as placeholder types. Note that some hooks incorrectly run during the main semantic analysis pass, for historical reasons. rT z1Internal error: too many class plugin hook passesr.FN) rFrrrLrMrapply_hooks_to_classr:r;rj) r=r>r? num_passesrvrrHrFrrMs rBr4r4sJJ BS SSa   .F&ME::DK4##% ."&"8"8": .JAtQ!$))X63!MM;;" II!MM "  *.J . . .  .  . .s2C78C0CC c $|j}d}|jD]}|j|||5d} |j|} | r|jj | } | t |rtj} | r|xr| t|||}dddt |} | H|j|||5|xr&tj||| |j}ddd|S|S#1swYxYw#1swY|SxYw)NT) defn decoratorsriget_fullname_for_hookpluginget_class_decorator_hook_2rdataclasses_plugindataclass_class_maker_callbackrDataclassTransformer transform) selfrrrjrr?rok decoratorhookdecorator_namespecs rBrrs* 99D B__I   y'4 8 ID!77 BN{{==nM| =i H)HHHDy$!GH I II$ ) .D    y'4 8 dc*??dDRVWaacB d I2I1 I I& d IsA'C9+D9D Dc |dj}|sJ|D]0}||}|j}|sJ|jD]\}}}t|jts#|j 5|j jj||j|j5t|j|j|t|j|t|jt|j|j||j|jdddddd3y#1swYxYw#1swY"xYw)Nr))rFrrLrMrrr:r;rirjris_stubrrrrG) r=r>r?r)rrHrFrrMs rBr6r6s&Z %%H O8f zz t002 JAtQ$))X.&&( MM33@@u}}VZV_V_` 4DIIt||VT)$))V<(3& 4::uV}/D/Dhnn         s%2rs rBr7r7s!' f $$&'rD)r=rr> list[str]r?r returnNone)rHr rr)rHr rWlist[FineGrainedDeferredNode]r=rrr)r=rr>rr@r"rr)rzlist[FullTargetInfo]rzIterator[FullTargetInfo])rArrHr rstrrrrMz'FuncDef | OverloadedFuncDef | DecoratorrTypeInfo | Noner@r"rr)rrrzlist[TargetInfo])rrrrrHr rMz2MypyFile | FuncDef | OverloadedFuncDef | Decoratorrrrpboolr@r"rztuple[list[str], bool, bool])rrrHr r?r rr)rrrrrrrjrrrr?r rr)r=rr>rrr)N__doc__ __future__rcollections.abcrr contextlibr itertoolsrr'rr r r! mypy.stater mypy.checkerr mypy.errorsr mypy.nodesr rrrr mypy.optionsr mypy.pluginr mypy.pluginsrr mypy.semanalrrrmypy.semanal_classproprrrrmypy.semanal_inferrmypy.semanal_sharedrmypy.semanal_typeargsr mypy.buildrr r`tupleintr"__annotations__r$r&r,rCr8rXr2rr3rSrrrrrmr5rVr4rr6r7r[rDrBrs|4#."@@0PP ':  C=6'5hr4x&8!89:: U e$ N FH H6H?DH H6:"z!H 4/"/" /" /"  /" 2 /" ! /"/" /"dG / /) ;X_L J #h #44y@(T/Q  2: 2: 2: 2: = 2: ! 2:  2:2:"2:j ,1 *1381BH1 16!.H$ $ $ $ $  $  $ $N*'rD