#include "mlir/Analysis/Presburger/Simplex.h"
#include "mlir/Analysis/Presburger/Fraction.h"
#include "mlir/Analysis/Presburger/IntegerRelation.h"
#include "mlir/Analysis/Presburger/Matrix.h"
#include "mlir/Analysis/Presburger/PresburgerSpace.h"
#include "mlir/Analysis/Presburger/Utils.h"
#include "llvm/ADT/DynamicAPInt.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/ADT/SmallBitVector.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/Support/Compiler.h"
#include "llvm/Support/ErrorHandling.h"
#include "llvm/Support/raw_ostream.h"
#include <cassert>
#include <functional>
#include <limits>
#include <optional>
#include <tuple>
#include <utility>
Go to the source code of this file.
|
| class | mlir::presburger::GBRSimplex |
| | Given a simplex for a polytope, construct a new simplex whose variables are identified with a pair of points (x, y) in the original polytope. More...
|
◆ Direction
◆ isRangeDivisibleBy()
| bool isRangeDivisibleBy |
( |
ArrayRef< DynamicAPInt > | range, |
|
|
const DynamicAPInt & | divisor ) |
|
static |
◆ scaleAndAddForAssert()
| SmallVector< DynamicAPInt, 8 > scaleAndAddForAssert |
( |
ArrayRef< DynamicAPInt > | a, |
|
|
const DynamicAPInt & | scale, |
|
|
ArrayRef< DynamicAPInt > | b ) |
|
static |
◆ nullIndex
| const int nullIndex = std::numeric_limits<int>::max() |