Ei(SSKrSSKrSSKJr SSKJr SSKJr SSKJ r SSK J r SSK J r SSKJr \R "\5r\R'\R(5 /SQr\ "S S 9S \S \4S j5rS\\\/\4S\\S S4SjrS\\S\\S \\4Sjr\ "S S 9S\S\S \4Sj5r\ "S S 9"SS55rg)NCallable)wraps)Queue) compatibility) GraphModule) PassResult)pass_result_wrapper this_before_that_pass_constraint PassManagerF)is_backward_compatiblefnreturnc^Tcg[T5U4Sj5n[R"T5(d[T5RUlU$)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"U5nUc [US5$[U[5(aU$[U[R5(a [US5$g)NT)r isinstancennModule)gmresrs _/home/mande/repo/quber/.venv/lib/python3.13/site-packages/torch/fx/passes/infra/pass_manager.py wrapped_fn'pass_result_wrapper..wrapped_fn%sSf ;b$' ' c: & &J RYY ' 'c4( (()rinspect isfunctiontype__name__)rrs` rr r sN z 2Y))   b ! !"2h//  r constraintpassesc[U5HIup#[XS-S5H0upEU"X55(aM[SUSUSUSUSUSUS3 5e MK g) 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)5sz&!fUWo.DA!>qc!aS 1#U1#YqcB /"r constraintscN^ [U5S:XaU$UVs0sHo"/_M nn[RUS5m [5nUHgnUHBnXV:XaM UH2nU"XV5(aMX6R U5 T U==S- ss'M4 MD T US:XdMVUR U5 Mi [RUS5n/n UR 5(d{UR5nU R U5 SX'X2H7n X(aMT U ==S-ss'T U S:XdM&UR U 5 M9 UR 5(dM{[[U 4SjT R555n [U 5S:waSU 3n [U 5eU $s snf)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>TUS:g$)Nr)p indegree_maps r*_topological_sort_passes..rsaA)=rz:Circular dependency detected within the following passes: ) lendictfromkeysrappendputemptygetlistfilterkeysr$)r r*r.graph candidatesr&r(rvisited sorted_passesn cycle_passeserrorr/s @r_topological_sort_passesrCCs ;1 =C,CFqUFE,C(, fa(@LJ Av) !!''HOOA& Oq(O*  ?a  NN1 %)MM&%$@G$&M  NN Q A::Q1$?a'NN1%    =|?P?P?RSTL <AH W 5!! M-Ds F"thisthatc4^^S[S[4UU4SjjnU$)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&>UT:g=(d UT:g$Nr-)r&r(rErDs r depends_on4this_before_that_pass_constraint..depends_onsDy%AI%rr)rDrErIs`` rr r |s#*&h&8&& rc*\rSrSr%Sr\\\R/\ 4\ S'\\\\/\ 4\ S'Sr \ \ S'Sr \\ S'SS \ S \ 4S jjrS \4SjrS\4SjrSrSrS\SS 4SjrS\RSS 4SjrS\RS\ 4SjrSrg )r a$ 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_failurescvU=(d /UlU=(d /UlU(aX0lX@lXPlgrH)r r*rNrOrP)selfr r*rNrOrPs r__init__PassManager.__init__s0l &," J*D''>$r_passcHURRU5 SUlg)z. Adds a pass into the current list of passes. FN)r r5rM)rRrUs radd_passPassManager.add_passs 5!rrcHURRU5 SUlg)z9 Adds a constraint into the current list of constraints. FN)r*r5rMrRrs radd_constraintPassManager.add_constraints  +rcUR(agURHn[XR5 M SUlg)z{ Validates that current pass schedule defined by `self.passes` is valid according to all constraints in `self.constraints` NT)rMr*r)r rZs rvalidate_constraints PassManager.validate_constraintss1 ?? **J .z;; G+rc\[URUR5UlSUlg)a2 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)rCr r*rM)rRs rsolve_constraintsPassManager.solve_constraintss#/t{{DYZIJ!--F'73<CF22 H4<H/ AH H//H4)rMr*r rOrNrP)NNNFF)r __module__ __qualname____firstlineno____doc__r9rrrr __annotations__boolrMrNintrSrWr[r^rarkrcr__static_attributes__r-rrr r s( 299+z12 33h(3T9:;;JE3N+0(- ? %) ? "& ?  h      & &T & BII $ =4ryy=4Z=4rr )rloggingcollections.abcr functoolsrqueuertorch.nnrtorch.fx._compatibilityrtorch.fx.graph_modulertorch.fx.passes.infra.pass_baser getLoggerrrssetLevelWARNING__all__r rr9r)rCr r r-rrrs$1-6   8 $ Te,H-@ (H-t34 >B8n   6 N6)-h6 (^6re,88-4e,^4^4-^4r