| /llvm-project-15.0.7/polly/lib/External/isl/ |
| H A D | isl_mat.c | 79 mat->n_row = n_row; in isl_mat_alloc() 101 if (mat->max_col >= n_col && mat->n_row >= n_row) { in isl_mat_extend() 110 if (n_row < mat->n_row) in isl_mat_extend() 111 n_row = mat->n_row; in isl_mat_extend() 136 for (i = mat->n_row; i < n_row; ++i) in isl_mat_extend() 138 mat->n_row = n_row; in isl_mat_extend() 165 mat->n_row = n_row; in isl_mat_sub_alloc6() 391 mat = isl_mat_alloc(ctx, n_row, n_row); in isl_mat_diag() 837 int n_row) in hermite_first_zero_col() argument 930 mat = isl_mat_alloc(mat1->ctx, mat1->n_row + mat2->n_row, in isl_mat_diagonal() [all …]
|
| H A D | isl_equalities.c | 77 M = isl_mat_alloc(B->ctx, B->n_row, B->n_row + B->n_col - 1); in particular_solution() 94 H = isl_mat_sub_alloc(M, 0, B->n_row, 0, B->n_row); in particular_solution() 104 if (i < B->n_row) in particular_solution() 108 T = isl_mat_sub_alloc(U, B->n_row, B->n_col - 1, 0, B->n_row); in particular_solution() 193 T = isl_mat_sub_alloc(A, 0, A->n_row, 0, A->n_row); in parameter_compression_multi() 418 n_row = A->n_row; in isl_mat_parameter_compression_ext() 421 A = isl_mat_drop_cols(A, n_row, n_col - n_row); in isl_mat_parameter_compression_ext() 565 H1 = isl_mat_sub_alloc(H, 0, H->n_row, 0, H->n_row); in isl_mat_final_variable_compression() 587 U1 = isl_mat_sub_alloc(U, 0, U->n_row, 0, B->n_row); in isl_mat_final_variable_compression() 589 U2 = isl_mat_sub_alloc(U, 0, U->n_row, B->n_row, U->n_row - B->n_row); in isl_mat_final_variable_compression() [all …]
|
| H A D | isl_mat_private.h | 15 unsigned n_row; member 28 __isl_give isl_mat *isl_mat_zero(isl_ctx *ctx, unsigned n_row, unsigned n_col); 32 unsigned first_row, unsigned n_row, unsigned first_col, unsigned n_col); 34 unsigned first_row, unsigned n_row, unsigned first_col, unsigned n_col); 36 unsigned n_row, unsigned dst_col, unsigned src_col, unsigned n_col); 38 unsigned n_row, unsigned dst_col, unsigned src_col, unsigned n_col); 39 isl_stat isl_mat_sub_transform(isl_int **row, unsigned n_row, 41 __isl_give isl_mat *isl_mat_diag(isl_ctx *ctx, unsigned n_row, isl_int d);
|
| H A D | isl_local_space.c | 234 return ls->div->n_row; in isl_local_space_dim() 239 return dim + ls->div->n_row; in isl_local_space_dim() 651 li = n_col - n_row + i; in cmp_row() 655 lj = n_col - n_row + j; in cmp_row() 740 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row, in isl_merge_divs() 741 d + div1->n_row + div2->n_row); in isl_merge_divs() 745 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) { in isl_merge_divs() 771 div->n_row = k; in isl_merge_divs() 787 if (a < 0 || a >= ls->div->n_row || b < 0 || b >= ls->div->n_row) in isl_local_space_swap_div() 818 if (ls2->div->n_row == 0) { in isl_local_space_intersect() [all …]
|
| H A D | isl_local.c | 198 if (mat1->n_row != mat2->n_row) in isl_local_cmp() 199 return mat1->n_row - mat2->n_row; in isl_local_cmp() 204 for (i = 0; i < mat1->n_row; ++i) { in isl_local_cmp() 246 extra = dim + div->n_row - r->len; in isl_local_reorder() 247 mat = isl_mat_alloc(div->ctx, div->n_row, div->n_col + extra); in isl_local_reorder() 251 for (i = 0; i < div->n_row; ++i) { in isl_local_reorder()
|
| H A D | isl_tab.c | 68 tab->n_row = 0; in isl_tab_alloc() 124 if (tab->mat->n_row < tab->n_row + n_new) { in isl_tab_extend_cons() 278 dup->n_row = tab->n_row; in isl_tab_dup() 332 prod = isl_mat_alloc(mat1->ctx, mat1->n_row + mat2->n_row, in tab_mat_product() 463 tab1->n_row, tab2->n_row, in isl_tab_product() 513 tab1->mat->n_row + tab2->mat->n_row); in isl_tab_product() 514 if ((tab1->mat->n_row + tab2->mat->n_row) && !prod->row_var) in isl_tab_product() 531 prod->n_row = tab1->n_row + tab2->n_row; in isl_tab_product() 1694 tab->n_row++; in isl_tab_allocate_con() 1866 tab->n_row--; in drop_row() [all …]
|
| H A D | isl_polynomial.c | 1446 int n_row, n_col; in compatible_divs() local 1449 isl_assert(div1->ctx, div1->n_row >= div2->n_row && in compatible_divs() 1453 if (div1->n_row == div2->n_row) in compatible_divs() 1456 n_row = div1->n_row; in compatible_divs() 1458 div1->n_row = div2->n_row; in compatible_divs() 1463 div1->n_row = n_row; in compatible_divs() 1518 qp->div->n_row); in sort_divs() 1641 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row && in with_merged_divs() 1690 if (qp1->div->n_row < qp2->div->n_row) in isl_qpolynomial_add() 1864 if (qp1->div->n_row < qp2->div->n_row) in isl_qpolynomial_mul() [all …]
|
| H A D | polytope_scan.c | 36 ss->samples = isl_mat_extend(ss->samples, ss->samples->n_row + 1, in scan_samples_add_sample() 41 isl_seq_cpy(ss->samples->row[ss->samples->n_row - 1], in scan_samples_add_sample()
|
| H A D | isl_factorization.c | 157 g->rowgroup = isl_alloc_array(H->ctx, int, H->n_row); in init_groups() 162 for (i = 0; i < H->n_row; ++i) in init_groups() 165 for ( ; j < H->n_row; ++j) in init_groups() 232 if (g->pos[i] == H->n_row) in update_groups() 236 for (j = g->pos[i] + 1; j < H->n_row; ++j) { in update_groups()
|
| H A D | isl_scheduler.c | 370 int n_row; member 2451 if (n_row < 0) in extract_linear_schedule() 3221 graph->n_row++; in update_schedule() 3847 sub->n_row = graph->n_row; in extract_sub_graph() 4491 isl_size n_row; in split_scaled() local 4502 if (n_row < 0) in split_scaled() 4510 row = n_row - 1; in split_scaled() 5413 graph->n_row--; in carry() 5613 isl_size n_row; in final_row() local 5616 if (n_row < 0) in final_row() [all …]
|
| H A D | isl_coalesce.c | 1232 wraps->mat->n_row = 0; in wraps_init() 1355 w = wraps->mat->n_row; in add_selected_wraps() 1396 wraps->mat->n_row = w; in add_selected_wraps() 1565 n = wraps->mat->n_row; in add_selected_wraps_around_facet() 1787 wraps.mat->n_row = 1; in can_wrap_in_facet() 1898 w = wraps->mat->n_row++; in try_wrap_in_facets() 1916 w = wraps->mat->n_row++; in try_wrap_in_facets() 2334 wraps.mat->n_row = 1; in check_eq_adj_eq() 2345 wraps.mat->n_row++; in check_eq_adj_eq() 3451 if ((div_i->n_row && !exp1) || (div_j->n_row && !exp2)) in coalesce_after_aligning_divs() [all …]
|
| H A D | isl_morph.c | 619 isl_size n_row, n_col; in isl_multi_aff_from_aff_mat_anonymous() local 624 n_row = isl_mat_rows(mat); in isl_multi_aff_from_aff_mat_anonymous() 626 if (n_row < 0 || n_col < 0) in isl_multi_aff_from_aff_mat_anonymous() 629 space = isl_space_alloc(ctx, 0, n_col - 1, n_row - 1); in isl_multi_aff_from_aff_mat_anonymous()
|
| H A D | isl_tab.h | 137 unsigned n_row; member 184 unsigned n_row, unsigned n_var, unsigned M);
|
| H A D | isl_tab_pip.c | 288 for (i = 1; i < M->n_row; ++i) { in set_from_affine_matrix() 619 for (i = 0; i < n_row; ++i) in scale_rows() 4128 if (row < tab->n_row) in find_solutions() 4668 for (j = 0; j < var->n_row; ++j) { in select_minimum() 4713 var->n_row, ISL_SET_DISJOINT); in set_minimum() 4715 for (i = 0; i < var->n_row; ++i) { in set_minimum() 4717 1, var->n_row - 1); in set_minimum() 4776 for (j = 0; j < cst->n_row; ++j) in need_split_basic_map() 4779 if (j >= cst->n_row) in need_split_basic_map() 5865 for (i = 0; i < var->n_row; ++i) { in set_minimum_pa() [all …]
|
| H A D | isl_map_simplify.c | 1062 for (i = 1; i < T->n_row; ++i) { in normalize_divs() 1073 for (i = 1; i < T->n_row; ++i) { in normalize_divs() 1087 if (pos[j] < T->n_row && C2) in normalize_divs() 2706 isl_size n_row, n_col; in uset_gist_compressed() local 2722 n_row = isl_mat_rows(ineq); in uset_gist_compressed() 2724 if (n_row < 0 || n_col < 0) in uset_gist_compressed() 2727 for (i = 0; i < n_row; ++i) { in uset_gist_compressed() 2917 0, eq->n_row, 0); in basic_map_from_equalities() 5172 isl_size n_row, n_col; in isl_basic_map_preimage_vars() local 5175 n_row = isl_mat_rows(T); in isl_basic_map_preimage_vars() [all …]
|
| H A D | isl_affine_hull.c | 1035 bmap = isl_basic_map_extend(bmap, M->n_row - 1, M->n_row - 1, 0); in add_strides() 1038 for (i = 1; i < M->n_row; ++i) { in add_strides()
|
| H A D | isl_sample.c | 401 isl_assert(tab->mat->ctx, tab->basis->n_row == tab->n_var + 1, in isl_tab_sample() 1103 tab->n_zero = eq->n_row; in isl_tab_set_initial_basis_with_cone() 1108 tab->n_unbounded = tab->n_var - (eq->n_row - tab->n_zero); in isl_tab_set_initial_basis_with_cone()
|
| H A D | isl_input.c | 2233 int n_row, n_col; in basic_map_read_polylib() local 2257 n_row = isl_int_get_si(tok->u.v); in basic_map_read_polylib() 2263 isl_assert(s->ctx, n_row >= 0, return NULL); in basic_map_read_polylib() 2315 bmap = isl_basic_map_alloc(s->ctx, nparam, in, out, local, n_row, n_row); in basic_map_read_polylib() 2326 for (i = 0; i < n_row; ++i) in basic_map_read_polylib()
|
| H A D | isl_map.c | 7601 if (mat->n_row != 1 + nparam) in set_parameter_preimage() 7636 bset = isl_basic_set_extend(bset, 0, eq->n_row, 0); in basic_set_append_equalities() 7641 for (i = 0; i < eq->n_row; ++i) { in basic_set_append_equalities() 9560 if (div->n_row < bmap->n_div) in isl_basic_map_expand_divs() 9566 2 * (div->n_row - n_div)); in isl_basic_map_expand_divs() 9568 for (i = n_div; i < div->n_row; ++i) in isl_basic_map_expand_divs() 9580 for (i = 0; i < div->n_row; ++i) { in isl_basic_map_expand_divs() 12963 eq->n_row, ineq->n_row); in isl_basic_map_from_constraint_matrices() 12972 for (i = 0; i < eq->n_row; ++i) { in isl_basic_map_from_constraint_matrices() 12988 for (i = 0; i < ineq->n_row; ++i) { in isl_basic_map_from_constraint_matrices() [all …]
|
| H A D | isl_aff.c | 642 r = isl_reordering_extend(r, aff->ls->div->n_row); in isl_aff_realign_domain() 644 aff->ls->div->n_row); in isl_aff_realign_domain() 3940 isl_size n_row, n_col, n_out, total; in isl_multi_aff_from_aff_mat() local 3948 n_row = isl_mat_rows(mat); in isl_multi_aff_from_aff_mat() 3952 if (n_row < 0 || n_col < 0 || n_out < 0 || total < 0) in isl_multi_aff_from_aff_mat() 3954 if (n_row < 1) in isl_multi_aff_from_aff_mat() 3960 if (1 + n_out != n_row || 2 + total != n_row + n_col) in isl_multi_aff_from_aff_mat() 3968 for (i = 0; i < n_row - 1; ++i) { in isl_multi_aff_from_aff_mat()
|
| H A D | isl_transitive_closure.c | 239 n = steps->n_row; in path_along_steps() 822 steps->n_row = n; in construct_extended_path()
|
| H A D | isl_convex_hull.c | 412 bounds->n_row = 1; in initial_facet_constraint() 967 Q = isl_mat_drop_rows(Q, Q->n_row - lin_dim, lin_dim); in modulo_lineality()
|
| H A D | isl_vertices.c | 245 facets->n_row = n + 1; in is_independent()
|
| H A D | isl_fold.c | 550 if (qp->div->n_row > 0) in isl_qpolynomial_sign()
|
| /llvm-project-15.0.7/polly/lib/External/isl/include/isl/ |
| H A D | mat.h | 29 unsigned n_row, unsigned n_col); 31 unsigned n_row, unsigned n_col); 32 __isl_give isl_mat *isl_mat_identity(isl_ctx *ctx, unsigned n_row);
|