| /src/external/mit/isl/dist/ |
| isl_mat_private.h | 16 unsigned n_col; member in struct:isl_mat
20 /* actual size of the rows in memory; n_col <= max_col */
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);
|
| isl_equalities.c | 77 M = isl_mat_alloc(B->ctx, B->n_row, B->n_row + B->n_col - 1);
87 for (j = 0; j < B->n_col - 1; ++j)
108 T = isl_mat_sub_alloc(U, B->n_row, B->n_col - 1, 0, B->n_row);
134 U = isl_mat_alloc(B->ctx, B->n_col - 1, B->n_col - 1);
137 isl_seq_cpy(U->row[0], B->row[0] + 1, B->n_col - 1);
173 size = B->n_col - 1;
184 for (k = 0; k < U->n_col; ++k)
188 for (k = 0; k < U->n_col; ++k)
323 if (cst->n_col == 0)
412 int n_row, n_col; local
[all...] |
| isl_local.c | 195 isl_size n_col; local
209 n_col = isl_mat_cols(mat1);
210 if (n_col < 0)
221 last1 = isl_seq_last_non_zero(mat1->row[i] + 1, n_col - 1);
222 last2 = isl_seq_last_non_zero(mat2->row[i] + 1, n_col - 1);
225 cmp = isl_seq_cmp(mat1->row[i], mat2->row[i], n_col);
275 mat = isl_mat_alloc(div->ctx, div->n_row, div->n_col + extra);
281 isl_seq_clr(mat->row[i] + 2, mat->n_col - 2);
|
| isl_affine_hull.c | 642 isl_assert(tab->mat->ctx, tab->samples->n_col == 1 + tab->n_var, goto error);
1039 isl_seq_gcd(M->row[i], M->n_col, &gcd);
1049 isl_seq_cpy(bmap->eq[k], M->row[i], M->n_col);
1050 isl_seq_clr(bmap->eq[k] + M->n_col, bmap->n_div - n_known);
1051 isl_int_set(bmap->eq[k][M->n_col - n_known + div],
1095 int n, n_col; local
1124 n_col = bmap->n_div - n_known;
1125 A = isl_mat_sub_alloc6(ctx, bmap->eq, 0, n, 1 + v_div + n_known, n_col);
1127 A = isl_mat_drop_cols(A, n, n_col - n);
|
| isl_morph.c | 519 if (C && C->n_col == 0) {
623 isl_size n_row, n_col; local
629 n_col = isl_mat_cols(mat);
630 if (n_row < 0 || n_col < 0)
633 space = isl_space_alloc(ctx, 0, n_col - 1, n_row - 1);
|
| isl_tab.h | 139 unsigned n_col; member in struct:isl_tab
|
| isl_scheduler_clustering.c | 990 isl_size n_row, n_col; local
996 n_col = isl_mat_cols(node->sched);
997 if (n_row < 0 || n_col < 0)
999 t = isl_mat_alloc(ctx, n_row, n_col);
|
| isl_input.c | 2368 int n_row, n_col; local
2393 n_col = isl_int_get_si(tok2->u.v);
2399 isl_assert(s->ctx, n_col >= 2 + nparam, return NULL);
2440 if (n_col != 1 + out + in + local + nparam + 1) {
2446 out = n_col - 2 - nparam;
|
| isl_map_simplify.c | 1004 if (C->n_col == 0) {
1030 if (T->n_col == 0) {
2706 isl_size n_row, n_col; local
2723 n_col = isl_mat_cols(ineq);
2724 if (n_row < 0 || n_col < 0)
2728 isl_seq_gcd(ineq->row[i] + 1, n_col - 1, &ctx->normalize_gcd);
2734 ctx->normalize_gcd, n_col - 1);
2845 if (T && T->n_col == 0) {
2912 if (1 + total != eq->n_col)
2922 isl_seq_cpy(bmap->eq[k], eq->row[i], eq->n_col);
5172 isl_size n_row, n_col; local
[all...] |
| isl_polynomial.c | 1614 int n_row, n_col; local
1618 div1->n_col >= div2->n_col,
1625 n_col = div1->n_col;
1627 div1->n_col = div2->n_col;
1632 div1->n_col = n_col;
1641 li = isl_seq_last_non_zero(div->row[i], div->n_col);
[all...] |
| isl_aff.c | 4118 isl_size n_row, n_col, n_out, total; local
4127 n_col = isl_mat_cols(mat);
4130 if (n_row < 0 || n_col < 0 || n_out < 0 || total < 0)
4135 if (n_col < 1)
4138 if (1 + n_out != n_row || 2 + total != n_row + n_col)
4150 v = isl_vec_alloc(ctx, 1 + n_col);
4154 isl_seq_cpy(v->el + 1, mat->row[1 + i], n_col);
|
