| /src/external/mit/isl/dist/ |
| isl_local.c | 78 isl_size total, n_div; local
81 n_div = isl_local_dim(local, isl_dim_div);
82 if (total < 0 || n_div < 0)
84 return total - n_div;
243 isl_size n_div, n_all; local
252 n_div = isl_local_dim(local, isl_dim_div);
254 if (n_div < 0 || n_all < 0)
256 return n_all - n_div;
332 isl_size v_div, n_div; local
335 n_div = isl_local_dim(local, isl_dim_div)
366 isl_size dim, n_div, size; local
[all...] |
| isl_map_simplify.c | 219 if (bmap->n_div == 0)
222 for (i = 0; i < bmap->n_div; ++i) {
290 if (bmap->n_div == 0)
293 for (i = 0; i < bmap->n_div; ++i)
314 last_div = isl_seq_last_non_zero(eq + 1 + v_div, bmap->n_div);
337 for (k = 0; k < bmap->n_div; ++k) {
399 last_div = isl_seq_last_non_zero(eq + 1 + v_div, bmap->n_div);
430 for (d = bmap->n_div - 1; d >= 0 ; --d) {
471 for (d = bmap->n_div - 1; d >= 0 ; --d) {
615 total_var = total - bmap->n_div;
1874 isl_size n_div; local
2876 isl_size total, n_div; local
3026 isl_size total, n_div; local
3157 isl_size total, n_div; local
3265 isl_size total, n_div, n_div_bmap; local
4154 unsigned n_div; local
4341 isl_size n_div; local
4397 isl_size n_div; local
4591 isl_size n_div; local
4694 isl_size n_div; local
4941 isl_size v_div, n_div; local
5255 isl_size n_div; local
5510 isl_size total, n_div; local
[all...] |
| isl_tab_pip.c | 359 isl_size n_div; local
362 n_div = isl_basic_set_dim(dom, isl_dim_div);
363 if (n_div < 0)
365 n_known = n_div - sol->context->n_unknown;
370 n_known, n_div - n_known);
655 * Of these, the first tab->n_param and the last tab->n_div variables
657 * tab->n_param + tab->n_div = context_tab->n_var
660 * tab->n_div is equal to the number of divs in the context
724 1 + tab->n_param + tab->n_div);
762 for (j = 0; j < tab->n_div; ++j)
2158 isl_size n_div; local
2181 unsigned n_div; local
3465 isl_size n_div; local
3676 isl_size n_div; local
4347 isl_size n_div; local
4624 isl_size nparam, n_in, n_out, n_div; local
4981 isl_size n_div; local
[all...] |
| isl_dim_map.c | 107 for (i = 0; i < bmap->n_div; ++i) {
168 for (i = 0; i < src->n_div; ++i) {
207 res = isl_dim_map_alloc(bmap->ctx, dim_map->len - 1 + bmap->n_div);
213 for (i = 0; i < bmap->n_div; ++i) {
|
| isl_stride.c | 227 isl_size n_div; local
242 n_div = isl_constraint_dim(c, isl_dim_div);
243 if (n_div < 0)
247 for (i = 0; i < n_div; ++i) {
267 for (i = 0; i < n_div; ++i)
|
| isl_transitive_closure.c | 301 isl_size n_div; local
308 n_div = isl_basic_set_dim(bset, isl_dim_div);
312 if (n_div < 0 || d < 0 || nparam < 0 || total < 0)
323 for (i = 0; i < n_div; ++i) {
350 isl_size n_div; local
356 n_div = isl_basic_set_dim(bset, isl_dim_div);
359 if (n_div < 0 || d < 0 || nparam < 0)
362 for (i = 0; i < n_div; ++i) {
378 isl_seq_neg(c, c, 1 + nparam + d + n_div);
397 isl_size n_div; local
469 isl_size n_div, total; local
580 isl_size n_div; local
[all...] |
| isl_map.c | 91 case isl_dim_div: return bmap->n_div;
240 return dim + bmap->n_div;
492 cols = 1 + 1 + v_div + bmap->n_div;
493 div = isl_mat_alloc(ctx, bmap->n_div, cols);
497 for (i = 0; i < bmap->n_div; ++i)
539 isl_size n_div; local
541 n_div = isl_basic_map_dim(bmap, isl_dim_div);
542 if (n_div < 0)
544 if (n_div == 0)
547 bmap = isl_basic_map_extend_constraints(bmap, 0, 2 * n_div);
563 isl_size n_div; local
1077 isl_size n_div; local
1552 isl_size n_div; local
1950 isl_size total, n_param, n_in, n_out, n_div; local
3790 isl_size n_div; local
4538 isl_size dim, n_div; local
5561 isl_size n_div; local
5586 isl_size n_div; local
5632 isl_size n_div; local
7731 isl_size nparam, n_div; local
7871 isl_size n_div; local
7902 isl_size n_div; local
9412 isl_size n_div; local
9647 int n_div; local
9715 isl_size n_div; local
11453 unsigned n_div; local
11760 isl_size n_out, n_div; local
11841 isl_size n_div, n_out; local
11917 isl_size n_div, n_out; local
12160 isl_size nvar, ovar, n_div; local
12488 isl_size n_div; local
[all...] |
| isl_map_subtract.c | 24 * The number of divs in "c" is given by "n_div" and the mapping
33 isl_int *c, int *div_map, unsigned n_div)
40 for (i = 0; i < n_div; ++i) {
180 if (!bmap->n_div)
184 *div_map = isl_alloc_array(bmap->ctx, int, bmap->n_div);
191 dim = total - tab->bmap->n_div;
192 vec = isl_vec_alloc(bmap->ctx, 2 + total + bmap->n_div);
196 for (i = 0; i < bmap->n_div; ++i) {
198 isl_seq_clr(vec->el + 2 + dim, tab->bmap->n_div);
203 for (j = 0; j < tab->bmap->n_div; ++j
[all...] |
| isl_coalesce.c | 321 isl_size n_div; local
325 n_div = isl_basic_map_dim(hull, isl_dim_div);
326 if (n_div < 0)
329 isl_dim_div, 0, n_div);
530 info[i].bmap->n_div, n_eq, n_eq + n_ineq + extra_rows);
539 for (k = 0; k < info[i].bmap->n_div; ++k) {
1055 for (l = 0; l < info[i].bmap->n_div; ++l)
2654 isl_size total, n_div; local
2661 n_div = isl_basic_map_dim(info->bmap, isl_dim_div);
2662 if (total < 0 || n_div < 0
3221 isl_size total, n_div; local
3593 isl_size n_div; local
3653 isl_size n_div; local
3847 isl_size dim, n_div; local
[all...] |
| isl_tab_lexopt_templ.c | 56 unsigned n_in, n_out, n_div; local
112 n_div = isl_basic_set_dim(dom, isl_dim_div);
121 isl_seq_clr(dom->ineq[k] + 1 + n_in + 1, n_div);
|
| isl_output.c | 85 for (i = 0; i < bmap->n_div; ++i) {
135 isl_size n_div = isl_basic_map_dim(bmap, isl_dim_div); local
138 if (n_in < 0 || n_out < 0 || n_div < 0 || nparam < 0)
146 p = isl_printer_print_int(p, n_div);
356 isl_size n_div, total; local
360 n_div = isl_mat_rows(div);
361 if (total < 0 || n_div < 0)
363 len = 1 + total + n_div;
648 isl_size n_div; local
651 n_div = isl_mat_rows(div)
724 isl_size n_div; local
903 isl_size n_div; local
977 isl_size n_div; local
2129 isl_size n_div; local
2167 isl_size n_div = isl_basic_set_dim(bset, isl_dim_div); local
2504 isl_size n_div; local
2689 isl_size n_div, mod; local
[all...] |
| isl_box.c | 254 isl_size n_div; local
261 n_div = isl_constraint_dim(c, isl_dim_div);
262 if (n_div < 0)
264 any_divs = isl_constraint_involves_dims(c, isl_dim_div, 0, n_div);
|
| isl_local_space.c | 77 unsigned n_div)
91 div = isl_mat_alloc(ctx, n_div, 1 + 1 + total + n_div);
753 return cmp_row(bmap->div[i], bmap->div[j], i, j, bmap->n_div, total);
771 if (bmap->n_div <= 1)
777 for (i = 1; i < bmap->n_div; ++i) {
1135 unsigned n_div; local
1148 n_div = eq->n_div;
1150 j = isl_seq_last_non_zero(eq->eq[i], total + n_div);
1252 isl_size n_div; local
[all...] |
| isl_local_space_private.h | 21 unsigned n_div);
|
| isl_morph.c | 573 isl_size n_div; local
590 n_div = isl_basic_set_dim(bset, isl_dim_div);
591 if (nparam < 0 || nvar < 0 || n_div < 0)
595 nvar + n_div) == -1)
599 if (n_eq > nvar + n_div)
605 0, n_eq, 1 + nparam, nvar + n_div);
|
| isl_polynomial.c | 627 isl_size n_div; local
629 n_div = isl_qpolynomial_domain_dim(qp, isl_dim_div);
630 if (n_div < 0)
632 dim += n_div;
1393 unsigned n_div, __isl_take isl_poly *poly)
1411 qp->div = isl_mat_alloc(space->ctx, n_div, 1 + 1 + total + n_div);
2717 isl_size n_div, total, new_n_div; local
2720 n_div = isl_qpolynomial_domain_dim(qp, isl_dim_div);
2722 if (total < 0 || n_div < 0
2921 int n_div; local
3130 unsigned n_div; local
[all...] |
| isl_lp.c | 108 if (map->p[i]->n_div > max_div)
109 max_div = map->p[i]->n_div;
|
| isl_tab.c | 76 tab->n_div = 0;
286 dup->n_div = tab->n_div;
451 isl_assert(tab1->mat->ctx, tab1->n_div == 0, return NULL);
452 isl_assert(tab1->mat->ctx, tab2->n_div == 0, return NULL);
539 prod->n_div = 0;
1847 if (tab->M && i >= tab->n_param && i < tab->n_var - tab->n_div)
2211 div_pos = 1 + total - bmap->n_div + div;
2247 div_pos = 1 + total - tab->bmap->n_div + div;
2326 isl_size n_div; local
3870 isl_size n_div; local
[all...] |
| isl_aff.c | 2240 unsigned n_div; local
2260 n_div = eq->n_div;
2262 j = isl_seq_last_non_zero(eq->eq[i], o_div + n_div);
2285 isl_size n_div; local
2287 n_div = isl_aff_domain_dim(aff, isl_dim_div);
2288 if (n_div < 0)
2290 if (n_div > 0)
2291 eq = isl_basic_set_add_dims(eq, isl_dim_set, n_div);
5006 isl_size n_div, n_out local
5219 isl_size n_div, v_div; local
5601 isl_size n_div; local
5827 isl_size n_div; local
6294 isl_size n, n_div; local
7341 isl_size n_in, n_div, n_mpa_in; local
9499 isl_size n_in, n_div; local
[all...] |
| isl_space_private.h | 29 unsigned n_div);
|
| isl_ast_codegen.c | 2348 * "n_div" is the maximal number of integer divisions in the first
2360 int n_div; member in struct:isl_find_unroll_data
2384 isl_size n_div; local
2387 n_div = isl_aff_dim(aff, isl_dim_div);
2392 if (n_div > *n)
2393 *n = n_div;
2395 return n_div >= 0 ? isl_stat_ok : isl_stat_error;
2438 * number, then store the lowest value in data->n_div.
2444 int n_div; local
2459 if (data->n_div < 0
[all...] |
| isl_affine_hull.c | 1050 isl_seq_clr(bmap->eq[k] + M->n_col, bmap->n_div - n_known);
1110 for (n_known = 0; n_known < bmap->n_div; ++n_known)
1118 bmap->n_div - n_known) == -1)
1124 n_col = bmap->n_div - n_known;
|
| isl_constraint.c | 652 isl_size n_div; local
658 n_div = isl_constraint_dim(constraint, isl_dim_div);
659 if (n_div < 0)
661 for (i = 0; i < n_div; ++i) {
|
| isl_tab.h | 108 * are called parameters and the last "n_div" of these are called divs.
145 unsigned n_div; member in struct:isl_tab
|
| isl_mat.c | 1323 unsigned n_div, int has_div, struct isl_mat *mat)
1343 q[i] + has_div + t->n_col + e, n_div);
1344 isl_seq_clr(q[i] + has_div + t->n_col + n_div, e);
1388 if (preimage(ctx, bset->eq, bset->n_eq, bset->n_div, 0,
1392 if (preimage(ctx, bset->ineq, bset->n_ineq, bset->n_div, 0,
1396 if (preimage(ctx, bset->div, bset->n_div, bset->n_div, 1, mat) < 0)
|
