|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
tools/polly/lib/External/isl/isl_aff.c 2048 n_div = eq->n_div;
tools/polly/lib/External/isl/isl_affine_hull.c 308 isl_assert(bset->ctx, bset->n_div == 0, goto error);
1020 isl_seq_clr(bmap->eq[k] + M->n_col, bmap->n_div - n_known);
1080 for (n_known = 0; n_known < bmap->n_div; ++n_known)
1087 bmap->n_div - n_known) == -1)
1092 n_col = bmap->n_div - n_known;
tools/polly/lib/External/isl/isl_coalesce.c 505 info[i].bmap->n_div, n_eq, n_eq + n_ineq + extra_rows);
514 for (k = 0; k < info[i].bmap->n_div; ++k) {
1066 for (l = 0; l < info[i].bmap->n_div; ++l)
2586 for (i = 0; i < info1->bmap->n_div; ++i) {
2613 if (i < info1->bmap->n_div)
2652 if (info1->bmap->n_div != info2->bmap->n_div)
2652 if (info1->bmap->n_div != info2->bmap->n_div)
2654 if (info1->bmap->n_div == 0)
2691 if (bmap1->n_div != bmap2->n_div)
2691 if (bmap1->n_div != bmap2->n_div)
2694 if (bmap1->n_div == 0)
2705 for (i = 0; i < bmap1->n_div; ++i)
3217 if (info[i].bmap->n_div == 0)
3242 if (bmap_i->n_div > info[j].bmap->n_div) {
3242 if (bmap_i->n_div > info[j].bmap->n_div) {
3274 if (info[i].bmap->n_div < info[j].bmap->n_div)
3274 if (info[i].bmap->n_div < info[j].bmap->n_div)
3279 if (info[j].bmap->n_div < info[i].bmap->n_div)
3279 if (info[j].bmap->n_div < info[i].bmap->n_div)
3712 if (!preserve && info[i].bmap->n_div == info[j].bmap->n_div) {
3712 if (!preserve && info[i].bmap->n_div == info[j].bmap->n_div) {
tools/polly/lib/External/isl/isl_convex_hull.c 173 isl_assert(bset->ctx, bset->n_div == 0, goto error);
tools/polly/lib/External/isl/isl_dim_map.c 96 for (i = 0; i < bmap->n_div; ++i) {
157 for (i = 0; i < src->n_div; ++i) {
196 res = isl_dim_map_alloc(bmap->ctx, dim_map->len - 1 + bmap->n_div);
202 for (i = 0; i < bmap->n_div; ++i) {
tools/polly/lib/External/isl/isl_equalities.c 676 isl_assert(bset->ctx, bset->n_div == 0, goto error);
tools/polly/lib/External/isl/isl_farkas.c 305 if (bset->n_div)
330 if (bset->n_div)
tools/polly/lib/External/isl/isl_ilp.c 360 div = isl_mat_alloc(ctx, bset->n_div,
365 for (i = 0; i < bset->n_div; ++i)
tools/polly/lib/External/isl/isl_local_space.c 675 return cmp_row(bmap->div[i], bmap->div[j], i, j, bmap->n_div, total);
693 if (bmap->n_div <= 1)
697 for (i = 1; i < bmap->n_div; ++i) {
984 n_div = eq->n_div;
tools/polly/lib/External/isl/isl_lp.c 107 if (map->p[i]->n_div > max_div)
108 max_div = map->p[i]->n_div;
tools/polly/lib/External/isl/isl_map.c 84 case isl_dim_div: return bmap->n_div;
158 return isl_space_dim(bset->dim, isl_dim_all) + bset->n_div;
188 return bmap ? bmap->n_div : 0;
193 return bmap ? isl_space_dim(bmap->dim, isl_dim_all) + bmap->n_div : 0;
391 cols = 1 + 1 + total + bmap->n_div;
392 div = isl_mat_alloc(ctx, bmap->n_div, cols);
396 for (i = 0; i < bmap->n_div; ++i)
1151 bmap->n_div = 0;
1238 for (i = 0; i < src->n_div; ++i) {
1252 bmap->n_div, bmap->n_eq, bmap->n_ineq);
1452 bmap->extra - bmap->n_div);
1534 bmap->extra - bmap->n_div);
1631 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
1632 isl_seq_clr(bmap->div[bmap->n_div] +
1634 bmap->extra - bmap->n_div);
1636 return bmap->n_div++;
1701 isl_assert(bmap->ctx, n <= bmap->n_div, return isl_stat_error);
1702 bmap->n_div -= n;
1743 isl_min(dst_map->extra-div_off, src_map->n_div));
1744 if (dst_map->n_div-div_off > src_map->n_div)
1744 if (dst_map->n_div-div_off > src_map->n_div)
1746 div_off+src_map->n_div,
1747 dst_map->n_div - div_off - src_map->n_div);
1747 dst_map->n_div - div_off - src_map->n_div);
1768 div_off = bmap1->n_div;
1786 for (i = 0; i < bmap2->n_div; ++i) {
1826 base->extra >= base->n_div + extra;
2017 for (i = 0; i < bmap->n_div; ++i)
2039 if (isl_basic_map_free_div(bmap, bmap->n_div) < 0)
2157 for (i = 0; i < bmap->n_div; ++i)
2197 if (first + n == bmap->n_div)
2205 for (i = 0; i < bmap->n_div - first - n; ++i)
2208 bmap->div[bmap->n_div - n + i] = div[i];
2267 for (i = 0; i < bmap->n_div; ++i)
2356 isl_assert(bmap->ctx, div < bmap->n_div, goto error);
2370 for (i = 0; i < bmap->n_div; ++i)
2373 if (div != bmap->n_div - 1) {
2377 for (j = div; j < bmap->n_div - 1; ++j)
2380 bmap->div[bmap->n_div - 1] = t;
2448 isl_space_dim(bmap->dim, isl_dim_all), bmap->n_div);
2451 bmap->n_div = 0;
2522 for (i = bmap->n_div - 1; i >= 0; --i) {
2589 for (j = 0; (lb || ub) && j < total + bmap->n_div; ++j) {
2610 for (j = 0; j < 1 + total + bmap->n_div; ++j) {
2622 for (j = 0; j < 1 + total + bmap->n_div; ++j) {
2740 for (i = bmap->n_div - 1; i >= 0; --i) {
2752 i = bmap->n_div;
2819 for (i = 0; i < bmap->n_div; ++i) {
3074 for (i = bmap->n_div - 1; i >= 0; --i) {
3097 for (i = bmap->n_div - 1; i >= 0; --i) {
3103 i = bmap->n_div;
3258 for (i = bmap->n_div; i < bmap->extra; ++i) {
3300 for (i = 0; i < bmap->n_div; ++i) {
3490 bset->n_div, bset->n_eq, bset->n_ineq);
3540 bset->n_div, bset->n_eq, bset->n_ineq);
3635 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
3678 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
3679 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
3746 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
3746 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
3913 bmap->n_div, bmap->n_eq, bmap->n_ineq);
4098 bmap->n_div, bmap->n_eq, bmap->n_ineq);
4213 first, n, total - bmap->n_div - n);
4225 bmap->n_div, bmap->n_eq, bmap->n_ineq);
4268 bmap->n_div += n;
4506 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
4506 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
4514 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
4515 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
4519 bmap1->n_div + bmap2->n_div + n,
4519 bmap1->n_div + bmap2->n_div + n,
4591 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
4591 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
4599 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
4600 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
4604 bmap1->n_div + bmap2->n_div + 2 * n_out,
4604 bmap1->n_div + bmap2->n_div + 2 * n_out,
4694 for (i = 0; i < bmap->n_div; ++i)
4751 total = nparam + n_in + n_out + bmap->n_div + n_out;
4756 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
4759 bmap->n_div + n_out,
5281 unsigned div_pos = total - bmap->n_div + div;
5335 div_pos = total - bmap->n_div + div;
5349 bmap->n_div == 0 &&
5356 bmap->dim = isl_space_underlying(bmap->dim, bmap->n_div);
5359 bmap->extra -= bmap->n_div;
5360 bmap->n_div = 0;
5409 isl_assert(ctx, bset->n_div == 0, goto error);
5413 if (like->n_div == 0) {
5427 bmap->n_div = like->n_div;
5427 bmap->n_div = like->n_div;
5428 bmap->extra += like->n_div;
5445 for (i = 0; i < like->n_div; ++i) {
5480 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
5480 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
7355 old_n_div = bmap->n_div;
7480 n_known, bmap->n_div - n_known);
7482 for (i = n_known; i < bmap->n_div; ++i)
7484 bmap->n_div -= n_known;
7549 for (i = 0; i < bmap->n_div; ++i) {
7553 return bmap->n_div;
8827 for (i = 0; i < bmap->n_div; ++i) {
8832 bmap->n_div-i);
8897 if (div->n_row < bmap->n_div)
8901 n_div = bmap->n_div;
8959 isl_assert(dst->ctx, div <= dst->n_div, return -1);
8960 for (i = div; i < dst->n_div; ++i)
8963 dst->n_div - div) == -1)
8985 if (src->n_div == 0)
9000 for (i = 0; i < src->n_div; ++i) {
9004 int extra = src->n_div - i;
9017 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
9623 if (bmap1->n_div != bmap2->n_div)
9623 if (bmap1->n_div != bmap2->n_div)
9624 return bmap1->n_div - bmap2->n_div;
9624 return bmap1->n_div - bmap2->n_div;
9636 for (i = 0; i < bmap1->n_div; ++i) {
9975 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
9975 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
9985 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
9988 bmap1->n_div + bmap2->n_div,
9988 bmap1->n_div + bmap2->n_div,
10036 total = nparam + in1 + in2 + out + bmap1->n_div + bmap2->n_div;
10036 total = nparam + in1 + in2 + out + bmap1->n_div + bmap2->n_div;
10046 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
10049 bmap1->n_div + bmap2->n_div,
10049 bmap1->n_div + bmap2->n_div,
10088 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
10088 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
10098 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
10101 bmap1->n_div + bmap2->n_div,
10101 bmap1->n_div + bmap2->n_div,
10454 isl_hash_byte(hash, bmap->n_div & 0xFF);
10455 for (i = 0; i < bmap->n_div; ++i) {
10577 dim = isl_space_lift(dim, bset->n_div);
10582 bset->extra -= bset->n_div;
10583 bset->n_div = 0;
10608 n_div = set->p[0]->n_div;
10639 size += bset->n_div * (2 + dim);
10671 for (i = 0; i < bmap->n_div; ++i) {
12676 for (i = 0; i < bset->n_div; ++i) {
12795 isl_seq_clr(bmap->div[i] + o_bmap, bmap->n_div - n_div);
13018 for (i = 0; i < bmap->n_div; ++i) {
13592 if (isl_mat_sub_transform(bmap->div, bmap->n_div, 1 + pos,
tools/polly/lib/External/isl/isl_map_simplify.c 210 if (bmap->n_div == 0)
213 for (i = 0; i < bmap->n_div; ++i) {
276 if (bmap->n_div == 0)
279 for (i = 0; i < bmap->n_div; ++i)
297 last_div = isl_seq_last_non_zero(eq + 1 + space_total, bmap->n_div);
319 for (k = 0; k < bmap->n_div; ++k) {
368 last_div = isl_seq_last_non_zero(eq + 1 + space_total, bmap->n_div);
399 for (d = bmap->n_div - 1; d >= 0 ; --d) {
440 for (d = bmap->n_div - 1; d >= 0 ; --d) {
559 total_var = total - bmap->n_div;
758 if (!bmap || bmap->n_div <= 1)
762 total = total_var + bmap->n_div;
765 for (k = bmap->n_div - 1; k >= 0; --k)
771 size = round_up(4 * bmap->n_div / 3 - 1);
774 elim_for = isl_calloc_array(ctx, int, bmap->n_div);
803 for (l = bmap->n_div - 1; l >= 0; --l) {
829 for (i = 0, j = bmap->n_div-1; i < bmap->n_eq; ++i) {
906 if (bmap->n_div == 0)
937 for (i = 0, j = bmap->n_div-1; i < div_eq; ++i) {
971 for (j = bmap->n_div - 1; j >= 0; --j) {
1000 isl_seq_clr(bmap->div[k] + 1, 1 + total + bmap->n_div);
1017 isl_seq_neg(bmap->eq[j], bmap->div[k]+1, 1+total+bmap->n_div);
1043 isl_seq_neg(bmap->div[div] + 1, bmap->ineq[ineq], total + bmap->n_div);
1065 for (j = 0; j < bmap->n_div; ++j) {
1075 for (j = 0; j < bmap->n_div; ++j) {
1106 bmap->n_div - (div + 1)) >= 0)
1111 total + bmap->n_div);
1135 for (i = 0; i < bmap->n_div; ++i) {
1297 for (i = 0; i < bmap->n_div; ++i) {
1317 total + bmap->n_div);
1322 total + bmap->n_div);
1399 bmap->n_div-div-1) != -1)
1405 bmap->n_div-div-1) != -1)
1447 for (i = 0; i < bmap->n_div; ++i) {
1471 for (i = bmap->n_div-1; i >= 0; --i) {
1523 for (i = 0; i < bmap->n_div; ++i) {
1559 d >= 0 && d >= total - bmap->n_div && d >= pos; --d)
1560 isl_seq_clr(bmap->div[d-(total-bmap->n_div)], 2+total);
3593 if (bmap1->n_div || bmap2->n_div)
3593 if (bmap1->n_div || bmap2->n_div)
3907 if (bmap->n_div <= 1)
3913 bmap->n_div - div - 1) != -1)
3916 dim + bmap->n_div))
3919 for (i = 0; i < bmap->n_div; ++i) {
3936 for (i = 0; i < bmap->n_div; ++i) {
3941 for (j = 0; j < bmap->n_div; ++j) {
3947 if (j < bmap->n_div)
4277 total = 1 + dim + bmap->n_div;
4330 for (i = 0; i < bmap->n_div; ++i) {
4714 if (bmap->n_div == 0)
4718 pairs = isl_calloc_array(bmap->ctx, int, bmap->n_div);
4722 for (i = 0; i < bmap->n_div; ++i) {
4730 for (j = i; j < bmap->n_div; ++j)
4733 if (j < bmap->n_div)
4885 for (i = 0; i < bmap->n_div; ++i) {
5209 for (i = 0; i < bmap->n_div; ++i) {
tools/polly/lib/External/isl/isl_map_subtract.c 73 expand_constraint(v, dim, bmap->eq[i], div_map, bmap->n_div);
77 expand_constraint(v, dim, bmap->eq[i], div_map, bmap->n_div);
86 expand_constraint(v, dim, bmap->ineq[i], div_map, bmap->n_div);
135 expand_constraint(v, dim, bmap->eq[c/2], div_map, bmap->n_div);
149 expand_constraint(v, dim, bmap->ineq[c], div_map, bmap->n_div);
172 if (!bmap->n_div)
176 *div_map = isl_alloc_array(bmap->ctx, int, bmap->n_div);
181 dim = total - tab->bmap->n_div;
182 vec = isl_vec_alloc(bmap->ctx, 2 + total + bmap->n_div);
186 for (i = 0; i < bmap->n_div; ++i) {
188 isl_seq_clr(vec->el + 2 + dim, tab->bmap->n_div);
193 for (j = 0; j < tab->bmap->n_div; ++j)
195 vec->el, 2 + dim + tab->bmap->n_div))
198 if (j == tab->bmap->n_div) {
199 vec->size = 2 + dim + tab->bmap->n_div;
723 if (bmap->n_div)
tools/polly/lib/External/isl/isl_mat.c 1381 if (preimage(ctx, bset->eq, bset->n_eq, bset->n_div, 0,
1385 if (preimage(ctx, bset->ineq, bset->n_ineq, bset->n_div, 0,
1389 if (preimage(ctx, bset->div, bset->n_div, bset->n_div, 1, mat) < 0)
1389 if (preimage(ctx, bset->div, bset->n_div, bset->n_div, 1, mat) < 0)
tools/polly/lib/External/isl/isl_morph.c 368 isl_assert(bset->ctx, bset->n_div == 0, return NULL);
432 isl_assert(bset->ctx, bset->n_div == 0, return NULL);
593 isl_seq_clr(bset->eq[k] + morph->inv->n_col, bset->n_div);
630 bset->n_div + max_stride, bset->n_eq + max_stride, bset->n_ineq);
632 for (i = 0; i < bset->n_div; ++i)
647 morph->inv->row[0][0], bset->n_div);
663 morph->inv->row[0][0], bset->n_div);
667 mat = isl_mat_sub_alloc6(bset->ctx, bset->div, 0, bset->n_div,
672 for (i = 0; i < bset->n_div; ++i) {
678 morph->inv->row[0][0], bset->n_div);
tools/polly/lib/External/isl/isl_output.c 78 for (i = 0; i < bmap->n_div; ++i) {
1267 bmap->n_div) != -1)
tools/polly/lib/External/isl/isl_point.c 456 if (bmap->n_div == 0)
459 dim = isl_basic_map_total_dim(bmap) - bmap->n_div;
460 vec = isl_vec_alloc(bmap->ctx, 1 + dim + bmap->n_div);
465 for (i = 0; i < bmap->n_div; ++i) {
tools/polly/lib/External/isl/isl_polynomial.c 2804 n_div = eq->n_div;
tools/polly/lib/External/isl/isl_pw_templ.c 1714 if (set->p[i]->n_div > 0)
tools/polly/lib/External/isl/isl_sample.c 1139 isl_assert(ctx, bset->n_div == 0, goto error);
tools/polly/lib/External/isl/isl_tab.c 2221 div_pos = 1 + total - bmap->n_div + div;
2255 div_pos = 1 + total - tab->bmap->n_div + div;
tools/polly/lib/External/isl/isl_tab_pip.c 1010 div_pos = 1 + total - bset->n_div + div;
2120 for (i = 0; i < tab->bmap->n_div; ++i) {
2294 tab->n_param = isl_basic_set_total_dim(dom) - dom->n_div;
2295 tab->n_div = dom->n_div;
2959 return cgbr->tab->bmap->n_eq == 0 && cgbr->tab->bmap->n_div == 0;
4287 if (isl_seq_first_non_zero(dom->div[div] + 2 + d_dim, dom->n_div) != -1)
4290 for (i = 0; i < bmap->n_div; ++i) {
4294 (b_dim - d_dim) + bmap->n_div) != -1)
4323 for (i = 0; i < dom->n_div; ++i)
4326 other = bmap->n_div - common;
4327 if (dom->n_div - common > 0) {
4329 dom->n_div - common, 0, 0);
4333 for (i = 0; i < dom->n_div; ++i) {
4372 if (dom->n_div) {
4696 for (i = 0; i < bmap->n_div; ++i)
tools/polly/lib/External/isl/isl_test.c 953 assert(bset && bset->n_div == 1);
976 assert(bset && bset->n_div == 1);
999 assert(bset && bset->n_div == 1);
1043 assert(bset && bset->n_div == 0);
1064 assert(bset && bset->n_div == 1);
1795 assert(bset1 && bset1->n_div == 0);
tools/polly/lib/External/isl/isl_transitive_closure.c 395 for (i = 0; i < bset->n_div; ++i) {
2176 aff->n_div + 1, aff->n_div, 2 * d + 1);
2176 aff->n_div + 1, aff->n_div, 2 * d + 1);
2177 for (i = 0; i < aff->n_div + 1; ++i) {
2195 aff->eq[i] + 1 + nparam + d, aff->n_div);
2196 isl_int_set_si(bmap->eq[k][1 + total + aff->n_div], 0);
2216 1 + nparam + 2 * d + bmap->n_div);
2219 isl_int_neg(bmap->ineq[k][1 + nparam + 2 * d + aff->n_div], opt);
2231 1 + nparam + 2 * d + bmap->n_div);
2234 isl_int_set(bmap->ineq[k][1 + nparam + 2 * d + aff->n_div], opt);
2243 1 + nparam + 2 * d + bmap->n_div);
2246 isl_int_set_si(bmap->ineq[k][1 + nparam + 2 * d + aff->n_div], 1);