[Th0VSSKJr SSKJr SSKJrJr "SS5r"SS\5r"SS \5r "S S \5r "S S \5r "SS\5r S\S\ \S\4SjrS\S\\\ 4S\ 4SjrS\\S\\\ 4S\\\ 44SjrS\S\S\4SjrS\\S\\\ 4S\4Sjrg) )Enum) NamedTuple)map_argNodecB\rSrSrSrS\SS4SjrSrSrS r S r S r g) PartitionzPartition class contains all the information about an individual partition. It also provides necessary methods for manipulation the partition. partition_idreturnNc[5UlXl[5Ul[5UlSUlSUl/Ulg)Nr)setnodesr parentschildren bfs_levelused_mem_byteslogical_device_ids)selfr s _/var/www/auris/envauris/lib/python3.13/site-packages/torch/fx/experimental/partitioner_utils.py__init__Partition.__init__ s: # ('*u (+  #$-/c,[UR5$N)strr )rs r__str__Partition.__str__s4$$%%rcSUlURH+nU=R[XR5- slM- g)Nr)rrget_extra_size_of)rnodes rrecalculate_mem_sizePartition.recalculate_mem_sizes3JJD   #4T::#F F rcJ0n[URUR5 [URUR5 UH0nURS;dMUR R U5 M2 UR R U5 UR5 g)N>get_attr placeholder)rargs setdefaultkwargsopraddr")rr! input_nodesns radd_nodePartition.add_nodest(*  ;112 [334Att22 q! t !!#rc^UTR;aTRRU5 0n[URUR5 [UR UR5 UHVn[ U4SjUR55(dM)URS;dM;TRRU5 MX TR5 gg)Nc3@># UHoTR;v M g7fr)r).0r-rs r (Partition.remove_node..5s1AATZZ'1As>r%r&) rremoverr'r(r)allusersr*r")rr!r, input_nodes` r remove_nodePartition.remove_node)s 4::  JJ  d #,.K DII{55 6 DKK!7!7 8* 1;1A1A mm'BBJJ%%j1 *  % % ' r)rrrrrr r) __name__ __module__ __qualname____firstlineno____doc__intrrr"r.r9__static_attributes__rrrrs/0S0T0&G $(rrc4\rSrSr%\\S'\\S'\\S'Srg)Device<nameavailable_mem_bytes logical_idrBN)r;r<r=r>r__annotations__r@rArBrrrDrD<s IOrrDc*\rSrSr%\\S'\\S'Srg) NodeLatencyBmem_latency_seccomputer_latency_secrBNr;r<r=r>floatrIrArBrrrKrKBsrrKc4\rSrSr%\\S'\\S'\\S'Srg)PartitionLatencyIrMrNoverall_latency_secrBNrOrBrrrRrRIsrrRc(\rSrSrSrSrSrSrSrSr g) PartitionModeRrrBN) r;r<r=r> size_based sparse_nn cost_awarekl_based aot_basedrArBrrrVrVRsJIJHIrrVc\rSrSr%\\\S'\Rr \\S'Sr \ \S'0r \ \\4\S'0r\ \\4\S'0r\ \\\4\S'S r\\S 'S rg ) PartitionerConfigZdevicesmodetransfer_rate_bytes_per_secnode_to_latency_mappingnode_to_partition_mapping#partition_to_logical_device_mappingF saturate_hostrBN)r;r<r=r>listrDrIrVr\rergrPrhdictrrKrir@rjrkboolrArBrrrbrbZsq &\'22D-2),,79T$ "34913tD#I3@B'c49n)=BM4rrbr!rr cb0n[URUR5 [URUR5 SnUH7nXA;dM [ USS5nU(aX5R - nM.[ S5e [ USS5nU(aX5R- nU$[ S5e)zwGiven a node and a set of nodes, this function return the extra size that needed if this node is included in this set. r size_bytesNznode has no size_bytes attr)rr'r(r)getattr output_size RuntimeError total_size)r!rr,total_size_of_input_nodesr-rps rr r es %'K DII{--. DKK//0 !  > L$7J)-C-CC)"#@AA|T2J!%:%::! %$899r partitionrhc ^^^S[S[[4SjnS[S[4UUU4SjjmU"T5n[SSSS9nUH3nT"U[SSSS95nURUR:dM1UnM5 U$)zVGiven a partition and its nodes' latency, return a PartitionLatency for this partitionrvr c4^/nTRHnURS;aM0n[URUR5 [UR UR5 [ U4SjU55(aMsURU5 M U$)z>Given a partition, return a list of nodes on the top bfs level>r%r&c3n># UH*nUTR;=(a URS;v M, g7f)>r%r&N)rr*)r2r-rvs rr3Fget_latency_of_one_partition..get_top_nodes..s3$AY__$P5P)PP$s25)rr*rr'r(r)anyappend)rv top_nodesr!r,s` r get_top_nodes3get_latency_of_one_partition..get_top_nodess " OODww55,.K DII{55 6 DKK!7!7 8$  &$rr!c >T UnUR[URUR5-nURUR-nURUR-n[ UR 5R T R5nU(aG[SSSS9nUH4nT "U[XEU55n U RUR:dM2U nM6 U$[XEU5$)ziGiven a top node of a partition, this function returns the latency of the critical path in the partition rfrMrNrT) rTmaxrNrMrr7 intersectionrrR) r!partition_latency node_latencyrTrMrNr7 max_latencyr-new_partition_latency dfs_helperrhrvs rr0get_latency_of_one_partition..dfs_helpers/t4 /CCc  - -|/K/KG    - - 0L0L L   2 2\5V5V V DJJ,,Y__= * ##SVK(2$'?R)%*==!556#8K  3F  rrfr)rrlrrRrT)rvrhr~r}critical_path_latencyr!rrs`` @rget_latency_of_one_partitionrs tDz(( ( 5E( ( Xi(I,#3&   ##SV    1 1#77 8%6 ! ! r partitionsc:0nUHn[X15nXBU'M U$)zGiven all the partitions and node_to_latency_mapping dictionary, return a mapping dictionary of each partition to its overall latency )r)rrhpartition_to_latency_mappingrvrs r get_partition_to_latency_mappingrs7 GI  8  3DY/  ('rparent_partitionchild_partitionrgcUR/:wa+UR/:waURUR:XagSn[5nURHn0n[URUR 5 [UR UR 5 UHJnXpR;dMXt;dM[USS5nUbX8R- nURU5 ML M X2- $)z^Given two partitions (parent and child), calculate the communication latency between the two. rfrrpN) rrrrr'r(r)rqrrr+) rrrg comm_size visited_nodesr!r,r-rps rget_comm_latency_betweenrs ++r1  . ." 4  / /?3U3U UIEM  %%(*  ;112 [334A***q/E$Q d; )!7!77I!!!$  &  22rrc^^^S[S[S[4UUU4SjjmS[[S[[4SjnU"U5nSnUHnT"US5nXu:dMUnM U$)zGiven all partitions in a graph, find the critical path among all partitions and return its latency as the latency of the whole graph rvlatency_so_far_secr c>UTUR- nUR(a7SnURH#n[XT5nT"X1U-5nXR:dM!UnM% U$U$)zJThis function helps to recursively get the latency of a path of partitionsrf)rTrr) rvrmax_latency_secchildcomm_latency_secnew_latency_secrrrgs rr4get_latency_of_partitioned_graph..dfs_helpers :       !O"++#;&A$ #-0@@##4&5O,# "!!rrcjUVs/sH n[UR5S:XdMUPM" nnU$s snf)zfThis function is to return all the partitions without parents as the starting points of all the paths r)lenr)rrvtop_partitionss rget_top_partitions.get_top_partitions-s? (2 '1)S9J9J5Kq5PIz   s00rf)rrPrl) rrrgrrcritical_path_latency_secrv latency_secrs `` @r get_latency_of_partitioned_graphrsy"i"U"u"",tI4 ?( 3N ##  C0  2(3 %$ %$rN)enumrtypingr torch.fx.noderrrrDrKrRrVrbrr@r rmrrlrrPrrrBrrrs#'1(1(hZ  * zD  %D%T%s%8V!V!37k8I3JV!V!r (Y (:>t[?P:Q ( )% %& ( !3!3!3"'!3H/%Y/%"&y2B'B"C/%"'/%r