a,j`FUddlZddlmZmZddlmZmZddlmZm Z m Z ddl Z gdZ ejeZe dZe dZeee jefefZeeefZeezZeGdd ZeeeeegeefZeGd d ZeZeed <iaee eefe j!j"fed <ee eefeefZ#ia$e#ed<eeee eeffZ%ia&e%ed<ia'e%ed<ia(e%ed<deeezdzdeeezdzdeeezdzde)e eeffdZ*ddde+ddfdZ,dedede j!j"fdZ-de j!j"dededdfd Z.d!eeezdzdeefd"Z/dddd#d$eeezdzd%eeezdzd&eeezdzddfd'Z0dddd(d)eeezdzd*eeezdzd+eeezdzddfd,Z1d-edeefd.Z2d-ededed/e eefddf d0Z3ddd1d2ed3ededed4eezd5e+d6e+ddfd7Z4dd8d9eed:eed;e+de+fd<Z5dd=deded>eed?edzddf d@Z6ddddAdBedCe)e eefdzdDe+d?edzddf dEZ7dd=deded>eed?edzddf dFZ8dPdGZ9ddHdIedDe+ddfdJZ:ddHdKeeeege+fdDe+ddfdLZ;ddHdMeeege+fdNedDe+ddfdOZT- - -5   3 3 35tr#F dsl_namesN op_symbols dispatch_keys remove_keysc|r|xjtt|zc_|xjtt|zc_|xjtt|zc_dS|xjtt|zc_|xjtt|zc_|xjtt|zc_dS)a Update filter sets as (current | new) or (current ~ new). Args: dsl_names: DSL names to add/remove from filter op_symbols: Operation symbols to add/remove from filter dispatch_keys: Dispatch keys to add/remove from filter remove_keys: If True, remove keys from filter; if False, add them Note: Uses set.discard as it doesn't raise an exception if the element wasn't in the set to begin with. N)r(set_resolve_iterabler)r*)r.r0r1r2r3s r$updatez_FilterState.updateIs(  I OOs#4Y#?#?@@ @OO   $5j$A$A B B B     3'8'G'G#H#H H     OOs#4Y#?#?@@ @OO   $5j$A$A B B B     3'8'G'G#H#H H    r#cBt|j|j|jS)z Build a set of dictionary keys based on the current filter state. Returns: set[tuple[str, str]]: Set of (op_symbol, dispatch_key) tuples )_build_key_setr(r)r*)r.s r$build_disable_key_setz"_FilterState.build_disable_key_setfs' O       r#cd}|dz }|dz }t|jD]\}}|d|d|dz }|dz }t|jD]\}}|d|d|dz }|dz }t|jD]\}}|d|d|dz }|S) z-Return string representation of filter state.zFilter State: z === DSL: ===  z:  z === OP SYMBOL: === z === DISPATCH KEYS: === ) enumerater(r)r*)r.sidslopkeys r$__str__z_FilterState.__str__ss   00 % %FAs $$$S$$$ $AA %%t/00 $ $EAr ###R### #AA )) 344 % %FAs $$$S$$$ $AAr#)F)rrrrrr5r(rrr)r*rr!r/rr7tupler:rEr"r#r$r&r&,sf55 5555JC555!E#666KS666$uS999NCH999-D4" II#&-I(3-'$.IXc]*T1 I  I  IIII:  s5c?';     r#r& _filter_state_libs_graphs_dsl_name_to_lib_graph_dispatch_key_to_lib_graph_op_symbol_to_lib_graphr0r1r2r,ctdtttzdzdtddffd }||t||t ||t S)aK Build a set of dictionary keys based on filter criteria. Args: dsl_names: DSL names to include in key set op_symbols: Operation symbols to include in key set dispatch_keys: Dispatch keys to include in key set Returns: set[tuple[str, str]]: Set of (op_symbol, dispatch_key) tuples entriesNgraph_lib_dictr,cxt|}|D]&}||vr ||D]}|'dS)z;Helper to add matching keys from graph_lib_dict to key_set.N)r6add)rNrOresolved_entriesentryrDkey_sets r$_append_to_setz&_build_key_set.._append_to_setsa-W55% % %E&&)%0%%CKK$$$$ % %r#)r5rr _MappingTyperJrLrK)r0r1r2rUrTs @r$r9r9s %(EEG %x}$t+ %=I %  % % % % % %N94555N:6777N="<=== Nr#F)print_inactiverWctD]n\\}}}td|d|t|D]A\}}|js|r3d|d|jd|j}|r |d|jz }t|BodS)z~ Print all override graphs for debugging purposes. Args: print_inactive: Whether to print inactive nodes zop=z, key=r=z: node.dsl_name=z, node.unconditional_override=z node.active=N)rIitemsprintr?rrr)rWrCrD node_listrAr+r@s r$_print_override_graphsr\s!(    S9  ++  GAt{ n UUUT]UUt7RUU!,+T[+++Aa    r#rrc||f}|tvr)tjdd|t|<t|S)z Get or create a torch.library.Library instance for the given key. Args: op_symbol: The operation symbol dispatch_key: The dispatch key Returns: torch.library.Library: The library instance atenIMPL)rHtorchlibraryLibrary)rrrDs r$_get_or_create_libraryrcs@ l #C %]**66<HHc :r#libr+cZ||j|j||j ddS)z Register a single node implementation with the library. Args: lib: The torch.library.Library instance node: The override node to register dispatch_key: The dispatch key for registration T) with_keysetallow_overrideN)implrrr)rdr+rs r$_register_node_implrisCHH  33  r#iterablech|gSt|trt|tr|fS|S)z Resolve various input types to a consistent iterable of strings. Args: iterable: String, iterable of strings, or None Returns: Iterable[str]: Consistent iterable output ) isinstancerr)rjs r$r6r6s? h ) )Z#-F-F{ Or#)enable_dsl_namesenable_op_symbolsenable_dispatch_keysrmrnroc td|||t|||dt |||}|D]3}|\}}|t vr#t ||t |t4dS)as Re-enable overrides by removing them from filter state and reregistering. Args: enable_dsl_names: DSL names to re-enable enable_op_symbols: Operation symbols to re-enable enable_dispatch_keys: Dispatch keys to re-enable Note: This function uses reverse filter state management (removing from filters to enable). z>Re-registering ops by dsl: %s, op_symbol: %s, dispatch_key: %sT)r3 filter_stateN)loginforGr7r9rI_register_overrides_from_graph)rmrnrorTrDrrs r$r r s$HHH  %3%%G"% < '>> +<M     r#)disable_dsl_namesdisable_op_symbolsdisable_dispatch_keysrvrwrxctd|||t|||t}|D]3}|\}}|t vr#t ||t |t4dS)ag De-register overrides by updating filter state and reregistering graphs. Args: disable_dsl_names: DSL names to disable disable_op_symbols: Operation symbols to disable disable_dispatch_keys: Dispatch keys to disable Note: This function uses filter state management to selectively disable operations. z>De-registering ops by dsl: %s, op_symbol: %s, dispatch_key: %srqN)rsrtrGr7r:rI_cleanup_and_reregister_graph)rvrwrxrTrDrrs r$rr=s$HHH *,>@UVVV%2$G$G$I$IG  "% < '>> ) *       r#rct}tD]/\\}}}|D]$}|j|kr||n%0t |S)zGet list of operations registered by a specific DSL. Args: dsl_name: Name of the DSL to query. Returns: Sorted list of operation names registered by the DSL. )r5rIrYrrQsorted)r operationsr_nodesr+s r$rrisvJ!(A  D}((y)))) *  r#rDc*dttttttffdtdtttfddfd}|t|||t |||t ||dS)z Update the registration mapping dictionaries. Args: dsl_name: The DSL name op_symbol: The operation symbol dispatch_key: The dispatch key key: The dictionary key tuple registrationsymbolrDr,Ncr||}| |g}|||<dS||dS)z;Helper to add key to registration list or create new entry.N)getappend)rrrD entry_lists r$_get_new_entry_or_appendz;_update_registration_maps.._get_new_entry_or_appendsN "%%f--  J#-L   c " " " " "r#)dictrlistrFrJrLrK)rrrrDrs r$_update_registration_mapsr{s& #3U38_ 556 # #38_ #  # # # #3XsCCC4iEEE7sKKKKKr#)allow_multiple_overriderbackend lib_symbolrhrrc |dkrtd|d||f}t|g}|t ||||||t|<t ||||dS)a Register a passed override function to the dispatcher. Actually a graph-building operation; real registration happens later. Args: backend: The backend name (DSL name) lib_symbol: Library you're overriding symbols in (must be "aten") op_symbol: Name of the operation you're overriding dispatch_key: Dispatch key to override impl: Implementation function for the override allow_multiple_override: Allow overriding an existing override unconditional_override: Implementation doesn't have a fallback and doesn't require torch.DispatchKeySet as the first argument Raises: ValueError: If lib_symbol is not "aten" r^z.Unsupported lib_symbol (must be "aten", got: "")rrrrr)rDN) ValueErrorrIrrrr) rrrrrhrrrDop_graphs r$r r s8VW*WWWXXX l #C{{3##H OO%#9    GCLgy,CHHHHHHr#force_reregisteroriginal_graph new_graphrc|rdS||kS)aG Determine if a graph needs reregistration based on changes. Args: original_graph: The original graph before modification new_graph: The graph after modification force_reregister: If True, always reregister regardless of changes Returns: bool: True if reregistration is needed Tr")rrrs r$_should_reregister_graphrs"t Y &&r#rqgraphrrc^||f}|tvrt|=|rt||||dSdS)a] Clean up existing library and reregister a graph. This is the common pattern used across reorder, deregister, and reenable operations. Args: op_symbol: The operation symbol dispatch_key: The dispatch key graph: The graph to register filter_state: Optional filter state for conditional registration rqN)rHru)rrrrrrDs r$rzrzsa$ l #C e|| #J  &   %         r#)keys_to_processreregister_overridesrrtransformation_fnrrc||n%tt}t|D]\}}||ftvrtt||f} ||||}nh#tt t tf$r!t d||dYzt$rt d||YwxYwt|ts0t dt|j|||t||f<|r%t||drt!|||| dS) a Apply a transformation function to graphs and optionally reregister. This is the core pattern used by reorder_graphs_from_user_function and can be reused for other graph transformation operations. Args: transformation_fn: Function to transform each graph keys_to_process: Keys to process, or None for all graphs reregister_overrides: Whether to reregister changed graphs filter_state: Optional filter state for conditional registration Note: If transformation_fn raises an exception for a specific graph, that graph will be skipped and processing will continue with remaining graphs. NAGraph transformation failed for %s/%s. Preserving original graph.Texc_infoNUnexpected error in graph transformation for %s/%s. Preserving original graph.zbGraph transformation returned invalid type %s for %s/%s. Expected list. Preserving original graph.Frrq)r5rIkeysr TypeErrorrAttributeError RuntimeErrorrswarning Exception exceptionrltyperrrz) rrrrr target_keysrrrrs r$_apply_graph_transformationrs6+6C RRII:~|D    KKS     H    MM`    H  )T**  KKtY(     .7L)*  $< I% % %   *)     U//s) A77;C4%CCc||f}t|}|D]=}d}|r||}|rt|||d|_6d|_>dS)a Register all overrides in a single graph. Args: op_symbol: The operation symbol dispatch_key: The dispatch key graph: List of override nodes to register filter_state: Optional filter state for conditional registration TFN)rcr/rir)rrrrrrDrdr+enables r$ruru_s} l #C # &C     6!//55F  T< 8 8 8DKKDKK   r#cptD]\}}|\}}t|||dS)zO Perform all registration calls from previously-built override graphs. N)rIrYru)rDrrrs r$_register_all_overridesr~sSmmoo  U"% <&         r#)rfnc(t||dS)a Reorder override graphs using a user-provided ordering function. Args: fn: User-provided function that takes (op_symbol, dispatch_key, graph) and returns a reordered graph reregister_overrides: Whether to reregister graphs that have changed Note: This function uses the common graph transformation pattern and can serve as an example for other graph manipulation operations. rrN)r)rrs r$r r s+" 1r# filter_fnc dtdtdttdttffd }t||dS)a Apply a filter function to remove nodes from graphs. This is a convenience function that uses the graph transformation pattern to filter out unwanted nodes. Args: filter_fn: Function that takes (op_symbol, dispatch_key, node) and returns True to keep the node, False to remove it reregister_overrides: Whether to reregister modified graphs Example: # Remove all nodes with "deprecated" in the DSL name _apply_graph_filter( lambda op, dk, node: "deprecated" not in node.dsl_name, reregister_overrides=True ) Note: If filter_fn raises an exception for a specific graph, the original graph will be preserved and processing will continue. rrrr,c fd|DS#ttttf$r#tdd|cYSt $r!td|cYSwxYw)z-Apply filter_fn to graph with error handling.c.g|]}||Sr"r").0r+rrrs r$ zI_apply_graph_filter..filtering_transformation..s-WWWTii .filtering_transformations WWWWWWUWWW W:~|D    KKS     LLL    MM`    LLL  s=A>'A>=A>rNrrrr)rrrs` r$_apply_graph_filterrst8&)26}2E m , 21r# condition_fn ordering_fnc dtdtdttdttffd }t||dS)aE Apply reordering only to graphs that match a condition. This allows for more targeted reordering operations. Args: condition_fn: Function that takes (op_symbol, dispatch_key) and returns True if the graph should be reordered ordering_fn: Ordering function to apply to matching graphs reregister_overrides: Whether to reregister modified graphs Example: # Only reorder CUDA operations _apply_selective_reordering( condition_fn=lambda op, dk: dk == "CUDA", ordering_fn=lambda op, dk, g: sorted(g, key=lambda n: n.dsl_name), reregister_overrides=True ) Note: If condition_fn or ordering_fn raises an exception for a specific graph, the original graph will be preserved and processing will continue. rrrr,c ||}nl#ttttf$r#td||d|cYSt $r!td|||cYSwxYw|rz |||S#ttttf$r#td||d|cYSt $r!td|||cYSwxYw|S)z=Apply ordering_fn conditionally based on condition_fn result.rTrrr)rrrshould_reorderrrs r$conditional_transformationz?_apply_selective_reordering..conditional_transformationsi )\)\BBNN:~|D    KKS     LLL    MM`    LLL     "{9lEBBBz><H    W !       d     s- =A9'A98A9? B =C5 'C54C5rNr)rrrrs`` r$_apply_selective_reorderingrs{<))&))26}2E) m )))))))V 41r#)r,N)=loggingcollections.abcrr dataclassesrrtypingrrr torch.libraryr`__all__ getLoggerrrsrrDispatchKeySet _OpOverrideFn _OpReplaceFnr rrrr r&rGrrHrrFrarb _GraphsTyperIrVrJrKrLr5r9r!r\rcrir6r rrrr rrzrrurr rrr"r#r$rs........((((((((2222222222   g!! IcNN GCLLU%91%<=q@A 1~  $  3T-%894 ;NNO TTTTTTT Tp+lnn |,,,79tE#s(OU]2 238885c?D$778 CeCHo../ (* )))+-L---(****!Xc]"T)!hsm#d*!#&-! sCx !!!!H6;dt&cAV(  &3CF (hsm 3d :x}*040437 222DIo,2T#Y-2S /D0 2  2222n151548 )))T#Y-)d3i$.)c?T1 )  ))))Xc$#L#L#L#L sCx #L  #L#L#L#LZ%*#(/I/I/I /I/I/I /I , & /I"/I!/I /I/I/I/Il# '''''M"' '  '''':)-            %       L48!&(, NNN%NsCx)D0N N % N  NNNNl)-         %       >     ""' 4"'555c=147855 5555x"' LLLC:t+,LL L  LLLLLLr#