&Vjij(ddlZddlZddlmZddlmZddlmZddlm Z ddl m Z ddl m Z ddlmZejeZeejgdZe d d ed efd Zdeeegefdeed dfdZdeedeed eefdZe d deded efdZe d GddZdS)N)wraps)QueueCallable) compatibility) GraphModule) PassResult)pass_result_wrapper this_before_that_pass_constraint PassManagerF)is_backward_compatiblefnreturncdStfd}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|tjrt|dSdS)NT)r isinstancennModule)gmresrs \/root/voice-cloning/.venv/lib/python3.11/site-packages/torch/fx/passes/infra/pass_manager.py wrapped_fnz'pass_result_wrapper..wrapped_fn$sjbff ;b$'' ' c: & & )J RY ' ' )c4(( ( ) ))rinspect isfunctiontype__name__)rrs` rr r sd zt 2YY))))Y)  b ! !0"2hh/  r constraintpassesct|D]S\}}t||dzdD]3\}}|||rtd|d|d|d|d|d|d TdS) Nz,pass schedule constraint violated. Expected z before z but found z at index z and z at indexz in pass list.) enumerate RuntimeError)rriajbs r"_validate_pass_schedule_constraintr(4s&!!1fQUWWo..  DAqz!Q q!+,34?@  r constraintsc t|dkr|Sd|D}t|d t}|D]k}|D]E}||kr |D]9}|||s+||| |xxdz cc<:F |dkr||lt|d}g}|s|} || d|| <|| D];} || s1 | xxdzcc< | dkr|| <|tt fd } t| dkrd| } t| |S)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 rci|]}|gSr,.0ps r z,_topological_sort_passes..Rs,C,C,CqQ,C,C,Crr!FTc|dkS)Nrr,)r/ indegree_maps rz*_topological_sort_passes..qsaA)=rz:Circular dependency detected within the following passes: ) lendictfromkeysrappendputemptygetlistfilterkeysr#)rr)graph candidatesr%r'rvisited sorted_passesr/n cycle_passeserrorr2s @r_topological_sort_passesrEBs ;1 -D,CF,C,C,CE(, fa(@(@LJ    ) )AAvv) ) ) !z!Q'')!HOOA&&& OOOq(OOO ) ?a   NN1   $(MM&%$@$@G$&M  & NN  Q q & &A1: &Q1$?a''NN1%%%  &====|?P?P?R?RSSTTL <A W W W 5!!! rthisthatc4dtdtffd }|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|kp|kSNr,)r%r'rGrFs r depends_onz4this_before_that_pass_constraint..depends_onsDy%AI%rr)rFrGrKs`` rr r {s=*&h&8&&&&&&& rceZdZUdZeeejgefe d<eeeege fe d<dZ e e d<dZ e e d< dd e d e fd Zd efd ZdefdZdZdZdeddfdZdejddfdZdejdefdZdS)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 rr)F _validatedr!stepsNrun_checks_after_each_passsuppress_check_failurescX|pg|_|pg|_|r||_||_||_dSrJ)rr)rNrOrP)selfrr)rNrOrPs r__init__zPassManager.__init__sAl &,"  DJ*D''>$$$r_passcH|j|d|_dS)z> Adds a pass into the current list of passes. FN)rr7rM)rRrTs radd_passzPassManager.add_passs% 5!!!rrcH|j|d|_dS)zI Adds a constraint into the current list of constraints. FN)r)r7rMrRrs radd_constraintzPassManager.add_constraints&  +++rcd|jrdS|jD]}t||jd|_dS)z Validates that current pass schedule defined by `self.passes` is valid according to all constraints in `self.constraints` NT)rMr)r(rrXs rvalidate_constraintsz PassManager.validate_constraintssG ?  F* H HJ .z4; G G G GrcRt|j|j|_d|_dS)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)rErr)rM)rRs rsolve_constraintszPassManager.solve_constraintss%/t{Dz(PassManager.__call__..)sG''''.&8&;&;Q aAQ'''rNz$An error occurred when running the 'z#' pass after the following passes: )rMr]r^rangerNr"rrrrrloggerdebugrr hasattrrcrjmodifiedrr> recompilerO Exception) rRrgoverall_modified_rqr$rfn_namereprev_pass_namesmsgs r__call__zPassManager.__call__s, %  " " $ $ $ 6!tz""( ( AH#4;// 0 02)0);B)?)?V"++T"XXEV 0':::0"V**C%c:66w^@@(ZgZZZIJ!-F'73rs111111------666666  8 $ $ T T Te,,,H-,> (H-t34 >B8n      6 N6)-h6 (^6666re,,,88-,4e,,,^4^4^4^4^4^4^4-,^4^4^4r