| /src/external/mit/isl/dist/ |
| isl_morph.c | 484 int f_eq, n_eq; local
506 for (f_eq = 0; f_eq < bset->n_eq; ++f_eq)
509 for (n_eq = 0; f_eq + n_eq < bset->n_eq; ++n_eq)
510 if (isl_seq_first_non_zero(bset->eq[f_eq + n_eq] + otype, ntype) == -1)
512 if (n_eq == 0)
515 E = isl_mat_sub_alloc6(bset->ctx, bset->eq, f_eq, n_eq, 0, orest);
530 space = isl_space_add_dims(space, type, ntype - n_eq);
574 int n_eq; local
[all...] |
| isl_sample.c | 74 if (bset->n_eq == 0 && bset->n_ineq == 0)
84 if (bset->n_eq > 0) {
85 isl_assert(bset->ctx, bset->n_eq == 1, goto error);
155 int n_eq; local
165 n_eq = tab->n_var - tab->n_col + tab->n_dead;
166 if (tab->empty || n_eq == 0)
168 if (n_eq == tab->n_var)
171 eq = isl_mat_alloc(tab->mat->ctx, n_eq, tab->n_var);
179 if (i < bset->n_eq)
183 bset->ineq[i - bset->n_eq] + 1, tab->n_var)
202 int n_eq; local
[all...] |
| isl_coalesce.c | 78 eq = isl_calloc_array(bmap_i->ctx, int, 2 * bmap_i->n_eq);
82 for (k = 0; k < bmap_i->n_eq; ++k) {
105 unsigned n_eq = bmap_i->n_eq; local
112 if (tab_i && isl_tab_is_redundant(tab_i, n_eq + k)) {
214 isl_size n_eq; local
216 n_eq = isl_basic_map_n_equality(info->bmap);
217 return any(info->eq, 2 * n_eq, status);
241 isl_size n_eq; local
243 n_eq = isl_basic_map_n_equality(info->bmap)
266 isl_size n_eq; local
519 unsigned n_eq, n_ineq; local
629 unsigned n_eq = info[i].bmap->n_eq; local
1123 unsigned n_eq = info[i].bmap->n_eq; local
1489 isl_size n_eq, n_ineq; local
3138 unsigned n_eq; local
[all...] |
| isl_convex_hull.c | 199 unsigned n_eq; local
209 n_eq = 1;
212 n_eq += set->p[i]->n_eq;
215 lp = isl_basic_set_alloc(set->ctx, 0, dim * set->n, 0, n_eq, n_ineq);
234 for (j = 0; j < set->p[i]->n_eq; ++j) {
420 if (face->n_eq == 1) {
424 for (i = 0; i < face->n_eq; ++i)
429 isl_assert(set->ctx, i < face->n_eq, goto error);
508 if (facet && facet->n_eq != 0
1594 isl_size n_eq; local
2826 int i, j, n_eq, n_ineq; local
2884 int i, n_eq, n_ineq; local
[all...] |
| isl_affine_hull.c | 102 bset->n_eq--;
103 for (r = row; r < bset->n_eq; ++r)
105 bset->eq[bset->n_eq] = t;
218 int is_zero1 = row >= bset1->n_eq ||
220 int is_zero2 = row >= bset2->n_eq ||
241 isl_assert(bset1->ctx, row == bset1->n_eq, goto error);
333 for (i = 0; i < bset->n_eq; ++i)
438 for (j = 0; j < hull->n_eq; ++j) {
455 if (j == hull->n_eq)
682 if (hull->n_eq > tab->n_zero)
[all...] |
| isl_map_simplify.c | 58 for (i = bmap->n_eq - 1; i >= 0; --i) {
315 for (k = 0; k < bmap->n_eq; ++k) {
431 for (i = 0; i < bmap->n_eq; ++i) {
472 for (i = 0; i < bmap->n_eq; ++i)
475 if (i < bmap->n_eq)
618 for (done = 0; done < bmap->n_eq; ++done) {
620 for (k = done; k < bmap->n_eq; ++k)
623 if (k < bmap->n_eq)
645 if (done == bmap->n_eq)
647 for (k = done; k < bmap->n_eq; ++k)
2447 unsigned n_eq; local
2538 unsigned n_eq, context_ineq; local
3266 unsigned extra, n_eq, n_ineq; local
[all...] |
| polytope_scan.c | 86 if (bset->n_eq == 0)
|
| isl_farkas.c | 257 dual = isl_basic_set_alloc_space(space, bset->n_eq + bset->n_ineq,
261 for (i = 0; i < bset->n_eq + bset->n_ineq; ++i) {
274 for (j = 0; j < bset->n_eq; ++j)
278 isl_int_set(dual->eq[k][1 + shift + total + bset->n_eq + j],
287 1 + shift + total + bset->n_eq + bset->n_ineq);
288 isl_int_set_si(dual->ineq[k][1 + shift + total + bset->n_eq + i], 1);
297 for (j = 0; j < bset->n_eq; ++j)
301 isl_int_neg(dual->ineq[k][2 + total + bset->n_eq + j],
430 isl_size n_eq, n_ineq, dim; local
439 n_eq = isl_basic_set_n_equality(coeff)
[all...] |
| basis_reduction_templ.c | 329 if (bset->n_eq == 0)
336 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, 0, bset->n_eq,
340 tab->n_zero = bset->n_eq;
|
| isl_vertices.c | 146 isl_assert(bset->ctx, v->v.vertex->n_eq >= nvar, goto error);
152 if (v->v.dom->n_eq > 0) {
426 isl_size n_eq; local
444 if (bset->n_eq != 0)
474 n_eq = isl_basic_set_n_equality(test);
475 if (n_eq < 0)
477 if (n_eq < 0 || n_eq > 0)
629 if (bset->n_eq > 0)
921 isl_size n_eq; local
[all...] |
| isl_equalities.c | 681 isl_assert(bset->ctx, bset->n_eq <= dim, goto error);
682 if (bset->n_eq == 0)
685 B = isl_mat_sub_alloc6(bset->ctx, bset->eq, 0, bset->n_eq, 0, 1 + dim);
759 H = isl_mat_sub_alloc6(ctx, bset->eq, 0, bset->n_eq, 1, total);
764 isl_seq_gcd(U->row[nparam + pos]+bset->n_eq,
765 total-bset->n_eq, modulo);
775 C = isl_mat_alloc(ctx, 1 + bset->n_eq, 1);
779 isl_mat_sub_neg(ctx, C->row + 1, bset->eq, bset->n_eq, 0, 0, 1);
784 U1 = isl_mat_sub_alloc(U, nparam+pos, 1, 0, bset->n_eq);
|
| isl_map_private.h | 63 unsigned n_eq; member in struct:isl_basic_map
122 unsigned n_eq, unsigned n_ineq);
124 __isl_take isl_basic_set *base, unsigned n_eq, unsigned n_ineq);
133 unsigned n_eq, unsigned n_ineq);
139 __isl_take isl_basic_map *base, unsigned n_eq, unsigned n_ineq);
197 unsigned extra, unsigned n_eq, unsigned n_ineq);
199 unsigned extra, unsigned n_eq, unsigned n_ineq);
210 unsigned extra, unsigned n_eq, unsigned n_ineq);
214 unsigned extra, unsigned n_eq, unsigned n_ineq);
|
| isl_tab.c | 70 tab->n_eq = 0;
280 dup->n_eq = tab->n_eq;
533 prod->n_eq = 0;
1907 isl_assert(tab->mat->ctx, tab->n_eq == bmap->n_eq,
1910 tab->n_con == bmap->n_eq + bmap->n_ineq,
2011 tab->n_eq++;
2404 for (i = 0; i < bmap->n_eq; ++i) {
2446 tab = isl_tab_alloc(bset->ctx, bset->n_eq + bset->n_ineq
2628 unsigned n_eq; local
3205 unsigned n_eq; local
[all...] |
| isl_map_subtract.c | 69 if (isl_tab_extend_cons(tab, 2 * bmap->n_eq + bmap->n_ineq) < 0)
76 for (i = 0; i < bmap->n_eq; ++i) {
137 if (c < 2 * bmap->n_eq) {
151 c -= 2 * bmap->n_eq;
727 return bmap->n_eq == total;
757 isl_assert(bmap->ctx, bmap->n_eq == dim, return NULL);
765 for (j = 0; j < bmap->n_eq; ++j) {
|
| isl_scheduler.c | 1877 isl_size n_eq, n_ineq; local
1879 n_eq = isl_basic_set_n_equality(src);
1881 if (n_eq < 0 || n_ineq < 0)
1883 dst = isl_basic_set_extend_constraints(dst, n_eq, n_ineq);
2357 * to "n_eq" and "n_ineq" and free "bset".
2360 int f, int *n_eq, int *n_ineq)
2371 *n_eq += eq;
2386 int *n_eq, int *n_ineq, int use_coincidence)
2400 return update_count(coef, f, n_eq, n_ineq);
2406 if (update_count(coef, fp, n_eq, n_ineq) < 0
2768 int n_eq, n_ineq; local
4139 int n_eq; member in struct:isl_sched_count
4217 int n_eq, n_ineq; local
4818 isl_size n_eq; local
[all...] |
| isl_factorization.c | 285 H = isl_mat_alloc(bset->ctx, bset->n_eq + bset->n_ineq, nvar);
288 isl_mat_sub_copy(bset->ctx, H->row, bset->eq, bset->n_eq,
290 isl_mat_sub_copy(bset->ctx, H->row + bset->n_eq, bset->ineq, bset->n_ineq,
|
| isl_map.c | 250 return bmap->n_eq;
1212 if (bmap->n_eq == total) {
1214 for (i = 0; i < bmap->n_eq; ++i) {
1226 if (i == bmap->n_eq)
1289 unsigned n_eq, unsigned n_ineq)
1302 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
1306 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
1307 if ((n_ineq + n_eq) && !bmap->ineq)
1323 for (i = 0; i < n_ineq + n_eq; ++i)
1331 bmap->c_size = n_eq + n_ineq
[all...] |
| isl_output.c | 106 for (i = 0; i < bmap->n_eq; ++i)
129 p = isl_printer_print_int(p, bmap->n_eq + bmap->n_ineq);
802 for (i = bmap->n_eq - 1; i >= 0; --i) {
805 if (i != bmap->n_eq - 1)
1136 if (map->n > 1 && map->p[i]->n_eq + map->p[i]->n_ineq > 1)
1139 if (map->n > 1 && map->p[i]->n_eq + map->p[i]->n_ineq > 1)
1279 for (i = bmap->n_eq - 1; i >= 0; --i) {
1316 for (i = bmap->n_eq - 1; i >= 0; --i) {
1320 for (j = 0; j < aff->n_eq; ++j) {
1401 isl_size n_eq; local
1434 isl_size j, n_eq; local
[all...] |
| isl_dim_map.c | 154 for (i = 0; i < src->n_eq; ++i) {
|
| isl_constraint.c | 194 return bmap->n_eq + bmap->n_ineq;
218 for (i = 0; i < bmap->n_eq; ++i) {
777 for (i = 0; i < bmap->n_eq; ++i) {
1157 for (i = 0; i < bset->n_eq; ++i) {
|
| isl_tab.h | 148 unsigned n_eq; member in struct:isl_tab
|
| isl_bound.c | 134 if (bset->n_eq == 0)
|
| isl_ilp.c | 44 if (bset->n_eq != 0) {
326 if (bset->n_eq)
|
| isl_transitive_closure.c | 467 int n = eq ? delta->n_eq : delta->n_ineq;
595 d + 1 + delta->n_eq, delta->n_eq + delta->n_ineq + 1);
634 path = isl_basic_map_extend_constraints(path, delta->n_eq,
2199 for (i = 0; i < aff->n_eq; ++i) {
|
| isl_polynomial.c | 3135 if (eq->n_eq == 0) {
3150 for (i = 0; i < eq->n_eq; ++i) {
5001 isl_size n1, n2, n_eq; local
5009 n_eq = isl_basic_set_n_equality(bset);
5010 if (n2 < 0 || n_eq < 0)
5012 else if (n2 < n1 || n_eq > 0)
5116 if (bset->n_eq == 0)
|
