?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
Merge branch 'maint'
[isl.git] / isl_pw_templ.c
blob8ec3d44379ffac227a4d425bf55a556bc9dc2f55
1 /*
2 * Copyright 2010-2011 INRIA Saclay
3 * Copyright 2011 Sven Verdoolaege
4 * Copyright 2012-2013 Ecole Normale Superieure
5 *
6 * Use of this software is governed by the MIT license
7 *
8 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
9 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
10 * 91893 Orsay, France
11 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
12 */
13
14 #include <isl/aff.h>
15 #include <isl_val_private.h>
16
17 #define xFN(TYPE,NAME) TYPE ## _ ## NAME
18 #define FN(TYPE,NAME) xFN(TYPE,NAME)
19 #define xS(TYPE,NAME) struct TYPE ## _ ## NAME
20 #define S(TYPE,NAME) xS(TYPE,NAME)
21
22 #ifdef HAS_TYPE
23 __isl_give PW *FN(PW,alloc_size)(__isl_take isl_space *dim,
24 enum isl_fold type, int n)
25 #else
26 __isl_give PW *FN(PW,alloc_size)(__isl_take isl_space *dim, int n)
27 #endif
28 {
29 isl_ctx *ctx;
30 struct PW *pw;
31
32 if (!dim)
33 return NULL;
34 ctx = isl_space_get_ctx(dim);
35 isl_assert(ctx, n >= 0, goto error);
36 pw = isl_alloc(ctx, struct PW,
37 sizeof(struct PW) + (n - 1) * sizeof(S(PW,piece)));
38 if (!pw)
39 goto error;
40
41 pw->ref = 1;
42 #ifdef HAS_TYPE
43 pw->type = type;
44 #endif
45 pw->size = n;
46 pw->n = 0;
47 pw->dim = dim;
48 return pw;
49 error:
50 isl_space_free(dim);
51 return NULL;
52 }
53
54 #ifdef HAS_TYPE
55 __isl_give PW *FN(PW,ZERO)(__isl_take isl_space *dim, enum isl_fold type)
56 {
57 return FN(PW,alloc_size)(dim, type, 0);
58 }
59 #else
60 __isl_give PW *FN(PW,ZERO)(__isl_take isl_space *dim)
61 {
62 return FN(PW,alloc_size)(dim, 0);
63 }
64 #endif
65
66 __isl_give PW *FN(PW,add_piece)(__isl_take PW *pw,
67 __isl_take isl_set *set, __isl_take EL *el)
68 {
69 isl_ctx *ctx;
70 isl_space *el_dim = NULL;
71
72 if (!pw || !set || !el)
73 goto error;
74
75 if (isl_set_plain_is_empty(set) || FN(EL,EL_IS_ZERO)(el)) {
76 isl_set_free(set);
77 FN(EL,free)(el);
78 return pw;
79 }
80
81 ctx = isl_set_get_ctx(set);
82 #ifdef HAS_TYPE
83 if (pw->type != el->type)
84 isl_die(ctx, isl_error_invalid, "fold types don't match",
85 goto error);
86 #endif
87 el_dim = FN(EL,get_space(el));
88 isl_assert(ctx, isl_space_is_equal(pw->dim, el_dim), goto error);
89 isl_assert(ctx, pw->n < pw->size, goto error);
90
91 pw->p[pw->n].set = set;
92 pw->p[pw->n].FIELD = el;
93 pw->n++;
94
95 isl_space_free(el_dim);
96 return pw;
97 error:
98 isl_space_free(el_dim);
99 FN(PW,free)(pw);
100 isl_set_free(set);
101 FN(EL,free)(el);
102 return NULL;
103 }
104
105 #ifdef HAS_TYPE
106 __isl_give PW *FN(PW,alloc)(enum isl_fold type,
107 __isl_take isl_set *set, __isl_take EL *el)
108 #else
109 __isl_give PW *FN(PW,alloc)(__isl_take isl_set *set, __isl_take EL *el)
110 #endif
111 {
112 PW *pw;
113
114 if (!set || !el)
115 goto error;
116
117 #ifdef HAS_TYPE
118 pw = FN(PW,alloc_size)(FN(EL,get_space)(el), type, 1);
119 #else
120 pw = FN(PW,alloc_size)(FN(EL,get_space)(el), 1);
121 #endif
122
123 return FN(PW,add_piece)(pw, set, el);
124 error:
125 isl_set_free(set);
126 FN(EL,free)(el);
127 return NULL;
128 }
129
130 __isl_give PW *FN(PW,dup)(__isl_keep PW *pw)
131 {
132 int i;
133 PW *dup;
134
135 if (!pw)
136 return NULL;
137
138 #ifdef HAS_TYPE
139 dup = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->type, pw->n);
140 #else
141 dup = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->n);
142 #endif
143 if (!dup)
144 return NULL;
145
146 for (i = 0; i < pw->n; ++i)
147 dup = FN(PW,add_piece)(dup, isl_set_copy(pw->p[i].set),
148 FN(EL,copy)(pw->p[i].FIELD));
149
150 return dup;
151 }
152
153 __isl_give PW *FN(PW,cow)(__isl_take PW *pw)
154 {
155 if (!pw)
156 return NULL;
157
158 if (pw->ref == 1)
159 return pw;
160 pw->ref--;
161 return FN(PW,dup)(pw);
162 }
163
164 __isl_give PW *FN(PW,copy)(__isl_keep PW *pw)
165 {
166 if (!pw)
167 return NULL;
168
169 pw->ref++;
170 return pw;
171 }
172
173 void *FN(PW,free)(__isl_take PW *pw)
174 {
175 int i;
176
177 if (!pw)
178 return NULL;
179 if (--pw->ref > 0)
180 return NULL;
181
182 for (i = 0; i < pw->n; ++i) {
183 isl_set_free(pw->p[i].set);
184 FN(EL,free)(pw->p[i].FIELD);
185 }
186 isl_space_free(pw->dim);
187 free(pw);
188
189 return NULL;
190 }
191
192 const char *FN(PW,get_dim_name)(__isl_keep PW *pw, enum isl_dim_type type,
193 unsigned pos)
194 {
195 return pw ? isl_space_get_dim_name(pw->dim, type, pos) : NULL;
196 }
197
198 int FN(PW,has_dim_id)(__isl_keep PW *pw, enum isl_dim_type type, unsigned pos)
199 {
200 return pw ? isl_space_has_dim_id(pw->dim, type, pos) : -1;
201 }
202
203 __isl_give isl_id *FN(PW,get_dim_id)(__isl_keep PW *pw, enum isl_dim_type type,
204 unsigned pos)
205 {
206 return pw ? isl_space_get_dim_id(pw->dim, type, pos) : NULL;
207 }
208
209 int FN(PW,has_tuple_name)(__isl_keep PW *pw, enum isl_dim_type type)
210 {
211 return pw ? isl_space_has_tuple_name(pw->dim, type) : -1;
212 }
213
214 const char *FN(PW,get_tuple_name)(__isl_keep PW *pw, enum isl_dim_type type)
215 {
216 return pw ? isl_space_get_tuple_name(pw->dim, type) : NULL;
217 }
218
219 int FN(PW,has_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type)
220 {
221 return pw ? isl_space_has_tuple_id(pw->dim, type) : -1;
222 }
223
224 __isl_give isl_id *FN(PW,get_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type)
225 {
226 return pw ? isl_space_get_tuple_id(pw->dim, type) : NULL;
227 }
228
229 int FN(PW,IS_ZERO)(__isl_keep PW *pw)
230 {
231 if (!pw)
232 return -1;
233
234 return pw->n == 0;
235 }
236
237 #ifndef NO_REALIGN
238 __isl_give PW *FN(PW,realign_domain)(__isl_take PW *pw,
239 __isl_take isl_reordering *exp)
240 {
241 int i;
242
243 pw = FN(PW,cow)(pw);
244 if (!pw || !exp)
245 goto error;
246
247 for (i = 0; i < pw->n; ++i) {
248 pw->p[i].set = isl_set_realign(pw->p[i].set,
249 isl_reordering_copy(exp));
250 if (!pw->p[i].set)
251 goto error;
252 pw->p[i].FIELD = FN(EL,realign_domain)(pw->p[i].FIELD,
253 isl_reordering_copy(exp));
254 if (!pw->p[i].FIELD)
255 goto error;
256 }
257
258 pw = FN(PW,reset_domain_space)(pw, isl_space_copy(exp->dim));
259
260 isl_reordering_free(exp);
261 return pw;
262 error:
263 isl_reordering_free(exp);
264 FN(PW,free)(pw);
265 return NULL;
266 }
267
268 /* Align the parameters of "pw" to those of "model".
269 */
270 __isl_give PW *FN(PW,align_params)(__isl_take PW *pw, __isl_take isl_space *model)
271 {
272 isl_ctx *ctx;
273
274 if (!pw || !model)
275 goto error;
276
277 ctx = isl_space_get_ctx(model);
278 if (!isl_space_has_named_params(model))
279 isl_die(ctx, isl_error_invalid,
280 "model has unnamed parameters", goto error);
281 if (!isl_space_has_named_params(pw->dim))
282 isl_die(ctx, isl_error_invalid,
283 "input has unnamed parameters", goto error);
284 if (!isl_space_match(pw->dim, isl_dim_param, model, isl_dim_param)) {
285 isl_reordering *exp;
286
287 model = isl_space_drop_dims(model, isl_dim_in,
288 0, isl_space_dim(model, isl_dim_in));
289 model = isl_space_drop_dims(model, isl_dim_out,
290 0, isl_space_dim(model, isl_dim_out));
291 exp = isl_parameter_alignment_reordering(pw->dim, model);
292 exp = isl_reordering_extend_space(exp,
293 FN(PW,get_domain_space)(pw));
294 pw = FN(PW,realign_domain)(pw, exp);
295 }
296
297 isl_space_free(model);
298 return pw;
299 error:
300 isl_space_free(model);
301 FN(PW,free)(pw);
302 return NULL;
303 }
304
305 static __isl_give PW *FN(PW,align_params_pw_pw_and)(__isl_take PW *pw1,
306 __isl_take PW *pw2,
307 __isl_give PW *(*fn)(__isl_take PW *pw1, __isl_take PW *pw2))
308 {
309 isl_ctx *ctx;
310
311 if (!pw1 || !pw2)
312 goto error;
313 if (isl_space_match(pw1->dim, isl_dim_param, pw2->dim, isl_dim_param))
314 return fn(pw1, pw2);
315 ctx = FN(PW,get_ctx)(pw1);
316 if (!isl_space_has_named_params(pw1->dim) ||
317 !isl_space_has_named_params(pw2->dim))
318 isl_die(ctx, isl_error_invalid,
319 "unaligned unnamed parameters", goto error);
320 pw1 = FN(PW,align_params)(pw1, FN(PW,get_space)(pw2));
321 pw2 = FN(PW,align_params)(pw2, FN(PW,get_space)(pw1));
322 return fn(pw1, pw2);
323 error:
324 FN(PW,free)(pw1);
325 FN(PW,free)(pw2);
326 return NULL;
327 }
328
329 static __isl_give PW *FN(PW,align_params_pw_set_and)(__isl_take PW *pw,
330 __isl_take isl_set *set,
331 __isl_give PW *(*fn)(__isl_take PW *pw, __isl_take isl_set *set))
332 {
333 isl_ctx *ctx;
334
335 if (!pw || !set)
336 goto error;
337 if (isl_space_match(pw->dim, isl_dim_param, set->dim, isl_dim_param))
338 return fn(pw, set);
339 ctx = FN(PW,get_ctx)(pw);
340 if (!isl_space_has_named_params(pw->dim) ||
341 !isl_space_has_named_params(set->dim))
342 isl_die(ctx, isl_error_invalid,
343 "unaligned unnamed parameters", goto error);
344 pw = FN(PW,align_params)(pw, isl_set_get_space(set));
345 set = isl_set_align_params(set, FN(PW,get_space)(pw));
346 return fn(pw, set);
347 error:
348 FN(PW,free)(pw);
349 isl_set_free(set);
350 return NULL;
351 }
352 #endif
353
354 static __isl_give PW *FN(PW,union_add_aligned)(__isl_take PW *pw1,
355 __isl_take PW *pw2)
356 {
357 int i, j, n;
358 struct PW *res;
359 isl_ctx *ctx;
360 isl_set *set;
361
362 if (!pw1 || !pw2)
363 goto error;
364
365 ctx = isl_space_get_ctx(pw1->dim);
366 #ifdef HAS_TYPE
367 if (pw1->type != pw2->type)
368 isl_die(ctx, isl_error_invalid,
369 "fold types don't match", goto error);
370 #endif
371 isl_assert(ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error);
372
373 if (FN(PW,IS_ZERO)(pw1)) {
374 FN(PW,free)(pw1);
375 return pw2;
376 }
377
378 if (FN(PW,IS_ZERO)(pw2)) {
379 FN(PW,free)(pw2);
380 return pw1;
381 }
382
383 n = (pw1->n + 1) * (pw2->n + 1);
384 #ifdef HAS_TYPE
385 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), pw1->type, n);
386 #else
387 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), n);
388 #endif
389
390 for (i = 0; i < pw1->n; ++i) {
391 set = isl_set_copy(pw1->p[i].set);
392 for (j = 0; j < pw2->n; ++j) {
393 struct isl_set *common;
394 EL *sum;
395 common = isl_set_intersect(isl_set_copy(pw1->p[i].set),
396 isl_set_copy(pw2->p[j].set));
397 if (isl_set_plain_is_empty(common)) {
398 isl_set_free(common);
399 continue;
400 }
401 set = isl_set_subtract(set,
402 isl_set_copy(pw2->p[j].set));
403
404 sum = FN(EL,add_on_domain)(common,
405 FN(EL,copy)(pw1->p[i].FIELD),
406 FN(EL,copy)(pw2->p[j].FIELD));
407
408 res = FN(PW,add_piece)(res, common, sum);
409 }
410 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw1->p[i].FIELD));
411 }
412
413 for (j = 0; j < pw2->n; ++j) {
414 set = isl_set_copy(pw2->p[j].set);
415 for (i = 0; i < pw1->n; ++i)
416 set = isl_set_subtract(set,
417 isl_set_copy(pw1->p[i].set));
418 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw2->p[j].FIELD));
419 }
420
421 FN(PW,free)(pw1);
422 FN(PW,free)(pw2);
423
424 return res;
425 error:
426 FN(PW,free)(pw1);
427 FN(PW,free)(pw2);
428 return NULL;
429 }
430
431 /* Private version of "union_add". For isl_pw_qpolynomial and
432 * isl_pw_qpolynomial_fold, we prefer to simply call it "add".
433 */
434 static __isl_give PW *FN(PW,union_add_)(__isl_take PW *pw1, __isl_take PW *pw2)
435 {
436 return FN(PW,align_params_pw_pw_and)(pw1, pw2,
437 &FN(PW,union_add_aligned));
438 }
439
440 /* Make sure "pw" has room for at least "n" more pieces.
441 *
442 * If there is only one reference to pw, we extend it in place.
443 * Otherwise, we create a new PW and copy the pieces.
444 */
445 static __isl_give PW *FN(PW,grow)(__isl_take PW *pw, int n)
446 {
447 int i;
448 isl_ctx *ctx;
449 PW *res;
450
451 if (!pw)
452 return NULL;
453 if (pw->n + n <= pw->size)
454 return pw;
455 ctx = FN(PW,get_ctx)(pw);
456 n += pw->n;
457 if (pw->ref == 1) {
458 res = isl_realloc(ctx, pw, struct PW,
459 sizeof(struct PW) + (n - 1) * sizeof(S(PW,piece)));
460 if (!res)
461 return FN(PW,free)(pw);
462 res->size = n;
463 return res;
464 }
465 #ifdef HAS_TYPE
466 res = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->type, n);
467 #else
468 res = FN(PW,alloc_size)(isl_space_copy(pw->dim), n);
469 #endif
470 if (!res)
471 return FN(PW,free)(pw);
472 for (i = 0; i < pw->n; ++i)
473 res = FN(PW,add_piece)(res, isl_set_copy(pw->p[i].set),
474 FN(EL,copy)(pw->p[i].FIELD));
475 FN(PW,free)(pw);
476 return res;
477 }
478
479 static __isl_give PW *FN(PW,add_disjoint_aligned)(__isl_take PW *pw1,
480 __isl_take PW *pw2)
481 {
482 int i;
483 isl_ctx *ctx;
484
485 if (!pw1 || !pw2)
486 goto error;
487
488 if (pw1->size < pw1->n + pw2->n && pw1->n < pw2->n)
489 return FN(PW,add_disjoint_aligned)(pw2, pw1);
490
491 ctx = isl_space_get_ctx(pw1->dim);
492 #ifdef HAS_TYPE
493 if (pw1->type != pw2->type)
494 isl_die(ctx, isl_error_invalid,
495 "fold types don't match", goto error);
496 #endif
497 isl_assert(ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error);
498
499 if (FN(PW,IS_ZERO)(pw1)) {
500 FN(PW,free)(pw1);
501 return pw2;
502 }
503
504 if (FN(PW,IS_ZERO)(pw2)) {
505 FN(PW,free)(pw2);
506 return pw1;
507 }
508
509 pw1 = FN(PW,grow)(pw1, pw2->n);
510 if (!pw1)
511 goto error;
512
513 for (i = 0; i < pw2->n; ++i)
514 pw1 = FN(PW,add_piece)(pw1,
515 isl_set_copy(pw2->p[i].set),
516 FN(EL,copy)(pw2->p[i].FIELD));
517
518 FN(PW,free)(pw2);
519
520 return pw1;
521 error:
522 FN(PW,free)(pw1);
523 FN(PW,free)(pw2);
524 return NULL;
525 }
526
527 __isl_give PW *FN(PW,add_disjoint)(__isl_take PW *pw1, __isl_take PW *pw2)
528 {
529 return FN(PW,align_params_pw_pw_and)(pw1, pw2,
530 &FN(PW,add_disjoint_aligned));
531 }
532
533 /* This function is currently only used from isl_aff.c
534 */
535 static __isl_give PW *FN(PW,on_shared_domain_in)(__isl_take PW *pw1,
536 __isl_take PW *pw2, __isl_take isl_space *space,
537 __isl_give EL *(*fn)(__isl_take EL *el1, __isl_take EL *el2))
538 __attribute__ ((unused));
539
540 /* Apply "fn" to pairs of elements from pw1 and pw2 on shared domains.
541 * The result of "fn" (and therefore also of this function) lives in "space".
542 */
543 static __isl_give PW *FN(PW,on_shared_domain_in)(__isl_take PW *pw1,
544 __isl_take PW *pw2, __isl_take isl_space *space,
545 __isl_give EL *(*fn)(__isl_take EL *el1, __isl_take EL *el2))
546 {
547 int i, j, n;
548 PW *res = NULL;
549
550 if (!pw1 || !pw2)
551 goto error;
552
553 n = pw1->n * pw2->n;
554 #ifdef HAS_TYPE
555 res = FN(PW,alloc_size)(isl_space_copy(space), pw1->type, n);
556 #else
557 res = FN(PW,alloc_size)(isl_space_copy(space), n);
558 #endif
559
560 for (i = 0; i < pw1->n; ++i) {
561 for (j = 0; j < pw2->n; ++j) {
562 isl_set *common;
563 EL *res_ij;
564 int empty;
565
566 common = isl_set_intersect(
567 isl_set_copy(pw1->p[i].set),
568 isl_set_copy(pw2->p[j].set));
569 empty = isl_set_plain_is_empty(common);
570 if (empty < 0 || empty) {
571 isl_set_free(common);
572 if (empty < 0)
573 goto error;
574 continue;
575 }
576
577 res_ij = fn(FN(EL,copy)(pw1->p[i].FIELD),
578 FN(EL,copy)(pw2->p[j].FIELD));
579 res_ij = FN(EL,gist)(res_ij, isl_set_copy(common));
580
581 res = FN(PW,add_piece)(res, common, res_ij);
582 }
583 }
584
585 isl_space_free(space);
586 FN(PW,free)(pw1);
587 FN(PW,free)(pw2);
588 return res;
589 error:
590 isl_space_free(space);
591 FN(PW,free)(pw1);
592 FN(PW,free)(pw2);
593 FN(PW,free)(res);
594 return NULL;
595 }
596
597 /* This function is currently only used from isl_aff.c
598 */
599 static __isl_give PW *FN(PW,on_shared_domain)(__isl_take PW *pw1,
600 __isl_take PW *pw2,
601 __isl_give EL *(*fn)(__isl_take EL *el1, __isl_take EL *el2))
602 __attribute__ ((unused));
603
604 /* Apply "fn" to pairs of elements from pw1 and pw2 on shared domains.
605 * The result of "fn" is assumed to live in the same space as "pw1" and "pw2".
606 */
607 static __isl_give PW *FN(PW,on_shared_domain)(__isl_take PW *pw1,
608 __isl_take PW *pw2,
609 __isl_give EL *(*fn)(__isl_take EL *el1, __isl_take EL *el2))
610 {
611 isl_space *space;
612
613 if (!pw1 || !pw2)
614 goto error;
615
616 space = isl_space_copy(pw1->dim);
617 return FN(PW,on_shared_domain_in)(pw1, pw2, space, fn);
618 error:
619 FN(PW,free)(pw1);
620 FN(PW,free)(pw2);
621 return NULL;
622 }
623
624 #ifndef NO_NEG
625 __isl_give PW *FN(PW,neg)(__isl_take PW *pw)
626 {
627 int i;
628
629 if (!pw)
630 return NULL;
631
632 if (FN(PW,IS_ZERO)(pw))
633 return pw;
634
635 pw = FN(PW,cow)(pw);
636 if (!pw)
637 return NULL;
638
639 for (i = 0; i < pw->n; ++i) {
640 pw->p[i].FIELD = FN(EL,neg)(pw->p[i].FIELD);
641 if (!pw->p[i].FIELD)
642 return FN(PW,free)(pw);
643 }
644
645 return pw;
646 }
647
648 __isl_give PW *FN(PW,sub)(__isl_take PW *pw1, __isl_take PW *pw2)
649 {
650 return FN(PW,add)(pw1, FN(PW,neg)(pw2));
651 }
652 #endif
653
654 #ifndef NO_EVAL
655 __isl_give isl_val *FN(PW,eval)(__isl_take PW *pw, __isl_take isl_point *pnt)
656 {
657 int i;
658 int found = 0;
659 isl_ctx *ctx;
660 isl_space *pnt_dim = NULL;
661 isl_val *v;
662
663 if (!pw || !pnt)
664 goto error;
665 ctx = isl_point_get_ctx(pnt);
666 pnt_dim = isl_point_get_space(pnt);
667 isl_assert(ctx, isl_space_is_domain_internal(pnt_dim, pw->dim),
668 goto error);
669
670 for (i = 0; i < pw->n; ++i) {
671 found = isl_set_contains_point(pw->p[i].set, pnt);
672 if (found < 0)
673 goto error;
674 if (found)
675 break;
676 }
677 if (found)
678 v = FN(EL,eval)(FN(EL,copy)(pw->p[i].FIELD),
679 isl_point_copy(pnt));
680 else
681 v = isl_val_zero(ctx);
682 FN(PW,free)(pw);
683 isl_space_free(pnt_dim);
684 isl_point_free(pnt);
685 return v;
686 error:
687 FN(PW,free)(pw);
688 isl_space_free(pnt_dim);
689 isl_point_free(pnt);
690 return NULL;
691 }
692 #endif
693
694 /* Return the parameter domain of "pw".
695 */
696 __isl_give isl_set *FN(PW,params)(__isl_take PW *pw)
697 {
698 return isl_set_params(FN(PW,domain)(pw));
699 }
700
701 __isl_give isl_set *FN(PW,domain)(__isl_take PW *pw)
702 {
703 int i;
704 isl_set *dom;
705
706 if (!pw)
707 return NULL;
708
709 dom = isl_set_empty(FN(PW,get_domain_space)(pw));
710 for (i = 0; i < pw->n; ++i)
711 dom = isl_set_union_disjoint(dom, isl_set_copy(pw->p[i].set));
712
713 FN(PW,free)(pw);
714
715 return dom;
716 }
717
718 /* Exploit the equalities in the domain of piece "i" of "pw"
719 * to simplify the associated function.
720 * If the domain of piece "i" is empty, then remove it entirely,
721 * replacing it with the final piece.
722 */
723 static int FN(PW,exploit_equalities_and_remove_if_empty)(__isl_keep PW *pw,
724 int i)
725 {
726 isl_basic_set *aff;
727 int empty = isl_set_plain_is_empty(pw->p[i].set);
728
729 if (empty < 0)
730 return -1;
731 if (empty) {
732 isl_set_free(pw->p[i].set);
733 FN(EL,free)(pw->p[i].FIELD);
734 if (i != pw->n - 1)
735 pw->p[i] = pw->p[pw->n - 1];
736 pw->n--;
737
738 return 0;
739 }
740
741 aff = isl_set_affine_hull(isl_set_copy(pw->p[i].set));
742 pw->p[i].FIELD = FN(EL,substitute_equalities)(pw->p[i].FIELD, aff);
743 if (!pw->p[i].FIELD)
744 return -1;
745
746 return 0;
747 }
748
749 /* Convert a piecewise expression defined over a parameter domain
750 * into one that is defined over a zero-dimensional set.
751 */
752 __isl_give PW *FN(PW,from_range)(__isl_take PW *pw)
753 {
754 isl_space *space;
755
756 if (!pw)
757 return NULL;
758 if (!isl_space_is_set(pw->dim))
759 isl_die(FN(PW,get_ctx)(pw), isl_error_invalid,
760 "not living in a set space", return FN(PW,free)(pw));
761
762 space = FN(PW,get_space)(pw);
763 space = isl_space_from_range(space);
764 pw = FN(PW,reset_space)(pw, space);
765
766 return pw;
767 }
768
769 /* Fix the value of the given parameter or domain dimension of "pw"
770 * to be equal to "value".
771 */
772 __isl_give PW *FN(PW,fix_si)(__isl_take PW *pw, enum isl_dim_type type,
773 unsigned pos, int value)
774 {
775 int i;
776
777 if (!pw)
778 return NULL;
779
780 if (type == isl_dim_out)
781 isl_die(FN(PW,get_ctx)(pw), isl_error_invalid,
782 "cannot fix output dimension", return FN(PW,free)(pw));
783
784 if (pw->n == 0)
785 return pw;
786
787 if (type == isl_dim_in)
788 type = isl_dim_set;
789
790 pw = FN(PW,cow)(pw);
791 if (!pw)
792 return FN(PW,free)(pw);
793
794 for (i = pw->n - 1; i >= 0; --i) {
795 pw->p[i].set = isl_set_fix_si(pw->p[i].set, type, pos, value);
796 if (FN(PW,exploit_equalities_and_remove_if_empty)(pw, i) < 0)
797 return FN(PW,free)(pw);
798 }
799
800 return pw;
801 }
802
803 /* Restrict the domain of "pw" by combining each cell
804 * with "set" through a call to "fn", where "fn" may be
805 * isl_set_intersect or isl_set_intersect_params.
806 */
807 static __isl_give PW *FN(PW,intersect_aligned)(__isl_take PW *pw,
808 __isl_take isl_set *set,
809 __isl_give isl_set *(*fn)(__isl_take isl_set *set1,
810 __isl_take isl_set *set2))
811 {
812 int i;
813
814 if (!pw || !set)
815 goto error;
816
817 if (pw->n == 0) {
818 isl_set_free(set);
819 return pw;
820 }
821
822 pw = FN(PW,cow)(pw);
823 if (!pw)
824 goto error;
825
826 for (i = pw->n - 1; i >= 0; --i) {
827 pw->p[i].set = fn(pw->p[i].set, isl_set_copy(set));
828 if (FN(PW,exploit_equalities_and_remove_if_empty)(pw, i) < 0)
829 goto error;
830 }
831
832 isl_set_free(set);
833 return pw;
834 error:
835 isl_set_free(set);
836 FN(PW,free)(pw);
837 return NULL;
838 }
839
840 static __isl_give PW *FN(PW,intersect_domain_aligned)(__isl_take PW *pw,
841 __isl_take isl_set *set)
842 {
843 return FN(PW,intersect_aligned)(pw, set, &isl_set_intersect);
844 }
845
846 __isl_give PW *FN(PW,intersect_domain)(__isl_take PW *pw,
847 __isl_take isl_set *context)
848 {
849 return FN(PW,align_params_pw_set_and)(pw, context,
850 &FN(PW,intersect_domain_aligned));
851 }
852
853 static __isl_give PW *FN(PW,intersect_params_aligned)(__isl_take PW *pw,
854 __isl_take isl_set *set)
855 {
856 return FN(PW,intersect_aligned)(pw, set, &isl_set_intersect_params);
857 }
858
859 /* Intersect the domain of "pw" with the parameter domain "context".
860 */
861 __isl_give PW *FN(PW,intersect_params)(__isl_take PW *pw,
862 __isl_take isl_set *context)
863 {
864 return FN(PW,align_params_pw_set_and)(pw, context,
865 &FN(PW,intersect_params_aligned));
866 }
867
868 static __isl_give PW *FN(PW,gist_aligned)(__isl_take PW *pw,
869 __isl_take isl_set *context,
870 __isl_give EL *(*fn_el)(__isl_take EL *el,
871 __isl_take isl_set *set),
872 __isl_give isl_set *(*fn_dom)(__isl_take isl_set *set,
873 __isl_take isl_basic_set *bset))
874 {
875 int i;
876 isl_basic_set *hull = NULL;
877
878 if (!pw || !context)
879 goto error;
880
881 if (pw->n == 0) {
882 isl_set_free(context);
883 return pw;
884 }
885
886 if (!isl_space_match(pw->dim, isl_dim_param,
887 context->dim, isl_dim_param)) {
888 pw = FN(PW,align_params)(pw, isl_set_get_space(context));
889 context = isl_set_align_params(context, FN(PW,get_space)(pw));
890 }
891
892 context = isl_set_compute_divs(context);
893 hull = isl_set_simple_hull(isl_set_copy(context));
894
895 pw = FN(PW,cow)(pw);
896 if (!pw)
897 goto error;
898
899 for (i = pw->n - 1; i >= 0; --i) {
900 isl_set *set_i;
901 int empty;
902
903 set_i = isl_set_intersect(isl_set_copy(pw->p[i].set),
904 isl_set_copy(context));
905 empty = isl_set_plain_is_empty(set_i);
906 pw->p[i].FIELD = fn_el(pw->p[i].FIELD, set_i);
907 pw->p[i].set = fn_dom(pw->p[i].set, isl_basic_set_copy(hull));
908 if (!pw->p[i].FIELD || !pw->p[i].set)
909 goto error;
910 if (empty) {
911 isl_set_free(pw->p[i].set);
912 FN(EL,free)(pw->p[i].FIELD);
913 if (i != pw->n - 1)
914 pw->p[i] = pw->p[pw->n - 1];
915 pw->n--;
916 }
917 }
918
919 isl_basic_set_free(hull);
920 isl_set_free(context);
921
922 return pw;
923 error:
924 FN(PW,free)(pw);
925 isl_basic_set_free(hull);
926 isl_set_free(context);
927 return NULL;
928 }
929
930 static __isl_give PW *FN(PW,gist_domain_aligned)(__isl_take PW *pw,
931 __isl_take isl_set *set)
932 {
933 return FN(PW,gist_aligned)(pw, set, &FN(EL,gist),
934 &isl_set_gist_basic_set);
935 }
936
937 __isl_give PW *FN(PW,gist)(__isl_take PW *pw, __isl_take isl_set *context)
938 {
939 return FN(PW,align_params_pw_set_and)(pw, context,
940 &FN(PW,gist_domain_aligned));
941 }
942
943 static __isl_give PW *FN(PW,gist_params_aligned)(__isl_take PW *pw,
944 __isl_take isl_set *set)
945 {
946 return FN(PW,gist_aligned)(pw, set, &FN(EL,gist_params),
947 &isl_set_gist_params_basic_set);
948 }
949
950 __isl_give PW *FN(PW,gist_params)(__isl_take PW *pw,
951 __isl_take isl_set *context)
952 {
953 return FN(PW,align_params_pw_set_and)(pw, context,
954 &FN(PW,gist_params_aligned));
955 }
956
957 __isl_give PW *FN(PW,coalesce)(__isl_take PW *pw)
958 {
959 int i, j;
960
961 if (!pw)
962 return NULL;
963 if (pw->n == 0)
964 return pw;
965
966 for (i = pw->n - 1; i >= 0; --i) {
967 for (j = i - 1; j >= 0; --j) {
968 if (!FN(EL,plain_is_equal)(pw->p[i].FIELD,
969 pw->p[j].FIELD))
970 continue;
971 pw->p[j].set = isl_set_union(pw->p[j].set,
972 pw->p[i].set);
973 FN(EL,free)(pw->p[i].FIELD);
974 if (i != pw->n - 1)
975 pw->p[i] = pw->p[pw->n - 1];
976 pw->n--;
977 break;
978 }
979 if (j >= 0)
980 continue;
981 pw->p[i].set = isl_set_coalesce(pw->p[i].set);
982 if (!pw->p[i].set)
983 goto error;
984 }
985
986 return pw;
987 error:
988 FN(PW,free)(pw);
989 return NULL;
990 }
991
992 isl_ctx *FN(PW,get_ctx)(__isl_keep PW *pw)
993 {
994 return pw ? isl_space_get_ctx(pw->dim) : NULL;
995 }
996
997 #ifndef NO_INVOLVES_DIMS
998 int FN(PW,involves_dims)(__isl_keep PW *pw, enum isl_dim_type type,
999 unsigned first, unsigned n)
1000 {
1001 int i;
1002 enum isl_dim_type set_type;
1003
1004 if (!pw)
1005 return -1;
1006 if (pw->n == 0 || n == 0)
1007 return 0;
1008
1009 set_type = type == isl_dim_in ? isl_dim_set : type;
1010
1011 for (i = 0; i < pw->n; ++i) {
1012 int involves = FN(EL,involves_dims)(pw->p[i].FIELD,
1013 type, first, n);
1014 if (involves < 0 || involves)
1015 return involves;
1016 involves = isl_set_involves_dims(pw->p[i].set,
1017 set_type, first, n);
1018 if (involves < 0 || involves)
1019 return involves;
1020 }
1021 return 0;
1022 }
1023 #endif
1024
1025 __isl_give PW *FN(PW,set_dim_name)(__isl_take PW *pw,
1026 enum isl_dim_type type, unsigned pos, const char *s)
1027 {
1028 int i;
1029 enum isl_dim_type set_type;
1030
1031 pw = FN(PW,cow)(pw);
1032 if (!pw)
1033 return NULL;
1034
1035 set_type = type == isl_dim_in ? isl_dim_set : type;
1036
1037 pw->dim = isl_space_set_dim_name(pw->dim, type, pos, s);
1038 if (!pw->dim)
1039 goto error;
1040
1041 for (i = 0; i < pw->n; ++i) {
1042 pw->p[i].set = isl_set_set_dim_name(pw->p[i].set,
1043 set_type, pos, s);
1044 if (!pw->p[i].set)
1045 goto error;
1046 pw->p[i].FIELD = FN(EL,set_dim_name)(pw->p[i].FIELD, type, pos, s);
1047 if (!pw->p[i].FIELD)
1048 goto error;
1049 }
1050
1051 return pw;
1052 error:
1053 FN(PW,free)(pw);
1054 return NULL;
1055 }
1056
1057 #ifndef NO_DROP_DIMS
1058 __isl_give PW *FN(PW,drop_dims)(__isl_take PW *pw,
1059 enum isl_dim_type type, unsigned first, unsigned n)
1060 {
1061 int i;
1062 enum isl_dim_type set_type;
1063
1064 if (!pw)
1065 return NULL;
1066 if (n == 0 && !isl_space_get_tuple_name(pw->dim, type))
1067 return pw;
1068
1069 set_type = type == isl_dim_in ? isl_dim_set : type;
1070
1071 pw = FN(PW,cow)(pw);
1072 if (!pw)
1073 return NULL;
1074 pw->dim = isl_space_drop_dims(pw->dim, type, first, n);
1075 if (!pw->dim)
1076 goto error;
1077 for (i = 0; i < pw->n; ++i) {
1078 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
1079 if (!pw->p[i].FIELD)
1080 goto error;
1081 if (type == isl_dim_out)
1082 continue;
1083 pw->p[i].set = isl_set_drop(pw->p[i].set, set_type, first, n);
1084 if (!pw->p[i].set)
1085 goto error;
1086 }
1087
1088 return pw;
1089 error:
1090 FN(PW,free)(pw);
1091 return NULL;
1092 }
1093
1094 /* This function is very similar to drop_dims.
1095 * The only difference is that the cells may still involve
1096 * the specified dimensions. They are removed using
1097 * isl_set_project_out instead of isl_set_drop.
1098 */
1099 __isl_give PW *FN(PW,project_out)(__isl_take PW *pw,
1100 enum isl_dim_type type, unsigned first, unsigned n)
1101 {
1102 int i;
1103 enum isl_dim_type set_type;
1104
1105 if (!pw)
1106 return NULL;
1107 if (n == 0 && !isl_space_get_tuple_name(pw->dim, type))
1108 return pw;
1109
1110 set_type = type == isl_dim_in ? isl_dim_set : type;
1111
1112 pw = FN(PW,cow)(pw);
1113 if (!pw)
1114 return NULL;
1115 pw->dim = isl_space_drop_dims(pw->dim, type, first, n);
1116 if (!pw->dim)
1117 goto error;
1118 for (i = 0; i < pw->n; ++i) {
1119 pw->p[i].set = isl_set_project_out(pw->p[i].set,
1120 set_type, first, n);
1121 if (!pw->p[i].set)
1122 goto error;
1123 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
1124 if (!pw->p[i].FIELD)
1125 goto error;
1126 }
1127
1128 return pw;
1129 error:
1130 FN(PW,free)(pw);
1131 return NULL;
1132 }
1133
1134 /* Project the domain of pw onto its parameter space.
1135 */
1136 __isl_give PW *FN(PW,project_domain_on_params)(__isl_take PW *pw)
1137 {
1138 isl_space *space;
1139 unsigned n;
1140
1141 n = FN(PW,dim)(pw, isl_dim_in);
1142 pw = FN(PW,project_out)(pw, isl_dim_in, 0, n);
1143 space = FN(PW,get_domain_space)(pw);
1144 space = isl_space_params(space);
1145 pw = FN(PW,reset_domain_space)(pw, space);
1146 return pw;
1147 }
1148 #endif
1149
1150 #ifndef NO_INSERT_DIMS
1151 __isl_give PW *FN(PW,insert_dims)(__isl_take PW *pw, enum isl_dim_type type,
1152 unsigned first, unsigned n)
1153 {
1154 int i;
1155 enum isl_dim_type set_type;
1156
1157 if (!pw)
1158 return NULL;
1159 if (n == 0 && !isl_space_is_named_or_nested(pw->dim, type))
1160 return pw;
1161
1162 set_type = type == isl_dim_in ? isl_dim_set : type;
1163
1164 pw = FN(PW,cow)(pw);
1165 if (!pw)
1166 return NULL;
1167
1168 pw->dim = isl_space_insert_dims(pw->dim, type, first, n);
1169 if (!pw->dim)
1170 goto error;
1171
1172 for (i = 0; i < pw->n; ++i) {
1173 pw->p[i].set = isl_set_insert_dims(pw->p[i].set,
1174 set_type, first, n);
1175 if (!pw->p[i].set)
1176 goto error;
1177 pw->p[i].FIELD = FN(EL,insert_dims)(pw->p[i].FIELD,
1178 type, first, n);
1179 if (!pw->p[i].FIELD)
1180 goto error;
1181 }
1182
1183 return pw;
1184 error:
1185 FN(PW,free)(pw);
1186 return NULL;
1187 }
1188 #endif
1189
1190 __isl_give PW *FN(PW,fix_dim)(__isl_take PW *pw,
1191 enum isl_dim_type type, unsigned pos, isl_int v)
1192 {
1193 int i;
1194
1195 if (!pw)
1196 return NULL;
1197
1198 if (type == isl_dim_in)
1199 type = isl_dim_set;
1200
1201 pw = FN(PW,cow)(pw);
1202 if (!pw)
1203 return NULL;
1204 for (i = 0; i < pw->n; ++i) {
1205 pw->p[i].set = isl_set_fix(pw->p[i].set, type, pos, v);
1206 if (FN(PW,exploit_equalities_and_remove_if_empty)(pw, i) < 0)
1207 return FN(PW,free)(pw);
1208 }
1209
1210 return pw;
1211 }
1212
1213 /* Fix the value of the variable at position "pos" of type "type" of "pw"
1214 * to be equal to "v".
1215 */
1216 __isl_give PW *FN(PW,fix_val)(__isl_take PW *pw,
1217 enum isl_dim_type type, unsigned pos, __isl_take isl_val *v)
1218 {
1219 if (!v)
1220 return FN(PW,free)(pw);
1221 if (!isl_val_is_int(v))
1222 isl_die(FN(PW,get_ctx)(pw), isl_error_invalid,
1223 "expecting integer value", goto error);
1224
1225 pw = FN(PW,fix_dim)(pw, type, pos, v->n);
1226 isl_val_free(v);
1227
1228 return pw;
1229 error:
1230 isl_val_free(v);
1231 return FN(PW,free)(pw);
1232 }
1233
1234 unsigned FN(PW,dim)(__isl_keep PW *pw, enum isl_dim_type type)
1235 {
1236 return pw ? isl_space_dim(pw->dim, type) : 0;
1237 }
1238
1239 __isl_give PW *FN(PW,split_dims)(__isl_take PW *pw,
1240 enum isl_dim_type type, unsigned first, unsigned n)
1241 {
1242 int i;
1243
1244 if (!pw)
1245 return NULL;
1246 if (n == 0)
1247 return pw;
1248
1249 if (type == isl_dim_in)
1250 type = isl_dim_set;
1251
1252 pw = FN(PW,cow)(pw);
1253 if (!pw)
1254 return NULL;
1255 if (!pw->dim)
1256 goto error;
1257 for (i = 0; i < pw->n; ++i) {
1258 pw->p[i].set = isl_set_split_dims(pw->p[i].set, type, first, n);
1259 if (!pw->p[i].set)
1260 goto error;
1261 }
1262
1263 return pw;
1264 error:
1265 FN(PW,free)(pw);
1266 return NULL;
1267 }
1268
1269 #ifndef NO_OPT
1270 /* Compute the maximal value attained by the piecewise quasipolynomial
1271 * on its domain or zero if the domain is empty.
1272 * In the worst case, the domain is scanned completely,
1273 * so the domain is assumed to be bounded.
1274 */
1275 __isl_give isl_val *FN(PW,opt)(__isl_take PW *pw, int max)
1276 {
1277 int i;
1278 isl_val *opt;
1279
1280 if (!pw)
1281 return NULL;
1282
1283 if (pw->n == 0) {
1284 opt = isl_val_zero(FN(PW,get_ctx)(pw));
1285 FN(PW,free)(pw);
1286 return opt;
1287 }
1288
1289 opt = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[0].FIELD),
1290 isl_set_copy(pw->p[0].set), max);
1291 for (i = 1; i < pw->n; ++i) {
1292 isl_val *opt_i;
1293 opt_i = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[i].FIELD),
1294 isl_set_copy(pw->p[i].set), max);
1295 if (max)
1296 opt = isl_val_max(opt, opt_i);
1297 else
1298 opt = isl_val_min(opt, opt_i);
1299 }
1300
1301 FN(PW,free)(pw);
1302 return opt;
1303 }
1304
1305 __isl_give isl_val *FN(PW,max)(__isl_take PW *pw)
1306 {
1307 return FN(PW,opt)(pw, 1);
1308 }
1309
1310 __isl_give isl_val *FN(PW,min)(__isl_take PW *pw)
1311 {
1312 return FN(PW,opt)(pw, 0);
1313 }
1314 #endif
1315
1316 __isl_give isl_space *FN(PW,get_space)(__isl_keep PW *pw)
1317 {
1318 return pw ? isl_space_copy(pw->dim) : NULL;
1319 }
1320
1321 __isl_give isl_space *FN(PW,get_domain_space)(__isl_keep PW *pw)
1322 {
1323 return pw ? isl_space_domain(isl_space_copy(pw->dim)) : NULL;
1324 }
1325
1326 #ifndef NO_RESET_DIM
1327 /* Reset the space of "pw". Since we don't know if the elements
1328 * represent the spaces themselves or their domains, we pass along
1329 * both when we call their reset_space_and_domain.
1330 */
1331 static __isl_give PW *FN(PW,reset_space_and_domain)(__isl_take PW *pw,
1332 __isl_take isl_space *space, __isl_take isl_space *domain)
1333 {
1334 int i;
1335
1336 pw = FN(PW,cow)(pw);
1337 if (!pw || !space || !domain)
1338 goto error;
1339
1340 for (i = 0; i < pw->n; ++i) {
1341 pw->p[i].set = isl_set_reset_space(pw->p[i].set,
1342 isl_space_copy(domain));
1343 if (!pw->p[i].set)
1344 goto error;
1345 pw->p[i].FIELD = FN(EL,reset_space_and_domain)(pw->p[i].FIELD,
1346 isl_space_copy(space), isl_space_copy(domain));
1347 if (!pw->p[i].FIELD)
1348 goto error;
1349 }
1350
1351 isl_space_free(domain);
1352
1353 isl_space_free(pw->dim);
1354 pw->dim = space;
1355
1356 return pw;
1357 error:
1358 isl_space_free(domain);
1359 isl_space_free(space);
1360 FN(PW,free)(pw);
1361 return NULL;
1362 }
1363
1364 __isl_give PW *FN(PW,reset_domain_space)(__isl_take PW *pw,
1365 __isl_take isl_space *domain)
1366 {
1367 isl_space *space;
1368
1369 space = isl_space_extend_domain_with_range(isl_space_copy(domain),
1370 FN(PW,get_space)(pw));
1371 return FN(PW,reset_space_and_domain)(pw, space, domain);
1372 }
1373
1374 __isl_give PW *FN(PW,reset_space)(__isl_take PW *pw, __isl_take isl_space *dim)
1375 {
1376 isl_space *domain;
1377
1378 domain = isl_space_domain(isl_space_copy(dim));
1379 return FN(PW,reset_space_and_domain)(pw, dim, domain);
1380 }
1381
1382 __isl_give PW *FN(PW,set_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type,
1383 __isl_take isl_id *id)
1384 {
1385 isl_space *space;
1386
1387 pw = FN(PW,cow)(pw);
1388 if (!pw)
1389 return isl_id_free(id);
1390
1391 space = FN(PW,get_space)(pw);
1392 space = isl_space_set_tuple_id(space, type, id);
1393
1394 return FN(PW,reset_space)(pw, space);
1395 }
1396
1397 __isl_give PW *FN(PW,set_dim_id)(__isl_take PW *pw,
1398 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
1399 {
1400 pw = FN(PW,cow)(pw);
1401 if (!pw)
1402 return isl_id_free(id);
1403 pw->dim = isl_space_set_dim_id(pw->dim, type, pos, id);
1404 return FN(PW,reset_space)(pw, isl_space_copy(pw->dim));
1405 }
1406 #endif
1407
1408 int FN(PW,has_equal_space)(__isl_keep PW *pw1, __isl_keep PW *pw2)
1409 {
1410 if (!pw1 || !pw2)
1411 return -1;
1412
1413 return isl_space_is_equal(pw1->dim, pw2->dim);
1414 }
1415
1416 #ifndef NO_MORPH
1417 __isl_give PW *FN(PW,morph_domain)(__isl_take PW *pw,
1418 __isl_take isl_morph *morph)
1419 {
1420 int i;
1421 isl_ctx *ctx;
1422
1423 if (!pw || !morph)
1424 goto error;
1425
1426 ctx = isl_space_get_ctx(pw->dim);
1427 isl_assert(ctx, isl_space_is_domain_internal(morph->dom->dim, pw->dim),
1428 goto error);
1429
1430 pw = FN(PW,cow)(pw);
1431 if (!pw)
1432 goto error;
1433 pw->dim = isl_space_extend_domain_with_range(
1434 isl_space_copy(morph->ran->dim), pw->dim);
1435 if (!pw->dim)
1436 goto error;
1437
1438 for (i = 0; i < pw->n; ++i) {
1439 pw->p[i].set = isl_morph_set(isl_morph_copy(morph), pw->p[i].set);
1440 if (!pw->p[i].set)
1441 goto error;
1442 pw->p[i].FIELD = FN(EL,morph_domain)(pw->p[i].FIELD,
1443 isl_morph_copy(morph));
1444 if (!pw->p[i].FIELD)
1445 goto error;
1446 }
1447
1448 isl_morph_free(morph);
1449
1450 return pw;
1451 error:
1452 FN(PW,free)(pw);
1453 isl_morph_free(morph);
1454 return NULL;
1455 }
1456 #endif
1457
1458 int FN(PW,n_piece)(__isl_keep PW *pw)
1459 {
1460 return pw ? pw->n : 0;
1461 }
1462
1463 int FN(PW,foreach_piece)(__isl_keep PW *pw,
1464 int (*fn)(__isl_take isl_set *set, __isl_take EL *el, void *user),
1465 void *user)
1466 {
1467 int i;
1468
1469 if (!pw)
1470 return -1;
1471
1472 for (i = 0; i < pw->n; ++i)
1473 if (fn(isl_set_copy(pw->p[i].set),
1474 FN(EL,copy)(pw->p[i].FIELD), user) < 0)
1475 return -1;
1476
1477 return 0;
1478 }
1479
1480 #ifndef NO_LIFT
1481 static int any_divs(__isl_keep isl_set *set)
1482 {
1483 int i;
1484
1485 if (!set)
1486 return -1;
1487
1488 for (i = 0; i < set->n; ++i)
1489 if (set->p[i]->n_div > 0)
1490 return 1;
1491
1492 return 0;
1493 }
1494
1495 static int foreach_lifted_subset(__isl_take isl_set *set, __isl_take EL *el,
1496 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
1497 void *user), void *user)
1498 {
1499 int i;
1500
1501 if (!set || !el)
1502 goto error;
1503
1504 for (i = 0; i < set->n; ++i) {
1505 isl_set *lift;
1506 EL *copy;
1507
1508 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
1509 lift = isl_set_lift(lift);
1510
1511 copy = FN(EL,copy)(el);
1512 copy = FN(EL,lift)(copy, isl_set_get_space(lift));
1513
1514 if (fn(lift, copy, user) < 0)
1515 goto error;
1516 }
1517
1518 isl_set_free(set);
1519 FN(EL,free)(el);
1520
1521 return 0;
1522 error:
1523 isl_set_free(set);
1524 FN(EL,free)(el);
1525 return -1;
1526 }
1527
1528 int FN(PW,foreach_lifted_piece)(__isl_keep PW *pw,
1529 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
1530 void *user), void *user)
1531 {
1532 int i;
1533
1534 if (!pw)
1535 return -1;
1536
1537 for (i = 0; i < pw->n; ++i) {
1538 isl_set *set;
1539 EL *el;
1540
1541 set = isl_set_copy(pw->p[i].set);
1542 el = FN(EL,copy)(pw->p[i].FIELD);
1543 if (!any_divs(set)) {
1544 if (fn(set, el, user) < 0)
1545 return -1;
1546 continue;
1547 }
1548 if (foreach_lifted_subset(set, el, fn, user) < 0)
1549 return -1;
1550 }
1551
1552 return 0;
1553 }
1554 #endif
1555
1556 #ifndef NO_MOVE_DIMS
1557 __isl_give PW *FN(PW,move_dims)(__isl_take PW *pw,
1558 enum isl_dim_type dst_type, unsigned dst_pos,
1559 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
1560 {
1561 int i;
1562
1563 pw = FN(PW,cow)(pw);
1564 if (!pw)
1565 return NULL;
1566
1567 pw->dim = isl_space_move_dims(pw->dim, dst_type, dst_pos, src_type, src_pos, n);
1568 if (!pw->dim)
1569 goto error;
1570
1571 for (i = 0; i < pw->n; ++i) {
1572 pw->p[i].FIELD = FN(EL,move_dims)(pw->p[i].FIELD,
1573 dst_type, dst_pos, src_type, src_pos, n);
1574 if (!pw->p[i].FIELD)
1575 goto error;
1576 }
1577
1578 if (dst_type == isl_dim_in)
1579 dst_type = isl_dim_set;
1580 if (src_type == isl_dim_in)
1581 src_type = isl_dim_set;
1582
1583 for (i = 0; i < pw->n; ++i) {
1584 pw->p[i].set = isl_set_move_dims(pw->p[i].set,
1585 dst_type, dst_pos,
1586 src_type, src_pos, n);
1587 if (!pw->p[i].set)
1588 goto error;
1589 }
1590
1591 return pw;
1592 error:
1593 FN(PW,free)(pw);
1594 return NULL;
1595 }
1596 #endif
1597
1598 __isl_give PW *FN(PW,mul_isl_int)(__isl_take PW *pw, isl_int v)
1599 {
1600 int i;
1601
1602 if (isl_int_is_one(v))
1603 return pw;
1604 if (pw && DEFAULT_IS_ZERO && isl_int_is_zero(v)) {
1605 PW *zero;
1606 isl_space *dim = FN(PW,get_space)(pw);
1607 #ifdef HAS_TYPE
1608 zero = FN(PW,ZERO)(dim, pw->type);
1609 #else
1610 zero = FN(PW,ZERO)(dim);
1611 #endif
1612 FN(PW,free)(pw);
1613 return zero;
1614 }
1615 pw = FN(PW,cow)(pw);
1616 if (!pw)
1617 return NULL;
1618 if (pw->n == 0)
1619 return pw;
1620
1621 #ifdef HAS_TYPE
1622 if (isl_int_is_neg(v))
1623 pw->type = isl_fold_type_negate(pw->type);
1624 #endif
1625 for (i = 0; i < pw->n; ++i) {
1626 pw->p[i].FIELD = FN(EL,scale)(pw->p[i].FIELD, v);
1627 if (!pw->p[i].FIELD)
1628 goto error;
1629 }
1630
1631 return pw;
1632 error:
1633 FN(PW,free)(pw);
1634 return NULL;
1635 }
1636
1637 /* Multiply the pieces of "pw" by "v" and return the result.
1638 */
1639 __isl_give PW *FN(PW,scale_val)(__isl_take PW *pw, __isl_take isl_val *v)
1640 {
1641 int i;
1642
1643 if (!pw || !v)
1644 goto error;
1645
1646 if (isl_val_is_one(v)) {
1647 isl_val_free(v);
1648 return pw;
1649 }
1650 if (pw && DEFAULT_IS_ZERO && isl_val_is_zero(v)) {
1651 PW *zero;
1652 isl_space *space = FN(PW,get_space)(pw);
1653 #ifdef HAS_TYPE
1654 zero = FN(PW,ZERO)(space, pw->type);
1655 #else
1656 zero = FN(PW,ZERO)(space);
1657 #endif
1658 FN(PW,free)(pw);
1659 isl_val_free(v);
1660 return zero;
1661 }
1662 if (pw->n == 0) {
1663 isl_val_free(v);
1664 return pw;
1665 }
1666 pw = FN(PW,cow)(pw);
1667 if (!pw)
1668 goto error;
1669
1670 #ifdef HAS_TYPE
1671 if (isl_val_is_neg(v))
1672 pw->type = isl_fold_type_negate(pw->type);
1673 #endif
1674 for (i = 0; i < pw->n; ++i) {
1675 pw->p[i].FIELD = FN(EL,scale_val)(pw->p[i].FIELD,
1676 isl_val_copy(v));
1677 if (!pw->p[i].FIELD)
1678 goto error;
1679 }
1680
1681 isl_val_free(v);
1682 return pw;
1683 error:
1684 isl_val_free(v);
1685 FN(PW,free)(pw);
1686 return NULL;
1687 }
1688
1689 __isl_give PW *FN(PW,scale)(__isl_take PW *pw, isl_int v)
1690 {
1691 return FN(PW,mul_isl_int)(pw, v);
1692 }
1693
1694 static int FN(PW,qsort_set_cmp)(const void *p1, const void *p2)
1695 {
1696 isl_set *set1 = *(isl_set * const *)p1;
1697 isl_set *set2 = *(isl_set * const *)p2;
1698
1699 return isl_set_plain_cmp(set1, set2);
1700 }
1701
1702 /* We normalize in place, but if anything goes wrong we need
1703 * to return NULL, so we need to make sure we don't change the
1704 * meaning of any possible other copies of map.
1705 */
1706 __isl_give PW *FN(PW,normalize)(__isl_take PW *pw)
1707 {
1708 int i, j;
1709 isl_set *set;
1710
1711 if (!pw)
1712 return NULL;
1713 for (i = 0; i < pw->n; ++i) {
1714 set = isl_set_normalize(isl_set_copy(pw->p[i].set));
1715 if (!set)
1716 return FN(PW,free)(pw);
1717 isl_set_free(pw->p[i].set);
1718 pw->p[i].set = set;
1719 }
1720 qsort(pw->p, pw->n, sizeof(pw->p[0]), &FN(PW,qsort_set_cmp));
1721 for (i = pw->n - 1; i >= 1; --i) {
1722 if (!isl_set_plain_is_equal(pw->p[i - 1].set, pw->p[i].set))
1723 continue;
1724 if (!FN(EL,plain_is_equal)(pw->p[i - 1].FIELD, pw->p[i].FIELD))
1725 continue;
1726 set = isl_set_union(isl_set_copy(pw->p[i - 1].set),
1727 isl_set_copy(pw->p[i].set));
1728 if (!set)
1729 return FN(PW,free)(pw);
1730 isl_set_free(pw->p[i].set);
1731 FN(EL,free)(pw->p[i].FIELD);
1732 isl_set_free(pw->p[i - 1].set);
1733 pw->p[i - 1].set = set;
1734 for (j = i + 1; j < pw->n; ++j)
1735 pw->p[j - 1] = pw->p[j];
1736 pw->n--;
1737 }
1738
1739 return pw;
1740 }
1741
1742 /* Is pw1 obviously equal to pw2?
1743 * That is, do they have obviously identical cells and obviously identical
1744 * elements on each cell?
1745 */
1746 int FN(PW,plain_is_equal)(__isl_keep PW *pw1, __isl_keep PW *pw2)
1747 {
1748 int i;
1749 int equal;
1750
1751 if (!pw1 || !pw2)
1752 return -1;
1753
1754 if (pw1 == pw2)
1755 return 1;
1756 if (!isl_space_is_equal(pw1->dim, pw2->dim))
1757 return 0;
1758
1759 pw1 = FN(PW,copy)(pw1);
1760 pw2 = FN(PW,copy)(pw2);
1761 pw1 = FN(PW,normalize)(pw1);
1762 pw2 = FN(PW,normalize)(pw2);
1763 if (!pw1 || !pw2)
1764 goto error;
1765
1766 equal = pw1->n == pw2->n;
1767 for (i = 0; equal && i < pw1->n; ++i) {
1768 equal = isl_set_plain_is_equal(pw1->p[i].set, pw2->p[i].set);
1769 if (equal < 0)
1770 goto error;
1771 if (!equal)
1772 break;
1773 equal = FN(EL,plain_is_equal)(pw1->p[i].FIELD, pw2->p[i].FIELD);
1774 if (equal < 0)
1775 goto error;
1776 }
1777
1778 FN(PW,free)(pw1);
1779 FN(PW,free)(pw2);
1780 return equal;
1781 error:
1782 FN(PW,free)(pw1);
1783 FN(PW,free)(pw2);
1784 return -1;
1785 }
1786
1787 #ifndef NO_PULLBACK
1788 static __isl_give PW *FN(PW,align_params_pw_multi_aff_and)(__isl_take PW *pw,
1789 __isl_take isl_multi_aff *ma,
1790 __isl_give PW *(*fn)(__isl_take PW *pw, __isl_take isl_multi_aff *ma))
1791 {
1792 isl_ctx *ctx;
1793 isl_space *ma_space;
1794
1795 ma_space = isl_multi_aff_get_space(ma);
1796 if (!pw || !ma || !ma_space)
1797 goto error;
1798 if (isl_space_match(pw->dim, isl_dim_param, ma_space, isl_dim_param)) {
1799 isl_space_free(ma_space);
1800 return fn(pw, ma);
1801 }
1802 ctx = FN(PW,get_ctx)(pw);
1803 if (!isl_space_has_named_params(pw->dim) ||
1804 !isl_space_has_named_params(ma_space))
1805 isl_die(ctx, isl_error_invalid,
1806 "unaligned unnamed parameters", goto error);
1807 pw = FN(PW,align_params)(pw, ma_space);
1808 ma = isl_multi_aff_align_params(ma, FN(PW,get_space)(pw));
1809 return fn(pw, ma);
1810 error:
1811 isl_space_free(ma_space);
1812 FN(PW,free)(pw);
1813 isl_multi_aff_free(ma);
1814 return NULL;
1815 }
1816
1817 static __isl_give PW *FN(PW,align_params_pw_pw_multi_aff_and)(__isl_take PW *pw,
1818 __isl_take isl_pw_multi_aff *pma,
1819 __isl_give PW *(*fn)(__isl_take PW *pw,
1820 __isl_take isl_pw_multi_aff *ma))
1821 {
1822 isl_ctx *ctx;
1823 isl_space *pma_space;
1824
1825 pma_space = isl_pw_multi_aff_get_space(pma);
1826 if (!pw || !pma || !pma_space)
1827 goto error;
1828 if (isl_space_match(pw->dim, isl_dim_param, pma_space, isl_dim_param)) {
1829 isl_space_free(pma_space);
1830 return fn(pw, pma);
1831 }
1832 ctx = FN(PW,get_ctx)(pw);
1833 if (!isl_space_has_named_params(pw->dim) ||
1834 !isl_space_has_named_params(pma_space))
1835 isl_die(ctx, isl_error_invalid,
1836 "unaligned unnamed parameters", goto error);
1837 pw = FN(PW,align_params)(pw, pma_space);
1838 pma = isl_pw_multi_aff_align_params(pma, FN(PW,get_space)(pw));
1839 return fn(pw, pma);
1840 error:
1841 isl_space_free(pma_space);
1842 FN(PW,free)(pw);
1843 isl_pw_multi_aff_free(pma);
1844 return NULL;
1845 }
1846
1847 /* Compute the pullback of "pw" by the function represented by "ma".
1848 * In other words, plug in "ma" in "pw".
1849 */
1850 static __isl_give PW *FN(PW,pullback_multi_aff_aligned)(__isl_take PW *pw,
1851 __isl_take isl_multi_aff *ma)
1852 {
1853 int i;
1854 isl_space *space = NULL;
1855
1856 ma = isl_multi_aff_align_divs(ma);
1857 pw = FN(PW,cow)(pw);
1858 if (!pw || !ma)
1859 goto error;
1860
1861 space = isl_space_join(isl_multi_aff_get_space(ma),
1862 FN(PW,get_space)(pw));
1863
1864 for (i = 0; i < pw->n; ++i) {
1865 pw->p[i].set = isl_set_preimage_multi_aff(pw->p[i].set,
1866 isl_multi_aff_copy(ma));
1867 if (!pw->p[i].set)
1868 goto error;
1869 pw->p[i].FIELD = FN(EL,pullback_multi_aff)(pw->p[i].FIELD,
1870 isl_multi_aff_copy(ma));
1871 if (!pw->p[i].FIELD)
1872 goto error;
1873 }
1874
1875 pw = FN(PW,reset_space)(pw, space);
1876 isl_multi_aff_free(ma);
1877 return pw;
1878 error:
1879 isl_space_free(space);
1880 isl_multi_aff_free(ma);
1881 FN(PW,free)(pw);
1882 return NULL;
1883 }
1884
1885 __isl_give PW *FN(PW,pullback_multi_aff)(__isl_take PW *pw,
1886 __isl_take isl_multi_aff *ma)
1887 {
1888 return FN(PW,align_params_pw_multi_aff_and)(pw, ma,
1889 &FN(PW,pullback_multi_aff_aligned));
1890 }
1891
1892 /* Compute the pullback of "pw" by the function represented by "pma".
1893 * In other words, plug in "pma" in "pw".
1894 */
1895 static __isl_give PW *FN(PW,pullback_pw_multi_aff_aligned)(__isl_take PW *pw,
1896 __isl_take isl_pw_multi_aff *pma)
1897 {
1898 int i;
1899 PW *res;
1900
1901 if (!pma)
1902 goto error;
1903
1904 if (pma->n == 0) {
1905 isl_space *space;
1906 space = isl_space_join(isl_pw_multi_aff_get_space(pma),
1907 FN(PW,get_space)(pw));
1908 isl_pw_multi_aff_free(pma);
1909 res = FN(PW,empty)(space);
1910 FN(PW,free)(pw);
1911 return res;
1912 }
1913
1914 res = FN(PW,pullback_multi_aff)(FN(PW,copy)(pw),
1915 isl_multi_aff_copy(pma->p[0].maff));
1916 res = FN(PW,intersect_domain)(res, isl_set_copy(pma->p[0].set));
1917
1918 for (i = 1; i < pma->n; ++i) {
1919 PW *res_i;
1920
1921 res_i = FN(PW,pullback_multi_aff)(FN(PW,copy)(pw),
1922 isl_multi_aff_copy(pma->p[i].maff));
1923 res_i = FN(PW,intersect_domain)(res_i,
1924 isl_set_copy(pma->p[i].set));
1925 res = FN(PW,add_disjoint)(res, res_i);
1926 }
1927
1928 isl_pw_multi_aff_free(pma);
1929 FN(PW,free)(pw);
1930 return res;
1931 error:
1932 isl_pw_multi_aff_free(pma);
1933 FN(PW,free)(pw);
1934 return NULL;
1935 }
1936
1937 __isl_give PW *FN(PW,pullback_pw_multi_aff)(__isl_take PW *pw,
1938 __isl_take isl_pw_multi_aff *pma)
1939 {
1940 return FN(PW,align_params_pw_pw_multi_aff_and)(pw, pma,
1941 &FN(PW,pullback_pw_multi_aff_aligned));
1942 }
1943 #endif
Integer set library