sgI(ddlZddlZddlmZddlmZddlmZmZm Z ddl m Z ddl m Z ddlmZddlmZej$eZej+ej,gdZed d ed efd Zdeeegefde ed dfdZde ede ed e efdZed deded efdZed GddZy)N)Queue)wraps)CallableDictList) GraphModule) compatibility) PassResult)pass_result_wrapper this_before_that_pass_constraint PassManagerF)is_backward_compatiblefnreturncytfd}tjstj|_|S)a+ Wrapper for passes which currently do not return a PassResult. This wrapper makes them return a PassResult containing the modified object and True for the "modified" flag. Args: fn (Callable[Module, Any]) Returns: wrapped_fn (Callable[Module, PassResult]) Nc|}| t|dSt|tr|St|tjr t|dSy)NT)r isinstancennModule)gmresrs U/var/www/html/venv/lib/python3.12/site-packages/torch/fx/passes/infra/pass_manager.py wrapped_fnz'pass_result_wrapper..wrapped_fn"sMf ;b$' ' c: &J RYY 'c4( (()rinspect isfunctiontype__name__)rrs` rr r sK z 2Y))   b !"2h//  r constraintpassesct|D]E\}}t||dzdD],\}}|||rtd|d|d|d|d|d|d Gy) Nz,pass schedule constraint violated. Expected z before z but found z at index z and z at indexz in pass list.) enumerate RuntimeError)rr iajbs r"_validate_pass_schedule_constraintr)1s&!1fQUWo. DAq!Q>qc!aS 1#U1#YqcB  r constraintsc t|dk(r|S|Dcic]}|g}}tj|d t}|D][}|D]:}||k(r |D]-}|||r ||j | |xxdz cc</< |dk(sK|j |]tj|d}g} |j sn|j}| j |d||<||D]/} || r | xxdzcc< | dk(s|j | 1|j sntt fd j} t| dk7rd| } t| | Scc}w)z Args passes: Passes that we are ordering constraints: Constraints applied on these passes Returns A sorted list of callables and a boolean of if a circular dependency existed rr"FTc|dk7S)Nr)p indegree_maps rz*_topological_sort_passes..msaA)=rz:Circular dependency detected within the following passes: ) lendictfromkeysrappendputemptygetlistfilterkeysr$)r r*r.graph candidatesr&r(rvisited sorted_passesn cycle_passeserrorr/s @r_topological_sort_passesrB>s ;1 >D,DQV,DE,D(, fa(@LJ   )AAv) ) !!Q'!HOOA& Oq(O )  ) ?a  NN1  %)MM&%$@G$&M NN Q q &A1:Q1$?a'NN1%  &  =|?P?P?RSTL <AL\N[5!! I-Es E>thisthatc0dtdtffd }|S)a Defines a partial order ('depends on' function) where `this` must occur before `that`. For example, the following pass list and constraint list would be invalid. ``` passes = [pass_b, pass_a] constraints = [ this_before_that_pass_constraint(pass_a, pass_b) ] ``` Args: this (Callable): pass which should occur first that (Callable): pass which should occur later Returns: depends_on (Callable[[Object, Object], bool] r&r(c|k7xs|k7SNr-)r&r(rDrCs r depends_onz4this_before_that_pass_constraint..depends_onsDy%AI%r)r)rCrDrHs`` rr r ts.&h&8& rceZdZUdZeeejgefe d<eeeege fe d<dZ e e d<dZ e e d< dd e d e fd Zd efd ZdefdZdZdZdeddfdZdejddfdZdejdefdZy)r ad Construct a PassManager. Collects passes and constraints. This defines the pass schedule, manages pass constraints and pass execution. Args: passes (Optional[List[Callable]]): List of passes. A pass is a callable which modifies an object and returns a PassResult constraint (Optional[List[Callable]]): List of constraints. A constraint is a callable which takes two passes (A, B) and returns True if A depends on B and False otherwise. See implementation of `this_before_that_pass_constraint` for example. steps (int): Max number of times we run the passes (default = 1). run_checks_after_each_pass (bool): Whether to run checks and linting after each pass suppress_check_failures (bool): Whether to raise errors when running checks r r*F _validatedr"stepsNrun_checks_after_each_passsuppress_check_failuresc^|xsg|_|xsg|_|r||_||_||_yrG)r r*rKrLrM)selfr r*rKrLrMs r__init__zPassManager.__init__s6l &," DJ*D''>$r_passcH|jj|d|_y)z> Adds a pass into the current list of passes. FN)r r4rJ)rOrQs radd_passzPassManager.add_passs 5!rrcH|jj|d|_y)zI Adds a constraint into the current list of constraints. FN)r*r4rJrOrs radd_constraintzPassManager.add_constraints  +rcz|jry|jD]}t||jd|_y)z Validates that current pass schedule defined by `self.passes` is valid according to all constraints in `self.constraints` NT)rJr*r)r rUs rvalidate_constraintsz PassManager.validate_constraintss: ?? ** HJ .z4;; G Hrc\t|j|j|_d|_y)ab Finds a valid traversal order based on the given constraints and orders the passes based on this order. If a circular dependency exists between the constraints and steps = 1, then we will raise an error because if steps != 1 this means that we will re-run the passes, allowing for circular dependencies. TN)rBr r*rJ)rOs rsolve_constraintszPassManager.solve_constraintss#/t{{DYZIJ!--F'73<rs''-16   8 $ Te,H-< (H-t34 >B8n   4 N4)-h4 (^4le,88-8e,\4\4-\4r