2 * Copyright 2010 INRIA Saclay
4 * Use of this software is governed by the MIT license
6 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
7 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
11 #define xFN(TYPE,NAME) TYPE ## _ ## NAME
12 #define FN(TYPE,NAME) xFN(TYPE,NAME)
13 #define xS(TYPE,NAME) struct TYPE ## _ ## NAME
14 #define S(TYPE,NAME) xS(TYPE,NAME)
23 struct isl_hash_table table
;
26 __isl_give UNION
*FN(UNION
,cow
)(__isl_take UNION
*u
);
28 isl_ctx
*FN(UNION
,get_ctx
)(__isl_keep UNION
*u
)
30 return u
? u
->dim
->ctx
: NULL
;
33 __isl_give isl_space
*FN(UNION
,get_space
)(__isl_keep UNION
*u
)
37 return isl_space_copy(u
->dim
);
41 static __isl_give UNION
*FN(UNION
,alloc
)(__isl_take isl_space
*dim
,
42 enum isl_fold type
, int size
)
44 static __isl_give UNION
*FN(UNION
,alloc
)(__isl_take isl_space
*dim
, int size
)
49 dim
= isl_space_params(dim
);
53 u
= isl_calloc_type(dim
->ctx
, UNION
);
62 if (isl_hash_table_init(dim
->ctx
, &u
->table
, size
) < 0)
73 __isl_give UNION
*FN(UNION
,ZERO
)(__isl_take isl_space
*dim
, enum isl_fold type
)
75 return FN(UNION
,alloc
)(dim
, type
, 16);
78 __isl_give UNION
*FN(UNION
,ZERO
)(__isl_take isl_space
*dim
)
80 return FN(UNION
,alloc
)(dim
, 16);
84 __isl_give UNION
*FN(UNION
,copy
)(__isl_keep UNION
*u
)
95 int (*fn
)(__isl_take PART
*part
, void *user
);
99 static int call_on_copy(void **entry
, void *user
)
102 S(UNION
,foreach_data
) *data
= (S(UNION
,foreach_data
) *)user
;
104 return data
->fn(FN(PART
,copy
)(part
), data
->user
);
107 int FN(FN(UNION
,foreach
),PARTS
)(__isl_keep UNION
*u
,
108 int (*fn
)(__isl_take PART
*part
, void *user
), void *user
)
110 S(UNION
,foreach_data
) data
= { fn
, user
};
115 return isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
,
116 &call_on_copy
, &data
);
119 static int has_dim(const void *entry
, const void *val
)
121 PART
*part
= (PART
*)entry
;
122 isl_space
*dim
= (isl_space
*)val
;
124 return isl_space_is_equal(part
->dim
, dim
);
127 __isl_give PART
*FN(FN(UNION
,extract
),PARTS
)(__isl_keep UNION
*u
,
128 __isl_take isl_space
*dim
)
131 struct isl_hash_table_entry
*entry
;
136 hash
= isl_space_get_hash(dim
);
137 entry
= isl_hash_table_find(u
->dim
->ctx
, &u
->table
, hash
,
141 return FN(PART
,ZERO
)(dim
, u
->type
);
143 return FN(PART
,ZERO
)(dim
);
146 return FN(PART
,copy
)(entry
->data
);
152 __isl_give UNION
*FN(FN(UNION
,add
),PARTS
)(__isl_take UNION
*u
,
153 __isl_take PART
*part
)
156 struct isl_hash_table_entry
*entry
;
161 if (DEFAULT_IS_ZERO
&& FN(PART
,IS_ZERO
)(part
)) {
166 u
= FN(UNION
,align_params
)(u
, FN(PART
,get_space
)(part
));
167 part
= FN(PART
,align_params
)(part
, FN(UNION
,get_space
)(u
));
169 u
= FN(UNION
,cow
)(u
);
174 hash
= isl_space_get_hash(part
->dim
);
175 entry
= isl_hash_table_find(u
->dim
->ctx
, &u
->table
, hash
,
176 &has_dim
, part
->dim
, 1);
183 entry
->data
= FN(PART
,add
)(entry
->data
, FN(PART
,copy
)(part
));
187 if (DEFAULT_IS_ZERO
&& FN(PART
,IS_ZERO
)(entry
->data
)) {
188 FN(PART
,free
)(entry
->data
);
189 isl_hash_table_remove(u
->dim
->ctx
, &u
->table
, entry
);
200 static int add_part(__isl_take PART
*part
, void *user
)
202 UNION
**u
= (UNION
**)user
;
204 *u
= FN(FN(UNION
,add
),PARTS
)(*u
, part
);
209 __isl_give UNION
*FN(UNION
,dup
)(__isl_keep UNION
*u
)
217 dup
= FN(UNION
,ZERO
)(isl_space_copy(u
->dim
), u
->type
);
219 dup
= FN(UNION
,ZERO
)(isl_space_copy(u
->dim
));
221 if (FN(FN(UNION
,foreach
),PARTS
)(u
, &add_part
, &dup
) < 0)
229 __isl_give UNION
*FN(UNION
,cow
)(__isl_take UNION
*u
)
237 return FN(UNION
,dup
)(u
);
240 static int free_u_entry(void **entry
, void *user
)
247 __isl_null UNION
*FN(UNION
,free
)(__isl_take UNION
*u
)
255 isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
, &free_u_entry
, NULL
);
256 isl_hash_table_clear(&u
->table
);
257 isl_space_free(u
->dim
);
268 static int align_entry(__isl_take PART
*part
, void *user
)
271 S(UNION
,align
) *data
= user
;
273 exp
= isl_reordering_extend_space(isl_reordering_copy(data
->exp
),
274 FN(PART
,get_domain_space
)(part
));
276 data
->res
= FN(FN(UNION
,add
),PARTS
)(data
->res
,
277 FN(PART
,realign_domain
)(part
, exp
));
282 static int align_entry(__isl_take PART
*part
, void *user
)
285 S(UNION
,align
) *data
= user
;
287 exp
= isl_reordering_extend_space(isl_reordering_copy(data
->exp
),
288 FN(PART
,get_space
)(part
));
290 data
->res
= FN(FN(UNION
,add
),PARTS
)(data
->res
,
291 FN(PART
,realign
)(part
, exp
));
297 __isl_give UNION
*FN(UNION
,align_params
)(__isl_take UNION
*u
,
298 __isl_take isl_space
*model
)
300 S(UNION
,align
) data
= { NULL
, NULL
};
305 if (isl_space_match(u
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
306 isl_space_free(model
);
310 model
= isl_space_params(model
);
311 data
.exp
= isl_parameter_alignment_reordering(u
->dim
, model
);
316 data
.res
= FN(UNION
,alloc
)(isl_space_copy(data
.exp
->dim
),
317 u
->type
, u
->table
.n
);
319 data
.res
= FN(UNION
,alloc
)(isl_space_copy(data
.exp
->dim
), u
->table
.n
);
321 if (FN(FN(UNION
,foreach
),PARTS
)(u
, &align_entry
, &data
) < 0)
324 isl_reordering_free(data
.exp
);
326 isl_space_free(model
);
329 isl_reordering_free(data
.exp
);
331 FN(UNION
,free
)(data
.res
);
332 isl_space_free(model
);
336 __isl_give UNION
*FN(UNION
,add
)(__isl_take UNION
*u1
, __isl_take UNION
*u2
)
338 u1
= FN(UNION
,align_params
)(u1
, FN(UNION
,get_space
)(u2
));
339 u2
= FN(UNION
,align_params
)(u2
, FN(UNION
,get_space
)(u1
));
341 u1
= FN(UNION
,cow
)(u1
);
346 if (FN(FN(UNION
,foreach
),PARTS
)(u2
, &add_part
, &u1
) < 0)
358 __isl_give UNION
*FN(FN(UNION
,from
),PARTS
)(__isl_take PART
*part
)
366 dim
= FN(PART
,get_space
)(part
);
367 dim
= isl_space_drop_dims(dim
, isl_dim_in
, 0, isl_space_dim(dim
, isl_dim_in
));
368 dim
= isl_space_drop_dims(dim
, isl_dim_out
, 0, isl_space_dim(dim
, isl_dim_out
));
370 u
= FN(UNION
,ZERO
)(dim
, part
->type
);
372 u
= FN(UNION
,ZERO
)(dim
);
374 u
= FN(FN(UNION
,add
),PARTS
)(u
, part
);
379 S(UNION
,match_bin_data
) {
382 __isl_give PART
*(*fn
)(__isl_take PART
*, __isl_take PART
*);
385 /* Check if data->u2 has an element living in the same space as *entry.
386 * If so, call data->fn on the two elements and add the result to
389 static int match_bin_entry(void **entry
, void *user
)
391 S(UNION
,match_bin_data
) *data
= user
;
393 struct isl_hash_table_entry
*entry2
;
397 space
= FN(PART
,get_space
)(part
);
398 hash
= isl_space_get_hash(space
);
399 entry2
= isl_hash_table_find(data
->u2
->dim
->ctx
, &data
->u2
->table
,
400 hash
, &has_dim
, space
, 0);
401 isl_space_free(space
);
405 part
= FN(PART
, copy
)(part
);
406 part
= data
->fn(part
, FN(PART
, copy
)(entry2
->data
));
408 if (DEFAULT_IS_ZERO
) {
411 empty
= FN(PART
,IS_ZERO
)(part
);
422 data
->res
= FN(FN(UNION
,add
),PARTS
)(data
->res
, part
);
427 /* This function is currently only used from isl_polynomial.c
428 * and not from isl_fold.c.
430 static __isl_give UNION
*match_bin_op(__isl_take UNION
*u1
,
431 __isl_take UNION
*u2
,
432 __isl_give PART
*(*fn
)(__isl_take PART
*, __isl_take PART
*))
433 __attribute__ ((unused
));
434 /* For each pair of elements in "u1" and "u2" living in the same space,
435 * call "fn" and collect the results.
437 static __isl_give UNION
*match_bin_op(__isl_take UNION
*u1
,
438 __isl_take UNION
*u2
,
439 __isl_give PART
*(*fn
)(__isl_take PART
*, __isl_take PART
*))
441 S(UNION
,match_bin_data
) data
= { NULL
, NULL
, fn
};
443 u1
= FN(UNION
,align_params
)(u1
, FN(UNION
,get_space
)(u2
));
444 u2
= FN(UNION
,align_params
)(u2
, FN(UNION
,get_space
)(u1
));
451 data
.res
= FN(UNION
,alloc
)(isl_space_copy(u1
->dim
), u1
->type
, u1
->table
.n
);
453 data
.res
= FN(UNION
,alloc
)(isl_space_copy(u1
->dim
), u1
->table
.n
);
455 if (isl_hash_table_foreach(u1
->dim
->ctx
, &u1
->table
,
456 &match_bin_entry
, &data
) < 0)
465 FN(UNION
,free
)(data
.res
);
470 /* Subtract "u2" from "u1" and return the result.
472 __isl_give UNION
*FN(UNION
,sub
)(__isl_take UNION
*u1
, __isl_take UNION
*u2
)
474 return match_bin_op(u1
, u2
, &FN(PART
,sub
));
478 S(UNION
,any_set_data
) {
481 __isl_give PW
*(*fn
)(__isl_take PW
*, __isl_take isl_set
*);
484 static int any_set_entry(void **entry
, void *user
)
486 S(UNION
,any_set_data
) *data
= user
;
489 pw
= FN(PW
,copy
)(pw
);
490 pw
= data
->fn(pw
, isl_set_copy(data
->set
));
492 if (DEFAULT_IS_ZERO
) {
495 empty
= FN(PW
,IS_ZERO
)(pw
);
506 data
->res
= FN(FN(UNION
,add
),PARTS
)(data
->res
, pw
);
511 /* Update each element of "u" by calling "fn" on the element and "set".
513 static __isl_give UNION
*any_set_op(__isl_take UNION
*u
,
514 __isl_take isl_set
*set
,
515 __isl_give PW
*(*fn
)(__isl_take PW
*, __isl_take isl_set
*))
517 S(UNION
,any_set_data
) data
= { NULL
, NULL
, fn
};
519 u
= FN(UNION
,align_params
)(u
, isl_set_get_space(set
));
520 set
= isl_set_align_params(set
, FN(UNION
,get_space
)(u
));
527 data
.res
= FN(UNION
,alloc
)(isl_space_copy(u
->dim
), u
->type
, u
->table
.n
);
529 data
.res
= FN(UNION
,alloc
)(isl_space_copy(u
->dim
), u
->table
.n
);
531 if (isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
,
532 &any_set_entry
, &data
) < 0)
541 FN(UNION
,free
)(data
.res
);
545 /* Intersect the domain of "u" with the parameter domain "context".
547 __isl_give UNION
*FN(UNION
,intersect_params
)(__isl_take UNION
*u
,
548 __isl_take isl_set
*set
)
550 return any_set_op(u
, set
, &FN(PW
,intersect_params
));
553 /* Compute the gist of the domain of "u" with respect to
554 * the parameter domain "context".
556 __isl_give UNION
*FN(UNION
,gist_params
)(__isl_take UNION
*u
,
557 __isl_take isl_set
*set
)
559 return any_set_op(u
, set
, &FN(PW
,gist_params
));
562 S(UNION
,match_domain_data
) {
565 __isl_give PW
*(*fn
)(__isl_take PW
*, __isl_take isl_set
*);
568 static int set_has_dim(const void *entry
, const void *val
)
570 isl_set
*set
= (isl_set
*)entry
;
571 isl_space
*dim
= (isl_space
*)val
;
573 return isl_space_is_equal(set
->dim
, dim
);
576 /* Find the set in data->uset that live in the same space as the domain
577 * of *entry, apply data->fn to *entry and this set (if any), and add
578 * the result to data->res.
580 static int match_domain_entry(void **entry
, void *user
)
582 S(UNION
,match_domain_data
) *data
= user
;
584 struct isl_hash_table_entry
*entry2
;
588 space
= FN(PW
,get_domain_space
)(pw
);
589 hash
= isl_space_get_hash(space
);
590 entry2
= isl_hash_table_find(data
->uset
->dim
->ctx
, &data
->uset
->table
,
591 hash
, &set_has_dim
, space
, 0);
592 isl_space_free(space
);
596 pw
= FN(PW
,copy
)(pw
);
597 pw
= data
->fn(pw
, isl_set_copy(entry2
->data
));
599 if (DEFAULT_IS_ZERO
) {
602 empty
= FN(PW
,IS_ZERO
)(pw
);
613 data
->res
= FN(FN(UNION
,add
),PARTS
)(data
->res
, pw
);
618 /* Apply fn to each pair of PW in u and set in uset such that
619 * the set lives in the same space as the domain of PW
620 * and collect the results.
622 static __isl_give UNION
*match_domain_op(__isl_take UNION
*u
,
623 __isl_take isl_union_set
*uset
,
624 __isl_give PW
*(*fn
)(__isl_take PW
*, __isl_take isl_set
*))
626 S(UNION
,match_domain_data
) data
= { NULL
, NULL
, fn
};
628 u
= FN(UNION
,align_params
)(u
, isl_union_set_get_space(uset
));
629 uset
= isl_union_set_align_params(uset
, FN(UNION
,get_space
)(u
));
636 data
.res
= FN(UNION
,alloc
)(isl_space_copy(u
->dim
), u
->type
, u
->table
.n
);
638 data
.res
= FN(UNION
,alloc
)(isl_space_copy(u
->dim
), u
->table
.n
);
640 if (isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
,
641 &match_domain_entry
, &data
) < 0)
645 isl_union_set_free(uset
);
649 isl_union_set_free(uset
);
650 FN(UNION
,free
)(data
.res
);
654 /* Intersect the domain of "u" with "uset".
655 * If "uset" is a parameters domain, then intersect the parameter
656 * domain of "u" with this set.
658 __isl_give UNION
*FN(UNION
,intersect_domain
)(__isl_take UNION
*u
,
659 __isl_take isl_union_set
*uset
)
661 if (isl_union_set_is_params(uset
))
662 return FN(UNION
,intersect_params
)(u
,
663 isl_set_from_union_set(uset
));
664 return match_domain_op(u
, uset
, &FN(PW
,intersect_domain
));
667 __isl_give UNION
*FN(UNION
,gist
)(__isl_take UNION
*u
,
668 __isl_take isl_union_set
*uset
)
670 if (isl_union_set_is_params(uset
))
671 return FN(UNION
,gist_params
)(u
, isl_set_from_union_set(uset
));
672 return match_domain_op(u
, uset
, &FN(PW
,gist
));
676 __isl_give isl_val
*FN(UNION
,eval
)(__isl_take UNION
*u
,
677 __isl_take isl_point
*pnt
)
680 struct isl_hash_table_entry
*entry
;
687 space
= isl_space_copy(pnt
->dim
);
688 space
= isl_space_from_domain(space
);
689 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
692 hash
= isl_space_get_hash(space
);
693 entry
= isl_hash_table_find(u
->dim
->ctx
, &u
->table
,
694 hash
, &has_dim
, space
, 0);
695 isl_space_free(space
);
697 v
= isl_val_zero(isl_point_get_ctx(pnt
));
700 v
= FN(PART
,eval
)(FN(PART
,copy
)(entry
->data
), pnt
);
711 static int coalesce_entry(void **entry
, void *user
)
713 PW
**pw
= (PW
**)entry
;
715 *pw
= FN(PW
,coalesce
)(*pw
);
722 __isl_give UNION
*FN(UNION
,coalesce
)(__isl_take UNION
*u
)
727 if (isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
,
728 &coalesce_entry
, NULL
) < 0)
737 static int domain(__isl_take PART
*part
, void *user
)
739 isl_union_set
**uset
= (isl_union_set
**)user
;
741 *uset
= isl_union_set_add_set(*uset
, FN(PART
,domain
)(part
));
746 __isl_give isl_union_set
*FN(UNION
,domain
)(__isl_take UNION
*u
)
750 uset
= isl_union_set_empty(FN(UNION
,get_space
)(u
));
751 if (FN(FN(UNION
,foreach
),PARTS
)(u
, &domain
, &uset
) < 0)
758 isl_union_set_free(uset
);
763 static int mul_isl_int(void **entry
, void *user
)
765 PW
**pw
= (PW
**)entry
;
768 *pw
= FN(PW
,mul_isl_int
)(*pw
, *v
);
775 __isl_give UNION
*FN(UNION
,mul_isl_int
)(__isl_take UNION
*u
, isl_int v
)
777 if (isl_int_is_one(v
))
780 if (DEFAULT_IS_ZERO
&& u
&& isl_int_is_zero(v
)) {
782 isl_space
*dim
= FN(UNION
,get_space
)(u
);
784 zero
= FN(UNION
,ZERO
)(dim
, u
->type
);
786 zero
= FN(UNION
,ZERO
)(dim
);
792 u
= FN(UNION
,cow
)(u
);
797 if (isl_int_is_neg(v
))
798 u
->type
= isl_fold_type_negate(u
->type
);
800 if (isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
,
801 &mul_isl_int
, &v
) < 0)
810 /* Multiply *entry by the isl_val "user".
812 * Return 0 on success and -1 on error.
814 static int scale_val(void **entry
, void *user
)
816 PW
**pw
= (PW
**)entry
;
819 *pw
= FN(PW
,scale_val
)(*pw
, isl_val_copy(v
));
826 /* Multiply "u" by "v" and return the result.
828 __isl_give UNION
*FN(UNION
,scale_val
)(__isl_take UNION
*u
,
829 __isl_take isl_val
*v
)
833 if (isl_val_is_one(v
)) {
838 if (DEFAULT_IS_ZERO
&& u
&& isl_val_is_zero(v
)) {
840 isl_space
*space
= FN(UNION
,get_space
)(u
);
842 zero
= FN(UNION
,ZERO
)(space
, u
->type
);
844 zero
= FN(UNION
,ZERO
)(space
);
851 if (!isl_val_is_rat(v
))
852 isl_die(isl_val_get_ctx(v
), isl_error_invalid
,
853 "expecting rational factor", goto error
);
855 u
= FN(UNION
,cow
)(u
);
860 if (isl_val_is_neg(v
))
861 u
->type
= isl_fold_type_negate(u
->type
);
863 if (isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
, &scale_val
, v
) < 0)
874 S(UNION
,plain_is_equal_data
)
880 static int plain_is_equal_entry(void **entry
, void *user
)
882 S(UNION
,plain_is_equal_data
) *data
= user
;
884 struct isl_hash_table_entry
*entry2
;
887 hash
= isl_space_get_hash(pw
->dim
);
888 entry2
= isl_hash_table_find(data
->u2
->dim
->ctx
, &data
->u2
->table
,
889 hash
, &has_dim
, pw
->dim
, 0);
895 data
->is_equal
= FN(PW
,plain_is_equal
)(pw
, entry2
->data
);
896 if (data
->is_equal
< 0 || !data
->is_equal
)
902 int FN(UNION
,plain_is_equal
)(__isl_keep UNION
*u1
, __isl_keep UNION
*u2
)
904 S(UNION
,plain_is_equal_data
) data
= { NULL
, 1 };
910 if (u1
->table
.n
!= u2
->table
.n
)
913 u1
= FN(UNION
,copy
)(u1
);
914 u2
= FN(UNION
,copy
)(u2
);
915 u1
= FN(UNION
,align_params
)(u1
, FN(UNION
,get_space
)(u2
));
916 u2
= FN(UNION
,align_params
)(u2
, FN(UNION
,get_space
)(u1
));
921 if (isl_hash_table_foreach(u1
->dim
->ctx
, &u1
->table
,
922 &plain_is_equal_entry
, &data
) < 0 &&
929 return data
.is_equal
;