o 1&iB@sLdZddlZddlZddlZddlmZddlmZddlmZddl m Z ddl m Z m Z mZddlmZmZdd lmZeeZd d ZGd d d ZddZddZddZddZddZddZddZddZ ddZ!d d!Z"d"d#Z#Gd$d%d%Z$Gd&d'd'e$Z%Gd(d)d)Z&Gd*d+d+e$Z'Gd,d-d-e$Z(d.d/Z)dS)0a Implement Dominance-Fronter-based SSA by Choi et al described in Inria SSA book References: - Static Single Assignment Book by Inria http://ssabook.gforge.inria.fr/latest/book.pdf - Choi et al. Incremental computation of static single assignment form. N)reduce)copy) defaultdict)config)irir_utilserrors) OrderedSet _lazy_pformat)compute_cfg_from_blockscCst|j|_|S)znApply SSA reconstruction algorithm on the given IR. Produces minimal SSA using Choi et al algorithm. )_run_ssablocks)Zfunc_irr9C:\wamp64\www\opt\env\Lib\site-packages\numba/core/ssa.pyreconstruct_ssas rc@seZdZddZddZdS)_CacheListVarscCs i|_dSN)_savedselfrrr__init__% z_CacheListVars.__init__cCs*|j|}|dur||j|<}|Sr)rget list_vars)rinstgotrrrr(s z_CacheListVars.getN)__name__ __module__ __qualname__rrrrrrr$s rcCs|siSt|}t|}t||}t}|D] }td|t||\}}tdt|t||||||}qt|}||krDt d|S)z7Run SSA reconstruction on IR blocks of a function. zFix SSA violator on var %szReplaced assignments: %szCFG mutated in SSA pass) r _iterated_domfronts_find_defs_violatorsr_loggerdebug _fresh_varsr _fix_ssa_varsrZ CompilerError)r cfgdf_plus violatorscache_list_varsvarnamedefmapZcfg_postrrrr /s&   r c Csxt|}||d<||d<tt|d<}||d<t|||d<t||t|}|D]\} } || } | | j| _q+|S)z=Rewrite all uses to ``varname`` given the definition map r)r*phimapr% phi_locations) _make_statesrlist_compute_phi_locations_run_block_rewrite _FixSSAVarsitemsbody) r r)r*r%r&r(statesr+ newblockslabelZphilistZcurblkrrrr$Ssr$cspdd|Dd}|r6d}D]\}}ttjfdd|Dt}||r3||O}d}q|sS)zCompute the iterated dominance frontiers (DF+ in literatures). Returns a dictionary which maps block label to the set of labels of its iterated dominance frontiers. cSsi|] \}}|t|qSr)set.0kvsrrr ksz'_iterated_domfronts..TFcsg|]}|qSrr)r9vZ domfrontsrr pz'_iterated_domfronts..)Zdominance_frontierr2roperatoror_r7 difference)r%Z keep_goingr:r;innerrr>rres rcCs,t}|D] \}}|r|||O}q|Sr)r7r2)Z iterated_dfr*r,ZdeflabelZdefstmtsrrrr/ws  r/cCs6t|}||d<tt|d<}t||t}||fS)z(Rewrite to put fresh variable names r)r*)r-rr.r0_FreshVarHandler)r r)r4r*r5rrrr#s r#cCs|^}}|jSr)valuesscope)r first_rrr _get_scopes rJc Cstt}tt}t||d}t||ttdt|t dd| D}| }| D]&\}}||vrV|D]} || } dd||D} | | sU| |nq:q0tdt||S)zm Returns ------- res : Set[str] The SSA violators in a dictionary of variable names. )defsuseszdefs %scSs g|] \}}t|dkr|qS))lenr8rrrr?s z(_find_defs_violators..cSsh|]\}}|qSrr)r9Z_assignr6rrr r@z'_find_defs_violators..zSSA violators %s)rr.r7dict_run_block_analysis_GatherDefsHandlerr!r"r r r2Z dominators intersectionadd) r r%rKrLr4r'Zdomsr:Z use_blocksr6domZ def_labelsrrrr s&   r cCs<|D]\}}td|||d<t|||D]}qqdS)Nz"==== SSA block analysis pass on %sr6)r2r!r"_run_ssa_block_pass)r r4handlerr6blkrIrrrrQs rQc Csi}|D]8\}}td|tj|j|jd}g}||d<||d<t|||D] }|dus1J||q)||_ |||<q|S)Nz!==== SSA block rewrite pass on %s)rGlocr6block) r2r!r"rZBlockrGrYrVappendr3) r r4rWr5r6rXZnewblkZnewbodystmtrrrr0s    r0cCstt|dS)N)rG)rPrJ)r rrrr-sr-ccsrtd||jD],}td|t|tjr|||}n|||}||ur3|dur3td||Vq dS)Nz Running %sz on stmt: %szreplaced with: %s)r!r"r3 isinstancerAssign on_assignon_other)r4rXrWr\retrrrrVs      rVc@ eZdZdZddZddZdS) _BaseHandlerzGA base handler for all the passes used here for the SSA algorithm. cCdS)a Called when the pass sees an ``ir.Assign``. Subclasses should override this for custom behavior Parameters ----------- states : dict assign : numba.ir.Assign Returns ------- stmt : numba.ir.Assign or None For rewrite passes, the return value is used as the replacement for the given statement. Nr)rr4assignrrrr_z_BaseHandler.on_assigncCrd)a Called when the pass sees an ``ir.Stmt`` that's not an assignment. Subclasses should override this for custom behavior Parameters ----------- states : dict assign : numba.ir.Stmt Returns ------- stmt : numba.ir.Stmt or None For rewrite passes, the return value is used as the replacement for the given statement. Nrrr4r\rrrr`rfz_BaseHandler.on_otherNrrr__doc__r_r`rrrrrcs rcc@rb)rRaZFind all defs and uses of variable in each block ``states["label"]`` is a int; label of the current block ``states["defs"]`` is a Mapping[str, List[Tuple[ir.Assign, int]]]: - a mapping of the name of the assignee variable to the assignment IR node and the block label. ``states["uses"]`` is a Mapping[Set[int]] cCsX|d|jj||df|D]}|j}||jjkr)|d||dqdS)NrKr6rL)targetnamer[rrT)rr4revarr:rrrr_ s  z_GatherDefsHandler.on_assigncCs.|D]}|j}|d||dqdS)NrLr6)rrkrT)rr4r\rlr:rrrr`s z_GatherDefsHandler.on_otherNrhrrrrrRs rRc@seZdZddZejZdS)UndefinedVariablecCstd)NzNot intended for instantiation)NotImplementedErrorrrrrrszUndefinedVariable.__init__N)rrrrr UNDEFINEDrjrrrrrms rmc@rb)rEz9Replaces assignment target with new fresh variables. cCs|jj|dkrU|d}|d}t|dkr8|j}td||j|jvr7d|jd}ttj ||j dn |j |jj|j d}t j ||j|j d }||d ||S) Nr)rGr*rzfirst assign: %sz variable z is not in scope.rYrjvaluerYr6)rjrkrNr!r"Z localvarswarningswarnrZNumbaIRAssumptionWarningrYredefinerr^rrr[)rr4rerGr*Z newtargetZwmsgrrrr_&s(    z_FreshVarHandler.on_assigncCs|Srrrgrrrr`<sz_FreshVarHandler.on_otherNrhrrrrrE#s rEc@sReZdZdZddZddZddZdd Zd d Zd d Z ddZ dddZ dS)r1aFReplace variable uses in IR nodes to the correct reaching variable and introduce Phi nodes if necessary. This class contains the core of the SSA reconstruction algorithm. See Ch 5 of the Inria SSA book for reference. The method names used here are similar to the names used in the pseudocode in the book. cCs ||_dSr)_cache_list_vars)rr(rrrrIrz_FixSSAVars.__init__cCs|j}t|tjrD||||j|j}|durB|jtjurB|d|jj krB|d|ji}t |}t ||tj |j||jdS|St|tjro||||g}|duro|jtjuro|d|jj krotj |j|j|jdS|S)Nr)rq)rrr]rZInst_fix_varrvrrjrorkrrZreplace_vars_innerr^rYZVar)rr4rerhsnewdefreplmaprrrr_Ls4   z_FixSSAVars.on_assigncCs`||||j|}|dur.|jtjur.|d|jjkr.|d|ji}t|}t |||S)Nr)) rwrvrrjrrorkrrZreplace_vars_stmt)rr4r\ryrzrrrr`ks z_FixSSAVars.on_othercCs.dd|D}|d}||vr|||SdS)z0Fix all variable uses in ``used_vars``. cSsg|]}|jqSr)rk)r9r:rrrr?ysz(_FixSSAVars._fix_var..r)N) _find_def)rr4r\Z used_varsvarnamesZphivarrrrrwvs  z_FixSSAVars._fix_varc Cstd|d|d}|d}|d|}|d|}|d}|||}t|D]} |j| ||d} | |kr;| }n | |vrE|d }nq)|durS|j|||jd }|S) z?Find definition of ``stmt`` for the statement ``stmt`` zfind_def var=%r stmt=%sr)Nr6r*r+rZ)stoprp)r!r" _stmt_indexreversed_find_def_from_toprY) rr4r\Z selected_defr6Z local_defsZ local_phisrZZcur_posdefstmtZdef_posrrrr{~s*    z_FixSSAVars._find_defcCs4td||d}|d}|d}|d}||vrx|d}|dj}|j|d|d } tj| tjj|d |d } td | |||d | || | | |D]!\} } |j || |d } td | | j j | j| j j | qT| S||}||krt|d|tStd|||j |||d S)zFind definition reaching block of ``label``. This method would look at all dominance frontiers. Insert phi node if necessary. zfind_def_from_top label %rr%r*r+r,rGrZr)rprqzinsert phi node %s at %srzincoming_def %szidom %s from label %s)r!r"rYrurr^Exprphiinsertr[Z predecessors_find_def_from_bottomrrZincoming_valuesrjZincoming_blocksZimmediate_dominators"_warn_about_uninitialized_variablerm)rr4r6rYr%r*r+r,rGZfreshvarZphinodepredrIZ incoming_defZidomrrrrs>     z_FixSSAVars._find_def_from_topcCs<td||d}||}|r|d}|S|j|||dS)zs@         $   ( $