ܙd:dZddlZddlZddlZddlmZddlmZddlmZddl m Z ddl m Z ddl mZmZmZdd lmZejeZd ZGd d Zd ZdZdZdZdZdZdZdZdZ dZ!dZ"GddZ#Gdde#Z$GddZ%Gdde#Z&Gd d!e#Z'd"Z(dS)#a 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_blocksc8t|j|_|S)znApply SSA reconstruction algorithm on the given IR. Produces minimal SSA using Choi et al algorithm. )_run_ssablocks)func_irs .lib/python3.11/site-packages/numba/core/ssa.pyreconstruct_ssars gn--GN NceZdZdZdZdS)_CacheListVarsci|_dSN)_savedselfs r__init__z_CacheListVars.__init__%s  rcz|j|}||x|j|<}|Sr)rget list_vars)rinstgots rrz_CacheListVars.get(s:kood## ;&*nn&6&6 6DK  rN)__name__ __module__ __qualname__rrrrrr$s2rrc |siSt|}t|}t|}t}|D]l}td|t ||\}}tdt|t||||||}mt|}||krtj 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 CompilerError)rcfgdf_plus violatorscache_list_varsvarnamedefmapcfg_posts rr r /s  !& ) )C!#&&G$V,,I$&&O 0 0 ('   %VW55 0'&//BBBvwW.00 'v..H3"#<=== Mrc8t|}||d<||d<ttx|d<}||d<t|||d<t ||t |}|D]\} } || } | | jz| _|S)z=Rewrite all uses to ``varname`` given the definition map r0r1phimapr, phi_locations) _make_statesrlist_compute_phi_locations_run_block_rewrite _FixSSAVarsitemsbody) rr0r1r,r-r/statesr4 newblockslabelphilistcurblks rr*r*Ss& ! !FF9F8 +D 1 11F8vF5M4WfEEF?"66;3O3OPPI ,,..,,w5! + rcJd|Dd}|rmd}D]T\}}ttjfd|Dt }||r||z}d}U|mS)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. c4i|]\}}|t|Sr#)set.0kvss r z'_iterated_domfronts..ks$JJJ2CGGJJJrTFc g|] }| Sr#r#)rFv domfrontss r z'_iterated_domfronts..ps)C)C)C1)A,)C)C)Cr)dominance_frontierr;roperatoror_rD difference)r, keep_goingrGrHinnerrLs @rr%r%es KJ)?)?)A)A)G)G)I)IJJJIJ " __&& " "EAr8<)C)C)C)C)C)C)CSUUKKE## "e ! " rcpt}|D]\}}|r |||z}|Sr)rDr;) iterated_dfr1r5deflabeldefstmtss rr8r8wsGEEM$llnn33(  3 [2 2M rct|}||d<ttx|d<}t||t }||fS)z(Rewrite to put fresh variable names r0r1)r6rr7r9_FreshVarHandler)rr0r=r1r>s rr)r)sU& ! !FF9 +D 1 11F8v"663C3E3EFFI f rc<|^}}|jSr)valuesscope)rfirst_s r _get_scoper_s IEA ;rcDtt}t||ttdt |d|D}tdt ||S)zm Returns ------- res : Set[str] The SSA violators in a dictionary of variable names. zdefs %sc>h|]\}}t|dk|S))lenrEs r z'_find_defs_violators..s'<<i}|D]\}}td|tj|j|j}g}||d<||d<t|||D]}|J||||_ |||<|S)Nz!==== SSA block rewrite pass on %s)r\locr?block) r;r'r(rBlockr\rmriappendr<) rr=rjr>r?rknewblknewbodystmts rr9r9sIllnn " " s 95AAA sw777ww'W== ! !D### NN4  ! % rc<tt|S)N)r\)dictr_)rs rr6r6s$      rc#bKtd||jD]}td|t|tjr|||}n|||}||ur|td||VdS)Nz Running %sz on stmt: %szreplaced with: %s)r'r(r< isinstancerAssign on_assignon_other)r=rkrjrsrets rriris MM,((( mT*** dBI & & 1##FD11CC""6400C d??s MM-s 3 3 3 rceZdZdZdZdZdS) _BaseHandlerzGA base handler for all the passes used here for the SSA algorithm. cdS)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#rr=assigns rryz_BaseHandler.on_assignrcdS)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#rr=rss rrzz_BaseHandler.on_otherrrNr r!r"__doc__ryrzr#rrr}r}s<   $     rr}ceZdZdZdZdS)rfzEFind all defs ``states`` is a Mapping[str, List[ir.Assign]] cP||jj|dSr)targetnamerprs rryz_GatherDefsHandler.on_assigns&v}!"))&11111rN)r r!r"rryr#rrrfrfs-22222rrfc"eZdZdZejZdS)UndefinedVariablec td)NzNot intended for instantiation)NotImplementedErrorrs rrzUndefinedVariable.__init__s!"BCCCrN)r r!r"rr UNDEFINEDrr#rrrrs)DDD\FFFrrceZdZdZdZdZdS)rYz9Replaces assignment target with new fresh variables. c|jj|dkr|d}|d}t|dkri|j}td||j|jvr8d|jd}t jtj ||j n&| |jj|j }tj ||j|j }||d ||S) Nr0r\r1rzfirst assign: %sz variable z is not in scope.rmrvaluermr?)rrrcr'r( localvarswarningswarnr NumbaIRAssumptionWarningrmredefinerrxrrp)rr=rr\r1 newtargetwmsgs rryz_FreshVarHandler.on_assigns  =  !2 2 27OEH%F6{{a"M  0)<<<>88Jy~JJJDM&"A$&,j#2#2#2333"NN6=+=6:NNN Y lJF 6'? # * *6 2 2 2 rc|Srr#rs rrzz_FreshVarHandler.on_others rNrr#rrrYrYs<,rrYcDeZdZdZdZdZdZdZdZdZ dZ d d Z d S) 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. c||_dSr)_cache_list_vars)rr/s rrz_FixSSAVars.__init__)s /rc|j}t|tjr||||j|j}|}|jtjurj|d|jj krT|d|ji}t|}tj ||tj |j||jSnt|tjri||||g}|O|jtjur<|d|jj kr&tj |j|j|jS|S)Nr0r)rrwrInst_fix_varrrrrrrr replace_vars_innerrxrmVar)rr=rrhsnewdefreplmaps rryz_FixSSAVars.on_assign,sPl c27 # # ]] 5 9 9&, G GF!fm2<&G&G)$ (:::%i0&-@Gs))C/W===9%}!"J RV $ $ ]]66C599F!fm2<&G&G)$ (:::9%}$m"J  rc ||||j|}|\|jtjurI|d|jjkr3|d|ji}t|}tj |||S)Nr0) rrrrrrrrr replace_vars_stmt)rr=rsrrs rrzz_FixSSAVars.on_otherKs D$/33D99    &-r|"C"Ci FM$666!),fm<Dzz*4999 rcbd|D}|d}||vr|||SdS)z0Fix all variable uses in ``used_vars``. cg|] }|j Sr#)r)rFrGs rrMz(_FixSSAVars._fix_var..Ys...qAF...rr0N) _find_def)rr=rs used_varsvarnamesphivars rrz_FixSSAVars._fix_varVsH/.I... " X  >>&$// /  rctd|d|d}|d}|d|}|d|}|d}|||}t|D]2} || ||} | |kr| }n| |vr |d }n3|||||j }|S) z?Find definition of ``stmt`` for the statement ``stmt`` zfind_def var=%r stmt=%sr0Nr?r1r4rn)stopr)r'r( _stmt_indexreversed_find_def_from_toprm) rr=rs selected_defr? local_defs local_phisrncur_posdefstmtdef_poss rrz_FixSSAVars._find_def^s  / 1BDIII wH%e, H%e, w""4// ++  G&&wG&DDG  & J&&)"~ '  22483Lrctd||d}|d}|d}|d}||vrM|d}|dj}||d| } t j| tj| | } td | |||d | || | | |D]{\} } | || | } td | | j j | j| j j | || S||}||krt#|d|t$Std||| ||| 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,r1r4r5r\rnr0rrzinsert phi node %s at %srzincoming_def %szidom %s from label %s)r'r(rmrrrxExprphiinsertrp predecessors_find_def_from_bottomrincoming_valuesrincoming_blocksimmediate_dominators"_warn_about_uninitialized_variabler)rr=r?rmr,r1r4r5r\freshvarphinodepredr^ incoming_defidoms rrz_FixSSAVars._find_def_from_topzs  2E:::Um!!/ M ! !7OE/%C~~fY&7S~AAHigkkck**G MM4gu E E E 5M G , , , 5M  ) ) )++E22 ; ;a#99Dc :    />>> -44\5HIII -44T::::N++--e4Du}}36)3DcJJJ(( MM14 ? ? ?--fd-DD Drctd||d}||}|r |d}|S||||S)z   0008,E,E,E\ C C C      rr:cxtjr-tjt jd||dSdS)Nz Detected uninitialized variable r)rALWAYS_WARN_UNINIT_VARrrr NumbaWarning)r0rms rrrsX $   <7<<          r))rloggingrOr functoolsrrpprintr collectionsrnumbar numba.corerr r numba.core.analysisr getLoggerr r'rrr r*r%r8r)r_r&rer9r6rir}rfrrYr:rr#rrrs######++++++++++777777 ' H % %!!!H$$   "   % % % % % % % % P22222222|:`````,```F     r