?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
only allow a single isl_pw_* object with given domain space in isl_union_pw_*
[isl.git] / isl_union_templ.c
blob63f2101ef3339d646aba96344e2c8e0b1067272f
1 /*
2 * Copyright 2010 INRIA Saclay
3 *
4 * Use of this software is governed by the MIT license
5 *
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 */
10
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)
15
16 struct UNION {
17 int ref;
18 #ifdef HAS_TYPE
19 enum isl_fold type;
20 #endif
21 isl_space *space;
22
23 struct isl_hash_table table;
24 };
25
26 __isl_give UNION *FN(UNION,cow)(__isl_take UNION *u);
27
28 isl_ctx *FN(UNION,get_ctx)(__isl_keep UNION *u)
29 {
30 return u ? u->space->ctx : NULL;
31 }
32
33 __isl_give isl_space *FN(UNION,get_space)(__isl_keep UNION *u)
34 {
35 if (!u)
36 return NULL;
37 return isl_space_copy(u->space);
38 }
39
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
46 {
47 UNION *u;
48
49 dim = isl_space_params(dim);
50 if (!dim)
51 return NULL;
52
53 u = isl_calloc_type(dim->ctx, UNION);
54 if (!u)
55 goto error;
56
57 u->ref = 1;
58 #ifdef HAS_TYPE
59 u->type = type;
60 #endif
61 u->space = dim;
62 if (isl_hash_table_init(dim->ctx, &u->table, size) < 0)
63 return FN(UNION,free)(u);
64
65 return u;
66 error:
67 isl_space_free(dim);
68 return NULL;
69 }
70
71 #ifdef HAS_TYPE
72 __isl_give UNION *FN(UNION,ZERO)(__isl_take isl_space *dim, enum isl_fold type)
73 {
74 return FN(UNION,alloc)(dim, type, 16);
75 }
76 #else
77 __isl_give UNION *FN(UNION,ZERO)(__isl_take isl_space *dim)
78 {
79 return FN(UNION,alloc)(dim, 16);
80 }
81 #endif
82
83 __isl_give UNION *FN(UNION,copy)(__isl_keep UNION *u)
84 {
85 if (!u)
86 return NULL;
87
88 u->ref++;
89 return u;
90 }
91
92 S(UNION,foreach_data)
93 {
94 int (*fn)(__isl_take PART *part, void *user);
95 void *user;
96 };
97
98 static int call_on_copy(void **entry, void *user)
99 {
100 PART *part = *entry;
101 S(UNION,foreach_data) *data = (S(UNION,foreach_data) *)user;
102
103 return data->fn(FN(PART,copy)(part), data->user);
104 }
105
106 int FN(FN(UNION,foreach),PARTS)(__isl_keep UNION *u,
107 int (*fn)(__isl_take PART *part, void *user), void *user)
108 {
109 S(UNION,foreach_data) data = { fn, user };
110
111 if (!u)
112 return -1;
113
114 return isl_hash_table_foreach(u->space->ctx, &u->table,
115 &call_on_copy, &data);
116 }
117
118 /* Is the space of "entry" equal to "space"?
119 */
120 static int has_space(const void *entry, const void *val)
121 {
122 PART *part = (PART *)entry;
123 isl_space *space = (isl_space *) val;
124
125 return isl_space_is_equal(part->dim, space);
126 }
127
128 /* This function is not currently used by isl_aff.c.
129 */
130 static int has_domain_space(const void *entry, const void *val)
131 __attribute__ ((unused));
132
133 /* Is the domain space of "entry" equal to "space"?
134 */
135 static int has_domain_space(const void *entry, const void *val)
136 {
137 PART *part = (PART *)entry;
138 isl_space *space = (isl_space *) val;
139
140 if (isl_space_is_params(space))
141 return isl_space_is_set(part->dim);
142
143 return isl_space_tuple_is_equal(part->dim, isl_dim_in,
144 space, isl_dim_set);
145 }
146
147 /* Is the domain space of "entry" equal to the domain of "space"?
148 */
149 static int has_same_domain_space(const void *entry, const void *val)
150 {
151 PART *part = (PART *)entry;
152 isl_space *space = (isl_space *) val;
153
154 if (isl_space_is_set(space))
155 return isl_space_is_set(part->dim);
156
157 return isl_space_tuple_is_equal(part->dim, isl_dim_in,
158 space, isl_dim_in);
159 }
160
161 /* Extract the element of "u" living in "space".
162 *
163 * Return the ZERO element if "u" does not contain any element
164 * living in "space".
165 */
166 __isl_give PART *FN(FN(UNION,extract),PARTS)(__isl_keep UNION *u,
167 __isl_take isl_space *space)
168 {
169 uint32_t hash;
170 struct isl_hash_table_entry *entry;
171
172 if (!u || !space)
173 goto error;
174
175 hash = isl_space_get_hash(space);
176 entry = isl_hash_table_find(u->space->ctx, &u->table, hash,
177 &has_space, space, 0);
178 if (!entry)
179 #ifdef HAS_TYPE
180 return FN(PART,ZERO)(space, u->type);
181 #else
182 return FN(PART,ZERO)(space);
183 #endif
184 isl_space_free(space);
185 return FN(PART,copy)(entry->data);
186 error:
187 isl_space_free(space);
188 return NULL;
189 }
190
191 __isl_give UNION *FN(FN(UNION,add),PARTS)(__isl_take UNION *u,
192 __isl_take PART *part)
193 {
194 int empty;
195 uint32_t hash;
196 struct isl_hash_table_entry *entry;
197
198 if (!part)
199 goto error;
200
201 empty = FN(PART,IS_ZERO)(part);
202 if (empty < 0)
203 goto error;
204 if (empty) {
205 FN(PART,free)(part);
206 return u;
207 }
208
209 u = FN(UNION,align_params)(u, FN(PART,get_space)(part));
210 part = FN(PART,align_params)(part, FN(UNION,get_space)(u));
211
212 u = FN(UNION,cow)(u);
213
214 if (!u)
215 goto error;
216
217 hash = isl_space_get_hash(part->dim);
218 entry = isl_hash_table_find(u->space->ctx, &u->table, hash,
219 &has_same_domain_space, part->dim, 1);
220 if (!entry)
221 goto error;
222
223 if (!entry->data)
224 entry->data = part;
225 else {
226 PART *entry_part = entry->data;
227 if (!isl_space_tuple_is_equal(entry_part->dim, isl_dim_out,
228 part->dim, isl_dim_out))
229 isl_die(FN(UNION,get_ctx)(u), isl_error_invalid,
230 "union expression can only contain a single "
231 "expression over a given domain", goto error);
232 entry->data = FN(PART,add)(entry->data, FN(PART,copy)(part));
233 if (!entry->data)
234 goto error;
235 empty = FN(PART,IS_ZERO)(part);
236 if (empty < 0)
237 goto error;
238 if (empty) {
239 FN(PART,free)(entry->data);
240 isl_hash_table_remove(u->space->ctx, &u->table, entry);
241 }
242 FN(PART,free)(part);
243 }
244
245 return u;
246 error:
247 FN(PART,free)(part);
248 FN(UNION,free)(u);
249 return NULL;
250 }
251
252 static int add_part(__isl_take PART *part, void *user)
253 {
254 UNION **u = (UNION **)user;
255
256 *u = FN(FN(UNION,add),PARTS)(*u, part);
257
258 return 0;
259 }
260
261 __isl_give UNION *FN(UNION,dup)(__isl_keep UNION *u)
262 {
263 UNION *dup;
264
265 if (!u)
266 return NULL;
267
268 #ifdef HAS_TYPE
269 dup = FN(UNION,ZERO)(isl_space_copy(u->space), u->type);
270 #else
271 dup = FN(UNION,ZERO)(isl_space_copy(u->space));
272 #endif
273 if (FN(FN(UNION,foreach),PARTS)(u, &add_part, &dup) < 0)
274 goto error;
275 return dup;
276 error:
277 FN(UNION,free)(dup);
278 return NULL;
279 }
280
281 __isl_give UNION *FN(UNION,cow)(__isl_take UNION *u)
282 {
283 if (!u)
284 return NULL;
285
286 if (u->ref == 1)
287 return u;
288 u->ref--;
289 return FN(UNION,dup)(u);
290 }
291
292 static int free_u_entry(void **entry, void *user)
293 {
294 PART *part = *entry;
295 FN(PART,free)(part);
296 return 0;
297 }
298
299 __isl_null UNION *FN(UNION,free)(__isl_take UNION *u)
300 {
301 if (!u)
302 return NULL;
303
304 if (--u->ref > 0)
305 return NULL;
306
307 isl_hash_table_foreach(u->space->ctx, &u->table, &free_u_entry, NULL);
308 isl_hash_table_clear(&u->table);
309 isl_space_free(u->space);
310 free(u);
311 return NULL;
312 }
313
314 S(UNION,align) {
315 isl_reordering *exp;
316 UNION *res;
317 };
318
319 #ifdef ALIGN_DOMAIN
320 static int align_entry(__isl_take PART *part, void *user)
321 {
322 isl_reordering *exp;
323 S(UNION,align) *data = user;
324
325 exp = isl_reordering_extend_space(isl_reordering_copy(data->exp),
326 FN(PART,get_domain_space)(part));
327
328 data->res = FN(FN(UNION,add),PARTS)(data->res,
329 FN(PART,realign_domain)(part, exp));
330
331 return 0;
332 }
333 #else
334 static int align_entry(__isl_take PART *part, void *user)
335 {
336 isl_reordering *exp;
337 S(UNION,align) *data = user;
338
339 exp = isl_reordering_extend_space(isl_reordering_copy(data->exp),
340 FN(PART,get_space)(part));
341
342 data->res = FN(FN(UNION,add),PARTS)(data->res,
343 FN(PART,realign)(part, exp));
344
345 return 0;
346 }
347 #endif
348
349 __isl_give UNION *FN(UNION,align_params)(__isl_take UNION *u,
350 __isl_take isl_space *model)
351 {
352 S(UNION,align) data = { NULL, NULL };
353
354 if (!u || !model)
355 goto error;
356
357 if (isl_space_match(u->space, isl_dim_param, model, isl_dim_param)) {
358 isl_space_free(model);
359 return u;
360 }
361
362 model = isl_space_params(model);
363 data.exp = isl_parameter_alignment_reordering(u->space, model);
364 if (!data.exp)
365 goto error;
366
367 #ifdef HAS_TYPE
368 data.res = FN(UNION,alloc)(isl_space_copy(data.exp->dim),
369 u->type, u->table.n);
370 #else
371 data.res = FN(UNION,alloc)(isl_space_copy(data.exp->dim), u->table.n);
372 #endif
373 if (FN(FN(UNION,foreach),PARTS)(u, &align_entry, &data) < 0)
374 goto error;
375
376 isl_reordering_free(data.exp);
377 FN(UNION,free)(u);
378 isl_space_free(model);
379 return data.res;
380 error:
381 isl_reordering_free(data.exp);
382 FN(UNION,free)(u);
383 FN(UNION,free)(data.res);
384 isl_space_free(model);
385 return NULL;
386 }
387
388 __isl_give UNION *FN(UNION,add)(__isl_take UNION *u1, __isl_take UNION *u2)
389 {
390 u1 = FN(UNION,align_params)(u1, FN(UNION,get_space)(u2));
391 u2 = FN(UNION,align_params)(u2, FN(UNION,get_space)(u1));
392
393 u1 = FN(UNION,cow)(u1);
394
395 if (!u1 || !u2)
396 goto error;
397
398 if (FN(FN(UNION,foreach),PARTS)(u2, &add_part, &u1) < 0)
399 goto error;
400
401 FN(UNION,free)(u2);
402
403 return u1;
404 error:
405 FN(UNION,free)(u1);
406 FN(UNION,free)(u2);
407 return NULL;
408 }
409
410 __isl_give UNION *FN(FN(UNION,from),PARTS)(__isl_take PART *part)
411 {
412 isl_space *dim;
413 UNION *u;
414
415 if (!part)
416 return NULL;
417
418 dim = FN(PART,get_space)(part);
419 dim = isl_space_drop_dims(dim, isl_dim_in, 0, isl_space_dim(dim, isl_dim_in));
420 dim = isl_space_drop_dims(dim, isl_dim_out, 0, isl_space_dim(dim, isl_dim_out));
421 #ifdef HAS_TYPE
422 u = FN(UNION,ZERO)(dim, part->type);
423 #else
424 u = FN(UNION,ZERO)(dim);
425 #endif
426 u = FN(FN(UNION,add),PARTS)(u, part);
427
428 return u;
429 }
430
431 S(UNION,match_bin_data) {
432 UNION *u2;
433 UNION *res;
434 __isl_give PART *(*fn)(__isl_take PART *, __isl_take PART *);
435 };
436
437 /* Check if data->u2 has an element living in the same space as *entry.
438 * If so, call data->fn on the two elements and add the result to
439 * data->res.
440 */
441 static int match_bin_entry(void **entry, void *user)
442 {
443 S(UNION,match_bin_data) *data = user;
444 uint32_t hash;
445 struct isl_hash_table_entry *entry2;
446 isl_space *space;
447 PART *part = *entry;
448 PART *part2;
449
450 space = FN(PART,get_space)(part);
451 hash = isl_space_get_hash(space);
452 entry2 = isl_hash_table_find(data->u2->space->ctx, &data->u2->table,
453 hash, &has_same_domain_space, space, 0);
454 isl_space_free(space);
455 if (!entry2)
456 return 0;
457
458 part2 = entry2->data;
459 if (!isl_space_tuple_is_equal(part->dim, isl_dim_out,
460 part2->dim, isl_dim_out))
461 isl_die(FN(UNION,get_ctx)(data->u2), isl_error_invalid,
462 "entries should have the same range space",
463 return -1);
464
465 part = FN(PART, copy)(part);
466 part = data->fn(part, FN(PART, copy)(entry2->data));
467
468 data->res = FN(FN(UNION,add),PARTS)(data->res, part);
469 if (!data->res)
470 return -1;
471
472 return 0;
473 }
474
475 /* This function is currently only used from isl_polynomial.c
476 * and not from isl_fold.c.
477 */
478 static __isl_give UNION *match_bin_op(__isl_take UNION *u1,
479 __isl_take UNION *u2,
480 __isl_give PART *(*fn)(__isl_take PART *, __isl_take PART *))
481 __attribute__ ((unused));
482 /* For each pair of elements in "u1" and "u2" living in the same space,
483 * call "fn" and collect the results.
484 */
485 static __isl_give UNION *match_bin_op(__isl_take UNION *u1,
486 __isl_take UNION *u2,
487 __isl_give PART *(*fn)(__isl_take PART *, __isl_take PART *))
488 {
489 S(UNION,match_bin_data) data = { NULL, NULL, fn };
490
491 u1 = FN(UNION,align_params)(u1, FN(UNION,get_space)(u2));
492 u2 = FN(UNION,align_params)(u2, FN(UNION,get_space)(u1));
493
494 if (!u1 || !u2)
495 goto error;
496
497 data.u2 = u2;
498 #ifdef HAS_TYPE
499 data.res = FN(UNION,alloc)(isl_space_copy(u1->space), u1->type,
500 u1->table.n);
501 #else
502 data.res = FN(UNION,alloc)(isl_space_copy(u1->space), u1->table.n);
503 #endif
504 if (isl_hash_table_foreach(u1->space->ctx, &u1->table,
505 &match_bin_entry, &data) < 0)
506 goto error;
507
508 FN(UNION,free)(u1);
509 FN(UNION,free)(u2);
510 return data.res;
511 error:
512 FN(UNION,free)(u1);
513 FN(UNION,free)(u2);
514 FN(UNION,free)(data.res);
515 return NULL;
516 }
517
518 #ifndef NO_SUB
519 /* Subtract "u2" from "u1" and return the result.
520 */
521 __isl_give UNION *FN(UNION,sub)(__isl_take UNION *u1, __isl_take UNION *u2)
522 {
523 return match_bin_op(u1, u2, &FN(PART,sub));
524 }
525 #endif
526
527 S(UNION,any_set_data) {
528 isl_set *set;
529 UNION *res;
530 __isl_give PW *(*fn)(__isl_take PW*, __isl_take isl_set*);
531 };
532
533 static int any_set_entry(void **entry, void *user)
534 {
535 S(UNION,any_set_data) *data = user;
536 PW *pw = *entry;
537
538 pw = FN(PW,copy)(pw);
539 pw = data->fn(pw, isl_set_copy(data->set));
540
541 data->res = FN(FN(UNION,add),PARTS)(data->res, pw);
542 if (!data->res)
543 return -1;
544
545 return 0;
546 }
547
548 /* Update each element of "u" by calling "fn" on the element and "set".
549 */
550 static __isl_give UNION *any_set_op(__isl_take UNION *u,
551 __isl_take isl_set *set,
552 __isl_give PW *(*fn)(__isl_take PW*, __isl_take isl_set*))
553 {
554 S(UNION,any_set_data) data = { NULL, NULL, fn };
555
556 u = FN(UNION,align_params)(u, isl_set_get_space(set));
557 set = isl_set_align_params(set, FN(UNION,get_space)(u));
558
559 if (!u || !set)
560 goto error;
561
562 data.set = set;
563 #ifdef HAS_TYPE
564 data.res = FN(UNION,alloc)(isl_space_copy(u->space), u->type,
565 u->table.n);
566 #else
567 data.res = FN(UNION,alloc)(isl_space_copy(u->space), u->table.n);
568 #endif
569 if (isl_hash_table_foreach(u->space->ctx, &u->table,
570 &any_set_entry, &data) < 0)
571 goto error;
572
573 FN(UNION,free)(u);
574 isl_set_free(set);
575 return data.res;
576 error:
577 FN(UNION,free)(u);
578 isl_set_free(set);
579 FN(UNION,free)(data.res);
580 return NULL;
581 }
582
583 /* Intersect the domain of "u" with the parameter domain "context".
584 */
585 __isl_give UNION *FN(UNION,intersect_params)(__isl_take UNION *u,
586 __isl_take isl_set *set)
587 {
588 return any_set_op(u, set, &FN(PW,intersect_params));
589 }
590
591 /* Compute the gist of the domain of "u" with respect to
592 * the parameter domain "context".
593 */
594 __isl_give UNION *FN(UNION,gist_params)(__isl_take UNION *u,
595 __isl_take isl_set *set)
596 {
597 return any_set_op(u, set, &FN(PW,gist_params));
598 }
599
600 S(UNION,match_domain_data) {
601 isl_union_set *uset;
602 UNION *res;
603 __isl_give PW *(*fn)(__isl_take PW*, __isl_take isl_set*);
604 };
605
606 static int set_has_dim(const void *entry, const void *val)
607 {
608 isl_set *set = (isl_set *)entry;
609 isl_space *dim = (isl_space *)val;
610
611 return isl_space_is_equal(set->dim, dim);
612 }
613
614 /* Find the set in data->uset that lives in the same space as the domain
615 * of *entry, apply data->fn to *entry and this set (if any), and add
616 * the result to data->res.
617 */
618 static int match_domain_entry(void **entry, void *user)
619 {
620 S(UNION,match_domain_data) *data = user;
621 uint32_t hash;
622 struct isl_hash_table_entry *entry2;
623 PW *pw = *entry;
624 isl_space *space;
625
626 space = FN(PW,get_domain_space)(pw);
627 hash = isl_space_get_hash(space);
628 entry2 = isl_hash_table_find(data->uset->dim->ctx, &data->uset->table,
629 hash, &set_has_dim, space, 0);
630 isl_space_free(space);
631 if (!entry2)
632 return 0;
633
634 pw = FN(PW,copy)(pw);
635 pw = data->fn(pw, isl_set_copy(entry2->data));
636
637 data->res = FN(FN(UNION,add),PARTS)(data->res, pw);
638 if (!data->res)
639 return -1;
640
641 return 0;
642 }
643
644 /* Apply fn to each pair of PW in u and set in uset such that
645 * the set lives in the same space as the domain of PW
646 * and collect the results.
647 */
648 static __isl_give UNION *match_domain_op(__isl_take UNION *u,
649 __isl_take isl_union_set *uset,
650 __isl_give PW *(*fn)(__isl_take PW*, __isl_take isl_set*))
651 {
652 S(UNION,match_domain_data) data = { NULL, NULL, fn };
653
654 u = FN(UNION,align_params)(u, isl_union_set_get_space(uset));
655 uset = isl_union_set_align_params(uset, FN(UNION,get_space)(u));
656
657 if (!u || !uset)
658 goto error;
659
660 data.uset = uset;
661 #ifdef HAS_TYPE
662 data.res = FN(UNION,alloc)(isl_space_copy(u->space), u->type,
663 u->table.n);
664 #else
665 data.res = FN(UNION,alloc)(isl_space_copy(u->space), u->table.n);
666 #endif
667 if (isl_hash_table_foreach(u->space->ctx, &u->table,
668 &match_domain_entry, &data) < 0)
669 goto error;
670
671 FN(UNION,free)(u);
672 isl_union_set_free(uset);
673 return data.res;
674 error:
675 FN(UNION,free)(u);
676 isl_union_set_free(uset);
677 FN(UNION,free)(data.res);
678 return NULL;
679 }
680
681 /* Intersect the domain of "u" with "uset".
682 * If "uset" is a parameters domain, then intersect the parameter
683 * domain of "u" with this set.
684 */
685 __isl_give UNION *FN(UNION,intersect_domain)(__isl_take UNION *u,
686 __isl_take isl_union_set *uset)
687 {
688 if (isl_union_set_is_params(uset))
689 return FN(UNION,intersect_params)(u,
690 isl_set_from_union_set(uset));
691 return match_domain_op(u, uset, &FN(PW,intersect_domain));
692 }
693
694 __isl_give UNION *FN(UNION,gist)(__isl_take UNION *u,
695 __isl_take isl_union_set *uset)
696 {
697 if (isl_union_set_is_params(uset))
698 return FN(UNION,gist_params)(u, isl_set_from_union_set(uset));
699 return match_domain_op(u, uset, &FN(PW,gist));
700 }
701
702 #ifndef NO_EVAL
703 __isl_give isl_val *FN(UNION,eval)(__isl_take UNION *u,
704 __isl_take isl_point *pnt)
705 {
706 uint32_t hash;
707 struct isl_hash_table_entry *entry;
708 isl_space *space;
709 isl_val *v;
710
711 if (!u || !pnt)
712 goto error;
713
714 space = isl_space_copy(pnt->dim);
715 if (!space)
716 goto error;
717 hash = isl_space_get_hash(space);
718 entry = isl_hash_table_find(u->space->ctx, &u->table,
719 hash, &has_domain_space, space, 0);
720 isl_space_free(space);
721 if (!entry) {
722 v = isl_val_zero(isl_point_get_ctx(pnt));
723 isl_point_free(pnt);
724 } else {
725 v = FN(PART,eval)(FN(PART,copy)(entry->data), pnt);
726 }
727 FN(UNION,free)(u);
728 return v;
729 error:
730 FN(UNION,free)(u);
731 isl_point_free(pnt);
732 return NULL;
733 }
734 #endif
735
736 static int coalesce_entry(void **entry, void *user)
737 {
738 PW **pw = (PW **)entry;
739
740 *pw = FN(PW,coalesce)(*pw);
741 if (!*pw)
742 return -1;
743
744 return 0;
745 }
746
747 __isl_give UNION *FN(UNION,coalesce)(__isl_take UNION *u)
748 {
749 if (!u)
750 return NULL;
751
752 if (isl_hash_table_foreach(u->space->ctx, &u->table,
753 &coalesce_entry, NULL) < 0)
754 goto error;
755
756 return u;
757 error:
758 FN(UNION,free)(u);
759 return NULL;
760 }
761
762 static int domain(__isl_take PART *part, void *user)
763 {
764 isl_union_set **uset = (isl_union_set **)user;
765
766 *uset = isl_union_set_add_set(*uset, FN(PART,domain)(part));
767
768 return 0;
769 }
770
771 __isl_give isl_union_set *FN(UNION,domain)(__isl_take UNION *u)
772 {
773 isl_union_set *uset;
774
775 uset = isl_union_set_empty(FN(UNION,get_space)(u));
776 if (FN(FN(UNION,foreach),PARTS)(u, &domain, &uset) < 0)
777 goto error;
778
779 FN(UNION,free)(u);
780
781 return uset;
782 error:
783 isl_union_set_free(uset);
784 FN(UNION,free)(u);
785 return NULL;
786 }
787
788 static int mul_isl_int(void **entry, void *user)
789 {
790 PW **pw = (PW **)entry;
791 isl_int *v = user;
792
793 *pw = FN(PW,mul_isl_int)(*pw, *v);
794 if (!*pw)
795 return -1;
796
797 return 0;
798 }
799
800 __isl_give UNION *FN(UNION,mul_isl_int)(__isl_take UNION *u, isl_int v)
801 {
802 if (isl_int_is_one(v))
803 return u;
804
805 if (DEFAULT_IS_ZERO && u && isl_int_is_zero(v)) {
806 UNION *zero;
807 isl_space *dim = FN(UNION,get_space)(u);
808 #ifdef HAS_TYPE
809 zero = FN(UNION,ZERO)(dim, u->type);
810 #else
811 zero = FN(UNION,ZERO)(dim);
812 #endif
813 FN(UNION,free)(u);
814 return zero;
815 }
816
817 u = FN(UNION,cow)(u);
818 if (!u)
819 return NULL;
820
821 #ifdef HAS_TYPE
822 if (isl_int_is_neg(v))
823 u->type = isl_fold_type_negate(u->type);
824 #endif
825 if (isl_hash_table_foreach(u->space->ctx, &u->table,
826 &mul_isl_int, &v) < 0)
827 goto error;
828
829 return u;
830 error:
831 FN(UNION,free)(u);
832 return NULL;
833 }
834
835 /* Multiply *entry by the isl_val "user".
836 *
837 * Return 0 on success and -1 on error.
838 */
839 static int scale_val(void **entry, void *user)
840 {
841 PW **pw = (PW **)entry;
842 isl_val *v = user;
843
844 *pw = FN(PW,scale_val)(*pw, isl_val_copy(v));
845 if (!*pw)
846 return -1;
847
848 return 0;
849 }
850
851 /* Multiply "u" by "v" and return the result.
852 */
853 __isl_give UNION *FN(UNION,scale_val)(__isl_take UNION *u,
854 __isl_take isl_val *v)
855 {
856 if (!u || !v)
857 goto error;
858 if (isl_val_is_one(v)) {
859 isl_val_free(v);
860 return u;
861 }
862
863 if (DEFAULT_IS_ZERO && u && isl_val_is_zero(v)) {
864 UNION *zero;
865 isl_space *space = FN(UNION,get_space)(u);
866 #ifdef HAS_TYPE
867 zero = FN(UNION,ZERO)(space, u->type);
868 #else
869 zero = FN(UNION,ZERO)(space);
870 #endif
871 FN(UNION,free)(u);
872 isl_val_free(v);
873 return zero;
874 }
875
876 if (!isl_val_is_rat(v))
877 isl_die(isl_val_get_ctx(v), isl_error_invalid,
878 "expecting rational factor", goto error);
879
880 u = FN(UNION,cow)(u);
881 if (!u)
882 return NULL;
883
884 #ifdef HAS_TYPE
885 if (isl_val_is_neg(v))
886 u->type = isl_fold_type_negate(u->type);
887 #endif
888 if (isl_hash_table_foreach(u->space->ctx, &u->table, &scale_val, v) < 0)
889 goto error;
890
891 isl_val_free(v);
892 return u;
893 error:
894 isl_val_free(v);
895 FN(UNION,free)(u);
896 return NULL;
897 }
898
899 S(UNION,plain_is_equal_data)
900 {
901 UNION *u2;
902 int is_equal;
903 };
904
905 static int plain_is_equal_entry(void **entry, void *user)
906 {
907 S(UNION,plain_is_equal_data) *data = user;
908 uint32_t hash;
909 struct isl_hash_table_entry *entry2;
910 PW *pw = *entry;
911
912 hash = isl_space_get_hash(pw->dim);
913 entry2 = isl_hash_table_find(data->u2->space->ctx, &data->u2->table,
914 hash, &has_same_domain_space, pw->dim, 0);
915 if (!entry2) {
916 data->is_equal = 0;
917 return -1;
918 }
919
920 data->is_equal = FN(PW,plain_is_equal)(pw, entry2->data);
921 if (data->is_equal < 0 || !data->is_equal)
922 return -1;
923
924 return 0;
925 }
926
927 int FN(UNION,plain_is_equal)(__isl_keep UNION *u1, __isl_keep UNION *u2)
928 {
929 S(UNION,plain_is_equal_data) data = { NULL, 1 };
930
931 if (!u1 || !u2)
932 return -1;
933 if (u1 == u2)
934 return 1;
935 if (u1->table.n != u2->table.n)
936 return 0;
937
938 u1 = FN(UNION,copy)(u1);
939 u2 = FN(UNION,copy)(u2);
940 u1 = FN(UNION,align_params)(u1, FN(UNION,get_space)(u2));
941 u2 = FN(UNION,align_params)(u2, FN(UNION,get_space)(u1));
942 if (!u1 || !u2)
943 goto error;
944
945 data.u2 = u2;
946 if (isl_hash_table_foreach(u1->space->ctx, &u1->table,
947 &plain_is_equal_entry, &data) < 0 &&
948 data.is_equal)
949 goto error;
950
951 FN(UNION,free)(u1);
952 FN(UNION,free)(u2);
953
954 return data.is_equal;
955 error:
956 FN(UNION,free)(u1);
957 FN(UNION,free)(u2);
958 return -1;
959 }
Integer set library