jasonfan commited on
Commit
0d85469
·
verified ·
1 Parent(s): 3590aab

Add files using upload-large-folder tool

Browse files
This view is limited to 50 files because it contains too many changes.   See raw diff
Files changed (50) hide show
  1. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/fx/passes/utils/__init__.py +1 -0
  2. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/fx/passes/utils/common.py +95 -0
  3. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/fx/passes/utils/fuser_utils.py +294 -0
  4. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/fx/passes/utils/matcher_utils.py +447 -0
  5. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/fx/passes/utils/matcher_with_name_node_map_utils.py +114 -0
  6. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/fx/passes/utils/source_matcher_utils.py +163 -0
  7. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/ATen.h +42 -0
  8. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/AccumulateType.h +178 -0
  9. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/ArrayRef.h +7 -0
  10. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/Backend.h +7 -0
  11. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/Backtrace.h +7 -0
  12. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/BlasBackend.h +51 -0
  13. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CPUApplyUtils.h +356 -0
  14. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CPUFixedAllocator.h +38 -0
  15. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CPUFunctions.h +34 -0
  16. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CPUFunctions_inl.h +549 -0
  17. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CPUGeneratorImpl.h +54 -0
  18. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CUDAFunctions.h +34 -0
  19. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CUDAFunctions_inl.h +641 -0
  20. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CachedTensorUtils.h +29 -0
  21. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CollapseDims.h +99 -0
  22. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CompositeExplicitAutogradFunctions.h +34 -0
  23. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CompositeExplicitAutogradFunctions_inl.h +565 -0
  24. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CompositeExplicitAutogradNonFunctionalFunctions.h +34 -0
  25. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CompositeExplicitAutogradNonFunctionalFunctions_inl.h +329 -0
  26. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CompositeImplicitAutogradFunctions.h +34 -0
  27. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CompositeImplicitAutogradFunctions_inl.h +508 -0
  28. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CompositeImplicitAutogradNestedTensorFunctions.h +34 -0
  29. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CompositeImplicitAutogradNestedTensorFunctions_inl.h +30 -0
  30. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/Config.h +28 -0
  31. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/Context.h +712 -0
  32. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/DLConvertor.h +81 -0
  33. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/DTensorState.h +39 -0
  34. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/Device.h +7 -0
  35. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/DeviceAccelerator.h +118 -0
  36. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/DeviceGuard.h +46 -0
  37. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/DimVector.h +7 -0
  38. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/Dimname.h +6 -0
  39. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/Dispatch.h +790 -0
  40. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/Dispatch_v2.h +182 -0
  41. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/DynamicLibrary.h +41 -0
  42. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/EmptyTensor.h +171 -0
  43. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/ExpandBase.h +35 -0
  44. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/ExpandUtils.h +540 -0
  45. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/Formatting.h +6 -0
  46. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/FuncTorchTLS.h +51 -0
  47. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/FunctionalStorageImpl.h +274 -0
  48. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/FunctionalTensorWrapper.h +476 -0
  49. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/FunctionalizeFallbackKernel.h +63 -0
  50. miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/Functions.h +1476 -0
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/fx/passes/utils/__init__.py ADDED
@@ -0,0 +1 @@
 
 
1
+ from .common import compare_graphs, HolderModule, lift_subgraph_as_module
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/fx/passes/utils/common.py ADDED
@@ -0,0 +1,95 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ # mypy: allow-untyped-defs
2
+
3
+ from torch.fx._compatibility import compatibility
4
+ from torch.fx.graph import Graph
5
+ from torch.fx.graph_module import GraphModule
6
+ from torch.fx.passes.utils.matcher_utils import SubgraphMatcher
7
+ from torch.nn import Module
8
+
9
+
10
+ __all__ = ["HolderModule", "lift_subgraph_as_module", "compare_graphs"]
11
+
12
+
13
+ @compatibility(is_backward_compatible=False)
14
+ class HolderModule(Module):
15
+ """
16
+ HolderModule is used to copy all the attributes from original module to submodules
17
+ that uses the attributes
18
+ """
19
+
20
+ def __init__(self, d):
21
+ super().__init__()
22
+ for k, v in d.items():
23
+ self.add_module(k, v)
24
+
25
+
26
+ @compatibility(is_backward_compatible=False)
27
+ def lift_subgraph_as_module(
28
+ gm: GraphModule,
29
+ subgraph: Graph,
30
+ comp_name: str = "",
31
+ class_name: str = "GraphModule",
32
+ ) -> tuple[GraphModule, dict[str, str]]:
33
+ """
34
+ Create a GraphModule for subgraph, which copies the necessary attributes from the original parent graph_module.
35
+
36
+ Args:
37
+ gm (GraphModule): parent graph module
38
+
39
+ subgraph (Graph): a valid subgraph that contains copied nodes from the parent graph
40
+
41
+ comp_name (str): name for the new component
42
+
43
+ class_name (str): name for the submodule
44
+
45
+ """
46
+
47
+ # Loop through all module calls (call_module) and param fetches (get_attr)
48
+ # in this component, creating HolderModules as necessary to match the path.
49
+ # e.g. if in the original module there's a get_attr node fetches "conv.weight".
50
+ # We create a HolderModule as root -> add a HolderModule named "conv" ->
51
+ # make "weight" a attribute of "conv" HolderModule and point to conv.weight in
52
+ # the original module.
53
+ submodule = HolderModule({})
54
+ orig_to_split_fqn_mapping: dict[str, str] = {}
55
+ for n in subgraph.nodes:
56
+ if n.op not in ("call_module", "get_attr"):
57
+ continue
58
+
59
+ target = n.target
60
+ assert isinstance(target, str)
61
+ target_name_parts = target.split(".")
62
+ curr = submodule
63
+ orig_gm = gm
64
+
65
+ for name in target_name_parts[:-1]:
66
+ if not hasattr(curr, name):
67
+ # pyrefly: ignore [missing-attribute]
68
+ curr.add_module(name, HolderModule({}))
69
+
70
+ curr = getattr(curr, name)
71
+ orig_gm = getattr(orig_gm, name)
72
+
73
+ leaf_node_name = target_name_parts[-1]
74
+ leaf_node = getattr(orig_gm, leaf_node_name)
75
+
76
+ orig_to_split_fqn_mapping[target] = f"{comp_name}.{target}"
77
+ # Relies on custom __setattr__ magic.
78
+ setattr(curr, leaf_node_name, leaf_node)
79
+
80
+ return GraphModule(submodule, subgraph, class_name), orig_to_split_fqn_mapping
81
+
82
+
83
+ @compatibility(is_backward_compatible=False)
84
+ def compare_graphs(left: Graph, right: Graph) -> bool:
85
+ """
86
+ Return True if two graphs are identical, i.e they
87
+ - have the same number of outputs in the same order
88
+ - have the same number of inputs in the same order
89
+ - have the same set of nodes, and identical connectivity
90
+ """
91
+
92
+ matcher = SubgraphMatcher(left, match_output=True, match_placeholder=True)
93
+ matches = matcher.match(right)
94
+
95
+ return len(matches) > 0
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/fx/passes/utils/fuser_utils.py ADDED
@@ -0,0 +1,294 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ import copy
2
+ from queue import SimpleQueue
3
+ from typing import Optional as _Optional
4
+
5
+ import torch.fx
6
+ from torch.fx._compatibility import compatibility
7
+ from torch.fx.graph import Graph
8
+ from torch.fx.graph_module import GraphModule
9
+ from torch.fx.node import Node
10
+ from torch.fx.passes.tools_common import ( # noqa: F401
11
+ legalize_graph,
12
+ NodeList,
13
+ NodeSet,
14
+ stable_topological_sort,
15
+ )
16
+ from torch.fx.passes.utils import lift_subgraph_as_module # type: ignore[attr-defined]
17
+
18
+
19
+ @compatibility(is_backward_compatible=False)
20
+ def topo_sort(nodes: NodeList) -> NodeList:
21
+ # sort nodes according to the topological order
22
+ indegree_map = dict.fromkeys(nodes, 0)
23
+ candidates: SimpleQueue[Node] = SimpleQueue()
24
+
25
+ for node in nodes:
26
+ for n in node.all_input_nodes:
27
+ if n in indegree_map:
28
+ indegree_map[node] += 1
29
+ if indegree_map[node] == 0:
30
+ candidates.put(node)
31
+
32
+ sorted_nodes: NodeList = []
33
+ while not candidates.empty():
34
+ node = candidates.get()
35
+ sorted_nodes.append(node)
36
+
37
+ for n in node.users:
38
+ if n in indegree_map:
39
+ indegree_map[n] -= 1
40
+ if indegree_map[n] == 0:
41
+ candidates.put(n)
42
+
43
+ assert len(nodes) == len(sorted_nodes), (
44
+ "topological sorted nodes doesn't have same length as input nodes"
45
+ )
46
+
47
+ return sorted_nodes
48
+
49
+
50
+ @compatibility(is_backward_compatible=False)
51
+ def validate_partition(partition: NodeList) -> bool:
52
+ # verify the partition doesn't form a dependency cycle in the original graph
53
+ # returns True for valid partition, False for invalid
54
+
55
+ partition_set = set(partition)
56
+
57
+ outputs: NodeList = []
58
+ for node in partition_set:
59
+ for user_node in node.users:
60
+ if user_node not in partition_set:
61
+ # external user node, need to expose as an output
62
+ outputs.append(user_node)
63
+
64
+ # Perform BFS on the partition outputs.
65
+ # If it reaches a node within the partition, then it found a cycle.
66
+ # This function takes the ownership of `root_nodes` and may modify it.
67
+ def bfs_find_cycle(root_nodes: NodeList) -> bool:
68
+ # Set used to exclude nodes that have already been visited.
69
+ # If a node has been visited, that node and all its children have
70
+ # been checked for cycles.
71
+ visited: NodeSet = set()
72
+
73
+ # Start with `root_nodes` and traverse through (toward child nodes)
74
+ # their connected sub-graph. Nodes in `visited` won't be added
75
+ # to `queue` again.
76
+ queue: NodeList = root_nodes
77
+ while queue:
78
+ current = queue.pop()
79
+ visited.add(current)
80
+ if current in partition_set:
81
+ # Started from partition's `output` nodes, and reached
82
+ # another node in partition. Cycle!
83
+ return True
84
+ for user_node in current.users:
85
+ if user_node in visited:
86
+ continue
87
+ queue.append(user_node)
88
+ # `root_nodes` don't cause cycle.
89
+ return False
90
+
91
+ # Use all output nodes as roots to traverse
92
+ # the graph to check cycles.
93
+ if bfs_find_cycle(outputs):
94
+ return False
95
+
96
+ return True
97
+
98
+
99
+ @compatibility(is_backward_compatible=False)
100
+ def fuse_as_graphmodule(
101
+ gm: GraphModule,
102
+ nodes: NodeList,
103
+ module_name: str,
104
+ partition_lookup_table: _Optional[dict[Node, _Optional[int]]] = None,
105
+ *,
106
+ always_return_tuple: bool = False,
107
+ ) -> tuple[GraphModule, tuple[Node, ...], tuple[Node, ...]]:
108
+ """
109
+ Fuse nodes in graph_module into a GraphModule.
110
+
111
+ Args:
112
+ gm (GraphModule): target graph_module
113
+
114
+ nodes (List[Node]): list of nodes in `gm` to fuse, where the node must be topologically sorted
115
+
116
+ module_name: class name for the fused GraphModule
117
+
118
+ partition_lookup_table (Optional[Dict[Node, None]]): optional dict of nodes to speed up lookup
119
+
120
+ always_return_tuple (bool): whether to always return a tuple, even if there is only one output
121
+
122
+ Returns:
123
+ fused_gm (GraphModule): fused graph module, where its node is a copy of `nodes` in `gm`
124
+
125
+ original_inputs (Tuple[Node, ...]): input nodes to `nodes` in original `gm`
126
+
127
+ original_outputs (Tuple[Node, ...]): consumer nodes of `nodes` in original `gm`
128
+
129
+ """
130
+
131
+ # assumption: nodes are already sorted in topo order
132
+
133
+ for node in nodes:
134
+ assert node.graph.owning_module is gm, (
135
+ f"{node} doesn't belong to passed in graph module {gm._get_name()}"
136
+ )
137
+ assert not node._erased, f"{node} has been removed from owning graph"
138
+ assert node in gm.graph._find_nodes_lookup_table, (
139
+ f"{node} is not found in graph module {gm._get_name()}"
140
+ )
141
+
142
+ # validates partition doesn't introduce dependency circles in the graph
143
+ assert validate_partition(nodes), "Invalid partition, found dependency cycles"
144
+
145
+ # if no dict of partition nodes is provided, reconstruct it by nodes list to reduce lookup time
146
+ if partition_lookup_table is None:
147
+ partition_lookup_table = dict.fromkeys(nodes)
148
+
149
+ subgraph = Graph()
150
+
151
+ node_to_placeholder: dict[
152
+ Node, Node
153
+ ] = {} # mapping of nodes from old graph to placeholder in new graph
154
+ node_map: dict[Node, Node] = {} # mapping of nodes from old graph to new graph
155
+
156
+ # handles inputs through graph.node_copy's arg_transform functions
157
+ def remap_inputs(x: Node) -> Node:
158
+ if x.op == "get_attr":
159
+ # TODO: do we really need copy the get_attr node into the graph?
160
+ # do something here
161
+ pass
162
+
163
+ if x in partition_lookup_table:
164
+ # x is inside subgraph, return the copied node
165
+ # the node should have been copied already, as we are copying graph in the topological order
166
+ return node_map[x]
167
+
168
+ if x not in node_to_placeholder:
169
+ # x is not in subgraph, create a new placeholder for subgraph
170
+ placeholder_node = subgraph.placeholder(x.name, type_expr=x.type)
171
+ # copy all meta fields, even if some fields might be irrelevant for the placeholder node
172
+ placeholder_node.meta = copy.copy(x.meta)
173
+ node_to_placeholder[x] = placeholder_node
174
+
175
+ return node_to_placeholder[x]
176
+
177
+ # copy nodes in topological order
178
+ for node in nodes:
179
+ new_node = subgraph.node_copy(node, remap_inputs)
180
+ node_map[node] = new_node
181
+
182
+ # handles outputs
183
+ output_mapping: dict[Node, Node] = {} # mapping from old output to new outputs
184
+
185
+ for node in nodes:
186
+ for user_node in node.users:
187
+ if user_node not in partition_lookup_table:
188
+ # external user node, need to expose as an output
189
+ output_mapping[node] = node_map[node]
190
+
191
+ # outs contain nodes in the new subgraph
192
+ outs = tuple(output_mapping.values())
193
+
194
+ if always_return_tuple:
195
+ # always return a tuple, even if there is only one output
196
+ subgraph.output(outs)
197
+ else:
198
+ # If there's a single output then return it directly, otherwise return a tuple.
199
+ subgraph.output(outs[0] if len(outs) == 1 else outs)
200
+
201
+ # lint to ensure correctness
202
+ subgraph.lint() # type: ignore[no-untyped-call]
203
+ fused_gm: GraphModule
204
+ fused_gm, _ = lift_subgraph_as_module(
205
+ gm, subgraph, comp_name="", class_name=module_name
206
+ )
207
+
208
+ # sub_gm's input nodes in the original module
209
+ original_inputs: tuple[Node, ...] = tuple(node_to_placeholder.keys())
210
+
211
+ # sub_gm's outputs node in the original module
212
+ original_outputs: tuple[Node, ...] = tuple(output_mapping.keys())
213
+
214
+ return fused_gm, original_inputs, original_outputs
215
+
216
+
217
+ @compatibility(is_backward_compatible=False)
218
+ def insert_subgm(
219
+ gm: GraphModule,
220
+ sub_gm: GraphModule,
221
+ orig_inputs: tuple[Node, ...],
222
+ orig_outputs: tuple[Node, ...],
223
+ ) -> GraphModule:
224
+ # add sub_gm into gm
225
+ submodule_name = sub_gm.__class__.__name__
226
+ gm.add_submodule(submodule_name, sub_gm)
227
+
228
+ def last_node(target_nodes: tuple[Node, ...]) -> Node | None:
229
+ for node in reversed(gm.graph.nodes):
230
+ if node in target_nodes:
231
+ return node
232
+ return None
233
+
234
+ last_output_node: Node | None = last_node(orig_outputs)
235
+ assert last_output_node is not None
236
+
237
+ # Create a call_module node in main graph.
238
+ with gm.graph.inserting_after(last_output_node):
239
+ module_node = gm.graph.call_module(
240
+ submodule_name, args=orig_inputs, kwargs=None
241
+ )
242
+ output_node = sub_gm.graph.output_node()
243
+
244
+ next_node = module_node.next
245
+ with gm.graph.inserting_before(next_node):
246
+ if len(orig_outputs) == 1 and not isinstance(output_node.args[0], tuple):
247
+ # main_remapping[comp.orig_outputs[0]] = module_node
248
+ orig_outputs[0].replace_all_uses_with(module_node, propagate_meta=True)
249
+ else:
250
+ for i, orig_output in enumerate(orig_outputs):
251
+ # Use Proxy to record getitem access.
252
+ proxy_out = torch.fx.Proxy(module_node)[i].node # type: ignore[index]
253
+ orig_output.replace_all_uses_with(proxy_out, propagate_meta=True)
254
+
255
+ module_node.meta["val"] = tuple(
256
+ orig_output.meta.get("val", None) for orig_output in orig_outputs
257
+ )
258
+ return gm
259
+
260
+
261
+ @compatibility(is_backward_compatible=False)
262
+ def erase_nodes(gm: GraphModule, nodes: NodeList) -> None:
263
+ # erase original nodes in inversed topological order
264
+ for node in reversed(nodes):
265
+ gm.graph.erase_node(node)
266
+
267
+
268
+ @compatibility(is_backward_compatible=False)
269
+ def fuse_by_partitions(
270
+ gm: GraphModule,
271
+ partitions: list[dict[Node, _Optional[int]]],
272
+ prefix: str = "fused_",
273
+ always_return_tuple: bool = False,
274
+ ) -> GraphModule:
275
+ for partition_id, partition in enumerate(partitions):
276
+ sorted_nodes = topo_sort(list(partition))
277
+
278
+ submodule_name = prefix + str(partition_id)
279
+ sub_gm, orig_inputs, orig_outputs = fuse_as_graphmodule(
280
+ gm,
281
+ sorted_nodes,
282
+ submodule_name,
283
+ partition,
284
+ always_return_tuple=always_return_tuple,
285
+ )
286
+
287
+ insert_subgm(gm, sub_gm, orig_inputs, orig_outputs)
288
+
289
+ erase_nodes(gm, sorted_nodes)
290
+
291
+ stable_topological_sort(gm)
292
+ gm.graph.lint()
293
+
294
+ return gm
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/fx/passes/utils/matcher_utils.py ADDED
@@ -0,0 +1,447 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ # mypy: allow-untyped-defs
2
+ import copy
3
+ import logging
4
+ import os
5
+ from collections import defaultdict
6
+ from dataclasses import dataclass, field
7
+ from typing import Any, Union
8
+
9
+ import torch
10
+ from torch.fx import Graph, Node
11
+ from torch.fx._compatibility import compatibility
12
+
13
+
14
+ __all__ = ["SubgraphMatcher", "InternalMatch"]
15
+
16
+
17
+ # Set`PYTORCH_MATCHER_LOGLEVEL=INFO` to see debug logs
18
+ def _init_logger():
19
+ logger = logging.getLogger(__name__)
20
+
21
+ level = os.environ.get("PYTORCH_MATCHER_LOGLEVEL", "WARNING").upper()
22
+ logger.setLevel(level)
23
+ console = logging.StreamHandler()
24
+ formatter = logging.Formatter("%(filename)s > %(message)s")
25
+ console.setFormatter(formatter)
26
+ console.setLevel(level)
27
+ # add the handlers to the logger
28
+ logger.addHandler(console)
29
+ logger.propagate = False
30
+ return logger
31
+
32
+
33
+ logger = _init_logger()
34
+
35
+
36
+ @compatibility(is_backward_compatible=False)
37
+ @dataclass
38
+ class InternalMatch:
39
+ # Nodes from which the match was found
40
+ anchors: list[Node]
41
+ # Maps nodes in the pattern subgraph to nodes in the larger graph
42
+ nodes_map: dict[Node, Node] = field(default_factory=dict)
43
+
44
+ # nodes in target graph that are matched placeholder in pattern
45
+ placeholder_nodes: list[Node] = field(default_factory=list)
46
+
47
+ # nodes in matched subgraph returned by output
48
+ returning_nodes: list[Node] = field(default_factory=list)
49
+
50
+ # map from a string name to a node in the target graph
51
+ # only available if the matcher is `SubgraphMatcherWithNameNodesMap`
52
+ name_node_map: dict[str, Node] = field(default_factory=dict)
53
+
54
+ def __copy__(self):
55
+ return InternalMatch(
56
+ anchors=self.anchors,
57
+ nodes_map=self.nodes_map.copy(),
58
+ placeholder_nodes=self.placeholder_nodes.copy(),
59
+ returning_nodes=self.returning_nodes.copy(),
60
+ )
61
+
62
+
63
+ @compatibility(is_backward_compatible=False)
64
+ class SubgraphMatcher:
65
+ def __init__(
66
+ self,
67
+ pattern: Graph,
68
+ match_output: bool = False,
69
+ match_placeholder: bool = False,
70
+ remove_overlapping_matches: bool = True,
71
+ ignore_literals: bool = False,
72
+ ) -> None:
73
+ """
74
+ Args:
75
+ pattern: the targeted matching pattern, represented in fx.Graph.
76
+ match_output: If True, output node in the pattern graph will be treated as a part of the targeted pattern.
77
+ If False, output node is ignored during match.
78
+ match_placeholder: If True, placeholder node in the pattern graph will be treated as a part of
79
+ the targeted pattern. If False, placeholder nodes will be used a wildcard.
80
+ remove_overlapping_matches: If True, in the case of overlapping matches, only the first match
81
+ will be returned.
82
+ ignore_literals: If True, will not check if literals are equal and
83
+ will instead treat them as wildcards.
84
+ """
85
+
86
+ self.pattern = pattern
87
+ self.match_output = match_output
88
+ self.match_placeholder = match_placeholder
89
+ self.remove_overlapping_matches = remove_overlapping_matches
90
+ self.ignore_literals = ignore_literals
91
+
92
+ if len(pattern.nodes) == 0:
93
+ raise ValueError(
94
+ "SubgraphMatcher cannot be initialized with an empty pattern"
95
+ )
96
+
97
+ for node in pattern.nodes:
98
+ if node.op != "output" and not node.is_impure():
99
+ assert len(node.users) > 0, (
100
+ "SubgraphMatcher cannot be initialized with an pattern with dead code"
101
+ )
102
+
103
+ # TODO: assert pattern is a connected graph
104
+
105
+ self.pattern_placeholder_nodes = [
106
+ n for n in pattern.nodes if n.op == "placeholder"
107
+ ]
108
+ output_node = next(iter(reversed(pattern.nodes)))
109
+ # nodes returned by outputs
110
+ self.pattern_returning_nodes: list[Node] = output_node.all_input_nodes
111
+
112
+ self.pattern_anchors: list[Node] = []
113
+ if match_output:
114
+ self.pattern_anchors = [output_node]
115
+ else:
116
+ # If a node has output_node as the ONLY user, then this node is a graph sink,
117
+ # and should be matched against as an anchor
118
+ self.pattern_anchors = [
119
+ n for n in output_node.all_input_nodes if len(n.users) == 1
120
+ ]
121
+
122
+ def _match_attributes(self, pn: Node, gn: Node) -> bool:
123
+ # Attributes matching is complicated. Right now we only support matching constant tensor
124
+ assert isinstance(pn.target, str), f"pn.target {pn.target} must be a string."
125
+ assert isinstance(gn.target, str), f"gn.target {gn.target} must be a string."
126
+
127
+ pn_value = torch.fx.graph_module._get_attr(pn.graph.owning_module, pn.target)
128
+ gn_value = torch.fx.graph_module._get_attr(gn.graph.owning_module, gn.target)
129
+
130
+ if type(pn_value) is not type(gn_value):
131
+ return False
132
+
133
+ # Don't require exact match on tensor values.
134
+ if isinstance(pn_value, torch.Tensor):
135
+ return isinstance(gn_value, torch.Tensor)
136
+ else:
137
+ raise RuntimeError(f"Unsupported type {pn_value} when matching attributes")
138
+ return False
139
+
140
+ def _nodes_are_equal(self, pn: Node, gn: Node, node_name_match: str = "") -> bool:
141
+ # if exact match for placeholder is not required, then use placeholder as a wildcard
142
+ if not self.match_placeholder and pn.op == "placeholder":
143
+ return True
144
+
145
+ if node_name_match and node_name_match in gn.name:
146
+ return True
147
+
148
+ if pn.op == gn.op:
149
+ if pn.op == "placeholder" or pn.op == "output":
150
+ return True
151
+ elif pn.op == "get_attr":
152
+ return self._match_attributes(pn, gn)
153
+ return pn.target == gn.target
154
+ return False
155
+
156
+ def _is_contained(self, nodes_map: dict[Node, Node]) -> bool:
157
+ # `lookup` represents all the nodes in `original_graph`
158
+ # that are part of `pattern`
159
+
160
+ # Placeholders can be used by other nodes in the graphs
161
+ lookup: dict[Node, Node] = {
162
+ gn: pn for pn, gn in nodes_map.items() if pn.op != "placeholder"
163
+ }
164
+
165
+ for gn, pn in lookup.items():
166
+ # nodes returned by output are allowed to be used in other areas of the graph
167
+ if pn in self.pattern_returning_nodes:
168
+ continue
169
+
170
+ for user in gn.users:
171
+ # If this node has users that were not in `lookup`, then it must leak out of the
172
+ # pattern subgraph
173
+ if user not in lookup:
174
+ return False
175
+ return True
176
+
177
+ def _remove_overlapping_matches(
178
+ self, matches: list[InternalMatch]
179
+ ) -> list[InternalMatch]:
180
+ non_overlapping_matches: list[InternalMatch] = []
181
+ nodes_matched: set[Node] = set()
182
+
183
+ for match in matches:
184
+ found_overlap = False
185
+ for pn, gn in match.nodes_map.items():
186
+ if pn.op not in {"placeholder", "output"} and gn in nodes_matched:
187
+ found_overlap = True
188
+ break
189
+
190
+ if not found_overlap:
191
+ non_overlapping_matches.append(match)
192
+ for pn, gn in match.nodes_map.items():
193
+ if pn.op not in {"placeholder", "output"}:
194
+ nodes_matched.add(gn)
195
+ return non_overlapping_matches
196
+
197
+ def _match_literals(self, pn: Any, gn: Any, match: InternalMatch) -> bool:
198
+ assert not (isinstance(pn, Node) and isinstance(gn, Node)), (
199
+ "pn and gn cannot both be Node"
200
+ )
201
+
202
+ if isinstance(pn, Node) and not isinstance(gn, Node):
203
+ if pn.op == "placeholder":
204
+ # Check if we've already matched these nodes in the current
205
+ # traversal
206
+ if pn in match.nodes_map:
207
+ return match.nodes_map[pn] == gn
208
+
209
+ match.nodes_map[pn] = gn
210
+ return True
211
+ else:
212
+ return False
213
+ elif not isinstance(pn, Node) and isinstance(gn, Node):
214
+ return False
215
+ else:
216
+ return type(gn) is type(pn) and gn == pn
217
+
218
+ def _match_nodes(
219
+ self, pn: Node, gn: Node, match: InternalMatch, node_name_match: str = ""
220
+ ) -> bool:
221
+ logger.info(" matching %s to %s", pn, gn)
222
+
223
+ assert isinstance(pn, Node) and isinstance(gn, Node), str(
224
+ f"pn and gn must be Node, pn: {pn}, gn: {gn}"
225
+ )
226
+
227
+ # Check if we've already matched these nodes in the current
228
+ # traversal
229
+ if pn in match.nodes_map:
230
+ return match.nodes_map[pn] == gn
231
+
232
+ # TODO: use a more efficient way to check if gn is matched before: two-way dict
233
+ if gn in match.nodes_map.values():
234
+ return False
235
+
236
+ if not self._nodes_are_equal(pn, gn, node_name_match):
237
+ return False
238
+
239
+ # Optimistically mark `pn` as a match for `gn`, and save a local copy of match
240
+ saved_match = copy.copy(match)
241
+ match.nodes_map[pn] = gn
242
+
243
+ # Placeholder is a wildcard and can be matched with any python object
244
+ # (including list/tuple)
245
+ if pn.op == "placeholder":
246
+ return True
247
+
248
+ # Recursively traverse upwards to check if `pn` is a true
249
+ # match for `gn`
250
+ match_found = True
251
+
252
+ def _match_args(args1: Union[list, tuple], args2: Union[list, tuple]) -> bool:
253
+ if len(args1) != len(args2):
254
+ return False
255
+
256
+ for a1, a2 in zip(args1, args2):
257
+ if isinstance(a1, Node) and isinstance(a2, Node):
258
+ matched = self._match_nodes(a1, a2, match)
259
+ elif isinstance(a1, (list, tuple)) and isinstance(a2, (list, tuple)):
260
+ matched = _match_args(a1, a2)
261
+ else:
262
+ matched = (
263
+ self._match_literals(a1, a2, match) or self.ignore_literals
264
+ )
265
+
266
+ if not matched:
267
+ return False
268
+
269
+ return True
270
+
271
+ # Flatten all args/kwargs into 1 list of args
272
+ pn_args, gn_args = None, None
273
+ if (
274
+ (
275
+ len(pn.args) != len(gn.args)
276
+ or list(pn.kwargs.keys()) != list(gn.kwargs.keys())
277
+ )
278
+ and pn.op == "call_function"
279
+ and isinstance(pn.target, torch._ops.OpOverload)
280
+ ):
281
+ args_schema = pn.target._schema.arguments
282
+
283
+ def get_all_arguments(orig_args, orig_kwargs):
284
+ all_args = []
285
+ for i, schema in enumerate(args_schema):
286
+ if schema.name in orig_kwargs:
287
+ all_args.append(orig_kwargs[schema.name])
288
+ elif not schema.kwarg_only and i < len(orig_args):
289
+ all_args.append(orig_args[i])
290
+ else:
291
+ all_args.append(schema.default_value)
292
+ return all_args
293
+
294
+ pn_args = get_all_arguments(pn.args, pn.kwargs)
295
+ gn_args = get_all_arguments(gn.args, gn.kwargs)
296
+
297
+ elif len(pn.args) == len(gn.args) and list(pn.kwargs.keys()) == list(
298
+ gn.kwargs.keys()
299
+ ):
300
+ pn_args = list(pn.args)
301
+ gn_args = list(gn.args)
302
+ pn_args.extend(list(pn.kwargs.values()))
303
+ gn_args.extend(list(gn.kwargs.values()))
304
+ else:
305
+ match_found = False
306
+
307
+ match_found = (
308
+ match_found
309
+ and pn_args is not None
310
+ and gn_args is not None
311
+ and _match_args(pn_args, gn_args)
312
+ )
313
+
314
+ if not match_found:
315
+ # revert to saved_match before matching with current node
316
+ match = copy.copy(saved_match)
317
+ return False
318
+
319
+ return True
320
+
321
+ def match(self, graph: Graph, node_name_match: str = "") -> list[InternalMatch]:
322
+ """
323
+ Returns:
324
+ The matched subgraphs.
325
+ The returned subgraph would be fully self-contained, meaning the nodes (except placeholder
326
+ and nodes returned by output) can only be consumed by nodes within the matched subgraph.
327
+
328
+ Subgraph pattern matcher is implemented with the backtracking style in the following steps:
329
+
330
+ 1. We first identify all the anchor nodes in the pattern graph. The anchor nodes
331
+ are the "sinks" (nodes with no user other than the output node) of the pattern graph.
332
+ One pattern graph could have multiple anchors if it has multiple return values.
333
+
334
+ 2. In the target graph, we identify the potential candidate nodes that can be matched
335
+ with each anchor. These anchor-candidate pairs are the starting points for
336
+ pairwise per-node matching.
337
+
338
+ 3. For each anchor-candidate pair, we simultaneously traverse backwards (DFS) in both
339
+ pattern and target graphs. For every pattern nodes along traversal path, we compare it
340
+ against the target nodes. In case any comparison failed, the match for this anchor-candidate
341
+ pair fails. A match is found when DFS completes traversing the graph. See `self._match_nodes`
342
+ for more details.
343
+
344
+ 4. In the case of multiple anchors, every anchor will need to find a match using step 3.
345
+ In addition, the matches found between anchors need to have a common intersection node
346
+ in order for the match to be valid. This is implemented with backtracking. See `backtracking`
347
+ for more details.
348
+
349
+ Notice: graph traversal must be done in the reverser order because a tensor can have multiple
350
+ consumers, but can only have a single producer. Only with reverser order, we can we jointly
351
+ traverse the pattern and target graph in a deterministic path.
352
+
353
+ Warning: In theory, this backtracking algorithm have an **exponential** time complexity. However,
354
+ in practice, it's unlikely to blow up.
355
+
356
+ """
357
+ from torch.fx.passes.utils.fuser_utils import validate_partition
358
+
359
+ # find candidate nodes to match with pattern anchors
360
+ match_candidates: dict[Node, list[Node]] = defaultdict(list)
361
+ for pattern_anchor in self.pattern_anchors:
362
+ for node in graph.nodes:
363
+ if self._nodes_are_equal(pattern_anchor, node, node_name_match):
364
+ match_candidates[pattern_anchor].append(node)
365
+ match_candidates_list = list(match_candidates.items())
366
+
367
+ logger.info("Initial match_candidates_list: %s\n", match_candidates_list)
368
+
369
+ matches: list[InternalMatch] = []
370
+
371
+ def backtracking(anchor_index, match):
372
+ if anchor_index == len(match_candidates_list):
373
+ match.placeholder_nodes = [
374
+ match.nodes_map[pn] for pn in self.pattern_placeholder_nodes
375
+ ]
376
+ match.returning_nodes = [
377
+ match.nodes_map[pn] for pn in self.pattern_returning_nodes
378
+ ]
379
+ matches.append(match)
380
+
381
+ logger.info("Found a match: %s\n", match)
382
+ return
383
+
384
+ pattern_anchor, candidate_nodes = match_candidates_list[anchor_index]
385
+ saved_match = copy.copy(match)
386
+
387
+ for node in candidate_nodes:
388
+ logger.info("Trying to match anchor %s to %s", pattern_anchor, node)
389
+
390
+ match_found = self._match_nodes(
391
+ pattern_anchor, node, match, node_name_match
392
+ )
393
+ if match_found:
394
+ # match next anchor
395
+ backtracking(anchor_index + 1, match)
396
+ else:
397
+ logger.info(
398
+ "Failed to match anchor %s to %s\n", pattern_anchor, node
399
+ )
400
+
401
+ # revert to saved_match before matching with current anchor
402
+ match = copy.copy(saved_match)
403
+
404
+ match = InternalMatch(anchors=self.pattern_anchors)
405
+ if match_candidates_list:
406
+ backtracking(0, match)
407
+
408
+ # filter out the matches where the subgraph is not fully_contained
409
+ before = len(matches)
410
+ matches = [match for match in matches if self._is_contained(match.nodes_map)]
411
+ after = len(matches)
412
+ if before != after:
413
+ logger.info(
414
+ "Filtered out %s matches because they are not fully contained",
415
+ before - after,
416
+ )
417
+
418
+ # filter out the matches that form a cycle if the subgraph is fused
419
+ valid_matches = []
420
+ for match in matches:
421
+ matched_compute_nodes = [
422
+ gn
423
+ for pn, gn in match.nodes_map.items()
424
+ if pn.op not in {"placeholder", "output"}
425
+ ]
426
+ if validate_partition(matched_compute_nodes):
427
+ valid_matches.append(match)
428
+ if len(valid_matches) != len(matches):
429
+ logger.info(
430
+ "Filtered out %s matches because \
431
+ matched subgraph would form a cycle if fused",
432
+ len(matches) - len(valid_matches),
433
+ )
434
+
435
+ if self.remove_overlapping_matches:
436
+ before = len(valid_matches)
437
+ matches = self._remove_overlapping_matches(valid_matches)
438
+ after = len(matches)
439
+ if before != after:
440
+ logger.info(
441
+ "Filtered out %s matches because matched subgraphs are overlapping",
442
+ before - after,
443
+ )
444
+
445
+ logger.info("Matches returned: %s", matches)
446
+
447
+ return matches
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/fx/passes/utils/matcher_with_name_node_map_utils.py ADDED
@@ -0,0 +1,114 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ from torch.fx import Graph, GraphModule, Node
2
+ from torch.fx._compatibility import compatibility
3
+
4
+ from .matcher_utils import InternalMatch, SubgraphMatcher
5
+
6
+
7
+ __all__ = ["SubgraphMatcherWithNameNodeMap"]
8
+
9
+
10
+ def _split_to_graph_and_name_node_map(
11
+ gm: GraphModule,
12
+ ) -> tuple[GraphModule, dict[str, Node]]:
13
+ from torch.fx.graph import _PyTreeInfo
14
+ from torch.utils._pytree import tree_flatten, tree_unflatten
15
+
16
+ name_node_map = {}
17
+ for n in gm.graph.nodes:
18
+ if n.op == "output":
19
+ assert gm._out_spec is not None
20
+ output = tree_unflatten(n.args[0], gm._out_spec)
21
+ assert isinstance(output, tuple), (
22
+ "Expecting the pattern graph to return a tuple"
23
+ )
24
+ assert len(output) >= 2, (
25
+ "Expecting the pattern graph to have at least two outputs"
26
+ )
27
+ *out, name_node_map = output
28
+ flattened, out_spec = tree_flatten(out)
29
+ assert isinstance(name_node_map, dict), (
30
+ "Expecting the input graph to have a dict output as the last element"
31
+ )
32
+ n.args = (flattened,)
33
+ orig_pytree_info = gm._graph._codegen.pytree_info # type: ignore[attr-defined]
34
+ gm._graph._codegen.pytree_info = _PyTreeInfo( # type: ignore[attr-defined]
35
+ orig_pytree_info.orig_args, orig_pytree_info.in_spec, out_spec
36
+ )
37
+ gm.recompile()
38
+ return gm, name_node_map
39
+
40
+
41
+ @compatibility(is_backward_compatible=False)
42
+ class SubgraphMatcherWithNameNodeMap(SubgraphMatcher):
43
+ """Extends SubgraphMatcher to support querying the matched subgraph nodes through node name,
44
+ this requires pattern to have specific format (returning and additional dictionary at the output,
45
+ that has node name as key, and the node in the pattern graph as value, see Example for more details)
46
+
47
+ Difference with SubgraphMatcher is that it takes a `pattern_gm` GraphModule as input during
48
+ initialization since we need to modify the graph (which requires `recompile` the GraphModule)
49
+
50
+ Example::
51
+ def pattern(x, weight):
52
+ conv = F.conv2d(x, weight)
53
+ relu = F.relu(conv)
54
+ return relu, {"conv": conv, "relu": relu}
55
+
56
+
57
+ def target_graph(x, weight):
58
+ conv = F.conv2d(x, weight)
59
+ relu = F.relu(conv)
60
+ relu *= 2
61
+ return relu
62
+
63
+
64
+ pattern_gm = export_for_training(pattern, example_inputs).module()
65
+ target_gm = export_for_training(target_graph, example_inputs).module()
66
+ matcher = SubgraphMatcherWithNameNodeMap(pattern_gm)
67
+ matches = matcher.match(target_gm)
68
+ for match in matches:
69
+ match.name_node_map["conv"].meta["annotation"] = ...
70
+
71
+ """
72
+
73
+ def __init__(
74
+ self,
75
+ pattern_gm: GraphModule,
76
+ match_output: bool = False,
77
+ match_placeholder: bool = False,
78
+ remove_overlapping_matches: bool = True,
79
+ ignore_literals: bool = False,
80
+ ) -> None:
81
+ pattern_gm, name_node_map = _split_to_graph_and_name_node_map(pattern_gm)
82
+ self.name_node_map = name_node_map
83
+ super().__init__(
84
+ pattern_gm.graph,
85
+ match_output,
86
+ match_placeholder,
87
+ remove_overlapping_matches,
88
+ ignore_literals,
89
+ )
90
+
91
+ def match(self, graph: Graph, node_name_match: str = "") -> list[InternalMatch]:
92
+ """The returned InternalMatch will have name_node_map populated with a map
93
+ from node name (str) to the target node, e.g.
94
+ {"conv": target_conv_ndoe, "relu": target_relu_node}
95
+
96
+ this requires the pattern graph returns an additional
97
+ output of node name to node, e.g. instead of:
98
+ ```
99
+ def pattern(...):
100
+ ...
101
+ return relu
102
+ ```
103
+ we should do:
104
+ ```
105
+ def pattern(...):
106
+ ...
107
+ return relu, {"conv": conv, "relu": relu}
108
+ ``` instead
109
+ """
110
+ internal_matches = super().match(graph, node_name_match)
111
+ for internal_match in internal_matches:
112
+ for k, n in self.name_node_map.items():
113
+ internal_match.name_node_map[k] = internal_match.nodes_map[n]
114
+ return internal_matches
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/fx/passes/utils/source_matcher_utils.py ADDED
@@ -0,0 +1,163 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ import logging
2
+ import os
3
+ from collections.abc import Callable
4
+ from dataclasses import dataclass, field
5
+ from typing import Any, Optional
6
+
7
+ from torch.fx._compatibility import compatibility
8
+ from torch.fx.graph import Graph
9
+ from torch.fx.node import Node
10
+
11
+
12
+ __all__ = ["get_source_partitions", "check_subgraphs_connected", "SourcePartition"]
13
+
14
+
15
+ # Set`PYTORCH_MATCHER_LOGLEVEL=INFO` to see debug logs
16
+ def _init_logger() -> logging.Logger:
17
+ logger = logging.getLogger(__name__)
18
+
19
+ level = os.environ.get("PYTORCH_MATCHER_LOGLEVEL", "WARNING").upper()
20
+ logger.setLevel(level)
21
+ console = logging.StreamHandler()
22
+ formatter = logging.Formatter("%(filename)s > %(message)s")
23
+ console.setFormatter(formatter)
24
+ console.setLevel(level)
25
+ # add the handlers to the logger
26
+ logger.addHandler(console)
27
+ logger.propagate = False
28
+ return logger
29
+
30
+
31
+ logger = _init_logger()
32
+
33
+
34
+ @compatibility(is_backward_compatible=False)
35
+ @dataclass
36
+ class SourcePartition:
37
+ # Nodes in a particular partition
38
+ nodes: list[Node]
39
+
40
+ # The source these nodes decomposed from
41
+ source: Any
42
+
43
+ # Nodes in the graph that are needed as inputs to the partition
44
+ # These do not include the params of the partition
45
+ input_nodes: list[Node] = field(default_factory=list)
46
+
47
+ # Nodes in the partition that are being used by nodes outside of the
48
+ # partition
49
+ output_nodes: list[Node] = field(default_factory=list)
50
+
51
+ # Parameters that are being used
52
+ params: list[Node] = field(default_factory=list)
53
+
54
+
55
+ @compatibility(is_backward_compatible=False) # type: ignore[misc]
56
+ def get_source_partitions(
57
+ graph: Graph,
58
+ wanted_sources: list[Any],
59
+ filter_fn: Optional[Callable[[Node], bool]] = None,
60
+ ) -> dict[Any, list[SourcePartition]]:
61
+ """
62
+ Args:
63
+ graph: The graph we want to partition
64
+ wanted_sources: List of sources of nodes that were decomposed from this
65
+ source. This can be a function (ex. torch.nn.functional.linear) or a
66
+ leaf module type (ex. torch.nn.Linear).
67
+
68
+ Returns:
69
+ Dictionary mapping sources that were given to a list of SourcePartitions
70
+ that correspond to the list of nodes that were decomposed from the given
71
+ source.
72
+ """
73
+ modules: dict[type, dict[str, list[Node]]] = {}
74
+
75
+ for node in graph.nodes:
76
+ # The metadata source_fn should contain a tuple of a unique name for the
77
+ # source, and the source function if the node is decomposed from a
78
+ # function, or the type of module if the node is decomposed from a leaf
79
+ # module
80
+
81
+ # TODO: Bypass "torch_fn" when "source_fn_stack" because now "torch_fn" can
82
+ # be different from "source_fn_stack", for example for the add_ node
83
+ # decomposed from batch norm. We should remove the check on "source_fn_stack"
84
+ # after we fix "torch_fn". T199561090
85
+ if (source_fn_st := node.meta.get("source_fn_stack", None)) is None and (
86
+ torch_fn := node.meta.get("torch_fn", None)
87
+ ) is not None:
88
+ node_fqn, source_fn = torch_fn
89
+ source_fn_name = source_fn.split(".")[1]
90
+ if source_fn_name in wanted_sources:
91
+ diff_modules = modules.setdefault(source_fn_name, {})
92
+ partition = diff_modules.setdefault(node_fqn, [])
93
+ partition.append(node)
94
+
95
+ if (source_fn_st := node.meta.get("source_fn_stack", None)) is not None:
96
+ source_fn = source_fn_st[-1]
97
+ if source_fn[1] in wanted_sources:
98
+ diff_modules = modules.setdefault(source_fn[1], {})
99
+ partition = diff_modules.setdefault(source_fn[0], [])
100
+ partition.append(node)
101
+
102
+ def make_partition(nodes: list[Node], module_type: type) -> SourcePartition:
103
+ input_nodes = set()
104
+ output_nodes = set()
105
+ params = set()
106
+ for node in nodes:
107
+ for arg in node.args:
108
+ if isinstance(arg, Node) and arg not in nodes and arg.op != "get_attr":
109
+ input_nodes.add(arg)
110
+
111
+ if node.op == "get_attr":
112
+ params.add(node)
113
+ # get_attr nodes won't be output nodes
114
+ continue
115
+
116
+ for user in node.users:
117
+ if user not in nodes:
118
+ output_nodes.add(node)
119
+
120
+ return SourcePartition(
121
+ nodes,
122
+ module_type,
123
+ list(input_nodes),
124
+ list(output_nodes),
125
+ list(params), # type: ignore[arg-type]
126
+ )
127
+
128
+ ret: dict[type[Any], list[SourcePartition]] = {}
129
+
130
+ if filter_fn:
131
+ # for each partition, we apply filter_fn to filter out all partitions that doesn't satisfy the
132
+ # filter condition
133
+ filtered_modules = {}
134
+ for tp, name_to_partition in modules.items():
135
+ filtered_name_to_partition = {
136
+ name: partition
137
+ for name, partition in name_to_partition.items()
138
+ if all(map(filter_fn, partition))
139
+ }
140
+ filtered_modules[tp] = filtered_name_to_partition
141
+ modules = filtered_modules
142
+
143
+ for k, v in modules.items():
144
+ ret[k] = [make_partition(partition, k) for partition in v.values()]
145
+
146
+ return ret
147
+
148
+
149
+ @compatibility(is_backward_compatible=False) # type: ignore[misc]
150
+ def check_subgraphs_connected(
151
+ subgraph1: SourcePartition, subgraph2: SourcePartition
152
+ ) -> bool:
153
+ """
154
+ Given two subgraphs A and B (in the form of a list of nodes), checks if
155
+ A has nodes connecting to at least one node in B -- aka there exists a node
156
+ in B that uses a node in A (not the other way around).
157
+ """
158
+
159
+ for node in reversed(subgraph1.nodes):
160
+ for user in node.users:
161
+ if user in subgraph2.nodes:
162
+ return True
163
+ return False
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/ATen.h ADDED
@@ -0,0 +1,42 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+
4
+ #if !defined(_MSC_VER) && __cplusplus < 201703L
5
+ #error C++17 or later compatible compiler is required to use ATen.
6
+ #endif
7
+
8
+ #include <ATen/Context.h>
9
+ #include <ATen/Device.h>
10
+ #include <ATen/DeviceGuard.h>
11
+ #include <ATen/DimVector.h>
12
+ #include <ATen/Dispatch.h>
13
+ #include <ATen/Formatting.h>
14
+ #include <ATen/Functions.h>
15
+ #include <ATen/NamedTensor.h>
16
+ #include <ATen/ScalarOps.h>
17
+ #include <ATen/Tensor.h>
18
+ #include <ATen/TensorGeometry.h>
19
+ #include <ATen/TensorIndexing.h>
20
+ #include <ATen/TensorOperators.h>
21
+ #include <ATen/Version.h>
22
+ #include <ATen/core/ATenGeneral.h>
23
+ #include <ATen/core/Generator.h>
24
+ #include <ATen/core/Reduction.h>
25
+ #include <ATen/core/Scalar.h>
26
+ #include <ATen/core/UnsafeFromTH.h>
27
+ #include <ATen/core/ivalue.h>
28
+ #include <ATen/core/jit_type.h>
29
+ #include <c10/core/Allocator.h>
30
+ #include <c10/core/InferenceMode.h>
31
+ #include <c10/core/Layout.h>
32
+ #include <c10/core/Storage.h>
33
+ #include <c10/core/TensorOptions.h>
34
+ #include <c10/util/Exception.h>
35
+
36
+ // TODO: try to remove this
37
+ // There is some back story, see https://github.com/pytorch/pytorch/issues/48684
38
+ #include <ATen/NativeFunctions.h>
39
+
40
+ #else
41
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
42
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/AccumulateType.h ADDED
@@ -0,0 +1,178 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+ #include <ATen/Config.h>
4
+ #include <c10/core/DeviceType.h>
5
+ #include <c10/core/ScalarType.h>
6
+ #include <c10/util/BFloat16.h>
7
+ #include <c10/util/Float8_e4m3fn.h>
8
+ #include <c10/util/Float8_e4m3fnuz.h>
9
+ #include <c10/util/Float8_e5m2.h>
10
+ #include <c10/util/Float8_e5m2fnuz.h>
11
+ #include <c10/util/Half.h>
12
+
13
+ // Defines the accumulation type for a scalar type.
14
+ // Example:
15
+ // using accscalar_t = acc_type<scalar_t, /*is_cuda*/true>;
16
+ //
17
+ // Accumulation types are an important concept in numeric computing
18
+ // because you frequently want to perform intermediate computations
19
+ // at a higher precision than the input and output precision, to avoid
20
+ // compounding internal rounding errors. Accumulation is the most
21
+ // well-known intermediate computation (it is of great importance for
22
+ // sum reduction and matrix multiply, for example), but in PyTorch
23
+ // acc_type ends up getting used for all sorts of other intermediate
24
+ // computations, so it perhaps would be more accurately (ahem) called an
25
+ // "accurate" type. acc_type is especially important for reduced
26
+ // precision operations like float16 and bfloat16, where relatively
27
+ // benign looking inputs can easily end up overflowing/underflowing.
28
+ //
29
+ // acc_type is parametrized by whether or not you are running on CUDA
30
+ // or not, because on CUDA double precision operations are expensive
31
+ // and so by default, we don't actually want to use double as an
32
+ // acc_type on CUDA. A lot of things are typed out below, but
33
+ // basically, the table is generated by a few rules:
34
+ //
35
+ // If bool:
36
+ // Use 'bool' as acc_type.
37
+ // If floating point:
38
+ // If CUDA, use 'float' as acc_type (unless scalar_t is double),
39
+ // otherwise (CPU) use 'double'
40
+ // If integral:
41
+ // Use 'int64_t' as acc_type
42
+ //
43
+ // You're not forced to use this template; if you happen to know
44
+ // something specific about your use case, you can specify your own
45
+ // desired behavior. This template, however, will give you a reasonable
46
+ // default that will work for all dtypes supported in PyTorch.
47
+
48
+ #if defined(__CUDACC__)
49
+ #include <cuda.h>
50
+ #include <cuda_fp16.h>
51
+ #elif defined(__HIPCC__)
52
+ #include <hip/hip_fp16.h>
53
+ #include <hip/hip_runtime.h>
54
+ #endif
55
+
56
+ namespace at {
57
+
58
+ template <typename T, c10::DeviceType D>
59
+ struct AccumulateTypeDevice {};
60
+
61
+ template <typename T, bool>
62
+ struct AccumulateType {};
63
+
64
+ template <typename T>
65
+ struct AccumulateType<T, false> {
66
+ using type = typename AccumulateTypeDevice<T, c10::DeviceType::CPU>::type;
67
+ };
68
+
69
+ template <typename T>
70
+ struct AccumulateType<T, true> {
71
+ using type = typename AccumulateTypeDevice<T, c10::DeviceType::CUDA>::type;
72
+ };
73
+
74
+ template <typename T, c10::DeviceType device>
75
+ using acc_type_device = typename AccumulateTypeDevice<T, device>::type;
76
+
77
+ template <typename T, bool is_cuda>
78
+ using acc_type = typename AccumulateType<T, is_cuda>::type;
79
+
80
+ #define ACC_TYPE(t, acc_t, device_type) \
81
+ template <> \
82
+ struct AccumulateTypeDevice<t, device_type> { \
83
+ using type = acc_t; \
84
+ };
85
+ #define MPS_ACC_TYPE(t, acc_t) ACC_TYPE(t, acc_t, c10::DeviceType::MPS)
86
+ #define XPU_ACC_TYPE(t, acc_t) ACC_TYPE(t, acc_t, c10::DeviceType::XPU)
87
+ #define CUDA_ACC_TYPE(t, acc_t) ACC_TYPE(t, acc_t, c10::DeviceType::CUDA)
88
+ #define CPU_ACC_TYPE(t, acc_t) ACC_TYPE(t, acc_t, c10::DeviceType::CPU)
89
+
90
+ MPS_ACC_TYPE(BFloat16, float)
91
+ MPS_ACC_TYPE(Half, float)
92
+ MPS_ACC_TYPE(Float8_e5m2, float)
93
+ MPS_ACC_TYPE(Float8_e4m3fn, float)
94
+ MPS_ACC_TYPE(Float8_e5m2fnuz, float)
95
+ MPS_ACC_TYPE(Float8_e4m3fnuz, float)
96
+ MPS_ACC_TYPE(float, float)
97
+ MPS_ACC_TYPE(double, float)
98
+ MPS_ACC_TYPE(int8_t, int64_t)
99
+ MPS_ACC_TYPE(uint8_t, int64_t)
100
+ MPS_ACC_TYPE(char, int64_t)
101
+ MPS_ACC_TYPE(int16_t, int64_t)
102
+ MPS_ACC_TYPE(int32_t, int64_t)
103
+ MPS_ACC_TYPE(int64_t, int64_t)
104
+ MPS_ACC_TYPE(bool, bool)
105
+ MPS_ACC_TYPE(c10::complex<Half>, c10::complex<float>)
106
+ MPS_ACC_TYPE(c10::complex<float>, c10::complex<float>)
107
+ MPS_ACC_TYPE(c10::complex<double>, c10::complex<float>)
108
+
109
+ XPU_ACC_TYPE(BFloat16, float)
110
+ XPU_ACC_TYPE(Half, float)
111
+ XPU_ACC_TYPE(Float8_e5m2, float)
112
+ XPU_ACC_TYPE(Float8_e4m3fn, float)
113
+ XPU_ACC_TYPE(Float8_e5m2fnuz, float)
114
+ XPU_ACC_TYPE(Float8_e4m3fnuz, float)
115
+ XPU_ACC_TYPE(float, float)
116
+ XPU_ACC_TYPE(double, double)
117
+ XPU_ACC_TYPE(int8_t, int64_t)
118
+ XPU_ACC_TYPE(uint8_t, int64_t)
119
+ XPU_ACC_TYPE(char, int64_t)
120
+ XPU_ACC_TYPE(int16_t, int64_t)
121
+ XPU_ACC_TYPE(int32_t, int64_t)
122
+ XPU_ACC_TYPE(int64_t, int64_t)
123
+ XPU_ACC_TYPE(bool, bool)
124
+ XPU_ACC_TYPE(c10::complex<Half>, c10::complex<float>)
125
+ XPU_ACC_TYPE(c10::complex<float>, c10::complex<float>)
126
+ XPU_ACC_TYPE(c10::complex<double>, c10::complex<double>)
127
+
128
+ #if defined(__CUDACC__) || defined(__HIPCC__)
129
+ CUDA_ACC_TYPE(half, float)
130
+ #endif
131
+ CUDA_ACC_TYPE(BFloat16, float)
132
+ CUDA_ACC_TYPE(Half, float)
133
+ CUDA_ACC_TYPE(Float8_e5m2, float)
134
+ CUDA_ACC_TYPE(Float8_e4m3fn, float)
135
+ CUDA_ACC_TYPE(Float8_e5m2fnuz, float)
136
+ CUDA_ACC_TYPE(Float8_e4m3fnuz, float)
137
+ CUDA_ACC_TYPE(float, float)
138
+ CUDA_ACC_TYPE(double, double)
139
+ CUDA_ACC_TYPE(int8_t, int64_t)
140
+ CUDA_ACC_TYPE(uint8_t, int64_t)
141
+ CUDA_ACC_TYPE(char, int64_t)
142
+ CUDA_ACC_TYPE(int16_t, int64_t)
143
+ CUDA_ACC_TYPE(int32_t, int64_t)
144
+ CUDA_ACC_TYPE(int64_t, int64_t)
145
+ CUDA_ACC_TYPE(bool, bool)
146
+ CUDA_ACC_TYPE(c10::complex<Half>, c10::complex<float>)
147
+ CUDA_ACC_TYPE(c10::complex<float>, c10::complex<float>)
148
+ CUDA_ACC_TYPE(c10::complex<double>, c10::complex<double>)
149
+
150
+ CPU_ACC_TYPE(BFloat16, float)
151
+ CPU_ACC_TYPE(Half, float)
152
+ CPU_ACC_TYPE(Float8_e5m2, float)
153
+ CPU_ACC_TYPE(Float8_e4m3fn, float)
154
+ CPU_ACC_TYPE(Float8_e5m2fnuz, float)
155
+ CPU_ACC_TYPE(Float8_e4m3fnuz, float)
156
+ CPU_ACC_TYPE(float, double)
157
+ CPU_ACC_TYPE(double, double)
158
+ CPU_ACC_TYPE(int8_t, int64_t)
159
+ CPU_ACC_TYPE(uint8_t, int64_t)
160
+ CPU_ACC_TYPE(char, int64_t)
161
+ CPU_ACC_TYPE(int16_t, int64_t)
162
+ CPU_ACC_TYPE(int32_t, int64_t)
163
+ CPU_ACC_TYPE(int64_t, int64_t)
164
+ CPU_ACC_TYPE(bool, bool)
165
+ CPU_ACC_TYPE(c10::complex<Half>, c10::complex<float>)
166
+ CPU_ACC_TYPE(c10::complex<float>, c10::complex<double>)
167
+ CPU_ACC_TYPE(c10::complex<double>, c10::complex<double>)
168
+
169
+ TORCH_API c10::ScalarType toAccumulateType(
170
+ c10::ScalarType type,
171
+ c10::DeviceType device);
172
+ TORCH_API c10::ScalarType toAccumulateType(c10::ScalarType type, bool is_cuda);
173
+
174
+ } // namespace at
175
+
176
+ #else
177
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
178
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/ArrayRef.h ADDED
@@ -0,0 +1,7 @@
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+ #include <c10/util/ArrayRef.h>
4
+
5
+ #else
6
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
7
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/Backend.h ADDED
@@ -0,0 +1,7 @@
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+ #include <c10/core/Backend.h>
4
+
5
+ #else
6
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
7
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/Backtrace.h ADDED
@@ -0,0 +1,7 @@
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+ #include <ATen/core/Backtrace.h>
4
+
5
+ #else
6
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
7
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/BlasBackend.h ADDED
@@ -0,0 +1,51 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+
4
+ #include <c10/util/Exception.h>
5
+
6
+ #include <ostream>
7
+ #include <string>
8
+
9
+ namespace at {
10
+
11
+ enum class BlasBackend : int8_t { Default, Cublas, Cublaslt, Ck };
12
+
13
+ inline std::string BlasBackendToString(at::BlasBackend backend) {
14
+ switch (backend) {
15
+ case BlasBackend::Default:
16
+ return "at::BlasBackend::Default";
17
+ case BlasBackend::Cublas:
18
+ return "at::BlasBackend::Cublas";
19
+ case BlasBackend::Cublaslt:
20
+ return "at::BlasBackend::Cublaslt";
21
+ case BlasBackend::Ck:
22
+ return "at::BlasBackend::Ck";
23
+ default:
24
+ TORCH_CHECK(false, "Unknown blas backend");
25
+ }
26
+ }
27
+
28
+ inline std::ostream& operator<<(std::ostream& stream, at::BlasBackend backend) {
29
+ return stream << BlasBackendToString(backend);
30
+ }
31
+
32
+ namespace blas {
33
+
34
+ enum class ScalingType : std::uint8_t {
35
+ TensorWise, // fp32 scales
36
+ RowWise, // fp32 scales
37
+ BlockWise1x16, // fp8_e4m3fn scales
38
+ BlockWise1x32, // fp8_e8m0fnu scales
39
+ BlockWise1x128, // fp32 scales
40
+ BlockWise128x128, // fp32 scales
41
+ };
42
+
43
+ enum class SwizzleType : std::uint8_t { NO_SWIZZLE = 0, SWIZZLE_32_4_4 = 1 };
44
+
45
+ } // namespace blas
46
+
47
+ } // namespace at
48
+
49
+ #else
50
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
51
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CPUApplyUtils.h ADDED
@@ -0,0 +1,356 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+
4
+ #include <ATen/CollapseDims.h>
5
+ #include <ATen/Parallel.h>
6
+ #include <ATen/TensorUtils.h>
7
+ #include <c10/util/irange.h>
8
+ #include <cstring>
9
+ #include <limits>
10
+
11
+ namespace at {
12
+
13
+ /*
14
+ * The basic strategy for apply is as follows:
15
+ *
16
+ * 1. Starting with the outermost index, loop until we reach a dimension where
17
+ * the data is no longer contiguous, i.e. the stride at that dimension is not
18
+ * equal to the size of the tensor defined by the outer dimensions. Let's call
19
+ * this outer (contiguous) tensor A. Note that if the Tensor is contiguous, then
20
+ * A is equal to the entire Tensor. Let's call the inner tensor B.
21
+ *
22
+ * 2. We loop through the indices in B, starting at its outermost dimension. For
23
+ * example, if B is a 2x2 matrix, then we do:
24
+ *
25
+ * B[0][0]
26
+ * B[0][1]
27
+ * B[1][0]
28
+ * B[1][1]
29
+ *
30
+ * We set the offset into the underlying storage as (storageOffset + stride_B *
31
+ * index_B), i.e. basically we compute the offset into the storage as we would
32
+ * normally for a Tensor. But because we are guaranteed the subsequent data is
33
+ * contiguous in memory, we can simply loop for sizeof(A) iterations and perform
34
+ * the operation, without having to follow the order described by the strides of
35
+ * A.
36
+ *
37
+ * 3. As an optimization, we merge dimensions of A that are contiguous in
38
+ * memory. For example, if A is a 3x3x3x3 tensor narrowed from a 3x3x4x3 tensor,
39
+ * then the first two dimensions can be merged for the purposes of APPLY,
40
+ * reducing the number of nested loops.
41
+ */
42
+
43
+ inline Tensor sort_strides(Tensor& tensor_) {
44
+ IntArrayRef strides = tensor_.strides();
45
+ std::vector<int64_t> indices;
46
+ indices.reserve(tensor_.ndimension());
47
+ for (const auto i : c10::irange(tensor_.ndimension())) {
48
+ indices.push_back(i);
49
+ }
50
+ std::sort(indices.begin(), indices.end(), [&strides](int64_t i1, int64_t i2) {
51
+ return strides[i1] > strides[i2];
52
+ });
53
+ Tensor tensor = tensor_.permute(indices);
54
+ return tensor;
55
+ }
56
+
57
+ template <typename T, int N>
58
+ struct strided_tensor_iter_fixed {
59
+ public:
60
+ T* data_ = NULL;
61
+ int64_t dim_ = 0;
62
+
63
+ // NOLINTNEXTLINE(*array*)
64
+ int64_t counter_[N] = {0};
65
+ // NOLINTNEXTLINE(*array*)
66
+ int64_t sizes_[N] = {0};
67
+ // NOLINTNEXTLINE(*array*)
68
+ int64_t strides_[N] = {0};
69
+
70
+ strided_tensor_iter_fixed(strided_tensor_iter_fixed const&) = delete;
71
+ strided_tensor_iter_fixed& operator=(strided_tensor_iter_fixed const& x) =
72
+ delete;
73
+ strided_tensor_iter_fixed(strided_tensor_iter_fixed&&) noexcept = default;
74
+ strided_tensor_iter_fixed& operator=(strided_tensor_iter_fixed&& x) noexcept =
75
+ default;
76
+ ~strided_tensor_iter_fixed() noexcept = default;
77
+ strided_tensor_iter_fixed(
78
+ Tensor& tensor,
79
+ [[maybe_unused]] bool sort_strides = false)
80
+ : data_(tensor.data_ptr<T>()) {
81
+ std::memset(counter_, 0, sizeof(int64_t) * N);
82
+ if (tensor.dim() > 0) {
83
+ std::memcpy(
84
+ sizes_, tensor.sizes().data(), tensor.dim() * sizeof(int64_t));
85
+ std::memcpy(
86
+ strides_, tensor.strides().data(), tensor.dim() * sizeof(int64_t));
87
+ }
88
+ dim_ = std::get<1>(collapse_dims(sizes_, strides_, tensor.ndimension()));
89
+ }
90
+ };
91
+
92
+ template <typename T>
93
+ struct strided_tensor_iter {
94
+ private:
95
+ public:
96
+ T* data_ = NULL;
97
+ int64_t dim_;
98
+
99
+ std::vector<int64_t> counter_;
100
+ std::vector<int64_t> sizes_;
101
+ std::vector<int64_t> strides_;
102
+
103
+ strided_tensor_iter(strided_tensor_iter const&) = delete;
104
+ strided_tensor_iter& operator=(strided_tensor_iter const& x) = delete;
105
+ strided_tensor_iter(strided_tensor_iter&&) noexcept = default;
106
+ strided_tensor_iter& operator=(strided_tensor_iter&&) noexcept = default;
107
+ ~strided_tensor_iter() noexcept = default;
108
+ strided_tensor_iter(Tensor& tensor)
109
+ : data_(tensor.data_ptr<T>()),
110
+ dim_(tensor.ndimension()),
111
+ counter_(dim_, 0),
112
+ sizes_(tensor.sizes().vec()),
113
+ strides_(tensor.strides().vec()) {
114
+ dim_ = std::get<1>(collapse_dims(sizes_.data(), strides_.data(), dim_));
115
+ }
116
+ };
117
+
118
+ inline bool _all_equal_numel(at::ArrayRef<Tensor> tensors) {
119
+ if (tensors.empty())
120
+ return true;
121
+ int64_t all_numel = tensors[0].numel();
122
+ for (const auto i : c10::irange(1, tensors.size())) {
123
+ if (tensors[i].numel() != all_numel)
124
+ return false;
125
+ }
126
+ return true;
127
+ }
128
+
129
+ inline std::string _all_equal_numel_error(at::ArrayRef<Tensor> tensors) {
130
+ std::ostringstream oss;
131
+ oss << "inconsistent tensor size, expected ";
132
+ for (size_t i = 0; i < tensors.size() - 1; i++) {
133
+ oss << tensors[i].sizes() << ", ";
134
+ }
135
+ oss << "and " << tensors[tensors.size() - 1].sizes()
136
+ << " to have the same number of elements, but got ";
137
+ for (size_t i = 0; i < tensors.size() - 1; i++) {
138
+ oss << tensors[i].numel() << ", ";
139
+ }
140
+ oss << "and " << tensors[tensors.size() - 1].numel()
141
+ << " elements respectively";
142
+ return oss.str();
143
+ }
144
+
145
+ inline bool _apply_preamble(ArrayRef<Tensor> tensors) {
146
+ checkDeviceType("CPU_tensor_apply", tensors, kCPU);
147
+ checkLayout("CPU_tensor_apply", tensors, kStrided);
148
+ TORCH_CHECK(_all_equal_numel(tensors), _all_equal_numel_error(tensors));
149
+ // An empty tensor has no elements
150
+ for (auto& t : tensors)
151
+ if (t.numel() == 0)
152
+ return false;
153
+ return true;
154
+ }
155
+
156
+ inline int64_t _max_dim_tensors(ArrayRef<Tensor> tensors) {
157
+ int64_t dim = 0;
158
+ for (auto& t : tensors)
159
+ dim = std::max(dim, t.ndimension());
160
+ return dim;
161
+ }
162
+
163
+ inline void iterate(int64_t /*size*/) {}
164
+
165
+ template <typename Arg, typename... Args>
166
+ inline void iterate(int64_t size, Arg& iter, Args&... iter_tail) {
167
+ iter.counter_[iter.dim_ - 1] += size;
168
+ iter.data_ = iter.data_ + size * iter.strides_[iter.dim_ - 1];
169
+ iterate(size, iter_tail...);
170
+ }
171
+
172
+ inline bool iterate_continue() {
173
+ return true;
174
+ }
175
+
176
+ template <typename Arg, typename... Args>
177
+ inline bool iterate_continue(Arg& iter, Args&... iter_tail) {
178
+ return iter.counter_[iter.dim_ - 1] < iter.sizes_[iter.dim_ - 1] &&
179
+ iterate_continue(iter_tail...);
180
+ }
181
+
182
+ inline int64_t max_iterate_size() {
183
+ return std::numeric_limits<int64_t>::max();
184
+ }
185
+
186
+ template <typename Arg, typename... Args>
187
+ inline int64_t max_iterate_size(Arg& iter, Args&... iter_tail) {
188
+ return std::min(
189
+ (iter.sizes_[iter.dim_ - 1] - iter.counter_[iter.dim_ - 1]),
190
+ max_iterate_size(iter_tail...));
191
+ }
192
+
193
+ inline void iterate_overflow() {}
194
+
195
+ template <typename Arg, typename... Args>
196
+ inline void iterate_overflow(Arg& iter, Args&... iter_tail) {
197
+ if (iter.counter_[iter.dim_ - 1] == iter.sizes_[iter.dim_ - 1]) {
198
+ for (int64_t i = iter.dim_ - 1; i > 0; i--) {
199
+ if (iter.counter_[i] == iter.sizes_[i]) {
200
+ iter.counter_[i] = 0;
201
+ iter.counter_[i - 1]++;
202
+ iter.data_ = iter.data_ - (iter.sizes_[i] * iter.strides_[i]) +
203
+ iter.strides_[i - 1];
204
+ }
205
+ }
206
+ }
207
+ iterate_overflow(iter_tail...);
208
+ }
209
+
210
+ inline void forward(int64_t /*offset*/) {}
211
+
212
+ template <typename Arg, typename... Args>
213
+ inline void forward(int64_t offset, Arg& iter, Args&... iter_tail) {
214
+ int64_t multi = offset;
215
+ for (int64_t i = iter.dim_ - 1; i >= 0; i--) {
216
+ int64_t inc = multi % iter.sizes_[i];
217
+ multi = multi / iter.sizes_[i];
218
+ iter.data_ = iter.data_ + inc * iter.strides_[i];
219
+ iter.counter_[i] += inc;
220
+ }
221
+ forward(offset, iter_tail...);
222
+ }
223
+
224
+ inline int64_t max_dim() {
225
+ return 0;
226
+ }
227
+
228
+ template <typename Arg, typename... Args>
229
+ inline int64_t max_dim(Arg& iter, Args&... iter_tail) {
230
+ return std::max(iter.dim_, max_dim(iter_tail...));
231
+ }
232
+
233
+ inline void apply_op() {}
234
+
235
+ template <typename Op, typename... Args>
236
+ inline void apply_op(
237
+ int64_t numel,
238
+ int64_t offset,
239
+ const Op& op,
240
+ Args... iters) {
241
+ // For 0-dim tensors
242
+ if (numel == 1 && max_dim(iters...) == 0) {
243
+ op(*iters.data_...);
244
+ return;
245
+ }
246
+ if (offset > 0)
247
+ forward(offset, iters...);
248
+ // Splitting this into chunks helps the compiler create faster assembly
249
+ for (int64_t i = 0; i < numel;) {
250
+ for (; iterate_continue(iters...) && i < numel;) {
251
+ op(*iters.data_...);
252
+ iterate(1, iters...);
253
+ i++;
254
+ }
255
+ iterate_overflow(iters...);
256
+ }
257
+ }
258
+
259
+ /*
260
+ Apply a pointwise operator to sequence of tensors
261
+
262
+ The calling convention for op is a function/functor that takes the same
263
+ number of pointers of type scalar as the number of given tensors. For example,
264
+ to compute a = b * c, op would be of the form:
265
+ [](scalar* a_val, const scalar* b_val, const scalar* c_val) { a_val[0] =
266
+ b_val[0] * c_val[0]; };
267
+ */
268
+
269
+ template <typename scalar1, typename scalar2, typename Op>
270
+ inline void CPU_tensor_apply2(Tensor tensor1, Tensor tensor2, const Op op) {
271
+ if (!_apply_preamble({tensor1, tensor2}))
272
+ return;
273
+ if (_max_dim_tensors({tensor1, tensor2}) <= 8) {
274
+ apply_op(
275
+ tensor1.numel(),
276
+ 0,
277
+ op,
278
+ strided_tensor_iter_fixed<scalar1, 8>(tensor1),
279
+ strided_tensor_iter_fixed<scalar2, 8>(tensor2));
280
+ } else {
281
+ apply_op(
282
+ tensor1.numel(),
283
+ 0,
284
+ op,
285
+ strided_tensor_iter<scalar1>(tensor1),
286
+ strided_tensor_iter<scalar2>(tensor2));
287
+ }
288
+ }
289
+
290
+ template <typename scalar1, typename scalar2, typename scalar3, typename Op>
291
+ inline void CPU_tensor_apply3(
292
+ Tensor tensor1,
293
+ Tensor tensor2,
294
+ Tensor tensor3,
295
+ const Op op) {
296
+ if (!_apply_preamble({tensor1, tensor2, tensor3}))
297
+ return;
298
+ if (_max_dim_tensors({tensor1, tensor2, tensor3}) <= 8) {
299
+ apply_op(
300
+ tensor1.numel(),
301
+ 0,
302
+ op,
303
+ strided_tensor_iter_fixed<scalar1, 8>(tensor1),
304
+ strided_tensor_iter_fixed<scalar2, 8>(tensor2),
305
+ strided_tensor_iter_fixed<scalar3, 8>(tensor3));
306
+ } else {
307
+ apply_op(
308
+ tensor1.numel(),
309
+ 0,
310
+ op,
311
+ strided_tensor_iter<scalar1>(tensor1),
312
+ strided_tensor_iter<scalar2>(tensor2),
313
+ strided_tensor_iter<scalar3>(tensor3));
314
+ }
315
+ }
316
+
317
+ template <
318
+ typename scalar1,
319
+ typename scalar2,
320
+ typename scalar3,
321
+ typename scalar4,
322
+ typename Op>
323
+ inline void CPU_tensor_apply4(
324
+ Tensor tensor1,
325
+ Tensor tensor2,
326
+ Tensor tensor3,
327
+ Tensor tensor4,
328
+ const Op op) {
329
+ if (!_apply_preamble({tensor1, tensor2, tensor3, tensor4}))
330
+ return;
331
+ if (_max_dim_tensors({tensor1, tensor2, tensor3, tensor4}) <= 8) {
332
+ apply_op(
333
+ tensor1.numel(),
334
+ 0,
335
+ op,
336
+ strided_tensor_iter_fixed<scalar1, 8>(tensor1),
337
+ strided_tensor_iter_fixed<scalar2, 8>(tensor2),
338
+ strided_tensor_iter_fixed<scalar3, 8>(tensor3),
339
+ strided_tensor_iter_fixed<scalar4, 8>(tensor4));
340
+ } else {
341
+ apply_op(
342
+ tensor1.numel(),
343
+ 0,
344
+ op,
345
+ strided_tensor_iter<scalar1>(tensor1),
346
+ strided_tensor_iter<scalar2>(tensor2),
347
+ strided_tensor_iter<scalar3>(tensor3),
348
+ strided_tensor_iter<scalar4>(tensor4));
349
+ }
350
+ }
351
+
352
+ } // namespace at
353
+
354
+ #else
355
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
356
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CPUFixedAllocator.h ADDED
@@ -0,0 +1,38 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+
4
+ #include <c10/core/Allocator.h>
5
+ #include <c10/util/Exception.h>
6
+
7
+ // This file creates a fake allocator that just throws exceptions if
8
+ // it is actually used.
9
+
10
+ // state passed to the allocator is the std::function<void(void*)> called
11
+ // when the blob is release by ATen
12
+
13
+ namespace at {
14
+
15
+ static void* cpu_fixed_malloc(void*, ptrdiff_t) {
16
+ TORCH_CHECK(false, "attempting to resize a tensor view of an external blob");
17
+ }
18
+
19
+ static void* cpu_fixed_realloc(void*, void*, ptrdiff_t) {
20
+ TORCH_CHECK(false, "attempting to resize a tensor view of an external blob");
21
+ }
22
+
23
+ static void cpu_fixed_free(void* state, void* allocation) {
24
+ auto on_release = static_cast<std::function<void(void*)>*>(state);
25
+ (*on_release)(allocation);
26
+ delete on_release;
27
+ }
28
+
29
+ static Allocator CPU_fixed_allocator = {
30
+ cpu_fixed_malloc,
31
+ cpu_fixed_realloc,
32
+ cpu_fixed_free};
33
+
34
+ } // namespace at
35
+
36
+ #else
37
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
38
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CPUFunctions.h ADDED
@@ -0,0 +1,34 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #include <ATen/core/TensorBody.h>
3
+
4
+ // TODO Undo all logic introduced for Note [Avoiding Include Cycles In Static Dispatch]
5
+ // Code introduced to avoid cyclic dependency in static dispatch is no longer
6
+ // needed as static dispatch logic is moved from TensorBody.h, which caused cycles in the first place,
7
+ // to Operators.cpp for supporting multiple backends with multiple kernels.
8
+ //
9
+ // Note [Avoiding Include Cycles In Static Dispatch]
10
+ // In order to avoid #include cycles in the static dispatch build, we've carefully split out
11
+ // the static function definition files into {DispatchKey}Functions.h and {DispatchKey}Functions_inl.h.
12
+ //
13
+ // Without this split, the include cycle looks like TensorBody.h -> CPUFunctions.h -> TensorBody.h.
14
+ // - TensorBody.h #includes CPUFunctions.h in the static dispatch build, because the tensor methods
15
+ // all need to call into the fastpath C++ API defined in CPUFunctions.h. The methods are also all
16
+ // directly inlined into TensorBody.h.
17
+ // - CPUFunctions.h #includes TensorBody.h because it contains function declarations for the entire C++ API,
18
+ // which include functions that have defaultable std::optional<Tensor> arguments.
19
+ // That requires knowing the full Tensor class definition.
20
+ //
21
+ // We break the cycle by doing the following:
22
+ // - Split out CPUFunction.h into two files: CPUFunctions.h and CPUFunctions_inl.h
23
+ // - CPUFunction.h is a dummy file that just includes the Tensor class and includes CPUFunctions_inl.,
24
+ // - CPUFunctions_inl.h includes everything else
25
+ // - (only in the static dispatch build) TensorBody.h makes sure to finish defining the Tensor class,
26
+ // and then it includes CPUFunctions_inl.h.
27
+ // - All other files that want the cpu fastpath functions can include CPUFunctions.h directly.
28
+ // - This also means that static dispatch build, CPUFunctions.h only needs to
29
+ // #include TensorBody.h, and it will automatically bring in CPUFunctions_inl.h.
30
+ #include <ATen/CPUFunctions_inl.h>
31
+
32
+ #else
33
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
34
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CPUFunctions_inl.h ADDED
@@ -0,0 +1,549 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+ // @generated by torchgen/gen.py from DispatchKeyFunctions_inl.h
4
+
5
+ // NB: The implementing C++ file is RegisterDispatchKey.cpp
6
+
7
+ // The only #includes we need are for custom classes that have defaults in the C++ API
8
+ #include <c10/core/MemoryFormat.h>
9
+ #include <c10/core/Scalar.h>
10
+ #include <ATen/core/Reduction.h>
11
+
12
+ #if defined(AT_PER_OPERATOR_HEADERS) && defined(TORCH_ASSERT_ONLY_METHOD_OPERATORS)
13
+ #error This change adds a dependency on all pytorch operators, meaning the \
14
+ file will need to be re-compiled every time an operator is changed or added. \
15
+ Consider including a specific operator from \
16
+ <ATen/ops/{my_operator}_cpu_dispatch.h>. \
17
+ See NOTE [TORCH_ASSERT_ONLY_METHOD_OPERATORS].
18
+ #endif
19
+
20
+ #include <ATen/ops/_adaptive_avg_pool2d_cpu_dispatch.h>
21
+ #include <ATen/ops/_adaptive_avg_pool2d_backward_cpu_dispatch.h>
22
+ #include <ATen/ops/_adaptive_avg_pool3d_cpu_dispatch.h>
23
+ #include <ATen/ops/_adaptive_avg_pool3d_backward_cpu_dispatch.h>
24
+ #include <ATen/ops/_add_relu_cpu_dispatch.h>
25
+ #include <ATen/ops/_addmm_activation_cpu_dispatch.h>
26
+ #include <ATen/ops/_aminmax_cpu_dispatch.h>
27
+ #include <ATen/ops/_amp_foreach_non_finite_check_and_unscale_cpu_dispatch.h>
28
+ #include <ATen/ops/_amp_update_scale_cpu_dispatch.h>
29
+ #include <ATen/ops/_assert_async_cpu_dispatch.h>
30
+ #include <ATen/ops/_batch_norm_with_update_cpu_dispatch.h>
31
+ #include <ATen/ops/_cdist_backward_cpu_dispatch.h>
32
+ #include <ATen/ops/_cdist_forward_cpu_dispatch.h>
33
+ #include <ATen/ops/_cholesky_solve_helper_cpu_dispatch.h>
34
+ #include <ATen/ops/_compute_linear_combination_cpu_dispatch.h>
35
+ #include <ATen/ops/_convert_indices_from_coo_to_csr_cpu_dispatch.h>
36
+ #include <ATen/ops/_convert_indices_from_csr_to_coo_cpu_dispatch.h>
37
+ #include <ATen/ops/_convert_weight_to_int4pack_for_cpu_cpu_dispatch.h>
38
+ #include <ATen/ops/_ctc_loss_cpu_dispatch.h>
39
+ #include <ATen/ops/_ctc_loss_backward_cpu_dispatch.h>
40
+ #include <ATen/ops/_cummax_helper_cpu_dispatch.h>
41
+ #include <ATen/ops/_cummin_helper_cpu_dispatch.h>
42
+ #include <ATen/ops/_dirichlet_grad_cpu_dispatch.h>
43
+ #include <ATen/ops/_dyn_quant_matmul_4bit_cpu_dispatch.h>
44
+ #include <ATen/ops/_dyn_quant_pack_4bit_weight_cpu_dispatch.h>
45
+ #include <ATen/ops/_efficientzerotensor_cpu_dispatch.h>
46
+ #include <ATen/ops/_embedding_bag_cpu_dispatch.h>
47
+ #include <ATen/ops/_embedding_bag_backward_cpu_dispatch.h>
48
+ #include <ATen/ops/_embedding_bag_dense_backward_cpu_dispatch.h>
49
+ #include <ATen/ops/_embedding_bag_forward_only_cpu_dispatch.h>
50
+ #include <ATen/ops/_embedding_bag_per_sample_weights_backward_cpu_dispatch.h>
51
+ #include <ATen/ops/_empty_affine_quantized_cpu_dispatch.h>
52
+ #include <ATen/ops/_empty_per_channel_affine_quantized_cpu_dispatch.h>
53
+ #include <ATen/ops/_fake_quantize_learnable_per_channel_affine_cpu_dispatch.h>
54
+ #include <ATen/ops/_fake_quantize_learnable_per_channel_affine_backward_cpu_dispatch.h>
55
+ #include <ATen/ops/_fake_quantize_learnable_per_tensor_affine_cpu_dispatch.h>
56
+ #include <ATen/ops/_fake_quantize_learnable_per_tensor_affine_backward_cpu_dispatch.h>
57
+ #include <ATen/ops/_fake_quantize_per_tensor_affine_cachemask_tensor_qparams_cpu_dispatch.h>
58
+ #include <ATen/ops/_fft_c2c_cpu_dispatch.h>
59
+ #include <ATen/ops/_fft_c2r_cpu_dispatch.h>
60
+ #include <ATen/ops/_fft_r2c_cpu_dispatch.h>
61
+ #include <ATen/ops/_foobar_cpu_dispatch.h>
62
+ #include <ATen/ops/_functional_assert_async_cpu_dispatch.h>
63
+ #include <ATen/ops/_fused_adagrad_cpu_dispatch.h>
64
+ #include <ATen/ops/_fused_adam_cpu_dispatch.h>
65
+ #include <ATen/ops/_fused_adamw_cpu_dispatch.h>
66
+ #include <ATen/ops/_fused_moving_avg_obs_fq_helper_cpu_dispatch.h>
67
+ #include <ATen/ops/_fused_sdp_choice_cpu_dispatch.h>
68
+ #include <ATen/ops/_fused_sgd_cpu_dispatch.h>
69
+ #include <ATen/ops/_histogramdd_bin_edges_cpu_dispatch.h>
70
+ #include <ATen/ops/_histogramdd_from_bin_cts_cpu_dispatch.h>
71
+ #include <ATen/ops/_histogramdd_from_bin_tensors_cpu_dispatch.h>
72
+ #include <ATen/ops/_index_put_impl_cpu_dispatch.h>
73
+ #include <ATen/ops/_int_mm_cpu_dispatch.h>
74
+ #include <ATen/ops/_jagged_to_padded_dense_forward_cpu_dispatch.h>
75
+ #include <ATen/ops/_linalg_det_cpu_dispatch.h>
76
+ #include <ATen/ops/_linalg_eigh_cpu_dispatch.h>
77
+ #include <ATen/ops/_linalg_eigvals_cpu_dispatch.h>
78
+ #include <ATen/ops/_linalg_slogdet_cpu_dispatch.h>
79
+ #include <ATen/ops/_linalg_solve_ex_cpu_dispatch.h>
80
+ #include <ATen/ops/_linalg_svd_cpu_dispatch.h>
81
+ #include <ATen/ops/_local_scalar_dense_cpu_dispatch.h>
82
+ #include <ATen/ops/_log_softmax_cpu_dispatch.h>
83
+ #include <ATen/ops/_log_softmax_backward_data_cpu_dispatch.h>
84
+ #include <ATen/ops/_logcumsumexp_cpu_dispatch.h>
85
+ #include <ATen/ops/_make_dep_token_cpu_dispatch.h>
86
+ #include <ATen/ops/_make_per_channel_quantized_tensor_cpu_dispatch.h>
87
+ #include <ATen/ops/_make_per_tensor_quantized_tensor_cpu_dispatch.h>
88
+ #include <ATen/ops/_masked_softmax_cpu_dispatch.h>
89
+ #include <ATen/ops/_masked_softmax_backward_cpu_dispatch.h>
90
+ #include <ATen/ops/_native_batch_norm_legit_cpu_dispatch.h>
91
+ #include <ATen/ops/_native_multi_head_attention_cpu_dispatch.h>
92
+ #include <ATen/ops/_nested_compute_contiguous_strides_offsets_cpu_dispatch.h>
93
+ #include <ATen/ops/_nested_from_padded_cpu_dispatch.h>
94
+ #include <ATen/ops/_nested_tensor_from_mask_cpu_dispatch.h>
95
+ #include <ATen/ops/_nested_tensor_from_mask_left_aligned_cpu_dispatch.h>
96
+ #include <ATen/ops/_nested_view_from_buffer_cpu_dispatch.h>
97
+ #include <ATen/ops/_padded_dense_to_jagged_forward_cpu_dispatch.h>
98
+ #include <ATen/ops/_pdist_backward_cpu_dispatch.h>
99
+ #include <ATen/ops/_pdist_forward_cpu_dispatch.h>
100
+ #include <ATen/ops/_prelu_kernel_cpu_dispatch.h>
101
+ #include <ATen/ops/_prelu_kernel_backward_cpu_dispatch.h>
102
+ #include <ATen/ops/_reshape_alias_cpu_dispatch.h>
103
+ #include <ATen/ops/_sample_dirichlet_cpu_dispatch.h>
104
+ #include <ATen/ops/_scaled_dot_product_flash_attention_for_cpu_cpu_dispatch.h>
105
+ #include <ATen/ops/_scaled_dot_product_flash_attention_for_cpu_backward_cpu_dispatch.h>
106
+ #include <ATen/ops/_scaled_mm_cpu_dispatch.h>
107
+ #include <ATen/ops/_segment_reduce_backward_cpu_dispatch.h>
108
+ #include <ATen/ops/_slow_conv2d_backward_cpu_dispatch.h>
109
+ #include <ATen/ops/_slow_conv2d_forward_cpu_dispatch.h>
110
+ #include <ATen/ops/_softmax_cpu_dispatch.h>
111
+ #include <ATen/ops/_softmax_backward_data_cpu_dispatch.h>
112
+ #include <ATen/ops/_spdiags_cpu_dispatch.h>
113
+ #include <ATen/ops/_stack_cpu_dispatch.h>
114
+ #include <ATen/ops/_standard_gamma_cpu_dispatch.h>
115
+ #include <ATen/ops/_standard_gamma_grad_cpu_dispatch.h>
116
+ #include <ATen/ops/_test_functorch_fallback_cpu_dispatch.h>
117
+ #include <ATen/ops/_test_optional_filled_intlist_cpu_dispatch.h>
118
+ #include <ATen/ops/_test_optional_floatlist_cpu_dispatch.h>
119
+ #include <ATen/ops/_test_optional_intlist_cpu_dispatch.h>
120
+ #include <ATen/ops/_to_sparse_cpu_dispatch.h>
121
+ #include <ATen/ops/_to_sparse_bsc_cpu_dispatch.h>
122
+ #include <ATen/ops/_to_sparse_bsr_cpu_dispatch.h>
123
+ #include <ATen/ops/_to_sparse_csc_cpu_dispatch.h>
124
+ #include <ATen/ops/_to_sparse_csr_cpu_dispatch.h>
125
+ #include <ATen/ops/_transform_bias_rescale_qkv_cpu_dispatch.h>
126
+ #include <ATen/ops/_transformer_encoder_layer_fwd_cpu_dispatch.h>
127
+ #include <ATen/ops/_unique_cpu_dispatch.h>
128
+ #include <ATen/ops/_unique2_cpu_dispatch.h>
129
+ #include <ATen/ops/_upsample_bicubic2d_aa_cpu_dispatch.h>
130
+ #include <ATen/ops/_upsample_bicubic2d_aa_backward_cpu_dispatch.h>
131
+ #include <ATen/ops/_upsample_bilinear2d_aa_cpu_dispatch.h>
132
+ #include <ATen/ops/_upsample_bilinear2d_aa_backward_cpu_dispatch.h>
133
+ #include <ATen/ops/_upsample_nearest_exact1d_cpu_dispatch.h>
134
+ #include <ATen/ops/_upsample_nearest_exact1d_backward_cpu_dispatch.h>
135
+ #include <ATen/ops/_upsample_nearest_exact2d_cpu_dispatch.h>
136
+ #include <ATen/ops/_upsample_nearest_exact2d_backward_cpu_dispatch.h>
137
+ #include <ATen/ops/_upsample_nearest_exact3d_cpu_dispatch.h>
138
+ #include <ATen/ops/_upsample_nearest_exact3d_backward_cpu_dispatch.h>
139
+ #include <ATen/ops/_validate_compressed_sparse_indices_cpu_dispatch.h>
140
+ #include <ATen/ops/_weight_int4pack_mm_for_cpu_cpu_dispatch.h>
141
+ #include <ATen/ops/_weight_int8pack_mm_cpu_dispatch.h>
142
+ #include <ATen/ops/_weight_norm_interface_cpu_dispatch.h>
143
+ #include <ATen/ops/_weight_norm_interface_backward_cpu_dispatch.h>
144
+ #include <ATen/ops/abs_cpu_dispatch.h>
145
+ #include <ATen/ops/acos_cpu_dispatch.h>
146
+ #include <ATen/ops/acosh_cpu_dispatch.h>
147
+ #include <ATen/ops/adaptive_avg_pool2d_cpu_dispatch.h>
148
+ #include <ATen/ops/adaptive_avg_pool3d_cpu_dispatch.h>
149
+ #include <ATen/ops/adaptive_avg_pool3d_backward_cpu_dispatch.h>
150
+ #include <ATen/ops/adaptive_max_pool2d_cpu_dispatch.h>
151
+ #include <ATen/ops/adaptive_max_pool2d_backward_cpu_dispatch.h>
152
+ #include <ATen/ops/adaptive_max_pool3d_cpu_dispatch.h>
153
+ #include <ATen/ops/adaptive_max_pool3d_backward_cpu_dispatch.h>
154
+ #include <ATen/ops/add_cpu_dispatch.h>
155
+ #include <ATen/ops/addbmm_cpu_dispatch.h>
156
+ #include <ATen/ops/addcdiv_cpu_dispatch.h>
157
+ #include <ATen/ops/addcmul_cpu_dispatch.h>
158
+ #include <ATen/ops/addmm_cpu_dispatch.h>
159
+ #include <ATen/ops/addmv_cpu_dispatch.h>
160
+ #include <ATen/ops/addr_cpu_dispatch.h>
161
+ #include <ATen/ops/all_cpu_dispatch.h>
162
+ #include <ATen/ops/amax_cpu_dispatch.h>
163
+ #include <ATen/ops/amin_cpu_dispatch.h>
164
+ #include <ATen/ops/aminmax_cpu_dispatch.h>
165
+ #include <ATen/ops/angle_cpu_dispatch.h>
166
+ #include <ATen/ops/any_cpu_dispatch.h>
167
+ #include <ATen/ops/arange_cpu_dispatch.h>
168
+ #include <ATen/ops/argmax_cpu_dispatch.h>
169
+ #include <ATen/ops/argmin_cpu_dispatch.h>
170
+ #include <ATen/ops/as_strided_cpu_dispatch.h>
171
+ #include <ATen/ops/asin_cpu_dispatch.h>
172
+ #include <ATen/ops/asinh_cpu_dispatch.h>
173
+ #include <ATen/ops/atan_cpu_dispatch.h>
174
+ #include <ATen/ops/atan2_cpu_dispatch.h>
175
+ #include <ATen/ops/atanh_cpu_dispatch.h>
176
+ #include <ATen/ops/avg_pool2d_cpu_dispatch.h>
177
+ #include <ATen/ops/avg_pool2d_backward_cpu_dispatch.h>
178
+ #include <ATen/ops/avg_pool3d_cpu_dispatch.h>
179
+ #include <ATen/ops/avg_pool3d_backward_cpu_dispatch.h>
180
+ #include <ATen/ops/baddbmm_cpu_dispatch.h>
181
+ #include <ATen/ops/batch_norm_backward_cpu_dispatch.h>
182
+ #include <ATen/ops/batch_norm_update_stats_cpu_dispatch.h>
183
+ #include <ATen/ops/bernoulli_cpu_dispatch.h>
184
+ #include <ATen/ops/binary_cross_entropy_cpu_dispatch.h>
185
+ #include <ATen/ops/binary_cross_entropy_backward_cpu_dispatch.h>
186
+ #include <ATen/ops/bincount_cpu_dispatch.h>
187
+ #include <ATen/ops/binomial_cpu_dispatch.h>
188
+ #include <ATen/ops/bitwise_and_cpu_dispatch.h>
189
+ #include <ATen/ops/bitwise_left_shift_cpu_dispatch.h>
190
+ #include <ATen/ops/bitwise_not_cpu_dispatch.h>
191
+ #include <ATen/ops/bitwise_or_cpu_dispatch.h>
192
+ #include <ATen/ops/bitwise_right_shift_cpu_dispatch.h>
193
+ #include <ATen/ops/bitwise_xor_cpu_dispatch.h>
194
+ #include <ATen/ops/bmm_cpu_dispatch.h>
195
+ #include <ATen/ops/bucketize_cpu_dispatch.h>
196
+ #include <ATen/ops/cat_cpu_dispatch.h>
197
+ #include <ATen/ops/cauchy_cpu_dispatch.h>
198
+ #include <ATen/ops/ceil_cpu_dispatch.h>
199
+ #include <ATen/ops/channel_shuffle_cpu_dispatch.h>
200
+ #include <ATen/ops/cholesky_cpu_dispatch.h>
201
+ #include <ATen/ops/cholesky_inverse_cpu_dispatch.h>
202
+ #include <ATen/ops/clamp_cpu_dispatch.h>
203
+ #include <ATen/ops/clamp_max_cpu_dispatch.h>
204
+ #include <ATen/ops/clamp_min_cpu_dispatch.h>
205
+ #include <ATen/ops/col2im_cpu_dispatch.h>
206
+ #include <ATen/ops/complex_cpu_dispatch.h>
207
+ #include <ATen/ops/conj_physical_cpu_dispatch.h>
208
+ #include <ATen/ops/copysign_cpu_dispatch.h>
209
+ #include <ATen/ops/cos_cpu_dispatch.h>
210
+ #include <ATen/ops/cosh_cpu_dispatch.h>
211
+ #include <ATen/ops/count_nonzero_cpu_dispatch.h>
212
+ #include <ATen/ops/cumprod_cpu_dispatch.h>
213
+ #include <ATen/ops/cumsum_cpu_dispatch.h>
214
+ #include <ATen/ops/dequantize_cpu_dispatch.h>
215
+ #include <ATen/ops/digamma_cpu_dispatch.h>
216
+ #include <ATen/ops/div_cpu_dispatch.h>
217
+ #include <ATen/ops/dot_cpu_dispatch.h>
218
+ #include <ATen/ops/elu_cpu_dispatch.h>
219
+ #include <ATen/ops/elu_backward_cpu_dispatch.h>
220
+ #include <ATen/ops/embedding_dense_backward_cpu_dispatch.h>
221
+ #include <ATen/ops/embedding_renorm_cpu_dispatch.h>
222
+ #include <ATen/ops/empty_cpu_dispatch.h>
223
+ #include <ATen/ops/empty_strided_cpu_dispatch.h>
224
+ #include <ATen/ops/eq_cpu_dispatch.h>
225
+ #include <ATen/ops/equal_cpu_dispatch.h>
226
+ #include <ATen/ops/erf_cpu_dispatch.h>
227
+ #include <ATen/ops/erfc_cpu_dispatch.h>
228
+ #include <ATen/ops/erfinv_cpu_dispatch.h>
229
+ #include <ATen/ops/exp_cpu_dispatch.h>
230
+ #include <ATen/ops/exp2_cpu_dispatch.h>
231
+ #include <ATen/ops/expm1_cpu_dispatch.h>
232
+ #include <ATen/ops/exponential_cpu_dispatch.h>
233
+ #include <ATen/ops/eye_cpu_dispatch.h>
234
+ #include <ATen/ops/fake_quantize_per_channel_affine_cachemask_cpu_dispatch.h>
235
+ #include <ATen/ops/fake_quantize_per_tensor_affine_cachemask_cpu_dispatch.h>
236
+ #include <ATen/ops/fill_cpu_dispatch.h>
237
+ #include <ATen/ops/flip_cpu_dispatch.h>
238
+ #include <ATen/ops/floor_cpu_dispatch.h>
239
+ #include <ATen/ops/floor_divide_cpu_dispatch.h>
240
+ #include <ATen/ops/fmax_cpu_dispatch.h>
241
+ #include <ATen/ops/fmin_cpu_dispatch.h>
242
+ #include <ATen/ops/fmod_cpu_dispatch.h>
243
+ #include <ATen/ops/frac_cpu_dispatch.h>
244
+ #include <ATen/ops/fractional_max_pool2d_cpu_dispatch.h>
245
+ #include <ATen/ops/fractional_max_pool2d_backward_cpu_dispatch.h>
246
+ #include <ATen/ops/fractional_max_pool3d_cpu_dispatch.h>
247
+ #include <ATen/ops/fractional_max_pool3d_backward_cpu_dispatch.h>
248
+ #include <ATen/ops/frexp_cpu_dispatch.h>
249
+ #include <ATen/ops/from_file_cpu_dispatch.h>
250
+ #include <ATen/ops/gather_cpu_dispatch.h>
251
+ #include <ATen/ops/gcd_cpu_dispatch.h>
252
+ #include <ATen/ops/ge_cpu_dispatch.h>
253
+ #include <ATen/ops/gelu_cpu_dispatch.h>
254
+ #include <ATen/ops/gelu_backward_cpu_dispatch.h>
255
+ #include <ATen/ops/geometric_cpu_dispatch.h>
256
+ #include <ATen/ops/geqrf_cpu_dispatch.h>
257
+ #include <ATen/ops/glu_cpu_dispatch.h>
258
+ #include <ATen/ops/glu_backward_cpu_dispatch.h>
259
+ #include <ATen/ops/glu_backward_jvp_cpu_dispatch.h>
260
+ #include <ATen/ops/glu_jvp_cpu_dispatch.h>
261
+ #include <ATen/ops/grid_sampler_2d_cpu_dispatch.h>
262
+ #include <ATen/ops/grid_sampler_2d_backward_cpu_dispatch.h>
263
+ #include <ATen/ops/grid_sampler_3d_cpu_dispatch.h>
264
+ #include <ATen/ops/grid_sampler_3d_backward_cpu_dispatch.h>
265
+ #include <ATen/ops/gt_cpu_dispatch.h>
266
+ #include <ATen/ops/hardshrink_cpu_dispatch.h>
267
+ #include <ATen/ops/hardshrink_backward_cpu_dispatch.h>
268
+ #include <ATen/ops/hardsigmoid_cpu_dispatch.h>
269
+ #include <ATen/ops/hardsigmoid_backward_cpu_dispatch.h>
270
+ #include <ATen/ops/hardswish_cpu_dispatch.h>
271
+ #include <ATen/ops/hardswish_backward_cpu_dispatch.h>
272
+ #include <ATen/ops/hardtanh_cpu_dispatch.h>
273
+ #include <ATen/ops/hardtanh_backward_cpu_dispatch.h>
274
+ #include <ATen/ops/hash_tensor_cpu_dispatch.h>
275
+ #include <ATen/ops/heaviside_cpu_dispatch.h>
276
+ #include <ATen/ops/histc_cpu_dispatch.h>
277
+ #include <ATen/ops/histogram_cpu_dispatch.h>
278
+ #include <ATen/ops/huber_loss_cpu_dispatch.h>
279
+ #include <ATen/ops/huber_loss_backward_cpu_dispatch.h>
280
+ #include <ATen/ops/hypot_cpu_dispatch.h>
281
+ #include <ATen/ops/i0_cpu_dispatch.h>
282
+ #include <ATen/ops/igamma_cpu_dispatch.h>
283
+ #include <ATen/ops/igammac_cpu_dispatch.h>
284
+ #include <ATen/ops/im2col_cpu_dispatch.h>
285
+ #include <ATen/ops/index_cpu_dispatch.h>
286
+ #include <ATen/ops/index_add_cpu_dispatch.h>
287
+ #include <ATen/ops/index_copy_cpu_dispatch.h>
288
+ #include <ATen/ops/index_fill_cpu_dispatch.h>
289
+ #include <ATen/ops/index_reduce_cpu_dispatch.h>
290
+ #include <ATen/ops/index_select_cpu_dispatch.h>
291
+ #include <ATen/ops/is_set_to_cpu_dispatch.h>
292
+ #include <ATen/ops/isin_cpu_dispatch.h>
293
+ #include <ATen/ops/isnan_cpu_dispatch.h>
294
+ #include <ATen/ops/isneginf_cpu_dispatch.h>
295
+ #include <ATen/ops/isposinf_cpu_dispatch.h>
296
+ #include <ATen/ops/kthvalue_cpu_dispatch.h>
297
+ #include <ATen/ops/lcm_cpu_dispatch.h>
298
+ #include <ATen/ops/le_cpu_dispatch.h>
299
+ #include <ATen/ops/leaky_relu_cpu_dispatch.h>
300
+ #include <ATen/ops/leaky_relu_backward_cpu_dispatch.h>
301
+ #include <ATen/ops/lerp_cpu_dispatch.h>
302
+ #include <ATen/ops/lgamma_cpu_dispatch.h>
303
+ #include <ATen/ops/linalg_cholesky_ex_cpu_dispatch.h>
304
+ #include <ATen/ops/linalg_cross_cpu_dispatch.h>
305
+ #include <ATen/ops/linalg_eig_cpu_dispatch.h>
306
+ #include <ATen/ops/linalg_eigvals_cpu_dispatch.h>
307
+ #include <ATen/ops/linalg_householder_product_cpu_dispatch.h>
308
+ #include <ATen/ops/linalg_inv_ex_cpu_dispatch.h>
309
+ #include <ATen/ops/linalg_ldl_factor_ex_cpu_dispatch.h>
310
+ #include <ATen/ops/linalg_ldl_solve_cpu_dispatch.h>
311
+ #include <ATen/ops/linalg_lstsq_cpu_dispatch.h>
312
+ #include <ATen/ops/linalg_lu_cpu_dispatch.h>
313
+ #include <ATen/ops/linalg_lu_factor_ex_cpu_dispatch.h>
314
+ #include <ATen/ops/linalg_lu_solve_cpu_dispatch.h>
315
+ #include <ATen/ops/linalg_matrix_exp_cpu_dispatch.h>
316
+ #include <ATen/ops/linalg_qr_cpu_dispatch.h>
317
+ #include <ATen/ops/linalg_solve_triangular_cpu_dispatch.h>
318
+ #include <ATen/ops/linalg_vector_norm_cpu_dispatch.h>
319
+ #include <ATen/ops/linspace_cpu_dispatch.h>
320
+ #include <ATen/ops/log_cpu_dispatch.h>
321
+ #include <ATen/ops/log10_cpu_dispatch.h>
322
+ #include <ATen/ops/log1p_cpu_dispatch.h>
323
+ #include <ATen/ops/log2_cpu_dispatch.h>
324
+ #include <ATen/ops/log_normal_cpu_dispatch.h>
325
+ #include <ATen/ops/log_sigmoid_backward_cpu_dispatch.h>
326
+ #include <ATen/ops/log_sigmoid_forward_cpu_dispatch.h>
327
+ #include <ATen/ops/logaddexp_cpu_dispatch.h>
328
+ #include <ATen/ops/logaddexp2_cpu_dispatch.h>
329
+ #include <ATen/ops/logical_and_cpu_dispatch.h>
330
+ #include <ATen/ops/logical_not_cpu_dispatch.h>
331
+ #include <ATen/ops/logical_or_cpu_dispatch.h>
332
+ #include <ATen/ops/logical_xor_cpu_dispatch.h>
333
+ #include <ATen/ops/logit_cpu_dispatch.h>
334
+ #include <ATen/ops/logit_backward_cpu_dispatch.h>
335
+ #include <ATen/ops/logspace_cpu_dispatch.h>
336
+ #include <ATen/ops/lshift_cpu_dispatch.h>
337
+ #include <ATen/ops/lt_cpu_dispatch.h>
338
+ #include <ATen/ops/lu_unpack_cpu_dispatch.h>
339
+ #include <ATen/ops/masked_fill_cpu_dispatch.h>
340
+ #include <ATen/ops/masked_scatter_cpu_dispatch.h>
341
+ #include <ATen/ops/masked_select_cpu_dispatch.h>
342
+ #include <ATen/ops/max_cpu_dispatch.h>
343
+ #include <ATen/ops/max_pool2d_with_indices_cpu_dispatch.h>
344
+ #include <ATen/ops/max_pool2d_with_indices_backward_cpu_dispatch.h>
345
+ #include <ATen/ops/max_pool3d_with_indices_cpu_dispatch.h>
346
+ #include <ATen/ops/max_pool3d_with_indices_backward_cpu_dispatch.h>
347
+ #include <ATen/ops/max_unpool2d_cpu_dispatch.h>
348
+ #include <ATen/ops/max_unpool3d_cpu_dispatch.h>
349
+ #include <ATen/ops/maximum_cpu_dispatch.h>
350
+ #include <ATen/ops/mean_cpu_dispatch.h>
351
+ #include <ATen/ops/median_cpu_dispatch.h>
352
+ #include <ATen/ops/min_cpu_dispatch.h>
353
+ #include <ATen/ops/minimum_cpu_dispatch.h>
354
+ #include <ATen/ops/mish_cpu_dispatch.h>
355
+ #include <ATen/ops/mish_backward_cpu_dispatch.h>
356
+ #include <ATen/ops/mkldnn_rnn_layer_cpu_dispatch.h>
357
+ #include <ATen/ops/mkldnn_rnn_layer_backward_cpu_dispatch.h>
358
+ #include <ATen/ops/mm_cpu_dispatch.h>
359
+ #include <ATen/ops/mode_cpu_dispatch.h>
360
+ #include <ATen/ops/mse_loss_cpu_dispatch.h>
361
+ #include <ATen/ops/mse_loss_backward_cpu_dispatch.h>
362
+ #include <ATen/ops/mul_cpu_dispatch.h>
363
+ #include <ATen/ops/multi_margin_loss_cpu_dispatch.h>
364
+ #include <ATen/ops/multi_margin_loss_backward_cpu_dispatch.h>
365
+ #include <ATen/ops/multilabel_margin_loss_backward_cpu_dispatch.h>
366
+ #include <ATen/ops/multilabel_margin_loss_forward_cpu_dispatch.h>
367
+ #include <ATen/ops/multinomial_cpu_dispatch.h>
368
+ #include <ATen/ops/mvlgamma_cpu_dispatch.h>
369
+ #include <ATen/ops/nan_to_num_cpu_dispatch.h>
370
+ #include <ATen/ops/nanmedian_cpu_dispatch.h>
371
+ #include <ATen/ops/nansum_cpu_dispatch.h>
372
+ #include <ATen/ops/narrow_copy_cpu_dispatch.h>
373
+ #include <ATen/ops/native_batch_norm_cpu_dispatch.h>
374
+ #include <ATen/ops/native_batch_norm_backward_cpu_dispatch.h>
375
+ #include <ATen/ops/native_channel_shuffle_cpu_dispatch.h>
376
+ #include <ATen/ops/native_dropout_cpu_dispatch.h>
377
+ #include <ATen/ops/native_dropout_backward_cpu_dispatch.h>
378
+ #include <ATen/ops/native_group_norm_cpu_dispatch.h>
379
+ #include <ATen/ops/native_group_norm_backward_cpu_dispatch.h>
380
+ #include <ATen/ops/native_layer_norm_cpu_dispatch.h>
381
+ #include <ATen/ops/native_layer_norm_backward_cpu_dispatch.h>
382
+ #include <ATen/ops/ne_cpu_dispatch.h>
383
+ #include <ATen/ops/neg_cpu_dispatch.h>
384
+ #include <ATen/ops/nextafter_cpu_dispatch.h>
385
+ #include <ATen/ops/nll_loss2d_backward_cpu_dispatch.h>
386
+ #include <ATen/ops/nll_loss2d_forward_cpu_dispatch.h>
387
+ #include <ATen/ops/nll_loss_backward_cpu_dispatch.h>
388
+ #include <ATen/ops/nll_loss_forward_cpu_dispatch.h>
389
+ #include <ATen/ops/nonzero_cpu_dispatch.h>
390
+ #include <ATen/ops/nonzero_static_cpu_dispatch.h>
391
+ #include <ATen/ops/norm_cpu_dispatch.h>
392
+ #include <ATen/ops/normal_cpu_dispatch.h>
393
+ #include <ATen/ops/ormqr_cpu_dispatch.h>
394
+ #include <ATen/ops/pixel_shuffle_cpu_dispatch.h>
395
+ #include <ATen/ops/pixel_unshuffle_cpu_dispatch.h>
396
+ #include <ATen/ops/poisson_cpu_dispatch.h>
397
+ #include <ATen/ops/polar_cpu_dispatch.h>
398
+ #include <ATen/ops/polygamma_cpu_dispatch.h>
399
+ #include <ATen/ops/pow_cpu_dispatch.h>
400
+ #include <ATen/ops/prod_cpu_dispatch.h>
401
+ #include <ATen/ops/put_cpu_dispatch.h>
402
+ #include <ATen/ops/quantize_per_channel_cpu_dispatch.h>
403
+ #include <ATen/ops/quantize_per_tensor_cpu_dispatch.h>
404
+ #include <ATen/ops/quantize_per_tensor_dynamic_cpu_dispatch.h>
405
+ #include <ATen/ops/random_cpu_dispatch.h>
406
+ #include <ATen/ops/randperm_cpu_dispatch.h>
407
+ #include <ATen/ops/range_cpu_dispatch.h>
408
+ #include <ATen/ops/reciprocal_cpu_dispatch.h>
409
+ #include <ATen/ops/reflection_pad1d_cpu_dispatch.h>
410
+ #include <ATen/ops/reflection_pad1d_backward_cpu_dispatch.h>
411
+ #include <ATen/ops/reflection_pad2d_cpu_dispatch.h>
412
+ #include <ATen/ops/reflection_pad2d_backward_cpu_dispatch.h>
413
+ #include <ATen/ops/reflection_pad3d_cpu_dispatch.h>
414
+ #include <ATen/ops/reflection_pad3d_backward_cpu_dispatch.h>
415
+ #include <ATen/ops/relu_cpu_dispatch.h>
416
+ #include <ATen/ops/remainder_cpu_dispatch.h>
417
+ #include <ATen/ops/renorm_cpu_dispatch.h>
418
+ #include <ATen/ops/repeat_interleave_cpu_dispatch.h>
419
+ #include <ATen/ops/replication_pad1d_cpu_dispatch.h>
420
+ #include <ATen/ops/replication_pad1d_backward_cpu_dispatch.h>
421
+ #include <ATen/ops/replication_pad2d_cpu_dispatch.h>
422
+ #include <ATen/ops/replication_pad2d_backward_cpu_dispatch.h>
423
+ #include <ATen/ops/replication_pad3d_cpu_dispatch.h>
424
+ #include <ATen/ops/replication_pad3d_backward_cpu_dispatch.h>
425
+ #include <ATen/ops/resize_cpu_dispatch.h>
426
+ #include <ATen/ops/roll_cpu_dispatch.h>
427
+ #include <ATen/ops/round_cpu_dispatch.h>
428
+ #include <ATen/ops/rrelu_with_noise_cpu_dispatch.h>
429
+ #include <ATen/ops/rshift_cpu_dispatch.h>
430
+ #include <ATen/ops/rsqrt_cpu_dispatch.h>
431
+ #include <ATen/ops/rsub_cpu_dispatch.h>
432
+ #include <ATen/ops/scatter_cpu_dispatch.h>
433
+ #include <ATen/ops/scatter_add_cpu_dispatch.h>
434
+ #include <ATen/ops/scatter_reduce_cpu_dispatch.h>
435
+ #include <ATen/ops/searchsorted_cpu_dispatch.h>
436
+ #include <ATen/ops/segment_reduce_cpu_dispatch.h>
437
+ #include <ATen/ops/set_cpu_dispatch.h>
438
+ #include <ATen/ops/sgn_cpu_dispatch.h>
439
+ #include <ATen/ops/sigmoid_cpu_dispatch.h>
440
+ #include <ATen/ops/sigmoid_backward_cpu_dispatch.h>
441
+ #include <ATen/ops/sign_cpu_dispatch.h>
442
+ #include <ATen/ops/signbit_cpu_dispatch.h>
443
+ #include <ATen/ops/silu_cpu_dispatch.h>
444
+ #include <ATen/ops/silu_backward_cpu_dispatch.h>
445
+ #include <ATen/ops/sin_cpu_dispatch.h>
446
+ #include <ATen/ops/sinc_cpu_dispatch.h>
447
+ #include <ATen/ops/sinh_cpu_dispatch.h>
448
+ #include <ATen/ops/slow_conv3d_forward_cpu_dispatch.h>
449
+ #include <ATen/ops/slow_conv_dilated2d_cpu_dispatch.h>
450
+ #include <ATen/ops/slow_conv_dilated3d_cpu_dispatch.h>
451
+ #include <ATen/ops/slow_conv_transpose2d_cpu_dispatch.h>
452
+ #include <ATen/ops/slow_conv_transpose3d_cpu_dispatch.h>
453
+ #include <ATen/ops/smooth_l1_loss_cpu_dispatch.h>
454
+ #include <ATen/ops/smooth_l1_loss_backward_cpu_dispatch.h>
455
+ #include <ATen/ops/softplus_cpu_dispatch.h>
456
+ #include <ATen/ops/softplus_backward_cpu_dispatch.h>
457
+ #include <ATen/ops/softshrink_cpu_dispatch.h>
458
+ #include <ATen/ops/softshrink_backward_cpu_dispatch.h>
459
+ #include <ATen/ops/sort_cpu_dispatch.h>
460
+ #include <ATen/ops/special_airy_ai_cpu_dispatch.h>
461
+ #include <ATen/ops/special_bessel_j0_cpu_dispatch.h>
462
+ #include <ATen/ops/special_bessel_j1_cpu_dispatch.h>
463
+ #include <ATen/ops/special_bessel_y0_cpu_dispatch.h>
464
+ #include <ATen/ops/special_bessel_y1_cpu_dispatch.h>
465
+ #include <ATen/ops/special_chebyshev_polynomial_t_cpu_dispatch.h>
466
+ #include <ATen/ops/special_chebyshev_polynomial_u_cpu_dispatch.h>
467
+ #include <ATen/ops/special_chebyshev_polynomial_v_cpu_dispatch.h>
468
+ #include <ATen/ops/special_chebyshev_polynomial_w_cpu_dispatch.h>
469
+ #include <ATen/ops/special_entr_cpu_dispatch.h>
470
+ #include <ATen/ops/special_erfcx_cpu_dispatch.h>
471
+ #include <ATen/ops/special_hermite_polynomial_h_cpu_dispatch.h>
472
+ #include <ATen/ops/special_hermite_polynomial_he_cpu_dispatch.h>
473
+ #include <ATen/ops/special_i0e_cpu_dispatch.h>
474
+ #include <ATen/ops/special_i1_cpu_dispatch.h>
475
+ #include <ATen/ops/special_i1e_cpu_dispatch.h>
476
+ #include <ATen/ops/special_laguerre_polynomial_l_cpu_dispatch.h>
477
+ #include <ATen/ops/special_legendre_polynomial_p_cpu_dispatch.h>
478
+ #include <ATen/ops/special_log_ndtr_cpu_dispatch.h>
479
+ #include <ATen/ops/special_modified_bessel_i0_cpu_dispatch.h>
480
+ #include <ATen/ops/special_modified_bessel_i1_cpu_dispatch.h>
481
+ #include <ATen/ops/special_modified_bessel_k0_cpu_dispatch.h>
482
+ #include <ATen/ops/special_modified_bessel_k1_cpu_dispatch.h>
483
+ #include <ATen/ops/special_ndtri_cpu_dispatch.h>
484
+ #include <ATen/ops/special_scaled_modified_bessel_k0_cpu_dispatch.h>
485
+ #include <ATen/ops/special_scaled_modified_bessel_k1_cpu_dispatch.h>
486
+ #include <ATen/ops/special_shifted_chebyshev_polynomial_t_cpu_dispatch.h>
487
+ #include <ATen/ops/special_shifted_chebyshev_polynomial_u_cpu_dispatch.h>
488
+ #include <ATen/ops/special_shifted_chebyshev_polynomial_v_cpu_dispatch.h>
489
+ #include <ATen/ops/special_shifted_chebyshev_polynomial_w_cpu_dispatch.h>
490
+ #include <ATen/ops/special_spherical_bessel_j0_cpu_dispatch.h>
491
+ #include <ATen/ops/special_xlog1py_cpu_dispatch.h>
492
+ #include <ATen/ops/special_zeta_cpu_dispatch.h>
493
+ #include <ATen/ops/sqrt_cpu_dispatch.h>
494
+ #include <ATen/ops/sspaddmm_cpu_dispatch.h>
495
+ #include <ATen/ops/std_cpu_dispatch.h>
496
+ #include <ATen/ops/std_mean_cpu_dispatch.h>
497
+ #include <ATen/ops/sub_cpu_dispatch.h>
498
+ #include <ATen/ops/sum_cpu_dispatch.h>
499
+ #include <ATen/ops/take_cpu_dispatch.h>
500
+ #include <ATen/ops/tan_cpu_dispatch.h>
501
+ #include <ATen/ops/tanh_cpu_dispatch.h>
502
+ #include <ATen/ops/tanh_backward_cpu_dispatch.h>
503
+ #include <ATen/ops/threshold_cpu_dispatch.h>
504
+ #include <ATen/ops/threshold_backward_cpu_dispatch.h>
505
+ #include <ATen/ops/to_mkldnn_cpu_dispatch.h>
506
+ #include <ATen/ops/topk_cpu_dispatch.h>
507
+ #include <ATen/ops/trace_cpu_dispatch.h>
508
+ #include <ATen/ops/triangular_solve_cpu_dispatch.h>
509
+ #include <ATen/ops/tril_cpu_dispatch.h>
510
+ #include <ATen/ops/tril_indices_cpu_dispatch.h>
511
+ #include <ATen/ops/triu_cpu_dispatch.h>
512
+ #include <ATen/ops/triu_indices_cpu_dispatch.h>
513
+ #include <ATen/ops/trunc_cpu_dispatch.h>
514
+ #include <ATen/ops/unfold_cpu_dispatch.h>
515
+ #include <ATen/ops/unfold_backward_cpu_dispatch.h>
516
+ #include <ATen/ops/uniform_cpu_dispatch.h>
517
+ #include <ATen/ops/unique_consecutive_cpu_dispatch.h>
518
+ #include <ATen/ops/unique_dim_cpu_dispatch.h>
519
+ #include <ATen/ops/unique_dim_consecutive_cpu_dispatch.h>
520
+ #include <ATen/ops/upsample_bicubic2d_cpu_dispatch.h>
521
+ #include <ATen/ops/upsample_bicubic2d_backward_cpu_dispatch.h>
522
+ #include <ATen/ops/upsample_bilinear2d_cpu_dispatch.h>
523
+ #include <ATen/ops/upsample_bilinear2d_backward_cpu_dispatch.h>
524
+ #include <ATen/ops/upsample_linear1d_cpu_dispatch.h>
525
+ #include <ATen/ops/upsample_linear1d_backward_cpu_dispatch.h>
526
+ #include <ATen/ops/upsample_nearest1d_cpu_dispatch.h>
527
+ #include <ATen/ops/upsample_nearest1d_backward_cpu_dispatch.h>
528
+ #include <ATen/ops/upsample_nearest2d_cpu_dispatch.h>
529
+ #include <ATen/ops/upsample_nearest2d_backward_cpu_dispatch.h>
530
+ #include <ATen/ops/upsample_nearest3d_cpu_dispatch.h>
531
+ #include <ATen/ops/upsample_nearest3d_backward_cpu_dispatch.h>
532
+ #include <ATen/ops/upsample_trilinear3d_cpu_dispatch.h>
533
+ #include <ATen/ops/upsample_trilinear3d_backward_cpu_dispatch.h>
534
+ #include <ATen/ops/var_cpu_dispatch.h>
535
+ #include <ATen/ops/var_mean_cpu_dispatch.h>
536
+ #include <ATen/ops/vdot_cpu_dispatch.h>
537
+ #include <ATen/ops/view_cpu_dispatch.h>
538
+ #include <ATen/ops/view_as_complex_cpu_dispatch.h>
539
+ #include <ATen/ops/view_as_real_cpu_dispatch.h>
540
+ #include <ATen/ops/where_cpu_dispatch.h>
541
+ #include <ATen/ops/xlogy_cpu_dispatch.h>
542
+ #include <ATen/ops/zero_cpu_dispatch.h>
543
+
544
+
545
+
546
+
547
+ #else
548
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
549
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CPUGeneratorImpl.h ADDED
@@ -0,0 +1,54 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+
4
+ #include <ATen/core/Generator.h>
5
+ #include <ATen/core/MT19937RNGEngine.h>
6
+ #include <c10/core/GeneratorImpl.h>
7
+ #include <optional>
8
+
9
+ namespace at {
10
+
11
+ struct TORCH_API CPUGeneratorImpl : public c10::GeneratorImpl {
12
+ // Constructors
13
+ CPUGeneratorImpl(uint64_t seed_in = default_rng_seed_val);
14
+ ~CPUGeneratorImpl() override = default;
15
+
16
+ // CPUGeneratorImpl methods
17
+ std::shared_ptr<CPUGeneratorImpl> clone() const;
18
+ void set_current_seed(uint64_t seed) override;
19
+ void set_offset(uint64_t offset) override;
20
+ uint64_t get_offset() const override;
21
+ uint64_t current_seed() const override;
22
+ uint64_t seed() override;
23
+ void set_state(const c10::TensorImpl& new_state) override;
24
+ c10::intrusive_ptr<c10::TensorImpl> get_state() const override;
25
+ static c10::DeviceType device_type();
26
+ uint32_t random();
27
+ uint64_t random64();
28
+ std::optional<float> next_float_normal_sample();
29
+ std::optional<double> next_double_normal_sample();
30
+ void set_next_float_normal_sample(std::optional<float> randn);
31
+ void set_next_double_normal_sample(std::optional<double> randn);
32
+ at::mt19937 engine();
33
+ void set_engine(at::mt19937 engine);
34
+
35
+ private:
36
+ CPUGeneratorImpl* clone_impl() const override;
37
+ at::mt19937 engine_;
38
+ std::optional<float> next_float_normal_sample_;
39
+ std::optional<double> next_double_normal_sample_;
40
+ };
41
+
42
+ namespace detail {
43
+
44
+ TORCH_API const Generator& getDefaultCPUGenerator();
45
+ TORCH_API Generator
46
+ createCPUGenerator(uint64_t seed_val = default_rng_seed_val);
47
+
48
+ } // namespace detail
49
+
50
+ } // namespace at
51
+
52
+ #else
53
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
54
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CUDAFunctions.h ADDED
@@ -0,0 +1,34 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #include <ATen/core/TensorBody.h>
3
+
4
+ // TODO Undo all logic introduced for Note [Avoiding Include Cycles In Static Dispatch]
5
+ // Code introduced to avoid cyclic dependency in static dispatch is no longer
6
+ // needed as static dispatch logic is moved from TensorBody.h, which caused cycles in the first place,
7
+ // to Operators.cpp for supporting multiple backends with multiple kernels.
8
+ //
9
+ // Note [Avoiding Include Cycles In Static Dispatch]
10
+ // In order to avoid #include cycles in the static dispatch build, we've carefully split out
11
+ // the static function definition files into {DispatchKey}Functions.h and {DispatchKey}Functions_inl.h.
12
+ //
13
+ // Without this split, the include cycle looks like TensorBody.h -> CPUFunctions.h -> TensorBody.h.
14
+ // - TensorBody.h #includes CPUFunctions.h in the static dispatch build, because the tensor methods
15
+ // all need to call into the fastpath C++ API defined in CPUFunctions.h. The methods are also all
16
+ // directly inlined into TensorBody.h.
17
+ // - CPUFunctions.h #includes TensorBody.h because it contains function declarations for the entire C++ API,
18
+ // which include functions that have defaultable std::optional<Tensor> arguments.
19
+ // That requires knowing the full Tensor class definition.
20
+ //
21
+ // We break the cycle by doing the following:
22
+ // - Split out CPUFunction.h into two files: CPUFunctions.h and CPUFunctions_inl.h
23
+ // - CPUFunction.h is a dummy file that just includes the Tensor class and includes CPUFunctions_inl.,
24
+ // - CPUFunctions_inl.h includes everything else
25
+ // - (only in the static dispatch build) TensorBody.h makes sure to finish defining the Tensor class,
26
+ // and then it includes CPUFunctions_inl.h.
27
+ // - All other files that want the cpu fastpath functions can include CPUFunctions.h directly.
28
+ // - This also means that static dispatch build, CPUFunctions.h only needs to
29
+ // #include TensorBody.h, and it will automatically bring in CPUFunctions_inl.h.
30
+ #include <ATen/CUDAFunctions_inl.h>
31
+
32
+ #else
33
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
34
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CUDAFunctions_inl.h ADDED
@@ -0,0 +1,641 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+ // @generated by torchgen/gen.py from DispatchKeyFunctions_inl.h
4
+
5
+ // NB: The implementing C++ file is RegisterDispatchKey.cpp
6
+
7
+ // The only #includes we need are for custom classes that have defaults in the C++ API
8
+ #include <c10/core/MemoryFormat.h>
9
+ #include <c10/core/Scalar.h>
10
+ #include <ATen/core/Reduction.h>
11
+
12
+ #if defined(AT_PER_OPERATOR_HEADERS) && defined(TORCH_ASSERT_ONLY_METHOD_OPERATORS)
13
+ #error This change adds a dependency on all pytorch operators, meaning the \
14
+ file will need to be re-compiled every time an operator is changed or added. \
15
+ Consider including a specific operator from \
16
+ <ATen/ops/{my_operator}_cuda_dispatch.h>. \
17
+ See NOTE [TORCH_ASSERT_ONLY_METHOD_OPERATORS].
18
+ #endif
19
+
20
+ #include <ATen/ops/_adaptive_avg_pool2d_cuda_dispatch.h>
21
+ #include <ATen/ops/_adaptive_avg_pool2d_backward_cuda_dispatch.h>
22
+ #include <ATen/ops/_adaptive_avg_pool3d_cuda_dispatch.h>
23
+ #include <ATen/ops/_adaptive_avg_pool3d_backward_cuda_dispatch.h>
24
+ #include <ATen/ops/_addmm_activation_cuda_dispatch.h>
25
+ #include <ATen/ops/_aminmax_cuda_dispatch.h>
26
+ #include <ATen/ops/_amp_foreach_non_finite_check_and_unscale_cuda_dispatch.h>
27
+ #include <ATen/ops/_amp_update_scale_cuda_dispatch.h>
28
+ #include <ATen/ops/_assert_async_cuda_dispatch.h>
29
+ #include <ATen/ops/_batch_norm_with_update_cuda_dispatch.h>
30
+ #include <ATen/ops/_cdist_backward_cuda_dispatch.h>
31
+ #include <ATen/ops/_cdist_forward_cuda_dispatch.h>
32
+ #include <ATen/ops/_cholesky_solve_helper_cuda_dispatch.h>
33
+ #include <ATen/ops/_chunk_cat_cuda_dispatch.h>
34
+ #include <ATen/ops/_compute_linear_combination_cuda_dispatch.h>
35
+ #include <ATen/ops/_conv_depthwise2d_cuda_dispatch.h>
36
+ #include <ATen/ops/_convert_indices_from_coo_to_csr_cuda_dispatch.h>
37
+ #include <ATen/ops/_convert_indices_from_csr_to_coo_cuda_dispatch.h>
38
+ #include <ATen/ops/_convert_weight_to_int4pack_cuda_dispatch.h>
39
+ #include <ATen/ops/_cslt_compress_cuda_dispatch.h>
40
+ #include <ATen/ops/_cslt_sparse_mm_cuda_dispatch.h>
41
+ #include <ATen/ops/_cslt_sparse_mm_search_cuda_dispatch.h>
42
+ #include <ATen/ops/_ctc_loss_cuda_dispatch.h>
43
+ #include <ATen/ops/_ctc_loss_backward_cuda_dispatch.h>
44
+ #include <ATen/ops/_cudnn_attention_backward_cuda_dispatch.h>
45
+ #include <ATen/ops/_cudnn_attention_forward_cuda_dispatch.h>
46
+ #include <ATen/ops/_cudnn_ctc_loss_cuda_dispatch.h>
47
+ #include <ATen/ops/_cudnn_init_dropout_state_cuda_dispatch.h>
48
+ #include <ATen/ops/_cudnn_rnn_cuda_dispatch.h>
49
+ #include <ATen/ops/_cudnn_rnn_backward_cuda_dispatch.h>
50
+ #include <ATen/ops/_cudnn_rnn_flatten_weight_cuda_dispatch.h>
51
+ #include <ATen/ops/_cummax_helper_cuda_dispatch.h>
52
+ #include <ATen/ops/_cummin_helper_cuda_dispatch.h>
53
+ #include <ATen/ops/_dirichlet_grad_cuda_dispatch.h>
54
+ #include <ATen/ops/_efficient_attention_backward_cuda_dispatch.h>
55
+ #include <ATen/ops/_efficient_attention_forward_cuda_dispatch.h>
56
+ #include <ATen/ops/_efficientzerotensor_cuda_dispatch.h>
57
+ #include <ATen/ops/_embedding_bag_cuda_dispatch.h>
58
+ #include <ATen/ops/_embedding_bag_backward_cuda_dispatch.h>
59
+ #include <ATen/ops/_embedding_bag_dense_backward_cuda_dispatch.h>
60
+ #include <ATen/ops/_embedding_bag_forward_only_cuda_dispatch.h>
61
+ #include <ATen/ops/_embedding_bag_per_sample_weights_backward_cuda_dispatch.h>
62
+ #include <ATen/ops/_fake_quantize_learnable_per_channel_affine_cuda_dispatch.h>
63
+ #include <ATen/ops/_fake_quantize_learnable_per_channel_affine_backward_cuda_dispatch.h>
64
+ #include <ATen/ops/_fake_quantize_learnable_per_tensor_affine_cuda_dispatch.h>
65
+ #include <ATen/ops/_fake_quantize_learnable_per_tensor_affine_backward_cuda_dispatch.h>
66
+ #include <ATen/ops/_fake_quantize_per_tensor_affine_cachemask_tensor_qparams_cuda_dispatch.h>
67
+ #include <ATen/ops/_fft_c2c_cuda_dispatch.h>
68
+ #include <ATen/ops/_fft_c2r_cuda_dispatch.h>
69
+ #include <ATen/ops/_fft_r2c_cuda_dispatch.h>
70
+ #include <ATen/ops/_fill_mem_eff_dropout_mask_cuda_dispatch.h>
71
+ #include <ATen/ops/_flash_attention_backward_cuda_dispatch.h>
72
+ #include <ATen/ops/_flash_attention_forward_cuda_dispatch.h>
73
+ #include <ATen/ops/_foreach_abs_cuda_dispatch.h>
74
+ #include <ATen/ops/_foreach_acos_cuda_dispatch.h>
75
+ #include <ATen/ops/_foreach_add_cuda_dispatch.h>
76
+ #include <ATen/ops/_foreach_addcdiv_cuda_dispatch.h>
77
+ #include <ATen/ops/_foreach_addcmul_cuda_dispatch.h>
78
+ #include <ATen/ops/_foreach_asin_cuda_dispatch.h>
79
+ #include <ATen/ops/_foreach_atan_cuda_dispatch.h>
80
+ #include <ATen/ops/_foreach_ceil_cuda_dispatch.h>
81
+ #include <ATen/ops/_foreach_clamp_max_cuda_dispatch.h>
82
+ #include <ATen/ops/_foreach_clamp_min_cuda_dispatch.h>
83
+ #include <ATen/ops/_foreach_copy_cuda_dispatch.h>
84
+ #include <ATen/ops/_foreach_cos_cuda_dispatch.h>
85
+ #include <ATen/ops/_foreach_cosh_cuda_dispatch.h>
86
+ #include <ATen/ops/_foreach_div_cuda_dispatch.h>
87
+ #include <ATen/ops/_foreach_erf_cuda_dispatch.h>
88
+ #include <ATen/ops/_foreach_erfc_cuda_dispatch.h>
89
+ #include <ATen/ops/_foreach_exp_cuda_dispatch.h>
90
+ #include <ATen/ops/_foreach_expm1_cuda_dispatch.h>
91
+ #include <ATen/ops/_foreach_floor_cuda_dispatch.h>
92
+ #include <ATen/ops/_foreach_frac_cuda_dispatch.h>
93
+ #include <ATen/ops/_foreach_lerp_cuda_dispatch.h>
94
+ #include <ATen/ops/_foreach_lgamma_cuda_dispatch.h>
95
+ #include <ATen/ops/_foreach_log_cuda_dispatch.h>
96
+ #include <ATen/ops/_foreach_log10_cuda_dispatch.h>
97
+ #include <ATen/ops/_foreach_log1p_cuda_dispatch.h>
98
+ #include <ATen/ops/_foreach_log2_cuda_dispatch.h>
99
+ #include <ATen/ops/_foreach_max_cuda_dispatch.h>
100
+ #include <ATen/ops/_foreach_maximum_cuda_dispatch.h>
101
+ #include <ATen/ops/_foreach_minimum_cuda_dispatch.h>
102
+ #include <ATen/ops/_foreach_mul_cuda_dispatch.h>
103
+ #include <ATen/ops/_foreach_neg_cuda_dispatch.h>
104
+ #include <ATen/ops/_foreach_norm_cuda_dispatch.h>
105
+ #include <ATen/ops/_foreach_pow_cuda_dispatch.h>
106
+ #include <ATen/ops/_foreach_reciprocal_cuda_dispatch.h>
107
+ #include <ATen/ops/_foreach_round_cuda_dispatch.h>
108
+ #include <ATen/ops/_foreach_rsqrt_cuda_dispatch.h>
109
+ #include <ATen/ops/_foreach_sigmoid_cuda_dispatch.h>
110
+ #include <ATen/ops/_foreach_sign_cuda_dispatch.h>
111
+ #include <ATen/ops/_foreach_sin_cuda_dispatch.h>
112
+ #include <ATen/ops/_foreach_sinh_cuda_dispatch.h>
113
+ #include <ATen/ops/_foreach_sqrt_cuda_dispatch.h>
114
+ #include <ATen/ops/_foreach_sub_cuda_dispatch.h>
115
+ #include <ATen/ops/_foreach_tan_cuda_dispatch.h>
116
+ #include <ATen/ops/_foreach_tanh_cuda_dispatch.h>
117
+ #include <ATen/ops/_foreach_trunc_cuda_dispatch.h>
118
+ #include <ATen/ops/_foreach_zero_cuda_dispatch.h>
119
+ #include <ATen/ops/_fused_adagrad_cuda_dispatch.h>
120
+ #include <ATen/ops/_fused_adam_cuda_dispatch.h>
121
+ #include <ATen/ops/_fused_adamw_cuda_dispatch.h>
122
+ #include <ATen/ops/_fused_dropout_cuda_dispatch.h>
123
+ #include <ATen/ops/_fused_moving_avg_obs_fq_helper_cuda_dispatch.h>
124
+ #include <ATen/ops/_fused_rms_norm_cuda_dispatch.h>
125
+ #include <ATen/ops/_fused_rms_norm_backward_cuda_dispatch.h>
126
+ #include <ATen/ops/_fused_sdp_choice_cuda_dispatch.h>
127
+ #include <ATen/ops/_fused_sgd_cuda_dispatch.h>
128
+ #include <ATen/ops/_grouped_mm_cuda_dispatch.h>
129
+ #include <ATen/ops/_index_put_impl_cuda_dispatch.h>
130
+ #include <ATen/ops/_int_mm_cuda_dispatch.h>
131
+ #include <ATen/ops/_jagged_to_padded_dense_forward_cuda_dispatch.h>
132
+ #include <ATen/ops/_linalg_det_cuda_dispatch.h>
133
+ #include <ATen/ops/_linalg_eigh_cuda_dispatch.h>
134
+ #include <ATen/ops/_linalg_eigvals_cuda_dispatch.h>
135
+ #include <ATen/ops/_linalg_slogdet_cuda_dispatch.h>
136
+ #include <ATen/ops/_linalg_solve_ex_cuda_dispatch.h>
137
+ #include <ATen/ops/_linalg_svd_cuda_dispatch.h>
138
+ #include <ATen/ops/_local_scalar_dense_cuda_dispatch.h>
139
+ #include <ATen/ops/_log_softmax_cuda_dispatch.h>
140
+ #include <ATen/ops/_log_softmax_backward_data_cuda_dispatch.h>
141
+ #include <ATen/ops/_logcumsumexp_cuda_dispatch.h>
142
+ #include <ATen/ops/_make_per_channel_quantized_tensor_cuda_dispatch.h>
143
+ #include <ATen/ops/_make_per_tensor_quantized_tensor_cuda_dispatch.h>
144
+ #include <ATen/ops/_masked_scale_cuda_dispatch.h>
145
+ #include <ATen/ops/_masked_softmax_cuda_dispatch.h>
146
+ #include <ATen/ops/_masked_softmax_backward_cuda_dispatch.h>
147
+ #include <ATen/ops/_mixed_dtypes_linear_cuda_dispatch.h>
148
+ #include <ATen/ops/_native_batch_norm_legit_cuda_dispatch.h>
149
+ #include <ATen/ops/_native_multi_head_attention_cuda_dispatch.h>
150
+ #include <ATen/ops/_nested_compute_contiguous_strides_offsets_cuda_dispatch.h>
151
+ #include <ATen/ops/_nested_from_padded_cuda_dispatch.h>
152
+ #include <ATen/ops/_nested_tensor_from_mask_cuda_dispatch.h>
153
+ #include <ATen/ops/_nested_tensor_from_mask_left_aligned_cuda_dispatch.h>
154
+ #include <ATen/ops/_nested_view_from_buffer_cuda_dispatch.h>
155
+ #include <ATen/ops/_padded_dense_to_jagged_forward_cuda_dispatch.h>
156
+ #include <ATen/ops/_pdist_backward_cuda_dispatch.h>
157
+ #include <ATen/ops/_pdist_forward_cuda_dispatch.h>
158
+ #include <ATen/ops/_prelu_kernel_cuda_dispatch.h>
159
+ #include <ATen/ops/_prelu_kernel_backward_cuda_dispatch.h>
160
+ #include <ATen/ops/_reshape_alias_cuda_dispatch.h>
161
+ #include <ATen/ops/_sample_dirichlet_cuda_dispatch.h>
162
+ #include <ATen/ops/_scaled_dot_product_cudnn_attention_cuda_dispatch.h>
163
+ #include <ATen/ops/_scaled_dot_product_cudnn_attention_backward_cuda_dispatch.h>
164
+ #include <ATen/ops/_scaled_dot_product_efficient_attention_cuda_dispatch.h>
165
+ #include <ATen/ops/_scaled_dot_product_efficient_attention_backward_cuda_dispatch.h>
166
+ #include <ATen/ops/_scaled_dot_product_flash_attention_cuda_dispatch.h>
167
+ #include <ATen/ops/_scaled_dot_product_flash_attention_backward_cuda_dispatch.h>
168
+ #include <ATen/ops/_scaled_grouped_mm_cuda_dispatch.h>
169
+ #include <ATen/ops/_scaled_grouped_mm_v2_cuda_dispatch.h>
170
+ #include <ATen/ops/_scaled_mm_cuda_dispatch.h>
171
+ #include <ATen/ops/_scaled_mm_v2_cuda_dispatch.h>
172
+ #include <ATen/ops/_segment_reduce_backward_cuda_dispatch.h>
173
+ #include <ATen/ops/_slow_conv2d_backward_cuda_dispatch.h>
174
+ #include <ATen/ops/_slow_conv2d_forward_cuda_dispatch.h>
175
+ #include <ATen/ops/_softmax_cuda_dispatch.h>
176
+ #include <ATen/ops/_softmax_backward_data_cuda_dispatch.h>
177
+ #include <ATen/ops/_sparse_semi_structured_addmm_cuda_dispatch.h>
178
+ #include <ATen/ops/_sparse_semi_structured_apply_cuda_dispatch.h>
179
+ #include <ATen/ops/_sparse_semi_structured_apply_dense_cuda_dispatch.h>
180
+ #include <ATen/ops/_sparse_semi_structured_linear_cuda_dispatch.h>
181
+ #include <ATen/ops/_sparse_semi_structured_mm_cuda_dispatch.h>
182
+ #include <ATen/ops/_sparse_semi_structured_tile_cuda_dispatch.h>
183
+ #include <ATen/ops/_standard_gamma_cuda_dispatch.h>
184
+ #include <ATen/ops/_standard_gamma_grad_cuda_dispatch.h>
185
+ #include <ATen/ops/_thnn_fused_gru_cell_cuda_dispatch.h>
186
+ #include <ATen/ops/_thnn_fused_gru_cell_backward_cuda_dispatch.h>
187
+ #include <ATen/ops/_thnn_fused_lstm_cell_cuda_dispatch.h>
188
+ #include <ATen/ops/_thnn_fused_lstm_cell_backward_impl_cuda_dispatch.h>
189
+ #include <ATen/ops/_to_sparse_cuda_dispatch.h>
190
+ #include <ATen/ops/_to_sparse_bsc_cuda_dispatch.h>
191
+ #include <ATen/ops/_to_sparse_bsr_cuda_dispatch.h>
192
+ #include <ATen/ops/_to_sparse_csc_cuda_dispatch.h>
193
+ #include <ATen/ops/_to_sparse_csr_cuda_dispatch.h>
194
+ #include <ATen/ops/_to_sparse_semi_structured_cuda_dispatch.h>
195
+ #include <ATen/ops/_transform_bias_rescale_qkv_cuda_dispatch.h>
196
+ #include <ATen/ops/_transformer_encoder_layer_fwd_cuda_dispatch.h>
197
+ #include <ATen/ops/_triton_multi_head_attention_cuda_dispatch.h>
198
+ #include <ATen/ops/_triton_scaled_dot_attention_cuda_dispatch.h>
199
+ #include <ATen/ops/_unique_cuda_dispatch.h>
200
+ #include <ATen/ops/_unique2_cuda_dispatch.h>
201
+ #include <ATen/ops/_upsample_bicubic2d_aa_cuda_dispatch.h>
202
+ #include <ATen/ops/_upsample_bicubic2d_aa_backward_cuda_dispatch.h>
203
+ #include <ATen/ops/_upsample_bilinear2d_aa_cuda_dispatch.h>
204
+ #include <ATen/ops/_upsample_bilinear2d_aa_backward_cuda_dispatch.h>
205
+ #include <ATen/ops/_upsample_nearest_exact1d_cuda_dispatch.h>
206
+ #include <ATen/ops/_upsample_nearest_exact1d_backward_cuda_dispatch.h>
207
+ #include <ATen/ops/_upsample_nearest_exact2d_cuda_dispatch.h>
208
+ #include <ATen/ops/_upsample_nearest_exact2d_backward_cuda_dispatch.h>
209
+ #include <ATen/ops/_upsample_nearest_exact3d_cuda_dispatch.h>
210
+ #include <ATen/ops/_upsample_nearest_exact3d_backward_cuda_dispatch.h>
211
+ #include <ATen/ops/_use_cudnn_ctc_loss_cuda_dispatch.h>
212
+ #include <ATen/ops/_validate_compressed_sparse_indices_cuda_dispatch.h>
213
+ #include <ATen/ops/_weight_int4pack_mm_cuda_dispatch.h>
214
+ #include <ATen/ops/_weight_int8pack_mm_cuda_dispatch.h>
215
+ #include <ATen/ops/_weight_norm_interface_cuda_dispatch.h>
216
+ #include <ATen/ops/_weight_norm_interface_backward_cuda_dispatch.h>
217
+ #include <ATen/ops/abs_cuda_dispatch.h>
218
+ #include <ATen/ops/acos_cuda_dispatch.h>
219
+ #include <ATen/ops/acosh_cuda_dispatch.h>
220
+ #include <ATen/ops/adaptive_avg_pool2d_cuda_dispatch.h>
221
+ #include <ATen/ops/adaptive_avg_pool3d_cuda_dispatch.h>
222
+ #include <ATen/ops/adaptive_avg_pool3d_backward_cuda_dispatch.h>
223
+ #include <ATen/ops/adaptive_max_pool2d_cuda_dispatch.h>
224
+ #include <ATen/ops/adaptive_max_pool2d_backward_cuda_dispatch.h>
225
+ #include <ATen/ops/adaptive_max_pool3d_cuda_dispatch.h>
226
+ #include <ATen/ops/adaptive_max_pool3d_backward_cuda_dispatch.h>
227
+ #include <ATen/ops/add_cuda_dispatch.h>
228
+ #include <ATen/ops/addbmm_cuda_dispatch.h>
229
+ #include <ATen/ops/addcdiv_cuda_dispatch.h>
230
+ #include <ATen/ops/addcmul_cuda_dispatch.h>
231
+ #include <ATen/ops/addmm_cuda_dispatch.h>
232
+ #include <ATen/ops/addmv_cuda_dispatch.h>
233
+ #include <ATen/ops/addr_cuda_dispatch.h>
234
+ #include <ATen/ops/all_cuda_dispatch.h>
235
+ #include <ATen/ops/amax_cuda_dispatch.h>
236
+ #include <ATen/ops/amin_cuda_dispatch.h>
237
+ #include <ATen/ops/aminmax_cuda_dispatch.h>
238
+ #include <ATen/ops/angle_cuda_dispatch.h>
239
+ #include <ATen/ops/any_cuda_dispatch.h>
240
+ #include <ATen/ops/arange_cuda_dispatch.h>
241
+ #include <ATen/ops/argmax_cuda_dispatch.h>
242
+ #include <ATen/ops/argmin_cuda_dispatch.h>
243
+ #include <ATen/ops/as_strided_cuda_dispatch.h>
244
+ #include <ATen/ops/asin_cuda_dispatch.h>
245
+ #include <ATen/ops/asinh_cuda_dispatch.h>
246
+ #include <ATen/ops/atan_cuda_dispatch.h>
247
+ #include <ATen/ops/atan2_cuda_dispatch.h>
248
+ #include <ATen/ops/atanh_cuda_dispatch.h>
249
+ #include <ATen/ops/avg_pool2d_cuda_dispatch.h>
250
+ #include <ATen/ops/avg_pool2d_backward_cuda_dispatch.h>
251
+ #include <ATen/ops/avg_pool3d_cuda_dispatch.h>
252
+ #include <ATen/ops/avg_pool3d_backward_cuda_dispatch.h>
253
+ #include <ATen/ops/baddbmm_cuda_dispatch.h>
254
+ #include <ATen/ops/batch_norm_backward_cuda_dispatch.h>
255
+ #include <ATen/ops/batch_norm_backward_elemt_cuda_dispatch.h>
256
+ #include <ATen/ops/batch_norm_backward_reduce_cuda_dispatch.h>
257
+ #include <ATen/ops/batch_norm_elemt_cuda_dispatch.h>
258
+ #include <ATen/ops/batch_norm_gather_stats_cuda_dispatch.h>
259
+ #include <ATen/ops/batch_norm_gather_stats_with_counts_cuda_dispatch.h>
260
+ #include <ATen/ops/batch_norm_stats_cuda_dispatch.h>
261
+ #include <ATen/ops/batch_norm_update_stats_cuda_dispatch.h>
262
+ #include <ATen/ops/bernoulli_cuda_dispatch.h>
263
+ #include <ATen/ops/binary_cross_entropy_cuda_dispatch.h>
264
+ #include <ATen/ops/binary_cross_entropy_backward_cuda_dispatch.h>
265
+ #include <ATen/ops/bincount_cuda_dispatch.h>
266
+ #include <ATen/ops/binomial_cuda_dispatch.h>
267
+ #include <ATen/ops/bitwise_and_cuda_dispatch.h>
268
+ #include <ATen/ops/bitwise_left_shift_cuda_dispatch.h>
269
+ #include <ATen/ops/bitwise_not_cuda_dispatch.h>
270
+ #include <ATen/ops/bitwise_or_cuda_dispatch.h>
271
+ #include <ATen/ops/bitwise_right_shift_cuda_dispatch.h>
272
+ #include <ATen/ops/bitwise_xor_cuda_dispatch.h>
273
+ #include <ATen/ops/bmm_cuda_dispatch.h>
274
+ #include <ATen/ops/bucketize_cuda_dispatch.h>
275
+ #include <ATen/ops/cat_cuda_dispatch.h>
276
+ #include <ATen/ops/cauchy_cuda_dispatch.h>
277
+ #include <ATen/ops/ceil_cuda_dispatch.h>
278
+ #include <ATen/ops/channel_shuffle_cuda_dispatch.h>
279
+ #include <ATen/ops/cholesky_cuda_dispatch.h>
280
+ #include <ATen/ops/cholesky_inverse_cuda_dispatch.h>
281
+ #include <ATen/ops/clamp_cuda_dispatch.h>
282
+ #include <ATen/ops/clamp_max_cuda_dispatch.h>
283
+ #include <ATen/ops/clamp_min_cuda_dispatch.h>
284
+ #include <ATen/ops/col2im_cuda_dispatch.h>
285
+ #include <ATen/ops/complex_cuda_dispatch.h>
286
+ #include <ATen/ops/conj_physical_cuda_dispatch.h>
287
+ #include <ATen/ops/conv_depthwise3d_cuda_dispatch.h>
288
+ #include <ATen/ops/convolution_backward_cuda_dispatch.h>
289
+ #include <ATen/ops/copysign_cuda_dispatch.h>
290
+ #include <ATen/ops/cos_cuda_dispatch.h>
291
+ #include <ATen/ops/cosh_cuda_dispatch.h>
292
+ #include <ATen/ops/count_nonzero_cuda_dispatch.h>
293
+ #include <ATen/ops/cudnn_affine_grid_generator_cuda_dispatch.h>
294
+ #include <ATen/ops/cudnn_affine_grid_generator_backward_cuda_dispatch.h>
295
+ #include <ATen/ops/cudnn_batch_norm_cuda_dispatch.h>
296
+ #include <ATen/ops/cudnn_batch_norm_backward_cuda_dispatch.h>
297
+ #include <ATen/ops/cudnn_convolution_cuda_dispatch.h>
298
+ #include <ATen/ops/cudnn_convolution_add_relu_cuda_dispatch.h>
299
+ #include <ATen/ops/cudnn_convolution_relu_cuda_dispatch.h>
300
+ #include <ATen/ops/cudnn_convolution_transpose_cuda_dispatch.h>
301
+ #include <ATen/ops/cudnn_grid_sampler_cuda_dispatch.h>
302
+ #include <ATen/ops/cudnn_grid_sampler_backward_cuda_dispatch.h>
303
+ #include <ATen/ops/cumprod_cuda_dispatch.h>
304
+ #include <ATen/ops/cumsum_cuda_dispatch.h>
305
+ #include <ATen/ops/dequantize_cuda_dispatch.h>
306
+ #include <ATen/ops/digamma_cuda_dispatch.h>
307
+ #include <ATen/ops/div_cuda_dispatch.h>
308
+ #include <ATen/ops/dot_cuda_dispatch.h>
309
+ #include <ATen/ops/elu_cuda_dispatch.h>
310
+ #include <ATen/ops/elu_backward_cuda_dispatch.h>
311
+ #include <ATen/ops/embedding_dense_backward_cuda_dispatch.h>
312
+ #include <ATen/ops/embedding_renorm_cuda_dispatch.h>
313
+ #include <ATen/ops/empty_cuda_dispatch.h>
314
+ #include <ATen/ops/empty_strided_cuda_dispatch.h>
315
+ #include <ATen/ops/eq_cuda_dispatch.h>
316
+ #include <ATen/ops/equal_cuda_dispatch.h>
317
+ #include <ATen/ops/erf_cuda_dispatch.h>
318
+ #include <ATen/ops/erfc_cuda_dispatch.h>
319
+ #include <ATen/ops/erfinv_cuda_dispatch.h>
320
+ #include <ATen/ops/exp_cuda_dispatch.h>
321
+ #include <ATen/ops/exp2_cuda_dispatch.h>
322
+ #include <ATen/ops/expm1_cuda_dispatch.h>
323
+ #include <ATen/ops/exponential_cuda_dispatch.h>
324
+ #include <ATen/ops/eye_cuda_dispatch.h>
325
+ #include <ATen/ops/fake_quantize_per_channel_affine_cachemask_cuda_dispatch.h>
326
+ #include <ATen/ops/fake_quantize_per_tensor_affine_cachemask_cuda_dispatch.h>
327
+ #include <ATen/ops/fill_cuda_dispatch.h>
328
+ #include <ATen/ops/flip_cuda_dispatch.h>
329
+ #include <ATen/ops/floor_cuda_dispatch.h>
330
+ #include <ATen/ops/floor_divide_cuda_dispatch.h>
331
+ #include <ATen/ops/fmax_cuda_dispatch.h>
332
+ #include <ATen/ops/fmin_cuda_dispatch.h>
333
+ #include <ATen/ops/fmod_cuda_dispatch.h>
334
+ #include <ATen/ops/frac_cuda_dispatch.h>
335
+ #include <ATen/ops/fractional_max_pool2d_cuda_dispatch.h>
336
+ #include <ATen/ops/fractional_max_pool2d_backward_cuda_dispatch.h>
337
+ #include <ATen/ops/fractional_max_pool3d_cuda_dispatch.h>
338
+ #include <ATen/ops/fractional_max_pool3d_backward_cuda_dispatch.h>
339
+ #include <ATen/ops/frexp_cuda_dispatch.h>
340
+ #include <ATen/ops/gather_cuda_dispatch.h>
341
+ #include <ATen/ops/gcd_cuda_dispatch.h>
342
+ #include <ATen/ops/ge_cuda_dispatch.h>
343
+ #include <ATen/ops/gelu_cuda_dispatch.h>
344
+ #include <ATen/ops/gelu_backward_cuda_dispatch.h>
345
+ #include <ATen/ops/geometric_cuda_dispatch.h>
346
+ #include <ATen/ops/geqrf_cuda_dispatch.h>
347
+ #include <ATen/ops/glu_cuda_dispatch.h>
348
+ #include <ATen/ops/glu_backward_cuda_dispatch.h>
349
+ #include <ATen/ops/glu_backward_jvp_cuda_dispatch.h>
350
+ #include <ATen/ops/glu_jvp_cuda_dispatch.h>
351
+ #include <ATen/ops/grid_sampler_2d_cuda_dispatch.h>
352
+ #include <ATen/ops/grid_sampler_2d_backward_cuda_dispatch.h>
353
+ #include <ATen/ops/grid_sampler_3d_cuda_dispatch.h>
354
+ #include <ATen/ops/grid_sampler_3d_backward_cuda_dispatch.h>
355
+ #include <ATen/ops/gt_cuda_dispatch.h>
356
+ #include <ATen/ops/hardshrink_cuda_dispatch.h>
357
+ #include <ATen/ops/hardshrink_backward_cuda_dispatch.h>
358
+ #include <ATen/ops/hardsigmoid_cuda_dispatch.h>
359
+ #include <ATen/ops/hardsigmoid_backward_cuda_dispatch.h>
360
+ #include <ATen/ops/hardswish_cuda_dispatch.h>
361
+ #include <ATen/ops/hardswish_backward_cuda_dispatch.h>
362
+ #include <ATen/ops/hardtanh_cuda_dispatch.h>
363
+ #include <ATen/ops/hardtanh_backward_cuda_dispatch.h>
364
+ #include <ATen/ops/hash_tensor_cuda_dispatch.h>
365
+ #include <ATen/ops/heaviside_cuda_dispatch.h>
366
+ #include <ATen/ops/histc_cuda_dispatch.h>
367
+ #include <ATen/ops/huber_loss_cuda_dispatch.h>
368
+ #include <ATen/ops/huber_loss_backward_cuda_dispatch.h>
369
+ #include <ATen/ops/hypot_cuda_dispatch.h>
370
+ #include <ATen/ops/i0_cuda_dispatch.h>
371
+ #include <ATen/ops/igamma_cuda_dispatch.h>
372
+ #include <ATen/ops/igammac_cuda_dispatch.h>
373
+ #include <ATen/ops/im2col_cuda_dispatch.h>
374
+ #include <ATen/ops/index_cuda_dispatch.h>
375
+ #include <ATen/ops/index_add_cuda_dispatch.h>
376
+ #include <ATen/ops/index_copy_cuda_dispatch.h>
377
+ #include <ATen/ops/index_fill_cuda_dispatch.h>
378
+ #include <ATen/ops/index_reduce_cuda_dispatch.h>
379
+ #include <ATen/ops/index_select_cuda_dispatch.h>
380
+ #include <ATen/ops/is_set_to_cuda_dispatch.h>
381
+ #include <ATen/ops/isin_cuda_dispatch.h>
382
+ #include <ATen/ops/isnan_cuda_dispatch.h>
383
+ #include <ATen/ops/isneginf_cuda_dispatch.h>
384
+ #include <ATen/ops/isposinf_cuda_dispatch.h>
385
+ #include <ATen/ops/kthvalue_cuda_dispatch.h>
386
+ #include <ATen/ops/lcm_cuda_dispatch.h>
387
+ #include <ATen/ops/le_cuda_dispatch.h>
388
+ #include <ATen/ops/leaky_relu_cuda_dispatch.h>
389
+ #include <ATen/ops/leaky_relu_backward_cuda_dispatch.h>
390
+ #include <ATen/ops/lerp_cuda_dispatch.h>
391
+ #include <ATen/ops/lgamma_cuda_dispatch.h>
392
+ #include <ATen/ops/linalg_cholesky_ex_cuda_dispatch.h>
393
+ #include <ATen/ops/linalg_cross_cuda_dispatch.h>
394
+ #include <ATen/ops/linalg_eig_cuda_dispatch.h>
395
+ #include <ATen/ops/linalg_eigvals_cuda_dispatch.h>
396
+ #include <ATen/ops/linalg_householder_product_cuda_dispatch.h>
397
+ #include <ATen/ops/linalg_inv_ex_cuda_dispatch.h>
398
+ #include <ATen/ops/linalg_ldl_factor_ex_cuda_dispatch.h>
399
+ #include <ATen/ops/linalg_ldl_solve_cuda_dispatch.h>
400
+ #include <ATen/ops/linalg_lstsq_cuda_dispatch.h>
401
+ #include <ATen/ops/linalg_lu_cuda_dispatch.h>
402
+ #include <ATen/ops/linalg_lu_factor_ex_cuda_dispatch.h>
403
+ #include <ATen/ops/linalg_lu_solve_cuda_dispatch.h>
404
+ #include <ATen/ops/linalg_matrix_exp_cuda_dispatch.h>
405
+ #include <ATen/ops/linalg_qr_cuda_dispatch.h>
406
+ #include <ATen/ops/linalg_solve_triangular_cuda_dispatch.h>
407
+ #include <ATen/ops/linalg_vector_norm_cuda_dispatch.h>
408
+ #include <ATen/ops/linspace_cuda_dispatch.h>
409
+ #include <ATen/ops/log_cuda_dispatch.h>
410
+ #include <ATen/ops/log10_cuda_dispatch.h>
411
+ #include <ATen/ops/log1p_cuda_dispatch.h>
412
+ #include <ATen/ops/log2_cuda_dispatch.h>
413
+ #include <ATen/ops/log_normal_cuda_dispatch.h>
414
+ #include <ATen/ops/log_sigmoid_backward_cuda_dispatch.h>
415
+ #include <ATen/ops/log_sigmoid_forward_cuda_dispatch.h>
416
+ #include <ATen/ops/logaddexp_cuda_dispatch.h>
417
+ #include <ATen/ops/logaddexp2_cuda_dispatch.h>
418
+ #include <ATen/ops/logical_and_cuda_dispatch.h>
419
+ #include <ATen/ops/logical_not_cuda_dispatch.h>
420
+ #include <ATen/ops/logical_or_cuda_dispatch.h>
421
+ #include <ATen/ops/logical_xor_cuda_dispatch.h>
422
+ #include <ATen/ops/logit_cuda_dispatch.h>
423
+ #include <ATen/ops/logit_backward_cuda_dispatch.h>
424
+ #include <ATen/ops/logspace_cuda_dispatch.h>
425
+ #include <ATen/ops/lshift_cuda_dispatch.h>
426
+ #include <ATen/ops/lt_cuda_dispatch.h>
427
+ #include <ATen/ops/lu_unpack_cuda_dispatch.h>
428
+ #include <ATen/ops/masked_fill_cuda_dispatch.h>
429
+ #include <ATen/ops/masked_scatter_cuda_dispatch.h>
430
+ #include <ATen/ops/masked_select_cuda_dispatch.h>
431
+ #include <ATen/ops/max_cuda_dispatch.h>
432
+ #include <ATen/ops/max_pool2d_with_indices_cuda_dispatch.h>
433
+ #include <ATen/ops/max_pool2d_with_indices_backward_cuda_dispatch.h>
434
+ #include <ATen/ops/max_pool3d_with_indices_cuda_dispatch.h>
435
+ #include <ATen/ops/max_pool3d_with_indices_backward_cuda_dispatch.h>
436
+ #include <ATen/ops/max_unpool2d_cuda_dispatch.h>
437
+ #include <ATen/ops/max_unpool3d_cuda_dispatch.h>
438
+ #include <ATen/ops/maximum_cuda_dispatch.h>
439
+ #include <ATen/ops/mean_cuda_dispatch.h>
440
+ #include <ATen/ops/median_cuda_dispatch.h>
441
+ #include <ATen/ops/min_cuda_dispatch.h>
442
+ #include <ATen/ops/minimum_cuda_dispatch.h>
443
+ #include <ATen/ops/miopen_batch_norm_cuda_dispatch.h>
444
+ #include <ATen/ops/miopen_batch_norm_backward_cuda_dispatch.h>
445
+ #include <ATen/ops/miopen_convolution_cuda_dispatch.h>
446
+ #include <ATen/ops/miopen_convolution_add_relu_cuda_dispatch.h>
447
+ #include <ATen/ops/miopen_convolution_relu_cuda_dispatch.h>
448
+ #include <ATen/ops/miopen_convolution_transpose_cuda_dispatch.h>
449
+ #include <ATen/ops/miopen_depthwise_convolution_cuda_dispatch.h>
450
+ #include <ATen/ops/miopen_rnn_cuda_dispatch.h>
451
+ #include <ATen/ops/miopen_rnn_backward_cuda_dispatch.h>
452
+ #include <ATen/ops/mish_cuda_dispatch.h>
453
+ #include <ATen/ops/mish_backward_cuda_dispatch.h>
454
+ #include <ATen/ops/mm_cuda_dispatch.h>
455
+ #include <ATen/ops/mode_cuda_dispatch.h>
456
+ #include <ATen/ops/mse_loss_cuda_dispatch.h>
457
+ #include <ATen/ops/mse_loss_backward_cuda_dispatch.h>
458
+ #include <ATen/ops/mul_cuda_dispatch.h>
459
+ #include <ATen/ops/multi_margin_loss_cuda_dispatch.h>
460
+ #include <ATen/ops/multi_margin_loss_backward_cuda_dispatch.h>
461
+ #include <ATen/ops/multilabel_margin_loss_backward_cuda_dispatch.h>
462
+ #include <ATen/ops/multilabel_margin_loss_forward_cuda_dispatch.h>
463
+ #include <ATen/ops/multinomial_cuda_dispatch.h>
464
+ #include <ATen/ops/mvlgamma_cuda_dispatch.h>
465
+ #include <ATen/ops/nan_to_num_cuda_dispatch.h>
466
+ #include <ATen/ops/nanmedian_cuda_dispatch.h>
467
+ #include <ATen/ops/nansum_cuda_dispatch.h>
468
+ #include <ATen/ops/native_batch_norm_cuda_dispatch.h>
469
+ #include <ATen/ops/native_batch_norm_backward_cuda_dispatch.h>
470
+ #include <ATen/ops/native_dropout_cuda_dispatch.h>
471
+ #include <ATen/ops/native_dropout_backward_cuda_dispatch.h>
472
+ #include <ATen/ops/native_group_norm_cuda_dispatch.h>
473
+ #include <ATen/ops/native_group_norm_backward_cuda_dispatch.h>
474
+ #include <ATen/ops/native_layer_norm_cuda_dispatch.h>
475
+ #include <ATen/ops/native_layer_norm_backward_cuda_dispatch.h>
476
+ #include <ATen/ops/ne_cuda_dispatch.h>
477
+ #include <ATen/ops/neg_cuda_dispatch.h>
478
+ #include <ATen/ops/nextafter_cuda_dispatch.h>
479
+ #include <ATen/ops/nll_loss2d_backward_cuda_dispatch.h>
480
+ #include <ATen/ops/nll_loss2d_forward_cuda_dispatch.h>
481
+ #include <ATen/ops/nll_loss_backward_cuda_dispatch.h>
482
+ #include <ATen/ops/nll_loss_forward_cuda_dispatch.h>
483
+ #include <ATen/ops/nonzero_cuda_dispatch.h>
484
+ #include <ATen/ops/nonzero_static_cuda_dispatch.h>
485
+ #include <ATen/ops/norm_cuda_dispatch.h>
486
+ #include <ATen/ops/normal_cuda_dispatch.h>
487
+ #include <ATen/ops/ormqr_cuda_dispatch.h>
488
+ #include <ATen/ops/poisson_cuda_dispatch.h>
489
+ #include <ATen/ops/polar_cuda_dispatch.h>
490
+ #include <ATen/ops/polygamma_cuda_dispatch.h>
491
+ #include <ATen/ops/pow_cuda_dispatch.h>
492
+ #include <ATen/ops/prod_cuda_dispatch.h>
493
+ #include <ATen/ops/put_cuda_dispatch.h>
494
+ #include <ATen/ops/quantize_per_channel_cuda_dispatch.h>
495
+ #include <ATen/ops/quantize_per_tensor_cuda_dispatch.h>
496
+ #include <ATen/ops/quantize_per_tensor_dynamic_cuda_dispatch.h>
497
+ #include <ATen/ops/random_cuda_dispatch.h>
498
+ #include <ATen/ops/randperm_cuda_dispatch.h>
499
+ #include <ATen/ops/range_cuda_dispatch.h>
500
+ #include <ATen/ops/reciprocal_cuda_dispatch.h>
501
+ #include <ATen/ops/record_stream_cuda_dispatch.h>
502
+ #include <ATen/ops/reflection_pad1d_cuda_dispatch.h>
503
+ #include <ATen/ops/reflection_pad1d_backward_cuda_dispatch.h>
504
+ #include <ATen/ops/reflection_pad2d_cuda_dispatch.h>
505
+ #include <ATen/ops/reflection_pad2d_backward_cuda_dispatch.h>
506
+ #include <ATen/ops/reflection_pad3d_cuda_dispatch.h>
507
+ #include <ATen/ops/reflection_pad3d_backward_cuda_dispatch.h>
508
+ #include <ATen/ops/relu_cuda_dispatch.h>
509
+ #include <ATen/ops/remainder_cuda_dispatch.h>
510
+ #include <ATen/ops/renorm_cuda_dispatch.h>
511
+ #include <ATen/ops/repeat_interleave_cuda_dispatch.h>
512
+ #include <ATen/ops/replication_pad1d_cuda_dispatch.h>
513
+ #include <ATen/ops/replication_pad1d_backward_cuda_dispatch.h>
514
+ #include <ATen/ops/replication_pad2d_cuda_dispatch.h>
515
+ #include <ATen/ops/replication_pad2d_backward_cuda_dispatch.h>
516
+ #include <ATen/ops/replication_pad3d_cuda_dispatch.h>
517
+ #include <ATen/ops/replication_pad3d_backward_cuda_dispatch.h>
518
+ #include <ATen/ops/resize_cuda_dispatch.h>
519
+ #include <ATen/ops/roll_cuda_dispatch.h>
520
+ #include <ATen/ops/round_cuda_dispatch.h>
521
+ #include <ATen/ops/rrelu_with_noise_cuda_dispatch.h>
522
+ #include <ATen/ops/rshift_cuda_dispatch.h>
523
+ #include <ATen/ops/rsqrt_cuda_dispatch.h>
524
+ #include <ATen/ops/rsub_cuda_dispatch.h>
525
+ #include <ATen/ops/scatter_cuda_dispatch.h>
526
+ #include <ATen/ops/scatter_add_cuda_dispatch.h>
527
+ #include <ATen/ops/scatter_reduce_cuda_dispatch.h>
528
+ #include <ATen/ops/searchsorted_cuda_dispatch.h>
529
+ #include <ATen/ops/segment_reduce_cuda_dispatch.h>
530
+ #include <ATen/ops/set_cuda_dispatch.h>
531
+ #include <ATen/ops/sgn_cuda_dispatch.h>
532
+ #include <ATen/ops/sigmoid_cuda_dispatch.h>
533
+ #include <ATen/ops/sigmoid_backward_cuda_dispatch.h>
534
+ #include <ATen/ops/sign_cuda_dispatch.h>
535
+ #include <ATen/ops/signbit_cuda_dispatch.h>
536
+ #include <ATen/ops/silu_cuda_dispatch.h>
537
+ #include <ATen/ops/silu_backward_cuda_dispatch.h>
538
+ #include <ATen/ops/sin_cuda_dispatch.h>
539
+ #include <ATen/ops/sinc_cuda_dispatch.h>
540
+ #include <ATen/ops/sinh_cuda_dispatch.h>
541
+ #include <ATen/ops/slow_conv_dilated2d_cuda_dispatch.h>
542
+ #include <ATen/ops/slow_conv_dilated3d_cuda_dispatch.h>
543
+ #include <ATen/ops/slow_conv_transpose2d_cuda_dispatch.h>
544
+ #include <ATen/ops/slow_conv_transpose3d_cuda_dispatch.h>
545
+ #include <ATen/ops/smooth_l1_loss_cuda_dispatch.h>
546
+ #include <ATen/ops/smooth_l1_loss_backward_cuda_dispatch.h>
547
+ #include <ATen/ops/softplus_cuda_dispatch.h>
548
+ #include <ATen/ops/softplus_backward_cuda_dispatch.h>
549
+ #include <ATen/ops/softshrink_cuda_dispatch.h>
550
+ #include <ATen/ops/softshrink_backward_cuda_dispatch.h>
551
+ #include <ATen/ops/sort_cuda_dispatch.h>
552
+ #include <ATen/ops/special_airy_ai_cuda_dispatch.h>
553
+ #include <ATen/ops/special_bessel_j0_cuda_dispatch.h>
554
+ #include <ATen/ops/special_bessel_j1_cuda_dispatch.h>
555
+ #include <ATen/ops/special_bessel_y0_cuda_dispatch.h>
556
+ #include <ATen/ops/special_bessel_y1_cuda_dispatch.h>
557
+ #include <ATen/ops/special_chebyshev_polynomial_t_cuda_dispatch.h>
558
+ #include <ATen/ops/special_chebyshev_polynomial_u_cuda_dispatch.h>
559
+ #include <ATen/ops/special_chebyshev_polynomial_v_cuda_dispatch.h>
560
+ #include <ATen/ops/special_chebyshev_polynomial_w_cuda_dispatch.h>
561
+ #include <ATen/ops/special_entr_cuda_dispatch.h>
562
+ #include <ATen/ops/special_erfcx_cuda_dispatch.h>
563
+ #include <ATen/ops/special_hermite_polynomial_h_cuda_dispatch.h>
564
+ #include <ATen/ops/special_hermite_polynomial_he_cuda_dispatch.h>
565
+ #include <ATen/ops/special_i0e_cuda_dispatch.h>
566
+ #include <ATen/ops/special_i1_cuda_dispatch.h>
567
+ #include <ATen/ops/special_i1e_cuda_dispatch.h>
568
+ #include <ATen/ops/special_laguerre_polynomial_l_cuda_dispatch.h>
569
+ #include <ATen/ops/special_legendre_polynomial_p_cuda_dispatch.h>
570
+ #include <ATen/ops/special_log_ndtr_cuda_dispatch.h>
571
+ #include <ATen/ops/special_modified_bessel_i0_cuda_dispatch.h>
572
+ #include <ATen/ops/special_modified_bessel_i1_cuda_dispatch.h>
573
+ #include <ATen/ops/special_modified_bessel_k0_cuda_dispatch.h>
574
+ #include <ATen/ops/special_modified_bessel_k1_cuda_dispatch.h>
575
+ #include <ATen/ops/special_ndtri_cuda_dispatch.h>
576
+ #include <ATen/ops/special_scaled_modified_bessel_k0_cuda_dispatch.h>
577
+ #include <ATen/ops/special_scaled_modified_bessel_k1_cuda_dispatch.h>
578
+ #include <ATen/ops/special_shifted_chebyshev_polynomial_t_cuda_dispatch.h>
579
+ #include <ATen/ops/special_shifted_chebyshev_polynomial_u_cuda_dispatch.h>
580
+ #include <ATen/ops/special_shifted_chebyshev_polynomial_v_cuda_dispatch.h>
581
+ #include <ATen/ops/special_shifted_chebyshev_polynomial_w_cuda_dispatch.h>
582
+ #include <ATen/ops/special_spherical_bessel_j0_cuda_dispatch.h>
583
+ #include <ATen/ops/special_xlog1py_cuda_dispatch.h>
584
+ #include <ATen/ops/special_zeta_cuda_dispatch.h>
585
+ #include <ATen/ops/split_with_sizes_copy_cuda_dispatch.h>
586
+ #include <ATen/ops/sqrt_cuda_dispatch.h>
587
+ #include <ATen/ops/sspaddmm_cuda_dispatch.h>
588
+ #include <ATen/ops/std_cuda_dispatch.h>
589
+ #include <ATen/ops/std_mean_cuda_dispatch.h>
590
+ #include <ATen/ops/sub_cuda_dispatch.h>
591
+ #include <ATen/ops/sum_cuda_dispatch.h>
592
+ #include <ATen/ops/take_cuda_dispatch.h>
593
+ #include <ATen/ops/tan_cuda_dispatch.h>
594
+ #include <ATen/ops/tanh_cuda_dispatch.h>
595
+ #include <ATen/ops/tanh_backward_cuda_dispatch.h>
596
+ #include <ATen/ops/threshold_cuda_dispatch.h>
597
+ #include <ATen/ops/threshold_backward_cuda_dispatch.h>
598
+ #include <ATen/ops/topk_cuda_dispatch.h>
599
+ #include <ATen/ops/trace_cuda_dispatch.h>
600
+ #include <ATen/ops/triangular_solve_cuda_dispatch.h>
601
+ #include <ATen/ops/tril_cuda_dispatch.h>
602
+ #include <ATen/ops/tril_indices_cuda_dispatch.h>
603
+ #include <ATen/ops/triu_cuda_dispatch.h>
604
+ #include <ATen/ops/triu_indices_cuda_dispatch.h>
605
+ #include <ATen/ops/trunc_cuda_dispatch.h>
606
+ #include <ATen/ops/unfold_cuda_dispatch.h>
607
+ #include <ATen/ops/unfold_backward_cuda_dispatch.h>
608
+ #include <ATen/ops/uniform_cuda_dispatch.h>
609
+ #include <ATen/ops/unique_consecutive_cuda_dispatch.h>
610
+ #include <ATen/ops/unique_dim_cuda_dispatch.h>
611
+ #include <ATen/ops/unique_dim_consecutive_cuda_dispatch.h>
612
+ #include <ATen/ops/upsample_bicubic2d_cuda_dispatch.h>
613
+ #include <ATen/ops/upsample_bicubic2d_backward_cuda_dispatch.h>
614
+ #include <ATen/ops/upsample_bilinear2d_cuda_dispatch.h>
615
+ #include <ATen/ops/upsample_bilinear2d_backward_cuda_dispatch.h>
616
+ #include <ATen/ops/upsample_linear1d_cuda_dispatch.h>
617
+ #include <ATen/ops/upsample_linear1d_backward_cuda_dispatch.h>
618
+ #include <ATen/ops/upsample_nearest1d_cuda_dispatch.h>
619
+ #include <ATen/ops/upsample_nearest1d_backward_cuda_dispatch.h>
620
+ #include <ATen/ops/upsample_nearest2d_cuda_dispatch.h>
621
+ #include <ATen/ops/upsample_nearest2d_backward_cuda_dispatch.h>
622
+ #include <ATen/ops/upsample_nearest3d_cuda_dispatch.h>
623
+ #include <ATen/ops/upsample_nearest3d_backward_cuda_dispatch.h>
624
+ #include <ATen/ops/upsample_trilinear3d_cuda_dispatch.h>
625
+ #include <ATen/ops/upsample_trilinear3d_backward_cuda_dispatch.h>
626
+ #include <ATen/ops/var_cuda_dispatch.h>
627
+ #include <ATen/ops/var_mean_cuda_dispatch.h>
628
+ #include <ATen/ops/vdot_cuda_dispatch.h>
629
+ #include <ATen/ops/view_cuda_dispatch.h>
630
+ #include <ATen/ops/view_as_complex_cuda_dispatch.h>
631
+ #include <ATen/ops/view_as_real_cuda_dispatch.h>
632
+ #include <ATen/ops/where_cuda_dispatch.h>
633
+ #include <ATen/ops/xlogy_cuda_dispatch.h>
634
+ #include <ATen/ops/zero_cuda_dispatch.h>
635
+
636
+
637
+
638
+
639
+ #else
640
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
641
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CachedTensorUtils.h ADDED
@@ -0,0 +1,29 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+
4
+ #include <ATen/ATen.h>
5
+
6
+ namespace at::caching {
7
+
8
+ // Some systems (just cudagraphs currently) will persist a static tensor output
9
+ // whose TensorImpl does not change across iterations. For these tensors caching
10
+ // dtype conversions is invalid. Additionally, there will be an extra reference
11
+ // count to these cached tensors that would prevent buffer inplacing and other
12
+ // checks on tensor uniqueness. If we are not using these systems the enabled
13
+ // flag will be false and we will avoid the hash lookup.
14
+
15
+ TORCH_API bool is_cached_tensor(const at::Tensor& t);
16
+ TORCH_API void add_cached_tensor(const at::Tensor& t);
17
+ TORCH_API void remove_cached_tensor(const at::Tensor& t);
18
+ TORCH_API void set_cached_tensors_enabled(bool enable);
19
+
20
+ // For gradient buffer stealing we will adjust the use count of tensors
21
+ // which are persisted by cudagraphs, just as we need to adjust reference
22
+ // count of tensors with hooks.
23
+ TORCH_API size_t adjusted_use_count(const at::Tensor& t);
24
+
25
+ } // namespace at::caching
26
+
27
+ #else
28
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
29
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CollapseDims.h ADDED
@@ -0,0 +1,99 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #include <c10/util/Exception.h>
3
+ #include <utility>
4
+
5
+ namespace at {
6
+
7
+ /*
8
+ [collapse dims] Updates sizes, and strides to reflect a "collapse" of
9
+ the info, possibly excluding the optional excludeDim. A "collapsed" version
10
+ of the info is the fewest dims that order the tensor's elements in the same
11
+ way as the original info. If excludeDim is specified, the collapse is the
12
+ fewest dims that order the tensor's elements as the original and preserve the
13
+ excluded dimension, unless the tensor collapses to a point.
14
+
15
+ This function returns a pair of values.
16
+
17
+ 1) The (new) index of the preserved dimension if excludeDim is
18
+ specified. 0 if the tensor is collapsed to a point. -1
19
+ otherwise.
20
+
21
+ 2) The new number of dimensions.
22
+ */
23
+ template <typename T>
24
+ inline std::pair<int64_t, int64_t> collapse_dims(
25
+ T* sizes,
26
+ T* strides,
27
+ int64_t dims,
28
+ const int excludeDim = -1) {
29
+ TORCH_CHECK(
30
+ excludeDim >= -1 && excludeDim < dims,
31
+ "expected excluded dim between -1 and dims - 1");
32
+
33
+ int64_t stopDim = (excludeDim == -1) ? dims : excludeDim;
34
+ int64_t newIndex = -1;
35
+ int64_t oldIndex = 0;
36
+ int64_t remappedExcludedDim = -1;
37
+
38
+ while (oldIndex < dims) {
39
+ // Finds a dimension to collapse into
40
+ for (; oldIndex < stopDim; ++oldIndex) {
41
+ if (sizes[oldIndex] == 1) {
42
+ continue;
43
+ }
44
+
45
+ ++newIndex;
46
+ sizes[newIndex] = sizes[oldIndex];
47
+ strides[newIndex] = strides[oldIndex];
48
+ ++oldIndex;
49
+ break;
50
+ }
51
+
52
+ // Collapses dims
53
+ for (; oldIndex < stopDim; ++oldIndex) {
54
+ if (sizes[oldIndex] == 1) {
55
+ continue;
56
+ }
57
+
58
+ if (strides[newIndex] == sizes[oldIndex] * strides[oldIndex]) {
59
+ sizes[newIndex] *= sizes[oldIndex];
60
+ strides[newIndex] = strides[oldIndex];
61
+ } else {
62
+ ++newIndex;
63
+ sizes[newIndex] = sizes[oldIndex];
64
+ strides[newIndex] = strides[oldIndex];
65
+ }
66
+ }
67
+
68
+ // Handles excludeDim being set (oldIndex == excludeDim)
69
+ if (oldIndex != dims) {
70
+ // Preserves excluded dimension
71
+ ++newIndex;
72
+ sizes[newIndex] = sizes[oldIndex];
73
+ strides[newIndex] = strides[oldIndex];
74
+ remappedExcludedDim = newIndex;
75
+
76
+ // Restarts iteration after excludeDim
77
+ ++oldIndex;
78
+ stopDim = dims;
79
+ }
80
+ }
81
+
82
+ // Handles special case of all dims size 1
83
+ if (newIndex == -1 || (newIndex == 0 && sizes[0] == 1)) {
84
+ dims = 1;
85
+ sizes[0] = 1;
86
+ strides[0] = 1;
87
+
88
+ return std::pair<int64_t, int64_t>(0, 1);
89
+ }
90
+
91
+ dims = newIndex + 1;
92
+ return std::pair<int64_t, int64_t>(remappedExcludedDim, dims);
93
+ }
94
+
95
+ } // namespace at
96
+
97
+ #else
98
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
99
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CompositeExplicitAutogradFunctions.h ADDED
@@ -0,0 +1,34 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #include <ATen/core/TensorBody.h>
3
+
4
+ // TODO Undo all logic introduced for Note [Avoiding Include Cycles In Static Dispatch]
5
+ // Code introduced to avoid cyclic dependency in static dispatch is no longer
6
+ // needed as static dispatch logic is moved from TensorBody.h, which caused cycles in the first place,
7
+ // to Operators.cpp for supporting multiple backends with multiple kernels.
8
+ //
9
+ // Note [Avoiding Include Cycles In Static Dispatch]
10
+ // In order to avoid #include cycles in the static dispatch build, we've carefully split out
11
+ // the static function definition files into {DispatchKey}Functions.h and {DispatchKey}Functions_inl.h.
12
+ //
13
+ // Without this split, the include cycle looks like TensorBody.h -> CPUFunctions.h -> TensorBody.h.
14
+ // - TensorBody.h #includes CPUFunctions.h in the static dispatch build, because the tensor methods
15
+ // all need to call into the fastpath C++ API defined in CPUFunctions.h. The methods are also all
16
+ // directly inlined into TensorBody.h.
17
+ // - CPUFunctions.h #includes TensorBody.h because it contains function declarations for the entire C++ API,
18
+ // which include functions that have defaultable std::optional<Tensor> arguments.
19
+ // That requires knowing the full Tensor class definition.
20
+ //
21
+ // We break the cycle by doing the following:
22
+ // - Split out CPUFunction.h into two files: CPUFunctions.h and CPUFunctions_inl.h
23
+ // - CPUFunction.h is a dummy file that just includes the Tensor class and includes CPUFunctions_inl.,
24
+ // - CPUFunctions_inl.h includes everything else
25
+ // - (only in the static dispatch build) TensorBody.h makes sure to finish defining the Tensor class,
26
+ // and then it includes CPUFunctions_inl.h.
27
+ // - All other files that want the cpu fastpath functions can include CPUFunctions.h directly.
28
+ // - This also means that static dispatch build, CPUFunctions.h only needs to
29
+ // #include TensorBody.h, and it will automatically bring in CPUFunctions_inl.h.
30
+ #include <ATen/CompositeExplicitAutogradFunctions_inl.h>
31
+
32
+ #else
33
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
34
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CompositeExplicitAutogradFunctions_inl.h ADDED
@@ -0,0 +1,565 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+ // @generated by torchgen/gen.py from DispatchKeyFunctions_inl.h
4
+
5
+ // NB: The implementing C++ file is RegisterDispatchKey.cpp
6
+
7
+ // The only #includes we need are for custom classes that have defaults in the C++ API
8
+ #include <c10/core/MemoryFormat.h>
9
+ #include <c10/core/Scalar.h>
10
+ #include <ATen/core/Reduction.h>
11
+
12
+ #if defined(AT_PER_OPERATOR_HEADERS) && defined(TORCH_ASSERT_ONLY_METHOD_OPERATORS)
13
+ #error This change adds a dependency on all pytorch operators, meaning the \
14
+ file will need to be re-compiled every time an operator is changed or added. \
15
+ Consider including a specific operator from \
16
+ <ATen/ops/{my_operator}_compositeexplicitautograd_dispatch.h>. \
17
+ See NOTE [TORCH_ASSERT_ONLY_METHOD_OPERATORS].
18
+ #endif
19
+
20
+ #include <ATen/ops/_adaptive_avg_pool2d_compositeexplicitautograd_dispatch.h>
21
+ #include <ATen/ops/_adaptive_avg_pool2d_backward_compositeexplicitautograd_dispatch.h>
22
+ #include <ATen/ops/_adaptive_avg_pool3d_compositeexplicitautograd_dispatch.h>
23
+ #include <ATen/ops/_adaptive_avg_pool3d_backward_compositeexplicitautograd_dispatch.h>
24
+ #include <ATen/ops/_add_relu_compositeexplicitautograd_dispatch.h>
25
+ #include <ATen/ops/_aminmax_compositeexplicitautograd_dispatch.h>
26
+ #include <ATen/ops/_amp_foreach_non_finite_check_and_unscale_compositeexplicitautograd_dispatch.h>
27
+ #include <ATen/ops/_amp_update_scale_compositeexplicitautograd_dispatch.h>
28
+ #include <ATen/ops/_assert_scalar_compositeexplicitautograd_dispatch.h>
29
+ #include <ATen/ops/_assert_tensor_metadata_compositeexplicitautograd_dispatch.h>
30
+ #include <ATen/ops/_batch_norm_no_update_compositeexplicitautograd_dispatch.h>
31
+ #include <ATen/ops/_batch_norm_with_update_compositeexplicitautograd_dispatch.h>
32
+ #include <ATen/ops/_cdist_backward_compositeexplicitautograd_dispatch.h>
33
+ #include <ATen/ops/_cdist_forward_compositeexplicitautograd_dispatch.h>
34
+ #include <ATen/ops/_cholesky_solve_helper_compositeexplicitautograd_dispatch.h>
35
+ #include <ATen/ops/_chunk_cat_compositeexplicitautograd_dispatch.h>
36
+ #include <ATen/ops/_coalesce_compositeexplicitautograd_dispatch.h>
37
+ #include <ATen/ops/_coalesced_compositeexplicitautograd_dispatch.h>
38
+ #include <ATen/ops/_conj_compositeexplicitautograd_dispatch.h>
39
+ #include <ATen/ops/_conj_copy_compositeexplicitautograd_dispatch.h>
40
+ #include <ATen/ops/_conj_physical_compositeexplicitautograd_dispatch.h>
41
+ #include <ATen/ops/_convolution_compositeexplicitautograd_dispatch.h>
42
+ #include <ATen/ops/_copy_from_compositeexplicitautograd_dispatch.h>
43
+ #include <ATen/ops/_copy_from_and_resize_compositeexplicitautograd_dispatch.h>
44
+ #include <ATen/ops/_ctc_loss_compositeexplicitautograd_dispatch.h>
45
+ #include <ATen/ops/_ctc_loss_backward_compositeexplicitautograd_dispatch.h>
46
+ #include <ATen/ops/_cudnn_ctc_loss_compositeexplicitautograd_dispatch.h>
47
+ #include <ATen/ops/_cudnn_init_dropout_state_compositeexplicitautograd_dispatch.h>
48
+ #include <ATen/ops/_cudnn_rnn_compositeexplicitautograd_dispatch.h>
49
+ #include <ATen/ops/_cudnn_rnn_backward_compositeexplicitautograd_dispatch.h>
50
+ #include <ATen/ops/_cudnn_rnn_flatten_weight_compositeexplicitautograd_dispatch.h>
51
+ #include <ATen/ops/_dirichlet_grad_compositeexplicitautograd_dispatch.h>
52
+ #include <ATen/ops/_efficientzerotensor_compositeexplicitautograd_dispatch.h>
53
+ #include <ATen/ops/_embedding_bag_compositeexplicitautograd_dispatch.h>
54
+ #include <ATen/ops/_embedding_bag_dense_backward_compositeexplicitautograd_dispatch.h>
55
+ #include <ATen/ops/_embedding_bag_forward_only_compositeexplicitautograd_dispatch.h>
56
+ #include <ATen/ops/_embedding_bag_per_sample_weights_backward_compositeexplicitautograd_dispatch.h>
57
+ #include <ATen/ops/_empty_affine_quantized_compositeexplicitautograd_dispatch.h>
58
+ #include <ATen/ops/_empty_per_channel_affine_quantized_compositeexplicitautograd_dispatch.h>
59
+ #include <ATen/ops/_euclidean_dist_compositeexplicitautograd_dispatch.h>
60
+ #include <ATen/ops/_fake_quantize_learnable_per_channel_affine_compositeexplicitautograd_dispatch.h>
61
+ #include <ATen/ops/_fake_quantize_learnable_per_tensor_affine_compositeexplicitautograd_dispatch.h>
62
+ #include <ATen/ops/_fake_quantize_per_tensor_affine_cachemask_tensor_qparams_compositeexplicitautograd_dispatch.h>
63
+ #include <ATen/ops/_foobar_compositeexplicitautograd_dispatch.h>
64
+ #include <ATen/ops/_foreach_abs_compositeexplicitautograd_dispatch.h>
65
+ #include <ATen/ops/_foreach_acos_compositeexplicitautograd_dispatch.h>
66
+ #include <ATen/ops/_foreach_add_compositeexplicitautograd_dispatch.h>
67
+ #include <ATen/ops/_foreach_addcdiv_compositeexplicitautograd_dispatch.h>
68
+ #include <ATen/ops/_foreach_addcmul_compositeexplicitautograd_dispatch.h>
69
+ #include <ATen/ops/_foreach_asin_compositeexplicitautograd_dispatch.h>
70
+ #include <ATen/ops/_foreach_atan_compositeexplicitautograd_dispatch.h>
71
+ #include <ATen/ops/_foreach_ceil_compositeexplicitautograd_dispatch.h>
72
+ #include <ATen/ops/_foreach_clamp_max_compositeexplicitautograd_dispatch.h>
73
+ #include <ATen/ops/_foreach_clamp_min_compositeexplicitautograd_dispatch.h>
74
+ #include <ATen/ops/_foreach_copy_compositeexplicitautograd_dispatch.h>
75
+ #include <ATen/ops/_foreach_cos_compositeexplicitautograd_dispatch.h>
76
+ #include <ATen/ops/_foreach_cosh_compositeexplicitautograd_dispatch.h>
77
+ #include <ATen/ops/_foreach_div_compositeexplicitautograd_dispatch.h>
78
+ #include <ATen/ops/_foreach_erf_compositeexplicitautograd_dispatch.h>
79
+ #include <ATen/ops/_foreach_erfc_compositeexplicitautograd_dispatch.h>
80
+ #include <ATen/ops/_foreach_exp_compositeexplicitautograd_dispatch.h>
81
+ #include <ATen/ops/_foreach_expm1_compositeexplicitautograd_dispatch.h>
82
+ #include <ATen/ops/_foreach_floor_compositeexplicitautograd_dispatch.h>
83
+ #include <ATen/ops/_foreach_frac_compositeexplicitautograd_dispatch.h>
84
+ #include <ATen/ops/_foreach_lerp_compositeexplicitautograd_dispatch.h>
85
+ #include <ATen/ops/_foreach_lgamma_compositeexplicitautograd_dispatch.h>
86
+ #include <ATen/ops/_foreach_log_compositeexplicitautograd_dispatch.h>
87
+ #include <ATen/ops/_foreach_log10_compositeexplicitautograd_dispatch.h>
88
+ #include <ATen/ops/_foreach_log1p_compositeexplicitautograd_dispatch.h>
89
+ #include <ATen/ops/_foreach_log2_compositeexplicitautograd_dispatch.h>
90
+ #include <ATen/ops/_foreach_max_compositeexplicitautograd_dispatch.h>
91
+ #include <ATen/ops/_foreach_maximum_compositeexplicitautograd_dispatch.h>
92
+ #include <ATen/ops/_foreach_minimum_compositeexplicitautograd_dispatch.h>
93
+ #include <ATen/ops/_foreach_mul_compositeexplicitautograd_dispatch.h>
94
+ #include <ATen/ops/_foreach_neg_compositeexplicitautograd_dispatch.h>
95
+ #include <ATen/ops/_foreach_norm_compositeexplicitautograd_dispatch.h>
96
+ #include <ATen/ops/_foreach_pow_compositeexplicitautograd_dispatch.h>
97
+ #include <ATen/ops/_foreach_reciprocal_compositeexplicitautograd_dispatch.h>
98
+ #include <ATen/ops/_foreach_round_compositeexplicitautograd_dispatch.h>
99
+ #include <ATen/ops/_foreach_rsqrt_compositeexplicitautograd_dispatch.h>
100
+ #include <ATen/ops/_foreach_sigmoid_compositeexplicitautograd_dispatch.h>
101
+ #include <ATen/ops/_foreach_sign_compositeexplicitautograd_dispatch.h>
102
+ #include <ATen/ops/_foreach_sin_compositeexplicitautograd_dispatch.h>
103
+ #include <ATen/ops/_foreach_sinh_compositeexplicitautograd_dispatch.h>
104
+ #include <ATen/ops/_foreach_sqrt_compositeexplicitautograd_dispatch.h>
105
+ #include <ATen/ops/_foreach_sub_compositeexplicitautograd_dispatch.h>
106
+ #include <ATen/ops/_foreach_tan_compositeexplicitautograd_dispatch.h>
107
+ #include <ATen/ops/_foreach_tanh_compositeexplicitautograd_dispatch.h>
108
+ #include <ATen/ops/_foreach_trunc_compositeexplicitautograd_dispatch.h>
109
+ #include <ATen/ops/_foreach_zero_compositeexplicitautograd_dispatch.h>
110
+ #include <ATen/ops/_functional_assert_scalar_compositeexplicitautograd_dispatch.h>
111
+ #include <ATen/ops/_functional_sym_constrain_range_compositeexplicitautograd_dispatch.h>
112
+ #include <ATen/ops/_functional_sym_constrain_range_for_size_compositeexplicitautograd_dispatch.h>
113
+ #include <ATen/ops/_fused_adagrad_compositeexplicitautograd_dispatch.h>
114
+ #include <ATen/ops/_fused_adam_compositeexplicitautograd_dispatch.h>
115
+ #include <ATen/ops/_fused_adamw_compositeexplicitautograd_dispatch.h>
116
+ #include <ATen/ops/_fused_dropout_compositeexplicitautograd_dispatch.h>
117
+ #include <ATen/ops/_fused_moving_avg_obs_fq_helper_compositeexplicitautograd_dispatch.h>
118
+ #include <ATen/ops/_fused_sgd_compositeexplicitautograd_dispatch.h>
119
+ #include <ATen/ops/_fw_primal_compositeexplicitautograd_dispatch.h>
120
+ #include <ATen/ops/_fw_primal_copy_compositeexplicitautograd_dispatch.h>
121
+ #include <ATen/ops/_grid_sampler_2d_cpu_fallback_compositeexplicitautograd_dispatch.h>
122
+ #include <ATen/ops/_grouped_mm_compositeexplicitautograd_dispatch.h>
123
+ #include <ATen/ops/_has_same_storage_numel_compositeexplicitautograd_dispatch.h>
124
+ #include <ATen/ops/_histogramdd_bin_edges_compositeexplicitautograd_dispatch.h>
125
+ #include <ATen/ops/_histogramdd_from_bin_cts_compositeexplicitautograd_dispatch.h>
126
+ #include <ATen/ops/_histogramdd_from_bin_tensors_compositeexplicitautograd_dispatch.h>
127
+ #include <ATen/ops/_index_put_impl_compositeexplicitautograd_dispatch.h>
128
+ #include <ATen/ops/_indices_copy_compositeexplicitautograd_dispatch.h>
129
+ #include <ATen/ops/_is_all_true_compositeexplicitautograd_dispatch.h>
130
+ #include <ATen/ops/_is_any_true_compositeexplicitautograd_dispatch.h>
131
+ #include <ATen/ops/_lazy_clone_compositeexplicitautograd_dispatch.h>
132
+ #include <ATen/ops/_linalg_check_errors_compositeexplicitautograd_dispatch.h>
133
+ #include <ATen/ops/_lstm_mps_compositeexplicitautograd_dispatch.h>
134
+ #include <ATen/ops/_make_dual_compositeexplicitautograd_dispatch.h>
135
+ #include <ATen/ops/_make_dual_copy_compositeexplicitautograd_dispatch.h>
136
+ #include <ATen/ops/_make_per_channel_quantized_tensor_compositeexplicitautograd_dispatch.h>
137
+ #include <ATen/ops/_make_per_tensor_quantized_tensor_compositeexplicitautograd_dispatch.h>
138
+ #include <ATen/ops/_masked_scale_compositeexplicitautograd_dispatch.h>
139
+ #include <ATen/ops/_masked_softmax_compositeexplicitautograd_dispatch.h>
140
+ #include <ATen/ops/_masked_softmax_backward_compositeexplicitautograd_dispatch.h>
141
+ #include <ATen/ops/_mkldnn_reshape_compositeexplicitautograd_dispatch.h>
142
+ #include <ATen/ops/_mkldnn_transpose_compositeexplicitautograd_dispatch.h>
143
+ #include <ATen/ops/_mps_convolution_compositeexplicitautograd_dispatch.h>
144
+ #include <ATen/ops/_mps_convolution_transpose_compositeexplicitautograd_dispatch.h>
145
+ #include <ATen/ops/_native_batch_norm_legit_compositeexplicitautograd_dispatch.h>
146
+ #include <ATen/ops/_native_batch_norm_legit_no_training_compositeexplicitautograd_dispatch.h>
147
+ #include <ATen/ops/_native_multi_head_attention_compositeexplicitautograd_dispatch.h>
148
+ #include <ATen/ops/_neg_view_compositeexplicitautograd_dispatch.h>
149
+ #include <ATen/ops/_neg_view_copy_compositeexplicitautograd_dispatch.h>
150
+ #include <ATen/ops/_nested_from_padded_compositeexplicitautograd_dispatch.h>
151
+ #include <ATen/ops/_nested_from_padded_and_nested_example_compositeexplicitautograd_dispatch.h>
152
+ #include <ATen/ops/_nested_get_values_copy_compositeexplicitautograd_dispatch.h>
153
+ #include <ATen/ops/_nested_tensor_from_mask_compositeexplicitautograd_dispatch.h>
154
+ #include <ATen/ops/_nested_tensor_from_tensor_list_compositeexplicitautograd_dispatch.h>
155
+ #include <ATen/ops/_nested_tensor_size_compositeexplicitautograd_dispatch.h>
156
+ #include <ATen/ops/_nested_tensor_storage_offsets_compositeexplicitautograd_dispatch.h>
157
+ #include <ATen/ops/_nested_tensor_strides_compositeexplicitautograd_dispatch.h>
158
+ #include <ATen/ops/_nested_view_from_buffer_copy_compositeexplicitautograd_dispatch.h>
159
+ #include <ATen/ops/_nested_view_from_jagged_copy_compositeexplicitautograd_dispatch.h>
160
+ #include <ATen/ops/_new_zeros_with_same_feature_meta_compositeexplicitautograd_dispatch.h>
161
+ #include <ATen/ops/_nnpack_spatial_convolution_compositeexplicitautograd_dispatch.h>
162
+ #include <ATen/ops/_pack_padded_sequence_compositeexplicitautograd_dispatch.h>
163
+ #include <ATen/ops/_pdist_backward_compositeexplicitautograd_dispatch.h>
164
+ #include <ATen/ops/_pdist_forward_compositeexplicitautograd_dispatch.h>
165
+ #include <ATen/ops/_pin_memory_compositeexplicitautograd_dispatch.h>
166
+ #include <ATen/ops/_print_compositeexplicitautograd_dispatch.h>
167
+ #include <ATen/ops/_reshape_alias_copy_compositeexplicitautograd_dispatch.h>
168
+ #include <ATen/ops/_reshape_copy_compositeexplicitautograd_dispatch.h>
169
+ #include <ATen/ops/_resize_output_compositeexplicitautograd_dispatch.h>
170
+ #include <ATen/ops/_safe_softmax_compositeexplicitautograd_dispatch.h>
171
+ #include <ATen/ops/_sample_dirichlet_compositeexplicitautograd_dispatch.h>
172
+ #include <ATen/ops/_scaled_dot_product_fused_attention_overrideable_compositeexplicitautograd_dispatch.h>
173
+ #include <ATen/ops/_scaled_dot_product_fused_attention_overrideable_backward_compositeexplicitautograd_dispatch.h>
174
+ #include <ATen/ops/_segment_reduce_backward_compositeexplicitautograd_dispatch.h>
175
+ #include <ATen/ops/_slow_conv2d_backward_compositeexplicitautograd_dispatch.h>
176
+ #include <ATen/ops/_sparse_addmm_compositeexplicitautograd_dispatch.h>
177
+ #include <ATen/ops/_sparse_broadcast_to_copy_compositeexplicitautograd_dispatch.h>
178
+ #include <ATen/ops/_sparse_compressed_tensor_with_dims_compositeexplicitautograd_dispatch.h>
179
+ #include <ATen/ops/_sparse_coo_tensor_with_dims_compositeexplicitautograd_dispatch.h>
180
+ #include <ATen/ops/_sparse_coo_tensor_with_dims_and_tensors_compositeexplicitautograd_dispatch.h>
181
+ #include <ATen/ops/_sparse_csr_prod_compositeexplicitautograd_dispatch.h>
182
+ #include <ATen/ops/_sparse_csr_sum_compositeexplicitautograd_dispatch.h>
183
+ #include <ATen/ops/_sparse_log_softmax_compositeexplicitautograd_dispatch.h>
184
+ #include <ATen/ops/_sparse_log_softmax_backward_data_compositeexplicitautograd_dispatch.h>
185
+ #include <ATen/ops/_sparse_mask_projection_compositeexplicitautograd_dispatch.h>
186
+ #include <ATen/ops/_sparse_softmax_compositeexplicitautograd_dispatch.h>
187
+ #include <ATen/ops/_sparse_softmax_backward_data_compositeexplicitautograd_dispatch.h>
188
+ #include <ATen/ops/_sparse_sparse_matmul_compositeexplicitautograd_dispatch.h>
189
+ #include <ATen/ops/_sparse_sum_compositeexplicitautograd_dispatch.h>
190
+ #include <ATen/ops/_sparse_sum_backward_compositeexplicitautograd_dispatch.h>
191
+ #include <ATen/ops/_spdiags_compositeexplicitautograd_dispatch.h>
192
+ #include <ATen/ops/_stack_compositeexplicitautograd_dispatch.h>
193
+ #include <ATen/ops/_standard_gamma_compositeexplicitautograd_dispatch.h>
194
+ #include <ATen/ops/_standard_gamma_grad_compositeexplicitautograd_dispatch.h>
195
+ #include <ATen/ops/_test_autograd_multiple_dispatch_compositeexplicitautograd_dispatch.h>
196
+ #include <ATen/ops/_test_autograd_multiple_dispatch_view_compositeexplicitautograd_dispatch.h>
197
+ #include <ATen/ops/_test_autograd_multiple_dispatch_view_copy_compositeexplicitautograd_dispatch.h>
198
+ #include <ATen/ops/_test_functorch_fallback_compositeexplicitautograd_dispatch.h>
199
+ #include <ATen/ops/_test_optional_filled_intlist_compositeexplicitautograd_dispatch.h>
200
+ #include <ATen/ops/_test_optional_floatlist_compositeexplicitautograd_dispatch.h>
201
+ #include <ATen/ops/_test_optional_intlist_compositeexplicitautograd_dispatch.h>
202
+ #include <ATen/ops/_test_parallel_materialize_compositeexplicitautograd_dispatch.h>
203
+ #include <ATen/ops/_test_warn_in_autograd_compositeexplicitautograd_dispatch.h>
204
+ #include <ATen/ops/_thnn_fused_gru_cell_compositeexplicitautograd_dispatch.h>
205
+ #include <ATen/ops/_thnn_fused_gru_cell_backward_compositeexplicitautograd_dispatch.h>
206
+ #include <ATen/ops/_thnn_fused_lstm_cell_compositeexplicitautograd_dispatch.h>
207
+ #include <ATen/ops/_thnn_fused_lstm_cell_backward_impl_compositeexplicitautograd_dispatch.h>
208
+ #include <ATen/ops/_to_copy_compositeexplicitautograd_dispatch.h>
209
+ #include <ATen/ops/_to_dense_compositeexplicitautograd_dispatch.h>
210
+ #include <ATen/ops/_to_sparse_compositeexplicitautograd_dispatch.h>
211
+ #include <ATen/ops/_to_sparse_bsc_compositeexplicitautograd_dispatch.h>
212
+ #include <ATen/ops/_to_sparse_bsr_compositeexplicitautograd_dispatch.h>
213
+ #include <ATen/ops/_to_sparse_csc_compositeexplicitautograd_dispatch.h>
214
+ #include <ATen/ops/_to_sparse_csr_compositeexplicitautograd_dispatch.h>
215
+ #include <ATen/ops/_transform_bias_rescale_qkv_compositeexplicitautograd_dispatch.h>
216
+ #include <ATen/ops/_transformer_encoder_layer_fwd_compositeexplicitautograd_dispatch.h>
217
+ #include <ATen/ops/_trilinear_compositeexplicitautograd_dispatch.h>
218
+ #include <ATen/ops/_triton_multi_head_attention_compositeexplicitautograd_dispatch.h>
219
+ #include <ATen/ops/_triton_scaled_dot_attention_compositeexplicitautograd_dispatch.h>
220
+ #include <ATen/ops/_unique_compositeexplicitautograd_dispatch.h>
221
+ #include <ATen/ops/_unique2_compositeexplicitautograd_dispatch.h>
222
+ #include <ATen/ops/_unsafe_index_compositeexplicitautograd_dispatch.h>
223
+ #include <ATen/ops/_unsafe_index_put_compositeexplicitautograd_dispatch.h>
224
+ #include <ATen/ops/_unsafe_masked_index_compositeexplicitautograd_dispatch.h>
225
+ #include <ATen/ops/_unsafe_masked_index_put_accumulate_compositeexplicitautograd_dispatch.h>
226
+ #include <ATen/ops/_unsafe_view_compositeexplicitautograd_dispatch.h>
227
+ #include <ATen/ops/_values_copy_compositeexplicitautograd_dispatch.h>
228
+ #include <ATen/ops/_weight_norm_interface_compositeexplicitautograd_dispatch.h>
229
+ #include <ATen/ops/_weight_norm_interface_backward_compositeexplicitautograd_dispatch.h>
230
+ #include <ATen/ops/abs_compositeexplicitautograd_dispatch.h>
231
+ #include <ATen/ops/adaptive_avg_pool1d_compositeexplicitautograd_dispatch.h>
232
+ #include <ATen/ops/add_compositeexplicitautograd_dispatch.h>
233
+ #include <ATen/ops/addr_compositeexplicitautograd_dispatch.h>
234
+ #include <ATen/ops/affine_grid_generator_compositeexplicitautograd_dispatch.h>
235
+ #include <ATen/ops/alias_compositeexplicitautograd_dispatch.h>
236
+ #include <ATen/ops/alias_copy_compositeexplicitautograd_dispatch.h>
237
+ #include <ATen/ops/all_compositeexplicitautograd_dispatch.h>
238
+ #include <ATen/ops/allclose_compositeexplicitautograd_dispatch.h>
239
+ #include <ATen/ops/any_compositeexplicitautograd_dispatch.h>
240
+ #include <ATen/ops/arange_compositeexplicitautograd_dispatch.h>
241
+ #include <ATen/ops/as_strided_copy_compositeexplicitautograd_dispatch.h>
242
+ #include <ATen/ops/as_strided_scatter_compositeexplicitautograd_dispatch.h>
243
+ #include <ATen/ops/avg_pool1d_compositeexplicitautograd_dispatch.h>
244
+ #include <ATen/ops/bartlett_window_compositeexplicitautograd_dispatch.h>
245
+ #include <ATen/ops/batch_norm_backward_elemt_compositeexplicitautograd_dispatch.h>
246
+ #include <ATen/ops/batch_norm_backward_reduce_compositeexplicitautograd_dispatch.h>
247
+ #include <ATen/ops/batch_norm_gather_stats_compositeexplicitautograd_dispatch.h>
248
+ #include <ATen/ops/batch_norm_gather_stats_with_counts_compositeexplicitautograd_dispatch.h>
249
+ #include <ATen/ops/batch_norm_stats_compositeexplicitautograd_dispatch.h>
250
+ #include <ATen/ops/batch_norm_update_stats_compositeexplicitautograd_dispatch.h>
251
+ #include <ATen/ops/bernoulli_compositeexplicitautograd_dispatch.h>
252
+ #include <ATen/ops/binary_cross_entropy_with_logits_compositeexplicitautograd_dispatch.h>
253
+ #include <ATen/ops/bincount_compositeexplicitautograd_dispatch.h>
254
+ #include <ATen/ops/binomial_compositeexplicitautograd_dispatch.h>
255
+ #include <ATen/ops/bitwise_and_compositeexplicitautograd_dispatch.h>
256
+ #include <ATen/ops/bitwise_left_shift_compositeexplicitautograd_dispatch.h>
257
+ #include <ATen/ops/bitwise_or_compositeexplicitautograd_dispatch.h>
258
+ #include <ATen/ops/bitwise_right_shift_compositeexplicitautograd_dispatch.h>
259
+ #include <ATen/ops/bitwise_xor_compositeexplicitautograd_dispatch.h>
260
+ #include <ATen/ops/blackman_window_compositeexplicitautograd_dispatch.h>
261
+ #include <ATen/ops/block_diag_compositeexplicitautograd_dispatch.h>
262
+ #include <ATen/ops/bucketize_compositeexplicitautograd_dispatch.h>
263
+ #include <ATen/ops/cauchy_compositeexplicitautograd_dispatch.h>
264
+ #include <ATen/ops/ccol_indices_compositeexplicitautograd_dispatch.h>
265
+ #include <ATen/ops/ccol_indices_copy_compositeexplicitautograd_dispatch.h>
266
+ #include <ATen/ops/celu_compositeexplicitautograd_dispatch.h>
267
+ #include <ATen/ops/channel_shuffle_compositeexplicitautograd_dispatch.h>
268
+ #include <ATen/ops/cholesky_solve_compositeexplicitautograd_dispatch.h>
269
+ #include <ATen/ops/clone_compositeexplicitautograd_dispatch.h>
270
+ #include <ATen/ops/col_indices_compositeexplicitautograd_dispatch.h>
271
+ #include <ATen/ops/col_indices_copy_compositeexplicitautograd_dispatch.h>
272
+ #include <ATen/ops/complex_compositeexplicitautograd_dispatch.h>
273
+ #include <ATen/ops/conj_physical_compositeexplicitautograd_dispatch.h>
274
+ #include <ATen/ops/constant_pad_nd_compositeexplicitautograd_dispatch.h>
275
+ #include <ATen/ops/conv_depthwise3d_compositeexplicitautograd_dispatch.h>
276
+ #include <ATen/ops/conv_tbc_compositeexplicitautograd_dispatch.h>
277
+ #include <ATen/ops/convolution_compositeexplicitautograd_dispatch.h>
278
+ #include <ATen/ops/convolution_backward_compositeexplicitautograd_dispatch.h>
279
+ #include <ATen/ops/convolution_backward_overrideable_compositeexplicitautograd_dispatch.h>
280
+ #include <ATen/ops/convolution_overrideable_compositeexplicitautograd_dispatch.h>
281
+ #include <ATen/ops/copy_compositeexplicitautograd_dispatch.h>
282
+ #include <ATen/ops/copy_sparse_to_sparse_compositeexplicitautograd_dispatch.h>
283
+ #include <ATen/ops/copysign_compositeexplicitautograd_dispatch.h>
284
+ #include <ATen/ops/count_nonzero_compositeexplicitautograd_dispatch.h>
285
+ #include <ATen/ops/crow_indices_compositeexplicitautograd_dispatch.h>
286
+ #include <ATen/ops/crow_indices_copy_compositeexplicitautograd_dispatch.h>
287
+ #include <ATen/ops/cudnn_affine_grid_generator_compositeexplicitautograd_dispatch.h>
288
+ #include <ATen/ops/cudnn_affine_grid_generator_backward_compositeexplicitautograd_dispatch.h>
289
+ #include <ATen/ops/cudnn_batch_norm_backward_compositeexplicitautograd_dispatch.h>
290
+ #include <ATen/ops/cudnn_convolution_add_relu_compositeexplicitautograd_dispatch.h>
291
+ #include <ATen/ops/cudnn_convolution_relu_compositeexplicitautograd_dispatch.h>
292
+ #include <ATen/ops/cudnn_convolution_transpose_compositeexplicitautograd_dispatch.h>
293
+ #include <ATen/ops/cudnn_grid_sampler_compositeexplicitautograd_dispatch.h>
294
+ #include <ATen/ops/cudnn_grid_sampler_backward_compositeexplicitautograd_dispatch.h>
295
+ #include <ATen/ops/cummax_compositeexplicitautograd_dispatch.h>
296
+ #include <ATen/ops/cummin_compositeexplicitautograd_dispatch.h>
297
+ #include <ATen/ops/deg2rad_compositeexplicitautograd_dispatch.h>
298
+ #include <ATen/ops/dense_dim_compositeexplicitautograd_dispatch.h>
299
+ #include <ATen/ops/dequantize_compositeexplicitautograd_dispatch.h>
300
+ #include <ATen/ops/detach_compositeexplicitautograd_dispatch.h>
301
+ #include <ATen/ops/detach_copy_compositeexplicitautograd_dispatch.h>
302
+ #include <ATen/ops/diag_embed_compositeexplicitautograd_dispatch.h>
303
+ #include <ATen/ops/diagonal_compositeexplicitautograd_dispatch.h>
304
+ #include <ATen/ops/diagonal_backward_compositeexplicitautograd_dispatch.h>
305
+ #include <ATen/ops/diagonal_copy_compositeexplicitautograd_dispatch.h>
306
+ #include <ATen/ops/diagonal_scatter_compositeexplicitautograd_dispatch.h>
307
+ #include <ATen/ops/dist_compositeexplicitautograd_dispatch.h>
308
+ #include <ATen/ops/div_compositeexplicitautograd_dispatch.h>
309
+ #include <ATen/ops/dot_compositeexplicitautograd_dispatch.h>
310
+ #include <ATen/ops/embedding_compositeexplicitautograd_dispatch.h>
311
+ #include <ATen/ops/embedding_dense_backward_compositeexplicitautograd_dispatch.h>
312
+ #include <ATen/ops/embedding_renorm_compositeexplicitautograd_dispatch.h>
313
+ #include <ATen/ops/empty_compositeexplicitautograd_dispatch.h>
314
+ #include <ATen/ops/empty_like_compositeexplicitautograd_dispatch.h>
315
+ #include <ATen/ops/empty_permuted_compositeexplicitautograd_dispatch.h>
316
+ #include <ATen/ops/empty_quantized_compositeexplicitautograd_dispatch.h>
317
+ #include <ATen/ops/empty_strided_compositeexplicitautograd_dispatch.h>
318
+ #include <ATen/ops/expand_compositeexplicitautograd_dispatch.h>
319
+ #include <ATen/ops/expand_copy_compositeexplicitautograd_dispatch.h>
320
+ #include <ATen/ops/exponential_compositeexplicitautograd_dispatch.h>
321
+ #include <ATen/ops/eye_compositeexplicitautograd_dispatch.h>
322
+ #include <ATen/ops/fake_quantize_per_channel_affine_cachemask_compositeexplicitautograd_dispatch.h>
323
+ #include <ATen/ops/fake_quantize_per_tensor_affine_cachemask_compositeexplicitautograd_dispatch.h>
324
+ #include <ATen/ops/fft_fftfreq_compositeexplicitautograd_dispatch.h>
325
+ #include <ATen/ops/fft_rfftfreq_compositeexplicitautograd_dispatch.h>
326
+ #include <ATen/ops/fill_compositeexplicitautograd_dispatch.h>
327
+ #include <ATen/ops/flip_compositeexplicitautograd_dispatch.h>
328
+ #include <ATen/ops/floor_divide_compositeexplicitautograd_dispatch.h>
329
+ #include <ATen/ops/fmod_compositeexplicitautograd_dispatch.h>
330
+ #include <ATen/ops/frexp_compositeexplicitautograd_dispatch.h>
331
+ #include <ATen/ops/from_file_compositeexplicitautograd_dispatch.h>
332
+ #include <ATen/ops/full_compositeexplicitautograd_dispatch.h>
333
+ #include <ATen/ops/full_like_compositeexplicitautograd_dispatch.h>
334
+ #include <ATen/ops/geometric_compositeexplicitautograd_dispatch.h>
335
+ #include <ATen/ops/glu_backward_jvp_compositeexplicitautograd_dispatch.h>
336
+ #include <ATen/ops/glu_jvp_compositeexplicitautograd_dispatch.h>
337
+ #include <ATen/ops/grid_sampler_2d_compositeexplicitautograd_dispatch.h>
338
+ #include <ATen/ops/grid_sampler_2d_backward_compositeexplicitautograd_dispatch.h>
339
+ #include <ATen/ops/grid_sampler_3d_compositeexplicitautograd_dispatch.h>
340
+ #include <ATen/ops/grid_sampler_3d_backward_compositeexplicitautograd_dispatch.h>
341
+ #include <ATen/ops/hamming_window_compositeexplicitautograd_dispatch.h>
342
+ #include <ATen/ops/hann_window_compositeexplicitautograd_dispatch.h>
343
+ #include <ATen/ops/hardswish_backward_compositeexplicitautograd_dispatch.h>
344
+ #include <ATen/ops/huber_loss_backward_compositeexplicitautograd_dispatch.h>
345
+ #include <ATen/ops/index_fill_compositeexplicitautograd_dispatch.h>
346
+ #include <ATen/ops/index_put_compositeexplicitautograd_dispatch.h>
347
+ #include <ATen/ops/indices_compositeexplicitautograd_dispatch.h>
348
+ #include <ATen/ops/indices_copy_compositeexplicitautograd_dispatch.h>
349
+ #include <ATen/ops/int_repr_compositeexplicitautograd_dispatch.h>
350
+ #include <ATen/ops/is_coalesced_compositeexplicitautograd_dispatch.h>
351
+ #include <ATen/ops/is_pinned_compositeexplicitautograd_dispatch.h>
352
+ #include <ATen/ops/is_same_size_compositeexplicitautograd_dispatch.h>
353
+ #include <ATen/ops/isinf_compositeexplicitautograd_dispatch.h>
354
+ #include <ATen/ops/isnan_compositeexplicitautograd_dispatch.h>
355
+ #include <ATen/ops/kaiser_window_compositeexplicitautograd_dispatch.h>
356
+ #include <ATen/ops/kthvalue_compositeexplicitautograd_dispatch.h>
357
+ #include <ATen/ops/lift_compositeexplicitautograd_dispatch.h>
358
+ #include <ATen/ops/lift_fresh_compositeexplicitautograd_dispatch.h>
359
+ #include <ATen/ops/lift_fresh_copy_compositeexplicitautograd_dispatch.h>
360
+ #include <ATen/ops/linalg_lstsq_compositeexplicitautograd_dispatch.h>
361
+ #include <ATen/ops/linalg_matrix_exp_compositeexplicitautograd_dispatch.h>
362
+ #include <ATen/ops/linalg_pinv_compositeexplicitautograd_dispatch.h>
363
+ #include <ATen/ops/linear_compositeexplicitautograd_dispatch.h>
364
+ #include <ATen/ops/linear_backward_compositeexplicitautograd_dispatch.h>
365
+ #include <ATen/ops/linspace_compositeexplicitautograd_dispatch.h>
366
+ #include <ATen/ops/log_normal_compositeexplicitautograd_dispatch.h>
367
+ #include <ATen/ops/log_softmax_compositeexplicitautograd_dispatch.h>
368
+ #include <ATen/ops/logcumsumexp_compositeexplicitautograd_dispatch.h>
369
+ #include <ATen/ops/logical_and_compositeexplicitautograd_dispatch.h>
370
+ #include <ATen/ops/logical_not_compositeexplicitautograd_dispatch.h>
371
+ #include <ATen/ops/logical_or_compositeexplicitautograd_dispatch.h>
372
+ #include <ATen/ops/logical_xor_compositeexplicitautograd_dispatch.h>
373
+ #include <ATen/ops/logspace_compositeexplicitautograd_dispatch.h>
374
+ #include <ATen/ops/logsumexp_compositeexplicitautograd_dispatch.h>
375
+ #include <ATen/ops/lshift_compositeexplicitautograd_dispatch.h>
376
+ #include <ATen/ops/lstm_mps_backward_compositeexplicitautograd_dispatch.h>
377
+ #include <ATen/ops/masked_fill_compositeexplicitautograd_dispatch.h>
378
+ #include <ATen/ops/masked_scatter_compositeexplicitautograd_dispatch.h>
379
+ #include <ATen/ops/masked_scatter_backward_compositeexplicitautograd_dispatch.h>
380
+ #include <ATen/ops/matmul_backward_compositeexplicitautograd_dispatch.h>
381
+ #include <ATen/ops/max_pool2d_backward_compositeexplicitautograd_dispatch.h>
382
+ #include <ATen/ops/mean_compositeexplicitautograd_dispatch.h>
383
+ #include <ATen/ops/median_compositeexplicitautograd_dispatch.h>
384
+ #include <ATen/ops/miopen_batch_norm_compositeexplicitautograd_dispatch.h>
385
+ #include <ATen/ops/miopen_batch_norm_backward_compositeexplicitautograd_dispatch.h>
386
+ #include <ATen/ops/miopen_convolution_compositeexplicitautograd_dispatch.h>
387
+ #include <ATen/ops/miopen_convolution_transpose_compositeexplicitautograd_dispatch.h>
388
+ #include <ATen/ops/miopen_depthwise_convolution_compositeexplicitautograd_dispatch.h>
389
+ #include <ATen/ops/miopen_rnn_compositeexplicitautograd_dispatch.h>
390
+ #include <ATen/ops/miopen_rnn_backward_compositeexplicitautograd_dispatch.h>
391
+ #include <ATen/ops/mkldnn_adaptive_avg_pool2d_backward_compositeexplicitautograd_dispatch.h>
392
+ #include <ATen/ops/mkldnn_convolution_compositeexplicitautograd_dispatch.h>
393
+ #include <ATen/ops/mkldnn_linear_compositeexplicitautograd_dispatch.h>
394
+ #include <ATen/ops/mkldnn_linear_backward_compositeexplicitautograd_dispatch.h>
395
+ #include <ATen/ops/mkldnn_linear_backward_input_compositeexplicitautograd_dispatch.h>
396
+ #include <ATen/ops/mkldnn_linear_backward_weights_compositeexplicitautograd_dispatch.h>
397
+ #include <ATen/ops/mkldnn_max_pool2d_compositeexplicitautograd_dispatch.h>
398
+ #include <ATen/ops/mkldnn_max_pool2d_backward_compositeexplicitautograd_dispatch.h>
399
+ #include <ATen/ops/mkldnn_max_pool3d_compositeexplicitautograd_dispatch.h>
400
+ #include <ATen/ops/mkldnn_max_pool3d_backward_compositeexplicitautograd_dispatch.h>
401
+ #include <ATen/ops/mkldnn_reorder_conv2d_weight_compositeexplicitautograd_dispatch.h>
402
+ #include <ATen/ops/mkldnn_reorder_conv3d_weight_compositeexplicitautograd_dispatch.h>
403
+ #include <ATen/ops/mkldnn_rnn_layer_compositeexplicitautograd_dispatch.h>
404
+ #include <ATen/ops/mkldnn_rnn_layer_backward_compositeexplicitautograd_dispatch.h>
405
+ #include <ATen/ops/mode_compositeexplicitautograd_dispatch.h>
406
+ #include <ATen/ops/mps_convolution_backward_compositeexplicitautograd_dispatch.h>
407
+ #include <ATen/ops/mps_convolution_transpose_backward_compositeexplicitautograd_dispatch.h>
408
+ #include <ATen/ops/mul_compositeexplicitautograd_dispatch.h>
409
+ #include <ATen/ops/mv_compositeexplicitautograd_dispatch.h>
410
+ #include <ATen/ops/mvlgamma_compositeexplicitautograd_dispatch.h>
411
+ #include <ATen/ops/nan_to_num_compositeexplicitautograd_dispatch.h>
412
+ #include <ATen/ops/nanmedian_compositeexplicitautograd_dispatch.h>
413
+ #include <ATen/ops/native_batch_norm_backward_compositeexplicitautograd_dispatch.h>
414
+ #include <ATen/ops/native_dropout_compositeexplicitautograd_dispatch.h>
415
+ #include <ATen/ops/native_dropout_backward_compositeexplicitautograd_dispatch.h>
416
+ #include <ATen/ops/native_group_norm_compositeexplicitautograd_dispatch.h>
417
+ #include <ATen/ops/native_group_norm_backward_compositeexplicitautograd_dispatch.h>
418
+ #include <ATen/ops/native_layer_norm_compositeexplicitautograd_dispatch.h>
419
+ #include <ATen/ops/native_layer_norm_backward_compositeexplicitautograd_dispatch.h>
420
+ #include <ATen/ops/native_norm_compositeexplicitautograd_dispatch.h>
421
+ #include <ATen/ops/new_empty_compositeexplicitautograd_dispatch.h>
422
+ #include <ATen/ops/new_empty_strided_compositeexplicitautograd_dispatch.h>
423
+ #include <ATen/ops/new_full_compositeexplicitautograd_dispatch.h>
424
+ #include <ATen/ops/new_ones_compositeexplicitautograd_dispatch.h>
425
+ #include <ATen/ops/new_zeros_compositeexplicitautograd_dispatch.h>
426
+ #include <ATen/ops/norm_compositeexplicitautograd_dispatch.h>
427
+ #include <ATen/ops/normal_compositeexplicitautograd_dispatch.h>
428
+ #include <ATen/ops/ones_compositeexplicitautograd_dispatch.h>
429
+ #include <ATen/ops/ones_like_compositeexplicitautograd_dispatch.h>
430
+ #include <ATen/ops/permute_compositeexplicitautograd_dispatch.h>
431
+ #include <ATen/ops/permute_copy_compositeexplicitautograd_dispatch.h>
432
+ #include <ATen/ops/pixel_shuffle_compositeexplicitautograd_dispatch.h>
433
+ #include <ATen/ops/pixel_unshuffle_compositeexplicitautograd_dispatch.h>
434
+ #include <ATen/ops/poisson_compositeexplicitautograd_dispatch.h>
435
+ #include <ATen/ops/polar_compositeexplicitautograd_dispatch.h>
436
+ #include <ATen/ops/polygamma_compositeexplicitautograd_dispatch.h>
437
+ #include <ATen/ops/prod_compositeexplicitautograd_dispatch.h>
438
+ #include <ATen/ops/put_compositeexplicitautograd_dispatch.h>
439
+ #include <ATen/ops/q_per_channel_scales_compositeexplicitautograd_dispatch.h>
440
+ #include <ATen/ops/q_per_channel_zero_points_compositeexplicitautograd_dispatch.h>
441
+ #include <ATen/ops/quantize_per_channel_compositeexplicitautograd_dispatch.h>
442
+ #include <ATen/ops/quantize_per_tensor_compositeexplicitautograd_dispatch.h>
443
+ #include <ATen/ops/quantize_per_tensor_dynamic_compositeexplicitautograd_dispatch.h>
444
+ #include <ATen/ops/quantized_batch_norm_compositeexplicitautograd_dispatch.h>
445
+ #include <ATen/ops/quantized_max_pool1d_compositeexplicitautograd_dispatch.h>
446
+ #include <ATen/ops/quantized_max_pool2d_compositeexplicitautograd_dispatch.h>
447
+ #include <ATen/ops/quantized_max_pool3d_compositeexplicitautograd_dispatch.h>
448
+ #include <ATen/ops/rad2deg_compositeexplicitautograd_dispatch.h>
449
+ #include <ATen/ops/rand_compositeexplicitautograd_dispatch.h>
450
+ #include <ATen/ops/rand_like_compositeexplicitautograd_dispatch.h>
451
+ #include <ATen/ops/randint_compositeexplicitautograd_dispatch.h>
452
+ #include <ATen/ops/randint_like_compositeexplicitautograd_dispatch.h>
453
+ #include <ATen/ops/randn_compositeexplicitautograd_dispatch.h>
454
+ #include <ATen/ops/randn_like_compositeexplicitautograd_dispatch.h>
455
+ #include <ATen/ops/random_compositeexplicitautograd_dispatch.h>
456
+ #include <ATen/ops/randperm_compositeexplicitautograd_dispatch.h>
457
+ #include <ATen/ops/range_compositeexplicitautograd_dispatch.h>
458
+ #include <ATen/ops/relu_compositeexplicitautograd_dispatch.h>
459
+ #include <ATen/ops/remainder_compositeexplicitautograd_dispatch.h>
460
+ #include <ATen/ops/repeat_compositeexplicitautograd_dispatch.h>
461
+ #include <ATen/ops/repeat_interleave_compositeexplicitautograd_dispatch.h>
462
+ #include <ATen/ops/resize_compositeexplicitautograd_dispatch.h>
463
+ #include <ATen/ops/resize_as_compositeexplicitautograd_dispatch.h>
464
+ #include <ATen/ops/resize_as_sparse_compositeexplicitautograd_dispatch.h>
465
+ #include <ATen/ops/roll_compositeexplicitautograd_dispatch.h>
466
+ #include <ATen/ops/rot90_compositeexplicitautograd_dispatch.h>
467
+ #include <ATen/ops/row_indices_compositeexplicitautograd_dispatch.h>
468
+ #include <ATen/ops/row_indices_copy_compositeexplicitautograd_dispatch.h>
469
+ #include <ATen/ops/rrelu_with_noise_compositeexplicitautograd_dispatch.h>
470
+ #include <ATen/ops/rrelu_with_noise_backward_compositeexplicitautograd_dispatch.h>
471
+ #include <ATen/ops/rshift_compositeexplicitautograd_dispatch.h>
472
+ #include <ATen/ops/rsub_compositeexplicitautograd_dispatch.h>
473
+ #include <ATen/ops/scalar_tensor_compositeexplicitautograd_dispatch.h>
474
+ #include <ATen/ops/segment_reduce_compositeexplicitautograd_dispatch.h>
475
+ #include <ATen/ops/select_compositeexplicitautograd_dispatch.h>
476
+ #include <ATen/ops/select_backward_compositeexplicitautograd_dispatch.h>
477
+ #include <ATen/ops/select_copy_compositeexplicitautograd_dispatch.h>
478
+ #include <ATen/ops/select_scatter_compositeexplicitautograd_dispatch.h>
479
+ #include <ATen/ops/set_compositeexplicitautograd_dispatch.h>
480
+ #include <ATen/ops/slice_compositeexplicitautograd_dispatch.h>
481
+ #include <ATen/ops/slice_backward_compositeexplicitautograd_dispatch.h>
482
+ #include <ATen/ops/slice_copy_compositeexplicitautograd_dispatch.h>
483
+ #include <ATen/ops/slice_inverse_compositeexplicitautograd_dispatch.h>
484
+ #include <ATen/ops/slice_scatter_compositeexplicitautograd_dispatch.h>
485
+ #include <ATen/ops/slow_conv_dilated2d_compositeexplicitautograd_dispatch.h>
486
+ #include <ATen/ops/slow_conv_dilated3d_compositeexplicitautograd_dispatch.h>
487
+ #include <ATen/ops/smooth_l1_loss_backward_compositeexplicitautograd_dispatch.h>
488
+ #include <ATen/ops/soft_margin_loss_compositeexplicitautograd_dispatch.h>
489
+ #include <ATen/ops/soft_margin_loss_backward_compositeexplicitautograd_dispatch.h>
490
+ #include <ATen/ops/softmax_compositeexplicitautograd_dispatch.h>
491
+ #include <ATen/ops/sort_compositeexplicitautograd_dispatch.h>
492
+ #include <ATen/ops/sparse_compressed_tensor_compositeexplicitautograd_dispatch.h>
493
+ #include <ATen/ops/sparse_coo_tensor_compositeexplicitautograd_dispatch.h>
494
+ #include <ATen/ops/sparse_dim_compositeexplicitautograd_dispatch.h>
495
+ #include <ATen/ops/sparse_mask_compositeexplicitautograd_dispatch.h>
496
+ #include <ATen/ops/sparse_resize_compositeexplicitautograd_dispatch.h>
497
+ #include <ATen/ops/sparse_resize_and_clear_compositeexplicitautograd_dispatch.h>
498
+ #include <ATen/ops/special_chebyshev_polynomial_t_compositeexplicitautograd_dispatch.h>
499
+ #include <ATen/ops/special_chebyshev_polynomial_u_compositeexplicitautograd_dispatch.h>
500
+ #include <ATen/ops/special_chebyshev_polynomial_v_compositeexplicitautograd_dispatch.h>
501
+ #include <ATen/ops/special_chebyshev_polynomial_w_compositeexplicitautograd_dispatch.h>
502
+ #include <ATen/ops/special_hermite_polynomial_h_compositeexplicitautograd_dispatch.h>
503
+ #include <ATen/ops/special_hermite_polynomial_he_compositeexplicitautograd_dispatch.h>
504
+ #include <ATen/ops/special_laguerre_polynomial_l_compositeexplicitautograd_dispatch.h>
505
+ #include <ATen/ops/special_legendre_polynomial_p_compositeexplicitautograd_dispatch.h>
506
+ #include <ATen/ops/special_shifted_chebyshev_polynomial_t_compositeexplicitautograd_dispatch.h>
507
+ #include <ATen/ops/special_shifted_chebyshev_polynomial_u_compositeexplicitautograd_dispatch.h>
508
+ #include <ATen/ops/special_shifted_chebyshev_polynomial_v_compositeexplicitautograd_dispatch.h>
509
+ #include <ATen/ops/special_shifted_chebyshev_polynomial_w_compositeexplicitautograd_dispatch.h>
510
+ #include <ATen/ops/special_xlog1py_compositeexplicitautograd_dispatch.h>
511
+ #include <ATen/ops/special_zeta_compositeexplicitautograd_dispatch.h>
512
+ #include <ATen/ops/split_compositeexplicitautograd_dispatch.h>
513
+ #include <ATen/ops/split_copy_compositeexplicitautograd_dispatch.h>
514
+ #include <ATen/ops/split_with_sizes_compositeexplicitautograd_dispatch.h>
515
+ #include <ATen/ops/split_with_sizes_copy_compositeexplicitautograd_dispatch.h>
516
+ #include <ATen/ops/squeeze_compositeexplicitautograd_dispatch.h>
517
+ #include <ATen/ops/squeeze_copy_compositeexplicitautograd_dispatch.h>
518
+ #include <ATen/ops/stack_compositeexplicitautograd_dispatch.h>
519
+ #include <ATen/ops/std_mean_compositeexplicitautograd_dispatch.h>
520
+ #include <ATen/ops/sub_compositeexplicitautograd_dispatch.h>
521
+ #include <ATen/ops/sum_compositeexplicitautograd_dispatch.h>
522
+ #include <ATen/ops/sym_constrain_range_compositeexplicitautograd_dispatch.h>
523
+ #include <ATen/ops/sym_constrain_range_for_size_compositeexplicitautograd_dispatch.h>
524
+ #include <ATen/ops/t_compositeexplicitautograd_dispatch.h>
525
+ #include <ATen/ops/t_copy_compositeexplicitautograd_dispatch.h>
526
+ #include <ATen/ops/to_mkldnn_compositeexplicitautograd_dispatch.h>
527
+ #include <ATen/ops/to_padded_tensor_compositeexplicitautograd_dispatch.h>
528
+ #include <ATen/ops/trace_compositeexplicitautograd_dispatch.h>
529
+ #include <ATen/ops/transpose_compositeexplicitautograd_dispatch.h>
530
+ #include <ATen/ops/transpose_copy_compositeexplicitautograd_dispatch.h>
531
+ #include <ATen/ops/tril_indices_compositeexplicitautograd_dispatch.h>
532
+ #include <ATen/ops/triu_indices_compositeexplicitautograd_dispatch.h>
533
+ #include <ATen/ops/unbind_compositeexplicitautograd_dispatch.h>
534
+ #include <ATen/ops/unbind_copy_compositeexplicitautograd_dispatch.h>
535
+ #include <ATen/ops/unfold_backward_compositeexplicitautograd_dispatch.h>
536
+ #include <ATen/ops/unfold_copy_compositeexplicitautograd_dispatch.h>
537
+ #include <ATen/ops/uniform_compositeexplicitautograd_dispatch.h>
538
+ #include <ATen/ops/unique_consecutive_compositeexplicitautograd_dispatch.h>
539
+ #include <ATen/ops/unique_dim_compositeexplicitautograd_dispatch.h>
540
+ #include <ATen/ops/unique_dim_consecutive_compositeexplicitautograd_dispatch.h>
541
+ #include <ATen/ops/unsafe_split_compositeexplicitautograd_dispatch.h>
542
+ #include <ATen/ops/unsafe_split_with_sizes_compositeexplicitautograd_dispatch.h>
543
+ #include <ATen/ops/unsqueeze_compositeexplicitautograd_dispatch.h>
544
+ #include <ATen/ops/unsqueeze_copy_compositeexplicitautograd_dispatch.h>
545
+ #include <ATen/ops/upsample_bilinear2d_compositeexplicitautograd_dispatch.h>
546
+ #include <ATen/ops/upsample_nearest2d_compositeexplicitautograd_dispatch.h>
547
+ #include <ATen/ops/values_compositeexplicitautograd_dispatch.h>
548
+ #include <ATen/ops/values_copy_compositeexplicitautograd_dispatch.h>
549
+ #include <ATen/ops/var_mean_compositeexplicitautograd_dispatch.h>
550
+ #include <ATen/ops/vdot_compositeexplicitautograd_dispatch.h>
551
+ #include <ATen/ops/view_compositeexplicitautograd_dispatch.h>
552
+ #include <ATen/ops/view_as_complex_copy_compositeexplicitautograd_dispatch.h>
553
+ #include <ATen/ops/view_as_real_copy_compositeexplicitautograd_dispatch.h>
554
+ #include <ATen/ops/view_copy_compositeexplicitautograd_dispatch.h>
555
+ #include <ATen/ops/xlogy_compositeexplicitautograd_dispatch.h>
556
+ #include <ATen/ops/zero_compositeexplicitautograd_dispatch.h>
557
+ #include <ATen/ops/zeros_compositeexplicitautograd_dispatch.h>
558
+ #include <ATen/ops/zeros_like_compositeexplicitautograd_dispatch.h>
559
+
560
+
561
+
562
+
563
+ #else
564
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
565
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CompositeExplicitAutogradNonFunctionalFunctions.h ADDED
@@ -0,0 +1,34 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #include <ATen/core/TensorBody.h>
3
+
4
+ // TODO Undo all logic introduced for Note [Avoiding Include Cycles In Static Dispatch]
5
+ // Code introduced to avoid cyclic dependency in static dispatch is no longer
6
+ // needed as static dispatch logic is moved from TensorBody.h, which caused cycles in the first place,
7
+ // to Operators.cpp for supporting multiple backends with multiple kernels.
8
+ //
9
+ // Note [Avoiding Include Cycles In Static Dispatch]
10
+ // In order to avoid #include cycles in the static dispatch build, we've carefully split out
11
+ // the static function definition files into {DispatchKey}Functions.h and {DispatchKey}Functions_inl.h.
12
+ //
13
+ // Without this split, the include cycle looks like TensorBody.h -> CPUFunctions.h -> TensorBody.h.
14
+ // - TensorBody.h #includes CPUFunctions.h in the static dispatch build, because the tensor methods
15
+ // all need to call into the fastpath C++ API defined in CPUFunctions.h. The methods are also all
16
+ // directly inlined into TensorBody.h.
17
+ // - CPUFunctions.h #includes TensorBody.h because it contains function declarations for the entire C++ API,
18
+ // which include functions that have defaultable std::optional<Tensor> arguments.
19
+ // That requires knowing the full Tensor class definition.
20
+ //
21
+ // We break the cycle by doing the following:
22
+ // - Split out CPUFunction.h into two files: CPUFunctions.h and CPUFunctions_inl.h
23
+ // - CPUFunction.h is a dummy file that just includes the Tensor class and includes CPUFunctions_inl.,
24
+ // - CPUFunctions_inl.h includes everything else
25
+ // - (only in the static dispatch build) TensorBody.h makes sure to finish defining the Tensor class,
26
+ // and then it includes CPUFunctions_inl.h.
27
+ // - All other files that want the cpu fastpath functions can include CPUFunctions.h directly.
28
+ // - This also means that static dispatch build, CPUFunctions.h only needs to
29
+ // #include TensorBody.h, and it will automatically bring in CPUFunctions_inl.h.
30
+ #include <ATen/CompositeExplicitAutogradNonFunctionalFunctions_inl.h>
31
+
32
+ #else
33
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
34
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CompositeExplicitAutogradNonFunctionalFunctions_inl.h ADDED
@@ -0,0 +1,329 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+ // @generated by torchgen/gen.py from DispatchKeyFunctions_inl.h
4
+
5
+ // NB: The implementing C++ file is RegisterDispatchKey.cpp
6
+
7
+ // The only #includes we need are for custom classes that have defaults in the C++ API
8
+ #include <c10/core/MemoryFormat.h>
9
+ #include <c10/core/Scalar.h>
10
+ #include <ATen/core/Reduction.h>
11
+
12
+ #if defined(AT_PER_OPERATOR_HEADERS) && defined(TORCH_ASSERT_ONLY_METHOD_OPERATORS)
13
+ #error This change adds a dependency on all pytorch operators, meaning the \
14
+ file will need to be re-compiled every time an operator is changed or added. \
15
+ Consider including a specific operator from \
16
+ <ATen/ops/{my_operator}_compositeexplicitautogradnonfunctional_dispatch.h>. \
17
+ See NOTE [TORCH_ASSERT_ONLY_METHOD_OPERATORS].
18
+ #endif
19
+
20
+ #include <ATen/ops/_addmm_activation_compositeexplicitautogradnonfunctional_dispatch.h>
21
+ #include <ATen/ops/_conj_copy_compositeexplicitautogradnonfunctional_dispatch.h>
22
+ #include <ATen/ops/_convert_indices_from_coo_to_csr_compositeexplicitautogradnonfunctional_dispatch.h>
23
+ #include <ATen/ops/_convert_indices_from_csr_to_coo_compositeexplicitautogradnonfunctional_dispatch.h>
24
+ #include <ATen/ops/_fw_primal_copy_compositeexplicitautogradnonfunctional_dispatch.h>
25
+ #include <ATen/ops/_indices_copy_compositeexplicitautogradnonfunctional_dispatch.h>
26
+ #include <ATen/ops/_linalg_det_compositeexplicitautogradnonfunctional_dispatch.h>
27
+ #include <ATen/ops/_linalg_eigh_compositeexplicitautogradnonfunctional_dispatch.h>
28
+ #include <ATen/ops/_linalg_slogdet_compositeexplicitautogradnonfunctional_dispatch.h>
29
+ #include <ATen/ops/_linalg_solve_ex_compositeexplicitautogradnonfunctional_dispatch.h>
30
+ #include <ATen/ops/_linalg_svd_compositeexplicitautogradnonfunctional_dispatch.h>
31
+ #include <ATen/ops/_log_softmax_compositeexplicitautogradnonfunctional_dispatch.h>
32
+ #include <ATen/ops/_log_softmax_backward_data_compositeexplicitautogradnonfunctional_dispatch.h>
33
+ #include <ATen/ops/_make_dual_copy_compositeexplicitautogradnonfunctional_dispatch.h>
34
+ #include <ATen/ops/_neg_view_copy_compositeexplicitautogradnonfunctional_dispatch.h>
35
+ #include <ATen/ops/_nested_get_values_copy_compositeexplicitautogradnonfunctional_dispatch.h>
36
+ #include <ATen/ops/_nested_view_from_buffer_copy_compositeexplicitautogradnonfunctional_dispatch.h>
37
+ #include <ATen/ops/_nested_view_from_jagged_copy_compositeexplicitautogradnonfunctional_dispatch.h>
38
+ #include <ATen/ops/_reshape_alias_copy_compositeexplicitautogradnonfunctional_dispatch.h>
39
+ #include <ATen/ops/_softmax_compositeexplicitautogradnonfunctional_dispatch.h>
40
+ #include <ATen/ops/_softmax_backward_data_compositeexplicitautogradnonfunctional_dispatch.h>
41
+ #include <ATen/ops/_sparse_broadcast_to_copy_compositeexplicitautogradnonfunctional_dispatch.h>
42
+ #include <ATen/ops/_test_autograd_multiple_dispatch_view_copy_compositeexplicitautogradnonfunctional_dispatch.h>
43
+ #include <ATen/ops/_trilinear_compositeexplicitautogradnonfunctional_dispatch.h>
44
+ #include <ATen/ops/_upsample_bicubic2d_aa_compositeexplicitautogradnonfunctional_dispatch.h>
45
+ #include <ATen/ops/_upsample_bicubic2d_aa_backward_compositeexplicitautogradnonfunctional_dispatch.h>
46
+ #include <ATen/ops/_upsample_bilinear2d_aa_compositeexplicitautogradnonfunctional_dispatch.h>
47
+ #include <ATen/ops/_upsample_bilinear2d_aa_backward_compositeexplicitautogradnonfunctional_dispatch.h>
48
+ #include <ATen/ops/_upsample_nearest_exact1d_compositeexplicitautogradnonfunctional_dispatch.h>
49
+ #include <ATen/ops/_upsample_nearest_exact1d_backward_compositeexplicitautogradnonfunctional_dispatch.h>
50
+ #include <ATen/ops/_upsample_nearest_exact2d_compositeexplicitautogradnonfunctional_dispatch.h>
51
+ #include <ATen/ops/_upsample_nearest_exact2d_backward_compositeexplicitautogradnonfunctional_dispatch.h>
52
+ #include <ATen/ops/_upsample_nearest_exact3d_compositeexplicitautogradnonfunctional_dispatch.h>
53
+ #include <ATen/ops/_upsample_nearest_exact3d_backward_compositeexplicitautogradnonfunctional_dispatch.h>
54
+ #include <ATen/ops/_values_copy_compositeexplicitautogradnonfunctional_dispatch.h>
55
+ #include <ATen/ops/acos_compositeexplicitautogradnonfunctional_dispatch.h>
56
+ #include <ATen/ops/acosh_compositeexplicitautogradnonfunctional_dispatch.h>
57
+ #include <ATen/ops/adaptive_max_pool2d_compositeexplicitautogradnonfunctional_dispatch.h>
58
+ #include <ATen/ops/adaptive_max_pool2d_backward_compositeexplicitautogradnonfunctional_dispatch.h>
59
+ #include <ATen/ops/adaptive_max_pool3d_compositeexplicitautogradnonfunctional_dispatch.h>
60
+ #include <ATen/ops/adaptive_max_pool3d_backward_compositeexplicitautogradnonfunctional_dispatch.h>
61
+ #include <ATen/ops/add_compositeexplicitautogradnonfunctional_dispatch.h>
62
+ #include <ATen/ops/addcdiv_compositeexplicitautogradnonfunctional_dispatch.h>
63
+ #include <ATen/ops/addcmul_compositeexplicitautogradnonfunctional_dispatch.h>
64
+ #include <ATen/ops/addmm_compositeexplicitautogradnonfunctional_dispatch.h>
65
+ #include <ATen/ops/addmv_compositeexplicitautogradnonfunctional_dispatch.h>
66
+ #include <ATen/ops/alias_copy_compositeexplicitautogradnonfunctional_dispatch.h>
67
+ #include <ATen/ops/all_compositeexplicitautogradnonfunctional_dispatch.h>
68
+ #include <ATen/ops/amax_compositeexplicitautogradnonfunctional_dispatch.h>
69
+ #include <ATen/ops/amin_compositeexplicitautogradnonfunctional_dispatch.h>
70
+ #include <ATen/ops/aminmax_compositeexplicitautogradnonfunctional_dispatch.h>
71
+ #include <ATen/ops/any_compositeexplicitautogradnonfunctional_dispatch.h>
72
+ #include <ATen/ops/argmax_compositeexplicitautogradnonfunctional_dispatch.h>
73
+ #include <ATen/ops/argmin_compositeexplicitautogradnonfunctional_dispatch.h>
74
+ #include <ATen/ops/as_strided_compositeexplicitautogradnonfunctional_dispatch.h>
75
+ #include <ATen/ops/as_strided_copy_compositeexplicitautogradnonfunctional_dispatch.h>
76
+ #include <ATen/ops/as_strided_scatter_compositeexplicitautogradnonfunctional_dispatch.h>
77
+ #include <ATen/ops/asin_compositeexplicitautogradnonfunctional_dispatch.h>
78
+ #include <ATen/ops/asinh_compositeexplicitautogradnonfunctional_dispatch.h>
79
+ #include <ATen/ops/atan_compositeexplicitautogradnonfunctional_dispatch.h>
80
+ #include <ATen/ops/atan2_compositeexplicitautogradnonfunctional_dispatch.h>
81
+ #include <ATen/ops/atanh_compositeexplicitautogradnonfunctional_dispatch.h>
82
+ #include <ATen/ops/avg_pool2d_compositeexplicitautogradnonfunctional_dispatch.h>
83
+ #include <ATen/ops/avg_pool2d_backward_compositeexplicitautogradnonfunctional_dispatch.h>
84
+ #include <ATen/ops/avg_pool3d_compositeexplicitautogradnonfunctional_dispatch.h>
85
+ #include <ATen/ops/avg_pool3d_backward_compositeexplicitautogradnonfunctional_dispatch.h>
86
+ #include <ATen/ops/baddbmm_compositeexplicitautogradnonfunctional_dispatch.h>
87
+ #include <ATen/ops/bernoulli_compositeexplicitautogradnonfunctional_dispatch.h>
88
+ #include <ATen/ops/bitwise_and_compositeexplicitautogradnonfunctional_dispatch.h>
89
+ #include <ATen/ops/bitwise_left_shift_compositeexplicitautogradnonfunctional_dispatch.h>
90
+ #include <ATen/ops/bitwise_not_compositeexplicitautogradnonfunctional_dispatch.h>
91
+ #include <ATen/ops/bitwise_or_compositeexplicitautogradnonfunctional_dispatch.h>
92
+ #include <ATen/ops/bitwise_right_shift_compositeexplicitautogradnonfunctional_dispatch.h>
93
+ #include <ATen/ops/bitwise_xor_compositeexplicitautogradnonfunctional_dispatch.h>
94
+ #include <ATen/ops/bmm_compositeexplicitautogradnonfunctional_dispatch.h>
95
+ #include <ATen/ops/cat_compositeexplicitautogradnonfunctional_dispatch.h>
96
+ #include <ATen/ops/ccol_indices_copy_compositeexplicitautogradnonfunctional_dispatch.h>
97
+ #include <ATen/ops/ceil_compositeexplicitautogradnonfunctional_dispatch.h>
98
+ #include <ATen/ops/clamp_compositeexplicitautogradnonfunctional_dispatch.h>
99
+ #include <ATen/ops/clamp_max_compositeexplicitautogradnonfunctional_dispatch.h>
100
+ #include <ATen/ops/clamp_min_compositeexplicitautogradnonfunctional_dispatch.h>
101
+ #include <ATen/ops/col_indices_copy_compositeexplicitautogradnonfunctional_dispatch.h>
102
+ #include <ATen/ops/copy_compositeexplicitautogradnonfunctional_dispatch.h>
103
+ #include <ATen/ops/copysign_compositeexplicitautogradnonfunctional_dispatch.h>
104
+ #include <ATen/ops/cos_compositeexplicitautogradnonfunctional_dispatch.h>
105
+ #include <ATen/ops/cosh_compositeexplicitautogradnonfunctional_dispatch.h>
106
+ #include <ATen/ops/crow_indices_copy_compositeexplicitautogradnonfunctional_dispatch.h>
107
+ #include <ATen/ops/cumprod_compositeexplicitautogradnonfunctional_dispatch.h>
108
+ #include <ATen/ops/cumsum_compositeexplicitautogradnonfunctional_dispatch.h>
109
+ #include <ATen/ops/detach_copy_compositeexplicitautogradnonfunctional_dispatch.h>
110
+ #include <ATen/ops/diag_embed_compositeexplicitautogradnonfunctional_dispatch.h>
111
+ #include <ATen/ops/diagonal_copy_compositeexplicitautogradnonfunctional_dispatch.h>
112
+ #include <ATen/ops/diagonal_scatter_compositeexplicitautogradnonfunctional_dispatch.h>
113
+ #include <ATen/ops/digamma_compositeexplicitautogradnonfunctional_dispatch.h>
114
+ #include <ATen/ops/div_compositeexplicitautogradnonfunctional_dispatch.h>
115
+ #include <ATen/ops/elu_compositeexplicitautogradnonfunctional_dispatch.h>
116
+ #include <ATen/ops/elu_backward_compositeexplicitautogradnonfunctional_dispatch.h>
117
+ #include <ATen/ops/eq_compositeexplicitautogradnonfunctional_dispatch.h>
118
+ #include <ATen/ops/erf_compositeexplicitautogradnonfunctional_dispatch.h>
119
+ #include <ATen/ops/erfc_compositeexplicitautogradnonfunctional_dispatch.h>
120
+ #include <ATen/ops/erfinv_compositeexplicitautogradnonfunctional_dispatch.h>
121
+ #include <ATen/ops/exp_compositeexplicitautogradnonfunctional_dispatch.h>
122
+ #include <ATen/ops/exp2_compositeexplicitautogradnonfunctional_dispatch.h>
123
+ #include <ATen/ops/expand_copy_compositeexplicitautogradnonfunctional_dispatch.h>
124
+ #include <ATen/ops/expm1_compositeexplicitautogradnonfunctional_dispatch.h>
125
+ #include <ATen/ops/floor_compositeexplicitautogradnonfunctional_dispatch.h>
126
+ #include <ATen/ops/fmax_compositeexplicitautogradnonfunctional_dispatch.h>
127
+ #include <ATen/ops/fmin_compositeexplicitautogradnonfunctional_dispatch.h>
128
+ #include <ATen/ops/fmod_compositeexplicitautogradnonfunctional_dispatch.h>
129
+ #include <ATen/ops/frac_compositeexplicitautogradnonfunctional_dispatch.h>
130
+ #include <ATen/ops/fractional_max_pool2d_compositeexplicitautogradnonfunctional_dispatch.h>
131
+ #include <ATen/ops/fractional_max_pool2d_backward_compositeexplicitautogradnonfunctional_dispatch.h>
132
+ #include <ATen/ops/fractional_max_pool3d_compositeexplicitautogradnonfunctional_dispatch.h>
133
+ #include <ATen/ops/gather_compositeexplicitautogradnonfunctional_dispatch.h>
134
+ #include <ATen/ops/gcd_compositeexplicitautogradnonfunctional_dispatch.h>
135
+ #include <ATen/ops/ge_compositeexplicitautogradnonfunctional_dispatch.h>
136
+ #include <ATen/ops/gelu_compositeexplicitautogradnonfunctional_dispatch.h>
137
+ #include <ATen/ops/gelu_backward_compositeexplicitautogradnonfunctional_dispatch.h>
138
+ #include <ATen/ops/glu_compositeexplicitautogradnonfunctional_dispatch.h>
139
+ #include <ATen/ops/gt_compositeexplicitautogradnonfunctional_dispatch.h>
140
+ #include <ATen/ops/hardshrink_compositeexplicitautogradnonfunctional_dispatch.h>
141
+ #include <ATen/ops/hardshrink_backward_compositeexplicitautogradnonfunctional_dispatch.h>
142
+ #include <ATen/ops/hardsigmoid_compositeexplicitautogradnonfunctional_dispatch.h>
143
+ #include <ATen/ops/hardsigmoid_backward_compositeexplicitautogradnonfunctional_dispatch.h>
144
+ #include <ATen/ops/hash_tensor_compositeexplicitautogradnonfunctional_dispatch.h>
145
+ #include <ATen/ops/heaviside_compositeexplicitautogradnonfunctional_dispatch.h>
146
+ #include <ATen/ops/hypot_compositeexplicitautogradnonfunctional_dispatch.h>
147
+ #include <ATen/ops/i0_compositeexplicitautogradnonfunctional_dispatch.h>
148
+ #include <ATen/ops/igamma_compositeexplicitautogradnonfunctional_dispatch.h>
149
+ #include <ATen/ops/igammac_compositeexplicitautogradnonfunctional_dispatch.h>
150
+ #include <ATen/ops/index_compositeexplicitautogradnonfunctional_dispatch.h>
151
+ #include <ATen/ops/index_add_compositeexplicitautogradnonfunctional_dispatch.h>
152
+ #include <ATen/ops/index_copy_compositeexplicitautogradnonfunctional_dispatch.h>
153
+ #include <ATen/ops/index_reduce_compositeexplicitautogradnonfunctional_dispatch.h>
154
+ #include <ATen/ops/indices_copy_compositeexplicitautogradnonfunctional_dispatch.h>
155
+ #include <ATen/ops/isin_compositeexplicitautogradnonfunctional_dispatch.h>
156
+ #include <ATen/ops/isneginf_compositeexplicitautogradnonfunctional_dispatch.h>
157
+ #include <ATen/ops/isposinf_compositeexplicitautogradnonfunctional_dispatch.h>
158
+ #include <ATen/ops/lcm_compositeexplicitautogradnonfunctional_dispatch.h>
159
+ #include <ATen/ops/le_compositeexplicitautogradnonfunctional_dispatch.h>
160
+ #include <ATen/ops/leaky_relu_compositeexplicitautogradnonfunctional_dispatch.h>
161
+ #include <ATen/ops/leaky_relu_backward_compositeexplicitautogradnonfunctional_dispatch.h>
162
+ #include <ATen/ops/lerp_compositeexplicitautogradnonfunctional_dispatch.h>
163
+ #include <ATen/ops/lgamma_compositeexplicitautogradnonfunctional_dispatch.h>
164
+ #include <ATen/ops/lift_fresh_copy_compositeexplicitautogradnonfunctional_dispatch.h>
165
+ #include <ATen/ops/linalg_cholesky_ex_compositeexplicitautogradnonfunctional_dispatch.h>
166
+ #include <ATen/ops/linalg_cross_compositeexplicitautogradnonfunctional_dispatch.h>
167
+ #include <ATen/ops/linalg_inv_ex_compositeexplicitautogradnonfunctional_dispatch.h>
168
+ #include <ATen/ops/linalg_ldl_factor_ex_compositeexplicitautogradnonfunctional_dispatch.h>
169
+ #include <ATen/ops/linalg_ldl_solve_compositeexplicitautogradnonfunctional_dispatch.h>
170
+ #include <ATen/ops/linalg_lu_compositeexplicitautogradnonfunctional_dispatch.h>
171
+ #include <ATen/ops/linalg_lu_factor_ex_compositeexplicitautogradnonfunctional_dispatch.h>
172
+ #include <ATen/ops/linalg_lu_solve_compositeexplicitautogradnonfunctional_dispatch.h>
173
+ #include <ATen/ops/linalg_pinv_compositeexplicitautogradnonfunctional_dispatch.h>
174
+ #include <ATen/ops/linalg_qr_compositeexplicitautogradnonfunctional_dispatch.h>
175
+ #include <ATen/ops/linalg_vector_norm_compositeexplicitautogradnonfunctional_dispatch.h>
176
+ #include <ATen/ops/log_compositeexplicitautogradnonfunctional_dispatch.h>
177
+ #include <ATen/ops/log10_compositeexplicitautogradnonfunctional_dispatch.h>
178
+ #include <ATen/ops/log1p_compositeexplicitautogradnonfunctional_dispatch.h>
179
+ #include <ATen/ops/log2_compositeexplicitautogradnonfunctional_dispatch.h>
180
+ #include <ATen/ops/logaddexp_compositeexplicitautogradnonfunctional_dispatch.h>
181
+ #include <ATen/ops/logaddexp2_compositeexplicitautogradnonfunctional_dispatch.h>
182
+ #include <ATen/ops/logit_backward_compositeexplicitautogradnonfunctional_dispatch.h>
183
+ #include <ATen/ops/logsumexp_compositeexplicitautogradnonfunctional_dispatch.h>
184
+ #include <ATen/ops/lt_compositeexplicitautogradnonfunctional_dispatch.h>
185
+ #include <ATen/ops/lu_unpack_compositeexplicitautogradnonfunctional_dispatch.h>
186
+ #include <ATen/ops/max_compositeexplicitautogradnonfunctional_dispatch.h>
187
+ #include <ATen/ops/max_pool2d_with_indices_compositeexplicitautogradnonfunctional_dispatch.h>
188
+ #include <ATen/ops/max_pool2d_with_indices_backward_compositeexplicitautogradnonfunctional_dispatch.h>
189
+ #include <ATen/ops/maximum_compositeexplicitautogradnonfunctional_dispatch.h>
190
+ #include <ATen/ops/mean_compositeexplicitautogradnonfunctional_dispatch.h>
191
+ #include <ATen/ops/min_compositeexplicitautogradnonfunctional_dispatch.h>
192
+ #include <ATen/ops/minimum_compositeexplicitautogradnonfunctional_dispatch.h>
193
+ #include <ATen/ops/mish_compositeexplicitautogradnonfunctional_dispatch.h>
194
+ #include <ATen/ops/mm_compositeexplicitautogradnonfunctional_dispatch.h>
195
+ #include <ATen/ops/mse_loss_compositeexplicitautogradnonfunctional_dispatch.h>
196
+ #include <ATen/ops/mul_compositeexplicitautogradnonfunctional_dispatch.h>
197
+ #include <ATen/ops/narrow_copy_compositeexplicitautogradnonfunctional_dispatch.h>
198
+ #include <ATen/ops/ne_compositeexplicitautogradnonfunctional_dispatch.h>
199
+ #include <ATen/ops/neg_compositeexplicitautogradnonfunctional_dispatch.h>
200
+ #include <ATen/ops/new_empty_strided_compositeexplicitautogradnonfunctional_dispatch.h>
201
+ #include <ATen/ops/nextafter_compositeexplicitautogradnonfunctional_dispatch.h>
202
+ #include <ATen/ops/nll_loss_backward_compositeexplicitautogradnonfunctional_dispatch.h>
203
+ #include <ATen/ops/nll_loss_forward_compositeexplicitautogradnonfunctional_dispatch.h>
204
+ #include <ATen/ops/norm_compositeexplicitautogradnonfunctional_dispatch.h>
205
+ #include <ATen/ops/permute_copy_compositeexplicitautogradnonfunctional_dispatch.h>
206
+ #include <ATen/ops/pixel_shuffle_compositeexplicitautogradnonfunctional_dispatch.h>
207
+ #include <ATen/ops/pixel_unshuffle_compositeexplicitautogradnonfunctional_dispatch.h>
208
+ #include <ATen/ops/polygamma_compositeexplicitautogradnonfunctional_dispatch.h>
209
+ #include <ATen/ops/pow_compositeexplicitautogradnonfunctional_dispatch.h>
210
+ #include <ATen/ops/prod_compositeexplicitautogradnonfunctional_dispatch.h>
211
+ #include <ATen/ops/reciprocal_compositeexplicitautogradnonfunctional_dispatch.h>
212
+ #include <ATen/ops/reflection_pad1d_compositeexplicitautogradnonfunctional_dispatch.h>
213
+ #include <ATen/ops/reflection_pad1d_backward_compositeexplicitautogradnonfunctional_dispatch.h>
214
+ #include <ATen/ops/reflection_pad3d_compositeexplicitautogradnonfunctional_dispatch.h>
215
+ #include <ATen/ops/reflection_pad3d_backward_compositeexplicitautogradnonfunctional_dispatch.h>
216
+ #include <ATen/ops/remainder_compositeexplicitautogradnonfunctional_dispatch.h>
217
+ #include <ATen/ops/renorm_compositeexplicitautogradnonfunctional_dispatch.h>
218
+ #include <ATen/ops/replication_pad1d_compositeexplicitautogradnonfunctional_dispatch.h>
219
+ #include <ATen/ops/replication_pad1d_backward_compositeexplicitautogradnonfunctional_dispatch.h>
220
+ #include <ATen/ops/replication_pad2d_compositeexplicitautogradnonfunctional_dispatch.h>
221
+ #include <ATen/ops/replication_pad3d_compositeexplicitautogradnonfunctional_dispatch.h>
222
+ #include <ATen/ops/round_compositeexplicitautogradnonfunctional_dispatch.h>
223
+ #include <ATen/ops/row_indices_copy_compositeexplicitautogradnonfunctional_dispatch.h>
224
+ #include <ATen/ops/rsqrt_compositeexplicitautogradnonfunctional_dispatch.h>
225
+ #include <ATen/ops/scatter_compositeexplicitautogradnonfunctional_dispatch.h>
226
+ #include <ATen/ops/scatter_add_compositeexplicitautogradnonfunctional_dispatch.h>
227
+ #include <ATen/ops/scatter_reduce_compositeexplicitautogradnonfunctional_dispatch.h>
228
+ #include <ATen/ops/select_backward_compositeexplicitautogradnonfunctional_dispatch.h>
229
+ #include <ATen/ops/select_copy_compositeexplicitautogradnonfunctional_dispatch.h>
230
+ #include <ATen/ops/select_scatter_compositeexplicitautogradnonfunctional_dispatch.h>
231
+ #include <ATen/ops/sgn_compositeexplicitautogradnonfunctional_dispatch.h>
232
+ #include <ATen/ops/sigmoid_compositeexplicitautogradnonfunctional_dispatch.h>
233
+ #include <ATen/ops/sigmoid_backward_compositeexplicitautogradnonfunctional_dispatch.h>
234
+ #include <ATen/ops/sign_compositeexplicitautogradnonfunctional_dispatch.h>
235
+ #include <ATen/ops/signbit_compositeexplicitautogradnonfunctional_dispatch.h>
236
+ #include <ATen/ops/silu_compositeexplicitautogradnonfunctional_dispatch.h>
237
+ #include <ATen/ops/silu_backward_compositeexplicitautogradnonfunctional_dispatch.h>
238
+ #include <ATen/ops/sin_compositeexplicitautogradnonfunctional_dispatch.h>
239
+ #include <ATen/ops/sinc_compositeexplicitautogradnonfunctional_dispatch.h>
240
+ #include <ATen/ops/sinh_compositeexplicitautogradnonfunctional_dispatch.h>
241
+ #include <ATen/ops/slice_copy_compositeexplicitautogradnonfunctional_dispatch.h>
242
+ #include <ATen/ops/slice_scatter_compositeexplicitautogradnonfunctional_dispatch.h>
243
+ #include <ATen/ops/slow_conv_transpose2d_compositeexplicitautogradnonfunctional_dispatch.h>
244
+ #include <ATen/ops/smooth_l1_loss_compositeexplicitautogradnonfunctional_dispatch.h>
245
+ #include <ATen/ops/softplus_compositeexplicitautogradnonfunctional_dispatch.h>
246
+ #include <ATen/ops/softplus_backward_compositeexplicitautogradnonfunctional_dispatch.h>
247
+ #include <ATen/ops/softshrink_compositeexplicitautogradnonfunctional_dispatch.h>
248
+ #include <ATen/ops/softshrink_backward_compositeexplicitautogradnonfunctional_dispatch.h>
249
+ #include <ATen/ops/sort_compositeexplicitautogradnonfunctional_dispatch.h>
250
+ #include <ATen/ops/special_airy_ai_compositeexplicitautogradnonfunctional_dispatch.h>
251
+ #include <ATen/ops/special_bessel_j0_compositeexplicitautogradnonfunctional_dispatch.h>
252
+ #include <ATen/ops/special_bessel_j1_compositeexplicitautogradnonfunctional_dispatch.h>
253
+ #include <ATen/ops/special_bessel_y0_compositeexplicitautogradnonfunctional_dispatch.h>
254
+ #include <ATen/ops/special_bessel_y1_compositeexplicitautogradnonfunctional_dispatch.h>
255
+ #include <ATen/ops/special_chebyshev_polynomial_t_compositeexplicitautogradnonfunctional_dispatch.h>
256
+ #include <ATen/ops/special_chebyshev_polynomial_u_compositeexplicitautogradnonfunctional_dispatch.h>
257
+ #include <ATen/ops/special_chebyshev_polynomial_v_compositeexplicitautogradnonfunctional_dispatch.h>
258
+ #include <ATen/ops/special_chebyshev_polynomial_w_compositeexplicitautogradnonfunctional_dispatch.h>
259
+ #include <ATen/ops/special_entr_compositeexplicitautogradnonfunctional_dispatch.h>
260
+ #include <ATen/ops/special_erfcx_compositeexplicitautogradnonfunctional_dispatch.h>
261
+ #include <ATen/ops/special_hermite_polynomial_h_compositeexplicitautogradnonfunctional_dispatch.h>
262
+ #include <ATen/ops/special_hermite_polynomial_he_compositeexplicitautogradnonfunctional_dispatch.h>
263
+ #include <ATen/ops/special_i0e_compositeexplicitautogradnonfunctional_dispatch.h>
264
+ #include <ATen/ops/special_i1_compositeexplicitautogradnonfunctional_dispatch.h>
265
+ #include <ATen/ops/special_i1e_compositeexplicitautogradnonfunctional_dispatch.h>
266
+ #include <ATen/ops/special_laguerre_polynomial_l_compositeexplicitautogradnonfunctional_dispatch.h>
267
+ #include <ATen/ops/special_legendre_polynomial_p_compositeexplicitautogradnonfunctional_dispatch.h>
268
+ #include <ATen/ops/special_log_ndtr_compositeexplicitautogradnonfunctional_dispatch.h>
269
+ #include <ATen/ops/special_modified_bessel_i0_compositeexplicitautogradnonfunctional_dispatch.h>
270
+ #include <ATen/ops/special_modified_bessel_i1_compositeexplicitautogradnonfunctional_dispatch.h>
271
+ #include <ATen/ops/special_modified_bessel_k0_compositeexplicitautogradnonfunctional_dispatch.h>
272
+ #include <ATen/ops/special_modified_bessel_k1_compositeexplicitautogradnonfunctional_dispatch.h>
273
+ #include <ATen/ops/special_ndtri_compositeexplicitautogradnonfunctional_dispatch.h>
274
+ #include <ATen/ops/special_scaled_modified_bessel_k0_compositeexplicitautogradnonfunctional_dispatch.h>
275
+ #include <ATen/ops/special_scaled_modified_bessel_k1_compositeexplicitautogradnonfunctional_dispatch.h>
276
+ #include <ATen/ops/special_shifted_chebyshev_polynomial_t_compositeexplicitautogradnonfunctional_dispatch.h>
277
+ #include <ATen/ops/special_shifted_chebyshev_polynomial_u_compositeexplicitautogradnonfunctional_dispatch.h>
278
+ #include <ATen/ops/special_shifted_chebyshev_polynomial_v_compositeexplicitautogradnonfunctional_dispatch.h>
279
+ #include <ATen/ops/special_shifted_chebyshev_polynomial_w_compositeexplicitautogradnonfunctional_dispatch.h>
280
+ #include <ATen/ops/special_spherical_bessel_j0_compositeexplicitautogradnonfunctional_dispatch.h>
281
+ #include <ATen/ops/special_xlog1py_compositeexplicitautogradnonfunctional_dispatch.h>
282
+ #include <ATen/ops/special_zeta_compositeexplicitautogradnonfunctional_dispatch.h>
283
+ #include <ATen/ops/split_copy_compositeexplicitautogradnonfunctional_dispatch.h>
284
+ #include <ATen/ops/split_with_sizes_copy_compositeexplicitautogradnonfunctional_dispatch.h>
285
+ #include <ATen/ops/sqrt_compositeexplicitautogradnonfunctional_dispatch.h>
286
+ #include <ATen/ops/squeeze_copy_compositeexplicitautogradnonfunctional_dispatch.h>
287
+ #include <ATen/ops/sub_compositeexplicitautogradnonfunctional_dispatch.h>
288
+ #include <ATen/ops/sum_compositeexplicitautogradnonfunctional_dispatch.h>
289
+ #include <ATen/ops/t_copy_compositeexplicitautogradnonfunctional_dispatch.h>
290
+ #include <ATen/ops/tan_compositeexplicitautogradnonfunctional_dispatch.h>
291
+ #include <ATen/ops/tanh_compositeexplicitautogradnonfunctional_dispatch.h>
292
+ #include <ATen/ops/tanh_backward_compositeexplicitautogradnonfunctional_dispatch.h>
293
+ #include <ATen/ops/threshold_compositeexplicitautogradnonfunctional_dispatch.h>
294
+ #include <ATen/ops/threshold_backward_compositeexplicitautogradnonfunctional_dispatch.h>
295
+ #include <ATen/ops/topk_compositeexplicitautogradnonfunctional_dispatch.h>
296
+ #include <ATen/ops/transpose_copy_compositeexplicitautogradnonfunctional_dispatch.h>
297
+ #include <ATen/ops/triangular_solve_compositeexplicitautogradnonfunctional_dispatch.h>
298
+ #include <ATen/ops/tril_compositeexplicitautogradnonfunctional_dispatch.h>
299
+ #include <ATen/ops/triu_compositeexplicitautogradnonfunctional_dispatch.h>
300
+ #include <ATen/ops/trunc_compositeexplicitautogradnonfunctional_dispatch.h>
301
+ #include <ATen/ops/unbind_copy_compositeexplicitautogradnonfunctional_dispatch.h>
302
+ #include <ATen/ops/unfold_copy_compositeexplicitautogradnonfunctional_dispatch.h>
303
+ #include <ATen/ops/unsqueeze_copy_compositeexplicitautogradnonfunctional_dispatch.h>
304
+ #include <ATen/ops/upsample_bicubic2d_compositeexplicitautogradnonfunctional_dispatch.h>
305
+ #include <ATen/ops/upsample_bicubic2d_backward_compositeexplicitautogradnonfunctional_dispatch.h>
306
+ #include <ATen/ops/upsample_bilinear2d_compositeexplicitautogradnonfunctional_dispatch.h>
307
+ #include <ATen/ops/upsample_bilinear2d_backward_compositeexplicitautogradnonfunctional_dispatch.h>
308
+ #include <ATen/ops/upsample_linear1d_compositeexplicitautogradnonfunctional_dispatch.h>
309
+ #include <ATen/ops/upsample_linear1d_backward_compositeexplicitautogradnonfunctional_dispatch.h>
310
+ #include <ATen/ops/upsample_nearest1d_compositeexplicitautogradnonfunctional_dispatch.h>
311
+ #include <ATen/ops/upsample_nearest1d_backward_compositeexplicitautogradnonfunctional_dispatch.h>
312
+ #include <ATen/ops/upsample_nearest2d_compositeexplicitautogradnonfunctional_dispatch.h>
313
+ #include <ATen/ops/upsample_nearest2d_backward_compositeexplicitautogradnonfunctional_dispatch.h>
314
+ #include <ATen/ops/upsample_nearest3d_compositeexplicitautogradnonfunctional_dispatch.h>
315
+ #include <ATen/ops/upsample_nearest3d_backward_compositeexplicitautogradnonfunctional_dispatch.h>
316
+ #include <ATen/ops/upsample_trilinear3d_compositeexplicitautogradnonfunctional_dispatch.h>
317
+ #include <ATen/ops/upsample_trilinear3d_backward_compositeexplicitautogradnonfunctional_dispatch.h>
318
+ #include <ATen/ops/values_copy_compositeexplicitautogradnonfunctional_dispatch.h>
319
+ #include <ATen/ops/view_as_complex_copy_compositeexplicitautogradnonfunctional_dispatch.h>
320
+ #include <ATen/ops/view_as_real_copy_compositeexplicitautogradnonfunctional_dispatch.h>
321
+ #include <ATen/ops/view_copy_compositeexplicitautogradnonfunctional_dispatch.h>
322
+ #include <ATen/ops/xlogy_compositeexplicitautogradnonfunctional_dispatch.h>
323
+
324
+
325
+
326
+
327
+ #else
328
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
329
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CompositeImplicitAutogradFunctions.h ADDED
@@ -0,0 +1,34 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #include <ATen/core/TensorBody.h>
3
+
4
+ // TODO Undo all logic introduced for Note [Avoiding Include Cycles In Static Dispatch]
5
+ // Code introduced to avoid cyclic dependency in static dispatch is no longer
6
+ // needed as static dispatch logic is moved from TensorBody.h, which caused cycles in the first place,
7
+ // to Operators.cpp for supporting multiple backends with multiple kernels.
8
+ //
9
+ // Note [Avoiding Include Cycles In Static Dispatch]
10
+ // In order to avoid #include cycles in the static dispatch build, we've carefully split out
11
+ // the static function definition files into {DispatchKey}Functions.h and {DispatchKey}Functions_inl.h.
12
+ //
13
+ // Without this split, the include cycle looks like TensorBody.h -> CPUFunctions.h -> TensorBody.h.
14
+ // - TensorBody.h #includes CPUFunctions.h in the static dispatch build, because the tensor methods
15
+ // all need to call into the fastpath C++ API defined in CPUFunctions.h. The methods are also all
16
+ // directly inlined into TensorBody.h.
17
+ // - CPUFunctions.h #includes TensorBody.h because it contains function declarations for the entire C++ API,
18
+ // which include functions that have defaultable std::optional<Tensor> arguments.
19
+ // That requires knowing the full Tensor class definition.
20
+ //
21
+ // We break the cycle by doing the following:
22
+ // - Split out CPUFunction.h into two files: CPUFunctions.h and CPUFunctions_inl.h
23
+ // - CPUFunction.h is a dummy file that just includes the Tensor class and includes CPUFunctions_inl.,
24
+ // - CPUFunctions_inl.h includes everything else
25
+ // - (only in the static dispatch build) TensorBody.h makes sure to finish defining the Tensor class,
26
+ // and then it includes CPUFunctions_inl.h.
27
+ // - All other files that want the cpu fastpath functions can include CPUFunctions.h directly.
28
+ // - This also means that static dispatch build, CPUFunctions.h only needs to
29
+ // #include TensorBody.h, and it will automatically bring in CPUFunctions_inl.h.
30
+ #include <ATen/CompositeImplicitAutogradFunctions_inl.h>
31
+
32
+ #else
33
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
34
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CompositeImplicitAutogradFunctions_inl.h ADDED
@@ -0,0 +1,508 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+ // @generated by torchgen/gen.py from DispatchKeyFunctions_inl.h
4
+
5
+ // NB: The implementing C++ file is RegisterDispatchKey.cpp
6
+
7
+ // The only #includes we need are for custom classes that have defaults in the C++ API
8
+ #include <c10/core/MemoryFormat.h>
9
+ #include <c10/core/Scalar.h>
10
+ #include <ATen/core/Reduction.h>
11
+
12
+ #if defined(AT_PER_OPERATOR_HEADERS) && defined(TORCH_ASSERT_ONLY_METHOD_OPERATORS)
13
+ #error This change adds a dependency on all pytorch operators, meaning the \
14
+ file will need to be re-compiled every time an operator is changed or added. \
15
+ Consider including a specific operator from \
16
+ <ATen/ops/{my_operator}_compositeimplicitautograd_dispatch.h>. \
17
+ See NOTE [TORCH_ASSERT_ONLY_METHOD_OPERATORS].
18
+ #endif
19
+
20
+ #include <ATen/ops/_add_batch_dim_compositeimplicitautograd_dispatch.h>
21
+ #include <ATen/ops/_autocast_to_full_precision_compositeimplicitautograd_dispatch.h>
22
+ #include <ATen/ops/_autocast_to_reduced_precision_compositeimplicitautograd_dispatch.h>
23
+ #include <ATen/ops/_backward_compositeimplicitautograd_dispatch.h>
24
+ #include <ATen/ops/_batch_norm_impl_index_compositeimplicitautograd_dispatch.h>
25
+ #include <ATen/ops/_batch_norm_impl_index_backward_compositeimplicitautograd_dispatch.h>
26
+ #include <ATen/ops/_cast_Byte_compositeimplicitautograd_dispatch.h>
27
+ #include <ATen/ops/_cast_Char_compositeimplicitautograd_dispatch.h>
28
+ #include <ATen/ops/_cast_Double_compositeimplicitautograd_dispatch.h>
29
+ #include <ATen/ops/_cast_Float_compositeimplicitautograd_dispatch.h>
30
+ #include <ATen/ops/_cast_Half_compositeimplicitautograd_dispatch.h>
31
+ #include <ATen/ops/_cast_Int_compositeimplicitautograd_dispatch.h>
32
+ #include <ATen/ops/_cast_Long_compositeimplicitautograd_dispatch.h>
33
+ #include <ATen/ops/_cast_Short_compositeimplicitautograd_dispatch.h>
34
+ #include <ATen/ops/_choose_qparams_per_tensor_compositeimplicitautograd_dispatch.h>
35
+ #include <ATen/ops/_convolution_compositeimplicitautograd_dispatch.h>
36
+ #include <ATen/ops/_convolution_double_backward_compositeimplicitautograd_dispatch.h>
37
+ #include <ATen/ops/_convolution_mode_compositeimplicitautograd_dispatch.h>
38
+ #include <ATen/ops/_cufft_clear_plan_cache_compositeimplicitautograd_dispatch.h>
39
+ #include <ATen/ops/_cufft_get_plan_cache_max_size_compositeimplicitautograd_dispatch.h>
40
+ #include <ATen/ops/_cufft_get_plan_cache_size_compositeimplicitautograd_dispatch.h>
41
+ #include <ATen/ops/_cufft_set_plan_cache_max_size_compositeimplicitautograd_dispatch.h>
42
+ #include <ATen/ops/_debug_has_internal_overlap_compositeimplicitautograd_dispatch.h>
43
+ #include <ATen/ops/_dim_arange_compositeimplicitautograd_dispatch.h>
44
+ #include <ATen/ops/_embedding_bag_sparse_backward_compositeimplicitautograd_dispatch.h>
45
+ #include <ATen/ops/_fused_rms_norm_compositeimplicitautograd_dispatch.h>
46
+ #include <ATen/ops/_gather_sparse_backward_compositeimplicitautograd_dispatch.h>
47
+ #include <ATen/ops/_grid_sampler_2d_cpu_fallback_backward_compositeimplicitautograd_dispatch.h>
48
+ #include <ATen/ops/_has_compatible_shallow_copy_type_compositeimplicitautograd_dispatch.h>
49
+ #include <ATen/ops/_is_zerotensor_compositeimplicitautograd_dispatch.h>
50
+ #include <ATen/ops/_lu_with_info_compositeimplicitautograd_dispatch.h>
51
+ #include <ATen/ops/_nnpack_available_compositeimplicitautograd_dispatch.h>
52
+ #include <ATen/ops/_pack_padded_sequence_backward_compositeimplicitautograd_dispatch.h>
53
+ #include <ATen/ops/_pad_circular_compositeimplicitautograd_dispatch.h>
54
+ #include <ATen/ops/_pad_enum_compositeimplicitautograd_dispatch.h>
55
+ #include <ATen/ops/_pad_packed_sequence_compositeimplicitautograd_dispatch.h>
56
+ #include <ATen/ops/_propagate_xla_data_compositeimplicitautograd_dispatch.h>
57
+ #include <ATen/ops/_remove_batch_dim_compositeimplicitautograd_dispatch.h>
58
+ #include <ATen/ops/_reshape_from_tensor_compositeimplicitautograd_dispatch.h>
59
+ #include <ATen/ops/_rowwise_prune_compositeimplicitautograd_dispatch.h>
60
+ #include <ATen/ops/_saturate_weight_to_fp16_compositeimplicitautograd_dispatch.h>
61
+ #include <ATen/ops/_scaled_dot_product_attention_math_compositeimplicitautograd_dispatch.h>
62
+ #include <ATen/ops/_shape_as_tensor_compositeimplicitautograd_dispatch.h>
63
+ #include <ATen/ops/_sobol_engine_draw_compositeimplicitautograd_dispatch.h>
64
+ #include <ATen/ops/_sobol_engine_ff_compositeimplicitautograd_dispatch.h>
65
+ #include <ATen/ops/_sobol_engine_initialize_state_compositeimplicitautograd_dispatch.h>
66
+ #include <ATen/ops/_sobol_engine_scramble_compositeimplicitautograd_dispatch.h>
67
+ #include <ATen/ops/_sparse_bsc_tensor_unsafe_compositeimplicitautograd_dispatch.h>
68
+ #include <ATen/ops/_sparse_bsr_tensor_unsafe_compositeimplicitautograd_dispatch.h>
69
+ #include <ATen/ops/_sparse_compressed_tensor_unsafe_compositeimplicitautograd_dispatch.h>
70
+ #include <ATen/ops/_sparse_coo_tensor_unsafe_compositeimplicitautograd_dispatch.h>
71
+ #include <ATen/ops/_sparse_csc_tensor_unsafe_compositeimplicitautograd_dispatch.h>
72
+ #include <ATen/ops/_sparse_csr_tensor_unsafe_compositeimplicitautograd_dispatch.h>
73
+ #include <ATen/ops/_sparse_log_softmax_compositeimplicitautograd_dispatch.h>
74
+ #include <ATen/ops/_sparse_mm_compositeimplicitautograd_dispatch.h>
75
+ #include <ATen/ops/_sparse_softmax_compositeimplicitautograd_dispatch.h>
76
+ #include <ATen/ops/_sparse_sum_compositeimplicitautograd_dispatch.h>
77
+ #include <ATen/ops/_test_ambiguous_defaults_compositeimplicitautograd_dispatch.h>
78
+ #include <ATen/ops/_test_autograd_multiple_dispatch_compositeimplicitautograd_dispatch.h>
79
+ #include <ATen/ops/_test_check_tensor_compositeimplicitautograd_dispatch.h>
80
+ #include <ATen/ops/_test_serialization_subcmul_compositeimplicitautograd_dispatch.h>
81
+ #include <ATen/ops/_test_string_default_compositeimplicitautograd_dispatch.h>
82
+ #include <ATen/ops/_thnn_differentiable_gru_cell_backward_compositeimplicitautograd_dispatch.h>
83
+ #include <ATen/ops/_thnn_differentiable_lstm_cell_backward_compositeimplicitautograd_dispatch.h>
84
+ #include <ATen/ops/_thnn_fused_lstm_cell_backward_compositeimplicitautograd_dispatch.h>
85
+ #include <ATen/ops/_to_cpu_compositeimplicitautograd_dispatch.h>
86
+ #include <ATen/ops/_unpack_dual_compositeimplicitautograd_dispatch.h>
87
+ #include <ATen/ops/_upsample_bicubic2d_aa_compositeimplicitautograd_dispatch.h>
88
+ #include <ATen/ops/_upsample_bilinear2d_aa_compositeimplicitautograd_dispatch.h>
89
+ #include <ATen/ops/_upsample_nearest_exact1d_compositeimplicitautograd_dispatch.h>
90
+ #include <ATen/ops/_upsample_nearest_exact2d_compositeimplicitautograd_dispatch.h>
91
+ #include <ATen/ops/_upsample_nearest_exact3d_compositeimplicitautograd_dispatch.h>
92
+ #include <ATen/ops/_use_cudnn_rnn_flatten_weight_compositeimplicitautograd_dispatch.h>
93
+ #include <ATen/ops/_validate_sparse_bsc_tensor_args_compositeimplicitautograd_dispatch.h>
94
+ #include <ATen/ops/_validate_sparse_bsr_tensor_args_compositeimplicitautograd_dispatch.h>
95
+ #include <ATen/ops/_validate_sparse_compressed_tensor_args_compositeimplicitautograd_dispatch.h>
96
+ #include <ATen/ops/_validate_sparse_coo_tensor_args_compositeimplicitautograd_dispatch.h>
97
+ #include <ATen/ops/_validate_sparse_csc_tensor_args_compositeimplicitautograd_dispatch.h>
98
+ #include <ATen/ops/_validate_sparse_csr_tensor_args_compositeimplicitautograd_dispatch.h>
99
+ #include <ATen/ops/_version_compositeimplicitautograd_dispatch.h>
100
+ #include <ATen/ops/_weight_norm_compositeimplicitautograd_dispatch.h>
101
+ #include <ATen/ops/_weight_norm_differentiable_backward_compositeimplicitautograd_dispatch.h>
102
+ #include <ATen/ops/_wrapped_linear_prepack_compositeimplicitautograd_dispatch.h>
103
+ #include <ATen/ops/_wrapped_quantized_linear_prepacked_compositeimplicitautograd_dispatch.h>
104
+ #include <ATen/ops/absolute_compositeimplicitautograd_dispatch.h>
105
+ #include <ATen/ops/adaptive_avg_pool1d_compositeimplicitautograd_dispatch.h>
106
+ #include <ATen/ops/adaptive_avg_pool2d_compositeimplicitautograd_dispatch.h>
107
+ #include <ATen/ops/adaptive_avg_pool3d_compositeimplicitautograd_dispatch.h>
108
+ #include <ATen/ops/adaptive_max_pool1d_compositeimplicitautograd_dispatch.h>
109
+ #include <ATen/ops/adjoint_compositeimplicitautograd_dispatch.h>
110
+ #include <ATen/ops/affine_grid_generator_backward_compositeimplicitautograd_dispatch.h>
111
+ #include <ATen/ops/align_as_compositeimplicitautograd_dispatch.h>
112
+ #include <ATen/ops/align_tensors_compositeimplicitautograd_dispatch.h>
113
+ #include <ATen/ops/align_to_compositeimplicitautograd_dispatch.h>
114
+ #include <ATen/ops/all_compositeimplicitautograd_dispatch.h>
115
+ #include <ATen/ops/alpha_dropout_compositeimplicitautograd_dispatch.h>
116
+ #include <ATen/ops/and_compositeimplicitautograd_dispatch.h>
117
+ #include <ATen/ops/any_compositeimplicitautograd_dispatch.h>
118
+ #include <ATen/ops/arccos_compositeimplicitautograd_dispatch.h>
119
+ #include <ATen/ops/arccosh_compositeimplicitautograd_dispatch.h>
120
+ #include <ATen/ops/arcsin_compositeimplicitautograd_dispatch.h>
121
+ #include <ATen/ops/arcsinh_compositeimplicitautograd_dispatch.h>
122
+ #include <ATen/ops/arctan_compositeimplicitautograd_dispatch.h>
123
+ #include <ATen/ops/arctan2_compositeimplicitautograd_dispatch.h>
124
+ #include <ATen/ops/arctanh_compositeimplicitautograd_dispatch.h>
125
+ #include <ATen/ops/argsort_compositeimplicitautograd_dispatch.h>
126
+ #include <ATen/ops/argwhere_compositeimplicitautograd_dispatch.h>
127
+ #include <ATen/ops/atleast_1d_compositeimplicitautograd_dispatch.h>
128
+ #include <ATen/ops/atleast_2d_compositeimplicitautograd_dispatch.h>
129
+ #include <ATen/ops/atleast_3d_compositeimplicitautograd_dispatch.h>
130
+ #include <ATen/ops/avg_pool1d_compositeimplicitautograd_dispatch.h>
131
+ #include <ATen/ops/batch_norm_compositeimplicitautograd_dispatch.h>
132
+ #include <ATen/ops/bilinear_compositeimplicitautograd_dispatch.h>
133
+ #include <ATen/ops/broadcast_tensors_compositeimplicitautograd_dispatch.h>
134
+ #include <ATen/ops/broadcast_to_compositeimplicitautograd_dispatch.h>
135
+ #include <ATen/ops/can_cast_compositeimplicitautograd_dispatch.h>
136
+ #include <ATen/ops/cartesian_prod_compositeimplicitautograd_dispatch.h>
137
+ #include <ATen/ops/cat_compositeimplicitautograd_dispatch.h>
138
+ #include <ATen/ops/cdist_compositeimplicitautograd_dispatch.h>
139
+ #include <ATen/ops/chain_matmul_compositeimplicitautograd_dispatch.h>
140
+ #include <ATen/ops/chalf_compositeimplicitautograd_dispatch.h>
141
+ #include <ATen/ops/choose_qparams_optimized_compositeimplicitautograd_dispatch.h>
142
+ #include <ATen/ops/chunk_compositeimplicitautograd_dispatch.h>
143
+ #include <ATen/ops/clip_compositeimplicitautograd_dispatch.h>
144
+ #include <ATen/ops/coalesce_compositeimplicitautograd_dispatch.h>
145
+ #include <ATen/ops/column_stack_compositeimplicitautograd_dispatch.h>
146
+ #include <ATen/ops/combinations_compositeimplicitautograd_dispatch.h>
147
+ #include <ATen/ops/concat_compositeimplicitautograd_dispatch.h>
148
+ #include <ATen/ops/concatenate_compositeimplicitautograd_dispatch.h>
149
+ #include <ATen/ops/conj_compositeimplicitautograd_dispatch.h>
150
+ #include <ATen/ops/conj_physical_compositeimplicitautograd_dispatch.h>
151
+ #include <ATen/ops/contiguous_compositeimplicitautograd_dispatch.h>
152
+ #include <ATen/ops/conv1d_compositeimplicitautograd_dispatch.h>
153
+ #include <ATen/ops/conv2d_compositeimplicitautograd_dispatch.h>
154
+ #include <ATen/ops/conv3d_compositeimplicitautograd_dispatch.h>
155
+ #include <ATen/ops/conv_tbc_backward_compositeimplicitautograd_dispatch.h>
156
+ #include <ATen/ops/conv_transpose1d_compositeimplicitautograd_dispatch.h>
157
+ #include <ATen/ops/conv_transpose2d_compositeimplicitautograd_dispatch.h>
158
+ #include <ATen/ops/conv_transpose3d_compositeimplicitautograd_dispatch.h>
159
+ #include <ATen/ops/corrcoef_compositeimplicitautograd_dispatch.h>
160
+ #include <ATen/ops/cosine_embedding_loss_compositeimplicitautograd_dispatch.h>
161
+ #include <ATen/ops/cosine_similarity_compositeimplicitautograd_dispatch.h>
162
+ #include <ATen/ops/cov_compositeimplicitautograd_dispatch.h>
163
+ #include <ATen/ops/cross_compositeimplicitautograd_dispatch.h>
164
+ #include <ATen/ops/cross_entropy_loss_compositeimplicitautograd_dispatch.h>
165
+ #include <ATen/ops/ctc_loss_compositeimplicitautograd_dispatch.h>
166
+ #include <ATen/ops/cudnn_is_acceptable_compositeimplicitautograd_dispatch.h>
167
+ #include <ATen/ops/cummax_compositeimplicitautograd_dispatch.h>
168
+ #include <ATen/ops/cummaxmin_backward_compositeimplicitautograd_dispatch.h>
169
+ #include <ATen/ops/cummin_compositeimplicitautograd_dispatch.h>
170
+ #include <ATen/ops/cumprod_compositeimplicitautograd_dispatch.h>
171
+ #include <ATen/ops/cumprod_backward_compositeimplicitautograd_dispatch.h>
172
+ #include <ATen/ops/cumsum_compositeimplicitautograd_dispatch.h>
173
+ #include <ATen/ops/cumulative_trapezoid_compositeimplicitautograd_dispatch.h>
174
+ #include <ATen/ops/data_compositeimplicitautograd_dispatch.h>
175
+ #include <ATen/ops/det_compositeimplicitautograd_dispatch.h>
176
+ #include <ATen/ops/diag_compositeimplicitautograd_dispatch.h>
177
+ #include <ATen/ops/diagflat_compositeimplicitautograd_dispatch.h>
178
+ #include <ATen/ops/diagonal_compositeimplicitautograd_dispatch.h>
179
+ #include <ATen/ops/diff_compositeimplicitautograd_dispatch.h>
180
+ #include <ATen/ops/divide_compositeimplicitautograd_dispatch.h>
181
+ #include <ATen/ops/dropout_compositeimplicitautograd_dispatch.h>
182
+ #include <ATen/ops/dsplit_compositeimplicitautograd_dispatch.h>
183
+ #include <ATen/ops/dstack_compositeimplicitautograd_dispatch.h>
184
+ #include <ATen/ops/einsum_compositeimplicitautograd_dispatch.h>
185
+ #include <ATen/ops/embedding_backward_compositeimplicitautograd_dispatch.h>
186
+ #include <ATen/ops/embedding_bag_compositeimplicitautograd_dispatch.h>
187
+ #include <ATen/ops/embedding_sparse_backward_compositeimplicitautograd_dispatch.h>
188
+ #include <ATen/ops/empty_compositeimplicitautograd_dispatch.h>
189
+ #include <ATen/ops/expand_as_compositeimplicitautograd_dispatch.h>
190
+ #include <ATen/ops/fake_quantize_per_channel_affine_compositeimplicitautograd_dispatch.h>
191
+ #include <ATen/ops/fake_quantize_per_channel_affine_cachemask_backward_compositeimplicitautograd_dispatch.h>
192
+ #include <ATen/ops/fake_quantize_per_tensor_affine_compositeimplicitautograd_dispatch.h>
193
+ #include <ATen/ops/fake_quantize_per_tensor_affine_cachemask_backward_compositeimplicitautograd_dispatch.h>
194
+ #include <ATen/ops/fbgemm_linear_fp16_weight_compositeimplicitautograd_dispatch.h>
195
+ #include <ATen/ops/fbgemm_linear_fp16_weight_fp32_activation_compositeimplicitautograd_dispatch.h>
196
+ #include <ATen/ops/fbgemm_linear_int8_weight_compositeimplicitautograd_dispatch.h>
197
+ #include <ATen/ops/fbgemm_linear_int8_weight_fp32_activation_compositeimplicitautograd_dispatch.h>
198
+ #include <ATen/ops/fbgemm_linear_quantize_weight_compositeimplicitautograd_dispatch.h>
199
+ #include <ATen/ops/fbgemm_pack_gemm_matrix_fp16_compositeimplicitautograd_dispatch.h>
200
+ #include <ATen/ops/fbgemm_pack_quantized_matrix_compositeimplicitautograd_dispatch.h>
201
+ #include <ATen/ops/feature_alpha_dropout_compositeimplicitautograd_dispatch.h>
202
+ #include <ATen/ops/feature_dropout_compositeimplicitautograd_dispatch.h>
203
+ #include <ATen/ops/fft_fft_compositeimplicitautograd_dispatch.h>
204
+ #include <ATen/ops/fft_fft2_compositeimplicitautograd_dispatch.h>
205
+ #include <ATen/ops/fft_fftn_compositeimplicitautograd_dispatch.h>
206
+ #include <ATen/ops/fft_fftshift_compositeimplicitautograd_dispatch.h>
207
+ #include <ATen/ops/fft_hfft_compositeimplicitautograd_dispatch.h>
208
+ #include <ATen/ops/fft_hfft2_compositeimplicitautograd_dispatch.h>
209
+ #include <ATen/ops/fft_hfftn_compositeimplicitautograd_dispatch.h>
210
+ #include <ATen/ops/fft_ifft_compositeimplicitautograd_dispatch.h>
211
+ #include <ATen/ops/fft_ifft2_compositeimplicitautograd_dispatch.h>
212
+ #include <ATen/ops/fft_ifftn_compositeimplicitautograd_dispatch.h>
213
+ #include <ATen/ops/fft_ifftshift_compositeimplicitautograd_dispatch.h>
214
+ #include <ATen/ops/fft_ihfft_compositeimplicitautograd_dispatch.h>
215
+ #include <ATen/ops/fft_ihfft2_compositeimplicitautograd_dispatch.h>
216
+ #include <ATen/ops/fft_ihfftn_compositeimplicitautograd_dispatch.h>
217
+ #include <ATen/ops/fft_irfft_compositeimplicitautograd_dispatch.h>
218
+ #include <ATen/ops/fft_irfft2_compositeimplicitautograd_dispatch.h>
219
+ #include <ATen/ops/fft_irfftn_compositeimplicitautograd_dispatch.h>
220
+ #include <ATen/ops/fft_rfft_compositeimplicitautograd_dispatch.h>
221
+ #include <ATen/ops/fft_rfft2_compositeimplicitautograd_dispatch.h>
222
+ #include <ATen/ops/fft_rfftn_compositeimplicitautograd_dispatch.h>
223
+ #include <ATen/ops/fill_diagonal_compositeimplicitautograd_dispatch.h>
224
+ #include <ATen/ops/fix_compositeimplicitautograd_dispatch.h>
225
+ #include <ATen/ops/flatten_compositeimplicitautograd_dispatch.h>
226
+ #include <ATen/ops/flatten_dense_tensors_compositeimplicitautograd_dispatch.h>
227
+ #include <ATen/ops/fliplr_compositeimplicitautograd_dispatch.h>
228
+ #include <ATen/ops/flipud_compositeimplicitautograd_dispatch.h>
229
+ #include <ATen/ops/float_power_compositeimplicitautograd_dispatch.h>
230
+ #include <ATen/ops/frobenius_norm_compositeimplicitautograd_dispatch.h>
231
+ #include <ATen/ops/fused_moving_avg_obs_fake_quant_compositeimplicitautograd_dispatch.h>
232
+ #include <ATen/ops/gather_compositeimplicitautograd_dispatch.h>
233
+ #include <ATen/ops/gather_backward_compositeimplicitautograd_dispatch.h>
234
+ #include <ATen/ops/ger_compositeimplicitautograd_dispatch.h>
235
+ #include <ATen/ops/gradient_compositeimplicitautograd_dispatch.h>
236
+ #include <ATen/ops/greater_compositeimplicitautograd_dispatch.h>
237
+ #include <ATen/ops/greater_equal_compositeimplicitautograd_dispatch.h>
238
+ #include <ATen/ops/grid_sampler_compositeimplicitautograd_dispatch.h>
239
+ #include <ATen/ops/group_norm_compositeimplicitautograd_dispatch.h>
240
+ #include <ATen/ops/gru_compositeimplicitautograd_dispatch.h>
241
+ #include <ATen/ops/gru_cell_compositeimplicitautograd_dispatch.h>
242
+ #include <ATen/ops/hinge_embedding_loss_compositeimplicitautograd_dispatch.h>
243
+ #include <ATen/ops/histogramdd_compositeimplicitautograd_dispatch.h>
244
+ #include <ATen/ops/hsplit_compositeimplicitautograd_dispatch.h>
245
+ #include <ATen/ops/hstack_compositeimplicitautograd_dispatch.h>
246
+ #include <ATen/ops/imag_compositeimplicitautograd_dispatch.h>
247
+ #include <ATen/ops/index_add_compositeimplicitautograd_dispatch.h>
248
+ #include <ATen/ops/index_copy_compositeimplicitautograd_dispatch.h>
249
+ #include <ATen/ops/index_fill_compositeimplicitautograd_dispatch.h>
250
+ #include <ATen/ops/index_select_compositeimplicitautograd_dispatch.h>
251
+ #include <ATen/ops/index_select_backward_compositeimplicitautograd_dispatch.h>
252
+ #include <ATen/ops/infinitely_differentiable_gelu_backward_compositeimplicitautograd_dispatch.h>
253
+ #include <ATen/ops/inner_compositeimplicitautograd_dispatch.h>
254
+ #include <ATen/ops/instance_norm_compositeimplicitautograd_dispatch.h>
255
+ #include <ATen/ops/inverse_compositeimplicitautograd_dispatch.h>
256
+ #include <ATen/ops/is_complex_compositeimplicitautograd_dispatch.h>
257
+ #include <ATen/ops/is_conj_compositeimplicitautograd_dispatch.h>
258
+ #include <ATen/ops/is_distributed_compositeimplicitautograd_dispatch.h>
259
+ #include <ATen/ops/is_floating_point_compositeimplicitautograd_dispatch.h>
260
+ #include <ATen/ops/is_inference_compositeimplicitautograd_dispatch.h>
261
+ #include <ATen/ops/is_leaf_compositeimplicitautograd_dispatch.h>
262
+ #include <ATen/ops/is_neg_compositeimplicitautograd_dispatch.h>
263
+ #include <ATen/ops/is_nonzero_compositeimplicitautograd_dispatch.h>
264
+ #include <ATen/ops/is_signed_compositeimplicitautograd_dispatch.h>
265
+ #include <ATen/ops/is_vulkan_available_compositeimplicitautograd_dispatch.h>
266
+ #include <ATen/ops/isclose_compositeimplicitautograd_dispatch.h>
267
+ #include <ATen/ops/isfinite_compositeimplicitautograd_dispatch.h>
268
+ #include <ATen/ops/isreal_compositeimplicitautograd_dispatch.h>
269
+ #include <ATen/ops/istft_compositeimplicitautograd_dispatch.h>
270
+ #include <ATen/ops/item_compositeimplicitautograd_dispatch.h>
271
+ #include <ATen/ops/kl_div_compositeimplicitautograd_dispatch.h>
272
+ #include <ATen/ops/kron_compositeimplicitautograd_dispatch.h>
273
+ #include <ATen/ops/kthvalue_compositeimplicitautograd_dispatch.h>
274
+ #include <ATen/ops/l1_loss_compositeimplicitautograd_dispatch.h>
275
+ #include <ATen/ops/layer_norm_compositeimplicitautograd_dispatch.h>
276
+ #include <ATen/ops/ldexp_compositeimplicitautograd_dispatch.h>
277
+ #include <ATen/ops/less_compositeimplicitautograd_dispatch.h>
278
+ #include <ATen/ops/less_equal_compositeimplicitautograd_dispatch.h>
279
+ #include <ATen/ops/linalg_cholesky_compositeimplicitautograd_dispatch.h>
280
+ #include <ATen/ops/linalg_cond_compositeimplicitautograd_dispatch.h>
281
+ #include <ATen/ops/linalg_det_compositeimplicitautograd_dispatch.h>
282
+ #include <ATen/ops/linalg_diagonal_compositeimplicitautograd_dispatch.h>
283
+ #include <ATen/ops/linalg_eigh_compositeimplicitautograd_dispatch.h>
284
+ #include <ATen/ops/linalg_eigvals_compositeimplicitautograd_dispatch.h>
285
+ #include <ATen/ops/linalg_eigvalsh_compositeimplicitautograd_dispatch.h>
286
+ #include <ATen/ops/linalg_inv_compositeimplicitautograd_dispatch.h>
287
+ #include <ATen/ops/linalg_ldl_factor_compositeimplicitautograd_dispatch.h>
288
+ #include <ATen/ops/linalg_lu_factor_compositeimplicitautograd_dispatch.h>
289
+ #include <ATen/ops/linalg_matmul_compositeimplicitautograd_dispatch.h>
290
+ #include <ATen/ops/linalg_matrix_norm_compositeimplicitautograd_dispatch.h>
291
+ #include <ATen/ops/linalg_matrix_power_compositeimplicitautograd_dispatch.h>
292
+ #include <ATen/ops/linalg_matrix_rank_compositeimplicitautograd_dispatch.h>
293
+ #include <ATen/ops/linalg_multi_dot_compositeimplicitautograd_dispatch.h>
294
+ #include <ATen/ops/linalg_norm_compositeimplicitautograd_dispatch.h>
295
+ #include <ATen/ops/linalg_pinv_compositeimplicitautograd_dispatch.h>
296
+ #include <ATen/ops/linalg_slogdet_compositeimplicitautograd_dispatch.h>
297
+ #include <ATen/ops/linalg_solve_compositeimplicitautograd_dispatch.h>
298
+ #include <ATen/ops/linalg_solve_ex_compositeimplicitautograd_dispatch.h>
299
+ #include <ATen/ops/linalg_svd_compositeimplicitautograd_dispatch.h>
300
+ #include <ATen/ops/linalg_svdvals_compositeimplicitautograd_dispatch.h>
301
+ #include <ATen/ops/linalg_tensorinv_compositeimplicitautograd_dispatch.h>
302
+ #include <ATen/ops/linalg_tensorsolve_compositeimplicitautograd_dispatch.h>
303
+ #include <ATen/ops/linalg_vander_compositeimplicitautograd_dispatch.h>
304
+ #include <ATen/ops/linalg_vecdot_compositeimplicitautograd_dispatch.h>
305
+ #include <ATen/ops/linear_compositeimplicitautograd_dispatch.h>
306
+ #include <ATen/ops/log_sigmoid_compositeimplicitautograd_dispatch.h>
307
+ #include <ATen/ops/log_softmax_compositeimplicitautograd_dispatch.h>
308
+ #include <ATen/ops/logcumsumexp_compositeimplicitautograd_dispatch.h>
309
+ #include <ATen/ops/logdet_compositeimplicitautograd_dispatch.h>
310
+ #include <ATen/ops/logsumexp_compositeimplicitautograd_dispatch.h>
311
+ #include <ATen/ops/lstm_compositeimplicitautograd_dispatch.h>
312
+ #include <ATen/ops/lstm_cell_compositeimplicitautograd_dispatch.h>
313
+ #include <ATen/ops/lu_solve_compositeimplicitautograd_dispatch.h>
314
+ #include <ATen/ops/mH_compositeimplicitautograd_dispatch.h>
315
+ #include <ATen/ops/mT_compositeimplicitautograd_dispatch.h>
316
+ #include <ATen/ops/margin_ranking_loss_compositeimplicitautograd_dispatch.h>
317
+ #include <ATen/ops/masked_select_backward_compositeimplicitautograd_dispatch.h>
318
+ #include <ATen/ops/matmul_compositeimplicitautograd_dispatch.h>
319
+ #include <ATen/ops/matrix_H_compositeimplicitautograd_dispatch.h>
320
+ #include <ATen/ops/matrix_exp_compositeimplicitautograd_dispatch.h>
321
+ #include <ATen/ops/matrix_exp_backward_compositeimplicitautograd_dispatch.h>
322
+ #include <ATen/ops/matrix_power_compositeimplicitautograd_dispatch.h>
323
+ #include <ATen/ops/max_compositeimplicitautograd_dispatch.h>
324
+ #include <ATen/ops/max_pool1d_compositeimplicitautograd_dispatch.h>
325
+ #include <ATen/ops/max_pool1d_with_indices_compositeimplicitautograd_dispatch.h>
326
+ #include <ATen/ops/max_pool2d_compositeimplicitautograd_dispatch.h>
327
+ #include <ATen/ops/max_pool3d_compositeimplicitautograd_dispatch.h>
328
+ #include <ATen/ops/mean_compositeimplicitautograd_dispatch.h>
329
+ #include <ATen/ops/median_compositeimplicitautograd_dispatch.h>
330
+ #include <ATen/ops/meshgrid_compositeimplicitautograd_dispatch.h>
331
+ #include <ATen/ops/min_compositeimplicitautograd_dispatch.h>
332
+ #include <ATen/ops/mish_backward_compositeimplicitautograd_dispatch.h>
333
+ #include <ATen/ops/mode_compositeimplicitautograd_dispatch.h>
334
+ #include <ATen/ops/moveaxis_compositeimplicitautograd_dispatch.h>
335
+ #include <ATen/ops/movedim_compositeimplicitautograd_dispatch.h>
336
+ #include <ATen/ops/msort_compositeimplicitautograd_dispatch.h>
337
+ #include <ATen/ops/multilabel_margin_loss_compositeimplicitautograd_dispatch.h>
338
+ #include <ATen/ops/multiply_compositeimplicitautograd_dispatch.h>
339
+ #include <ATen/ops/nanmean_compositeimplicitautograd_dispatch.h>
340
+ #include <ATen/ops/nanmedian_compositeimplicitautograd_dispatch.h>
341
+ #include <ATen/ops/nanquantile_compositeimplicitautograd_dispatch.h>
342
+ #include <ATen/ops/narrow_compositeimplicitautograd_dispatch.h>
343
+ #include <ATen/ops/native_channel_shuffle_compositeimplicitautograd_dispatch.h>
344
+ #include <ATen/ops/negative_compositeimplicitautograd_dispatch.h>
345
+ #include <ATen/ops/nested_to_padded_tensor_compositeimplicitautograd_dispatch.h>
346
+ #include <ATen/ops/nll_loss_compositeimplicitautograd_dispatch.h>
347
+ #include <ATen/ops/nll_loss2d_compositeimplicitautograd_dispatch.h>
348
+ #include <ATen/ops/nll_loss_nd_compositeimplicitautograd_dispatch.h>
349
+ #include <ATen/ops/nonzero_numpy_compositeimplicitautograd_dispatch.h>
350
+ #include <ATen/ops/norm_compositeimplicitautograd_dispatch.h>
351
+ #include <ATen/ops/norm_except_dim_compositeimplicitautograd_dispatch.h>
352
+ #include <ATen/ops/not_equal_compositeimplicitautograd_dispatch.h>
353
+ #include <ATen/ops/nuclear_norm_compositeimplicitautograd_dispatch.h>
354
+ #include <ATen/ops/numpy_T_compositeimplicitautograd_dispatch.h>
355
+ #include <ATen/ops/one_hot_compositeimplicitautograd_dispatch.h>
356
+ #include <ATen/ops/or_compositeimplicitautograd_dispatch.h>
357
+ #include <ATen/ops/orgqr_compositeimplicitautograd_dispatch.h>
358
+ #include <ATen/ops/outer_compositeimplicitautograd_dispatch.h>
359
+ #include <ATen/ops/output_nr_compositeimplicitautograd_dispatch.h>
360
+ #include <ATen/ops/pad_compositeimplicitautograd_dispatch.h>
361
+ #include <ATen/ops/pad_sequence_compositeimplicitautograd_dispatch.h>
362
+ #include <ATen/ops/pairwise_distance_compositeimplicitautograd_dispatch.h>
363
+ #include <ATen/ops/pdist_compositeimplicitautograd_dispatch.h>
364
+ #include <ATen/ops/pin_memory_compositeimplicitautograd_dispatch.h>
365
+ #include <ATen/ops/pinverse_compositeimplicitautograd_dispatch.h>
366
+ #include <ATen/ops/poisson_nll_loss_compositeimplicitautograd_dispatch.h>
367
+ #include <ATen/ops/positive_compositeimplicitautograd_dispatch.h>
368
+ #include <ATen/ops/prelu_compositeimplicitautograd_dispatch.h>
369
+ #include <ATen/ops/prod_compositeimplicitautograd_dispatch.h>
370
+ #include <ATen/ops/promote_types_compositeimplicitautograd_dispatch.h>
371
+ #include <ATen/ops/qr_compositeimplicitautograd_dispatch.h>
372
+ #include <ATen/ops/quantile_compositeimplicitautograd_dispatch.h>
373
+ #include <ATen/ops/quantized_gru_cell_compositeimplicitautograd_dispatch.h>
374
+ #include <ATen/ops/quantized_lstm_cell_compositeimplicitautograd_dispatch.h>
375
+ #include <ATen/ops/quantized_rnn_relu_cell_compositeimplicitautograd_dispatch.h>
376
+ #include <ATen/ops/quantized_rnn_tanh_cell_compositeimplicitautograd_dispatch.h>
377
+ #include <ATen/ops/rand_compositeimplicitautograd_dispatch.h>
378
+ #include <ATen/ops/randn_compositeimplicitautograd_dispatch.h>
379
+ #include <ATen/ops/ravel_compositeimplicitautograd_dispatch.h>
380
+ #include <ATen/ops/real_compositeimplicitautograd_dispatch.h>
381
+ #include <ATen/ops/refine_names_compositeimplicitautograd_dispatch.h>
382
+ #include <ATen/ops/relu6_compositeimplicitautograd_dispatch.h>
383
+ #include <ATen/ops/rename_compositeimplicitautograd_dispatch.h>
384
+ #include <ATen/ops/repeat_interleave_compositeimplicitautograd_dispatch.h>
385
+ #include <ATen/ops/requires_grad_compositeimplicitautograd_dispatch.h>
386
+ #include <ATen/ops/reshape_compositeimplicitautograd_dispatch.h>
387
+ #include <ATen/ops/reshape_as_compositeimplicitautograd_dispatch.h>
388
+ #include <ATen/ops/resolve_conj_compositeimplicitautograd_dispatch.h>
389
+ #include <ATen/ops/resolve_neg_compositeimplicitautograd_dispatch.h>
390
+ #include <ATen/ops/result_type_compositeimplicitautograd_dispatch.h>
391
+ #include <ATen/ops/retain_grad_compositeimplicitautograd_dispatch.h>
392
+ #include <ATen/ops/retains_grad_compositeimplicitautograd_dispatch.h>
393
+ #include <ATen/ops/rms_norm_compositeimplicitautograd_dispatch.h>
394
+ #include <ATen/ops/rnn_relu_compositeimplicitautograd_dispatch.h>
395
+ #include <ATen/ops/rnn_relu_cell_compositeimplicitautograd_dispatch.h>
396
+ #include <ATen/ops/rnn_tanh_compositeimplicitautograd_dispatch.h>
397
+ #include <ATen/ops/rnn_tanh_cell_compositeimplicitautograd_dispatch.h>
398
+ #include <ATen/ops/row_stack_compositeimplicitautograd_dispatch.h>
399
+ #include <ATen/ops/rrelu_compositeimplicitautograd_dispatch.h>
400
+ #include <ATen/ops/scaled_dot_product_attention_compositeimplicitautograd_dispatch.h>
401
+ #include <ATen/ops/scatter_compositeimplicitautograd_dispatch.h>
402
+ #include <ATen/ops/scatter_add_compositeimplicitautograd_dispatch.h>
403
+ #include <ATen/ops/select_compositeimplicitautograd_dispatch.h>
404
+ #include <ATen/ops/selu_compositeimplicitautograd_dispatch.h>
405
+ #include <ATen/ops/set_compositeimplicitautograd_dispatch.h>
406
+ #include <ATen/ops/set_data_compositeimplicitautograd_dispatch.h>
407
+ #include <ATen/ops/silu_backward_compositeimplicitautograd_dispatch.h>
408
+ #include <ATen/ops/size_compositeimplicitautograd_dispatch.h>
409
+ #include <ATen/ops/slogdet_compositeimplicitautograd_dispatch.h>
410
+ #include <ATen/ops/slow_conv3d_compositeimplicitautograd_dispatch.h>
411
+ #include <ATen/ops/smm_compositeimplicitautograd_dispatch.h>
412
+ #include <ATen/ops/softmax_compositeimplicitautograd_dispatch.h>
413
+ #include <ATen/ops/sort_compositeimplicitautograd_dispatch.h>
414
+ #include <ATen/ops/sparse_bsc_tensor_compositeimplicitautograd_dispatch.h>
415
+ #include <ATen/ops/sparse_bsr_tensor_compositeimplicitautograd_dispatch.h>
416
+ #include <ATen/ops/sparse_coo_tensor_compositeimplicitautograd_dispatch.h>
417
+ #include <ATen/ops/sparse_csc_tensor_compositeimplicitautograd_dispatch.h>
418
+ #include <ATen/ops/sparse_csr_tensor_compositeimplicitautograd_dispatch.h>
419
+ #include <ATen/ops/special_digamma_compositeimplicitautograd_dispatch.h>
420
+ #include <ATen/ops/special_erf_compositeimplicitautograd_dispatch.h>
421
+ #include <ATen/ops/special_erfc_compositeimplicitautograd_dispatch.h>
422
+ #include <ATen/ops/special_erfinv_compositeimplicitautograd_dispatch.h>
423
+ #include <ATen/ops/special_exp2_compositeimplicitautograd_dispatch.h>
424
+ #include <ATen/ops/special_expit_compositeimplicitautograd_dispatch.h>
425
+ #include <ATen/ops/special_expm1_compositeimplicitautograd_dispatch.h>
426
+ #include <ATen/ops/special_gammainc_compositeimplicitautograd_dispatch.h>
427
+ #include <ATen/ops/special_gammaincc_compositeimplicitautograd_dispatch.h>
428
+ #include <ATen/ops/special_gammaln_compositeimplicitautograd_dispatch.h>
429
+ #include <ATen/ops/special_i0_compositeimplicitautograd_dispatch.h>
430
+ #include <ATen/ops/special_log1p_compositeimplicitautograd_dispatch.h>
431
+ #include <ATen/ops/special_log_softmax_compositeimplicitautograd_dispatch.h>
432
+ #include <ATen/ops/special_logit_compositeimplicitautograd_dispatch.h>
433
+ #include <ATen/ops/special_logsumexp_compositeimplicitautograd_dispatch.h>
434
+ #include <ATen/ops/special_multigammaln_compositeimplicitautograd_dispatch.h>
435
+ #include <ATen/ops/special_ndtr_compositeimplicitautograd_dispatch.h>
436
+ #include <ATen/ops/special_polygamma_compositeimplicitautograd_dispatch.h>
437
+ #include <ATen/ops/special_psi_compositeimplicitautograd_dispatch.h>
438
+ #include <ATen/ops/special_round_compositeimplicitautograd_dispatch.h>
439
+ #include <ATen/ops/special_sinc_compositeimplicitautograd_dispatch.h>
440
+ #include <ATen/ops/special_softmax_compositeimplicitautograd_dispatch.h>
441
+ #include <ATen/ops/special_xlogy_compositeimplicitautograd_dispatch.h>
442
+ #include <ATen/ops/split_compositeimplicitautograd_dispatch.h>
443
+ #include <ATen/ops/square_compositeimplicitautograd_dispatch.h>
444
+ #include <ATen/ops/squeeze_compositeimplicitautograd_dispatch.h>
445
+ #include <ATen/ops/sspaddmm_compositeimplicitautograd_dispatch.h>
446
+ #include <ATen/ops/std_compositeimplicitautograd_dispatch.h>
447
+ #include <ATen/ops/std_mean_compositeimplicitautograd_dispatch.h>
448
+ #include <ATen/ops/stft_compositeimplicitautograd_dispatch.h>
449
+ #include <ATen/ops/stride_compositeimplicitautograd_dispatch.h>
450
+ #include <ATen/ops/subtract_compositeimplicitautograd_dispatch.h>
451
+ #include <ATen/ops/sum_compositeimplicitautograd_dispatch.h>
452
+ #include <ATen/ops/sum_to_size_compositeimplicitautograd_dispatch.h>
453
+ #include <ATen/ops/svd_compositeimplicitautograd_dispatch.h>
454
+ #include <ATen/ops/swapaxes_compositeimplicitautograd_dispatch.h>
455
+ #include <ATen/ops/swapdims_compositeimplicitautograd_dispatch.h>
456
+ #include <ATen/ops/sym_is_contiguous_compositeimplicitautograd_dispatch.h>
457
+ #include <ATen/ops/sym_numel_compositeimplicitautograd_dispatch.h>
458
+ #include <ATen/ops/sym_size_compositeimplicitautograd_dispatch.h>
459
+ #include <ATen/ops/sym_storage_offset_compositeimplicitautograd_dispatch.h>
460
+ #include <ATen/ops/sym_stride_compositeimplicitautograd_dispatch.h>
461
+ #include <ATen/ops/take_along_dim_compositeimplicitautograd_dispatch.h>
462
+ #include <ATen/ops/tensor_split_compositeimplicitautograd_dispatch.h>
463
+ #include <ATen/ops/tensordot_compositeimplicitautograd_dispatch.h>
464
+ #include <ATen/ops/thnn_conv2d_compositeimplicitautograd_dispatch.h>
465
+ #include <ATen/ops/tile_compositeimplicitautograd_dispatch.h>
466
+ #include <ATen/ops/to_compositeimplicitautograd_dispatch.h>
467
+ #include <ATen/ops/to_dense_compositeimplicitautograd_dispatch.h>
468
+ #include <ATen/ops/to_dense_backward_compositeimplicitautograd_dispatch.h>
469
+ #include <ATen/ops/to_mkldnn_backward_compositeimplicitautograd_dispatch.h>
470
+ #include <ATen/ops/to_sparse_compositeimplicitautograd_dispatch.h>
471
+ #include <ATen/ops/to_sparse_bsc_compositeimplicitautograd_dispatch.h>
472
+ #include <ATen/ops/to_sparse_bsr_compositeimplicitautograd_dispatch.h>
473
+ #include <ATen/ops/to_sparse_csc_compositeimplicitautograd_dispatch.h>
474
+ #include <ATen/ops/to_sparse_csr_compositeimplicitautograd_dispatch.h>
475
+ #include <ATen/ops/trace_backward_compositeimplicitautograd_dispatch.h>
476
+ #include <ATen/ops/transpose_compositeimplicitautograd_dispatch.h>
477
+ #include <ATen/ops/trapezoid_compositeimplicitautograd_dispatch.h>
478
+ #include <ATen/ops/trapz_compositeimplicitautograd_dispatch.h>
479
+ #include <ATen/ops/triplet_margin_loss_compositeimplicitautograd_dispatch.h>
480
+ #include <ATen/ops/true_divide_compositeimplicitautograd_dispatch.h>
481
+ #include <ATen/ops/type_as_compositeimplicitautograd_dispatch.h>
482
+ #include <ATen/ops/unbind_compositeimplicitautograd_dispatch.h>
483
+ #include <ATen/ops/unflatten_compositeimplicitautograd_dispatch.h>
484
+ #include <ATen/ops/unflatten_dense_tensors_compositeimplicitautograd_dispatch.h>
485
+ #include <ATen/ops/unsafe_chunk_compositeimplicitautograd_dispatch.h>
486
+ #include <ATen/ops/upsample_bicubic2d_compositeimplicitautograd_dispatch.h>
487
+ #include <ATen/ops/upsample_bilinear2d_compositeimplicitautograd_dispatch.h>
488
+ #include <ATen/ops/upsample_linear1d_compositeimplicitautograd_dispatch.h>
489
+ #include <ATen/ops/upsample_nearest1d_compositeimplicitautograd_dispatch.h>
490
+ #include <ATen/ops/upsample_nearest2d_compositeimplicitautograd_dispatch.h>
491
+ #include <ATen/ops/upsample_nearest3d_compositeimplicitautograd_dispatch.h>
492
+ #include <ATen/ops/upsample_trilinear3d_compositeimplicitautograd_dispatch.h>
493
+ #include <ATen/ops/value_selecting_reduction_backward_compositeimplicitautograd_dispatch.h>
494
+ #include <ATen/ops/vander_compositeimplicitautograd_dispatch.h>
495
+ #include <ATen/ops/var_compositeimplicitautograd_dispatch.h>
496
+ #include <ATen/ops/var_mean_compositeimplicitautograd_dispatch.h>
497
+ #include <ATen/ops/view_as_compositeimplicitautograd_dispatch.h>
498
+ #include <ATen/ops/vsplit_compositeimplicitautograd_dispatch.h>
499
+ #include <ATen/ops/vstack_compositeimplicitautograd_dispatch.h>
500
+ #include <ATen/ops/where_compositeimplicitautograd_dispatch.h>
501
+ #include <ATen/ops/xor_compositeimplicitautograd_dispatch.h>
502
+
503
+
504
+
505
+
506
+ #else
507
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
508
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CompositeImplicitAutogradNestedTensorFunctions.h ADDED
@@ -0,0 +1,34 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #include <ATen/core/TensorBody.h>
3
+
4
+ // TODO Undo all logic introduced for Note [Avoiding Include Cycles In Static Dispatch]
5
+ // Code introduced to avoid cyclic dependency in static dispatch is no longer
6
+ // needed as static dispatch logic is moved from TensorBody.h, which caused cycles in the first place,
7
+ // to Operators.cpp for supporting multiple backends with multiple kernels.
8
+ //
9
+ // Note [Avoiding Include Cycles In Static Dispatch]
10
+ // In order to avoid #include cycles in the static dispatch build, we've carefully split out
11
+ // the static function definition files into {DispatchKey}Functions.h and {DispatchKey}Functions_inl.h.
12
+ //
13
+ // Without this split, the include cycle looks like TensorBody.h -> CPUFunctions.h -> TensorBody.h.
14
+ // - TensorBody.h #includes CPUFunctions.h in the static dispatch build, because the tensor methods
15
+ // all need to call into the fastpath C++ API defined in CPUFunctions.h. The methods are also all
16
+ // directly inlined into TensorBody.h.
17
+ // - CPUFunctions.h #includes TensorBody.h because it contains function declarations for the entire C++ API,
18
+ // which include functions that have defaultable std::optional<Tensor> arguments.
19
+ // That requires knowing the full Tensor class definition.
20
+ //
21
+ // We break the cycle by doing the following:
22
+ // - Split out CPUFunction.h into two files: CPUFunctions.h and CPUFunctions_inl.h
23
+ // - CPUFunction.h is a dummy file that just includes the Tensor class and includes CPUFunctions_inl.,
24
+ // - CPUFunctions_inl.h includes everything else
25
+ // - (only in the static dispatch build) TensorBody.h makes sure to finish defining the Tensor class,
26
+ // and then it includes CPUFunctions_inl.h.
27
+ // - All other files that want the cpu fastpath functions can include CPUFunctions.h directly.
28
+ // - This also means that static dispatch build, CPUFunctions.h only needs to
29
+ // #include TensorBody.h, and it will automatically bring in CPUFunctions_inl.h.
30
+ #include <ATen/CompositeImplicitAutogradNestedTensorFunctions_inl.h>
31
+
32
+ #else
33
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
34
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/CompositeImplicitAutogradNestedTensorFunctions_inl.h ADDED
@@ -0,0 +1,30 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+ // @generated by torchgen/gen.py from DispatchKeyFunctions_inl.h
4
+
5
+ // NB: The implementing C++ file is RegisterDispatchKey.cpp
6
+
7
+ // The only #includes we need are for custom classes that have defaults in the C++ API
8
+ #include <c10/core/MemoryFormat.h>
9
+ #include <c10/core/Scalar.h>
10
+ #include <ATen/core/Reduction.h>
11
+
12
+ #if defined(AT_PER_OPERATOR_HEADERS) && defined(TORCH_ASSERT_ONLY_METHOD_OPERATORS)
13
+ #error This change adds a dependency on all pytorch operators, meaning the \
14
+ file will need to be re-compiled every time an operator is changed or added. \
15
+ Consider including a specific operator from \
16
+ <ATen/ops/{my_operator}_compositeimplicitautogradnestedtensor_dispatch.h>. \
17
+ See NOTE [TORCH_ASSERT_ONLY_METHOD_OPERATORS].
18
+ #endif
19
+
20
+ #include <ATen/ops/randn_like_compositeimplicitautogradnestedtensor_dispatch.h>
21
+ #include <ATen/ops/reshape_compositeimplicitautogradnestedtensor_dispatch.h>
22
+ #include <ATen/ops/reshape_as_compositeimplicitautogradnestedtensor_dispatch.h>
23
+ #include <ATen/ops/zeros_like_compositeimplicitautogradnestedtensor_dispatch.h>
24
+
25
+
26
+
27
+
28
+ #else
29
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
30
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/Config.h ADDED
@@ -0,0 +1,28 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+
4
+ // Test these using #if AT_MKL_ENABLED(), not #ifdef, so that it's
5
+ // obvious if you forgot to include Config.h
6
+ // c.f. https://stackoverflow.com/questions/33759787/generating-an-error-if-checked-boolean-macro-is-not-defined
7
+ //
8
+ // DO NOT put the macros for CUDA libraries in this file; they belong in cuda/CUDAConfig.h
9
+
10
+ #define AT_MKLDNN_ENABLED() 1
11
+ #define AT_MKLDNN_ACL_ENABLED() 0
12
+ #define AT_MKL_ENABLED() 1
13
+ #define AT_MKL_SEQUENTIAL() 0
14
+ #define AT_POCKETFFT_ENABLED() 0
15
+ #define AT_NNPACK_ENABLED() 1
16
+ #define CAFFE2_STATIC_LINK_CUDA() 0
17
+ #define AT_BUILD_WITH_BLAS() 1
18
+ #define AT_BUILD_WITH_LAPACK() 1
19
+ #define AT_PARALLEL_OPENMP 1
20
+ #define AT_PARALLEL_NATIVE 0
21
+ #define AT_BLAS_F2C() 0
22
+ #define AT_BLAS_USE_CBLAS_DOT() 0
23
+ #define AT_KLEIDIAI_ENABLED() 0
24
+ #define AT_USE_EIGEN_SPARSE() 0
25
+
26
+ #else
27
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
28
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/Context.h ADDED
@@ -0,0 +1,712 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+
4
+ #include <ATen/BlasBackend.h>
5
+ #include <ATen/CPUGeneratorImpl.h>
6
+ #include <ATen/DeviceAccelerator.h>
7
+ #include <ATen/LinalgBackend.h>
8
+ #include <ATen/ROCmFABackend.h>
9
+ #include <ATen/SDPBackend.h>
10
+ #include <ATen/core/ATenGeneral.h>
11
+ #include <ATen/core/DeprecatedTypeProperties.h>
12
+ #include <ATen/core/Generator.h>
13
+ #include <ATen/core/LegacyTypeDispatch.h>
14
+ #include <ATen/detail/AcceleratorHooksInterface.h>
15
+ #include <ATen/detail/CUDAHooksInterface.h>
16
+ #include <ATen/detail/HIPHooksInterface.h>
17
+ #include <ATen/detail/HPUHooksInterface.h>
18
+ #include <ATen/detail/IPUHooksInterface.h>
19
+ #include <ATen/detail/MAIAHooksInterface.h>
20
+ #include <ATen/detail/MPSHooksInterface.h>
21
+ #include <ATen/detail/MTIAHooksInterface.h>
22
+ #include <ATen/detail/PrivateUse1HooksInterface.h>
23
+ #include <ATen/detail/XLAHooksInterface.h>
24
+ #include <ATen/detail/XPUHooksInterface.h>
25
+ #include <c10/core/QEngine.h>
26
+ #include <c10/core/impl/DeviceGuardImplInterface.h>
27
+ #include <c10/util/CallOnce.h>
28
+ #include <c10/util/Exception.h>
29
+ #include <c10/util/env.h>
30
+ #include <c10/util/hash.h>
31
+ #include <c10/util/irange.h>
32
+
33
+ #include <cstdint>
34
+ #include <map>
35
+ #include <mutex>
36
+ #include <unordered_map>
37
+
38
+ namespace at {
39
+
40
+ class Tensor;
41
+
42
+ enum class TORCH_API Float32MatmulPrecision { HIGHEST, HIGH, MEDIUM };
43
+
44
+ enum class CuBLASReductionOption : uint8_t {
45
+ AllowReducedPrecisionWithSplitK = 0,
46
+ DisallowReducedPrecisionAllowSplitK = 1,
47
+ DisallowReducedPrecisionDisallowSplitK = 2,
48
+ };
49
+ enum class TORCH_API Float32Backend { GENERIC, CUDA, MKLDNN };
50
+ enum class TORCH_API Float32Op { ALL, CONV, RNN, MATMUL };
51
+ enum class TORCH_API Float32Precision { NONE, IEEE, TF32, BF16 };
52
+
53
+ TORCH_API Float32Backend str2backend(const std::string& name);
54
+ TORCH_API Float32Op str2op(const std::string& name);
55
+ TORCH_API Float32Precision str2precision(const std::string& name);
56
+ TORCH_API std::string precision2str(Float32Precision prec);
57
+
58
+ class TORCH_API Context {
59
+ public:
60
+ Context();
61
+
62
+ const Generator& defaultGenerator(Device device) {
63
+ c10::DeviceType device_type = device.type();
64
+ lazyInitDevice(device_type);
65
+
66
+ if (device_type == at::kCPU) {
67
+ return at::detail::getDefaultCPUGenerator();
68
+ } else {
69
+ return getAcceleratorHooksInterface(device_type)
70
+ .getDefaultGenerator(device.index());
71
+ }
72
+ }
73
+
74
+ const AcceleratorHooksInterface& getAcceleratorHooksInterface(
75
+ std::optional<c10::DeviceType> opt_device_type = std::nullopt) {
76
+ if (!opt_device_type.has_value()) {
77
+ opt_device_type = at::getAccelerator(true);
78
+ }
79
+ if (opt_device_type == at::kCUDA) {
80
+ return at::detail::getCUDAHooks();
81
+ } else if (opt_device_type == at::kXPU) {
82
+ return at::detail::getXPUHooks();
83
+ } else if (opt_device_type == at::kMPS) {
84
+ return at::detail::getMPSHooks();
85
+ } else if (opt_device_type == at::kPrivateUse1) {
86
+ return at::detail::getPrivateUse1Hooks();
87
+ } else if (opt_device_type == at::kMTIA) {
88
+ return at::detail::getMTIAHooks();
89
+ } else if (opt_device_type == at::kHIP) {
90
+ return at::detail::getHIPHooks();
91
+ } else if (opt_device_type == at::kHPU) {
92
+ return at::detail::getHPUHooks();
93
+ } else if (opt_device_type == at::kXLA) {
94
+ return at::detail::getXLAHooks();
95
+ } else {
96
+ TORCH_CHECK(
97
+ false,
98
+ opt_device_type.has_value()
99
+ ? c10::DeviceTypeName(opt_device_type.value())
100
+ : "None",
101
+ " device type not an accelerator.");
102
+ }
103
+ }
104
+
105
+ Device getDeviceFromPtr(void* data, c10::DeviceType device_type) {
106
+ lazyInitDevice(device_type);
107
+
108
+ if (device_type == at::kCPU) {
109
+ return c10::DeviceType::CPU;
110
+ } else {
111
+ return getAcceleratorHooksInterface(device_type).getDeviceFromPtr(data);
112
+ }
113
+ }
114
+
115
+ bool isPinnedPtr(
116
+ const void* data,
117
+ std::optional<c10::DeviceType> device_type = std::nullopt) {
118
+ auto opt_device_type =
119
+ device_type.has_value() ? device_type : at::getAccelerator();
120
+ if (!opt_device_type.has_value() || // there is no accelerator
121
+ !at::isAccelerator(
122
+ opt_device_type.value())) { // passed device not an accelerator
123
+ return false;
124
+ }
125
+ if (!init_[static_cast<int8_t>(opt_device_type.value())].test_once()) {
126
+ // If the device is not initialized, no pointer can be pinned for it
127
+ return false;
128
+ }
129
+ return getAcceleratorHooksInterface(opt_device_type).isPinnedPtr(data);
130
+ }
131
+
132
+ Allocator* getPinnedMemoryAllocator(
133
+ std::optional<c10::DeviceType> device_type = std::nullopt) {
134
+ auto opt_device_type =
135
+ device_type.has_value() ? device_type : at::getAccelerator();
136
+ if (opt_device_type) {
137
+ lazyInitDevice(opt_device_type.value());
138
+ }
139
+ return getAcceleratorHooksInterface(device_type).getPinnedMemoryAllocator();
140
+ }
141
+
142
+ void lazyInitDevice(c10::DeviceType device_type) {
143
+ if (device_type != at::kCPU) {
144
+ c10::call_once(init_[static_cast<int8_t>(device_type)], [&] {
145
+ getAcceleratorHooksInterface(device_type).init();
146
+ });
147
+ }
148
+ }
149
+
150
+ static bool hasOpenMP();
151
+ static bool hasMKL();
152
+ static bool hasKleidiAI();
153
+ static bool hasLAPACK();
154
+ static bool hasMKLDNN();
155
+ static bool ckSupported();
156
+ static bool hasEigenSparse();
157
+ static bool hasMAGMA() {
158
+ return detail::getCUDAHooks().hasMAGMA();
159
+ }
160
+ static bool hasCUDA() {
161
+ return detail::getCUDAHooks().hasCUDA();
162
+ }
163
+ static bool hasMTIA() {
164
+ return detail::getMTIAHooks().hasMTIA();
165
+ }
166
+ static bool hasCUDART() {
167
+ return detail::getCUDAHooks().hasCUDART();
168
+ }
169
+ static long versionCUDART() {
170
+ return detail::getCUDAHooks().versionCUDART();
171
+ }
172
+ static bool hasCuDNN() {
173
+ return detail::getCUDAHooks().hasCuDNN();
174
+ }
175
+ static long versionCuDNN() {
176
+ return detail::getCUDAHooks().versionCuDNN();
177
+ }
178
+ static long versionRuntimeCuDNN() {
179
+ return detail::getCUDAHooks().versionRuntimeCuDNN();
180
+ }
181
+ static long versionCuDNNFrontend() {
182
+ return detail::getCUDAHooks().versionCuDNNFrontend();
183
+ }
184
+ static bool hasCuSOLVER() {
185
+ return detail::getCUDAHooks().hasCuSOLVER();
186
+ }
187
+ static bool hasCuBLASLt() {
188
+ return detail::getCUDAHooks().hasCuBLASLt();
189
+ }
190
+ static bool hasROCM() {
191
+ return detail::getCUDAHooks().hasROCM();
192
+ }
193
+ static bool hasCKSDPA() {
194
+ return detail::getCUDAHooks().hasCKSDPA();
195
+ }
196
+ static bool hasCKGEMM() {
197
+ return detail::getCUDAHooks().hasCKGEMM();
198
+ }
199
+ static bool hasHIP() {
200
+ return detail::getHIPHooks().hasHIP();
201
+ }
202
+ static bool hasMPS() {
203
+ return detail::getMPSHooks().hasMPS();
204
+ }
205
+ static bool hasIPU() {
206
+ return c10::impl::hasDeviceGuardImpl(c10::DeviceType::IPU);
207
+ }
208
+ static bool hasXLA() {
209
+ return detail::getXLAHooks().hasXLA();
210
+ }
211
+ static bool hasXPU() {
212
+ return detail::getXPUHooks().hasXPU();
213
+ }
214
+ static bool hasLazy() {
215
+ return c10::impl::hasDeviceGuardImpl(c10::DeviceType::Lazy);
216
+ }
217
+ static bool hasMAIA() {
218
+ return c10::impl::hasDeviceGuardImpl(c10::DeviceType::MAIA);
219
+ }
220
+ static bool hasHPU() {
221
+ return detail::getHPUHooks().hasHPU();
222
+ }
223
+
224
+ static const at::cuda::NVRTC& getNVRTC() {
225
+ return detail::getCUDAHooks().nvrtc();
226
+ }
227
+
228
+ static bool setFlushDenormal(bool on);
229
+
230
+ // NB: This method is *purely* whether or not a user requested
231
+ // that CuDNN was enabled, it doesn't actually say anything about
232
+ // whether or not CuDNN is actually usable. Use cudnn_is_acceptable
233
+ // to test this instead
234
+ bool userEnabledCuDNN() const;
235
+ void setUserEnabledCuDNN(bool e);
236
+ bool userEnabledMkldnn() const;
237
+ void setUserEnabledMkldnn(bool e);
238
+ bool benchmarkCuDNN() const;
239
+ void setBenchmarkCuDNN(bool /*b*/);
240
+ int benchmarkLimitCuDNN() const;
241
+ void setBenchmarkLimitCuDNN(int /*b*/);
242
+ bool immediateMiopen() const;
243
+ void setImmediateMiopen(bool /*b*/);
244
+ bool deterministicCuDNN() const;
245
+ void setDeterministicCuDNN(bool /*b*/);
246
+ bool deterministicMkldnn() const;
247
+ void setDeterministicMkldnn(bool /*b*/);
248
+ bool userEnabledNNPACK() const;
249
+ void setUserEnabledNNPACK(bool e);
250
+
251
+ // Note [Disabling Fused SDP Kernels]
252
+ // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253
+ // Flash and Memory Efficient SDP kernels are enabled by default.
254
+ // However, they can be disabled by setting
255
+ // at::globalContext().setUserEnabledFlashSDP(false) flag.
256
+ // This is useful for debugging purposes. For example, if you want to
257
+ // compare the performance of the flash SDP kernels with the unfused
258
+ // kernel, you can disable the flash SDP kernels. By disabling
259
+ // the math SDP kernel, you can force your code to use flash kernels.
260
+ // The math SDP kernel can be disabled by setting
261
+ // at::globalContext().setUserEnabledMathSDP(false) flag.
262
+ void setSDPPriorityOrder(const std::vector<int64_t>& order);
263
+ std::array<at::SDPBackend, at::num_sdp_backends> sDPPriorityOrder();
264
+
265
+ void setSDPUseFlash(bool /*e*/);
266
+ bool userEnabledFlashSDP() const;
267
+
268
+ void setSDPUseMemEfficient(bool /*e*/);
269
+ bool userEnabledMemEfficientSDP() const;
270
+
271
+ void setSDPUseMath(bool /*e*/);
272
+ bool userEnabledMathSDP() const;
273
+
274
+ void setSDPUseCuDNN(bool /*e*/);
275
+ bool userEnabledCuDNNSDP() const;
276
+
277
+ void setAllowFP16BF16ReductionMathSDP(bool /*e*/);
278
+ bool allowFP16BF16ReductionMathSDP() const;
279
+
280
+ void setSDPUseOverrideable(bool /*e*/);
281
+ bool userEnabledOverrideableSDP() const;
282
+
283
+ at::LinalgBackend linalgPreferredBackend() const;
284
+ void setLinalgPreferredBackend(at::LinalgBackend /*b*/);
285
+
286
+ at::BlasBackend blasPreferredBackend();
287
+ void setBlasPreferredBackend(at::BlasBackend /*b*/);
288
+
289
+ at::ROCmFABackend getROCmFAPreferredBackend();
290
+ void setROCmFAPreferredBackend(at::ROCmFABackend /*b*/);
291
+
292
+ // Note [Enabling Deterministic Operations]
293
+ // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
294
+ // Operations in PyTorch that normally act nondeterministically, but have an
295
+ // alternate deterministic implementation, should satisfy the following
296
+ // requirements:
297
+ //
298
+ // * Include this comment: "See Note [Enabling Deterministic Operations]"
299
+ //
300
+ // * Check the value of `at::globalContext().deterministicAlgorithms()` to
301
+ // toggle
302
+ // between nondeterministic and deterministic implementations.
303
+ //
304
+ // * Have an entry in the list of PyTorch operations that toggle between
305
+ // nondeterministic
306
+ // and deterministic implementations, in the docstring of
307
+ // `use_deterministic_algorithms()` in torch/__init__.py
308
+ //
309
+ // `example_func()` below shows an example of toggling between
310
+ // nondeterministic and deterministic implementations:
311
+ //
312
+ // void example_func() {
313
+ // // See Note [Enabling Deterministic Operations]
314
+ // if (at::globalContext().deterministicAlgorithms()) {
315
+ // example_func_deterministic();
316
+ // } else {
317
+ // example_func_nondeterministic();
318
+ // }
319
+ // }
320
+
321
+ bool deterministicAlgorithms() const;
322
+ bool deterministicAlgorithmsWarnOnly() const;
323
+ void setDeterministicAlgorithms(bool /*b*/, bool /*warn_only*/);
324
+ bool deterministicFillUninitializedMemory() const;
325
+ void setDeterministicFillUninitializedMemory(bool /*b*/);
326
+
327
+ // Note [Writing Nondeterministic Operations]
328
+ // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
329
+ // Operations in PyTorch that act nondeterministically and do not have an
330
+ // alternate deterministic implementation should satisfy the following
331
+ // requirements:
332
+ //
333
+ // * Include this comment: "See Note [Writing Nondeterministic Operations]"
334
+ //
335
+ // * Include a comment explaining why the operation is nondeterministic.
336
+ //
337
+ // * Throw an error when `Context::deterministicAlgorithms()` is true. Most
338
+ // of the time, this should be accomplished by calling
339
+ // `at::globalContext().alertNotDeterminstic().
340
+ //
341
+ // * Have an entry in the list of nondeterministic PyTorch operations in the
342
+ // docstring of `use_deterministic_algorithms()` in torch/__init__.py
343
+ //
344
+ // * Have a test function in `test/test_torch.py` whose name begins with
345
+ // `test_nondeterministic_alert_`. Alternatively, if CuBLAS workspace
346
+ // configuration is the reason for nondeterminism, the operation should be
347
+ // included in the `test_cublas_config_nondeterministic_alert` test. Any new
348
+ // tests should ideally follow a pattern similar to the existing ones.
349
+ //
350
+ // `example_func()` below shows an example of the comments and error-throwing
351
+ // code for a nondeterministic operation:
352
+ //
353
+ // void example_func() {
354
+ // // See Note [Writing Nondeterministic Operations]
355
+ // // Nondeterministic because <reason>
356
+ // at::globalContext().alertNondeterministic("example_func");
357
+ // ...
358
+ // }
359
+
360
+ // Throws an error if `Context::deterministicAlgorithms()` is true
361
+ static void alertNotDeterministic(std::string_view const& caller);
362
+
363
+ void setFloat32MatmulPrecision(const std::string& s);
364
+ void setFloat32Precision(
365
+ Float32Backend backend,
366
+ Float32Op op,
367
+ Float32Precision p);
368
+ bool allowTF32CuDNN(std::optional<Float32Op> op = std::nullopt) const;
369
+ void setAllowTF32CuDNN(bool /*b*/);
370
+ bool allowTF32OneDNN() const;
371
+ void setAllowTF32OneDNN(bool /*b*/);
372
+ bool allowTF32CuBLAS() const;
373
+ void setAllowTF32CuBLAS(bool /*b*/);
374
+ Float32MatmulPrecision float32MatmulPrecision() const;
375
+ Float32Precision float32Precision(Float32Backend backend, Float32Op op) const;
376
+ CuBLASReductionOption allowFP16ReductionCuBLAS() const;
377
+ void setAllowFP16ReductionCuBLAS(
378
+ bool allow_reduced_precision,
379
+ bool allow_splitk = true);
380
+ CuBLASReductionOption allowBF16ReductionCuBLAS() const;
381
+ void setAllowBF16ReductionCuBLAS(
382
+ bool allow_reduced_precision,
383
+ bool allow_splitk = true);
384
+ bool allowFP16AccumulationCuBLAS() const;
385
+ void setAllowFP16AccumulationCuBLAS(bool /*b*/);
386
+ bool rocmAllowGroupGemmCk() const;
387
+
388
+ // Matmuls can use a so-called "persistent" kernel which launches one CUDA
389
+ // block for each SM on the GPU, and each block then iterates over multiple
390
+ // output tiles. This allows to use software pipelining to hide the begin/end
391
+ // latencies (e.g., epilogue), especially when only one tile fits per SM.
392
+ // However, if some SMs are busy (e.g., with a background NCCL kernel), the
393
+ // matmul's blocks will be scheduled in two waves and, in the absence of some
394
+ // smart load balancing, the kernel will take twice as long. This flag allows
395
+ // to make matmuls target only a subset of the SMs, so they can fully schedule
396
+ // even next to a comms kernel, and only be a few percent slower.
397
+ std::optional<int32_t> _SMCarveout_EXPERIMENTAL() const;
398
+ void _setSMCarveout_EXPERIMENTAL(std::optional<int32_t> /*c*/);
399
+
400
+ at::QEngine qEngine() const;
401
+ void setQEngine(at::QEngine e);
402
+ static const std::vector<at::QEngine>& supportedQEngines();
403
+ static bool isXNNPACKAvailable();
404
+ void setCheckSparseTensorInvariants(bool e);
405
+ bool checkSparseTensorInvariants() const;
406
+ // This method is used to release the original weight after pre-packing.
407
+ // It should be called once before loading/running the model.
408
+ // NB: By default it is set to true for mobile builds.
409
+ void setReleaseWeightsWhenPrepacking(bool e);
410
+ bool releaseWeightsWhenPrepacking() const;
411
+
412
+ void setDisplayVmapFallbackWarnings(bool enabled);
413
+ bool areVmapFallbackWarningsEnabled() const;
414
+
415
+ void setWarnOnAccumulateGradStreamMismatch(bool enabled);
416
+ bool warnOnAccumulateGradStreamMismatch() const;
417
+
418
+ bool isDefaultMobileCPUAllocatorSet();
419
+ void setDefaultMobileCPUAllocator();
420
+ void unsetDefaultMobileCPUAllocator();
421
+ bool allowFP16ReductionCPU() const;
422
+ void setAllowFP16ReductionCPU(bool /*b*/);
423
+
424
+ // Preserved for BC
425
+ void lazyInitCUDA() {
426
+ TORCH_WARN_DEPRECATION(
427
+ "lazyInitCUDA is deprecated. Please use lazyInitDevice(at::kCUDA) instead.")
428
+ lazyInitDevice(at::kCUDA);
429
+ }
430
+ void lazyInitHIP() {
431
+ TORCH_WARN_DEPRECATION(
432
+ "lazyInitHIP is deprecated. Please use lazyInitDevice(at::kHIP) instead.")
433
+ lazyInitDevice(at::kHIP);
434
+ }
435
+ void lazyInitXPU() {
436
+ TORCH_WARN_DEPRECATION(
437
+ "lazyInitXPU is deprecated. Please use lazyInitDevice(at::kXPU) instead.")
438
+ lazyInitDevice(at::kXPU);
439
+ }
440
+ void lazyInitMTIA() {
441
+ TORCH_WARN_DEPRECATION(
442
+ "lazyInitMTIA is deprecated. Please use lazyInitDevice(at::kMTIA) instead.")
443
+ lazyInitDevice(at::kMTIA);
444
+ }
445
+ void lazyInitPrivateUse1() {
446
+ TORCH_WARN_DEPRECATION(
447
+ "lazyInitPrivateUse1 is deprecated. Please use lazyInitDevice(at::kPrivateUse1) instead.")
448
+ lazyInitDevice(at::kPrivateUse1);
449
+ }
450
+
451
+ private:
452
+ std::array<c10::once_flag, at::COMPILE_TIME_MAX_DEVICE_TYPES> init_;
453
+ bool enabled_cudnn = true;
454
+ bool deterministic_cudnn = false;
455
+ bool deterministic_mkldnn = false;
456
+ bool _deterministic_algorithms = false;
457
+ bool _deterministic_algorithms_warn_only = false;
458
+ bool _deterministic_fill_uninitialized_memory = true;
459
+ std::array<at::SDPBackend, at::num_sdp_backends> sdp_priority_order = {
460
+ at::SDPBackend::flash_attention,
461
+ at::SDPBackend::efficient_attention,
462
+ at::SDPBackend::math,
463
+ at::SDPBackend::cudnn_attention,
464
+ at::SDPBackend::overrideable};
465
+ bool enabled_flashSDP = true;
466
+ bool enabled_mem_efficientSDP = true;
467
+ bool enabled_mathSDP = true;
468
+ bool enabled_cudnnSDP = true;
469
+ bool enabled_overrideable = true;
470
+ bool allow_fp16_bf16_reduction_mathSDP = false;
471
+ bool benchmark_cudnn = false;
472
+ bool immediate_miopen = false;
473
+ Float32MatmulPrecision float32_matmul_precision =
474
+ c10::utils::check_env("TORCH_ALLOW_TF32_CUBLAS_OVERRIDE") == true
475
+ ? at::Float32MatmulPrecision::HIGH
476
+ : at::Float32MatmulPrecision::HIGHEST;
477
+ int benchmark_limit_cudnn = 10;
478
+ bool allow_tf32_cudnn = true;
479
+ CuBLASReductionOption allow_fp16_reduction_cublas =
480
+ CuBLASReductionOption::AllowReducedPrecisionWithSplitK;
481
+ CuBLASReductionOption allow_bf16_reduction_cublas =
482
+ CuBLASReductionOption::AllowReducedPrecisionWithSplitK;
483
+ bool allow_fp16_accumulation_cublas = false;
484
+ std::optional<int32_t> sm_carveout = std::nullopt;
485
+ bool enabled_mkldnn = true;
486
+ bool allow_tf32_onednn = false;
487
+ bool enabled_nnpack = true;
488
+ at::LinalgBackend linalg_preferred_backend =
489
+ (c10::utils::check_env("TORCH_LINALG_PREFER_CUSOLVER") == true ||
490
+ c10::utils::check_env("TORCH_LINALG_PREFER_HIPSOLVER") == true) // alias
491
+ ? at::LinalgBackend::Cusolver
492
+ : at::LinalgBackend::Default;
493
+ at::BlasBackend blas_preferred_backend =
494
+ (c10::utils::check_env("TORCH_BLAS_PREFER_CUBLASLT") == true ||
495
+ c10::utils::check_env("TORCH_BLAS_PREFER_HIPBLASLT") == true) // alias
496
+ ? at::BlasBackend::Cublaslt
497
+ : at::BlasBackend::Default;
498
+ at::ROCmFABackend rocm_fa_preferred_backend =
499
+ c10::utils::check_env("TORCH_ROCM_FA_PREFER_CK") == true
500
+ ? at::ROCmFABackend::Ck
501
+ : at::ROCmFABackend::Default;
502
+ #ifdef C10_MOBILE
503
+ bool release_original_weights = true;
504
+ #else
505
+ bool release_original_weights = false;
506
+ #endif
507
+ bool display_vmap_fallback_warnings_ = false;
508
+ bool warn_on_accumulate_grad_stream_mismatch_ = true;
509
+ std::atomic<at::QEngine> quantized_engine = at::QEngine::NoQEngine;
510
+ bool enable_sparse_tensor_invariant_checks = false;
511
+ bool allow_fp16_reduction_cpu = false;
512
+
513
+ using Key = std::pair<Float32Backend, Float32Op>;
514
+ std::unordered_map<Key, Float32Precision, c10::hash<Key>> fp32_precision = {
515
+ {{Float32Backend::GENERIC, Float32Op::ALL}, Float32Precision::NONE},
516
+ {{Float32Backend::MKLDNN, Float32Op::ALL}, Float32Precision::NONE},
517
+ {{Float32Backend::MKLDNN, Float32Op::CONV}, Float32Precision::NONE},
518
+ {{Float32Backend::MKLDNN, Float32Op::RNN}, Float32Precision::NONE},
519
+ {{Float32Backend::MKLDNN, Float32Op::MATMUL}, Float32Precision::NONE},
520
+ {{Float32Backend::CUDA, Float32Op::ALL}, Float32Precision::NONE},
521
+ {{Float32Backend::CUDA, Float32Op::CONV}, Float32Precision::TF32},
522
+ {{Float32Backend::CUDA, Float32Op::RNN}, Float32Precision::TF32},
523
+ {{Float32Backend::CUDA, Float32Op::MATMUL},
524
+ float32_matmul_precision == at::Float32MatmulPrecision::HIGHEST
525
+ ? Float32Precision::NONE
526
+ : Float32Precision::TF32},
527
+ };
528
+
529
+ Allocator* prev_allocator_ptr_{nullptr};
530
+ };
531
+
532
+ TORCH_API Context& globalContext();
533
+
534
+ inline void init() {
535
+ globalContext();
536
+ }
537
+
538
+ TORCH_API Allocator* getCPUAllocator();
539
+
540
+ inline DeprecatedTypeProperties& getDeprecatedTypeProperties(
541
+ Backend p,
542
+ ScalarType s) {
543
+ return globalDeprecatedTypePropertiesRegistry().getDeprecatedTypeProperties(
544
+ p, s);
545
+ }
546
+
547
+ inline DeprecatedTypeProperties& CPU(ScalarType s) {
548
+ return globalDeprecatedTypePropertiesRegistry().getDeprecatedTypeProperties(
549
+ Backend::CPU, s);
550
+ }
551
+
552
+ inline DeprecatedTypeProperties& CUDA(ScalarType s) {
553
+ return globalDeprecatedTypePropertiesRegistry().getDeprecatedTypeProperties(
554
+ Backend::CUDA, s);
555
+ }
556
+
557
+ inline DeprecatedTypeProperties& HIP(ScalarType s) {
558
+ return globalDeprecatedTypePropertiesRegistry().getDeprecatedTypeProperties(
559
+ Backend::HIP, s);
560
+ }
561
+
562
+ inline DeprecatedTypeProperties& MPS(ScalarType s) {
563
+ return globalDeprecatedTypePropertiesRegistry().getDeprecatedTypeProperties(
564
+ Backend::MPS, s);
565
+ }
566
+
567
+ inline bool hasCUDA() {
568
+ return globalContext().hasCUDA();
569
+ }
570
+
571
+ inline bool hasMTIA() {
572
+ return globalContext().hasMTIA();
573
+ }
574
+
575
+ inline bool hasHIP() {
576
+ return globalContext().hasHIP();
577
+ }
578
+
579
+ inline bool hasIPU() {
580
+ return globalContext().hasIPU();
581
+ }
582
+
583
+ inline bool hasXLA() {
584
+ return globalContext().hasXLA();
585
+ }
586
+
587
+ inline bool hasMPS() {
588
+ return globalContext().hasMPS();
589
+ }
590
+
591
+ inline bool hasMAIA() {
592
+ return globalContext().hasMAIA();
593
+ }
594
+
595
+ inline bool hasXPU() {
596
+ return globalContext().hasXPU();
597
+ }
598
+
599
+ inline bool hasHPU() {
600
+ return globalContext().hasHPU();
601
+ }
602
+
603
+ // Despite its name, this function returns the number of *CUDA* GPUs.
604
+ inline size_t getNumGPUs() {
605
+ // WARNING: DO NOT ADD LOGIC TO HANDLE OTHER DEVICE TYPES TO THIS
606
+ // FUNCTION. If you are interested in interrogating the number of
607
+ // devices for a specific device type, add that function to the
608
+ // relevant library (e.g., similar to at::cuda::device_count())
609
+ if (hasCUDA() && hasHIP()) {
610
+ TORCH_CHECK(
611
+ false,
612
+ "Enabling both CUDA and HIP in ATen is not supported, as HIP masquerades "
613
+ "to be CUDA (e.g., when you say CUDA, on a HIP build of ATen, this actually "
614
+ "means HIP. Rebuild PyTorch with one or the other disabled.");
615
+ } else if (hasCUDA()) {
616
+ return detail::getCUDAHooks().deviceCount();
617
+ } else if (hasHIP()) {
618
+ return detail::getHIPHooks().getNumGPUs();
619
+ } else {
620
+ return 0;
621
+ }
622
+ }
623
+
624
+ inline bool hasOpenMP() {
625
+ return globalContext().hasOpenMP();
626
+ }
627
+
628
+ inline bool hasMKL() {
629
+ return globalContext().hasMKL();
630
+ }
631
+
632
+ inline bool hasKleidiAI() {
633
+ return globalContext().hasKleidiAI();
634
+ }
635
+
636
+ inline bool hasLAPACK() {
637
+ return globalContext().hasLAPACK();
638
+ }
639
+
640
+ inline bool hasEigenSparse() {
641
+ return globalContext().hasEigenSparse();
642
+ }
643
+
644
+ inline bool hasMAGMA() {
645
+ return globalContext().hasMAGMA();
646
+ }
647
+
648
+ inline bool hasMKLDNN() {
649
+ return globalContext().hasMKLDNN();
650
+ }
651
+
652
+ inline void manual_seed(uint64_t seed) {
653
+ {
654
+ auto gen = globalContext().defaultGenerator(c10::DeviceType::CPU);
655
+ // See Note [Acquire lock when using random generators]
656
+ std::lock_guard<std::mutex> lock(gen.mutex());
657
+ gen.set_current_seed(seed);
658
+ }
659
+
660
+ const auto opt_device_type = at::getAccelerator();
661
+ if (!opt_device_type.has_value()) {
662
+ return;
663
+ }
664
+ const auto num_gpus = globalContext()
665
+ .getAcceleratorHooksInterface(opt_device_type)
666
+ .deviceCount();
667
+ for (const auto i : c10::irange(num_gpus)) {
668
+ auto gen = globalContext().defaultGenerator(
669
+ Device(opt_device_type.value(), static_cast<c10::DeviceIndex>(i)));
670
+ {
671
+ // See Note [Acquire lock when using random generators]
672
+ std::lock_guard<std::mutex> lock(gen.mutex());
673
+ gen.set_current_seed(seed);
674
+ }
675
+ }
676
+ }
677
+
678
+ // When the global flag `allow_tf32` is set to true, cuBLAS handles are
679
+ // automatically configured to use math mode CUBLAS_TF32_TENSOR_OP_MATH.
680
+ // For some operators, such as addmv, TF32 offers no performance improvement
681
+ // but causes precision loss. To help this case, this class implements
682
+ // a RAII guard that can be used to quickly disable TF32 within its scope.
683
+ //
684
+ // Usage:
685
+ // NoTF32Guard disable_tf32;
686
+ struct TORCH_API NoTF32Guard {
687
+ NoTF32Guard();
688
+ NoTF32Guard(NoTF32Guard&& other) = delete;
689
+ NoTF32Guard(const NoTF32Guard&) = delete;
690
+ NoTF32Guard& operator=(const NoTF32Guard&) = delete;
691
+ NoTF32Guard& operator=(NoTF32Guard&&) = delete;
692
+ ~NoTF32Guard();
693
+ static bool should_disable_tf32();
694
+
695
+ private:
696
+ bool changed = false;
697
+ };
698
+
699
+ struct TORCH_API ROCmBackwardPassGuard {
700
+ ROCmBackwardPassGuard();
701
+ ROCmBackwardPassGuard(ROCmBackwardPassGuard&& other) = delete;
702
+ ROCmBackwardPassGuard(const ROCmBackwardPassGuard&) = delete;
703
+ ROCmBackwardPassGuard& operator=(const ROCmBackwardPassGuard&) = delete;
704
+ ROCmBackwardPassGuard& operator=(ROCmBackwardPassGuard&&) = delete;
705
+ ~ROCmBackwardPassGuard();
706
+ static bool is_backward_pass();
707
+ };
708
+ } // namespace at
709
+
710
+ #else
711
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
712
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/DLConvertor.h ADDED
@@ -0,0 +1,81 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+
4
+ #include <ATen/ATen.h>
5
+ #include <ATen/Tensor.h>
6
+ #include <ATen/dlpack.h>
7
+
8
+ // this converter will:
9
+ // 1) take a Tensor object and wrap it in the DLPack tensor
10
+ // 2) take a dlpack tensor and convert it to the ATen Tensor
11
+
12
+ namespace at {
13
+
14
+ TORCH_API ScalarType toScalarType(const DLDataType& dtype);
15
+ TORCH_API DLManagedTensor* toDLPack(const Tensor& src);
16
+ TORCH_API struct DLManagedTensorVersioned* toDLPackVersioned(const Tensor& src);
17
+ TORCH_API void toDLPackNonOwning(const Tensor& src, DLTensor* out);
18
+ TORCH_API Tensor
19
+ fromDLPack(DLManagedTensor* src, std::function<void(void*)> deleter = {});
20
+ TORCH_API Tensor fromDLPackVersioned(
21
+ DLManagedTensorVersioned* src,
22
+ std::function<void(void*)> deleter = {});
23
+ TORCH_API DLDataType getDLDataType(const Tensor& t);
24
+ TORCH_API DLDevice getDLContext(const Tensor& tensor, const int64_t& device_id);
25
+
26
+ // Copies the Tensor if there's a device mismatch or copy is forced.
27
+ // This should be used before actually creating the DLPack capsule.
28
+ TORCH_API Tensor maybeCopyTensor(
29
+ const Tensor& data,
30
+ std::optional<DLDevice> optional_dl_device,
31
+ std::optional<bool> copy);
32
+
33
+ // Converts the given at::Device into a DLDevice.
34
+ TORCH_API DLDevice torchDeviceToDLDevice(at::Device device);
35
+
36
+ // Converts the DLDevice to an ATen device.
37
+ TORCH_API Device dlDeviceToTorchDevice(
38
+ DLDeviceType type,
39
+ c10::DeviceIndex index,
40
+ void* data = nullptr);
41
+
42
+ // This trait class is used for retrieving different attributes, such as the
43
+ // PyCapsule names and conversion functions for both DLPack tensor classes:
44
+ // `DLManagedTensor` and `DLManagedTensorVersioned`.
45
+ //
46
+ // Each specialization should contain the following 2 traits:
47
+ // - `capsule`: actual name of the capsule
48
+ // - `used`: name of the capsule after using it
49
+ // - `toDLPack`: function for converting a tensor into a DLPack capsule
50
+ // - `fromDLPack`: function for creating a tensor from a DLPack capsule
51
+ //
52
+ // While `toDLPack` is the directly exposed to Python, `fromDLPack` is not.
53
+ // Although it contains the core implementation, it lacks the required book
54
+ // keeping logic contained in its caller `tensor_fromDLPack`.
55
+ //
56
+ // That said, `fromDLPack` is used directly in a few DLPack tests that live
57
+ // inside ATen (no Python available).
58
+ template <class T>
59
+ struct DLPackTraits {};
60
+
61
+ template <>
62
+ struct DLPackTraits<DLManagedTensor> {
63
+ inline static constexpr const char* capsule = "dltensor";
64
+ inline static constexpr const char* used = "used_dltensor";
65
+ inline static auto toDLPack = at::toDLPack;
66
+ inline static auto fromDLPack = at::fromDLPack;
67
+ };
68
+
69
+ template <>
70
+ struct DLPackTraits<DLManagedTensorVersioned> {
71
+ inline static constexpr const char* capsule = "dltensor_versioned";
72
+ inline static constexpr const char* used = "used_dltensor_versioned";
73
+ inline static auto toDLPack = at::toDLPackVersioned;
74
+ inline static auto fromDLPack = at::fromDLPackVersioned;
75
+ };
76
+
77
+ } // namespace at
78
+
79
+ #else
80
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
81
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/DTensorState.h ADDED
@@ -0,0 +1,39 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+
4
+ #include <c10/macros/Macros.h>
5
+
6
+ namespace at {
7
+
8
+ TORCH_API bool get_dtensor_allow_implicit_replication();
9
+ TORCH_API void set_dtensor_allow_implicit_replication(bool enabled);
10
+
11
+ struct DTensorAllowImplicitReplication {
12
+ DTensorAllowImplicitReplication()
13
+ : prev_dtensor_allow_implicit_replication_(
14
+ get_dtensor_allow_implicit_replication()) {
15
+ set_dtensor_allow_implicit_replication(true);
16
+ }
17
+
18
+ DTensorAllowImplicitReplication(const DTensorAllowImplicitReplication&) =
19
+ delete;
20
+ DTensorAllowImplicitReplication& operator=(
21
+ const DTensorAllowImplicitReplication&) = delete;
22
+ DTensorAllowImplicitReplication(DTensorAllowImplicitReplication&&) = delete;
23
+ DTensorAllowImplicitReplication& operator=(
24
+ DTensorAllowImplicitReplication&&) = delete;
25
+
26
+ ~DTensorAllowImplicitReplication() {
27
+ set_dtensor_allow_implicit_replication(
28
+ prev_dtensor_allow_implicit_replication_);
29
+ }
30
+
31
+ private:
32
+ bool prev_dtensor_allow_implicit_replication_;
33
+ };
34
+
35
+ } // namespace at
36
+
37
+ #else
38
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
39
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/Device.h ADDED
@@ -0,0 +1,7 @@
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+ #include <c10/core/Device.h>
4
+
5
+ #else
6
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
7
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/DeviceAccelerator.h ADDED
@@ -0,0 +1,118 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+
4
+ #include <c10/core/CachingDeviceAllocator.h>
5
+ #include <c10/core/DeviceCapability.h>
6
+ #include <c10/core/DeviceType.h>
7
+ #include <c10/macros/Macros.h>
8
+
9
+ #include <ATen/detail/MTIAHooksInterface.h>
10
+ #include <optional>
11
+
12
+ namespace at::accelerator {
13
+
14
+ // Note [Accelerator Concept]
15
+ // This file defines the top level Accelerator concept for PyTorch.
16
+ // A device is an accelerator per the definition here if:
17
+ // - It is mutually exclusive with all other accelerators
18
+ // - It performs asynchronous compute via a Stream/Event system
19
+ // - It provides a set of common APIs as defined by AcceleratorHooksInterface
20
+ //
21
+ // As of today, accelerator devices are (in no particular order):
22
+ // CUDA, MTIA, XPU, HIP, MPS, PrivateUse1
23
+
24
+ // Ensures that only one accelerator is available (at
25
+ // compile time if possible) and return it.
26
+ // When checked is true, the returned optional always has a value.
27
+ TORCH_API std::optional<c10::DeviceType> getAccelerator(bool checked = false);
28
+
29
+ // Check if the given device type is an accelerator.
30
+ TORCH_API bool isAccelerator(c10::DeviceType device_type);
31
+
32
+ // Check if the given device type is an accelerator, not the excluded ones.
33
+ template <
34
+ typename... T,
35
+ typename = std::enable_if_t<(std::is_same_v<T, c10::DeviceType> && ...)>>
36
+ inline bool isAcceleratorExcluded(
37
+ c10::DeviceType device_type,
38
+ c10::DeviceType first_excluded,
39
+ T... rest_excluded) {
40
+ if constexpr (sizeof...(rest_excluded) > 0) {
41
+ return device_type != first_excluded &&
42
+ isAcceleratorExcluded(device_type, rest_excluded...);
43
+ } else {
44
+ return device_type != first_excluded && isAccelerator(device_type);
45
+ }
46
+ }
47
+
48
+ // Return the number of the device available. Note that this is *REQUIRED* to
49
+ // not raise any exception.
50
+ TORCH_API c10::DeviceIndex deviceCount();
51
+
52
+ // Set the current device index to the given device index.
53
+ TORCH_API void setDeviceIndex(c10::DeviceIndex device_index);
54
+
55
+ // Get the current device index.
56
+ TORCH_API c10::DeviceIndex getDeviceIndex();
57
+
58
+ // Set the current stream to a given stream. Note that this API doesn't change
59
+ // the current device index.
60
+ TORCH_API void setCurrentStream(c10::Stream stream);
61
+
62
+ // Get the current stream of the given device index.
63
+ TORCH_API c10::Stream getCurrentStream(c10::DeviceIndex device_index);
64
+
65
+ // Wait (by blocking the calling thread) until all the work previously enqueued
66
+ // on the given device index has been completed.
67
+ TORCH_API void synchronizeDevice(c10::DeviceIndex device_index);
68
+
69
+ // Set the current device index to the given device_index and return the
70
+ // original device index that was active before the change.
71
+ TORCH_API c10::DeviceIndex exchangeDevice(c10::DeviceIndex device_index);
72
+
73
+ // Set the current device index to the given device_index. Avoid creating a new
74
+ // context if the context for device_index is not initialized. Return the
75
+ // original device index that was active before the change.
76
+ TORCH_API c10::DeviceIndex maybeExchangeDevice(c10::DeviceIndex device_index);
77
+
78
+ // Get the device capability of the given device index.
79
+ TORCH_API c10::DeviceCapability getDeviceCapability(
80
+ c10::DeviceIndex device_index);
81
+
82
+ TORCH_API inline void emptyCache() {
83
+ const auto device_type = getAccelerator(true).value();
84
+ at::getDeviceAllocator(device_type)->emptyCache();
85
+ }
86
+
87
+ TORCH_API inline at::CachingDeviceAllocator::DeviceStats getDeviceStats(
88
+ c10::DeviceIndex device_index) {
89
+ const auto device_type = getAccelerator(true).value();
90
+ return at::getDeviceAllocator(device_type)->getDeviceStats(device_index);
91
+ }
92
+
93
+ TORCH_API inline void resetAccumulatedStats(c10::DeviceIndex device_index) {
94
+ const auto device_type = getAccelerator(true).value();
95
+ at::getDeviceAllocator(device_type)->resetAccumulatedStats(device_index);
96
+ }
97
+
98
+ TORCH_API inline void resetPeakStats(c10::DeviceIndex device_index) {
99
+ const auto device_type = getAccelerator(true).value();
100
+ at::getDeviceAllocator(device_type)->resetPeakStats(device_index);
101
+ }
102
+
103
+ TORCH_API inline std::pair<size_t, size_t> getMemoryInfo(
104
+ c10::DeviceIndex device_index) {
105
+ const auto device_type = getAccelerator(true).value();
106
+ return at::getDeviceAllocator(device_type)->getMemoryInfo(device_index);
107
+ }
108
+ } // namespace at::accelerator
109
+
110
+ namespace at {
111
+ // Keep BC only
112
+ using at::accelerator::getAccelerator;
113
+ using at::accelerator::isAccelerator;
114
+ } // namespace at
115
+
116
+ #else
117
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
118
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/DeviceGuard.h ADDED
@@ -0,0 +1,46 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+
4
+ #include <ATen/core/IListRef.h>
5
+ #include <ATen/core/Tensor.h>
6
+ #include <c10/core/DeviceGuard.h>
7
+ #include <c10/core/ScalarType.h> // TensorList whyyyyy
8
+
9
+ namespace at {
10
+
11
+ // Are you here because you're wondering why DeviceGuard(tensor) no
12
+ // longer works? For code organization reasons, we have temporarily(?)
13
+ // removed this constructor from DeviceGuard. The new way to
14
+ // spell it is:
15
+ //
16
+ // OptionalDeviceGuard guard(device_of(tensor));
17
+
18
+ /// Return the Device of a Tensor, if the Tensor is defined.
19
+ inline std::optional<Device> device_of(const Tensor& t) {
20
+ if (t.defined()) {
21
+ return t.device();
22
+ } else {
23
+ return std::nullopt;
24
+ }
25
+ }
26
+
27
+ inline std::optional<Device> device_of(const std::optional<Tensor>& t) {
28
+ return t.has_value() ? device_of(t.value()) : std::nullopt;
29
+ }
30
+
31
+ /// Return the Device of a TensorList, if the list is non-empty and
32
+ /// the first Tensor is defined. (This function implicitly assumes
33
+ /// that all tensors in the list have the same device.)
34
+ inline std::optional<Device> device_of(ITensorListRef t) {
35
+ if (!t.empty()) {
36
+ return device_of(t.front());
37
+ } else {
38
+ return std::nullopt;
39
+ }
40
+ }
41
+
42
+ } // namespace at
43
+
44
+ #else
45
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
46
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/DimVector.h ADDED
@@ -0,0 +1,7 @@
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+ #include <ATen/core/DimVector.h>
4
+
5
+ #else
6
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
7
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/Dimname.h ADDED
@@ -0,0 +1,6 @@
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #include <ATen/core/Dimname.h>
3
+
4
+ #else
5
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
6
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/Dispatch.h ADDED
@@ -0,0 +1,790 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+
4
+ #include <c10/core/ScalarType.h>
5
+ #include <c10/macros/Macros.h>
6
+ #include <c10/util/Exception.h>
7
+ #include <c10/util/Half.h>
8
+ #include <c10/util/Metaprogramming.h>
9
+ #include <c10/util/complex.h>
10
+ #include <torch/headeronly/core/Dispatch.h>
11
+
12
+ #ifdef __CUDACC__
13
+ #include <cuda.h> // For CUDA_VERSION
14
+ #endif
15
+
16
+ #ifdef TEMPLATE_SELECTIVE_BUILD
17
+ #include <ATen/selected_mobile_ops.h>
18
+ #else
19
+ namespace at {
20
+ /**
21
+ * The method should_include_kernel_dtype() returns true/false
22
+ * based on whether the switching code for a specific dtype should be
23
+ * included based on build time constants generated from tracing model
24
+ * execution. This method will be implemented via code-generation and
25
+ * included in this file when code-gen is ready.
26
+ */
27
+ inline constexpr bool should_include_kernel_dtype(
28
+ const char* /*kernel_tag_str*/,
29
+ at::ScalarType /*scalar_type*/
30
+ ) {
31
+ return true;
32
+ }
33
+ } // namespace at
34
+ #endif
35
+
36
+ /**
37
+ * In the Facebook internal build (using BUCK), this macro is enabled by
38
+ * passing in -c pt.enable_record_kernel_dtype=1 when building the tracer
39
+ * binary.
40
+ */
41
+ #if defined ENABLE_RECORD_KERNEL_FUNCTION_DTYPE
42
+ namespace at::detail {
43
+ TORCH_API void record_kernel_function_dtype(std::string name);
44
+ } // namespace at::detail
45
+
46
+ #define RECORD_KERNEL_FUNCTION_DTYPE(NAME, enum_type) \
47
+ at::detail::record_kernel_function_dtype( \
48
+ std::string(NAME) + "$" + toString(enum_type));
49
+ #else
50
+ #define RECORD_KERNEL_FUNCTION_DTYPE(NAME, enum_type)
51
+ #endif
52
+
53
+ #define AT_PRIVATE_CHECK_SELECTIVE_BUILD(enum_type) \
54
+ do { \
55
+ if constexpr (!at::should_include_kernel_dtype( \
56
+ at_dispatch_name, enum_type)) { \
57
+ TORCH_CHECK( \
58
+ false, \
59
+ "dtype '", \
60
+ toString(enum_type), \
61
+ "' not selected for kernel tag ", \
62
+ at_dispatch_name); \
63
+ } \
64
+ } while (0)
65
+
66
+ #define AT_PRIVATE_CASE_TYPE_USING_HINT(enum_type, HINT, ...) \
67
+ THO_PRIVATE_CASE_TYPE_USING_HINT_TMPL( \
68
+ AT_PRIVATE_CHECK_SELECTIVE_BUILD, enum_type, HINT, __VA_ARGS__)
69
+
70
+ #define AT_DISPATCH_CASE(enum_type, ...) \
71
+ AT_PRIVATE_CASE_TYPE_USING_HINT(enum_type, scalar_t, __VA_ARGS__)
72
+
73
+ #define AT_DISPATCH_CASE_QINT(enum_type, scalar_type, ...) \
74
+ case enum_type: { \
75
+ AT_PRIVATE_CHECK_SELECTIVE_BUILD(enum_type); \
76
+ using scalar_t = scalar_type; \
77
+ using underlying_t [[maybe_unused]] = typename scalar_t::underlying; \
78
+ [[maybe_unused]] const auto& SCALAR_TYPE = enum_type; \
79
+ [[maybe_unused]] const auto& UNDERLYING_TYPE = toUnderlying(enum_type); \
80
+ return __VA_ARGS__(); \
81
+ }
82
+
83
+ #define AT_QINT_SUB_BYTE_PRIVATE_CASE_TYPE( \
84
+ enum_type, scalar_type, bitwidth, qmin, qmax, ...) \
85
+ case enum_type: { \
86
+ AT_PRIVATE_CHECK_SELECTIVE_BUILD(enum_type); \
87
+ using scalar_t = scalar_type; \
88
+ using underlying_t [[maybe_unused]] = typename scalar_t::underlying; \
89
+ [[maybe_unused]] const auto& SCALAR_TYPE = enum_type; \
90
+ [[maybe_unused]] const auto& UNDERLYING_TYPE = toUnderlying(enum_type); \
91
+ [[maybe_unused]] int bit_width = bitwidth; \
92
+ [[maybe_unused]] int64_t quant_min = qmin; \
93
+ [[maybe_unused]] int64_t quant_max = qmax; \
94
+ return __VA_ARGS__(); \
95
+ }
96
+
97
+ // The AT_DISPATCH_* family of macros provides the ability to
98
+ // conveniently generate specializations of a kernel over all of the
99
+ // dtypes we care about in PyTorch. We call it "dispatch" because
100
+ // we are "dispatching" to the correct, dtype-specific kernel.
101
+ //
102
+ // A standard usage looks like:
103
+ //
104
+ // AT_DISPATCH_ALL_TYPES(self.scalar_type(), "op_name", [&] {
105
+ // // Your code here, with 'scalar_t' now defined to
106
+ // // be the dtype in question
107
+ // });
108
+ //
109
+ // There are many variations of this macro, so it's important to
110
+ // understand exactly /which/ dtypes you want to get instantiated, as
111
+ // well as what the "default" set is.
112
+ //
113
+ // The default set of dtypes that are instantiated (e.g., by
114
+ // AT_DISPATCH_ALL_TYPES) are floating point types (float, double),
115
+ // and integral types (int32_t, int64_t, int16_t, int8_t, uint8_t),
116
+ // but NOT booleans (bool), half-precision floats (Half) or
117
+ // complex number (c10::complex<float>, c10::complex<double>).
118
+ // This "cut" is somewhat historical (the default types are the
119
+ // ones that TH historically supported), but it also reflects the
120
+ // fact that the non-default types are "poorly" behaved (booleans
121
+ // are NOT integers mod 2, half precision operations ~essentially
122
+ // don't exist on CPU, complex numbers are an experimental application).
123
+ //
124
+ // Here are the questions you should generally ask to decide which
125
+ // dispatch you want:
126
+ //
127
+ // 1. Is this an integral or floating point specific operation?
128
+ // (If so, you'll want one of the FLOATING or INTEGRAL macros.)
129
+ //
130
+ // 2. Should half be supported? (If you're on CPU, the answer is almost
131
+ // definitely no. If you do want support, use one of the AND_HALF
132
+ // macros)
133
+ //
134
+ // Much rarer situations:
135
+ //
136
+ // 3. Should bool be supported? (You often have to write your kernel
137
+ // differently if arithmetic operations are involved.) If so,
138
+ // Use AT_DISPATCH_ALL_TYPES_AND along with ScalarType::Bool
139
+ //
140
+ // 4. Should complex be supported? The answer is almost always no,
141
+ // unless you are working on "generic" code that should work on
142
+ // all dtypes.
143
+ //
144
+ // Parameters:
145
+ // -----------
146
+ //
147
+ // 1. The NAME argument is a "tag" that is used to trace and then
148
+ // conditionally compile fragments of the case statements such
149
+ // that the kernel functions are specialized only for the dtypes
150
+ // that are needed. The NAME parameter *must* be a build time
151
+ // const char* (can't be std::string, etc...)
152
+ //
153
+ // Please ensure that the NAME is unique for every implementation
154
+ // or you run the risk of over-including code for the kernel
155
+ // functions. There is no risk of missing out on any code, so
156
+ // it's mostly a risk of a Type-2 error, and not a Type-1 error.
157
+ //
158
+ // Switch-like syntax:
159
+ // -------------------
160
+ // There is also a switch-case like syntax which is useful if a kernel
161
+ // needs to be specialized for particular scalar types
162
+ //
163
+ // AT_DISPATCH_SWITCH(self.scalar_type(), "op_name",
164
+ // AT_DISPATCH_CASE_INTEGRAL_TYPES([&] {
165
+ // op_integral<scalar_t>(iter);
166
+ // })
167
+ // AT_DISPATCH_CASE_FLOATING_TYPES([&] {
168
+ // op_floating<scalar_t>(iter);
169
+ // })
170
+ // AT_DISPATCH_CASE(kBool, [&] {
171
+ // op_bool(iter);
172
+ // })
173
+ // );
174
+ //
175
+ // For each AT_DISPATCH_FOO macro, there is a corresponding
176
+ // AT_DISPATCH_CASE_FOO macro which can be used inside of an
177
+ // AT_DISPATCH_SWITCH block.
178
+
179
+ // NB: the the_type variable is not used, but we have kept it for
180
+ // backwards compatibility. It's probably not used by anyone though;
181
+ // but we're just being safe (and it doesn't hurt.) Note we must
182
+ // use it to shut up warnings about unused store.
183
+
184
+ #define AT_DISPATCH_SWITCH(TYPE, NAME, ...) \
185
+ THO_DISPATCH_SWITCH_TMPL( \
186
+ RECORD_KERNEL_FUNCTION_DTYPE, \
187
+ TORCH_CHECK_NOT_IMPLEMENTED, \
188
+ TYPE, \
189
+ NAME, \
190
+ __VA_ARGS__)
191
+
192
+ #define AT_DISPATCH_CASE_FLOATING_TYPES(...) \
193
+ AT_DISPATCH_CASE(at::ScalarType::Double, __VA_ARGS__) \
194
+ AT_DISPATCH_CASE(at::ScalarType::Float, __VA_ARGS__)
195
+
196
+ #define AT_DISPATCH_FLOATING_TYPES(TYPE, NAME, ...) \
197
+ AT_DISPATCH_SWITCH(TYPE, NAME, AT_DISPATCH_CASE_FLOATING_TYPES(__VA_ARGS__))
198
+
199
+ #define AT_DISPATCH_CASE_FLOATING_TYPES_AND_HALF(...) \
200
+ AT_DISPATCH_CASE(at::ScalarType::Double, __VA_ARGS__) \
201
+ AT_DISPATCH_CASE(at::ScalarType::Float, __VA_ARGS__) \
202
+ AT_DISPATCH_CASE(at::ScalarType::Half, __VA_ARGS__)
203
+
204
+ #define AT_DISPATCH_FLOATING_TYPES_AND_HALF(TYPE, NAME, ...) \
205
+ AT_DISPATCH_SWITCH( \
206
+ TYPE, NAME, AT_DISPATCH_CASE_FLOATING_TYPES_AND_HALF(__VA_ARGS__))
207
+
208
+ #define AT_DISPATCH_CASE_REDUCED_FLOATING_TYPES(...) \
209
+ AT_DISPATCH_CASE(at::ScalarType::Half, __VA_ARGS__) \
210
+ AT_DISPATCH_CASE(at::ScalarType::BFloat16, __VA_ARGS__)
211
+
212
+ #define AT_DISPATCH_REDUCED_FLOATING_TYPES(TYPE, NAME, ...) \
213
+ AT_DISPATCH_SWITCH( \
214
+ TYPE, NAME, AT_DISPATCH_CASE_REDUCED_FLOATING_TYPES(__VA_ARGS__))
215
+
216
+ #define AT_DISPATCH_CASE_FLOATING_TYPES_AND(SCALARTYPE, ...) \
217
+ AT_DISPATCH_CASE_FLOATING_TYPES(__VA_ARGS__) \
218
+ AT_DISPATCH_CASE(SCALARTYPE, __VA_ARGS__)
219
+
220
+ #define AT_DISPATCH_FLOATING_TYPES_AND(SCALARTYPE, TYPE, NAME, ...) \
221
+ AT_DISPATCH_SWITCH( \
222
+ TYPE, \
223
+ NAME, \
224
+ AT_DISPATCH_CASE_FLOATING_TYPES_AND(SCALARTYPE, __VA_ARGS__))
225
+
226
+ #define AT_DISPATCH_CASE_FLOATING_TYPES_AND2(SCALARTYPE1, SCALARTYPE2, ...) \
227
+ AT_DISPATCH_CASE_FLOATING_TYPES(__VA_ARGS__) \
228
+ AT_DISPATCH_CASE(SCALARTYPE1, __VA_ARGS__) \
229
+ AT_DISPATCH_CASE(SCALARTYPE2, __VA_ARGS__)
230
+
231
+ #define AT_DISPATCH_FLOATING_TYPES_AND2( \
232
+ SCALARTYPE1, SCALARTYPE2, TYPE, NAME, ...) \
233
+ AT_DISPATCH_SWITCH( \
234
+ TYPE, \
235
+ NAME, \
236
+ AT_DISPATCH_CASE_FLOATING_TYPES_AND2( \
237
+ SCALARTYPE1, SCALARTYPE2, __VA_ARGS__))
238
+
239
+ #define AT_DISPATCH_CASE_FLOATING_TYPES_AND3( \
240
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, ...) \
241
+ AT_DISPATCH_CASE_FLOATING_TYPES(__VA_ARGS__) \
242
+ AT_DISPATCH_CASE(SCALARTYPE1, __VA_ARGS__) \
243
+ AT_DISPATCH_CASE(SCALARTYPE2, __VA_ARGS__) \
244
+ AT_DISPATCH_CASE(SCALARTYPE3, __VA_ARGS__)
245
+
246
+ #define AT_DISPATCH_FLOATING_TYPES_AND3( \
247
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, TYPE, NAME, ...) \
248
+ AT_DISPATCH_SWITCH( \
249
+ TYPE, \
250
+ NAME, \
251
+ AT_DISPATCH_CASE_FLOATING_TYPES_AND3( \
252
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, __VA_ARGS__))
253
+
254
+ #define AT_DISPATCH_CASE_FLOATING_TYPES_AND4( \
255
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, SCALARTYPE4, ...) \
256
+ AT_DISPATCH_CASE_FLOATING_TYPES(__VA_ARGS__) \
257
+ AT_DISPATCH_CASE(SCALARTYPE1, __VA_ARGS__) \
258
+ AT_DISPATCH_CASE(SCALARTYPE2, __VA_ARGS__) \
259
+ AT_DISPATCH_CASE(SCALARTYPE3, __VA_ARGS__) \
260
+ AT_DISPATCH_CASE(SCALARTYPE4, __VA_ARGS__)
261
+
262
+ #define AT_DISPATCH_CASE_FLOATING_TYPES_AND5( \
263
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, SCALARTYPE4, SCALARTYPE5, ...) \
264
+ AT_DISPATCH_CASE_FLOATING_TYPES(__VA_ARGS__) \
265
+ AT_DISPATCH_CASE(SCALARTYPE1, __VA_ARGS__) \
266
+ AT_DISPATCH_CASE(SCALARTYPE2, __VA_ARGS__) \
267
+ AT_DISPATCH_CASE(SCALARTYPE3, __VA_ARGS__) \
268
+ AT_DISPATCH_CASE(SCALARTYPE4, __VA_ARGS__) \
269
+ AT_DISPATCH_CASE(SCALARTYPE5, __VA_ARGS__)
270
+
271
+ #define AT_DISPATCH_FLOATING_TYPES_AND4( \
272
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, SCALARTYPE4, TYPE, NAME, ...) \
273
+ AT_DISPATCH_SWITCH( \
274
+ TYPE, \
275
+ NAME, \
276
+ AT_DISPATCH_CASE_FLOATING_TYPES_AND4( \
277
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, SCALARTYPE4, __VA_ARGS__))
278
+
279
+ #define AT_DISPATCH_FLOATING_TYPES_AND5( \
280
+ SCALARTYPE1, \
281
+ SCALARTYPE2, \
282
+ SCALARTYPE3, \
283
+ SCALARTYPE4, \
284
+ SCALARTYPE5, \
285
+ TYPE, \
286
+ NAME, \
287
+ ...) \
288
+ AT_DISPATCH_SWITCH( \
289
+ TYPE, \
290
+ NAME, \
291
+ AT_DISPATCH_CASE_FLOATING_TYPES_AND5( \
292
+ SCALARTYPE1, \
293
+ SCALARTYPE2, \
294
+ SCALARTYPE3, \
295
+ SCALARTYPE4, \
296
+ SCALARTYPE5, \
297
+ __VA_ARGS__))
298
+
299
+ #define AT_DISPATCH_CASE_COMPLEX_TYPES(...) \
300
+ AT_DISPATCH_CASE(at::ScalarType::ComplexDouble, __VA_ARGS__) \
301
+ AT_DISPATCH_CASE(at::ScalarType::ComplexFloat, __VA_ARGS__)
302
+
303
+ #define AT_DISPATCH_COMPLEX_TYPES(TYPE, NAME, ...) \
304
+ AT_DISPATCH_SWITCH(TYPE, NAME, AT_DISPATCH_CASE_COMPLEX_TYPES(__VA_ARGS__))
305
+
306
+ #define AT_DISPATCH_CASE_COMPLEX_TYPES_AND(SCALARTYPE, ...) \
307
+ AT_DISPATCH_CASE_COMPLEX_TYPES(__VA_ARGS__) \
308
+ AT_DISPATCH_CASE(SCALARTYPE, __VA_ARGS__)
309
+
310
+ #define AT_DISPATCH_COMPLEX_TYPES_AND(SCALARTYPE, TYPE, NAME, ...) \
311
+ AT_DISPATCH_SWITCH( \
312
+ TYPE, NAME, AT_DISPATCH_CASE_COMPLEX_TYPES_AND(SCALARTYPE, __VA_ARGS__))
313
+
314
+ #define AT_DISPATCH_CASE_FLOATING_AND_COMPLEX_TYPES(...) \
315
+ AT_DISPATCH_CASE_FLOATING_TYPES(__VA_ARGS__) \
316
+ AT_DISPATCH_CASE_COMPLEX_TYPES(__VA_ARGS__)
317
+
318
+ #define AT_DISPATCH_FLOATING_AND_COMPLEX_TYPES(TYPE, NAME, ...) \
319
+ AT_DISPATCH_SWITCH( \
320
+ TYPE, NAME, AT_DISPATCH_CASE_FLOATING_AND_COMPLEX_TYPES(__VA_ARGS__))
321
+
322
+ #define AT_DISPATCH_CASE_FLOATING_AND_COMPLEX_TYPES_AND1(SCALARTYPE, ...) \
323
+ AT_DISPATCH_CASE_FLOATING_AND_COMPLEX_TYPES(__VA_ARGS__) \
324
+ AT_DISPATCH_CASE(SCALARTYPE, __VA_ARGS__)
325
+
326
+ #define AT_DISPATCH_FLOATING_AND_COMPLEX_TYPES_AND1( \
327
+ SCALARTYPE, TYPE, NAME, ...) \
328
+ AT_DISPATCH_SWITCH( \
329
+ TYPE, \
330
+ NAME, \
331
+ AT_DISPATCH_CASE_FLOATING_AND_COMPLEX_TYPES_AND1( \
332
+ SCALARTYPE, __VA_ARGS__))
333
+
334
+ #define AT_DISPATCH_CASE_FLOATING_AND_COMPLEX_TYPES_AND2( \
335
+ SCALARTYPE1, SCALARTYPE2, ...) \
336
+ AT_DISPATCH_CASE_FLOATING_AND_COMPLEX_TYPES(__VA_ARGS__) \
337
+ AT_DISPATCH_CASE(SCALARTYPE1, __VA_ARGS__) \
338
+ AT_DISPATCH_CASE(SCALARTYPE2, __VA_ARGS__)
339
+
340
+ #define AT_DISPATCH_FLOATING_AND_COMPLEX_TYPES_AND2( \
341
+ SCALARTYPE1, SCALARTYPE2, TYPE, NAME, ...) \
342
+ AT_DISPATCH_SWITCH( \
343
+ TYPE, \
344
+ NAME, \
345
+ AT_DISPATCH_CASE_FLOATING_AND_COMPLEX_TYPES_AND2( \
346
+ SCALARTYPE1, SCALARTYPE2, __VA_ARGS__))
347
+
348
+ #define AT_DISPATCH_CASE_FLOATING_AND_COMPLEX_TYPES_AND3( \
349
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, ...) \
350
+ AT_DISPATCH_CASE_FLOATING_AND_COMPLEX_TYPES(__VA_ARGS__) \
351
+ AT_DISPATCH_CASE(SCALARTYPE1, __VA_ARGS__) \
352
+ AT_DISPATCH_CASE(SCALARTYPE2, __VA_ARGS__) \
353
+ AT_DISPATCH_CASE(SCALARTYPE3, __VA_ARGS__)
354
+
355
+ #define AT_DISPATCH_FLOATING_AND_COMPLEX_TYPES_AND3( \
356
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, TYPE, NAME, ...) \
357
+ AT_DISPATCH_SWITCH( \
358
+ TYPE, \
359
+ NAME, \
360
+ AT_DISPATCH_CASE_FLOATING_AND_COMPLEX_TYPES_AND3( \
361
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, __VA_ARGS__))
362
+
363
+ #define AT_DISPATCH_CASE_FLOATING_AND_COMPLEX_TYPES_AND4( \
364
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, SCALARTYPE4, ...) \
365
+ AT_DISPATCH_CASE_FLOATING_AND_COMPLEX_TYPES(__VA_ARGS__) \
366
+ AT_DISPATCH_CASE(SCALARTYPE1, __VA_ARGS__) \
367
+ AT_DISPATCH_CASE(SCALARTYPE2, __VA_ARGS__) \
368
+ AT_DISPATCH_CASE(SCALARTYPE3, __VA_ARGS__) \
369
+ AT_DISPATCH_CASE(SCALARTYPE4, __VA_ARGS__)
370
+
371
+ #define AT_DISPATCH_FLOATING_AND_COMPLEX_TYPES_AND4( \
372
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, SCALARTYPE4, TYPE, NAME, ...) \
373
+ AT_DISPATCH_SWITCH( \
374
+ TYPE, \
375
+ NAME, \
376
+ AT_DISPATCH_CASE_FLOATING_AND_COMPLEX_TYPES_AND4( \
377
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, SCALARTYPE4, __VA_ARGS__))
378
+
379
+ #define AT_DISPATCH_CASE_FLOATING_AND_COMPLEX_TYPES_AND5( \
380
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, SCALARTYPE4, SCALARTYPE5, ...) \
381
+ AT_DISPATCH_CASE_FLOATING_AND_COMPLEX_TYPES(__VA_ARGS__) \
382
+ AT_DISPATCH_CASE(SCALARTYPE1, __VA_ARGS__) \
383
+ AT_DISPATCH_CASE(SCALARTYPE2, __VA_ARGS__) \
384
+ AT_DISPATCH_CASE(SCALARTYPE3, __VA_ARGS__) \
385
+ AT_DISPATCH_CASE(SCALARTYPE4, __VA_ARGS__) \
386
+ AT_DISPATCH_CASE(SCALARTYPE5, __VA_ARGS__)
387
+
388
+ #define AT_DISPATCH_FLOATING_AND_COMPLEX_TYPES_AND5( \
389
+ SCALARTYPE1, \
390
+ SCALARTYPE2, \
391
+ SCALARTYPE3, \
392
+ SCALARTYPE4, \
393
+ SCALARTYPE5, \
394
+ TYPE, \
395
+ NAME, \
396
+ ...) \
397
+ AT_DISPATCH_SWITCH( \
398
+ TYPE, \
399
+ NAME, \
400
+ AT_DISPATCH_CASE_FLOATING_AND_COMPLEX_TYPES_AND5( \
401
+ SCALARTYPE1, \
402
+ SCALARTYPE2, \
403
+ SCALARTYPE3, \
404
+ SCALARTYPE4, \
405
+ SCALARTYPE5, \
406
+ __VA_ARGS__))
407
+
408
+ #define AT_DISPATCH_CASE_FLOATING_AND_COMPLEX_TYPES_AND6( \
409
+ SCALARTYPE1, \
410
+ SCALARTYPE2, \
411
+ SCALARTYPE3, \
412
+ SCALARTYPE4, \
413
+ SCALARTYPE5, \
414
+ SCALARTYPE6, \
415
+ ...) \
416
+ AT_DISPATCH_CASE_FLOATING_AND_COMPLEX_TYPES(__VA_ARGS__) \
417
+ AT_DISPATCH_CASE(SCALARTYPE1, __VA_ARGS__) \
418
+ AT_DISPATCH_CASE(SCALARTYPE2, __VA_ARGS__) \
419
+ AT_DISPATCH_CASE(SCALARTYPE3, __VA_ARGS__) \
420
+ AT_DISPATCH_CASE(SCALARTYPE4, __VA_ARGS__) \
421
+ AT_DISPATCH_CASE(SCALARTYPE5, __VA_ARGS__) \
422
+ AT_DISPATCH_CASE(SCALARTYPE6, __VA_ARGS__)
423
+
424
+ #define AT_DISPATCH_FLOATING_AND_COMPLEX_TYPES_AND6( \
425
+ SCALARTYPE1, \
426
+ SCALARTYPE2, \
427
+ SCALARTYPE3, \
428
+ SCALARTYPE4, \
429
+ SCALARTYPE5, \
430
+ SCALARTYPE6, \
431
+ TYPE, \
432
+ NAME, \
433
+ ...) \
434
+ AT_DISPATCH_SWITCH( \
435
+ TYPE, \
436
+ NAME, \
437
+ AT_DISPATCH_CASE_FLOATING_AND_COMPLEX_TYPES_AND6( \
438
+ SCALARTYPE1, \
439
+ SCALARTYPE2, \
440
+ SCALARTYPE3, \
441
+ SCALARTYPE4, \
442
+ SCALARTYPE5, \
443
+ SCALARTYPE6, \
444
+ __VA_ARGS__))
445
+
446
+ #define AT_DISPATCH_CASE_INTEGRAL_TYPES(...) \
447
+ AT_DISPATCH_CASE(at::ScalarType::Byte, __VA_ARGS__) \
448
+ AT_DISPATCH_CASE(at::ScalarType::Char, __VA_ARGS__) \
449
+ AT_DISPATCH_CASE(at::ScalarType::Int, __VA_ARGS__) \
450
+ AT_DISPATCH_CASE(at::ScalarType::Long, __VA_ARGS__) \
451
+ AT_DISPATCH_CASE(at::ScalarType::Short, __VA_ARGS__)
452
+
453
+ #define AT_DISPATCH_INTEGRAL_TYPES(TYPE, NAME, ...) \
454
+ AT_DISPATCH_SWITCH(TYPE, NAME, AT_DISPATCH_CASE_INTEGRAL_TYPES(__VA_ARGS__))
455
+
456
+ #define AT_DISPATCH_CASE_INTEGRAL_TYPES_AND(SCALARTYPE, ...) \
457
+ AT_DISPATCH_CASE_INTEGRAL_TYPES(__VA_ARGS__) \
458
+ AT_DISPATCH_CASE(SCALARTYPE, __VA_ARGS__)
459
+
460
+ #define AT_DISPATCH_INTEGRAL_TYPES_AND(SCALARTYPE, TYPE, NAME, ...) \
461
+ AT_DISPATCH_SWITCH( \
462
+ TYPE, \
463
+ NAME, \
464
+ AT_DISPATCH_CASE_INTEGRAL_TYPES_AND(SCALARTYPE, __VA_ARGS__))
465
+
466
+ #define AT_DISPATCH_CASE_ALL_TYPES(...) \
467
+ AT_DISPATCH_CASE_INTEGRAL_TYPES(__VA_ARGS__) \
468
+ AT_DISPATCH_CASE_FLOATING_TYPES(__VA_ARGS__)
469
+
470
+ #define AT_DISPATCH_ALL_TYPES(TYPE, NAME, ...) \
471
+ AT_DISPATCH_SWITCH(TYPE, NAME, AT_DISPATCH_CASE_ALL_TYPES(__VA_ARGS__))
472
+
473
+ #define AT_DISPATCH_CASE_QINT_TYPES(...) \
474
+ AT_DISPATCH_CASE_QINT(at::kQInt8, at::qint8, __VA_ARGS__) \
475
+ AT_DISPATCH_CASE_QINT(at::kQUInt8, at::quint8, __VA_ARGS__) \
476
+ AT_DISPATCH_CASE_QINT(at::kQInt32, at::qint32, __VA_ARGS__)
477
+
478
+ #define AT_DISPATCH_QINT_TYPES(TYPE, NAME, ...) \
479
+ AT_DISPATCH_SWITCH(TYPE, NAME, AT_DISPATCH_CASE_QINT_TYPES(__VA_ARGS__))
480
+
481
+ #define AT_DISPATCH_CASE_QINT_TYPES_AND(SCALARTYPE, ...) \
482
+ AT_DISPATCH_CASE_QINT_TYPES(__VA_ARGS__) \
483
+ AT_DISPATCH_CASE(SCALARTYPE, __VA_ARGS__)
484
+
485
+ #define AT_DISPATCH_QINT_TYPES_AND(SCALARTYPE, TYPE, NAME, ...) \
486
+ AT_DISPATCH_SWITCH( \
487
+ TYPE, NAME, AT_DISPATCH_CASE_QINT_TYPES_AND(SCALARTYPE, __VA_ARGS__))
488
+
489
+ #define AT_DISPATCH_CASE_QINT_BYTE_TYPES(...) \
490
+ AT_DISPATCH_CASE_QINT(at::kQInt8, at::qint8, __VA_ARGS__) \
491
+ AT_DISPATCH_CASE_QINT(at::kQUInt8, at::quint8, __VA_ARGS__)
492
+
493
+ #define AT_DISPATCH_QINT_BYTE_TYPES(TYPE, NAME, ...) \
494
+ AT_DISPATCH_SWITCH(TYPE, NAME, AT_DISPATCH_CASE_QINT_BYTE_TYPES(__VA_ARGS__))
495
+
496
+ #define AT_DISPATCH_CASE_QINT_AND_SUB_BYTE_TYPES(...) \
497
+ AT_QINT_SUB_BYTE_PRIVATE_CASE_TYPE( \
498
+ at::kQInt8, at::qint8, CHAR_BIT, SCHAR_MIN, SCHAR_MAX, __VA_ARGS__) \
499
+ AT_QINT_SUB_BYTE_PRIVATE_CASE_TYPE( \
500
+ at::kQUInt8, at::quint8, CHAR_BIT, 0, UCHAR_MAX, __VA_ARGS__) \
501
+ AT_QINT_SUB_BYTE_PRIVATE_CASE_TYPE( \
502
+ at::kQInt32, \
503
+ at::qint32, \
504
+ CHAR_BIT * sizeof(int), \
505
+ INT_MIN, \
506
+ INT_MAX, \
507
+ __VA_ARGS__) \
508
+ AT_QINT_SUB_BYTE_PRIVATE_CASE_TYPE( \
509
+ at::kQUInt4x2, at::quint4x2, 4, 0, 15, __VA_ARGS__) \
510
+ AT_QINT_SUB_BYTE_PRIVATE_CASE_TYPE( \
511
+ at::kQUInt2x4, at::quint2x4, 2, 0, 3, __VA_ARGS__)
512
+
513
+ #define AT_DISPATCH_QINT_AND_SUB_BYTE_TYPES(TYPE, NAME, ...) \
514
+ AT_DISPATCH_SWITCH( \
515
+ TYPE, NAME, AT_DISPATCH_CASE_QINT_AND_SUB_BYTE_TYPES(__VA_ARGS__))
516
+
517
+ #define AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX(...) \
518
+ AT_DISPATCH_CASE_ALL_TYPES(__VA_ARGS__) \
519
+ AT_DISPATCH_CASE_COMPLEX_TYPES(__VA_ARGS__)
520
+
521
+ #define AT_DISPATCH_ALL_TYPES_AND_COMPLEX(TYPE, NAME, ...) \
522
+ AT_DISPATCH_SWITCH( \
523
+ TYPE, NAME, AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX(__VA_ARGS__))
524
+
525
+ #define AT_DISPATCH_CASE_ALL_TYPES_AND(SCALARTYPE, ...) \
526
+ AT_DISPATCH_CASE_ALL_TYPES(__VA_ARGS__) \
527
+ AT_DISPATCH_CASE(SCALARTYPE, __VA_ARGS__)
528
+
529
+ #define AT_DISPATCH_ALL_TYPES_AND(SCALARTYPE, TYPE, NAME, ...) \
530
+ AT_DISPATCH_SWITCH( \
531
+ TYPE, NAME, AT_DISPATCH_CASE_ALL_TYPES_AND(SCALARTYPE, __VA_ARGS__))
532
+
533
+ #define AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX_AND(SCALARTYPE, ...) \
534
+ AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX(__VA_ARGS__) \
535
+ AT_DISPATCH_CASE(SCALARTYPE, __VA_ARGS__)
536
+
537
+ #define AT_DISPATCH_ALL_TYPES_AND_COMPLEX_AND(SCALARTYPE, TYPE, NAME, ...) \
538
+ AT_DISPATCH_SWITCH( \
539
+ TYPE, \
540
+ NAME, \
541
+ AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX_AND(SCALARTYPE, __VA_ARGS__))
542
+
543
+ #define AT_DISPATCH_CASE_ALL_TYPES_AND2(SCALARTYPE1, SCALARTYPE2, ...) \
544
+ AT_DISPATCH_CASE_ALL_TYPES(__VA_ARGS__) \
545
+ AT_DISPATCH_CASE(SCALARTYPE1, __VA_ARGS__) \
546
+ AT_DISPATCH_CASE(SCALARTYPE2, __VA_ARGS__)
547
+
548
+ #define AT_DISPATCH_ALL_TYPES_AND2(SCALARTYPE1, SCALARTYPE2, TYPE, NAME, ...) \
549
+ AT_DISPATCH_SWITCH( \
550
+ TYPE, \
551
+ NAME, \
552
+ AT_DISPATCH_CASE_ALL_TYPES_AND2(SCALARTYPE1, SCALARTYPE2, __VA_ARGS__))
553
+
554
+ #define AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX_AND2( \
555
+ SCALARTYPE1, SCALARTYPE2, ...) \
556
+ AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX(__VA_ARGS__) \
557
+ AT_DISPATCH_CASE(SCALARTYPE1, __VA_ARGS__) \
558
+ AT_DISPATCH_CASE(SCALARTYPE2, __VA_ARGS__)
559
+
560
+ #define AT_DISPATCH_ALL_TYPES_AND_COMPLEX_AND2( \
561
+ SCALARTYPE1, SCALARTYPE2, TYPE, NAME, ...) \
562
+ AT_DISPATCH_SWITCH( \
563
+ TYPE, \
564
+ NAME, \
565
+ AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX_AND2( \
566
+ SCALARTYPE1, SCALARTYPE2, __VA_ARGS__))
567
+
568
+ #define AT_DISPATCH_CASE_ALL_TYPES_AND3( \
569
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, ...) \
570
+ AT_DISPATCH_CASE_ALL_TYPES(__VA_ARGS__) \
571
+ AT_DISPATCH_CASE(SCALARTYPE1, __VA_ARGS__) \
572
+ AT_DISPATCH_CASE(SCALARTYPE2, __VA_ARGS__) \
573
+ AT_DISPATCH_CASE(SCALARTYPE3, __VA_ARGS__)
574
+
575
+ #define AT_DISPATCH_ALL_TYPES_AND3( \
576
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, TYPE, NAME, ...) \
577
+ AT_DISPATCH_SWITCH( \
578
+ TYPE, \
579
+ NAME, \
580
+ AT_DISPATCH_CASE_ALL_TYPES_AND3( \
581
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, __VA_ARGS__))
582
+
583
+ #define AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX_AND3( \
584
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, ...) \
585
+ AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX(__VA_ARGS__) \
586
+ AT_DISPATCH_CASE(SCALARTYPE1, __VA_ARGS__) \
587
+ AT_DISPATCH_CASE(SCALARTYPE2, __VA_ARGS__) \
588
+ AT_DISPATCH_CASE(SCALARTYPE3, __VA_ARGS__)
589
+
590
+ #define AT_DISPATCH_ALL_TYPES_AND_COMPLEX_AND3( \
591
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, TYPE, NAME, ...) \
592
+ AT_DISPATCH_SWITCH( \
593
+ TYPE, \
594
+ NAME, \
595
+ AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX_AND3( \
596
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, __VA_ARGS__))
597
+
598
+ #define AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX_AND4( \
599
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, SCALARTYPE4, ...) \
600
+ AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX(__VA_ARGS__) \
601
+ AT_DISPATCH_CASE(SCALARTYPE1, __VA_ARGS__) \
602
+ AT_DISPATCH_CASE(SCALARTYPE2, __VA_ARGS__) \
603
+ AT_DISPATCH_CASE(SCALARTYPE3, __VA_ARGS__) \
604
+ AT_DISPATCH_CASE(SCALARTYPE4, __VA_ARGS__)
605
+
606
+ #define AT_DISPATCH_ALL_TYPES_AND_COMPLEX_AND4( \
607
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, SCALARTYPE4, TYPE, NAME, ...) \
608
+ AT_DISPATCH_SWITCH( \
609
+ TYPE, \
610
+ NAME, \
611
+ AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX_AND4( \
612
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, SCALARTYPE4, __VA_ARGS__))
613
+
614
+ #define AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX_AND5( \
615
+ SCALARTYPE1, SCALARTYPE2, SCALARTYPE3, SCALARTYPE4, SCALARTYPE5, ...) \
616
+ AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX(__VA_ARGS__) \
617
+ AT_DISPATCH_CASE(SCALARTYPE1, __VA_ARGS__) \
618
+ AT_DISPATCH_CASE(SCALARTYPE2, __VA_ARGS__) \
619
+ AT_DISPATCH_CASE(SCALARTYPE3, __VA_ARGS__) \
620
+ AT_DISPATCH_CASE(SCALARTYPE4, __VA_ARGS__) \
621
+ AT_DISPATCH_CASE(SCALARTYPE5, __VA_ARGS__)
622
+
623
+ #define AT_DISPATCH_ALL_TYPES_AND_COMPLEX_AND5( \
624
+ SCALARTYPE1, \
625
+ SCALARTYPE2, \
626
+ SCALARTYPE3, \
627
+ SCALARTYPE4, \
628
+ SCALARTYPE5, \
629
+ TYPE, \
630
+ NAME, \
631
+ ...) \
632
+ AT_DISPATCH_SWITCH( \
633
+ TYPE, \
634
+ NAME, \
635
+ AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX_AND5( \
636
+ SCALARTYPE1, \
637
+ SCALARTYPE2, \
638
+ SCALARTYPE3, \
639
+ SCALARTYPE4, \
640
+ SCALARTYPE5, \
641
+ __VA_ARGS__))
642
+
643
+ #define AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX_AND6( \
644
+ SCALARTYPE1, \
645
+ SCALARTYPE2, \
646
+ SCALARTYPE3, \
647
+ SCALARTYPE4, \
648
+ SCALARTYPE5, \
649
+ SCALARTYPE6, \
650
+ ...) \
651
+ AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX(__VA_ARGS__) \
652
+ AT_DISPATCH_CASE(SCALARTYPE1, __VA_ARGS__) \
653
+ AT_DISPATCH_CASE(SCALARTYPE2, __VA_ARGS__) \
654
+ AT_DISPATCH_CASE(SCALARTYPE3, __VA_ARGS__) \
655
+ AT_DISPATCH_CASE(SCALARTYPE4, __VA_ARGS__) \
656
+ AT_DISPATCH_CASE(SCALARTYPE5, __VA_ARGS__) \
657
+ AT_DISPATCH_CASE(SCALARTYPE6, __VA_ARGS__)
658
+
659
+ #define AT_DISPATCH_ALL_TYPES_AND_COMPLEX_AND6( \
660
+ SCALARTYPE1, \
661
+ SCALARTYPE2, \
662
+ SCALARTYPE3, \
663
+ SCALARTYPE4, \
664
+ SCALARTYPE5, \
665
+ SCALARTYPE6, \
666
+ TYPE, \
667
+ NAME, \
668
+ ...) \
669
+ AT_DISPATCH_SWITCH( \
670
+ TYPE, \
671
+ NAME, \
672
+ AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX_AND6( \
673
+ SCALARTYPE1, \
674
+ SCALARTYPE2, \
675
+ SCALARTYPE3, \
676
+ SCALARTYPE4, \
677
+ SCALARTYPE5, \
678
+ SCALARTYPE6, \
679
+ __VA_ARGS__))
680
+
681
+ #define AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX_AND7( \
682
+ SCALARTYPE1, \
683
+ SCALARTYPE2, \
684
+ SCALARTYPE3, \
685
+ SCALARTYPE4, \
686
+ SCALARTYPE5, \
687
+ SCALARTYPE6, \
688
+ SCALARTYPE7, \
689
+ ...) \
690
+ AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX(__VA_ARGS__) \
691
+ AT_DISPATCH_CASE(SCALARTYPE1, __VA_ARGS__) \
692
+ AT_DISPATCH_CASE(SCALARTYPE2, __VA_ARGS__) \
693
+ AT_DISPATCH_CASE(SCALARTYPE3, __VA_ARGS__) \
694
+ AT_DISPATCH_CASE(SCALARTYPE4, __VA_ARGS__) \
695
+ AT_DISPATCH_CASE(SCALARTYPE5, __VA_ARGS__) \
696
+ AT_DISPATCH_CASE(SCALARTYPE6, __VA_ARGS__) \
697
+ AT_DISPATCH_CASE(SCALARTYPE7, __VA_ARGS__)
698
+
699
+ #define AT_DISPATCH_ALL_TYPES_AND_COMPLEX_AND7( \
700
+ SCALARTYPE1, \
701
+ SCALARTYPE2, \
702
+ SCALARTYPE3, \
703
+ SCALARTYPE4, \
704
+ SCALARTYPE5, \
705
+ SCALARTYPE6, \
706
+ SCALARTYPE7, \
707
+ TYPE, \
708
+ NAME, \
709
+ ...) \
710
+ AT_DISPATCH_SWITCH( \
711
+ TYPE, \
712
+ NAME, \
713
+ AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX_AND7( \
714
+ SCALARTYPE1, \
715
+ SCALARTYPE2, \
716
+ SCALARTYPE3, \
717
+ SCALARTYPE4, \
718
+ SCALARTYPE5, \
719
+ SCALARTYPE6, \
720
+ SCALARTYPE7, \
721
+ __VA_ARGS__))
722
+
723
+ #define AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX_AND8( \
724
+ SCALARTYPE1, \
725
+ SCALARTYPE2, \
726
+ SCALARTYPE3, \
727
+ SCALARTYPE4, \
728
+ SCALARTYPE5, \
729
+ SCALARTYPE6, \
730
+ SCALARTYPE7, \
731
+ SCALARTYPE8, \
732
+ ...) \
733
+ AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX(__VA_ARGS__) \
734
+ AT_DISPATCH_CASE(SCALARTYPE1, __VA_ARGS__) \
735
+ AT_DISPATCH_CASE(SCALARTYPE2, __VA_ARGS__) \
736
+ AT_DISPATCH_CASE(SCALARTYPE3, __VA_ARGS__) \
737
+ AT_DISPATCH_CASE(SCALARTYPE4, __VA_ARGS__) \
738
+ AT_DISPATCH_CASE(SCALARTYPE5, __VA_ARGS__) \
739
+ AT_DISPATCH_CASE(SCALARTYPE6, __VA_ARGS__) \
740
+ AT_DISPATCH_CASE(SCALARTYPE7, __VA_ARGS__) \
741
+ AT_DISPATCH_CASE(SCALARTYPE8, __VA_ARGS__)
742
+
743
+ #define AT_DISPATCH_ALL_TYPES_AND_COMPLEX_AND8( \
744
+ SCALARTYPE1, \
745
+ SCALARTYPE2, \
746
+ SCALARTYPE3, \
747
+ SCALARTYPE4, \
748
+ SCALARTYPE5, \
749
+ SCALARTYPE6, \
750
+ SCALARTYPE7, \
751
+ SCALARTYPE8, \
752
+ TYPE, \
753
+ NAME, \
754
+ ...) \
755
+ AT_DISPATCH_SWITCH( \
756
+ TYPE, \
757
+ NAME, \
758
+ AT_DISPATCH_CASE_ALL_TYPES_AND_COMPLEX_AND8( \
759
+ SCALARTYPE1, \
760
+ SCALARTYPE2, \
761
+ SCALARTYPE3, \
762
+ SCALARTYPE4, \
763
+ SCALARTYPE5, \
764
+ SCALARTYPE6, \
765
+ SCALARTYPE7, \
766
+ SCALARTYPE8, \
767
+ __VA_ARGS__))
768
+
769
+ #define AT_DISPATCH_CASE_BIT_TYPES(...) \
770
+ AT_DISPATCH_CASE(at::ScalarType::Bits1x8, __VA_ARGS__) \
771
+ AT_DISPATCH_CASE(at::ScalarType::Bits2x4, __VA_ARGS__) \
772
+ AT_DISPATCH_CASE(at::ScalarType::Bits4x2, __VA_ARGS__) \
773
+ AT_DISPATCH_CASE(at::ScalarType::Bits8, __VA_ARGS__) \
774
+ AT_DISPATCH_CASE(at::ScalarType::Bits16, __VA_ARGS__)
775
+
776
+ #define AT_DISPATCH_BIT_TYPES(TYPE, NAME, ...) \
777
+ AT_DISPATCH_SWITCH(TYPE, NAME, AT_DISPATCH_CASE_BIT_TYPES(__VA_ARGS__))
778
+
779
+ #define AT_DISPATCH_INDEX_TYPES(TYPE, NAME, ...) \
780
+ AT_DISPATCH_SWITCH( \
781
+ TYPE, \
782
+ NAME, \
783
+ AT_PRIVATE_CASE_TYPE_USING_HINT( \
784
+ at::ScalarType::Int, index_t, __VA_ARGS__) \
785
+ AT_PRIVATE_CASE_TYPE_USING_HINT( \
786
+ at::ScalarType::Long, index_t, __VA_ARGS__))
787
+
788
+ #else
789
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
790
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/Dispatch_v2.h ADDED
@@ -0,0 +1,182 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+
4
+ #include <torch/headeronly/core/Dispatch_v2.h>
5
+
6
+ // Get AT_DISPATCH_SWITCH and AT_DISPATCH_CASE:
7
+ #include <ATen/Dispatch.h>
8
+
9
+ // This is a new implementation of the AT_DISPATCH macro family from
10
+ // ATen/Dispatch.h
11
+ //
12
+ // The intended usage is:
13
+ //
14
+ // ScalarType scalar_type;
15
+ //
16
+ // AT_DISPATCH_V2(
17
+ // scalar_type,
18
+ // "debug string",
19
+ // AT_WRAP([&] {
20
+ // ... code to specialize with scalar_t ...
21
+ // }),
22
+ // kHalf,
23
+ // AT_EXPAND(AT_ALL_TYPES),
24
+ // ... as many types arguments as needed ...
25
+ // )
26
+ //
27
+ // For example, given an old style:
28
+ //
29
+ // AT_DISPATCH_ALL_TYPES_AND_COMPLEX_AND2(
30
+ // kComplexHalf,
31
+ // kHalf,
32
+ // self.scalar_type(),
33
+ // "_local_scalar_dense_cpu",
34
+ // [&] {
35
+ // scalar_t value = *self.data_ptr<scalar_t>();
36
+ // r = Scalar(value);
37
+ // }
38
+ // )
39
+ //
40
+ // You now write:
41
+ //
42
+ // AT_DISPATCH_V2(
43
+ // self.scalar_type(),
44
+ // "_local_scalar_dense_cpu",
45
+ // AT_WRAP([&] {
46
+ // scalar_t value = *self.data_ptr<scalar_t>();
47
+ // r = Scalar(value);
48
+ // }),
49
+ // AT_EXPAND(AT_ALL_TYPES),
50
+ // AT_EXPAND(AT_COMPLEX_TYPES),
51
+ // kComplexHalf,
52
+ // kHalf,
53
+ // )
54
+ //
55
+ // Notably, it sports the following improvements:
56
+ //
57
+ // - It is not necessary to specify the arity (e.g.,
58
+ // AT_DISPATCH_FLOATING_AND_COMPLEX_TYPES_AND{2,3,4,...})
59
+ // when using the macro
60
+ //
61
+ // - It is not necessary to specify each dtype individually; if
62
+ // there is a set of related dtypes and you want to dispatch
63
+ // over all of them, you can simply say, e.g., AT_EXPAND(AT_INTEGRAL_TYPES)
64
+ // in your argument list.
65
+ //
66
+ // However, you must remember to wrap the payload body in AT_WRAP, or commas
67
+ // inside your lambda will be improperly handled. Furthermore, if you more
68
+ // entries to ScalarType than can be supported by this macro, it will fail
69
+ // with an obscure error (due to attempting to concatenate AT_AP with
70
+ // something that is not a number).
71
+ //
72
+ // The implementation strategy is to use the count arguments trick
73
+ // (e.g., as described in https://stackoverflow.com/a/2124385/23845)
74
+ // to discover how many dtypes have been passed, and then dispatch to a
75
+ // hand-written macro for each arity that applies as many DISPATCH_CASE as
76
+ // necessary. The hand-written macros can be regenerated for other arities
77
+ // with the script below.
78
+ //
79
+ // There is some delicacy in the implementation in controlling when
80
+ // macro expansion occurs, mediated with AT_EXPAND and AT_GUARD. I mostly
81
+ // relied on GPT4 to help me get it right.
82
+
83
+ // See documentation above
84
+ #define AT_DISPATCH_V2(TYPE, NAME, BODY, ...) \
85
+ THO_DISPATCH_V2_TMPL( \
86
+ AT_DISPATCH_SWITCH, \
87
+ AT_DISPATCH_CASE, \
88
+ TYPE, \
89
+ NAME, \
90
+ AT_WRAP(BODY), \
91
+ __VA_ARGS__)
92
+
93
+ // Unused helper macros, kept for BC:
94
+ #define AT_AP_VAR(N, T, ...) \
95
+ AT_EXPAND(AT_CONCAT(AT_AP, AT_NUM_ARGS(__VA_ARGS__))(AT_WRAP(N), __VA_ARGS__))
96
+
97
+ // Ensure we never have too many scalar types for the expansion here to
98
+ // support. To bump this, you must regenerate the macros below.
99
+ static_assert(static_cast<int>(c10::ScalarType::NumOptions) < 60);
100
+
101
+ // Python code to regenerate generate code below:
102
+ #if 0
103
+
104
+ num_args = 60
105
+
106
+ for i in range(1, num_args+1):
107
+ args = ', '.join(f'_{i}' for i in range(1, i+1))
108
+ cases = ' '.join([f'AT_DISPATCH_CASE(_{j}, N)' for j in range(1, i+1)])
109
+ print(f'#define AT_AP{i}(N, {args}) {cases}')
110
+
111
+ #endif
112
+
113
+ // Begin generated code
114
+ // clang-format off
115
+
116
+ #define AT_AP1(N, _1) AT_DISPATCH_CASE(_1, N)
117
+ #define AT_AP2(N, _1, _2) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N)
118
+ #define AT_AP3(N, _1, _2, _3) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N)
119
+ #define AT_AP4(N, _1, _2, _3, _4) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N)
120
+ #define AT_AP5(N, _1, _2, _3, _4, _5) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N)
121
+ #define AT_AP6(N, _1, _2, _3, _4, _5, _6) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N)
122
+ #define AT_AP7(N, _1, _2, _3, _4, _5, _6, _7) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N)
123
+ #define AT_AP8(N, _1, _2, _3, _4, _5, _6, _7, _8) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N)
124
+ #define AT_AP9(N, _1, _2, _3, _4, _5, _6, _7, _8, _9) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N)
125
+ #define AT_AP10(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N)
126
+ #define AT_AP11(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N)
127
+ #define AT_AP12(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N)
128
+ #define AT_AP13(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N)
129
+ #define AT_AP14(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N)
130
+ #define AT_AP15(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N)
131
+ #define AT_AP16(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N)
132
+ #define AT_AP17(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N)
133
+ #define AT_AP18(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N)
134
+ #define AT_AP19(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N)
135
+ #define AT_AP20(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N)
136
+ #define AT_AP21(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N)
137
+ #define AT_AP22(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N)
138
+ #define AT_AP23(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N)
139
+ #define AT_AP24(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N)
140
+ #define AT_AP25(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N)
141
+ #define AT_AP26(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N)
142
+ #define AT_AP27(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N)
143
+ #define AT_AP28(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N)
144
+ #define AT_AP29(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N)
145
+ #define AT_AP30(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N)
146
+ #define AT_AP31(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N)
147
+ #define AT_AP32(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N)
148
+ #define AT_AP33(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N)
149
+ #define AT_AP34(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N)
150
+ #define AT_AP35(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N)
151
+ #define AT_AP36(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N)
152
+ #define AT_AP37(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N)
153
+ #define AT_AP38(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N)
154
+ #define AT_AP39(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N)
155
+ #define AT_AP40(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N) AT_DISPATCH_CASE(_40, N)
156
+ #define AT_AP41(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N) AT_DISPATCH_CASE(_40, N) AT_DISPATCH_CASE(_41, N)
157
+ #define AT_AP42(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N) AT_DISPATCH_CASE(_40, N) AT_DISPATCH_CASE(_41, N) AT_DISPATCH_CASE(_42, N)
158
+ #define AT_AP43(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N) AT_DISPATCH_CASE(_40, N) AT_DISPATCH_CASE(_41, N) AT_DISPATCH_CASE(_42, N) AT_DISPATCH_CASE(_43, N)
159
+ #define AT_AP44(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N) AT_DISPATCH_CASE(_40, N) AT_DISPATCH_CASE(_41, N) AT_DISPATCH_CASE(_42, N) AT_DISPATCH_CASE(_43, N) AT_DISPATCH_CASE(_44, N)
160
+ #define AT_AP45(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44, _45) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N) AT_DISPATCH_CASE(_40, N) AT_DISPATCH_CASE(_41, N) AT_DISPATCH_CASE(_42, N) AT_DISPATCH_CASE(_43, N) AT_DISPATCH_CASE(_44, N) AT_DISPATCH_CASE(_45, N)
161
+ #define AT_AP46(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44, _45, _46) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N) AT_DISPATCH_CASE(_40, N) AT_DISPATCH_CASE(_41, N) AT_DISPATCH_CASE(_42, N) AT_DISPATCH_CASE(_43, N) AT_DISPATCH_CASE(_44, N) AT_DISPATCH_CASE(_45, N) AT_DISPATCH_CASE(_46, N)
162
+ #define AT_AP47(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44, _45, _46, _47) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N) AT_DISPATCH_CASE(_40, N) AT_DISPATCH_CASE(_41, N) AT_DISPATCH_CASE(_42, N) AT_DISPATCH_CASE(_43, N) AT_DISPATCH_CASE(_44, N) AT_DISPATCH_CASE(_45, N) AT_DISPATCH_CASE(_46, N) AT_DISPATCH_CASE(_47, N)
163
+ #define AT_AP48(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44, _45, _46, _47, _48) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N) AT_DISPATCH_CASE(_40, N) AT_DISPATCH_CASE(_41, N) AT_DISPATCH_CASE(_42, N) AT_DISPATCH_CASE(_43, N) AT_DISPATCH_CASE(_44, N) AT_DISPATCH_CASE(_45, N) AT_DISPATCH_CASE(_46, N) AT_DISPATCH_CASE(_47, N) AT_DISPATCH_CASE(_48, N)
164
+ #define AT_AP49(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44, _45, _46, _47, _48, _49) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N) AT_DISPATCH_CASE(_40, N) AT_DISPATCH_CASE(_41, N) AT_DISPATCH_CASE(_42, N) AT_DISPATCH_CASE(_43, N) AT_DISPATCH_CASE(_44, N) AT_DISPATCH_CASE(_45, N) AT_DISPATCH_CASE(_46, N) AT_DISPATCH_CASE(_47, N) AT_DISPATCH_CASE(_48, N) AT_DISPATCH_CASE(_49, N)
165
+ #define AT_AP50(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44, _45, _46, _47, _48, _49, _50) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N) AT_DISPATCH_CASE(_40, N) AT_DISPATCH_CASE(_41, N) AT_DISPATCH_CASE(_42, N) AT_DISPATCH_CASE(_43, N) AT_DISPATCH_CASE(_44, N) AT_DISPATCH_CASE(_45, N) AT_DISPATCH_CASE(_46, N) AT_DISPATCH_CASE(_47, N) AT_DISPATCH_CASE(_48, N) AT_DISPATCH_CASE(_49, N) AT_DISPATCH_CASE(_50, N)
166
+ #define AT_AP51(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44, _45, _46, _47, _48, _49, _50, _51) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N) AT_DISPATCH_CASE(_40, N) AT_DISPATCH_CASE(_41, N) AT_DISPATCH_CASE(_42, N) AT_DISPATCH_CASE(_43, N) AT_DISPATCH_CASE(_44, N) AT_DISPATCH_CASE(_45, N) AT_DISPATCH_CASE(_46, N) AT_DISPATCH_CASE(_47, N) AT_DISPATCH_CASE(_48, N) AT_DISPATCH_CASE(_49, N) AT_DISPATCH_CASE(_50, N) AT_DISPATCH_CASE(_51, N)
167
+ #define AT_AP52(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44, _45, _46, _47, _48, _49, _50, _51, _52) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N) AT_DISPATCH_CASE(_40, N) AT_DISPATCH_CASE(_41, N) AT_DISPATCH_CASE(_42, N) AT_DISPATCH_CASE(_43, N) AT_DISPATCH_CASE(_44, N) AT_DISPATCH_CASE(_45, N) AT_DISPATCH_CASE(_46, N) AT_DISPATCH_CASE(_47, N) AT_DISPATCH_CASE(_48, N) AT_DISPATCH_CASE(_49, N) AT_DISPATCH_CASE(_50, N) AT_DISPATCH_CASE(_51, N) AT_DISPATCH_CASE(_52, N)
168
+ #define AT_AP53(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44, _45, _46, _47, _48, _49, _50, _51, _52, _53) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N) AT_DISPATCH_CASE(_40, N) AT_DISPATCH_CASE(_41, N) AT_DISPATCH_CASE(_42, N) AT_DISPATCH_CASE(_43, N) AT_DISPATCH_CASE(_44, N) AT_DISPATCH_CASE(_45, N) AT_DISPATCH_CASE(_46, N) AT_DISPATCH_CASE(_47, N) AT_DISPATCH_CASE(_48, N) AT_DISPATCH_CASE(_49, N) AT_DISPATCH_CASE(_50, N) AT_DISPATCH_CASE(_51, N) AT_DISPATCH_CASE(_52, N) AT_DISPATCH_CASE(_53, N)
169
+ #define AT_AP54(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44, _45, _46, _47, _48, _49, _50, _51, _52, _53, _54) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N) AT_DISPATCH_CASE(_40, N) AT_DISPATCH_CASE(_41, N) AT_DISPATCH_CASE(_42, N) AT_DISPATCH_CASE(_43, N) AT_DISPATCH_CASE(_44, N) AT_DISPATCH_CASE(_45, N) AT_DISPATCH_CASE(_46, N) AT_DISPATCH_CASE(_47, N) AT_DISPATCH_CASE(_48, N) AT_DISPATCH_CASE(_49, N) AT_DISPATCH_CASE(_50, N) AT_DISPATCH_CASE(_51, N) AT_DISPATCH_CASE(_52, N) AT_DISPATCH_CASE(_53, N) AT_DISPATCH_CASE(_54, N)
170
+ #define AT_AP55(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44, _45, _46, _47, _48, _49, _50, _51, _52, _53, _54, _55) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N) AT_DISPATCH_CASE(_40, N) AT_DISPATCH_CASE(_41, N) AT_DISPATCH_CASE(_42, N) AT_DISPATCH_CASE(_43, N) AT_DISPATCH_CASE(_44, N) AT_DISPATCH_CASE(_45, N) AT_DISPATCH_CASE(_46, N) AT_DISPATCH_CASE(_47, N) AT_DISPATCH_CASE(_48, N) AT_DISPATCH_CASE(_49, N) AT_DISPATCH_CASE(_50, N) AT_DISPATCH_CASE(_51, N) AT_DISPATCH_CASE(_52, N) AT_DISPATCH_CASE(_53, N) AT_DISPATCH_CASE(_54, N) AT_DISPATCH_CASE(_55, N)
171
+ #define AT_AP56(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44, _45, _46, _47, _48, _49, _50, _51, _52, _53, _54, _55, _56) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N) AT_DISPATCH_CASE(_40, N) AT_DISPATCH_CASE(_41, N) AT_DISPATCH_CASE(_42, N) AT_DISPATCH_CASE(_43, N) AT_DISPATCH_CASE(_44, N) AT_DISPATCH_CASE(_45, N) AT_DISPATCH_CASE(_46, N) AT_DISPATCH_CASE(_47, N) AT_DISPATCH_CASE(_48, N) AT_DISPATCH_CASE(_49, N) AT_DISPATCH_CASE(_50, N) AT_DISPATCH_CASE(_51, N) AT_DISPATCH_CASE(_52, N) AT_DISPATCH_CASE(_53, N) AT_DISPATCH_CASE(_54, N) AT_DISPATCH_CASE(_55, N) AT_DISPATCH_CASE(_56, N)
172
+ #define AT_AP57(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44, _45, _46, _47, _48, _49, _50, _51, _52, _53, _54, _55, _56, _57) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N) AT_DISPATCH_CASE(_40, N) AT_DISPATCH_CASE(_41, N) AT_DISPATCH_CASE(_42, N) AT_DISPATCH_CASE(_43, N) AT_DISPATCH_CASE(_44, N) AT_DISPATCH_CASE(_45, N) AT_DISPATCH_CASE(_46, N) AT_DISPATCH_CASE(_47, N) AT_DISPATCH_CASE(_48, N) AT_DISPATCH_CASE(_49, N) AT_DISPATCH_CASE(_50, N) AT_DISPATCH_CASE(_51, N) AT_DISPATCH_CASE(_52, N) AT_DISPATCH_CASE(_53, N) AT_DISPATCH_CASE(_54, N) AT_DISPATCH_CASE(_55, N) AT_DISPATCH_CASE(_56, N) AT_DISPATCH_CASE(_57, N)
173
+ #define AT_AP58(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44, _45, _46, _47, _48, _49, _50, _51, _52, _53, _54, _55, _56, _57, _58) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N) AT_DISPATCH_CASE(_40, N) AT_DISPATCH_CASE(_41, N) AT_DISPATCH_CASE(_42, N) AT_DISPATCH_CASE(_43, N) AT_DISPATCH_CASE(_44, N) AT_DISPATCH_CASE(_45, N) AT_DISPATCH_CASE(_46, N) AT_DISPATCH_CASE(_47, N) AT_DISPATCH_CASE(_48, N) AT_DISPATCH_CASE(_49, N) AT_DISPATCH_CASE(_50, N) AT_DISPATCH_CASE(_51, N) AT_DISPATCH_CASE(_52, N) AT_DISPATCH_CASE(_53, N) AT_DISPATCH_CASE(_54, N) AT_DISPATCH_CASE(_55, N) AT_DISPATCH_CASE(_56, N) AT_DISPATCH_CASE(_57, N) AT_DISPATCH_CASE(_58, N)
174
+ #define AT_AP59(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44, _45, _46, _47, _48, _49, _50, _51, _52, _53, _54, _55, _56, _57, _58, _59) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N) AT_DISPATCH_CASE(_40, N) AT_DISPATCH_CASE(_41, N) AT_DISPATCH_CASE(_42, N) AT_DISPATCH_CASE(_43, N) AT_DISPATCH_CASE(_44, N) AT_DISPATCH_CASE(_45, N) AT_DISPATCH_CASE(_46, N) AT_DISPATCH_CASE(_47, N) AT_DISPATCH_CASE(_48, N) AT_DISPATCH_CASE(_49, N) AT_DISPATCH_CASE(_50, N) AT_DISPATCH_CASE(_51, N) AT_DISPATCH_CASE(_52, N) AT_DISPATCH_CASE(_53, N) AT_DISPATCH_CASE(_54, N) AT_DISPATCH_CASE(_55, N) AT_DISPATCH_CASE(_56, N) AT_DISPATCH_CASE(_57, N) AT_DISPATCH_CASE(_58, N) AT_DISPATCH_CASE(_59, N)
175
+ #define AT_AP60(N, _1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44, _45, _46, _47, _48, _49, _50, _51, _52, _53, _54, _55, _56, _57, _58, _59, _60) AT_DISPATCH_CASE(_1, N) AT_DISPATCH_CASE(_2, N) AT_DISPATCH_CASE(_3, N) AT_DISPATCH_CASE(_4, N) AT_DISPATCH_CASE(_5, N) AT_DISPATCH_CASE(_6, N) AT_DISPATCH_CASE(_7, N) AT_DISPATCH_CASE(_8, N) AT_DISPATCH_CASE(_9, N) AT_DISPATCH_CASE(_10, N) AT_DISPATCH_CASE(_11, N) AT_DISPATCH_CASE(_12, N) AT_DISPATCH_CASE(_13, N) AT_DISPATCH_CASE(_14, N) AT_DISPATCH_CASE(_15, N) AT_DISPATCH_CASE(_16, N) AT_DISPATCH_CASE(_17, N) AT_DISPATCH_CASE(_18, N) AT_DISPATCH_CASE(_19, N) AT_DISPATCH_CASE(_20, N) AT_DISPATCH_CASE(_21, N) AT_DISPATCH_CASE(_22, N) AT_DISPATCH_CASE(_23, N) AT_DISPATCH_CASE(_24, N) AT_DISPATCH_CASE(_25, N) AT_DISPATCH_CASE(_26, N) AT_DISPATCH_CASE(_27, N) AT_DISPATCH_CASE(_28, N) AT_DISPATCH_CASE(_29, N) AT_DISPATCH_CASE(_30, N) AT_DISPATCH_CASE(_31, N) AT_DISPATCH_CASE(_32, N) AT_DISPATCH_CASE(_33, N) AT_DISPATCH_CASE(_34, N) AT_DISPATCH_CASE(_35, N) AT_DISPATCH_CASE(_36, N) AT_DISPATCH_CASE(_37, N) AT_DISPATCH_CASE(_38, N) AT_DISPATCH_CASE(_39, N) AT_DISPATCH_CASE(_40, N) AT_DISPATCH_CASE(_41, N) AT_DISPATCH_CASE(_42, N) AT_DISPATCH_CASE(_43, N) AT_DISPATCH_CASE(_44, N) AT_DISPATCH_CASE(_45, N) AT_DISPATCH_CASE(_46, N) AT_DISPATCH_CASE(_47, N) AT_DISPATCH_CASE(_48, N) AT_DISPATCH_CASE(_49, N) AT_DISPATCH_CASE(_50, N) AT_DISPATCH_CASE(_51, N) AT_DISPATCH_CASE(_52, N) AT_DISPATCH_CASE(_53, N) AT_DISPATCH_CASE(_54, N) AT_DISPATCH_CASE(_55, N) AT_DISPATCH_CASE(_56, N) AT_DISPATCH_CASE(_57, N) AT_DISPATCH_CASE(_58, N) AT_DISPATCH_CASE(_59, N) AT_DISPATCH_CASE(_60, N)
176
+
177
+ // End generated code
178
+ // clang-format on
179
+
180
+ #else
181
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
182
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/DynamicLibrary.h ADDED
@@ -0,0 +1,41 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+
4
+ #include <ATen/Utils.h>
5
+ #include <c10/macros/Export.h>
6
+ #include <c10/util/Exception.h>
7
+
8
+ namespace c10 {
9
+
10
+ class DynamicLibraryError : public Error {
11
+ using Error::Error;
12
+ };
13
+
14
+ } // namespace c10
15
+
16
+ namespace at {
17
+
18
+ struct DynamicLibrary {
19
+ AT_DISALLOW_COPY_AND_ASSIGN(DynamicLibrary);
20
+ DynamicLibrary(DynamicLibrary&& other) = delete;
21
+ DynamicLibrary& operator=(DynamicLibrary&&) = delete;
22
+
23
+ TORCH_API DynamicLibrary(
24
+ const char* name,
25
+ const char* alt_name = nullptr,
26
+ bool leak_handle = false);
27
+
28
+ TORCH_API void* sym(const char* name);
29
+
30
+ TORCH_API ~DynamicLibrary();
31
+
32
+ private:
33
+ bool leak_handle;
34
+ void* handle = nullptr;
35
+ };
36
+
37
+ } // namespace at
38
+
39
+ #else
40
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
41
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/EmptyTensor.h ADDED
@@ -0,0 +1,171 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+ #include <ATen/core/TensorBase.h>
4
+
5
+ namespace at::detail {
6
+
7
+ inline void check_size_nonnegative(ArrayRef<int64_t> size) {
8
+ for (const auto& x : size) {
9
+ TORCH_CHECK(
10
+ x >= 0,
11
+ "Trying to create tensor with negative dimension ",
12
+ x,
13
+ ": ",
14
+ size);
15
+ }
16
+ }
17
+
18
+ inline void check_size_nonnegative(ArrayRef<c10::SymInt> size) {
19
+ for (const auto& x : size) {
20
+ TORCH_SYM_CHECK(
21
+ x.sym_ge(0),
22
+ "Trying to create tensor with negative dimension ",
23
+ x,
24
+ ": ",
25
+ size);
26
+ }
27
+ }
28
+
29
+ TORCH_API size_t computeStorageNbytesContiguous(
30
+ IntArrayRef sizes,
31
+ size_t itemsize,
32
+ size_t storage_offset = 0);
33
+ TORCH_API SymInt computeStorageNbytesContiguous(
34
+ SymIntArrayRef sizes,
35
+ const SymInt& itemsize,
36
+ const SymInt& storage_offset = 0);
37
+ TORCH_API size_t computeStorageNbytes(
38
+ IntArrayRef sizes,
39
+ IntArrayRef strides,
40
+ size_t itemsize,
41
+ size_t storage_offset = 0);
42
+ TORCH_API SymInt computeStorageNbytes(
43
+ SymIntArrayRef sizes,
44
+ SymIntArrayRef strides,
45
+ const SymInt& itemsize,
46
+ const SymInt& storage_offset = 0);
47
+
48
+ TORCH_API TensorBase empty_generic(
49
+ IntArrayRef size,
50
+ c10::Allocator* allocator,
51
+ c10::DispatchKeySet ks,
52
+ ScalarType scalar_type,
53
+ std::optional<c10::MemoryFormat> memory_format_opt);
54
+
55
+ TORCH_API TensorBase empty_generic_symint(
56
+ SymIntArrayRef size,
57
+ c10::Allocator* allocator,
58
+ c10::DispatchKeySet ks,
59
+ ScalarType scalar_type,
60
+ std::optional<c10::MemoryFormat> memory_format_opt);
61
+
62
+ TORCH_API TensorBase empty_strided_generic(
63
+ IntArrayRef size,
64
+ IntArrayRef stride,
65
+ c10::Allocator* allocator,
66
+ c10::DispatchKeySet ks,
67
+ ScalarType scalar_type);
68
+
69
+ TORCH_API TensorBase empty_strided_symint_generic(
70
+ SymIntArrayRef size,
71
+ SymIntArrayRef stride,
72
+ c10::Allocator* allocator,
73
+ c10::DispatchKeySet ks,
74
+ ScalarType scalar_type);
75
+
76
+ TORCH_API TensorBase empty_cpu(
77
+ IntArrayRef size,
78
+ ScalarType dtype,
79
+ bool pin_memory = false,
80
+ std::optional<c10::MemoryFormat> memory_format_opt = std::nullopt);
81
+
82
+ TORCH_API TensorBase empty_cpu(
83
+ IntArrayRef size,
84
+ std::optional<ScalarType> dtype_opt,
85
+ std::optional<Layout> layout_opt,
86
+ std::optional<Device> device_opt,
87
+ std::optional<bool> pin_memory_opt,
88
+ std::optional<c10::MemoryFormat> memory_format_opt);
89
+
90
+ TORCH_API TensorBase empty_cpu(IntArrayRef size, const TensorOptions& options);
91
+
92
+ TORCH_API TensorBase empty_strided_cpu(
93
+ IntArrayRef size,
94
+ IntArrayRef stride,
95
+ ScalarType dtype,
96
+ bool pin_memory = false);
97
+
98
+ TORCH_API TensorBase empty_strided_cpu(
99
+ IntArrayRef size,
100
+ IntArrayRef stride,
101
+ std::optional<ScalarType> dtype_opt,
102
+ std::optional<Layout> layout_opt,
103
+ std::optional<Device> device_opt,
104
+ std::optional<bool> pin_memory_opt);
105
+
106
+ TORCH_API TensorBase empty_strided_cpu(
107
+ IntArrayRef size,
108
+ IntArrayRef stride,
109
+ const TensorOptions& options);
110
+
111
+ TORCH_API TensorBase empty_meta(
112
+ IntArrayRef size,
113
+ ScalarType dtype,
114
+ std::optional<c10::MemoryFormat> memory_format_opt = std::nullopt);
115
+
116
+ TORCH_API TensorBase empty_meta(
117
+ IntArrayRef size,
118
+ std::optional<ScalarType> dtype_opt,
119
+ std::optional<Layout> layout_opt,
120
+ std::optional<Device> device_opt,
121
+ std::optional<bool> pin_memory_opt,
122
+ std::optional<c10::MemoryFormat> memory_format_opt);
123
+
124
+ TORCH_API TensorBase empty_symint_meta(
125
+ SymIntArrayRef size,
126
+ std::optional<ScalarType> dtype_opt,
127
+ std::optional<Layout> layout_opt,
128
+ std::optional<Device> device_opt,
129
+ std::optional<bool> pin_memory_opt,
130
+ std::optional<c10::MemoryFormat> memory_format_opt);
131
+
132
+ TORCH_API TensorBase empty_meta(IntArrayRef size, const TensorOptions& options);
133
+
134
+ TORCH_API TensorBase
135
+ empty_strided_meta(IntArrayRef size, IntArrayRef stride, ScalarType dtype);
136
+
137
+ TORCH_API TensorBase empty_strided_meta(
138
+ IntArrayRef size,
139
+ IntArrayRef stride,
140
+ std::optional<ScalarType> dtype_opt,
141
+ std::optional<Layout> layout_opt,
142
+ std::optional<Device> device_opt,
143
+ std::optional<bool> pin_memory_opt);
144
+
145
+ TORCH_API TensorBase empty_strided_meta(
146
+ IntArrayRef size,
147
+ IntArrayRef stride,
148
+ const TensorOptions& options);
149
+
150
+ TORCH_API TensorBase empty_strided_symint_meta(
151
+ SymIntArrayRef size,
152
+ SymIntArrayRef stride,
153
+ ScalarType dtype);
154
+
155
+ TORCH_API TensorBase empty_strided_symint_meta(
156
+ SymIntArrayRef size,
157
+ SymIntArrayRef stride,
158
+ std::optional<ScalarType> dtype_opt,
159
+ std::optional<Layout> layout_opt,
160
+ std::optional<Device> device_opt);
161
+
162
+ TORCH_API TensorBase empty_strided_symint_meta(
163
+ SymIntArrayRef size,
164
+ SymIntArrayRef stride,
165
+ const TensorOptions& options);
166
+
167
+ } // namespace at::detail
168
+
169
+ #else
170
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
171
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/ExpandBase.h ADDED
@@ -0,0 +1,35 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #include <ATen/core/TensorBase.h>
3
+
4
+ // Broadcasting utilities for working with TensorBase
5
+ namespace at {
6
+ namespace internal {
7
+ TORCH_API TensorBase expand_slow_path(const TensorBase& self, IntArrayRef size);
8
+ } // namespace internal
9
+
10
+ inline c10::MaybeOwned<TensorBase> expand_size(
11
+ const TensorBase& self,
12
+ IntArrayRef size) {
13
+ if (size.equals(self.sizes())) {
14
+ return c10::MaybeOwned<TensorBase>::borrowed(self);
15
+ }
16
+ return c10::MaybeOwned<TensorBase>::owned(
17
+ at::internal::expand_slow_path(self, size));
18
+ }
19
+ c10::MaybeOwned<TensorBase> expand_size(TensorBase&& self, IntArrayRef size) =
20
+ delete;
21
+
22
+ inline c10::MaybeOwned<TensorBase> expand_inplace(
23
+ const TensorBase& tensor,
24
+ const TensorBase& to_expand) {
25
+ return expand_size(to_expand, tensor.sizes());
26
+ }
27
+ c10::MaybeOwned<TensorBase> expand_inplace(
28
+ const TensorBase& tensor,
29
+ TensorBase&& to_expand) = delete;
30
+
31
+ } // namespace at
32
+
33
+ #else
34
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
35
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/ExpandUtils.h ADDED
@@ -0,0 +1,540 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+
4
+ #ifndef AT_PER_OPERATOR_HEADERS
5
+ #include <ATen/Functions.h>
6
+ #else
7
+ #include <ATen/ops/view.h>
8
+ #include <ATen/ops/view_copy.h>
9
+ #endif
10
+
11
+ #include <ATen/Tensor.h>
12
+ #include <ATen/core/DimVector.h>
13
+ #include <c10/util/Exception.h>
14
+ #include <c10/util/MaybeOwned.h>
15
+ #include <c10/util/irange.h>
16
+
17
+ #include <functional>
18
+ #include <tuple>
19
+ #include <utility>
20
+
21
+ namespace at {
22
+
23
+ TORCH_API std::vector<int64_t> infer_size(IntArrayRef a, IntArrayRef b);
24
+ TORCH_API std::vector<SymInt> infer_size_symint(
25
+ SymIntArrayRef a,
26
+ SymIntArrayRef b);
27
+ TORCH_API DimVector infer_size_dimvector(IntArrayRef a, IntArrayRef b);
28
+ TORCH_API SymDimVector
29
+ infer_size_symdimvector(SymIntArrayRef a, SymIntArrayRef b);
30
+
31
+ // Named type instead of a pair/tuple so that we can be sure to
32
+ // construct the vectors in place and get NRVO.
33
+ template <typename Container>
34
+ struct InferExpandGeometryResult {
35
+ Container sizes;
36
+ Container strides;
37
+ explicit InferExpandGeometryResult(size_t ndim)
38
+ : sizes(ndim), strides(ndim) {}
39
+ explicit InferExpandGeometryResult(IntArrayRef sizes_, size_t ndim)
40
+ : sizes(sizes_.begin(), sizes_.end()), strides(ndim) {}
41
+ };
42
+
43
+ TORCH_API std::tuple<std::vector<int64_t>, std::vector<int64_t>>
44
+ inferExpandGeometry(
45
+ IntArrayRef tensor_sizes,
46
+ IntArrayRef tensor_strides,
47
+ IntArrayRef sizes);
48
+
49
+ TORCH_API InferExpandGeometryResult<DimVector> inferExpandGeometry_dimvector(
50
+ IntArrayRef tensor_sizes,
51
+ IntArrayRef tensor_strides,
52
+ IntArrayRef sizes);
53
+
54
+ TORCH_API std::vector<int64_t> infer_dense_strides(
55
+ IntArrayRef tensor_sizes,
56
+ IntArrayRef tensor_strides);
57
+
58
+ // True if input shapes are expandable
59
+ // NOTE: infer_size did a similar check, please keep them sync if change is
60
+ // needed
61
+ inline bool are_expandable(IntArrayRef shape1, IntArrayRef shape2) {
62
+ size_t ndim1 = shape1.size();
63
+ size_t ndim2 = shape2.size();
64
+ size_t ndim = ndim1 < ndim2 ? ndim1 : ndim2;
65
+
66
+ for (int64_t i = static_cast<int64_t>(ndim) - 1; i >= 0; --i) {
67
+ if (shape1[--ndim1] == shape2[--ndim2] || shape1[ndim1] == 1 ||
68
+ shape2[ndim2] == 1) {
69
+ continue;
70
+ }
71
+ return false;
72
+ }
73
+ return true;
74
+ }
75
+
76
+ // avoid copy-construction of Tensor by using a reference_wrapper.
77
+ inline void check_defined(
78
+ std::initializer_list<std::reference_wrapper<const Tensor>> tensors,
79
+ const char* api_name) {
80
+ for (auto& t : tensors) {
81
+ if (!t.get().defined()) {
82
+ TORCH_CHECK(false, api_name, "(...) called with an undefined Tensor");
83
+ }
84
+ }
85
+ }
86
+
87
+ // NOTE [ ExpandUtils Borrowing ]
88
+ //
89
+ // Functions in ExpandUtils return `c10::MaybeOwned<Tensor>` because
90
+ // expansion may not actually be needed, in which case we can improve
91
+ // efficiency by returning
92
+ // `c10::MaybeOwned<Tensor>::borrowed(to_expand)`. However, this means
93
+ // that you need to be careful: the returned `c10::MaybeOwned<Tensor>`
94
+ // must not outlive the original `Tensor` object that `to_expand`
95
+ // referred to! The deleted rvalue reference overloads of these
96
+ // functions help with this by preventing trivial use of a temporary
97
+ // resulting from a function call, but it is still possible to make a
98
+ // mistake.
99
+
100
+ inline c10::MaybeOwned<Tensor> expand_inplace(
101
+ const Tensor& tensor,
102
+ const Tensor& to_expand) {
103
+ if (tensor.sym_sizes().equals(to_expand.sym_sizes())) {
104
+ return c10::MaybeOwned<Tensor>::borrowed(to_expand);
105
+ }
106
+ return c10::MaybeOwned<Tensor>::owned(
107
+ to_expand.expand_symint(tensor.sym_sizes()));
108
+ }
109
+
110
+ inline c10::MaybeOwned<Tensor> expand_inplace(
111
+ const Tensor& tensor,
112
+ Tensor&& to_expand) = delete;
113
+
114
+ inline c10::MaybeOwned<Tensor> expand_inplace(
115
+ const Tensor& tensor,
116
+ const Tensor& to_expand,
117
+ const char* api_name) {
118
+ check_defined({tensor, to_expand}, api_name);
119
+ return expand_inplace(tensor, to_expand);
120
+ }
121
+
122
+ inline c10::MaybeOwned<Tensor> expand_inplace(
123
+ const Tensor& tensor,
124
+ Tensor&& to_expand,
125
+ const char* api_name) = delete;
126
+
127
+ inline std::tuple<c10::MaybeOwned<Tensor>, c10::MaybeOwned<Tensor>>
128
+ expand_inplace(
129
+ const Tensor& tensor,
130
+ const Tensor& to_expand1,
131
+ const Tensor& to_expand2) {
132
+ if (tensor.sizes().equals(to_expand1.sizes()) &&
133
+ tensor.sizes().equals((to_expand2.sizes()))) {
134
+ return std::make_tuple(
135
+ c10::MaybeOwned<Tensor>::borrowed(to_expand1),
136
+ c10::MaybeOwned<Tensor>::borrowed(to_expand2));
137
+ }
138
+
139
+ return std::make_tuple(
140
+ c10::MaybeOwned<Tensor>::owned(to_expand1.expand(tensor.sizes())),
141
+ c10::MaybeOwned<Tensor>::owned(to_expand2.expand(tensor.sizes())));
142
+ }
143
+
144
+ inline std::tuple<c10::MaybeOwned<Tensor>, c10::MaybeOwned<Tensor>>
145
+ expand_inplace(
146
+ const Tensor& tensor,
147
+ Tensor&& to_expand1,
148
+ const Tensor& to_expand2) = delete;
149
+ inline std::tuple<c10::MaybeOwned<Tensor>, c10::MaybeOwned<Tensor>>
150
+ expand_inplace(
151
+ const Tensor& tensor,
152
+ const Tensor& to_expand1,
153
+ Tensor&& to_expand2) = delete;
154
+ inline std::tuple<c10::MaybeOwned<Tensor>, c10::MaybeOwned<Tensor>>
155
+ expand_inplace(const Tensor& tensor, Tensor&& to_expand1, Tensor&& to_expand2) =
156
+ delete;
157
+
158
+ inline std::tuple<c10::MaybeOwned<Tensor>, c10::MaybeOwned<Tensor>>
159
+ expand_inplace(
160
+ const Tensor& tensor,
161
+ const Tensor& to_expand1,
162
+ const Tensor& to_expand2,
163
+ const char* api_name) {
164
+ check_defined({tensor, to_expand1, to_expand2}, api_name);
165
+ return expand_inplace(tensor, to_expand1, to_expand2);
166
+ }
167
+
168
+ inline std::tuple<c10::MaybeOwned<Tensor>, c10::MaybeOwned<Tensor>>
169
+ expand_inplace(
170
+ const Tensor& tensor,
171
+ Tensor&& to_expand1,
172
+ const Tensor& to_expand2,
173
+ const char* api_name) = delete;
174
+ inline std::tuple<c10::MaybeOwned<Tensor>, c10::MaybeOwned<Tensor>>
175
+ expand_inplace(
176
+ const Tensor& tensor,
177
+ const Tensor& to_expand1,
178
+ Tensor&& to_expand2,
179
+ const char* api_name) = delete;
180
+ inline std::tuple<c10::MaybeOwned<Tensor>, c10::MaybeOwned<Tensor>>
181
+ expand_inplace(
182
+ const Tensor& tensor,
183
+ Tensor&& to_expand1,
184
+ Tensor&& to_expand2,
185
+ const char* api_name) = delete;
186
+
187
+ // See NOTE [ ExpandUtils Borrowing ] above for `MaybeOwned` explanation.
188
+ inline std::tuple<c10::MaybeOwned<Tensor>, c10::MaybeOwned<Tensor>>
189
+ expand_outplace(const Tensor& to_expand1, const Tensor& to_expand2) {
190
+ auto s1 = to_expand1.sym_sizes();
191
+ auto s2 = to_expand2.sym_sizes();
192
+ if (s1.equals(s2)) {
193
+ return std::make_tuple(
194
+ c10::MaybeOwned<Tensor>::borrowed(to_expand1),
195
+ c10::MaybeOwned<Tensor>::borrowed(to_expand2));
196
+ }
197
+
198
+ auto expanded_size = infer_size_symdimvector(s1, s2);
199
+ return std::make_tuple(
200
+ c10::MaybeOwned<Tensor>::owned(to_expand1.expand_symint(expanded_size)),
201
+ c10::MaybeOwned<Tensor>::owned(to_expand2.expand_symint(expanded_size)));
202
+ }
203
+
204
+ inline std::tuple<c10::MaybeOwned<Tensor>, c10::MaybeOwned<Tensor>>
205
+ expand_outplace(Tensor&& to_expand1, const Tensor& to_expand2) = delete;
206
+ inline std::tuple<c10::MaybeOwned<Tensor>, c10::MaybeOwned<Tensor>>
207
+ expand_outplace(const Tensor& to_expand1, Tensor&& to_expand2) = delete;
208
+ inline std::tuple<c10::MaybeOwned<Tensor>, c10::MaybeOwned<Tensor>>
209
+ expand_outplace(Tensor&& to_expand1, Tensor&& to_expand2) = delete;
210
+
211
+ inline std::tuple<c10::MaybeOwned<Tensor>, c10::MaybeOwned<Tensor>>
212
+ expand_outplace(
213
+ const Tensor& to_expand1,
214
+ const Tensor& to_expand2,
215
+ const char* api_name) {
216
+ check_defined({to_expand1, to_expand2}, api_name);
217
+ return expand_outplace(to_expand1, to_expand2);
218
+ }
219
+
220
+ inline std::tuple<c10::MaybeOwned<Tensor>, c10::MaybeOwned<Tensor>>
221
+ expand_outplace(
222
+ Tensor&& to_expand1,
223
+ const Tensor& to_expand2,
224
+ const char* api_name) = delete;
225
+ inline std::tuple<c10::MaybeOwned<Tensor>, c10::MaybeOwned<Tensor>>
226
+ expand_outplace(
227
+ const Tensor& to_expand1,
228
+ Tensor&& to_expand2,
229
+ const char* api_name) = delete;
230
+ inline std::tuple<c10::MaybeOwned<Tensor>, c10::MaybeOwned<Tensor>>
231
+ expand_outplace(
232
+ Tensor&& to_expand1,
233
+ Tensor&& to_expand2,
234
+ const char* api_name) = delete;
235
+
236
+ inline std::tuple<
237
+ c10::MaybeOwned<Tensor>,
238
+ c10::MaybeOwned<Tensor>,
239
+ c10::MaybeOwned<Tensor>>
240
+ expand_outplace(
241
+ const Tensor& to_expand1,
242
+ const Tensor& to_expand2,
243
+ const Tensor& to_expand3) {
244
+ if (to_expand1.sizes().equals(to_expand2.sizes()) &&
245
+ to_expand1.sizes().equals(to_expand3.sizes())) {
246
+ return std::make_tuple(
247
+ c10::MaybeOwned<Tensor>::borrowed(to_expand1),
248
+ c10::MaybeOwned<Tensor>::borrowed(to_expand2),
249
+ c10::MaybeOwned<Tensor>::borrowed(to_expand3));
250
+ }
251
+
252
+ auto expanded_size12 =
253
+ infer_size_dimvector(to_expand1.sizes(), to_expand2.sizes());
254
+ auto expanded_size =
255
+ infer_size_dimvector(expanded_size12, to_expand3.sizes());
256
+ return std::make_tuple(
257
+ c10::MaybeOwned<Tensor>::owned(to_expand1.expand(expanded_size)),
258
+ c10::MaybeOwned<Tensor>::owned(to_expand2.expand(expanded_size)),
259
+ c10::MaybeOwned<Tensor>::owned(to_expand3.expand(expanded_size)));
260
+ }
261
+
262
+ inline std::tuple<
263
+ c10::MaybeOwned<Tensor>,
264
+ c10::MaybeOwned<Tensor>,
265
+ c10::MaybeOwned<Tensor>>
266
+ expand_outplace(
267
+ Tensor&& to_expand1,
268
+ const Tensor& to_expand2,
269
+ const Tensor& to_expand3) = delete;
270
+ inline std::tuple<
271
+ c10::MaybeOwned<Tensor>,
272
+ c10::MaybeOwned<Tensor>,
273
+ c10::MaybeOwned<Tensor>>
274
+ expand_outplace(
275
+ const Tensor& to_expand1,
276
+ Tensor&& to_expand2,
277
+ const Tensor& to_expand3) = delete;
278
+ inline std::tuple<
279
+ c10::MaybeOwned<Tensor>,
280
+ c10::MaybeOwned<Tensor>,
281
+ c10::MaybeOwned<Tensor>>
282
+ expand_outplace(
283
+ Tensor&& to_expand1,
284
+ Tensor&& to_expand2,
285
+ const Tensor& to_expand3) = delete;
286
+ inline std::tuple<
287
+ c10::MaybeOwned<Tensor>,
288
+ c10::MaybeOwned<Tensor>,
289
+ c10::MaybeOwned<Tensor>>
290
+ expand_outplace(
291
+ const Tensor& to_expand1,
292
+ const Tensor& to_expand2,
293
+ Tensor&& to_expand3) = delete;
294
+ inline std::tuple<
295
+ c10::MaybeOwned<Tensor>,
296
+ c10::MaybeOwned<Tensor>,
297
+ c10::MaybeOwned<Tensor>>
298
+ expand_outplace(
299
+ Tensor&& to_expand1,
300
+ const Tensor& to_expand2,
301
+ Tensor&& to_expand3) = delete;
302
+ inline std::tuple<
303
+ c10::MaybeOwned<Tensor>,
304
+ c10::MaybeOwned<Tensor>,
305
+ c10::MaybeOwned<Tensor>>
306
+ expand_outplace(
307
+ const Tensor& to_expand1,
308
+ Tensor&& to_expand2,
309
+ Tensor&& to_expand3) = delete;
310
+ inline std::tuple<
311
+ c10::MaybeOwned<Tensor>,
312
+ c10::MaybeOwned<Tensor>,
313
+ c10::MaybeOwned<Tensor>>
314
+ expand_outplace(Tensor&& to_expand1, Tensor&& to_expand2, Tensor&& to_expand3) =
315
+ delete;
316
+
317
+ inline std::tuple<
318
+ c10::MaybeOwned<Tensor>,
319
+ c10::MaybeOwned<Tensor>,
320
+ c10::MaybeOwned<Tensor>>
321
+ expand_outplace(
322
+ const Tensor& to_expand1,
323
+ const Tensor& to_expand2,
324
+ const Tensor& to_expand3,
325
+ const char* api_name) {
326
+ check_defined({to_expand1, to_expand2, to_expand3}, api_name);
327
+ return expand_outplace(to_expand1, to_expand2, to_expand3);
328
+ }
329
+
330
+ inline std::tuple<
331
+ c10::MaybeOwned<Tensor>,
332
+ c10::MaybeOwned<Tensor>,
333
+ c10::MaybeOwned<Tensor>>
334
+ expand_outplace(
335
+ Tensor&& to_expand1,
336
+ const Tensor& to_expand2,
337
+ const Tensor& to_expand3,
338
+ const char* api_name) = delete;
339
+ inline std::tuple<
340
+ c10::MaybeOwned<Tensor>,
341
+ c10::MaybeOwned<Tensor>,
342
+ c10::MaybeOwned<Tensor>>
343
+ expand_outplace(
344
+ const Tensor& to_expand1,
345
+ Tensor&& to_expand2,
346
+ const Tensor& to_expand3,
347
+ const char* api_name) = delete;
348
+ inline std::tuple<
349
+ c10::MaybeOwned<Tensor>,
350
+ c10::MaybeOwned<Tensor>,
351
+ c10::MaybeOwned<Tensor>>
352
+ expand_outplace(
353
+ Tensor&& to_expand1,
354
+ Tensor&& to_expand2,
355
+ const Tensor& to_expand3,
356
+ const char* api_name) = delete;
357
+ inline std::tuple<
358
+ c10::MaybeOwned<Tensor>,
359
+ c10::MaybeOwned<Tensor>,
360
+ c10::MaybeOwned<Tensor>>
361
+ expand_outplace(
362
+ const Tensor& to_expand1,
363
+ const Tensor& to_expand2,
364
+ Tensor&& to_expand3,
365
+ const char* api_name) = delete;
366
+ inline std::tuple<
367
+ c10::MaybeOwned<Tensor>,
368
+ c10::MaybeOwned<Tensor>,
369
+ c10::MaybeOwned<Tensor>>
370
+ expand_outplace(
371
+ Tensor&& to_expand1,
372
+ const Tensor& to_expand2,
373
+ Tensor&& to_expand3,
374
+ const char* api_name) = delete;
375
+ inline std::tuple<
376
+ c10::MaybeOwned<Tensor>,
377
+ c10::MaybeOwned<Tensor>,
378
+ c10::MaybeOwned<Tensor>>
379
+ expand_outplace(
380
+ const Tensor& to_expand1,
381
+ Tensor&& to_expand2,
382
+ Tensor&& to_expand3,
383
+ const char* api_name) = delete;
384
+ inline std::tuple<
385
+ c10::MaybeOwned<Tensor>,
386
+ c10::MaybeOwned<Tensor>,
387
+ c10::MaybeOwned<Tensor>>
388
+ expand_outplace(
389
+ Tensor&& to_expand1,
390
+ Tensor&& to_expand2,
391
+ Tensor&& to_expand3,
392
+ const char* api_name) = delete;
393
+
394
+ inline c10::MaybeOwned<Tensor> expand_size(
395
+ const Tensor& to_expand,
396
+ IntArrayRef sizes) {
397
+ if (to_expand.sizes().equals(sizes)) {
398
+ return c10::MaybeOwned<Tensor>::borrowed(to_expand);
399
+ }
400
+
401
+ return c10::MaybeOwned<Tensor>::owned(to_expand.expand(sizes));
402
+ }
403
+
404
+ inline c10::MaybeOwned<Tensor> expand_size(
405
+ Tensor&& to_expand,
406
+ IntArrayRef sizes) = delete;
407
+
408
+ inline c10::MaybeOwned<Tensor> expand_size(
409
+ const Tensor& to_expand,
410
+ IntArrayRef sizes,
411
+ const char* api_name) {
412
+ check_defined({to_expand}, api_name);
413
+ return expand_size(to_expand, sizes);
414
+ }
415
+
416
+ inline c10::MaybeOwned<Tensor> expand_size(
417
+ Tensor&& to_expand,
418
+ IntArrayRef sizes,
419
+ const char* api_name) = delete;
420
+
421
+ inline std::vector<Tensor> expand_outplace(TensorList to_expand) {
422
+ // expands a list of Tensors; ignores undefined (null) tensors
423
+ bool first = true;
424
+ SymDimVector sizes;
425
+ for (const auto i : c10::irange(to_expand.size())) {
426
+ if (!to_expand[i].defined()) {
427
+ continue;
428
+ } else if (first) {
429
+ sizes = to_expand[i].sym_sizes();
430
+ first = false;
431
+ } else {
432
+ sizes = infer_size_symdimvector(sizes, to_expand[i].sym_sizes());
433
+ }
434
+ }
435
+
436
+ std::vector<Tensor> result(to_expand.size());
437
+ for (const auto i : c10::irange(to_expand.size())) {
438
+ if (!to_expand[i].defined()) {
439
+ continue;
440
+ } else if (to_expand[i].sym_sizes().equals(sizes)) {
441
+ result[i] = to_expand[i];
442
+ } else {
443
+ result[i] = to_expand[i].expand_symint(sizes);
444
+ }
445
+ }
446
+ return result;
447
+ }
448
+
449
+ template <typename T>
450
+ inline Tensor _sum_to(
451
+ Tensor tensor,
452
+ const c10::ArrayRef<T> shape,
453
+ bool always_return_non_view = false) {
454
+ if (shape.size() == 0) {
455
+ return tensor.sum();
456
+ }
457
+
458
+ auto sizes = at::symint::sizes<T>(tensor);
459
+ c10::SmallVector<int64_t, 8> reduce_dims;
460
+ const int64_t leading_dims = sizes.size() - shape.size();
461
+ for (const auto i : c10::irange(leading_dims)) {
462
+ reduce_dims.push_back(i);
463
+ }
464
+ for (int64_t i = leading_dims; i < static_cast<int64_t>(sizes.size()); ++i) {
465
+ if (TORCH_GUARD_OR_FALSE(sym_eq(shape[i - leading_dims], 1)) &&
466
+ TORCH_GUARD_OR_TRUE(sym_ne(sizes[i], 1))) {
467
+ reduce_dims.push_back(i);
468
+ } else {
469
+ // if we assume no reduction due to unbacked we ensure that at runtime.
470
+ TORCH_MAYBE_SYM_CHECK(
471
+ sym_eq(shape[i - leading_dims], sizes[i]),
472
+ "non-reduction path was assumed due to unbacked symbols expected those two sizes to be the same:",
473
+ shape[i - leading_dims],
474
+ ", ",
475
+ sizes[i])
476
+ }
477
+ }
478
+
479
+ if (!reduce_dims.empty()) {
480
+ tensor = tensor.sum(reduce_dims, /*keepdim=*/true);
481
+ }
482
+
483
+ if (always_return_non_view) {
484
+ // This is only actually used by the functionalization pass.
485
+ // We want to be able to guarantee that this function doesn't return a view
486
+ // of the input.
487
+ return leading_dims > 0 ? at::symint::view_copy<T>(tensor, shape)
488
+ : tensor.clone();
489
+ } else {
490
+ return leading_dims > 0 ? at::symint::view<T>(tensor, shape) : tensor;
491
+ }
492
+ }
493
+
494
+ inline Tensor sum_to(
495
+ Tensor tensor,
496
+ const c10::SymIntArrayRef shape,
497
+ bool always_return_non_view = false) {
498
+ return _sum_to(std::move(tensor), shape, always_return_non_view);
499
+ }
500
+
501
+ // Sums `tensor` repeatedly to produce a tensor of shape `shape`.
502
+ // Precondition: is_expandable_to(shape, tensor.sizes()) must be true
503
+ inline Tensor sum_to(
504
+ Tensor tensor,
505
+ const IntArrayRef shape,
506
+ bool always_return_non_view = false) {
507
+ return _sum_to(std::move(tensor), shape, always_return_non_view);
508
+ }
509
+
510
+ inline bool is_expandable_to(
511
+ SymIntArrayRef shape,
512
+ c10::SymIntArrayRef desired) {
513
+ size_t ndim = shape.size();
514
+ size_t target_dim = desired.size();
515
+ if (ndim > target_dim) {
516
+ return false;
517
+ }
518
+ for (const auto i : c10::irange(ndim)) {
519
+ const auto& size = shape[ndim - i - 1];
520
+ const auto& target = desired[target_dim - i - 1];
521
+ if (size != target && size != 1) {
522
+ return false;
523
+ }
524
+ }
525
+ return true;
526
+ }
527
+
528
+ inline bool is_expandable_to(IntArrayRef shape, IntArrayRef desired) {
529
+ auto sym_shape = c10::SymIntArrayRef(
530
+ reinterpret_cast<const c10::SymInt*>(shape.data()), shape.size());
531
+ auto sym_desired = c10::SymIntArrayRef(
532
+ reinterpret_cast<const c10::SymInt*>(desired.data()), desired.size());
533
+ return is_expandable_to(sym_shape, sym_desired);
534
+ }
535
+
536
+ } // namespace at
537
+
538
+ #else
539
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
540
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/Formatting.h ADDED
@@ -0,0 +1,6 @@
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #include <ATen/core/Formatting.h>
3
+
4
+ #else
5
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
6
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/FuncTorchTLS.h ADDED
@@ -0,0 +1,51 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+
4
+ #include <c10/macros/Macros.h>
5
+ #include <memory>
6
+
7
+ namespace at::functorch {
8
+
9
+ // NOTE [functorch TLS in pytorch/pytorch]
10
+ //
11
+ // functorch lives out-of-tree. However, it has some TLS that needs to be
12
+ // propagated. The solution for that is we store a pointer to the TLS
13
+ // inside pytorch/pytorch and extend FuncTorchTLSBase inside functorch to
14
+ // include whatever functorch needs.
15
+ //
16
+ // We need to store a pointer due to the indirection:
17
+ // inside functorch, we will create a subclass of FunctorchTLSBase called
18
+ // FuncTorchTLSImpl that actually contains metadata, like the DynamicLayerStack.
19
+ // FuncTorchTLSBase doesn't have any metadata because it hasn't been defined
20
+ // yet.
21
+ //
22
+ // Here in pytorch/pytorch, we will pass around FuncTorchTLSBase*, but inside
23
+ // functorch, we will assign a FuncTorchTLSImpl* to the FunctorchTLSBase*.
24
+ // We can't directly pass around FunctorchTLSBase (without a pointer) because
25
+ // FuncTorchTLSImpl does not fit inside a FuncTorchTLSBase by virtue of having
26
+ // more elements.
27
+ struct TORCH_API FuncTorchTLSBase {
28
+ virtual ~FuncTorchTLSBase() = default;
29
+ virtual std::unique_ptr<FuncTorchTLSBase> deepcopy() const = 0;
30
+
31
+ virtual int64_t checkSupportsSingleLevelAutogradFunction() const = 0;
32
+ virtual void checkSupportsCppAutogradFunction() const = 0;
33
+ virtual void checkSupportsInplaceRequiresGrad() const = 0;
34
+ virtual void checkSupportsRetainGrad() const = 0;
35
+ };
36
+
37
+ // returns deepcopy of the functorch tls
38
+ TORCH_API std::unique_ptr<FuncTorchTLSBase> getCopyOfFuncTorchTLS();
39
+
40
+ // sets the functorch tls. always does a deep copy.
41
+ TORCH_API void setFuncTorchTLS(
42
+ const std::shared_ptr<const FuncTorchTLSBase>& state);
43
+
44
+ // get a mutable reference to the functorch tls
45
+ TORCH_API std::unique_ptr<FuncTorchTLSBase>& functorchTLSAccessor();
46
+
47
+ } // namespace at::functorch
48
+
49
+ #else
50
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
51
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/FunctionalStorageImpl.h ADDED
@@ -0,0 +1,274 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+
4
+ #include <ATen/Tensor.h>
5
+
6
+ #include <utility>
7
+
8
+ namespace at::functionalization {
9
+
10
+ // See Note [Functionalization Pass In Core]
11
+
12
+ enum class InverseReturnMode {
13
+ /// Specifies that functional inverses should always return a view.
14
+ AlwaysView,
15
+ /// Specifies that functional inverses should always return a non-view / copy.
16
+ NeverView,
17
+ /// Specifies that functional inverses should return a view unless a (copying)
18
+ /// scatter
19
+ /// inverse exists, in which case that will be used instead.
20
+ /// This avoids as_strided() calls that can be difficult for subclasses to
21
+ /// handle.
22
+ ViewOrScatterInverse,
23
+ };
24
+
25
+ #define FUNCTIONALIZATION_VIEWMETA_NAME(TYPE) \
26
+ static const char* name() { \
27
+ return #TYPE; \
28
+ }
29
+
30
+ #define FUNCTIONALIZATION_VIEWMETA_SERIALIZABLE_TUPLE(...) \
31
+ using SerializableTuple = std::tuple<__VA_ARGS__>
32
+
33
+ // ViewMeta is a class used by the functionalization pass to navigate between
34
+ // a base tensor and a view tensor.
35
+ // For example, if I call `b = a.view1(...)`
36
+ // the functionalization pass will generate and store a ViewMeta specialization
37
+ // for `view1` operation on b that looks like:
38
+ //
39
+ // struct TORCH_API view1_ViewMeta : public ViewMeta {
40
+ // FUNCTIONALIZATION_VIEWMETA_NAME(view1_ViewMeta);
41
+ // FUNCTIONALIZATION_VIEWMETA_SERIALIZABLE_TUPLE(
42
+ // bool /* reapply_views */,
43
+ // const std::vector<int64_t>&);
44
+ //
45
+ // view1_ViewMeta(const SerializableTuple& tpl)
46
+ // : view1_ViewMeta(std::get<0>(tpl), std::get<1>(tpl)) {}
47
+ //
48
+ // view1_ViewMeta(bool reapply_views, const std::vector<int64_t>& size)
49
+ // : ViewMeta(/*has_symbolic_inputs=*/false),
50
+ // reapply_views(reapply_views),
51
+ // size(size) {}
52
+ //
53
+ // Tensor forward(const Tensor& base) override {
54
+ // return base.view1(...);
55
+ // }
56
+ //
57
+ // Tensor reverse(const Tensor& base, const Tensor& mutated_view) override {
58
+ // return at::functionalization::impl::view1_inverse(base, mutated_view,
59
+ // ...);
60
+ // }
61
+ //
62
+ // SerializableTuple to_serializable_tuple() {
63
+ // return std::make_tuple(reapply_views, size);
64
+ // }
65
+ //
66
+ // bool reapply_views;
67
+ // std::vector<int64_t> size;
68
+ // };
69
+ //
70
+ // The forward function describes how to replay view1 on a tensor.
71
+ //
72
+ // The reverse function describes how, given a tensor that is already a view,
73
+ // how to get the corresponding base tensor. See Note [Functionalization Pass:
74
+ // View Inverses] for details.
75
+ //
76
+ // `SerializedTuple` is a typedef that defines an `std::tuple<...>` type
77
+ // representing the `ViewMeta` instance state. Methods that take in/return such
78
+ // a type are used for supporting pickle serialization.
79
+ struct ViewMeta {
80
+ ViewMeta(
81
+ bool has_symbolic_inputs,
82
+ bool is_multi_output = false,
83
+ bool is_as_strided = false,
84
+ int64_t out_idx = 0)
85
+ : out_index(out_idx),
86
+ is_multi_output(is_multi_output),
87
+ is_as_strided(is_as_strided),
88
+ has_symbolic_inputs(has_symbolic_inputs) {}
89
+
90
+ virtual ~ViewMeta() = default;
91
+
92
+ virtual Tensor forward(const Tensor& base) = 0;
93
+ virtual Tensor reverse(const Tensor& base, const Tensor& mutated_view) = 0;
94
+
95
+ // See Note [out_idx in ViewMeta]
96
+ int64_t out_index;
97
+
98
+ // Tells us if this is a multi-output view
99
+ bool is_multi_output;
100
+
101
+ bool is_as_strided;
102
+
103
+ // Tells us if this view operation has any symbolic inputs
104
+ bool has_symbolic_inputs;
105
+
106
+ // Returns a new ViewMeta with the same forward/reverse
107
+ // functions, but a new out index.
108
+ //
109
+ // This method should be implemented by those `ViewMeta` that have more than
110
+ // one output.
111
+ virtual std::shared_ptr<ViewMeta> to_out_index(int64_t out_index) {
112
+ TORCH_CHECK_NOT_IMPLEMENTED(
113
+ false,
114
+ "ViewMeta::to_out_index not implemented. ",
115
+ "Likely because there's only one output.");
116
+ }
117
+ };
118
+
119
+ // FunctionalStorageImpl is a subclass of StorageImpl used by the
120
+ // functionalization pass. It has no underlying data (similar to meta storage).
121
+ // It also knows how to reflect mutations to tensors in the absence of a valid
122
+ // data pointer.
123
+ //
124
+ // A storage represents the state shared by (potentially multiple) views of the
125
+ // same tensor. For example, in the following code:
126
+ //
127
+ // b = a.view1(...)
128
+ // c = b.view2(...)
129
+ // b.add_(1)
130
+ // --> storage.add_update(b, {view1_meta})
131
+ //
132
+ // The call to add_(1) will result in a call to alias.add_update(b,
133
+ // {view1_meta}), queueing up the mutation from b onto the alias. Later, suppose
134
+ // c is used in an expression (e.g. you try to print c, or pass it to an
135
+ // operator). Doing so will involve "syncing" c. First we apply any pending
136
+ // updates to the alias, and then we regenerate c by replaying its views off of
137
+ // the updated alias. E.g:
138
+ //
139
+ // print(str(c))
140
+ // --> c.sync_()
141
+ // --> alias.apply_updates() // after this, the alias will be updated to
142
+ // reflect the mutation to b
143
+ struct TORCH_API FunctionalStorageImpl : public c10::StorageImpl {
144
+ public:
145
+ struct Update {
146
+ // NOLINTNEXTLINE(cppcoreguidelines-avoid-const-or-ref-data-members)
147
+ const at::Tensor new_val;
148
+ // NOLINTNEXTLINE(cppcoreguidelines-avoid-const-or-ref-data-members)
149
+ const std::vector<std::shared_ptr<ViewMeta>> view_metas;
150
+ };
151
+
152
+ explicit FunctionalStorageImpl(const Tensor& value);
153
+
154
+ void add_update(
155
+ const Tensor& updated_val,
156
+ const std::vector<std::shared_ptr<ViewMeta>>& view_metas);
157
+ bool apply_updates();
158
+ const Tensor& base() {
159
+ return base_;
160
+ }
161
+ size_t generation() const {
162
+ return generation_;
163
+ }
164
+ void freeze() {
165
+ frozen_ = true;
166
+ }
167
+
168
+ c10::SymInt get_storage_size(bool before) {
169
+ if (before) {
170
+ return original_storage_size_;
171
+ } else {
172
+ return curr_storage_size_;
173
+ }
174
+ }
175
+
176
+ ~FunctionalStorageImpl() override = default;
177
+
178
+ uint64_t mutation_counter() {
179
+ return mutation_counter_;
180
+ }
181
+ void mark_mutation() {
182
+ mutation_counter_++;
183
+ }
184
+ void mark_mutation_during_no_grad_or_inference_mode() {
185
+ mutation_counter_during_no_grad_or_inference_mode_++;
186
+ }
187
+ void mark_mutation_hidden_from_autograd() {
188
+ mutation_counter_hidden_from_autograd_++;
189
+ }
190
+
191
+ bool are_all_mutations_under_no_grad_or_inference_mode() const {
192
+ auto non_autograd_mutations =
193
+ mutation_counter_during_no_grad_or_inference_mode_ +
194
+ mutation_counter_hidden_from_autograd_;
195
+ // The <= is because both counters will technically be incremented, if we
196
+ // perform e.g. a triton kernel mutation under no_grad
197
+ return mutation_counter_ <= non_autograd_mutations;
198
+ }
199
+
200
+ bool are_all_mutations_hidden_from_autograd() const {
201
+ // mutations under no_grad / inference_mode are technically not hidden from
202
+ // autograd - they change the version counter
203
+ return mutation_counter_ <= mutation_counter_hidden_from_autograd_;
204
+ }
205
+
206
+ void mark_inductor_storage_resize(c10::SymInt new_size) {
207
+ inductor_storage_resized_ = true;
208
+ curr_storage_size_ = std::move(new_size);
209
+ inductor_storage_resized_counter_++;
210
+ }
211
+
212
+ bool was_inductor_storage_resized() {
213
+ return inductor_storage_resized_;
214
+ }
215
+
216
+ uint64_t inductor_storage_resized_counter() {
217
+ return inductor_storage_resized_counter_;
218
+ }
219
+
220
+ private:
221
+ // NB: base_ should always point to a tensor BELOW the current
222
+ // functionalization layer. This is mainly to avoid reference cycles. e.g.
223
+ // given `b = a.view(...)` Both a.storage_ and b.storage_ are a
224
+ // FunctionStorageImpl containing an Walualias, with contains a Tensor
225
+ // `base_`. In this case (where a and b are FunctionalTensorWrapper's), base_
226
+ // should point not to a, but to a's unwrapped value, a.value_` See Note
227
+ // [Functionalization: Walualias Removal] for a diagram that shows this
228
+ // visually.
229
+ at::Tensor base_;
230
+ std::vector<Update> updates_;
231
+ // generation_ gets incremented every time a mutation is queued onto the
232
+ // alias. It is used to determine if a given tensor is "up to date", or if it
233
+ // needs to be regenerated from the alias.
234
+ size_t generation_ = 0;
235
+ // If frozen, no more mutations are allowed on this storage. Once frozen, a
236
+ // storage cannot be unfrozen.
237
+ bool frozen_ = false;
238
+
239
+ // These mutation counters are bumped on the storage
240
+ // whenever a FunctionalTensorWrapper experiences a mutation.
241
+ // When the mutation is under no_grad, or comes from a triton kernel, we also
242
+ // bump the corresponding during_no_grad or hidden_from_autograd counters. Why
243
+ // do we need to detect these two situations separately from "normal" input
244
+ // mutations? (1) "normal" input mutations can mutate autograd metadata like
245
+ // .grad_fn,
246
+ // in which case they need to be replayed outside of the compiled graph
247
+ // (2) "no_grad" input mutations are generally safe to keep in the graph (and
248
+ // compile),
249
+ // but they bump the tensor's VC, so we need to mark_dirty() on the inputs
250
+ // in torch.compile
251
+ // (3) mutations that are fully hidden from autograd (e.g. from a triton
252
+ // kernel)
253
+ // do not mutate any autograd state, and be fully kept in the graph
254
+ // When we detect that an input was mutated, we need to be able to tell if:
255
+ // (1) all of the mutations were from triton kernels
256
+ // (2) all of the mutations were under no_grad
257
+ uint64_t mutation_counter_during_no_grad_or_inference_mode_ = 0;
258
+ uint64_t mutation_counter_ = 0;
259
+ uint64_t mutation_counter_hidden_from_autograd_ = 0;
260
+
261
+ // Used to tell if:
262
+ // (1) There were any storage resizes on a graph input
263
+ // (2) The original/curr storage size tell us if these resizes result in a nop
264
+ bool inductor_storage_resized_ = false;
265
+ uint64_t inductor_storage_resized_counter_ = 0;
266
+ c10::SymInt original_storage_size_;
267
+ c10::SymInt curr_storage_size_;
268
+ };
269
+
270
+ } // namespace at::functionalization
271
+
272
+ #else
273
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
274
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/FunctionalTensorWrapper.h ADDED
@@ -0,0 +1,476 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+
3
+ #pragma once
4
+
5
+ #include <ATen/ArrayRef.h>
6
+ #include <ATen/FunctionalStorageImpl.h>
7
+ #include <ATen/core/IListRef.h>
8
+ #include <ATen/core/List.h>
9
+ #include <ATen/core/boxing/BoxedKernel.h>
10
+ #include <ATen/core/boxing/impl/boxing.h>
11
+ #include <ATen/core/dispatch/Dispatcher.h>
12
+
13
+ #include <c10/core/DispatchKey.h>
14
+
15
+ namespace at {
16
+
17
+ // Note [Functionalization Pass In Core]
18
+ // The Functionalization pass is used to remove aliasing from a pytorch program.
19
+ //
20
+ // This is useful for backends that don't support aliasing, like XLA and Vulkan.
21
+ // It's also necessary in order to remove mutation from a program, which is
22
+ // needed in Functorch.
23
+ //
24
+ // Consider this program:
25
+ // a = torch.ones(...)
26
+ // b = a.view(...)
27
+ // b.add_(1)
28
+ //
29
+ // In this program, b is meant to alias with a due to the use of view(). At the
30
+ // end of the program, both a and b are full of 2's. However, backends that
31
+ // don't support aliasing aren't able to correctly implement the view()
32
+ // operator. Instead, they can opt into the Functionalization pass, which will
33
+ // sit between the user and the backend, and provide the necessary aliasing
34
+ // logic.
35
+ //
36
+ // The functionalization pass will turn the above program into a slightly
37
+ // different program that has the same semantics, transparently to the user,
38
+ // that backends like XLA/Vulkan are able to implement a = torch.ones(...) b =
39
+ // a.view_copy(...) # view() replaced with view_copy(). Backends like
40
+ // XLA/Vulkan can implement this! b.add_(1) a.add_(1) # Our functionalization
41
+ // pass machinery knows that a and b are aliased - it applies b's mutation to a
42
+ // too.
43
+ //
44
+ // So, how does the functionalization pass keep track of which tensors are
45
+ // aliased? The pass works by wrapping EVERY tensor in the program inside of a
46
+ // FunctionalTensorWrapper, which knows about its alias'd tensors.
47
+ //
48
+ // See Note [Functionalization: Alias Removal] for details on the aliasing
49
+ // machinery. See Note [Functionalization: Mutation Removal] for details on
50
+ // mutation removal.
51
+ struct TORCH_API FunctionalTensorWrapper : public c10::TensorImpl {
52
+ explicit FunctionalTensorWrapper(const Tensor& value);
53
+ // Additional constructor to create a FunctionalTensorWrapper directly from an
54
+ // underlying tensor that was created from a view. For example, the code b =
55
+ // a.view1() will generate a constructor call to FunctionalTensorWrapper(b, a,
56
+ // view1_meta)
57
+ explicit FunctionalTensorWrapper(
58
+ const Tensor& view_value,
59
+ const FunctionalTensorWrapper* base,
60
+ const std::shared_ptr<functionalization::ViewMeta>& meta);
61
+
62
+ // Get the underlying, actual tensor, that doesn't know anything about
63
+ // functionalization.
64
+ const Tensor& value() const {
65
+ return value_;
66
+ }
67
+ // The concept of "level" is only ever important to functorch; it's exposed
68
+ // here as more of a hook for functorch to use.
69
+ int64_t level() const {
70
+ return level_;
71
+ }
72
+ void set_level(int64_t level) {
73
+ level_ = level;
74
+ }
75
+ bool has_metadata_mutation() const {
76
+ return has_metadata_mutation_;
77
+ }
78
+ uint64_t mutation_counter() const {
79
+ return functional_storage_impl()->mutation_counter();
80
+ }
81
+ void mark_mutation() {
82
+ functional_storage_impl()->mark_mutation();
83
+ }
84
+ // Denotes a mutation that's hidden from autograd,
85
+ // e.g. for the purposes of passing a tensor to a triton kernel
86
+ void mark_mutation_hidden_from_autograd() {
87
+ functional_storage_impl()->mark_mutation_hidden_from_autograd();
88
+ }
89
+ void mark_mutation_during_no_grad_or_inference_mode() {
90
+ functional_storage_impl()->mark_mutation_during_no_grad_or_inference_mode();
91
+ }
92
+ // Are all the mutations happening to the tensor hidden from autograd
93
+ bool are_all_mutations_hidden_from_autograd() const {
94
+ return functional_storage_impl()->are_all_mutations_hidden_from_autograd();
95
+ }
96
+ // Did all mutations happen under no_grad or inference_mode
97
+ // (We also need to ignore mutations fully hidden from autograd here)
98
+ bool are_all_mutations_under_no_grad_or_inference_mode() const {
99
+ return functional_storage_impl()
100
+ ->are_all_mutations_under_no_grad_or_inference_mode();
101
+ }
102
+
103
+ void maybe_mark_symbolic(functionalization::ViewMeta* meta) {
104
+ is_symbolic_ = is_symbolic_ | meta->has_symbolic_inputs;
105
+ }
106
+
107
+ bool is_symbolic() const {
108
+ return is_symbolic_;
109
+ }
110
+
111
+ // Retrieves the ViewMeta sequence of this tensor.
112
+ const std::vector<std::shared_ptr<functionalization::ViewMeta>>& view_metas()
113
+ const;
114
+
115
+ // Sync's the underlying tensor with its alias, if it's out of date. This
116
+ // involves two steps: 1) Apply any pending updates/mutations to the alias 2)
117
+ // Replay the views (if any) to regenerate the current tensor off of the
118
+ // updated alias.
119
+ void sync_();
120
+ // Performs step (1) of the sync. This is its own public API because it's
121
+ // needed by view_inplace ops like transpose_. See Note [Functionalization
122
+ // Pass - Inplace View Ops]
123
+ void regenerate_from_base();
124
+ // Performs step (2) of the sync. This is its own public API because it's
125
+ // needed by functorch. functorch wants to make sure that all input tensors to
126
+ // a functionalized program have been properly synced so it can properly
127
+ // propagate mutations to inputs. It can't just call sync_(), because the
128
+ // FunctionalTensorWrapper will look like it has no aliases and sync_ will be
129
+ // a noop. We use the reference count on storage_ to determine if the wrapper
130
+ // is aliased, and by the time functorch is ready to propagate updates to
131
+ // inputs, any intermediate views of the input created by the program will
132
+ // have been deallocated. This function also returns whether or not the base
133
+ // actually had any updates to apply.
134
+ bool apply_updates();
135
+ // Takes the current state of value_ and snapshots it, sending it as a pending
136
+ // update to the alias.
137
+ void commit_update();
138
+ // When any tensor is mutated, the tensor increments its alias's "generation".
139
+ // Separately, each tensor maintains its own "generation" counter, which is
140
+ // used to determine if it's up-to-date with its alias. The act of syncing a
141
+ // tensor will set a tensor's generation equal to its alias's generation.
142
+ bool is_up_to_date() const;
143
+ // Freezes the storage of this tensor, preventing subsequent mutations
144
+ void freeze_storage() const;
145
+ // Every FunctionalTensorWrapper contains a vector<ViewMeta> objects
146
+ // describing the series of view ops that ran to generate the current tensor
147
+ // from the base tensor. This method is used by inplace-view ops like
148
+ // transpose_. It appends a ViewMeta to the existing stack, and refreshes the
149
+ // tensor by replaying the views off of the alias.
150
+ void mutate_view_meta(
151
+ const std::shared_ptr<at::functionalization::ViewMeta>& meta);
152
+
153
+ // Custom implementation of self.set_(src)
154
+ void set__impl(const FunctionalTensorWrapper* other);
155
+
156
+ // Custom implementation of resize_storage_bytes_(self, new_size)
157
+ void storage_resize_(const c10::SymInt& new_size);
158
+
159
+ // Returns whether the current tensor's data was ever mutated
160
+ bool has_data_mutation();
161
+ //
162
+ // Returns whether the current FunctionalTensorWrapper
163
+ // experienced a set_() call.
164
+ bool was_storage_changed() {
165
+ return was_storage_changed_;
166
+ }
167
+
168
+ void mark_storage_changed() {
169
+ was_storage_changed_ = true;
170
+ storage_changed_counter_++;
171
+ }
172
+
173
+ uint64_t storage_changed_counter() {
174
+ return storage_changed_counter_;
175
+ }
176
+
177
+ // A FunctionalTensor is considered a base if its not a view of another
178
+ // tensor.
179
+ bool isBaseTensor() const {
180
+ return view_metas_.empty();
181
+ }
182
+
183
+ c10::SymInt get_storage_size(bool before) {
184
+ return functional_storage_impl()->get_storage_size(before);
185
+ }
186
+
187
+ // Returns whether the FunctionalTensor experienced an
188
+ // untyped_storage().resize_() call
189
+ bool was_inductor_storage_resized() {
190
+ return functional_storage_impl()->was_inductor_storage_resized();
191
+ }
192
+
193
+ bool inductor_storage_resized_counter() {
194
+ return functional_storage_impl()->inductor_storage_resized_counter();
195
+ }
196
+ // The functionalization pass can be used to remove mutations.
197
+ // It does so by replacing any mutation op with it's corresponding
198
+ // out-of-place op, followed by a call to replace_(). e.g:
199
+ //
200
+ // a.add_(1)
201
+ //
202
+ // will turn into:
203
+ //
204
+ // tmp = a.add(1)
205
+ // a.replace_(tmp)
206
+ //
207
+ // replace_() swaps out the wrapped tensor, value_, with tmp.
208
+ void replace_(const Tensor& other, bool from_lazy_regenerate = false);
209
+
210
+ bool is_multi_output_view() {
211
+ return is_multi_output_view_;
212
+ }
213
+
214
+ // See Note[resize_() in functionalization pass]
215
+ void maybe_replace_storage(const Tensor& other);
216
+
217
+ // Replaces the storage with a new functional storage,
218
+ // and clears the view_metas_ stack.
219
+ // WARNING: Calling this function will sever the aliasing relationship between
220
+ // the current FunctionalTensorWrapper and any of its outstanding aliases.
221
+ // Please only call if you know what you're doing.
222
+ void _unsafe_reset_storage();
223
+
224
+ c10::intrusive_ptr<TensorImpl> shallow_copy_and_detach(
225
+ const c10::VariableVersion& version_counter,
226
+ bool allow_tensor_metadata_change) const override;
227
+
228
+ c10::intrusive_ptr<TensorImpl> shallow_copy_and_detach(
229
+ c10::VariableVersion&& version_counter,
230
+ bool allow_tensor_metadata_change) const override;
231
+
232
+ ~FunctionalTensorWrapper() override = default;
233
+
234
+ // FunctionalTensorWrapper overrides all custom size/stride function,
235
+ // so that if the inner tensor has a custom implementation
236
+ // we make sure to call that implementation.
237
+ at::IntArrayRef sizes_custom() const override;
238
+ at::IntArrayRef strides_custom() const override;
239
+ int64_t dim_custom() const override;
240
+ int64_t numel_custom() const override;
241
+ c10::SymBool sym_is_contiguous_custom(
242
+ at::MemoryFormat memory_format) const override;
243
+ c10::SymIntArrayRef sym_sizes_custom() const override;
244
+ c10::SymInt sym_size_custom(int64_t d) const override;
245
+ c10::SymIntArrayRef sym_strides_custom() const override;
246
+ c10::SymInt sym_storage_offset_custom() const override;
247
+ c10::Device device_custom() const override;
248
+ c10::Layout layout_impl() const override;
249
+
250
+ private:
251
+ const char* tensorimpl_type_name() const override;
252
+ void set_constructor_metadata();
253
+ functionalization::FunctionalStorageImpl* functional_storage_impl() const;
254
+
255
+ // This is used to re-implement shallow_copy_and_detach for
256
+ // FunctionalTensorWrapper. The implementation is identical, but we just need
257
+ // to return a subclass instead of a plain TensorImpl.
258
+ // TODO: maybe it's possible to arrange for that to happen automatically
259
+ // without an override here?
260
+ template <typename VariableVersion>
261
+ c10::intrusive_ptr<TensorImpl> shallow_copy_and_detach_core(
262
+ VariableVersion&& version_counter,
263
+ bool allow_tensor_metadata_change) const;
264
+
265
+ void shallow_copy_from(const c10::intrusive_ptr<TensorImpl>& impl) override;
266
+ void copy_tensor_metadata_and_refresh(
267
+ const FunctionalTensorWrapper* src_impl,
268
+ FunctionalTensorWrapper* dest_impl,
269
+ const c10::VariableVersion& version_counter,
270
+ bool allow_tensor_metadata_change) const;
271
+
272
+ // Note that value is not taken by reference: internally, the wrapper will
273
+ // change the value tensor that it points to over time.
274
+ Tensor value_;
275
+ int64_t level_{};
276
+ // These two counters are used for identifying
277
+ // whether all the mutations on a given tensor are hidden from autograd or
278
+ // not. If we have an input mutation that is hidden from autograd, then once
279
+ // we convert the input mutation to a copy_() we know it will be safe to hide
280
+ // the copy_() from autograd as well.
281
+ bool has_metadata_mutation_ = false;
282
+ bool is_multi_output_view_ = false;
283
+ // Did the tensor experience a set_() call.
284
+ bool was_storage_changed_ = false;
285
+ uint64_t storage_changed_counter_ = 0;
286
+ // Did the tensor experience any view operation with symbolic int.
287
+ bool is_symbolic_ = false;
288
+
289
+ size_t generation_ = 0;
290
+ std::vector<std::shared_ptr<at::functionalization::ViewMeta>> view_metas_;
291
+
292
+ protected:
293
+ static void copy_tensor_metadata(
294
+ const FunctionalTensorWrapper* src_impl,
295
+ FunctionalTensorWrapper* dest_impl,
296
+ const c10::VariableVersion& version_counter,
297
+ bool allow_tensor_metadata_change);
298
+ };
299
+
300
+ // Utility functions for the functionalization pass.
301
+
302
+ namespace functionalization {
303
+ namespace impl {
304
+
305
+ inline FunctionalTensorWrapper* unsafeGetFunctionalWrapper(
306
+ const Tensor& tensor) {
307
+ auto functional_impl =
308
+ static_cast<FunctionalTensorWrapper*>(tensor.unsafeGetTensorImpl());
309
+ TORCH_INTERNAL_ASSERT_DEBUG_ONLY(functional_impl != nullptr);
310
+ return functional_impl;
311
+ }
312
+
313
+ TORCH_API bool isBaseTensor(const at::Tensor& tensor);
314
+
315
+ TORCH_API bool isFunctionalTensor(const at::Tensor& tensor);
316
+ TORCH_API bool isFunctionalTensor(const std::optional<Tensor>& t);
317
+ TORCH_API bool isFunctionalTensor(
318
+ const c10::List<std::optional<Tensor>>& t_list);
319
+ TORCH_API bool isFunctionalTensor(ITensorListRef list);
320
+
321
+ TORCH_API Tensor to_functional_tensor(const Tensor& tensor);
322
+ TORCH_API std::optional<Tensor> to_functional_tensor(
323
+ const std::optional<Tensor>& tensor);
324
+ TORCH_API c10::List<std::optional<Tensor>> to_functional_tensor(
325
+ const c10::List<std::optional<Tensor>>& t_list);
326
+ TORCH_API std::vector<Tensor> to_functional_tensor(ITensorListRef t_list);
327
+
328
+ TORCH_API void freeze_functional_tensor(const Tensor& tensor);
329
+
330
+ TORCH_API Tensor
331
+ from_functional_tensor(const Tensor& tensor, bool assert_functional = true);
332
+ TORCH_API std::optional<Tensor> from_functional_tensor(
333
+ const std::optional<Tensor>& t,
334
+ bool assert_functional = true);
335
+ TORCH_API c10::List<std::optional<Tensor>> from_functional_tensor(
336
+ const c10::List<std::optional<Tensor>>& t_list);
337
+ TORCH_API std::vector<Tensor> from_functional_tensor(ITensorListRef t_list);
338
+
339
+ TORCH_API void sync(const at::Tensor& t);
340
+ TORCH_API void sync(const std::optional<Tensor>& t);
341
+ TORCH_API void sync(const c10::List<std::optional<Tensor>>& t_list);
342
+ TORCH_API void sync(ITensorListRef t_list);
343
+
344
+ TORCH_API void replace_(const Tensor& functional_tensor, const Tensor& other);
345
+ TORCH_API void replace_(
346
+ const ITensorListRef functional_tensor,
347
+ ITensorListRef other);
348
+
349
+ TORCH_API void commit_update(const Tensor& functional_tensor);
350
+ TORCH_API void commit_update(ITensorListRef functional_tensor);
351
+
352
+ TORCH_API void unsafe_reset_storage(const Tensor& functional_tensor);
353
+
354
+ TORCH_API void mark_mutation_hidden_from_autograd(
355
+ const Tensor& functional_tensor);
356
+
357
+ TORCH_API bool are_all_mutations_hidden_from_autograd(
358
+ const Tensor& functional_tensor);
359
+
360
+ TORCH_API bool are_all_mutations_under_no_grad_or_inference_mode(
361
+ const Tensor& functional_tensor);
362
+
363
+ // These two methods are XLA-specific logic and are no-ops
364
+ // for the normal functionalization flow.
365
+ TORCH_API void propagate_xla_data(
366
+ const Tensor& functional_tensor,
367
+ const Tensor& other);
368
+ TORCH_API void propagate_xla_data(
369
+ const ITensorListRef functional_tensor,
370
+ ITensorListRef other);
371
+
372
+ TORCH_API void propagate_xla_data_direct(
373
+ const Tensor& tensor,
374
+ const Tensor& other);
375
+ TORCH_API void propagate_xla_data_direct(
376
+ const ITensorListRef tensor,
377
+ ITensorListRef other);
378
+
379
+ Tensor create_functional_tensor_with_view_meta(
380
+ const Tensor& view_to_wrap,
381
+ const Tensor& base,
382
+ const std::shared_ptr<functionalization::ViewMeta>& meta,
383
+ int64_t out_idx = 0);
384
+ std::vector<Tensor> create_functional_tensor_with_view_meta(
385
+ ITensorListRef view_to_wrap,
386
+ const Tensor& base,
387
+ const std::shared_ptr<functionalization::ViewMeta>& meta);
388
+
389
+ void mutate_view_meta(
390
+ const Tensor& self,
391
+ const std::shared_ptr<functionalization::ViewMeta>& meta);
392
+
393
+ TORCH_API Tensor apply_view_meta_sequence(
394
+ const Tensor& base,
395
+ const std::vector<std::shared_ptr<functionalization::ViewMeta>>& sequence);
396
+
397
+ void set_sizes_strides_offset(const Tensor& out, const Tensor& meta_out);
398
+ void set_sizes_strides_offset(
399
+ const std::vector<Tensor>& outs,
400
+ const std::vector<Tensor>& meta_outs);
401
+
402
+ // ~~~~~ TLS used in functionalization ~~~~~
403
+
404
+ TORCH_API bool getFunctionalizationReapplyViewsTLS();
405
+ TORCH_API void setFunctionalizationReapplyViewsTLS(bool reapply_views);
406
+
407
+ class TORCH_API FunctionalizationReapplyViewsGuard {
408
+ public:
409
+ FunctionalizationReapplyViewsGuard(bool reapply_views)
410
+ : prev_(getFunctionalizationReapplyViewsTLS()) {
411
+ setFunctionalizationReapplyViewsTLS(reapply_views);
412
+ }
413
+
414
+ ~FunctionalizationReapplyViewsGuard() {
415
+ setFunctionalizationReapplyViewsTLS(prev_);
416
+ }
417
+
418
+ FunctionalizationReapplyViewsGuard(
419
+ const FunctionalizationReapplyViewsGuard&) = delete;
420
+ FunctionalizationReapplyViewsGuard operator=(
421
+ const FunctionalizationReapplyViewsGuard&) = delete;
422
+ FunctionalizationReapplyViewsGuard(FunctionalizationReapplyViewsGuard&&) =
423
+ delete;
424
+ FunctionalizationReapplyViewsGuard operator=(
425
+ FunctionalizationReapplyViewsGuard&&) = delete;
426
+
427
+ private:
428
+ bool prev_;
429
+ };
430
+
431
+ } // namespace impl
432
+
433
+ // Helper function to call an out-of-place composite aten kernel that may use
434
+ // mutations / views internally, and functionalize them.
435
+ TORCH_API void functionalize_op_helper(
436
+ const c10::OperatorHandle& op,
437
+ torch::jit::Stack* stack);
438
+
439
+ template <class Op, bool symint, class ReturnType, class... ParameterTypes>
440
+ struct _functionalize_aten_op final {};
441
+
442
+ template <class Op, bool symint, class ReturnType, class... ParameterTypes>
443
+ struct _functionalize_aten_op<Op, symint, ReturnType(ParameterTypes...)> final {
444
+ static ReturnType call(
445
+ typename c10::maybe_keep_symint<symint, ParameterTypes>::type... args) {
446
+ using FuncType = ReturnType(
447
+ typename c10::maybe_keep_symint<symint, ParameterTypes>::type...);
448
+ auto op = c10::Dispatcher::singleton()
449
+ .findSchemaOrThrow(
450
+ (const char*)Op::name, (const char*)Op::overload_name)
451
+ .typed<FuncType>();
452
+
453
+ return c10::impl::BoxedKernelWrapper<FuncType>::call(
454
+ c10::BoxedKernel::makeFromFunction<functionalize_op_helper>(),
455
+ op,
456
+ // BoxedKernelWrapper knows to ignore this keyset argument,
457
+ // because functionalize_op_helper doesn't take in a DispatchKeySet
458
+ c10::DispatchKeySet(),
459
+ args...);
460
+ }
461
+ };
462
+
463
+ template <class Op>
464
+ using functionalize_aten_op =
465
+ _functionalize_aten_op<Op, false, typename Op::schema>;
466
+
467
+ template <class Op>
468
+ using functionalize_aten_op_symint =
469
+ _functionalize_aten_op<Op, true, typename Op::schema>;
470
+
471
+ } // namespace functionalization
472
+ } // namespace at
473
+
474
+ #else
475
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
476
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/FunctionalizeFallbackKernel.h ADDED
@@ -0,0 +1,63 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+
4
+ #include <ATen/FunctionalStorageImpl.h>
5
+
6
+ namespace at::functionalization {
7
+
8
+ // `ViewMeta` implementation for `resize_` operation.
9
+ struct TORCH_API resize__ViewMeta : public ViewMeta {
10
+ FUNCTIONALIZATION_VIEWMETA_NAME(resize__ViewMeta)
11
+ FUNCTIONALIZATION_VIEWMETA_SERIALIZABLE_TUPLE(
12
+ bool /* reapply_views */,
13
+ const std::vector<int64_t>&);
14
+
15
+ resize__ViewMeta(const SerializableTuple& tpl)
16
+ : resize__ViewMeta(std::get<0>(tpl), std::get<1>(tpl)) {}
17
+
18
+ resize__ViewMeta(bool reapply_views, const std::vector<int64_t>& size)
19
+ : ViewMeta(/*has_symbolic_inputs=*/false),
20
+ reapply_views(reapply_views),
21
+ size(size) {}
22
+
23
+ Tensor forward(const Tensor& base) override;
24
+ Tensor reverse(const Tensor& base, const Tensor& mutated_view) override;
25
+
26
+ SerializableTuple to_serializable_tuple() {
27
+ return std::make_tuple(reapply_views, size);
28
+ }
29
+
30
+ bool reapply_views;
31
+ std::vector<int64_t> size;
32
+ };
33
+
34
+ // `ViewMeta` implementation for `_unsafe_view` operation.
35
+ struct TORCH_API _unsafe_view_ViewMeta : public ViewMeta {
36
+ FUNCTIONALIZATION_VIEWMETA_NAME(_unsafe_view_ViewMeta)
37
+ FUNCTIONALIZATION_VIEWMETA_SERIALIZABLE_TUPLE(
38
+ bool /* has_symbolic_inputs */,
39
+ const std::vector<c10::SymInt>&);
40
+
41
+ _unsafe_view_ViewMeta(const SerializableTuple& tpl)
42
+ : _unsafe_view_ViewMeta(std::get<0>(tpl), std::get<1>(tpl)) {}
43
+
44
+ _unsafe_view_ViewMeta(
45
+ bool has_symbolic_inputs,
46
+ const std::vector<c10::SymInt>& size)
47
+ : ViewMeta(has_symbolic_inputs), size(size) {}
48
+
49
+ Tensor forward(const Tensor& base) override;
50
+ Tensor reverse(const Tensor& base, const Tensor& mutated_view) override;
51
+
52
+ SerializableTuple to_serializable_tuple() {
53
+ return std::make_tuple(has_symbolic_inputs, size);
54
+ }
55
+
56
+ std::vector<c10::SymInt> size;
57
+ };
58
+
59
+ } // namespace at::functionalization
60
+
61
+ #else
62
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
63
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
miniconda3/envs/ladir/lib/python3.10/site-packages/torch/include/ATen/Functions.h ADDED
@@ -0,0 +1,1476 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #if !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)
2
+ #pragma once
3
+
4
+ // @generated by torchgen/gen.py from Functions.h
5
+
6
+ #ifdef TORCH_ASSERT_NO_OPERATORS
7
+ #error This change adds a dependency on native_functions.yaml, \
8
+ meaning the file will need to be re-compiled every time an operator \
9
+ is changed or added. Consider if your change would be better placed in \
10
+ another file, or if a more specific header might achieve the same goal. \
11
+ See NOTE: [Tensor vs. TensorBase]
12
+ #endif
13
+
14
+ #if defined(AT_PER_OPERATOR_HEADERS) && defined(TORCH_ASSERT_ONLY_METHOD_OPERATORS)
15
+ #error This change adds a dependency on all pytorch operators, meaning the \
16
+ file will need to be re-compiled every time an operator is changed or added. \
17
+ Consider including a specific operator from <ATen/ops/{my_operator}.h> and \
18
+ see NOTE [TORCH_ASSERT_ONLY_METHOD_OPERATORS].
19
+ #endif
20
+
21
+ // NOTE: [TORCH_ASSERT_ONLY_METHOD_OPERATORS]
22
+ //
23
+ // In ATen, certain generated headers files include the definitions of
24
+ // every single operator in PyTorch. Unfortunately this means every
25
+ // time an operator signature is updated or changed in
26
+ // native_functions.yaml, you (and every other PyTorch developer) need
27
+ // to recompile every source file that includes any of these headers.
28
+ //
29
+ // To break up these header dependencies, and improve incremental
30
+ // build times for all PyTorch developers. These headers are split
31
+ // into per-operator headers in the `ATen/ops` folder. This limits
32
+ // incremental builds to only changes to methods of `Tensor`, or files
33
+ // that use the specific operator being changed. With `at::sum` as an
34
+ // example, you should include
35
+ //
36
+ // <ATen/ops/sum.h> // instead of ATen/Functions.h
37
+ // <ATen/ops/sum_native.h> // instead of ATen/NativeFunctions.h
38
+ // <ATen/ops/sum_ops.h> // instead of ATen/Operators.h
39
+ // <ATen/ops/sum_cpu_dispatch.h> // instead of ATen/CPUFunctions.h
40
+ //
41
+ // However, even if you're careful to use this in your own code.
42
+ // `Functions.h` might be included indirectly through another header
43
+ // without you realising. To avoid this, you can add
44
+ //
45
+ // #define TORCH_ASSERT_ONLY_METHOD_OPERATORS
46
+ //
47
+ // to the top of your source file. This way any time the non-specific
48
+ // headers are included, the compiler will error out.
49
+ //
50
+ // Also, be aware that `ops` are not available in all build
51
+ // configurations (namely fb-internal) so you must guard these
52
+ // includes with `#ifdef AT_PER_OPERATOR_HEADERS`. e.g.
53
+ //
54
+ // #ifndef AT_PER_OPERATOR_HEADERS
55
+ // #include <ATen/Functions.h>
56
+ // #else
57
+ // #include <ATen/ops/sum.h>
58
+ // #endif
59
+
60
+ #include <ATen/Context.h>
61
+ #include <ATen/DeviceGuard.h>
62
+ #include <ATen/TensorUtils.h>
63
+ #include <ATen/TracerMode.h>
64
+ #include <ATen/core/Generator.h>
65
+ #include <ATen/core/Reduction.h>
66
+ #include <c10/core/SymInt.h>
67
+ #include <ATen/core/Tensor.h>
68
+ #include <c10/core/Scalar.h>
69
+ #include <c10/core/Storage.h>
70
+ #include <c10/core/TensorOptions.h>
71
+ #include <c10/util/Deprecated.h>
72
+ #include <optional>
73
+ #include <c10/util/OptionalArrayRef.h>
74
+
75
+ #include <ATen/ops/from_blob.h>
76
+ #include <ATen/ops/tensor.h>
77
+
78
+ #include <ATen/ops/_adaptive_avg_pool2d.h>
79
+ #include <ATen/ops/_adaptive_avg_pool2d_backward.h>
80
+ #include <ATen/ops/_adaptive_avg_pool3d.h>
81
+ #include <ATen/ops/_adaptive_avg_pool3d_backward.h>
82
+ #include <ATen/ops/_add_batch_dim.h>
83
+ #include <ATen/ops/_add_relu.h>
84
+ #include <ATen/ops/_addmm_activation.h>
85
+ #include <ATen/ops/_aminmax.h>
86
+ #include <ATen/ops/_amp_foreach_non_finite_check_and_unscale.h>
87
+ #include <ATen/ops/_amp_update_scale.h>
88
+ #include <ATen/ops/_assert_async.h>
89
+ #include <ATen/ops/_assert_scalar.h>
90
+ #include <ATen/ops/_assert_tensor_metadata.h>
91
+ #include <ATen/ops/_autocast_to_full_precision.h>
92
+ #include <ATen/ops/_autocast_to_reduced_precision.h>
93
+ #include <ATen/ops/_backward.h>
94
+ #include <ATen/ops/_batch_norm_impl_index.h>
95
+ #include <ATen/ops/_batch_norm_impl_index_backward.h>
96
+ #include <ATen/ops/_batch_norm_no_update.h>
97
+ #include <ATen/ops/_batch_norm_with_update.h>
98
+ #include <ATen/ops/_cast_Byte.h>
99
+ #include <ATen/ops/_cast_Char.h>
100
+ #include <ATen/ops/_cast_Double.h>
101
+ #include <ATen/ops/_cast_Float.h>
102
+ #include <ATen/ops/_cast_Half.h>
103
+ #include <ATen/ops/_cast_Int.h>
104
+ #include <ATen/ops/_cast_Long.h>
105
+ #include <ATen/ops/_cast_Short.h>
106
+ #include <ATen/ops/_cdist_backward.h>
107
+ #include <ATen/ops/_cdist_forward.h>
108
+ #include <ATen/ops/_cholesky_solve_helper.h>
109
+ #include <ATen/ops/_choose_qparams_per_tensor.h>
110
+ #include <ATen/ops/_chunk_cat.h>
111
+ #include <ATen/ops/_coalesce.h>
112
+ #include <ATen/ops/_coalesced.h>
113
+ #include <ATen/ops/_compute_linear_combination.h>
114
+ #include <ATen/ops/_conj.h>
115
+ #include <ATen/ops/_conj_copy.h>
116
+ #include <ATen/ops/_conj_physical.h>
117
+ #include <ATen/ops/_conv_depthwise2d.h>
118
+ #include <ATen/ops/_convert_indices_from_coo_to_csr.h>
119
+ #include <ATen/ops/_convert_indices_from_csr_to_coo.h>
120
+ #include <ATen/ops/_convert_weight_to_int4pack.h>
121
+ #include <ATen/ops/_convert_weight_to_int4pack_for_cpu.h>
122
+ #include <ATen/ops/_convolution.h>
123
+ #include <ATen/ops/_convolution_double_backward.h>
124
+ #include <ATen/ops/_convolution_mode.h>
125
+ #include <ATen/ops/_copy_from.h>
126
+ #include <ATen/ops/_copy_from_and_resize.h>
127
+ #include <ATen/ops/_cslt_compress.h>
128
+ #include <ATen/ops/_cslt_sparse_mm.h>
129
+ #include <ATen/ops/_cslt_sparse_mm_search.h>
130
+ #include <ATen/ops/_ctc_loss.h>
131
+ #include <ATen/ops/_ctc_loss_backward.h>
132
+ #include <ATen/ops/_cudnn_attention_backward.h>
133
+ #include <ATen/ops/_cudnn_attention_forward.h>
134
+ #include <ATen/ops/_cudnn_ctc_loss.h>
135
+ #include <ATen/ops/_cudnn_init_dropout_state.h>
136
+ #include <ATen/ops/_cudnn_rnn.h>
137
+ #include <ATen/ops/_cudnn_rnn_backward.h>
138
+ #include <ATen/ops/_cudnn_rnn_flatten_weight.h>
139
+ #include <ATen/ops/_cufft_clear_plan_cache.h>
140
+ #include <ATen/ops/_cufft_get_plan_cache_max_size.h>
141
+ #include <ATen/ops/_cufft_get_plan_cache_size.h>
142
+ #include <ATen/ops/_cufft_set_plan_cache_max_size.h>
143
+ #include <ATen/ops/_cummax_helper.h>
144
+ #include <ATen/ops/_cummin_helper.h>
145
+ #include <ATen/ops/_debug_has_internal_overlap.h>
146
+ #include <ATen/ops/_dimI.h>
147
+ #include <ATen/ops/_dimV.h>
148
+ #include <ATen/ops/_dim_arange.h>
149
+ #include <ATen/ops/_dirichlet_grad.h>
150
+ #include <ATen/ops/_dyn_quant_matmul_4bit.h>
151
+ #include <ATen/ops/_dyn_quant_pack_4bit_weight.h>
152
+ #include <ATen/ops/_efficient_attention_backward.h>
153
+ #include <ATen/ops/_efficient_attention_forward.h>
154
+ #include <ATen/ops/_efficientzerotensor.h>
155
+ #include <ATen/ops/_embedding_bag.h>
156
+ #include <ATen/ops/_embedding_bag_backward.h>
157
+ #include <ATen/ops/_embedding_bag_dense_backward.h>
158
+ #include <ATen/ops/_embedding_bag_forward_only.h>
159
+ #include <ATen/ops/_embedding_bag_per_sample_weights_backward.h>
160
+ #include <ATen/ops/_embedding_bag_sparse_backward.h>
161
+ #include <ATen/ops/_empty_affine_quantized.h>
162
+ #include <ATen/ops/_empty_per_channel_affine_quantized.h>
163
+ #include <ATen/ops/_euclidean_dist.h>
164
+ #include <ATen/ops/_fake_quantize_learnable_per_channel_affine.h>
165
+ #include <ATen/ops/_fake_quantize_learnable_per_channel_affine_backward.h>
166
+ #include <ATen/ops/_fake_quantize_learnable_per_tensor_affine.h>
167
+ #include <ATen/ops/_fake_quantize_learnable_per_tensor_affine_backward.h>
168
+ #include <ATen/ops/_fake_quantize_per_tensor_affine_cachemask_tensor_qparams.h>
169
+ #include <ATen/ops/_fft_c2c.h>
170
+ #include <ATen/ops/_fft_c2r.h>
171
+ #include <ATen/ops/_fft_r2c.h>
172
+ #include <ATen/ops/_fill_mem_eff_dropout_mask.h>
173
+ #include <ATen/ops/_flash_attention_backward.h>
174
+ #include <ATen/ops/_flash_attention_forward.h>
175
+ #include <ATen/ops/_foobar.h>
176
+ #include <ATen/ops/_foreach_abs.h>
177
+ #include <ATen/ops/_foreach_acos.h>
178
+ #include <ATen/ops/_foreach_add.h>
179
+ #include <ATen/ops/_foreach_addcdiv.h>
180
+ #include <ATen/ops/_foreach_addcmul.h>
181
+ #include <ATen/ops/_foreach_asin.h>
182
+ #include <ATen/ops/_foreach_atan.h>
183
+ #include <ATen/ops/_foreach_ceil.h>
184
+ #include <ATen/ops/_foreach_clamp_max.h>
185
+ #include <ATen/ops/_foreach_clamp_min.h>
186
+ #include <ATen/ops/_foreach_copy.h>
187
+ #include <ATen/ops/_foreach_cos.h>
188
+ #include <ATen/ops/_foreach_cosh.h>
189
+ #include <ATen/ops/_foreach_div.h>
190
+ #include <ATen/ops/_foreach_erf.h>
191
+ #include <ATen/ops/_foreach_erfc.h>
192
+ #include <ATen/ops/_foreach_exp.h>
193
+ #include <ATen/ops/_foreach_expm1.h>
194
+ #include <ATen/ops/_foreach_floor.h>
195
+ #include <ATen/ops/_foreach_frac.h>
196
+ #include <ATen/ops/_foreach_lerp.h>
197
+ #include <ATen/ops/_foreach_lgamma.h>
198
+ #include <ATen/ops/_foreach_log.h>
199
+ #include <ATen/ops/_foreach_log10.h>
200
+ #include <ATen/ops/_foreach_log1p.h>
201
+ #include <ATen/ops/_foreach_log2.h>
202
+ #include <ATen/ops/_foreach_max.h>
203
+ #include <ATen/ops/_foreach_maximum.h>
204
+ #include <ATen/ops/_foreach_minimum.h>
205
+ #include <ATen/ops/_foreach_mul.h>
206
+ #include <ATen/ops/_foreach_neg.h>
207
+ #include <ATen/ops/_foreach_norm.h>
208
+ #include <ATen/ops/_foreach_pow.h>
209
+ #include <ATen/ops/_foreach_reciprocal.h>
210
+ #include <ATen/ops/_foreach_round.h>
211
+ #include <ATen/ops/_foreach_rsqrt.h>
212
+ #include <ATen/ops/_foreach_sigmoid.h>
213
+ #include <ATen/ops/_foreach_sign.h>
214
+ #include <ATen/ops/_foreach_sin.h>
215
+ #include <ATen/ops/_foreach_sinh.h>
216
+ #include <ATen/ops/_foreach_sqrt.h>
217
+ #include <ATen/ops/_foreach_sub.h>
218
+ #include <ATen/ops/_foreach_tan.h>
219
+ #include <ATen/ops/_foreach_tanh.h>
220
+ #include <ATen/ops/_foreach_trunc.h>
221
+ #include <ATen/ops/_foreach_zero.h>
222
+ #include <ATen/ops/_functional_assert_async.h>
223
+ #include <ATen/ops/_functional_assert_scalar.h>
224
+ #include <ATen/ops/_functional_sym_constrain_range.h>
225
+ #include <ATen/ops/_functional_sym_constrain_range_for_size.h>
226
+ #include <ATen/ops/_fused_adagrad.h>
227
+ #include <ATen/ops/_fused_adam.h>
228
+ #include <ATen/ops/_fused_adamw.h>
229
+ #include <ATen/ops/_fused_dropout.h>
230
+ #include <ATen/ops/_fused_moving_avg_obs_fq_helper.h>
231
+ #include <ATen/ops/_fused_rms_norm.h>
232
+ #include <ATen/ops/_fused_rms_norm_backward.h>
233
+ #include <ATen/ops/_fused_sdp_choice.h>
234
+ #include <ATen/ops/_fused_sgd.h>
235
+ #include <ATen/ops/_fw_primal.h>
236
+ #include <ATen/ops/_fw_primal_copy.h>
237
+ #include <ATen/ops/_gather_sparse_backward.h>
238
+ #include <ATen/ops/_grid_sampler_2d_cpu_fallback.h>
239
+ #include <ATen/ops/_grid_sampler_2d_cpu_fallback_backward.h>
240
+ #include <ATen/ops/_grouped_mm.h>
241
+ #include <ATen/ops/_has_compatible_shallow_copy_type.h>
242
+ #include <ATen/ops/_has_same_storage_numel.h>
243
+ #include <ATen/ops/_histogramdd_bin_edges.h>
244
+ #include <ATen/ops/_histogramdd_from_bin_cts.h>
245
+ #include <ATen/ops/_histogramdd_from_bin_tensors.h>
246
+ #include <ATen/ops/_index_put_impl.h>
247
+ #include <ATen/ops/_indices.h>
248
+ #include <ATen/ops/_indices_copy.h>
249
+ #include <ATen/ops/_int_mm.h>
250
+ #include <ATen/ops/_is_all_true.h>
251
+ #include <ATen/ops/_is_any_true.h>
252
+ #include <ATen/ops/_is_zerotensor.h>
253
+ #include <ATen/ops/_jagged_to_padded_dense_forward.h>
254
+ #include <ATen/ops/_lazy_clone.h>
255
+ #include <ATen/ops/_linalg_check_errors.h>
256
+ #include <ATen/ops/_linalg_det.h>
257
+ #include <ATen/ops/_linalg_eigh.h>
258
+ #include <ATen/ops/_linalg_eigvals.h>
259
+ #include <ATen/ops/_linalg_slogdet.h>
260
+ #include <ATen/ops/_linalg_solve_ex.h>
261
+ #include <ATen/ops/_linalg_svd.h>
262
+ #include <ATen/ops/_local_scalar_dense.h>
263
+ #include <ATen/ops/_log_softmax.h>
264
+ #include <ATen/ops/_log_softmax_backward_data.h>
265
+ #include <ATen/ops/_logcumsumexp.h>
266
+ #include <ATen/ops/_lstm_mps.h>
267
+ #include <ATen/ops/_lu_with_info.h>
268
+ #include <ATen/ops/_make_dep_token.h>
269
+ #include <ATen/ops/_make_dual.h>
270
+ #include <ATen/ops/_make_dual_copy.h>
271
+ #include <ATen/ops/_make_per_channel_quantized_tensor.h>
272
+ #include <ATen/ops/_make_per_tensor_quantized_tensor.h>
273
+ #include <ATen/ops/_masked_scale.h>
274
+ #include <ATen/ops/_masked_softmax.h>
275
+ #include <ATen/ops/_masked_softmax_backward.h>
276
+ #include <ATen/ops/_mixed_dtypes_linear.h>
277
+ #include <ATen/ops/_mkldnn_reshape.h>
278
+ #include <ATen/ops/_mkldnn_transpose.h>
279
+ #include <ATen/ops/_mps_convolution.h>
280
+ #include <ATen/ops/_mps_convolution_transpose.h>
281
+ #include <ATen/ops/_native_batch_norm_legit.h>
282
+ #include <ATen/ops/_native_batch_norm_legit_no_training.h>
283
+ #include <ATen/ops/_native_multi_head_attention.h>
284
+ #include <ATen/ops/_neg_view.h>
285
+ #include <ATen/ops/_neg_view_copy.h>
286
+ #include <ATen/ops/_nested_compute_contiguous_strides_offsets.h>
287
+ #include <ATen/ops/_nested_from_padded.h>
288
+ #include <ATen/ops/_nested_from_padded_and_nested_example.h>
289
+ #include <ATen/ops/_nested_from_padded_tensor.h>
290
+ #include <ATen/ops/_nested_get_jagged_dummy.h>
291
+ #include <ATen/ops/_nested_get_lengths.h>
292
+ #include <ATen/ops/_nested_get_max_seqlen.h>
293
+ #include <ATen/ops/_nested_get_min_seqlen.h>
294
+ #include <ATen/ops/_nested_get_offsets.h>
295
+ #include <ATen/ops/_nested_get_ragged_idx.h>
296
+ #include <ATen/ops/_nested_get_values.h>
297
+ #include <ATen/ops/_nested_get_values_copy.h>
298
+ #include <ATen/ops/_nested_select_backward.h>
299
+ #include <ATen/ops/_nested_sum_backward.h>
300
+ #include <ATen/ops/_nested_tensor_from_mask.h>
301
+ #include <ATen/ops/_nested_tensor_from_mask_left_aligned.h>
302
+ #include <ATen/ops/_nested_tensor_from_tensor_list.h>
303
+ #include <ATen/ops/_nested_tensor_size.h>
304
+ #include <ATen/ops/_nested_tensor_softmax_with_shape.h>
305
+ #include <ATen/ops/_nested_tensor_storage_offsets.h>
306
+ #include <ATen/ops/_nested_tensor_strides.h>
307
+ #include <ATen/ops/_nested_view_from_buffer.h>
308
+ #include <ATen/ops/_nested_view_from_buffer_copy.h>
309
+ #include <ATen/ops/_nested_view_from_jagged.h>
310
+ #include <ATen/ops/_nested_view_from_jagged_copy.h>
311
+ #include <ATen/ops/_new_zeros_with_same_feature_meta.h>
312
+ #include <ATen/ops/_nnpack_available.h>
313
+ #include <ATen/ops/_nnpack_spatial_convolution.h>
314
+ #include <ATen/ops/_nnz.h>
315
+ #include <ATen/ops/_pack_padded_sequence.h>
316
+ #include <ATen/ops/_pack_padded_sequence_backward.h>
317
+ #include <ATen/ops/_pad_circular.h>
318
+ #include <ATen/ops/_pad_enum.h>
319
+ #include <ATen/ops/_pad_packed_sequence.h>
320
+ #include <ATen/ops/_padded_dense_to_jagged_forward.h>
321
+ #include <ATen/ops/_pdist_backward.h>
322
+ #include <ATen/ops/_pdist_forward.h>
323
+ #include <ATen/ops/_pin_memory.h>
324
+ #include <ATen/ops/_prelu_kernel.h>
325
+ #include <ATen/ops/_prelu_kernel_backward.h>
326
+ #include <ATen/ops/_print.h>
327
+ #include <ATen/ops/_propagate_xla_data.h>
328
+ #include <ATen/ops/_remove_batch_dim.h>
329
+ #include <ATen/ops/_reshape_alias.h>
330
+ #include <ATen/ops/_reshape_alias_copy.h>
331
+ #include <ATen/ops/_reshape_copy.h>
332
+ #include <ATen/ops/_reshape_from_tensor.h>
333
+ #include <ATen/ops/_resize_output.h>
334
+ #include <ATen/ops/_rowwise_prune.h>
335
+ #include <ATen/ops/_safe_softmax.h>
336
+ #include <ATen/ops/_sample_dirichlet.h>
337
+ #include <ATen/ops/_saturate_weight_to_fp16.h>
338
+ #include <ATen/ops/_scaled_dot_product_attention_math.h>
339
+ #include <ATen/ops/_scaled_dot_product_attention_math_for_mps.h>
340
+ #include <ATen/ops/_scaled_dot_product_cudnn_attention.h>
341
+ #include <ATen/ops/_scaled_dot_product_cudnn_attention_backward.h>
342
+ #include <ATen/ops/_scaled_dot_product_efficient_attention.h>
343
+ #include <ATen/ops/_scaled_dot_product_efficient_attention_backward.h>
344
+ #include <ATen/ops/_scaled_dot_product_flash_attention.h>
345
+ #include <ATen/ops/_scaled_dot_product_flash_attention_backward.h>
346
+ #include <ATen/ops/_scaled_dot_product_flash_attention_for_cpu.h>
347
+ #include <ATen/ops/_scaled_dot_product_flash_attention_for_cpu_backward.h>
348
+ #include <ATen/ops/_scaled_dot_product_fused_attention_overrideable.h>
349
+ #include <ATen/ops/_scaled_dot_product_fused_attention_overrideable_backward.h>
350
+ #include <ATen/ops/_scaled_grouped_mm.h>
351
+ #include <ATen/ops/_scaled_grouped_mm_v2.h>
352
+ #include <ATen/ops/_scaled_mm.h>
353
+ #include <ATen/ops/_scaled_mm_v2.h>
354
+ #include <ATen/ops/_segment_reduce_backward.h>
355
+ #include <ATen/ops/_shape_as_tensor.h>
356
+ #include <ATen/ops/_slow_conv2d_backward.h>
357
+ #include <ATen/ops/_slow_conv2d_forward.h>
358
+ #include <ATen/ops/_sobol_engine_draw.h>
359
+ #include <ATen/ops/_sobol_engine_ff.h>
360
+ #include <ATen/ops/_sobol_engine_initialize_state.h>
361
+ #include <ATen/ops/_sobol_engine_scramble.h>
362
+ #include <ATen/ops/_softmax.h>
363
+ #include <ATen/ops/_softmax_backward_data.h>
364
+ #include <ATen/ops/_sparse_addmm.h>
365
+ #include <ATen/ops/_sparse_broadcast_to.h>
366
+ #include <ATen/ops/_sparse_broadcast_to_copy.h>
367
+ #include <ATen/ops/_sparse_bsc_tensor_unsafe.h>
368
+ #include <ATen/ops/_sparse_bsr_tensor_unsafe.h>
369
+ #include <ATen/ops/_sparse_compressed_tensor_unsafe.h>
370
+ #include <ATen/ops/_sparse_compressed_tensor_with_dims.h>
371
+ #include <ATen/ops/_sparse_coo_tensor_unsafe.h>
372
+ #include <ATen/ops/_sparse_coo_tensor_with_dims.h>
373
+ #include <ATen/ops/_sparse_coo_tensor_with_dims_and_tensors.h>
374
+ #include <ATen/ops/_sparse_csc_tensor_unsafe.h>
375
+ #include <ATen/ops/_sparse_csr_prod.h>
376
+ #include <ATen/ops/_sparse_csr_sum.h>
377
+ #include <ATen/ops/_sparse_csr_tensor_unsafe.h>
378
+ #include <ATen/ops/_sparse_log_softmax.h>
379
+ #include <ATen/ops/_sparse_log_softmax_backward_data.h>
380
+ #include <ATen/ops/_sparse_mask_projection.h>
381
+ #include <ATen/ops/_sparse_mm.h>
382
+ #include <ATen/ops/_sparse_mm_reduce_impl.h>
383
+ #include <ATen/ops/_sparse_mm_reduce_impl_backward.h>
384
+ #include <ATen/ops/_sparse_semi_structured_addmm.h>
385
+ #include <ATen/ops/_sparse_semi_structured_apply.h>
386
+ #include <ATen/ops/_sparse_semi_structured_apply_dense.h>
387
+ #include <ATen/ops/_sparse_semi_structured_linear.h>
388
+ #include <ATen/ops/_sparse_semi_structured_mm.h>
389
+ #include <ATen/ops/_sparse_semi_structured_tile.h>
390
+ #include <ATen/ops/_sparse_softmax.h>
391
+ #include <ATen/ops/_sparse_softmax_backward_data.h>
392
+ #include <ATen/ops/_sparse_sparse_matmul.h>
393
+ #include <ATen/ops/_sparse_sum.h>
394
+ #include <ATen/ops/_sparse_sum_backward.h>
395
+ #include <ATen/ops/_spdiags.h>
396
+ #include <ATen/ops/_spsolve.h>
397
+ #include <ATen/ops/_stack.h>
398
+ #include <ATen/ops/_standard_gamma.h>
399
+ #include <ATen/ops/_standard_gamma_grad.h>
400
+ #include <ATen/ops/_test_ambiguous_defaults.h>
401
+ #include <ATen/ops/_test_autograd_multiple_dispatch.h>
402
+ #include <ATen/ops/_test_autograd_multiple_dispatch_view.h>
403
+ #include <ATen/ops/_test_autograd_multiple_dispatch_view_copy.h>
404
+ #include <ATen/ops/_test_check_tensor.h>
405
+ #include <ATen/ops/_test_functorch_fallback.h>
406
+ #include <ATen/ops/_test_optional_filled_intlist.h>
407
+ #include <ATen/ops/_test_optional_floatlist.h>
408
+ #include <ATen/ops/_test_optional_intlist.h>
409
+ #include <ATen/ops/_test_parallel_materialize.h>
410
+ #include <ATen/ops/_test_serialization_subcmul.h>
411
+ #include <ATen/ops/_test_string_default.h>
412
+ #include <ATen/ops/_test_warn_in_autograd.h>
413
+ #include <ATen/ops/_thnn_differentiable_gru_cell_backward.h>
414
+ #include <ATen/ops/_thnn_differentiable_lstm_cell_backward.h>
415
+ #include <ATen/ops/_thnn_fused_gru_cell.h>
416
+ #include <ATen/ops/_thnn_fused_gru_cell_backward.h>
417
+ #include <ATen/ops/_thnn_fused_lstm_cell.h>
418
+ #include <ATen/ops/_thnn_fused_lstm_cell_backward.h>
419
+ #include <ATen/ops/_thnn_fused_lstm_cell_backward_impl.h>
420
+ #include <ATen/ops/_to_copy.h>
421
+ #include <ATen/ops/_to_cpu.h>
422
+ #include <ATen/ops/_to_dense.h>
423
+ #include <ATen/ops/_to_sparse.h>
424
+ #include <ATen/ops/_to_sparse_bsc.h>
425
+ #include <ATen/ops/_to_sparse_bsr.h>
426
+ #include <ATen/ops/_to_sparse_csc.h>
427
+ #include <ATen/ops/_to_sparse_csr.h>
428
+ #include <ATen/ops/_to_sparse_semi_structured.h>
429
+ #include <ATen/ops/_transform_bias_rescale_qkv.h>
430
+ #include <ATen/ops/_transformer_encoder_layer_fwd.h>
431
+ #include <ATen/ops/_trilinear.h>
432
+ #include <ATen/ops/_triton_multi_head_attention.h>
433
+ #include <ATen/ops/_triton_scaled_dot_attention.h>
434
+ #include <ATen/ops/_unique.h>
435
+ #include <ATen/ops/_unique2.h>
436
+ #include <ATen/ops/_unpack_dual.h>
437
+ #include <ATen/ops/_unsafe_index.h>
438
+ #include <ATen/ops/_unsafe_index_put.h>
439
+ #include <ATen/ops/_unsafe_masked_index.h>
440
+ #include <ATen/ops/_unsafe_masked_index_put_accumulate.h>
441
+ #include <ATen/ops/_unsafe_view.h>
442
+ #include <ATen/ops/_upsample_bicubic2d_aa.h>
443
+ #include <ATen/ops/_upsample_bicubic2d_aa_backward.h>
444
+ #include <ATen/ops/_upsample_bilinear2d_aa.h>
445
+ #include <ATen/ops/_upsample_bilinear2d_aa_backward.h>
446
+ #include <ATen/ops/_upsample_nearest_exact1d.h>
447
+ #include <ATen/ops/_upsample_nearest_exact1d_backward.h>
448
+ #include <ATen/ops/_upsample_nearest_exact2d.h>
449
+ #include <ATen/ops/_upsample_nearest_exact2d_backward.h>
450
+ #include <ATen/ops/_upsample_nearest_exact3d.h>
451
+ #include <ATen/ops/_upsample_nearest_exact3d_backward.h>
452
+ #include <ATen/ops/_use_cudnn_ctc_loss.h>
453
+ #include <ATen/ops/_use_cudnn_rnn_flatten_weight.h>
454
+ #include <ATen/ops/_validate_compressed_sparse_indices.h>
455
+ #include <ATen/ops/_validate_sparse_bsc_tensor_args.h>
456
+ #include <ATen/ops/_validate_sparse_bsr_tensor_args.h>
457
+ #include <ATen/ops/_validate_sparse_compressed_tensor_args.h>
458
+ #include <ATen/ops/_validate_sparse_coo_tensor_args.h>
459
+ #include <ATen/ops/_validate_sparse_csc_tensor_args.h>
460
+ #include <ATen/ops/_validate_sparse_csr_tensor_args.h>
461
+ #include <ATen/ops/_values.h>
462
+ #include <ATen/ops/_values_copy.h>
463
+ #include <ATen/ops/_version.h>
464
+ #include <ATen/ops/_weight_int4pack_mm.h>
465
+ #include <ATen/ops/_weight_int4pack_mm_for_cpu.h>
466
+ #include <ATen/ops/_weight_int4pack_mm_with_scales_and_zeros.h>
467
+ #include <ATen/ops/_weight_int8pack_mm.h>
468
+ #include <ATen/ops/_weight_norm.h>
469
+ #include <ATen/ops/_weight_norm_differentiable_backward.h>
470
+ #include <ATen/ops/_weight_norm_interface.h>
471
+ #include <ATen/ops/_weight_norm_interface_backward.h>
472
+ #include <ATen/ops/_wrapped_linear_prepack.h>
473
+ #include <ATen/ops/_wrapped_quantized_linear_prepacked.h>
474
+ #include <ATen/ops/abs.h>
475
+ #include <ATen/ops/absolute.h>
476
+ #include <ATen/ops/acos.h>
477
+ #include <ATen/ops/acosh.h>
478
+ #include <ATen/ops/adaptive_avg_pool1d.h>
479
+ #include <ATen/ops/adaptive_avg_pool2d.h>
480
+ #include <ATen/ops/adaptive_avg_pool3d.h>
481
+ #include <ATen/ops/adaptive_avg_pool3d_backward.h>
482
+ #include <ATen/ops/adaptive_max_pool1d.h>
483
+ #include <ATen/ops/adaptive_max_pool2d.h>
484
+ #include <ATen/ops/adaptive_max_pool2d_backward.h>
485
+ #include <ATen/ops/adaptive_max_pool3d.h>
486
+ #include <ATen/ops/adaptive_max_pool3d_backward.h>
487
+ #include <ATen/ops/add.h>
488
+ #include <ATen/ops/addbmm.h>
489
+ #include <ATen/ops/addcdiv.h>
490
+ #include <ATen/ops/addcmul.h>
491
+ #include <ATen/ops/addmm.h>
492
+ #include <ATen/ops/addmv.h>
493
+ #include <ATen/ops/addr.h>
494
+ #include <ATen/ops/adjoint.h>
495
+ #include <ATen/ops/affine_grid_generator.h>
496
+ #include <ATen/ops/affine_grid_generator_backward.h>
497
+ #include <ATen/ops/alias.h>
498
+ #include <ATen/ops/alias_copy.h>
499
+ #include <ATen/ops/align_as.h>
500
+ #include <ATen/ops/align_tensors.h>
501
+ #include <ATen/ops/align_to.h>
502
+ #include <ATen/ops/all.h>
503
+ #include <ATen/ops/allclose.h>
504
+ #include <ATen/ops/alpha_dropout.h>
505
+ #include <ATen/ops/amax.h>
506
+ #include <ATen/ops/amin.h>
507
+ #include <ATen/ops/aminmax.h>
508
+ #include <ATen/ops/and.h>
509
+ #include <ATen/ops/angle.h>
510
+ #include <ATen/ops/any.h>
511
+ #include <ATen/ops/arange.h>
512
+ #include <ATen/ops/arccos.h>
513
+ #include <ATen/ops/arccosh.h>
514
+ #include <ATen/ops/arcsin.h>
515
+ #include <ATen/ops/arcsinh.h>
516
+ #include <ATen/ops/arctan.h>
517
+ #include <ATen/ops/arctan2.h>
518
+ #include <ATen/ops/arctanh.h>
519
+ #include <ATen/ops/argmax.h>
520
+ #include <ATen/ops/argmin.h>
521
+ #include <ATen/ops/argsort.h>
522
+ #include <ATen/ops/argwhere.h>
523
+ #include <ATen/ops/as_strided.h>
524
+ #include <ATen/ops/as_strided_copy.h>
525
+ #include <ATen/ops/as_strided_scatter.h>
526
+ #include <ATen/ops/asin.h>
527
+ #include <ATen/ops/asinh.h>
528
+ #include <ATen/ops/atan.h>
529
+ #include <ATen/ops/atan2.h>
530
+ #include <ATen/ops/atanh.h>
531
+ #include <ATen/ops/atleast_1d.h>
532
+ #include <ATen/ops/atleast_2d.h>
533
+ #include <ATen/ops/atleast_3d.h>
534
+ #include <ATen/ops/avg_pool1d.h>
535
+ #include <ATen/ops/avg_pool2d.h>
536
+ #include <ATen/ops/avg_pool2d_backward.h>
537
+ #include <ATen/ops/avg_pool3d.h>
538
+ #include <ATen/ops/avg_pool3d_backward.h>
539
+ #include <ATen/ops/baddbmm.h>
540
+ #include <ATen/ops/bartlett_window.h>
541
+ #include <ATen/ops/batch_norm.h>
542
+ #include <ATen/ops/batch_norm_backward.h>
543
+ #include <ATen/ops/batch_norm_backward_elemt.h>
544
+ #include <ATen/ops/batch_norm_backward_reduce.h>
545
+ #include <ATen/ops/batch_norm_elemt.h>
546
+ #include <ATen/ops/batch_norm_gather_stats.h>
547
+ #include <ATen/ops/batch_norm_gather_stats_with_counts.h>
548
+ #include <ATen/ops/batch_norm_stats.h>
549
+ #include <ATen/ops/batch_norm_update_stats.h>
550
+ #include <ATen/ops/bernoulli.h>
551
+ #include <ATen/ops/bilinear.h>
552
+ #include <ATen/ops/binary_cross_entropy.h>
553
+ #include <ATen/ops/binary_cross_entropy_backward.h>
554
+ #include <ATen/ops/binary_cross_entropy_with_logits.h>
555
+ #include <ATen/ops/bincount.h>
556
+ #include <ATen/ops/binomial.h>
557
+ #include <ATen/ops/bitwise_and.h>
558
+ #include <ATen/ops/bitwise_left_shift.h>
559
+ #include <ATen/ops/bitwise_not.h>
560
+ #include <ATen/ops/bitwise_or.h>
561
+ #include <ATen/ops/bitwise_right_shift.h>
562
+ #include <ATen/ops/bitwise_xor.h>
563
+ #include <ATen/ops/blackman_window.h>
564
+ #include <ATen/ops/block_diag.h>
565
+ #include <ATen/ops/bmm.h>
566
+ #include <ATen/ops/broadcast_tensors.h>
567
+ #include <ATen/ops/broadcast_to.h>
568
+ #include <ATen/ops/bucketize.h>
569
+ #include <ATen/ops/can_cast.h>
570
+ #include <ATen/ops/cartesian_prod.h>
571
+ #include <ATen/ops/cat.h>
572
+ #include <ATen/ops/cauchy.h>
573
+ #include <ATen/ops/ccol_indices.h>
574
+ #include <ATen/ops/ccol_indices_copy.h>
575
+ #include <ATen/ops/cdist.h>
576
+ #include <ATen/ops/ceil.h>
577
+ #include <ATen/ops/celu.h>
578
+ #include <ATen/ops/chain_matmul.h>
579
+ #include <ATen/ops/chalf.h>
580
+ #include <ATen/ops/channel_shuffle.h>
581
+ #include <ATen/ops/cholesky.h>
582
+ #include <ATen/ops/cholesky_inverse.h>
583
+ #include <ATen/ops/cholesky_solve.h>
584
+ #include <ATen/ops/choose_qparams_optimized.h>
585
+ #include <ATen/ops/chunk.h>
586
+ #include <ATen/ops/clamp.h>
587
+ #include <ATen/ops/clamp_max.h>
588
+ #include <ATen/ops/clamp_min.h>
589
+ #include <ATen/ops/clip.h>
590
+ #include <ATen/ops/clone.h>
591
+ #include <ATen/ops/coalesce.h>
592
+ #include <ATen/ops/col2im.h>
593
+ #include <ATen/ops/col_indices.h>
594
+ #include <ATen/ops/col_indices_copy.h>
595
+ #include <ATen/ops/column_stack.h>
596
+ #include <ATen/ops/combinations.h>
597
+ #include <ATen/ops/complex.h>
598
+ #include <ATen/ops/concat.h>
599
+ #include <ATen/ops/concatenate.h>
600
+ #include <ATen/ops/conj.h>
601
+ #include <ATen/ops/conj_physical.h>
602
+ #include <ATen/ops/constant_pad_nd.h>
603
+ #include <ATen/ops/contiguous.h>
604
+ #include <ATen/ops/conv1d.h>
605
+ #include <ATen/ops/conv2d.h>
606
+ #include <ATen/ops/conv3d.h>
607
+ #include <ATen/ops/conv_depthwise3d.h>
608
+ #include <ATen/ops/conv_tbc.h>
609
+ #include <ATen/ops/conv_tbc_backward.h>
610
+ #include <ATen/ops/conv_transpose1d.h>
611
+ #include <ATen/ops/conv_transpose2d.h>
612
+ #include <ATen/ops/conv_transpose3d.h>
613
+ #include <ATen/ops/convolution.h>
614
+ #include <ATen/ops/convolution_backward.h>
615
+ #include <ATen/ops/convolution_backward_overrideable.h>
616
+ #include <ATen/ops/convolution_overrideable.h>
617
+ #include <ATen/ops/copy.h>
618
+ #include <ATen/ops/copy_sparse_to_sparse.h>
619
+ #include <ATen/ops/copysign.h>
620
+ #include <ATen/ops/corrcoef.h>
621
+ #include <ATen/ops/cos.h>
622
+ #include <ATen/ops/cosh.h>
623
+ #include <ATen/ops/cosine_embedding_loss.h>
624
+ #include <ATen/ops/cosine_similarity.h>
625
+ #include <ATen/ops/count_nonzero.h>
626
+ #include <ATen/ops/cov.h>
627
+ #include <ATen/ops/cross.h>
628
+ #include <ATen/ops/cross_entropy_loss.h>
629
+ #include <ATen/ops/crow_indices.h>
630
+ #include <ATen/ops/crow_indices_copy.h>
631
+ #include <ATen/ops/ctc_loss.h>
632
+ #include <ATen/ops/cudnn_affine_grid_generator.h>
633
+ #include <ATen/ops/cudnn_affine_grid_generator_backward.h>
634
+ #include <ATen/ops/cudnn_batch_norm.h>
635
+ #include <ATen/ops/cudnn_batch_norm_backward.h>
636
+ #include <ATen/ops/cudnn_convolution.h>
637
+ #include <ATen/ops/cudnn_convolution_add_relu.h>
638
+ #include <ATen/ops/cudnn_convolution_relu.h>
639
+ #include <ATen/ops/cudnn_convolution_transpose.h>
640
+ #include <ATen/ops/cudnn_grid_sampler.h>
641
+ #include <ATen/ops/cudnn_grid_sampler_backward.h>
642
+ #include <ATen/ops/cudnn_is_acceptable.h>
643
+ #include <ATen/ops/cummax.h>
644
+ #include <ATen/ops/cummaxmin_backward.h>
645
+ #include <ATen/ops/cummin.h>
646
+ #include <ATen/ops/cumprod.h>
647
+ #include <ATen/ops/cumprod_backward.h>
648
+ #include <ATen/ops/cumsum.h>
649
+ #include <ATen/ops/cumulative_trapezoid.h>
650
+ #include <ATen/ops/data.h>
651
+ #include <ATen/ops/deg2rad.h>
652
+ #include <ATen/ops/dense_dim.h>
653
+ #include <ATen/ops/dequantize.h>
654
+ #include <ATen/ops/det.h>
655
+ #include <ATen/ops/detach.h>
656
+ #include <ATen/ops/detach_copy.h>
657
+ #include <ATen/ops/diag.h>
658
+ #include <ATen/ops/diag_embed.h>
659
+ #include <ATen/ops/diagflat.h>
660
+ #include <ATen/ops/diagonal.h>
661
+ #include <ATen/ops/diagonal_backward.h>
662
+ #include <ATen/ops/diagonal_copy.h>
663
+ #include <ATen/ops/diagonal_scatter.h>
664
+ #include <ATen/ops/diff.h>
665
+ #include <ATen/ops/digamma.h>
666
+ #include <ATen/ops/dist.h>
667
+ #include <ATen/ops/div.h>
668
+ #include <ATen/ops/divide.h>
669
+ #include <ATen/ops/dot.h>
670
+ #include <ATen/ops/dropout.h>
671
+ #include <ATen/ops/dsplit.h>
672
+ #include <ATen/ops/dstack.h>
673
+ #include <ATen/ops/einsum.h>
674
+ #include <ATen/ops/elu.h>
675
+ #include <ATen/ops/elu_backward.h>
676
+ #include <ATen/ops/embedding.h>
677
+ #include <ATen/ops/embedding_backward.h>
678
+ #include <ATen/ops/embedding_bag.h>
679
+ #include <ATen/ops/embedding_dense_backward.h>
680
+ #include <ATen/ops/embedding_renorm.h>
681
+ #include <ATen/ops/embedding_sparse_backward.h>
682
+ #include <ATen/ops/empty.h>
683
+ #include <ATen/ops/empty_like.h>
684
+ #include <ATen/ops/empty_permuted.h>
685
+ #include <ATen/ops/empty_quantized.h>
686
+ #include <ATen/ops/empty_strided.h>
687
+ #include <ATen/ops/eq.h>
688
+ #include <ATen/ops/equal.h>
689
+ #include <ATen/ops/erf.h>
690
+ #include <ATen/ops/erfc.h>
691
+ #include <ATen/ops/erfinv.h>
692
+ #include <ATen/ops/exp.h>
693
+ #include <ATen/ops/exp2.h>
694
+ #include <ATen/ops/expand.h>
695
+ #include <ATen/ops/expand_as.h>
696
+ #include <ATen/ops/expand_copy.h>
697
+ #include <ATen/ops/expm1.h>
698
+ #include <ATen/ops/exponential.h>
699
+ #include <ATen/ops/eye.h>
700
+ #include <ATen/ops/fake_quantize_per_channel_affine.h>
701
+ #include <ATen/ops/fake_quantize_per_channel_affine_cachemask.h>
702
+ #include <ATen/ops/fake_quantize_per_channel_affine_cachemask_backward.h>
703
+ #include <ATen/ops/fake_quantize_per_tensor_affine.h>
704
+ #include <ATen/ops/fake_quantize_per_tensor_affine_cachemask.h>
705
+ #include <ATen/ops/fake_quantize_per_tensor_affine_cachemask_backward.h>
706
+ #include <ATen/ops/fbgemm_linear_fp16_weight.h>
707
+ #include <ATen/ops/fbgemm_linear_fp16_weight_fp32_activation.h>
708
+ #include <ATen/ops/fbgemm_linear_int8_weight.h>
709
+ #include <ATen/ops/fbgemm_linear_int8_weight_fp32_activation.h>
710
+ #include <ATen/ops/fbgemm_linear_quantize_weight.h>
711
+ #include <ATen/ops/fbgemm_pack_gemm_matrix_fp16.h>
712
+ #include <ATen/ops/fbgemm_pack_quantized_matrix.h>
713
+ #include <ATen/ops/feature_alpha_dropout.h>
714
+ #include <ATen/ops/feature_dropout.h>
715
+ #include <ATen/ops/fft_fft.h>
716
+ #include <ATen/ops/fft_fft2.h>
717
+ #include <ATen/ops/fft_fftfreq.h>
718
+ #include <ATen/ops/fft_fftn.h>
719
+ #include <ATen/ops/fft_fftshift.h>
720
+ #include <ATen/ops/fft_hfft.h>
721
+ #include <ATen/ops/fft_hfft2.h>
722
+ #include <ATen/ops/fft_hfftn.h>
723
+ #include <ATen/ops/fft_ifft.h>
724
+ #include <ATen/ops/fft_ifft2.h>
725
+ #include <ATen/ops/fft_ifftn.h>
726
+ #include <ATen/ops/fft_ifftshift.h>
727
+ #include <ATen/ops/fft_ihfft.h>
728
+ #include <ATen/ops/fft_ihfft2.h>
729
+ #include <ATen/ops/fft_ihfftn.h>
730
+ #include <ATen/ops/fft_irfft.h>
731
+ #include <ATen/ops/fft_irfft2.h>
732
+ #include <ATen/ops/fft_irfftn.h>
733
+ #include <ATen/ops/fft_rfft.h>
734
+ #include <ATen/ops/fft_rfft2.h>
735
+ #include <ATen/ops/fft_rfftfreq.h>
736
+ #include <ATen/ops/fft_rfftn.h>
737
+ #include <ATen/ops/fill.h>
738
+ #include <ATen/ops/fill_diagonal.h>
739
+ #include <ATen/ops/fix.h>
740
+ #include <ATen/ops/flatten.h>
741
+ #include <ATen/ops/flatten_dense_tensors.h>
742
+ #include <ATen/ops/flip.h>
743
+ #include <ATen/ops/fliplr.h>
744
+ #include <ATen/ops/flipud.h>
745
+ #include <ATen/ops/float_power.h>
746
+ #include <ATen/ops/floor.h>
747
+ #include <ATen/ops/floor_divide.h>
748
+ #include <ATen/ops/fmax.h>
749
+ #include <ATen/ops/fmin.h>
750
+ #include <ATen/ops/fmod.h>
751
+ #include <ATen/ops/frac.h>
752
+ #include <ATen/ops/fractional_max_pool2d.h>
753
+ #include <ATen/ops/fractional_max_pool2d_backward.h>
754
+ #include <ATen/ops/fractional_max_pool3d.h>
755
+ #include <ATen/ops/fractional_max_pool3d_backward.h>
756
+ #include <ATen/ops/frexp.h>
757
+ #include <ATen/ops/frobenius_norm.h>
758
+ #include <ATen/ops/from_file.h>
759
+ #include <ATen/ops/full.h>
760
+ #include <ATen/ops/full_like.h>
761
+ #include <ATen/ops/fused_moving_avg_obs_fake_quant.h>
762
+ #include <ATen/ops/gather.h>
763
+ #include <ATen/ops/gather_backward.h>
764
+ #include <ATen/ops/gcd.h>
765
+ #include <ATen/ops/ge.h>
766
+ #include <ATen/ops/gelu.h>
767
+ #include <ATen/ops/gelu_backward.h>
768
+ #include <ATen/ops/geometric.h>
769
+ #include <ATen/ops/geqrf.h>
770
+ #include <ATen/ops/ger.h>
771
+ #include <ATen/ops/glu.h>
772
+ #include <ATen/ops/glu_backward.h>
773
+ #include <ATen/ops/glu_backward_jvp.h>
774
+ #include <ATen/ops/glu_jvp.h>
775
+ #include <ATen/ops/gradient.h>
776
+ #include <ATen/ops/greater.h>
777
+ #include <ATen/ops/greater_equal.h>
778
+ #include <ATen/ops/grid_sampler.h>
779
+ #include <ATen/ops/grid_sampler_2d.h>
780
+ #include <ATen/ops/grid_sampler_2d_backward.h>
781
+ #include <ATen/ops/grid_sampler_3d.h>
782
+ #include <ATen/ops/grid_sampler_3d_backward.h>
783
+ #include <ATen/ops/group_norm.h>
784
+ #include <ATen/ops/gru.h>
785
+ #include <ATen/ops/gru_cell.h>
786
+ #include <ATen/ops/gt.h>
787
+ #include <ATen/ops/hamming_window.h>
788
+ #include <ATen/ops/hann_window.h>
789
+ #include <ATen/ops/hardshrink.h>
790
+ #include <ATen/ops/hardshrink_backward.h>
791
+ #include <ATen/ops/hardsigmoid.h>
792
+ #include <ATen/ops/hardsigmoid_backward.h>
793
+ #include <ATen/ops/hardswish.h>
794
+ #include <ATen/ops/hardswish_backward.h>
795
+ #include <ATen/ops/hardtanh.h>
796
+ #include <ATen/ops/hardtanh_backward.h>
797
+ #include <ATen/ops/hash_tensor.h>
798
+ #include <ATen/ops/heaviside.h>
799
+ #include <ATen/ops/hinge_embedding_loss.h>
800
+ #include <ATen/ops/histc.h>
801
+ #include <ATen/ops/histogram.h>
802
+ #include <ATen/ops/histogramdd.h>
803
+ #include <ATen/ops/hsplit.h>
804
+ #include <ATen/ops/hspmm.h>
805
+ #include <ATen/ops/hstack.h>
806
+ #include <ATen/ops/huber_loss.h>
807
+ #include <ATen/ops/huber_loss_backward.h>
808
+ #include <ATen/ops/hypot.h>
809
+ #include <ATen/ops/i0.h>
810
+ #include <ATen/ops/igamma.h>
811
+ #include <ATen/ops/igammac.h>
812
+ #include <ATen/ops/im2col.h>
813
+ #include <ATen/ops/imag.h>
814
+ #include <ATen/ops/index.h>
815
+ #include <ATen/ops/index_add.h>
816
+ #include <ATen/ops/index_copy.h>
817
+ #include <ATen/ops/index_fill.h>
818
+ #include <ATen/ops/index_put.h>
819
+ #include <ATen/ops/index_reduce.h>
820
+ #include <ATen/ops/index_select.h>
821
+ #include <ATen/ops/index_select_backward.h>
822
+ #include <ATen/ops/indices.h>
823
+ #include <ATen/ops/indices_copy.h>
824
+ #include <ATen/ops/infinitely_differentiable_gelu_backward.h>
825
+ #include <ATen/ops/inner.h>
826
+ #include <ATen/ops/instance_norm.h>
827
+ #include <ATen/ops/int_repr.h>
828
+ #include <ATen/ops/inverse.h>
829
+ #include <ATen/ops/is_coalesced.h>
830
+ #include <ATen/ops/is_complex.h>
831
+ #include <ATen/ops/is_conj.h>
832
+ #include <ATen/ops/is_distributed.h>
833
+ #include <ATen/ops/is_floating_point.h>
834
+ #include <ATen/ops/is_inference.h>
835
+ #include <ATen/ops/is_leaf.h>
836
+ #include <ATen/ops/is_neg.h>
837
+ #include <ATen/ops/is_nonzero.h>
838
+ #include <ATen/ops/is_pinned.h>
839
+ #include <ATen/ops/is_same_size.h>
840
+ #include <ATen/ops/is_set_to.h>
841
+ #include <ATen/ops/is_signed.h>
842
+ #include <ATen/ops/is_vulkan_available.h>
843
+ #include <ATen/ops/isclose.h>
844
+ #include <ATen/ops/isfinite.h>
845
+ #include <ATen/ops/isin.h>
846
+ #include <ATen/ops/isinf.h>
847
+ #include <ATen/ops/isnan.h>
848
+ #include <ATen/ops/isneginf.h>
849
+ #include <ATen/ops/isposinf.h>
850
+ #include <ATen/ops/isreal.h>
851
+ #include <ATen/ops/istft.h>
852
+ #include <ATen/ops/item.h>
853
+ #include <ATen/ops/kaiser_window.h>
854
+ #include <ATen/ops/kl_div.h>
855
+ #include <ATen/ops/kron.h>
856
+ #include <ATen/ops/kthvalue.h>
857
+ #include <ATen/ops/l1_loss.h>
858
+ #include <ATen/ops/layer_norm.h>
859
+ #include <ATen/ops/lcm.h>
860
+ #include <ATen/ops/ldexp.h>
861
+ #include <ATen/ops/le.h>
862
+ #include <ATen/ops/leaky_relu.h>
863
+ #include <ATen/ops/leaky_relu_backward.h>
864
+ #include <ATen/ops/lerp.h>
865
+ #include <ATen/ops/less.h>
866
+ #include <ATen/ops/less_equal.h>
867
+ #include <ATen/ops/lgamma.h>
868
+ #include <ATen/ops/lift.h>
869
+ #include <ATen/ops/lift_fresh.h>
870
+ #include <ATen/ops/lift_fresh_copy.h>
871
+ #include <ATen/ops/linalg_cholesky.h>
872
+ #include <ATen/ops/linalg_cholesky_ex.h>
873
+ #include <ATen/ops/linalg_cond.h>
874
+ #include <ATen/ops/linalg_cross.h>
875
+ #include <ATen/ops/linalg_det.h>
876
+ #include <ATen/ops/linalg_diagonal.h>
877
+ #include <ATen/ops/linalg_eig.h>
878
+ #include <ATen/ops/linalg_eigh.h>
879
+ #include <ATen/ops/linalg_eigvals.h>
880
+ #include <ATen/ops/linalg_eigvalsh.h>
881
+ #include <ATen/ops/linalg_householder_product.h>
882
+ #include <ATen/ops/linalg_inv.h>
883
+ #include <ATen/ops/linalg_inv_ex.h>
884
+ #include <ATen/ops/linalg_ldl_factor.h>
885
+ #include <ATen/ops/linalg_ldl_factor_ex.h>
886
+ #include <ATen/ops/linalg_ldl_solve.h>
887
+ #include <ATen/ops/linalg_lstsq.h>
888
+ #include <ATen/ops/linalg_lu.h>
889
+ #include <ATen/ops/linalg_lu_factor.h>
890
+ #include <ATen/ops/linalg_lu_factor_ex.h>
891
+ #include <ATen/ops/linalg_lu_solve.h>
892
+ #include <ATen/ops/linalg_matmul.h>
893
+ #include <ATen/ops/linalg_matrix_exp.h>
894
+ #include <ATen/ops/linalg_matrix_norm.h>
895
+ #include <ATen/ops/linalg_matrix_power.h>
896
+ #include <ATen/ops/linalg_matrix_rank.h>
897
+ #include <ATen/ops/linalg_multi_dot.h>
898
+ #include <ATen/ops/linalg_norm.h>
899
+ #include <ATen/ops/linalg_pinv.h>
900
+ #include <ATen/ops/linalg_qr.h>
901
+ #include <ATen/ops/linalg_slogdet.h>
902
+ #include <ATen/ops/linalg_solve.h>
903
+ #include <ATen/ops/linalg_solve_ex.h>
904
+ #include <ATen/ops/linalg_solve_triangular.h>
905
+ #include <ATen/ops/linalg_svd.h>
906
+ #include <ATen/ops/linalg_svdvals.h>
907
+ #include <ATen/ops/linalg_tensorinv.h>
908
+ #include <ATen/ops/linalg_tensorsolve.h>
909
+ #include <ATen/ops/linalg_vander.h>
910
+ #include <ATen/ops/linalg_vecdot.h>
911
+ #include <ATen/ops/linalg_vector_norm.h>
912
+ #include <ATen/ops/linear.h>
913
+ #include <ATen/ops/linear_backward.h>
914
+ #include <ATen/ops/linspace.h>
915
+ #include <ATen/ops/log.h>
916
+ #include <ATen/ops/log10.h>
917
+ #include <ATen/ops/log1p.h>
918
+ #include <ATen/ops/log2.h>
919
+ #include <ATen/ops/log_normal.h>
920
+ #include <ATen/ops/log_sigmoid.h>
921
+ #include <ATen/ops/log_sigmoid_backward.h>
922
+ #include <ATen/ops/log_sigmoid_forward.h>
923
+ #include <ATen/ops/log_softmax.h>
924
+ #include <ATen/ops/logaddexp.h>
925
+ #include <ATen/ops/logaddexp2.h>
926
+ #include <ATen/ops/logcumsumexp.h>
927
+ #include <ATen/ops/logdet.h>
928
+ #include <ATen/ops/logical_and.h>
929
+ #include <ATen/ops/logical_not.h>
930
+ #include <ATen/ops/logical_or.h>
931
+ #include <ATen/ops/logical_xor.h>
932
+ #include <ATen/ops/logit.h>
933
+ #include <ATen/ops/logit_backward.h>
934
+ #include <ATen/ops/logspace.h>
935
+ #include <ATen/ops/logsumexp.h>
936
+ #include <ATen/ops/lshift.h>
937
+ #include <ATen/ops/lstm.h>
938
+ #include <ATen/ops/lstm_cell.h>
939
+ #include <ATen/ops/lstm_mps_backward.h>
940
+ #include <ATen/ops/lt.h>
941
+ #include <ATen/ops/lu_solve.h>
942
+ #include <ATen/ops/lu_unpack.h>
943
+ #include <ATen/ops/mH.h>
944
+ #include <ATen/ops/mT.h>
945
+ #include <ATen/ops/margin_ranking_loss.h>
946
+ #include <ATen/ops/masked_fill.h>
947
+ #include <ATen/ops/masked_scatter.h>
948
+ #include <ATen/ops/masked_scatter_backward.h>
949
+ #include <ATen/ops/masked_select.h>
950
+ #include <ATen/ops/masked_select_backward.h>
951
+ #include <ATen/ops/matmul.h>
952
+ #include <ATen/ops/matmul_backward.h>
953
+ #include <ATen/ops/matrix_H.h>
954
+ #include <ATen/ops/matrix_exp.h>
955
+ #include <ATen/ops/matrix_exp_backward.h>
956
+ #include <ATen/ops/matrix_power.h>
957
+ #include <ATen/ops/max.h>
958
+ #include <ATen/ops/max_pool1d.h>
959
+ #include <ATen/ops/max_pool1d_with_indices.h>
960
+ #include <ATen/ops/max_pool2d.h>
961
+ #include <ATen/ops/max_pool2d_backward.h>
962
+ #include <ATen/ops/max_pool2d_with_indices.h>
963
+ #include <ATen/ops/max_pool2d_with_indices_backward.h>
964
+ #include <ATen/ops/max_pool3d.h>
965
+ #include <ATen/ops/max_pool3d_with_indices.h>
966
+ #include <ATen/ops/max_pool3d_with_indices_backward.h>
967
+ #include <ATen/ops/max_unpool2d.h>
968
+ #include <ATen/ops/max_unpool3d.h>
969
+ #include <ATen/ops/maximum.h>
970
+ #include <ATen/ops/mean.h>
971
+ #include <ATen/ops/median.h>
972
+ #include <ATen/ops/meshgrid.h>
973
+ #include <ATen/ops/min.h>
974
+ #include <ATen/ops/minimum.h>
975
+ #include <ATen/ops/miopen_batch_norm.h>
976
+ #include <ATen/ops/miopen_batch_norm_backward.h>
977
+ #include <ATen/ops/miopen_convolution.h>
978
+ #include <ATen/ops/miopen_convolution_add_relu.h>
979
+ #include <ATen/ops/miopen_convolution_relu.h>
980
+ #include <ATen/ops/miopen_convolution_transpose.h>
981
+ #include <ATen/ops/miopen_depthwise_convolution.h>
982
+ #include <ATen/ops/miopen_rnn.h>
983
+ #include <ATen/ops/miopen_rnn_backward.h>
984
+ #include <ATen/ops/mish.h>
985
+ #include <ATen/ops/mish_backward.h>
986
+ #include <ATen/ops/mkldnn_adaptive_avg_pool2d.h>
987
+ #include <ATen/ops/mkldnn_adaptive_avg_pool2d_backward.h>
988
+ #include <ATen/ops/mkldnn_convolution.h>
989
+ #include <ATen/ops/mkldnn_linear.h>
990
+ #include <ATen/ops/mkldnn_linear_backward.h>
991
+ #include <ATen/ops/mkldnn_linear_backward_input.h>
992
+ #include <ATen/ops/mkldnn_linear_backward_weights.h>
993
+ #include <ATen/ops/mkldnn_max_pool2d.h>
994
+ #include <ATen/ops/mkldnn_max_pool2d_backward.h>
995
+ #include <ATen/ops/mkldnn_max_pool3d.h>
996
+ #include <ATen/ops/mkldnn_max_pool3d_backward.h>
997
+ #include <ATen/ops/mkldnn_reorder_conv2d_weight.h>
998
+ #include <ATen/ops/mkldnn_reorder_conv3d_weight.h>
999
+ #include <ATen/ops/mkldnn_rnn_layer.h>
1000
+ #include <ATen/ops/mkldnn_rnn_layer_backward.h>
1001
+ #include <ATen/ops/mm.h>
1002
+ #include <ATen/ops/mode.h>
1003
+ #include <ATen/ops/moveaxis.h>
1004
+ #include <ATen/ops/movedim.h>
1005
+ #include <ATen/ops/mps_convolution_backward.h>
1006
+ #include <ATen/ops/mps_convolution_transpose_backward.h>
1007
+ #include <ATen/ops/mse_loss.h>
1008
+ #include <ATen/ops/mse_loss_backward.h>
1009
+ #include <ATen/ops/msort.h>
1010
+ #include <ATen/ops/mul.h>
1011
+ #include <ATen/ops/multi_margin_loss.h>
1012
+ #include <ATen/ops/multi_margin_loss_backward.h>
1013
+ #include <ATen/ops/multilabel_margin_loss.h>
1014
+ #include <ATen/ops/multilabel_margin_loss_backward.h>
1015
+ #include <ATen/ops/multilabel_margin_loss_forward.h>
1016
+ #include <ATen/ops/multinomial.h>
1017
+ #include <ATen/ops/multiply.h>
1018
+ #include <ATen/ops/mv.h>
1019
+ #include <ATen/ops/mvlgamma.h>
1020
+ #include <ATen/ops/nan_to_num.h>
1021
+ #include <ATen/ops/nanmean.h>
1022
+ #include <ATen/ops/nanmedian.h>
1023
+ #include <ATen/ops/nanquantile.h>
1024
+ #include <ATen/ops/nansum.h>
1025
+ #include <ATen/ops/narrow.h>
1026
+ #include <ATen/ops/narrow_copy.h>
1027
+ #include <ATen/ops/native_batch_norm.h>
1028
+ #include <ATen/ops/native_batch_norm_backward.h>
1029
+ #include <ATen/ops/native_channel_shuffle.h>
1030
+ #include <ATen/ops/native_dropout.h>
1031
+ #include <ATen/ops/native_dropout_backward.h>
1032
+ #include <ATen/ops/native_group_norm.h>
1033
+ #include <ATen/ops/native_group_norm_backward.h>
1034
+ #include <ATen/ops/native_layer_norm.h>
1035
+ #include <ATen/ops/native_layer_norm_backward.h>
1036
+ #include <ATen/ops/native_norm.h>
1037
+ #include <ATen/ops/ne.h>
1038
+ #include <ATen/ops/neg.h>
1039
+ #include <ATen/ops/negative.h>
1040
+ #include <ATen/ops/nested_to_padded_tensor.h>
1041
+ #include <ATen/ops/new_empty.h>
1042
+ #include <ATen/ops/new_empty_strided.h>
1043
+ #include <ATen/ops/new_full.h>
1044
+ #include <ATen/ops/new_ones.h>
1045
+ #include <ATen/ops/new_zeros.h>
1046
+ #include <ATen/ops/nextafter.h>
1047
+ #include <ATen/ops/nll_loss.h>
1048
+ #include <ATen/ops/nll_loss2d.h>
1049
+ #include <ATen/ops/nll_loss2d_backward.h>
1050
+ #include <ATen/ops/nll_loss2d_forward.h>
1051
+ #include <ATen/ops/nll_loss_backward.h>
1052
+ #include <ATen/ops/nll_loss_forward.h>
1053
+ #include <ATen/ops/nll_loss_nd.h>
1054
+ #include <ATen/ops/nonzero.h>
1055
+ #include <ATen/ops/nonzero_numpy.h>
1056
+ #include <ATen/ops/nonzero_static.h>
1057
+ #include <ATen/ops/norm.h>
1058
+ #include <ATen/ops/norm_except_dim.h>
1059
+ #include <ATen/ops/normal.h>
1060
+ #include <ATen/ops/not_equal.h>
1061
+ #include <ATen/ops/nuclear_norm.h>
1062
+ #include <ATen/ops/numpy_T.h>
1063
+ #include <ATen/ops/one_hot.h>
1064
+ #include <ATen/ops/ones.h>
1065
+ #include <ATen/ops/ones_like.h>
1066
+ #include <ATen/ops/or.h>
1067
+ #include <ATen/ops/orgqr.h>
1068
+ #include <ATen/ops/ormqr.h>
1069
+ #include <ATen/ops/outer.h>
1070
+ #include <ATen/ops/output_nr.h>
1071
+ #include <ATen/ops/pad.h>
1072
+ #include <ATen/ops/pad_sequence.h>
1073
+ #include <ATen/ops/pairwise_distance.h>
1074
+ #include <ATen/ops/pdist.h>
1075
+ #include <ATen/ops/permute.h>
1076
+ #include <ATen/ops/permute_copy.h>
1077
+ #include <ATen/ops/pin_memory.h>
1078
+ #include <ATen/ops/pinverse.h>
1079
+ #include <ATen/ops/pixel_shuffle.h>
1080
+ #include <ATen/ops/pixel_unshuffle.h>
1081
+ #include <ATen/ops/poisson.h>
1082
+ #include <ATen/ops/poisson_nll_loss.h>
1083
+ #include <ATen/ops/polar.h>
1084
+ #include <ATen/ops/polygamma.h>
1085
+ #include <ATen/ops/positive.h>
1086
+ #include <ATen/ops/pow.h>
1087
+ #include <ATen/ops/prelu.h>
1088
+ #include <ATen/ops/prod.h>
1089
+ #include <ATen/ops/promote_types.h>
1090
+ #include <ATen/ops/put.h>
1091
+ #include <ATen/ops/q_per_channel_axis.h>
1092
+ #include <ATen/ops/q_per_channel_scales.h>
1093
+ #include <ATen/ops/q_per_channel_zero_points.h>
1094
+ #include <ATen/ops/q_scale.h>
1095
+ #include <ATen/ops/q_zero_point.h>
1096
+ #include <ATen/ops/qr.h>
1097
+ #include <ATen/ops/qscheme.h>
1098
+ #include <ATen/ops/quantile.h>
1099
+ #include <ATen/ops/quantize_per_channel.h>
1100
+ #include <ATen/ops/quantize_per_tensor.h>
1101
+ #include <ATen/ops/quantize_per_tensor_dynamic.h>
1102
+ #include <ATen/ops/quantized_batch_norm.h>
1103
+ #include <ATen/ops/quantized_gru_cell.h>
1104
+ #include <ATen/ops/quantized_lstm_cell.h>
1105
+ #include <ATen/ops/quantized_max_pool1d.h>
1106
+ #include <ATen/ops/quantized_max_pool2d.h>
1107
+ #include <ATen/ops/quantized_max_pool3d.h>
1108
+ #include <ATen/ops/quantized_rnn_relu_cell.h>
1109
+ #include <ATen/ops/quantized_rnn_tanh_cell.h>
1110
+ #include <ATen/ops/rad2deg.h>
1111
+ #include <ATen/ops/rand.h>
1112
+ #include <ATen/ops/rand_like.h>
1113
+ #include <ATen/ops/randint.h>
1114
+ #include <ATen/ops/randint_like.h>
1115
+ #include <ATen/ops/randn.h>
1116
+ #include <ATen/ops/randn_like.h>
1117
+ #include <ATen/ops/random.h>
1118
+ #include <ATen/ops/randperm.h>
1119
+ #include <ATen/ops/range.h>
1120
+ #include <ATen/ops/ravel.h>
1121
+ #include <ATen/ops/real.h>
1122
+ #include <ATen/ops/reciprocal.h>
1123
+ #include <ATen/ops/record_stream.h>
1124
+ #include <ATen/ops/refine_names.h>
1125
+ #include <ATen/ops/reflection_pad1d.h>
1126
+ #include <ATen/ops/reflection_pad1d_backward.h>
1127
+ #include <ATen/ops/reflection_pad2d.h>
1128
+ #include <ATen/ops/reflection_pad2d_backward.h>
1129
+ #include <ATen/ops/reflection_pad3d.h>
1130
+ #include <ATen/ops/reflection_pad3d_backward.h>
1131
+ #include <ATen/ops/relu.h>
1132
+ #include <ATen/ops/relu6.h>
1133
+ #include <ATen/ops/remainder.h>
1134
+ #include <ATen/ops/rename.h>
1135
+ #include <ATen/ops/renorm.h>
1136
+ #include <ATen/ops/repeat.h>
1137
+ #include <ATen/ops/repeat_interleave.h>
1138
+ #include <ATen/ops/replication_pad1d.h>
1139
+ #include <ATen/ops/replication_pad1d_backward.h>
1140
+ #include <ATen/ops/replication_pad2d.h>
1141
+ #include <ATen/ops/replication_pad2d_backward.h>
1142
+ #include <ATen/ops/replication_pad3d.h>
1143
+ #include <ATen/ops/replication_pad3d_backward.h>
1144
+ #include <ATen/ops/requires_grad.h>
1145
+ #include <ATen/ops/reshape.h>
1146
+ #include <ATen/ops/reshape_as.h>
1147
+ #include <ATen/ops/resize.h>
1148
+ #include <ATen/ops/resize_as.h>
1149
+ #include <ATen/ops/resize_as_sparse.h>
1150
+ #include <ATen/ops/resolve_conj.h>
1151
+ #include <ATen/ops/resolve_neg.h>
1152
+ #include <ATen/ops/result_type.h>
1153
+ #include <ATen/ops/retain_grad.h>
1154
+ #include <ATen/ops/retains_grad.h>
1155
+ #include <ATen/ops/rms_norm.h>
1156
+ #include <ATen/ops/rnn_relu.h>
1157
+ #include <ATen/ops/rnn_relu_cell.h>
1158
+ #include <ATen/ops/rnn_tanh.h>
1159
+ #include <ATen/ops/rnn_tanh_cell.h>
1160
+ #include <ATen/ops/roll.h>
1161
+ #include <ATen/ops/rot90.h>
1162
+ #include <ATen/ops/round.h>
1163
+ #include <ATen/ops/row_indices.h>
1164
+ #include <ATen/ops/row_indices_copy.h>
1165
+ #include <ATen/ops/row_stack.h>
1166
+ #include <ATen/ops/rrelu.h>
1167
+ #include <ATen/ops/rrelu_with_noise.h>
1168
+ #include <ATen/ops/rrelu_with_noise_backward.h>
1169
+ #include <ATen/ops/rshift.h>
1170
+ #include <ATen/ops/rsqrt.h>
1171
+ #include <ATen/ops/rsub.h>
1172
+ #include <ATen/ops/scalar_tensor.h>
1173
+ #include <ATen/ops/scaled_dot_product_attention.h>
1174
+ #include <ATen/ops/scatter.h>
1175
+ #include <ATen/ops/scatter_add.h>
1176
+ #include <ATen/ops/scatter_reduce.h>
1177
+ #include <ATen/ops/searchsorted.h>
1178
+ #include <ATen/ops/segment_reduce.h>
1179
+ #include <ATen/ops/select.h>
1180
+ #include <ATen/ops/select_backward.h>
1181
+ #include <ATen/ops/select_copy.h>
1182
+ #include <ATen/ops/select_scatter.h>
1183
+ #include <ATen/ops/selu.h>
1184
+ #include <ATen/ops/set.h>
1185
+ #include <ATen/ops/set_data.h>
1186
+ #include <ATen/ops/sgn.h>
1187
+ #include <ATen/ops/sigmoid.h>
1188
+ #include <ATen/ops/sigmoid_backward.h>
1189
+ #include <ATen/ops/sign.h>
1190
+ #include <ATen/ops/signbit.h>
1191
+ #include <ATen/ops/silu.h>
1192
+ #include <ATen/ops/silu_backward.h>
1193
+ #include <ATen/ops/sin.h>
1194
+ #include <ATen/ops/sinc.h>
1195
+ #include <ATen/ops/sinh.h>
1196
+ #include <ATen/ops/size.h>
1197
+ #include <ATen/ops/slice.h>
1198
+ #include <ATen/ops/slice_backward.h>
1199
+ #include <ATen/ops/slice_copy.h>
1200
+ #include <ATen/ops/slice_inverse.h>
1201
+ #include <ATen/ops/slice_scatter.h>
1202
+ #include <ATen/ops/slogdet.h>
1203
+ #include <ATen/ops/slow_conv3d.h>
1204
+ #include <ATen/ops/slow_conv3d_forward.h>
1205
+ #include <ATen/ops/slow_conv_dilated2d.h>
1206
+ #include <ATen/ops/slow_conv_dilated3d.h>
1207
+ #include <ATen/ops/slow_conv_transpose2d.h>
1208
+ #include <ATen/ops/slow_conv_transpose3d.h>
1209
+ #include <ATen/ops/smm.h>
1210
+ #include <ATen/ops/smooth_l1_loss.h>
1211
+ #include <ATen/ops/smooth_l1_loss_backward.h>
1212
+ #include <ATen/ops/soft_margin_loss.h>
1213
+ #include <ATen/ops/soft_margin_loss_backward.h>
1214
+ #include <ATen/ops/softmax.h>
1215
+ #include <ATen/ops/softplus.h>
1216
+ #include <ATen/ops/softplus_backward.h>
1217
+ #include <ATen/ops/softshrink.h>
1218
+ #include <ATen/ops/softshrink_backward.h>
1219
+ #include <ATen/ops/sort.h>
1220
+ #include <ATen/ops/sparse_bsc_tensor.h>
1221
+ #include <ATen/ops/sparse_bsr_tensor.h>
1222
+ #include <ATen/ops/sparse_compressed_tensor.h>
1223
+ #include <ATen/ops/sparse_coo_tensor.h>
1224
+ #include <ATen/ops/sparse_csc_tensor.h>
1225
+ #include <ATen/ops/sparse_csr_tensor.h>
1226
+ #include <ATen/ops/sparse_dim.h>
1227
+ #include <ATen/ops/sparse_mask.h>
1228
+ #include <ATen/ops/sparse_resize.h>
1229
+ #include <ATen/ops/sparse_resize_and_clear.h>
1230
+ #include <ATen/ops/sparse_sampled_addmm.h>
1231
+ #include <ATen/ops/special_airy_ai.h>
1232
+ #include <ATen/ops/special_bessel_j0.h>
1233
+ #include <ATen/ops/special_bessel_j1.h>
1234
+ #include <ATen/ops/special_bessel_y0.h>
1235
+ #include <ATen/ops/special_bessel_y1.h>
1236
+ #include <ATen/ops/special_chebyshev_polynomial_t.h>
1237
+ #include <ATen/ops/special_chebyshev_polynomial_u.h>
1238
+ #include <ATen/ops/special_chebyshev_polynomial_v.h>
1239
+ #include <ATen/ops/special_chebyshev_polynomial_w.h>
1240
+ #include <ATen/ops/special_digamma.h>
1241
+ #include <ATen/ops/special_entr.h>
1242
+ #include <ATen/ops/special_erf.h>
1243
+ #include <ATen/ops/special_erfc.h>
1244
+ #include <ATen/ops/special_erfcx.h>
1245
+ #include <ATen/ops/special_erfinv.h>
1246
+ #include <ATen/ops/special_exp2.h>
1247
+ #include <ATen/ops/special_expit.h>
1248
+ #include <ATen/ops/special_expm1.h>
1249
+ #include <ATen/ops/special_gammainc.h>
1250
+ #include <ATen/ops/special_gammaincc.h>
1251
+ #include <ATen/ops/special_gammaln.h>
1252
+ #include <ATen/ops/special_hermite_polynomial_h.h>
1253
+ #include <ATen/ops/special_hermite_polynomial_he.h>
1254
+ #include <ATen/ops/special_i0.h>
1255
+ #include <ATen/ops/special_i0e.h>
1256
+ #include <ATen/ops/special_i1.h>
1257
+ #include <ATen/ops/special_i1e.h>
1258
+ #include <ATen/ops/special_laguerre_polynomial_l.h>
1259
+ #include <ATen/ops/special_legendre_polynomial_p.h>
1260
+ #include <ATen/ops/special_log1p.h>
1261
+ #include <ATen/ops/special_log_ndtr.h>
1262
+ #include <ATen/ops/special_log_softmax.h>
1263
+ #include <ATen/ops/special_logit.h>
1264
+ #include <ATen/ops/special_logsumexp.h>
1265
+ #include <ATen/ops/special_modified_bessel_i0.h>
1266
+ #include <ATen/ops/special_modified_bessel_i1.h>
1267
+ #include <ATen/ops/special_modified_bessel_k0.h>
1268
+ #include <ATen/ops/special_modified_bessel_k1.h>
1269
+ #include <ATen/ops/special_multigammaln.h>
1270
+ #include <ATen/ops/special_ndtr.h>
1271
+ #include <ATen/ops/special_ndtri.h>
1272
+ #include <ATen/ops/special_polygamma.h>
1273
+ #include <ATen/ops/special_psi.h>
1274
+ #include <ATen/ops/special_round.h>
1275
+ #include <ATen/ops/special_scaled_modified_bessel_k0.h>
1276
+ #include <ATen/ops/special_scaled_modified_bessel_k1.h>
1277
+ #include <ATen/ops/special_shifted_chebyshev_polynomial_t.h>
1278
+ #include <ATen/ops/special_shifted_chebyshev_polynomial_u.h>
1279
+ #include <ATen/ops/special_shifted_chebyshev_polynomial_v.h>
1280
+ #include <ATen/ops/special_shifted_chebyshev_polynomial_w.h>
1281
+ #include <ATen/ops/special_sinc.h>
1282
+ #include <ATen/ops/special_softmax.h>
1283
+ #include <ATen/ops/special_spherical_bessel_j0.h>
1284
+ #include <ATen/ops/special_xlog1py.h>
1285
+ #include <ATen/ops/special_xlogy.h>
1286
+ #include <ATen/ops/special_zeta.h>
1287
+ #include <ATen/ops/split.h>
1288
+ #include <ATen/ops/split_copy.h>
1289
+ #include <ATen/ops/split_with_sizes.h>
1290
+ #include <ATen/ops/split_with_sizes_copy.h>
1291
+ #include <ATen/ops/sqrt.h>
1292
+ #include <ATen/ops/square.h>
1293
+ #include <ATen/ops/squeeze.h>
1294
+ #include <ATen/ops/squeeze_copy.h>
1295
+ #include <ATen/ops/sspaddmm.h>
1296
+ #include <ATen/ops/stack.h>
1297
+ #include <ATen/ops/std.h>
1298
+ #include <ATen/ops/std_mean.h>
1299
+ #include <ATen/ops/stft.h>
1300
+ #include <ATen/ops/stride.h>
1301
+ #include <ATen/ops/sub.h>
1302
+ #include <ATen/ops/subtract.h>
1303
+ #include <ATen/ops/sum.h>
1304
+ #include <ATen/ops/sum_to_size.h>
1305
+ #include <ATen/ops/svd.h>
1306
+ #include <ATen/ops/swapaxes.h>
1307
+ #include <ATen/ops/swapdims.h>
1308
+ #include <ATen/ops/sym_constrain_range.h>
1309
+ #include <ATen/ops/sym_constrain_range_for_size.h>
1310
+ #include <ATen/ops/sym_is_contiguous.h>
1311
+ #include <ATen/ops/sym_numel.h>
1312
+ #include <ATen/ops/sym_size.h>
1313
+ #include <ATen/ops/sym_storage_offset.h>
1314
+ #include <ATen/ops/sym_stride.h>
1315
+ #include <ATen/ops/t.h>
1316
+ #include <ATen/ops/t_copy.h>
1317
+ #include <ATen/ops/take.h>
1318
+ #include <ATen/ops/take_along_dim.h>
1319
+ #include <ATen/ops/tan.h>
1320
+ #include <ATen/ops/tanh.h>
1321
+ #include <ATen/ops/tanh_backward.h>
1322
+ #include <ATen/ops/tensor_split.h>
1323
+ #include <ATen/ops/tensordot.h>
1324
+ #include <ATen/ops/thnn_conv2d.h>
1325
+ #include <ATen/ops/threshold.h>
1326
+ #include <ATen/ops/threshold_backward.h>
1327
+ #include <ATen/ops/tile.h>
1328
+ #include <ATen/ops/to.h>
1329
+ #include <ATen/ops/to_dense.h>
1330
+ #include <ATen/ops/to_dense_backward.h>
1331
+ #include <ATen/ops/to_mkldnn.h>
1332
+ #include <ATen/ops/to_mkldnn_backward.h>
1333
+ #include <ATen/ops/to_padded_tensor.h>
1334
+ #include <ATen/ops/to_sparse.h>
1335
+ #include <ATen/ops/to_sparse_bsc.h>
1336
+ #include <ATen/ops/to_sparse_bsr.h>
1337
+ #include <ATen/ops/to_sparse_csc.h>
1338
+ #include <ATen/ops/to_sparse_csr.h>
1339
+ #include <ATen/ops/topk.h>
1340
+ #include <ATen/ops/trace.h>
1341
+ #include <ATen/ops/trace_backward.h>
1342
+ #include <ATen/ops/transpose.h>
1343
+ #include <ATen/ops/transpose_copy.h>
1344
+ #include <ATen/ops/trapezoid.h>
1345
+ #include <ATen/ops/trapz.h>
1346
+ #include <ATen/ops/triangular_solve.h>
1347
+ #include <ATen/ops/tril.h>
1348
+ #include <ATen/ops/tril_indices.h>
1349
+ #include <ATen/ops/triplet_margin_loss.h>
1350
+ #include <ATen/ops/triu.h>
1351
+ #include <ATen/ops/triu_indices.h>
1352
+ #include <ATen/ops/true_divide.h>
1353
+ #include <ATen/ops/trunc.h>
1354
+ #include <ATen/ops/type_as.h>
1355
+ #include <ATen/ops/unbind.h>
1356
+ #include <ATen/ops/unbind_copy.h>
1357
+ #include <ATen/ops/unflatten.h>
1358
+ #include <ATen/ops/unflatten_dense_tensors.h>
1359
+ #include <ATen/ops/unfold.h>
1360
+ #include <ATen/ops/unfold_backward.h>
1361
+ #include <ATen/ops/unfold_copy.h>
1362
+ #include <ATen/ops/uniform.h>
1363
+ #include <ATen/ops/unique_consecutive.h>
1364
+ #include <ATen/ops/unique_dim.h>
1365
+ #include <ATen/ops/unique_dim_consecutive.h>
1366
+ #include <ATen/ops/unsafe_chunk.h>
1367
+ #include <ATen/ops/unsafe_split.h>
1368
+ #include <ATen/ops/unsafe_split_with_sizes.h>
1369
+ #include <ATen/ops/unsqueeze.h>
1370
+ #include <ATen/ops/unsqueeze_copy.h>
1371
+ #include <ATen/ops/upsample_bicubic2d.h>
1372
+ #include <ATen/ops/upsample_bicubic2d_backward.h>
1373
+ #include <ATen/ops/upsample_bilinear2d.h>
1374
+ #include <ATen/ops/upsample_bilinear2d_backward.h>
1375
+ #include <ATen/ops/upsample_linear1d.h>
1376
+ #include <ATen/ops/upsample_linear1d_backward.h>
1377
+ #include <ATen/ops/upsample_nearest1d.h>
1378
+ #include <ATen/ops/upsample_nearest1d_backward.h>
1379
+ #include <ATen/ops/upsample_nearest2d.h>
1380
+ #include <ATen/ops/upsample_nearest2d_backward.h>
1381
+ #include <ATen/ops/upsample_nearest3d.h>
1382
+ #include <ATen/ops/upsample_nearest3d_backward.h>
1383
+ #include <ATen/ops/upsample_trilinear3d.h>
1384
+ #include <ATen/ops/upsample_trilinear3d_backward.h>
1385
+ #include <ATen/ops/value_selecting_reduction_backward.h>
1386
+ #include <ATen/ops/values.h>
1387
+ #include <ATen/ops/values_copy.h>
1388
+ #include <ATen/ops/vander.h>
1389
+ #include <ATen/ops/var.h>
1390
+ #include <ATen/ops/var_mean.h>
1391
+ #include <ATen/ops/vdot.h>
1392
+ #include <ATen/ops/view.h>
1393
+ #include <ATen/ops/view_as.h>
1394
+ #include <ATen/ops/view_as_complex.h>
1395
+ #include <ATen/ops/view_as_complex_copy.h>
1396
+ #include <ATen/ops/view_as_real.h>
1397
+ #include <ATen/ops/view_as_real_copy.h>
1398
+ #include <ATen/ops/view_copy.h>
1399
+ #include <ATen/ops/vsplit.h>
1400
+ #include <ATen/ops/vstack.h>
1401
+ #include <ATen/ops/where.h>
1402
+ #include <ATen/ops/xlogy.h>
1403
+ #include <ATen/ops/xor.h>
1404
+ #include <ATen/ops/zero.h>
1405
+ #include <ATen/ops/zeros.h>
1406
+ #include <ATen/ops/zeros_like.h>
1407
+
1408
+ namespace at {
1409
+
1410
+
1411
+
1412
+ // Special C++ only overloads for std()-like functions (See gh-40287)
1413
+ // These are needed because int -> bool conversion takes precedence over int -> IntArrayRef
1414
+ // So, for example std(0) would select the std(unbiased=False) overload
1415
+ inline Tensor var(const Tensor& self, int dim) {
1416
+ return at::var(self, IntArrayRef{dim});
1417
+ }
1418
+ inline std::tuple<Tensor, Tensor> var_mean(const Tensor& self, int dim) {
1419
+ return at::var_mean(self, IntArrayRef{dim});
1420
+ }
1421
+ inline Tensor std(const Tensor& self, int dim) {
1422
+ return at::std(self, IntArrayRef{dim});
1423
+ }
1424
+ inline std::tuple<Tensor, Tensor> std_mean(const Tensor& self, int dim) {
1425
+ return at::std_mean(self, IntArrayRef{dim});
1426
+ }
1427
+
1428
+ inline int64_t numel(const Tensor& tensor) {
1429
+ return tensor.numel();
1430
+ }
1431
+
1432
+ inline int64_t size(const Tensor& tensor, int64_t dim) {
1433
+ return tensor.size(dim);
1434
+ }
1435
+
1436
+ inline int64_t stride(const Tensor& tensor, int64_t dim) {
1437
+ return tensor.stride(dim);
1438
+ }
1439
+
1440
+ inline bool is_complex(const Tensor& tensor) {
1441
+ return tensor.is_complex();
1442
+ }
1443
+
1444
+ inline bool is_floating_point(const Tensor& tensor) {
1445
+ return tensor.is_floating_point();
1446
+ }
1447
+
1448
+ inline bool is_signed(const Tensor& tensor) {
1449
+ return tensor.is_signed();
1450
+ }
1451
+
1452
+ inline bool is_inference(const Tensor& tensor) {
1453
+ return tensor.is_inference();
1454
+ }
1455
+
1456
+ inline bool _is_zerotensor(const Tensor& tensor) {
1457
+ return tensor._is_zerotensor();
1458
+ }
1459
+
1460
+ inline bool is_conj(const Tensor& tensor) {
1461
+ return tensor.is_conj();
1462
+ }
1463
+
1464
+ inline Tensor conj(const Tensor& tensor) {
1465
+ return tensor.conj();
1466
+ }
1467
+
1468
+ inline bool is_neg(const Tensor& tensor) {
1469
+ return tensor.is_neg();
1470
+ }
1471
+
1472
+ }
1473
+
1474
+ #else
1475
+ #error "This file should not be included when either TORCH_STABLE_ONLY or TORCH_TARGET_VERSION is defined."
1476
+ #endif // !defined(TORCH_STABLE_ONLY) && !defined(TORCH_TARGET_VERSION)