Home
last modified time | relevance | path

Searched refs:n_eq (Results 1 – 25 of 29) sorted by relevance

12

/llvm-project-15.0.7/polly/lib/External/isl/
H A Disl_morph.c480 int f_eq, n_eq; in isl_basic_set_variable_compression() local
502 for (f_eq = 0; f_eq < bset->n_eq; ++f_eq) in isl_basic_set_variable_compression()
505 for (n_eq = 0; f_eq + n_eq < bset->n_eq; ++n_eq) in isl_basic_set_variable_compression()
508 if (n_eq == 0) in isl_basic_set_variable_compression()
526 space = isl_space_add_dims(space, type, ntype - n_eq); in isl_basic_set_variable_compression()
528 dom = copy_equalities(bset, f_eq, n_eq); in isl_basic_set_variable_compression()
570 int n_eq; in isl_basic_set_parameter_compression() local
580 if (bset->n_eq == 0) in isl_basic_set_parameter_compression()
583 n_eq = bset->n_eq; in isl_basic_set_parameter_compression()
595 if (n_eq > nvar + n_div) in isl_basic_set_parameter_compression()
[all …]
H A Disl_convex_hull.c199 unsigned n_eq; in wrap_constraints() local
209 n_eq = 1; in wrap_constraints()
212 n_eq += set->p[i]->n_eq; in wrap_constraints()
757 1 + dim + bset1->n_eq + bset2->n_eq, in convex_hull_pair_elim()
883 bset1->n_eq + bset2->n_eq, in induced_lineality_space()
1594 isl_size n_eq; in has_facets() local
1597 if (n_eq < 0) in has_facets()
1599 if (n_eq != 0) in has_facets()
2833 n_eq = 0; in collect_inequalities()
2897 n_eq = 0; in uset_unshifted_simple_hull_from_basic_set_list()
[all …]
H A Disl_coalesce.c105 unsigned n_eq = bmap_i->n_eq; in ineq_status_in() local
214 isl_size n_eq; in any_eq() local
241 isl_size n_eq; in find_eq() local
266 isl_size n_eq; in count_eq() local
519 unsigned n_eq, n_ineq; in fuse() local
527 n_eq = info[i].bmap->n_eq + info[j].bmap->n_eq; in fuse()
530 info[i].bmap->n_div, n_eq, n_eq + n_ineq + extra_rows); in fuse()
629 unsigned n_eq = info[i].bmap->n_eq; in check_facets() local
1123 unsigned n_eq = info[i].bmap->n_eq; in is_relaxed_extension() local
3136 unsigned n_eq; in tab_insert_divs() local
[all …]
H A Disl_sample.c81 if (bset->n_eq > 0) { in interval_sample()
152 int n_eq; in tab_equalities() local
163 if (tab->empty || n_eq == 0) in tab_equalities()
165 if (n_eq == tab->n_var) in tab_equalities()
176 if (i < bset->n_eq) in tab_equalities()
199 int n_eq; in initial_basis() local
205 if (tab->empty || n_eq == 0 || n_eq == tab->n_var) in initial_basis()
644 if (bset->n_eq > 0) in sample_bounded()
959 cone_dim = total - cone->n_eq; in isl_basic_set_sample_with_cone()
1140 if (cone->n_eq < dim) in gbr_sample()
[all …]
H A Disl_affine_hull.c102 bset->n_eq--; in delete_row()
103 for (r = row; r < bset->n_eq; ++r) in delete_row()
105 bset->eq[bset->n_eq] = t; in delete_row()
333 for (i = 0; i < bset->n_eq; ++i) in isl_basic_set_recession_cone()
455 if (j == hull->n_eq) in extend_affine_hull()
682 if (hull->n_eq > tab->n_zero) { in isl_tab_detect_equalities()
742 cone_dim = total - cone->n_eq; in affine_hull_with_cone()
820 if (cone->n_eq == 0) { in uset_affine_hull()
831 if (cone->n_eq < total) in uset_affine_hull()
865 if (bset->n_eq) in equalities_in_underlying_set()
[all …]
H A Disl_map_simplify.c475 if (i < bmap->n_eq) in eliminate_divs_ineq()
623 if (k < bmap->n_eq) in isl_basic_map_gauss5()
985 if (bmap->n_eq == 0) in normalize_divs()
1755 if (i < bmap->n_eq) in isl_basic_map_eliminate_vars()
2447 unsigned n_eq; in update_ineq() local
2464 n_eq = tab->n_eq; in update_ineq()
2565 n_eq = context->n_eq; in uset_gist_full()
2881 if (bmap->n_eq == 0) in n_div_eq()
2895 return bmap->n_eq; in n_div_eq()
3310 n_eq = bset->n_eq; in isl_basic_map_gist()
[all …]
H A Disl_farkas.c257 dual = isl_basic_set_alloc_space(space, bset->n_eq + bset->n_ineq, in farkas()
261 for (i = 0; i < bset->n_eq + bset->n_ineq; ++i) { in farkas()
274 for (j = 0; j < bset->n_eq; ++j) in farkas()
278 isl_int_set(dual->eq[k][1 + shift + total + bset->n_eq + j], in farkas()
287 1 + shift + total + bset->n_eq + bset->n_ineq); in farkas()
297 for (j = 0; j < bset->n_eq; ++j) in farkas()
301 isl_int_neg(dual->ineq[k][2 + total + bset->n_eq + j], in farkas()
430 isl_size n_eq, n_ineq, dim; in isl_basic_set_coefficients_factor() local
439 n_eq = isl_basic_set_n_equality(coeff); in isl_basic_set_coefficients_factor()
441 if (dim < 0 || n_eq < 0 || n_ineq < 0) in isl_basic_set_coefficients_factor()
[all …]
H A Disl_vertices.c152 if (v->v.dom->n_eq > 0) { in add_vertex()
424 isl_size n_eq; in isl_basic_set_compute_vertices() local
442 if (bset->n_eq != 0) in isl_basic_set_compute_vertices()
473 if (n_eq < 0) in isl_basic_set_compute_vertices()
475 if (n_eq < 0 || n_eq > 0) in isl_basic_set_compute_vertices()
627 if (bset->n_eq > 0) in can_intersect()
919 isl_size n_eq; in compute_chambers() local
938 if (n_eq < 0) in compute_chambers()
940 if (n_eq > 0) in compute_chambers()
1203 for (i = 0; i < bset->n_eq; ++i) { in tab_for_shifted_cone()
[all …]
H A Disl_equalities.c681 isl_assert(bset->ctx, bset->n_eq <= dim, goto error); in compress_variables()
682 if (bset->n_eq == 0) in compress_variables()
685 B = isl_mat_sub_alloc6(bset->ctx, bset->eq, 0, bset->n_eq, 0, 1 + dim); in compress_variables()
759 H = isl_mat_sub_alloc6(ctx, bset->eq, 0, bset->n_eq, 1, total); in isl_basic_set_dim_residue_class()
764 isl_seq_gcd(U->row[nparam + pos]+bset->n_eq, in isl_basic_set_dim_residue_class()
765 total-bset->n_eq, modulo); in isl_basic_set_dim_residue_class()
775 C = isl_mat_alloc(ctx, 1 + bset->n_eq, 1); in isl_basic_set_dim_residue_class()
779 isl_mat_sub_neg(ctx, C->row + 1, bset->eq, bset->n_eq, 0, 0, 1); in isl_basic_set_dim_residue_class()
784 U1 = isl_mat_sub_alloc(U, nparam+pos, 1, 0, bset->n_eq); in isl_basic_set_dim_residue_class()
H A Disl_map_private.h63 unsigned n_eq; member
122 unsigned n_eq, unsigned n_ineq);
124 __isl_take isl_basic_set *base, unsigned n_eq, unsigned n_ineq);
133 unsigned n_eq, unsigned n_ineq);
139 __isl_take isl_basic_map *base, unsigned n_eq, unsigned n_ineq);
197 unsigned extra, unsigned n_eq, unsigned n_ineq);
199 unsigned extra, unsigned n_eq, unsigned n_ineq);
210 unsigned extra, unsigned n_eq, unsigned n_ineq);
214 unsigned extra, unsigned n_eq, unsigned n_ineq);
H A Disl_map.c1663 bmap->n_eq++; in isl_basic_map_alloc_equality()
1711 bmap->n_eq--; in isl_basic_map_drop_equality()
1735 bmap->n_eq++; in isl_basic_map_inequality_to_equality()
2009 n_eq += base->n_eq; in isl_basic_map_extend()
4823 bmap1->n_eq + bmap2->n_eq, in isl_basic_map_apply_range()
4905 bmap1->n_eq + bmap2->n_eq + n_out, in isl_basic_map_sum()
10344 if (bmap1->n_eq != bmap2->n_eq) in isl_basic_map_plain_cmp()
10345 return bmap1->n_eq - bmap2->n_eq; in isl_basic_map_plain_cmp()
10720 bmap1->n_eq + bmap2->n_eq, in isl_basic_map_product()
10783 bmap1->n_eq + bmap2->n_eq, in isl_basic_map_domain_product()
[all …]
H A Disl_tab.c70 tab->n_eq = 0; in isl_tab_alloc()
280 dup->n_eq = tab->n_eq; in isl_tab_dup()
533 prod->n_eq = 0; in isl_tab_product()
1907 isl_assert(tab->mat->ctx, tab->n_eq == bmap->n_eq, in isl_tab_add_ineq()
2011 tab->n_eq++; in add_eq()
2628 unsigned n_eq; in isl_basic_map_update_from_tab() local
2635 n_eq = tab->n_eq; in isl_basic_map_update_from_tab()
2645 if (bmap->n_eq != n_eq) in isl_basic_map_update_from_tab()
3212 n_eq = tab->n_eq; in isl_tab_make_equalities_explicit()
3222 tab->n_eq++; in isl_tab_make_equalities_explicit()
[all …]
H A Disl_map_subtract.c69 if (isl_tab_extend_cons(tab, 2 * bmap->n_eq + bmap->n_ineq) < 0) in tab_add_constraints()
76 for (i = 0; i < bmap->n_eq; ++i) { in tab_add_constraints()
137 if (c < 2 * bmap->n_eq) { in tab_add_constraint()
151 c -= 2 * bmap->n_eq; in tab_add_constraint()
727 return bmap->n_eq == total; in isl_basic_map_plain_is_singleton()
757 isl_assert(bmap->ctx, bmap->n_eq == dim, return NULL); in singleton_extract_point()
765 for (j = 0; j < bmap->n_eq; ++j) { in singleton_extract_point()
H A Dbasis_reduction_templ.c330 if (bset->n_eq == 0) in isl_basic_set_reduced_basis()
337 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, 0, bset->n_eq, in isl_basic_set_reduced_basis()
341 tab->n_zero = bset->n_eq; in isl_basic_set_reduced_basis()
H A Disl_scheduler.c2083 isl_size n_eq, n_ineq; in add_constraints_dim_map() local
2575 *n_eq += eq; in update_count()
2644 *n_eq = *n_ineq = 0; in count_constraints()
2972 int n_eq, n_ineq; in setup_lp() local
2997 n_eq += 2 + parametric; in setup_lp()
4338 int n_eq; member
4369 *n_eq = data.n_eq; in count_all_constraints()
4416 int n_eq, n_ineq; in setup_carry_lp() local
4430 n_eq += 3; in setup_carry_lp()
5017 isl_size n_eq; in add_lineality() local
[all …]
H A Disl_factorization.c285 H = isl_mat_alloc(bset->ctx, bset->n_eq + bset->n_ineq, nvar); in isl_basic_set_factorizer()
288 isl_mat_sub_copy(bset->ctx, H->row, bset->eq, bset->n_eq, in isl_basic_set_factorizer()
290 isl_mat_sub_copy(bset->ctx, H->row + bset->n_eq, bset->ineq, bset->n_ineq, in isl_basic_set_factorizer()
H A Dpolytope_scan.c86 if (bset->n_eq == 0) in isl_basic_set_samples()
H A Disl_constraint.c194 return bmap->n_eq + bmap->n_ineq; in isl_basic_map_n_constraint()
218 for (i = 0; i < bmap->n_eq; ++i) { in isl_basic_map_foreach_constraint()
777 for (i = 0; i < bmap->n_eq; ++i) { in isl_basic_map_has_defining_equality()
1157 for (i = 0; i < bset->n_eq; ++i) { in isl_basic_set_foreach_bound_pair()
H A Disl_output.c106 for (i = 0; i < bmap->n_eq; ++i) in print_constraints_polylib()
129 p = isl_printer_print_int(p, bmap->n_eq + bmap->n_ineq); in isl_basic_map_print_polylib()
802 for (i = bmap->n_eq - 1; i >= 0; --i) { in print_constraints()
805 if (i != bmap->n_eq - 1) in print_constraints()
1136 if (map->n > 1 && map->p[i]->n_eq + map->p[i]->n_ineq > 1) in print_disjuncts_core()
1139 if (map->n > 1 && map->p[i]->n_eq + map->p[i]->n_ineq > 1) in print_disjuncts_core()
1279 for (i = bmap->n_eq - 1; i >= 0; --i) { in get_aff()
1316 for (i = bmap->n_eq - 1; i >= 0; --i) { in drop_aff()
1320 for (j = 0; j < aff->n_eq; ++j) { in drop_aff()
1395 for (i = 0; i < eq->n_eq; ++i) { in defining_equality()
[all …]
H A Disl_dim_map.c154 for (i = 0; i < src->n_eq; ++i) { in isl_basic_map_add_constraints_dim_map()
H A Disl_ilp.c44 if (bset->n_eq != 0) { in unit_box_base_points()
326 if (bset->n_eq) in isl_basic_set_solve_ilp()
H A Disl_tab.h147 unsigned n_eq; member
H A Disl_bound.c134 if (bset->n_eq == 0) in unwrapped_guarded_poly_bound()
H A Disl_transitive_closure.c467 int n = eq ? delta->n_eq : delta->n_ineq; in add_delta_constraints()
595 d + 1 + delta->n_eq, delta->n_eq + delta->n_ineq + 1); in path_along_delta()
634 path = isl_basic_map_extend_constraints(path, delta->n_eq, in path_along_delta()
2199 for (i = 0; i < aff->n_eq; ++i) { in box_closure_on_domain()
H A Disl_tab_pip.c1528 tab->n_eq++; in add_lexmin_valid_eq()
2312 tab = isl_tab_alloc(bmap->ctx, 2 * bmap->n_eq + bmap->n_ineq + 1, in tab_for_lexmin()
2342 for (i = 0; i < bmap->n_eq; ++i) { in tab_for_lexmin()
2353 if (bmap->n_eq && restore_lexmin(tab) < 0) in tab_for_lexmin()
2977 for (i = 0; i < bset->n_eq; ++i) in drop_constant_terms()
2990 return cgbr->tab->bmap->n_eq == 0 && cgbr->tab->bmap->n_div == 0; in use_shifted()
4763 for (i = 0; i < bmap->n_eq; ++i) in need_split_basic_map()

12