int_set.h File Reference

Integer set. More...

#include <tvm/ir/expr.h>
#include <tvm/ir/prim/expr.h>
#include <tvm/tirx/var.h>
#include <unordered_map>

Include dependency graph for int_set.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	tvm::arith::IntSetNode
	Base class of all Integer set containers. represent a set of integers in one dimension. More...
class	tvm::arith::IntSet
	Managed reference to IntSetNode. More...

Namespaces
namespace	tvm
	An object that builds and maintains block scope and StmtSref mapping for Dependence analysis.
namespace	tvm::arith
	namespace of arithmetic analysis.

Typedefs
using	tvm::arith::ExprIntSetMap = std::unordered_map< PrimExpr, IntSet, ffi::ObjectPtrHash, ffi::ObjectPtrEqual >
	Map from Expr to IntSet.

Enumerations
enum	tvm::arith::SignType { tvm::arith::kPositive , tvm::arith::kNegative , tvm::arith::kZero , tvm::arith::kUnknown }
	Sign type of an integer expression. More...

Functions
ffi::Map< Var, IntSet >	tvm::arith::ConvertDomMap (const std::unordered_map< const VarNode *, IntSet > &dom_map)
	Convert std::unordered_map<const VarNode*, IntSet> to ffi::Map<Var, IntSet>
IntSet	tvm::arith::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 iteration variables.
IntSet	tvm::arith::EvalSet (PrimExpr e, const ffi::Map< Var, IntSet > &dom_map)
	Find an symbolic integer set that contains all possible values of e given the domain of each variables.
IntSet	tvm::arith::EvalSet (PrimExpr e, const std::unordered_map< const tirx::VarNode *, IntSet > &dom_map)
	Same as EvalSet, but takes unordered_map.
IntSet	tvm::arith::EvalSet (Range r, const ffi::Map< IterVar, IntSet > &dom_map)
	Find an symbolic integer set that contains is union over all the possible conditional values in dom_map.
IntSet	tvm::arith::EvalSet (IntSet s, const std::unordered_map< const VarNode *, IntSet > &dom_map)
	Find an symbolic integer set that contains is union over all the possible conditional values in dom_map.
IntSet	tvm::arith::EvalSet (Range r, const std::unordered_map< const VarNode *, IntSet > &dom_map)
	Same as EvalSet, but takes unordered_map.
ffi::Array< IntSet >	tvm::arith::EvalSet (const ffi::Array< Range > &region, const ffi::Map< Var, IntSet > &dom_map)
	Same as EvalSet, but takes ffi::Array<Range>
ExprIntSetMap	tvm::arith::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	tvm::arith::Union (const ffi::Array< IntSet > &sets)
	Create a union set of all sets, possibly relaxed.
ffi::Array< IntSet >	tvm::arith::UnionRegion (const ffi::Array< ffi::Array< IntSet > > &nd_int_sets)
	The union of N-dimensional integer sets.
IntSet	tvm::arith::UnionLowerBound (const ffi::Array< IntSet > &sets)
	Create a lower-bound of union set, where some of the segments may be dropped.
ffi::Array< IntSet >	tvm::arith::UnionRegionLowerBound (const ffi::Array< ffi::Array< IntSet > > &nd_int_sets)
	The union of N-dimensional integer sets.
IntSet	tvm::arith::Intersect (const ffi::Array< IntSet > &sets)
	Create an intersected set of all sets.
ffi::Map< Var, arith::IntSet >	tvm::arith::AsIntSet (const ffi::Map< Var, Range > &var_dom)
	Converts the Ranges to IntSets.
ffi::Optional< ffi::Array< IntSet > >	tvm::arith::EstimateRegionStrictBound (const ffi::Array< Range > &region, const ffi::Map< Var, Range > &var_dom, const PrimExpr &predicate, const arith::Analyzer &analyzer)
	Analyze the region with affine map, given the domain of variables and their predicate. The result should be strict, i.e. no region is discarded or relaxed.
ffi::Optional< ffi::Array< IntSet > >	tvm::arith::EstimateRegionLowerBound (const ffi::Array< Range > &region, const ffi::Map< Var, Range > &var_dom, const PrimExpr &predicate, const arith::Analyzer &analyzer)
	Analyze the region with affine map, given the domain of variables and their predicate. Some subregion may be discarded during the lower-bound analysis.
ffi::Array< IntSet >	tvm::arith::EstimateRegionUpperBound (const ffi::Array< Range > &region, const ffi::Map< Var, Range > &var_dom, const PrimExpr &predicate, const arith::Analyzer &analyzer)
	Analyze the region with affine map, given the domain of variables and their predicate Relaxation of the region may be used in upper-bound analysis, i.e. some extra region may be added to the result.

Detailed Description

Integer set.