U hd:@sHdZddlZddlZddlZddlmZddlmZddlmZddl m Z ddl m Z ddl mZmZmZdd lmZeeZd d ZGd d d ZddZddZddZddZddZddZddZddZddZ 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)pformat) defaultdict)config)irir_utilserrors)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_irr G/home/sam/Atlas/atlas_env/lib/python3.8/site-packages/numba/core/ssa.pyreconstruct_ssas rc@seZdZddZddZdS)_CacheListVarscCs i|_dSN)_savedselfr r r__init__%sz_CacheListVars.__init__cCs*|j|}|dkr&||j|<}|Sr)rgetZ list_vars)rinstgotr r rr(s z_CacheListVars.getN)__name__ __module__ __qualname__rrr r r rr$srcCs|siSt|}t|}t|}t}|D]@}td|t||\}}tdt|t||||||}q*t|}||krt 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_varsr Z CompilerError)r cfgdf_plus violatorscache_list_varsvarnamedefmapZcfg_postr r rr /s(  r c Csxt|}||d<||d<tt|d<}||d<t|||d<t||t|}|D]\} } || } | | j| _qV|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( newblockslabelZphilistZcurblkr r rr!Ssr!csndd|Dd}|rjd}D]<\}}ttjfdd|Dt}||r*||O}d}q*qS)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.0kvsr r r ksz'_iterated_domfronts..TFcsg|] }|qSr r )r6vZ domfrontsr r psz'_iterated_domfronts..)Zdominance_frontierr/roperatoror_r4 difference)r"Z keep_goingr7r8innerr r;rres rcCs,t}|D]\}}|r|||O}q|Sr)r4r/)Z iterated_dfr'r)ZdeflabelZdefstmtsr r rr,ws r,cCs6t|}||d<tt|d<}t||t}||fS)z(Rewrite to put fresh variable names r&r')r*rr+r-_FreshVarHandler)r r&r1r'r2r r rr s r cCs|^}}|jSr)valuesscope)r first_r r r _get_scopes rFcCsLtt}t||ttdt|dd|D}tdt||S)zm Returns ------- res : Set[str] The SSA violators in a dictionary of variable names. zdefs %scSs h|]\}}t|dkr|qS))lenr5r r r s z'_find_defs_violators..zSSA violators %s)rr+_run_block_analysis_GatherDefsHandlerrrrr/)r defsr$r r rrs rcCs4|D]&\}}td|t|||D]}q(qdS)Nz"==== SSA block analysis pass on %s)r/rr_run_ssa_block_pass)r r1handlerr3blkrEr r rrJs rJc Csi}|D]p\}}td|tj|j|jd}g}||d<||d<t|||D]}|dk sbt| |qR||_ |||<q |S)Nz!==== SSA block rewrite pass on %s)rClocr3block) r/rrrZBlockrCrPrMAssertionErrorappendr0) r r1rNr2r3rOZnewblkZnewbodystmtr r rr-s    r-cCstt|dS)N)rC)dictrF)r r r rr*sr*ccsptd||jD]X}td|t|tjr<|||}n |||}||k rd|dk rdtd||VqdS)Nz Running %sz on stmt: %szreplaced with: %s)rrr0 isinstancerAssign on_assignon_other)r1rOrNrTretr r rrMs      rMc@s eZdZdZddZddZdS) _BaseHandlerzGA base handler for all the passes used here for the SSA algorithm. cCsdS)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 rr1assignr r rrXsz_BaseHandler.on_assigncCsdS)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. Nr rr1rTr r rrYsz_BaseHandler.on_otherNrrr__doc__rXrYr r r rr[sr[c@seZdZdZddZdS)rKzEFind all defs ``states`` is a Mapping[str, List[ir.Assign]] cCs||jj|dSr)targetnamerSr\r r rrXsz_GatherDefsHandler.on_assignN)rrrr`rXr r r rrKsrKc@seZdZddZejZdS)UndefinedVariablecCs tddS)NzNot intended for instantiation)NotImplementedErrorrr r rrszUndefinedVariable.__init__N)rrrrr UNDEFINEDrar r r rrcsrcc@s eZdZdZddZddZdS)rAz9Replaces assignment target with new fresh variables. cCs|jj|dkr|d}|d}t|dkrp|j}td||j|jkrd|jd}ttj ||j dn|j |jj|j d}t j ||j|j d }||d ||S) Nr&rCr'rzfirst assign: %sz variable z is not in scope.rPravaluerPr3)rarbrHrrZ localvarswarningswarnr ZNumbaIRAssumptionWarningrPredefinerrWrhrS)rr1r]rCr'Z newtargetZwmsgr r rrXs&     z_FreshVarHandler.on_assigncCs|Srr r^r r rrYsz_FreshVarHandler.on_otherNr_r r r rrAsrAc@sReZdZdZddZddZddZdd Zd d Zd d Z ddZ dddZ dS)r.aFReplace 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%r r rr)sz_FixSSAVars.__init__cCs|j}t|tjr||||j|j}|dk r|jtjk r|d|jj kr|d|ji}t |}t ||tj |j||jdSnVt|tjr||||g}|dk r|jtjk r|d|jj krtj |j|j|jdS|S)Nr&rg)rhrVrZInst_fix_varrlrrarerbrrZreplace_vars_innerrWrPZVar)rr1r]rhsnewdefreplmapr r rrX,s6    z_FixSSAVars.on_assigncCs`||||j|}|dk r\|jtjk r\|d|jjkr\|d|ji}t|}t |||S)Nr&) rmrlrrarrerbrrZreplace_vars_stmt)rr1rTrorpr r rrYKs  z_FixSSAVars.on_othercCs.dd|D}|d}||kr*|||SdS)z0Fix all variable uses in ``used_vars``. cSsg|] }|jqSr )rb)r6r7r r rr<Ysz(_FixSSAVars._fix_var..r&N) _find_def)rr1rTZ used_varsvarnamesZphivarr r rrmVsz_FixSSAVars._fix_varc Cstd|d|d}|d}|d|}|d|}|d}|||}t|D]:} |j| ||d} | |krx| }qqR| |krR|d }qqR|dkr|j|||jd }|S) z?Find definition of ``stmt`` for the statement ``stmt`` zfind_def var=%r stmt=%sr&Nr3r'r(rQ)stoprf)rr _stmt_indexreversed_find_def_from_toprP) rr1rTZ selected_defr3Z local_defsZ local_phisrQZcur_posdefstmtZdef_posr r rrq^s,    z_FixSSAVars._find_defcCs:td||d}|d}|d}|d}||kr|d}|dj}|j|d|d } tj| tjj|d |d } td | |||d | || | | |D]B\} } |j || |d } td | | j j | j| j j | q| S||}||krt|d|tStd|||j |||d SdS)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)rCrQr&rfrgzinsert phi node %s at %srzincoming_def %szidom %s from label %sN)rrrPrkrrWExprphiinsertrSZ predecessors_find_def_from_bottomrhZincoming_valuesraZincoming_blocksZimmediate_dominators"_warn_about_uninitialized_variablerc)rr1r3rPr"r'r(r)rCZfreshvarZphinodepredrEZ incoming_defZidomr r rrwzsB      z_FixSSAVars._find_def_from_topcCs@td||d}||}|r,|d}|S|j|||dSdS)zs>          $   ( $