§
    ŠŠtjgI ã                  óø  — d dl mZ d dlZd dlZd dlZd dlZd dlZd dlmZ d dl	m
Z
 d dlmZmZ d dlZd dlmZ d dlmZ dd	lmZmZmZ dd
lmZ erddlmZmZ ddlmZmZmZmZ ddl m!Z!m"Z"m#Z#m$Z$ ddl%m&Z&  ej'        e(¦  «        Z)ej*         +                    e(d¦  «        Z,erd dl-m.Z. d‚d„Z/dƒd„Z0dƒd„Z1dƒd„Z2dƒd„Z3e
 G d„ d¦  «        ¦   «         Z4d„d„Z5d…d!„Z6d†d"„Z7d‡dˆd%„Z8d&„ Z9d‰d(„Z:d)„ Z;dŠd+„Z<d‹d/„Z=dŒd1„Z>d2„ Z?d3„ Z@d4„ ZAd�d:„ZBdŽd@„ZCd�dD„ZDd�dF„ZEd‘dJ„ZFd’dS„ZGd“dX„ZHd”d[„ZId•d]„ZJd–de„ZKd—dg„ZLd˜dk„ZMd™dm„ZNe
 G dn„ do¦  «        ¦   «         ZOd•dp„ZPdšds„ZQd›du„ZRd‘dv„ZSdœdx„ZTd”dy„ZUd�d{„ZVdƒd|„ZWdžd~„ZXd„ ZYd€„ ZZdƒd�„Z[dS )Ÿé    )ÚannotationsN)Údefaultdict)Ú	dataclass)ÚAnyÚTYPE_CHECKING)Útrace_structured)Ú
OrderedSeté   )ÚconfigÚconfig_commsÚir)ÚWeakDep)ÚIRNodeÚ	Operation)Úestimate_peak_memory_allocfreeÚFreeableInputBufferÚget_freeable_input_bufÚSNodeMemory)Úcontains_collectiveÚcontains_waitÚis_fallback_opÚis_wait)ÚVÚoverlap)ÚBaseSchedulerNodeÚsnodesúlist[BaseSchedulerNode]c                ó~  — d„ | D ¦   «         }dd l m} ddlm} |                     ¦   «         } |¦   «         }d„ t          |¦  «        D ¦   «         }|                     |||¦  «         t          d„ |D ¦   «         ¦  «        }t          |¦  «        dk    rIt           
                    dd„ |D ¦   «         ¦  «         t          | ¦  «        D ]\  }}	||         |	_        Œd S t          j        t          j        |¦  «        d¬	¦  «        j                             ¦   «         }
t          | ¦  «        D ]\  }}	|
|         |	_        Œd S )
Nc                ó6   — g | ]}|                      ¦   «         ‘ŒS © )Úget_estimated_runtime©Ú.0Úsnodes     úS/var/www/html/CA-Chatbot/venv/lib/python3.11/site-packages/torch/_inductor/comms.pyú
<listcomp>zJalign_runtime_estimations_across_all_distributed_ranks.<locals>.<listcomp>-   s$   € ÐMÐMÐM¸U˜5×6Ò6Ñ8Ô8ÐMÐMÐMó    r   )Ú_get_default_groupc                ó   — g | ]}g ‘ŒS r    r    )r#   Ú_s     r%   r&   zJalign_runtime_estimations_across_all_distributed_ranks.<locals>.<listcomp>4   s   € Ð6UÐ6UÐ6U¸a°rÐ6UÐ6UÐ6Ur'   c                ó,   — g | ]}t          |¦  «        ‘ŒS r    ©Úlen©r#   Úes     r%   r&   zJalign_runtime_estimations_across_all_distributed_ranks.<locals>.<listcomp>;   s   € ÐGÐGÐG Q�#˜a™&œ&ÐGÐGÐGr'   r
   zeDifferent ranks have different numbers of scheduler nodes (%s), skipping runtime estimation alignmentc                ó,   — g | ]}t          |¦  «        ‘ŒS r    r,   r.   s     r%   r&   zJalign_runtime_estimations_across_all_distributed_ranks.<locals>.<listcomp>@   s   € Ð:Ð:Ð:˜�S�‰VŒVÐ:Ð:Ð:r'   )Údim)Útorch.distributedÚdistributedÚ"torch.distributed.distributed_c10dr(   Úget_world_sizeÚrangeÚall_gather_objectr	   r-   ÚlogÚwarningÚ	enumerateÚoverride_estimated_runtimeÚtorchÚmedianÚtensorÚvaluesÚtolist)r   Úruntime_estimationsÚdistr(   Ú
world_sizeÚpgÚgathered_runtime_estimationsÚlengthsÚidxr$   Úmedian_runtime_estimationss              r%   Ú6align_runtime_estimations_across_all_distributed_ranksrI   *   s™  € ð NÐMÀfÐMÑMÔMÐà$Ð$Ð$Ð$Ð$Ð$ØEÐEÐEÐEÐEÐEà×$Ò$Ñ&Ô&€JØ	Ð	Ñ	Ô	€BØ6UÐ6UÅ5ÈÑCTÔCTÐ6UÑ6UÔ6UÐ Ø×ÒØ$ØØ
ñô ð õ ÐGÐGÐ*FÐGÑGÔGÑHÔH€GÝ
ˆ7�|„|�qÒÐÝ�Šð4à:Ð:Ð9Ð:Ñ:Ô:ñ	
ô 	
ð 	
õ
 $ FÑ+Ô+ð 	Hð 	H‰JˆC�Ø/BÀ3Ô/GˆEÔ,Ð,Øˆå!&¤ÝŒÐ1Ñ2Ô2¸ð"ñ "ô "ä�VŠV‰XŒXð õ   Ñ'Ô'ð Kð K‰
ˆˆUØ+EÀcÔ+JˆÔ(Ð(ðKð Kr'   Úreturnc                ó(   — t          | ddd¬¦  «        S )z7
    Greedily schedules waits as late as possible.
    FT©Úraise_commsÚ
sink_waitsÚreorder_for_overlap©Ú_schedule_for_comm©r   s    r%   rN   rN   N   s$   € õ Ø˜E¨dÈðñ ô ð r'   c                ó(   — t          | ddd¬¦  «        S )z8
    Greedily schedules comms as early as possible.
    TFrL   rP   rR   s    r%   rM   rM   W   s$   € õ Ø˜D¨UÈðñ ô ð r'   c                ó(   — t          | ddd¬¦  «        S )aÀ  
    This achieves the following overall scheduling procedure:
        Step 1: Given that we've currently scheduled comm N, we now schedule all compute nodes
            that are required for comm N + 1 but do not depend on comm N, to run at the same time with comm N.
        Step 2: If all those compute nodes are sufficient to overlap comm N, we're done.
            Otherwise, we now need to look elsewhere to find compute that overlaps with comm N.
            We prioritize compute nodes that are needed sooner.
        Step 3: We schedule the compute nodes dependent on comm N and required for comm N + 1.
        Step 4: We schedule comm N + 1.
        Repeat this for subsequent comm nodes.
    TrL   rP   rR   s    r%   Úreorder_compute_for_overlaprU   `   s$   € õ Ø˜D¨TÀtðñ ô ð r'   c                ó*   — t          | ¦  «        \  }}|S )a  
    Reorders communication ops relative to computation ops to improve communication-compute overlapping and hide comm
    latency.  Stops moving a particular op if it reaches a point that would have increased the peak memory footprint.

    Currently, follows these heuristics (subject to change or tune):
    - never reorders collectives relative to one another, for SPMD safety
    - has an option for per-collective prefetch limit, but does not enable it by default
    - limits the total number of reorder steps to some factor of the graph size to prevent worst-case quadratic
      performance

    Prerequisite: sink_comms_and_waits - ensure comm and wait nodes are scheduled as late as possible, respecting data
    dependencies.  That allows reorder_communication_preserving_peak_memory to take a best case peak-memory snapshot,
    and then monotonically improve latency by moving collectives backward in time.

    Peak memory impact is computed in an iterative fashion.  First, memory use at each timestep is computed, and global
    peak memory is computed as a max over timesteps.  Then, when swapping any two adjacent nodes, only the curr-memory
    for the earlier of the nodes after the swap is affected.  This enables checking step by step whether a swap is
    peak-memory-safe, and bailing out if not.  Example:

    0   n0      C0
    1   n1      C0 + Allocs(n1) - Frees(n1)
    2   n2      C0 + Allocs(n1) - Frees(n1) + Allocs(n2) - Frees(n2)

    0   n0      C0
    1   n2      C0 + Allocs(n2) - Frees(n2)    <-- After moving n2 to Time 1, only time1 memory changes
    2   n1      C0 + Allocs(n2) - Frees(n2) + Allocs(n1) - Frees(n1)

    )Ú6_reorder_communication_preserving_peak_memory_internal)r   Úreordered_snodesÚ
node_statss      r%   Ú,reorder_communication_preserving_peak_memoryrZ   s   s"   € õ@ 	?¸vÑFÔFñ !Ð�jð Ðr'   c                  ó¨   — e Zd ZU dZdZded<   dZded<   dZded<   d	Zded
<   dZ	ded<   dZ
ded<   dZded<   dZded<   dZded<   ed„ ¦   «         ZdS )ÚReorderInfozE
    Debug info describing how an individual snode was reordered
    ÚNoneÚstrÚlimiting_factorr   ÚintÚmovesÚgroupedÚ Úgrouped_infoç      ð¿ÚfloatÚ	comm_timeÚ	comp_timeÚinitial_exposedÚfinal_exposedÚoverlap_infoc                ó    — | j         | j        z
  S ©N©ri   rj   ©Úselfs    r%   ÚimprovementzReorderInfo.improvement©   ó   € àÔ# dÔ&8Ñ8Ð8r'   N)Ú__name__Ú
__module__Ú__qualname__Ú__doc__r_   Ú__annotations__ra   rb   rd   rg   rh   ri   rj   rk   Úpropertyrq   r    r'   r%   r\   r\   ™   sÐ   € € € € € € ðð ð "€OÐ!Ð!Ð!Ñ!Ø€E€N€N€N�NØ€GÐÐÐÑØ€LÐÐÐÑØ€IÐÐÐÑØ€IÐÐÐÑØ!€OÐ!Ð!Ð!Ñ!Ø€MÐÐÐÑØ€LÐÐÐÑàð9ð 9ñ „Xð9ð 9ð 9r'   r\   ÚnodeúIRNode | Operation | NoneÚboolc                ó–   — | €dS t          | t          j        j        j        j        ¦  «        rdS t          | dd ¦  «        x}rd|v rdS dS )NFTÚpython_kernel_nameÚextern_kernels)r   r<   ÚopsÚatenÚ#_scaled_dot_product_flash_attentionÚdefaultÚgetattr)ry   r}   s     r%   Úis_gemm_liker„   ®   sh   € Ø€|ØˆuåØÝŒ	ŒÔ:ÔBñô ð ð ˆtõ & dÐ,@À$ÑGÔGÐGÐðà
Ð0Ð
0Ð
0ØˆtØˆ5r'   r$   r   c                ó’   — ddl m} t          | |¦  «        rt          d„ | j        D ¦   «         ¦  «        S t          | j        ¦  «        S )Nr   ©ÚGroupedSchedulerNodec              3  ó4   K  — | ]}t          |¦  «        V — Œd S rm   )Úcontains_gemm_like©r#   Úxs     r%   ú	<genexpr>z%contains_gemm_like.<locals>.<genexpr>Ã   s+   è è € Ð?Ð?¨QÕ% aÑ(Ô(Ð?Ð?Ð?Ð?Ð?Ð?r'   )Útorch._inductor.schedulerr‡   Ú
isinstanceÚanyr   r„   ry   )r$   r‡   s     r%   r‰   r‰   ¿   sV   € Ø>Ð>Ð>Ð>Ð>Ð>å�%Ð-Ñ.Ô.ð (ÝÐ?Ð?°%´,Ð?Ñ?Ô?Ñ?Ô?Ð?å˜EœJÑ'Ô'Ð'r'   c                ó„   — ddl m} t          | |¦  «        r| j        r| j        D ]} ||¦  «         Œd S  || ¦  «         d S )Nr   r†   )r�   r‡   rŽ   Útemp_groupingr   )r$   Úfnr‡   Ú_snodes       r%   Ú_temp_group_visit_leavesr”   È   sn   € Ø>Ð>Ð>Ð>Ð>Ð>å�%Ð-Ñ.Ô.ð °5Ô3Fð Ø”lð 	ð 	ˆFØˆBˆv‰JŒJˆJˆJð	ð 	ð 	ˆˆ5‰	Œ	ˆ	ˆ	ˆ	r'   Fr^   c                ó¨   — d}| j         D ]G}|r|dz  }||                     ¦   «         z  }|r%|t          |                      ¦   «         ¦  «        › z  }ŒH|S )Nrc   r*   )r   Úget_nameÚlistÚget_buffer_names)r$   Ú	with_bufsÚretÚns       r%   Ú_group_namerœ   Ò   sj   € Ø
€CØŒ\ð 7ð 7ˆØð 	Ø�3‰JˆCØˆq�zŠz‰|Œ|ÑˆØð 	7Ø•d˜5×1Ò1Ñ3Ô3Ñ4Ô4Ð6Ñ6ˆCøØ€Jr'   c                ó:   — t          | t          ¦  «        o| j        S rm   )rŽ   r   Úis_fake)Úds    r%   Ú_is_fake_depr    Ý   s   € Ý�a�Ñ!Ô!Ð/ a¤iÐ/r'   Úgnsc                ó@   — d                      d„ | D ¦   «         ¦  «        S )Nú~c                ó6   — g | ]}|                      ¦   «         ‘ŒS r    ©r–   )r#   Úgns     r%   r&   z _group_names.<locals>.<listcomp>â   s    € Ð1Ð1Ð1 r�R—[’[‘]”]Ð1Ð1Ð1r'   )Újoin)r¡   s    r%   Ú_group_namesr¨   á   s#   € Ø�8Š8Ð1Ð1¨SÐ1Ñ1Ô1Ñ2Ô2Ð2r'   c                óÀ   — t          | |¦  «        }t          | ||¦  «        \  }}}}t          t          | |¦  «        ¦  «        }d|d<   t	          |¦  «        }	||||||	fS )z*Initialize memory tracking data structures)r   r   N)r   r   ÚdictÚzipÚ_build_candidate_buffer_map)
r   Úgraph_inputsÚgraph_outputsÚname_to_freeable_input_bufÚpeak_memoryÚsnodes_curr_memoryÚsnodes_allocfreeÚbuf_to_snode_last_useÚ_curr_memoryÚcandidate_buffer_maps
             r%   Ú_initialize_memory_trackingr¶   å   s‹   € å!7¸ÀÑ!MÔ!MÐå&ØÐ.°ñ	
ô 	
ñ M€KÐ#Ð%5Ð7Lõ
 �˜FÐ$6Ñ7Ô7Ñ8Ô8€Là€L�Ñõ 7Ð7LÑMÔMÐð 	ØØØØ"Øðð r'   ú~tuple[dict[BaseSchedulerNode, BaseSchedulerNode | None], dict[BaseSchedulerNode, BaseSchedulerNode | None], BaseSchedulerNode]c                óÆ   — i }i }t          | ¦  «        D ]A\  }}|dk    r| |dz
           nd||<   |t          | ¦  «        dz
  k     r| |dz            nd||<   ŒB| d         }|||fS )z/Create double-linked list structure from snodesr   r
   N)r:   r-   )r   Ú_prevÚ_nextÚir$   Ú_heads         r%   Ú_initialize_double_linked_listr½   þ   s‰   € ð €EØ€EÝ˜fÑ%Ô%ð Fð F‰ˆˆ5Ø()¨Aª¨�v˜a !™e”}�}°4ˆˆe‰Ø()­C°©K¬K¸!©OÒ(;Ð(;�v˜a !™e”}�}Àˆˆe‰ˆØ�1ŒI€EØ�%˜ÐÐr'   r³   rª   ú#dict[BaseSchedulerNode, OrderedSet]c                ó¦   — t          t          ¦  «        }| D ],}|j        j        D ]}||                              |¦  «         ŒŒ-t          |¦  «        S )a}  
    Build inverted index: node -> set of buffers where node appears in successors.

    This optimization reduces buffer iteration from O(total_buffers) to O(buffers_per_node).
    Since buffer successors are immutable during reordering, this map doesn't need updates.

    Returns:
        dict mapping each node to the set of buffers that have this node in their successors
    )r   r	   Ú
mpi_bufferÚ
succ_nodesÚaddrª   )r³   Únode_to_candidate_bufsÚbufÚ	succ_nodes       r%   r¬   r¬     sr   € õ CNÝñCô CÐð %ð 7ð 7ˆàœÔ2ð 	7ð 	7ˆIØ" 9Ô-×1Ò1°#Ñ6Ô6Ð6Ð6ð	7õ Ð&Ñ'Ô'Ð'r'   ú(dict[BaseSchedulerNode, OrderedSet[str]]c                ó   — d„ | D ¦   «         S )zê
    Pre-compute output name sets for all nodes.

    This optimization avoids creating OrderedSet objects repeatedly during
    exposed time calculations.

    Returns:
        dict mapping each node to a set of its output names
    c                óf   — i | ].}|t          d „ |                     ¦   «         D ¦   «         ¦  «        “Œ/S )c              3  ó>   K  — | ]}|                      ¦   «         V — Œd S rm   r¥   ©r#   Úos     r%   rŒ   z:_precompute_node_output_sets.<locals>.<dictcomp>.<genexpr>4  s*   è è € ÐDÐD¨1˜!Ÿ*š*™,œ,ÐDÐDÐDÐDÐDÐDr'   )r	   Úget_outputsr"   s     r%   ú
<dictcomp>z0_precompute_node_output_sets.<locals>.<dictcomp>3  sJ   € ð ð ð ØINˆ�zÐDÐD°×0AÒ0AÑ0CÔ0CÐDÑDÔDÑDÔDðð ð r'   r    rR   s    r%   Ú_precompute_node_output_setsrÎ   '  s#   € ðð ØRXðñ ô ð r'   c                óP   — t          | ¦  «        rt          j        S t          j        S rm   )r   r   Ú*reorder_sink_runtime_estimations_comm_multÚ.reorder_sink_runtime_estimations_non_comm_mult©r$   s    r%   Ú_op_runtime_estimate_multrÓ   8  s'   € õ ˜5Ñ!Ô!ð GÝÔFÐFåÔFÐFr'   c                óB   — t          | j        dd¦  «        x}rd|v rdS dS )zÎ
    Filtering out ops that contain Collective and Wait inside and considered as Collectives.
    See contains_collective function.
    If the op contains Wait inside - consider as Synchronous compute.
    r}   Nz-torch.ops._dtensor.shard_dim_alltoall.defaultFT)rƒ   ry   )r$   r}   s     r%   Úis_async_collectiverÕ   A  s7   € õ % U¤ZÐ1EÀtÑLÔLÐLÐð Ø:Ð>PÐPÐPØ�5àˆ4r'   c                ó,   — t          | t          ¦  «        S rm   )r   rÕ   rÒ   s    r%   Úcontains_async_collectiver×   N  s   € Ý˜uÕ&9Ñ:Ô:Ð:r'   ÚheadúBaseSchedulerNode | NoneÚtailÚ	next_dictú1dict[BaseSchedulerNode, BaseSchedulerNode | None]c                ó^   — g }| }	 |�|                      |¦  «         ||k    rn	||         }Œ'|S )aA  
    Traverse doubly-linked list from head to tail and return nodes as a list.

    Args:
        head: Starting node of the segment
        tail: Ending node of the segment (inclusive)
        next_dict: Dictionary mapping each node to its next node

    Returns:
        List of nodes from head to tail (inclusive)
    )Úappend)rØ   rÚ   rÛ   rš   r›   s        r%   Ú_group_nodes_from_linked_listrß   R  sH   € ð  €CØ€AðØˆ=Ø�JŠJ�q‰MŒMˆMØ�Š9ˆ9ØØ�aŒLˆðð €Jr'   Úcollective_snodeÚ
wait_snodeÚnode_output_setsú'dict[BaseSchedulerNode, frozenset[str]]Únode_dep_setsc                óF   — ||          }||         }t          ||z  ¦  «        S )zr
    Check if a wait node corresponds to a given collective node.
    Uses pre-computed sets for O(1) lookup.
    )r{   )rà   rá   râ   rä   Úcollective_outsÚ
unmet_depss         r%   Ú!_is_corresponding_collective_waitrè   m  s,   € ð 'Ð'7Ô8€OØ˜zÔ*€JÝ�
˜_Ñ,Ñ-Ô-Ð-r'   Úruntimesúdict[BaseSchedulerNode, float]útuple[float, float, str]c                ó  ‡‡— ‰|          }dŠ||          }d}g }||          }	|	�Û||	         }
|
|z  r|d|	                      ¦   «         › d�z  }n²t          |	¦  «        r.t          |	¦  «        sn“|                     |	¦  «         ||	         }	Œht	          |	¦  «        r d}|D ]}t          | |	||¦  «        rd} nŒ|rnF‰}dˆˆfd„}t          |	|¦  «         ‰}|d|	                      ¦   «         › d||z
  › d�z  }||	         }	|	­Û|‰|fS )zÛ
    Calculate exposed communication time by iterating directly over linked list.
    Avoids O(N) list construction for each call.

    The collective_snode is the starting point, iteration continues via next_dict.
    ç        rc   Nz->W[ú]FTr“   r   rJ   r]   c                ó   •— ‰‰|          z  Šd S rm   r    ©r“   rh   ré   s    €€r%   Úaccumulate_timez9_coll_exposed_communication_time.<locals>.accumulate_time«  ó   ø€ à˜ &Ô)Ñ)ˆIˆIˆIr'   ú+ú[©r“   r   rJ   r]   )r–   r   r×   rÞ   r   rè   r”   )rà   rÛ   ré   râ   rä   rg   ræ   rk   Úcollectives_foundr$   rç   Úhas_wait_for_collectives_foundÚ_collÚcomp_time_beforerñ   Úcomp_time_afterrh   s     `             @r%   Ú _coll_exposed_communication_timerû   |  s¬  øø€ ð Ð)Ô*€IØ€IØ&Ð'7Ô8€OØ€LØ13ÐàÐ&Ô'€EØ
Ð
Ø" 5Ô)ˆ
à˜Ñ'ð 	ØÐ6 5§>¢>Ñ#3Ô#3Ð6Ð6Ð6Ñ6ˆLØå˜uÑ%Ô%ð 	Ý,¨UÑ3Ô3ð Øà!×(Ò(¨Ñ/Ô/Ð/Ø! %Ô(�ØÝ˜ÑÔð 		Ø-2Ð*Ø*ð ð �Ý4Ø$ eÐ-=¸}ñô ð ð 6:Ð2Ø�Eð	ð
 .ð Øà$Ðð	*ð 	*ð 	*ð 	*ð 	*ð 	*ð 	*õ 	! ¨Ñ8Ô8Ð8Ø#ˆØÐT˜EŸNšNÑ,Ô,ÐTÐT¨ÐAQÑ/QÐTÐTÐTÑTˆà˜%Ô ˆðG Ð
ðJ �i Ð-Ð-r'   Ú	prev_dictc                ó  ‡‡— d}dŠd}g }||          }	|	�ít          |	¦  «        r|                     |	¦  «         t          |	¦  «        rtt          |	| ||¦  «        r$‰|	         }|d|	                     ¦   «         › d�z  }n„t          |	¦  «        sdŠ||	         }	Œ…|D ]}
t          |	|
||¦  «        rdŠ nŒ||	         }	Œ©‰}dˆˆfd
„}t          |	|¦  «         ‰}|d|	                     ¦   «         › d||z
  › d�z  }||	         }	|	­í|‰|fS )zò
    Calculate exposed communication time for a wait operation by iterating
    directly over linked list backwards. Avoids O(N) list construction.

    Iterates from wait_snode backwards using prev_dict to find corresponding collective.
    rí   rc   Nz->C[rî   r“   r   rJ   r]   c                ó   •— ‰‰|          z  Šd S rm   r    rð   s    €€r%   rñ   z9_wait_exposed_communication_time.<locals>.accumulate_timeç  rò   r'   ró   rô   rõ   )r   rÞ   r   rè   r–   r×   r”   )rá   rØ   rü   ré   râ   rä   rg   rk   Úwaits_foundr$   Úwrù   rñ   rú   rh   s      `          @r%   Ú _wait_exposed_communication_timer  ¸  s¦  øø€ ð €IØ€IØ€LØ+-€Kà�jÔ!€EØ
Ð
Ý˜ÑÔð 	&Ø×Ò˜uÑ%Ô%Ð%Ý˜uÑ%Ô%ð 	Ý0Ø�zÐ#3°]ñô ð ð % UœO�	ØÐ : u§~¢~Ñ'7Ô'7Ð :Ð :Ð :Ñ:�Øå,¨UÑ3Ô3ð Ø�	Ø! %Ô(�Øà$ð ð �AÝ8Ø˜qÐ"2°Mñô ð ð %(˜	Ø˜ð	ð
 " %Ô(�Øà$Ðð	*ð 	*ð 	*ð 	*ð 	*ð 	*ð 	*õ 	! ¨Ñ8Ô8Ð8Ø#ˆØÐT˜EŸNšNÑ,Ô,ÐTÐT¨ÐAQÑ/QÐTÐTÐTÑTˆà˜%Ô ˆðG Ð
ðJ �i Ð-Ð-r'   Ú	candidateÚ
group_headÚ
group_tailc                óz   — ||          }|r|||<   |||<   ||         }|r| ||<   ||| <   ||| <   | ||<   || k    r|S |S )a�  
    Swap positions of candidate and group in doubly-linked list.

    Transforms:
    candidate_prev -> candidate -> group_head...group_tail -> group_tail_next
    Into:
    candidate_prev -> group_head...group_tail -> candidate -> group_tail_next

    Args:
        candidate: Node to swap with group
        group_head: First node of group
        group_tail: Last node of group
        prev_dict: Dictionary mapping nodes to their previous nodes
        next_dict: Dictionary mapping nodes to their next nodes
        head: Current head of the linked list

    Returns:
        New head of the linked list (may change if candidate was the head)
    r    )r  r  r  rü   rÛ   rØ   Úcandidate_prevÚgroup_tail_nexts           r%   Ú _perform_double_linked_list_swapr  ô  s€   € ð8 ˜yÔ)€NØð /Ø$.ˆ	�.Ñ!Ø*€IˆjÑð   
Ô+€OØð /Ø%.ˆ	�/Ñ"Ø*€IˆiÑð &€IˆiÑØ%€IˆjÑð ˆyÒÐØÐØ€Kr'   Úgroup_peak_memoryr`   Úcandidate_delta_memÚcandidate_allocfreer   Ú/group_n_to_bufs_after_swap_dealloc_by_candidateÚcurr_memoryú(tuple[int, dict[BaseSchedulerNode, int]]c                ó€  — i }d}	|s.t          ||z
  ||         d         |z
  |j        z   ¦  «        }	|	|fS | }
|D ]S}||         d         |
z   }|||<   t          |	|¦  «        }	|                     |¦  «        }|�|D ]}|
|j        j        z  }
ŒŒT||         d         |
z   |j        z   }||| <   t          |	|¦  «        }	|	|fS )a  
    Calculate potential peak memory after swapping candidate with group (reorder version).

    Computes new memory levels for all affected nodes and returns the potential
    peak memory along with cached post-allocation memory values for each node.

    Args:
        candidate: Node being moved
        gns: Group nodes
        group_tail: Last node of group
        group_peak_memory: Current peak memory within the group
        candidate_delta_mem: Net memory change from candidate (alloc - free)
        candidate_allocfree: Candidate's allocation/free info
        group_n_to_bufs_after_swap_dealloc_by_candidate: Buffers whose deallocation moves to candidate
        curr_memory: Current memory state dict

    Returns:
        Tuple of (potential_peak_memory, post_alloc_update_dict)
    r   r
   )ÚmaxÚ
size_allocÚgetrÀ   Ú	size_free)r  r¡   r  r	  r
  r  r  r  Ú_post_alloc_updateÚpotential_peakÚmem_after_reorder_deltar¦   Úgn_post_alloc_memÚbufsrÄ   Úcandidate_mem_post_allocs                   r%   Ú(_calculate_potential_peak_memory_reorderr  %  s7  € ð> 8:ÐØ€NØ:ð 2åØÐ 3Ñ3Ø˜
Ô# AÔ&Ø!ñ"à!Ô,ñ-ñ
ô 
ˆð Ð1Ð1Ð1ð %8Ð#7ÐØð 	Dð 	DˆØ'¨œO¨AÔ.Ð1HÑHÐØ!2Ð˜2ÑÝ˜^Ð->Ñ?Ô?ˆà>×BÒBÀ2ÑFÔFˆØÐØð Dð D�à'¨3¬>Ô+CÑCÐ'Ð'øð 	�JÔ Ô"Ø
!ñ	"à
Ô
(ñ	)ð ð
 %=Ð�yÑ!Ý˜Ð)AÑBÔB€NØÐ-Ð-Ð-r'   Úpost_alloc_updateúdict[BaseSchedulerNode, int]r²   r]   c
                ó  — |sO|D ]#}
||
         }|d         |z
  |d         |z
  f||
<   Œ$||         d         |j         z   }||j        z
  }||f|| <   dS |                     ¦   «         D ]}|D ]}| ||<   ŒŒd}|D ][}||         }t          d„ ||         D ¦   «         ¦  «        }||z  }|	|         xj        |z  c_        ||	|         j        z
  }||f||<   Œ\||          }|	|          xj        |z  c_        ||	|          j        z
  }||f|| <   dS )aN  
    Update memory tracking structures after swap (reorder version).

    Updates curr_memory, buf_to_snode_last_use, and snodes_allocfree dictionaries
    to reflect the new memory state after swapping candidate with group.

    Args:
        candidate: Node that was moved
        gns: Group nodes
        group_tail: Last node of group
        candidate_delta_mem: Net memory change from candidate (alloc - free)
        candidate_allocfree: Candidate's allocation/free info
        group_n_to_bufs_after_swap_dealloc_by_candidate: Buffers whose deallocation moves to candidate
        post_alloc_update: Cached post-allocation memory values
        curr_memory: Current memory state dict (mutated)
        buf_to_snode_last_use: Buffer to last-use node mapping (mutated)
        snodes_allocfree: Node allocation/free info dict (mutated)
    r   r
   Nc              3  ó.   K  — | ]}|j         j        V — Œd S rm   ©rÀ   r  ©r#   rÄ   s     r%   rŒ   z=_update_memory_tracking_after_swap_reorder.<locals>.<genexpr>¡  s;   è è € ð 2
ð 2
àð ŒNÔ$ð2
ð 2
ð 2
ð 2
ð 2
ð 2
r'   )r  r  r?   Úsum)r  r¡   r  r
  r  r  r  r  r³   r²   r¦   ÚcmÚ_candidate_post_alloc_memÚ_candidate_post_free_memr  rÄ   Ú"size_free_to_move_to_candidate_sumr›   Ú_gn_post_alloc_memÚsize_free_to_move_to_candidateÚgn_post_free_memÚcandidate_post_free_mems                         r%   Ú*_update_memory_tracking_after_swap_reorderr*  h  sÍ  € ð< ;ð Øð 	ð 	ˆBØ˜R”ˆBà�1”Ð+Ñ+Ø�1”Ð+Ñ+ðˆK˜‰OˆOð
 ˜
Ô# AÔ&Ð)<Ô)GÑGð 	"ð &Ð(;Ô(EÑEð 	!ð &Ø$ð"
ˆ�IÑð 	ˆð @×FÒFÑHÔHð 3ð 3ˆØð 	3ð 	3ˆCØ)2Ð! #Ñ&Ð&ð	3ð /0Ð&Øð 
@ð 
@ˆØ"3°AÔ"6ÐÝ.1ð 2
ð 2
àFÀqÔIð2
ñ 2
ô 2
ñ /
ô /
Ð&ð 	+Ð.LÑLÐ*à˜ÔÐ%Ô%Ð)GÑGÐ%Ô%Ø 2Ð5EÀaÔ5HÔ5RÑ RÐØ,Ð.>Ð?ˆ�A‰ˆØ 1°)Ô <ÐØ�YÔÐ)Ô)Ð-OÑOÐ)Ô)à!Ð$4°YÔ$?Ô$IÑIð ð 	"Øð€K�	ÑÐÐr'   rµ   ú8dict[BaseSchedulerNode, list[FreeableInputBuffer | Any]]c                óè   — t          t          ¦  «        }|                     | t          ¦   «         ¦  «        }t          |¦  «        }|D ])}||         }||v r||                              |¦  «         Œ*|S )aŽ  
    Find buffers whose last use will change after swapping candidate with group.

    When we swap [candidate [group]] to [[group] candidate], some buffers that
    were last used by a group node will now be last used by candidate instead.
    This affects memory deallocation timing.

    Args:
        candidate: The node being moved
        gns: Group nodes being swapped with candidate
        buf_to_snode_last_use: Mapping of buffers to their current last-use nodes
        candidate_buffer_map: Pre-computed map of node -> buffers using that node

    Returns:
        Dict mapping group nodes to buffers that will change their last-use node
    )r   r—   r  r	   rÞ   )	r  r¡   r³   rµ   r  Úcandidate_bufsÚgns_setrÄ   Úsnode_last_uses	            r%   Ú#_find_buffers_with_changed_last_user0  µ  s�   € õ0 	•DÑÔð 4ð *×-Ò-¨i½¹¼ÑFÔF€NÝ˜‰oŒo€Gàð Xð XˆØ.¨sÔ3ˆØ˜WÐ$Ð$Ø;¸NÔK×RÒRÐSVÑWÔWÐWøà:Ð:r'   útuple[bool, str | None]c                ó¨   — t           j        s(t          | ¦  «        rdd|                      ¦   «         › �fS t           j        st          | ¦  «        rdS dS )aa  
    Check if a candidate node can be grouped with collective during reordering.

    This pass processes collectives left to right, so we avoid grouping with
    already-processed collectives based on configuration.

    Args:
        candidate: Node to check for groupability

    Returns:
        Tuple of (is_groupable, reason_if_not_groupable)
    Fzcandidate contains_collective )Fr‰   ©TN)r   Ú(reorder_iterative_group_with_collectivesr×   r–   Ú)reorder_iterative_use_runtime_estimationsr‰   ©r  s    r%   Ú_is_node_groupable_for_reorderr7  Ü  sk   € õ$ Ô@ð Ý$ YÑ/Ô/ð 	àØG°×1CÒ1CÑ1EÔ1EÐGÐGðð õ ÔAð /Ý˜iÑ(Ô(ð 	/Ø.Ð.Øˆ:r'   Ústatsú$dict[BaseSchedulerNode, ReorderInfo]Úoriginal_snodes_numr°   r¯   r®   úOrderedSet[str]c                óÜ  ‡‡‡— | Šˆfd„‰D ¦   «         Št          ˆfd„‰D ¦   «         ¦  «        }t          ˆfd„‰D ¦   «         ¦  «        }d|› d|› d�Šg d¢}	d„ ‰                     ¦   «         D ¦   «         }
t          j                             d	¦  «        rd
dlm} ‰ ||
|	¬¦  «        z  ŠnE‰dz  Š‰t          |	¦  «        dz   z  Š‰d                     t          t          |
¦  «        ¦  «        z  Št          |d|¦  «        }t          |¦  «        |k    sJ ‚t          |||¦  «        \  }}}}‰d|› �z  Š‰d|› �z  Št                               ‰¦  «         t          dd„ ˆfd„¬¦  «         |S )aÉ  
    Format reordering statistics, log them, and return final node list.

    Computes improvement metrics, creates a formatted table (using tabulate if
    available), validates the reordered node count, recalculates peak memory,
    and logs all information.

    Args:
        stats: Per-node reordering statistics
        head: Head of the reordered linked list
        next_dict: Linked list next pointers
        original_snodes_num: Original number of nodes (for validation)
        peak_memory: Initial peak memory before reordering
        name_to_freeable_input_buf: Buffer memory tracking info
        graph_outputs: Graph output names

    Returns:
        Final reordered list of scheduler nodes
    c                ó,   •— i | ]}|‰|         j         “ŒS r    )rq   ©r#   r$   rY   s     €r%   rÍ   z4_format_and_log_reordering_stats.<locals>.<dictcomp>  s#   ø€ ÐPÐPÐP¸E�5˜* UÔ+Ô7ÐPÐPÐPr'   c                ó    •— g | ]
}‰|         ‘ŒS r    r    )r#   r$   rq   s     €r%   r&   z4_format_and_log_reordering_stats.<locals>.<listcomp>  s   ø€ ÐIÐIÐI°E˜[¨Ô/ÐIÐIÐIr'   c                ó*   •— g | ]}‰|         j         ‘ŒS r    )ra   r>  s     €r%   r&   z4_format_and_log_reordering_stats.<locals>.<listcomp>  s!   ø€ ÐGÐGÐG°5�z %Ô(Ô.ÐGÐGÐGr'   zAreorder_communication_preserving_peak_memory improved overlap by z
 ns after z reorders.
)zCollective nodeúcomm_time(us)úcomp_time(us)úinitial exposed(us)úfinal exposed(us)úimprovement(us)úlimiting factorra   rb   rd   rk   c                óÊ   — g | ]`\  }}t          |¦  «        |j        d z  |j        d z  |j        d z  |j        d z  |j        d z  |j        |j        |j        |j	        |j
        g‘ŒaS ©g     @�@)Únode_summaryrg   rh   ri   rj   rq   r_   ra   rb   rd   rk   )r#   r$   Ú	node_infos      r%   r&   z4_format_and_log_reordering_stats.<locals>.<listcomp>,  s�   € ð ð ð ñ ˆE�9õ ˜ÑÔØÔ #Ñ%ØÔ #Ñ%ØÔ%¨Ñ+ØÔ# cÑ)ØÔ! CÑ'ØÔ%ØŒOØÔØÔ"ØÔ"ð	
ðð ð r'   Útabulater   ©rK  ©Úheadersú>Please `pip install tabulate` to nicely render overlap stats.
ú
Nz
 peak_memory_before:z
 peak_memory_after:Úartifactc                 ó   — dddœS )NrZ   Ústring©ÚnameÚencodingr    r    r'   r%   ú<lambda>z2_format_and_log_reordering_stats.<locals>.<lambda>U  s   € ØBØ ð
ð 
€ r'   c                 ó   •— ‰ S rm   r    )Úreorder_log_strs   €r%   rW  z2_format_and_log_reordering_stats.<locals>.<lambda>Y  s   ø€ ˜?€ r'   ©Úmetadata_fnÚ
payload_fn)r!  ÚitemsÚ	importlibÚutilÚ	find_specrK  r^   r§   Úmaprß   r-   r   Úoverlap_logÚinfor   )r8  rØ   rÛ   r:  r°   r¯   r®   Útotal_improvementÚtotal_movesrN  ÚrowsrK  Ú
new_snodesÚnew_peak_memoryr*   rq   rY   rY  s                  @@@r%   Ú _format_and_log_reordering_statsri  ú  s$  øøø€ ð8 €JØPÐPÐPÐPÀZÐPÑPÔP€KÝÐIÐIÐIÐI¸[ÐIÑIÔIÑJÔJÐÝÐGÐGÐGÐG¸JÐGÑGÔGÑHÔH€Kð	,ÐL]ð 	,ð 	,Øð	,ð 	,ð 	,ð ðð ð €Gðð ð !+× 0Ò 0Ñ 2Ô 2ðñ ô €Dõ  „~×Ò 
Ñ+Ô+ð 5Ø%Ð%Ð%Ð%Ð%Ð%à˜8˜8ØØð
ñ 
ô 
ñ 	
ˆˆð
 	ØMñ	
ˆð 	�3˜w™<œ<¨$Ñ.Ñ.ˆØ˜4Ÿ9š9¥S­¨d¡^¤^Ñ4Ô4Ñ4ˆå.¨t°T¸9ÑEÔE€JÝˆz‰?Œ?Ð1Ò1Ð1Ð1Ð1Ý=ØÐ.°ñ ô  Ñ€O�Q˜˜1ð Ð=°Ð=Ð=Ñ=€OØÐ@¨Ð@Ð@Ñ@€Oå×Ò�_Ñ%Ô%Ð%ÝØð
ð 
ð +Ð*Ð*Ð*ðñ ô ð ð Ðr'   úDtuple[list[BaseSchedulerNode], dict[BaseSchedulerNode, ReorderInfo]]c                óÈ  — d}| D ]}t          |¦  «        rd} nŒ|s| i fS t          | ¦  «        }t          t          j        j                             ¦   «         ¦  «        }t          t          j                             ¦   «         ¦  «        }t          | ||¦  «        \  }}}}	}
}d„ | D ¦   «         }d„ | D ¦   «         }d„ | D ¦   «         }i }d}t          | ¦  «        \  }}}t          j        }d}|}t          j        }d}|��+||         ��"||         }|r�nt          |¦  «        s|}Œ*|�||k    r�nú|dz  }t          ¦   «         x}||<   t          |||||¦  «        \  }}}||_        ||_        ||z
  x|_        |_        ||_        ||         }|}|} i }!d	}"||         d         }#t          ||         ¦  «        }$t          ||         ¦  «        }%|��Mt          j        r'|j        t          j         |j        z  k     r	d
|_        �nt          j        st          |¦  «        r	d|_        �nö|$|%z
  }&|&sd}'n||         }(t3          |(|&z  ¦  «        }'|'�rt5          |¦  «        \  })}*|)rÂ|}|$                     ||         ¦  «         |%                     ||         ¦  «         t          j        rHt9          |¦  «        rt;          ||||||¦  «        \  }}}+||f|!|<   t          |¦  «        s|"||         z  }"t=          |#||         d         ¦  «        }#|xj        dz  c_        ||         }�ŒWd|                      ¦   «         › dd„ | !                    ¦   «         D ¦   «         › d|*› �},|,|_        �n·t          j        �rut          |¦  «        së||         }-|-dk    rÜt          |!¦  «        dk    rÉt=          d|j        |j        z
  ¦  «        }.t=          d|j        |j        z
  |-z
  ¦  «        }/|/|.z
  }0|! "                    ¦   «         D ]6\  }1}2t=          d|1|2z
  ¦  «        }3t=          d|1|2z
  |-z   ¦  «        }4|0|4|3z
  z  }0Œ7|0dk    rd|-› d|0› �|_        �nØ|! #                    ¦   «         D ]\  }5\  }1}2|1|2|-z
  f|!|5<   Œn{|"dk    rut          |||||¦  «        \  }}}+t=          d||z
  ¦  «        }.t=          d||z
  |"z   ¦  «        }/|/|.z
  }0|0dk    r*d|                      ¦   «         › d|"› d|0› d|› d|› �
|_        �n5tI          || |¦  «        }6||         }7|7j%        |7j&        z
  }8tO          ||6|	|¦  «        }9tQ          ||6| |#|8|7|9|¦  «        \  }:};|:|z
  |t          j)        z  k    rd|:› d|› �|_        n¾|xj*        dz  c_*        |dz  }tW          ||| |||¦  «        }t          |||||¦  «        \  }}}||_        ||_        ||_        ||z
  |_        tY          ||6| |8|7|9|;||	|¦
  «
         |r:ddl-m.}<  |<||6t_          |6¦  «        tI          |d|¦  «        |
||||d|9¦  «        }|rn||         }|�­M|}|�	||         �­"t          j0        stI          |d|¦  «        }=|=|fS tc          ||||||
|¦  «        }=|=|fS )z�
    Internal testing helper that also returns debug info.
    Returns:
        - reordered snodes list
        - dict {snode: ReorderInfo}
    FTc                óN   — i | ]"}|t          |¦  «        t          |¦  «        z  “Œ#S r    ©Úestimate_op_runtimerÓ   r"   s     r%   rÍ   zJ_reorder_communication_preserving_peak_memory_internal.<locals>.<dictcomp>}  óA   € ð 0ð 0ð 0àð 	Õ" 5Ñ)Ô)Õ,EÀeÑ,LÔ,LÑLð0ð 0ð 0r'   c                óf   — i | ].}|t          d „ |                     ¦   «         D ¦   «         ¦  «        “Œ/S )c              3  ó>   K  — | ]}|                      ¦   «         V — Œd S rm   r¥   rÊ   s     r%   rŒ   zT_reorder_communication_preserving_peak_memory_internal.<locals>.<dictcomp>.<genexpr>„  ó*   è è € ÐCÐC¨!˜Ÿš™œÐCÐCÐCÐCÐCÐCr'   ©Ú	frozensetrÌ   r"   s     r%   rÍ   zJ_reorder_communication_preserving_peak_memory_internal.<locals>.<dictcomp>ƒ  óP   € ð Að Að AØHMˆ�yÐCÐC¨u×/@Ò/@Ñ/BÔ/BÐCÑCÔCÑCÔCðAð Að Ar'   c                óL   — i | ]!}|t          d „ |j        D ¦   «         ¦  «        “Œ"S )c              3  óB   K  — | ]}t          |¦  «        °|j        V — Œd S rm   ©r    rU  ©r#   rŸ   s     r%   rŒ   zT_reorder_communication_preserving_peak_memory_internal.<locals>.<dictcomp>.<genexpr>‡  óC   è è € ð 
ð 
Ø½LÈ¹O¼Oð
ØŒFð
ð 
ð 
ð 
ð 
ð 
r'   ©rt  Úunmet_dependenciesr"   s     r%   rÍ   zJ_reorder_communication_preserving_peak_memory_internal.<locals>.<dictcomp>†  óU   € ð >ð >ð >ð ð 	�yð 
ð 
Ø!Ô4ð
ñ 
ô 
ñ 
ô 
ð>ð >ð >r'   r   Nr
   rí   ú unexposed by runtime estimationszcollective orderingú$data dependency detected
 candidate:z(outs:c                ó6   — g | ]}|                      ¦   «         ‘ŒS r    r¥   rÊ   s     r%   r&   zJ_reorder_communication_preserving_peak_memory_internal.<locals>.<listcomp>þ  s!   € ÐDsÐDsÐDsÐVWÀQÇZÂZÁ\Ä\ÐDsÐDsÐDsr'   z)
 non_group_reason:úcandidate has compute z,, group contains waits, total_exposed_delta z
candidate z is collective, group_runtime:z, exposed_delta:z c_comm_time:z c_comp_time:úpeak memory new:ú	 vs base:©Ú!_debug_iterative_memory_recomputerZ   )2r   r-   r	   r   Úgraphr­   ÚkeysÚget_output_namesr¶   r½   r   Ú(reorder_iterative_debug_limit_to_reorderÚ(reorder_iterative_debug_memory_recomputer×   r\   rû   rg   rh   ri   rj   rk   r5  Ú)reorder_iterative_extra_comm_comp_overlapr_   Ú,reorder_iterative_unsafe_collectives_reorderr{   r7  Úupdater   r  r  rb   r–   rÌ   r?   r]  rß   r  r  r0  r  Ú$reorder_iterative_peak_memory_budgetra   r  r*  Úcomms_debugr…  r¨   Úreorder_sink_verbose_loggingri  )>r   Úhas_collectivesr$   r:  r­   r®   r°   r´   r²   r³   r¯   rµ   ré   râ   rä   r8  re  r¹   rº   r¼   Ú debug_num_collectives_to_reorderÚnum_processed_collectivesÚcurrÚ debug_iterative_memory_recomputeÚiterative_recompute_errorÚ
_next_currrc  rg   rh   rk   r  r  r  Úgroup_waitsÚgroup_runtimer	  Úgroup_unmet_deps_namesÚgroup_output_namesÚdata_deps_namesÚdata_depÚcandidate_out_namesÚis_groupable_resultÚgrouping_reasonr*   ÚmsgÚ	c_runtimeÚexposed_beforeÚexposed_afterÚexposed_deltaÚgw_comm_timeÚgw_comp_timeÚgw_exposed_beforeÚgw_exposed_afterÚgwr¡   r  r
  r  r  r  r…  rg  s>                                                                 r%   rW   rW   _  sp	  € ð €OØð ð ˆÝ˜uÑ%Ô%ð 	Ø"ˆOØˆEð	ð ð Ø�rˆzÐå˜f™+œ+Ðå$.­q¬wÔ/C×/HÒ/HÑ/JÔ/JÑ$KÔ$K€LÝ%/µ´×0HÒ0HÑ0JÔ0JÑ%KÔ%K€Mõ 	$ F¨L¸-ÑHÔHñØØØØØ"Øð0ð 0àð0ñ 0ô 0€HðAð AØQWðAñ Aô AÐð>ð >ð ð	>ñ >ô >€Mð 35€Eà€Kå8¸Ñ@Ô@Ñ€Eˆ5�%õ 	Ô=ð %ð &'ÐØ%*€DåÔ=ð %ð !&Ðà
Ñ
˜u Tœ{Ñ6Ø˜4”[ˆ
Ø$ð 	Ùå(¨Ñ.Ô.ð 	ØˆDØà+Ð7Ø%Ð)IÒIÐIáØ! QÑ&Ð!å(™]œ]Ð*ˆˆu�T‰{Ý-MØ�%˜Ð#3°]ñ.
ô .
Ñ*ˆ	�9˜lð #ˆŒØ"ˆŒØ4=À	Ñ4IÐIˆÔ˜tÔ1Ø(ˆÔà˜$”Kˆ	Øˆ
Øˆ
ØˆØˆØ(¨Ô.¨qÔ1Ðõ ",¨M¸$Ô,?Ñ!@Ô!@ÐÝ'Ð(8¸Ô(>Ñ?Ô?ÐàÑ#ÝÔEð ØÔ"ÝÔIÐIØ”.ñ!ò!ð !ð (J�Ô$Ùõ !ÔMðå'¨	Ñ2Ô2ðð (=�Ô$Ùð 5Ð7IÑIˆOØ"ð GØ ��ð '7°yÔ&AÐ#ÝÐ 3°oÑ EÑFÔF�àñ &Ý7UØñ8ô 8Ñ4Ð# _ð 'ð "Ø!*�Jð +×1Ò1°-À	Ô2JÑKÔKÐKØ&×-Ò-Ð.>¸yÔ.IÑJÔJÐJå#ÔMð AÝ(¨Ñ3Ô3ð 	JÝ6VØ )Ø %Ø %Ø (Ø 0Ø -ñ7ô 7Ñ3˜I y°!ð 6?À	Ð5I˜K¨	Ñ2Ý8¸ÑCÔCð AØ)¨X°iÔ-@Ñ@˜Må(+Ø)¨<¸	Ô+BÀ1Ô+Eñ)ô )Ð%ð �L”L AÑ%�L”LØ % iÔ 0�IÙðAØ(1×(:Ò(:Ñ(<Ô(<ðAð AØDsÐDsÐ[d×[pÒ[pÑ[rÔ[rÐDsÑDsÔDsðAð Aà/>ðAð Að ð
 ,/�DÔ(ÙåÔEñ <"å0°Ñ;Ô;ð :"Ø (¨Ô 3�Ià  1’}�}­¨[Ñ)9Ô)9¸AÒ)=Ð)=å),¨Q°´ÀÄÑ0OÑ)PÔ)P˜å(+Ø˜tœ~°´Ñ>ÀÑJñ)ô )˜ð )6¸Ñ(F˜Ø:E×:LÒ:LÑ:NÔ:Nð Rð RÑ6˜L¨,å03°A°|ÀlÑ7RÑ0SÔ0SÐ-å/2Ø ! <°,Ñ#>ÀÑ#Jñ0ô 0Ð,ð *Ð-=Ð@QÑ-QÑQ˜M˜Mà(¨1Ò,Ð,ð!^¸ð !^ð !^ØN[ð!^ð !^ð !Ô0ñ "ð "-×!2Ò!2Ñ!4Ô!4ð"ð "ñ ! ñ %Ø ,Ø ,ð %1Ø$0°9Ñ$<ð3" ¨B¡ øð % qÒ(Ð(Ý2RØ% u¨hÐ8HÈ-ñ3ô 3Ñ/˜	 9¨aõ *-¨Q°	¸IÑ0EÑ)FÔ)F˜å(+¨A¨y¸9Ñ/DÀ}Ñ/TÑ(UÔ(U˜Ø(5¸Ñ(F˜Ø(¨1Ò,Ð,ð!r¨Y×-?Ò-?Ñ-AÔ-Að !rð !rØ2?ð!rð !rà2?ð!rð !ràNWð!rð !ràfoð!rð !rð !Ô0ñ
 "õ ,IØ˜J¨ñ,ô ,ˆCð 0@À	Ô/JÐà#Ô.Ð1DÔ1NÑNð  õ  4Ø˜sÐ$9Ð;Oñô ð <õ 9ØØØØ%Ø'Ø'ØCØ ñ	ô 	ñ /ˆNÐ.ð  Ñ,Ø¥Ô QÑQòRð Rð N ~ÐMÐMÀÐMÐMð Ô$ð ØˆJŒJ˜!‰OˆJŒJØ˜1ÑˆKå4Ø˜: z°5¸%Àñô ˆEõ 2RØ�e˜XÐ'7¸ñ2ô 2Ñ.ˆI�y ,ð 'ˆDŒNØ&ˆDŒNØ ,ˆDÔØ!*¨YÑ!6ˆDÔå6ØØØØ#Ø#Ø?Ø"ØØ%Ø ñô ð ð 0ð ð KÐJÐJÐJÐJÐJà,MÐ,MØØÝ  Ñ%Ô%Ý1°%¸¸uÑEÔEØ.Ø!ØØ Ø$ØBØCñ-ô -Ð)ð -ð ØØ˜jÔ)ˆIðC Ñ#ðD ˆðK Ð
˜u Tœ{Ñ6õN Ô4ð !Ý2°5¸$ÀÑFÔFˆ
Ø˜5Ð Ð å1ØØØØØØ"Øñô €Jð �uÐÐr'   rM   rN   rO   c                ó  ‡‡‡‡‡‡‡‡‡‡‡‡— i }i Ši i i cŠŠŠt          | ¦  «        D ]�\  }}|                     ¦   «         D ]}|||<   Œ|                     ¦   «         D ]}|‰|<   Œ|‰|                     ¦   «         <   |                     ¦   «         }	t          j        ‰|	<   d‰|	<   |‰|	<   Œ‚d}
| D ]•}|rit          |¦  «        rZ|
‰|                     ¦   «         <   |j        D ]5}‰|                              ¦   «         }t          ‰|         |
¦  «        ‰|<   Œ6|
dz  }
Œm|r&t          |¦  «        rd‰|                     ¦   «         <   Œ– G ˆˆˆˆfd„d¦  «        Šd„ | D ¦   «         Šg Št          t          ¦  «        Šd„ | D ¦   «         Š‰                     ¦   «         D ]V\  }}t          |¦  «        dk    rt          j        ‰ ‰|¦  «        ¦  «         |D ]}‰|                              |¦  «         ŒŒWg Šˆˆˆˆˆfd„Šˆfd„Šˆˆˆˆfd	„}‰rCt          j        ‰¦  «        j        }|rt          |¦  «        r ||¦  «         n ‰|¦  «         ‰°C‰                     ¦   «         D ]"}t          |¦  «        dk    sJ d
‰› �¦   «         ‚Œ#‰S )aÂ  
    Schedule `snodes` for various comm optimization objectives.

    Args:
        snodes: the nodes to be scheduled.
        raise_comms: whether to greedily schedule collectives as early as possible
        sink_wait: whether to greedily schedule waits as late as possible
        reorder_compute_for_overlap: whether to reorder compute nodes to
            optimize for compute/communication overlapping.

    Returns:
        The new schedule order.

    Some notes on the synergy between different options:
        - `raise_comms` provides more overlapping oppurtunies for `reorder_compute_for_overlap`.
        - When both `raise_comms` and `sink_waits` is `True`, `raise_comms` is prioritized.
    r   r
   c                  ó(   •— e Zd Zdˆ ˆˆˆfd„Zd„ ZdS )ú$_schedule_for_comm.<locals>.RunnablerJ   r]   c                óÞ   •— || _         t          t          |                     ¦   «         ¦  «        ¦  «        }‰|                              ¦   «         }‰|         ‰|         ‰|         f| _        d S rm   )r$   ÚnextÚiterÚget_operation_namesr–   Úscore)rp   r$   rU  Ú
fused_nameÚname_to_fused_nodeÚscores_0Úscores_1Úscores_2s       €€€€r%   Ú__init__z-_schedule_for_comm.<locals>.Runnable.__init__ù  sf   ø€ ØˆDŒJÝ�˜U×6Ò6Ñ8Ô8Ñ9Ô9Ñ:Ô:ˆDØ+¨DÔ1×:Ò:Ñ<Ô<ˆJà˜Ô$Ø˜Ô$Ø˜Ô$ðˆDŒJˆJˆJr'   c                ó"   — | j         |j         k     S rm   ©r²  )rp   Úothers     r%   Ú__lt__z+_schedule_for_comm.<locals>.Runnable.__lt__  s   € Ø”: ¤Ò+Ð+r'   N)rJ   r]   )rs   rt   ru   r¸  r¼  )r´  rµ  r¶  r·  s   €€€€r%   ÚRunnabler­  ø  sQ   ø€ € € € € ð	ð 	ð 	ð 	ð 	ð 	ð 	ð 	ð 	ð	,ð 	,ð 	,ð 	,ð 	,r'   r½  c                óL   — i | ]!}|t          d „ |j        D ¦   «         ¦  «        “Œ"S )c              3  ó$   K  — | ]}|j         V — Œd S rm   ©rU  )r#   Údeps     r%   rŒ   z0_schedule_for_comm.<locals>.<dictcomp>.<genexpr>  s$   è è € ÐGÐG s˜#œ(ÐGÐGÐGÐGÐGÐGr'   )r	   r|  r"   s     r%   rÍ   z&_schedule_for_comm.<locals>.<dictcomp>  sD   € ð <ð <ð <àð 	�zÐGÐG¨eÔ.FÐGÑGÔGÑGÔGð<ð <ð <r'   c                ó.   — i | ]}|t          |¦  «        “ŒS r    )rn  r"   s     r%   rÍ   z&_schedule_for_comm.<locals>.<dictcomp>  s#   € ÐKÐKÐK¸5�UÕ/°Ñ6Ô6ÐKÐKÐKr'   c                ó  •— ‰                      | ¦  «         |                      ¦   «         D ]_}‰|         D ]T} ‰|                               |¦  «         t          ‰|          ¦  «        dk    rt	          j        ‰ ‰| ¦  «        ¦  «         ŒUŒ`dS )zU
        Schedules `snode` and put all unblocked nodes onto the ready queue.
        r   N)rÞ   r˜   Úremover-   ÚheapqÚheappush)r$   Úbuf_namer½  Úbuffer_usersÚreadyÚ	scheduledrç   s     €€€€€r%   Úschedulez$_schedule_for_comm.<locals>.schedule  s£   ø€ ð 	×Ò˜ÑÔÐØ×.Ò.Ñ0Ô0ð 	;ð 	;ˆHØ% hÔ/ð ;ð ;�Ø˜5Ô!×(Ò(¨Ñ2Ô2Ð2Ý�z %Ô(Ñ)Ô)¨QÒ.Ð.Ý”N 5¨(¨(°5©/¬/Ñ:Ô:Ð:øð;ð	;ð 	;r'   c                 ój   •— d„ ‰D ¦   «         } t          | ¦  «        dk    rdS t          | d„ ¬¦  «        S )zh
        Return the next node in the ready queue that's neither a collective or
        a wait.
        c                ób   — g | ],}t          |j        ¦  «        °t          |j        ¦  «        °*|‘Œ-S r    )r   r$   r   rŠ   s     r%   r&   zI_schedule_for_comm.<locals>.get_overlapping_candidate.<locals>.<listcomp>'  sM   € ð 
ð 
ð 
àÝ& q¤wÑ/Ô/ð
õ 9FÀaÄgÑ8NÔ8Nð
Øð
ð 
ð 
r'   r   Nc                ó   — | j         S rm   rº  )r‹   s    r%   rW  zG_schedule_for_comm.<locals>.get_overlapping_candidate.<locals>.<lambda>.  s   € ¨Q¬W€ r'   )Úkey)r-   Úmin)Ú
candidatesrÉ  s    €r%   Úget_overlapping_candidatez5_schedule_for_comm.<locals>.get_overlapping_candidate"  sP   ø€ ð

ð 
àð
ñ 
ô 
ˆ
õ
 ˆz‰?Œ?˜aÒÐØ�4Ý�:Ð#4Ð#4Ð5Ñ5Ô5Ð5r'   c                ó*  •— t          | ¦  «        sJ ‚ ‰| ¦  «         ‰|          }|dk    rS ‰¦   «         x}�G‰                     |¦  «          ‰|j        ¦  «         |‰|j                 z  }|dk    r ‰¦   «         x}­Gt          j        ‰¦  «         dS )zÈ
        Schedules collective node `snode`, along with one or more compute nodes
        to overlap with it. The strategy is described in the comment of
        `reorder_compute_for_overlap`.
        r   N)r   rÄ  r$   rÅ  Úheapify)r$   Úcollective_costr  rÒ  rÉ  rË  Úsnode_to_costs      €€€€r%   Úschedule_collective_for_overlapz;_schedule_for_comm.<locals>.schedule_collective_for_overlap0  s½   ø€ õ # 5Ñ)Ô)Ð)Ð)Ð)Øˆ�‰Œˆà'¨Ô.ˆà˜aÒÐØ7Ð7Ñ9Ô9Ð9�ÐFà�LŠL˜Ñ#Ô#Ð#àˆH�Y”_Ñ%Ô%Ð%à˜}¨Y¬_Ô=Ñ=ˆOð ˜aÒÐØ7Ð7Ñ9Ô9Ð9�ÐFõ 	Œ�eÑÔÐÐÐr'   z;Detected unscheduled nodes. Nodes with unmet dependencies: )r:   r˜   r±  r–   ÚsysÚmaxsizer   Ú	ancestorsrÐ  r   r   r	   r]  r-   rÅ  rÆ  rÂ   Úheappopr$   r?   )r   rM   rN   rO   Úbuf_name_to_snoderG   r$   rÇ  Úop_nameÚ	node_nameÚcomm_idxÚancestorÚanc_fused_nameÚdepsrÁ  r×  r½  rÈ  rÒ  r´  rÉ  rË  rÊ  rµ  r¶  r·  rÖ  rç   s                   @@@@@@@@@@@@r%   rQ   rQ   ·  s»  øøøøøøøøøøøø€ ðL ÐØÐØ#% r¨2Ð €Hˆh˜Ý Ñ'Ô'ð "ð "‰
ˆˆUØ×.Ò.Ñ0Ô0ð 	0ð 	0ˆHØ*/Ð˜hÑ'Ð'à×0Ò0Ñ2Ô2ð 	0ð 	0ˆGØ*/Ð˜wÑ'Ð'Ø/4Ð˜5Ÿ>š>Ñ+Ô+Ñ,à—N’NÑ$Ô$ˆ	Ý!œkˆ�ÑØˆ�ÑØ!ˆ�ÑÐà€HØð +ð +ˆØð 	+Õ.¨uÑ5Ô5ð 	+Ø)1ˆH�U—^’^Ñ%Ô%Ñ&Ø!œOð Sð S�Ø!3°HÔ!=×!FÒ!FÑ!HÔ!H�Ý+.¨x¸Ô/GÈÑ+RÔ+R�˜Ñ(Ð(Ø˜‰MˆHˆHØð 	+�M¨%Ñ0Ô0ð 	+Ø)*ˆH�U—^’^Ñ%Ô%Ñ&øð,ð ,ð ,ð ,ð ,ð ,ð ,ð ,ð ,ð ,ñ ,ô ,ð ,ð<ð <àð<ñ <ô <€Jð
 €EÝ=HÍÑ=TÔ=T€LØKÐKÀFÐKÑKÔK€Mà!×'Ò'Ñ)Ô)ð )ð )‰ˆˆtÝˆt‰9Œ9˜Š>ˆ>ÝŒN˜5 ( (¨5¡/¤/Ñ2Ô2Ð2Øð 	)ð 	)ˆCØ˜Ô×!Ò! %Ñ(Ô(Ð(Ð(ð	)ð €Ið	;ð 	;ð 	;ð 	;ð 	;ð 	;ð 	;ð 	;ð 	;ð6ð 6ð 6ð 6ð 6ðð ð ð ð ð ð ð ð* ð Ý”˜eÑ$Ô$Ô*ˆØð 	Õ#6°uÑ#=Ô#=ð 	Ø+Ð+¨EÑ2Ô2Ð2Ð2àˆH�U‰OŒOˆOð ð ð ×!Ò!Ñ#Ô#ð 
ð 
ˆÝ�4‰yŒy˜AŠ~ˆ~ˆ~ØVÈ*ÐVÐVñ Œ~ˆ~ˆ~ð Ðr'   Únodesc           	     óœ  — t           j                             ¦   «         s| S d„ | D ¦   «         }t          dt	          |¦  «        ¦  «        D ]�}t          t          ||                              ¦   «         ¦  «        ¦  «        }||dz
                                ¦   «         D ]-}||                              t          ||d¬¦  «        ¦  «         Œ.Œ‚| S )zÌ
    Decide global ordering of comms, by just enforcing the ordering that's in the input graph
    (might not be the same ordering as the eager mode program).
    TODO: Come up with a better approach
    c                ó0   — g | ]}t          |¦  «        ¯|‘ŒS r    )r   )r#   r›   s     r%   r&   z3decide_global_ordering_of_comms.<locals>.<listcomp>^  s&   € Ð=Ð=Ð=˜Õ&9¸!Ñ&<Ô&<Ð=�!Ð=Ð=Ð=r'   r
   T)Úmutating_bufrž   )
r<   r3   Úis_availabler6   r-   r¯  r°  r˜   Úadd_fake_depr   )rã  Úname_to_bufr´  Ú
comm_nodesr»   ræ  rÄ   s          r%   Údecide_global_ordering_of_commsrë  S  sÚ   € õ Ô×)Ò)Ñ+Ô+ð Øˆà=Ð=˜UÐ=Ñ=Ô=€Jå�1•c˜*‘o”oÑ&Ô&ð ð ˆå�D ¨A¤×!?Ò!?Ñ!AÔ!AÑBÔBÑCÔCˆØ˜a !™eÔ$×5Ò5Ñ7Ô7ð 	ð 	ˆCØ�qŒM×&Ò&Ý˜¨,ÀÐEÑEÔEñô ð ð ð	ð
 €Lr'   c                  ó²   — e Zd ZU dZded<   dZded<   dZded<   dZded<   d	Zded
<   dZ	ded<   dZ
ded<   dZded<   dZded<   d	Zded<   ed„ ¦   «         ZdS )ÚSinkWaitInfor   r`   rb   rc   r^   rd   ra   Ú
moves_infor]   r_   re   rf   rg   rh   ri   rj   rk   c                ó    — | j         | j        z
  S rm   rn   ro   s    r%   rq   zSinkWaitInfo.improvementx  rr   r'   N)rs   rt   ru   rb   rw   rd   ra   rî  r_   rg   rh   ri   rj   rk   rx   rq   r    r'   r%   rí  rí  k  sÕ   € € € € € € à€GÐÐÐÑØ€LÐÐÐÑØ€E€N€N€N�NØ€JÐÐÐÑØ!€OÐ!Ð!Ð!Ñ!Ø€IÐÐÐÑØ€IÐÐÐÑØ!€OÐ!Ð!Ð!Ñ!Ø€MÐÐÐÑØ€LÐÐÐÑàð9ð 9ñ „Xð9ð 9ð 9r'   rí  c                ó^  — t          | ¦  «        rdd|                      ¦   «         › �fS t          | ¦  «        rdd|                      ¦   «         › �fS t          j        sPt          | ¦  «        rdd|                      ¦   «         › �fS t          | ¦  «        rdd|                      ¦   «         › �fS dS )aP  
    Check if a candidate node can be grouped during sink_waits pass.

    Sink Waits traverses waits right to left, so we don't group with
    processed waits on the right or with async collectives.

    Args:
        candidate: Node to check for groupability

    Returns:
        Tuple of (is_groupable, reason_if_not_groupable)
    Fzcandidate contains wait ú$candidate contains_async_collective zcandidate contains collective zcandidate contains gemm_like r3  )r   r–   r×   r   Ú&sink_iterative_use_runtime_estimationsr   r‰   r6  s    r%   Ú!_is_node_groupable_for_sink_waitsró  }  sé   € õ" �YÑÔð HØÐG°×1CÒ1CÑ1EÔ1EÐGÐGÐGÐGÝ  Ñ+Ô+ð 
àØI°9×3EÒ3EÑ3GÔ3GÐIÐIð
ð 	
õ
 Ô>ð õ
 ˜yÑ)Ô)ð 	àØG°×1CÒ1CÑ1EÔ1EÐGÐGðð õ ˜iÑ(Ô(ð 	àØF°	×0BÒ0BÑ0DÔ0DÐFÐFðð ð ˆ:r'   Ú7group_n_to_bufs_after_swap_dealloc_instead_of_candidateÚsize_free_delta_updatec	                ór  — |d         }	||	         d         ||	         j         z
  }
|sA|
|j         z   }|||j        z
  f|| <   |D ]#}||         }|d         |z   |d         |z   f||<   Œ$dS | g|¢D ]I}||         }||         xj        |                     |d¦  «        z  c_        ||||         j        z
  f||<   ŒJdS )a  
    Update memory tracking structures after swap (sink_waits version).

    Updates curr_memory and snodes_allocfree dictionaries to reflect the new
    memory state after swapping candidate with group.

    Args:
        candidate: Node that was moved
        gns: Group nodes
        candidate_delta_mem: Net memory change from candidate (alloc - free)
        candidate_allocfree: Candidate's allocation/free info
        group_n_to_bufs_after_swap_dealloc_instead_of_candidate: Buffers whose deallocation moves from candidate to group
        post_alloc_update: Cached post-allocation memory values
        size_free_delta_update: Cached size-free delta values
        curr_memory: Current memory state dict (mutated)
        snodes_allocfree: Node allocation/free info dict (mutated)
    r   r
   N)r  r  r  )r  r¡   r
  r  rô  r  rõ  r  r²   r  Úpre_group_memÚcandidate_post_allocr¦   r"  r›   Ú
post_allocs                   r%   Ú-_update_memory_tracking_after_swap_sink_waitsrú  ¨  s  € ð8 �Q”€JØ 
Ô+¨AÔ.Ð1AÀ*Ô1MÔ1XÑX€MØBð Ø,Ð/BÔ/MÑMÐà Ø Ð#6Ô#@Ñ@ð"
ˆ�IÑð ð 	ð 	ˆBØ˜R”ˆBà�1”Ð+Ñ+Ø�1”Ð+Ñ+ðˆK˜‰OˆOð 	ˆàÐ˜#Ðð 
ð 
ˆØ& qÔ)ˆ
Ø˜ÔÐ%Ô%Ð)?×)CÒ)CÀAÀqÑ)IÔ)IÑIÐ%Ô%àØÐ)¨!Ô,Ô6Ñ6ð
ˆ�A‰ˆð
ð 
r'   úFtuple[int, dict[BaseSchedulerNode, int], dict[BaseSchedulerNode, int]]c	                ó
  — ||         d         ||         j         z
  }	i }
i }d}|s t          ||z   |	|j         z   ¦  «        }||
|fS |	|j         z   }||
| <   |}t          d„ t          j                             |                     ¦   «         ¦  «        D ¦   «         ¦  «        }| || <   ||z   }|D ]T}||         d         |z   }||
|<   t          ||¦  «        }d}||v r!||         }|D ]}||j        j        z  }Œ|||<   ||z  }ŒU||
|fS )a�  
    Calculate potential peak memory after swapping candidate with group (sink_waits version).

    Computes new memory levels for all affected nodes and returns the potential
    peak memory along with cached post-allocation and size-free delta values.

    Args:
        candidate: Node being moved
        gns: Group nodes
        group_head: First node of group
        group_peak_memory: Current peak memory within the group
        candidate_delta_mem: Net memory change from candidate (alloc - free)
        candidate_allocfree: Candidate's allocation/free info
        group_n_to_bufs_after_swap_dealloc_instead_of_candidate: Buffers whose deallocation moves from candidate to group
        curr_memory: Current memory state dict
        snodes_allocfree: Allocation/free info for all nodes

    Returns:
        Tuple of (potential_peak_memory, post_alloc_update_dict, size_free_delta_update_dict)
    r   c              3  ó.   K  — | ]}|j         j        V — Œd S rm   r  r   s     r%   rŒ   z>_calculate_potential_peak_memory_sink_waits.<locals>.<genexpr>  s;   è è € ð &ð &àð 	ŒÔ ð&ð &ð &ð &ð &ð &r'   )	r  r  r!  Ú	itertoolsÚchainÚfrom_iterabler?   rÀ   r  )r  r¡   r  r	  r
  r  rô  r  r²   r÷  r  Ú_size_free_delta_updater  rø  Úcandidate_size_free_to_moveÚ	delta_memr¦   Úgn_post_allocÚgn_size_free_to_addr  rÄ   s                        r%   Ú+_calculate_potential_peak_memory_sink_waitsr  Ý  s›  € ð>   
Ô+¨AÔ.Ð1AÀ*Ô1MÔ1XÑX€Mà79ÐØ<>Ðà€NØBð KåØÐ 3Ñ3ØÐ/Ô:Ñ:ñ
ô 
ˆð Ð1Ð3JÐJÐJà(Ð+>Ô+IÑIÐØ$8Ð�yÑ!Ø)€NÝ"%ð &ð &å”?×0Ò0ØC×JÒJÑLÔLñ
ô 
ð&ñ &ô &ñ #ô #Ðð +FÐ)EÐ˜IÑ&Ø#Ð&AÑA€IØð 
)ð 
)ˆØ# Bœ¨Ô*¨YÑ6ˆØ!.Ð˜2ÑÝ˜^¨]Ñ;Ô;ˆØÐØÐHÐHÐHØJÈ2ÔNˆDØð @ð @�Ø# s¤~Ô'?Ñ?Ð#Ð#Ø*=Ð# BÑ'ØÐ(Ñ(ˆ	ˆ	ØÐ-Ð/FÐFÐFr'   c                óz   — ||         }|r| ||<   ||| <   ||          }|r|||<   |||<   | ||<   ||| <   ||k    r| S |S )aÁ  
    Swap positions of candidate and group in doubly-linked list (sink_waits version).

    Transforms (moves candidate to the left):
    group_head_prev -> group_head...group_tail -> candidate -> candidate_next
    Into:
    group_head_prev -> candidate -> group_head...group_tail -> candidate_next

    Args:
        candidate: Node to swap with group
        group_head: First node of group
        group_tail: Last node of group
        prev_dict: Dictionary mapping nodes to their previous nodes
        next_dict: Dictionary mapping nodes to their next nodes
        head: Current head of the linked list

    Returns:
        New head of the linked list (may change if group_head was the head)
    r    )r  r  r  rü   rÛ   rØ   Úgroup_head_prevÚcandidate_nexts           r%   Ú+_perform_double_linked_list_swap_sink_waitsr
  #  s€   € ð8   
Ô+€OØð /Ø%.ˆ	�/Ñ"Ø*€IˆiÑð ˜yÔ)€NØð /Ø$.ˆ	�.Ñ!Ø*€IˆjÑð &€IˆjÑØ%€IˆiÑð �TÒÐØÐØ€Kr'   ú%dict[BaseSchedulerNode, SinkWaitInfo]c                ó>  ‡— g d¢}d„ |                       ¦   «         D ¦   «         }dŠt          j                             d¦  «        rddlm}	 ‰ |	||¬¦  «        z  ŠnE‰dz  Š‰t          |¦  «        d	z   z  Š‰d	                     t          t
          |¦  «        ¦  «        z  Št           	                    ‰¦  «         t          |d
|¦  «        }
t          |
¦  «        |k    sJ ‚t          |
||¦  «        \  }}}}‰d|› �z  Š‰d|› �z  Št          dd„ ˆfd„¬¦  «         |
S )aÉ  
    Format sink_waits statistics, log them, and return final node list.

    Computes improvement metrics, creates a formatted table (using tabulate if
    available), validates the reordered node count, recalculates peak memory,
    and logs all information.

    Args:
        stats: Per-node sink_waits statistics
        head: Head of the reordered linked list
        next_dict: Linked list next pointers
        original_snodes_num: Original number of nodes (for validation)
        peak_memory: Initial peak memory before reordering
        name_to_freeable_input_buf: Buffer memory tracking info
        graph_outputs: Graph output names

    Returns:
        Final reordered list of scheduler nodes
    )z	Wait noderA  rB  rC  rD  rE  rF  rb   rd   ra   rî  rk   c                óÖ   — g | ]f\  }}t          |¦  «        |j        d z  |j        d z  |j        d z  |j        d z  |j        d z  |j        |j        |j        |j	        |j
        |j        g‘ŒgS rH  )rI  rg   rh   ri   rj   rq   r_   rb   rd   ra   rî  rk   )r#   r$   rc  s      r%   r&   z4_format_and_log_sink_waits_stats.<locals>.<listcomp>~  s‘   € ð ð ð ñ ˆE�4õ ˜ÑÔØŒN˜SÑ ØŒN˜SÑ ØÔ  3Ñ&ØÔ Ñ$ØÔ˜sÑ"ØÔ ØŒLØÔØŒJØŒOØÔð	
ðð ð r'   rc   rK  r   rL  rM  rO  rP  Nz*
 sink_waits_iterative peak_memory_before:z)
 sink_waits_iterative peak_memory_after:rQ  c                 ó   — dddœS )NÚsink_waits_iterative_inforS  rT  r    r    r'   r%   rW  z2_format_and_log_sink_waits_stats.<locals>.<lambda>¥  s   € Ø/Ø ð
ð 
€ r'   c                 ó   •— ‰ S rm   r    )Úlog_strs   €r%   rW  z2_format_and_log_sink_waits_stats.<locals>.<lambda>©  s   ø€ ˜7€ r'   rZ  )r]  r^  r_  r`  rK  r^   r§   ra  rb  rc  rß   r-   r   r   )r8  rØ   rÛ   r:  r°   r¯   r®   rN  rf  rK  rg  rh  r*   r  s                @r%   Ú _format_and_log_sink_waits_statsr  T  sŽ  ø€ ð8ð ð €Gðð ð !Ÿ;š;™=œ=ðñ ô €Dð" €GÝ„~×Ò 
Ñ+Ô+ð 
-Ø%Ð%Ð%Ð%Ð%Ð%à�8�8ØØð
ñ 
ô 
ñ 	
ˆˆð
 	ÐTÑTˆØ•3�w‘<”< $Ñ&Ñ&ˆØ�4—9’9�S¥ d™^œ^Ñ,Ô,Ñ,ˆÝ×Ò�WÑÔÐÝ.¨t°T¸9ÑEÔE€JÝˆz‰?Œ?Ð1Ò1Ð1Ð1Ð1Ý=ØÐ.°ñ ô  Ñ€O�Q˜˜1ð ÐJ¸[ÐJÐJÑJ€GØÐM¸OÐMÐMÑM€GÝØð
ð 
ð #�?�?�?ðñ ô ð ð Ðr'   c                ó  — t          t          ¦  «        }|                     | t          ¦   «         ¦  «        }|D ]H}||         }|| k    rŒ|j        j        }d}	|D ]}
|
|v r|
}	Œ	|	€Œ-||	                              |¦  «         ŒI|S )a­  
    Find buffers whose last use will change after swapping in sink_waits pass.

    When we swap [group] candidate to candidate [group], some buffers that
    were last used by candidate will now be last used by a group node instead.
    This is the opposite direction from the reorder version.

    Args:
        candidate: The node being moved (currently last use)
        gns: Group nodes being swapped with candidate
        buf_to_snode_last_use: Mapping of buffers to their current last-use nodes
        candidate_buffer_map: Pre-computed map of node -> buffers using that node

    Returns:
        Dict mapping group nodes to buffers that will change their last-use node
    N)r   r—   r  r	   rÀ   rÁ   rÞ   )r  r¡   r³   rµ   rô  r-  rÄ   r/  rÁ   Úlast_succ_gnr¦   s              r%   Ú._find_buffers_with_changed_last_use_sink_waitsr  ®  sÁ   € õ0 	•DÑÔð <ð *×-Ò-¨i½¹¼ÑFÔF€Nàð 
ð 
ˆØ.¨sÔ3ˆØ˜YÒ&Ð&Øð ”^Ô.ˆ
ØˆØð 	"ð 	"ˆBØ�ZÐÐØ!�øàÐØð 	@ÀÔM×TÒTØñ	
ô 	
ð 	
ð 	
ð CÐBr'   úEtuple[list[BaseSchedulerNode], dict[BaseSchedulerNode, SinkWaitInfo]]c                ó`  — t          | ¦  «        }|dk    r| i fS t          t          j        j                             ¦   «         ¦  «        }t          t          j                             ¦   «         ¦  «        }t          | ||¦  «        \  }}}}}}	t          | ¦  «        \  }
}}i }d„ | D ¦   «         }d„ | D ¦   «         }d„ | D ¦   «         }| d         }t          ¦   «         }t          j
        }t          j        }d}|��}|
|         ��t|
|         }|r�nh|�t          |¦  «        |k    r�nQt          |¦  «        r||vs|}ŒE|                     |¦  «         t          ¦   «         x}||<   t          |||
|||¦  «        \  }}}||z
  x|_        |_        ||_        ||_        ||_        ||         }|}|}i }d}||         d         } t          ||         ¦  «        }!t+          |¦  «        }"|��ƒt          j        r'|j        t          j         |j        z  k     r	d|_        �nP|!sd}#n||         }$t3          |$|!z  ¦  «        }#t          j        s-t7          |¦  «        rd	|                     ¦   «         › �|_        �nø|"ot+          |¦  «        }%|#s|%�rt;          |¦  «        \  }&}'|&r·|}|!                     ||         ¦  «         |"pt+          |¦  «        }"t          j        rGt+          |¦  «        r8t?          |||||¦  «        \  }}}(||f||<   t7          |¦  «        s|||         z  }tA          | ||         d         ¦  «        } |xj!        d
z  c_!        ||         }�Œo|#s-t          j"        s |%rd|                     ¦   «         › �|_        �nén!d|                     ¦   «         › d|'› �|_        �nÇt          j        �rctG          |j$        ¦  «        rVt          |||
|||¦  «        \  }}}(tA          d||z
  ¦  «        })tA          d||z
  |z   ¦  «        }*|*|)k    rd|)› d|*› �|_        �nPt7          |¦  «        sê||         }+|+dk    rÜt          |¦  «        dk    rÉtA          d|j        |j        z
  ¦  «        })tA          d|j        |j        z
  |+z
  ¦  «        }*|*|)z
  },| %                    ¦   «         D ]6\  }-}.tA          d|-|.z
  ¦  «        }/tA          d|-|.z
  |+z   ¦  «        }0|,|0|/z
  z  },Œ7|,dk    rd|+› d|,› �|_        �n~| &                    ¦   «         D ]\  }1\  }-}.|-|.|+z
  f||1<   ŒtO          |||¦  «        }2||         }3|3j(        |3j)        z
  }4tU          ||2||	¦  «        }5tW          ||2|| |4|3|5||¦	  «	        \  }6}7}8|6|z
  |t          j,        z  k    rd|6› d|› �|_        nÞ|xj-        d
z  c_-        |xj.        d|                     ¦   «         › �z  c_.        t_          ||||
||¦  «        }t          |||
|||¦  «        \  }}}||_        ||_        ||z
  |_        ||_        ta          ||2|4|3|5|7|8||¦	  «	         |r:d
dl1m2}9  |9||2tg          |2¦  «        tO          |d |¦  «        |||||d|5¦  «        }|rn||         }|�­ƒ|}|�	|
|         �­tt          j4        stO          |d |¦  «        }:|:|fS tk          |||||||¦  «        }:|:|fS )Nr   c                óN   — i | ]"}|t          |¦  «        t          |¦  «        z  “Œ#S r    rm  r"   s     r%   rÍ   z2_sink_waits_iterative_internal.<locals>.<dictcomp>ú  ro  r'   c                óf   — i | ].}|t          d „ |                     ¦   «         D ¦   «         ¦  «        “Œ/S )c              3  ó>   K  — | ]}|                      ¦   «         V — Œd S rm   r¥   rÊ   s     r%   rŒ   z<_sink_waits_iterative_internal.<locals>.<dictcomp>.<genexpr>  rr  r'   rs  r"   s     r%   rÍ   z2_sink_waits_iterative_internal.<locals>.<dictcomp>   ru  r'   c                óL   — i | ]!}|t          d „ |j        D ¦   «         ¦  «        “Œ"S )c              3  óB   K  — | ]}t          |¦  «        °|j        V — Œd S rm   rx  ry  s     r%   rŒ   z<_sink_waits_iterative_internal.<locals>.<dictcomp>.<genexpr>  rz  r'   r{  r"   s     r%   rÍ   z2_sink_waits_iterative_internal.<locals>.<dictcomp>  r}  r'   éÿÿÿÿFrí   r~  rñ  r
   z$collective ordering
 with candidate:r  z
 non_group_reason:z"candidate is wait, exposed_before:z vs exposed_after:r�  z2, group contains collectives, total_exposed_delta r‚  rƒ  ró   r„  Úsink_waits_iterative)6r-   r	   r   r†  r­   r‡  rˆ  r¶   r½   r   rŠ  Ú(sink_waits_iterative_debug_limit_to_sinkr   rÂ   rí  r  ri   rj   rg   rh   rk   r   rò  Ú&sink_iterative_extra_comm_comp_overlapr_   r{   Ú*sink_waits_iterative_swap_with_collectivesr×   r–   ró  r�  rû   r  rb   Ú/sink_waits_iterative_unsafe_collectives_reorderr   ry   r?   r]  rß   r  r  r  r  Ú!sink_iterative_peak_memory_budgetra   rî  r
  rú  r�  r…  r¨   r�  r  );r   r:  r­   r®   r°   r´   r²   r³   r¯   rµ   r¹   rº   r¼   r8  ré   râ   rä   r”  Úprocessed_waitsr•  Údebug_num_sink_waits_to_reorderr–  Ú
_prev_currrc  rg   rh   rk   r  r  r  Úgroup_collsr™  r	  r›  Úgroup_contains_collectiver�  Úcandidate_dep_namesÚboth_contain_commsÚ_is_groupableÚgroupable_reasonr*   r£  r¤  r¢  r¥  Úgc_comm_timeÚgc_comp_timeÚgc_exposed_beforeÚgc_exposed_afterÚgcr¡   r  r
  rô  r  r  r  r…  rg  s;                                                              r%   Ú_sink_waits_iterative_internalr2  å  s”	  € õ ˜f™+œ+ÐØ˜aÒÐØ�rˆzÐÝ$.­q¬wÔ/C×/HÒ/HÑ/JÔ/JÑ$KÔ$K€LÝ%/µ´×0HÒ0HÑ0JÔ0JÑ%KÔ%K€Mõ 	$ F¨L¸-ÑHÔHñØØØØØ"Øõ 9¸Ñ@Ô@Ñ€Eˆ5�%à35€Eð0ð 0àð0ñ 0ô 0€HðAð AØQWðAñ Aô AÐð>ð >ð ð	>ñ >ô >€Mð &,¨B¤Z€Då ‘l”l€OåÔ=ð %õ 	Ô=ð $ð !&ÐØ
Ñ
˜u Tœ{Ñ6Ø˜4”[ˆ
Ø$ð 	Ùà+Ð7Ý�OÑ$Ô$Ð(GÒGÐGáå˜dÑ#Ô#ð 	¨°OÐ(CÐ(CØˆDØà×Ò˜DÑ!Ô!Ð!Ý)™^œ^Ð+ˆˆu�T‰{Ý-MØ�%˜ Ð*:¸Mñ.
ô .
Ñ*ˆ	�9˜lð 5>À	Ñ4IÐIˆÔ˜tÔ1Ø"ˆŒØ"ˆŒØ(ˆÔà˜$”Kˆ	Øˆ
Øˆ
ØˆØˆØ(¨Ô.¨qÔ1Ðõ (Ð(8¸Ô(>Ñ?Ô?ÐÝ$7¸Ñ$=Ô$=Ð!àÑ#ÝÔBð ØÔ"ÝÔFÐFÈÌÑWòXð Xð (J�Ô$Ùð &ð JØ ��ð '4°IÔ&>Ð#ÝÐ 3Ð6HÑ HÑIÔI�õ  ÔJð Ý,¨YÑ7Ô7ð àU¸y×?QÒ?QÑ?SÔ?SÐUÐUð Ô(ñ ð ";ð "Õ?RØñ@ô @Ðð ð .Ð-ñ .Ý2SØñ3ô 3Ñ/�Ð/ð !ð *Ø!*�Jð '×-Ò-Ð.>¸yÔ.IÑJÔJÐJà1ÐSÕ5HÈÑ5SÔ5Sð .õ
 %ÔKð	Aå/°	Ñ:Ô:ð	Aõ 3SØ% u¨hÐ8HÈ-ñ3ô 3Ñ/˜	 9¨að 3<¸YÐ1G˜ IÑ.Ý8¸ÑCÔCð AØ)¨X°iÔ-@Ñ@˜Må(+Ø)¨<¸	Ô+BÀ1Ô+Eñ)ô )Ð%ð �L”L AÑ%�L”LØ % iÔ 0�IÙØ!ð å(ÔXðà.ðð
HØ1:×1CÒ1CÑ1EÔ1EðHð Hð Ô,ñ øðBØ(1×(:Ò(:Ñ(<Ô(<ðBð Bà/?ðBð Bð Ô(ñ
 åÔBñ ?"Ý˜9œ>Ñ*Ô*ð õ /OØ!ØØØ Ø(Ø%ñ/ô /Ñ+�I˜y¨!õ &)¨¨I¸	Ñ,AÑ%BÔ%B�Nå$'¨¨9°yÑ+@À=Ñ+PÑ$QÔ$Q�Mð % ~Ò5Ð5ðaØ/=ðað aØQ^ðað að Ô,ñ õ 1°Ñ;Ô;ð %"ð !)¨Ô 3�Ià  1’}�}­¨[Ñ)9Ô)9¸AÒ)=Ð)=å),¨Q°´ÀÄÑ0OÑ)PÔ)P˜å(+Ø˜tœ~°´Ñ>ÀÑJñ)ô )˜ð )6¸Ñ(F˜Ø:E×:LÒ:LÑ:NÔ:Nð Rð RÑ6˜L¨,å03°A°|ÀlÑ7RÑ0SÔ0SÐ-å/2Ø ! <°,Ñ#>ÀÑ#Jñ0ô 0Ð,ð *Ð-=Ð@QÑ-QÑQ˜M˜MØ(¨1Ò,Ð,ð!H¸ð !Hð !HØ8Eð!Hð !Hð !Ô0ñ "ð "-×!2Ò!2Ñ!4Ô!4ð"ð "ñ ! ñ %Ø ,Ø ,ð %1Ø$0°9Ñ$<ð3" ¨B¡ õ ,IØ˜J¨ñ,ô ,ˆCð 0@À	Ô/JÐà#Ô.Ð1DÔ1NÑNð  õ ?Ø˜sÐ$9Ð;Oñô ð Dõ <ØØØØ%Ø'Ø'ØKØ Ø$ñ
ô 
ñ HˆNÐ.Ð0Gð  Ñ,Ø¥Ô NÑNòOð Oð N ~ÐMÐMÀÐMÐMð Ô$ð àˆJŒJ˜!‰OˆJŒJØˆOŒOÐ9 9×#5Ò#5Ñ#7Ô#7Ð9Ð9Ñ9ˆOŒOå?Ø˜: z°5¸%Àñô ˆEõ 2RØ�e˜U HÐ.>Àñ2ô 2Ñ.ˆI�y ,ð 'ˆDŒNØ&ˆDŒNØ!*¨YÑ!6ˆDÔØ ,ˆDÔå9ØØØ#Ø#ØGØ"Ø'ØØ ñ
ô 
ð 
ð 0ð ØJÐJÐJÐJÐJÐJà,MÐ,MØØÝ  Ñ%Ô%Ý1°%¸¸uÑEÔEØ.Ø!ØØ Ø$Ø*ØKñ-ô -Ð)ð -ð Øà˜jÔ)ˆIðU Ñ#ðV ˆð] Ð
˜u Tœ{Ñ6õ` Ô4ð !Ý2°5¸$ÀÑFÔFˆ
Ø˜5Ð Ð å1ØØØØØØ"Øñô €Jð �uÐÐr'   c                ó,   — t          | ¦  «        d         S )a£  
    Similarly to reorder_communication_preserving_peak_memory this pass will try to iteratively
    push Wait nodes later, recomputing estimated peak memory before each swap,
    and preventing peak memory regressions.

    Pass will be applied to every Wait node. If there are immediate dependencies with next node,
    pass will try to group them together and on the next step to swap the group with next candidate.

    If _inductor.config_comms.sink_iterative_use_runtime_estimations is set True,
    pass will stop reordering of Wait once corresponding Collective is unexposed,
    based on runtime estimations.

    inductor.config_comms.sink_iterative_peak_memory_budget allows to tune how much pass
    can regress initial peak memory.
    E.g.:
    sink_iterative_peak_memory_budget == 0.0 - No regression of initial peak memory is allowed
    sink_iterative_peak_memory_budget == 0.2 - Pass can improve comm-compute overlap, sacrificing
    20% of initial peak memory value.

    inductor.config_comms.sink_iterative_extra_comm_comp_overlap config allows to more aggressively
    sink waits, stopping only when overlap_compute >= (1 + extra_comm_comp_overlap) * comm_time
    r   )r2  rR   s    r%   r  r  6  s   € õ. *¨&Ñ1Ô1°!Ô4Ð4r'   rf   c                ó®   — t           j        dk    r|                      ¦   «         }n/t          t           j        ¦  «        sJ ‚t          j        | ¦  «        }|S )z;
    Returns estimated op runtime in milliseconds (ms)
    r‚   )r   rn  r!   Úcallable)r$   Úruntimes     r%   rn  rn  P  sQ   € õ Ô! YÒ.Ð.Ø×-Ò-Ñ/Ô/ˆˆå�Ô2Ñ3Ô3Ð3Ð3Ð3ÝÔ,¨UÑ3Ô3ˆØ€Nr'   c           	     ó<  — |                       ¦   «         }t          |¦  «        dk    �r(d}t          | j        t          j        t          j        f¦  «        r`dd„ |                      ¦   «         D ¦   «         › �}dd„ | j        D ¦   «         › �}d|  	                    ¦   «         › d| j        j
        › d	|› d
|› d�	}d„ |                       ¦   «         D ¦   «         }d                     d„ |D ¦   «         ¦  «        }	 | j                             ¦   «         }n# t          $ r d}Y nw xY w| j        j        j        › |› |› d|› d|                      ¦   «         d›d�S g }|D ]$}	|                     t%          |	¦  «        ¦  «         Œ%| j        j        › dd                     |¦  «        › �S )Nr
   rc   zouts:c                ó6   — g | ]}|                      ¦   «         ‘ŒS r    r¥   rÊ   s     r%   r&   z node_summary.<locals>.<listcomp>a  s    € ÐJÐJÐJ° §
¢
¡¤ÐJÐJÐJr'   zins:c                ó   — g | ]	}|j         ‘Œ
S r    rÀ  ry  s     r%   r&   z node_summary.<locals>.<listcomp>b  s   € ÐGÐGÐG¨˜aœfÐGÐGÐGr'   ú z (z)
 ú(ú)c                ó@   — g | ]}|j                              ¦   «         ‘ŒS r    )ry   Úget_output_spec)r#   Úchilds     r%   r&   z node_summary.<locals>.<listcomp>d  s&   € ÐOÐOÐO°E�5”:×-Ò-Ñ/Ô/ÐOÐOÐOr'   ú,c                ól   — g | ]1}t          |t          j        ¦  «        rd |j        › d|j        › d�nd‘Œ2S )z (size=z	, stride=r<  rc   )rŽ   r   ÚLayoutÚsizeÚstride)r#   Úlayouts     r%   r&   z node_summary.<locals>.<listcomp>f  s[   € ð ð ð ð õ ˜f¥b¤iÑ0Ô0ðÐ@˜&œ+Ð@Ð@°´Ð@Ð@Ð@Ð@àðð ð r'   z.0fz ns)ú: z, )Ú	get_nodesr-   rŽ   ry   r   ÚExternKernelOutÚ_CollectiveKernelrÌ   r|  r–   r}   r§   Úmaybe_get_nameÚAttributeErrorÚ	__class__rs   r!   rÞ   rI  )
r$   r   ÚdetailÚouts_strÚins_strÚlayoutsÚout_tensor_inforÞ  Ú	summariesÚchild_snodes
             r%   rI  rI  \  s  € Ø�_Š_ÑÔ€FÝ
ˆ6�{„{�aÒÑØˆÝ�e”j¥2Ô#5µrÔ7KÐ"LÑMÔMð 	fØLÐJÐJ°e×6GÒ6GÑ6IÔ6IÐJÑJÔJÐLÐLˆHØIÐGÐG¨eÔ.FÐGÑGÔGÐIÐIˆGØe˜ŸšÑ)Ô)ÐeÐe¨U¬ZÔ-JÐeÐeÐPXÐeÐeÐ[bÐeÐeÐeˆFØOÐO¸U¿_º_Ñ=NÔ=NÐOÑOÔOˆØŸ(š(ðð ð &ð	ñ ô ñ
ô 
ˆð	Øœ
×1Ò1Ñ3Ô3ˆIˆIøÝð 	ð 	ð 	àˆIˆIˆIð	øøøð ”*Ô&Ô/ð  A°ð  A¸ð  Að  AÈIð  Að  AÐY^×YtÒYtÑYvÔYvð  Að  Að  Að  Að  	Að €IØð 4ð 4ˆØ×Ò� kÑ2Ô2Ñ3Ô3Ð3Ð3ØŒoÔ&Ð@Ð@¨$¯)ª)°IÑ*>Ô*>Ð@Ð@Ð@s   Ã4D ÄDÄDc                ó‚  — d}d }d„ }t          | ¦  «        D �]\  }}|€kt          |¦  «        r|t          |¦  «        z  }|j        }n't	          |j        ¦  «        rn|t          |¦  «        z  } ||t          |¦  «        › ¦  «         Œst          |¦  «        r4|t          |¦  «        z  }|j        } ||t          |¦  «        › ¦  «         Œ¶t	          |j        ¦  «        r ||t          |¦  «        › ¦  «         d }Œç ||dt          |¦  «        › �¦  «         �Œt                               d|dz  dz  › �¦  «         d S )Nrí   c                óF   — t                                | d›d|› �¦  «         d S )Nz>6rF  )rb  Údebug)Ústepr¡  s     r%   Ústep_logz#visualize_overlap.<locals>.step_log‚  s-   € Ý×Ò˜TÐ-Ð-Ð-¨Ð-Ð-Ñ.Ô.Ð.Ð.Ð.r'   z| zEst. runtime (ms): iè  )r:   r   rn  ry   r   rI  rb  rV  )ÚorderÚtotal_est_runtimeÚcur_comm_noderX  rW  r$   s         r%   Úvisualize_overlapr\  {  s�  € ð  #ÐØ€Mð/ð /ð /õ ! Ñ'Ô'ð ;ñ ;‰ˆˆeØÐ Ý" 5Ñ)Ô)ð 	@Ø!Õ%8¸Ñ%?Ô%?Ñ?Ð!Ø %¤
��Ý˜œÑ$Ô$ð @ð à!Õ%8¸Ñ%?Ô%?Ñ?Ð!ØˆH�T�l¨5Ñ1Ô1Ð3Ñ4Ô4Ð4Ð4å" 5Ñ)Ô)ð ;Ø!Õ%8¸Ñ%?Ô%?Ñ?Ð!Ø %¤
�Ø�˜¥,¨uÑ"5Ô"5Ð7Ñ8Ô8Ð8Ð8Ý˜œÑ$Ô$ð ;Ø�˜¥,¨uÑ"5Ô"5Ð7Ñ8Ô8Ð8Ø $��à�˜Ð9¥L°Ñ$7Ô$7Ð9Ð9Ñ:Ô:Ð:Ñ:Ý×ÒÐMÐ,=ÀÑ,DÀtÑ,KÐMÐMÑNÔNÐNÐNÐNr'   c                óê   — | }t           j        D ]c}t          |t          ¦  «        r$|t	          ¦   «         v rt	          ¦   «         |         }t          |¦  «        sJ d|› d�¦   «         ‚ ||¦  «        }Œd|S )Nz3Invalid reorder_compute_and_comm_for_overlap pass: z is not callable)r   Ú'reorder_for_compute_comm_overlap_passesrŽ   r^   Úglobalsr5  )r   rY  Úps      r%   Ú$reorder_compute_and_comm_for_overlapra  Ÿ  s‰   € ð €EåÔ;ð ð ˆÝ�a�ÑÔð 	 !¥w¡y¤y . .Ý‘	”	˜!”ˆAÝ˜‰{Œ{ð 	
ð 	
ØUÀ!ÐUÐUÐUñ	
ô 	
ˆ{ð ��%‘”ˆˆà€Lr'   )r   r   )r   r   rJ   r   )ry   rz   rJ   r{   )r$   r   rJ   r{   )r$   r   )F)rJ   r^   )r¡   r   rJ   r^   )r   r   rJ   r·   )r³   rª   rJ   r¾   )r   r   rJ   rÆ   )rØ   rÙ   rÚ   rÙ   rÛ   rÜ   rJ   r   )
rà   r   rá   r   râ   rã   rä   rã   rJ   r{   )rà   r   rÛ   rÜ   ré   rê   râ   rã   rä   rã   rJ   rë   )rá   r   rØ   r   rü   rÜ   ré   rê   râ   rã   rä   rã   rJ   rë   )r  r   r  r   r  r   rü   rÜ   rÛ   rÜ   rØ   r   rJ   r   )r  r   r¡   r   r  r   r	  r`   r
  r`   r  r   r  rª   r  rª   rJ   r  )r  r   r¡   r   r  r   r
  r`   r  r   r  rª   r  r  r  rª   r³   rª   r²   rª   rJ   r]   )
r  r   r¡   r   r³   rª   rµ   r¾   rJ   r+  )r  r   rJ   r1  )r8  r9  rØ   r   rÛ   rÜ   r:  r`   r°   r`   r¯   rª   r®   r;  rJ   r   )r   r   rJ   rj  )
r   r   rM   r{   rN   r{   rO   r{   rJ   r   )rã  r   rJ   r   )r  r   r¡   r   r
  r`   r  r   rô  rª   r  r  rõ  r  r  rª   r²   rª   rJ   r]   )r  r   r¡   r   r  r   r	  r`   r
  r`   r  r   rô  rª   r  rª   r²   rª   rJ   rû  )r8  r  rØ   r   rÛ   rÜ   r:  r`   r°   r`   r¯   rª   r®   r;  rJ   r   )r   r   rJ   r  )r$   r   rJ   rf   )\Ú
__future__r   rÅ  r^  rþ  ÚloggingrØ  Úcollectionsr   Údataclassesr   Útypingr   r   r<   Útorch._loggingr   Útorch.utils._ordered_setr	   rc   r   r   r   Údependenciesr   r   r   Úmemoryr   r   r   r   Úutilsr   r   r   r   Úvirtualizedr   Ú	getLoggerrs   r8   Ú_loggingÚgetArtifactLoggerrb  r�   r   rI   rN   rM   rU   rZ   r\   r„   r‰   r”   rœ   r    r¨   r¶   r½   r¬   rÎ   rÓ   rÕ   r×   rß   rè   rû   r  r  r  r*  r0  r7  ri  rW   rQ   rë  rí  ró  rú  r  r
  r  r  r2  r  rn  rI  r\  ra  r    r'   r%   ú<module>rp     s¹  ðð #Ð "Ð "Ð "Ð "Ð "à €€€Ø Ð Ð Ð Ø Ð Ð Ð Ø €€€Ø 
€
€
€
Ø #Ð #Ð #Ð #Ð #Ð #Ø !Ð !Ð !Ð !Ð !Ð !Ø %Ð %Ð %Ð %Ð %Ð %Ð %Ð %à €€€Ø +Ð +Ð +Ð +Ð +Ð +Ø /Ð /Ð /Ð /Ð /Ð /à &Ð &Ð &Ð &Ð &Ð &Ð &Ð &Ð &Ð &Ø !Ð !Ð !Ð !Ð !Ð !ð ð &Ø%Ð%Ð%Ð%Ð%Ð%Ð%Ð%ðð ð ð ð ð ð ð ð ð ð ð ð OÐ NÐ NÐ NÐ NÐ NÐ NÐ NÐ NÐ NÐ NÐ NØ Ð Ð Ð Ð Ð ð €gÔ˜Ñ!Ô!€ØŒn×.Ò.¨x¸ÑCÔC€àð <Ø;Ð;Ð;Ð;Ð;Ð;ð!Kð !Kð !Kð !KðHð ð ð ðð ð ð ðð ð ð ð&#ð #ð #ð #ðL ð9ð 9ð 9ð 9ð 9ñ 9ô 9ñ „ð9ð(ð ð ð ð"(ð (ð (ð (ðð ð ð ðð ð ð ð ð0ð 0ð 0ð3ð 3ð 3ð 3ðð ð ð2ð ð ð ð"(ð (ð (ð (ð0ð ð ð ð"Gð Gð Gð
ð 
ð 
ð;ð ;ð ;ðð ð ð ð6.ð .ð .ð .ð9.ð 9.ð 9.ð 9.ðx9.ð 9.ð 9.ð 9.ðx.ð .ð .ð .ðb@.ð @.ð @.ð @.ðFJð Jð Jð JðZ$;ð $;ð $;ð $;ðNð ð ð ð<bð bð bð bðJUð Uð Uð Uðp
Yð Yð Yð Yðxð ð ð ð0 ð9ð 9ð 9ð 9ð 9ñ 9ô 9ñ „ð9ð"(ð (ð (ð (ðV2
ð 2
ð 2
ð 2
ðjCGð CGð CGð CGðL.ð .ð .ð .ðbWð Wð Wð Wðt4Cð 4Cð 4Cð 4CðnNð Nð Nð Nðb
5ð 5ð 5ð 5ð4	ð 	ð 	ð 	ðAð Að Að>!Oð !Oð !OðHð ð ð ð ð r'   