| /src/external/mit/isl/dist/ |
| isl_map_private.h | 64 unsigned n_ineq; 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_farkas.c | 257 dual = isl_basic_set_alloc_space(space, bset->n_eq + bset->n_ineq,
258 total, bset->n_ineq + (shift > 0));
261 for (i = 0; i < bset->n_eq + bset->n_ineq; ++i) {
277 for (j = 0; j < bset->n_ineq; ++j)
282 for (i = 0; i < bset->n_ineq; ++i) {
287 1 + shift + total + bset->n_eq + bset->n_ineq);
300 for (j = 0; j < bset->n_ineq; ++j)
430 isl_size n_eq, n_ineq, dim; local
440 n_ineq = isl_basic_set_n_inequality(coeff);
441 if (dim < 0 || n_eq < 0 || n_ineq < 0
517 int n_ineq = data->n_ray + data->n_vertex; local
[all...] |
| isl_coalesce.c | 106 int *ineq = isl_calloc_array(bmap_i->ctx, int, bmap_i->n_ineq);
111 for (k = 0; k < bmap_i->n_ineq; ++k) {
226 isl_size n_ineq; local
228 n_ineq = isl_basic_map_n_inequality(info->bmap);
229 return any(info->ineq, n_ineq, status);
254 isl_size n_ineq; local
256 n_ineq = isl_basic_map_n_inequality(info->bmap);
257 return find(info->ineq, n_ineq, status);
278 isl_size n_ineq; local
280 n_ineq = isl_basic_map_n_inequality(info->bmap)
519 unsigned n_eq, n_ineq; local
1489 isl_size n_eq, n_ineq; local
3007 int i, n_ineq; local
3137 int i, n_ineq; local
[all...] |
| isl_convex_hull.c | 64 if (bmap->n_ineq <= 1)
200 unsigned n_ineq; local
210 n_ineq = set->n;
213 n_ineq += set->p[i]->n_ineq;
215 lp = isl_basic_set_alloc(set->ctx, 0, dim * set->n, 0, n_eq, n_ineq);
241 for (j = 0; j < set->p[i]->n_ineq; ++j) {
554 for (i = 0; i < hull->n_ineq; ++i) {
566 hull = isl_basic_set_extend(hull, 0, 0, facet->n_ineq);
569 for (j = 0; j < facet->n_ineq; ++j)
1755 unsigned n_ineq; local
2337 unsigned n_ineq; local
2826 int i, j, n_eq, n_ineq; local
2884 int i, n_eq, n_ineq; local
[all...] |
| isl_map_simplify.c | 80 for (i = bmap->n_ineq - 1; i >= 0; --i) {
326 for (k = 0; k < bmap->n_ineq; ++k) {
477 for (i = 0; i < bmap->n_ineq; ++i)
480 if (i < bmap->n_ineq)
714 if (bmap->n_ineq == 0)
716 ci->size = round_up(4 * (bmap->n_ineq + 1) / 3 - 1);
779 for (k = 0; k < bset->n_ineq; ++k) {
1247 if (total < 0 || bmap->n_ineq <= 1)
1255 for (k = 1; k < bmap->n_ineq; ++k) {
1270 for (k = 0; bmap && k < bmap->n_ineq-1; ++k)
1479 isl_size v_div, n_ineq; local
2059 isl_size n_ineq, cols; local
2446 unsigned n_ineq; local
3266 unsigned extra, n_eq, n_ineq; local
5012 isl_size n_ineq; local
[all...] |
| isl_scheduler.c | 1877 isl_size n_eq, n_ineq; local
1880 n_ineq = isl_basic_set_n_inequality(src);
1881 if (n_eq < 0 || n_ineq < 0)
1883 dst = isl_basic_set_extend_constraints(dst, n_eq, n_ineq);
1966 edge->start = graph->lp->n_ineq;
1970 edge->end = graph->lp->n_ineq;
2357 * to "n_eq" and "n_ineq" and free "bset".
2360 int f, int *n_eq, int *n_ineq)
2372 *n_ineq += ineq;
2386 int *n_eq, int *n_ineq, int use_coincidence
2768 int n_eq, n_ineq; local
4140 int n_ineq; member in struct:isl_sched_count
4217 int n_eq, n_ineq; local
[all...] |
| isl_tab_pip.c | 2338 tab = isl_tab_alloc(bmap->ctx, 2 * bmap->n_eq + bmap->n_ineq + 1,
2381 for (i = 0; i < bmap->n_ineq; ++i) {
2952 cst = isl_vec_alloc(cgbr->tab->mat->ctx, bset->n_ineq);
2956 for (i = 0; i < bset->n_ineq; ++i) {
2968 for (i = 0; i < bset->n_ineq; ++i)
3006 for (i = 0; i < bset->n_ineq; ++i)
3370 if (isl_tab_extend_cons(tab, (cgbr->tab->bmap->n_ineq - first)/2) < 0)
3375 for (i = first; i < cgbr->tab->bmap->n_ineq; i += 2) {
3424 unsigned n_ineq; local
3438 n_ineq = cgbr->tab->bmap->n_ineq
[all...] |
| isl_aff.c | 5376 isl_size n_ineq; local
5381 n_ineq = isl_basic_map_n_inequality(hull);
5382 if (dim < 0 || n_ineq < 0)
5390 if (i >= n_ineq)
|
| isl_map.c | 268 return bmap->n_ineq;
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;
1332 bmap->eq = bmap->ineq + n_ineq;
1335 bmap->n_ineq = 0;
1347 unsigned n_eq, unsigned n_ineq)
14430 isl_size n_ineq; local
[all...] |
