| /llvm-project-15.0.7/polly/lib/External/isl/ |
| H A D | isl_map_simplify.c | 1884 if (n_div < 0) in isl_basic_map_drop_constraints_involving_unknown_divs()
3049 if (n_div < 0) in extract_compressed_stride_constraints()
3820 if (bmap1->n_div || bmap2->n_div) in isl_basic_map_plain_is_disjoint()
4161 return n_div; in div_find_coalesce()
4166 return n_div; in div_find_coalesce()
4169 return n_div; in div_find_coalesce()
4188 return n_div; in div_find_coalesce()
4345 if (n_div < 0) in int_between_bounds()
4405 if (n_div < 0) in drop_more_redundant_divs()
4702 if (n_div < 0) in single_unknown()
[all …]
|
| H A D | isl_local.c | 70 isl_size total, n_div; in isl_local_dim() local
73 n_div = isl_local_dim(local, isl_dim_div); in isl_local_dim()
74 if (total < 0 || n_div < 0) in isl_local_dim()
76 return total - n_div; in isl_local_dim()
278 isl_size dim, n_div, size; in isl_local_extend_point_vec() local
291 n_div = isl_local_dim(local, isl_dim_div); in isl_local_extend_point_vec()
293 if (dim < 0 || n_div < 0 || size < 0) in isl_local_extend_point_vec()
298 if (n_div == 0) in isl_local_extend_point_vec()
305 v = isl_vec_add_els(v, n_div); in isl_local_extend_point_vec()
309 for (i = 0; i < n_div; ++i) { in isl_local_extend_point_vec()
|
| H A D | isl_tab_pip.c | 333 isl_size n_div; in sol_push_sol_mat() local
337 if (n_div < 0) in sol_push_sol_mat()
2117 tab->n_div++; in add_div()
2132 isl_size n_div; in find_div() local
2144 return n_div; in find_div()
2155 unsigned n_div; in get_div() local
2164 if (d < n_div) in get_div()
2324 tab->n_div = dom->n_div; in tab_for_lexmin()
4330 return n_div; in find_context_div()
4333 return n_div; in find_context_div()
[all …]
|
| H A D | isl_map.c | 574 n_div, 0, 2 * n_div); in isl_basic_map_from_local_space()
4822 bmap1->n_div + bmap2->n_div + n, in isl_basic_map_apply_range()
5748 bmap->n_div = like->n_div; in isl_basic_map_overlying_set()
9564 n_div = bmap->n_div; in isl_basic_map_expand_divs()
10348 if (bmap1->n_div != bmap2->n_div) in isl_basic_map_plain_cmp()
10719 bmap1->n_div + bmap2->n_div, in isl_basic_map_product()
10782 bmap1->n_div + bmap2->n_div, in isl_basic_map_domain_product()
10834 bmap1->n_div + bmap2->n_div, in isl_basic_map_range_product()
11359 n_div = set->p[0]->n_div; in isl_set_lift()
11756 0, n_div) < n_div) in find_modulo_constraint_pair()
[all …]
|
| H A D | isl_transitive_closure.c | 301 isl_size n_div; in parametric_constant_never_positive() local
323 for (i = 0; i < n_div; ++i) { in parametric_constant_never_positive()
350 isl_size n_div; in purity() local
362 for (i = 0; i < n_div; ++i) { in purity()
397 isl_size n_div; in get_div_purity() local
407 if (n_div && !div_purity) in get_div_purity()
469 isl_size n_div, total; in add_delta_constraints() local
473 if (n_div < 0 || total < 0) in add_delta_constraints()
580 isl_size n_div; in path_along_delta() local
619 if (n_div && !div_purity) in path_along_delta()
[all …]
|
| H A D | isl_coalesce.c | 321 isl_size n_div; in coalesce_info_set_hull_hash() local
326 if (n_div < 0) in coalesce_info_set_hull_hash()
2662 total -= n_div; in shift_div()
2937 if (info1->bmap->n_div != info2->bmap->n_div) in harmonize_divs()
2976 if (bmap1->n_div != bmap2->n_div) in same_divs()
3532 if (bmap_i->n_div > info[j].bmap->n_div) { in coalesce_subset_with_equalities()
3564 if (info[i].bmap->n_div < info[j].bmap->n_div) in coalesce_divs()
3569 if (info[j].bmap->n_div < info[i].bmap->n_div) in coalesce_divs()
3591 isl_size n_div; in has_nested_div() local
3597 total -= n_div; in has_nested_div()
[all …]
|
| H A D | isl_map_subtract.c | 33 isl_int *c, int *div_map, unsigned n_div) in expand_constraint() argument
40 for (i = 0; i < n_div; ++i) { in expand_constraint()
180 if (!bmap->n_div) in tab_add_divs()
191 dim = total - tab->bmap->n_div; in tab_add_divs()
196 for (i = 0; i < bmap->n_div; ++i) { in tab_add_divs()
198 isl_seq_clr(vec->el + 2 + dim, tab->bmap->n_div); in tab_add_divs()
203 for (j = 0; j < tab->bmap->n_div; ++j) in tab_add_divs()
205 vec->el, 2 + dim + tab->bmap->n_div)) in tab_add_divs()
208 if (j == tab->bmap->n_div) { in tab_add_divs()
209 vec->size = 2 + dim + tab->bmap->n_div; in tab_add_divs()
[all …]
|
| H A D | isl_stride.c | 231 isl_size n_div; in detect_stride() local
246 n_div = isl_constraint_dim(c, isl_dim_div); in detect_stride()
247 if (n_div < 0) in detect_stride()
251 for (i = 0; i < n_div; ++i) { in detect_stride()
271 for (i = 0; i < n_div; ++i) in detect_stride()
|
| H A D | isl_output.c | 648 isl_size n_div; in print_as_modulo_pos() local
655 return n_div; in print_as_modulo_pos()
659 return n_div; in print_as_modulo_pos()
664 return n_div; in print_as_modulo_pos()
666 return n_div; in print_as_modulo_pos()
724 isl_size n_div; in print_eq_constraint() local
903 isl_size n_div; in print_div_list() local
977 isl_size n_div; in mark_all_unknown() local
980 if (n_div < 0) in mark_all_unknown()
2155 if (n_div < 0) in print_constraint_c()
[all …]
|
| H A D | isl_dim_map.c | 107 for (i = 0; i < bmap->n_div; ++i) { in isl_dim_map_div()
168 for (i = 0; i < src->n_div; ++i) { in isl_basic_map_add_constraints_dim_map()
207 res = isl_dim_map_alloc(bmap->ctx, dim_map->len - 1 + bmap->n_div); in isl_dim_map_extend()
213 for (i = 0; i < bmap->n_div; ++i) { in isl_dim_map_extend()
|
| H A D | isl_tab_lexopt_templ.c | 56 unsigned n_in, n_out, n_div; in SF() local
112 n_div = isl_basic_set_dim(dom, isl_dim_div); in SF()
121 isl_seq_clr(dom->ineq[k] + 1 + n_in + 1, n_div); in SF()
|
| H A D | isl_local_space.c | 75 unsigned n_div) in isl_local_space_alloc() argument
89 div = isl_mat_alloc(ctx, n_div, 1 + 1 + total + n_div); in isl_local_space_alloc()
695 if (bmap->n_div <= 1) in isl_basic_map_sort_divs()
701 for (i = 1; i < bmap->n_div; ++i) { in isl_basic_map_sort_divs()
1059 unsigned n_div; in isl_local_space_substitute_equalities() local
1072 n_div = eq->n_div; in isl_local_space_substitute_equalities()
1074 j = isl_seq_last_non_zero(eq->eq[i], total + n_div); in isl_local_space_substitute_equalities()
1176 isl_size n_div; in isl_local_space_substitute() local
1185 n_div = isl_local_space_dim(subs->ls, isl_dim_div); in isl_local_space_substitute()
1186 if (n_div < 0) in isl_local_space_substitute()
[all …]
|
| H A D | isl_box.c | 253 isl_size n_div; in is_suitable_bound() local
260 n_div = isl_constraint_dim(c, isl_dim_div); in is_suitable_bound()
261 if (n_div < 0) in is_suitable_bound()
263 any_divs = isl_constraint_involves_dims(c, isl_dim_div, 0, n_div); in is_suitable_bound()
|
| H A D | isl_morph.c | 569 isl_size n_div; in isl_basic_set_parameter_compression() local
586 n_div = isl_basic_set_dim(bset, isl_dim_div); in isl_basic_set_parameter_compression()
587 if (nparam < 0 || nvar < 0 || n_div < 0) in isl_basic_set_parameter_compression()
591 nvar + n_div) == -1) in isl_basic_set_parameter_compression()
595 if (n_eq > nvar + n_div) in isl_basic_set_parameter_compression()
601 0, n_eq, 1 + nparam, nvar + n_div); in isl_basic_set_parameter_compression()
|
| H A D | isl_polynomial.c | 520 isl_size n_div; in isl_qpolynomial_domain_dim() local
523 if (n_div < 0) in isl_qpolynomial_domain_dim()
525 dim += n_div; in isl_qpolynomial_domain_dim()
1306 qp->div = isl_mat_alloc(space->ctx, n_div, 1 + 1 + total + n_div); in isl_qpolynomial_alloc()
2591 if (n_div && !s) in reduce_divs()
2610 if (new_n_div < n_div) in reduce_divs()
2770 int n_div; in remove_redundant_divs() local
2979 unsigned n_div; in isl_qpolynomial_substitute_equalities_lifted() local
2997 n_div = eq->n_div; in isl_qpolynomial_substitute_equalities_lifted()
5186 unsigned n_div; in isl_basic_map_from_qpolynomial() local
[all …]
|
| H A D | isl_aff.c | 2190 unsigned n_div; in isl_aff_substitute_equalities_lifted() local
2210 n_div = eq->n_div; in isl_aff_substitute_equalities_lifted()
2235 isl_size n_div; in isl_aff_substitute_equalities() local
2238 if (n_div < 0) in isl_aff_substitute_equalities()
2240 if (n_div > 0) in isl_aff_substitute_equalities()
5445 isl_size n_div; in pw_multi_aff_from_map_check_strides() local
5671 isl_size n_div; in isl_aff_substitute() local
5682 if (n_div < 0) in isl_aff_substitute()
5684 if (n_div != 0) in isl_aff_substitute()
6123 isl_size n_div; in isl_multi_aff_lift() local
[all …]
|
| H A D | isl_lp.c | 108 if (map->p[i]->n_div > max_div) in isl_map_solve_lp()
109 max_div = map->p[i]->n_div; in isl_map_solve_lp()
|
| H A D | isl_tab.c | 76 tab->n_div = 0; in isl_tab_alloc()
286 dup->n_div = tab->n_div; in isl_tab_dup()
539 prod->n_div = 0; in isl_tab_product()
2211 div_pos = 1 + total - bmap->n_div + div; in ineq_for_div()
2247 div_pos = 1 + total - tab->bmap->n_div + div; in add_div_constraints()
2326 isl_size n_div; in isl_tab_insert_div() local
2337 if (n_div < 0) in isl_tab_insert_div()
2339 o_div = tab->n_var - n_div; in isl_tab_insert_div()
3870 isl_size n_div; in drop_bmap_div() local
3873 if (n_div < 0) in drop_bmap_div()
[all …]
|
| H A D | isl_ast_codegen.c | 2371 int n_div; member
2395 isl_size n_div; in update_n_div() local
2403 if (n_div > *n) in update_n_div()
2404 *n = n_div; in update_n_div()
2455 int n_div; in is_better_lower_bound() local
2470 if (data->n_div < 0) in is_better_lower_bound()
2472 if (data->n_div < 0) in is_better_lower_bound()
2474 if (data->n_div == 0) in is_better_lower_bound()
2477 if (n_div < 0) in is_better_lower_bound()
2479 if (n_div >= data->n_div) in is_better_lower_bound()
[all …]
|
| H A D | isl_local_space_private.h | 21 unsigned n_div);
|
| H A D | isl_space_private.h | 28 unsigned n_div);
|
| H A D | isl_affine_hull.c | 1050 isl_seq_clr(bmap->eq[k] + M->n_col, bmap->n_div - n_known); in add_strides()
1110 for (n_known = 0; n_known < bmap->n_div; ++n_known) in isl_basic_map_make_strides_explicit()
1118 bmap->n_div - n_known) == -1) in isl_basic_map_make_strides_explicit()
1124 n_col = bmap->n_div - n_known; in isl_basic_map_make_strides_explicit()
|
| H A D | isl_constraint.c | 652 isl_size n_div; in isl_constraint_is_div_constraint() local
658 n_div = isl_constraint_dim(constraint, isl_dim_div); in isl_constraint_is_div_constraint()
659 if (n_div < 0) in isl_constraint_is_div_constraint()
661 for (i = 0; i < n_div; ++i) { in isl_constraint_is_div_constraint()
|
| H A D | isl_mat.c | 1323 unsigned n_div, int has_div, struct isl_mat *mat) in preimage() argument
1343 q[i] + has_div + t->n_col + e, n_div); in preimage()
1344 isl_seq_clr(q[i] + has_div + t->n_col + n_div, e); in preimage()
1388 if (preimage(ctx, bset->eq, bset->n_eq, bset->n_div, 0, in isl_basic_set_preimage()
1392 if (preimage(ctx, bset->ineq, bset->n_ineq, bset->n_div, 0, in isl_basic_set_preimage()
1396 if (preimage(ctx, bset->div, bset->n_div, bset->n_div, 1, mat) < 0) in isl_basic_set_preimage()
|
| /llvm-project-15.0.7/polly/lib/External/ppcg/ |
| H A D | gpu_group.c | 192 unsigned n_div; in check_stride_constraint() local
196 n_div = isl_constraint_dim(c, isl_dim_div); in check_stride_constraint()
199 if (n_div && (isl_val_is_one(v) || isl_val_is_negone(v))) { in check_stride_constraint()
204 for (i = 0; i < n_div; ++i) { in check_stride_constraint()
331 unsigned n_div; in compute_size_in_direction() local
337 n_div = isl_constraint_dim(c, isl_dim_div); in compute_size_in_direction()
339 if (isl_constraint_involves_dims(c, isl_dim_div, 0, n_div) || in compute_size_in_direction()
|