?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
doc/SubmittingPatches: fix typo in email address
[isl.git] / isl_pw_templ.c
blob65bdf46babbaee0e14065e3b53d0dfba0af0466a
1 #define xFN(TYPE,NAME) TYPE ## _ ## NAME
2 #define FN(TYPE,NAME) xFN(TYPE,NAME)
3 #define xS(TYPE,NAME) struct TYPE ## _ ## NAME
4 #define S(TYPE,NAME) xS(TYPE,NAME)
5
6 #ifdef HAS_TYPE
7 __isl_give PW *FN(PW,alloc_size)(__isl_take isl_space *dim,
8 enum isl_fold type, int n)
9 #else
10 __isl_give PW *FN(PW,alloc_size)(__isl_take isl_space *dim, int n)
11 #endif
12 {
13 isl_ctx *ctx;
14 struct PW *pw;
15
16 if (!dim)
17 return NULL;
18 ctx = isl_space_get_ctx(dim);
19 isl_assert(ctx, n >= 0, goto error);
20 pw = isl_alloc(ctx, struct PW,
21 sizeof(struct PW) + (n - 1) * sizeof(S(PW,piece)));
22 if (!pw)
23 goto error;
24
25 pw->ref = 1;
26 #ifdef HAS_TYPE
27 pw->type = type;
28 #endif
29 pw->size = n;
30 pw->n = 0;
31 pw->dim = dim;
32 return pw;
33 error:
34 isl_space_free(dim);
35 return NULL;
36 }
37
38 #ifdef HAS_TYPE
39 __isl_give PW *FN(PW,ZERO)(__isl_take isl_space *dim, enum isl_fold type)
40 {
41 return FN(PW,alloc_size)(dim, type, 0);
42 }
43 #else
44 __isl_give PW *FN(PW,ZERO)(__isl_take isl_space *dim)
45 {
46 return FN(PW,alloc_size)(dim, 0);
47 }
48 #endif
49
50 __isl_give PW *FN(PW,add_piece)(__isl_take PW *pw,
51 __isl_take isl_set *set, __isl_take EL *el)
52 {
53 isl_ctx *ctx;
54 isl_space *el_dim = NULL;
55
56 if (!pw || !set || !el)
57 goto error;
58
59 if (isl_set_plain_is_empty(set) || FN(EL,EL_IS_ZERO)(el)) {
60 isl_set_free(set);
61 FN(EL,free)(el);
62 return pw;
63 }
64
65 ctx = isl_set_get_ctx(set);
66 #ifdef HAS_TYPE
67 if (pw->type != el->type)
68 isl_die(ctx, isl_error_invalid, "fold types don't match",
69 goto error);
70 #endif
71 el_dim = FN(EL,get_space(el));
72 isl_assert(ctx, isl_space_is_equal(pw->dim, el_dim), goto error);
73 isl_assert(ctx, pw->n < pw->size, goto error);
74
75 pw->p[pw->n].set = set;
76 pw->p[pw->n].FIELD = el;
77 pw->n++;
78
79 isl_space_free(el_dim);
80 return pw;
81 error:
82 isl_space_free(el_dim);
83 FN(PW,free)(pw);
84 isl_set_free(set);
85 FN(EL,free)(el);
86 return NULL;
87 }
88
89 #ifdef HAS_TYPE
90 __isl_give PW *FN(PW,alloc)(enum isl_fold type,
91 __isl_take isl_set *set, __isl_take EL *el)
92 #else
93 __isl_give PW *FN(PW,alloc)(__isl_take isl_set *set, __isl_take EL *el)
94 #endif
95 {
96 PW *pw;
97
98 if (!set || !el)
99 goto error;
100
101 #ifdef HAS_TYPE
102 pw = FN(PW,alloc_size)(FN(EL,get_space)(el), type, 1);
103 #else
104 pw = FN(PW,alloc_size)(FN(EL,get_space)(el), 1);
105 #endif
106
107 return FN(PW,add_piece)(pw, set, el);
108 error:
109 isl_set_free(set);
110 FN(EL,free)(el);
111 return NULL;
112 }
113
114 __isl_give PW *FN(PW,dup)(__isl_keep PW *pw)
115 {
116 int i;
117 PW *dup;
118
119 if (!pw)
120 return NULL;
121
122 #ifdef HAS_TYPE
123 dup = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->type, pw->n);
124 #else
125 dup = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->n);
126 #endif
127 if (!dup)
128 return NULL;
129
130 for (i = 0; i < pw->n; ++i)
131 dup = FN(PW,add_piece)(dup, isl_set_copy(pw->p[i].set),
132 FN(EL,copy)(pw->p[i].FIELD));
133
134 return dup;
135 }
136
137 __isl_give PW *FN(PW,cow)(__isl_take PW *pw)
138 {
139 if (!pw)
140 return NULL;
141
142 if (pw->ref == 1)
143 return pw;
144 pw->ref--;
145 return FN(PW,dup)(pw);
146 }
147
148 __isl_give PW *FN(PW,copy)(__isl_keep PW *pw)
149 {
150 if (!pw)
151 return NULL;
152
153 pw->ref++;
154 return pw;
155 }
156
157 void *FN(PW,free)(__isl_take PW *pw)
158 {
159 int i;
160
161 if (!pw)
162 return NULL;
163 if (--pw->ref > 0)
164 return NULL;
165
166 for (i = 0; i < pw->n; ++i) {
167 isl_set_free(pw->p[i].set);
168 FN(EL,free)(pw->p[i].FIELD);
169 }
170 isl_space_free(pw->dim);
171 free(pw);
172
173 return NULL;
174 }
175
176 const char *FN(PW,get_dim_name)(__isl_keep PW *pw, enum isl_dim_type type,
177 unsigned pos)
178 {
179 return pw ? isl_space_get_dim_name(pw->dim, type, pos) : NULL;
180 }
181
182 int FN(PW,has_dim_id)(__isl_keep PW *pw, enum isl_dim_type type, unsigned pos)
183 {
184 return pw ? isl_space_has_dim_id(pw->dim, type, pos) : -1;
185 }
186
187 __isl_give isl_id *FN(PW,get_dim_id)(__isl_keep PW *pw, enum isl_dim_type type,
188 unsigned pos)
189 {
190 return pw ? isl_space_get_dim_id(pw->dim, type, pos) : NULL;
191 }
192
193 const char *FN(PW,get_tuple_name)(__isl_keep PW *pw, enum isl_dim_type type)
194 {
195 return pw ? isl_space_get_tuple_name(pw->dim, type) : NULL;
196 }
197
198 int FN(PW,has_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type)
199 {
200 return pw ? isl_space_has_tuple_id(pw->dim, type) : -1;
201 }
202
203 __isl_give isl_id *FN(PW,get_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type)
204 {
205 return pw ? isl_space_get_tuple_id(pw->dim, type) : NULL;
206 }
207
208 int FN(PW,IS_ZERO)(__isl_keep PW *pw)
209 {
210 if (!pw)
211 return -1;
212
213 return pw->n == 0;
214 }
215
216 #ifndef NO_REALIGN
217 __isl_give PW *FN(PW,realign_domain)(__isl_take PW *pw,
218 __isl_take isl_reordering *exp)
219 {
220 int i;
221
222 pw = FN(PW,cow)(pw);
223 if (!pw || !exp)
224 return NULL;
225
226 for (i = 0; i < pw->n; ++i) {
227 pw->p[i].set = isl_set_realign(pw->p[i].set,
228 isl_reordering_copy(exp));
229 if (!pw->p[i].set)
230 goto error;
231 pw->p[i].FIELD = FN(EL,realign_domain)(pw->p[i].FIELD,
232 isl_reordering_copy(exp));
233 if (!pw->p[i].FIELD)
234 goto error;
235 }
236
237 pw = FN(PW,reset_domain_space)(pw, isl_space_copy(exp->dim));
238
239 isl_reordering_free(exp);
240 return pw;
241 error:
242 isl_reordering_free(exp);
243 FN(PW,free)(pw);
244 return NULL;
245 }
246
247 /* Align the parameters of "pw" to those of "model".
248 */
249 __isl_give PW *FN(PW,align_params)(__isl_take PW *pw, __isl_take isl_space *model)
250 {
251 isl_ctx *ctx;
252
253 if (!pw || !model)
254 goto error;
255
256 ctx = isl_space_get_ctx(model);
257 if (!isl_space_has_named_params(model))
258 isl_die(ctx, isl_error_invalid,
259 "model has unnamed parameters", goto error);
260 if (!isl_space_has_named_params(pw->dim))
261 isl_die(ctx, isl_error_invalid,
262 "input has unnamed parameters", goto error);
263 if (!isl_space_match(pw->dim, isl_dim_param, model, isl_dim_param)) {
264 isl_reordering *exp;
265
266 model = isl_space_drop_dims(model, isl_dim_in,
267 0, isl_space_dim(model, isl_dim_in));
268 model = isl_space_drop_dims(model, isl_dim_out,
269 0, isl_space_dim(model, isl_dim_out));
270 exp = isl_parameter_alignment_reordering(pw->dim, model);
271 exp = isl_reordering_extend_space(exp,
272 FN(PW,get_domain_space)(pw));
273 pw = FN(PW,realign_domain)(pw, exp);
274 }
275
276 isl_space_free(model);
277 return pw;
278 error:
279 isl_space_free(model);
280 FN(PW,free)(pw);
281 return NULL;
282 }
283
284 static __isl_give PW *FN(PW,align_params_pw_pw_and)(__isl_take PW *pw1,
285 __isl_take PW *pw2,
286 __isl_give PW *(*fn)(__isl_take PW *pw1, __isl_take PW *pw2))
287 {
288 isl_ctx *ctx;
289
290 if (!pw1 || !pw2)
291 goto error;
292 if (isl_space_match(pw1->dim, isl_dim_param, pw2->dim, isl_dim_param))
293 return fn(pw1, pw2);
294 ctx = FN(PW,get_ctx)(pw1);
295 if (!isl_space_has_named_params(pw1->dim) ||
296 !isl_space_has_named_params(pw2->dim))
297 isl_die(ctx, isl_error_invalid,
298 "unaligned unnamed parameters", goto error);
299 pw1 = FN(PW,align_params)(pw1, FN(PW,get_space)(pw2));
300 pw2 = FN(PW,align_params)(pw2, FN(PW,get_space)(pw1));
301 return fn(pw1, pw2);
302 error:
303 FN(PW,free)(pw1);
304 FN(PW,free)(pw2);
305 return NULL;
306 }
307
308 static __isl_give PW *FN(PW,align_params_pw_set_and)(__isl_take PW *pw,
309 __isl_take isl_set *set,
310 __isl_give PW *(*fn)(__isl_take PW *pw, __isl_take isl_set *set))
311 {
312 isl_ctx *ctx;
313
314 if (!pw || !set)
315 goto error;
316 if (isl_space_match(pw->dim, isl_dim_param, set->dim, isl_dim_param))
317 return fn(pw, set);
318 ctx = FN(PW,get_ctx)(pw);
319 if (!isl_space_has_named_params(pw->dim) ||
320 !isl_space_has_named_params(set->dim))
321 isl_die(ctx, isl_error_invalid,
322 "unaligned unnamed parameters", goto error);
323 pw = FN(PW,align_params)(pw, isl_set_get_space(set));
324 set = isl_set_align_params(set, FN(PW,get_space)(pw));
325 return fn(pw, set);
326 error:
327 FN(PW,free)(pw);
328 isl_set_free(set);
329 return NULL;
330 }
331 #endif
332
333 static __isl_give PW *FN(PW,union_add_aligned)(__isl_take PW *pw1,
334 __isl_take PW *pw2)
335 {
336 int i, j, n;
337 struct PW *res;
338 isl_ctx *ctx;
339 isl_set *set;
340
341 if (!pw1 || !pw2)
342 goto error;
343
344 ctx = isl_space_get_ctx(pw1->dim);
345 #ifdef HAS_TYPE
346 if (pw1->type != pw2->type)
347 isl_die(ctx, isl_error_invalid,
348 "fold types don't match", goto error);
349 #endif
350 isl_assert(ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error);
351
352 if (FN(PW,IS_ZERO)(pw1)) {
353 FN(PW,free)(pw1);
354 return pw2;
355 }
356
357 if (FN(PW,IS_ZERO)(pw2)) {
358 FN(PW,free)(pw2);
359 return pw1;
360 }
361
362 n = (pw1->n + 1) * (pw2->n + 1);
363 #ifdef HAS_TYPE
364 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), pw1->type, n);
365 #else
366 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), n);
367 #endif
368
369 for (i = 0; i < pw1->n; ++i) {
370 set = isl_set_copy(pw1->p[i].set);
371 for (j = 0; j < pw2->n; ++j) {
372 struct isl_set *common;
373 EL *sum;
374 set = isl_set_subtract(set,
375 isl_set_copy(pw2->p[j].set));
376 common = isl_set_intersect(isl_set_copy(pw1->p[i].set),
377 isl_set_copy(pw2->p[j].set));
378 if (isl_set_plain_is_empty(common)) {
379 isl_set_free(common);
380 continue;
381 }
382
383 sum = FN(EL,add_on_domain)(common,
384 FN(EL,copy)(pw1->p[i].FIELD),
385 FN(EL,copy)(pw2->p[j].FIELD));
386
387 res = FN(PW,add_piece)(res, common, sum);
388 }
389 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw1->p[i].FIELD));
390 }
391
392 for (j = 0; j < pw2->n; ++j) {
393 set = isl_set_copy(pw2->p[j].set);
394 for (i = 0; i < pw1->n; ++i)
395 set = isl_set_subtract(set,
396 isl_set_copy(pw1->p[i].set));
397 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw2->p[j].FIELD));
398 }
399
400 FN(PW,free)(pw1);
401 FN(PW,free)(pw2);
402
403 return res;
404 error:
405 FN(PW,free)(pw1);
406 FN(PW,free)(pw2);
407 return NULL;
408 }
409
410 /* Private version of "union_add". For isl_pw_qpolynomial and
411 * isl_pw_qpolynomial_fold, we prefer to simply call it "add".
412 */
413 static __isl_give PW *FN(PW,union_add_)(__isl_take PW *pw1, __isl_take PW *pw2)
414 {
415 return FN(PW,align_params_pw_pw_and)(pw1, pw2,
416 &FN(PW,union_add_aligned));
417 }
418
419 /* Make sure "pw" has room for at least "n" more pieces.
420 *
421 * If there is only one reference to pw, we extend it in place.
422 * Otherwise, we create a new PW and copy the pieces.
423 */
424 static __isl_give PW *FN(PW,grow)(__isl_take PW *pw, int n)
425 {
426 int i;
427 isl_ctx *ctx;
428 PW *res;
429
430 if (!pw)
431 return NULL;
432 if (pw->n + n <= pw->size)
433 return pw;
434 ctx = FN(PW,get_ctx)(pw);
435 n += pw->n;
436 if (pw->ref == 1) {
437 res = isl_realloc(ctx, pw, struct PW,
438 sizeof(struct PW) + (n - 1) * sizeof(S(PW,piece)));
439 if (!res)
440 return FN(PW,free)(pw);
441 res->size = n;
442 return res;
443 }
444 #ifdef HAS_TYPE
445 res = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->type, n);
446 #else
447 res = FN(PW,alloc_size)(isl_space_copy(pw->dim), n);
448 #endif
449 if (!res)
450 return FN(PW,free)(pw);
451 for (i = 0; i < pw->n; ++i)
452 res = FN(PW,add_piece)(res, isl_set_copy(pw->p[i].set),
453 FN(EL,copy)(pw->p[i].FIELD));
454 FN(PW,free)(pw);
455 return res;
456 }
457
458 static __isl_give PW *FN(PW,add_disjoint_aligned)(__isl_take PW *pw1,
459 __isl_take PW *pw2)
460 {
461 int i;
462 isl_ctx *ctx;
463
464 if (!pw1 || !pw2)
465 goto error;
466
467 if (pw1->size < pw1->n + pw2->n && pw1->n < pw2->n)
468 return FN(PW,add_disjoint_aligned)(pw2, pw1);
469
470 ctx = isl_space_get_ctx(pw1->dim);
471 #ifdef HAS_TYPE
472 if (pw1->type != pw2->type)
473 isl_die(ctx, isl_error_invalid,
474 "fold types don't match", goto error);
475 #endif
476 isl_assert(ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error);
477
478 if (FN(PW,IS_ZERO)(pw1)) {
479 FN(PW,free)(pw1);
480 return pw2;
481 }
482
483 if (FN(PW,IS_ZERO)(pw2)) {
484 FN(PW,free)(pw2);
485 return pw1;
486 }
487
488 pw1 = FN(PW,grow)(pw1, pw2->n);
489 if (!pw1)
490 goto error;
491
492 for (i = 0; i < pw2->n; ++i)
493 pw1 = FN(PW,add_piece)(pw1,
494 isl_set_copy(pw2->p[i].set),
495 FN(EL,copy)(pw2->p[i].FIELD));
496
497 FN(PW,free)(pw2);
498
499 return pw1;
500 error:
501 FN(PW,free)(pw1);
502 FN(PW,free)(pw2);
503 return NULL;
504 }
505
506 __isl_give PW *FN(PW,add_disjoint)(__isl_take PW *pw1, __isl_take PW *pw2)
507 {
508 return FN(PW,align_params_pw_pw_and)(pw1, pw2,
509 &FN(PW,add_disjoint_aligned));
510 }
511
512 /* This function is currently only used from isl_aff.c
513 */
514 static __isl_give PW *FN(PW,on_shared_domain)(__isl_take PW *pw1,
515 __isl_take PW *pw2,
516 __isl_give EL *(*fn)(__isl_take EL *el1, __isl_take EL *el2))
517 __attribute__ ((unused));
518
519 /* Apply "fn" to pairs of elements from pw1 and pw2 on shared domains.
520 */
521 static __isl_give PW *FN(PW,on_shared_domain)(__isl_take PW *pw1,
522 __isl_take PW *pw2,
523 __isl_give EL *(*fn)(__isl_take EL *el1, __isl_take EL *el2))
524 {
525 int i, j, n;
526 PW *res;
527
528 if (!pw1 || !pw2)
529 goto error;
530
531 n = pw1->n * pw2->n;
532 #ifdef HAS_TYPE
533 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), pw1->type, n);
534 #else
535 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), n);
536 #endif
537
538 for (i = 0; i < pw1->n; ++i) {
539 for (j = 0; j < pw2->n; ++j) {
540 isl_set *common;
541 EL *res_ij;
542 common = isl_set_intersect(
543 isl_set_copy(pw1->p[i].set),
544 isl_set_copy(pw2->p[j].set));
545 if (isl_set_plain_is_empty(common)) {
546 isl_set_free(common);
547 continue;
548 }
549
550 res_ij = fn(FN(EL,copy)(pw1->p[i].FIELD),
551 FN(EL,copy)(pw2->p[j].FIELD));
552
553 res = FN(PW,add_piece)(res, common, res_ij);
554 }
555 }
556
557 FN(PW,free)(pw1);
558 FN(PW,free)(pw2);
559 return res;
560 error:
561 FN(PW,free)(pw1);
562 FN(PW,free)(pw2);
563 return NULL;
564 }
565
566 #ifndef NO_NEG
567 __isl_give PW *FN(PW,neg)(__isl_take PW *pw)
568 {
569 int i;
570
571 if (!pw)
572 return NULL;
573
574 if (FN(PW,IS_ZERO)(pw))
575 return pw;
576
577 pw = FN(PW,cow)(pw);
578 if (!pw)
579 return NULL;
580
581 for (i = 0; i < pw->n; ++i) {
582 pw->p[i].FIELD = FN(EL,neg)(pw->p[i].FIELD);
583 if (!pw->p[i].FIELD)
584 return FN(PW,free)(pw);
585 }
586
587 return pw;
588 }
589
590 __isl_give PW *FN(PW,sub)(__isl_take PW *pw1, __isl_take PW *pw2)
591 {
592 return FN(PW,add)(pw1, FN(PW,neg)(pw2));
593 }
594 #endif
595
596 #ifndef NO_EVAL
597 __isl_give isl_qpolynomial *FN(PW,eval)(__isl_take PW *pw,
598 __isl_take isl_point *pnt)
599 {
600 int i;
601 int found = 0;
602 isl_ctx *ctx;
603 isl_space *pnt_dim = NULL;
604 isl_qpolynomial *qp;
605
606 if (!pw || !pnt)
607 goto error;
608 ctx = isl_point_get_ctx(pnt);
609 pnt_dim = isl_point_get_space(pnt);
610 isl_assert(ctx, isl_space_is_domain(pnt_dim, pw->dim), goto error);
611
612 for (i = 0; i < pw->n; ++i) {
613 found = isl_set_contains_point(pw->p[i].set, pnt);
614 if (found < 0)
615 goto error;
616 if (found)
617 break;
618 }
619 if (found)
620 qp = FN(EL,eval)(FN(EL,copy)(pw->p[i].FIELD),
621 isl_point_copy(pnt));
622 else
623 qp = isl_qpolynomial_zero_on_domain(FN(PW,get_domain_space)(pw));
624 FN(PW,free)(pw);
625 isl_space_free(pnt_dim);
626 isl_point_free(pnt);
627 return qp;
628 error:
629 FN(PW,free)(pw);
630 isl_space_free(pnt_dim);
631 isl_point_free(pnt);
632 return NULL;
633 }
634 #endif
635
636 __isl_give isl_set *FN(PW,domain)(__isl_take PW *pw)
637 {
638 int i;
639 isl_set *dom;
640
641 if (!pw)
642 return NULL;
643
644 dom = isl_set_empty(FN(PW,get_domain_space)(pw));
645 for (i = 0; i < pw->n; ++i)
646 dom = isl_set_union_disjoint(dom, isl_set_copy(pw->p[i].set));
647
648 FN(PW,free)(pw);
649
650 return dom;
651 }
652
653 /* Restrict the domain of "pw" by combining each cell
654 * with "set" through a call to "fn", where "fn" may be
655 * isl_set_intersect or isl_set_intersect_params.
656 */
657 static __isl_give PW *FN(PW,intersect_aligned)(__isl_take PW *pw,
658 __isl_take isl_set *set,
659 __isl_give isl_set *(*fn)(__isl_take isl_set *set1,
660 __isl_take isl_set *set2))
661 {
662 int i;
663
664 if (!pw || !set)
665 goto error;
666
667 if (pw->n == 0) {
668 isl_set_free(set);
669 return pw;
670 }
671
672 pw = FN(PW,cow)(pw);
673 if (!pw)
674 goto error;
675
676 for (i = pw->n - 1; i >= 0; --i) {
677 isl_basic_set *aff;
678 pw->p[i].set = fn(pw->p[i].set, isl_set_copy(set));
679 if (!pw->p[i].set)
680 goto error;
681 aff = isl_set_affine_hull(isl_set_copy(pw->p[i].set));
682 pw->p[i].FIELD = FN(EL,substitute_equalities)(pw->p[i].FIELD,
683 aff);
684 if (!pw->p[i].FIELD)
685 goto error;
686 if (isl_set_plain_is_empty(pw->p[i].set)) {
687 isl_set_free(pw->p[i].set);
688 FN(EL,free)(pw->p[i].FIELD);
689 if (i != pw->n - 1)
690 pw->p[i] = pw->p[pw->n - 1];
691 pw->n--;
692 }
693 }
694
695 isl_set_free(set);
696 return pw;
697 error:
698 isl_set_free(set);
699 FN(PW,free)(pw);
700 return NULL;
701 }
702
703 static __isl_give PW *FN(PW,intersect_domain_aligned)(__isl_take PW *pw,
704 __isl_take isl_set *set)
705 {
706 return FN(PW,intersect_aligned)(pw, set, &isl_set_intersect);
707 }
708
709 __isl_give PW *FN(PW,intersect_domain)(__isl_take PW *pw,
710 __isl_take isl_set *context)
711 {
712 return FN(PW,align_params_pw_set_and)(pw, context,
713 &FN(PW,intersect_domain_aligned));
714 }
715
716 static __isl_give PW *FN(PW,intersect_params_aligned)(__isl_take PW *pw,
717 __isl_take isl_set *set)
718 {
719 return FN(PW,intersect_aligned)(pw, set, &isl_set_intersect_params);
720 }
721
722 /* Intersect the domain of "pw" with the parameter domain "context".
723 */
724 __isl_give PW *FN(PW,intersect_params)(__isl_take PW *pw,
725 __isl_take isl_set *context)
726 {
727 return FN(PW,align_params_pw_set_and)(pw, context,
728 &FN(PW,intersect_params_aligned));
729 }
730
731 static __isl_give PW *FN(PW,gist_aligned)(__isl_take PW *pw,
732 __isl_take isl_set *context,
733 __isl_give EL *(*fn_el)(__isl_take EL *el,
734 __isl_take isl_set *set),
735 __isl_give isl_set *(*fn_dom)(__isl_take isl_set *set,
736 __isl_take isl_basic_set *bset))
737 {
738 int i;
739 isl_basic_set *hull = NULL;
740
741 if (!pw || !context)
742 goto error;
743
744 if (pw->n == 0) {
745 isl_set_free(context);
746 return pw;
747 }
748
749 if (!isl_space_match(pw->dim, isl_dim_param,
750 context->dim, isl_dim_param)) {
751 pw = FN(PW,align_params)(pw, isl_set_get_space(context));
752 context = isl_set_align_params(context, FN(PW,get_space)(pw));
753 }
754
755 context = isl_set_compute_divs(context);
756 hull = isl_set_simple_hull(isl_set_copy(context));
757
758 pw = FN(PW,cow)(pw);
759 if (!pw)
760 goto error;
761
762 for (i = pw->n - 1; i >= 0; --i) {
763 pw->p[i].set = isl_set_intersect(pw->p[i].set,
764 isl_set_copy(context));
765 if (!pw->p[i].set)
766 goto error;
767 pw->p[i].FIELD = fn_el(pw->p[i].FIELD,
768 isl_set_copy(pw->p[i].set));
769 pw->p[i].set = fn_dom(pw->p[i].set, isl_basic_set_copy(hull));
770 if (!pw->p[i].set)
771 goto error;
772 if (isl_set_plain_is_empty(pw->p[i].set)) {
773 isl_set_free(pw->p[i].set);
774 FN(EL,free)(pw->p[i].FIELD);
775 if (i != pw->n - 1)
776 pw->p[i] = pw->p[pw->n - 1];
777 pw->n--;
778 }
779 }
780
781 isl_basic_set_free(hull);
782 isl_set_free(context);
783
784 return pw;
785 error:
786 FN(PW,free)(pw);
787 isl_basic_set_free(hull);
788 isl_set_free(context);
789 return NULL;
790 }
791
792 static __isl_give PW *FN(PW,gist_domain_aligned)(__isl_take PW *pw,
793 __isl_take isl_set *set)
794 {
795 return FN(PW,gist_aligned)(pw, set, &FN(EL,gist),
796 &isl_set_gist_basic_set);
797 }
798
799 __isl_give PW *FN(PW,gist)(__isl_take PW *pw, __isl_take isl_set *context)
800 {
801 return FN(PW,align_params_pw_set_and)(pw, context,
802 &FN(PW,gist_domain_aligned));
803 }
804
805 static __isl_give PW *FN(PW,gist_params_aligned)(__isl_take PW *pw,
806 __isl_take isl_set *set)
807 {
808 return FN(PW,gist_aligned)(pw, set, &FN(EL,gist_params),
809 &isl_set_gist_params_basic_set);
810 }
811
812 __isl_give PW *FN(PW,gist_params)(__isl_take PW *pw,
813 __isl_take isl_set *context)
814 {
815 return FN(PW,align_params_pw_set_and)(pw, context,
816 &FN(PW,gist_params_aligned));
817 }
818
819 __isl_give PW *FN(PW,coalesce)(__isl_take PW *pw)
820 {
821 int i, j;
822
823 if (!pw)
824 return NULL;
825 if (pw->n == 0)
826 return pw;
827
828 for (i = pw->n - 1; i >= 0; --i) {
829 for (j = i - 1; j >= 0; --j) {
830 if (!FN(EL,plain_is_equal)(pw->p[i].FIELD,
831 pw->p[j].FIELD))
832 continue;
833 pw->p[j].set = isl_set_union(pw->p[j].set,
834 pw->p[i].set);
835 FN(EL,free)(pw->p[i].FIELD);
836 if (i != pw->n - 1)
837 pw->p[i] = pw->p[pw->n - 1];
838 pw->n--;
839 break;
840 }
841 if (j >= 0)
842 continue;
843 pw->p[i].set = isl_set_coalesce(pw->p[i].set);
844 if (!pw->p[i].set)
845 goto error;
846 }
847
848 return pw;
849 error:
850 FN(PW,free)(pw);
851 return NULL;
852 }
853
854 isl_ctx *FN(PW,get_ctx)(__isl_keep PW *pw)
855 {
856 return pw ? isl_space_get_ctx(pw->dim) : NULL;
857 }
858
859 #ifndef NO_INVOLVES_DIMS
860 int FN(PW,involves_dims)(__isl_keep PW *pw, enum isl_dim_type type,
861 unsigned first, unsigned n)
862 {
863 int i;
864 enum isl_dim_type set_type;
865
866 if (!pw)
867 return -1;
868 if (pw->n == 0 || n == 0)
869 return 0;
870
871 set_type = type == isl_dim_in ? isl_dim_set : type;
872
873 for (i = 0; i < pw->n; ++i) {
874 int involves = FN(EL,involves_dims)(pw->p[i].FIELD,
875 type, first, n);
876 if (involves < 0 || involves)
877 return involves;
878 involves = isl_set_involves_dims(pw->p[i].set,
879 set_type, first, n);
880 if (involves < 0 || involves)
881 return involves;
882 }
883 return 0;
884 }
885 #endif
886
887 __isl_give PW *FN(PW,set_dim_name)(__isl_take PW *pw,
888 enum isl_dim_type type, unsigned pos, const char *s)
889 {
890 int i;
891 enum isl_dim_type set_type;
892
893 pw = FN(PW,cow)(pw);
894 if (!pw)
895 return NULL;
896
897 set_type = type == isl_dim_in ? isl_dim_set : type;
898
899 pw->dim = isl_space_set_dim_name(pw->dim, type, pos, s);
900 if (!pw->dim)
901 goto error;
902
903 for (i = 0; i < pw->n; ++i) {
904 pw->p[i].set = isl_set_set_dim_name(pw->p[i].set,
905 set_type, pos, s);
906 if (!pw->p[i].set)
907 goto error;
908 pw->p[i].FIELD = FN(EL,set_dim_name)(pw->p[i].FIELD, type, pos, s);
909 if (!pw->p[i].FIELD)
910 goto error;
911 }
912
913 return pw;
914 error:
915 FN(PW,free)(pw);
916 return NULL;
917 }
918
919 #ifndef NO_DROP_DIMS
920 __isl_give PW *FN(PW,drop_dims)(__isl_take PW *pw,
921 enum isl_dim_type type, unsigned first, unsigned n)
922 {
923 int i;
924 enum isl_dim_type set_type;
925
926 if (!pw)
927 return NULL;
928 if (n == 0 && !isl_space_get_tuple_name(pw->dim, type))
929 return pw;
930
931 set_type = type == isl_dim_in ? isl_dim_set : type;
932
933 pw = FN(PW,cow)(pw);
934 if (!pw)
935 return NULL;
936 pw->dim = isl_space_drop_dims(pw->dim, type, first, n);
937 if (!pw->dim)
938 goto error;
939 for (i = 0; i < pw->n; ++i) {
940 pw->p[i].set = isl_set_drop(pw->p[i].set, set_type, first, n);
941 if (!pw->p[i].set)
942 goto error;
943 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
944 if (!pw->p[i].FIELD)
945 goto error;
946 }
947
948 return pw;
949 error:
950 FN(PW,free)(pw);
951 return NULL;
952 }
953
954 /* This function is very similar to drop_dims.
955 * The only difference is that the cells may still involve
956 * the specified dimensions. They are removed using
957 * isl_set_project_out instead of isl_set_drop.
958 */
959 __isl_give PW *FN(PW,project_out)(__isl_take PW *pw,
960 enum isl_dim_type type, unsigned first, unsigned n)
961 {
962 int i;
963 enum isl_dim_type set_type;
964
965 if (!pw)
966 return NULL;
967 if (n == 0 && !isl_space_get_tuple_name(pw->dim, type))
968 return pw;
969
970 set_type = type == isl_dim_in ? isl_dim_set : type;
971
972 pw = FN(PW,cow)(pw);
973 if (!pw)
974 return NULL;
975 pw->dim = isl_space_drop_dims(pw->dim, type, first, n);
976 if (!pw->dim)
977 goto error;
978 for (i = 0; i < pw->n; ++i) {
979 pw->p[i].set = isl_set_project_out(pw->p[i].set,
980 set_type, first, n);
981 if (!pw->p[i].set)
982 goto error;
983 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
984 if (!pw->p[i].FIELD)
985 goto error;
986 }
987
988 return pw;
989 error:
990 FN(PW,free)(pw);
991 return NULL;
992 }
993
994 /* Project the domain of pw onto its parameter space.
995 */
996 __isl_give PW *FN(PW,project_domain_on_params)(__isl_take PW *pw)
997 {
998 isl_space *space;
999 unsigned n;
1000
1001 n = FN(PW,dim)(pw, isl_dim_in);
1002 pw = FN(PW,project_out)(pw, isl_dim_in, 0, n);
1003 space = FN(PW,get_domain_space)(pw);
1004 space = isl_space_params(space);
1005 pw = FN(PW,reset_domain_space)(pw, space);
1006 return pw;
1007 }
1008 #endif
1009
1010 #ifndef NO_INSERT_DIMS
1011 __isl_give PW *FN(PW,insert_dims)(__isl_take PW *pw, enum isl_dim_type type,
1012 unsigned first, unsigned n)
1013 {
1014 int i;
1015 enum isl_dim_type set_type;
1016
1017 if (!pw)
1018 return NULL;
1019 if (n == 0 && !isl_space_is_named_or_nested(pw->dim, type))
1020 return pw;
1021
1022 set_type = type == isl_dim_in ? isl_dim_set : type;
1023
1024 pw = FN(PW,cow)(pw);
1025 if (!pw)
1026 return NULL;
1027
1028 pw->dim = isl_space_insert_dims(pw->dim, type, first, n);
1029 if (!pw->dim)
1030 goto error;
1031
1032 for (i = 0; i < pw->n; ++i) {
1033 pw->p[i].set = isl_set_insert_dims(pw->p[i].set,
1034 set_type, first, n);
1035 if (!pw->p[i].set)
1036 goto error;
1037 pw->p[i].FIELD = FN(EL,insert_dims)(pw->p[i].FIELD,
1038 type, first, n);
1039 if (!pw->p[i].FIELD)
1040 goto error;
1041 }
1042
1043 return pw;
1044 error:
1045 FN(PW,free)(pw);
1046 return NULL;
1047 }
1048 #endif
1049
1050 __isl_give PW *FN(PW,fix_dim)(__isl_take PW *pw,
1051 enum isl_dim_type type, unsigned pos, isl_int v)
1052 {
1053 int i;
1054
1055 if (!pw)
1056 return NULL;
1057
1058 if (type == isl_dim_in)
1059 type = isl_dim_set;
1060
1061 pw = FN(PW,cow)(pw);
1062 if (!pw)
1063 return NULL;
1064 for (i = 0; i < pw->n; ++i) {
1065 pw->p[i].set = isl_set_fix(pw->p[i].set, type, pos, v);
1066 if (!pw->p[i].set)
1067 goto error;
1068 }
1069
1070 return pw;
1071 error:
1072 FN(PW,free)(pw);
1073 return NULL;
1074 }
1075
1076 unsigned FN(PW,dim)(__isl_keep PW *pw, enum isl_dim_type type)
1077 {
1078 return pw ? isl_space_dim(pw->dim, type) : 0;
1079 }
1080
1081 __isl_give PW *FN(PW,split_dims)(__isl_take PW *pw,
1082 enum isl_dim_type type, unsigned first, unsigned n)
1083 {
1084 int i;
1085
1086 if (!pw)
1087 return NULL;
1088 if (n == 0)
1089 return pw;
1090
1091 if (type == isl_dim_in)
1092 type = isl_dim_set;
1093
1094 pw = FN(PW,cow)(pw);
1095 if (!pw)
1096 return NULL;
1097 if (!pw->dim)
1098 goto error;
1099 for (i = 0; i < pw->n; ++i) {
1100 pw->p[i].set = isl_set_split_dims(pw->p[i].set, type, first, n);
1101 if (!pw->p[i].set)
1102 goto error;
1103 }
1104
1105 return pw;
1106 error:
1107 FN(PW,free)(pw);
1108 return NULL;
1109 }
1110
1111 #ifndef NO_OPT
1112 /* Compute the maximal value attained by the piecewise quasipolynomial
1113 * on its domain or zero if the domain is empty.
1114 * In the worst case, the domain is scanned completely,
1115 * so the domain is assumed to be bounded.
1116 */
1117 __isl_give isl_qpolynomial *FN(PW,opt)(__isl_take PW *pw, int max)
1118 {
1119 int i;
1120 isl_qpolynomial *opt;
1121
1122 if (!pw)
1123 return NULL;
1124
1125 if (pw->n == 0) {
1126 isl_space *dim = isl_space_copy(pw->dim);
1127 FN(PW,free)(pw);
1128 return isl_qpolynomial_zero_on_domain(isl_space_domain(dim));
1129 }
1130
1131 opt = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[0].FIELD),
1132 isl_set_copy(pw->p[0].set), max);
1133 for (i = 1; i < pw->n; ++i) {
1134 isl_qpolynomial *opt_i;
1135 opt_i = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[i].FIELD),
1136 isl_set_copy(pw->p[i].set), max);
1137 if (max)
1138 opt = isl_qpolynomial_max_cst(opt, opt_i);
1139 else
1140 opt = isl_qpolynomial_min_cst(opt, opt_i);
1141 }
1142
1143 FN(PW,free)(pw);
1144 return opt;
1145 }
1146
1147 __isl_give isl_qpolynomial *FN(PW,max)(__isl_take PW *pw)
1148 {
1149 return FN(PW,opt)(pw, 1);
1150 }
1151
1152 __isl_give isl_qpolynomial *FN(PW,min)(__isl_take PW *pw)
1153 {
1154 return FN(PW,opt)(pw, 0);
1155 }
1156 #endif
1157
1158 __isl_give isl_space *FN(PW,get_space)(__isl_keep PW *pw)
1159 {
1160 return pw ? isl_space_copy(pw->dim) : NULL;
1161 }
1162
1163 __isl_give isl_space *FN(PW,get_domain_space)(__isl_keep PW *pw)
1164 {
1165 return pw ? isl_space_domain(isl_space_copy(pw->dim)) : NULL;
1166 }
1167
1168 #ifndef NO_RESET_DIM
1169 /* Reset the space of "pw". Since we don't know if the elements
1170 * represent the spaces themselves or their domains, we pass along
1171 * both when we call their reset_space_and_domain.
1172 */
1173 static __isl_give PW *FN(PW,reset_space_and_domain)(__isl_take PW *pw,
1174 __isl_take isl_space *space, __isl_take isl_space *domain)
1175 {
1176 int i;
1177
1178 pw = FN(PW,cow)(pw);
1179 if (!pw || !space || !domain)
1180 goto error;
1181
1182 for (i = 0; i < pw->n; ++i) {
1183 pw->p[i].set = isl_set_reset_space(pw->p[i].set,
1184 isl_space_copy(domain));
1185 if (!pw->p[i].set)
1186 goto error;
1187 pw->p[i].FIELD = FN(EL,reset_space_and_domain)(pw->p[i].FIELD,
1188 isl_space_copy(space), isl_space_copy(domain));
1189 if (!pw->p[i].FIELD)
1190 goto error;
1191 }
1192
1193 isl_space_free(domain);
1194
1195 isl_space_free(pw->dim);
1196 pw->dim = space;
1197
1198 return pw;
1199 error:
1200 isl_space_free(domain);
1201 isl_space_free(space);
1202 FN(PW,free)(pw);
1203 return NULL;
1204 }
1205
1206 __isl_give PW *FN(PW,reset_domain_space)(__isl_take PW *pw,
1207 __isl_take isl_space *domain)
1208 {
1209 isl_space *space;
1210
1211 space = isl_space_extend_domain_with_range(isl_space_copy(domain),
1212 FN(PW,get_space)(pw));
1213 return FN(PW,reset_space_and_domain)(pw, space, domain);
1214 }
1215
1216 __isl_give PW *FN(PW,reset_space)(__isl_take PW *pw, __isl_take isl_space *dim)
1217 {
1218 isl_space *domain;
1219
1220 domain = isl_space_domain(isl_space_copy(dim));
1221 return FN(PW,reset_space_and_domain)(pw, dim, domain);
1222 }
1223
1224 __isl_give PW *FN(PW,set_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type,
1225 __isl_take isl_id *id)
1226 {
1227 isl_space *space;
1228
1229 pw = FN(PW,cow)(pw);
1230 if (!pw)
1231 return isl_id_free(id);
1232
1233 space = FN(PW,get_space)(pw);
1234 space = isl_space_set_tuple_id(space, type, id);
1235
1236 return FN(PW,reset_space)(pw, space);
1237 }
1238
1239 __isl_give PW *FN(PW,set_dim_id)(__isl_take PW *pw,
1240 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
1241 {
1242 pw = FN(PW,cow)(pw);
1243 if (!pw)
1244 return isl_id_free(id);
1245 pw->dim = isl_space_set_dim_id(pw->dim, type, pos, id);
1246 return FN(PW,reset_space)(pw, isl_space_copy(pw->dim));
1247 }
1248 #endif
1249
1250 int FN(PW,has_equal_space)(__isl_keep PW *pw1, __isl_keep PW *pw2)
1251 {
1252 if (!pw1 || !pw2)
1253 return -1;
1254
1255 return isl_space_is_equal(pw1->dim, pw2->dim);
1256 }
1257
1258 #ifndef NO_MORPH
1259 __isl_give PW *FN(PW,morph_domain)(__isl_take PW *pw,
1260 __isl_take isl_morph *morph)
1261 {
1262 int i;
1263 isl_ctx *ctx;
1264
1265 if (!pw || !morph)
1266 goto error;
1267
1268 ctx = isl_space_get_ctx(pw->dim);
1269 isl_assert(ctx, isl_space_is_domain(morph->dom->dim, pw->dim),
1270 goto error);
1271
1272 pw = FN(PW,cow)(pw);
1273 if (!pw)
1274 goto error;
1275 pw->dim = isl_space_extend_domain_with_range(
1276 isl_space_copy(morph->ran->dim), pw->dim);
1277 if (!pw->dim)
1278 goto error;
1279
1280 for (i = 0; i < pw->n; ++i) {
1281 pw->p[i].set = isl_morph_set(isl_morph_copy(morph), pw->p[i].set);
1282 if (!pw->p[i].set)
1283 goto error;
1284 pw->p[i].FIELD = FN(EL,morph_domain)(pw->p[i].FIELD,
1285 isl_morph_copy(morph));
1286 if (!pw->p[i].FIELD)
1287 goto error;
1288 }
1289
1290 isl_morph_free(morph);
1291
1292 return pw;
1293 error:
1294 FN(PW,free)(pw);
1295 isl_morph_free(morph);
1296 return NULL;
1297 }
1298 #endif
1299
1300 int FN(PW,foreach_piece)(__isl_keep PW *pw,
1301 int (*fn)(__isl_take isl_set *set, __isl_take EL *el, void *user),
1302 void *user)
1303 {
1304 int i;
1305
1306 if (!pw)
1307 return -1;
1308
1309 for (i = 0; i < pw->n; ++i)
1310 if (fn(isl_set_copy(pw->p[i].set),
1311 FN(EL,copy)(pw->p[i].FIELD), user) < 0)
1312 return -1;
1313
1314 return 0;
1315 }
1316
1317 #ifndef NO_LIFT
1318 static int any_divs(__isl_keep isl_set *set)
1319 {
1320 int i;
1321
1322 if (!set)
1323 return -1;
1324
1325 for (i = 0; i < set->n; ++i)
1326 if (set->p[i]->n_div > 0)
1327 return 1;
1328
1329 return 0;
1330 }
1331
1332 static int foreach_lifted_subset(__isl_take isl_set *set, __isl_take EL *el,
1333 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
1334 void *user), void *user)
1335 {
1336 int i;
1337
1338 if (!set || !el)
1339 goto error;
1340
1341 for (i = 0; i < set->n; ++i) {
1342 isl_set *lift;
1343 EL *copy;
1344
1345 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
1346 lift = isl_set_lift(lift);
1347
1348 copy = FN(EL,copy)(el);
1349 copy = FN(EL,lift)(copy, isl_set_get_space(lift));
1350
1351 if (fn(lift, copy, user) < 0)
1352 goto error;
1353 }
1354
1355 isl_set_free(set);
1356 FN(EL,free)(el);
1357
1358 return 0;
1359 error:
1360 isl_set_free(set);
1361 FN(EL,free)(el);
1362 return -1;
1363 }
1364
1365 int FN(PW,foreach_lifted_piece)(__isl_keep PW *pw,
1366 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
1367 void *user), void *user)
1368 {
1369 int i;
1370
1371 if (!pw)
1372 return -1;
1373
1374 for (i = 0; i < pw->n; ++i) {
1375 isl_set *set;
1376 EL *el;
1377
1378 set = isl_set_copy(pw->p[i].set);
1379 el = FN(EL,copy)(pw->p[i].FIELD);
1380 if (!any_divs(set)) {
1381 if (fn(set, el, user) < 0)
1382 return -1;
1383 continue;
1384 }
1385 if (foreach_lifted_subset(set, el, fn, user) < 0)
1386 return -1;
1387 }
1388
1389 return 0;
1390 }
1391 #endif
1392
1393 #ifndef NO_MOVE_DIMS
1394 __isl_give PW *FN(PW,move_dims)(__isl_take PW *pw,
1395 enum isl_dim_type dst_type, unsigned dst_pos,
1396 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
1397 {
1398 int i;
1399
1400 pw = FN(PW,cow)(pw);
1401 if (!pw)
1402 return NULL;
1403
1404 pw->dim = isl_space_move_dims(pw->dim, dst_type, dst_pos, src_type, src_pos, n);
1405 if (!pw->dim)
1406 goto error;
1407
1408 for (i = 0; i < pw->n; ++i) {
1409 pw->p[i].FIELD = FN(EL,move_dims)(pw->p[i].FIELD,
1410 dst_type, dst_pos, src_type, src_pos, n);
1411 if (!pw->p[i].FIELD)
1412 goto error;
1413 }
1414
1415 if (dst_type == isl_dim_in)
1416 dst_type = isl_dim_set;
1417 if (src_type == isl_dim_in)
1418 src_type = isl_dim_set;
1419
1420 for (i = 0; i < pw->n; ++i) {
1421 pw->p[i].set = isl_set_move_dims(pw->p[i].set,
1422 dst_type, dst_pos,
1423 src_type, src_pos, n);
1424 if (!pw->p[i].set)
1425 goto error;
1426 }
1427
1428 return pw;
1429 error:
1430 FN(PW,free)(pw);
1431 return NULL;
1432 }
1433 #endif
1434
1435 __isl_give PW *FN(PW,mul_isl_int)(__isl_take PW *pw, isl_int v)
1436 {
1437 int i;
1438
1439 if (isl_int_is_one(v))
1440 return pw;
1441 if (pw && DEFAULT_IS_ZERO && isl_int_is_zero(v)) {
1442 PW *zero;
1443 isl_space *dim = FN(PW,get_space)(pw);
1444 #ifdef HAS_TYPE
1445 zero = FN(PW,ZERO)(dim, pw->type);
1446 #else
1447 zero = FN(PW,ZERO)(dim);
1448 #endif
1449 FN(PW,free)(pw);
1450 return zero;
1451 }
1452 pw = FN(PW,cow)(pw);
1453 if (!pw)
1454 return NULL;
1455 if (pw->n == 0)
1456 return pw;
1457
1458 #ifdef HAS_TYPE
1459 if (isl_int_is_neg(v))
1460 pw->type = isl_fold_type_negate(pw->type);
1461 #endif
1462 for (i = 0; i < pw->n; ++i) {
1463 pw->p[i].FIELD = FN(EL,scale)(pw->p[i].FIELD, v);
1464 if (!pw->p[i].FIELD)
1465 goto error;
1466 }
1467
1468 return pw;
1469 error:
1470 FN(PW,free)(pw);
1471 return NULL;
1472 }
1473
1474 __isl_give PW *FN(PW,scale)(__isl_take PW *pw, isl_int v)
1475 {
1476 return FN(PW,mul_isl_int)(pw, v);
1477 }
1478
1479 static int FN(PW,qsort_set_cmp)(const void *p1, const void *p2)
1480 {
1481 const isl_set *set1 = *(const isl_set **)p1;
1482 const isl_set *set2 = *(const isl_set **)p2;
1483
1484 return isl_set_plain_cmp(set1, set2);
1485 }
1486
1487 /* We normalize in place, but if anything goes wrong we need
1488 * to return NULL, so we need to make sure we don't change the
1489 * meaning of any possible other copies of map.
1490 */
1491 __isl_give PW *FN(PW,normalize)(__isl_take PW *pw)
1492 {
1493 int i, j;
1494 isl_set *set;
1495
1496 if (!pw)
1497 return NULL;
1498 for (i = 0; i < pw->n; ++i) {
1499 set = isl_set_normalize(isl_set_copy(pw->p[i].set));
1500 if (!set)
1501 return FN(PW,free)(pw);
1502 isl_set_free(pw->p[i].set);
1503 pw->p[i].set = set;
1504 }
1505 qsort(pw->p, pw->n, sizeof(pw->p[0]), &FN(PW,qsort_set_cmp));
1506 for (i = pw->n - 1; i >= 1; --i) {
1507 if (!isl_set_plain_is_equal(pw->p[i - 1].set, pw->p[i].set))
1508 continue;
1509 if (!FN(EL,plain_is_equal)(pw->p[i - 1].FIELD, pw->p[i].FIELD))
1510 continue;
1511 set = isl_set_union(isl_set_copy(pw->p[i - 1].set),
1512 isl_set_copy(pw->p[i].set));
1513 if (!set)
1514 return FN(PW,free)(pw);
1515 isl_set_free(pw->p[i].set);
1516 FN(EL,free)(pw->p[i].FIELD);
1517 isl_set_free(pw->p[i - 1].set);
1518 pw->p[i - 1].set = set;
1519 for (j = i + 1; j < pw->n; ++j)
1520 pw->p[j - 1] = pw->p[j];
1521 pw->n--;
1522 }
1523
1524 return pw;
1525 }
1526
1527 /* Is pw1 obviously equal to pw2?
1528 * That is, do they have obviously identical cells and obviously identical
1529 * elements on each cell?
1530 */
1531 int FN(PW,plain_is_equal)(__isl_keep PW *pw1, __isl_keep PW *pw2)
1532 {
1533 int i;
1534 int equal;
1535
1536 if (!pw1 || !pw2)
1537 return -1;
1538
1539 if (pw1 == pw2)
1540 return 1;
1541 if (!isl_space_is_equal(pw1->dim, pw2->dim))
1542 return 0;
1543
1544 pw1 = FN(PW,copy)(pw1);
1545 pw2 = FN(PW,copy)(pw2);
1546 pw1 = FN(PW,normalize)(pw1);
1547 pw2 = FN(PW,normalize)(pw2);
1548 if (!pw1 || !pw2)
1549 goto error;
1550
1551 equal = pw1->n == pw2->n;
1552 for (i = 0; equal && i < pw1->n; ++i) {
1553 equal = isl_set_plain_is_equal(pw1->p[i].set, pw2->p[i].set);
1554 if (equal < 0)
1555 goto error;
1556 if (!equal)
1557 break;
1558 equal = FN(EL,plain_is_equal)(pw1->p[i].FIELD, pw2->p[i].FIELD);
1559 if (equal < 0)
1560 goto error;
1561 }
1562
1563 FN(PW,free)(pw1);
1564 FN(PW,free)(pw2);
1565 return equal;
1566 error:
1567 FN(PW,free)(pw1);
1568 FN(PW,free)(pw2);
1569 return -1;
1570 }
Integer set library