2 * Copyright 2010 INRIA Saclay
4 * Use of this software is governed by the GNU LGPLv2.1 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 (FN(PART
,is_zero
)(part
)) {
166 u
= FN(UNION
,cow
)(u
);
171 isl_assert(u
->dim
->ctx
, isl_space_match(part
->dim
, isl_dim_param
, u
->dim
,
172 isl_dim_param
), goto error
);
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 (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 void 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
);
267 static int align_entry(__isl_take PART
*part
, void *user
)
270 S(UNION
,align
) *data
= user
;
272 exp
= isl_reordering_extend_space(isl_reordering_copy(data
->exp
),
273 FN(PART
,get_domain_space
)(part
));
275 data
->res
= FN(FN(UNION
,add
),PARTS
)(data
->res
,
276 FN(PART
,realign_domain
)(part
, exp
));
281 static int align_entry(__isl_take PART
*part
, void *user
)
284 S(UNION
,align
) *data
= user
;
286 exp
= isl_reordering_extend_space(isl_reordering_copy(data
->exp
),
287 FN(PART
,get_space
)(part
));
289 data
->res
= FN(FN(UNION
,add
),PARTS
)(data
->res
,
290 FN(PART
,realign
)(part
, exp
));
296 __isl_give UNION
*FN(UNION
,align_params
)(__isl_take UNION
*u
,
297 __isl_take isl_space
*model
)
299 S(UNION
,align
) data
= { NULL
, NULL
};
304 if (isl_space_match(u
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
305 isl_space_free(model
);
309 data
.exp
= isl_parameter_alignment_reordering(u
->dim
, model
);
314 data
.res
= FN(UNION
,alloc
)(isl_space_copy(data
.exp
->dim
),
315 u
->type
, u
->table
.n
);
317 data
.res
= FN(UNION
,alloc
)(isl_space_copy(data
.exp
->dim
), u
->table
.n
);
319 if (FN(FN(UNION
,foreach
),PARTS
)(u
, &align_entry
, &data
) < 0)
322 isl_reordering_free(data
.exp
);
324 isl_space_free(model
);
327 isl_reordering_free(data
.exp
);
329 FN(UNION
,free
)(data
.res
);
330 isl_space_free(model
);
334 __isl_give UNION
*FN(UNION
,add
)(__isl_take UNION
*u1
, __isl_take UNION
*u2
)
336 u1
= FN(UNION
,align_params
)(u1
, FN(UNION
,get_space
)(u2
));
337 u2
= FN(UNION
,align_params
)(u2
, FN(UNION
,get_space
)(u1
));
339 u1
= FN(UNION
,cow
)(u1
);
344 if (FN(FN(UNION
,foreach
),PARTS
)(u2
, &add_part
, &u1
) < 0)
356 __isl_give UNION
*FN(FN(UNION
,from
),PARTS
)(__isl_take PART
*part
)
364 dim
= FN(PART
,get_space
)(part
);
365 dim
= isl_space_drop_dims(dim
, isl_dim_in
, 0, isl_space_dim(dim
, isl_dim_in
));
366 dim
= isl_space_drop_dims(dim
, isl_dim_out
, 0, isl_space_dim(dim
, isl_dim_out
));
368 u
= FN(UNION
,zero
)(dim
, part
->type
);
370 u
= FN(UNION
,zero
)(dim
);
372 u
= FN(FN(UNION
,add
),PARTS
)(u
, part
);
377 S(UNION
,match_bin_data
) {
382 /* This function is currently only used from isl_polynomial.c
383 * and not from isl_fold.c.
385 static __isl_give UNION
*match_bin_op(__isl_take UNION
*u1
,
386 __isl_take UNION
*u2
,
387 int (*fn
)(void **, void *)) __attribute__ ((unused
));
388 static __isl_give UNION
*match_bin_op(__isl_take UNION
*u1
,
389 __isl_take UNION
*u2
, int (*fn
)(void **, void *))
391 S(UNION
,match_bin_data
) data
= { NULL
, NULL
};
393 u1
= FN(UNION
,align_params
)(u1
, FN(UNION
,get_space
)(u2
));
394 u2
= FN(UNION
,align_params
)(u2
, FN(UNION
,get_space
)(u1
));
401 data
.res
= FN(UNION
,alloc
)(isl_space_copy(u1
->dim
), u1
->type
, u1
->table
.n
);
403 data
.res
= FN(UNION
,alloc
)(isl_space_copy(u1
->dim
), u1
->table
.n
);
405 if (isl_hash_table_foreach(u1
->dim
->ctx
, &u1
->table
, fn
, &data
) < 0)
414 FN(UNION
,free
)(data
.res
);
418 S(UNION
,match_set_data
) {
421 __isl_give PW
*(*fn
)(__isl_take PW
*, __isl_take isl_set
*);
424 static int set_has_dim(const void *entry
, const void *val
)
426 isl_set
*set
= (isl_set
*)entry
;
427 isl_space
*dim
= (isl_space
*)val
;
429 return isl_space_is_equal(set
->dim
, dim
);
432 static int match_set_entry(void **entry
, void *user
)
434 S(UNION
,match_set_data
) *data
= user
;
436 struct isl_hash_table_entry
*entry2
;
440 hash
= isl_space_get_hash(pw
->dim
);
441 entry2
= isl_hash_table_find(data
->uset
->dim
->ctx
, &data
->uset
->table
,
442 hash
, &set_has_dim
, pw
->dim
, 0);
446 pw
= FN(PW
,copy
)(pw
);
447 pw
= data
->fn(pw
, isl_set_copy(entry2
->data
));
449 empty
= FN(PW
,is_zero
)(pw
);
459 data
->res
= FN(FN(UNION
,add
),PARTS
)(data
->res
, pw
);
464 static __isl_give UNION
*match_set_op(__isl_take UNION
*u
,
465 __isl_take isl_union_set
*uset
,
466 __isl_give PW
*(*fn
)(__isl_take PW
*, __isl_take isl_set
*))
468 S(UNION
,match_set_data
) data
= { NULL
, NULL
, fn
};
470 u
= FN(UNION
,align_params
)(u
, isl_union_set_get_space(uset
));
471 uset
= isl_union_set_align_params(uset
, FN(UNION
,get_space
)(u
));
478 data
.res
= FN(UNION
,alloc
)(isl_space_copy(u
->dim
), u
->type
, u
->table
.n
);
480 data
.res
= FN(UNION
,alloc
)(isl_space_copy(u
->dim
), u
->table
.n
);
482 if (isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
,
483 &match_set_entry
, &data
) < 0)
487 isl_union_set_free(uset
);
491 isl_union_set_free(uset
);
492 FN(UNION
,free
)(data
.res
);
496 __isl_give UNION
*FN(UNION
,intersect_domain
)(__isl_take UNION
*u
,
497 __isl_take isl_union_set
*uset
)
499 return match_set_op(u
, uset
, &FN(PW
,intersect_domain
));
502 __isl_give UNION
*FN(UNION
,gist
)(__isl_take UNION
*u
,
503 __isl_take isl_union_set
*uset
)
505 return match_set_op(u
, uset
, &FN(PW
,gist
));
508 __isl_give isl_qpolynomial
*FN(UNION
,eval
)(__isl_take UNION
*u
,
509 __isl_take isl_point
*pnt
)
512 struct isl_hash_table_entry
*entry
;
519 space
= isl_space_copy(pnt
->dim
);
520 space
= isl_space_from_domain(space
);
521 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
524 hash
= isl_space_get_hash(space
);
525 entry
= isl_hash_table_find(u
->dim
->ctx
, &u
->table
,
526 hash
, &has_dim
, space
, 0);
527 isl_space_free(space
);
529 qp
= isl_qpolynomial_zero_on_domain(isl_space_copy(pnt
->dim
));
532 qp
= FN(PART
,eval
)(FN(PART
,copy
)(entry
->data
), pnt
);
542 static int coalesce_entry(void **entry
, void *user
)
544 PW
**pw
= (PW
**)entry
;
546 *pw
= FN(PW
,coalesce
)(*pw
);
553 __isl_give UNION
*FN(UNION
,coalesce
)(__isl_take UNION
*u
)
558 if (isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
,
559 &coalesce_entry
, NULL
) < 0)
568 static int domain(__isl_take PART
*part
, void *user
)
570 isl_union_set
**uset
= (isl_union_set
**)user
;
572 *uset
= isl_union_set_add_set(*uset
, FN(PART
,domain
)(part
));
577 __isl_give isl_union_set
*FN(UNION
,domain
)(__isl_take UNION
*u
)
581 uset
= isl_union_set_empty(FN(UNION
,get_space
)(u
));
582 if (FN(FN(UNION
,foreach
),PARTS
)(u
, &domain
, &uset
) < 0)
589 isl_union_set_free(uset
);
594 static int mul_isl_int(void **entry
, void *user
)
596 PW
**pw
= (PW
**)entry
;
599 *pw
= FN(PW
,mul_isl_int
)(*pw
, *v
);
606 __isl_give UNION
*FN(UNION
,mul_isl_int
)(__isl_take UNION
*u
, isl_int v
)
608 if (isl_int_is_one(v
))
611 if (u
&& isl_int_is_zero(v
)) {
613 isl_space
*dim
= FN(UNION
,get_space
)(u
);
615 zero
= FN(UNION
,zero
)(dim
, u
->type
);
617 zero
= FN(UNION
,zero
)(dim
);
623 u
= FN(UNION
,cow
)(u
);
628 if (isl_int_is_neg(v
))
629 u
->type
= isl_fold_type_negate(u
->type
);
631 if (isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
, &mul_isl_int
, v
) < 0)
640 S(UNION
,plain_is_equal_data
)
646 static int plain_is_equal_entry(void **entry
, void *user
)
648 S(UNION
,plain_is_equal_data
) *data
= user
;
650 struct isl_hash_table_entry
*entry2
;
653 hash
= isl_space_get_hash(pw
->dim
);
654 entry2
= isl_hash_table_find(data
->u2
->dim
->ctx
, &data
->u2
->table
,
655 hash
, &has_dim
, pw
->dim
, 0);
661 data
->is_equal
= FN(PW
,plain_is_equal
)(pw
, entry2
->data
);
662 if (data
->is_equal
< 0 || !data
->is_equal
)
668 int FN(UNION
,plain_is_equal
)(__isl_keep UNION
*u1
, __isl_keep UNION
*u2
)
670 S(UNION
,plain_is_equal_data
) data
= { NULL
, 1 };
676 if (u1
->table
.n
!= u2
->table
.n
)
679 u1
= FN(UNION
,copy
)(u1
);
680 u2
= FN(UNION
,copy
)(u2
);
681 u1
= FN(UNION
,align_params
)(u1
, FN(UNION
,get_space
)(u2
));
682 u2
= FN(UNION
,align_params
)(u2
, FN(UNION
,get_space
)(u1
));
687 if (isl_hash_table_foreach(u1
->dim
->ctx
, &u1
->table
,
688 &plain_is_equal_entry
, &data
) < 0 &&
695 return data
.is_equal
;