blob: b3eda5205fb0ce9d64a3b3e911032ffdd905fb3d (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
|
//===- 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_
|
