g^(hs ,ddlZddlZddlZddlZddlZddlmZmZddlm Z m Z ddl m Z ddl mZmZmZmZmZmZddlZddlmZddlmZddlmZmZddlmZdd lm Z d d l!m"Z"d d l#m$Z$m%Z%m&Z&d d l'm(Z(erddlm)Z)gdZ*ejVe,Z-Gdde Z.e.j^Z/e.j`Z0e.jbZ1e.jdZ2e.jfZ3e.jhZ4e.jjZ5e.jlZ6e.jnZ7e.jpZ8e/Z9e0Z:e1Z;e8Z<ejzdZ>GddeZ? dCde@eAeBee?fdeeAdeCfdZDGddeZEdCdeBejdeeCfdZG dCdeBejdeeCde@eAejRffdZHGdd eEZIGd!d"eIZJGd#d$eIZKGd%d&eIZL dDd'eBee?d(eAdeBe?fd)ZMd'eBee?deBe?fd*ZNd'e@eAeBe?fd+eeAgeAfd,eAde@eAeBe?ffd-ZOd.e@eAeBee?fd/eAd,eAd0eAde@eAeAff d1ZPGd2d3eEZQGd4d5eQZRGd6d7eQZS dEd8ZTGd9d:eQZUGd;deQZWd?eCfd@ZXd+eeAgeAfd,eAfdAZYdBZZy)FN)ABCabstractmethod)Counter defaultdict)Enum)AnyCallable NamedTupleOptional TYPE_CHECKINGUnion)OptimizedModule) FSDPModule UnshardHandle)_Loss)record_function)generate_stage_to_rank_mapping) merge_chunkssplit_args_kwargs_into_chunksTensorChunkSpec)_PipelineStageBase)Work) get_schedule_classPipelineScheduleSinglePipelineScheduleMulti Schedule1F1B ScheduleGPipeScheduleInterleaved1F1BScheduleLoopedBFSScheduleInterleavedZeroBubbleScheduleZBVZeroBubblecJeZdZdZdZdZdZdZdZdZ dZ d Z d Z d Z ed Zy )_ComputationTyper cPtjdtjdtjdtjdtj dtj dtjdtjdtjd tjd i }||S) NFIWUNSHARDRESHARDSEND_FRECV_FSEND_BRECV_BB) r$FORWARDBACKWARD_INPUTBACKWARD_WEIGHTr2r3r4r5r6r7 FULL_BACKWARD)selfstr_maps d/var/www/skyplay_api_hub/venv/lib/python3.12/site-packages/torch/distributed/pipelining/schedules.py__str__z_ComputationType.__str__9s  $ $c  + +S  , ,c  $ $i  $ $i  # #X  # #X  # #X  # #X  * *C  t}c|dk(rtjS|dk(rtjS|dk(rtjS|dk(rtjS|dk(rtj S|dk(rtj S|dk(rtjS|dk(rtjS|d k(rtjS|d k(rtjStd |) Nr/r0r1r2r3r4r5r6r7r8zInvalid computation type ) r$r9r:r;r2r3r4r5r6r7r< RuntimeError)actions r?from_strz_ComputationType.from_strHs S=#++ + s]#22 2 s]#33 3 y #++ + y #++ + x #** * x #** * x #** * x #** * s]#11 1!:6(CD DrAN)__name__ __module__ __qualname__r9r:r;r2r3r4r5r6r7r<r@ staticmethodrErAr?r$r$,sOGNOGG F F F FM EErAr$z?(\d+)(F|I|B|W|UNSHARD|RESHARD|SEND_F|RECV_F|SEND_B|RECV_B)(\d*)cReZdZUeed<eed<dZeeed<dZe de fdZ y)_Action stage_indexcomputation_typeNmicrobatch_indexct|j}|t|jz }|j|t|jz }|SN)strrMrNrO)r=reprs r?__repr__z_Action.__repr__~sM4##$ D))**  , C--. .D rA action_stringc(|j}tj|x}rW|j\}}}t t |t j|t|rt |SdS|dk(rytd|d)z Reverse of __repr__ String should be formatted as [stage][action type][(microbatch)] e.g. `2F0`, `1UNSHARD`, `3SEND_F1` NzInvalid action string: zD, should be formatted as [stage][action type][(microbatch)] e.g. 2F0) strip _action_regexmatchgroupsrLintr$rElenrC)rUrZrMrNrOs r?rEz_Action.from_strs&++- !'' 6 65 6>Clln ;K)+;K  ))*:;),-=)>$% EI  b %m_4x y  rA) rFrGrHr\__annotations__r$rOr rTrIrRrErJrAr?rLrLys=&&&*hsm*   rArLpipeline_ordererror_step_numberreturnc ^tj|}|D]/}tt||D]}||| d|||<1t d|j D}t|Dcgc]4}dt |jtt |dz z6}}t|Dcgc]}|j|dg|z}}ttj|ddi}t|} t| Dcgc]}dt |z} }t|g|D cgc]} t d| Dc} dt|d d zzdjfd t| Dz} t||D cgc]T\} }| d djfd t|Dz|!t!| j#d|k(rdndzV}} }| dzdj|zdz}|Scc}wcc}wcc}wcc} wcc}} w)z Formats the pipeline order in a timestep (row) x rank (column) grid of actions and returns the formatted string. If `error_step_number` is passed in, an additional label will be added to signify which step that it is erroring on. rWc32K|]}t|ywrQ)r]).0actionss r? z)_format_pipeline_order..sHWCLHszStep r fillvaluezRank c3LK|]}|tt|ndyw)Nr)r]rR)rditems r?rfz)_format_pipeline_order..s" F$d.CD NA 5 Fs"$ rr%c3:K|]\}}|d|dyw.s0<)1E5;q>" " #$<sz: c3LK|]\}}t|d|dywrl)rR)rdrnrirps r?rfz)_format_pipeline_order..s/R4c$i+a.!1123Rs!$z <-- ERROR HERE )copydeepcopyranger]maxvaluesrRzfillsortedgetlist itertools zip_longestzipjoin enumerater\split)r_r`rankrn num_steps step_labelskey rank_actionstransposed_actions num_ranks rank_labelscol header_rowrorowformatted_rowsformatted_tablerps @r?_format_pipeline_orderrsc]]>2N-s>$/01 -Ad#A&.*,t$Q' --H0E0E0GHHIAFyAQ<=#a&,,s3y1}#5677K >DN=S693y 01Li33\PRPQN#I-29-=>7SV#>K>{8%78  F# FFK KN+a/0388<5>{5K<4Jk+=>  E3 ' ((R9S>R R S!,EKKM!$%)::    N !4'$))N*CCdJO G? s89HHH:H$AH)ceZdZ ddedeedejfdeee dfdee e e fdee e e e fee fdef d Zd Zd Zd Ze dd eedeedeedeefdZeddddeefdZ dd eedeedeedeefdZdZ ddee dfdee e e ffdZdee de fdZy)_PipelineScheduleNn_microbatchesloss_fn.args_chunk_speckwargs_chunk_specoutput_merge_spec scale_gradsc||_||_||_||_||_||_ |jdu|_g|_tjd|jjy)NzUsing %s) _n_microbatches_loss_fnr_args_chunk_spec_kwargs_chunk_spec_output_merge_spec _has_backward_internal_lossesloggerinfo __class__rF)r=rrrrrrs r?__init__z_PipelineSchedule.__init__sq . '!0"3"3 "]]$657 J 7 78rAc|jr>|jr1|j|||}|jj |yyyrQ)is_lastr _compute_lossrappend)r=stageoutput target_mbsmb_indexlosss r?_maybe_compute_lossz%_PipelineSchedule._maybe_compute_losssC ==T//%%fj.BCD  ! ! ( ( .0=rAcd|cxkxrt|jknc}|jr|jr|r|j|St|jdk7r|st d|d|jy)NrzLoss for microbatch z6 is not available. Available losses for microbatches: )r]rrrrC)r=rr valid_indexs r?_maybe_get_lossz!_PipelineSchedule._maybe_get_losss8@c$*?*?&@@ ==T//K((2 2 && '1 ,[&xj166:6K6K5LN  rAct|ts|g}td|D}|r}|{t|j|j k7r.t d|j dt|j|j|j|j|jjy)zB Update the losses to those in the internal state c34K|]}|jywrQr)rdrs r?rfz3_PipelineSchedule._update_losses..s!DE%--!DsN Expecting z losses but got ) isinstancer{anyr]rrrCclearextend)r=stageslossescontains_last_stages r?_update_lossesz _PipelineSchedule._update_lossess &$'XF!!DV!DD 6#54(()T-A-AA" !5!5 66Fs4K`K`GaFbc LLN MM$// 0 ##%rAarg_mbs kwarg_mbsrrct)z Run one iteration of the pipeline schedule with list of microbatches. Will go through all the microbatches according to the schedule implementation. Args: microbatches: list of microbatch args. NotImplementedError)r=rrrrs r?_step_microbatchesz$_PipelineSchedule._step_microbatches%s "!rAtargetrct) Run one iteration of the pipeline schedule with *whole-batch* input. Will chunk the input into microbatches automatically, and go through the microbatches according to the schedule implementation. args: positional arguments to the model (as in non-pipeline case). kwargs: keyword arguments to the model (as in non-pipeline case). target: target for the loss function. losses: a list to store the losses for each microbatch. r)r=rrargskwargss r?stepz_PipelineSchedule.step7s "!rAcdtffd }| ||dndgjz}| ||dnigjz}| ||d|'t|tst dt |||fS)z* Pre-process/check inputs namec t|tst|dt|t |j k7r't dj d|dt |y)Nz must be a list but got a rrjz but got )rr{ TypeErrortyper]r ValueError)mbsrr=s r?check_type_and_lenz;_PipelineSchedule._check_inputs..check_type_and_lenPsmc4(4&(B49+ NOO3x4///  !5!5 6avYs3xjQ0rArrJrrz losses must be a list but got a )rRrrr{rr)r=rrrrrs` r? _check_inputsz_PipelineSchedule._check_inputsEs #    w 2dT111G  y+ 6t333I  ! z< 8  fd+"B4<. QRR !!rAc&|j||SrQ)r)r=rrs r?rz_PipelineSchedule._compute_lossks}}VV,,rArrc|s|r4t|||j|j|j\}}||fSdg|jzig|jzfS)zj Splits a full-batch input into chunks (i.e. microbatches) and returns the chunks rJ)rrrr)r=rr args_split kwargs_splits r? _split_inputsz_PipelineSchedule._split_inputsnsm 6'D$$%%'' ( $J |+ +4$...t7K7K0KK KrA output_chunksrac.t||jS)z Merge output chunks back to a batch state. If output_merge_spec is None, the utility will merge output chunks by dimension 0 (batch dim). )rr)r=rs r?_merge_outputsz _PipelineSchedule._merge_outputss    # #  rANNNNTNNNNrQ)rFrGrHr\r r torchTensortuplerdictrRr rboolrrrrrr{rrrrrrrJrAr?rrs:>AEBFIM  9 9(3 #456 9"%(<"=> 9 $Do)=$>? 9 $E$sCx.%**D$EF 9 9D/ &.#'$(%)!% "$"D>"TN "  """!% "x~ " "#'$(%)!% $"$$"D>$"TN $"  $"L- ,0LCHoLc3h(L. DI # rArp2p_opsdescct|dk(ry|r|dnd}tjd||tj|j S)zt Simple wrapper over batch_isend_irecv from torch.distributed, which just adds a descriptive logger on top. rNz, rWzbatch_p2p %s%s)r]rdebugdistbatch_isend_irecvpop)rrdesc_strs r? _batch_p2prsM 7|q"$r{H LL!8W5  ! !' * . . 00rActt}i}t|dk(r|S|D] }||jj |"t |j D]\}}t||||<|S)z Sorts the list of P2P ops by the peer rank, and then calls batch_isend_irecv. Return a dictionary of works by peer rank. This function helps us avoid hangs in case of skip connections. rr)rr{r]peerrryitemsr)rr ops_by_peer work_by_peeropropss r?_sorted_batch_p2prs0;4/@K)+L 7|q(BGG##B'(K--/08 c'$7 T8 rAceZdZdZ ddededeedeee dfdee e e fd ee e e e fee fd effd Zd Zddd deefdZxZS)ra Base class for single-stage schedules. Implements the `step` method. Derived classes should implement `_step_microbatches`. Gradients are scaled by num_microbatches depending on the `scale_grads` argument, defaulting to True. This setting should match the configuration of your loss_fn, which may either average losses (scale_grads=True) or sum losses (scale_grads=False). Nrrrr.rrrct|||||||||_|j|_|j |j_d|_||jkrtd|d|jdy)NrrrrrrFzNumber of microbatches (z9) must be greater than or equal to the number of stages (z).) superr_stage num_stages _num_stagesr has_backward_stage_initializedr) r=rrrrrrrrs r?rzPipelineScheduleSingle.__init__s )+//#    ++#'#5#5  "' D,, ,*>*:;##'#3#3"4B8  -rAc|jj|j|||jr%|jj |jd|_yNT)r_prepare_forward_infrarr_prepare_backward_infrar)r=rrs r?_initialize_stagez(PipelineScheduleSingle._initialize_stagesG **4+?+?vN    KK / /0D0D E"&rArrc\|jj|j||\}}|*tt j ||j }nd}|j|||||jjr%|j|jjSyrN) rclear_runtime_statesrr{r tensor_splitrrrrr)r=rrrrrr targets_splits r?rzPipelineScheduleSingle.steps ((*$(#5#5dF#C L   !3!3FD  $Do)=$>? $E$sCx.%**D$EF@' "&x~rArc JeZdZdZ ddeedeedeedeefdZy) _ScheduleForwardOnlyzo The forward-only schedule. Will go through all the microbatches and perform only the forward pass Nrrrrc|| td|j||||\}}|js|j|d|dg}t |j D]}t d|5|jj|}t|d}|jD]} | j|jj||||||jj|}t|d}|j|jdddtj!d|jj"||D]} | jy#1swYNxYw) z< Run one iteration of the pipeline schedule Nz7Forward-only schedule does not support loss computationrForward fwd_recvrfwd_send[%s] Forwarded microbatch %s)rCrrrrurrrget_fwd_recv_opsrrwwaitforward_one_chunkget_fwd_send_opsrrrrM) r=rrrrfwd_sends_to_waitrnrworksworks r?rz'_ScheduleForwardOnly._step_microbatchessq  !V%7I "//JPVW&&  " "71:y| <.0t++, UA 8A30 9kk2215)#J?!LLN DIIK  --aYq\Jkk2215)#J?!((8 9 LL79P9PRS T U$& D IIK # 9 9s 3B8E88F rrFrGrHrr r{rrJrAr?r r  sP#'$(%)!% *$*D>*TN *  *rAr c JeZdZdZ ddeedeedeedeefdZy) rz^ The GPipe schedule. Will go through all the microbatches in a fill-drain manner. Nrrrrc |j||||\}}|js|j|d|dg}t|jD]}t d|5|j j|}t|d}|jD]} | j|j j|||||} |j j|}t|d}|j|jdddtjd|j j ||j#|j  |||D]} | j|j$syg} t|jD]#}t d|5|j j'|}t|d }|jD]} | j|j)|j |} |j j+|| ||jd z k( |j j-|}t|d }| j|jdddtjd |j j |&|j j/|j.r |jnd |j1|j || D]} | jy#1swY xYw#1swYxYw)z Run one iteration of the pipeline schedule with list of microbatches. Will go through all the microbatches according to the GPipe schedule. Args: microbatches: list of microbatch args. rr rrrNrz Backward bwd_recvrr last_backwardbwd_sendz[%s] Backwarded microbatch %sgrad_scale_factor)rrrrurrrrrrwrrrrrrrMrrget_bwd_recv_opsrbackward_one_chunkget_bwd_send_opsrr) r=rrrrrrnrrrrbwd_sends_to_waitrs r?rz ScheduleGPipe._step_microbatchesBs"//JPVW&&  " "71:y| <.0t++, IA 8A30 9kk2215)#J?!LLN DIIK 66q'!*iPQlSkk2215)#J?!((8 9 LL79P9PRS T  $ $T[[&*a H I(& D IIK !! .0t++, VA 9QC1 9kk2215)#J?!LLN DIIK ++DKK; .."#t';';a'?"?/ kk2215)#J?!((8 9" LL8$++:Q:QST U% V( 6:6F6Fd22A  DKK0& D IIK s 9 9< 9 9s%B8L;>CM;M M rrrJrAr?rr<sU#'$(%)!% R$RD>RTN R  RrArc JeZdZdZ ddeedeedeedeefdZy) rzo The 1F1B schedule. Will perform one forward and one backward on the microbatches in steady state. Nrrrrc|j||||\}}|js|j|d|dt|j|j |j jz }d}d}d}g} t|D]} |j j|} t| dx} r| j|j j|||||} |r|j|j j|} ||dz k7r t| d}|j|j | |||dz } |j j|}t| |zdx}r|j|j!|j |}|j j#||||jdz k(|j j%|}|dz }||jk(rn|j j|} t|| zd x}r|j|j j|||||} |j|j | |||j j|} |dz }Wt|d }||jkr|j j|}t|d x} r| j|j!|j |}|j j#||||jdz k(|r|j|j j%|}t|d }|dz }||jkr|j j'|j&r |jnd |r|j|j)|j |y) z Run one iteration of the pipeline schedule with list of microbatches. Will go through all the microbatches according to the 1F1B schedule. Args: microbatches: list of microbatch args. rNrrrrfwd_send_bwd_recvrbwd_send_fwd_recvrrr)rrrminrrrrMrurrrrrrr!rr"r#rr)r=rrrr warmup_chunks fwd_mb_index bwd_mb_index send_work fwd_sends_ fwd_recvs recv_workr bwd_recvs fuse_workr bwd_sendss r?rzSchedule1F1B._step_microbatchess"//JPVW&&  " "71:y| <    t{{66 6     }% A 44\BI&yzBByB [[22gl3Y|5LF  44\BI}q00&yzB  $ $T[[&*l S A L9 B 44\BI'y9'I A L+T111. 6:6F6Fd22A   NN  DKK0rArrrJrAr?rrsU#'$(%)!% Q1$Q1D>Q1TN Q1  Q1rArcompute_actionsmax_active_stagesc dtdtttdttfd}t g dtf fd }dtf fd }t |D]s\}}| ||||d tt fd  }tt fd  }|D] } ||  |D] } ||   j|u S) aRGiven a basic schedule involving only compute actions (F,B,W), add UNSHARD/RESHARD actions for FSDP. UNSHARD refers to fetching the full contents of an FSDP-sharded layer, requiring an all-gather operation. RESHARD does the opposite, releasing memory (but doing no commmunication) We abandon the "timestep lock" during lowering max_active_stages controls how many prefetches we allow. It should be measured in mb and tuneable but in practice 3 stages is probably the thing we want? (to account for having one f and one b active, and something else prefetching?) count next_actionsract}g}|D][}||j|vs|j|j|j|jt ||k(sZ|S|S)zdRemove duplicates (same stage, different microbatch), find next 'count' stages that will do compute.)setrMaddrr])r8r9seenretas r?next_stage_indicesz0_add_unshard_reshard..next_stage_indicesAsj A}d!:' 1==)s8u$    rArMchj|jt|tdyrQ)r<rrLr2rM active_stagesfsdp_aware_actionss r?_unshardz&_add_unshard_reshard.._unshardSs(+&!!'+w"EFrAchj|jt|tdyrQ)removerrLr3rBs r?_reshardz&_add_unshard_reshard.._reshardWs([)!!'+w"EFrANc |vSrQrJ)srCs r?z&_add_unshard_reshard..bs a}&<rAc |vSrQrJ)rJnext_ns r?rKz&_add_unshard_reshard..ds avorA)r\r{r rLr;rfilterr) r5r6r@rErHrnrDfetchevictrrCrDrMs @@@r?_add_unshard_reshardrQ1s  "&x'8"9  c "eM(*GcGGcG/* 6 > $$5qr7JKV /"q7I(I 'R    "/"q7I(I 'R  # #~ 5',,?""k&=&=='';+G+GG  ! !**M6;R;RS     "  ! !& )+ , rA stage_to_rankrc  |Dcic]}|g}}|Dcic] }|t}}dtdtffd dtdtttff fd }dttdttdtffd }|r7d}t |D]}t ||dkDsJd |d t ||||d} || ||sC| ||j| ||j|  | r{|| \} } ||j| ||j| || jj| || jj| ||jdt ||dk(r||=d }|sJd |r7|Scc}wcc}w) NrDracF|jtk(r<|jdz k7xr(|jdz|jk7S|jttfvr9|jdk7xr(|jdz |jk7Sy)NrrF)rNr/rMr:r<)rDrrVs r? _has_commsz"_add_send_recv.._has_commss  " "a '%%a73M""Q&=v112=3 3 $ $(G G%%*3}""Q&0v11203 3rAc|s J|d|j}|j}|j}t||tk(rt nt |}|tk(r|dzn|dz }t||tk(rtnt|}||fS)Nz is not a valid comm actionr) rMrNrOrLr/r4r6r5r7)rD stage_idxctypemb_idxsendrecv_stage_idxrecvrYs r? _get_commsz"_add_send_recv.._get_commss&!IfX-H#II!&& ''((yEQJ&FFK*/1*Q)a-~!vPTzrA prev_actionscJ|y|jtk(rc|jdk(sTt|jt|j |vryt|jdz t|j |vryy|jt tfvr|jdz k(st|jt|j |vryt|jdzt |j |vryt|jdzt|j |vryyy)aWe don't put our own recv ops in the schedule, we let a sender on another rank put our recv ops in place. This helps ensure a sane (non-hanging) ordering of sends and recvs. But it also means we might not be able to schedule our next compute action yet. TrrF) rNr/rMrLr5rOr:r<r7)rDrbrs r?_ready_to_schedulez*_add_send_recv.._ready_to_schedules  >  $ $ )&2D2D2I**FF4K4KL **Q.63J3JK   # # 'F F&&*q.8**FF4K4KL **Q.@W@WX **Q. v?V?VW rAFrrank=z, len(compute_actions[rank])=Tz6Malformed compute schedule, can't schedule sends/recvs) r;rLrrr ryr]rr<rMr) r5rVrr comm_actionsrbrardprogressrDr^r`rYs `` @r?_add_send_recvrhs  DS-S4dBh-SL-SET,UTT35[,UL,U 7 t 7uWg-='>*!*14W* *X ?+ Dt,-1 4'7C 5689 1%T*1-F%fl4.@A!T"))&1T"&&v.f%!+F!3JD$!&--d3 &**40 t/?/?!@AHHN t/?/?!@AEEdK D ! % %a (?4()Q.#D)H1 2QQQx9 : C.T,Us GGre pp_group_sizenum_microbatchesc 6t||k(sJd|dt|t|D]}||vrJd|t|Dcic]=}|ttttt tt ti?}}i}|D]]}||D]Q}|t|ts Jd|d|j} |j} |j} | tk(r|| tj| n| tk(r8| || tvsJd| d| d|| tj| n| t k(r8| || tvsJd | d| d|| t j| n@| t k(r7| || t vsJd | d| d || t j| | |vr||| <8|| } || k(rDJd | d |d| `|D]} t|| t} t|| t}t|| t }t|| t }| |k(sJd| dtd| d||||zdzz|k(rJd| d|d|d|d| |Scc}w)Nz2Schedule has incorrect number of ranks - expected z , actual z%Schedule is missing actions for rank zGot an invalid action: z, expected instance of _Actionz Running Full Backward for stage z , microbatch z without first running Forwardz!Running Backward Input for stage z"Running Backward Weight for stage z% without first running Backward InputzStage z is assigned to both rank z and rank zGot rjz microbatches for stage z , expected r%z(Invalid backward microbatches for stage z : expected z( total backwards, but got B=z, I=z, W=) r]rur/r;r8r0r1rrLrMrNrOr<)rerirrjrstage_id stage_actionsstage_index_to_rank_mappingrDs_idr\mb_id existing_rankf_mbb_mbi_mbw_mbs r?_validate_schedulervs w<= ( <]O9UXY`UaTbc (m$OwN"Gv NNOj)=   su su su su   =M=#%!dm F~fg. )&1OP .%%D++E++Ezd#A&**51! d 3A 666tfM%Pno6d#A&**51! d 3A 667v]5'Qop6d#A&**51! d 3A 668mE7Rwx6d#A&**516648+D1 ;D A },TF".s%--2LHrAzDeprecation warning: 'use_full_backward' is no longer supported. Simply stop passing it, and everything should still work fine.)rr_stagesrr group_sizeri group_rankrrstage_index_to_group_rankrr_stages_initializedr_should_compute_lossr_rwarning) r=rrrrrrrxrrr{rs @r?rzPipelineScheduleMulti.__init__Ys )+//#   !!9//#AY111I(( )G    0 0* &\\ ME.2.L.LE + M\\ 4E!%!3!3E  4#( d2$L!CE  ( NNQ  )rArc&t}|jD]q}|jr|j|j||}n|j|j||}|j sW|j |jsd|_yr)rr|is_firstrrrrr)r=rrnext_stage_argsrs r?_initialize_stagesz(PipelineScheduleMulti._initialize_stagess,17\\ DE~~"'">">(($##(">">((/6#!!--d.B.BC D$( rAreract||j|j|j|_|j D]}|j|_y)z] Allocates the stage index to rank mapping which is needed for communication N)rvrirrrr|)r=rers r?_validate_and_set_stage_mappingz5PipelineScheduleMulti._validate_and_set_stage_mappingsT *<         * & \\ ME.2.L.LE + MrAct|dd5}tj|}|jD] }|j |j|" dddy#1swYyxYw)zQDump a CSV representation of the schedule into a file with the provided filename.wrWnewlineN)opencsvwriterr_writerowr=filenamecsvfilerrs r? _dump_csvzPipelineScheduleMulti._dump_csvs_ (C , ;ZZ(F++ ; 3 3D 9: ; ; ; ;s AAA'cH|dk(sJt|d5}tj|}t|D]5\}}|Dcgc]}tj |c}|j |<7 ddd|j|j ycc}w#1swY*xYw)zLoad a CSV representation of the schedule from a file with the provided filename. This API will most likely get renamed/refactored so is marked as internal for now. format must be "compute_only" for PipelineScheduleMulti. compute_onlyrWrN)rrreaderrrLrEr_r)r=rformatrrrrrJs r? _load_csvzPipelineScheduleMulti._load_csvs ''' (B ' O7ZZ(F&v. O cJM,NQW-=-=a-@,N##D) O O ,,T-@-@A -O O Os+BBBBB!rrch|jD]}|j|j||\}}|*tt j ||j }nd}|j|||||jD]+}|js|j|jcSyr) r|rrr{rrrrrrr) r=rrrrrrrrs r?rzPipelineScheduleMulti.steps\\ )E  & & ( )$(#5#5dF#C L   !3!3FD+>?? @rArrrc  |j||||\}}|js|j|d|d|jDcic]}|j|}}t }t }|j D]\} | dkDr!|j|j| dz | |jdz ks<|j|j| dz^t} t|j|jD]\} } g} | &| j}| j}| j} |Jd|t j"k(rT|| }|j%|||||}|j'||||| j)|j+|n|t j,k(r|| }|j/||}| | xxdz cc<| | |j0k(}|j2r |j0nd}|j5||d||r|j3|| j)|j7|n|t j8k(rM|| }|j/||}|j5||dd| j)|j7|n|t j:k(re|| }| | xxdz cc<| | |j0k(}|j2r |j0nd}|j=|||r |j3|nt?d ||D]}|j|}d}| tA|kr|| }|*|j}|j}|j} |Jd|t j"k(r1| dz|vsr|| dz}| j)|jC||t,t8t:fvrt?d ||D]}|j|}d}| tA|kr|| }|*|j}|j}|j} |Jd|t"t:fvrf|t8t,fvr1| dz |vs||| dz }| j)|jE|t?d || rtG| jI|jW|j|ycc}w#tJ$ri}tLjOd |j|jPjR| | tLjOd tU|j| |d}~wwxYw) Operate on the microbatches for looped schedules (multiple stages on each rank). TODO: Does not use sorted_batch_isend_irecv(). As a result, this schedule does not support models with skip connections. rrNzCAll currently supported action types require valid microbatch_indexTr full_backwardrFrzUnknown computation type zy[Rank %s] pipeline schedule %s caught the following exception at time_step %s when running action %sz%sr`),rrrr|rMr;keysr<rrrrr_rrNrOr$r9rrrrr<rrrr"r#r:r;backward_weight_one_chunkrr]rr!rr ExceptionrerrorrrFrr)r=rrrrrstage_index_to_stageall_prev_ranksall_next_ranksrMbackward_counter time_steprDrrNrrrrr  prev_rank prev_rank_opsprev_rank_action next_rank next_rank_opsnext_rank_actiones r?rz(PipelineScheduleMulti._step_microbatchess "//JPVW''  # #GAJ ! = 37,,? ).E  u $? ? $'5#&5/446 TKQ""4#A#A+PQ/#RST--11""4#A#A+PQ/#RS  T*1!*4+>+>tyy+I!JT  IvS (*%'-'>'>$%66H"("4"4K#/]/(+;+C+CC 4[ A!&!8!8$gh&789L"00 HU 5#9#9(#CD)-=-K-KK 4[ A#33E8D(5:5,[9T=Q=QQ&594D4DD00!*00$!%*.*7 1 )!--.?@ 5#9#9(#CD)-=-L-LL 4[ A#33E8D00$!%*/*/ 1  5#9#9(#CD)-=-M-MM 4[ A(5:5,[9T=Q=QQ&594D4DD00!*77$*78)!--.?@(+DEUDV)WXX"0I$($7$7 $BM'+$ 3}#55+8+C('3+;+L+L(#3#D#D&6&B&B '3a3,/?/G/GG*Q2FF)=[1_(M # 5+A+A(+K L-)*+2 !",";"0I$($7$7 $BM'+$ 3}#55+8+C('3+;+L+L(#3#D#D&6&B&B '3a3,/II -.-1PP*Q2FF)=[1_(M # 5+A+A(+K L","; 0 $Do)=$>? 0$E$sCx.%**D$EF0$D>00d(uS#X($ MChw&7!889 M  M;B "& x~ H#'$(%)!% z2$z2D>z2TN z2  z2rArc eZdZdZ ddeeeeefde ffd Z dde de ffd Z de fdZ dZ dd eed eed eed eefd ZxZS)_PipelineScheduleRuntimea% Provides a simple runtime that requires a 'schedule IR' including specified communication operations. Can be instantiated directly by creating _PipelineScheduleRuntime and calling load_csv, or can be subclassed and the subclass can be responsible for creating a schedule IR. rerct|i_|dk(rC|D]=}gj|<||D]$}|Jj|j|&?y|dk(rM|D]}t ||j|<t jfdj _ytd|d)z Given an in-memory representation for a simple compute-only schedule, lower it to a complex schedule including communication actions. Stores the schedule in self, and must be called before running step_mo() compute_commsNrc"j|SrQrrJr=s r?rKz8_PipelineScheduleRuntime._load_actions..s(F(Fq(IrA)rVrformat= is not implemented)rrpipeline_order_with_commsrrQrhrr)r=rerrrDrs` r? _load_actionsz&_PipelineScheduleRuntime._load_actionss /8CE& _ $ H79..t4%dmHF!---2248??GH H ~ % 7KDM8..t4  .<..I++.D * & 1D&EF FrArc|dk(r+t |||j|jy|dk(rzi}t |d5}t j |}t|D]+\}}|Dcgc]}tj|c}||<-|j||dddytd|dcc}w#1swYyxYw) aLoads a csv in simple format and then lowers it to include comunication actions format must be either "compute_only" or "compute_comms". If compute_only, the lowering passes will automatically be run to generate a compute_comms schedule. rrrWr)rNrr) rrrr_rrrrrLrEr) r=rrrerrrrrJrs r?rz"_PipelineScheduleRuntime._load_csvs ^ # G h '   t22 3  &Gh+ ;wG,!*6!2GID#BE$FQW%5%5a%8$FGDMG""76":  ; ; & 1D&EF F%G ; ;s+C1C CCCc|jJdt|dd5}tj|}|jD] }|j |j|" dddy#1swYyxYw)zaDump a CSV representation of the compute + comms schedule into a file with the provided filename.Nz6Must initialize compute_comms schedule before dump_csvrrWr)rrrrrrs r?rz"_PipelineScheduleRuntime._dump_csvs--9 D 9(C , FZZ(F66 F > >t DE F F F Fs AA11A:cLtjfdjS)Nc"j|SrQrrs r?rKz4_PipelineScheduleRuntime._simulate..sd44Q7rA)_simulate_comms_computerr)r=s`r? _simulatez"_PipelineScheduleRuntime._simulates%&  * * 7     rArrrrc |j||||\}}|js|j|d|d|jDcic]}|j|}}|j Jdi}i}g} it dtffd } t} t|j |jD]|\} } | j}| j | jnd}|dk\s|ttfvs Jd| d| j}||}t|j t"}|d z|v}|d z |v}t$j'd | | |t(k(r+| j+t-|j/|n|t0k(r+| j+t-|j3|ny|t4k(r.||f|vsJd t-|j7||||f<nB|t8k(r.||f|vsJd t-|j;||||f<n |tk(r7|r|vr|vs Jd |d|j j=d|<n|tk(r=|r|vs Jd|d|vs Jd|d|j j?n|t@k(r|r| ||jBs4|s2||f|vs Jd| d|jE||fjG|jI|||||}|jK|||||r||d zjM||n|tNk(r|r| ||jPs4|s2||f|vs Jd| d|jE||fjG|jS||}| |xxd z cc<| ||jTk(}|jVr |jTnd }|jY||d||r|jW||r||d z j[|j]||n|t^k(r|r| ||jPs4|s2||f|vs Jd| d|jE||fjG|jS||}|jY||dd|r{||d z j[|j]||nS|t`k(r;|r| || |xxd z cc<|jc|| ||jTk(nted| dto| r*| jEjGto| r*todk(sJd|jq|j|ycc}w#tf$r>}t$jid| | tktm|j | |d}~wwxYw)rrNz=Must call _load_actions() before calling _step_microbatches()r[cx|vr'|j|=j||vs Jd|y)zQIf an unshard is active for `stage_idx`, wait() it and mark `stage_idx` unshared.z*Attempted to compute on sharded stage_idx=N)rr<)r[ unshard_opsunsharded_stagess r?_assert_unshardedzF_PipelineScheduleRuntime._step_microbatches.._assert_unshardedsRK'I&++- * $$Y/ 00 =9,? 0rAzaction=z missing mb_indexrz8_PipelineScheduleRuntime running time_step %d, action %szARecv twice for {stage_idx=} {mb_index=} without executing forwardzBRecv twice for {stage_idx=} {mb_index=} without executing backwardzUnsharding the same stage_idx=z twiceT)async_opzResharding stage_idx=z without unshardingz before finishing unshardzComputing action=z before receiving inputz Attempted to run compute action=rFrz is unknown or unsupportedz\_PipelineScheduleRuntime caught exception at step %s when running action %s. Full Schedule:rzUnused unshard operations)9rrrr|rMrr;r\rrrrNrOr2r3rsubmodrrrr4rrrr6r#r5rr7r!unshardreshardr9rrrrrset_local_fwd_inputr<rrrrr"set_local_bwd_inputget_local_bwd_outputr:r;rrrrprintrr]r)r=rrrrrr bwd_recv_ops fwd_recv_opssend_opsrrrrD comp_typerr[stage_uses_fsdpis_next_stage_on_this_rankis_prev_stage_on_this_rankrrrr rrrs @@r?rz+_PipelineScheduleRuntime._step_microbatchess>"//JPVW''  # #GAJ ! = 37,,? ).E  u $? ? --9 K 9 57 46  "13 5  *1!*4+I+I$))+T!Uu  Ivt "33 ..:++  1} 6)1fY/01#.. ,Y7",U\\:"F-6]>R-R*-6]>R-R* N&OOJu/E/Eh/O$PQ&(OOJu/E/Eh/O$PQ&(! **\ * ;E..x8;L)X!67&(! **] * ;E..x8;L)X!67')&%-== ) <E=)VDE=271E1Et1E1T I.')&(,<<4)5HI< ) ;4)5NO; ,,.')&))4"NN :&$ * *Y.@y@W+XY *%(()X)>?DDF"44 '("3Yx5HF,,UFJQ2,Y];OO"H-/&))4"MM :&$ * *@y@WX  * %(()X)>?DDF//x@D$Y/14/$4Y$?4CWCW$WM@D@P@P(<(?DDF//x@D,, !&+&+ -2,Y];OO!66x@(/1&))4$Y/14/33 &6y&A//'04 %y0J%KLLMu p(m LLN   !(m;1$A&AA$ DLL&1{? L  r*66*3  s V'Q5V,, W359W..W3rr)rFrGrHrrr\r{r rLrRrrrrrrr s@r?rrs%!Gc4 1223!G!GFG#GsG* F# F #'$(%)!% p2$p2D>p2TN p2  p2rArc |eZdZdZ d deededeee e fdeee e e fee fdef fd ZdZxZS) r ai Breadth-First Pipeline Parallelism. See https://arxiv.org/abs/2211.05953 for details. Simliar to Interleaved 1F1B, Looped BFS supports multiple stages per rank. What is different is that when microbatches are ready for multiple local stages, Loops BFS will prioritizes the earlier stage, running all available microbatches at once. rrrrrct||||||i|_t|jD]"}|j |}||j|<$y)N)rrrrr)rrr_ruri!_calculate_single_rank_operations) r=rrrrrrrank_opsrs r?rzScheduleLoopedBFS.__init__sl )/#  CE$,,- 1D==dCH(0D   % 1rAc t|j}t||j|z|j}t|Dcgc]}d}}|D]/|j fdt|j D1d|jdz |z z}|j dg|zt |D]8|j fdt t|j D:|Scc}w)Nc3TK|]}ttj|!ywrQ)rLr$r9rdrrMs r?rfzFScheduleLoopedBFS._calculate_single_rank_operations..s) %5%=%=xH%(r%rc3TK|]}ttj|!ywrQ)rLr$r<rs r?rfzFScheduleLoopedBFS._calculate_single_rank_operations..!s) %5%C%CXNr)r]r|rurirrreversed)r=rn_local_stages stage_indicesr/rpost_warmup_opsrMs @r?rz3ScheduleLoopedBFS._calculate_single_rank_operations sT\\* $$$~5t7I7I .get_rank_warmup_opso##a'++&, " O//##a'4/3J z4#7#7$:M:M#MN NrA=rank %s, warmup_ops %s, 1f1b %s, cooldown_ops %s total_ops %sc`|jzjz}|jzzSrQrrrir local_indexrr=s r?rzVScheduleInterleaved1F1B._calculate_single_rank_operations..forward_stage_index 44#>#>>$BUBUUK$"4"44< .backward_stage_indexW##:%$*E*EE%%&&   $"4"44< $1 $Do)=$>? $1$E$sCx.%**D$EF$1$1L9 hw>O9P9 rArceZdZdZ ddeededeedee e dfdee e e fdee e e efe efd effd Zd eeefd Zd ZxZS)r!aw The Interleaved Zero Bubble schedule. See https://arxiv.org/pdf/2401.10241 for details. Will perform one forward and one backward on inputs for the microbatches in steady state and supports multiple stages per rank. Uses the backward for weights to fill in the pipeline bubble. In particular this is implementing the ZB1P schedule in the paper. rrrr.rrrc |D]'}t|jtstd|dj|_t ||||||||t||_ |dj|_ td||j z|_ ||jz|_||jzdk7rtd|jd|di|_t#|j D]"} |j%| } | |j | <$|j'|j|j z|_y)NzYThe Zero Bubble schedule is not supported with stage modules that have used torch.compilerrrzZZero bubble requires the number of microbatches to be a multiple of the number of rounds (rr)rrrrCr}rirrr]rr~rrvrrrr_rur_add_bubbles_to_actions r=rrrrrrrrrrrs r?rz&ScheduleInterleavedZeroBubble.__init__0sn E%,,8", $AY11 )+//#  "&k1I(( #A~9K9K'K L&48M8M&M# D11 1Q 65595J5J4KL)*!- CE$,,- 1D==dCH(0D   % 1#::   $"4"4 4 rArac  fd}| jjz}| z }||z } |z|z}tjd |||fd} fd}} t jj ||||| d S)Ncjdz jz}d}||jdz |z zz}t|jjzSrrrs r?rz\ScheduleInterleavedZeroBubble._calculate_single_rank_operations..get_rank_warmup_opsgrrArc`|jzjz}|jzzSrQr r s r?rz\ScheduleInterleavedZeroBubble._calculate_single_rank_operations..forward_stage_indexr rAcjdz |z jzjzz }|jzzSrrrs r?rz]ScheduleInterleavedZeroBubble._calculate_single_rank_operations..backward_stage_indexrrAT)rr) r=rrrrrrrrrrs `` @r?rz?ScheduleInterleavedZeroBubble._calculate_single_rank_operationsfs O). ,,t/C/CC$z1 % 3 ,|;  K        =  =!%!            !#  rAc|j}d}t}i}i}i}d}t|jD]} g|| <d|| <d|| < d} t} t|jD]} || } | t || k\rd} || | ~|| | } | J| \}}}||||||s>|| j || | || j |||f|| xxdz cc<|| j d|| xxdz cc<|| xxdz cc<|| j d|j| | rn|dkDrtjd|||S)Nc|tjk(r|dk7r |dz ||f|vryy|tjk(r'||dz k(r|tj|f|vS|dz||f|vSy)NrrTF)r$r9r<)rr microbatchnum_stages_globalseen_opss r? need_bubblezJScheduleInterleavedZeroBubble._add_bubbles_to_actions..need_bubbles%---A:519b*"=X"M  '555-11!#3#;#;ZHPXXX 2z2(BBrArTFrz?Non zero bubbles added: total_bubbles_added=%s bubbles_added=%s) r_r;rurir]rr<updaterr)r=r!rer#r"result next_pointer bubbles_addedtotal_bubbles_addedr should_stop temp_seen_ops timestamp temp_actionrMrr s r?rz5ScheduleInterleavedZeroBubble._add_bubbles_to_actionss%%  4 $Do)=$>? 4 $E$sCx.%**D$EF4 4 l> hw>O9P> @@rAr!ceZdZdZ d deededeedee e dfdee e e fdee e e efe efd effd Zd eeefd ZxZS)r"a The Zero Bubble schedule (ZBV variant). See https://arxiv.org/pdf/2401.10241 Section 6 for details. This schedules requires exactly two stages per rank. This schedule will perform one forward and one backward on inputs for the microbatches in steady state and supports multiple stages per rank. Uses backward with respect to weights to fill in the pipeline bubble. This ZB-V schedule would have the "zero bubble" property only if time forward == time backward input == time backward weights. In practice, this is not likely true for real models so alternatively a greedy scheduler could be implemented for unequal/unbalanced time. rrrr.rrrc .|dj|_t | |||||||t |j|j d|_|jD]}|j |_t||_ |jdk7rtd|jd|dj|_ |dj|_ i|_t|jD]"} |j!| } | |j| <$y)Nrrv)styler%z0ZBV requires exactly 2 stages per rank, but got r)r}rirrrrrr|r]rrr~rrr_rurrs r?rzScheduleZBVZeroBubble.__init__s/$AY11 )+//#  *H    0 0* &\\ ME.2.L.LE + M"&k   ! #B&&'q*  1I((  ).. CE$,,- 1D==dCH(0D   % 1rAractd|jzdz |j}t|Dcgc]}d}}d\}}}}d|j|z zdz } |} |jdz |z } t| D](}|j t | t||dz }*|} t| D]N}|j t | t||dz }|j t | t||dz }P|j|z } t| D]o}|j t | t||dz }|j t | t||j t | t||dz }q||ks||kr||kr&|j t | t||dz }|j t | t||j t | t||dz }|j t | t||dz }|j t | t||j t | t||dz }||kr||kr||}}|}t|D]N}|j t | t||dz }|j t | t||dz }P|j|z }t|D]N}|j t | t||dz }|j t | t||dz }P||kr,|j t | t||dz }||kr,||kr,|j t | t||dz }||kr,||k(r||k(sJ||k(r||k(sJ|Dcgc]-}|'|j|j|jkr|nd/}}|Scc}wcc}w)Nr%r)rrrr)rNrO) rvrirrurrrLr/r0r1rO)r=rn_micror/rf0_cntf1_cntb0_cntb1_cnt warmup_n1stage_id_chunk0stage_id_chunk1 warmup_n2 warmup_n3w0_cntw1_cnt cooldown_n1 cooldown_n2rDs r?rz7ScheduleZBVZeroBubble._calculate_single_rank_operations% s[a$,,,q0$2F2FG;@;,GaT,G,G*4&++d23a7 //A-4y! A OO!fU  aKF    y! A OO!fU  aKF OO!fU  aKF &&- y! A OO!fU  aKF OO!fU  OO!fU  aKF vo'!1'!f !  OO!fU  OO!fU  aKF OO!fU  aKF OO!fU  OO!fU  aKF5vo'!18  {# A OO!fU  aKF OO!fU  aKF ((4/ {# A OO!fU  aKF OO!fU  aKF vo OO!fU  aKF vo vo OO!fU  aKF vo Ff$444Ff$444#   %++7++d.B.BB     a-HL  s P2P rrr s@r?r"r"s &'+AEBFIM *1'(*1*1(# *1 "%(<"=> *1 $Do)=$>? *1$E$sCx.%**D$EF*1*1Xthw>O9PtrAr" schedule_namec Btttttt t td}|jDcic]}|j|}}|j}||vr(td|dt|j|||Scc}w)z Maps a schedule name (case insensitive) to its corresponding class object. Args: schedule_name (str): The name of the schedule. )1F1BInterleaved1F1BGPipe LoopedBFSInterleavedZeroBubblerr ZBVZeroBubblezUnknown schedule name 'z'. The valid options are ) rrrr r!rrr"rlowerrr{)r@ schedule_mapklowercase_keyslowercase_schedule_names r?rr s2&!>"8!6. L-9,=,=,?@qaggil@N@+113n4%m_4MdS_SdSdSfNgMh i   '>? @@ AsBc * t|Dcic]}|||Dcgc]}|| c}}}}t|Dcic]}|gc} Dcic] }|tc} dtdttf fd }dttdt f fd }|r_d}t|D]O}t ||dk(r||d}||r"| |||||jdd }G||dQt|d D]} t || dk(s|| =t|D]`}t ||dk(r |d ||d}||s/|| |d < |j|||jdbt|d D]} t || dk(s|| =|s>td t |D]}td |d||dtd|r_ Scc}wcc}}wcc}wcc}w)aThis function dry-run simulates the actions in the schedule from the perspective of all ranks, and flags any deadlocks caused by missing or misordered communications. It also simulates any bubbles in time where a rank can not execute any action due to waiting for unmet dependencies. The total number of simulator steps can be used as a metric for unit tests involving IR optimization passes as reordering and merging of IR can reduce the number of simulated steps. The simulation is not high-fidelity and does not model overlapping of compute and communication, or cuda streams. Future work may be to enhance this and model the compute time, comms overlap, and even memory. NrrDc\|j|||j|yyrQ)rr<)rrD_prev_ops_rank _schedules r?add_to_schedulez0_simulate_comms_compute..add_to_schedule s3$v&   4 $ $V , rArac|y|j} |}|jtk(rd|jdk(ryt|jt|j |vryt|jdz t|j |vryy|jt tfvr|j dz k(ryt|jt|j |vryt|jdzt |j |vryt|jdzt|j |vryy|jtk(ry|jtk(r)t|jt|j }||vS|jtk(r-|dz }t|t|j }| |vS|jtk(rTt|jt |j }t|jt|j }||vxs||vS|jtk(r-|dz}t|t|j }| |vStd|)NTrrFzUnsupported action type ) rMrNr/rLr5rOr:r<r7r;r4r6r) rDr[prev_ops expected_fpeer_stage_idx expected_send expected_b expected_bwrOrrVs r?rdz3_simulate_comms_compute.._ready_to_schedule sd >&& !- ":;  " "a '!!Q&**FF4K4KLPXX**Q.63J3JKxW  $ $(G G!!Z!^3v))663J3JKxW**Q.@W@WX**Q. v?V?VW  $ $ 7  $ $ . !3!3Q8O8OPJ) )  $ $ .&]N#NFF*  ..@Q!-q@@N $N32b2IHQ.QttSU{.QN-c-8G+<- 8B8G#48B8Bt >* ,D>$'(A-#D)!,F!&)%#D&1t$((+d+ ,5 &A>!$%*"1% & >* ,D>$'(A-r".#D)!,F!&)%*0IdOB'"4(,,V4t$((+ ,5 &A>!$%*"1% & )+A)+L M& I~nT.B1.E-FGH I:; ;W Z kA2/Rs& HHHH H HHc Ng}t|D]\}t||D]I\}}| |jt||jt t tfvrdndd|||ddK^ddl}t|d5}|jd |i|dddy#1swYyxYw) a This function dumps a schedule IR into a chrometrace format so it can be visualized. It is currently very basic and only serves as a graphical alternative to dumping the schedule IR as text. As future work we may extend this to include more accurate heuristics for durations, or let users input durations, add 'flow events' to let the UI show the connection between sends and recvs, and model cuda streams for comm/compute as separate streams on the chrometrace view. N computation communicationXr)rcatphpidtidtsdurrr traceEvents) ryrrrRrNr/r8r1jsonrdump)schedulereventsrtimesteprDrefs r?_dump_chrometracerk; sFx  )(4. 9  Hf~ MMK"22q!Qi?&,"   & h . =&)1-...s =BB$rQ)r&)rF)[rsrr|loggingreabcrr collectionsrrenumrtypingrr r r r r rtorch.distributed distributedr torch._dynamortorch.distributed.fsdprrtorch.nn.modules.lossrtorch.profilerr_utilsrr rrrrrr__all__ getLoggerrFrr$r9r:r;r2r3r4r5r6r7r<r/r0r1r8compilerYrLrr\r{rRrrP2POprrrr rrrQrUrhrvrrr rrr!r"rrrkrJrAr?r}s  #,LL )<'*2TT%&    8 $3Et3El  " "!00"22  " "  " "         ..   F  j  J(,;d8G#4556;}; ;|s s l1TZZ(1 16: $** %-c] #tyy.6P.Pf010fX*XvW1)W1xC(7+,CC ']CL (7+,  '] Ff#tG},-fSE3J'ff #tG}  fRI' #tHW-.. /I'I'I' I'  #s(^ I'XP2-P2f C24C2L =-=RFRq 3q hA$9AHp1pfAcA4B#+SE3J#7BEHBJ!.rA