U
    9%e`%                     @   sX  d dl mZmZmZmZmZmZmZ d dlZd dl	m
Z
 d dlZd dlZd dlmZ d dlmZ dddd	d
gZeeej eej f Zeejef Zeejj Zeejj Zee ZdddhZedddd Zeddeeejjf ejjedddZeddejje dddZ!eddG dd	 d	Z"eddejj#ejj#ddd
Z$dS )    )ListTupleUnionDictAnySetMappingN)	dataclass)_get_qualified_name)compatibilityget_acc_ops_nameget_node_targetis_node_output_tensorFxNetAccFusionsFinderlegalize_graphcall_modulecall_functionZcall_methodF)Zis_backward_compatiblec                 C   sT   t | tr| S | jr*d| jkr*d| j S | jdd}|r@|nd d| j S d S )Nacc_opsacc_ops.z
torch._opsz	torch.ops .)
isinstancestr
__module____name__replace)kmodule r   [/var/www/html/Darija-Ai-API/env/lib/python3.8/site-packages/torch/fx/passes/tools_common.pyr      s    
)
submodulesnodereturnc                 C   s   |j tks(tddt d|j   |j dkrdt|jtsBt| |j }t|dt|}t	|S |j dkr|j}|j
dk	rd|j
krd	|j S t|S t|jtst|jS dS )
a,  
    Given a `node` returns its target typename.

    For "call_method" node, return node.target which is the name of that method being called.
    This could potential lead to conflict but should be okay because normally it's on a tensor.

    For "call_function" node, return typename of node.target.

    For "call_module" node, return typename of the module that node.target point to.

    If seeing "_VariableFunctionsClass" in the target name string, it will be replaced by
    "torch". e.g. _VariableFunctionsClass.relu would become torch.relu.
    zExpect op types of z, z, but found r   Z_base_class_originr   Nr   r   )opCALLABLE_NODE_OPSAssertionErrorjoinr   targetr   getattrtyper   r   r   r
   )r    r!   ZsubmodZsubmod_typer'   r   r   r   r      s$    


)r!   r"   c                 C   s"   | j dd}|dk	o t|tjS )a  Checks if the node output produces a Tensor or not.

    NOTE: This requires to run `ShapeProp` on the containing fx graph before
    calling this function. This is because it works by checking the `type`
    metadata on the node. This metadata is produced by the `ShapeProp`.
    r)   N)metaget
issubclasstorchTensor)r!   type_r   r   r   r   C   s    c                   @   sh   e Zd ZdZejjedddZe	G dd dZ
deeef dd	d
Zeejjef dddZdS )r   z
    Finds groups of connected ACC nodes that pass non-tensor data between each other.
    Such groups are called fusion groups.
    )r   	acc_nodesc                 C   s   || _ t|jj| _|| _d S N)r   listgraphnodesr0   )selfr   r0   r   r   r   __init__U   s    zFxNetAccFusionsFinder.__init__c                   @   s6   e Zd ZU eed< eed< eed< eed< dd ZdS )!FxNetAccFusionsFinder.FusionGrouptop_node_idxr4   inputsnodes_need_processc                    sR   | j krdS  j|  j |  j|  j fdd|jD  dS )z5
            Add a node to fusion group.
            Nc                    s$   h | ]}|j tkr| jkr|qS r   )r#   r$   r4   ).0nr5   r   r   	<setcomp>s   s   
 
z=FxNetAccFusionsFinder.FusionGroup.add_node.<locals>.<setcomp>)r4   r:   addr9   discardupdateall_input_nodes)r5   r!   r   r=   r   add_nodeh   s    

z*FxNetAccFusionsFinder.FusionGroup.add_nodeN)r   r   __qualname__int__annotations__NodeSetrC   r   r   r   r   FusionGroupZ   s
   
rH   r7   )fusion_groupr9   c                 C   s\   |D ]R}|j tkrq| j||jk r(q||jkr8 dS | ||jr||  dS qdS )z
        Start from inputs and going reverse topological order. If any upstream node
        is in the fusion group, add all the nodes in this path to fusion group.
        TF)r#   r$   r4   indexr8   recursive_add_noderB   rC   )r5   rI   r9   argr   r   r   rK   z   s    	


z(FxNetAccFusionsFinder.recursive_add_node)r"   c                 C   sr  i }t | j}|D ]X}||kr"q|jtkr.qd|jkr:q|| jkrFq| j| j||ht|j	|hd}|j
r0|j
 }| ||j d|jkr|jD ]4}|jtkrq||jkrq|| | ||j q|j	D ]V}|jtkrqd|jkrq||jkrq|| t|j| j||_| ||j qqjt|j| jksT|  j|j8  _q|jD ]}|j||< qZq|S )NZtensor_meta)r8   r4   r9   r:   )r2   r0   r#   r$   r*   rH   r4   rJ   setrB   r:   poprK   r9   usersrC   minr8   )r5   resultr0   r!   rI   userrL   r<   r   r   r   __call__   s\    
















 

zFxNetAccFusionsFinder.__call__N)r   r   rD   __doc__r-   fxGraphModulerG   r6   r	   rH   r   NodeListrK   r   NoderS   r   r   r   r   r   N   s   !
)gmr"   c                    s  dd | j jD tj }| j jD ] }|jD ]}|  d7  < q.q$t }| j jD ]}| dkrV|| qVi  t	|dkr|
 }|| fdd |< |jD ]*}|  d8  < | dkr|| qqvt	|jt	| j jk r
tdfdd	D  | j j|_|| _ | S )
a  
    Replace the graph of the given GraphModule with one that contains the same nodes as the
    original, but in topologically sorted order.

    This is used by the merge_matmul transformation below, which disturbs the topologically sorted
    order of its input GraphModule, so that this order is restored before further transformation.

    Arguments:
        gm: The graph module to topologically sort. It is modified in-place.

    Returns:
        The graph module in-place sorted
    c                 S   s   i | ]
}|d qS r   r   r;   r!   r   r   r   
<dictcomp>   s      z"legalize_graph.<locals>.<dictcomp>   r   c                    s    |  S r1   r   )x)envr   r   <lambda>       z legalize_graph.<locals>.<lambda>z&Input graph has cycles, unable to add c                    s   g | ]} | d kr|qS rZ   r   r[   )indegr   r   
<listcomp>   s      z"legalize_graph.<locals>.<listcomp>)r3   r4   r-   rU   ZGraphrO   collectionsdequeappendlenpopleftZ	node_copyRuntimeErrorZ_codegen)rY   Z	new_graphr!   rR   queuecurr   )r_   rb   r   r      s,    



)%typingr   r   r   r   r   r   r   rd   dataclassesr	   r-   Ztorch.fxZtorch.fx.noder
   Ztorch.fx._compatibilityr   __all__r.   ZTensorsZTensorOrTensorsrU   rX   rW   rG   r   ZNamesr$   r   nnModuler   boolr   r   rV   r   r   r   r   r   <module>   s0   $


$#
 