xKg@xdZddlZddlZddlZddlmZddlmZddlmZddl m Z ddl m Z ddl mZmZmZdd lmZdd lmZej*eZd ZGd d ZdZdZdZdZdZdZdZ dZ!dZ"dZ#dZ$GddZ%Gdde%Z&GddZ'Gdd e%Z(Gd!d"e%Z)d#Z*y)$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) OrderedSet)compute_cfg_from_blocksc:t|j|_|S)znApply SSA reconstruction algorithm on the given IR. Produces minimal SSA using Choi et al algorithm. )_run_ssablocks)func_irs R/home/alanp/www/video.onchill/myenv/lib/python3.12/site-packages/numba/core/ssa.pyreconstruct_ssars gnn-GN NceZdZdZdZy)_CacheListVarsci|_yN)_savedselfs r__init__z_CacheListVars.__init__&s  rc~|jj|}||jx|j|<}|Sr)rget list_vars)rinstgots rrz_CacheListVars.get)s8kkood# ;&*nn&6 6DKK  rN)__name__ __module__ __qualname__rrrrrr%s rrc f|siSt|}t|}t||}t}|D]V}tj d|t ||\}}tj dt|t||||||}Xt|}||k7rtjd|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 rrr0s  !& )C!#&G$VS1I$&O (' %VW5 0'&/BvwW.0'v.H3""#<== Mrct|}||d<||d<ttx|d<}||d<t|||d<t ||t |}|j D]\} } || } | | jz| _ |S)z=Rewrite all uses to ``varname`` given the definition map r1r2phimapr- phi_locations) _make_statesrlist_compute_phi_locations_run_block_rewrite _FixSSAVarsitemsbody) rr1r2r-r.r0statesr5 newblockslabelphilistcurblks rr+r+Ts& !FF9F8 +D 11F8vF5M4WfEF?"66;3OPI ,,.w5! + ) rc l|jjDcic]\}}|t|}}}d}|rjd}|jD]R\}}ttj |Dcgc]}|| c}t}|j |sL||z}d}T|rj|Scc}}wcc}w)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. TF)dominance_frontierr<setroperatoror_ difference)r-kvs domfronts keep_goingvinners rr&r&fs *-)?)?)A)G)G)IJ)I2CG)IIJJ  __&EAr8<<)C1)A,)CSUKE#e ! '  K *Ds B+/ B1 c`t}|jD]\}}|s |||z}|Sr)rEr<) iterated_dfr2r6deflabeldefstmtss rr9r9xs:EM$lln(  [2 2M- rc|t|}||d<ttx|d<}t||t }||fS)z(Rewrite to put fresh variable names r1r2)r7rr8r:_FreshVarHandler)rr1r>r2r?s rr*r*sI& !FF9 +D 11F8v"663C3EFI f rc>|j^}}|jSr)valuesscope)rfirst_s r _get_scoperZs IEA ;;rc xtt}tt}t||}t ||t t jdt|t|jDcgc]\}}t|dkDs|c}}}|j}|jD]Q\}} ||vs | D]B} || } ||D chc]\} } |  } } } | j| r1|j|QSt jdt||Scc}}wcc} } w)zm Returns ------- res : Set[str] The SSA violators in a dictionary of variable names. )defsuseszdefs %szSSA violators %s)rr8rEdict_run_block_analysis_GatherDefsHandlerr(r)rr r<len dominators intersectionadd)rr-r\r]r>rIrJr/doms use_blocksr@dom_assign def_labelss rr'r's t D s D t$ 'F(:(<= MM)WT]+4::<G<%!R3r7Q;A<GHI >> D : I #5k:>q'C'e' C!..s3MM!$ $& MM$gi&89 HDs8D0 D0  D6 c|jD]2\}}tjd|||d<t|||D]}4y)Nz"==== SSA block analysis pass on %sr@)r<r(r)_run_ssa_block_pass)rr>handlerr@blkrYs rr`r`sDlln s :EBw$VS':A ;%rc:i}|jD]\}}tjd|tj|j |j }g}||d<||d<t|||D]}|J|j|||_ |||<|S)Nz!==== SSA block rewrite pass on %s)rWlocr@block) r<r(r)rBlockrWrprlappendr=) rr>rmr?r@rnnewblknewbodystmts rr:r:sIlln s 95A sww7ww'W=D# ## NN4 > ! %% rc,tt|S)N)rW)r_rZ)rs rr7r7s   rc#DKtjd||jD]w}tjd|t|tj r|j ||}n|j||}||ur|tjd||yyw)Nz Running %sz on stmt: %szreplaced with: %s)r(r)r= isinstancerAssign on_assignon_other)r>rnrmrvrets rrlrls MM,( mT* dBII &##FD1C""640C d?s MM-s 3 sBB ceZdZdZdZdZy) _BaseHandlerzGA base handler for all the passes used here for the SSA algorithm. cy)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 rr{z_BaseHandler.on_assignrcy)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>rvs rr|z_BaseHandler.on_otherrrNr!r"r#__doc__r{r|r$rrrrs $ rrceZdZdZdZdZy)raaZFind 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]] c|d|jjj||df|jD]B}|j}||jjk7s)|d|j |dDy)Nr\r@r])targetnamersrre)rr>rvarrIs rr{z_GatherDefsHandler.on_assign suvv}}))*1166'?2KL##%CAFMM&&&vq!%%fWo6&rcz|jD](}|j}|d|j|d*y)Nr]r@)rrre)rr>rvrrIs rr|z_GatherDefsHandler.on_others7>>#CA 6N1  ! !&/ 2$rNrr$rrraras73rrac*eZdZdZej Zy)UndefinedVariablectd)NzNot intended for instantiation)NotImplementedErrorrs rrzUndefinedVariable.__init__s!"BCCrN)r!r"r#rr UNDEFINEDrr$rrrrsD\\FrrceZdZdZdZdZy)rTz9Replaces assignment target with new fresh variables. cV|jj|dk(r |d}|d}t|dk(r|j}tj d||j|j vrvd|jd}t jtj||jn1|j|jj|j}tj||j|j }||d j||S) Nr1rWr2rzfirst assign: %sz variable z is not in scope.rprvaluerpr@)rrrbr(r) localvarswarningswarnr NumbaIRAssumptionWarningrpredefinerrzrrs)rr>rrWr2 newtargetwmsgs rr{z_FreshVarHandler.on_assign's ==   !2 27OEH%F6{a"MM  0)<>>8&y~~&88IJDMM&"A"A$&,jj#23"NN6==+=+=6::NN YY llJJF 6'? # * *6 2 rc|Srr$rs rr|z_FreshVarHandler.on_other=s rNrr$rrrTrT$s,rrTcBeZdZdZdZdZdZdZdZdZ dZ d d Z y ) 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||_yr)_cache_list_vars)rr0s rrz_FixSSAVars.__init__Js /rc.|j}t|tjr|j |||j j |j}||jtjurz|d|jjk7r^|d|ji}t|}tj||tj|j||jS|St|tjr|j |||g}|n|jtjurR|d|jjk7r6tj|j|j|jS|S)Nr1r)rryrInst_fix_varrrrrrrr replace_vars_innerrzrpVar)rr>rrhsnewdefreplmaps rr{z_FixSSAVars.on_assignMsCll c277 #]] 5 5 9 9&,, GF!fmm2<<&G)$ (:(::%i0&--@Gs)C//W=99%}}!"JJ  RVV $]]66C59F!fmm2<<&G)$ (:(::99%}}$mm"JJ  rc6|j|||jj|}|j|jtj urN|d|jj k7r2|d|ji}t|}tj|||S)Nr1) rrrrrrrrr replace_vars_stmt)rr>rvrrs rr|z_FixSSAVars.on_otherls D$//33D9   &--r||"Ci FMM$6$66!),fmm<Dz**49 rcv|Dcgc]}|j}}|d}||vr|j||Sycc}w)z0Fix all variable uses in ``used_vars``. r1N)r _find_def)rr>rv used_varsrIvarnamesphivars rrz_FixSSAVars._fix_varwsI%..IqAFFI. " X >>&$/ / /s6cFtjd|d|d}|d}|d|}|d|}|d}|j||}t|D]*} |j| ||} | |kr| }n | |vs%|d }n||j |||j }|S) z?Find definition of ``stmt`` for the statement ``stmt`` zfind_def var=%r stmt=%sr1Nr@r2r5rq)stopr)r(r) _stmt_indexreversed_find_def_from_toprp) rr>rv selected_defr@ local_defs local_phisrqcur_posdefstmtdef_poss rrz_FixSSAVars._find_defs  / 1BDI wH%e, H%e, w""4/ +G&&wG&DG & J&)"~ ,  224883Lrctjd||d}|d}|d}|d}||vr9|d}|dj}|j|d| } t j | tj j| | } tjd | |||jd | ||j| |j|D]\} } |j|| | } tjd | | jjj| j| jjj| | S|j!|}||k(rt#|d|t$Stjd|||j||| 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-r2r5r6rWrqr1rrzinsert phi node %s at %srzincoming_def %szidom %s from label %s)r(r)rprrrzExprphiinsertrs predecessors_find_def_from_bottomrincoming_valuesrincoming_blocksimmediate_dominators"_warn_about_uninitialized_variabler)rr>r@rpr-r2r5r6rWfreshvarphinodepredrY incoming_defidoms rrz_FixSSAVars._find_def_from_tops  2E:Um!!/ M !7OE/%%C~~fY&7S~AHiiggkkck*G MM4gu E 5M G , 5M  )++E2a#99Dc :   /> --44\5H5HI --44T: 3N++-e4Du}36)3DcJ(( MM14 ?--fd-D Drc|tjd||d}||}|r|d}|S|j|||S)zr@rpr2r\lastdefs rrz!_FixSSAVars._find_def_from_bottomsO  5u=!e} 2hGN**65c*B Brctt|jd|D]}|j||us|cSt|jS)zFind the positional index of the statement at ``block``. Assumptions: - no two statements can point to the same object. N)rangerbr=)rrrqris rrz_FixSSAVars._stmt_indexsGs5::'.Azz!}'/5::rN)r) r!r"r#rrr{r|rrrrrr$rrr;r;As20> 08,E\ C rr;ctjr.tjt j d||yy)Nz Detected uninitialized variable r)rALWAYS_WARN_UNINIT_VARrrr NumbaWarning)r1rps rrrs7 $$   27)<  %r)+rloggingrFr functoolsrrpprintr collectionsrnumbar numba.corerr r numba.core.utilsr numba.core.analysisr getLoggerr!r(rrrr+r&r9r*rZr'r`r:r7rlrrarrTr;rr$rrrs#++'7 '  H %!H$$ <" % % P332|:`,`F r