o !i@ @sddlmZddlmZmZddlmZddlmZm Z m Z m Z m Z m Z mZmZddlZddlmZddlmmZddlmZddlZddlmZddlmmZddlZddl Z ddl!Z!ddl"m#Z#de$d e e$e$ffd d Z%d e ed ej&de e$e ffddZ'd ej&de e$e fdejj(fddZ)d6dejj(d ejj(fddZ*dej(d ej(fddZ+dej(deej&deej&deej&fddZ,ej-ej.ej/ej0ej1ej2ej3ej4ej5ej6ej4ej7ej8g Z9ej:ej;gZej/d d!iZ?deej&de e$ej(ffd"d#Z@deej&de e$ej(fd$e ej(ej(ffd%d&ZAGd'd(d(ZBd7d+d,ZCd-eBd eDfd.d/ZEGd0d1d1ZFdejGfdejj(d2e e e$e fd3eejGd ejj(fd4d5ZHdS)8N)ArgumentTarget)fuse_conv_bn_eval)TypeDictAnyTupleIterableOptionalListcast) ShapeProp) defaultdict)EnumtargetreturncCs*|dd^}}|r|d|fSd|fS)zp Splits a qualname into parent path and last atom. For example, `foo.bar.baz` -> (`foo.bar`, `baz`) .r)rsplit)rparentnamerq/var/www/html/eduruby.in/lip-sync/lip-sync-env/lib/python3.10/site-packages/torch/fx/experimental/optimization.py _parent_namesrpatternnodemodulescCst|jdkr dS|jd|f}t||D]2\}}t|tjs"dS|jdkr*dSt|jts3dS|j|vr;dSt ||j|urGdSqdS)NrF call_moduleT) lenargszip isinstancefxNodeoprstrtype)rrrnodes expected_typeZ current_noderrrmatches_module_patterns     r* new_modulecCs<t|jtsJt|j\}}|||j<t||||dSN)r"rr&rsetattr)rrr+ parent_namerrrrreplace_node_module,s r/Fmodelc Cstjtjftjtjftjtjfg}|st|}t |}t | }t|j }|D]E}|jD]?}t|||rot|jdjdkrCq0||jdj}||j} | jsTq0t|| } t|jd|| ||jd||q0q+t ||S)z Fuses convolution/BN layers for inference purposes. Will deepcopy your model by default, but can modify the model inplace as well. rr)nnZConv1dZ BatchNorm1dConv2d BatchNorm2dZConv3dZ BatchNorm3dcopydeepcopyr#symbolic_tracedict named_modulesgraphr(r*rr usersrZtrack_running_statsrr/replace_all_uses_with erase_node GraphModule) r0Zinplacepatternsfx_modelr new_graphrrconvZbnZ fused_convrrrfuse2s2             rBcCs*t|}Gdddtjj}||S)z5 Removes all dropout layers from the module. cs>eZdZdedeedfdeeefdeffdd Z Z S)z&remove_dropout..DropoutRemoverrr .kwargsrcs:t|j|tjrt|dksJ|dSt|||S)Nrr)r"Z submodulesr1ZDropoutrsuperr)selfrr rC __class__rrrVsz2remove_dropout..DropoutRemover.call_module) __name__ __module__ __qualname__rrrrr&rr __classcell__rrrFrDropoutRemoverUs6rL)r#r6torchZ TransformerZ transform)r0r?rLrrrremove_dropoutOs  rN orig_moduler(inputsoutputscs|t}i|D] }||j}||<q|D]}||fdd}||<q|fdd|D|t||S)z Given lists of nodes from an existing graph that represent a subgraph, returns a submodule that executes that subgraph. cs|Sr,r)xenvrrhz"extract_subgraph..csg|]}|qSrr).0outputrSrr jz$extract_subgraph..)r#Graph placeholderrZ node_copyrXlintr=)rOr(rPrQr@inputnew_noderrrSrextract_subgraph^s    r`cCs t|Sr,) th_mkldnnZMkldnnBatchNorm)a_rrrrU{s rUcCsi}|D]9}|jdkr=t|jtsJ||j}t|tvr=tt||tj}t|tj s0Jt |||<t |||q|S)z For each node, if it's a module that can be preconverted into MKLDNN, then we do so and create a mapping to allow us to convert from the MKLDNN version of the module to the original. r) r%r"rr&r' mkldnn_maprMfloatr1Moduler4r5r/)r(r old_modulesr cur_moduler+rrrmodules_to_mkldnns    rirgcCsJ|D] }|jdkr"t|jtsJ||j}||vr"t||||qdS)za Maps each module that's been changed with `modules_to_mkldnn` back to its original. rN)r%r"rr&r/)r(rrgrrhrrr reset_moduless  rjc@seZdZdejfddZdS) MklSubgraphfx_graphcCs||_g|_g|_g|_dSr,)rlr( start_nodes end_nodes)rErlrrr__init__s zMklSubgraph.__init__N)rHrIrJr#r[rorrrrrksrk rcs*dddtdtffdd }|S)aW This generates a heuristic that can be passed into `optimize_for_inference` that determines whether a subgraph should be run in MKL by running it with the example_inputs. Example usage: heuristic = gen_mkl_autotuner(example_inputs, iters=10) fast_model = optimization.optimize_for_inference(model, heuristic) Nr9rcs|j}dur|jj|jjtdd|Dtttj dd|j D}t |j ||fdd}|fdd}t jj t|fdd}||kS) NcSsg|]}t|jqSr)rMZrandnshaperWrrrrrYsz@gen_mkl_autotuner..use_mkl_heuristic..cSsg|]}|jdqS)r)r rrrrrrYscs<tD]}|qt}tD]}|}qt|Sr,)rangetime)frcbeginout)iterswarmuprr benchmarks   z?gen_mkl_autotuner..use_mkl_heuristic..benchmarkcsddddDDS)NcSg|]}|qSr)to_denserWirrrrYrZzRgen_mkl_autotuner..use_mkl_heuristic....cSr{r) to_mkldnnr}rrrrYrZrrZ sample_inputs submodulerrrUsz>gen_mkl_autotuner..use_mkl_heuristic..csSr,rrrrrrUrV)rmrlZ owning_modulergr propagater r r#r$rnr`r(rjr9r7r8)r9Z input_nodesZ output_argsrzZmkl_timeZ no_mkl_timeexample_inputsr?rxrgryrruse_mkl_heuristicsz,gen_mkl_autotuner..use_mkl_heuristic)rkbool)rrxryrrrrgen_mkl_autotuners rr9cCst|jdkS)z This is a heuristic that can be passed into `optimize_for_inference` that determines whether a subgraph should be run in MKL by checking if there are more than 2 nodes in it )rr()r9rrruse_mkl_lengthsrc@sFeZdZddZdefddZdedefddZd ed efd d Zd S) UnionFindcCsdg||_dg||_dS)Nrrsize)rEnrrrros zUnionFind.__init__vcCs||j|<d|j|<dS)Nrr)rErrrrmake_sets zUnionFind.make_setrcCsB|j|}||kr |S|dusJ|||j|<tt|j|Sr,)rfindr int)rErparrrrrs  zUnionFind.findrbbcCsf||||}}||kr|S|j||j|kr ||}}||j|<|j||j|7<dSr,)rrr)rErbrrrrjoins  zUnionFind.joinN)rHrIrJrorrrrrrrrrs r pass_configtracerc sDdddtid}|duri}|||drt|}|dr#t|}|ddur+|St|dts6td d|dvr@td |dd}|}|t |t |j }t| }Gd d d t}tjD]} |j} | jd kr|| j} t| tvr|j} t| d} | dur| jtjksJd| jtdksJdn| jdkr| jtvr|j} n| jtvr|j} | |jkr"| |jkrtdd| j Dsqk!| t "| j fdd} Wdn1swYt#t$t j%j&| | _ '| (dd| f}| )|| f|_ Wdn 1swYqkt*tj|}|_+jD]B} | jdkrr| jdkrr| j d}t| j,}|D]}|jdkrc|jdkrc|)|-|qKt.| j,dkrr-| q1t.j}t/|fddt0jD]w\}} | jdkr| jdkr|| _12|q| jdkr| jdkrĈ| j ddusJ| j d| _3qfdd| j4D}t.|dkrאqtdd|DrJt5|}|d| _6|ddD] }7|d|qqt8fd d}jD]9} t9| d!r|:| j6j;| t9| d"r1|:| j1j<;| t9| d#rC|:| j3j=;| q |>D](}||sp|j<|j=D]} | j d}| )|-| qVt?|j||qId}jD]} | jdks| jdkr|d7}qwt@AtBCd$|Dt |}|S)%a Performs a set of optimization passes to optimize a model for the purposes of inference. Specifically, the passes that are run are: 1. Conv/BN fusion 2. Dropout removal 3. MKL layout optimizations The third optimization takes a function `use_mkl_heuristic` that's used to determine whether a subgraph should be explicitly run in MKL layout. Note: As FX does not currently handle aliasing, this pass currently assumes nothing aliases. If that isn't true, use at your own risk. T heuristic) conv_bn_fuserNmkldnn_layout_optimizeNrrNrFz+mkldnn_layout_optimize config is not a dictz4Heuristic not found in mkldnn_layout_optimize configc@seZdZdZdZdZdS)z*optimize_for_inference..MklSupportrrN)rHrIrJNOYESUNKNOWNrrrr MklSupportsrrz)this pass is only for torch.float modulescpuz!this pass is only for CPU modulesZ call_functioncss|]}|jdkVqdS)r|N)r)rWargrrr 3sz)optimize_for_inference..csd|fS)Nr) call_methodrrlrrrU6sz(optimize_for_inference..rr|rrcs0t|dr |jSt|dr|jSdS)Ncolor start_color)hasattrrrrr)ufrr get_colorSs    z)optimize_for_inference..get_colorcs,g|]}t|tjr|dur|qSr,)r"r#r$r})rrrrYns,z*optimize_for_inference..css|]}|duVqdSr,rr}rrrrrsrcstSr,)rkrrrrrUyrVrr end_colorzmkldnn conversions: )ErupdaterBrNr"r7 RuntimeErrortracer4r5r#r=rootr8rlistr(rr%rr'mkldnn_supportedrnext parametersZdtyperMreZdevicemkldnn_supported_unknownranyr Zinserting_beforeZmap_argr rrrZinserting_afterZ create_noder;rirgr:r<rr enumeraterrrZall_input_nodessortedrrrrrappendrmrnvaluesrjlogging getLoggerrHinfor])r0rrZdefault_pass_configrZ cur_tracerr?rrrZsupports_mkldnnrhZsample_parameterZ mkldnn_argsZdense_xrgZprv_noder:userZ num_nodesZcur_idxZ cur_colorsZ other_colorZ mkldnn_graphsr9ZprvZmkldnn_conversionsresultr)rlrrroptimize_for_inferences                                     r)F)rpr)IZtorch.fxr#Z torch.fx.noderrZtorch.nn.utils.fusionrtypingrrrrr r r r rMZtorch.nnr1Ztorch.nn.functionalZ functionalFZtorch.fx.passes.shape_propr r4 collectionsrZtorch.utils.mkldnnutilsZmkldnnraoperatorrtrenumrr&rr$r*rfr/rBrNr`r2ZLinearr3ZReLUZ MaxPool2dZ AvgPool2dZAdaptiveAvgPool2dZreluZ transposeZsigmoidZ avg_pool2dZadaptive_avg_pool2draddmulrZ MkldnnConv2dZ MkldnnLinearrdrirjrkrrrrZTracerrrrrrs^  (    $ $.    "2 &