MLIR
20.0.0git
|
#include "mlir/Analysis/Presburger/Fraction.h"
#include "mlir/Analysis/Presburger/IntegerRelation.h"
#include "mlir/Analysis/Presburger/Matrix.h"
#include "mlir/Analysis/Presburger/PWMAFunction.h"
#include "mlir/Analysis/Presburger/Utils.h"
#include "llvm/ADT/SmallBitVector.h"
#include <optional>
Go to the source code of this file.
Classes | |
class | mlir::presburger::SimplexBase |
The Simplex class implements a version of the Simplex and Generalized Basis Reduction algorithms, which can perform analysis of integer sets with affine inequalities and equalities. More... | |
struct | mlir::presburger::SimplexBase::Unknown |
An Unknown is either a variable or a constraint. More... | |
struct | mlir::presburger::SimplexBase::Pivot |
class | mlir::presburger::LexSimplexBase |
Simplex class using the lexicographic pivot rule. More... | |
class | mlir::presburger::LexSimplex |
A class for lexicographic optimization without any symbols. More... | |
struct | mlir::presburger::SymbolicLexOpt |
Represents the result of a symbolic lexicographic optimization computation. More... | |
class | mlir::presburger::SymbolicLexSimplex |
A class to perform symbolic lexicographic optimization, i.e., to find, for every assignment to the symbols the specified symbolDomain , the lexicographically minimum value integer value attained by the non-symbol variables. More... | |
class | mlir::presburger::Simplex |
The Simplex class uses the Normal pivot rule and supports integer emptiness checks as well as detecting redundancies. More... | |
class | mlir::presburger::SimplexRollbackScopeExit |
Takes a snapshot of the simplex state on construction and rolls back to the snapshot on destruction. More... | |
Namespaces | |
mlir | |
Include the generated interface declarations. | |
mlir::presburger | |