/j> ddlZddlmZddlmZmZddlZddlm Z ddl m Z gdZ Gddej jZ dd ej jd ed ed eej jej jffdZdej jded efdZ ddeejjej jfdeeej jgefded efdZdS)N)Callable)OptionalUnion)map_arg) split_module)FoldedGraphModuleget_unique_attr_name_in_modulesplit_const_subgraphsc eZdZdZ d dejjdejjde ejjde e de f fd Z fd Z d Z xZS) 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. Ncudarootgraphconst_subgraphfx_const_folded_attrs_namedevice_for_folded_attrsct|||dntj|||_d|_||_||_dS)NF) super__init__torchfx GraphModuleconst_subgraph_modulehas_folding_been_runrr)selfr rrrr __class__s e/home/longshao/multi-rider-rag/.venv/lib/python3.11/site-packages/torch/fx/experimental/const_fold.pyrzFoldedGraphModule.__init__sk u%%%% D%%dN;; " %*!*D''>$$$cf|js|tj|SN)r run_foldingr__call__)rargskwargsrs rr!zFoldedGraphModule.__call__.s4(       uww&&rcXjjdSjrtdd_}fdt |t r+t jfd|Dn |}tj|dS)NzFolding has already been runTcVtjt|ts&|n-tj|gj t|tjr|j ndS)N)deviceF) requires_grad) rnn Parameter isinstanceintdetachcloneTensortorr')irs r _create_paramz4FoldedGraphModule.run_folding.._create_paramEs8%%!!S))O   """\1#&&))1M)NN1;Au|1L1LWaooRW & rc&g|] }|Sr3).0r0r1s r z1FoldedGraphModule.run_folding..Ns##K#K#KMM!$4$4#K#K#Kr) rrrAssertionErrorr*tuplerr( ParameterListsetattr)r folded_attrsparamsr1s` @rr zFoldedGraphModule.run_folding3s  & ..6 F  $ A !?@@ @$(! 1133      ,.. -EH " "#K#K#K#Kl#K#K#K L L L|,,  d5v>>>>>r)NNr )__name__ __module__ __qualname____doc__rr(ModulerGraphrstrrr!r __classcell__)rs@rrrs4848'- ??ho?x~?!0 ? %-SM ? "% ??????$''''' ???????rrTgminline_mod_namerun_dcereturnct||}t|tjjst dt|d}|jj D]}|j dkr|j |kr|}n|t d||j }|j }id}fd} |jj D]} | j dkr'| j|vr || jn||| <|dz }5| j d kr| j d} t| | } g} t| t t"frddlfd |jD} || | D]}|j d}t|t*st d t||| ||j|| ||</|j|5|j| | }dddn #1swxYwY|| <|j||r|jS) 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 rcT|}|j|_|Sr)metacopy)nodenew_nodereplacement_mappings rreplacement_fnz&_inline_module..replacement_fnrs%&t, (( r placeholderoutputcg|]=}|jdkr0|jjut|jdt ;|>S) call_functionrR)optargetgetitemr*r"r+)r4useroperators rr5z"_inline_module..sZ!!!w/11 x'777"49Q<558877rzExpected int index, got )dict named_modulesr*rrrr6typernodesrVrWr"r#namerlistr7rZusersreplace_all_uses_withr+ erase_nodeinserting_before node_copyeliminate_dead_code)rDrErF inline_modcall_mod_node_to_replacerM call_mod_argscall_mod_kwargsph_countrP inline_nodeoutputsoutput_replacements getitem_usersrYidxrNrZrOs @@r_inline_modulerqUsTb&&(())/:J j%("6 7 7NL$z:J:JLLMMM# 7m # # (F(F'+ $ E'UOUUVVV-1M.5O>@H "'-,4,4 >] * *#66 011"8, , MH  >X % %!&q)G")'>"B"B 24M-e}== !!!! 8 >!!!  % : :;N O O O& E Eil!#s++Q()ODII)O)OPPP**+>s+CDDD##D))),?,D#D))  X & &'? @ @ G Gx))+~FFH G G G G G G G G G G G G G G G+3K(( H0111' $$&&& sH;;H? H? mod_tracedr_cJtjdd|}|drd|}t||r]tjd|}||dz}n0|dd\}}|dt |dz}t||]|S) zP Make sure the name is unique (in a module) and can represents an attr. z[^0-9a-zA-Z_]+_rz (.*)_(\d+)$N_1rR)resubisdigithasattrmatchgroupr+)rrr_r{basenums rr r s 6"C . .D Aw4zz *d # #,.. =$;DD Aq))ID#++SXX\++D *d # #, Krcpumoduleskip_folding_node_fnrc 8 ddl}t|tjjs tj|}n|}dtjjdt ffd td}|jj D]}|j dvr |j dkr(t|j  s@|r ||rN| rct|jd d|jr|j d krG||jx}r+t|tjjr |r||j dkrd }|st)||jSd tjjffd }t-|||} d\} } | jt1| | d} } | r | jj ngD]6}|j d kr)t3| |jt1| |j7| jj D]6}|j d kr)t3| |jt1| |j7d}| jj D]!}|j d kr|j| kr |j}n"|t7dtj| | j}d}|jj D]>}|j dkr!t|jdt8}/|j dkr;|t;|kr#t7d|dt;|d||}|dz }|j dkrt7d|j |j|5|j|j}dddn #1swxYwY|j !|_ |"||j#|@dtIvrt7dtK|d}t3| ||rtj&'ntj&(| jj D]}|j d kr|j| kr|j|5|j|}dddn #1swxYwY|j !|_ |"|ntS| | rtU| | | j+t)| | j|j||S)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. rNrrGclt|tjjst d|jjD]w}|jdkr|rdS|jdkrH| |j x}r,t|tjjr |cSxdS)z` Return True if a GraphModule type subgraph contains any impure op, else False. zDcaller should only pass GraphModule to subgraph_has_impure_ops checkrUTrIF) r*rrrr6rr^rV is_impure get_submodulerW)rrM submodule_subgraph_has_impure_opss rrz7split_const_subgraphs.._subgraph_has_impure_opss&%("677  V L& ; ;Dw/))dnn.>.>)tt=(("("6"6t{"C"CCY)y%(*>??) 0/ :::::urF>rSrQget_attr fill_valuerITrMc|vrdndS)NrrRr3)rM const_nodess r mod_partitionz,split_const_subgraphs..mod_partitionsK''qqQ.r)submod_0submod_1z,Could not find call_module node for const_gmrSrQzPlaceholder index z out of range for args (len=)rRzExpected get_attr, got multiple_outputsz multiple_outputs not set in loop_FX_CONST_FOLDED_ATTRS),sympyr*rrrsymbolic_traceboolsetrr^rVall_input_nodesissubsetrr#getExprrrWaddrNoderrgetattrr9r"r6r7lenrdrrKrLrbrclocalsr r(r8r)rzrqrf)rrrrrrfound_const_foldingrM target_modrsplitconst_mod_namenon_const_mod_nameconst_gm non_const_gmcall_const_gm_args root_const_gmph_idxrin_noderNrr:rrs @@rr r sLLL feh2 3 3X,,V44  )=$,'*eeK &&'&' 7/ / /  7j T-A)B)B)K)K * *    $8$8$>$>   >>     dkoolD995: F F   G} $ $)77 DDD %:ux';<< %)(44 %   7j "&  ? Z-=>>>/EHM////// V] ; ;E)?&N&"^WU>   7m # #  S+,, , , 3V33.//333 %V,!  : # # !G7:!G!GHH H  1 1$ 7 7 D D$*33GNCCH D D D D D D D D D D D D D D D ((  ""8,,,&&t,,,,))?@@@ "@,""  "$4N   %(:L:L:N:N  ! 7m # # ~(E(E,,T22 O O#z223MNN  O O O O O O O O O O O O O O O $  0 0L   & &| 4 4 4 E u())2u0111 K##%%%   "   s$ O  O O TT T )T)Nr)rwcollections.abcrtypingrrtorch.fxr torch.fx.nodertorch.fx.passes.split_moduler__all__rrrrBrr[rrqr r(r@r r3rrrs $$$$$$""""""""!!!!!!555555   @?@?@?@?@?,@?@?@?HEIWW W/2W=AW %(- &'WWWWtux/C3SV,GK#(HH %(/58#77 8H"8UX]OT,A#BCH!H HHHHHHr