2 * Copyright 2011 INRIA Saclay
3 * Copyright 2011 Sven Verdoolaege
5 * Use of this software is governed by the GNU LGPLv2.1 license
7 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
8 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
12 #include <isl_ctx_private.h>
13 #include <isl_map_private.h>
14 #include <isl_aff_private.h>
15 #include <isl_space_private.h>
16 #include <isl_local_space_private.h>
17 #include <isl_mat_private.h>
18 #include <isl_list_private.h>
19 #include <isl/constraint.h>
23 __isl_give isl_aff
*isl_aff_alloc_vec(__isl_take isl_local_space
*ls
,
24 __isl_take isl_vec
*v
)
31 aff
= isl_calloc_type(v
->ctx
, struct isl_aff
);
41 isl_local_space_free(ls
);
46 __isl_give isl_aff
*isl_aff_alloc(__isl_take isl_local_space
*ls
)
55 ctx
= isl_local_space_get_ctx(ls
);
56 if (!isl_local_space_divs_known(ls
))
57 isl_die(ctx
, isl_error_invalid
, "local space has unknown divs",
59 if (!isl_local_space_is_set(ls
))
60 isl_die(ctx
, isl_error_invalid
,
61 "domain of affine expression should be a set",
64 total
= isl_local_space_dim(ls
, isl_dim_all
);
65 v
= isl_vec_alloc(ctx
, 1 + 1 + total
);
66 return isl_aff_alloc_vec(ls
, v
);
68 isl_local_space_free(ls
);
72 __isl_give isl_aff
*isl_aff_zero_on_domain(__isl_take isl_local_space
*ls
)
76 aff
= isl_aff_alloc(ls
);
80 isl_int_set_si(aff
->v
->el
[0], 1);
81 isl_seq_clr(aff
->v
->el
+ 1, aff
->v
->size
- 1);
86 __isl_give isl_aff
*isl_aff_copy(__isl_keep isl_aff
*aff
)
95 __isl_give isl_aff
*isl_aff_dup(__isl_keep isl_aff
*aff
)
100 return isl_aff_alloc_vec(isl_local_space_copy(aff
->ls
),
101 isl_vec_copy(aff
->v
));
104 __isl_give isl_aff
*isl_aff_cow(__isl_take isl_aff
*aff
)
112 return isl_aff_dup(aff
);
115 void *isl_aff_free(__isl_take isl_aff
*aff
)
123 isl_local_space_free(aff
->ls
);
124 isl_vec_free(aff
->v
);
131 isl_ctx
*isl_aff_get_ctx(__isl_keep isl_aff
*aff
)
133 return aff
? isl_local_space_get_ctx(aff
->ls
) : NULL
;
136 /* Externally, an isl_aff has a map space, but internally, the
137 * ls field corresponds to the domain of that space.
139 int isl_aff_dim(__isl_keep isl_aff
*aff
, enum isl_dim_type type
)
143 if (type
== isl_dim_out
)
145 if (type
== isl_dim_in
)
147 return isl_local_space_dim(aff
->ls
, type
);
150 __isl_give isl_space
*isl_aff_get_domain_space(__isl_keep isl_aff
*aff
)
152 return aff
? isl_local_space_get_space(aff
->ls
) : NULL
;
155 __isl_give isl_space
*isl_aff_get_space(__isl_keep isl_aff
*aff
)
160 space
= isl_local_space_get_space(aff
->ls
);
161 space
= isl_space_from_domain(space
);
162 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
166 __isl_give isl_local_space
*isl_aff_get_domain_local_space(
167 __isl_keep isl_aff
*aff
)
169 return aff
? isl_local_space_copy(aff
->ls
) : NULL
;
172 __isl_give isl_local_space
*isl_aff_get_local_space(__isl_keep isl_aff
*aff
)
177 ls
= isl_local_space_copy(aff
->ls
);
178 ls
= isl_local_space_from_domain(ls
);
179 ls
= isl_local_space_add_dims(ls
, isl_dim_out
, 1);
183 /* Externally, an isl_aff has a map space, but internally, the
184 * ls field corresponds to the domain of that space.
186 const char *isl_aff_get_dim_name(__isl_keep isl_aff
*aff
,
187 enum isl_dim_type type
, unsigned pos
)
191 if (type
== isl_dim_out
)
193 if (type
== isl_dim_in
)
195 return isl_local_space_get_dim_name(aff
->ls
, type
, pos
);
198 __isl_give isl_aff
*isl_aff_reset_domain_space(__isl_take isl_aff
*aff
,
199 __isl_take isl_space
*dim
)
201 aff
= isl_aff_cow(aff
);
205 aff
->ls
= isl_local_space_reset_space(aff
->ls
, dim
);
207 return isl_aff_free(aff
);
216 /* Reset the space of "aff". This function is called from isl_pw_templ.c
217 * and doesn't know if the space of an element object is represented
218 * directly or through its domain. It therefore passes along both.
220 __isl_give isl_aff
*isl_aff_reset_space_and_domain(__isl_take isl_aff
*aff
,
221 __isl_take isl_space
*space
, __isl_take isl_space
*domain
)
223 isl_space_free(space
);
224 return isl_aff_reset_domain_space(aff
, domain
);
227 /* Reorder the coefficients of the affine expression based
228 * on the given reodering.
229 * The reordering r is assumed to have been extended with the local
232 static __isl_give isl_vec
*vec_reorder(__isl_take isl_vec
*vec
,
233 __isl_take isl_reordering
*r
, int n_div
)
241 res
= isl_vec_alloc(vec
->ctx
,
242 2 + isl_space_dim(r
->dim
, isl_dim_all
) + n_div
);
243 isl_seq_cpy(res
->el
, vec
->el
, 2);
244 isl_seq_clr(res
->el
+ 2, res
->size
- 2);
245 for (i
= 0; i
< r
->len
; ++i
)
246 isl_int_set(res
->el
[2 + r
->pos
[i
]], vec
->el
[2 + i
]);
248 isl_reordering_free(r
);
253 isl_reordering_free(r
);
257 /* Reorder the dimensions of the domain of "aff" according
258 * to the given reordering.
260 __isl_give isl_aff
*isl_aff_realign_domain(__isl_take isl_aff
*aff
,
261 __isl_take isl_reordering
*r
)
263 aff
= isl_aff_cow(aff
);
267 r
= isl_reordering_extend(r
, aff
->ls
->div
->n_row
);
268 aff
->v
= vec_reorder(aff
->v
, isl_reordering_copy(r
),
269 aff
->ls
->div
->n_row
);
270 aff
->ls
= isl_local_space_realign(aff
->ls
, r
);
272 if (!aff
->v
|| !aff
->ls
)
273 return isl_aff_free(aff
);
278 isl_reordering_free(r
);
282 int isl_aff_plain_is_zero(__isl_keep isl_aff
*aff
)
287 return isl_seq_first_non_zero(aff
->v
->el
+ 1, aff
->v
->size
- 1) < 0;
290 int isl_aff_plain_is_equal(__isl_keep isl_aff
*aff1
, __isl_keep isl_aff
*aff2
)
297 equal
= isl_local_space_is_equal(aff1
->ls
, aff2
->ls
);
298 if (equal
< 0 || !equal
)
301 return isl_vec_is_equal(aff1
->v
, aff2
->v
);
304 int isl_aff_get_denominator(__isl_keep isl_aff
*aff
, isl_int
*v
)
308 isl_int_set(*v
, aff
->v
->el
[0]);
312 int isl_aff_get_constant(__isl_keep isl_aff
*aff
, isl_int
*v
)
316 isl_int_set(*v
, aff
->v
->el
[1]);
320 int isl_aff_get_coefficient(__isl_keep isl_aff
*aff
,
321 enum isl_dim_type type
, int pos
, isl_int
*v
)
326 if (type
== isl_dim_out
)
327 isl_die(aff
->v
->ctx
, isl_error_invalid
,
328 "output/set dimension does not have a coefficient",
330 if (type
== isl_dim_in
)
333 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
334 isl_die(aff
->v
->ctx
, isl_error_invalid
,
335 "position out of bounds", return -1);
337 pos
+= isl_local_space_offset(aff
->ls
, type
);
338 isl_int_set(*v
, aff
->v
->el
[1 + pos
]);
343 __isl_give isl_aff
*isl_aff_set_denominator(__isl_take isl_aff
*aff
, isl_int v
)
345 aff
= isl_aff_cow(aff
);
349 aff
->v
= isl_vec_cow(aff
->v
);
351 return isl_aff_free(aff
);
353 isl_int_set(aff
->v
->el
[0], v
);
358 __isl_give isl_aff
*isl_aff_set_constant(__isl_take isl_aff
*aff
, isl_int v
)
360 aff
= isl_aff_cow(aff
);
364 aff
->v
= isl_vec_cow(aff
->v
);
366 return isl_aff_free(aff
);
368 isl_int_set(aff
->v
->el
[1], v
);
373 __isl_give isl_aff
*isl_aff_add_constant(__isl_take isl_aff
*aff
, isl_int v
)
375 if (isl_int_is_zero(v
))
378 aff
= isl_aff_cow(aff
);
382 aff
->v
= isl_vec_cow(aff
->v
);
384 return isl_aff_free(aff
);
386 isl_int_addmul(aff
->v
->el
[1], aff
->v
->el
[0], v
);
391 __isl_give isl_aff
*isl_aff_add_constant_si(__isl_take isl_aff
*aff
, int v
)
396 isl_int_set_si(t
, v
);
397 aff
= isl_aff_add_constant(aff
, t
);
403 __isl_give isl_aff
*isl_aff_set_constant_si(__isl_take isl_aff
*aff
, int v
)
405 aff
= isl_aff_cow(aff
);
409 aff
->v
= isl_vec_cow(aff
->v
);
411 return isl_aff_free(aff
);
413 isl_int_set_si(aff
->v
->el
[1], v
);
418 __isl_give isl_aff
*isl_aff_set_coefficient(__isl_take isl_aff
*aff
,
419 enum isl_dim_type type
, int pos
, isl_int v
)
424 if (type
== isl_dim_out
)
425 isl_die(aff
->v
->ctx
, isl_error_invalid
,
426 "output/set dimension does not have a coefficient",
427 return isl_aff_free(aff
));
428 if (type
== isl_dim_in
)
431 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
432 isl_die(aff
->v
->ctx
, isl_error_invalid
,
433 "position out of bounds", return isl_aff_free(aff
));
435 aff
= isl_aff_cow(aff
);
439 aff
->v
= isl_vec_cow(aff
->v
);
441 return isl_aff_free(aff
);
443 pos
+= isl_local_space_offset(aff
->ls
, type
);
444 isl_int_set(aff
->v
->el
[1 + pos
], v
);
449 __isl_give isl_aff
*isl_aff_set_coefficient_si(__isl_take isl_aff
*aff
,
450 enum isl_dim_type type
, int pos
, int v
)
455 if (type
== isl_dim_out
)
456 isl_die(aff
->v
->ctx
, isl_error_invalid
,
457 "output/set dimension does not have a coefficient",
458 return isl_aff_free(aff
));
459 if (type
== isl_dim_in
)
462 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
463 isl_die(aff
->v
->ctx
, isl_error_invalid
,
464 "position out of bounds", return isl_aff_free(aff
));
466 aff
= isl_aff_cow(aff
);
470 aff
->v
= isl_vec_cow(aff
->v
);
472 return isl_aff_free(aff
);
474 pos
+= isl_local_space_offset(aff
->ls
, type
);
475 isl_int_set_si(aff
->v
->el
[1 + pos
], v
);
480 __isl_give isl_aff
*isl_aff_add_coefficient(__isl_take isl_aff
*aff
,
481 enum isl_dim_type type
, int pos
, isl_int v
)
486 if (type
== isl_dim_out
)
487 isl_die(aff
->v
->ctx
, isl_error_invalid
,
488 "output/set dimension does not have a coefficient",
489 return isl_aff_free(aff
));
490 if (type
== isl_dim_in
)
493 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
494 isl_die(aff
->v
->ctx
, isl_error_invalid
,
495 "position out of bounds", return isl_aff_free(aff
));
497 aff
= isl_aff_cow(aff
);
501 aff
->v
= isl_vec_cow(aff
->v
);
503 return isl_aff_free(aff
);
505 pos
+= isl_local_space_offset(aff
->ls
, type
);
506 isl_int_addmul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
);
511 __isl_give isl_aff
*isl_aff_add_coefficient_si(__isl_take isl_aff
*aff
,
512 enum isl_dim_type type
, int pos
, int v
)
517 isl_int_set_si(t
, v
);
518 aff
= isl_aff_add_coefficient(aff
, type
, pos
, t
);
524 __isl_give isl_div
*isl_aff_get_div(__isl_keep isl_aff
*aff
, int pos
)
529 return isl_local_space_get_div(aff
->ls
, pos
);
532 __isl_give isl_aff
*isl_aff_neg(__isl_take isl_aff
*aff
)
534 aff
= isl_aff_cow(aff
);
537 aff
->v
= isl_vec_cow(aff
->v
);
539 return isl_aff_free(aff
);
541 isl_seq_neg(aff
->v
->el
+ 1, aff
->v
->el
+ 1, aff
->v
->size
- 1);
546 /* Given f, return floor(f).
547 * If f is an integer expression, then just return f.
548 * Otherwise, if f = g/m, write g = q m + r,
549 * create a new div d = [r/m] and return the expression q + d.
550 * The coefficients in r are taken to lie between -m/2 and m/2.
552 __isl_give isl_aff
*isl_aff_floor(__isl_take isl_aff
*aff
)
562 if (isl_int_is_one(aff
->v
->el
[0]))
565 aff
= isl_aff_cow(aff
);
569 aff
->v
= isl_vec_cow(aff
->v
);
570 div
= isl_vec_copy(aff
->v
);
571 div
= isl_vec_cow(div
);
573 return isl_aff_free(aff
);
575 ctx
= isl_aff_get_ctx(aff
);
576 isl_int_fdiv_q(aff
->v
->el
[0], aff
->v
->el
[0], ctx
->two
);
577 for (i
= 1; i
< aff
->v
->size
; ++i
) {
578 isl_int_fdiv_r(div
->el
[i
], div
->el
[i
], div
->el
[0]);
579 isl_int_fdiv_q(aff
->v
->el
[i
], aff
->v
->el
[i
], div
->el
[0]);
580 if (isl_int_gt(div
->el
[i
], aff
->v
->el
[0])) {
581 isl_int_sub(div
->el
[i
], div
->el
[i
], div
->el
[0]);
582 isl_int_add_ui(aff
->v
->el
[i
], aff
->v
->el
[i
], 1);
586 aff
->ls
= isl_local_space_add_div(aff
->ls
, div
);
588 return isl_aff_free(aff
);
591 aff
->v
= isl_vec_extend(aff
->v
, size
+ 1);
593 return isl_aff_free(aff
);
594 isl_int_set_si(aff
->v
->el
[0], 1);
595 isl_int_set_si(aff
->v
->el
[size
], 1);
602 * aff mod m = aff - m * floor(aff/m)
604 __isl_give isl_aff
*isl_aff_mod(__isl_take isl_aff
*aff
, isl_int m
)
608 res
= isl_aff_copy(aff
);
609 aff
= isl_aff_scale_down(aff
, m
);
610 aff
= isl_aff_floor(aff
);
611 aff
= isl_aff_scale(aff
, m
);
612 res
= isl_aff_sub(res
, aff
);
619 * pwaff mod m = pwaff - m * floor(pwaff/m)
621 __isl_give isl_pw_aff
*isl_pw_aff_mod(__isl_take isl_pw_aff
*pwaff
, isl_int m
)
625 res
= isl_pw_aff_copy(pwaff
);
626 pwaff
= isl_pw_aff_scale_down(pwaff
, m
);
627 pwaff
= isl_pw_aff_floor(pwaff
);
628 pwaff
= isl_pw_aff_scale(pwaff
, m
);
629 res
= isl_pw_aff_sub(res
, pwaff
);
634 /* Given f, return ceil(f).
635 * If f is an integer expression, then just return f.
636 * Otherwise, create a new div d = [-f] and return the expression -d.
638 __isl_give isl_aff
*isl_aff_ceil(__isl_take isl_aff
*aff
)
643 if (isl_int_is_one(aff
->v
->el
[0]))
646 aff
= isl_aff_neg(aff
);
647 aff
= isl_aff_floor(aff
);
648 aff
= isl_aff_neg(aff
);
653 /* Apply the expansion computed by isl_merge_divs.
654 * The expansion itself is given by "exp" while the resulting
655 * list of divs is given by "div".
657 __isl_give isl_aff
*isl_aff_expand_divs( __isl_take isl_aff
*aff
,
658 __isl_take isl_mat
*div
, int *exp
)
665 aff
= isl_aff_cow(aff
);
669 old_n_div
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
670 new_n_div
= isl_mat_rows(div
);
671 if (new_n_div
< old_n_div
)
672 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
673 "not an expansion", goto error
);
675 aff
->v
= isl_vec_extend(aff
->v
, aff
->v
->size
+ new_n_div
- old_n_div
);
679 offset
= 1 + isl_local_space_offset(aff
->ls
, isl_dim_div
);
681 for (i
= new_n_div
- 1; i
>= 0; --i
) {
682 if (j
>= 0 && exp
[j
] == i
) {
684 isl_int_swap(aff
->v
->el
[offset
+ i
],
685 aff
->v
->el
[offset
+ j
]);
688 isl_int_set_si(aff
->v
->el
[offset
+ i
], 0);
691 aff
->ls
= isl_local_space_replace_divs(aff
->ls
, isl_mat_copy(div
));
702 /* Add two affine expressions that live in the same local space.
704 static __isl_give isl_aff
*add_expanded(__isl_take isl_aff
*aff1
,
705 __isl_take isl_aff
*aff2
)
709 aff1
= isl_aff_cow(aff1
);
713 aff1
->v
= isl_vec_cow(aff1
->v
);
719 isl_int_gcd(gcd
, aff1
->v
->el
[0], aff2
->v
->el
[0]);
720 isl_int_divexact(f
, aff2
->v
->el
[0], gcd
);
721 isl_seq_scale(aff1
->v
->el
+ 1, aff1
->v
->el
+ 1, f
, aff1
->v
->size
- 1);
722 isl_int_divexact(f
, aff1
->v
->el
[0], gcd
);
723 isl_seq_addmul(aff1
->v
->el
+ 1, f
, aff2
->v
->el
+ 1, aff1
->v
->size
- 1);
724 isl_int_divexact(f
, aff2
->v
->el
[0], gcd
);
725 isl_int_mul(aff1
->v
->el
[0], aff1
->v
->el
[0], f
);
737 __isl_give isl_aff
*isl_aff_add(__isl_take isl_aff
*aff1
,
738 __isl_take isl_aff
*aff2
)
748 ctx
= isl_aff_get_ctx(aff1
);
749 if (!isl_space_is_equal(aff1
->ls
->dim
, aff2
->ls
->dim
))
750 isl_die(ctx
, isl_error_invalid
,
751 "spaces don't match", goto error
);
753 if (aff1
->ls
->div
->n_row
== 0 && aff2
->ls
->div
->n_row
== 0)
754 return add_expanded(aff1
, aff2
);
756 exp1
= isl_alloc_array(ctx
, int, aff1
->ls
->div
->n_row
);
757 exp2
= isl_alloc_array(ctx
, int, aff2
->ls
->div
->n_row
);
761 div
= isl_merge_divs(aff1
->ls
->div
, aff2
->ls
->div
, exp1
, exp2
);
762 aff1
= isl_aff_expand_divs(aff1
, isl_mat_copy(div
), exp1
);
763 aff2
= isl_aff_expand_divs(aff2
, div
, exp2
);
767 return add_expanded(aff1
, aff2
);
776 __isl_give isl_aff
*isl_aff_sub(__isl_take isl_aff
*aff1
,
777 __isl_take isl_aff
*aff2
)
779 return isl_aff_add(aff1
, isl_aff_neg(aff2
));
782 __isl_give isl_aff
*isl_aff_scale(__isl_take isl_aff
*aff
, isl_int f
)
786 if (isl_int_is_one(f
))
789 aff
= isl_aff_cow(aff
);
792 aff
->v
= isl_vec_cow(aff
->v
);
794 return isl_aff_free(aff
);
797 isl_int_gcd(gcd
, aff
->v
->el
[0], f
);
798 isl_int_divexact(aff
->v
->el
[0], aff
->v
->el
[0], gcd
);
799 isl_int_divexact(gcd
, f
, gcd
);
800 isl_seq_scale(aff
->v
->el
+ 1, aff
->v
->el
+ 1, gcd
, aff
->v
->size
- 1);
806 __isl_give isl_aff
*isl_aff_scale_down(__isl_take isl_aff
*aff
, isl_int f
)
810 if (isl_int_is_one(f
))
813 aff
= isl_aff_cow(aff
);
816 aff
->v
= isl_vec_cow(aff
->v
);
818 return isl_aff_free(aff
);
821 isl_seq_gcd(aff
->v
->el
+ 1, aff
->v
->size
- 1, &gcd
);
822 isl_int_gcd(gcd
, gcd
, f
);
823 isl_seq_scale_down(aff
->v
->el
+ 1, aff
->v
->el
+ 1, gcd
, aff
->v
->size
- 1);
824 isl_int_divexact(gcd
, f
, gcd
);
825 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], gcd
);
831 __isl_give isl_aff
*isl_aff_scale_down_ui(__isl_take isl_aff
*aff
, unsigned f
)
839 isl_int_set_ui(v
, f
);
840 aff
= isl_aff_scale_down(aff
, v
);
846 __isl_give isl_aff
*isl_aff_set_dim_name(__isl_take isl_aff
*aff
,
847 enum isl_dim_type type
, unsigned pos
, const char *s
)
849 aff
= isl_aff_cow(aff
);
852 if (type
== isl_dim_out
)
853 isl_die(aff
->v
->ctx
, isl_error_invalid
,
854 "cannot set name of output/set dimension",
855 return isl_aff_free(aff
));
856 if (type
== isl_dim_in
)
858 aff
->ls
= isl_local_space_set_dim_name(aff
->ls
, type
, pos
, s
);
860 return isl_aff_free(aff
);
865 /* Exploit the equalities in "eq" to simplify the affine expression
866 * and the expressions of the integer divisions in the local space.
867 * The integer divisions in this local space are assumed to appear
868 * as regular dimensions in "eq".
870 static __isl_give isl_aff
*isl_aff_substitute_equalities_lifted(
871 __isl_take isl_aff
*aff
, __isl_take isl_basic_set
*eq
)
880 isl_basic_set_free(eq
);
884 aff
= isl_aff_cow(aff
);
888 aff
->ls
= isl_local_space_substitute_equalities(aff
->ls
,
889 isl_basic_set_copy(eq
));
893 total
= 1 + isl_space_dim(eq
->dim
, isl_dim_all
);
895 for (i
= 0; i
< eq
->n_eq
; ++i
) {
896 j
= isl_seq_last_non_zero(eq
->eq
[i
], total
+ n_div
);
897 if (j
< 0 || j
== 0 || j
>= total
)
900 isl_seq_elim(aff
->v
->el
+ 1, eq
->eq
[i
], j
, total
,
904 isl_basic_set_free(eq
);
907 isl_basic_set_free(eq
);
912 /* Exploit the equalities in "eq" to simplify the affine expression
913 * and the expressions of the integer divisions in the local space.
915 static __isl_give isl_aff
*isl_aff_substitute_equalities(
916 __isl_take isl_aff
*aff
, __isl_take isl_basic_set
*eq
)
922 n_div
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
924 eq
= isl_basic_set_add(eq
, isl_dim_set
, n_div
);
925 return isl_aff_substitute_equalities_lifted(aff
, eq
);
927 isl_basic_set_free(eq
);
932 /* Look for equalities among the variables shared by context and aff
933 * and the integer divisions of aff, if any.
934 * The equalities are then used to eliminate coefficients and/or integer
935 * divisions from aff.
937 __isl_give isl_aff
*isl_aff_gist(__isl_take isl_aff
*aff
,
938 __isl_take isl_set
*context
)
945 n_div
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
949 context
= isl_set_add_dims(context
, isl_dim_set
, n_div
);
950 ls
= isl_aff_get_domain_local_space(aff
);
951 bset
= isl_basic_set_from_local_space(ls
);
952 bset
= isl_basic_set_lift(bset
);
953 bset
= isl_basic_set_flatten(bset
);
954 context
= isl_set_intersect(context
,
955 isl_set_from_basic_set(bset
));
958 hull
= isl_set_affine_hull(context
);
959 return isl_aff_substitute_equalities_lifted(aff
, hull
);
962 isl_set_free(context
);
966 /* Return a basic set containing those elements in the space
967 * of aff where it is non-negative.
969 __isl_give isl_basic_set
*isl_aff_nonneg_basic_set(__isl_take isl_aff
*aff
)
971 isl_constraint
*ineq
;
973 ineq
= isl_inequality_from_aff(aff
);
975 return isl_basic_set_from_constraint(ineq
);
978 /* Return a basic set containing those elements in the space
979 * of aff where it is zero.
981 __isl_give isl_basic_set
*isl_aff_zero_basic_set(__isl_take isl_aff
*aff
)
983 isl_constraint
*ineq
;
985 ineq
= isl_equality_from_aff(aff
);
987 return isl_basic_set_from_constraint(ineq
);
990 /* Return a basic set containing those elements in the shared space
991 * of aff1 and aff2 where aff1 is greater than or equal to aff2.
993 __isl_give isl_basic_set
*isl_aff_ge_basic_set(__isl_take isl_aff
*aff1
,
994 __isl_take isl_aff
*aff2
)
996 aff1
= isl_aff_sub(aff1
, aff2
);
998 return isl_aff_nonneg_basic_set(aff1
);
1001 /* Return a basic set containing those elements in the shared space
1002 * of aff1 and aff2 where aff1 is smaller than or equal to aff2.
1004 __isl_give isl_basic_set
*isl_aff_le_basic_set(__isl_take isl_aff
*aff1
,
1005 __isl_take isl_aff
*aff2
)
1007 return isl_aff_ge_basic_set(aff2
, aff1
);
1010 __isl_give isl_aff
*isl_aff_add_on_domain(__isl_keep isl_set
*dom
,
1011 __isl_take isl_aff
*aff1
, __isl_take isl_aff
*aff2
)
1013 aff1
= isl_aff_add(aff1
, aff2
);
1014 aff1
= isl_aff_gist(aff1
, isl_set_copy(dom
));
1018 int isl_aff_is_empty(__isl_keep isl_aff
*aff
)
1026 /* Check whether the given affine expression has non-zero coefficient
1027 * for any dimension in the given range or if any of these dimensions
1028 * appear with non-zero coefficients in any of the integer divisions
1029 * involved in the affine expression.
1031 int isl_aff_involves_dims(__isl_keep isl_aff
*aff
,
1032 enum isl_dim_type type
, unsigned first
, unsigned n
)
1044 ctx
= isl_aff_get_ctx(aff
);
1045 if (first
+ n
> isl_aff_dim(aff
, type
))
1046 isl_die(ctx
, isl_error_invalid
,
1047 "range out of bounds", return -1);
1049 active
= isl_local_space_get_active(aff
->ls
, aff
->v
->el
+ 2);
1053 first
+= isl_local_space_offset(aff
->ls
, type
) - 1;
1054 for (i
= 0; i
< n
; ++i
)
1055 if (active
[first
+ i
]) {
1068 __isl_give isl_aff
*isl_aff_drop_dims(__isl_take isl_aff
*aff
,
1069 enum isl_dim_type type
, unsigned first
, unsigned n
)
1075 if (type
== isl_dim_out
)
1076 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1077 "cannot drop output/set dimension",
1078 return isl_aff_free(aff
));
1079 if (type
== isl_dim_in
)
1081 if (n
== 0 && !isl_local_space_is_named_or_nested(aff
->ls
, type
))
1084 ctx
= isl_aff_get_ctx(aff
);
1085 if (first
+ n
> isl_local_space_dim(aff
->ls
, type
))
1086 isl_die(ctx
, isl_error_invalid
, "range out of bounds",
1087 return isl_aff_free(aff
));
1089 aff
= isl_aff_cow(aff
);
1093 aff
->ls
= isl_local_space_drop_dims(aff
->ls
, type
, first
, n
);
1095 return isl_aff_free(aff
);
1097 first
+= 1 + isl_local_space_offset(aff
->ls
, type
);
1098 aff
->v
= isl_vec_drop_els(aff
->v
, first
, n
);
1100 return isl_aff_free(aff
);
1105 __isl_give isl_aff
*isl_aff_insert_dims(__isl_take isl_aff
*aff
,
1106 enum isl_dim_type type
, unsigned first
, unsigned n
)
1112 if (type
== isl_dim_out
)
1113 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1114 "cannot insert output/set dimensions",
1115 return isl_aff_free(aff
));
1116 if (type
== isl_dim_in
)
1118 if (n
== 0 && !isl_local_space_is_named_or_nested(aff
->ls
, type
))
1121 ctx
= isl_aff_get_ctx(aff
);
1122 if (first
> isl_local_space_dim(aff
->ls
, type
))
1123 isl_die(ctx
, isl_error_invalid
, "position out of bounds",
1124 return isl_aff_free(aff
));
1126 aff
= isl_aff_cow(aff
);
1130 aff
->ls
= isl_local_space_insert_dims(aff
->ls
, type
, first
, n
);
1132 return isl_aff_free(aff
);
1134 first
+= 1 + isl_local_space_offset(aff
->ls
, type
);
1135 aff
->v
= isl_vec_insert_zero_els(aff
->v
, first
, n
);
1137 return isl_aff_free(aff
);
1142 __isl_give isl_aff
*isl_aff_add_dims(__isl_take isl_aff
*aff
,
1143 enum isl_dim_type type
, unsigned n
)
1147 pos
= isl_aff_dim(aff
, type
);
1149 return isl_aff_insert_dims(aff
, type
, pos
, n
);
1152 __isl_give isl_pw_aff
*isl_pw_aff_add_dims(__isl_take isl_pw_aff
*pwaff
,
1153 enum isl_dim_type type
, unsigned n
)
1157 pos
= isl_pw_aff_dim(pwaff
, type
);
1159 return isl_pw_aff_insert_dims(pwaff
, type
, pos
, n
);
1162 __isl_give isl_pw_aff
*isl_pw_aff_set_tuple_id(__isl_take isl_pw_aff
*pwaff
,
1163 __isl_take isl_id
*id
)
1167 dim
= isl_pw_aff_get_space(pwaff
);
1168 dim
= isl_space_set_tuple_id(dim
, isl_dim_in
, id
);
1170 return isl_pw_aff_reset_space(pwaff
, dim
);
1173 __isl_give isl_pw_aff
*isl_pw_aff_from_aff(__isl_take isl_aff
*aff
)
1175 isl_set
*dom
= isl_set_universe(isl_aff_get_domain_space(aff
));
1176 return isl_pw_aff_alloc(dom
, aff
);
1180 #define PW isl_pw_aff
1184 #define EL_IS_ZERO is_empty
1188 #define IS_ZERO is_empty
1194 #define NO_MOVE_DIMS
1198 #include <isl_pw_templ.c>
1200 static __isl_give isl_set
*align_params_pw_pw_set_and(
1201 __isl_take isl_pw_aff
*pwaff1
, __isl_take isl_pw_aff
*pwaff2
,
1202 __isl_give isl_set
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
1203 __isl_take isl_pw_aff
*pwaff2
))
1205 if (!pwaff1
|| !pwaff2
)
1207 if (isl_space_match(pwaff1
->dim
, isl_dim_param
,
1208 pwaff2
->dim
, isl_dim_param
))
1209 return fn(pwaff1
, pwaff2
);
1210 if (!isl_space_has_named_params(pwaff1
->dim
) ||
1211 !isl_space_has_named_params(pwaff2
->dim
))
1212 isl_die(isl_pw_aff_get_ctx(pwaff1
), isl_error_invalid
,
1213 "unaligned unnamed parameters", goto error
);
1214 pwaff1
= isl_pw_aff_align_params(pwaff1
, isl_pw_aff_get_space(pwaff2
));
1215 pwaff2
= isl_pw_aff_align_params(pwaff2
, isl_pw_aff_get_space(pwaff1
));
1216 return fn(pwaff1
, pwaff2
);
1218 isl_pw_aff_free(pwaff1
);
1219 isl_pw_aff_free(pwaff2
);
1223 /* Compute a piecewise quasi-affine expression with a domain that
1224 * is the union of those of pwaff1 and pwaff2 and such that on each
1225 * cell, the quasi-affine expression is the better (according to cmp)
1226 * of those of pwaff1 and pwaff2. If only one of pwaff1 or pwaff2
1227 * is defined on a given cell, then the associated expression
1228 * is the defined one.
1230 static __isl_give isl_pw_aff
*pw_aff_union_opt(__isl_take isl_pw_aff
*pwaff1
,
1231 __isl_take isl_pw_aff
*pwaff2
,
1232 __isl_give isl_basic_set
*(*cmp
)(__isl_take isl_aff
*aff1
,
1233 __isl_take isl_aff
*aff2
))
1240 if (!pwaff1
|| !pwaff2
)
1243 ctx
= isl_space_get_ctx(pwaff1
->dim
);
1244 if (!isl_space_is_equal(pwaff1
->dim
, pwaff2
->dim
))
1245 isl_die(ctx
, isl_error_invalid
,
1246 "arguments should live in same space", goto error
);
1248 if (isl_pw_aff_is_empty(pwaff1
)) {
1249 isl_pw_aff_free(pwaff1
);
1253 if (isl_pw_aff_is_empty(pwaff2
)) {
1254 isl_pw_aff_free(pwaff2
);
1258 n
= 2 * (pwaff1
->n
+ 1) * (pwaff2
->n
+ 1);
1259 res
= isl_pw_aff_alloc_size(isl_space_copy(pwaff1
->dim
), n
);
1261 for (i
= 0; i
< pwaff1
->n
; ++i
) {
1262 set
= isl_set_copy(pwaff1
->p
[i
].set
);
1263 for (j
= 0; j
< pwaff2
->n
; ++j
) {
1264 struct isl_set
*common
;
1267 common
= isl_set_intersect(
1268 isl_set_copy(pwaff1
->p
[i
].set
),
1269 isl_set_copy(pwaff2
->p
[j
].set
));
1270 better
= isl_set_from_basic_set(cmp(
1271 isl_aff_copy(pwaff2
->p
[j
].aff
),
1272 isl_aff_copy(pwaff1
->p
[i
].aff
)));
1273 better
= isl_set_intersect(common
, better
);
1274 if (isl_set_plain_is_empty(better
)) {
1275 isl_set_free(better
);
1278 set
= isl_set_subtract(set
, isl_set_copy(better
));
1280 res
= isl_pw_aff_add_piece(res
, better
,
1281 isl_aff_copy(pwaff2
->p
[j
].aff
));
1283 res
= isl_pw_aff_add_piece(res
, set
,
1284 isl_aff_copy(pwaff1
->p
[i
].aff
));
1287 for (j
= 0; j
< pwaff2
->n
; ++j
) {
1288 set
= isl_set_copy(pwaff2
->p
[j
].set
);
1289 for (i
= 0; i
< pwaff1
->n
; ++i
)
1290 set
= isl_set_subtract(set
,
1291 isl_set_copy(pwaff1
->p
[i
].set
));
1292 res
= isl_pw_aff_add_piece(res
, set
,
1293 isl_aff_copy(pwaff2
->p
[j
].aff
));
1296 isl_pw_aff_free(pwaff1
);
1297 isl_pw_aff_free(pwaff2
);
1301 isl_pw_aff_free(pwaff1
);
1302 isl_pw_aff_free(pwaff2
);
1306 /* Compute a piecewise quasi-affine expression with a domain that
1307 * is the union of those of pwaff1 and pwaff2 and such that on each
1308 * cell, the quasi-affine expression is the maximum of those of pwaff1
1309 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
1310 * cell, then the associated expression is the defined one.
1312 static __isl_give isl_pw_aff
*pw_aff_union_max(__isl_take isl_pw_aff
*pwaff1
,
1313 __isl_take isl_pw_aff
*pwaff2
)
1315 return pw_aff_union_opt(pwaff1
, pwaff2
, &isl_aff_ge_basic_set
);
1318 __isl_give isl_pw_aff
*isl_pw_aff_union_max(__isl_take isl_pw_aff
*pwaff1
,
1319 __isl_take isl_pw_aff
*pwaff2
)
1321 return align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_union_max
);
1324 /* Compute a piecewise quasi-affine expression with a domain that
1325 * is the union of those of pwaff1 and pwaff2 and such that on each
1326 * cell, the quasi-affine expression is the minimum of those of pwaff1
1327 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
1328 * cell, then the associated expression is the defined one.
1330 static __isl_give isl_pw_aff
*pw_aff_union_min(__isl_take isl_pw_aff
*pwaff1
,
1331 __isl_take isl_pw_aff
*pwaff2
)
1333 return pw_aff_union_opt(pwaff1
, pwaff2
, &isl_aff_le_basic_set
);
1336 __isl_give isl_pw_aff
*isl_pw_aff_union_min(__isl_take isl_pw_aff
*pwaff1
,
1337 __isl_take isl_pw_aff
*pwaff2
)
1339 return align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_union_min
);
1342 __isl_give isl_pw_aff
*isl_pw_aff_union_opt(__isl_take isl_pw_aff
*pwaff1
,
1343 __isl_take isl_pw_aff
*pwaff2
, int max
)
1346 return isl_pw_aff_union_max(pwaff1
, pwaff2
);
1348 return isl_pw_aff_union_min(pwaff1
, pwaff2
);
1351 /* Construct a map with as domain the domain of pwaff and
1352 * one-dimensional range corresponding to the affine expressions.
1354 static __isl_give isl_map
*map_from_pw_aff(__isl_take isl_pw_aff
*pwaff
)
1363 dim
= isl_pw_aff_get_space(pwaff
);
1364 map
= isl_map_empty(dim
);
1366 for (i
= 0; i
< pwaff
->n
; ++i
) {
1367 isl_basic_map
*bmap
;
1370 bmap
= isl_basic_map_from_aff(isl_aff_copy(pwaff
->p
[i
].aff
));
1371 map_i
= isl_map_from_basic_map(bmap
);
1372 map_i
= isl_map_intersect_domain(map_i
,
1373 isl_set_copy(pwaff
->p
[i
].set
));
1374 map
= isl_map_union_disjoint(map
, map_i
);
1377 isl_pw_aff_free(pwaff
);
1382 /* Construct a map with as domain the domain of pwaff and
1383 * one-dimensional range corresponding to the affine expressions.
1385 __isl_give isl_map
*isl_map_from_pw_aff(__isl_take isl_pw_aff
*pwaff
)
1387 if (isl_space_is_set(pwaff
->dim
))
1388 isl_die(isl_pw_aff_get_ctx(pwaff
), isl_error_invalid
,
1389 "space of input is not a map",
1390 return isl_pw_aff_free(pwaff
));
1391 return map_from_pw_aff(pwaff
);
1394 /* Construct a one-dimensional set with as parameter domain
1395 * the domain of pwaff and the single set dimension
1396 * corresponding to the affine expressions.
1398 __isl_give isl_set
*isl_set_from_pw_aff(__isl_take isl_pw_aff
*pwaff
)
1400 if (!isl_space_is_set(pwaff
->dim
))
1401 isl_die(isl_pw_aff_get_ctx(pwaff
), isl_error_invalid
,
1402 "space of input is not a set",
1403 return isl_pw_aff_free(pwaff
));
1404 return map_from_pw_aff(pwaff
);
1407 /* Return a set containing those elements in the domain
1408 * of pwaff where it is non-negative.
1410 __isl_give isl_set
*isl_pw_aff_nonneg_set(__isl_take isl_pw_aff
*pwaff
)
1418 set
= isl_set_empty(isl_pw_aff_get_domain_space(pwaff
));
1420 for (i
= 0; i
< pwaff
->n
; ++i
) {
1421 isl_basic_set
*bset
;
1424 bset
= isl_aff_nonneg_basic_set(isl_aff_copy(pwaff
->p
[i
].aff
));
1425 set_i
= isl_set_from_basic_set(bset
);
1426 set_i
= isl_set_intersect(set_i
, isl_set_copy(pwaff
->p
[i
].set
));
1427 set
= isl_set_union_disjoint(set
, set_i
);
1430 isl_pw_aff_free(pwaff
);
1435 /* Return a set containing those elements in the domain
1436 * of pwaff where it is zero.
1438 __isl_give isl_set
*isl_pw_aff_zero_set(__isl_take isl_pw_aff
*pwaff
)
1446 set
= isl_set_empty(isl_pw_aff_get_domain_space(pwaff
));
1448 for (i
= 0; i
< pwaff
->n
; ++i
) {
1449 isl_basic_set
*bset
;
1452 bset
= isl_aff_zero_basic_set(isl_aff_copy(pwaff
->p
[i
].aff
));
1453 set_i
= isl_set_from_basic_set(bset
);
1454 set_i
= isl_set_intersect(set_i
, isl_set_copy(pwaff
->p
[i
].set
));
1455 set
= isl_set_union_disjoint(set
, set_i
);
1458 isl_pw_aff_free(pwaff
);
1463 /* Return a set containing those elements in the domain
1464 * of pwaff where it is not zero.
1466 __isl_give isl_set
*isl_pw_aff_non_zero_set(__isl_take isl_pw_aff
*pwaff
)
1468 return isl_set_complement(isl_pw_aff_zero_set(pwaff
));
1471 /* Return a set containing those elements in the shared domain
1472 * of pwaff1 and pwaff2 where pwaff1 is greater than (or equal) to pwaff2.
1474 * We compute the difference on the shared domain and then construct
1475 * the set of values where this difference is non-negative.
1476 * If strict is set, we first subtract 1 from the difference.
1477 * If equal is set, we only return the elements where pwaff1 and pwaff2
1480 static __isl_give isl_set
*pw_aff_gte_set(__isl_take isl_pw_aff
*pwaff1
,
1481 __isl_take isl_pw_aff
*pwaff2
, int strict
, int equal
)
1483 isl_set
*set1
, *set2
;
1485 set1
= isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
));
1486 set2
= isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
));
1487 set1
= isl_set_intersect(set1
, set2
);
1488 pwaff1
= isl_pw_aff_intersect_domain(pwaff1
, isl_set_copy(set1
));
1489 pwaff2
= isl_pw_aff_intersect_domain(pwaff2
, isl_set_copy(set1
));
1490 pwaff1
= isl_pw_aff_add(pwaff1
, isl_pw_aff_neg(pwaff2
));
1493 isl_space
*dim
= isl_set_get_space(set1
);
1495 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
1496 aff
= isl_aff_add_constant_si(aff
, -1);
1497 pwaff1
= isl_pw_aff_add(pwaff1
, isl_pw_aff_alloc(set1
, aff
));
1502 return isl_pw_aff_zero_set(pwaff1
);
1503 return isl_pw_aff_nonneg_set(pwaff1
);
1506 /* Return a set containing those elements in the shared domain
1507 * of pwaff1 and pwaff2 where pwaff1 is equal to pwaff2.
1509 static __isl_give isl_set
*pw_aff_eq_set(__isl_take isl_pw_aff
*pwaff1
,
1510 __isl_take isl_pw_aff
*pwaff2
)
1512 return pw_aff_gte_set(pwaff1
, pwaff2
, 0, 1);
1515 __isl_give isl_set
*isl_pw_aff_eq_set(__isl_take isl_pw_aff
*pwaff1
,
1516 __isl_take isl_pw_aff
*pwaff2
)
1518 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_eq_set
);
1521 /* Return a set containing those elements in the shared domain
1522 * of pwaff1 and pwaff2 where pwaff1 is greater than or equal to pwaff2.
1524 static __isl_give isl_set
*pw_aff_ge_set(__isl_take isl_pw_aff
*pwaff1
,
1525 __isl_take isl_pw_aff
*pwaff2
)
1527 return pw_aff_gte_set(pwaff1
, pwaff2
, 0, 0);
1530 __isl_give isl_set
*isl_pw_aff_ge_set(__isl_take isl_pw_aff
*pwaff1
,
1531 __isl_take isl_pw_aff
*pwaff2
)
1533 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_ge_set
);
1536 /* Return a set containing those elements in the shared domain
1537 * of pwaff1 and pwaff2 where pwaff1 is strictly greater than pwaff2.
1539 static __isl_give isl_set
*pw_aff_gt_set(__isl_take isl_pw_aff
*pwaff1
,
1540 __isl_take isl_pw_aff
*pwaff2
)
1542 return pw_aff_gte_set(pwaff1
, pwaff2
, 1, 0);
1545 __isl_give isl_set
*isl_pw_aff_gt_set(__isl_take isl_pw_aff
*pwaff1
,
1546 __isl_take isl_pw_aff
*pwaff2
)
1548 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_gt_set
);
1551 __isl_give isl_set
*isl_pw_aff_le_set(__isl_take isl_pw_aff
*pwaff1
,
1552 __isl_take isl_pw_aff
*pwaff2
)
1554 return isl_pw_aff_ge_set(pwaff2
, pwaff1
);
1557 __isl_give isl_set
*isl_pw_aff_lt_set(__isl_take isl_pw_aff
*pwaff1
,
1558 __isl_take isl_pw_aff
*pwaff2
)
1560 return isl_pw_aff_gt_set(pwaff2
, pwaff1
);
1563 /* Return a set containing those elements in the shared domain
1564 * of the elements of list1 and list2 where each element in list1
1565 * has the relation specified by "fn" with each element in list2.
1567 static __isl_give isl_set
*pw_aff_list_set(__isl_take isl_pw_aff_list
*list1
,
1568 __isl_take isl_pw_aff_list
*list2
,
1569 __isl_give isl_set
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
1570 __isl_take isl_pw_aff
*pwaff2
))
1576 if (!list1
|| !list2
)
1579 ctx
= isl_pw_aff_list_get_ctx(list1
);
1580 if (list1
->n
< 1 || list2
->n
< 1)
1581 isl_die(ctx
, isl_error_invalid
,
1582 "list should contain at least one element", goto error
);
1584 set
= isl_set_universe(isl_pw_aff_get_domain_space(list1
->p
[0]));
1585 for (i
= 0; i
< list1
->n
; ++i
)
1586 for (j
= 0; j
< list2
->n
; ++j
) {
1589 set_ij
= fn(isl_pw_aff_copy(list1
->p
[i
]),
1590 isl_pw_aff_copy(list2
->p
[j
]));
1591 set
= isl_set_intersect(set
, set_ij
);
1594 isl_pw_aff_list_free(list1
);
1595 isl_pw_aff_list_free(list2
);
1598 isl_pw_aff_list_free(list1
);
1599 isl_pw_aff_list_free(list2
);
1603 /* Return a set containing those elements in the shared domain
1604 * of the elements of list1 and list2 where each element in list1
1605 * is equal to each element in list2.
1607 __isl_give isl_set
*isl_pw_aff_list_eq_set(__isl_take isl_pw_aff_list
*list1
,
1608 __isl_take isl_pw_aff_list
*list2
)
1610 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_eq_set
);
1613 __isl_give isl_set
*isl_pw_aff_list_ne_set(__isl_take isl_pw_aff_list
*list1
,
1614 __isl_take isl_pw_aff_list
*list2
)
1616 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_ne_set
);
1619 /* Return a set containing those elements in the shared domain
1620 * of the elements of list1 and list2 where each element in list1
1621 * is less than or equal to each element in list2.
1623 __isl_give isl_set
*isl_pw_aff_list_le_set(__isl_take isl_pw_aff_list
*list1
,
1624 __isl_take isl_pw_aff_list
*list2
)
1626 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_le_set
);
1629 __isl_give isl_set
*isl_pw_aff_list_lt_set(__isl_take isl_pw_aff_list
*list1
,
1630 __isl_take isl_pw_aff_list
*list2
)
1632 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_lt_set
);
1635 __isl_give isl_set
*isl_pw_aff_list_ge_set(__isl_take isl_pw_aff_list
*list1
,
1636 __isl_take isl_pw_aff_list
*list2
)
1638 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_ge_set
);
1641 __isl_give isl_set
*isl_pw_aff_list_gt_set(__isl_take isl_pw_aff_list
*list1
,
1642 __isl_take isl_pw_aff_list
*list2
)
1644 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_gt_set
);
1648 /* Return a set containing those elements in the shared domain
1649 * of pwaff1 and pwaff2 where pwaff1 is not equal to pwaff2.
1651 static __isl_give isl_set
*pw_aff_ne_set(__isl_take isl_pw_aff
*pwaff1
,
1652 __isl_take isl_pw_aff
*pwaff2
)
1654 isl_set
*set_lt
, *set_gt
;
1656 set_lt
= isl_pw_aff_lt_set(isl_pw_aff_copy(pwaff1
),
1657 isl_pw_aff_copy(pwaff2
));
1658 set_gt
= isl_pw_aff_gt_set(pwaff1
, pwaff2
);
1659 return isl_set_union_disjoint(set_lt
, set_gt
);
1662 __isl_give isl_set
*isl_pw_aff_ne_set(__isl_take isl_pw_aff
*pwaff1
,
1663 __isl_take isl_pw_aff
*pwaff2
)
1665 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_ne_set
);
1668 __isl_give isl_pw_aff
*isl_pw_aff_scale_down(__isl_take isl_pw_aff
*pwaff
,
1673 if (isl_int_is_one(v
))
1675 if (!isl_int_is_pos(v
))
1676 isl_die(isl_pw_aff_get_ctx(pwaff
), isl_error_invalid
,
1677 "factor needs to be positive",
1678 return isl_pw_aff_free(pwaff
));
1679 pwaff
= isl_pw_aff_cow(pwaff
);
1685 for (i
= 0; i
< pwaff
->n
; ++i
) {
1686 pwaff
->p
[i
].aff
= isl_aff_scale_down(pwaff
->p
[i
].aff
, v
);
1687 if (!pwaff
->p
[i
].aff
)
1688 return isl_pw_aff_free(pwaff
);
1694 __isl_give isl_pw_aff
*isl_pw_aff_floor(__isl_take isl_pw_aff
*pwaff
)
1698 pwaff
= isl_pw_aff_cow(pwaff
);
1704 for (i
= 0; i
< pwaff
->n
; ++i
) {
1705 pwaff
->p
[i
].aff
= isl_aff_floor(pwaff
->p
[i
].aff
);
1706 if (!pwaff
->p
[i
].aff
)
1707 return isl_pw_aff_free(pwaff
);
1713 __isl_give isl_pw_aff
*isl_pw_aff_ceil(__isl_take isl_pw_aff
*pwaff
)
1717 pwaff
= isl_pw_aff_cow(pwaff
);
1723 for (i
= 0; i
< pwaff
->n
; ++i
) {
1724 pwaff
->p
[i
].aff
= isl_aff_ceil(pwaff
->p
[i
].aff
);
1725 if (!pwaff
->p
[i
].aff
)
1726 return isl_pw_aff_free(pwaff
);
1732 /* Return an affine expression that is equal to pwaff_true for elements
1733 * in "cond" and to pwaff_false for elements not in "cond".
1734 * That is, return cond ? pwaff_true : pwaff_false;
1736 __isl_give isl_pw_aff
*isl_pw_aff_cond(__isl_take isl_set
*cond
,
1737 __isl_take isl_pw_aff
*pwaff_true
, __isl_take isl_pw_aff
*pwaff_false
)
1741 comp
= isl_set_complement(isl_set_copy(cond
));
1742 pwaff_true
= isl_pw_aff_intersect_domain(pwaff_true
, cond
);
1743 pwaff_false
= isl_pw_aff_intersect_domain(pwaff_false
, comp
);
1745 return isl_pw_aff_add_disjoint(pwaff_true
, pwaff_false
);
1748 int isl_aff_is_cst(__isl_keep isl_aff
*aff
)
1753 return isl_seq_first_non_zero(aff
->v
->el
+ 2, aff
->v
->size
- 2) == -1;
1756 /* Check whether pwaff is a piecewise constant.
1758 int isl_pw_aff_is_cst(__isl_keep isl_pw_aff
*pwaff
)
1765 for (i
= 0; i
< pwaff
->n
; ++i
) {
1766 int is_cst
= isl_aff_is_cst(pwaff
->p
[i
].aff
);
1767 if (is_cst
< 0 || !is_cst
)
1774 __isl_give isl_aff
*isl_aff_mul(__isl_take isl_aff
*aff1
,
1775 __isl_take isl_aff
*aff2
)
1777 if (!isl_aff_is_cst(aff2
) && isl_aff_is_cst(aff1
))
1778 return isl_aff_mul(aff2
, aff1
);
1780 if (!isl_aff_is_cst(aff2
))
1781 isl_die(isl_aff_get_ctx(aff1
), isl_error_invalid
,
1782 "at least one affine expression should be constant",
1785 aff1
= isl_aff_cow(aff1
);
1789 aff1
= isl_aff_scale(aff1
, aff2
->v
->el
[1]);
1790 aff1
= isl_aff_scale_down(aff1
, aff2
->v
->el
[0]);
1800 static __isl_give isl_pw_aff
*pw_aff_mul(__isl_take isl_pw_aff
*pwaff1
,
1801 __isl_take isl_pw_aff
*pwaff2
)
1806 if (!pwaff1
|| !pwaff2
)
1809 n
= pwaff1
->n
* pwaff2
->n
;
1810 res
= isl_pw_aff_alloc_size(isl_space_copy(pwaff1
->dim
), n
);
1812 for (i
= 0; i
< pwaff1
->n
; ++i
) {
1813 for (j
= 0; j
< pwaff2
->n
; ++j
) {
1816 common
= isl_set_intersect(
1817 isl_set_copy(pwaff1
->p
[i
].set
),
1818 isl_set_copy(pwaff2
->p
[j
].set
));
1819 if (isl_set_plain_is_empty(common
)) {
1820 isl_set_free(common
);
1824 prod
= isl_aff_mul(isl_aff_copy(pwaff1
->p
[i
].aff
),
1825 isl_aff_copy(pwaff2
->p
[j
].aff
));
1827 res
= isl_pw_aff_add_piece(res
, common
, prod
);
1831 isl_pw_aff_free(pwaff1
);
1832 isl_pw_aff_free(pwaff2
);
1835 isl_pw_aff_free(pwaff1
);
1836 isl_pw_aff_free(pwaff2
);
1840 __isl_give isl_pw_aff
*isl_pw_aff_mul(__isl_take isl_pw_aff
*pwaff1
,
1841 __isl_take isl_pw_aff
*pwaff2
)
1843 return align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_mul
);
1846 static __isl_give isl_pw_aff
*pw_aff_min(__isl_take isl_pw_aff
*pwaff1
,
1847 __isl_take isl_pw_aff
*pwaff2
)
1851 le
= isl_pw_aff_le_set(isl_pw_aff_copy(pwaff1
),
1852 isl_pw_aff_copy(pwaff2
));
1853 return isl_pw_aff_cond(le
, pwaff1
, pwaff2
);
1856 __isl_give isl_pw_aff
*isl_pw_aff_min(__isl_take isl_pw_aff
*pwaff1
,
1857 __isl_take isl_pw_aff
*pwaff2
)
1859 return align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_min
);
1862 static __isl_give isl_pw_aff
*pw_aff_max(__isl_take isl_pw_aff
*pwaff1
,
1863 __isl_take isl_pw_aff
*pwaff2
)
1867 le
= isl_pw_aff_ge_set(isl_pw_aff_copy(pwaff1
),
1868 isl_pw_aff_copy(pwaff2
));
1869 return isl_pw_aff_cond(le
, pwaff1
, pwaff2
);
1872 __isl_give isl_pw_aff
*isl_pw_aff_max(__isl_take isl_pw_aff
*pwaff1
,
1873 __isl_take isl_pw_aff
*pwaff2
)
1875 return align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_max
);
1878 static __isl_give isl_pw_aff
*pw_aff_list_reduce(
1879 __isl_take isl_pw_aff_list
*list
,
1880 __isl_give isl_pw_aff
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
1881 __isl_take isl_pw_aff
*pwaff2
))
1890 ctx
= isl_pw_aff_list_get_ctx(list
);
1892 isl_die(ctx
, isl_error_invalid
,
1893 "list should contain at least one element",
1894 return isl_pw_aff_list_free(list
));
1896 res
= isl_pw_aff_copy(list
->p
[0]);
1897 for (i
= 1; i
< list
->n
; ++i
)
1898 res
= fn(res
, isl_pw_aff_copy(list
->p
[i
]));
1900 isl_pw_aff_list_free(list
);
1904 /* Return an isl_pw_aff that maps each element in the intersection of the
1905 * domains of the elements of list to the minimal corresponding affine
1908 __isl_give isl_pw_aff
*isl_pw_aff_list_min(__isl_take isl_pw_aff_list
*list
)
1910 return pw_aff_list_reduce(list
, &isl_pw_aff_min
);
1913 /* Return an isl_pw_aff that maps each element in the intersection of the
1914 * domains of the elements of list to the maximal corresponding affine
1917 __isl_give isl_pw_aff
*isl_pw_aff_list_max(__isl_take isl_pw_aff_list
*list
)
1919 return pw_aff_list_reduce(list
, &isl_pw_aff_max
);