48 #ifndef TVM_ARITH_ITER_AFFINE_MAP_H_
49 #define TVM_ARITH_ITER_AFFINE_MAP_H_
52 #include <tvm/ffi/reflection/registry.h>
69 static constexpr
const char*
_type_key =
"arith.IterMapExpr";
103 refl::ObjectDef<IterMarkNode>()
110 static constexpr
const char*
_type_key =
"arith.IterMark";
149 refl::ObjectDef<IterSplitExprNode>()
157 static constexpr
const char*
_type_key =
"arith.IterSplitExpr";
206 refl::ObjectDef<IterSumExprNode>()
212 static constexpr
const char*
_type_key =
"arith.IterSumExpr";
267 refl::ObjectDef<IterMapResultNode>()
273 static constexpr
const char*
_type_key =
"arith.IterMapResult";
328 Array<PrimExpr>
IterMapSimplify(
const Array<PrimExpr>& indices,
const Map<Var, Range>& input_iters,
353 const Array<PrimExpr> outputs);
383 const Map<Var, Range>& input_iters,
384 const Array<Var>& sub_iters,
const PrimExpr& predicate,
386 bool simplify_trivial_iterators =
true);
Algebra expression simplifications.
Base node of all primitive expressions.
Definition: expr.h:95
Reference to PrimExprNode.
Definition: expr.h:129
Analyzer that contains bunch of sub-analyzers.
Definition: analyzer.h:636
Base class of all iter map expressions.
Definition: iter_affine_map.h:67
TVM_DECLARE_BASE_OBJECT_INFO(IterMapExprNode, PrimExprNode)
static constexpr const char * _type_key
Definition: iter_affine_map.h:69
static constexpr const uint32_t _type_child_slots
Definition: iter_affine_map.h:70
Managed reference to IterMapExprNode.
Definition: iter_affine_map.h:78
TVM_DEFINE_OBJECT_REF_METHODS(IterMapExpr, PrimExpr, IterMapExprNode)
Result of DetectIterMap.
Definition: iter_affine_map.h:246
Array< IterSumExpr > indices
Definition: iter_affine_map.h:249
static constexpr const char * _type_key
Definition: iter_affine_map.h:273
TVM_DECLARE_FINAL_OBJECT_INFO(IterMapResultNode, Object)
Array< String > errors
Definition: iter_affine_map.h:253
static void RegisterReflection()
Definition: iter_affine_map.h:265
PrimExpr padding_predicate
Boolean expression indicating if a specific value w.
Definition: iter_affine_map.h:263
Managed reference to IterMapResultNode.
Definition: iter_affine_map.h:281
IterMapResult()
Definition: iter_affine_map.h:284
IterMapResultNode * operator->() const
Definition: iter_affine_map.h:287
Mark the source as an iterator in [0, extent).
Definition: iter_affine_map.h:89
TVM_DECLARE_FINAL_OBJECT_INFO(IterMarkNode, Object)
PrimExpr extent
The extent of the iteration.
Definition: iter_affine_map.h:99
static constexpr TVMFFISEqHashKind _type_s_eq_hash_kind
Definition: iter_affine_map.h:108
PrimExpr source
The source expression, can either be a IterSumExpr or a Var.
Definition: iter_affine_map.h:95
static void RegisterReflection()
Definition: iter_affine_map.h:101
static constexpr const char * _type_key
Definition: iter_affine_map.h:110
Managed reference to IterMarkExprNode.
Definition: iter_affine_map.h:118
TVM_DEFINE_OBJECT_REF_COW_METHOD(IterMarkNode)
IterMark(PrimExpr source, PrimExpr extent)
constructor.
TVM_DEFINE_OBJECT_REF_METHODS(IterMark, ObjectRef, IterMarkNode)
Split of an iterator.
Definition: iter_affine_map.h:136
static constexpr const char * _type_key
Definition: iter_affine_map.h:157
PrimExpr lower_factor
The lower factor to split the source.
Definition: iter_affine_map.h:141
TVM_DECLARE_FINAL_OBJECT_INFO(IterSplitExprNode, IterMapExprNode)
IterMark source
The source marked iterator.
Definition: iter_affine_map.h:139
PrimExpr scale
Additional scale.
Definition: iter_affine_map.h:145
static void RegisterReflection()
Definition: iter_affine_map.h:147
static constexpr TVMFFISEqHashKind _type_s_eq_hash_kind
Definition: iter_affine_map.h:156
PrimExpr extent
The extent of the split.
Definition: iter_affine_map.h:143
Managed reference to IterSplitExprNode.
Definition: iter_affine_map.h:165
TVM_DEFINE_OBJECT_REF_COW_METHOD(IterSplitExprNode)
TVM_DEFINE_OBJECT_REF_METHODS(IterSplitExpr, IterMapExpr, IterSplitExprNode)
IterSplitExpr(IterMark source, PrimExpr lower_factor, PrimExpr extent, PrimExpr scale)
constructor
IterSplitExpr(IterMark source)
constructor from just source.
IterSplitExpr(IterMark source, PrimExpr scale)
constructor from just source.
Fuse multiple iterators by summing them with scaling.
Definition: iter_affine_map.h:197
static void RegisterReflection()
Definition: iter_affine_map.h:204
static constexpr const char * _type_key
Definition: iter_affine_map.h:212
static constexpr TVMFFISEqHashKind _type_s_eq_hash_kind
Definition: iter_affine_map.h:211
Array< IterSplitExpr > args
The args to the sum.
Definition: iter_affine_map.h:200
TVM_DECLARE_FINAL_OBJECT_INFO(IterSumExprNode, IterMapExprNode)
PrimExpr base
The base offset.
Definition: iter_affine_map.h:202
Managed reference to IterSumExprNode.
Definition: iter_affine_map.h:220
IterSumExpr(Array< IterSplitExpr > args, PrimExpr base)
constructor.
TVM_DEFINE_OBJECT_REF_COW_METHOD(IterSumExprNode)
TVM_DEFINE_OBJECT_REF_METHODS(IterSumExpr, IterMapExpr, IterSumExprNode)
A new diagnostic interface for TVM error reporting.
Array< Array< IterMark > > SubspaceDivide(const Array< PrimExpr > &bindings, const Map< Var, Range > &input_iters, const Array< Var > &sub_iters, const PrimExpr &predicate, IterMapLevel check_level, arith::Analyzer *analyzer, bool simplify_trivial_iterators=true)
Detect if bindings can be written as [a_0*e_0 + b_0 + c_0, a_1*e_1 + b_1, ..., a_n*e_n + b_n].
IterMapLevel
Mapping level for iterators.
Definition: iter_affine_map.h:234
@ NoCheck
Definition: iter_affine_map.h:240
@ Bijective
Definition: iter_affine_map.h:236
@ Surjective
Definition: iter_affine_map.h:238
PrimExpr NormalizeIterMapToExpr(const PrimExpr &expr)
Given an expression that may contain IterMapExpr, transform it to normal PrimExpr.
Array< PrimExpr > IterMapSimplify(const Array< PrimExpr > &indices, const Map< Var, Range > &input_iters, const PrimExpr &input_pred, IterMapLevel check_level, arith::Analyzer *analyzer, bool simplify_trivial_iterators=true)
Use IterVarMap detector to rewrite and simplify the indices.
IterMapResult DetectIterMap(const Array< PrimExpr > &indices, const Map< Var, Range > &input_iters, const PrimExpr &predicate, IterMapLevel check_level, arith::Analyzer *analyzer, bool simplify_trivial_iterators=true)
Detect if indices can be written as [y_0 + c_0, y_1 + c_1, ..., y_n + c_n].
IterSumExpr NormalizeToIterSum(PrimExpr index, const Map< Var, Range > &input_iters, arith::Analyzer *analyzer)
Rewrite index as IterSumExpr.
Map< Var, PrimExpr > InverseAffineIterMap(const Array< IterSumExpr > &iter_map, const Array< PrimExpr > outputs)
Apply the inverse of the affine transformation to the outputs.
Definition: repr_printer.h:91
Performance counters for profiling via the PAPI library.
Definition: analyzer.h:37