2 * Copyright 2010 INRIA Saclay
3 * Copyright 2013 Ecole Normale Superieure
5 * Use of this software is governed by the MIT license
7 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
8 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
10 * and Ecole Normale Superieure, 45 rue d'Ulm, 75230 Paris, France
16 #include "has_single_reference_templ.c"
18 __isl_give UNION
*FN(UNION
,cow
)(__isl_take UNION
*u
);
20 isl_ctx
*FN(UNION
,get_ctx
)(__isl_keep UNION
*u
)
22 return u
? u
->space
->ctx
: NULL
;
25 /* Return the space of "u".
27 static __isl_keep isl_space
*FN(UNION
,peek_space
)(__isl_keep UNION
*u
)
34 /* Return a copy of the space of "u".
36 __isl_give isl_space
*FN(UNION
,get_space
)(__isl_keep UNION
*u
)
38 return isl_space_copy(FN(UNION
,peek_space
)(u
));
41 /* Return the number of parameters of "u", where "type"
42 * is required to be set to isl_dim_param.
44 isl_size
FN(UNION
,dim
)(__isl_keep UNION
*u
, enum isl_dim_type type
)
47 return isl_size_error
;
49 if (type
!= isl_dim_param
)
50 isl_die(FN(UNION
,get_ctx
)(u
), isl_error_invalid
,
51 "can only reference parameters", return isl_size_error
);
53 return isl_space_dim(u
->space
, type
);
56 /* Return the position of the parameter with the given name
58 * Return -1 if no such dimension can be found.
60 int FN(UNION
,find_dim_by_name
)(__isl_keep UNION
*u
, enum isl_dim_type type
,
65 return isl_space_find_dim_by_name(u
->space
, type
, name
);
70 static __isl_give UNION
*FN(UNION
,alloc
)(__isl_take isl_space
*space
71 OPT_TYPE_PARAM
, int size
)
75 space
= isl_space_params(space
);
79 u
= isl_calloc_type(space
->ctx
, UNION
);
84 OPT_SET_TYPE(u
->, type
);
86 if (isl_hash_table_init(space
->ctx
, &u
->table
, size
) < 0)
87 return FN(UNION
,free
)(u
);
91 isl_space_free(space
);
95 /* Create an empty/zero union without specifying any parameters.
97 __isl_give UNION
*FN(FN(UNION
,ZERO
),ctx
)(isl_ctx
*ctx OPT_TYPE_PARAM
)
101 space
= isl_space_unit(ctx
);
102 return FN(FN(UNION
,ZERO
),space
)(space
OPT_TYPE_ARG(NO_LOC
));
105 __isl_give UNION
*FN(FN(UNION
,ZERO
),space
)(__isl_take isl_space
*space
108 return FN(UNION
,alloc
)(space
OPT_TYPE_ARG(NO_LOC
), 16);
111 /* This is an alternative name for the function above.
113 __isl_give UNION
*FN(UNION
,ZERO
)(__isl_take isl_space
*space OPT_TYPE_PARAM
)
115 return FN(FN(UNION
,ZERO
),space
)(space
OPT_TYPE_ARG(NO_LOC
));
118 __isl_give UNION
*FN(UNION
,copy
)(__isl_keep UNION
*u
)
127 /* Do the tuples of "space" correspond to those of the domain of "part"?
128 * That is, is the domain space of "part" equal to "space", ignoring parameters?
130 static isl_bool
FN(PART
,has_domain_space_tuples
)(__isl_keep PART
*part
,
131 __isl_keep isl_space
*space
)
133 return isl_space_has_domain_tuples(space
, FN(PART
,peek_space
)(part
));
136 /* Extract the element of "u" living in "space" (ignoring parameters).
138 * Return the ZERO element if "u" does not contain any element
141 __isl_give PART
*FN(FN(UNION
,extract
),BASE
)(__isl_keep UNION
*u
,
142 __isl_take isl_space
*space
)
144 struct isl_hash_table_entry
*entry
;
146 entry
= FN(UNION
,find_part_entry
)(u
, space
, 0);
149 if (entry
== isl_hash_table_entry_none
)
150 return FN(PART
,ZERO
)(space
OPT_TYPE_ARG(u
->));
151 isl_space_free(space
);
152 return FN(PART
,copy
)(entry
->data
);
154 isl_space_free(space
);
158 /* Add "part" to "u".
159 * If "disjoint" is set, then "u" is not allowed to already have
160 * a part that is defined over a domain that overlaps with the domain
162 * Otherwise, compute the union sum of "part" and the part in "u"
163 * defined on the same space.
165 static __isl_give UNION
*FN(UNION
,add_part_generic
)(__isl_take UNION
*u
,
166 __isl_take PART
*part
, int disjoint
)
169 struct isl_hash_table_entry
*entry
;
174 empty
= FN(PART
,IS_ZERO
)(part
);
182 u
= FN(UNION
,align_params
)(u
, FN(PART
,get_space
)(part
));
183 part
= FN(PART
,align_params
)(part
, FN(UNION
,get_space
)(u
));
185 u
= FN(UNION
,cow
)(u
);
190 if (FN(UNION
,check_disjoint_domain_other
)(u
, part
) < 0)
192 entry
= FN(UNION
,find_part_entry
)(u
, part
->dim
, 1);
200 FN(UNION
,check_disjoint_domain
)(entry
->data
, part
) < 0)
202 entry
->data
= FN(PART
,union_add_
)(entry
->data
,
203 FN(PART
,copy
)(part
));
204 empty
= FN(PART
,IS_ZERO
)(entry
->data
);
208 u
= FN(UNION
,remove_part_entry
)(u
, entry
);
219 /* Add "part" to "u", where "u" is assumed not to already have
220 * a part that is defined on the same space as "part".
222 __isl_give UNION
*FN(FN(UNION
,add
),BASE
)(__isl_take UNION
*u
,
223 __isl_take PART
*part
)
225 return FN(UNION
,add_part_generic
)(u
, part
, 1);
228 /* Allocate a UNION with the same type (if any) and the same size as "u" and
229 * with space "space".
231 static __isl_give UNION
*FN(UNION
,alloc_same_size_on_space
)(__isl_keep UNION
*u
,
232 __isl_take isl_space
*space
)
236 return FN(UNION
,alloc
)(space
OPT_TYPE_ARG(u
->), u
->table
.n
);
238 isl_space_free(space
);
242 /* Allocate a UNION with the same space, the same type (if any) and
243 * the same size as "u".
245 static __isl_give UNION
*FN(UNION
,alloc_same_size
)(__isl_keep UNION
*u
)
247 return FN(UNION
,alloc_same_size_on_space
)(u
, FN(UNION
,get_space
)(u
));
250 /* Data structure that specifies how isl_union_*_transform
251 * should modify the base expressions in the union expression.
253 * If "inplace" is set, then the base expression in the input union
254 * are modified in place. This means that "fn" should not
255 * change the meaning of the union or that the union only
256 * has a single reference.
257 * If "space" is not NULL, then a new union is created in this space.
258 * If "filter" is not NULL, then only the base expressions that satisfy "filter"
259 * are taken into account.
260 * "filter_user" is passed as the second argument to "filter".
261 * If "fn" it not NULL, then it is applied to each entry in the input.
262 * "fn_user" is passed as the second argument to "fn".
264 S(UNION
,transform_control
) {
267 isl_bool (*filter
)(__isl_keep PART
*part
, void *user
);
269 __isl_give PART
*(*fn
)(__isl_take PART
*part
, void *user
);
273 /* Internal data structure for isl_union_*_transform_space.
274 * "control" specifies how the base expressions should be modified.
275 * "res" collects the results (if control->inplace is not set).
277 S(UNION
,transform_data
)
279 S(UNION
,transform_control
) *control
;
283 /* Apply control->fn to "part" and add the result to data->res or
284 * place it back into the input union if control->inplace is set.
286 static isl_stat
FN(UNION
,transform_entry
)(void **entry
, void *user
)
288 S(UNION
,transform_data
) *data
= (S(UNION
,transform_data
) *)user
;
289 S(UNION
,transform_control
) *control
= data
->control
;
292 if (control
->filter
) {
295 handle
= control
->filter(part
, control
->filter_user
);
297 return isl_stat_error
;
302 if (!control
->inplace
)
303 part
= FN(PART
,copy
)(part
);
305 part
= control
->fn(part
, control
->fn_user
);
306 if (control
->inplace
)
309 data
->res
= FN(FN(UNION
,add
),BASE
)(data
->res
, part
);
310 if (!part
|| !data
->res
)
311 return isl_stat_error
;
316 /* Return a UNION that is obtained by modifying "u" according to "control".
318 static __isl_give UNION
*FN(UNION
,transform
)(__isl_take UNION
*u
,
319 S(UNION
,transform_control
) *control
)
321 S(UNION
,transform_data
) data
= { control
};
324 if (control
->inplace
) {
328 space
= isl_space_copy(control
->space
);
330 space
= FN(UNION
,get_space
)(u
);
331 data
.res
= FN(UNION
,alloc_same_size_on_space
)(u
, space
);
333 if (FN(UNION
,foreach_inplace
)(u
, &FN(UNION
,transform_entry
), &data
) < 0)
334 data
.res
= FN(UNION
,free
)(data
.res
);
335 if (!control
->inplace
)
340 /* Return a UNION living in "space" that is otherwise obtained by modifying "u"
341 * according to "control".
343 static __isl_give UNION
*FN(UNION
,transform_space
)(__isl_take UNION
*u
,
344 __isl_take isl_space
*space
, S(UNION
,transform_control
) *control
)
347 return FN(UNION
,free
)(u
);
348 control
->space
= space
;
349 u
= FN(UNION
,transform
)(u
, control
);
350 isl_space_free(space
);
354 /* Update "u" by applying "fn" to each entry.
355 * This operation is assumed not to change the number of entries nor
356 * the spaces of the entries.
358 * If there is only one reference to "u", then change "u" inplace.
359 * Otherwise, create a new UNION from "u" and discard the original.
361 static __isl_give UNION
*FN(UNION
,transform_inplace
)(__isl_take UNION
*u
,
362 __isl_give PART
*(*fn
)(__isl_take PART
*part
, void *user
), void *user
)
364 S(UNION
,transform_control
) control
= { .fn
= fn
, .fn_user
= user
};
367 single_ref
= FN(UNION
,has_single_reference
)(u
);
369 return FN(UNION
,free
)(u
);
372 return FN(UNION
,transform
)(u
, &control
);
375 /* An isl_union_*_transform callback for use in isl_union_*_dup
376 * that simply returns "part".
378 static __isl_give PART
*FN(UNION
,copy_part
)(__isl_take PART
*part
, void *user
)
383 __isl_give UNION
*FN(UNION
,dup
)(__isl_keep UNION
*u
)
385 S(UNION
,transform_control
) control
= { .fn
= &FN(UNION
,copy_part
) };
387 u
= FN(UNION
,copy
)(u
);
388 return FN(UNION
,transform
)(u
, &control
);
391 __isl_give UNION
*FN(UNION
,cow
)(__isl_take UNION
*u
)
399 return FN(UNION
,dup
)(u
);
402 __isl_null UNION
*FN(UNION
,free
)(__isl_take UNION
*u
)
410 isl_hash_table_foreach(u
->space
->ctx
, &u
->table
,
411 &FN(UNION
,free_u_entry
), NULL
);
412 isl_hash_table_clear(&u
->table
);
413 isl_space_free(u
->space
);
418 static __isl_give PART
*FN(UNION
,align_entry
)(__isl_take PART
*part
, void *user
)
420 isl_reordering
*exp
= user
;
422 exp
= isl_reordering_extend_space(isl_reordering_copy(exp
),
423 FN(PART
,get_domain_space
)(part
));
424 return FN(PART
,realign_domain
)(part
, exp
);
427 /* Reorder the parameters of "u" according to the given reordering.
429 static __isl_give UNION
*FN(UNION
,realign_domain
)(__isl_take UNION
*u
,
430 __isl_take isl_reordering
*r
)
432 S(UNION
,transform_control
) control
= {
433 .fn
= &FN(UNION
,align_entry
),
441 space
= isl_reordering_get_space(r
);
442 u
= FN(UNION
,transform_space
)(u
, space
, &control
);
443 isl_reordering_free(r
);
447 isl_reordering_free(r
);
451 /* Align the parameters of "u" to those of "model".
453 __isl_give UNION
*FN(UNION
,align_params
)(__isl_take UNION
*u
,
454 __isl_take isl_space
*model
)
457 isl_bool equal_params
;
460 space
= FN(UNION
,peek_space
)(u
);
461 equal_params
= isl_space_has_equal_params(space
, model
);
462 if (equal_params
< 0)
465 isl_space_free(model
);
469 r
= isl_parameter_alignment_reordering(space
, model
);
470 isl_space_free(model
);
472 return FN(UNION
,realign_domain
)(u
, r
);
474 isl_space_free(model
);
479 /* Add "part" to *u, taking the union sum if "u" already has
480 * a part defined on the same space as "part".
482 static isl_stat
FN(UNION
,union_add_part
)(__isl_take PART
*part
, void *user
)
484 UNION
**u
= (UNION
**)user
;
486 *u
= FN(UNION
,add_part_generic
)(*u
, part
, 0);
491 /* Compute the sum of "u1" and "u2" on the union of their domains,
492 * with the actual sum on the shared domain and
493 * the defined expression on the symmetric difference of the domains.
495 * This is an internal function that is exposed under different
496 * names depending on whether the base expressions have a zero default
498 * If they do, then this function is called "add".
499 * Otherwise, it is called "union_add".
501 static __isl_give UNION
*FN(UNION
,union_add_
)(__isl_take UNION
*u1
,
502 __isl_take UNION
*u2
)
504 u1
= FN(UNION
,align_params
)(u1
, FN(UNION
,get_space
)(u2
));
505 u2
= FN(UNION
,align_params
)(u2
, FN(UNION
,get_space
)(u1
));
507 u1
= FN(UNION
,cow
)(u1
);
512 if (FN(FN(UNION
,foreach
),BASE
)(u2
, &FN(UNION
,union_add_part
), &u1
) < 0)
526 /* Compute the sum of "u1" and "u2" on the union of their domains,
527 * with the actual sum on the shared domain and
528 * the defined expression on the symmetric difference of the domains.
530 __isl_give UNION
*FN(UNION
,union_add
)(__isl_take UNION
*u1
,
531 __isl_take UNION
*u2
)
533 return FN(UNION
,union_add_
)(u1
, u2
);
538 __isl_give UNION
*FN(FN(UNION
,from
),BASE
)(__isl_take PART
*part
)
546 space
= FN(PART
,get_space
)(part
);
547 space
= isl_space_drop_dims(space
, isl_dim_in
, 0,
548 isl_space_dim(space
, isl_dim_in
));
549 space
= isl_space_drop_dims(space
, isl_dim_out
, 0,
550 isl_space_dim(space
, isl_dim_out
));
551 u
= FN(UNION
,ZERO
)(space
OPT_TYPE_ARG(part
->));
552 u
= FN(FN(UNION
,add
),BASE
)(u
, part
);
557 /* This function performs the same operation as isl_union_pw_*_from_pw_*,
558 * but is considered as a function on an isl_pw_* when exported.
560 __isl_give UNION
*FN(FN(PART
,to_union
),BASE
)(__isl_take PART
*part
)
562 return FN(FN(UNION
,from
),BASE
)(part
);
565 S(UNION
,match_bin_data
) {
568 __isl_give PART
*(*fn
)(__isl_take PART
*, __isl_take PART
*);
571 /* Check if data->u2 has an element living in the same space as "part".
572 * If so, call data->fn on the two elements and add the result to
575 static isl_stat
FN(UNION
,match_bin_entry
)(__isl_take PART
*part
, void *user
)
577 S(UNION
,match_bin_data
) *data
= user
;
578 struct isl_hash_table_entry
*entry2
;
582 space
= FN(PART
,get_space
)(part
);
583 entry2
= FN(UNION
,find_part_entry
)(data
->u2
, space
, 0);
584 isl_space_free(space
);
587 if (entry2
== isl_hash_table_entry_none
) {
592 part2
= entry2
->data
;
593 if (!isl_space_tuple_is_equal(part
->dim
, isl_dim_out
,
594 part2
->dim
, isl_dim_out
))
595 isl_die(FN(UNION
,get_ctx
)(data
->u2
), isl_error_invalid
,
596 "entries should have the same range space",
599 part
= data
->fn(part
, FN(PART
, copy
)(entry2
->data
));
601 data
->res
= FN(FN(UNION
,add
),BASE
)(data
->res
, part
);
603 return isl_stat_error
;
608 return isl_stat_error
;
611 /* This function is currently only used from isl_polynomial.c
612 * and not from isl_fold.c.
614 static __isl_give UNION
*FN(UNION
,match_bin_op
)(__isl_take UNION
*u1
,
615 __isl_take UNION
*u2
,
616 __isl_give PART
*(*fn
)(__isl_take PART
*, __isl_take PART
*))
617 __attribute__ ((unused
));
618 /* For each pair of elements in "u1" and "u2" living in the same space,
619 * call "fn" and collect the results.
621 static __isl_give UNION
*FN(UNION
,match_bin_op
)(__isl_take UNION
*u1
,
622 __isl_take UNION
*u2
,
623 __isl_give PART
*(*fn
)(__isl_take PART
*, __isl_take PART
*))
625 S(UNION
,match_bin_data
) data
= { NULL
, NULL
, fn
};
627 u1
= FN(UNION
,align_params
)(u1
, FN(UNION
,get_space
)(u2
));
628 u2
= FN(UNION
,align_params
)(u2
, FN(UNION
,get_space
)(u1
));
634 data
.res
= FN(UNION
,alloc_same_size
)(u1
);
635 if (FN(FN(UNION
,foreach
),BASE
)(u1
,
636 &FN(UNION
,match_bin_entry
), &data
) < 0)
645 FN(UNION
,free
)(data
.res
);
649 /* Compute the sum of "u1" and "u2".
651 * If the base expressions have a default zero value, then the sum
652 * is computed on the union of the domains of "u1" and "u2".
653 * Otherwise, it is computed on their shared domains.
655 __isl_give UNION
*FN(UNION
,add
)(__isl_take UNION
*u1
, __isl_take UNION
*u2
)
658 return FN(UNION
,union_add_
)(u1
, u2
);
660 return FN(UNION
,match_bin_op
)(u1
, u2
, &FN(PART
,add
));
664 S(UNION
,any_set_data
) {
666 __isl_give PW
*(*fn
)(__isl_take PW
*, __isl_take isl_set
*);
669 static __isl_give PART
*FN(UNION
,any_set_entry
)(__isl_take PART
*part
,
672 S(UNION
,any_set_data
) *data
= user
;
674 return data
->fn(part
, isl_set_copy(data
->set
));
677 /* Update each element of "u" by calling "fn" on the element and "set".
679 static __isl_give UNION
*FN(UNION
,any_set_op
)(__isl_take UNION
*u
,
680 __isl_take isl_set
*set
,
681 __isl_give PW
*(*fn
)(__isl_take PW
*, __isl_take isl_set
*))
683 S(UNION
,any_set_data
) data
= { NULL
, fn
};
684 S(UNION
,transform_control
) control
= {
685 .fn
= &FN(UNION
,any_set_entry
),
689 u
= FN(UNION
,align_params
)(u
, isl_set_get_space(set
));
690 set
= isl_set_align_params(set
, FN(UNION
,get_space
)(u
));
696 u
= FN(UNION
,transform
)(u
, &control
);
705 /* Intersect the domain of "u" with the parameter domain "context".
707 __isl_give UNION
*FN(UNION
,intersect_params
)(__isl_take UNION
*u
,
708 __isl_take isl_set
*set
)
710 return FN(UNION
,any_set_op
)(u
, set
, &FN(PW
,intersect_params
));
713 /* Compute the gist of the domain of "u" with respect to
714 * the parameter domain "context".
716 __isl_give UNION
*FN(UNION
,gist_params
)(__isl_take UNION
*u
,
717 __isl_take isl_set
*set
)
719 return FN(UNION
,any_set_op
)(u
, set
, &FN(PW
,gist_params
));
722 /* Data structure that specifies how isl_union_*_match_domain_op
723 * should combine its arguments.
725 * If "filter" is not NULL, then only parts that pass the given
726 * filter are considered for matching.
727 * "fn" is applied to each part in the union and each corresponding
728 * set in the union set, i.e., such that the set lives in the same space
729 * as the domain of the part.
730 * If "match_space" is not NULL, then the set extracted from the union set
731 * does not live in the same space as the domain of the part,
732 * but rather in the space that results from calling "match_space"
733 * on this domain space.
735 S(UNION
,match_domain_control
) {
736 isl_bool (*filter
)(__isl_keep PART
*part
);
737 __isl_give isl_space
*(*match_space
)(__isl_take isl_space
*space
);
738 __isl_give PW
*(*fn
)(__isl_take PW
*, __isl_take isl_set
*);
741 S(UNION
,match_domain_data
) {
744 S(UNION
,match_domain_control
) *control
;
747 /* Find the set in data->uset that lives in the same space as the domain
748 * of "part" (ignoring parameters), apply data->fn to *entry and this set
749 * (if any), and add the result to data->res.
751 static isl_stat
FN(UNION
,match_domain_entry
)(__isl_take PART
*part
, void *user
)
753 S(UNION
,match_domain_data
) *data
= user
;
754 struct isl_hash_table_entry
*entry2
;
757 if (data
->control
->filter
) {
758 isl_bool pass
= data
->control
->filter(part
);
759 if (pass
< 0 || !pass
) {
761 return pass
< 0 ? isl_stat_error
: isl_stat_ok
;
765 space
= FN(PART
,get_domain_space
)(part
);
766 if (data
->control
->match_space
)
767 space
= data
->control
->match_space(space
);
768 entry2
= isl_union_set_find_entry(data
->uset
, space
, 0);
769 isl_space_free(space
);
770 if (!entry2
|| entry2
== isl_hash_table_entry_none
) {
772 return isl_stat_non_null(entry2
);
775 part
= data
->control
->fn(part
, isl_set_copy(entry2
->data
));
777 data
->res
= FN(FN(UNION
,add
),BASE
)(data
->res
, part
);
779 return isl_stat_error
;
784 /* Combine "u" and "uset" according to "control"
785 * and collect the results.
787 static __isl_give UNION
*FN(UNION
,match_domain_op
)(__isl_take UNION
*u
,
788 __isl_take isl_union_set
*uset
, S(UNION
,match_domain_control
) *control
)
790 S(UNION
,match_domain_data
) data
= { NULL
, NULL
, control
};
796 data
.res
= FN(UNION
,alloc_same_size
)(u
);
797 if (FN(FN(UNION
,foreach
),BASE
)(u
,
798 &FN(UNION
,match_domain_entry
), &data
) < 0)
802 isl_union_set_free(uset
);
806 isl_union_set_free(uset
);
807 FN(UNION
,free
)(data
.res
);
811 /* Intersect the domain of "u" with "uset".
812 * If "uset" is a parameters domain, then intersect the parameter
813 * domain of "u" with this set.
815 __isl_give UNION
*FN(UNION
,intersect_domain_union_set
)(__isl_take UNION
*u
,
816 __isl_take isl_union_set
*uset
)
818 S(UNION
,match_domain_control
) control
= {
819 .fn
= &FN(PW
,intersect_domain
),
822 if (isl_union_set_is_params(uset
))
823 return FN(UNION
,intersect_params
)(u
,
824 isl_set_from_union_set(uset
));
825 return FN(UNION
,match_domain_op
)(u
, uset
, &control
);
828 /* This is an alternative name for the function above.
830 __isl_give UNION
*FN(UNION
,intersect_domain
)(__isl_take UNION
*u
,
831 __isl_take isl_union_set
*uset
)
833 return FN(UNION
,intersect_domain_union_set
)(u
, uset
);
836 /* Return true if this part should be kept.
838 * In particular, it should be kept if its domain space
839 * corresponds to "space".
841 static isl_bool
FN(UNION
,select_entry
)(__isl_keep PART
*part
, void *user
)
843 isl_space
*space
= user
;
845 return FN(PW
,has_domain_space_tuples
)(part
, space
);
848 /* Remove any not element in "space" from the domain of "u".
850 * In particular, select any part of the function defined
851 * on this domain space.
853 __isl_give UNION
*FN(UNION
,intersect_domain_space
)(__isl_take UNION
*u
,
854 __isl_take isl_space
*space
)
856 S(UNION
,transform_control
) control
= {
857 .filter
= &FN(UNION
,select_entry
),
858 .filter_user
= space
,
861 u
= FN(UNION
,transform
)(u
, &control
);
862 isl_space_free(space
);
866 /* Is the domain of "pw" a wrapped relation?
868 static isl_bool
FN(PW
,domain_is_wrapping
)(__isl_keep PW
*pw
)
870 return isl_space_domain_is_wrapping(FN(PW
,peek_space
)(pw
));
873 /* Intersect the domain of the wrapped relation inside the domain of "u"
876 __isl_give UNION
*FN(UNION
,intersect_domain_wrapped_domain
)(__isl_take UNION
*u
,
877 __isl_take isl_union_set
*uset
)
879 S(UNION
,match_domain_control
) control
= {
880 .filter
= &FN(PART
,domain_is_wrapping
),
881 .match_space
= &isl_space_factor_domain
,
882 .fn
= &FN(PW
,intersect_domain_wrapped_domain
),
885 return FN(UNION
,match_domain_op
)(u
, uset
, &control
);
888 /* Intersect the range of the wrapped relation inside the domain of "u"
891 __isl_give UNION
*FN(UNION
,intersect_domain_wrapped_range
)(__isl_take UNION
*u
,
892 __isl_take isl_union_set
*uset
)
894 S(UNION
,match_domain_control
) control
= {
895 .filter
= &FN(PART
,domain_is_wrapping
),
896 .match_space
= &isl_space_factor_range
,
897 .fn
= &FN(PW
,intersect_domain_wrapped_range
),
900 return FN(UNION
,match_domain_op
)(u
, uset
, &control
);
903 /* Take the set (which may be empty) in data->uset that lives
904 * in the same space as the domain of "pw", subtract it from the domain
905 * of "part" and return the result.
907 static __isl_give PART
*FN(UNION
,subtract_domain_entry
)(__isl_take PART
*part
,
910 isl_union_set
*uset
= user
;
914 space
= FN(PART
,get_domain_space
)(part
);
915 set
= isl_union_set_extract_set(uset
, space
);
916 return FN(PART
,subtract_domain
)(part
, set
);
919 /* Subtract "uset" from the domain of "u".
921 __isl_give UNION
*FN(UNION
,subtract_domain_union_set
)(__isl_take UNION
*u
,
922 __isl_take isl_union_set
*uset
)
924 S(UNION
,transform_control
) control
= {
925 .fn
= &FN(UNION
,subtract_domain_entry
),
929 u
= FN(UNION
,transform
)(u
, &control
);
930 isl_union_set_free(uset
);
934 /* This is an alternative name for the function above.
936 __isl_give UNION
*FN(UNION
,subtract_domain
)(__isl_take UNION
*u
,
937 __isl_take isl_union_set
*uset
)
939 return FN(UNION
,subtract_domain_union_set
)(u
, uset
);
942 /* Return true if this part should be kept.
944 * In particular, it should be kept if its domain space
945 * does not correspond to "space".
947 static isl_bool
FN(UNION
,filter_out_entry
)(__isl_keep PART
*part
, void *user
)
949 isl_space
*space
= user
;
951 return isl_bool_not(FN(PW
,has_domain_space_tuples
)(part
, space
));
954 /* Remove any element in "space" from the domain of "u".
956 * In particular, filter out any part of the function defined
957 * on this domain space.
959 __isl_give UNION
*FN(UNION
,subtract_domain_space
)(__isl_take UNION
*u
,
960 __isl_take isl_space
*space
)
962 S(UNION
,transform_control
) control
= {
963 .filter
= &FN(UNION
,filter_out_entry
),
964 .filter_user
= space
,
967 u
= FN(UNION
,transform
)(u
, &control
);
968 isl_space_free(space
);
972 __isl_give UNION
*FN(UNION
,gist
)(__isl_take UNION
*u
,
973 __isl_take isl_union_set
*uset
)
975 S(UNION
,match_domain_control
) control
= {
979 if (isl_union_set_is_params(uset
))
980 return FN(UNION
,gist_params
)(u
, isl_set_from_union_set(uset
));
981 return FN(UNION
,match_domain_op
)(u
, uset
, &control
);
984 /* Coalesce an entry in a UNION. Coalescing is performed in-place.
985 * Since the UNION may have several references, the entry is only
986 * replaced if the coalescing is successful.
988 static isl_stat
FN(UNION
,coalesce_entry
)(void **entry
, void *user
)
990 PART
**part_p
= (PART
**) entry
;
993 part
= FN(PART
,copy
)(*part_p
);
994 part
= FN(PW
,coalesce
)(part
);
996 return isl_stat_error
;
997 FN(PART
,free
)(*part_p
);
1003 __isl_give UNION
*FN(UNION
,coalesce
)(__isl_take UNION
*u
)
1005 if (FN(UNION
,foreach_inplace
)(u
, &FN(UNION
,coalesce_entry
), NULL
) < 0)
1014 static isl_stat
FN(UNION
,domain_entry
)(__isl_take PART
*part
, void *user
)
1016 isl_union_set
**uset
= (isl_union_set
**)user
;
1018 *uset
= isl_union_set_add_set(*uset
, FN(PART
,domain
)(part
));
1023 __isl_give isl_union_set
*FN(UNION
,domain
)(__isl_take UNION
*u
)
1025 isl_union_set
*uset
;
1027 uset
= isl_union_set_empty(FN(UNION
,get_space
)(u
));
1028 if (FN(FN(UNION
,foreach
),BASE
)(u
, &FN(UNION
,domain_entry
), &uset
) < 0)
1035 isl_union_set_free(uset
);
1041 /* Negate the type of "u".
1043 static __isl_give UNION
*FN(UNION
,negate_type
)(__isl_take UNION
*u
)
1045 u
= FN(UNION
,cow
)(u
);
1048 u
->type
= isl_fold_type_negate(u
->type
);
1052 /* Negate the type of "u".
1053 * Since "u" does not have a type, do nothing.
1055 static __isl_give UNION
*FN(UNION
,negate_type
)(__isl_take UNION
*u
)
1061 /* Multiply "part" by the isl_val "user" and return the result.
1063 static __isl_give PART
*FN(UNION
,scale_val_entry
)(__isl_take PART
*part
,
1068 return FN(PART
,scale_val
)(part
, isl_val_copy(v
));
1071 /* Multiply "u" by "v" and return the result.
1073 __isl_give UNION
*FN(UNION
,scale_val
)(__isl_take UNION
*u
,
1074 __isl_take isl_val
*v
)
1078 if (isl_val_is_one(v
)) {
1083 if (DEFAULT_IS_ZERO
&& u
&& isl_val_is_zero(v
)) {
1085 isl_space
*space
= FN(UNION
,get_space
)(u
);
1086 zero
= FN(UNION
,ZERO
)(space
OPT_TYPE_ARG(u
->));
1092 if (!isl_val_is_rat(v
))
1093 isl_die(isl_val_get_ctx(v
), isl_error_invalid
,
1094 "expecting rational factor", goto error
);
1096 u
= FN(UNION
,transform_inplace
)(u
, &FN(UNION
,scale_val_entry
), v
);
1097 if (isl_val_is_neg(v
))
1098 u
= FN(UNION
,negate_type
)(u
);
1108 /* Divide "part" by the isl_val "user" and return the result.
1110 static __isl_give PART
*FN(UNION
,scale_down_val_entry
)(__isl_take PART
*part
,
1115 return FN(PART
,scale_down_val
)(part
, isl_val_copy(v
));
1118 /* Divide "u" by "v" and return the result.
1120 __isl_give UNION
*FN(UNION
,scale_down_val
)(__isl_take UNION
*u
,
1121 __isl_take isl_val
*v
)
1125 if (isl_val_is_one(v
)) {
1130 if (!isl_val_is_rat(v
))
1131 isl_die(isl_val_get_ctx(v
), isl_error_invalid
,
1132 "expecting rational factor", goto error
);
1133 if (isl_val_is_zero(v
))
1134 isl_die(isl_val_get_ctx(v
), isl_error_invalid
,
1135 "cannot scale down by zero", goto error
);
1137 u
= FN(UNION
,transform_inplace
)(u
, &FN(UNION
,scale_down_val_entry
), v
);
1138 if (isl_val_is_neg(v
))
1139 u
= FN(UNION
,negate_type
)(u
);
1149 /* Internal data structure for isl_union_*_every_*.
1151 * "test" is the user-specified callback function.
1152 * "user" is the user-specified callback function argument.
1154 * "res" is the final result, initialized to isl_bool_true.
1156 S(UNION
,every_data
) {
1157 isl_bool (*test
)(__isl_keep PW
*pw
, void *user
);
1163 /* Call data->test on the piecewise expression at *entry,
1164 * updating the result in data->res.
1165 * Abort if this result is no longer isl_bool_true.
1167 static isl_stat
FN(UNION
,every_entry
)(void **entry
, void *user
)
1169 S(UNION
,every_data
) *data
= user
;
1172 data
->res
= data
->test(pw
, data
->user
);
1173 if (data
->res
< 0 || !data
->res
)
1174 return isl_stat_error
;
1179 /* Does "test" succeed on every piecewise expression in "u"?
1181 isl_bool
FN(FN(UNION
,every
),BASE
)(__isl_keep UNION
*u
,
1182 isl_bool (*test
)(__isl_keep PW
*pw
, void *user
), void *user
)
1184 S(UNION
,every_data
) data
= { test
, user
};
1186 data
.res
= isl_bool_true
;
1187 if (FN(UNION
,foreach_inplace
)(u
, &FN(UNION
,every_entry
), &data
) < 0 &&
1188 data
.res
== isl_bool_true
)
1189 return isl_bool_error
;
1194 S(UNION
,plain_is_equal_data
)
1199 static isl_bool
FN(UNION
,plain_is_equal_el
)(__isl_keep PW
*pw
, void *user
)
1201 S(UNION
,plain_is_equal_data
) *data
= user
;
1202 struct isl_hash_table_entry
*entry
;
1204 entry
= FN(UNION
,find_part_entry
)(data
->u2
, pw
->dim
, 0);
1206 return isl_bool_error
;
1207 if (entry
== isl_hash_table_entry_none
)
1208 return isl_bool_false
;
1210 return FN(PW
,plain_is_equal
)(pw
, entry
->data
);
1213 isl_bool
FN(UNION
,plain_is_equal
)(__isl_keep UNION
*u1
, __isl_keep UNION
*u2
)
1215 S(UNION
,plain_is_equal_data
) data
;
1220 return isl_bool_error
;
1222 return isl_bool_true
;
1223 if (u1
->table
.n
!= u2
->table
.n
)
1224 return isl_bool_false
;
1225 n1
= FN(FN(UNION
,n
),BASE
)(u1
);
1226 n2
= FN(FN(UNION
,n
),BASE
)(u2
);
1227 if (n1
< 0 || n2
< 0)
1228 return isl_bool_error
;
1230 return isl_bool_false
;
1232 u1
= FN(UNION
,copy
)(u1
);
1233 u2
= FN(UNION
,copy
)(u2
);
1234 u1
= FN(UNION
,align_params
)(u1
, FN(UNION
,get_space
)(u2
));
1235 u2
= FN(UNION
,align_params
)(u2
, FN(UNION
,get_space
)(u1
));
1240 is_equal
= FN(FN(UNION
,every
),BASE
)(u1
,
1241 &FN(UNION
,plain_is_equal_el
), &data
);
1250 return isl_bool_error
;
1253 /* An isl_union_*_every_* callback that checks whether "pw"
1254 * does not involve any NaNs.
1256 static isl_bool
FN(UNION
,no_nan_el
)(__isl_keep PW
*pw
, void *user
)
1258 return isl_bool_not(FN(PW
,involves_nan
)(pw
));
1261 /* Does "u" involve any NaNs?
1263 isl_bool
FN(UNION
,involves_nan
)(__isl_keep UNION
*u
)
1267 no_nan
= FN(FN(UNION
,every
),BASE
)(u
, &FN(UNION
,no_nan_el
), NULL
);
1269 return isl_bool_not(no_nan
);
1272 /* Internal data structure for isl_union_*_drop_dims.
1273 * type, first and n are passed to isl_*_drop_dims.
1275 S(UNION
,drop_dims_data
) {
1276 enum isl_dim_type type
;
1281 /* Drop the parameters specified by "data" from "part" and return the result.
1283 static __isl_give PART
*FN(UNION
,drop_dims_entry
)(__isl_take PART
*part
,
1286 S(UNION
,drop_dims_data
) *data
= user
;
1288 return FN(PART
,drop_dims
)(part
, data
->type
, data
->first
, data
->n
);
1291 /* Drop the specified parameters from "u".
1292 * That is, type is required to be isl_dim_param.
1294 __isl_give UNION
*FN(UNION
,drop_dims
)( __isl_take UNION
*u
,
1295 enum isl_dim_type type
, unsigned first
, unsigned n
)
1298 S(UNION
,drop_dims_data
) data
= { type
, first
, n
};
1299 S(UNION
,transform_control
) control
= {
1300 .fn
= &FN(UNION
,drop_dims_entry
),
1307 if (type
!= isl_dim_param
)
1308 isl_die(FN(UNION
,get_ctx
)(u
), isl_error_invalid
,
1309 "can only project out parameters",
1310 return FN(UNION
,free
)(u
));
1312 space
= FN(UNION
,get_space
)(u
);
1313 space
= isl_space_drop_dims(space
, type
, first
, n
);
1314 return FN(UNION
,transform_space
)(u
, space
, &control
);
1317 /* Internal data structure for isl_union_*_set_dim_name.
1318 * pos is the position of the parameter that needs to be renamed.
1319 * s is the new name.
1321 S(UNION
,set_dim_name_data
) {
1326 /* Change the name of the parameter at position data->pos of "part" to data->s
1327 * and return the result.
1329 static __isl_give PART
*FN(UNION
,set_dim_name_entry
)(__isl_take PART
*part
,
1332 S(UNION
,set_dim_name_data
) *data
= user
;
1334 return FN(PART
,set_dim_name
)(part
, isl_dim_param
, data
->pos
, data
->s
);
1337 /* Change the name of the parameter at position "pos" to "s".
1338 * That is, type is required to be isl_dim_param.
1340 __isl_give UNION
*FN(UNION
,set_dim_name
)(__isl_take UNION
*u
,
1341 enum isl_dim_type type
, unsigned pos
, const char *s
)
1343 S(UNION
,set_dim_name_data
) data
= { pos
, s
};
1344 S(UNION
,transform_control
) control
= {
1345 .fn
= &FN(UNION
,set_dim_name_entry
),
1353 if (type
!= isl_dim_param
)
1354 isl_die(FN(UNION
,get_ctx
)(u
), isl_error_invalid
,
1355 "can only set parameter names",
1356 return FN(UNION
,free
)(u
));
1358 space
= FN(UNION
,get_space
)(u
);
1359 space
= isl_space_set_dim_name(space
, type
, pos
, s
);
1360 return FN(UNION
,transform_space
)(u
, space
, &control
);
1363 /* Reset the user pointer on all identifiers of parameters and tuples
1364 * of the space of "part" and return the result.
1366 static __isl_give PART
*FN(UNION
,reset_user_entry
)(__isl_take PART
*part
,
1369 return FN(PART
,reset_user
)(part
);
1372 /* Reset the user pointer on all identifiers of parameters and tuples
1373 * of the spaces of "u".
1375 __isl_give UNION
*FN(UNION
,reset_user
)(__isl_take UNION
*u
)
1377 S(UNION
,transform_control
) control
= {
1378 .fn
= &FN(UNION
,reset_user_entry
),
1382 space
= FN(UNION
,get_space
)(u
);
1383 space
= isl_space_reset_user(space
);
1384 return FN(UNION
,transform_space
)(u
, space
, &control
);
1387 /* Add the base expression held by "entry" to "list".
1389 static isl_stat
FN(UNION
,add_to_list
)(void **entry
, void *user
)
1392 LIST(PART
) **list
= user
;
1394 *list
= FN(LIST(PART
),add
)(*list
, FN(PART
,copy
)(pw
));
1396 return isl_stat_error
;
1401 /* Return a list containing all the base expressions in "u".
1403 * First construct a list of the appropriate size and
1404 * then add all the elements.
1406 __isl_give
LIST(PART
) *FN(FN(UNION
,get
),LIST(BASE
))(__isl_keep UNION
*u
)
1413 n
= FN(FN(UNION
,n
),BASE
)(u
);
1416 list
= FN(LIST(PART
),alloc
)(FN(UNION
,get_ctx(u
)), n
);
1417 if (FN(UNION
,foreach_inplace
)(u
, &FN(UNION
,add_to_list
), &list
) < 0)
1418 return FN(LIST(PART
),free
)(list
);