2 * Copyright 2008-2009 Katholieke Universiteit Leuven
4 * Use of this software is governed by the GNU LGPLv2.1 license
6 * Written by Sven Verdoolaege, K.U.Leuven, Departement
7 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
10 #include <isl_constraint.h>
12 #include "isl_map_private.h"
14 static unsigned n(struct isl_constraint *c, enum isl_dim_type type)
16 return isl_basic_map_dim(c->bmap, type);
19 static unsigned offset(struct isl_constraint *c, enum isl_dim_type type)
21 struct isl_dim *dim = c->bmap->dim;
23 case isl_dim_param: return 1;
24 case isl_dim_in: return 1 + dim->nparam;
25 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
26 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
30 static unsigned basic_set_offset(struct isl_basic_set *bset,
31 enum isl_dim_type type)
33 struct isl_dim *dim = bset->dim;
35 case isl_dim_param: return 1;
36 case isl_dim_in: return 1 + dim->nparam;
37 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
38 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
42 struct isl_constraint *isl_basic_map_constraint(struct isl_basic_map *bmap,
45 struct isl_constraint *constraint;
50 constraint = isl_alloc_type(bmap->ctx, struct isl_constraint);
54 constraint->ctx = bmap->ctx;
55 isl_ctx_ref(constraint->ctx);
57 constraint->bmap = bmap;
58 constraint->line = line;
62 isl_basic_map_free(bmap);
66 struct isl_constraint *isl_basic_set_constraint(struct isl_basic_set *bset,
69 return isl_basic_map_constraint((struct isl_basic_map *)bset, line);
72 struct isl_constraint *isl_equality_alloc(struct isl_dim *dim)
74 struct isl_basic_map *bmap;
79 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
83 isl_basic_map_alloc_equality(bmap);
84 isl_seq_clr(bmap->eq[0], 1 + isl_basic_map_total_dim(bmap));
85 return isl_basic_map_constraint(bmap, &bmap->eq[0]);
88 struct isl_constraint *isl_inequality_alloc(struct isl_dim *dim)
90 struct isl_basic_map *bmap;
95 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 1);
99 isl_basic_map_alloc_inequality(bmap);
100 isl_seq_clr(bmap->ineq[0], 1 + isl_basic_map_total_dim(bmap));
101 return isl_basic_map_constraint(bmap, &bmap->ineq[0]);
104 struct isl_constraint *isl_constraint_dup(struct isl_constraint *c)
106 struct isl_basic_map *bmap;
113 eq = c->line < c->bmap->eq + c->bmap->n_eq;
114 i = eq ? c->line - c->bmap->eq : c->line - c->bmap->ineq;
115 bmap = isl_basic_map_copy(c->bmap);
118 return isl_basic_map_constraint(bmap, eq ? bmap->eq + i : bmap->ineq + i);
121 struct isl_constraint *isl_constraint_cow(struct isl_constraint *c)
129 return isl_constraint_dup(c);
132 struct isl_constraint *isl_constraint_copy(struct isl_constraint *constraint)
141 void isl_constraint_free(struct isl_constraint *c)
149 isl_basic_map_free(c->bmap);
150 isl_ctx_deref(c->ctx);
154 __isl_give isl_constraint *isl_basic_map_first_constraint(
155 __isl_take isl_basic_map *bmap)
161 return isl_basic_map_constraint(bmap, &bmap->eq[0]);
163 if (bmap->n_ineq > 0)
164 return isl_basic_map_constraint(bmap, &bmap->ineq[0]);
166 isl_basic_map_free(bmap);
170 __isl_give isl_constraint *isl_basic_set_first_constraint(
171 __isl_take isl_basic_set *bset)
173 return isl_basic_map_first_constraint((struct isl_basic_map *)bset);
176 struct isl_constraint *isl_constraint_next(struct isl_constraint *c)
178 c = isl_constraint_cow(c);
179 if (c->line >= c->bmap->eq) {
181 if (c->line < c->bmap->eq + c->bmap->n_eq)
183 c->line = c->bmap->ineq;
186 if (c->line < c->bmap->ineq + c->bmap->n_ineq)
188 isl_constraint_free(c);
192 int isl_basic_map_foreach_constraint(__isl_keep isl_basic_map *bmap,
193 int (*fn)(__isl_take isl_constraint *c, void *user), void *user)
196 struct isl_constraint *c;
201 for (i = 0; i < bmap->n_eq; ++i) {
202 c = isl_basic_map_constraint(isl_basic_map_copy(bmap),
210 for (i = 0; i < bmap->n_ineq; ++i) {
211 c = isl_basic_map_constraint(isl_basic_map_copy(bmap),
222 int isl_basic_set_foreach_constraint(__isl_keep isl_basic_set *bset,
223 int (*fn)(__isl_take isl_constraint *c, void *user), void *user)
225 return isl_basic_map_foreach_constraint((isl_basic_map *)bset, fn, user);
228 int isl_constraint_is_equal(struct isl_constraint *constraint1,
229 struct isl_constraint *constraint2)
231 if (!constraint1 || !constraint2)
233 return constraint1->bmap == constraint2->bmap &&
234 constraint1->line == constraint2->line;
237 struct isl_basic_map *isl_basic_map_add_constraint(
238 struct isl_basic_map *bmap, struct isl_constraint *constraint)
240 if (!bmap || !constraint)
243 isl_assert(constraint->ctx,
244 isl_dim_equal(bmap->dim, constraint->bmap->dim), goto error);
246 bmap = isl_basic_map_intersect(bmap,
247 isl_basic_map_from_constraint(constraint));
250 isl_basic_map_free(bmap);
251 isl_constraint_free(constraint);
255 struct isl_basic_set *isl_basic_set_add_constraint(
256 struct isl_basic_set *bset, struct isl_constraint *constraint)
258 return (struct isl_basic_set *)
259 isl_basic_map_add_constraint((struct isl_basic_map *)bset,
263 struct isl_constraint *isl_constraint_add_div(struct isl_constraint *constraint,
264 struct isl_div *div, int *pos)
266 if (!constraint || !div)
269 isl_assert(constraint->ctx,
270 isl_dim_equal(div->bmap->dim, constraint->bmap->dim), goto error);
271 isl_assert(constraint->ctx,
272 constraint->bmap->n_eq + constraint->bmap->n_ineq == 1, goto error);
274 constraint->bmap = isl_basic_map_cow(constraint->bmap);
275 constraint->bmap = isl_basic_map_extend_dim(constraint->bmap,
276 isl_dim_copy(constraint->bmap->dim), 1, 0, 0);
277 if (!constraint->bmap)
279 constraint->line = &constraint->bmap->eq[0];
280 *pos = isl_basic_map_alloc_div(constraint->bmap);
283 isl_seq_cpy(constraint->bmap->div[*pos], div->line[0],
284 1 + 1 + isl_basic_map_total_dim(constraint->bmap));
288 isl_constraint_free(constraint);
293 int isl_constraint_dim(struct isl_constraint *constraint,
294 enum isl_dim_type type)
298 return n(constraint, type);
301 void isl_constraint_get_constant(struct isl_constraint *constraint, isl_int *v)
305 isl_int_set(*v, constraint->line[0][0]);
308 void isl_constraint_get_coefficient(struct isl_constraint *constraint,
309 enum isl_dim_type type, int pos, isl_int *v)
314 isl_assert(constraint->ctx, pos < n(constraint, type), return);
315 isl_int_set(*v, constraint->line[0][offset(constraint, type) + pos]);
318 struct isl_div *isl_constraint_div(struct isl_constraint *constraint, int pos)
323 isl_assert(constraint->ctx, pos < n(constraint, isl_dim_div),
325 return isl_basic_map_div(isl_basic_map_copy(constraint->bmap), pos);
328 void isl_constraint_set_constant(struct isl_constraint *constraint, isl_int v)
332 isl_int_set(constraint->line[0][0], v);
335 void isl_constraint_set_coefficient(struct isl_constraint *constraint,
336 enum isl_dim_type type, int pos, isl_int v)
341 isl_assert(constraint->ctx, pos < n(constraint, type), return);
342 isl_int_set(constraint->line[0][offset(constraint, type) + pos], v);
345 void isl_constraint_clear(struct isl_constraint *constraint)
351 total = isl_basic_map_total_dim(constraint->bmap);
352 isl_seq_clr(constraint->line[0], 1 + total);
355 struct isl_constraint *isl_constraint_negate(struct isl_constraint *constraint)
362 isl_assert(constraint->ctx, !isl_constraint_is_equality(constraint),
364 isl_assert(constraint->ctx, constraint->bmap->ref == 1, goto error);
365 total = isl_basic_map_total_dim(constraint->bmap);
366 isl_seq_neg(constraint->line[0], constraint->line[0], 1 + total);
367 isl_int_sub_ui(constraint->line[0][0], constraint->line[0][0], 1);
368 ISL_F_CLR(constraint->bmap, ISL_BASIC_MAP_NORMALIZED);
371 isl_constraint_free(constraint);
375 int isl_constraint_is_equality(struct isl_constraint *constraint)
379 return constraint->line >= constraint->bmap->eq;
382 __isl_give isl_basic_map *isl_basic_map_from_constraint(
383 __isl_take isl_constraint *constraint)
386 struct isl_basic_map *bmap;
393 if (constraint->bmap->n_eq + constraint->bmap->n_ineq == 1) {
394 bmap = isl_basic_map_copy(constraint->bmap);
395 isl_constraint_free(constraint);
399 bmap = isl_basic_map_universe_like(constraint->bmap);
400 bmap = isl_basic_map_align_divs(bmap, constraint->bmap);
401 bmap = isl_basic_map_cow(bmap);
402 bmap = isl_basic_map_extend_constraints(bmap, 1, 1);
403 if (isl_constraint_is_equality(constraint)) {
404 k = isl_basic_map_alloc_equality(bmap);
410 k = isl_basic_map_alloc_inequality(bmap);
415 total = isl_basic_map_total_dim(bmap);
416 isl_seq_cpy(c, constraint->line[0], 1 + total);
417 isl_constraint_free(constraint);
420 isl_constraint_free(constraint);
421 isl_basic_map_free(bmap);
425 struct isl_basic_set *isl_basic_set_from_constraint(
426 struct isl_constraint *constraint)
431 isl_assert(constraint->ctx,n(constraint, isl_dim_in) == 0, goto error);
432 return (isl_basic_set *)isl_basic_map_from_constraint(constraint);
434 isl_constraint_free(constraint);
438 int isl_basic_set_has_defining_equality(
439 struct isl_basic_set *bset, enum isl_dim_type type, int pos,
440 struct isl_constraint **c)
448 offset = basic_set_offset(bset, type);
449 total = isl_basic_set_total_dim(bset);
450 isl_assert(bset->ctx, pos < isl_basic_set_dim(bset, type), return -1);
451 for (i = 0; i < bset->n_eq; ++i)
452 if (!isl_int_is_zero(bset->eq[i][offset + pos]) &&
453 isl_seq_first_non_zero(bset->eq[i]+offset+pos+1,
454 1+total-offset-pos-1) == -1) {
455 *c= isl_basic_set_constraint(isl_basic_set_copy(bset),
462 int isl_basic_set_has_defining_inequalities(
463 struct isl_basic_set *bset, enum isl_dim_type type, int pos,
464 struct isl_constraint **lower,
465 struct isl_constraint **upper)
471 isl_int **lower_line, **upper_line;
475 offset = basic_set_offset(bset, type);
476 total = isl_basic_set_total_dim(bset);
477 isl_assert(bset->ctx, pos < isl_basic_set_dim(bset, type), return -1);
479 for (i = 0; i < bset->n_ineq; ++i) {
480 if (isl_int_is_zero(bset->ineq[i][offset + pos]))
482 if (isl_int_is_one(bset->ineq[i][offset + pos]))
484 if (isl_int_is_negone(bset->ineq[i][offset + pos]))
486 if (isl_seq_first_non_zero(bset->ineq[i]+offset+pos+1,
487 1+total-offset-pos-1) != -1)
489 for (j = i + 1; j < bset->n_ineq; ++j) {
490 if (!isl_seq_is_neg(bset->ineq[i]+1, bset->ineq[j]+1,
493 isl_int_add(m, bset->ineq[i][0], bset->ineq[j][0]);
494 if (isl_int_abs_ge(m, bset->ineq[i][offset+pos]))
497 if (isl_int_is_pos(bset->ineq[i][offset+pos])) {
498 lower_line = &bset->ineq[i];
499 upper_line = &bset->ineq[j];
501 lower_line = &bset->ineq[j];
502 upper_line = &bset->ineq[i];
504 *lower = isl_basic_set_constraint(
505 isl_basic_set_copy(bset), lower_line);
506 *upper = isl_basic_set_constraint(
507 isl_basic_set_copy(bset), upper_line);