tjjUddlZddlmZmZddlmZmZddlmZm Z ddl Z gdZ ej eZedZe dZeeefZeeefZeGdd ZeeeeegeefZeGd d ZeZeed <iaeeeefe jj fed <iZ!ee"efed<eeeefeefZ#ia$e#ed<eeeeeeffZ%ia&e%ed<ia'e%ed<ia(e%ed<da)e*ed<e+hdZ,e+eed<deeezdzdeeezdzdeeezdzde-eeeffdZ.dddeddfdZ/iZ0eee jj fed<e-Z1e-eed <iZ2eeeefe jj fed!<d"ede jj fd#Z3d$ede jj fd%Z4d&ed$ed'eddfd(Z5d&ed$eddfd)Z6d&edd*fd+Z7d&edefd,Z8d-ed&eddfd.Z9d/e jj d0ed$eddfd1Z:d2eeezdzdeefd3Z;dddd4d5eeezdzd6eeezdzd7eeezdzddfd8Zedeefd?Z>d>ed&ed$ed@eeefddf dAZ?dBe"dCe"defdDZ@dddEdFedGed&ed$edHedzdIedJedKeddfdLZAddMdNeedOeedPedefdQZBddRd&ed$edSeedTedzddf dUZCddddVdWedXe-eeefdzdYedTedzddf dZZD dgd[edee"effd\ZEddRd&ed$edSeedTedzddf d]ZFdhd^ZGdd_d`edYeddfdaZHdd_dbeeeegefdYeddfdcZIdd_ddeeegefdeedYeddfdfZJdS)iN)CallableIterable) dataclassfield) ParamSpecTypeVar)UserOrderingFnregister_op_override!reorder_graphs_from_user_functionreenable_op_overridesderegister_op_overridesget_dsl_operationsnative_decomp_tablePRcleZdZUdZeed<eed<eed<eed<eed<eed<dZe ed <d Z e ed <d S) _OverrideNodezTrack function override data.dsl_name op_symbol dispatch_keycond_fnimpl_fnnode_idFunconditional_overrideTactiveN) __name__ __module__ __qualname____doc__str__annotations__ _OpCondFn _OpImplFnrboolrT/var/www/html/CA-Chatbot/venv/lib/python3.11/site-packages/torch/_native/registry.pyrrsz''MMMNNN   LLL#(D(((FDr&rc JeZdZUdZeeZeeed<eeZ eeed<eeZ eeed<de de fdZ dd eeezd zd eeezd zd eeezd zde dd f dZdeeeeffdZdefdZd S) _FilterStatez+Manages filtering state for override nodes.)default_factory _dsl_names _op_symbols_dispatch_keysnodereturncf|j|jvrdS|j|jvrdS|j|jvrdSdS)z Check if a node is enabled based on current filter state. Args: node: The override node to check Returns: bool: True if the node should be enabled, False if filtered out FT)rr+rr,rr-)selfr.s r' check_enabledz_FilterState.check_enabled9sH =DO + +5 >T- - -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-)r1r3r4r5r6s r'updatez_FilterState.updateNs(  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-)r1s r'build_disable_key_setz"_FilterState.build_disable_key_setks' 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-)r1sidslopkeys r'__str__z_FilterState.__str__xs   00 % %FAs $$$S$$$ $AA %%t/00 $ $EAr ###R### #AA )) 344 % %FAs $$$S$$$ $AAr&F)rrrrrr8r+r r!r,r-rr$r2rr:tupler=rHr%r&r'r)r)1sf55 5555JC555!E#666KS666$uS999NCH999-D4" II#&-I(3-'$.IXc]*T1 I  I  IIII:  s5c?';     r&r) _filter_state_libs_native_decomp_overrides_graphs_dsl_name_to_lib_graph_dispatch_key_to_lib_graph_op_symbol_to_lib_graph_node_id_counter>MetaCompositeExplicitAutogradCompositeImplicitAutograd_DISALLOWED_DISPATCH_KEYSr3r4r5r/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)r9add)rXrYresolved_entriesentryrGkey_sets r'_append_to_setz&_build_key_set.._append_to_setsa-W55% % %E&&)%0%%CKK$$$$ % %r&)r8r r _MappingTyperOrQrP)r3r4r5r_r^s @r'r<r<s %(EEG %x}$t+ %=I %  % % % % % %N94555N:6777N="<=== Nr&F)print_inactiveractD]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)rNitemsprintrBrrr)rarFrG node_listrDr.rCs r'_print_override_graphsrfs!(    S9  ++  GAt{ n UUUT]UUt7RUU!,+T[+++Aa    r& _def_libs_defined_native_ops_aten_override_libs namespacec~|tvr(tj|dt|<t|S)NFRAGMENT)rgtorchlibraryLibrary)rjs r'_get_def_libraryrps4 !!$}44Y KK ) Y r&rcd|f}|tvr)tjdd|t|<t|S)z Get or create the _native IMPL library for a given dispatch key. One library per dispatch key is shared across all overridden ops. _nativeIMPL)rLrmrnro)rrGs r'_get_or_create_libraryrt s@ l #C %]**9flKKc :r&rkernelc||f}t|d}||tjdd|}||||d|t|<dS)a Install (or replace) an aten kernel at (op_symbol, dispatch_key). Creates a fresh Library per (op, key) so we can tear down just this one override via `_destroy_aten_override` without affecting any other override at the same dispatch key. NatenrsT) with_keyset)ripop_destroyrmrnroimpl)rrrurGexistinglibs r'_install_aten_overrider~s l #C#&&sD11H -   = =CHHY $H???"r&cpt||fd}||dSdS)zATear down the aten override at (op_symbol, dispatch_key), if any.N)riryrz)rrr}s r'_destroy_aten_overrider.s9  ! !9l";T B BC  r&ztorch._ops.OpOverload | Nonec|d\}}}|pd} ttjj|}t||S#t $rYdSwxYw)u4 Resolve `op_symbol` to a concrete OpOverload on `torch.ops.aten`. Accepts bare names ("bmm" → aten.bmm.default) and overload-qualified names ("add_.Tensor" → aten.add_.Tensor). Returns None if the op is not registered (e.g. a test-only op_symbol that never hit the C++ dispatcher). .defaultN) partitiongetattrrmopsrwAttributeError)rname_ overload_namepackets r'_resolve_aten_overloadr5sr'0055D!]!.YM..v}--- tts.A AAct|}|td|t|j}|dd\}}|dd\}}d|S)uReturn the schema of at:: with the `aten::` prefix stripped. Accepts bare names ("bmm" → aten.bmm.default) and overload-qualified names ("add_.Tensor" → aten.add_.Tensor). Nz aten op not found for op_symbol=z::()rrr _schemasplit)roverloadrCrrestargss r'_aten_schema_tailrFsx &i00HM MMNNN H AggdAGAtjja  GAt t::r&rc0|tvrdStd|t|t |}t jd||ddt|dS)Nrrz _native::)_aten_overloadc||i|SNr%)rrkwargss r'z(_define_native_op_once..dsnn ? ? ? r&) rhrpdefinerrrmrn register_faker[)rr aten_overloads r'_define_native_op_oncerVs  """Y&&$'N0A)0L0L'N'NOOO+955M M 2D 2 233%2    D!!!!!r&r}r.c|js td|jd|jdt |j|j||j|j|dddS)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 zJ_OverrideNode must have a non-empty node_id before registration (dsl_name=z , op_symbol=)FT)rxallow_overrideN)r ValueErrorrrrr{r)r}r.rs r'_register_node_implrrs <  J J J6:n J J J   4<888HH    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 )rs r'r9r9s? h ) )Z#-F-F{ Or&)enable_dsl_namesenable_op_symbolsenable_dispatch_keysrrrc 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)r6 filter_stateN)loginforKr:r<rN_register_overrides_from_graph)rrrr^rGrrs r'r r s$HHH  %3%%G"% < '>> +<M     r&)disable_dsl_namesdisable_op_symbolsdisable_dispatch_keysrrrctd|||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: %srN)rrrKr:r=rN_cleanup_and_reregister_graph)rrrr^rGrrs r'r r 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. )r8rNrcrr[sorted)r operationsrrnodesr.s r'rrsvJ!(A  D}((y)))) *  r&rGc*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 registrationsymbolrGr/Ncr||}| |g}|||<dS||dS)z;Helper to add key to registration list or create new entry.N)getappend)rrrG entry_lists r'_get_new_entry_or_appendz;_update_registration_maps.._get_new_entry_or_append%sN "%%f--  J#-L   c " " " " "r&)dictr listrJrOrQrP)rrrrGrs r'_update_registration_mapsrs& #3U38_ 556 # #38_ #  # # # #3XsCCC4iEEE7sKKKKKr&rrcdS)NTr%)rrs r' _always_truer8s 4r&)allow_multiple_overriderbackend lib_symbolcondr{rrc |dkrtd|d|tvrtd|d||stdt}||f}t|g} |dd } | d |d t } t d z a| 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 cond: Predicate choosing whether `impl` applies to a given call. May be None if `unconditional_override=True`. 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. When True, a trivially-True predicate is supplied for the router if `cond` is None. Raises: ValueError: If lib_symbol is not "aten", if dispatch_key is in _DISALLOWED_DISPATCH_KEYS (Meta / CompositeImplicitAutograd / CompositeExplicitAutograd), or if cond is None without unconditional_override=True. rwz.Unsupported lib_symbol (must be "aten", got: ""z dispatch_key=z is not supported. Overrides must be installed at a backend key (e.g. CPU, CUDA, XPU); the router's fake kernel redispatches to aten and would recurse otherwise.Nz8cond must be provided unless unconditional_override=Truerrr)rrrrrrr)rG) rrVrrNrreplacerRrrr) rrrrrr{rrrGop_graph _sanitizedrs r'r r <sHHVW*WWWXXX000 HL H H H    |% YWXX X l #C{{3##H ""3,,J::g::(8::G 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&rgraphrc,t||||dS)a Reregister a graph's routes from scratch. Used by reorder / deregister / reenable. Libraries are intentionally long-lived singletons; we rebuild the per-op router closure here. Args: op_symbol: The operation symbol dispatch_key: The dispatch key graph: The graph to register filter_state: Optional filter state for conditional registration rN)r)rrrrs r'rrs1&# ! r&)keys_to_processreregister_overridesrtransformation_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.Frr)r8rNkeysr TypeErrorrr RuntimeErrorrwarning Exception exceptionrtyperrr) rrrr target_keysrrrrs r'_apply_graph_transformationrs6+6C RRII:~|D    KKS     H    MM`    H  )T**  KKtY(     .7L)*  $< I% % %   *)     U//s) A77;C4%CCoverrides_onlyc~|ri}nddlm}t|}|t|S)a Return a decomposition table suitable for passing to ``ExportedProgram.run_decompositions`` or to Inductor / Dynamo as a decomposition set for ``torch.compile``. This is the canonical way to apply native overrides outside of eager. Callers opt in explicitly -- the registry does **not** install into any global compile/export decomp table on its own. This preserves three properties: * ``import torch._native`` doesn't transitively import inductor / dynamo / triton. * No other consumer (ONNX, tests, third-party backends) accidentally picks up our overrides. * Scoping is up to the caller: pass the table only where routing is desired. By default, the returned table contains ``torch.export.default_decompositions()`` with native-registered overrides layered on top -- matching typical "run the usual decompositions, plus my overrides" intent. The override entries win over any same-op default, because they're merged last. Example: ep = torch.export.export(model, args) ep = ep.run_decompositions( torch._native.registry.native_decomp_table() ) Args: overrides_only: If True, return only the native-registered overrides and no default aten decompositions. Useful for inspection / debugging, or when composing tables manually. Returns: A dict mapping ``OpOverload`` to decomposition callable. r)default_decompositions) torch.exportrrr:rM)rtablers r'rrsWR/(* 877777++--.. LL)*** Lr&cJ t|}g |D]^}d}|r||}|r:t||| |j|jfd|_Wd|__t|}t|| s|t |ddStj d||}t dtf fd |d fd } fd } t!||| | | t|<dSdS) 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 TFNzaten::swallow_cond_exceptionscD]K\}} ||i|}n#t$r|sYwxYw|r'ttjj||i|cSLSr)rrrmrrr)rrrr impl_namematched _NO_MATCH cond_impls r' _dispatchz1_register_overrides_from_graph.._dispatchs( N NOD) $///   .  N.eager_routersL4GGG Y  '9'@@@@@@ @ r&c:||d}|urtS|S)NTr)NotImplemented)rrrrrs r'compile_routerz6_register_overrides_from_graph..compile_routers/4FFF Y  ! ! r&)rtr2rrrrrrrrMryrmrn get_kernelobjectr$r~)rrrrr}r.enablerfallback_kernelrrrrrs @@@r'rrFs ! . .C-/I      6!//55F  T< 8 8 8   dlDL9 : : :DKKDKK%i00H 9l333    $ ( (4 8 8 8m../C /C/C\RROI        /> 9lLAAA -; ***r&cptD]\}}|\}}t|||dS)zO Perform all registration calls from previously-built override graphs. N)rNrcr)rGrrrs r'_register_all_overridesrsSmmoo  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.rr rs r' zI_apply_graph_filter..filtering_transformation..s-WWWTii .filtering_transformations WWWWWWUWWW W:~|D    KKS     LLL    MM`    LLL  s=A>'A>=A>rNr rrr)r rrs` 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_transformation,si )\)\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&rI)r/N)Kloggingcollections.abcrr dataclassesrrtypingrr torch.libraryrm__all__ getLoggerrrrrr$r"r#rr rr r)rKr!rLrrJrnrorMr _GraphsTyperNr`rOrPrQrRint frozensetrVr8r<rfrgrhrirprtr~rrrrrr9r r rrrr rrrrrrr rrr%r&r'r$s ........((((((((%%%%%%%%   g!! IcNN GCLL QW  QTN   "3T-%894 ;NNO TTTTTTT Tp+lnn |,,,79tE#s(OU]2 23888.46$vx/05555c?D$778 CeCHo../ (* )))+-L---(**** #-6IFFF--9S> !Xc]"T)!hsm#d*!#&-! sCx !!!!H6;dt(/1 4U]** +000 #SX%%% EGT%S/5=+@@AFFF   (=     1F    #c##h#SW####*cc.L"       """""""8  &3CF 4hsm 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#LL&T%*#(MIMIMI MIMIMI MI d  MI  MI"MI!MI MIMIMIMIh# '''''M"' '  '''':)-    %   <48!&(, NNN%NsCx)D0N N % N  NNNNd!333 &( 3333v)- h<h<h<h<h<  h< % h<  h<h<h<h