/haiku-buildtools/isl/ |
H A D | isl_tab_pip.c | 251 /* Check whether two partial solutions have the same mapping, where n_div 255 unsigned n_div) 265 dim = isl_basic_set_total_dim(s1->dom) - s1->dom->n_div; 268 if (isl_seq_first_non_zero(s1->M->row[i]+1+dim+n_div, 269 s1->M->n_col-1-dim-n_div) != -1) 271 if (isl_seq_first_non_zero(s2->M->row[i]+1+dim+n_div, 272 s2->M->n_col-1-dim-n_div) != -1) 274 if (!isl_seq_eq(s1->M->row[i], s2->M->row[i], 1+dim+n_div)) 290 unsigned n_div; local 309 n_div 254 same_solution(struct isl_partial_sol *s1, struct isl_partial_sol *s2, unsigned n_div) argument 612 unsigned n_div; local 4185 unsigned n_div; local 4575 unsigned n_in, n_out, n_div; local [all...] |
H A D | isl_map_subtract.c | 20 * The number of divs in "c" is given by "n_div" and the mapping 29 isl_int *c, int *div_map, unsigned n_div) 36 for (i = 0; i < n_div; ++i) { 69 expand_constraint(v, dim, bmap->eq[i], div_map, bmap->n_div); 73 expand_constraint(v, dim, bmap->eq[i], div_map, bmap->n_div); 82 expand_constraint(v, dim, bmap->ineq[i], div_map, bmap->n_div); 127 expand_constraint(v, dim, bmap->eq[c/2], div_map, bmap->n_div); 141 expand_constraint(v, dim, bmap->ineq[c], div_map, bmap->n_div); 164 if (!bmap->n_div) 168 *div_map = isl_alloc_array(bmap->ctx, int, bmap->n_div); 28 expand_constraint(isl_vec *v, unsigned dim, isl_int *c, int *div_map, unsigned n_div) argument [all...] |
H A D | isl_map_simplify.c | 76 for (i = 0; i < bset->n_div; ++i) 132 if (first + n == bmap->n_div) 140 for (i = 0; i < bmap->n_div - first - n; ++i) 143 bmap->div[bmap->n_div - n + i] = div[i]; 187 for (i = 0; i < bmap->n_div; ++i) 279 isl_assert(bmap->ctx, div < bmap->n_div, goto error); 293 for (i = 0; i < bmap->n_div; ++i) 296 if (div != bmap->n_div - 1) { 300 for (j = div; j < bmap->n_div - 1; ++j) 303 bmap->div[bmap->n_div [all...] |
H A D | isl_dim_map.c | 97 for (i = 0; i < bmap->n_div; ++i) { 158 for (i = 0; i < src->n_div; ++i) { 194 res = isl_dim_map_alloc(bmap->ctx, dim_map->len - 1 + bmap->n_div); 200 for (i = 0; i < bmap->n_div; ++i) {
|
H A D | isl_morph.c | 300 isl_assert(bset->ctx, bset->n_div == 0, return NULL); 387 isl_assert(bset->ctx, bset->n_div == 0, return NULL); 493 unsigned n_div; local 510 n_div = isl_basic_set_dim(bset, isl_dim_div); 513 nvar + n_div) == -1) 517 if (n_eq > nvar + n_div) 523 0, n_eq, 1 + nparam, nvar + n_div); 583 isl_seq_clr(bset->eq[k] + morph->inv->n_col, bset->n_div); 620 bset->n_div + max_stride, bset->n_eq + max_stride, bset->n_ineq); 622 for (i = 0; i < bset->n_div; [all...] |
H A D | isl_transitive_closure.c | 288 unsigned n_div; local 294 n_div = isl_basic_set_dim(bset, isl_dim_div); 306 for (i = 0; i < n_div; ++i) { 333 unsigned n_div; local 339 n_div = isl_basic_set_dim(bset, isl_dim_div); 343 for (i = 0; i < n_div; ++i) { 359 isl_seq_neg(c, c, 1 + nparam + d + n_div); 378 unsigned n_div; local 384 n_div = isl_basic_set_dim(bset, isl_dim_div); 388 div_purity = isl_alloc_array(bset->ctx, int, n_div); 459 unsigned n_div; local 565 unsigned n_div; local 2114 unsigned n_div; local [all...] |
H A D | isl_map_piplib.c | 55 unsigned n_div = isl_basic_map_n_div(bmap); local 60 nparam, n_in, n_out, n_div, pos); 79 unsigned div_pos = 1 + total - bmap->n_div + div; 194 unsigned old_n_div = bmap->n_div; 247 if (isl_basic_map_free_inequality(bmap, 2*(bmap->n_div - old_n_div))) 249 if (isl_basic_map_free_div(bmap, bmap->n_div - old_n_div)) 321 for (i = 0; i < data.bmap->n_div; ++i) 429 domain = isl_basic_map_to_pip(bmap, nparam + n_in, 0, dom->n_div);
|
H A D | isl_space_private.h | 28 unsigned n_div);
|
H A D | isl_map.c | 69 case isl_dim_div: return bmap->n_div; 130 return isl_space_dim(bset->dim, isl_dim_all) + bset->n_div; 160 return bmap ? bmap->n_div : 0; 165 return bmap ? isl_space_dim(bmap->dim, isl_dim_all) + bmap->n_div : 0; 278 cols = 1 + 1 + total + bmap->n_div; 279 div = isl_mat_alloc(ctx, bmap->n_div, cols); 283 for (i = 0; i < bmap->n_div; ++i) 318 int n_div; local 324 n_div = isl_local_space_dim(ls, isl_dim_div); 326 n_div, 6292 int n_div; local 6609 unsigned nparam, n_div; local 6745 int n_div; local 6774 int n_div; local 8062 int n_div; local 9576 unsigned n_div; local 9612 unsigned n_div; local 11598 set_ma_divs(__isl_keep isl_basic_map *bmap, __isl_keep isl_multi_aff *ma, int n_before, int n_after, int n_div) argument 11681 int n_div; local [all...] |
H A D | isl_local_space_private.h | 16 unsigned n_div);
|
H A D | isl_local_space.c | 53 unsigned n_div) 65 div = isl_mat_alloc(ctx, n_div, 1 + 1 + total + n_div); 452 return cmp_row(bmap->div[i], bmap->div[j], i, j, bmap->n_div, total); 470 if (bmap->n_div <= 1) 474 for (i = 1; i < bmap->n_div; ++i) { 722 unsigned n_div; local 732 n_div = eq->n_div; 734 j = isl_seq_last_non_zero(eq->eq[i], total + n_div); 52 isl_local_space_alloc(__isl_take isl_space *dim, unsigned n_div) argument [all...] |
H A D | isl_point.c | 365 if (bmap->n_div == 0) 368 dim = isl_basic_map_total_dim(bmap) - bmap->n_div; 369 vec = isl_vec_alloc(bmap->ctx, 1 + dim + bmap->n_div); 374 for (i = 0; i < bmap->n_div; ++i) {
|
H A D | isl_farkas.c | 283 if (bset->n_div) 308 if (bset->n_div)
|
H A D | isl_lp.c | 113 if (map->p[i]->n_div > max_div) 114 max_div = map->p[i]->n_div;
|
H A D | isl_coalesce.c | 167 map->p[i]->n_div, 211 for (k = 0; k < map->p[i]->n_div; ++k) { 1455 if (bmap1->n_div != bmap2->n_div) 1458 if (bmap1->n_div == 0) 1469 for (i = 0; i < bmap1->n_div; ++i) 1554 if (map->p[i]->n_div == map->p[j]->n_div) 1556 if (map->p[j]->n_div < map->p[i]->n_div) [all...] |
H A D | isl_output.c | 66 for (i = 0; i < bmap->n_div; ++i) { 541 if (bmap->n_div > 0) { 544 for (i = 0; i < bmap->n_div; ++i) { 552 if (bmap->n_div > 0) 610 if (bmap->n_div > 0) { 613 for (i = 0; i < bmap->n_div; ++i) { 630 if (bmap->n_div > 0) 764 bmap->n_div) != -1) 1634 unsigned n_div; local 1638 n_div 1657 unsigned n_div = isl_basic_set_dim(bset, isl_dim_div); local 1993 unsigned n_div; local [all...] |
H A D | isl_aff.c | 305 __isl_take isl_reordering *r, int n_div) 314 2 + isl_space_dim(r->dim, isl_dim_all) + n_div); 1732 unsigned n_div; local 1752 n_div = eq->n_div; 1754 j = isl_seq_last_non_zero(eq->eq[i], total + n_div); 1777 int n_div; local 1781 n_div = isl_local_space_dim(aff->ls, isl_dim_div); 1782 if (n_div > 0) 1783 eq = isl_basic_set_add_dims(eq, isl_dim_set, n_div); 304 vec_reorder(__isl_take isl_vec *vec, __isl_take isl_reordering *r, int n_div) argument 1800 int n_div; local 4182 unsigned n_div; local 4743 unsigned n_div; local [all...] |
H A D | isl_tab.h | 105 * are called parameters and the last "n_div" of these are called divs. 142 unsigned n_div; member in struct:isl_tab
|
H A D | isl_affine_hull.c | 320 isl_assert(bset->ctx, bset->n_div == 0, goto error); 1208 isl_seq_clr(bmap->eq[k] + M->n_col, bmap->n_div - n_known); 1268 for (n_known = 0; n_known < bmap->n_div; ++n_known) 1275 bmap->n_div - n_known) == -1) 1280 n_col = bmap->n_div - n_known;
|
H A D | isl_polynomial.c | 1037 unsigned n_div, __isl_take struct isl_upoly *up) 1056 qp->div = isl_mat_alloc(dim->ctx, n_div, 1 + 1 + total + n_div); 2222 unsigned n_div; local 2252 n_div = qp->div->n_row; 2255 if (qp && qp->div->n_row < n_div) 2406 int n_div; local 2450 n_div = qp->div->n_row; 2451 for (i = 0; i < n_div; ++i) { 2603 unsigned n_div; local 1036 isl_qpolynomial_alloc(__isl_take isl_space *dim, unsigned n_div, __isl_take struct isl_upoly *up) argument 4875 unsigned n_div; local [all...] |
H A D | isl_ilp.c | 359 div = isl_mat_alloc(ctx, bset->n_div, 364 for (i = 0; i < bset->n_div; ++i)
|
H A D | isl_mat.c | 1059 unsigned n_div, int has_div, struct isl_mat *mat) 1079 q[i] + has_div + t->n_col + e, n_div); 1080 isl_seq_clr(q[i] + has_div + t->n_col + n_div, e); 1124 if (preimage(ctx, bset->eq, bset->n_eq, bset->n_div, 0, 1128 if (preimage(ctx, bset->ineq, bset->n_ineq, bset->n_div, 0, 1132 if (preimage(ctx, bset->div, bset->n_div, bset->n_div, 1, mat) < 0) 1236 if (transform(ctx, bset->div, bset->n_div, 1 + pos, 1058 preimage(struct isl_ctx *ctx, isl_int **q, unsigned n, unsigned n_div, int has_div, struct isl_mat *mat) argument
|
H A D | isl_polynomial_private.h | 119 unsigned n_div, __isl_take struct isl_upoly *up);
|
/haiku-buildtools/cloog/source/isl/ |
H A D | constraints.c | 776 unsigned n_div; local 810 n_div = isl_basic_set_dim(bset, isl_dim_div); 811 if (n_div > 1) { 815 if (n_div < 1) {
|
H A D | domain.c | 800 unsigned n_div; local 810 n_div = isl_constraint_dim(c, isl_dim_div); 811 for (i = 0; i < n_div; ++i) { 816 if (i < n_div) 1787 unsigned n_div; local 1791 n_div = isl_constraint_dim(c, isl_dim_div); 1792 if (isl_constraint_involves_dims(c, isl_dim_div, 0, n_div))
|