1 #include <piplib/piplibMP.h>
4 #include "isl_map_private.h"
6 static void copy_values_from(isl_int *dst, Entier *src, unsigned n)
10 for (i = 0; i < n; ++i)
11 entier_assign(dst[i], src[i]);
14 static void add_value(isl_int *dst, Entier *src)
16 mpz_add(*dst, *dst, *src);
19 static void copy_constraint_from(isl_int *dst, PipVector *src,
20 unsigned nparam, unsigned n_in, unsigned n_out,
21 unsigned extra, int *pos)
25 copy_values_from(dst, src->the_vector+src->nb_elements-1, 1);
26 copy_values_from(dst+1, src->the_vector, nparam+n_in);
27 isl_seq_clr(dst+1+nparam+n_in, n_out);
28 isl_seq_clr(dst+1+nparam+n_in+n_out, extra);
29 for (i = 0; i + n_in + nparam < src->nb_elements-1; ++i) {
31 add_value(&dst[1+nparam+n_in+n_out+p],
32 &src->the_vector[n_in+nparam+i]);
36 static int add_inequality(struct isl_ctx *ctx,
37 struct isl_basic_map *bmap, int *pos, PipVector *vec)
39 int i = isl_basic_map_alloc_inequality(ctx, bmap);
42 copy_constraint_from(bmap->ineq[i], vec,
43 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra, pos);
48 static int add_equality(struct isl_ctx *ctx,
49 struct isl_basic_map *bmap, int *pos,
50 unsigned var, PipVector *vec)
54 isl_assert(ctx, var < bmap->n_out, return -1);
56 i = isl_basic_map_alloc_equality(ctx, bmap);
59 copy_constraint_from(bmap->eq[i], vec,
60 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra, pos);
61 isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+var], -1);
66 static int find_div(struct isl_ctx *ctx,
67 struct isl_basic_map *bmap, int *pos, PipNewparm *p)
71 i = isl_basic_map_alloc_div(ctx, bmap);
74 copy_constraint_from(bmap->div[i]+1, p->vector,
75 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra, pos);
77 copy_values_from(bmap->div[i], &p->deno, 1);
78 for (j = 0; j < i; ++j)
79 if (isl_seq_eq(bmap->div[i], bmap->div[j],
80 1+1+bmap->nparam+bmap->n_in+bmap->n_out+j)) {
81 isl_basic_map_free_div(ctx, bmap, 1);
88 /* Count some properties of a quast
89 * - maximal number of new parameters
91 * - total number of solutions
92 * - total number of empty branches
94 static void quast_count(PipQuast *q, int *maxnew, int depth, int *maxdepth,
99 for (p = q->newparm; p; p = p->next)
100 if (p->rank > *maxnew)
103 if (++depth > *maxdepth)
105 quast_count(q->next_else, maxnew, depth, maxdepth, sol, nosol);
106 quast_count(q->next_then, maxnew, depth, maxdepth, sol, nosol);
116 * pos: array of length bmap->set.extra, mapping each of the existential
117 * variables PIP proposes to an existential variable in bmap
118 * bmap: collects the currently active constraints
119 * rest: collects the empty leaves of the quast (if not NULL)
123 struct isl_basic_map *bmap;
124 struct isl_set **rest;
129 * New existentially quantified variables are places after the existing ones.
131 static struct isl_map *scan_quast_r(struct scan_data *data, PipQuast *q,
136 struct isl_basic_map *bmap = data->bmap;
137 unsigned old_n_div = bmap->n_div;
142 for (p = q->newparm; p; p = p->next) {
144 PipVector *vec = p->vector;
145 unsigned pip_param = bmap->nparam + bmap->n_in;
147 pos = find_div(data->ctx, bmap, data->pos, p);
150 data->pos[p->rank - pip_param] = pos;
155 int pos = add_inequality(data->ctx, bmap, data->pos,
159 map = scan_quast_r(data, q->next_then, map);
161 if (isl_inequality_negate(data->ctx, bmap, pos))
163 map = scan_quast_r(data, q->next_else, map);
165 if (isl_basic_map_free_inequality(data->ctx, bmap, 1))
167 } else if (q->list) {
170 /* if bmap->n_out is zero, we are only interested in the domains
171 * where a solution exists and not in the actual solution
173 for (j = 0, l = q->list; j < bmap->n_out && l; ++j, l = l->next)
174 if (add_equality(data->ctx, bmap, data->pos, j,
177 map = isl_map_add(data->ctx, map,
178 isl_basic_map_copy(data->ctx, bmap));
179 if (isl_basic_map_free_equality(data->ctx, bmap,
182 } else if (map->n && data->rest) {
183 /* not interested in rest if no sol */
184 struct isl_basic_set *bset;
185 bset = isl_basic_set_from_basic_map(data->ctx,
186 isl_basic_map_copy(data->ctx, bmap));
187 bset = isl_basic_set_drop_vars(data->ctx, bset,
188 bmap->n_in, bmap->n_out);
191 *data->rest = isl_set_add(data->ctx, *data->rest, bset);
194 if (isl_basic_map_free_div(data->ctx, bmap,
195 bmap->n_div - old_n_div))
199 isl_map_free(data->ctx, map);
204 * Returns a map with "context" as domain and as range the first
205 * "keep" variables in the quast lists.
207 struct isl_map *isl_map_from_quast(struct isl_ctx *ctx, PipQuast *q,
209 struct isl_basic_set *context,
210 struct isl_set **rest)
216 struct scan_data data;
228 nparam = context->nparam;
229 pip_param = nparam + context->dim;
234 nexist = pip_param-1;
235 quast_count(q, &nexist, 0, &max_depth, &n_sol, &n_nosol);
236 nexist -= pip_param-1;
239 *rest = isl_set_alloc(data.ctx, nparam, context->dim, n_nosol,
244 map = isl_map_alloc(data.ctx, nparam, context->dim, keep, n_sol,
249 data.bmap = isl_basic_map_from_basic_set(ctx, context,
251 data.bmap = isl_basic_map_extend(data.ctx, data.bmap,
252 nparam, data.bmap->n_in, keep, nexist, keep, max_depth);
256 if (data.bmap->extra) {
258 data.pos = isl_alloc_array(ctx, int, data.bmap->extra);
261 for (i = 0; i < data.bmap->n_div; ++i)
265 map = scan_quast_r(&data, q, map);
266 map = isl_map_finalize(ctx, map);
270 *rest = isl_set_finalize(ctx, *rest);
274 isl_basic_map_free(data.ctx, data.bmap);
281 isl_basic_map_free(data.ctx, data.bmap);
282 isl_map_free(ctx, map);
284 isl_set_free(ctx, *rest);
290 static void copy_values_to(Entier *dst, isl_int *src, unsigned n)
294 for (i = 0; i < n; ++i)
295 entier_assign(dst[i], src[i]);
298 static void copy_constraint_to(Entier *dst, isl_int *src,
299 unsigned pip_param, unsigned pip_var,
300 unsigned extra_front, unsigned extra_back)
302 copy_values_to(dst+1+extra_front+pip_var+pip_param+extra_back, src, 1);
303 copy_values_to(dst+1+extra_front+pip_var, src+1, pip_param);
304 copy_values_to(dst+1+extra_front, src+1+pip_param, pip_var);
307 PipMatrix *isl_basic_map_to_pip(struct isl_basic_map *bmap, unsigned pip_param,
308 unsigned extra_front, unsigned extra_back)
315 unsigned pip_var = bmap->nparam + bmap->n_in + bmap->n_out
316 + bmap->n_div - pip_param;
317 unsigned pip_dim = pip_var - bmap->n_div;
319 nrow = extra_front + bmap->n_eq + bmap->n_ineq + 2*bmap->n_div;
320 ncol = 1 + extra_front + pip_var + pip_param + extra_back + 1;
321 M = pip_matrix_alloc(nrow, ncol);
326 for (i = 0; i < bmap->n_eq; ++i) {
327 entier_set_si(M->p[off+i][0], 0);
328 copy_constraint_to(M->p[off+i], bmap->eq[i],
329 pip_param, pip_var, extra_front, extra_back);
332 for (i = 0; i < bmap->n_ineq; ++i) {
333 entier_set_si(M->p[off+i][0], 1);
334 copy_constraint_to(M->p[off+i], bmap->ineq[i],
335 pip_param, pip_var, extra_front, extra_back);
338 for (i = 0; i < bmap->n_div; ++i) {
339 unsigned total = bmap->n_in + bmap->n_out
340 + bmap->n_div + bmap->nparam + extra_back;
341 if (isl_int_is_zero(bmap->div[i][0]))
343 entier_set_si(M->p[off+2*i][0], 1);
344 copy_constraint_to(M->p[off+2*i], bmap->div[i]+1,
345 pip_param, pip_var, extra_front, extra_back);
346 copy_values_to(M->p[off+2*i]+1+extra_front+pip_dim+i,
348 entier_oppose(M->p[off+2*i][1+extra_front+pip_dim+i],
349 M->p[off+2*i][1+extra_front+pip_dim+i]);
351 entier_set_si(M->p[off+2*i+1][0], 1);
352 Vector_Oppose(M->p[off+2*i]+1+extra_front,
353 M->p[off+2*i+1]+1+extra_front, total+1);
354 entier_addto(M->p[off+2*i+1][1+extra_front+total],
355 M->p[off+2*i+1][1+extra_front+total],
356 M->p[off+2*i+1][1+extra_front+pip_dim+i]);
357 entier_decrement(M->p[off+2*i+1][1+extra_front+total],
358 M->p[off+2*i+1][1+extra_front+total]);
363 static struct isl_map *extremum_on(struct isl_ctx *ctx,
364 struct isl_basic_map *bmap, struct isl_basic_set *dom,
365 struct isl_set **empty, int max)
370 PipMatrix *domain = NULL, *context = NULL;
372 isl_assert(ctx, bmap->nparam == dom->nparam, goto error);
373 isl_assert(ctx, bmap->n_in == dom->dim, goto error);
375 domain = isl_basic_map_to_pip(bmap, bmap->nparam + bmap->n_in,
379 context = isl_basic_map_to_pip((struct isl_basic_map *)dom, 0, 0, 0);
383 options = pip_options_init();
384 options->Simplify = 1;
385 options->Maximize = max;
386 options->Urs_unknowns = -1;
387 options->Urs_parms = -1;
388 sol = pip_solve(domain, context, -1, options);
391 struct isl_basic_set *copy;
392 copy = isl_basic_set_copy(ctx, dom);
393 map = isl_map_from_quast(ctx, sol, bmap->n_out, copy, empty);
395 map = isl_map_empty(ctx, bmap->nparam, bmap->n_in, bmap->n_out);
401 if (map->n == 0 && empty) {
402 isl_set_free(ctx, *empty);
403 *empty = isl_set_from_basic_set(ctx, dom);
405 isl_basic_set_free(ctx, dom);
406 isl_basic_map_free(ctx, bmap);
409 pip_options_free(options);
410 pip_matrix_free(domain);
411 pip_matrix_free(context);
416 pip_matrix_free(domain);
418 pip_matrix_free(context);
419 isl_basic_map_free(ctx, bmap);
420 isl_basic_set_free(ctx, dom);
424 struct isl_map *pip_isl_basic_map_lexmax(struct isl_ctx *ctx,
425 struct isl_basic_map *bmap, struct isl_basic_set *dom,
426 struct isl_set **empty)
428 return extremum_on(ctx, bmap, dom, empty, 1);
431 struct isl_map *pip_isl_basic_map_lexmin(struct isl_ctx *ctx,
432 struct isl_basic_map *bmap, struct isl_basic_set *dom,
433 struct isl_set **empty)
435 return extremum_on(ctx, bmap, dom, empty, 0);
438 struct isl_map *pip_isl_basic_map_compute_divs(struct isl_ctx *ctx,
439 struct isl_basic_map *bmap)
441 PipMatrix *domain = NULL, *context = NULL;
446 struct isl_basic_set *dom;
456 domain = isl_basic_map_to_pip(bmap, bmap->nparam + n_in + n_out, 0, 0);
459 context = pip_matrix_alloc(0, bmap->nparam + n_in + n_out + 2);
463 options = pip_options_init();
464 options->Simplify = 1;
465 options->Urs_unknowns = -1;
466 options->Urs_parms = -1;
467 sol = pip_solve(domain, context, -1, options);
469 dom = isl_basic_set_alloc(ctx, bmap->nparam, n_in + n_out, 0, 0, 0);
470 map = isl_map_from_quast(ctx, sol, 0, dom, NULL);
473 pip_options_free(options);
474 pip_matrix_free(domain);
475 pip_matrix_free(context);
477 isl_basic_map_free(ctx, bmap);
479 set = isl_map_domain(ctx, map);
481 return isl_map_from_set(ctx, set, n_in, n_out);
484 pip_matrix_free(domain);
486 pip_matrix_free(context);
487 isl_basic_set_free(ctx, dom);
488 isl_basic_map_free(ctx, bmap);