PhH BddlmZmZddlmZddlmZddlmZddl m Z m Z m Z m Z mZmZddlZddlZgdZdZeZed eGd d Zed  dd ede e deeegefde e e effdZed dededefdZy)) dataclassfield)Graph)Node) compatibility)DictListAnyTypeOptionalCallableN)get_source_partitionscheck_subgraphs_connectedSourcePartitionc|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 uC:\Users\daisl\Desktop\realtime-object-detection\venv\Lib\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<eeZ eeed<eeZ eeed<eeZ eeed<y)rnodessource)default_factory input_nodes output_nodesparamsN) r __module__ __qualname__r r__annotations__r rlistr-r.r/r'r%rrsT : K$D9Kd9 %T:L$t*:t4FDJ4r'rgraphwanted_sources filter_fnreturnc i}|jD]i}|jjddx}"|d}|d|vr/|j|di}|j|dg}|j |kdt t dtdtfd } i} |rYi} |jD]B\} } | jDcic]\}}tt||r||}}}|| | <D| }|jD]-\}}|jDcgc] }| || 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_stackNrr* module_typer8c t}t}t}|D]}|jD])}t|ts||vs|j |+|j dk(r|j ||j jD]}||vs|j |t||t|t|t|S)Nget_attr) setargs isinstanceraddopuserskeysrr3)r*r=r-r.r/nodeargusers r%make_partitionz-get_source_partitions..make_partitionWse u Dyyc4(S-=OOC(!ww*$ 4  )u$ $$T**       L   r') r*metar setdefaultappendr rr ritemsallmapvalues)r5r6r7modulesrG source_fn_st source_fn diff_modules partitionrJretfiltered_modulestpname_to_partitionnamefiltered_name_to_partitionkvs r%rr2sq$24G  !IIMM*;TB BL K  $ Q<~ - )))A,;  ++IaL"= " d4j t  035C%,]]_ !B!(9'>'>'@*'@OD)s9i01i'@ '* $> R &5# 1@A K 9.A. KA  J*Ls "D7D= 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*rErF)r_r`rGrIs r%rrs@)JJOO%Dy&&* r')N) dataclassesrrtorch.fx.graphr torch.fx.nodertorch.fx._compatibilityrtypingrr r r r r rr__all__r&r!rboolrrr4r'r%rjs( 1<<  T  e, 55 -5$e,37N NIN$./N #tO$ $% N-Nbe,  _ Y] - r'