/external/llvm-project/polly/lib/External/isl/ |
D | isl_map_simplify.c | 41 isl_int *t = bmap->ineq[a]; in swap_inequality() 42 bmap->ineq[a] = bmap->ineq[b]; in swap_inequality() 43 bmap->ineq[b] = t; in swap_inequality() 81 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd); in isl_basic_map_normalize_constraints() 83 if (isl_int_is_neg(bmap->ineq[i][0])) { in isl_basic_map_normalize_constraints() 92 isl_int_gcd(gcd, gcd, bmap->ineq[i][0]); in isl_basic_map_normalize_constraints() 95 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd); in isl_basic_map_normalize_constraints() 96 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total); in isl_basic_map_normalize_constraints() 327 if (isl_int_is_zero(bmap->ineq[k][1+pos])) in eliminate_var_using_equality() 331 isl_seq_elim(bmap->ineq[k], eq, 1+pos, 1+total, NULL); in eliminate_var_using_equality() [all …]
|
D | isl_convex_hull.c | 231 isl_seq_clr(lp->ineq[k], 1+lp_dim); in wrap_constraints() 232 isl_int_set_si(lp->ineq[k][1+dim*i], 1); in wrap_constraints() 243 isl_seq_clr(lp->ineq[k], 1+dim*i); in wrap_constraints() 244 isl_seq_cpy(lp->ineq[k]+1+dim*i, set->p[i]->ineq[j], dim); in wrap_constraints() 245 isl_seq_clr(lp->ineq[k]+1+dim*(i+1), dim*(set->n-i-1)); in wrap_constraints() 555 facet = compute_facet(set, hull->ineq[i]); in extend() 556 facet = isl_basic_set_add_eq(facet, hull->ineq[i]); in extend() 560 hull_facet = isl_basic_set_add_eq(hull_facet, hull->ineq[i]); in extend() 571 if (isl_seq_eq(facet->ineq[j], in extend() 572 hull_facet->ineq[f], 1 + dim)) in extend() [all …]
|
D | isl_coalesce.c | 47 static int status_in(isl_int *ineq, struct isl_tab *tab) in status_in() argument 49 enum isl_ineq_type type = isl_tab_ineq_type(tab, ineq); in status_in() 106 int *ineq = isl_calloc_array(bmap_i->ctx, int, bmap_i->n_ineq); in ineq_status_in() local 108 if (!ineq) in ineq_status_in() 113 ineq[k] = STATUS_REDUNDANT; in ineq_status_in() 116 ineq[k] = status_in(bmap_i->ineq[k], tab_j); in ineq_status_in() 117 if (ineq[k] == STATUS_ERROR) in ineq_status_in() 119 if (ineq[k] == STATUS_SEPARATE) in ineq_status_in() 123 return ineq; in ineq_status_in() 125 free(ineq); in ineq_status_in() [all …]
|
D | isl_tab_pip.c | 84 void (*add_ineq)(struct isl_context *context, isl_int *ineq, 90 isl_int *ineq, int strict); 92 int (*test_ineq)(struct isl_context *context, isl_int *ineq); 907 struct isl_vec *ineq; in get_row_parameter_ineq() local 909 ineq = isl_vec_alloc(tab->mat->ctx, 1 + tab->n_param + tab->n_div); in get_row_parameter_ineq() 910 if (!ineq) in get_row_parameter_ineq() 913 get_row_parameter_line(tab, row, ineq->el); in get_row_parameter_ineq() 914 if (ineq) in get_row_parameter_ineq() 915 ineq = isl_vec_normalize(ineq); in get_row_parameter_ineq() 917 return ineq; in get_row_parameter_ineq() [all …]
|
D | isl_constraint.c | 229 &bmap->ineq[i]); in isl_basic_map_foreach_constraint() 746 c = bmap->ineq[k]; in isl_basic_map_from_constraint() 840 if (isl_int_is_zero(bset->ineq[i][offset + pos])) in isl_basic_set_has_defining_inequalities() 842 if (isl_int_is_one(bset->ineq[i][offset + pos])) in isl_basic_set_has_defining_inequalities() 844 if (isl_int_is_negone(bset->ineq[i][offset + pos])) in isl_basic_set_has_defining_inequalities() 846 if (isl_seq_first_non_zero(bset->ineq[i]+offset+pos+1, in isl_basic_set_has_defining_inequalities() 850 if (!isl_seq_is_neg(bset->ineq[i]+1, bset->ineq[j]+1, in isl_basic_set_has_defining_inequalities() 853 isl_int_add(m, bset->ineq[i][0], bset->ineq[j][0]); in isl_basic_set_has_defining_inequalities() 854 if (isl_int_abs_ge(m, bset->ineq[i][offset+pos])) in isl_basic_set_has_defining_inequalities() 857 if (isl_int_is_pos(bset->ineq[i][offset+pos])) { in isl_basic_set_has_defining_inequalities() [all …]
|
D | isl_tab_lexopt_templ.c | 81 isl_seq_cpy(var->el, bmap->ineq[first] + 1 + n_in, n_out); in SF() 83 if (isl_seq_eq(var->el, bmap->ineq[i] + 1 + n_in, n_out) && in SF() 93 isl_seq_cpy(cst->row[i], bmap->ineq[list[i]], 1 + n_in); in SF() 107 isl_seq_clr(bmap->ineq[k], 1 + n_in); in SF() 108 isl_int_set_si(bmap->ineq[k][1 + n_in], 1); in SF() 109 isl_seq_cpy(bmap->ineq[k] + 1 + n_in + 1, var->el, n_out); in SF() 119 isl_seq_cpy(dom->ineq[k], cst->row[i], 1 + n_in); in SF() 120 isl_int_set_si(dom->ineq[k][1 + n_in], -1); in SF() 121 isl_seq_clr(dom->ineq[k] + 1 + n_in + 1, n_div); in SF()
|
D | isl_farkas.c | 279 bset->ineq[j][1 + i]); in farkas() 286 isl_seq_clr(dual->ineq[k], in farkas() 288 isl_int_set_si(dual->ineq[k][1 + shift + total + bset->n_eq + i], 1); in farkas() 295 isl_seq_clr(dual->ineq[k], 2 + total); in farkas() 296 isl_int_set_si(dual->ineq[k][1], 1); in farkas() 298 isl_int_neg(dual->ineq[k][2 + total + j], in farkas() 301 isl_int_neg(dual->ineq[k][2 + total + bset->n_eq + j], in farkas() 302 bset->ineq[j][0]); in farkas() 414 static int is_ray(__isl_keep isl_basic_set *bset, int ineq) in is_ray() argument 416 return isl_int_is_zero(bset->ineq[ineq][1]); in is_ray() [all …]
|
D | isl_sample.c | 96 if (isl_int_is_one(bset->ineq[0][1])) in interval_sample() 97 isl_int_neg(sample->block.data[1], bset->ineq[0][0]); in interval_sample() 99 isl_int_set(sample->block.data[1], bset->ineq[0][0]); in interval_sample() 102 bset->ineq[i], 2, &t); in interval_sample() 180 bset->ineq[i - bset->n_eq] + 1, tab->n_var); in tab_equalities() 804 isl_seq_cpy(shift->ineq[k] + 1, cone->ineq[i] + 1, total); in shift_cone() 805 isl_seq_inner_product(shift->ineq[k] + 1, vec->el + 1, total, in shift_cone() 806 &shift->ineq[k][0]); in shift_cone() 807 isl_int_cdiv_q(shift->ineq[k][0], in shift_cone() 808 shift->ineq[k][0], vec->el[0]); in shift_cone() [all …]
|
D | isl_point.c | 702 isl_seq_clr(bset->ineq[k] + 1, total); in isl_basic_set_box_from_points() 704 isl_int_set_si(bset->ineq[k][1 + i], -1); in isl_basic_set_box_from_points() 705 isl_int_set(bset->ineq[k][0], pnt1->vec->el[1 + i]); in isl_basic_set_box_from_points() 707 isl_int_set_si(bset->ineq[k][1 + i], 1); in isl_basic_set_box_from_points() 708 isl_int_neg(bset->ineq[k][0], pnt1->vec->el[1 + i]); in isl_basic_set_box_from_points() 710 isl_int_fdiv_q(bset->ineq[k][0], bset->ineq[k][0], pnt1->vec->el[0]); in isl_basic_set_box_from_points() 715 isl_seq_clr(bset->ineq[k] + 1, total); in isl_basic_set_box_from_points() 717 isl_int_set_si(bset->ineq[k][1 + i], 1); in isl_basic_set_box_from_points() 718 isl_int_neg(bset->ineq[k][0], pnt2->vec->el[1 + i]); in isl_basic_set_box_from_points() 720 isl_int_set_si(bset->ineq[k][1 + i], -1); in isl_basic_set_box_from_points() [all …]
|
D | isl_ilp.c | 60 isl_seq_cpy(unit_box->ineq[k], bset->ineq[i], 1 + total); in unit_box_base_points() 62 if (isl_int_is_nonneg(unit_box->ineq[k][1 + j])) in unit_box_base_points() 64 isl_int_add(unit_box->ineq[k][0], in unit_box_base_points() 65 unit_box->ineq[k][0], unit_box->ineq[k][1 + j]); in unit_box_base_points() 122 isl_seq_cpy(bset->ineq[k], f, 1 + total); in add_bounds() 123 isl_int_sub(bset->ineq[k][0], bset->ineq[k][0], l); in add_bounds() 128 isl_seq_neg(bset->ineq[k], f, 1 + total); in add_bounds() 129 isl_int_add(bset->ineq[k][0], bset->ineq[k][0], u); in add_bounds()
|
D | isl_map.c | 1242 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq); in basic_map_init() 1243 if ((n_ineq + n_eq) && !bmap->ineq) in basic_map_init() 1260 bmap->ineq[i] = bmap->block.data + i * row_size; in basic_map_init() 1268 bmap->eq = bmap->ineq + n_ineq; in basic_map_init() 1363 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total); in dup_constraints() 1456 free(bmap->ineq); in isl_basic_map_free() 1583 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size, in isl_basic_map_alloc_equality() 1589 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) { in isl_basic_map_alloc_equality() 1594 t = bmap->ineq[j]; in isl_basic_map_alloc_equality() 1595 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1]; in isl_basic_map_alloc_equality() [all …]
|
D | isl_transitive_closure.c | 84 c = bmap->ineq[k]; in set_path_length() 274 isl_seq_clr(path->ineq[k], 1 + total); in path_along_steps() 275 isl_int_set_si(path->ineq[k][1 + nparam + 2 * d + i], 1); in path_along_steps() 321 isl_seq_clr(bset->ineq[k], 1 + total); in parametric_constant_never_positive() 322 isl_seq_cpy(bset->ineq[k], c, 1 + nparam); in parametric_constant_never_positive() 326 isl_int_set(bset->ineq[k][1 + nparam + d + i], in parametric_constant_never_positive() 329 isl_int_sub_ui(bset->ineq[k][0], bset->ineq[k][0], 1); in parametric_constant_never_positive() 468 isl_int **delta_c = eq ? delta->eq : delta->ineq; in add_delta_constraints() 496 path_c = path->ineq[k]; in add_delta_constraints() 650 isl_seq_clr(path->ineq[k], 1 + total); in path_along_delta() [all …]
|
D | isl_map_subtract.c | 90 expand_constraint(v, dim, bmap->ineq[i], div_map, bmap_n_div); in tab_add_constraints() 153 isl_seq_neg(bmap->ineq[c], bmap->ineq[c], in tab_add_constraint() 155 isl_int_sub_ui(bmap->ineq[c][0], bmap->ineq[c][0], 1); in tab_add_constraint() 157 expand_constraint(v, dim, bmap->ineq[c], div_map, bmap_n_div); in tab_add_constraint() 160 isl_int_add_ui(bmap->ineq[c][0], bmap->ineq[c][0], 1); in tab_add_constraint() 161 isl_seq_neg(bmap->ineq[c], bmap->ineq[c], in tab_add_constraint()
|
D | isl_tab.c | 1907 isl_stat isl_tab_add_ineq(struct isl_tab *tab, isl_int *ineq) in isl_tab_add_ineq() argument 1923 tab->bmap = isl_basic_map_add_ineq(tab->bmap, ineq); in isl_tab_add_ineq() 1932 isl_int_swap(ineq[0], cst); in isl_tab_add_ineq() 1934 r = isl_tab_add_row(tab, ineq); in isl_tab_add_ineq() 1936 isl_int_swap(ineq[0], cst); in isl_tab_add_ineq() 2216 struct isl_vec *ineq; in ineq_for_div() local 2224 ineq = isl_vec_alloc(bmap->ctx, 1 + total); in ineq_for_div() 2225 if (!ineq) in ineq_for_div() 2228 isl_seq_cpy(ineq->el, bmap->div[div] + 1, 1 + total); in ineq_for_div() 2229 isl_int_neg(ineq->el[div_pos], bmap->div[div][0]); in ineq_for_div() [all …]
|
D | isl_dim_map.c | 165 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map); in isl_basic_map_add_constraints_dim_map()
|
D | isl_scheduler.c | 2566 isl_size eq, ineq; in update_count() local 2569 ineq = isl_basic_set_n_inequality(bset); in update_count() 2572 if (eq < 0 || ineq < 0) in update_count() 2576 *n_ineq += ineq; in update_count() 2702 isl_seq_clr(graph->lp->ineq[k], 1 + total); in add_bound_constant_constraints() 2704 isl_int_set_si(graph->lp->ineq[k][1 + pos], -1); in add_bound_constant_constraints() 2705 isl_int_set_si(graph->lp->ineq[k][0], max); in add_bound_constant_constraints() 2767 isl_vec *ineq; in node_add_coefficient_constraints() local 2783 isl_seq_clr(graph->lp->ineq[k], 1 + total); in node_add_coefficient_constraints() 2784 isl_int_set_si(graph->lp->ineq[k][dim], -1); in node_add_coefficient_constraints() [all …]
|
/external/llvm-project/mlir/lib/Analysis/ |
D | PresburgerSet.cpp | 137 static SmallVector<int64_t, 8> getComplementIneq(ArrayRef<int64_t> ineq) { in getComplementIneq() argument 139 coeffs.reserve(ineq.size()); in getComplementIneq() 140 for (int64_t coeff : ineq) in getComplementIneq() 197 auto recurseWithInequality = [&, i](ArrayRef<int64_t> ineq) { in subtractRecursively() argument 199 b.addInequality(ineq); in subtractRecursively() 200 simplex.addInequality(ineq); in subtractRecursively() 209 auto processInequality = [&](ArrayRef<int64_t> ineq) { in subtractRecursively() argument 210 recurseWithInequality(getComplementIneq(ineq)); in subtractRecursively() 211 b.addInequality(ineq); in subtractRecursively() 212 simplex.addInequality(ineq); in subtractRecursively()
|
D | AffineAnalysis.cpp | 542 SmallVector<int64_t, 8> ineq(dependenceDomain->getNumCols()); in addMemRefAccessConstraints() local 544 std::fill(ineq.begin(), ineq.end(), 0); in addMemRefAccessConstraints() 548 ineq[valuePosMap.getSrcDimOrSymPos(srcOperands[j])] = in addMemRefAccessConstraints() 552 ineq[newLocalIdOffset + j] = srcLocalVarCst.atIneq(r, srcNumIds + j); in addMemRefAccessConstraints() 554 ineq[ineq.size() - 1] = in addMemRefAccessConstraints() 556 dependenceDomain->addInequality(ineq); in addMemRefAccessConstraints() 560 std::fill(ineq.begin(), ineq.end(), 0); in addMemRefAccessConstraints() 563 ineq[valuePosMap.getDstDimOrSymPos(dstOperands[j])] = in addMemRefAccessConstraints() 567 ineq[newLocalIdOffset + numSrcLocalIds + j] = in addMemRefAccessConstraints() 570 ineq[ineq.size() - 1] = in addMemRefAccessConstraints() [all …]
|
D | AffineStructures.cpp | 1511 auto ineq = getInequality(idx); in getLowerAndUpperBound() local 1515 addCoeffs(ineq, lb); in getLowerAndUpperBound() 1520 int64_t divisor = std::abs(ineq[pos + offset]); in getLowerAndUpperBound() 1529 auto ineq = getInequality(idx); in getLowerAndUpperBound() local 1531 addCoeffs(ineq, ub); in getLowerAndUpperBound() 1534 expr = expr.floorDiv(std::abs(ineq[pos + offset])); in getLowerAndUpperBound() 1802 SmallVector<int64_t, 4> ineq(getNumCols(), 0); in addLowerOrUpperBound() local 1803 ineq[pos] = lower ? 1 : -1; in addLowerOrUpperBound() 1806 ineq[positions[j]] = lower ? -flatExpr[j] : flatExpr[j]; in addLowerOrUpperBound() 1812 ineq[j] = in addLowerOrUpperBound() [all …]
|
/external/llvm-project/mlir/test/SDBM/ |
D | sdbm-api-test.cpp | 131 for (auto ineq : ineqs) in TEST_FUNC() local 132 ineq.print(llvm::outs() << '\n'); in TEST_FUNC() 161 for (auto ineq : ineqs) in TEST_FUNC() local 162 ineq.print(llvm::outs() << '\n'); in TEST_FUNC()
|
/external/llvm-project/mlir/unittests/Analysis/ |
D | AffineStructuresTest.cpp | 45 for (const auto &ineq : ineqs) in makeFACFromConstraints() local 46 fac.addInequality(ineq); in makeFACFromConstraints() 69 for (const auto &ineq : ineqs) in checkPermutationsSample() local 70 permutedIneqs.push_back(permute(ineq)); in checkPermutationsSample()
|
D | PresburgerSetTest.cpp | 89 for (const SmallVector<int64_t, 4> &ineq : ineqs) in makeFACFromConstraints() local 90 fac.addInequality(ineq); in makeFACFromConstraints()
|
/external/llvm/test/Transforms/LoopUnswitch/ |
D | preserve-analyses.ll | 24 switch i32 %ineq.0.ph, label %bb8.backedge [ 49 %ineq.0.ph.be = phi i32 [ 0, %bb7 ], [ 1, %bb8.outer.loopexit ] ; <i32> [#uses=1] 57 %ineq.0.ph = phi i32 [ 0, %entry ], [ %ineq.0.ph.be, %bb8.outer.backedge ] ; <i32> [#uses=3] 59 %6 = icmp eq i32 %ineq.0.ph, 1 ; <i1> [#uses=1] 70 %.0 = phi i32 [ %ineq.0.ph, %bb ], [ 0, %bb8 ] ; <i32> [#uses=1]
|
/external/llvm-project/llvm/test/Transforms/SimpleLoopUnswitch/ |
D | preserve-analyses.ll | 25 switch i32 %ineq.0.ph, label %bb8.backedge [ 50 %ineq.0.ph.be = phi i32 [ 0, %bb7 ], [ 1, %bb8.outer.loopexit ] ; <i32> [#uses=1] 58 %ineq.0.ph = phi i32 [ 0, %entry ], [ %ineq.0.ph.be, %bb8.outer.backedge ] ; <i32> [#uses=3] 60 %6 = icmp eq i32 %ineq.0.ph, 1 ; <i1> [#uses=1] 71 %.0 = phi i32 [ %ineq.0.ph, %bb ], [ 0, %bb8 ] ; <i32> [#uses=1]
|
/external/llvm-project/llvm/test/Transforms/LoopUnswitch/ |
D | preserve-analyses.ll | 25 switch i32 %ineq.0.ph, label %bb8.backedge [ 50 %ineq.0.ph.be = phi i32 [ 0, %bb7 ], [ 1, %bb8.outer.loopexit ] ; <i32> [#uses=1] 58 %ineq.0.ph = phi i32 [ 0, %entry ], [ %ineq.0.ph.be, %bb8.outer.backedge ] ; <i32> [#uses=3] 60 %6 = icmp eq i32 %ineq.0.ph, 1 ; <i1> [#uses=1] 71 %.0 = phi i32 [ %ineq.0.ph, %bb ], [ 0, %bb8 ] ; <i32> [#uses=1]
|