2 * Copyright 2010-2011 INRIA Saclay
3 * Copyright 2011 Sven Verdoolaege
4 * Copyright 2012-2014 Ecole Normale Superieure
6 * Use of this software is governed by the MIT license
8 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
9 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
11 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
16 #include <isl_val_private.h>
18 #include <isl_pw_macro.h>
21 __isl_give PW
*FN(PW
,alloc_size
)(__isl_take isl_space
*dim
,
22 enum isl_fold type
, int n
)
24 __isl_give PW
*FN(PW
,alloc_size
)(__isl_take isl_space
*dim
, int n
)
32 ctx
= isl_space_get_ctx(dim
);
33 isl_assert(ctx
, n
>= 0, goto error
);
34 pw
= isl_alloc(ctx
, struct PW
,
35 sizeof(struct PW
) + (n
- 1) * sizeof(S(PW
,piece
)));
53 __isl_give PW
*FN(PW
,ZERO
)(__isl_take isl_space
*dim
, enum isl_fold type
)
55 return FN(PW
,alloc_size
)(dim
, type
, 0);
58 __isl_give PW
*FN(PW
,ZERO
)(__isl_take isl_space
*dim
)
60 return FN(PW
,alloc_size
)(dim
, 0);
64 __isl_give PW
*FN(PW
,add_piece
)(__isl_take PW
*pw
,
65 __isl_take isl_set
*set
, __isl_take EL
*el
)
68 isl_space
*el_dim
= NULL
;
70 if (!pw
|| !set
|| !el
)
73 if (isl_set_plain_is_empty(set
) || FN(EL
,EL_IS_ZERO
)(el
)) {
79 ctx
= isl_set_get_ctx(set
);
81 if (pw
->type
!= el
->type
)
82 isl_die(ctx
, isl_error_invalid
, "fold types don't match",
85 el_dim
= FN(EL
,get_space(el
));
86 isl_assert(ctx
, isl_space_is_equal(pw
->dim
, el_dim
), goto error
);
87 isl_assert(ctx
, pw
->n
< pw
->size
, goto error
);
89 pw
->p
[pw
->n
].set
= set
;
90 pw
->p
[pw
->n
].FIELD
= el
;
93 isl_space_free(el_dim
);
96 isl_space_free(el_dim
);
103 /* Does the space of "set" correspond to that of the domain of "el".
105 static isl_bool
FN(PW
,compatible_domain
)(__isl_keep EL
*el
,
106 __isl_keep isl_set
*set
)
109 isl_space
*el_space
, *set_space
;
112 return isl_bool_error
;
113 set_space
= isl_set_get_space(set
);
114 el_space
= FN(EL
,get_space
)(el
);
115 ok
= isl_space_is_domain_internal(set_space
, el_space
);
116 isl_space_free(el_space
);
117 isl_space_free(set_space
);
121 /* Check that the space of "set" corresponds to that of the domain of "el".
123 static isl_stat
FN(PW
,check_compatible_domain
)(__isl_keep EL
*el
,
124 __isl_keep isl_set
*set
)
128 ok
= FN(PW
,compatible_domain
)(el
, set
);
130 return isl_stat_error
;
132 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
133 "incompatible spaces", return isl_stat_error
);
139 __isl_give PW
*FN(PW
,alloc
)(enum isl_fold type
,
140 __isl_take isl_set
*set
, __isl_take EL
*el
)
142 __isl_give PW
*FN(PW
,alloc
)(__isl_take isl_set
*set
, __isl_take EL
*el
)
147 if (FN(PW
,check_compatible_domain
)(el
, set
) < 0)
151 pw
= FN(PW
,alloc_size
)(FN(EL
,get_space
)(el
), type
, 1);
153 pw
= FN(PW
,alloc_size
)(FN(EL
,get_space
)(el
), 1);
156 return FN(PW
,add_piece
)(pw
, set
, el
);
163 __isl_give PW
*FN(PW
,dup
)(__isl_keep PW
*pw
)
172 dup
= FN(PW
,alloc_size
)(isl_space_copy(pw
->dim
), pw
->type
, pw
->n
);
174 dup
= FN(PW
,alloc_size
)(isl_space_copy(pw
->dim
), pw
->n
);
179 for (i
= 0; i
< pw
->n
; ++i
)
180 dup
= FN(PW
,add_piece
)(dup
, isl_set_copy(pw
->p
[i
].set
),
181 FN(EL
,copy
)(pw
->p
[i
].FIELD
));
186 __isl_give PW
*FN(PW
,cow
)(__isl_take PW
*pw
)
194 return FN(PW
,dup
)(pw
);
197 __isl_give PW
*FN(PW
,copy
)(__isl_keep PW
*pw
)
206 __isl_null PW
*FN(PW
,free
)(__isl_take PW
*pw
)
215 for (i
= 0; i
< pw
->n
; ++i
) {
216 isl_set_free(pw
->p
[i
].set
);
217 FN(EL
,free
)(pw
->p
[i
].FIELD
);
219 isl_space_free(pw
->dim
);
225 const char *FN(PW
,get_dim_name
)(__isl_keep PW
*pw
, enum isl_dim_type type
,
228 return pw
? isl_space_get_dim_name(pw
->dim
, type
, pos
) : NULL
;
231 isl_bool
FN(PW
,has_dim_id
)(__isl_keep PW
*pw
, enum isl_dim_type type
,
234 return pw
? isl_space_has_dim_id(pw
->dim
, type
, pos
) : isl_bool_error
;
237 __isl_give isl_id
*FN(PW
,get_dim_id
)(__isl_keep PW
*pw
, enum isl_dim_type type
,
240 return pw
? isl_space_get_dim_id(pw
->dim
, type
, pos
) : NULL
;
243 isl_bool
FN(PW
,has_tuple_name
)(__isl_keep PW
*pw
, enum isl_dim_type type
)
245 return pw
? isl_space_has_tuple_name(pw
->dim
, type
) : isl_bool_error
;
248 const char *FN(PW
,get_tuple_name
)(__isl_keep PW
*pw
, enum isl_dim_type type
)
250 return pw
? isl_space_get_tuple_name(pw
->dim
, type
) : NULL
;
253 isl_bool
FN(PW
,has_tuple_id
)(__isl_keep PW
*pw
, enum isl_dim_type type
)
255 return pw
? isl_space_has_tuple_id(pw
->dim
, type
) : isl_bool_error
;
258 __isl_give isl_id
*FN(PW
,get_tuple_id
)(__isl_keep PW
*pw
, enum isl_dim_type type
)
260 return pw
? isl_space_get_tuple_id(pw
->dim
, type
) : NULL
;
263 isl_bool
FN(PW
,IS_ZERO
)(__isl_keep PW
*pw
)
266 return isl_bool_error
;
272 __isl_give PW
*FN(PW
,realign_domain
)(__isl_take PW
*pw
,
273 __isl_take isl_reordering
*exp
)
281 for (i
= 0; i
< pw
->n
; ++i
) {
282 pw
->p
[i
].set
= isl_set_realign(pw
->p
[i
].set
,
283 isl_reordering_copy(exp
));
286 pw
->p
[i
].FIELD
= FN(EL
,realign_domain
)(pw
->p
[i
].FIELD
,
287 isl_reordering_copy(exp
));
292 pw
= FN(PW
,reset_domain_space
)(pw
, isl_space_copy(exp
->dim
));
294 isl_reordering_free(exp
);
297 isl_reordering_free(exp
);
302 /* Align the parameters of "pw" to those of "model".
304 __isl_give PW
*FN(PW
,align_params
)(__isl_take PW
*pw
, __isl_take isl_space
*model
)
307 isl_bool equal_params
;
312 ctx
= isl_space_get_ctx(model
);
313 if (!isl_space_has_named_params(model
))
314 isl_die(ctx
, isl_error_invalid
,
315 "model has unnamed parameters", goto error
);
316 if (!isl_space_has_named_params(pw
->dim
))
317 isl_die(ctx
, isl_error_invalid
,
318 "input has unnamed parameters", goto error
);
319 equal_params
= isl_space_has_equal_params(pw
->dim
, model
);
320 if (equal_params
< 0)
325 model
= isl_space_drop_dims(model
, isl_dim_in
,
326 0, isl_space_dim(model
, isl_dim_in
));
327 model
= isl_space_drop_dims(model
, isl_dim_out
,
328 0, isl_space_dim(model
, isl_dim_out
));
329 exp
= isl_parameter_alignment_reordering(pw
->dim
, model
);
330 exp
= isl_reordering_extend_space(exp
,
331 FN(PW
,get_domain_space
)(pw
));
332 pw
= FN(PW
,realign_domain
)(pw
, exp
);
335 isl_space_free(model
);
338 isl_space_free(model
);
343 static __isl_give PW
*FN(PW
,align_params_pw_pw_and
)(__isl_take PW
*pw1
,
345 __isl_give PW
*(*fn
)(__isl_take PW
*pw1
, __isl_take PW
*pw2
))
348 isl_bool equal_params
;
352 equal_params
= isl_space_has_equal_params(pw1
->dim
, pw2
->dim
);
353 if (equal_params
< 0)
357 ctx
= FN(PW
,get_ctx
)(pw1
);
358 if (!isl_space_has_named_params(pw1
->dim
) ||
359 !isl_space_has_named_params(pw2
->dim
))
360 isl_die(ctx
, isl_error_invalid
,
361 "unaligned unnamed parameters", goto error
);
362 pw1
= FN(PW
,align_params
)(pw1
, FN(PW
,get_space
)(pw2
));
363 pw2
= FN(PW
,align_params
)(pw2
, FN(PW
,get_space
)(pw1
));
371 static __isl_give PW
*FN(PW
,align_params_pw_set_and
)(__isl_take PW
*pw
,
372 __isl_take isl_set
*set
,
373 __isl_give PW
*(*fn
)(__isl_take PW
*pw
, __isl_take isl_set
*set
))
380 aligned
= isl_set_space_has_equal_params(set
, pw
->dim
);
385 ctx
= FN(PW
,get_ctx
)(pw
);
386 if (!isl_space_has_named_params(pw
->dim
) ||
387 !isl_space_has_named_params(set
->dim
))
388 isl_die(ctx
, isl_error_invalid
,
389 "unaligned unnamed parameters", goto error
);
390 pw
= FN(PW
,align_params
)(pw
, isl_set_get_space(set
));
391 set
= isl_set_align_params(set
, FN(PW
,get_space
)(pw
));
400 static __isl_give PW
*FN(PW
,union_add_aligned
)(__isl_take PW
*pw1
,
411 ctx
= isl_space_get_ctx(pw1
->dim
);
413 if (pw1
->type
!= pw2
->type
)
414 isl_die(ctx
, isl_error_invalid
,
415 "fold types don't match", goto error
);
417 isl_assert(ctx
, isl_space_is_equal(pw1
->dim
, pw2
->dim
), goto error
);
419 if (FN(PW
,IS_ZERO
)(pw1
)) {
424 if (FN(PW
,IS_ZERO
)(pw2
)) {
429 n
= (pw1
->n
+ 1) * (pw2
->n
+ 1);
431 res
= FN(PW
,alloc_size
)(isl_space_copy(pw1
->dim
), pw1
->type
, n
);
433 res
= FN(PW
,alloc_size
)(isl_space_copy(pw1
->dim
), n
);
436 for (i
= 0; i
< pw1
->n
; ++i
) {
437 set
= isl_set_copy(pw1
->p
[i
].set
);
438 for (j
= 0; j
< pw2
->n
; ++j
) {
439 struct isl_set
*common
;
441 common
= isl_set_intersect(isl_set_copy(pw1
->p
[i
].set
),
442 isl_set_copy(pw2
->p
[j
].set
));
443 if (isl_set_plain_is_empty(common
)) {
444 isl_set_free(common
);
447 set
= isl_set_subtract(set
,
448 isl_set_copy(pw2
->p
[j
].set
));
450 sum
= FN(EL
,add_on_domain
)(common
,
451 FN(EL
,copy
)(pw1
->p
[i
].FIELD
),
452 FN(EL
,copy
)(pw2
->p
[j
].FIELD
));
454 res
= FN(PW
,add_piece
)(res
, common
, sum
);
456 res
= FN(PW
,add_piece
)(res
, set
, FN(EL
,copy
)(pw1
->p
[i
].FIELD
));
459 for (j
= 0; j
< pw2
->n
; ++j
) {
460 set
= isl_set_copy(pw2
->p
[j
].set
);
461 for (i
= 0; i
< pw1
->n
; ++i
)
462 set
= isl_set_subtract(set
,
463 isl_set_copy(pw1
->p
[i
].set
));
464 res
= FN(PW
,add_piece
)(res
, set
, FN(EL
,copy
)(pw2
->p
[j
].FIELD
));
477 /* Private version of "union_add". For isl_pw_qpolynomial and
478 * isl_pw_qpolynomial_fold, we prefer to simply call it "add".
480 static __isl_give PW
*FN(PW
,union_add_
)(__isl_take PW
*pw1
, __isl_take PW
*pw2
)
482 return FN(PW
,align_params_pw_pw_and
)(pw1
, pw2
,
483 &FN(PW
,union_add_aligned
));
486 /* Make sure "pw" has room for at least "n" more pieces.
488 * If there is only one reference to pw, we extend it in place.
489 * Otherwise, we create a new PW and copy the pieces.
491 static __isl_give PW
*FN(PW
,grow
)(__isl_take PW
*pw
, int n
)
499 if (pw
->n
+ n
<= pw
->size
)
501 ctx
= FN(PW
,get_ctx
)(pw
);
504 res
= isl_realloc(ctx
, pw
, struct PW
,
505 sizeof(struct PW
) + (n
- 1) * sizeof(S(PW
,piece
)));
507 return FN(PW
,free
)(pw
);
512 res
= FN(PW
,alloc_size
)(isl_space_copy(pw
->dim
), pw
->type
, n
);
514 res
= FN(PW
,alloc_size
)(isl_space_copy(pw
->dim
), n
);
517 return FN(PW
,free
)(pw
);
518 for (i
= 0; i
< pw
->n
; ++i
)
519 res
= FN(PW
,add_piece
)(res
, isl_set_copy(pw
->p
[i
].set
),
520 FN(EL
,copy
)(pw
->p
[i
].FIELD
));
525 static __isl_give PW
*FN(PW
,add_disjoint_aligned
)(__isl_take PW
*pw1
,
534 if (pw1
->size
< pw1
->n
+ pw2
->n
&& pw1
->n
< pw2
->n
)
535 return FN(PW
,add_disjoint_aligned
)(pw2
, pw1
);
537 ctx
= isl_space_get_ctx(pw1
->dim
);
539 if (pw1
->type
!= pw2
->type
)
540 isl_die(ctx
, isl_error_invalid
,
541 "fold types don't match", goto error
);
543 isl_assert(ctx
, isl_space_is_equal(pw1
->dim
, pw2
->dim
), goto error
);
545 if (FN(PW
,IS_ZERO
)(pw1
)) {
550 if (FN(PW
,IS_ZERO
)(pw2
)) {
555 pw1
= FN(PW
,grow
)(pw1
, pw2
->n
);
559 for (i
= 0; i
< pw2
->n
; ++i
)
560 pw1
= FN(PW
,add_piece
)(pw1
,
561 isl_set_copy(pw2
->p
[i
].set
),
562 FN(EL
,copy
)(pw2
->p
[i
].FIELD
));
573 __isl_give PW
*FN(PW
,add_disjoint
)(__isl_take PW
*pw1
, __isl_take PW
*pw2
)
575 return FN(PW
,align_params_pw_pw_and
)(pw1
, pw2
,
576 &FN(PW
,add_disjoint_aligned
));
579 /* This function is currently only used from isl_aff.c
581 static __isl_give PW
*FN(PW
,on_shared_domain_in
)(__isl_take PW
*pw1
,
582 __isl_take PW
*pw2
, __isl_take isl_space
*space
,
583 __isl_give EL
*(*fn
)(__isl_take EL
*el1
, __isl_take EL
*el2
))
584 __attribute__ ((unused
));
586 /* Apply "fn" to pairs of elements from pw1 and pw2 on shared domains.
587 * The result of "fn" (and therefore also of this function) lives in "space".
589 static __isl_give PW
*FN(PW
,on_shared_domain_in
)(__isl_take PW
*pw1
,
590 __isl_take PW
*pw2
, __isl_take isl_space
*space
,
591 __isl_give EL
*(*fn
)(__isl_take EL
*el1
, __isl_take EL
*el2
))
601 res
= FN(PW
,alloc_size
)(isl_space_copy(space
), pw1
->type
, n
);
603 res
= FN(PW
,alloc_size
)(isl_space_copy(space
), n
);
606 for (i
= 0; i
< pw1
->n
; ++i
) {
607 for (j
= 0; j
< pw2
->n
; ++j
) {
612 common
= isl_set_intersect(
613 isl_set_copy(pw1
->p
[i
].set
),
614 isl_set_copy(pw2
->p
[j
].set
));
615 empty
= isl_set_plain_is_empty(common
);
616 if (empty
< 0 || empty
) {
617 isl_set_free(common
);
623 res_ij
= fn(FN(EL
,copy
)(pw1
->p
[i
].FIELD
),
624 FN(EL
,copy
)(pw2
->p
[j
].FIELD
));
625 res_ij
= FN(EL
,gist
)(res_ij
, isl_set_copy(common
));
627 res
= FN(PW
,add_piece
)(res
, common
, res_ij
);
631 isl_space_free(space
);
636 isl_space_free(space
);
643 /* This function is currently only used from isl_aff.c
645 static __isl_give PW
*FN(PW
,on_shared_domain
)(__isl_take PW
*pw1
,
647 __isl_give EL
*(*fn
)(__isl_take EL
*el1
, __isl_take EL
*el2
))
648 __attribute__ ((unused
));
650 /* Apply "fn" to pairs of elements from pw1 and pw2 on shared domains.
651 * The result of "fn" is assumed to live in the same space as "pw1" and "pw2".
653 static __isl_give PW
*FN(PW
,on_shared_domain
)(__isl_take PW
*pw1
,
655 __isl_give EL
*(*fn
)(__isl_take EL
*el1
, __isl_take EL
*el2
))
662 space
= isl_space_copy(pw1
->dim
);
663 return FN(PW
,on_shared_domain_in
)(pw1
, pw2
, space
, fn
);
671 __isl_give PW
*FN(PW
,neg
)(__isl_take PW
*pw
)
678 if (FN(PW
,IS_ZERO
)(pw
))
685 for (i
= 0; i
< pw
->n
; ++i
) {
686 pw
->p
[i
].FIELD
= FN(EL
,neg
)(pw
->p
[i
].FIELD
);
688 return FN(PW
,free
)(pw
);
696 __isl_give PW
*FN(PW
,sub
)(__isl_take PW
*pw1
, __isl_take PW
*pw2
)
698 return FN(PW
,add
)(pw1
, FN(PW
,neg
)(pw2
));
703 __isl_give isl_val
*FN(PW
,eval
)(__isl_take PW
*pw
, __isl_take isl_point
*pnt
)
708 isl_space
*pnt_dim
= NULL
;
713 ctx
= isl_point_get_ctx(pnt
);
714 pnt_dim
= isl_point_get_space(pnt
);
715 isl_assert(ctx
, isl_space_is_domain_internal(pnt_dim
, pw
->dim
),
718 for (i
= 0; i
< pw
->n
; ++i
) {
719 found
= isl_set_contains_point(pw
->p
[i
].set
, pnt
);
726 v
= FN(EL
,eval
)(FN(EL
,copy
)(pw
->p
[i
].FIELD
),
727 isl_point_copy(pnt
));
729 v
= isl_val_zero(ctx
);
731 isl_space_free(pnt_dim
);
736 isl_space_free(pnt_dim
);
742 /* Return the parameter domain of "pw".
744 __isl_give isl_set
*FN(PW
,params
)(__isl_take PW
*pw
)
746 return isl_set_params(FN(PW
,domain
)(pw
));
749 __isl_give isl_set
*FN(PW
,domain
)(__isl_take PW
*pw
)
757 dom
= isl_set_empty(FN(PW
,get_domain_space
)(pw
));
758 for (i
= 0; i
< pw
->n
; ++i
)
759 dom
= isl_set_union_disjoint(dom
, isl_set_copy(pw
->p
[i
].set
));
766 /* Exploit the equalities in the domain of piece "i" of "pw"
767 * to simplify the associated function.
768 * If the domain of piece "i" is empty, then remove it entirely,
769 * replacing it with the final piece.
771 static int FN(PW
,exploit_equalities_and_remove_if_empty
)(__isl_keep PW
*pw
,
775 int empty
= isl_set_plain_is_empty(pw
->p
[i
].set
);
780 isl_set_free(pw
->p
[i
].set
);
781 FN(EL
,free
)(pw
->p
[i
].FIELD
);
783 pw
->p
[i
] = pw
->p
[pw
->n
- 1];
789 aff
= isl_set_affine_hull(isl_set_copy(pw
->p
[i
].set
));
790 pw
->p
[i
].FIELD
= FN(EL
,substitute_equalities
)(pw
->p
[i
].FIELD
, aff
);
797 /* Convert a piecewise expression defined over a parameter domain
798 * into one that is defined over a zero-dimensional set.
800 __isl_give PW
*FN(PW
,from_range
)(__isl_take PW
*pw
)
806 if (!isl_space_is_set(pw
->dim
))
807 isl_die(FN(PW
,get_ctx
)(pw
), isl_error_invalid
,
808 "not living in a set space", return FN(PW
,free
)(pw
));
810 space
= FN(PW
,get_space
)(pw
);
811 space
= isl_space_from_range(space
);
812 pw
= FN(PW
,reset_space
)(pw
, space
);
817 /* Fix the value of the given parameter or domain dimension of "pw"
818 * to be equal to "value".
820 __isl_give PW
*FN(PW
,fix_si
)(__isl_take PW
*pw
, enum isl_dim_type type
,
821 unsigned pos
, int value
)
828 if (type
== isl_dim_out
)
829 isl_die(FN(PW
,get_ctx
)(pw
), isl_error_invalid
,
830 "cannot fix output dimension", return FN(PW
,free
)(pw
));
835 if (type
== isl_dim_in
)
840 return FN(PW
,free
)(pw
);
842 for (i
= pw
->n
- 1; i
>= 0; --i
) {
843 pw
->p
[i
].set
= isl_set_fix_si(pw
->p
[i
].set
, type
, pos
, value
);
844 if (FN(PW
,exploit_equalities_and_remove_if_empty
)(pw
, i
) < 0)
845 return FN(PW
,free
)(pw
);
851 /* Restrict the domain of "pw" by combining each cell
852 * with "set" through a call to "fn", where "fn" may be
853 * isl_set_intersect, isl_set_intersect_params or isl_set_subtract.
855 static __isl_give PW
*FN(PW
,restrict_domain_aligned
)(__isl_take PW
*pw
,
856 __isl_take isl_set
*set
,
857 __isl_give isl_set
*(*fn
)(__isl_take isl_set
*set1
,
858 __isl_take isl_set
*set2
))
874 for (i
= pw
->n
- 1; i
>= 0; --i
) {
875 pw
->p
[i
].set
= fn(pw
->p
[i
].set
, isl_set_copy(set
));
876 if (FN(PW
,exploit_equalities_and_remove_if_empty
)(pw
, i
) < 0)
888 static __isl_give PW
*FN(PW
,intersect_domain_aligned
)(__isl_take PW
*pw
,
889 __isl_take isl_set
*set
)
891 return FN(PW
,restrict_domain_aligned
)(pw
, set
, &isl_set_intersect
);
894 __isl_give PW
*FN(PW
,intersect_domain
)(__isl_take PW
*pw
,
895 __isl_take isl_set
*context
)
897 return FN(PW
,align_params_pw_set_and
)(pw
, context
,
898 &FN(PW
,intersect_domain_aligned
));
901 static __isl_give PW
*FN(PW
,intersect_params_aligned
)(__isl_take PW
*pw
,
902 __isl_take isl_set
*set
)
904 return FN(PW
,restrict_domain_aligned
)(pw
, set
,
905 &isl_set_intersect_params
);
908 /* Intersect the domain of "pw" with the parameter domain "context".
910 __isl_give PW
*FN(PW
,intersect_params
)(__isl_take PW
*pw
,
911 __isl_take isl_set
*context
)
913 return FN(PW
,align_params_pw_set_and
)(pw
, context
,
914 &FN(PW
,intersect_params_aligned
));
917 /* Subtract "domain' from the domain of "pw", assuming their
918 * parameters have been aligned.
920 static __isl_give PW
*FN(PW
,subtract_domain_aligned
)(__isl_take PW
*pw
,
921 __isl_take isl_set
*domain
)
923 return FN(PW
,restrict_domain_aligned
)(pw
, domain
, &isl_set_subtract
);
926 /* Subtract "domain' from the domain of "pw".
928 __isl_give PW
*FN(PW
,subtract_domain
)(__isl_take PW
*pw
,
929 __isl_take isl_set
*domain
)
931 return FN(PW
,align_params_pw_set_and
)(pw
, domain
,
932 &FN(PW
,subtract_domain_aligned
));
935 /* Compute the gist of "pw" with respect to the domain constraints
936 * of "context" for the case where the domain of the last element
937 * of "pw" is equal to "context".
938 * Call "fn_el" to compute the gist of this element, replace
939 * its domain by the universe and drop all other elements
940 * as their domains are necessarily disjoint from "context".
942 static __isl_give PW
*FN(PW
,gist_last
)(__isl_take PW
*pw
,
943 __isl_take isl_set
*context
,
944 __isl_give EL
*(*fn_el
)(__isl_take EL
*el
, __isl_take isl_set
*set
))
949 for (i
= 0; i
< pw
->n
- 1; ++i
) {
950 isl_set_free(pw
->p
[i
].set
);
951 FN(EL
,free
)(pw
->p
[i
].FIELD
);
953 pw
->p
[0].FIELD
= pw
->p
[pw
->n
- 1].FIELD
;
954 pw
->p
[0].set
= pw
->p
[pw
->n
- 1].set
;
957 space
= isl_set_get_space(context
);
958 pw
->p
[0].FIELD
= fn_el(pw
->p
[0].FIELD
, context
);
959 context
= isl_set_universe(space
);
960 isl_set_free(pw
->p
[0].set
);
961 pw
->p
[0].set
= context
;
963 if (!pw
->p
[0].FIELD
|| !pw
->p
[0].set
)
964 return FN(PW
,free
)(pw
);
969 /* Compute the gist of "pw" with respect to the domain constraints
970 * of "context". Call "fn_el" to compute the gist of the elements
971 * and "fn_dom" to compute the gist of the domains.
973 * If the piecewise expression is empty or the context is the universe,
974 * then nothing can be simplified.
976 static __isl_give PW
*FN(PW
,gist_aligned
)(__isl_take PW
*pw
,
977 __isl_take isl_set
*context
,
978 __isl_give EL
*(*fn_el
)(__isl_take EL
*el
,
979 __isl_take isl_set
*set
),
980 __isl_give isl_set
*(*fn_dom
)(__isl_take isl_set
*set
,
981 __isl_take isl_basic_set
*bset
))
986 isl_basic_set
*hull
= NULL
;
992 isl_set_free(context
);
996 is_universe
= isl_set_plain_is_universe(context
);
1000 isl_set_free(context
);
1004 aligned
= isl_set_space_has_equal_params(context
, pw
->dim
);
1008 pw
= FN(PW
,align_params
)(pw
, isl_set_get_space(context
));
1009 context
= isl_set_align_params(context
, FN(PW
,get_space
)(pw
));
1012 pw
= FN(PW
,cow
)(pw
);
1019 equal
= isl_set_plain_is_equal(pw
->p
[0].set
, context
);
1023 return FN(PW
,gist_last
)(pw
, context
, fn_el
);
1026 context
= isl_set_compute_divs(context
);
1027 hull
= isl_set_simple_hull(isl_set_copy(context
));
1029 for (i
= pw
->n
- 1; i
>= 0; --i
) {
1033 if (i
== pw
->n
- 1) {
1035 equal
= isl_set_plain_is_equal(pw
->p
[i
].set
, context
);
1039 isl_basic_set_free(hull
);
1040 return FN(PW
,gist_last
)(pw
, context
, fn_el
);
1043 set_i
= isl_set_intersect(isl_set_copy(pw
->p
[i
].set
),
1044 isl_set_copy(context
));
1045 empty
= isl_set_plain_is_empty(set_i
);
1046 pw
->p
[i
].FIELD
= fn_el(pw
->p
[i
].FIELD
, set_i
);
1047 pw
->p
[i
].set
= fn_dom(pw
->p
[i
].set
, isl_basic_set_copy(hull
));
1048 if (empty
< 0 || !pw
->p
[i
].FIELD
|| !pw
->p
[i
].set
)
1051 isl_set_free(pw
->p
[i
].set
);
1052 FN(EL
,free
)(pw
->p
[i
].FIELD
);
1054 pw
->p
[i
] = pw
->p
[pw
->n
- 1];
1059 isl_basic_set_free(hull
);
1060 isl_set_free(context
);
1065 isl_basic_set_free(hull
);
1066 isl_set_free(context
);
1070 static __isl_give PW
*FN(PW
,gist_domain_aligned
)(__isl_take PW
*pw
,
1071 __isl_take isl_set
*set
)
1073 return FN(PW
,gist_aligned
)(pw
, set
, &FN(EL
,gist
),
1074 &isl_set_gist_basic_set
);
1077 __isl_give PW
*FN(PW
,gist
)(__isl_take PW
*pw
, __isl_take isl_set
*context
)
1079 return FN(PW
,align_params_pw_set_and
)(pw
, context
,
1080 &FN(PW
,gist_domain_aligned
));
1083 static __isl_give PW
*FN(PW
,gist_params_aligned
)(__isl_take PW
*pw
,
1084 __isl_take isl_set
*set
)
1086 return FN(PW
,gist_aligned
)(pw
, set
, &FN(EL
,gist_params
),
1087 &isl_set_gist_params_basic_set
);
1090 __isl_give PW
*FN(PW
,gist_params
)(__isl_take PW
*pw
,
1091 __isl_take isl_set
*context
)
1093 return FN(PW
,align_params_pw_set_and
)(pw
, context
,
1094 &FN(PW
,gist_params_aligned
));
1097 /* Return -1 if the piece "p1" should be sorted before "p2"
1098 * and 1 if it should be sorted after "p2".
1099 * Return 0 if they do not need to be sorted in a specific order.
1101 * The two pieces are compared on the basis of their function value expressions.
1103 static int FN(PW
,sort_field_cmp
)(const void *p1
, const void *p2
, void *arg
)
1105 struct FN(PW
,piece
) const *pc1
= p1
;
1106 struct FN(PW
,piece
) const *pc2
= p2
;
1108 return FN(EL
,plain_cmp
)(pc1
->FIELD
, pc2
->FIELD
);
1111 /* Sort the pieces of "pw" according to their function value
1112 * expressions and then combine pairs of adjacent pieces with
1113 * the same such expression.
1115 * The sorting is performed in place because it does not
1116 * change the meaning of "pw", but care needs to be
1117 * taken not to change any possible other copies of "pw"
1118 * in case anything goes wrong.
1120 __isl_give PW
*FN(PW
,sort
)(__isl_take PW
*pw
)
1129 if (isl_sort(pw
->p
, pw
->n
, sizeof(pw
->p
[0]),
1130 &FN(PW
,sort_field_cmp
), NULL
) < 0)
1131 return FN(PW
,free
)(pw
);
1132 for (i
= pw
->n
- 1; i
>= 1; --i
) {
1133 if (!FN(EL
,plain_is_equal
)(pw
->p
[i
- 1].FIELD
, pw
->p
[i
].FIELD
))
1135 set
= isl_set_union(isl_set_copy(pw
->p
[i
- 1].set
),
1136 isl_set_copy(pw
->p
[i
].set
));
1138 return FN(PW
,free
)(pw
);
1139 isl_set_free(pw
->p
[i
].set
);
1140 FN(EL
,free
)(pw
->p
[i
].FIELD
);
1141 isl_set_free(pw
->p
[i
- 1].set
);
1142 pw
->p
[i
- 1].set
= set
;
1143 for (j
= i
+ 1; j
< pw
->n
; ++j
)
1144 pw
->p
[j
- 1] = pw
->p
[j
];
1151 /* Coalesce the domains of "pw".
1153 * Prior to the actual coalescing, first sort the pieces such that
1154 * pieces with the same function value expression are combined
1155 * into a single piece, the combined domain of which can then
1158 __isl_give PW
*FN(PW
,coalesce
)(__isl_take PW
*pw
)
1162 pw
= FN(PW
,sort
)(pw
);
1166 for (i
= 0; i
< pw
->n
; ++i
) {
1167 pw
->p
[i
].set
= isl_set_coalesce(pw
->p
[i
].set
);
1178 isl_ctx
*FN(PW
,get_ctx
)(__isl_keep PW
*pw
)
1180 return pw
? isl_space_get_ctx(pw
->dim
) : NULL
;
1183 #ifndef NO_INVOLVES_DIMS
1184 isl_bool
FN(PW
,involves_dims
)(__isl_keep PW
*pw
, enum isl_dim_type type
,
1185 unsigned first
, unsigned n
)
1188 enum isl_dim_type set_type
;
1191 return isl_bool_error
;
1192 if (pw
->n
== 0 || n
== 0)
1193 return isl_bool_false
;
1195 set_type
= type
== isl_dim_in
? isl_dim_set
: type
;
1197 for (i
= 0; i
< pw
->n
; ++i
) {
1198 isl_bool involves
= FN(EL
,involves_dims
)(pw
->p
[i
].FIELD
,
1200 if (involves
< 0 || involves
)
1202 involves
= isl_set_involves_dims(pw
->p
[i
].set
,
1203 set_type
, first
, n
);
1204 if (involves
< 0 || involves
)
1207 return isl_bool_false
;
1211 __isl_give PW
*FN(PW
,set_dim_name
)(__isl_take PW
*pw
,
1212 enum isl_dim_type type
, unsigned pos
, const char *s
)
1215 enum isl_dim_type set_type
;
1217 pw
= FN(PW
,cow
)(pw
);
1221 set_type
= type
== isl_dim_in
? isl_dim_set
: type
;
1223 pw
->dim
= isl_space_set_dim_name(pw
->dim
, type
, pos
, s
);
1227 for (i
= 0; i
< pw
->n
; ++i
) {
1228 pw
->p
[i
].set
= isl_set_set_dim_name(pw
->p
[i
].set
,
1232 pw
->p
[i
].FIELD
= FN(EL
,set_dim_name
)(pw
->p
[i
].FIELD
, type
, pos
, s
);
1233 if (!pw
->p
[i
].FIELD
)
1243 #ifndef NO_DROP_DIMS
1244 __isl_give PW
*FN(PW
,drop_dims
)(__isl_take PW
*pw
,
1245 enum isl_dim_type type
, unsigned first
, unsigned n
)
1248 enum isl_dim_type set_type
;
1252 if (n
== 0 && !isl_space_get_tuple_name(pw
->dim
, type
))
1255 set_type
= type
== isl_dim_in
? isl_dim_set
: type
;
1257 pw
= FN(PW
,cow
)(pw
);
1260 pw
->dim
= isl_space_drop_dims(pw
->dim
, type
, first
, n
);
1263 for (i
= 0; i
< pw
->n
; ++i
) {
1264 pw
->p
[i
].FIELD
= FN(EL
,drop_dims
)(pw
->p
[i
].FIELD
, type
, first
, n
);
1265 if (!pw
->p
[i
].FIELD
)
1267 if (type
== isl_dim_out
)
1269 pw
->p
[i
].set
= isl_set_drop(pw
->p
[i
].set
, set_type
, first
, n
);
1280 /* This function is very similar to drop_dims.
1281 * The only difference is that the cells may still involve
1282 * the specified dimensions. They are removed using
1283 * isl_set_project_out instead of isl_set_drop.
1285 __isl_give PW
*FN(PW
,project_out
)(__isl_take PW
*pw
,
1286 enum isl_dim_type type
, unsigned first
, unsigned n
)
1289 enum isl_dim_type set_type
;
1293 if (n
== 0 && !isl_space_get_tuple_name(pw
->dim
, type
))
1296 set_type
= type
== isl_dim_in
? isl_dim_set
: type
;
1298 pw
= FN(PW
,cow
)(pw
);
1301 pw
->dim
= isl_space_drop_dims(pw
->dim
, type
, first
, n
);
1304 for (i
= 0; i
< pw
->n
; ++i
) {
1305 pw
->p
[i
].set
= isl_set_project_out(pw
->p
[i
].set
,
1306 set_type
, first
, n
);
1309 pw
->p
[i
].FIELD
= FN(EL
,drop_dims
)(pw
->p
[i
].FIELD
, type
, first
, n
);
1310 if (!pw
->p
[i
].FIELD
)
1320 /* Project the domain of pw onto its parameter space.
1322 __isl_give PW
*FN(PW
,project_domain_on_params
)(__isl_take PW
*pw
)
1327 n
= FN(PW
,dim
)(pw
, isl_dim_in
);
1328 pw
= FN(PW
,project_out
)(pw
, isl_dim_in
, 0, n
);
1329 space
= FN(PW
,get_domain_space
)(pw
);
1330 space
= isl_space_params(space
);
1331 pw
= FN(PW
,reset_domain_space
)(pw
, space
);
1336 #ifndef NO_INSERT_DIMS
1337 __isl_give PW
*FN(PW
,insert_dims
)(__isl_take PW
*pw
, enum isl_dim_type type
,
1338 unsigned first
, unsigned n
)
1341 enum isl_dim_type set_type
;
1345 if (n
== 0 && !isl_space_is_named_or_nested(pw
->dim
, type
))
1348 set_type
= type
== isl_dim_in
? isl_dim_set
: type
;
1350 pw
= FN(PW
,cow
)(pw
);
1354 pw
->dim
= isl_space_insert_dims(pw
->dim
, type
, first
, n
);
1358 for (i
= 0; i
< pw
->n
; ++i
) {
1359 pw
->p
[i
].set
= isl_set_insert_dims(pw
->p
[i
].set
,
1360 set_type
, first
, n
);
1363 pw
->p
[i
].FIELD
= FN(EL
,insert_dims
)(pw
->p
[i
].FIELD
,
1365 if (!pw
->p
[i
].FIELD
)
1376 __isl_give PW
*FN(PW
,fix_dim
)(__isl_take PW
*pw
,
1377 enum isl_dim_type type
, unsigned pos
, isl_int v
)
1384 if (type
== isl_dim_in
)
1387 pw
= FN(PW
,cow
)(pw
);
1390 for (i
= 0; i
< pw
->n
; ++i
) {
1391 pw
->p
[i
].set
= isl_set_fix(pw
->p
[i
].set
, type
, pos
, v
);
1392 if (FN(PW
,exploit_equalities_and_remove_if_empty
)(pw
, i
) < 0)
1393 return FN(PW
,free
)(pw
);
1399 /* Fix the value of the variable at position "pos" of type "type" of "pw"
1400 * to be equal to "v".
1402 __isl_give PW
*FN(PW
,fix_val
)(__isl_take PW
*pw
,
1403 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
1406 return FN(PW
,free
)(pw
);
1407 if (!isl_val_is_int(v
))
1408 isl_die(FN(PW
,get_ctx
)(pw
), isl_error_invalid
,
1409 "expecting integer value", goto error
);
1411 pw
= FN(PW
,fix_dim
)(pw
, type
, pos
, v
->n
);
1417 return FN(PW
,free
)(pw
);
1420 unsigned FN(PW
,dim
)(__isl_keep PW
*pw
, enum isl_dim_type type
)
1422 return pw
? isl_space_dim(pw
->dim
, type
) : 0;
1425 __isl_give PW
*FN(PW
,split_dims
)(__isl_take PW
*pw
,
1426 enum isl_dim_type type
, unsigned first
, unsigned n
)
1435 if (type
== isl_dim_in
)
1438 pw
= FN(PW
,cow
)(pw
);
1443 for (i
= 0; i
< pw
->n
; ++i
) {
1444 pw
->p
[i
].set
= isl_set_split_dims(pw
->p
[i
].set
, type
, first
, n
);
1456 /* Compute the maximal value attained by the piecewise quasipolynomial
1457 * on its domain or zero if the domain is empty.
1458 * In the worst case, the domain is scanned completely,
1459 * so the domain is assumed to be bounded.
1461 __isl_give isl_val
*FN(PW
,opt
)(__isl_take PW
*pw
, int max
)
1470 opt
= isl_val_zero(FN(PW
,get_ctx
)(pw
));
1475 opt
= FN(EL
,opt_on_domain
)(FN(EL
,copy
)(pw
->p
[0].FIELD
),
1476 isl_set_copy(pw
->p
[0].set
), max
);
1477 for (i
= 1; i
< pw
->n
; ++i
) {
1479 opt_i
= FN(EL
,opt_on_domain
)(FN(EL
,copy
)(pw
->p
[i
].FIELD
),
1480 isl_set_copy(pw
->p
[i
].set
), max
);
1482 opt
= isl_val_max(opt
, opt_i
);
1484 opt
= isl_val_min(opt
, opt_i
);
1491 __isl_give isl_val
*FN(PW
,max
)(__isl_take PW
*pw
)
1493 return FN(PW
,opt
)(pw
, 1);
1496 __isl_give isl_val
*FN(PW
,min
)(__isl_take PW
*pw
)
1498 return FN(PW
,opt
)(pw
, 0);
1502 __isl_give isl_space
*FN(PW
,get_space
)(__isl_keep PW
*pw
)
1504 return pw
? isl_space_copy(pw
->dim
) : NULL
;
1507 __isl_give isl_space
*FN(PW
,get_domain_space
)(__isl_keep PW
*pw
)
1509 return pw
? isl_space_domain(isl_space_copy(pw
->dim
)) : NULL
;
1512 /* Return the position of the dimension of the given type and name
1514 * Return -1 if no such dimension can be found.
1516 int FN(PW
,find_dim_by_name
)(__isl_keep PW
*pw
,
1517 enum isl_dim_type type
, const char *name
)
1521 return isl_space_find_dim_by_name(pw
->dim
, type
, name
);
1524 #ifndef NO_RESET_DIM
1525 /* Reset the space of "pw". Since we don't know if the elements
1526 * represent the spaces themselves or their domains, we pass along
1527 * both when we call their reset_space_and_domain.
1529 static __isl_give PW
*FN(PW
,reset_space_and_domain
)(__isl_take PW
*pw
,
1530 __isl_take isl_space
*space
, __isl_take isl_space
*domain
)
1534 pw
= FN(PW
,cow
)(pw
);
1535 if (!pw
|| !space
|| !domain
)
1538 for (i
= 0; i
< pw
->n
; ++i
) {
1539 pw
->p
[i
].set
= isl_set_reset_space(pw
->p
[i
].set
,
1540 isl_space_copy(domain
));
1543 pw
->p
[i
].FIELD
= FN(EL
,reset_space_and_domain
)(pw
->p
[i
].FIELD
,
1544 isl_space_copy(space
), isl_space_copy(domain
));
1545 if (!pw
->p
[i
].FIELD
)
1549 isl_space_free(domain
);
1551 isl_space_free(pw
->dim
);
1556 isl_space_free(domain
);
1557 isl_space_free(space
);
1562 __isl_give PW
*FN(PW
,reset_domain_space
)(__isl_take PW
*pw
,
1563 __isl_take isl_space
*domain
)
1567 space
= isl_space_extend_domain_with_range(isl_space_copy(domain
),
1568 FN(PW
,get_space
)(pw
));
1569 return FN(PW
,reset_space_and_domain
)(pw
, space
, domain
);
1572 __isl_give PW
*FN(PW
,reset_space
)(__isl_take PW
*pw
, __isl_take isl_space
*dim
)
1576 domain
= isl_space_domain(isl_space_copy(dim
));
1577 return FN(PW
,reset_space_and_domain
)(pw
, dim
, domain
);
1580 __isl_give PW
*FN(PW
,set_tuple_id
)(__isl_take PW
*pw
, enum isl_dim_type type
,
1581 __isl_take isl_id
*id
)
1585 pw
= FN(PW
,cow
)(pw
);
1589 space
= FN(PW
,get_space
)(pw
);
1590 space
= isl_space_set_tuple_id(space
, type
, id
);
1592 return FN(PW
,reset_space
)(pw
, space
);
1595 return FN(PW
,free
)(pw
);
1598 /* Drop the id on the specified tuple.
1600 __isl_give PW
*FN(PW
,reset_tuple_id
)(__isl_take PW
*pw
, enum isl_dim_type type
)
1606 if (!FN(PW
,has_tuple_id
)(pw
, type
))
1609 pw
= FN(PW
,cow
)(pw
);
1613 space
= FN(PW
,get_space
)(pw
);
1614 space
= isl_space_reset_tuple_id(space
, type
);
1616 return FN(PW
,reset_space
)(pw
, space
);
1619 __isl_give PW
*FN(PW
,set_dim_id
)(__isl_take PW
*pw
,
1620 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
1622 pw
= FN(PW
,cow
)(pw
);
1625 pw
->dim
= isl_space_set_dim_id(pw
->dim
, type
, pos
, id
);
1626 return FN(PW
,reset_space
)(pw
, isl_space_copy(pw
->dim
));
1629 return FN(PW
,free
)(pw
);
1633 /* Reset the user pointer on all identifiers of parameters and tuples
1634 * of the space of "pw".
1636 __isl_give PW
*FN(PW
,reset_user
)(__isl_take PW
*pw
)
1640 space
= FN(PW
,get_space
)(pw
);
1641 space
= isl_space_reset_user(space
);
1643 return FN(PW
,reset_space
)(pw
, space
);
1646 isl_bool
FN(PW
,has_equal_space
)(__isl_keep PW
*pw1
, __isl_keep PW
*pw2
)
1649 return isl_bool_error
;
1651 return isl_space_is_equal(pw1
->dim
, pw2
->dim
);
1655 __isl_give PW
*FN(PW
,morph_domain
)(__isl_take PW
*pw
,
1656 __isl_take isl_morph
*morph
)
1664 ctx
= isl_space_get_ctx(pw
->dim
);
1665 isl_assert(ctx
, isl_space_is_domain_internal(morph
->dom
->dim
, pw
->dim
),
1668 pw
= FN(PW
,cow
)(pw
);
1671 pw
->dim
= isl_space_extend_domain_with_range(
1672 isl_space_copy(morph
->ran
->dim
), pw
->dim
);
1676 for (i
= 0; i
< pw
->n
; ++i
) {
1677 pw
->p
[i
].set
= isl_morph_set(isl_morph_copy(morph
), pw
->p
[i
].set
);
1680 pw
->p
[i
].FIELD
= FN(EL
,morph_domain
)(pw
->p
[i
].FIELD
,
1681 isl_morph_copy(morph
));
1682 if (!pw
->p
[i
].FIELD
)
1686 isl_morph_free(morph
);
1691 isl_morph_free(morph
);
1696 int FN(PW
,n_piece
)(__isl_keep PW
*pw
)
1698 return pw
? pw
->n
: 0;
1701 isl_stat
FN(PW
,foreach_piece
)(__isl_keep PW
*pw
,
1702 isl_stat (*fn
)(__isl_take isl_set
*set
, __isl_take EL
*el
, void *user
),
1708 return isl_stat_error
;
1710 for (i
= 0; i
< pw
->n
; ++i
)
1711 if (fn(isl_set_copy(pw
->p
[i
].set
),
1712 FN(EL
,copy
)(pw
->p
[i
].FIELD
), user
) < 0)
1713 return isl_stat_error
;
1719 static isl_bool
any_divs(__isl_keep isl_set
*set
)
1724 return isl_bool_error
;
1726 for (i
= 0; i
< set
->n
; ++i
)
1727 if (set
->p
[i
]->n_div
> 0)
1728 return isl_bool_true
;
1730 return isl_bool_false
;
1733 static isl_stat
foreach_lifted_subset(__isl_take isl_set
*set
,
1735 isl_stat (*fn
)(__isl_take isl_set
*set
, __isl_take EL
*el
,
1736 void *user
), void *user
)
1743 for (i
= 0; i
< set
->n
; ++i
) {
1747 lift
= isl_set_from_basic_set(isl_basic_set_copy(set
->p
[i
]));
1748 lift
= isl_set_lift(lift
);
1750 copy
= FN(EL
,copy
)(el
);
1751 copy
= FN(EL
,lift
)(copy
, isl_set_get_space(lift
));
1753 if (fn(lift
, copy
, user
) < 0)
1764 return isl_stat_error
;
1767 isl_stat
FN(PW
,foreach_lifted_piece
)(__isl_keep PW
*pw
,
1768 isl_stat (*fn
)(__isl_take isl_set
*set
, __isl_take EL
*el
,
1769 void *user
), void *user
)
1774 return isl_stat_error
;
1776 for (i
= 0; i
< pw
->n
; ++i
) {
1781 any
= any_divs(pw
->p
[i
].set
);
1783 return isl_stat_error
;
1784 set
= isl_set_copy(pw
->p
[i
].set
);
1785 el
= FN(EL
,copy
)(pw
->p
[i
].FIELD
);
1787 if (fn(set
, el
, user
) < 0)
1788 return isl_stat_error
;
1791 if (foreach_lifted_subset(set
, el
, fn
, user
) < 0)
1792 return isl_stat_error
;
1799 #ifndef NO_MOVE_DIMS
1800 __isl_give PW
*FN(PW
,move_dims
)(__isl_take PW
*pw
,
1801 enum isl_dim_type dst_type
, unsigned dst_pos
,
1802 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
1806 pw
= FN(PW
,cow
)(pw
);
1810 pw
->dim
= isl_space_move_dims(pw
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
1814 for (i
= 0; i
< pw
->n
; ++i
) {
1815 pw
->p
[i
].FIELD
= FN(EL
,move_dims
)(pw
->p
[i
].FIELD
,
1816 dst_type
, dst_pos
, src_type
, src_pos
, n
);
1817 if (!pw
->p
[i
].FIELD
)
1821 if (dst_type
== isl_dim_in
)
1822 dst_type
= isl_dim_set
;
1823 if (src_type
== isl_dim_in
)
1824 src_type
= isl_dim_set
;
1826 for (i
= 0; i
< pw
->n
; ++i
) {
1827 pw
->p
[i
].set
= isl_set_move_dims(pw
->p
[i
].set
,
1829 src_type
, src_pos
, n
);
1841 __isl_give PW
*FN(PW
,mul_isl_int
)(__isl_take PW
*pw
, isl_int v
)
1845 if (isl_int_is_one(v
))
1847 if (pw
&& DEFAULT_IS_ZERO
&& isl_int_is_zero(v
)) {
1849 isl_space
*dim
= FN(PW
,get_space
)(pw
);
1851 zero
= FN(PW
,ZERO
)(dim
, pw
->type
);
1853 zero
= FN(PW
,ZERO
)(dim
);
1858 pw
= FN(PW
,cow
)(pw
);
1865 if (isl_int_is_neg(v
))
1866 pw
->type
= isl_fold_type_negate(pw
->type
);
1868 for (i
= 0; i
< pw
->n
; ++i
) {
1869 pw
->p
[i
].FIELD
= FN(EL
,scale
)(pw
->p
[i
].FIELD
, v
);
1870 if (!pw
->p
[i
].FIELD
)
1880 /* Multiply the pieces of "pw" by "v" and return the result.
1882 __isl_give PW
*FN(PW
,scale_val
)(__isl_take PW
*pw
, __isl_take isl_val
*v
)
1889 if (isl_val_is_one(v
)) {
1893 if (pw
&& DEFAULT_IS_ZERO
&& isl_val_is_zero(v
)) {
1895 isl_space
*space
= FN(PW
,get_space
)(pw
);
1897 zero
= FN(PW
,ZERO
)(space
, pw
->type
);
1899 zero
= FN(PW
,ZERO
)(space
);
1909 pw
= FN(PW
,cow
)(pw
);
1914 if (isl_val_is_neg(v
))
1915 pw
->type
= isl_fold_type_negate(pw
->type
);
1917 for (i
= 0; i
< pw
->n
; ++i
) {
1918 pw
->p
[i
].FIELD
= FN(EL
,scale_val
)(pw
->p
[i
].FIELD
,
1920 if (!pw
->p
[i
].FIELD
)
1932 /* Divide the pieces of "pw" by "v" and return the result.
1934 __isl_give PW
*FN(PW
,scale_down_val
)(__isl_take PW
*pw
, __isl_take isl_val
*v
)
1941 if (isl_val_is_one(v
)) {
1946 if (!isl_val_is_rat(v
))
1947 isl_die(isl_val_get_ctx(v
), isl_error_invalid
,
1948 "expecting rational factor", goto error
);
1949 if (isl_val_is_zero(v
))
1950 isl_die(isl_val_get_ctx(v
), isl_error_invalid
,
1951 "cannot scale down by zero", goto error
);
1957 pw
= FN(PW
,cow
)(pw
);
1962 if (isl_val_is_neg(v
))
1963 pw
->type
= isl_fold_type_negate(pw
->type
);
1965 for (i
= 0; i
< pw
->n
; ++i
) {
1966 pw
->p
[i
].FIELD
= FN(EL
,scale_down_val
)(pw
->p
[i
].FIELD
,
1968 if (!pw
->p
[i
].FIELD
)
1980 __isl_give PW
*FN(PW
,scale
)(__isl_take PW
*pw
, isl_int v
)
1982 return FN(PW
,mul_isl_int
)(pw
, v
);
1985 /* Apply some normalization to "pw".
1986 * In particular, sort the pieces according to their function value
1987 * expressions, combining pairs of adjacent pieces with
1988 * the same such expression, and then normalize the domains of the pieces.
1990 * We normalize in place, but if anything goes wrong we need
1991 * to return NULL, so we need to make sure we don't change the
1992 * meaning of any possible other copies of "pw".
1994 __isl_give PW
*FN(PW
,normalize
)(__isl_take PW
*pw
)
1999 pw
= FN(PW
,sort
)(pw
);
2002 for (i
= 0; i
< pw
->n
; ++i
) {
2003 set
= isl_set_normalize(isl_set_copy(pw
->p
[i
].set
));
2005 return FN(PW
,free
)(pw
);
2006 isl_set_free(pw
->p
[i
].set
);
2013 /* Is pw1 obviously equal to pw2?
2014 * That is, do they have obviously identical cells and obviously identical
2015 * elements on each cell?
2017 * If "pw1" or "pw2" contain any NaNs, then they are considered
2018 * not to be the same. A NaN is not equal to anything, not even
2021 isl_bool
FN(PW
,plain_is_equal
)(__isl_keep PW
*pw1
, __isl_keep PW
*pw2
)
2024 isl_bool equal
, has_nan
;
2027 return isl_bool_error
;
2029 has_nan
= FN(PW
,involves_nan
)(pw1
);
2030 if (has_nan
>= 0 && !has_nan
)
2031 has_nan
= FN(PW
,involves_nan
)(pw2
);
2032 if (has_nan
< 0 || has_nan
)
2033 return isl_bool_not(has_nan
);
2036 return isl_bool_true
;
2037 if (!isl_space_is_equal(pw1
->dim
, pw2
->dim
))
2038 return isl_bool_false
;
2040 pw1
= FN(PW
,copy
)(pw1
);
2041 pw2
= FN(PW
,copy
)(pw2
);
2042 pw1
= FN(PW
,normalize
)(pw1
);
2043 pw2
= FN(PW
,normalize
)(pw2
);
2047 equal
= pw1
->n
== pw2
->n
;
2048 for (i
= 0; equal
&& i
< pw1
->n
; ++i
) {
2049 equal
= isl_set_plain_is_equal(pw1
->p
[i
].set
, pw2
->p
[i
].set
);
2054 equal
= FN(EL
,plain_is_equal
)(pw1
->p
[i
].FIELD
, pw2
->p
[i
].FIELD
);
2065 return isl_bool_error
;
2068 /* Does "pw" involve any NaNs?
2070 isl_bool
FN(PW
,involves_nan
)(__isl_keep PW
*pw
)
2075 return isl_bool_error
;
2077 return isl_bool_false
;
2079 for (i
= 0; i
< pw
->n
; ++i
) {
2080 isl_bool has_nan
= FN(EL
,involves_nan
)(pw
->p
[i
].FIELD
);
2081 if (has_nan
< 0 || has_nan
)
2085 return isl_bool_false
;
2089 static __isl_give PW
*FN(PW
,align_params_pw_multi_aff_and
)(__isl_take PW
*pw
,
2090 __isl_take isl_multi_aff
*ma
,
2091 __isl_give PW
*(*fn
)(__isl_take PW
*pw
, __isl_take isl_multi_aff
*ma
))
2094 isl_bool equal_params
;
2095 isl_space
*ma_space
;
2097 ma_space
= isl_multi_aff_get_space(ma
);
2098 if (!pw
|| !ma
|| !ma_space
)
2100 equal_params
= isl_space_has_equal_params(pw
->dim
, ma_space
);
2101 if (equal_params
< 0)
2104 isl_space_free(ma_space
);
2107 ctx
= FN(PW
,get_ctx
)(pw
);
2108 if (!isl_space_has_named_params(pw
->dim
) ||
2109 !isl_space_has_named_params(ma_space
))
2110 isl_die(ctx
, isl_error_invalid
,
2111 "unaligned unnamed parameters", goto error
);
2112 pw
= FN(PW
,align_params
)(pw
, ma_space
);
2113 ma
= isl_multi_aff_align_params(ma
, FN(PW
,get_space
)(pw
));
2116 isl_space_free(ma_space
);
2118 isl_multi_aff_free(ma
);
2122 static __isl_give PW
*FN(PW
,align_params_pw_pw_multi_aff_and
)(__isl_take PW
*pw
,
2123 __isl_take isl_pw_multi_aff
*pma
,
2124 __isl_give PW
*(*fn
)(__isl_take PW
*pw
,
2125 __isl_take isl_pw_multi_aff
*ma
))
2128 isl_bool equal_params
;
2129 isl_space
*pma_space
;
2131 pma_space
= isl_pw_multi_aff_get_space(pma
);
2132 if (!pw
|| !pma
|| !pma_space
)
2134 equal_params
= isl_space_has_equal_params(pw
->dim
, pma_space
);
2135 if (equal_params
< 0)
2138 isl_space_free(pma_space
);
2141 ctx
= FN(PW
,get_ctx
)(pw
);
2142 if (!isl_space_has_named_params(pw
->dim
) ||
2143 !isl_space_has_named_params(pma_space
))
2144 isl_die(ctx
, isl_error_invalid
,
2145 "unaligned unnamed parameters", goto error
);
2146 pw
= FN(PW
,align_params
)(pw
, pma_space
);
2147 pma
= isl_pw_multi_aff_align_params(pma
, FN(PW
,get_space
)(pw
));
2150 isl_space_free(pma_space
);
2152 isl_pw_multi_aff_free(pma
);
2156 /* Compute the pullback of "pw" by the function represented by "ma".
2157 * In other words, plug in "ma" in "pw".
2159 static __isl_give PW
*FN(PW
,pullback_multi_aff_aligned
)(__isl_take PW
*pw
,
2160 __isl_take isl_multi_aff
*ma
)
2163 isl_space
*space
= NULL
;
2165 ma
= isl_multi_aff_align_divs(ma
);
2166 pw
= FN(PW
,cow
)(pw
);
2170 space
= isl_space_join(isl_multi_aff_get_space(ma
),
2171 FN(PW
,get_space
)(pw
));
2173 for (i
= 0; i
< pw
->n
; ++i
) {
2174 pw
->p
[i
].set
= isl_set_preimage_multi_aff(pw
->p
[i
].set
,
2175 isl_multi_aff_copy(ma
));
2178 pw
->p
[i
].FIELD
= FN(EL
,pullback_multi_aff
)(pw
->p
[i
].FIELD
,
2179 isl_multi_aff_copy(ma
));
2180 if (!pw
->p
[i
].FIELD
)
2184 pw
= FN(PW
,reset_space
)(pw
, space
);
2185 isl_multi_aff_free(ma
);
2188 isl_space_free(space
);
2189 isl_multi_aff_free(ma
);
2194 __isl_give PW
*FN(PW
,pullback_multi_aff
)(__isl_take PW
*pw
,
2195 __isl_take isl_multi_aff
*ma
)
2197 return FN(PW
,align_params_pw_multi_aff_and
)(pw
, ma
,
2198 &FN(PW
,pullback_multi_aff_aligned
));
2201 /* Compute the pullback of "pw" by the function represented by "pma".
2202 * In other words, plug in "pma" in "pw".
2204 static __isl_give PW
*FN(PW
,pullback_pw_multi_aff_aligned
)(__isl_take PW
*pw
,
2205 __isl_take isl_pw_multi_aff
*pma
)
2215 space
= isl_space_join(isl_pw_multi_aff_get_space(pma
),
2216 FN(PW
,get_space
)(pw
));
2217 isl_pw_multi_aff_free(pma
);
2218 res
= FN(PW
,empty
)(space
);
2223 res
= FN(PW
,pullback_multi_aff
)(FN(PW
,copy
)(pw
),
2224 isl_multi_aff_copy(pma
->p
[0].maff
));
2225 res
= FN(PW
,intersect_domain
)(res
, isl_set_copy(pma
->p
[0].set
));
2227 for (i
= 1; i
< pma
->n
; ++i
) {
2230 res_i
= FN(PW
,pullback_multi_aff
)(FN(PW
,copy
)(pw
),
2231 isl_multi_aff_copy(pma
->p
[i
].maff
));
2232 res_i
= FN(PW
,intersect_domain
)(res_i
,
2233 isl_set_copy(pma
->p
[i
].set
));
2234 res
= FN(PW
,add_disjoint
)(res
, res_i
);
2237 isl_pw_multi_aff_free(pma
);
2241 isl_pw_multi_aff_free(pma
);
2246 __isl_give PW
*FN(PW
,pullback_pw_multi_aff
)(__isl_take PW
*pw
,
2247 __isl_take isl_pw_multi_aff
*pma
)
2249 return FN(PW
,align_params_pw_pw_multi_aff_and
)(pw
, pma
,
2250 &FN(PW
,pullback_pw_multi_aff_aligned
));