24 #ifndef TVM_ARITH_INT_SET_H_
25 #define TVM_ARITH_INT_SET_H_
30 #include <unordered_map>
176 ffi::Map<Var, IntSet>
ConvertDomMap(
const std::unordered_map<const VarNode*, IntSet>& dom_map);
237 ffi::Array<IntSet>
EvalSet(
const ffi::Array<Range>& region,
const ffi::Map<Var, IntSet>& dom_map);
239 using ExprIntSetMap = std::unordered_map<PrimExpr, IntSet, ObjectPtrHash, ObjectPtrEqual>;
249 const std::unordered_map<const VarNode*, IntSet>& dom_map);
263 ffi::Array<IntSet>
UnionRegion(
const ffi::Array<ffi::Array<IntSet>>& nd_int_sets);
291 ffi::Map<Var, arith::IntSet>
AsIntSet(
const ffi::Map<Var, Range>& var_dom);
304 const ffi::Array<Range>& region,
const ffi::Map<Var, Range>& var_dom,
const PrimExpr& predicate,
318 const ffi::Array<Range>& region,
const ffi::Map<Var, Range>& var_dom,
const PrimExpr& predicate,
332 const ffi::Map<Var, Range>& var_dom,
Reference to PrimExprNode.
Definition: expr.h:124
Range container
Definition: expr.h:689
Analyzer that contains bunch of sub-analyzers.
Definition: analyzer.h:634
Base class of all Integer set containers. represent a set of integers in one dimension.
Definition: int_set.h:57
TVM_FFI_DECLARE_OBJECT_INFO("ir.IntSet", IntSetNode, Object)
Managed reference to IntSetNode.
Definition: int_set.h:66
static IntSet Vector(PrimExpr vec)
construct a integer set from vector expression.
bool MatchRange(const tvm::Range &r) const
Try to match IntSet with range r.
Range CoverRange(Range max_range) const
Find a range that covers the region.
bool HasLowerBound() const
static IntSet SinglePoint(PrimExpr point)
construct a point set.
static IntSet FromMinExtent(PrimExpr min, PrimExpr extent)
Construct a set representing a range [min, min + extent).
bool CanProveNonPositive() const
bool IsSinglePoint() const
bool HasUpperBound() const
bool CanProveSinglePoint(Analyzer *ana) const
Check if we can prove it is a single point.
bool IsEverything() const
bool CanProveNonNegative() const
SignType GetSignType() const
static IntSet Interval(PrimExpr min, PrimExpr max)
Construct a set representing a interval.
bool CanProveNegative() const
bool CanProvePositive() const
static IntSet FromRange(tvm::Range r)
Construct a set representing a range.
TVM_FFI_DEFINE_OBJECT_REF_METHODS_NULLABLE(IntSet, ObjectRef, IntSetNode)
static IntSet Everything()
PrimExpr PointValue() const
The single point value, call only if IsSinglePoint is true.
std::unordered_map< PrimExpr, IntSet, ObjectPtrHash, ObjectPtrEqual > ExprIntSetMap
Map from Expr to IntSet.
Definition: int_set.h:239
ffi::Map< Var, arith::IntSet > AsIntSet(const ffi::Map< Var, Range > &var_dom)
Converts the Ranges to IntSets.
ffi::Optional< ffi::Array< IntSet > > EstimateRegionLowerBound(const ffi::Array< Range > ®ion, const ffi::Map< Var, Range > &var_dom, const PrimExpr &predicate, arith::Analyzer *analyzer)
Analyze the region with affine map, given the domain of variables and their predicate....
IntSet UnionLowerBound(const ffi::Array< IntSet > &sets)
Create a lower-bound of union set, where some of the segments may be dropped.
ffi::Array< IntSet > UnionRegionLowerBound(const ffi::Array< ffi::Array< IntSet >> &nd_int_sets)
The union of N-dimensional integer sets.
ffi::Array< IntSet > EstimateRegionUpperBound(const ffi::Array< Range > ®ion, const ffi::Map< Var, Range > &var_dom, const PrimExpr &predicate, arith::Analyzer *analyzer)
Analyze the region with affine map, given the domain of variables and their predicate Relaxation of t...
ExprIntSetMap EvalSetForEachSubExpr(PrimExpr e, const std::unordered_map< const VarNode *, IntSet > &dom_map)
Find the integer set of every sub-expression, given the domain of each iteration variables.
IntSet Union(const ffi::Array< IntSet > &sets)
Create a union set of all sets, possibly relaxed.
IntSet Intersect(const ffi::Array< IntSet > &sets)
Create an intersected set of all sets.
ffi::Optional< ffi::Array< IntSet > > EstimateRegionStrictBound(const ffi::Array< Range > ®ion, const ffi::Map< Var, Range > &var_dom, const PrimExpr &predicate, arith::Analyzer *analyzer)
Analyze the region with affine map, given the domain of variables and their predicate....
SignType
Sign type of an integer expression.
Definition: int_set.h:50
@ kNegative
Definition: int_set.h:50
@ kPositive
Definition: int_set.h:50
@ kUnknown
Definition: int_set.h:50
@ kZero
Definition: int_set.h:50
ffi::Map< Var, IntSet > ConvertDomMap(const std::unordered_map< const VarNode *, IntSet > &dom_map)
Convert std::unordered_map<const VarNode*, IntSet> to ffi::Map<Var, IntSet>
ffi::Array< IntSet > UnionRegion(const ffi::Array< ffi::Array< IntSet >> &nd_int_sets)
The union of N-dimensional integer sets.
IntSet EvalSet(PrimExpr e, const ffi::Map< IterVar, IntSet > &dom_map)
Find an symbolic integer set that contains all possible values of e given the domain of each iteratio...
Performance counters for profiling via the PAPI library.
Definition: analyzer.h:37