tvm
function.h
Go to the documentation of this file.
1 /*
2  * Licensed to the Apache Software Foundation (ASF) under one
3  * or more contributor license agreements. See the NOTICE file
4  * distributed with this work for additional information
5  * regarding copyright ownership. The ASF licenses this file
6  * to you under the Apache License, Version 2.0 (the
7  * "License"); you may not use this file except in compliance
8  * with the License. You may obtain a copy of the License at
9  *
10  * http://www.apache.org/licenses/LICENSE-2.0
11  *
12  * Unless required by applicable law or agreed to in writing,
13  * software distributed under the License is distributed on an
14  * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
15  * KIND, either express or implied. See the License for the
16  * specific language governing permissions and limitations
17  * under the License.
18  */
19 
24 #ifndef TVM_TIR_FUNCTION_H_
25 #define TVM_TIR_FUNCTION_H_
26 
27 #include <tvm/ir/function.h>
28 #include <tvm/runtime/ndarray.h>
29 #include <tvm/tir/buffer.h>
30 #include <tvm/tir/expr.h>
31 #include <tvm/tir/stmt.h>
32 
33 #include <string>
34 
35 namespace tvm {
36 namespace tir {
37 
46 class PrimFuncNode : public BaseFuncNode {
47  public:
101 
103  v->Visit("params", &params);
104  v->Visit("body", &body);
105  v->Visit("ret_type", &ret_type);
106  v->Visit("buffer_map", &buffer_map);
107  v->Visit("attrs", &attrs);
108  v->Visit("span", &span);
109  v->Visit("_checked_type_", &checked_type_);
110  }
111 
112  bool SEqualReduce(const PrimFuncNode* other, SEqualReducer equal) const {
113  // visit params and buffer_map first as they contains defs.
114  return equal.DefEqual(params, other->params) && equal(buffer_map, other->buffer_map) &&
115  equal(ret_type, other->ret_type) && equal(body, other->body) &&
116  equal(attrs, other->attrs);
117  }
118 
119  void SHashReduce(SHashReducer hash_reduce) const {
120  hash_reduce.DefHash(params);
121  hash_reduce(buffer_map);
122  hash_reduce(ret_type);
123  hash_reduce(body);
124  hash_reduce(attrs);
125  }
133  TVM_DLL FuncType func_type_annotation() const;
134 
135  static constexpr const char* _type_key = "tir.PrimFunc";
137 };
138 
143 class PrimFunc : public BaseFunc {
144  public:
165  DictAttrs attrs = NullValue<DictAttrs>(), Span span = Span());
166 
169 };
170 
174 class TensorIntrinNode : public Object {
175  public:
180 
182  v->Visit("desc", &desc);
183  v->Visit("impl", &impl);
184  }
185 
186  static constexpr const char* _type_key = "tir.TensorIntrin";
188 };
189 
193 class TensorIntrin : public ObjectRef {
194  public:
200  TVM_DLL explicit TensorIntrin(PrimFunc desc, PrimFunc impl);
201 
211  TVM_DLL static void Register(String name, TensorIntrin intrin, bool override = false);
212 
222  TVM_DLL static Optional<TensorIntrin> Get(String name, bool allow_missing = false);
223 
225 };
226 
227 /*
228  * \brief Specialize parameters of PrimFunc.
229  * \param func The PrimFunc to be specialized.
230  * \param param_map The mapping from function params to the instance.
231  * \return The new function with parameter specialized.
232  * \note We can define a Meta TIR function with symbolic shape:
233  *
234  * \code
235  * @T.prim_func
236  * def mem_copy(a: T.handle, b: T.handle, m: T.int32, n: T.int32) -> None:
237  * A = T.match_buffer(a, (m, n), "float32")
238  * B = T.match_buffer(b, (m, n), "float32")
239  * for i, j in T.grid(m, n):
240  * with T.block():
241  * vi, vj = T.axis.remap("SS", [i, j])
242  * B[vi, vj] = A[vi, vj]
243  * \endcode
244  *
245  * Then we can make it specialized with given shapes or buffers.
246  *
247  * \code
248  * a, _, m, n = mem_copy.params
249  * func = mem_copy.specialize({a: tir.decl_buffer((16, 16))})
250  * # or
251  * func = mem_copy.specialize({n: 16, m: 16})
252  * \endcode
253  *
254  * \code {.language-id}
255  * @T.prim_func
256  * def mem_copy_16_16(a: T.handle, b: T.handle) -> None:
257  * A = T.match_buffer(a, (16, 16), "float32")
258  * B = T.match_buffer(b, (16, 16), "float32")
259  * for i, j in T.grid(16, 16):
260  * with T.block():
261  * vi, vj = T.axis.remap("SS", [i, j])
262  * B[vi, vj] = A[vi, vj]
263  * \endcode
264  */
265 PrimFunc Specialize(PrimFunc func, const Map<Var, ObjectRef>& param_map);
266 
272 namespace attr {
293 constexpr const char* kDeviceThreadAxis = "tir.device_thread_axis";
294 
300 constexpr const char* kDeviceUseDynSharedMemory = "tir.device_use_dyn_shared_memory";
301 
307 constexpr const char* kNoAlias = "tir.noalias";
308 
317 constexpr const char* kIsEntryFunc = "tir.is_entry_func";
318 
324 constexpr const char* kIsGlobalFunc = "tir.is_global_func";
325 
326 } // namespace attr
327 } // namespace tir
328 } // namespace tvm
329 #endif // TVM_TIR_FUNCTION_H_
tvm::Span Span
Definition: base.h:65
DictAttrs attrs
Additional attributes storing the meta-data.
Definition: function.h:80
Function nodes.
bool DefEqual(const ObjectRef &lhs, const ObjectRef &rhs)
Reduce condition to comparison of two definitions, where free vars can be mapped. ...
A Reducer class to reduce the structural equality result of two objects.
Definition: structural_equal.h:124
void VisitAttrs(AttrVisitor *v)
Definition: function.h:181
runtime implementation for LibTorch/TorchScript.
Definition: analyzer.h:36
A Reducer class to reduce the structural hash value.
Definition: structural_hash.h:102
PrimExpr equal(PrimExpr a, PrimExpr b, Span span=Span())
equal
PrimFunc impl
The function of the implementation for the execution.
Definition: function.h:179
PrimFuncFrame PrimFunc()
The primitive function statement.
Primitive functions that contains TIR statements.
Definition: function.h:46
Tensor intrinsics for tensorization.
Definition: function.h:174
Managed reference to DictAttrsNode.
Definition: attrs.h:227
base class of all object containers.
Definition: object.h:167
bool SEqualReduce(const PrimFuncNode *other, SEqualReducer equal) const
Definition: function.h:112
Type VoidType()
Definition: type.h:377
constexpr const char * kNoAlias
Whether to set noalias rule on the function arguments.
Definition: function.h:307
Visitor class to get the attributes of an AST/IR node. The content is going to be called for each fie...
Definition: reflection.h:52
constexpr const char * kIsEntryFunc
Mark the function as the entry function of the final generated runtime module.
Definition: function.h:317
A device-independent managed NDArray abstraction.
Definition: span.h:115
TIR statements.
void VisitAttrs(tvm::AttrVisitor *v)
Definition: function.h:102
Managed reference to TensorIntrinNode.
Definition: function.h:193
Span span
Span that points to the original source code. Reserved debug information.
Definition: expr.h:55
Array< tir::Var > params
Function parameters.
Definition: function.h:49
TIR expressions.
Type checked_type_
Stores the result of type inference(type checking).
Definition: expr.h:367
Array, container representing a contiguous sequence of ObjectRefs.
Definition: array.h:289
Managed reference to PrimFuncNode.
Definition: function.h:143
void SHashReduce(SHashReducer hash_reduce) const
Definition: function.h:119
Container of all statements.
Definition: stmt.h:57
Reference to string objects.
Definition: string.h:97
#define TVM_DEFINE_OBJECT_REF_METHODS(TypeName, ParentType, ObjectName)
Definition: object.h:713
PrimFunc Specialize(PrimFunc func, const Map< Var, ObjectRef > &param_map)
TVM_DECLARE_FINAL_OBJECT_INFO(PrimFuncNode, BaseFuncNode)
constexpr const char * kDeviceThreadAxis
List of thread IterVar that a DeviceLaunch function corresponds to.
Definition: function.h:293
Base class of all object reference.
Definition: object.h:511
#define TVM_DEFINE_OBJECT_REF_COW_METHOD(ObjectName)
Define CopyOnWrite function in an ObjectRef.
Definition: object.h:785
Managed reference to FuncTypeNode.
Definition: type.h:461
constexpr const char * kIsGlobalFunc
Mark the function as the global function called from the host.
Definition: function.h:324
Map< tir::Var, Buffer > buffer_map
Maps some parameters to specific Buffer data structures.
Definition: function.h:100
Symbolic n-dimensional array, to represent a memory buffer.
Base node of all functions.
Definition: function.h:77
Map container of NodeRef->NodeRef in DSL graph. Map implements copy on write semantics, which means map is mutable but copy will happen when array is referenced in more than two places.
Definition: map.h:1271
Managed reference to BaseFuncNode.
Definition: function.h:143
Optional container that to represent to a Nullable variant of T.
Definition: optional.h:51
Managed reference to TypeNode.
Definition: type.h:93
FuncType func_type_annotation() const
Return the derived function annotation of this function.
tir::Stmt body
The body of the function.
Definition: function.h:51
static constexpr const char * _type_key
Definition: function.h:135
PrimFunc desc
The function to describe the computation.
Definition: function.h:177
constexpr const char * kDeviceUseDynSharedMemory
Whether or not use dynamic shared memory.
Definition: function.h:300
Type ret_type
The return type of the function.
Definition: function.h:53
void DefHash(const ObjectRef &key) const
Push hash of key to the current sequence of hash values.
Definition: structural_hash.h:179