/netbsd-current/external/mit/isl/dist/ |
H A D | isl_mat.c | 42 isl_hash_byte(hash, mat->n_col & 0xFF); 46 row_hash = isl_seq_get_hash(mat->row[i], mat->n_col); 54 unsigned n_row, unsigned n_col) 64 mat->block = isl_blk_alloc(ctx, n_row * n_col); 71 if (n_col != 0) { 73 mat->row[i] = mat->block.data + i * n_col; 80 mat->n_col = n_col; 81 mat->max_col = n_col; 92 unsigned n_row, unsigned n_col) 53 isl_mat_alloc(isl_ctx *ctx, unsigned n_row, unsigned n_col) argument 91 isl_mat_extend(__isl_take isl_mat *mat, unsigned n_row, unsigned n_col) argument 148 isl_mat_sub_alloc6(isl_ctx *ctx, isl_int **row, unsigned first_row, unsigned n_row, unsigned first_col, unsigned n_col) argument 175 isl_mat_sub_alloc(__isl_keep isl_mat *mat, unsigned first_row, unsigned n_row, unsigned first_col, unsigned n_col) argument 184 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 193 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 405 isl_mat_zero(isl_ctx *ctx, unsigned n_row, unsigned n_col) argument [all...] |
H A D | 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);
|
H A D | 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);
|
H A D | isl_tab.c | 72 tab->n_col = n_var; 128 tab->n_row + n_new, off + tab->n_col); 165 if (tab->mat->n_col < off + tab->n_col + n_new) { 169 tab->mat->n_row, off + tab->n_col + n_new); 173 int, tab->n_col + n_new); 249 dup->col_var = isl_alloc_array(tab->mat->ctx, int, tab->mat->n_col - off); 250 if ((tab->mat->n_col - off) && !dup->col_var) 252 for (i = 0; i < tab->n_col; ++i) 282 dup->n_col [all...] |
H A D | 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 412 int n_row, n_col; local [all...] |
H A D | isl_factorization.c | 153 g->pos = isl_alloc_array(H->ctx, int, H->n_col); 154 g->group = isl_alloc_array(H->ctx, int, H->n_col); 155 g->cnt = isl_alloc_array(H->ctx, int, H->n_col); 163 for (i = 0, j = 0; i < H->n_col; ++i) { 169 for (i = 0; i < H->n_col; ++i) { 202 for (k = i + 1; k < H->n_col && j >= g->pos[k]; ++k) { 230 for (i = 0; i < H->n_col && g->cnt[0] < H->n_col; ++i) { 244 for (i = 1; i < H->n_col; ++i)
|
H A D | polytope_scan.c | 37 ss->samples->n_col);
|
H A D | isl_local_space.c | 655 if (ls->div->n_col != div->size) 699 unsigned c = src->n_col - src->n_row; 702 isl_seq_clr(dst->row[d] + c, dst->n_col - c); 715 unsigned n_row, unsigned n_col) 727 li = n_col - n_row + i; 729 li = isl_seq_last_non_zero(row_i, n_col); 731 lj = n_col - n_row + j; 733 lj = isl_seq_last_non_zero(row_j, n_col); 738 return isl_seq_cmp(row_i, row_j, n_col); 745 return cmp_row(div->row[i], div->row[j], i, j, div->n_row, div->n_col); 714 cmp_row(isl_int *row_i, isl_int *row_j, int i, int j, unsigned n_row, unsigned n_col) argument [all...] |
H A D | isl_tab_pip.c | 646 isl_seq_scale(mat->row[i], mat->row[i], m, mat->n_col); 730 isl_seq_clr(mat->row[0] + 1, mat->n_col - 1); 736 isl_seq_clr(mat->row[1 + row], mat->n_col); 772 mat->n_col); 1073 tab->mat->row[row][0], 1 + tab->M + tab->n_col); 1085 1 + tab->M + tab->n_col); 1290 * If there is no such column, then return tab->n_col. 1296 int col = tab->n_col; 1304 for (j = tab->n_dead; j < tab->n_col; ++j) { 1311 if (col == tab->n_col) [all...] |
H A D | 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);
|
H A D | 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...] |
H A D | isl_sample.c | 165 n_eq = tab->n_var - tab->n_col + tab->n_dead; 207 tab->n_zero = n_eq = tab->n_var - tab->n_col + tab->n_dead; 406 isl_assert(tab->mat->ctx, tab->basis->n_col == tab->n_var + 1, 717 isl_seq_clr(T->row[i] + 1, T->n_col - 1); 719 for (i = 0; i < T->n_col - 1; ++i) { 720 isl_seq_clr(T->row[sample->size + i], T->n_col); 1098 if (tab_cone->n_col == tab_cone->n_dead) {
|
H A D | 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);
|
H A D | 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...] |
H A D | 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);
|
H A D | isl_tab.h | 139 unsigned n_col; member in struct:isl_tab
|
H A D | isl_convex_hull.c | 432 isl_seq_normalize(set->ctx, bounds->row[0], bounds->n_col); 1504 isl_assert(set->ctx, 1 + dim == bounds->n_col, goto error); 1505 isl_seq_cpy(hull->ineq[k], bounds->row[0], bounds->n_col); 1526 return isl_bool_ok(isl_seq_eq(a->c->row[0] + 1, b, a->c->n_col - 1)); 2843 isl_seq_neg(mat->row[n_eq++], bset->eq[j], mat->n_col);
|
H A D | 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;
|
H A D | isl_vertices.c | 241 if (isl_seq_first_non_zero(f, facets->n_col) < 0) 244 isl_seq_cpy(facets->row[n], f, facets->n_col);
|
H A D | isl_map.c | 580 isl_seq_cpy(bmap->div[i], ls->div->row[i], ls->div->n_col); 7681 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col); 7682 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col); 7839 if (T && T->n_col == 0) { 7886 isl_seq_cpy(bmap->div[i], ls->div->row[i], ls->div->n_col); 7887 isl_seq_clr(bmap->div[i] + ls->div->n_col, old_n_div); 9677 isl_seq_cpy(bmap->div[i], div->row[i], div->n_col); 13014 if (eq->n_col != ineq->n_col) [all...] |
H A D | isl_coalesce.c | 830 int len = T->n_col - 1; 991 if (T->n_col == 0) { 1276 for (i = 1; i < wraps->mat->n_col; ++i)
|
H A D | 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);
|
H A D | isl_output.c | 620 div->row[pos] + 1, div->n_col - 1); 885 div->row[pos] + 1, div->n_col - 1);
|
/netbsd-current/external/mit/isl/dist/include/isl/ |
H A D | mat.h | 29 unsigned n_row, unsigned n_col); 31 unsigned n_row, unsigned n_col);
|