3 #include "isl_piplib.h"
4 #include "isl_map_piplib.h"
5 #include "isl_map_private.h"
7 static void copy_values_from(isl_int *dst, Entier *src, unsigned n)
11 for (i = 0; i < n; ++i)
12 entier_assign(dst[i], src[i]);
15 static void add_value(isl_int *dst, Entier *src)
17 mpz_add(*dst, *dst, *src);
20 static void copy_constraint_from(isl_int *dst, PipVector *src,
21 unsigned nparam, unsigned n_in, unsigned n_out,
22 unsigned extra, int *pos)
26 copy_values_from(dst, src->the_vector+src->nb_elements-1, 1);
27 copy_values_from(dst+1, src->the_vector, nparam+n_in);
28 isl_seq_clr(dst+1+nparam+n_in, n_out);
29 isl_seq_clr(dst+1+nparam+n_in+n_out, extra);
30 for (i = 0; i + n_in + nparam < src->nb_elements-1; ++i) {
32 add_value(&dst[1+nparam+n_in+n_out+p],
33 &src->the_vector[n_in+nparam+i]);
37 static int add_inequality(struct isl_ctx *ctx,
38 struct isl_basic_map *bmap, int *pos, PipVector *vec)
40 int i = isl_basic_map_alloc_inequality(bmap);
43 copy_constraint_from(bmap->ineq[i], vec,
44 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra, pos);
49 /* For a div d = floor(f/m), add the constraints
52 * -(f-(n-1)) + m d >= 0
54 * Note that the second constraint is the negation of
58 static int add_div_constraints(struct isl_ctx *ctx,
59 struct isl_basic_map *bmap, int *pos, PipNewparm *p, unsigned div)
62 unsigned div_pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
63 unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
65 i = add_inequality(ctx, bmap, pos, p->vector);
68 copy_values_from(&bmap->ineq[i][div_pos], &p->deno, 1);
69 isl_int_neg(bmap->ineq[i][div_pos], bmap->ineq[i][div_pos]);
71 j = isl_basic_map_alloc_inequality(bmap);
74 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
75 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
76 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
80 static int add_equality(struct isl_ctx *ctx,
81 struct isl_basic_map *bmap, int *pos,
82 unsigned var, PipVector *vec)
86 isl_assert(ctx, var < bmap->n_out, return -1);
88 i = isl_basic_map_alloc_equality(bmap);
91 copy_constraint_from(bmap->eq[i], vec,
92 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra, pos);
93 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+var], -1);
98 static int find_div(struct isl_ctx *ctx,
99 struct isl_basic_map *bmap, int *pos, PipNewparm *p)
103 i = isl_basic_map_alloc_div(bmap);
107 copy_constraint_from(bmap->div[i]+1, p->vector,
108 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra, pos);
110 copy_values_from(bmap->div[i], &p->deno, 1);
111 for (j = 0; j < i; ++j)
112 if (isl_seq_eq(bmap->div[i], bmap->div[j],
113 1+1+bmap->nparam+bmap->n_in+bmap->n_out+j)) {
114 isl_basic_map_free_div(bmap, 1);
118 if (add_div_constraints(ctx, bmap, pos, p, i) < 0)
124 /* Count some properties of a quast
125 * - maximal number of new parameters
127 * - total number of solutions
128 * - total number of empty branches
130 static void quast_count(PipQuast *q, int *maxnew, int depth, int *maxdepth,
131 int *sol, int *nosol)
135 for (p = q->newparm; p; p = p->next)
136 if (p->rank > *maxnew)
139 if (++depth > *maxdepth)
141 quast_count(q->next_else, maxnew, depth, maxdepth, sol, nosol);
142 quast_count(q->next_then, maxnew, depth, maxdepth, sol, nosol);
152 * pos: array of length bmap->set.extra, mapping each of the existential
153 * variables PIP proposes to an existential variable in bmap
154 * bmap: collects the currently active constraints
155 * rest: collects the empty leaves of the quast (if not NULL)
159 struct isl_basic_map *bmap;
160 struct isl_set **rest;
165 * New existentially quantified variables are places after the existing ones.
167 static struct isl_map *scan_quast_r(struct scan_data *data, PipQuast *q,
172 struct isl_basic_map *bmap = data->bmap;
173 unsigned old_n_div = bmap->n_div;
178 for (p = q->newparm; p; p = p->next) {
180 unsigned pip_param = bmap->nparam + bmap->n_in;
182 pos = find_div(data->ctx, bmap, data->pos, p);
185 data->pos[p->rank - pip_param] = pos;
190 int pos = add_inequality(data->ctx, bmap, data->pos,
194 map = scan_quast_r(data, q->next_then, map);
196 if (isl_inequality_negate(bmap, pos))
198 map = scan_quast_r(data, q->next_else, map);
200 if (isl_basic_map_free_inequality(bmap, 1))
202 } else if (q->list) {
205 /* if bmap->n_out is zero, we are only interested in the domains
206 * where a solution exists and not in the actual solution
208 for (j = 0, l = q->list; j < bmap->n_out && l; ++j, l = l->next)
209 if (add_equality(data->ctx, bmap, data->pos, j,
212 map = isl_map_add(map, isl_basic_map_copy(bmap));
213 if (isl_basic_map_free_equality(bmap, bmap->n_out))
215 } else if (map->n && data->rest) {
216 /* not interested in rest if no sol */
217 struct isl_basic_set *bset;
218 bset = isl_basic_set_from_basic_map(isl_basic_map_copy(bmap));
219 bset = isl_basic_set_drop_vars(bset, bmap->n_in, bmap->n_out);
222 *data->rest = isl_set_add(*data->rest, bset);
225 if (isl_basic_map_free_inequality(bmap, 2*(bmap->n_div - old_n_div)))
227 if (isl_basic_map_free_div(bmap, bmap->n_div - old_n_div))
236 * Returns a map with "context" as domain and as range the first
237 * "keep" variables in the quast lists.
239 static struct isl_map *isl_map_from_quast(struct isl_ctx *ctx, PipQuast *q,
241 struct isl_basic_set *context,
242 struct isl_set **rest)
248 struct scan_data data;
260 nparam = context->nparam;
261 pip_param = nparam + context->dim;
266 nexist = pip_param-1;
267 quast_count(q, &nexist, 0, &max_depth, &n_sol, &n_nosol);
268 nexist -= pip_param-1;
271 *rest = isl_set_alloc(data.ctx, nparam, context->dim, n_nosol,
276 map = isl_map_alloc(data.ctx, nparam, context->dim, keep, n_sol,
281 data.bmap = isl_basic_map_from_basic_set(context,
283 data.bmap = isl_basic_map_extend(data.bmap,
284 nparam, data.bmap->n_in, keep, nexist, keep, max_depth+2*nexist);
288 if (data.bmap->extra) {
290 data.pos = isl_alloc_array(ctx, int, data.bmap->extra);
293 for (i = 0; i < data.bmap->n_div; ++i)
297 map = scan_quast_r(&data, q, map);
298 map = isl_map_finalize(map);
302 *rest = isl_set_finalize(*rest);
306 isl_basic_map_free(data.bmap);
313 isl_basic_map_free(data.bmap);
322 static void copy_values_to(Entier *dst, isl_int *src, unsigned n)
326 for (i = 0; i < n; ++i)
327 entier_assign(dst[i], src[i]);
330 static void copy_constraint_to(Entier *dst, isl_int *src,
331 unsigned pip_param, unsigned pip_var,
332 unsigned extra_front, unsigned extra_back)
334 copy_values_to(dst+1+extra_front+pip_var+pip_param+extra_back, src, 1);
335 copy_values_to(dst+1+extra_front+pip_var, src+1, pip_param);
336 copy_values_to(dst+1+extra_front, src+1+pip_param, pip_var);
339 PipMatrix *isl_basic_map_to_pip(struct isl_basic_map *bmap, unsigned pip_param,
340 unsigned extra_front, unsigned extra_back)
347 unsigned pip_var = bmap->nparam + bmap->n_in + bmap->n_out
348 + bmap->n_div - pip_param;
349 unsigned pip_dim = pip_var - bmap->n_div;
351 nrow = extra_front + bmap->n_eq + bmap->n_ineq;
352 ncol = 1 + extra_front + pip_var + pip_param + extra_back + 1;
353 M = pip_matrix_alloc(nrow, ncol);
358 for (i = 0; i < bmap->n_eq; ++i) {
359 entier_set_si(M->p[off+i][0], 0);
360 copy_constraint_to(M->p[off+i], bmap->eq[i],
361 pip_param, pip_var, extra_front, extra_back);
364 for (i = 0; i < bmap->n_ineq; ++i) {
365 entier_set_si(M->p[off+i][0], 1);
366 copy_constraint_to(M->p[off+i], bmap->ineq[i],
367 pip_param, pip_var, extra_front, extra_back);
372 static struct isl_map *extremum_on(
373 struct isl_basic_map *bmap, struct isl_basic_set *dom,
374 struct isl_set **empty, int max)
380 PipMatrix *domain = NULL, *context = NULL;
386 isl_assert(ctx, bmap->nparam == dom->nparam, goto error);
387 isl_assert(ctx, bmap->n_in == dom->dim, goto error);
389 domain = isl_basic_map_to_pip(bmap, bmap->nparam + bmap->n_in,
393 context = isl_basic_map_to_pip((struct isl_basic_map *)dom, 0, 0, 0);
397 options = pip_options_init();
398 options->Simplify = 1;
399 options->Maximize = max;
400 options->Urs_unknowns = -1;
401 options->Urs_parms = -1;
402 sol = pip_solve(domain, context, -1, options);
405 struct isl_basic_set *copy;
406 copy = isl_basic_set_copy(dom);
407 map = isl_map_from_quast(ctx, sol, bmap->n_out, copy, empty);
409 map = isl_map_empty(ctx, bmap->nparam, bmap->n_in, bmap->n_out);
415 if (map->n == 0 && empty) {
416 isl_set_free(*empty);
417 *empty = isl_set_from_basic_set(dom);
419 isl_basic_set_free(dom);
420 isl_basic_map_free(bmap);
423 pip_options_free(options);
424 pip_matrix_free(domain);
425 pip_matrix_free(context);
430 pip_matrix_free(domain);
432 pip_matrix_free(context);
433 isl_basic_map_free(bmap);
434 isl_basic_set_free(dom);
438 struct isl_map *isl_pip_basic_map_lexmax(
439 struct isl_basic_map *bmap, struct isl_basic_set *dom,
440 struct isl_set **empty)
442 return extremum_on(bmap, dom, empty, 1);
445 struct isl_map *isl_pip_basic_map_lexmin(
446 struct isl_basic_map *bmap, struct isl_basic_set *dom,
447 struct isl_set **empty)
449 return extremum_on(bmap, dom, empty, 0);
452 struct isl_map *isl_pip_basic_map_compute_divs(struct isl_basic_map *bmap)
454 PipMatrix *domain = NULL, *context = NULL;
460 struct isl_basic_set *dom;
471 domain = isl_basic_map_to_pip(bmap, bmap->nparam + n_in + n_out, 0, 0);
474 context = pip_matrix_alloc(0, bmap->nparam + n_in + n_out + 2);
478 options = pip_options_init();
479 options->Simplify = 1;
480 options->Urs_unknowns = -1;
481 options->Urs_parms = -1;
482 sol = pip_solve(domain, context, -1, options);
484 dom = isl_basic_set_alloc(ctx, bmap->nparam, n_in + n_out, 0, 0, 0);
485 map = isl_map_from_quast(ctx, sol, 0, dom, NULL);
488 pip_options_free(options);
489 pip_matrix_free(domain);
490 pip_matrix_free(context);
492 isl_basic_map_free(bmap);
494 set = isl_map_domain(map);
496 return isl_map_from_set(set, n_in, n_out);
499 pip_matrix_free(domain);
501 pip_matrix_free(context);
502 isl_basic_set_free(dom);
503 isl_basic_map_free(bmap);