| /src/external/mit/isl/dist/ |
| isl_mat_private.h | 15 unsigned n_row; member in struct:isl_mat
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);
|
| isl_equalities.c | 77 M = isl_mat_alloc(B->ctx, B->n_row, B->n_row + B->n_col - 1);
78 C = isl_mat_alloc(B->ctx, 1 + B->n_row, 1);
82 for (i = 0; i < B->n_row; ++i) {
83 isl_seq_clr(M->row[i], B->n_row);
88 isl_int_fdiv_r(M->row[i][B->n_row + j],
94 H = isl_mat_sub_alloc(M, 0, B->n_row, 0, B->n_row);
99 for (i = 0; i < B->n_row; ++i) {
104 if (i < B->n_row)
412 int n_row, n_col; local
[all...] |
| isl_scheduler.h | 183 * n_row is the current (maximal) number of linearly independent
230 int n_row; member in struct:isl_sched_graph
|
| isl_morph.c | 623 isl_size n_row, n_col; local
628 n_row = isl_mat_rows(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 | 138 unsigned n_row; member in struct:isl_tab
185 unsigned n_row, unsigned n_var, unsigned M);
|
| isl_mat.c | 41 isl_hash_byte(hash, mat->n_row & 0xFF);
43 for (i = 0; i < mat->n_row; ++i) {
54 unsigned n_row, unsigned n_col)
64 mat->block = isl_blk_alloc(ctx, n_row * n_col);
67 mat->row = isl_calloc_array(ctx, isl_int *, n_row);
68 if (n_row && !mat->row)
72 for (i = 0; i < n_row; ++i)
79 mat->n_row = n_row;
92 unsigned n_row, unsigned n_col
2054 isl_size n_row; local
[all...] |
| isl_scheduler_clustering.c | 86 return graph->n_row < graph->maxvar &&
990 isl_size n_row, n_col; local
995 n_row = isl_mat_rows(t_node->sched);
997 if (n_row < 0 || n_col < 0)
999 t = isl_mat_alloc(ctx, n_row, n_col);
1002 for (i = 0; i < n_row; ++i) {
1051 graph->n_row -= n;
1053 graph->n_row += n_new;
1283 c->cluster[pos].n_row = c->scc[pos].n_row;
[all...] |
| isl_input.c | 2368 int n_row, n_col; local
2392 n_row = isl_int_get_si(tok->u.v);
2398 isl_assert(s->ctx, n_row >= 0, return NULL);
2447 bmap = isl_basic_map_alloc(s->ctx, nparam, in, out, local, n_row, n_row);
2458 for (i = 0; i < n_row; ++i)
|
| isl_map_simplify.c | 1037 for (i = 0; i < T->n_row - 1; ++i) {
1044 pos = isl_alloc_array(bmap->ctx, int, T->n_row);
1062 for (i = 1; i < T->n_row; ++i) {
1073 for (i = 1; i < T->n_row; ++i) {
1087 if (pos[j] < T->n_row && C2)
2706 isl_size n_row, n_col; local
2722 n_row = isl_mat_rows(ineq);
2724 if (n_row < 0 || n_col < 0)
2727 for (i = 0; i < n_row; ++i) {
2917 0, eq->n_row, 0)
5172 isl_size n_row, n_col; local
[all...] |
| isl_polynomial.c | 622 return qp->div->n_row;
1505 dup = isl_qpolynomial_alloc(isl_space_copy(qp->dim), qp->div->n_row,
1614 int n_row, n_col; local
1617 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
1621 if (div1->n_row == div2->n_row)
1624 n_row = div1->n_row;
1626 div1->n_row = div2->n_row
[all...] |
| isl_scheduler.c | 2243 isl_size n_row = isl_mat_rows(node->sched); local
2245 if (n_row < 0)
2247 return isl_mat_sub_alloc(node->sched, 0, n_row,
2860 return node->nvar - node->rank >= graph->maxvar - graph->n_row;
3017 graph->n_row++;
3616 nvar = node->nvar + graph->n_row - node->rank;
3656 sub->n_row = graph->n_row;
3729 graph->n_row -= drop;
4292 isl_size n_row; local
5415 isl_size n_row; local
[all...] |
| isl_aff.c | 696 r = isl_reordering_extend(r, aff->ls->div->n_row);
4118 isl_size n_row, n_col, n_out, total; local
4126 n_row = isl_mat_rows(mat);
4130 if (n_row < 0 || n_col < 0 || n_out < 0 || total < 0)
4132 if (n_row < 1)
4138 if (1 + n_out != n_row || 2 + total != n_row + n_col)
4146 for (i = 0; i < n_row - 1; ++i) {
|
