add isl_union_pw_multi_aff_from_domain
[isl.git] / isl_union_templ.c
blobdce36c09a2956ba1de15b3c425150cc7e86dca70
1 /*
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,
8 * 91893 Orsay, France
9 */
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)
16 struct UNION {
17 int ref;
18 #ifdef HAS_TYPE
19 enum isl_fold type;
20 #endif
21 isl_space *dim;
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)
35 if (!u)
36 return NULL;
37 return isl_space_copy(u->dim);
40 #ifdef HAS_TYPE
41 static __isl_give UNION *FN(UNION,alloc)(__isl_take isl_space *dim,
42 enum isl_fold type, int size)
43 #else
44 static __isl_give UNION *FN(UNION,alloc)(__isl_take isl_space *dim, int size)
45 #endif
47 UNION *u;
49 dim = isl_space_params(dim);
50 if (!dim)
51 return NULL;
53 u = isl_calloc_type(dim->ctx, UNION);
54 if (!u)
55 return NULL;
57 u->ref = 1;
58 #ifdef HAS_TYPE
59 u->type = type;
60 #endif
61 u->dim = dim;
62 if (isl_hash_table_init(dim->ctx, &u->table, size) < 0)
63 goto error;
65 return u;
66 error:
67 isl_space_free(dim);
68 FN(UNION,free)(u);
69 return NULL;
72 #ifdef HAS_TYPE
73 __isl_give UNION *FN(UNION,ZERO)(__isl_take isl_space *dim, enum isl_fold type)
75 return FN(UNION,alloc)(dim, type, 16);
77 #else
78 __isl_give UNION *FN(UNION,ZERO)(__isl_take isl_space *dim)
80 return FN(UNION,alloc)(dim, 16);
82 #endif
84 __isl_give UNION *FN(UNION,copy)(__isl_keep UNION *u)
86 if (!u)
87 return NULL;
89 u->ref++;
90 return u;
93 S(UNION,foreach_data)
95 int (*fn)(__isl_take PART *part, void *user);
96 void *user;
99 static int call_on_copy(void **entry, void *user)
101 PART *part = *entry;
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 };
112 if (!u)
113 return -1;
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)
130 uint32_t hash;
131 struct isl_hash_table_entry *entry;
133 if (!u || !dim)
134 goto error;
136 hash = isl_space_get_hash(dim);
137 entry = isl_hash_table_find(u->dim->ctx, &u->table, hash,
138 &has_dim, dim, 0);
139 if (!entry)
140 #ifdef HAS_TYPE
141 return FN(PART,ZERO)(dim, u->type);
142 #else
143 return FN(PART,ZERO)(dim);
144 #endif
145 isl_space_free(dim);
146 return FN(PART,copy)(entry->data);
147 error:
148 isl_space_free(dim);
149 return NULL;
152 __isl_give UNION *FN(FN(UNION,add),PARTS)(__isl_take UNION *u,
153 __isl_take PART *part)
155 uint32_t hash;
156 struct isl_hash_table_entry *entry;
158 if (!part)
159 goto error;
161 if (DEFAULT_IS_ZERO && FN(PART,IS_ZERO)(part)) {
162 FN(PART,free)(part);
163 return u;
166 u = FN(UNION,cow)(u);
168 if (!u)
169 goto error;
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);
177 if (!entry)
178 goto error;
180 if (!entry->data)
181 entry->data = part;
182 else {
183 entry->data = FN(PART,add)(entry->data, FN(PART,copy)(part));
184 if (!entry->data)
185 goto error;
186 FN(PART,free)(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);
193 return u;
194 error:
195 FN(PART,free)(part);
196 FN(UNION,free)(u);
197 return NULL;
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);
206 return 0;
209 __isl_give UNION *FN(UNION,dup)(__isl_keep UNION *u)
211 UNION *dup;
213 if (!u)
214 return NULL;
216 #ifdef HAS_TYPE
217 dup = FN(UNION,ZERO)(isl_space_copy(u->dim), u->type);
218 #else
219 dup = FN(UNION,ZERO)(isl_space_copy(u->dim));
220 #endif
221 if (FN(FN(UNION,foreach),PARTS)(u, &add_part, &dup) < 0)
222 goto error;
223 return dup;
224 error:
225 FN(UNION,free)(dup);
226 return NULL;
229 __isl_give UNION *FN(UNION,cow)(__isl_take UNION *u)
231 if (!u)
232 return NULL;
234 if (u->ref == 1)
235 return u;
236 u->ref--;
237 return FN(UNION,dup)(u);
240 static int free_u_entry(void **entry, void *user)
242 PART *part = *entry;
243 FN(PART,free)(part);
244 return 0;
247 void *FN(UNION,free)(__isl_take UNION *u)
249 if (!u)
250 return NULL;
252 if (--u->ref > 0)
253 return NULL;
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);
258 free(u);
259 return NULL;
262 S(UNION,align) {
263 isl_reordering *exp;
264 UNION *res;
267 #ifdef ALIGN_DOMAIN
268 static int align_entry(__isl_take PART *part, void *user)
270 isl_reordering *exp;
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));
279 return 0;
281 #else
282 static int align_entry(__isl_take PART *part, void *user)
284 isl_reordering *exp;
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));
293 return 0;
295 #endif
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 };
302 if (!u || !model)
303 goto error;
305 if (isl_space_match(u->dim, isl_dim_param, model, isl_dim_param)) {
306 isl_space_free(model);
307 return u;
310 data.exp = isl_parameter_alignment_reordering(u->dim, model);
311 if (!data.exp)
312 goto error;
314 #ifdef HAS_TYPE
315 data.res = FN(UNION,alloc)(isl_space_copy(data.exp->dim),
316 u->type, u->table.n);
317 #else
318 data.res = FN(UNION,alloc)(isl_space_copy(data.exp->dim), u->table.n);
319 #endif
320 if (FN(FN(UNION,foreach),PARTS)(u, &align_entry, &data) < 0)
321 goto error;
323 isl_reordering_free(data.exp);
324 FN(UNION,free)(u);
325 isl_space_free(model);
326 return data.res;
327 error:
328 isl_reordering_free(data.exp);
329 FN(UNION,free)(u);
330 FN(UNION,free)(data.res);
331 isl_space_free(model);
332 return NULL;
335 __isl_give UNION *FN(UNION,add)(__isl_take UNION *u1, __isl_take UNION *u2)
337 u1 = FN(UNION,align_params)(u1, FN(UNION,get_space)(u2));
338 u2 = FN(UNION,align_params)(u2, FN(UNION,get_space)(u1));
340 u1 = FN(UNION,cow)(u1);
342 if (!u1 || !u2)
343 goto error;
345 if (FN(FN(UNION,foreach),PARTS)(u2, &add_part, &u1) < 0)
346 goto error;
348 FN(UNION,free)(u2);
350 return u1;
351 error:
352 FN(UNION,free)(u1);
353 FN(UNION,free)(u2);
354 return NULL;
357 __isl_give UNION *FN(FN(UNION,from),PARTS)(__isl_take PART *part)
359 isl_space *dim;
360 UNION *u;
362 if (!part)
363 return NULL;
365 dim = FN(PART,get_space)(part);
366 dim = isl_space_drop_dims(dim, isl_dim_in, 0, isl_space_dim(dim, isl_dim_in));
367 dim = isl_space_drop_dims(dim, isl_dim_out, 0, isl_space_dim(dim, isl_dim_out));
368 #ifdef HAS_TYPE
369 u = FN(UNION,ZERO)(dim, part->type);
370 #else
371 u = FN(UNION,ZERO)(dim);
372 #endif
373 u = FN(FN(UNION,add),PARTS)(u, part);
375 return u;
378 S(UNION,match_bin_data) {
379 UNION *u2;
380 UNION *res;
383 /* This function is currently only used from isl_polynomial.c
384 * and not from isl_fold.c.
386 static __isl_give UNION *match_bin_op(__isl_take UNION *u1,
387 __isl_take UNION *u2,
388 int (*fn)(void **, void *)) __attribute__ ((unused));
389 static __isl_give UNION *match_bin_op(__isl_take UNION *u1,
390 __isl_take UNION *u2, int (*fn)(void **, void *))
392 S(UNION,match_bin_data) data = { NULL, NULL };
394 u1 = FN(UNION,align_params)(u1, FN(UNION,get_space)(u2));
395 u2 = FN(UNION,align_params)(u2, FN(UNION,get_space)(u1));
397 if (!u1 || !u2)
398 goto error;
400 data.u2 = u2;
401 #ifdef HAS_TYPE
402 data.res = FN(UNION,alloc)(isl_space_copy(u1->dim), u1->type, u1->table.n);
403 #else
404 data.res = FN(UNION,alloc)(isl_space_copy(u1->dim), u1->table.n);
405 #endif
406 if (isl_hash_table_foreach(u1->dim->ctx, &u1->table, fn, &data) < 0)
407 goto error;
409 FN(UNION,free)(u1);
410 FN(UNION,free)(u2);
411 return data.res;
412 error:
413 FN(UNION,free)(u1);
414 FN(UNION,free)(u2);
415 FN(UNION,free)(data.res);
416 return NULL;
419 S(UNION,any_set_data) {
420 isl_set *set;
421 UNION *res;
422 __isl_give PW *(*fn)(__isl_take PW*, __isl_take isl_set*);
425 static int any_set_entry(void **entry, void *user)
427 S(UNION,any_set_data) *data = user;
428 PW *pw = *entry;
430 pw = FN(PW,copy)(pw);
431 pw = data->fn(pw, isl_set_copy(data->set));
433 if (DEFAULT_IS_ZERO) {
434 int empty;
436 empty = FN(PW,IS_ZERO)(pw);
437 if (empty < 0) {
438 FN(PW,free)(pw);
439 return -1;
441 if (empty) {
442 FN(PW,free)(pw);
443 return 0;
447 data->res = FN(FN(UNION,add),PARTS)(data->res, pw);
449 return 0;
452 /* Update each element of "u" by calling "fn" on the element and "set".
454 static __isl_give UNION *any_set_op(__isl_take UNION *u,
455 __isl_take isl_set *set,
456 __isl_give PW *(*fn)(__isl_take PW*, __isl_take isl_set*))
458 S(UNION,any_set_data) data = { NULL, NULL, fn };
460 u = FN(UNION,align_params)(u, isl_set_get_space(set));
461 set = isl_set_align_params(set, FN(UNION,get_space)(u));
463 if (!u || !set)
464 goto error;
466 data.set = set;
467 #ifdef HAS_TYPE
468 data.res = FN(UNION,alloc)(isl_space_copy(u->dim), u->type, u->table.n);
469 #else
470 data.res = FN(UNION,alloc)(isl_space_copy(u->dim), u->table.n);
471 #endif
472 if (isl_hash_table_foreach(u->dim->ctx, &u->table,
473 &any_set_entry, &data) < 0)
474 goto error;
476 FN(UNION,free)(u);
477 isl_set_free(set);
478 return data.res;
479 error:
480 FN(UNION,free)(u);
481 isl_set_free(set);
482 FN(UNION,free)(data.res);
483 return NULL;
486 /* Intersect the domain of "u" with the parameter domain "context".
488 __isl_give UNION *FN(UNION,intersect_params)(__isl_take UNION *u,
489 __isl_take isl_set *set)
491 return any_set_op(u, set, &FN(PW,intersect_params));
494 /* Compute the gist of the domain of "u" with respect to
495 * the parameter domain "context".
497 __isl_give UNION *FN(UNION,gist_params)(__isl_take UNION *u,
498 __isl_take isl_set *set)
500 return any_set_op(u, set, &FN(PW,gist_params));
503 S(UNION,match_domain_data) {
504 isl_union_set *uset;
505 UNION *res;
506 __isl_give PW *(*fn)(__isl_take PW*, __isl_take isl_set*);
509 static int set_has_dim(const void *entry, const void *val)
511 isl_set *set = (isl_set *)entry;
512 isl_space *dim = (isl_space *)val;
514 return isl_space_is_equal(set->dim, dim);
517 /* Find the set in data->uset that live in the same space as the domain
518 * of *entry, apply data->fn to *entry and this set (if any), and add
519 * the result to data->res.
521 static int match_domain_entry(void **entry, void *user)
523 S(UNION,match_domain_data) *data = user;
524 uint32_t hash;
525 struct isl_hash_table_entry *entry2;
526 PW *pw = *entry;
527 isl_space *space;
529 space = FN(PW,get_domain_space)(pw);
530 hash = isl_space_get_hash(space);
531 entry2 = isl_hash_table_find(data->uset->dim->ctx, &data->uset->table,
532 hash, &set_has_dim, space, 0);
533 isl_space_free(space);
534 if (!entry2)
535 return 0;
537 pw = FN(PW,copy)(pw);
538 pw = data->fn(pw, isl_set_copy(entry2->data));
540 if (DEFAULT_IS_ZERO) {
541 int empty;
543 empty = FN(PW,IS_ZERO)(pw);
544 if (empty < 0) {
545 FN(PW,free)(pw);
546 return -1;
548 if (empty) {
549 FN(PW,free)(pw);
550 return 0;
554 data->res = FN(FN(UNION,add),PARTS)(data->res, pw);
556 return 0;
559 /* Apply fn to each pair of PW in u and set in uset such that
560 * the set lives in the same space as the domain of PW
561 * and collect the results.
563 static __isl_give UNION *match_domain_op(__isl_take UNION *u,
564 __isl_take isl_union_set *uset,
565 __isl_give PW *(*fn)(__isl_take PW*, __isl_take isl_set*))
567 S(UNION,match_domain_data) data = { NULL, NULL, fn };
569 u = FN(UNION,align_params)(u, isl_union_set_get_space(uset));
570 uset = isl_union_set_align_params(uset, FN(UNION,get_space)(u));
572 if (!u || !uset)
573 goto error;
575 data.uset = uset;
576 #ifdef HAS_TYPE
577 data.res = FN(UNION,alloc)(isl_space_copy(u->dim), u->type, u->table.n);
578 #else
579 data.res = FN(UNION,alloc)(isl_space_copy(u->dim), u->table.n);
580 #endif
581 if (isl_hash_table_foreach(u->dim->ctx, &u->table,
582 &match_domain_entry, &data) < 0)
583 goto error;
585 FN(UNION,free)(u);
586 isl_union_set_free(uset);
587 return data.res;
588 error:
589 FN(UNION,free)(u);
590 isl_union_set_free(uset);
591 FN(UNION,free)(data.res);
592 return NULL;
595 /* Intersect the domain of "u" with "uset".
596 * If "uset" is a parameters domain, then intersect the parameter
597 * domain of "u" with this set.
599 __isl_give UNION *FN(UNION,intersect_domain)(__isl_take UNION *u,
600 __isl_take isl_union_set *uset)
602 if (isl_union_set_is_params(uset))
603 return FN(UNION,intersect_params)(u,
604 isl_set_from_union_set(uset));
605 return match_domain_op(u, uset, &FN(PW,intersect_domain));
608 __isl_give UNION *FN(UNION,gist)(__isl_take UNION *u,
609 __isl_take isl_union_set *uset)
611 if (isl_union_set_is_params(uset))
612 return FN(UNION,gist_params)(u, isl_set_from_union_set(uset));
613 return match_domain_op(u, uset, &FN(PW,gist));
616 #ifndef NO_EVAL
617 __isl_give isl_qpolynomial *FN(UNION,eval)(__isl_take UNION *u,
618 __isl_take isl_point *pnt)
620 uint32_t hash;
621 struct isl_hash_table_entry *entry;
622 isl_space *space;
623 isl_qpolynomial *qp;
625 if (!u || !pnt)
626 goto error;
628 space = isl_space_copy(pnt->dim);
629 space = isl_space_from_domain(space);
630 space = isl_space_add_dims(space, isl_dim_out, 1);
631 if (!space)
632 goto error;
633 hash = isl_space_get_hash(space);
634 entry = isl_hash_table_find(u->dim->ctx, &u->table,
635 hash, &has_dim, space, 0);
636 isl_space_free(space);
637 if (!entry) {
638 qp = isl_qpolynomial_zero_on_domain(isl_space_copy(pnt->dim));
639 isl_point_free(pnt);
640 } else {
641 qp = FN(PART,eval)(FN(PART,copy)(entry->data), pnt);
643 FN(UNION,free)(u);
644 return qp;
645 error:
646 FN(UNION,free)(u);
647 isl_point_free(pnt);
648 return NULL;
650 #endif
652 static int coalesce_entry(void **entry, void *user)
654 PW **pw = (PW **)entry;
656 *pw = FN(PW,coalesce)(*pw);
657 if (!*pw)
658 return -1;
660 return 0;
663 __isl_give UNION *FN(UNION,coalesce)(__isl_take UNION *u)
665 if (!u)
666 return NULL;
668 if (isl_hash_table_foreach(u->dim->ctx, &u->table,
669 &coalesce_entry, NULL) < 0)
670 goto error;
672 return u;
673 error:
674 FN(UNION,free)(u);
675 return NULL;
678 static int domain(__isl_take PART *part, void *user)
680 isl_union_set **uset = (isl_union_set **)user;
682 *uset = isl_union_set_add_set(*uset, FN(PART,domain)(part));
684 return 0;
687 __isl_give isl_union_set *FN(UNION,domain)(__isl_take UNION *u)
689 isl_union_set *uset;
691 uset = isl_union_set_empty(FN(UNION,get_space)(u));
692 if (FN(FN(UNION,foreach),PARTS)(u, &domain, &uset) < 0)
693 goto error;
695 FN(UNION,free)(u);
697 return uset;
698 error:
699 isl_union_set_free(uset);
700 FN(UNION,free)(u);
701 return NULL;
704 static int mul_isl_int(void **entry, void *user)
706 PW **pw = (PW **)entry;
707 isl_int *v = user;
709 *pw = FN(PW,mul_isl_int)(*pw, *v);
710 if (!*pw)
711 return -1;
713 return 0;
716 __isl_give UNION *FN(UNION,mul_isl_int)(__isl_take UNION *u, isl_int v)
718 if (isl_int_is_one(v))
719 return u;
721 if (DEFAULT_IS_ZERO && u && isl_int_is_zero(v)) {
722 UNION *zero;
723 isl_space *dim = FN(UNION,get_space)(u);
724 #ifdef HAS_TYPE
725 zero = FN(UNION,ZERO)(dim, u->type);
726 #else
727 zero = FN(UNION,ZERO)(dim);
728 #endif
729 FN(UNION,free)(u);
730 return zero;
733 u = FN(UNION,cow)(u);
734 if (!u)
735 return NULL;
737 #ifdef HAS_TYPE
738 if (isl_int_is_neg(v))
739 u->type = isl_fold_type_negate(u->type);
740 #endif
741 if (isl_hash_table_foreach(u->dim->ctx, &u->table, &mul_isl_int, v) < 0)
742 goto error;
744 return u;
745 error:
746 FN(UNION,free)(u);
747 return NULL;
750 S(UNION,plain_is_equal_data)
752 UNION *u2;
753 int is_equal;
756 static int plain_is_equal_entry(void **entry, void *user)
758 S(UNION,plain_is_equal_data) *data = user;
759 uint32_t hash;
760 struct isl_hash_table_entry *entry2;
761 PW *pw = *entry;
763 hash = isl_space_get_hash(pw->dim);
764 entry2 = isl_hash_table_find(data->u2->dim->ctx, &data->u2->table,
765 hash, &has_dim, pw->dim, 0);
766 if (!entry2) {
767 data->is_equal = 0;
768 return -1;
771 data->is_equal = FN(PW,plain_is_equal)(pw, entry2->data);
772 if (data->is_equal < 0 || !data->is_equal)
773 return -1;
775 return 0;
778 int FN(UNION,plain_is_equal)(__isl_keep UNION *u1, __isl_keep UNION *u2)
780 S(UNION,plain_is_equal_data) data = { NULL, 1 };
782 if (!u1 || !u2)
783 return -1;
784 if (u1 == u2)
785 return 1;
786 if (u1->table.n != u2->table.n)
787 return 0;
789 u1 = FN(UNION,copy)(u1);
790 u2 = FN(UNION,copy)(u2);
791 u1 = FN(UNION,align_params)(u1, FN(UNION,get_space)(u2));
792 u2 = FN(UNION,align_params)(u2, FN(UNION,get_space)(u1));
793 if (!u1 || !u2)
794 goto error;
796 data.u2 = u2;
797 if (isl_hash_table_foreach(u1->dim->ctx, &u1->table,
798 &plain_is_equal_entry, &data) < 0 &&
799 data.is_equal)
800 goto error;
802 FN(UNION,free)(u1);
803 FN(UNION,free)(u2);
805 return data.is_equal;
806 error:
807 FN(UNION,free)(u1);
808 FN(UNION,free)(u2);
809 return -1;