24 #ifndef TVM_ARITH_INT_SET_H_
25 #define TVM_ARITH_INT_SET_H_
30 #include <unordered_map>
241 using ExprIntSetMap = std::unordered_map<PrimExpr, IntSet, ObjectPtrHash, ObjectPtrEqual>;
251 const std::unordered_map<const VarNode*, IntSet>& dom_map);
Reference to PrimExprNode.
Definition: expr.h:115
Range container
Definition: expr.h:725
Analyzer that contains bunch of sub-analyzers.
Definition: analyzer.h:629
Base class of all Integer set containers. represent a set of integers in one dimension.
Definition: int_set.h:57
TVM_DECLARE_BASE_OBJECT_INFO(IntSetNode, Object)
static constexpr const char * _type_key
Definition: int_set.h:59
static constexpr bool _type_has_method_sequal_reduce
Definition: int_set.h:60
Managed reference to IntSetNode.
Definition: int_set.h:68
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.
TVM_DEFINE_OBJECT_REF_METHODS(IntSet, ObjectRef, IntSetNode)
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.
static IntSet Everything()
PrimExpr PointValue() const
The single point value, call only if IsSinglePoint is true.
Array, container representing a contiguous sequence of ObjectRefs.
Definition: array.h:289
Map container of NodeRef->NodeRef in DSL graph. Map implements copy on write semantics,...
Definition: map.h:1271
Base class of all object reference.
Definition: object.h:519
base class of all object containers.
Definition: object.h:171
Optional container that to represent to a Nullable variant of T.
Definition: optional.h:51
std::unordered_map< PrimExpr, IntSet, ObjectPtrHash, ObjectPtrEqual > ExprIntSetMap
Map from Expr to IntSet.
Definition: int_set.h:241
Optional< Array< IntSet > > EstimateRegionLowerBound(const Array< Range > ®ion, const 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....
Map< Var, IntSet > ConvertDomMap(const std::unordered_map< const VarNode *, IntSet > &dom_map)
Convert std::unordered_map<const VarNode*, IntSet> to Map<Var, IntSet>
Array< IntSet > UnionRegionLowerBound(const Array< Array< IntSet >> &nd_int_sets)
The union of N-dimensional integer sets.
IntSet Union(const Array< IntSet > &sets)
Create a union set of all sets, possibly relaxed.
IntSet EvalSet(PrimExpr e, const Map< IterVar, IntSet > &dom_map)
Find an symbolic integer set that contains all possible values of e given the domain of each iteratio...
Map< Var, arith::IntSet > AsIntSet(const Map< Var, Range > &var_dom)
Converts the Ranges to IntSets.
Optional< Array< IntSet > > EstimateRegionStrictBound(const Array< Range > ®ion, const 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....
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 UnionLowerBound(const Array< IntSet > &sets)
Create a lower-bound of union set, where some of the segments may be dropped.
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
Array< IntSet > UnionRegion(const Array< Array< IntSet >> &nd_int_sets)
The union of N-dimensional integer sets.
IntSet Intersect(const Array< IntSet > &sets)
Create an intersected set of all sets.
Array< IntSet > EstimateRegionUpperBound(const Array< Range > ®ion, const 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...
runtime implementation for LibTorch/TorchScript.
Definition: analyzer.h:36