Vh PddlZddlZddlmZmZddlmZmZmZddl m Z ddl m Z ddl mZgdZdej fd ZeZe d eGd d Ze d  dde deedeeegefdeeeeffdZe d dededefdZy)N) dataclassfield)AnyCallableOptional) compatibility)Graph)Node)get_source_partitionscheck_subgraphs_connectedSourcePartitionreturnc|tjt}tjj ddj }|j|tj}tjd}|j||j||j|d|_ |S)NPYTORCH_MATCHER_LOGLEVELWARNINGz%(filename)s > %(message)sF) logging getLogger__name__osenvirongetuppersetLevel StreamHandler Formatter setFormatter addHandler propagate)loggerlevelconsole formatters Z/home/dcms/DCMS/lib/python3.12/site-packages/torch/fx/passes/utils/source_matcher_utils.py _init_loggerr$s   x (F JJNN5y A G G IE OOE##%G!!">?I # U gF MF)is_backward_compatibleceZdZUeeed<eed<eeZeeed<eeZ eeed<eeZ eeed<y)r nodessource)default_factory input_nodes output_nodesparamsN) r __module__ __qualname__listr __annotations__rrr+r,r-r%r#r r !sT : K$D9Kd9 %T:L$t*:t4FDJ4r%r graphwanted_sources filter_fnc i}|jD]}|jjddx}q|jjddx} R|\}}|jdd} | |vr5|j | i} | j |g} | j ||jjddx}|d}|d|vs|j |di} | j |dg} | j |dt td td tfd } i} |rYi}|jD]B\}}|jD cic]\}} tt|| r|| }}} |||<D|}|jD]-\}}|jD cgc] } | | | c} | |</| Scc} }wcc} w) a Args: graph: The graph we want to partition wanted_sources: List of sources of nodes that were decomposed from this source. This can be a function (ex. torch.nn.functional.linear) or a leaf module type (ex. torch.nn.Linear). Returns: Dictionary mapping sources that were given to a list of SourcePartitions that correspond to the list of nodes that were decomposed from the given source. source_fn_stackNtorch_fn.rr( module_typerc t}t}t}|D]}|jD]9}t|ts||vs|jdk7s)|j |;|jdk(r|j |l|j jD]}||vs|j |t||t|t|t|S)Nget_attr) setargs isinstancer opadduserskeysr r0)r(r<r+r,r-nodeargusers r#make_partitionz-get_source_partitions..make_partitionese u  +Dyy )c4(S-=#&&JBVOOC( )ww*$ 4  ) +u$ $$T* + +       L   r%)r(metarsplit setdefaultappendr0r typer itemsallmapvalues)r3r4r5modulesrF source_fn_str8node_fqn source_fnsource_fn_name diff_modules partitionrIretfiltered_modulestpname_to_partitionnamefiltered_name_to_partitionkvs r#r r 6s $24G '!IIMM*;TB BL K j$7 7HQ#+ Hi&__S1!4N/&11."E (33HbA   & IIMM*;TB BL O$R(I|~-&11)A,C (33IaL"E   &3'6 d4j t  435C%,]]_ > !B!(9'>'>'@*#D)s9i01i* &* $> R  ># L1@A K9.A.KAL J*Ls "G,G  subgraph1 subgraph2ct|jD]2}|jjD]}||jvsy4y)z Given two subgraphs A and B (in the form of a list of nodes), checks if A has nodes connecting to at least one node in B -- aka there exists a node in B that uses a node in A (not the other way around). TF)reversedr(rDrE)rbrcrFrHs r#r r sJ)JJOO% Dy&  r%)N)rr dataclassesrrtypingrrrtorch.fx._compatibilityrtorch.fx.graphr torch.fx.noder __all__Loggerr$rr r0booldictr r r2r%r#ros (**1  T gnn  e, 55 -5&e,37Z ZIZ$./Z #tO$ $% Z-Zze,  +:   - r%