^j7A ddlZddlmZddlmZddlZddlmZddl m Z gdZ GddejjZ dd ejjd ed ed eejj$ejj$ffd Zdejjded efdZ ddej*j,ejjzdeejj$gefdzded efdZy)N)Callable)Any)map_arg) split_module)FoldedGraphModuleget_unique_attr_name_in_modulesplit_const_subgraphsc eZdZdZ ddej j dejjdejjdzde dzde ddf fd Z d e d e de ffd Z dd ZxZS)ra FoldedGraphModule is a GraphModule which also contains another `const_subgraph_module` representing a subgraph which has all const attr inputs and which can be run once before running the main standard `graph`. The `const_output_names` are the ordered list names of attrs which represent what each respective output from the const_subgraph should be set on which attrs. Nrootgraphconst_subgraphfx_const_folded_attrs_namedevice_for_folded_attrsreturnct||||dntjj |||_d|_||_||_y)NF) super__init__torchfx GraphModuleconst_subgraph_modulehas_folding_been_runrr)selfr r r rr __class__s k/var/www/ramen.bs-engineer-server.com/venv/lib/python3.12/site-packages/torch/fx/experimental/const_fold.pyrzFoldedGraphModule.__init__sW u%% %%dN; " %*!*D''>$argskwargscT|js|jt| |SN)r run_foldingr__call__)rrrrs rr"zFoldedGraphModule.__call__-s(((    w&&rcj jyjr tdd_j}dtj t zdtjjffd }t|tr3tjj|Dcgc] }|| c}n||}tj|ycc}w)NzFolding has already been runTircTtjjt|ts|j j n/tj|gjjt|tjr|jSdS)N)deviceF) requires_grad) rnn Parameter isinstanceintdetachcloneTensortorr')r$rs r _create_paramz4FoldedGraphModule.run_folding.._create_paramDs88%%!!S)   "\\1#&))1M1M)N1;Au||1Laoo & SX & r) rrrAssertionErrorrr.r+r(r)r*tuple ParameterListsetattr)r folded_attrsr0r$paramss` rr!zFoldedGraphModule.run_folding2s  & & ...6   $ $ !?@ @$(! 113  U\\C/ EHH4F4F ,. HH " "l#KM!$4#K L|,  d55v> $Ls-C#)NNcuda)rN)__name__ __module__ __qualname____doc__rr(ModulerGraphstrrobjectrr"r! __classcell__)rs@rrrs1515'- ?hhoo?xx~~?- ? %($J ? "% ? ?$'f''3' ?rrgminline_mod_namerun_dcerc t|j|}t|tjj st dt|d}|jjD]%}|jdk(s|j|k(s#|}n|t d||j}|j}id}dtjjdtjjffd } |jjD]} | jd k(r+| j|vr|| jn||| <|d z }>| jd k(r| jd} t!| | } g} t| t"t$fraddl}|j(Dcgc]H}|jd k(r7|j|j*urt|jd t,r|J} }|j/| | D]o}|jd }t|t,st d t||j/| ||jj1|| ||<qi|jj3|5|jj5| | }ddd| <|jj1||r|jj7Scc}w#1swYOxYw)a Given `gm` and some graph module which is called with target name `inline_mod_name`, this helper will inline all of the nodes from that called graph module into `gm`. Returns a mapping from subgraph nodes to the newly created/mapped nodes in gm. zExpected GraphModule, got N call_modulez$Could not find call_module node for rnodercP|}|jj|_|Sr )metacopy)rFnew_nodereplacement_mappings rreplacement_fnz&_inline_module..replacement_fnqs$&t, ( r placeholderoutput call_functionzExpected int index, got )dict named_modulesr*rrrr1typer nodesoptargetrrNodenamerlistr2operatorusersgetitemr+replace_all_uses_with erase_nodeinserting_before node_copyeliminate_dead_code)rArBrC inline_modcall_mod_node_to_replacerF call_mod_argscall_mod_kwargsph_countrL inline_nodeoutputsoutput_replacements getitem_usersrZuseridxrJrKs @r_inline_modulermTsb&&()/:J j%(("6"6 79$z:J9KLMM# 77m # (F'+ $  'COCTUVV-11M.55O>@HUXX]]uxx}} "''--,4 >>] *##6 0 01"8, , MH  >>X %!&&q)G")'>"B 24M-e}=!9 > >!ww/1 x'7'77"499Q<5 ! ! % : :;N O& Eiil!#s+(+CDI;)OPP**+>s+CD##D),?,D#D)  E  XX & &'? @ Gxx))+~FH G+3K(Y,4bHH01 $$& A!* G Gs(A K?LL mod_tracedrXc"tjdd|}|djrd|}t||rStjd|}||dz}n(|j dd\}}|dt |dz}t||rS|S)zP Make sure the name is unique (in a module) and can represents an attr. z[^0-9a-zA-Z_]+_rz (.*)_(\d+)$_1rN)resubisdigithasattrmatchgroupr+)rnrXrwbasenums rrrs 66"C .D Aw4&z *d #. =$;D Aq)ID#V1SX\N+D *d # Krmoduleskip_folding_node_fnrc $ ddl}t|tjjs tjj |}n|}dtjjdt ffd td}|jjD]}|jdvr|jdk7r%t|jjsG|r ||rR|jrct|jjd d|j r|jd k(rJ|j#|j$x}r-t|tjjr |rj'||jdk7sd }|st)||jSd tjj*dt,ffd }t/|||} d\} } t1| | } t| tjjst3d| dt5| t1| | d} d}| @t| tjjst3d| dt5| | }|V|jjD]=}|jd k(st7| |j$t1||j$?| jjD]=}|jd k(st7| |j$t1| |j$?d}| jjD]/}|jd k(s|j$| k(s#|j8}n| t3dtjj | | j}d}|jjD].}|jdk(rt|j8dt:}1|jdk7rA|t=|k\rt3d|dt=|d||}|dz }|jdk7rt3d|j|jj?|5|jjA|j$}ddd|jBjE_!|jG||jjI|1dtKvr t3dtM|d}t7| |rtjNjQntjNjS| jjD]}|jd k(s|j$| k(s#|jj?|5|jjA|}ddd|jBjE_!|jG|ntU| | r tW| | | jjYt)| | j|j||S#1swYxYw#1swYxYw)aJ Looks through `module` for any nodes that have all constant attribute inputs and separates them out into their own constant subgraph, and returns a FoldedGraphModule which runs that constant subgraph on the first run to set attributes on the module prior to running the non-constant portion of the graph. rNr{rct|tjjs t d|j j D]}|jdk(r|jry|jdk(s4|j|jx}sRt|tjjsw|cSy)z` Return True if a GraphModule type subgraph contains any impure op, else False. zDcaller should only pass GraphModule to subgraph_has_impure_ops checkrPTrEF) r*rrrr1r rTrU is_impure get_submodulerV)r{rF submodule_subgraph_has_impure_opss rrz7split_const_subgraphs.._subgraph_has_impure_opss&%(("6"67 V LL&& ;Dww/)dnn.>=("("6"6t{{"CCYCy%((*>*>?/ :: ;rF>rOrMget_attr fill_valuerETrFc|vrdSdS)NrrN)rF const_nodess r mod_partitionz,split_const_subgraphs..mod_partitionsK'q.Q.r)submod_0submod_1zExpected GraphModule for z, got z,Could not find call_module node for const_gmrOrMzPlaceholder index z out of range for args (len=)rNzExpected get_attr, got multiple_outputsz multiple_outputs not set in loop_FX_CONST_FOLDED_ATTRS)-sympyr*rrrsymbolic_traceboolsetr rTrUall_input_nodesissubsetrrgetExprrrVaddrrWr+rgetattrr1rSr4rr2lenr_rrHrIr]r^localsrr(r3r)rvrmra)r{r|rrrnfound_const_foldingrF target_modrsplitconst_mod_namenon_const_mod_nameconst_gm non_const_mod non_const_gmcall_const_gm_args root_const_gmph_idxrin_noderJrr5rrs @@rr r s fehh22 3XX,,V4  )=)=$,'*eK  &&&' 77/ /  77j T-A-A)B)K)K *   $8$>  >>   dkkoolD95:: F  GG} $)77 DDD:uxx';';<(4   77j "& M&'R  Z-=-=>>/EHHMM/c/ V] ;E)?&N&un-H h 4 4 5''7vd8n=M N  E#5t +,>+?vd=FYEZ[ %  &&,, PDww-'t{{GL$++,NO P$$H 77m # E4;;$++(F GH !! 77m #{{n,%)YY"  !KLLHH((?M F##))- 77h )$))A,>   77m #  S+, , $VH-./03 %V,!  :: # #:7::,!GH H  1 1$ 7 D$**33GNNCH D (  ""8,&&t,'-()?@@ "@,"  "$4 %((:L:L:N  !! 77m # ~(E,,T2 O#zz223MN  O $  0L   & &| 4  u()u01 KK##%   "  I D D, O Os&Y9 Z9Z Z )T)Ncpu)rscollections.abcrtypingrtorch.fxr torch.fx.nodertorch.fx.passes.split_moduler__all__rrrr>rrQrWrmrr(r<r rrrrs $!5 @?,,@?HEIW W/2W=AW %((-- &'Wtuxx/C/C3SV,DH#(U HHOOehh22 2U"EHHMM?D#89D@U!U Ur