| /llvm-project/mlir/unittests/Analysis/Presburger/ |
| H A D | ParserTest.cpp | 35 for (const auto &ineq : ineqs) local
|
| H A D | IntegerPolyhedronTest.cpp | 39 for (const auto &ineq : ineqs) in makeSetFromConstraints() local
122 for (const auto &ineq : ineqs) in checkPermutationsSample() local
|
| H A D | SimplexTest.cpp | 128 for (const auto &ineq : ineqs) in simplexFromConstraints() local
|
| /llvm-project/mlir/lib/Analysis/Presburger/ |
| H A D | LinearTransform.cpp | 59 ArrayRef<DynamicAPInt> ineq = rel.getInequality(i); in applyTo() local
|
| H A D | Utils.cpp | 322 SmallVector<DynamicAPInt, 8> ineq(dividend); in getDivUpperBound() local
334 SmallVector<DynamicAPInt, 8> ineq(dividend.size()); in getDivLowerBound() local
382 presburger::getComplementIneq(ArrayRef<DynamicAPInt> ineq) { in getComplementIneq() argument
[all...] |
| H A D | PresburgerRelation.cpp | 555 SmallVector<DynamicAPInt, 8> ineq = getSetDifference() local
573 SmallVector<DynamicAPInt, 8> ineq = getSetDifference() local
845 isFacetContained(ArrayRef<DynamicAPInt> ineq,Simplex & simp) isFacetContained() argument
927 typeInequality(ArrayRef<DynamicAPInt> ineq,Simplex & simp) typeInequality() argument
[all...] |
| H A D | Barvinok.cpp | 415 SmallVector<DynamicAPInt> ineq(numVars + 1); in computePolytopeGeneratingFunction() local
|
| H A D | IntegerRelation.cpp | 2018 SmallVector<DynamicAPInt, 4> ineq; fourierMotzkinEliminate() local
2055 SmallVector<DynamicAPInt, 4> ineq; fourierMotzkinEliminate() local
[all...] |
| H A D | Simplex.cpp | 1304 SmallVector<DynamicAPInt, 8> ineq(coeffs.begin(), coeffs.end()); addDivisionVariable() local
|
| /llvm-project/polly/lib/External/isl/ |
| H A D | isl_convex_hull.c | 1518 int ineq; member
1531 isl_int *con, unsigned len, int n, int ineq) in update_constraint()
1694 isl_int *ineq = set->p[s]->ineq[i]; in common_constraints() local
1720 isl_int *ineq = set->p[s]->ineq[i]; in common_constraints() local
2043 isl_int *ineq, unsigned len) in hash_ineq()
2125 isl_int *ineq, int shift) in is_bound()
2168 int i, isl_int *ineq, uint32_t c_hash, struct ineq_cmp_data *v) in set_max_constant_term()
2221 struct sh_data *data, __isl_keep isl_set *set, int i, isl_int *ineq, in add_bound()
2696 __isl_keep isl_set *set, isl_int *ineq) in add_bound_from_constraint()
2772 __isl_take isl_set *set, int n_ineq, isl_int **ineq) in uset_unshifted_simple_hull_from_constraints()
[all …]
|
| H A D | isl_tab_pip.c | 907 struct isl_vec *ineq; in get_row_parameter_ineq() local
1014 struct isl_vec *ineq; in ineq_for_div() local
1657 static struct isl_tab *add_lexmin_ineq(struct isl_tab *tab, isl_int *ineq) in add_lexmin_ineq()
1917 static struct isl_tab *check_samples(struct isl_tab *tab, isl_int *ineq, int eq) in check_samples()
2016 static int tab_has_valid_sample(struct isl_tab *tab, isl_int *ineq, int eq) in tab_has_valid_sample()
2416 struct isl_vec *ineq = NULL; in best_split() local
2511 static void context_lex_add_ineq(struct isl_context *context, isl_int *ineq, in context_lex_add_ineq()
2533 static isl_stat context_lex_add_ineq_wrap(void *user, isl_int *ineq) in context_lex_add_ineq_wrap()
2543 static enum isl_tab_row_sign tab_ineq_sign(struct isl_tab *tab, isl_int *ineq, in tab_ineq_sign()
2581 isl_int *ineq, int strict) in context_lex_ineq_sign()
[all …]
|
| H A D | isl_map_simplify.c | 739 static int hash_index_ineq(struct isl_constraint_index *ci, isl_int **ineq) in hash_index_ineq()
801 isl_int *ineq) in constraint_index_is_redundant()
1118 __isl_take isl_basic_map *bmap, int div, int ineq) in set_div_from_lower_bound()
1138 int div, int ineq) in ok_to_set_div_from_bound()
1175 int div, int ineq) in better_div_constraint()
2055 static isl_stat mark_shifted_constraints(__isl_keep isl_mat *ineq, in mark_shifted_constraints()
2385 __isl_take isl_basic_set *context, __isl_keep isl_mat *ineq, int *row) in drop_irrelevant_constraints_marked()
2484 __isl_take isl_basic_set *bset, __isl_take isl_mat *ineq, in update_ineq_free()
2531 __isl_take isl_mat *ineq, __isl_take isl_basic_set *context) in uset_gist_full()
2631 isl_mat *ineq; in extract_ineq() local
[all …]
|
| H A D | isl_coalesce.c | 47 static int status_in(isl_int *ineq, struct isl_tab *tab) in status_in()
106 int *ineq = isl_calloc_array(bmap_i->ctx, int, bmap_i->n_ineq); in ineq_status_in() local
205 int *ineq; member
858 static isl_bool is_affected(__isl_keep isl_basic_map *bmap, int ineq, in is_affected()
894 int ineq, __isl_take isl_vec *v) in try_tightening()
1292 isl_int *ineq, unsigned len, __isl_keep isl_set *set, int negate) in add_wrap()
1984 static enum isl_ineq_type type_of_relaxed(struct isl_tab *tab, isl_int *ineq) in type_of_relaxed()
3064 isl_vec *ineq; in fix_constant_divs() local
|
| H A D | isl_map_private.h | 68 isl_int **ineq; member
|
| H A D | isl_tab.c | 1896 isl_stat isl_tab_add_ineq(struct isl_tab *tab, isl_int *ineq) in isl_tab_add_ineq()
2205 struct isl_vec *ineq; in ineq_for_div() local
2242 struct isl_vec *ineq; in add_div_constraints() local
4090 enum isl_ineq_type isl_tab_ineq_type(struct isl_tab *tab, isl_int *ineq) in isl_tab_ineq_type()
|
| H A D | isl_farkas.c | 414 static int is_ray(__isl_keep isl_basic_set *bset, int ineq) in is_ray()
|
| H A D | isl_aff.c | 2274 isl_constraint *ineq; in aff_pos_basic_set() local
2311 isl_constraint *ineq; in aff_nonneg_basic_set() local
2366 isl_constraint *ineq; in aff_zero_basic_set() local
4898 __isl_keep isl_basic_map *bmap, int pos, int eq, int div, int ineq, in extract_aff_from_equality()
4974 int eq, div, ineq; in extract_isl_aff_from_basic_map() local
|
| H A D | isl_scheduler.c | 2351 isl_size eq, ineq; in update_count() local
2552 isl_vec *ineq; in node_add_coefficient_constraints() local
|
| H A D | isl_map.c | 1843 isl_int *ineq) in isl_basic_map_add_ineq()
1864 isl_int *ineq) in isl_basic_set_add_ineq()
11829 int pos, int *div, int *ineq) in isl_basic_map_output_defining_equality()
12954 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1, in isl_basic_map_from_constraint_matrices()
13058 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1, in isl_basic_set_from_constraint_matrices()
14355 __isl_keep isl_basic_set *bset, int ineq) in is_internal()
|
| H A D | isl_output.c | 64 struct isl_basic_map *bmap, int ineq, int n, __isl_take isl_printer *p) in print_constraint_polylib()
|
| /llvm-project/mlir/lib/Analysis/ |
| H A D | FlatLinearValueConstraints.cpp | 477 auto ineq = getInequality64(idx); in getLowerAndUpperBound() local
495 auto ineq = getInequality64(idx); in getLowerAndUpperBound() local
761 SmallVector<int64_t> ineq(getNumCols(), 0); in addBound() local
[all...] |
| /llvm-project/mlir/lib/Dialect/Affine/Analysis/ |
| H A D | Utils.cpp | 1289 SmallVector<int64_t, 4> ineq(rank + 1, 0); in boundCheckLoadOrStoreOp() local
2139 SmallVector<int64_t> ineq(newConstr.getNumCols(), 0); in simplifyConstrainedMinMaxOp() local
[all...] |