Searched refs:n_row (Results 1 - 25 of 26) sorted by relevance

12

/haiku-buildtools/isl/
H A Disl_mat_private.h11 unsigned n_row; member in struct:isl_mat
23 unsigned first_row, unsigned n_row, unsigned first_col, unsigned n_col);
25 unsigned first_row, unsigned n_row, unsigned first_col, unsigned n_col);
27 unsigned n_row, unsigned dst_col, unsigned src_col, unsigned n_col);
29 unsigned n_row, unsigned dst_col, unsigned src_col, unsigned n_col);
30 __isl_give isl_mat *isl_mat_diag(isl_ctx *ctx, unsigned n_row, isl_int d);
H A Disl_equalities.c75 M = isl_mat_alloc(B->ctx, B->n_row, B->n_row + B->n_col - 1);
76 C = isl_mat_alloc(B->ctx, 1 + B->n_row, 1);
80 for (i = 0; i < B->n_row; ++i) {
81 isl_seq_clr(M->row[i], B->n_row);
86 isl_int_fdiv_r(M->row[i][B->n_row + j],
92 H = isl_mat_sub_alloc(M, 0, B->n_row, 0, B->n_row);
97 for (i = 0; i < B->n_row; ++i) {
102 if (i < B->n_row)
410 int n_row, n_col; local
[all...]
H A Disl_mat.c24 unsigned n_row, unsigned n_col)
34 mat->block = isl_blk_alloc(ctx, n_row * n_col);
37 mat->row = isl_alloc_array(ctx, isl_int *, n_row);
38 if (n_row && !mat->row)
41 for (i = 0; i < n_row; ++i)
47 mat->n_row = n_row;
60 unsigned n_row, unsigned n_col)
69 if (mat->max_col >= n_col && mat->n_row >= n_row) {
23 isl_mat_alloc(struct isl_ctx *ctx, unsigned n_row, unsigned n_col) argument
59 isl_mat_extend(struct isl_mat *mat, unsigned n_row, unsigned n_col) argument
116 isl_mat_sub_alloc6(isl_ctx *ctx, isl_int **row, unsigned first_row, unsigned n_row, unsigned first_col, unsigned n_col) argument
143 isl_mat_sub_alloc(__isl_keep isl_mat *mat, unsigned first_row, unsigned n_row, unsigned first_col, unsigned n_col) argument
152 isl_mat_sub_copy(struct isl_ctx *ctx, isl_int **dst, isl_int **src, unsigned n_row, unsigned dst_col, unsigned src_col, unsigned n_col) argument
161 isl_mat_sub_neg(struct isl_ctx *ctx, isl_int **dst, isl_int **src, unsigned n_row, unsigned dst_col, unsigned src_col, unsigned n_col) argument
324 isl_mat_diag(isl_ctx *ctx, unsigned n_row, isl_int d) argument
341 isl_mat_identity(isl_ctx *ctx, unsigned n_row) argument
703 row_first_non_zero(isl_int **row, unsigned n_row, unsigned col) argument
713 row_abs_min_non_zero(isl_int **row, unsigned n_row, unsigned col) argument
[all...]
H A Disl_local_space.c156 return ls->div->n_row;
158 return isl_space_dim(ls->dim, isl_dim_all) + ls->div->n_row;
215 if (pos < 0 || pos >= ls->div->n_row)
300 extra = isl_space_dim(r->dim, isl_dim_all) + div->n_row - r->len;
301 mat = isl_mat_alloc(div->ctx, div->n_row, div->n_col + extra);
305 for (i = 0; i < div->n_row; ++i) {
363 isl_seq_cpy(ls->div->row[ls->div->n_row - 1], div->el, div->size);
364 isl_int_set_si(ls->div->row[ls->div->n_row - 1][div->size], 0);
398 unsigned c = src->n_col - src->n_row;
414 unsigned n_row, unsigne
413 cmp_row(isl_int *row_i, isl_int *row_j, int i, int j, unsigned n_row, unsigned n_col) argument
[all...]
H A Dpolytope_scan.c35 ss->samples = isl_mat_extend(ss->samples, ss->samples->n_row + 1,
40 isl_seq_cpy(ss->samples->row[ss->samples->n_row - 1],
H A Disl_tab.c26 unsigned n_row, unsigned n_var, unsigned M)
35 tab->mat = isl_mat_alloc(ctx, n_row, off + n_var);
41 tab->con = isl_alloc_array(ctx, struct isl_tab_var, n_row);
42 if (n_row && !tab->con)
47 tab->row_var = isl_alloc_array(ctx, int, n_row);
48 if (n_row && !tab->row_var)
60 tab->n_row = 0;
63 tab->max_con = n_row;
116 if (tab->mat->n_row < tab->n_row
25 isl_tab_alloc(struct isl_ctx *ctx, unsigned n_row, unsigned n_var, unsigned M) argument
[all...]
H A Disl_polynomial.c1087 dup = isl_qpolynomial_alloc(isl_space_copy(qp->dim), qp->div->n_row,
1191 int n_row, n_col; local
1194 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
1197 if (div1->n_row == div2->n_row)
1200 n_row = div1->n_row;
1202 div1->n_row = div2->n_row;
[all...]
H A Disl_coalesce.c164 unsigned extra_rows = extra ? extra->n_row : 0;
637 * wraps->n_row is the number of actual wrapped constraints that have
641 * way that no wrapping is possible. If this happens then wraps->n_row
645 * satisfy the bound, then wraps->n_row is also reset to zero.
654 w = wraps->mat->n_row;
700 wraps->mat->n_row = w;
703 wraps->mat->n_row = 0;
709 * If not, wraps->n_row is set to zero.
716 for (i = first; i < wraps->n_row; ++i) {
723 wraps->n_row
[all...]
H A Disl_factorization.c144 g->rowgroup = isl_alloc_array(H->ctx, int, H->n_row);
149 for (i = 0; i < H->n_row; ++i)
152 for ( ; j < H->n_row; ++j)
219 if (g->pos[i] == H->n_row)
223 for (j = g->pos[i] + 1; j < H->n_row; ++j) {
H A Disl_morph.c416 H1 = isl_mat_sub_alloc(H, 0, H->n_row, 0, H->n_row);
446 U1 = isl_mat_sub_alloc(U, 0, U->n_row, 0, n_eq);
448 U2 = isl_mat_sub_alloc(U, 0, U->n_row, n_eq, U->n_row - n_eq);
570 for (i = 0; 1 + i < morph->inv->n_row; ++i) {
616 max_stride = morph->inv->n_row - 1;
627 0, morph->inv->n_row);
642 0, morph->inv->n_row);
658 1, morph->inv->n_row);
[all...]
H A Disl_tab.h135 unsigned n_row; member in struct:isl_tab
182 unsigned n_row, unsigned n_var, unsigned M);
H A Disl_tab_pip.c267 for (i = 0; i < s1->M->n_row; ++i) {
388 static void scale_rows(struct isl_mat *mat, isl_int m, int n_row) argument
395 for (i = 0; i < n_row; ++i)
657 for (i = 0; i < M->n_row - 1; ++i) {
1135 for (row = tab->n_redundant; row < tab->n_row; ++row) {
1144 for (row = tab->n_redundant; row < tab->n_row; ++row) {
1865 for (i = tab->n_outside; i < samples->n_row; ++i) {
2089 enum isl_tab_row_sign, tab->mat->n_row);
2090 if (tab->mat->n_row && !tab->row_sign)
2166 for (split = tab->n_redundant; split < tab->n_row;
[all...]
H A Disl_sample.c129 bounds->n_row = 1;
175 bounds->n_row = 1+n;
234 new_dim = bounds->n_row - 1;
527 isl_assert(tab->mat->ctx, tab->basis->n_row == tab->n_var + 1,
1212 tab->n_zero = eq->n_row;
1217 tab->n_unbounded = tab->n_var - (eq->n_row - tab->n_zero);
H A Disl_schedule.c141 * n_row is the current (maximal) number of linearly independent
181 int n_row; member in struct:isl_sched_graph
1165 int n_row = isl_mat_rows(node->sched); local
1167 H = isl_mat_sub_alloc(node->sched, 0, n_row,
1467 return node->nvar - node->rank >= graph->maxvar - graph->n_row;
1580 graph->n_row++;
1947 nvar = node->nvar + graph->n_row - node->rank;
1989 split.n_row = graph->n_row;
2098 graph->n_row
[all...]
H A Disl_affine_hull.c1193 M->n_row - 1, M->n_row - 1, 0);
1196 for (i = 1; i < M->n_row; ++i) {
H A Disl_vertices.c234 for (row = 0; row < H->n_row; ++row)
237 if (row == H->n_row)
257 facets->n_row = n + 1;
H A Disl_input.c1643 int n_row, n_col; local
1667 n_row = isl_int_get_si(tok->u.v);
1673 isl_assert(s->ctx, n_row >= 0, return NULL);
1725 bmap = isl_basic_map_alloc(s->ctx, nparam, in, out, local, n_row, n_row);
1736 for (i = 0; i < n_row; ++i)
H A Disl_map_simplify.c918 for (i = 0; i < T->n_row - 1; ++i) {
925 pos = isl_alloc_array(bmap->ctx, int, T->n_row);
942 for (i = 1; i < T->n_row; ++i) {
954 for (i = 1; i < T->n_row; ++i) {
968 if (pos[j] < T->n_row && C2)
H A Disl_aff.c339 r = isl_reordering_extend(r, aff->ls->div->n_row);
341 aff->ls->div->n_row);
4673 if (src->ls->div->n_row == 0)
4676 exp1 = isl_alloc_array(ctx, int, src->ls->div->n_row);
4677 exp2 = isl_alloc_array(ctx, int, dst->ls->div->n_row);
4678 if (!exp1 || (dst->ls->div->n_row && !exp2))
H A Disl_map.c6478 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
6513 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
6550 eq->n_row, 0);
6555 for (i = 0; i < eq->n_row; ++i) {
8068 if (div->n_row < bset->n_div)
8074 div->n_row - n_div, 0,
8075 2 * (div->n_row - n_div));
8077 for (i = n_div; i < div->n_row; ++i)
8082 for (i = div->n_row - 1; i >= 0; --i) {
10764 eq->n_row, ine
[all...]
H A Disl_convex_hull.c500 bounds->n_row = 1;
1050 Q = isl_mat_drop_rows(Q, Q->n_row - lin_dim, lin_dim);
H A Disl_transitive_closure.c228 n = steps->n_row;
795 steps->n_row = n;
/haiku-buildtools/cloog/include/cloog/
H A Dmatrix.h53 unsigned n_row, unsigned n_col);
/haiku-buildtools/cloog/source/
H A Dmatrix.c170 unsigned n_row, n_col; local
175 if (sscanf(line, "%u %u", &n_row, &n_col) != 2)
178 return cloog_matrix_read_of_size(input, n_row, n_col);
185 unsigned n_row, unsigned n_col)
193 M = cloog_matrix_alloc(n_row, n_col);
196 for (i = 0; i < n_row; ++i) {
184 cloog_matrix_read_of_size(FILE *input, unsigned n_row, unsigned n_col) argument
/haiku-buildtools/isl/include/isl/
H A Dmat.h31 unsigned n_row, unsigned n_col);
34 unsigned n_row, unsigned n_col);
35 struct isl_mat *isl_mat_identity(struct isl_ctx *ctx, unsigned n_row);

Completed in 208 milliseconds

12