48 #ifndef TVM_ARITH_ITER_AFFINE_MAP_H_
49 #define TVM_ARITH_ITER_AFFINE_MAP_H_
52 #include <tvm/ffi/reflection/registry.h>
102 refl::ObjectDef<IterMarkNode>()
146 refl::ObjectDef<IterSplitExprNode>()
196 ffi::Array<IterSplitExpr>
args;
202 refl::ObjectDef<IterSumExprNode>()
262 refl::ObjectDef<IterMapResultNode>()
307 const ffi::Map<Var, Range>& input_iters,
const PrimExpr& predicate,
309 bool simplify_trivial_iterators =
true);
323 const ffi::Map<Var, Range>& input_iters,
326 bool simplify_trivial_iterators =
true);
349 const ffi::Array<PrimExpr> outputs);
378 ffi::Array<ffi::Array<IterMark>>
SubspaceDivide(
const ffi::Array<PrimExpr>& bindings,
379 const ffi::Map<Var, Range>& input_iters,
380 const ffi::Array<Var>& sub_iters,
383 bool simplify_trivial_iterators =
true);
Algebra expression simplifications.
Base node of all primitive expressions.
Definition: expr.h:91
Reference to PrimExprNode.
Definition: expr.h:124
Analyzer that contains bunch of sub-analyzers.
Definition: analyzer.h:634
Base class of all iter map expressions.
Definition: iter_affine_map.h:67
static constexpr const uint32_t _type_child_slots
Definition: iter_affine_map.h:69
TVM_FFI_DECLARE_OBJECT_INFO("arith.IterMapExpr", IterMapExprNode, PrimExprNode)
Managed reference to IterMapExprNode.
Definition: iter_affine_map.h:77
TVM_FFI_DEFINE_OBJECT_REF_METHODS_NULLABLE(IterMapExpr, PrimExpr, IterMapExprNode)
Result of DetectIterMap.
Definition: iter_affine_map.h:241
ffi::Array< ffi::String > errors
Definition: iter_affine_map.h:248
TVM_FFI_DECLARE_OBJECT_INFO_FINAL("arith.IterMapResult", IterMapResultNode, Object)
ffi::Array< IterSumExpr > indices
Definition: iter_affine_map.h:244
static void RegisterReflection()
Definition: iter_affine_map.h:260
PrimExpr padding_predicate
Boolean expression indicating if a specific value w.
Definition: iter_affine_map.h:258
Managed reference to IterMapResultNode.
Definition: iter_affine_map.h:274
IterMapResult()
Definition: iter_affine_map.h:277
IterMapResultNode * operator->() const
Definition: iter_affine_map.h:280
Mark the source as an iterator in [0, extent).
Definition: iter_affine_map.h:88
PrimExpr extent
The extent of the iteration.
Definition: iter_affine_map.h:98
static constexpr TVMFFISEqHashKind _type_s_eq_hash_kind
Definition: iter_affine_map.h:107
PrimExpr source
The source expression, can either be a IterSumExpr or a Var.
Definition: iter_affine_map.h:94
static void RegisterReflection()
Definition: iter_affine_map.h:100
TVM_FFI_DECLARE_OBJECT_INFO_FINAL("arith.IterMark", IterMarkNode, Object)
Managed reference to IterMarkExprNode.
Definition: iter_affine_map.h:115
TVM_DEFINE_OBJECT_REF_COW_METHOD(IterMarkNode)
IterMark(PrimExpr source, PrimExpr extent)
constructor.
TVM_FFI_DEFINE_OBJECT_REF_METHODS_NULLABLE(IterMark, ObjectRef, IterMarkNode)
Split of an iterator.
Definition: iter_affine_map.h:133
TVM_FFI_DECLARE_OBJECT_INFO_FINAL("arith.IterSplitExpr", IterSplitExprNode, IterMapExprNode)
PrimExpr lower_factor
The lower factor to split the source.
Definition: iter_affine_map.h:138
IterMark source
The source marked iterator.
Definition: iter_affine_map.h:136
PrimExpr scale
Additional scale.
Definition: iter_affine_map.h:142
static void RegisterReflection()
Definition: iter_affine_map.h:144
static constexpr TVMFFISEqHashKind _type_s_eq_hash_kind
Definition: iter_affine_map.h:153
PrimExpr extent
The extent of the split.
Definition: iter_affine_map.h:140
Managed reference to IterSplitExprNode.
Definition: iter_affine_map.h:161
TVM_DEFINE_OBJECT_REF_COW_METHOD(IterSplitExprNode)
IterSplitExpr(IterMark source, PrimExpr lower_factor, PrimExpr extent, PrimExpr scale)
constructor
TVM_FFI_DEFINE_OBJECT_REF_METHODS_NULLABLE(IterSplitExpr, IterMapExpr, IterSplitExprNode)
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:193
ffi::Array< IterSplitExpr > args
The args to the sum.
Definition: iter_affine_map.h:196
static void RegisterReflection()
Definition: iter_affine_map.h:200
static constexpr TVMFFISEqHashKind _type_s_eq_hash_kind
Definition: iter_affine_map.h:207
PrimExpr base
The base offset.
Definition: iter_affine_map.h:198
TVM_FFI_DECLARE_OBJECT_INFO_FINAL("arith.IterSumExpr", IterSumExprNode, IterMapExprNode)
Managed reference to IterSumExprNode.
Definition: iter_affine_map.h:215
IterSumExpr(ffi::Array< IterSplitExpr > args, PrimExpr base)
constructor.
TVM_FFI_DEFINE_OBJECT_REF_METHODS_NULLABLE(IterSumExpr, IterMapExpr, IterSumExprNode)
TVM_DEFINE_OBJECT_REF_COW_METHOD(IterSumExprNode)
A new diagnostic interface for TVM error reporting.
ffi::Array< ffi::Array< IterMark > > SubspaceDivide(const ffi::Array< PrimExpr > &bindings, const ffi::Map< Var, Range > &input_iters, const ffi::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:229
@ NoCheck
Definition: iter_affine_map.h:235
@ Bijective
Definition: iter_affine_map.h:231
@ Surjective
Definition: iter_affine_map.h:233
IterMapResult DetectIterMap(const ffi::Array< PrimExpr > &indices, const ffi::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].
ffi::Array< PrimExpr > IterMapSimplify(const ffi::Array< PrimExpr > &indices, const ffi::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.
PrimExpr NormalizeIterMapToExpr(const PrimExpr &expr)
Given an expression that may contain IterMapExpr, transform it to normal PrimExpr.
ffi::Map< Var, PrimExpr > InverseAffineIterMap(const ffi::Array< IterSumExpr > &iter_map, const ffi::Array< PrimExpr > outputs)
Apply the inverse of the affine transformation to the outputs.
IterSumExpr NormalizeToIterSum(PrimExpr index, const ffi::Map< Var, Range > &input_iters, arith::Analyzer *analyzer)
Rewrite index as IterSumExpr.
Definition: repr_printer.h:91
Performance counters for profiling via the PAPI library.
Definition: analyzer.h:37