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)
63 return FN(UNION
,free
)(u
);
72 __isl_give UNION
*FN(UNION
,ZERO
)(__isl_take isl_space
*dim
, enum isl_fold type
)
74 return FN(UNION
,alloc
)(dim
, type
, 16);
77 __isl_give UNION
*FN(UNION
,ZERO
)(__isl_take isl_space
*dim
)
79 return FN(UNION
,alloc
)(dim
, 16);
83 __isl_give UNION
*FN(UNION
,copy
)(__isl_keep UNION
*u
)
94 int (*fn
)(__isl_take PART
*part
, void *user
);
98 static int call_on_copy(void **entry
, void *user
)
101 S(UNION
,foreach_data
) *data
= (S(UNION
,foreach_data
) *)user
;
103 return data
->fn(FN(PART
,copy
)(part
), data
->user
);
106 int FN(FN(UNION
,foreach
),PARTS
)(__isl_keep UNION
*u
,
107 int (*fn
)(__isl_take PART
*part
, void *user
), void *user
)
109 S(UNION
,foreach_data
) data
= { fn
, user
};
114 return isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
,
115 &call_on_copy
, &data
);
118 static int has_dim(const void *entry
, const void *val
)
120 PART
*part
= (PART
*)entry
;
121 isl_space
*dim
= (isl_space
*)val
;
123 return isl_space_is_equal(part
->dim
, dim
);
126 __isl_give PART
*FN(FN(UNION
,extract
),PARTS
)(__isl_keep UNION
*u
,
127 __isl_take isl_space
*dim
)
130 struct isl_hash_table_entry
*entry
;
135 hash
= isl_space_get_hash(dim
);
136 entry
= isl_hash_table_find(u
->dim
->ctx
, &u
->table
, hash
,
140 return FN(PART
,ZERO
)(dim
, u
->type
);
142 return FN(PART
,ZERO
)(dim
);
145 return FN(PART
,copy
)(entry
->data
);
151 __isl_give UNION
*FN(FN(UNION
,add
),PARTS
)(__isl_take UNION
*u
,
152 __isl_take PART
*part
)
156 struct isl_hash_table_entry
*entry
;
161 empty
= FN(PART
,IS_ZERO
)(part
);
169 u
= FN(UNION
,align_params
)(u
, FN(PART
,get_space
)(part
));
170 part
= FN(PART
,align_params
)(part
, FN(UNION
,get_space
)(u
));
172 u
= FN(UNION
,cow
)(u
);
177 hash
= isl_space_get_hash(part
->dim
);
178 entry
= isl_hash_table_find(u
->dim
->ctx
, &u
->table
, hash
,
179 &has_dim
, part
->dim
, 1);
186 entry
->data
= FN(PART
,add
)(entry
->data
, FN(PART
,copy
)(part
));
189 empty
= FN(PART
,IS_ZERO
)(part
);
193 FN(PART
,free
)(entry
->data
);
194 isl_hash_table_remove(u
->dim
->ctx
, &u
->table
, entry
);
206 static int add_part(__isl_take PART
*part
, void *user
)
208 UNION
**u
= (UNION
**)user
;
210 *u
= FN(FN(UNION
,add
),PARTS
)(*u
, part
);
215 __isl_give UNION
*FN(UNION
,dup
)(__isl_keep UNION
*u
)
223 dup
= FN(UNION
,ZERO
)(isl_space_copy(u
->dim
), u
->type
);
225 dup
= FN(UNION
,ZERO
)(isl_space_copy(u
->dim
));
227 if (FN(FN(UNION
,foreach
),PARTS
)(u
, &add_part
, &dup
) < 0)
235 __isl_give UNION
*FN(UNION
,cow
)(__isl_take UNION
*u
)
243 return FN(UNION
,dup
)(u
);
246 static int free_u_entry(void **entry
, void *user
)
253 __isl_null UNION
*FN(UNION
,free
)(__isl_take UNION
*u
)
261 isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
, &free_u_entry
, NULL
);
262 isl_hash_table_clear(&u
->table
);
263 isl_space_free(u
->dim
);
274 static int align_entry(__isl_take PART
*part
, void *user
)
277 S(UNION
,align
) *data
= user
;
279 exp
= isl_reordering_extend_space(isl_reordering_copy(data
->exp
),
280 FN(PART
,get_domain_space
)(part
));
282 data
->res
= FN(FN(UNION
,add
),PARTS
)(data
->res
,
283 FN(PART
,realign_domain
)(part
, exp
));
288 static int align_entry(__isl_take PART
*part
, void *user
)
291 S(UNION
,align
) *data
= user
;
293 exp
= isl_reordering_extend_space(isl_reordering_copy(data
->exp
),
294 FN(PART
,get_space
)(part
));
296 data
->res
= FN(FN(UNION
,add
),PARTS
)(data
->res
,
297 FN(PART
,realign
)(part
, exp
));
303 __isl_give UNION
*FN(UNION
,align_params
)(__isl_take UNION
*u
,
304 __isl_take isl_space
*model
)
306 S(UNION
,align
) data
= { NULL
, NULL
};
311 if (isl_space_match(u
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
312 isl_space_free(model
);
316 model
= isl_space_params(model
);
317 data
.exp
= isl_parameter_alignment_reordering(u
->dim
, model
);
322 data
.res
= FN(UNION
,alloc
)(isl_space_copy(data
.exp
->dim
),
323 u
->type
, u
->table
.n
);
325 data
.res
= FN(UNION
,alloc
)(isl_space_copy(data
.exp
->dim
), u
->table
.n
);
327 if (FN(FN(UNION
,foreach
),PARTS
)(u
, &align_entry
, &data
) < 0)
330 isl_reordering_free(data
.exp
);
332 isl_space_free(model
);
335 isl_reordering_free(data
.exp
);
337 FN(UNION
,free
)(data
.res
);
338 isl_space_free(model
);
342 __isl_give UNION
*FN(UNION
,add
)(__isl_take UNION
*u1
, __isl_take UNION
*u2
)
344 u1
= FN(UNION
,align_params
)(u1
, FN(UNION
,get_space
)(u2
));
345 u2
= FN(UNION
,align_params
)(u2
, FN(UNION
,get_space
)(u1
));
347 u1
= FN(UNION
,cow
)(u1
);
352 if (FN(FN(UNION
,foreach
),PARTS
)(u2
, &add_part
, &u1
) < 0)
364 __isl_give UNION
*FN(FN(UNION
,from
),PARTS
)(__isl_take PART
*part
)
372 dim
= FN(PART
,get_space
)(part
);
373 dim
= isl_space_drop_dims(dim
, isl_dim_in
, 0, isl_space_dim(dim
, isl_dim_in
));
374 dim
= isl_space_drop_dims(dim
, isl_dim_out
, 0, isl_space_dim(dim
, isl_dim_out
));
376 u
= FN(UNION
,ZERO
)(dim
, part
->type
);
378 u
= FN(UNION
,ZERO
)(dim
);
380 u
= FN(FN(UNION
,add
),PARTS
)(u
, part
);
385 S(UNION
,match_bin_data
) {
388 __isl_give PART
*(*fn
)(__isl_take PART
*, __isl_take PART
*);
391 /* Check if data->u2 has an element living in the same space as *entry.
392 * If so, call data->fn on the two elements and add the result to
395 static int match_bin_entry(void **entry
, void *user
)
397 S(UNION
,match_bin_data
) *data
= user
;
399 struct isl_hash_table_entry
*entry2
;
403 space
= FN(PART
,get_space
)(part
);
404 hash
= isl_space_get_hash(space
);
405 entry2
= isl_hash_table_find(data
->u2
->dim
->ctx
, &data
->u2
->table
,
406 hash
, &has_dim
, space
, 0);
407 isl_space_free(space
);
411 part
= FN(PART
, copy
)(part
);
412 part
= data
->fn(part
, FN(PART
, copy
)(entry2
->data
));
414 data
->res
= FN(FN(UNION
,add
),PARTS
)(data
->res
, part
);
421 /* This function is currently only used from isl_polynomial.c
422 * and not from isl_fold.c.
424 static __isl_give UNION
*match_bin_op(__isl_take UNION
*u1
,
425 __isl_take UNION
*u2
,
426 __isl_give PART
*(*fn
)(__isl_take PART
*, __isl_take PART
*))
427 __attribute__ ((unused
));
428 /* For each pair of elements in "u1" and "u2" living in the same space,
429 * call "fn" and collect the results.
431 static __isl_give UNION
*match_bin_op(__isl_take UNION
*u1
,
432 __isl_take UNION
*u2
,
433 __isl_give PART
*(*fn
)(__isl_take PART
*, __isl_take PART
*))
435 S(UNION
,match_bin_data
) data
= { NULL
, NULL
, fn
};
437 u1
= FN(UNION
,align_params
)(u1
, FN(UNION
,get_space
)(u2
));
438 u2
= FN(UNION
,align_params
)(u2
, FN(UNION
,get_space
)(u1
));
445 data
.res
= FN(UNION
,alloc
)(isl_space_copy(u1
->dim
), u1
->type
, u1
->table
.n
);
447 data
.res
= FN(UNION
,alloc
)(isl_space_copy(u1
->dim
), u1
->table
.n
);
449 if (isl_hash_table_foreach(u1
->dim
->ctx
, &u1
->table
,
450 &match_bin_entry
, &data
) < 0)
459 FN(UNION
,free
)(data
.res
);
464 /* Subtract "u2" from "u1" and return the result.
466 __isl_give UNION
*FN(UNION
,sub
)(__isl_take UNION
*u1
, __isl_take UNION
*u2
)
468 return match_bin_op(u1
, u2
, &FN(PART
,sub
));
472 S(UNION
,any_set_data
) {
475 __isl_give PW
*(*fn
)(__isl_take PW
*, __isl_take isl_set
*);
478 static int any_set_entry(void **entry
, void *user
)
480 S(UNION
,any_set_data
) *data
= user
;
483 pw
= FN(PW
,copy
)(pw
);
484 pw
= data
->fn(pw
, isl_set_copy(data
->set
));
486 data
->res
= FN(FN(UNION
,add
),PARTS
)(data
->res
, pw
);
493 /* Update each element of "u" by calling "fn" on the element and "set".
495 static __isl_give UNION
*any_set_op(__isl_take UNION
*u
,
496 __isl_take isl_set
*set
,
497 __isl_give PW
*(*fn
)(__isl_take PW
*, __isl_take isl_set
*))
499 S(UNION
,any_set_data
) data
= { NULL
, NULL
, fn
};
501 u
= FN(UNION
,align_params
)(u
, isl_set_get_space(set
));
502 set
= isl_set_align_params(set
, FN(UNION
,get_space
)(u
));
509 data
.res
= FN(UNION
,alloc
)(isl_space_copy(u
->dim
), u
->type
, u
->table
.n
);
511 data
.res
= FN(UNION
,alloc
)(isl_space_copy(u
->dim
), u
->table
.n
);
513 if (isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
,
514 &any_set_entry
, &data
) < 0)
523 FN(UNION
,free
)(data
.res
);
527 /* Intersect the domain of "u" with the parameter domain "context".
529 __isl_give UNION
*FN(UNION
,intersect_params
)(__isl_take UNION
*u
,
530 __isl_take isl_set
*set
)
532 return any_set_op(u
, set
, &FN(PW
,intersect_params
));
535 /* Compute the gist of the domain of "u" with respect to
536 * the parameter domain "context".
538 __isl_give UNION
*FN(UNION
,gist_params
)(__isl_take UNION
*u
,
539 __isl_take isl_set
*set
)
541 return any_set_op(u
, set
, &FN(PW
,gist_params
));
544 S(UNION
,match_domain_data
) {
547 __isl_give PW
*(*fn
)(__isl_take PW
*, __isl_take isl_set
*);
550 static int set_has_dim(const void *entry
, const void *val
)
552 isl_set
*set
= (isl_set
*)entry
;
553 isl_space
*dim
= (isl_space
*)val
;
555 return isl_space_is_equal(set
->dim
, dim
);
558 /* Find the set in data->uset that lives in the same space as the domain
559 * of *entry, apply data->fn to *entry and this set (if any), and add
560 * the result to data->res.
562 static int match_domain_entry(void **entry
, void *user
)
564 S(UNION
,match_domain_data
) *data
= user
;
566 struct isl_hash_table_entry
*entry2
;
570 space
= FN(PW
,get_domain_space
)(pw
);
571 hash
= isl_space_get_hash(space
);
572 entry2
= isl_hash_table_find(data
->uset
->dim
->ctx
, &data
->uset
->table
,
573 hash
, &set_has_dim
, space
, 0);
574 isl_space_free(space
);
578 pw
= FN(PW
,copy
)(pw
);
579 pw
= data
->fn(pw
, isl_set_copy(entry2
->data
));
581 data
->res
= FN(FN(UNION
,add
),PARTS
)(data
->res
, pw
);
588 /* Apply fn to each pair of PW in u and set in uset such that
589 * the set lives in the same space as the domain of PW
590 * and collect the results.
592 static __isl_give UNION
*match_domain_op(__isl_take UNION
*u
,
593 __isl_take isl_union_set
*uset
,
594 __isl_give PW
*(*fn
)(__isl_take PW
*, __isl_take isl_set
*))
596 S(UNION
,match_domain_data
) data
= { NULL
, NULL
, fn
};
598 u
= FN(UNION
,align_params
)(u
, isl_union_set_get_space(uset
));
599 uset
= isl_union_set_align_params(uset
, FN(UNION
,get_space
)(u
));
606 data
.res
= FN(UNION
,alloc
)(isl_space_copy(u
->dim
), u
->type
, u
->table
.n
);
608 data
.res
= FN(UNION
,alloc
)(isl_space_copy(u
->dim
), u
->table
.n
);
610 if (isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
,
611 &match_domain_entry
, &data
) < 0)
615 isl_union_set_free(uset
);
619 isl_union_set_free(uset
);
620 FN(UNION
,free
)(data
.res
);
624 /* Intersect the domain of "u" with "uset".
625 * If "uset" is a parameters domain, then intersect the parameter
626 * domain of "u" with this set.
628 __isl_give UNION
*FN(UNION
,intersect_domain
)(__isl_take UNION
*u
,
629 __isl_take isl_union_set
*uset
)
631 if (isl_union_set_is_params(uset
))
632 return FN(UNION
,intersect_params
)(u
,
633 isl_set_from_union_set(uset
));
634 return match_domain_op(u
, uset
, &FN(PW
,intersect_domain
));
637 __isl_give UNION
*FN(UNION
,gist
)(__isl_take UNION
*u
,
638 __isl_take isl_union_set
*uset
)
640 if (isl_union_set_is_params(uset
))
641 return FN(UNION
,gist_params
)(u
, isl_set_from_union_set(uset
));
642 return match_domain_op(u
, uset
, &FN(PW
,gist
));
646 __isl_give isl_val
*FN(UNION
,eval
)(__isl_take UNION
*u
,
647 __isl_take isl_point
*pnt
)
650 struct isl_hash_table_entry
*entry
;
657 space
= isl_space_copy(pnt
->dim
);
658 space
= isl_space_from_domain(space
);
659 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
662 hash
= isl_space_get_hash(space
);
663 entry
= isl_hash_table_find(u
->dim
->ctx
, &u
->table
,
664 hash
, &has_dim
, space
, 0);
665 isl_space_free(space
);
667 v
= isl_val_zero(isl_point_get_ctx(pnt
));
670 v
= FN(PART
,eval
)(FN(PART
,copy
)(entry
->data
), pnt
);
681 static int coalesce_entry(void **entry
, void *user
)
683 PW
**pw
= (PW
**)entry
;
685 *pw
= FN(PW
,coalesce
)(*pw
);
692 __isl_give UNION
*FN(UNION
,coalesce
)(__isl_take UNION
*u
)
697 if (isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
,
698 &coalesce_entry
, NULL
) < 0)
707 static int domain(__isl_take PART
*part
, void *user
)
709 isl_union_set
**uset
= (isl_union_set
**)user
;
711 *uset
= isl_union_set_add_set(*uset
, FN(PART
,domain
)(part
));
716 __isl_give isl_union_set
*FN(UNION
,domain
)(__isl_take UNION
*u
)
720 uset
= isl_union_set_empty(FN(UNION
,get_space
)(u
));
721 if (FN(FN(UNION
,foreach
),PARTS
)(u
, &domain
, &uset
) < 0)
728 isl_union_set_free(uset
);
733 static int mul_isl_int(void **entry
, void *user
)
735 PW
**pw
= (PW
**)entry
;
738 *pw
= FN(PW
,mul_isl_int
)(*pw
, *v
);
745 __isl_give UNION
*FN(UNION
,mul_isl_int
)(__isl_take UNION
*u
, isl_int v
)
747 if (isl_int_is_one(v
))
750 if (DEFAULT_IS_ZERO
&& u
&& isl_int_is_zero(v
)) {
752 isl_space
*dim
= FN(UNION
,get_space
)(u
);
754 zero
= FN(UNION
,ZERO
)(dim
, u
->type
);
756 zero
= FN(UNION
,ZERO
)(dim
);
762 u
= FN(UNION
,cow
)(u
);
767 if (isl_int_is_neg(v
))
768 u
->type
= isl_fold_type_negate(u
->type
);
770 if (isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
,
771 &mul_isl_int
, &v
) < 0)
780 /* Multiply *entry by the isl_val "user".
782 * Return 0 on success and -1 on error.
784 static int scale_val(void **entry
, void *user
)
786 PW
**pw
= (PW
**)entry
;
789 *pw
= FN(PW
,scale_val
)(*pw
, isl_val_copy(v
));
796 /* Multiply "u" by "v" and return the result.
798 __isl_give UNION
*FN(UNION
,scale_val
)(__isl_take UNION
*u
,
799 __isl_take isl_val
*v
)
803 if (isl_val_is_one(v
)) {
808 if (DEFAULT_IS_ZERO
&& u
&& isl_val_is_zero(v
)) {
810 isl_space
*space
= FN(UNION
,get_space
)(u
);
812 zero
= FN(UNION
,ZERO
)(space
, u
->type
);
814 zero
= FN(UNION
,ZERO
)(space
);
821 if (!isl_val_is_rat(v
))
822 isl_die(isl_val_get_ctx(v
), isl_error_invalid
,
823 "expecting rational factor", goto error
);
825 u
= FN(UNION
,cow
)(u
);
830 if (isl_val_is_neg(v
))
831 u
->type
= isl_fold_type_negate(u
->type
);
833 if (isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
, &scale_val
, v
) < 0)
844 S(UNION
,plain_is_equal_data
)
850 static int plain_is_equal_entry(void **entry
, void *user
)
852 S(UNION
,plain_is_equal_data
) *data
= user
;
854 struct isl_hash_table_entry
*entry2
;
857 hash
= isl_space_get_hash(pw
->dim
);
858 entry2
= isl_hash_table_find(data
->u2
->dim
->ctx
, &data
->u2
->table
,
859 hash
, &has_dim
, pw
->dim
, 0);
865 data
->is_equal
= FN(PW
,plain_is_equal
)(pw
, entry2
->data
);
866 if (data
->is_equal
< 0 || !data
->is_equal
)
872 int FN(UNION
,plain_is_equal
)(__isl_keep UNION
*u1
, __isl_keep UNION
*u2
)
874 S(UNION
,plain_is_equal_data
) data
= { NULL
, 1 };
880 if (u1
->table
.n
!= u2
->table
.n
)
883 u1
= FN(UNION
,copy
)(u1
);
884 u2
= FN(UNION
,copy
)(u2
);
885 u1
= FN(UNION
,align_params
)(u1
, FN(UNION
,get_space
)(u2
));
886 u2
= FN(UNION
,align_params
)(u2
, FN(UNION
,get_space
)(u1
));
891 if (isl_hash_table_foreach(u1
->dim
->ctx
, &u1
->table
,
892 &plain_is_equal_entry
, &data
) < 0 &&
899 return data
.is_equal
;