80610c2f49
- Introduce Fourier-Motzkin variable elimination to eliminate a dimension from a system of linear equalities/inequalities. Update isEmpty to use this. Since FM is only exact on rational/real spaces, an emptiness check based on this is guaranteed to be exact whenever it says the underlying set is empty; if it says, it's not empty, there may still be no integer points in it. Also, supports a version that computes "dark shadows". - Test this by checking for "always false" conditionals in if statements. - Unique IntegerSet's that are small (few constraints, few variables). This basically means the canonical empty set and other small sets that are likely commonly used get uniqued; allows checking for the canonical empty set by pointer. IntegerSet::kUniquingThreshold gives the threshold constraint size for uniqui'ing. - rename simplify-affine-expr -> simplify-affine-structures Other cleanup - IntegerSet::numConstraints, AffineMap::numResults are no longer needed; remove them. - add copy assignment operators for AffineMap, IntegerSet. - rename Invalid() -> Null() on AffineExpr, AffineMap, IntegerSet - Misc cleanup for FlatAffineConstraints API PiperOrigin-RevId: 218690456
46 lines
1.4 KiB
C++
46 lines
1.4 KiB
C++
//===- IntegerSetDetail.h - MLIR IntegerSet storage details -----*- C++ -*-===//
|
|
//
|
|
// Copyright 2019 The MLIR Authors.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
// =============================================================================
|
|
//
|
|
// This holds implementation details of IntegerSet.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef INTEGERSETDETAIL_H_
|
|
#define INTEGERSETDETAIL_H_
|
|
|
|
#include "mlir/IR/AffineExpr.h"
|
|
#include "llvm/ADT/ArrayRef.h"
|
|
|
|
namespace mlir {
|
|
namespace detail {
|
|
|
|
struct IntegerSetStorage {
|
|
unsigned dimCount;
|
|
unsigned symbolCount;
|
|
|
|
/// Array of affine constraints: a constraint is either an equality
|
|
/// (affine_expr == 0) or an inequality (affine_expr >= 0).
|
|
ArrayRef<AffineExpr> constraints;
|
|
|
|
// Bits to check whether a constraint is an equality or an inequality.
|
|
ArrayRef<bool> eqFlags;
|
|
};
|
|
|
|
} // end namespace detail
|
|
} // end namespace mlir
|
|
#endif // INTEGERSETDETAIL_H_
|