?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
add isl_pw_aff_union_opt
[isl.git] / isl_aff.c
blob7c46d345338c274b61f33293ae64413631307695
1 /*
2 * Copyright 2011 INRIA Saclay
3 * Copyright 2011 Sven Verdoolaege
4 *
5 * Use of this software is governed by the GNU LGPLv2.1 license
6 *
7 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
8 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
9 * 91893 Orsay, France
10 */
11
12 #include <isl_ctx_private.h>
13 #include <isl_map_private.h>
14 #include <isl_aff_private.h>
15 #include <isl_dim_private.h>
16 #include <isl_local_space_private.h>
17 #include <isl_mat_private.h>
18 #include <isl_list_private.h>
19 #include <isl/constraint.h>
20 #include <isl/seq.h>
21 #include <isl/set.h>
22
23 __isl_give isl_aff *isl_aff_alloc_vec(__isl_take isl_local_space *ls,
24 __isl_take isl_vec *v)
25 {
26 isl_aff *aff;
27
28 if (!ls || !v)
29 goto error;
30
31 aff = isl_calloc_type(v->ctx, struct isl_aff);
32 if (!aff)
33 goto error;
34
35 aff->ref = 1;
36 aff->ls = ls;
37 aff->v = v;
38
39 return aff;
40 error:
41 isl_local_space_free(ls);
42 isl_vec_free(v);
43 return NULL;
44 }
45
46 __isl_give isl_aff *isl_aff_alloc(__isl_take isl_local_space *ls)
47 {
48 isl_ctx *ctx;
49 isl_vec *v;
50 unsigned total;
51
52 if (!ls)
53 return NULL;
54
55 ctx = isl_local_space_get_ctx(ls);
56 if (!isl_local_space_divs_known(ls))
57 isl_die(ctx, isl_error_invalid, "local space has unknown divs",
58 goto error);
59
60 total = isl_local_space_dim(ls, isl_dim_all);
61 v = isl_vec_alloc(ctx, 1 + 1 + total);
62 return isl_aff_alloc_vec(ls, v);
63 error:
64 isl_local_space_free(ls);
65 return NULL;
66 }
67
68 __isl_give isl_aff *isl_aff_zero(__isl_take isl_local_space *ls)
69 {
70 isl_aff *aff;
71
72 aff = isl_aff_alloc(ls);
73 if (!aff)
74 return NULL;
75
76 isl_int_set_si(aff->v->el[0], 1);
77 isl_seq_clr(aff->v->el + 1, aff->v->size - 1);
78
79 return aff;
80 }
81
82 __isl_give isl_aff *isl_aff_copy(__isl_keep isl_aff *aff)
83 {
84 if (!aff)
85 return NULL;
86
87 aff->ref++;
88 return aff;
89 }
90
91 __isl_give isl_aff *isl_aff_dup(__isl_keep isl_aff *aff)
92 {
93 if (!aff)
94 return NULL;
95
96 return isl_aff_alloc_vec(isl_local_space_copy(aff->ls),
97 isl_vec_copy(aff->v));
98 }
99
100 __isl_give isl_aff *isl_aff_cow(__isl_take isl_aff *aff)
101 {
102 if (!aff)
103 return NULL;
104
105 if (aff->ref == 1)
106 return aff;
107 aff->ref--;
108 return isl_aff_dup(aff);
109 }
110
111 void *isl_aff_free(__isl_take isl_aff *aff)
112 {
113 if (!aff)
114 return NULL;
115
116 if (--aff->ref > 0)
117 return NULL;
118
119 isl_local_space_free(aff->ls);
120 isl_vec_free(aff->v);
121
122 free(aff);
123
124 return NULL;
125 }
126
127 isl_ctx *isl_aff_get_ctx(__isl_keep isl_aff *aff)
128 {
129 return aff ? isl_local_space_get_ctx(aff->ls) : NULL;
130 }
131
132 int isl_aff_dim(__isl_keep isl_aff *aff, enum isl_dim_type type)
133 {
134 return aff ? isl_local_space_dim(aff->ls, type) : 0;
135 }
136
137 __isl_give isl_dim *isl_aff_get_dim(__isl_keep isl_aff *aff)
138 {
139 return aff ? isl_local_space_get_dim(aff->ls) : NULL;
140 }
141
142 __isl_give isl_local_space *isl_aff_get_local_space(__isl_keep isl_aff *aff)
143 {
144 return aff ? isl_local_space_copy(aff->ls) : NULL;
145 }
146
147 const char *isl_aff_get_dim_name(__isl_keep isl_aff *aff,
148 enum isl_dim_type type, unsigned pos)
149 {
150 return aff ? isl_local_space_get_dim_name(aff->ls, type, pos) : 0;
151 }
152
153 __isl_give isl_aff *isl_aff_reset_dim(__isl_take isl_aff *aff,
154 __isl_take isl_dim *dim)
155 {
156 aff = isl_aff_cow(aff);
157 if (!aff || !dim)
158 goto error;
159
160 aff->ls = isl_local_space_reset_dim(aff->ls, dim);
161 if (!aff->ls)
162 return isl_aff_free(aff);
163
164 return aff;
165 error:
166 isl_aff_free(aff);
167 isl_dim_free(dim);
168 return NULL;
169 }
170
171 /* Reorder the coefficients of the affine expression based
172 * on the given reodering.
173 * The reordering r is assumed to have been extended with the local
174 * variables.
175 */
176 static __isl_give isl_vec *vec_reorder(__isl_take isl_vec *vec,
177 __isl_take isl_reordering *r, int n_div)
178 {
179 isl_vec *res;
180 int i;
181
182 if (!vec || !r)
183 goto error;
184
185 res = isl_vec_alloc(vec->ctx, 2 + isl_dim_total(r->dim) + n_div);
186 isl_seq_cpy(res->el, vec->el, 2);
187 isl_seq_clr(res->el + 2, res->size - 2);
188 for (i = 0; i < r->len; ++i)
189 isl_int_set(res->el[2 + r->pos[i]], vec->el[2 + i]);
190
191 isl_reordering_free(r);
192 isl_vec_free(vec);
193 return res;
194 error:
195 isl_vec_free(vec);
196 isl_reordering_free(r);
197 return NULL;
198 }
199
200 /* Reorder the dimensions of "aff" according to the given reordering.
201 */
202 __isl_give isl_aff *isl_aff_realign(__isl_take isl_aff *aff,
203 __isl_take isl_reordering *r)
204 {
205 aff = isl_aff_cow(aff);
206 if (!aff)
207 goto error;
208
209 r = isl_reordering_extend(r, aff->ls->div->n_row);
210 aff->v = vec_reorder(aff->v, isl_reordering_copy(r),
211 aff->ls->div->n_row);
212 aff->ls = isl_local_space_realign(aff->ls, r);
213
214 if (!aff->v || !aff->ls)
215 return isl_aff_free(aff);
216
217 return aff;
218 error:
219 isl_aff_free(aff);
220 isl_reordering_free(r);
221 return NULL;
222 }
223
224 int isl_aff_plain_is_zero(__isl_keep isl_aff *aff)
225 {
226 if (!aff)
227 return -1;
228
229 return isl_seq_first_non_zero(aff->v->el + 1, aff->v->size - 1) < 0;
230 }
231
232 int isl_aff_plain_is_equal(__isl_keep isl_aff *aff1, __isl_keep isl_aff *aff2)
233 {
234 int equal;
235
236 if (!aff1 || !aff2)
237 return -1;
238
239 equal = isl_local_space_is_equal(aff1->ls, aff2->ls);
240 if (equal < 0 || !equal)
241 return equal;
242
243 return isl_vec_is_equal(aff1->v, aff2->v);
244 }
245
246 int isl_aff_get_denominator(__isl_keep isl_aff *aff, isl_int *v)
247 {
248 if (!aff)
249 return -1;
250 isl_int_set(*v, aff->v->el[0]);
251 return 0;
252 }
253
254 int isl_aff_get_constant(__isl_keep isl_aff *aff, isl_int *v)
255 {
256 if (!aff)
257 return -1;
258 isl_int_set(*v, aff->v->el[1]);
259 return 0;
260 }
261
262 int isl_aff_get_coefficient(__isl_keep isl_aff *aff,
263 enum isl_dim_type type, int pos, isl_int *v)
264 {
265 if (!aff)
266 return -1;
267
268 if (pos >= isl_local_space_dim(aff->ls, type))
269 isl_die(aff->v->ctx, isl_error_invalid,
270 "position out of bounds", return -1);
271
272 pos += isl_local_space_offset(aff->ls, type);
273 isl_int_set(*v, aff->v->el[1 + pos]);
274
275 return 0;
276 }
277
278 __isl_give isl_aff *isl_aff_set_denominator(__isl_take isl_aff *aff, isl_int v)
279 {
280 aff = isl_aff_cow(aff);
281 if (!aff)
282 return NULL;
283
284 aff->v = isl_vec_cow(aff->v);
285 if (!aff->v)
286 return isl_aff_free(aff);
287
288 isl_int_set(aff->v->el[0], v);
289
290 return aff;
291 }
292
293 __isl_give isl_aff *isl_aff_set_constant(__isl_take isl_aff *aff, isl_int v)
294 {
295 aff = isl_aff_cow(aff);
296 if (!aff)
297 return NULL;
298
299 aff->v = isl_vec_cow(aff->v);
300 if (!aff->v)
301 return isl_aff_free(aff);
302
303 isl_int_set(aff->v->el[1], v);
304
305 return aff;
306 }
307
308 __isl_give isl_aff *isl_aff_add_constant(__isl_take isl_aff *aff, isl_int v)
309 {
310 if (isl_int_is_zero(v))
311 return aff;
312
313 aff = isl_aff_cow(aff);
314 if (!aff)
315 return NULL;
316
317 aff->v = isl_vec_cow(aff->v);
318 if (!aff->v)
319 return isl_aff_free(aff);
320
321 isl_int_addmul(aff->v->el[1], aff->v->el[0], v);
322
323 return aff;
324 }
325
326 __isl_give isl_aff *isl_aff_add_constant_si(__isl_take isl_aff *aff, int v)
327 {
328 isl_int t;
329
330 isl_int_init(t);
331 isl_int_set_si(t, v);
332 aff = isl_aff_add_constant(aff, t);
333 isl_int_clear(t);
334
335 return aff;
336 }
337
338 __isl_give isl_aff *isl_aff_set_constant_si(__isl_take isl_aff *aff, int v)
339 {
340 aff = isl_aff_cow(aff);
341 if (!aff)
342 return NULL;
343
344 aff->v = isl_vec_cow(aff->v);
345 if (!aff->v)
346 return isl_aff_free(aff);
347
348 isl_int_set_si(aff->v->el[1], v);
349
350 return aff;
351 }
352
353 __isl_give isl_aff *isl_aff_set_coefficient(__isl_take isl_aff *aff,
354 enum isl_dim_type type, int pos, isl_int v)
355 {
356 if (!aff)
357 return NULL;
358
359 if (pos >= isl_local_space_dim(aff->ls, type))
360 isl_die(aff->v->ctx, isl_error_invalid,
361 "position out of bounds", return isl_aff_free(aff));
362
363 aff = isl_aff_cow(aff);
364 if (!aff)
365 return NULL;
366
367 aff->v = isl_vec_cow(aff->v);
368 if (!aff->v)
369 return isl_aff_free(aff);
370
371 pos += isl_local_space_offset(aff->ls, type);
372 isl_int_set(aff->v->el[1 + pos], v);
373
374 return aff;
375 }
376
377 __isl_give isl_aff *isl_aff_set_coefficient_si(__isl_take isl_aff *aff,
378 enum isl_dim_type type, int pos, int v)
379 {
380 if (!aff)
381 return NULL;
382
383 if (pos >= isl_local_space_dim(aff->ls, type))
384 isl_die(aff->v->ctx, isl_error_invalid,
385 "position out of bounds", return isl_aff_free(aff));
386
387 aff = isl_aff_cow(aff);
388 if (!aff)
389 return NULL;
390
391 aff->v = isl_vec_cow(aff->v);
392 if (!aff->v)
393 return isl_aff_free(aff);
394
395 pos += isl_local_space_offset(aff->ls, type);
396 isl_int_set_si(aff->v->el[1 + pos], v);
397
398 return aff;
399 }
400
401 __isl_give isl_aff *isl_aff_add_coefficient(__isl_take isl_aff *aff,
402 enum isl_dim_type type, int pos, isl_int v)
403 {
404 if (!aff)
405 return NULL;
406
407 if (pos >= isl_local_space_dim(aff->ls, type))
408 isl_die(aff->v->ctx, isl_error_invalid,
409 "position out of bounds", return isl_aff_free(aff));
410
411 aff = isl_aff_cow(aff);
412 if (!aff)
413 return NULL;
414
415 aff->v = isl_vec_cow(aff->v);
416 if (!aff->v)
417 return isl_aff_free(aff);
418
419 pos += isl_local_space_offset(aff->ls, type);
420 isl_int_addmul(aff->v->el[1 + pos], aff->v->el[0], v);
421
422 return aff;
423 }
424
425 __isl_give isl_aff *isl_aff_add_coefficient_si(__isl_take isl_aff *aff,
426 enum isl_dim_type type, int pos, int v)
427 {
428 isl_int t;
429
430 isl_int_init(t);
431 isl_int_set_si(t, v);
432 aff = isl_aff_add_coefficient(aff, type, pos, t);
433 isl_int_clear(t);
434
435 return aff;
436 }
437
438 __isl_give isl_div *isl_aff_get_div(__isl_keep isl_aff *aff, int pos)
439 {
440 if (!aff)
441 return NULL;
442
443 return isl_local_space_get_div(aff->ls, pos);
444 }
445
446 __isl_give isl_aff *isl_aff_neg(__isl_take isl_aff *aff)
447 {
448 aff = isl_aff_cow(aff);
449 if (!aff)
450 return NULL;
451 aff->v = isl_vec_cow(aff->v);
452 if (!aff->v)
453 return isl_aff_free(aff);
454
455 isl_seq_neg(aff->v->el + 1, aff->v->el + 1, aff->v->size - 1);
456
457 return aff;
458 }
459
460 /* Given f, return floor(f).
461 * If f is an integer expression, then just return f.
462 * Otherwise, if f = g/m, write g = q m + r,
463 * create a new div d = [r/m] and return the expression q + d.
464 * The coefficients in r are taken to lie between -m/2 and m/2.
465 */
466 __isl_give isl_aff *isl_aff_floor(__isl_take isl_aff *aff)
467 {
468 int i;
469 int size;
470 isl_ctx *ctx;
471 isl_vec *div;
472
473 if (!aff)
474 return NULL;
475
476 if (isl_int_is_one(aff->v->el[0]))
477 return aff;
478
479 aff = isl_aff_cow(aff);
480 if (!aff)
481 return NULL;
482
483 aff->v = isl_vec_cow(aff->v);
484 div = isl_vec_copy(aff->v);
485 div = isl_vec_cow(div);
486 if (!div)
487 return isl_aff_free(aff);
488
489 ctx = isl_aff_get_ctx(aff);
490 isl_int_fdiv_q(aff->v->el[0], aff->v->el[0], ctx->two);
491 for (i = 1; i < aff->v->size; ++i) {
492 isl_int_fdiv_r(div->el[i], div->el[i], div->el[0]);
493 isl_int_fdiv_q(aff->v->el[i], aff->v->el[i], div->el[0]);
494 if (isl_int_gt(div->el[i], aff->v->el[0])) {
495 isl_int_sub(div->el[i], div->el[i], div->el[0]);
496 isl_int_add_ui(aff->v->el[i], aff->v->el[i], 1);
497 }
498 }
499
500 aff->ls = isl_local_space_add_div(aff->ls, div);
501 if (!aff->ls)
502 return isl_aff_free(aff);
503
504 size = aff->v->size;
505 aff->v = isl_vec_extend(aff->v, size + 1);
506 if (!aff->v)
507 return isl_aff_free(aff);
508 isl_int_set_si(aff->v->el[0], 1);
509 isl_int_set_si(aff->v->el[size], 1);
510
511 return aff;
512 }
513
514 /* Compute
515 *
516 * aff mod m = aff - m * floor(aff/m)
517 */
518 __isl_give isl_aff *isl_aff_mod(__isl_take isl_aff *aff, isl_int m)
519 {
520 isl_aff *res;
521
522 res = isl_aff_copy(aff);
523 aff = isl_aff_scale_down(aff, m);
524 aff = isl_aff_floor(aff);
525 aff = isl_aff_scale(aff, m);
526 res = isl_aff_sub(res, aff);
527
528 return res;
529 }
530
531 /* Compute
532 *
533 * pwaff mod m = pwaff - m * floor(pwaff/m)
534 */
535 __isl_give isl_pw_aff *isl_pw_aff_mod(__isl_take isl_pw_aff *pwaff, isl_int m)
536 {
537 isl_pw_aff *res;
538
539 res = isl_pw_aff_copy(pwaff);
540 pwaff = isl_pw_aff_scale_down(pwaff, m);
541 pwaff = isl_pw_aff_floor(pwaff);
542 pwaff = isl_pw_aff_scale(pwaff, m);
543 res = isl_pw_aff_sub(res, pwaff);
544
545 return res;
546 }
547
548 /* Given f, return ceil(f).
549 * If f is an integer expression, then just return f.
550 * Otherwise, create a new div d = [-f] and return the expression -d.
551 */
552 __isl_give isl_aff *isl_aff_ceil(__isl_take isl_aff *aff)
553 {
554 if (!aff)
555 return NULL;
556
557 if (isl_int_is_one(aff->v->el[0]))
558 return aff;
559
560 aff = isl_aff_neg(aff);
561 aff = isl_aff_floor(aff);
562 aff = isl_aff_neg(aff);
563
564 return aff;
565 }
566
567 /* Apply the expansion computed by isl_merge_divs.
568 * The expansion itself is given by "exp" while the resulting
569 * list of divs is given by "div".
570 */
571 __isl_give isl_aff *isl_aff_expand_divs( __isl_take isl_aff *aff,
572 __isl_take isl_mat *div, int *exp)
573 {
574 int i, j;
575 int old_n_div;
576 int new_n_div;
577 int offset;
578
579 aff = isl_aff_cow(aff);
580 if (!aff || !div)
581 goto error;
582
583 old_n_div = isl_local_space_dim(aff->ls, isl_dim_div);
584 new_n_div = isl_mat_rows(div);
585 if (new_n_div < old_n_div)
586 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
587 "not an expansion", goto error);
588
589 aff->v = isl_vec_extend(aff->v, aff->v->size + new_n_div - old_n_div);
590 if (!aff->v)
591 goto error;
592
593 offset = 1 + isl_local_space_offset(aff->ls, isl_dim_div);
594 j = old_n_div - 1;
595 for (i = new_n_div - 1; i >= 0; --i) {
596 if (j >= 0 && exp[j] == i) {
597 if (i != j)
598 isl_int_swap(aff->v->el[offset + i],
599 aff->v->el[offset + j]);
600 j--;
601 } else
602 isl_int_set_si(aff->v->el[offset + i], 0);
603 }
604
605 aff->ls = isl_local_space_replace_divs(aff->ls, isl_mat_copy(div));
606 if (!aff->ls)
607 goto error;
608 isl_mat_free(div);
609 return aff;
610 error:
611 isl_aff_free(aff);
612 isl_mat_free(div);
613 return NULL;
614 }
615
616 /* Add two affine expressions that live in the same local space.
617 */
618 static __isl_give isl_aff *add_expanded(__isl_take isl_aff *aff1,
619 __isl_take isl_aff *aff2)
620 {
621 isl_int gcd, f;
622
623 aff1 = isl_aff_cow(aff1);
624 if (!aff1 || !aff2)
625 goto error;
626
627 aff1->v = isl_vec_cow(aff1->v);
628 if (!aff1->v)
629 goto error;
630
631 isl_int_init(gcd);
632 isl_int_init(f);
633 isl_int_gcd(gcd, aff1->v->el[0], aff2->v->el[0]);
634 isl_int_divexact(f, aff2->v->el[0], gcd);
635 isl_seq_scale(aff1->v->el + 1, aff1->v->el + 1, f, aff1->v->size - 1);
636 isl_int_divexact(f, aff1->v->el[0], gcd);
637 isl_seq_addmul(aff1->v->el + 1, f, aff2->v->el + 1, aff1->v->size - 1);
638 isl_int_divexact(f, aff2->v->el[0], gcd);
639 isl_int_mul(aff1->v->el[0], aff1->v->el[0], f);
640 isl_int_clear(f);
641 isl_int_clear(gcd);
642
643 isl_aff_free(aff2);
644 return aff1;
645 error:
646 isl_aff_free(aff1);
647 isl_aff_free(aff2);
648 return NULL;
649 }
650
651 __isl_give isl_aff *isl_aff_add(__isl_take isl_aff *aff1,
652 __isl_take isl_aff *aff2)
653 {
654 isl_ctx *ctx;
655 int *exp1 = NULL;
656 int *exp2 = NULL;
657 isl_mat *div;
658
659 if (!aff1 || !aff2)
660 goto error;
661
662 ctx = isl_aff_get_ctx(aff1);
663 if (!isl_dim_equal(aff1->ls->dim, aff2->ls->dim))
664 isl_die(ctx, isl_error_invalid,
665 "spaces don't match", goto error);
666
667 if (aff1->ls->div->n_row == 0 && aff2->ls->div->n_row == 0)
668 return add_expanded(aff1, aff2);
669
670 exp1 = isl_alloc_array(ctx, int, aff1->ls->div->n_row);
671 exp2 = isl_alloc_array(ctx, int, aff2->ls->div->n_row);
672 if (!exp1 || !exp2)
673 goto error;
674
675 div = isl_merge_divs(aff1->ls->div, aff2->ls->div, exp1, exp2);
676 aff1 = isl_aff_expand_divs(aff1, isl_mat_copy(div), exp1);
677 aff2 = isl_aff_expand_divs(aff2, div, exp2);
678 free(exp1);
679 free(exp2);
680
681 return add_expanded(aff1, aff2);
682 error:
683 free(exp1);
684 free(exp2);
685 isl_aff_free(aff1);
686 isl_aff_free(aff2);
687 return NULL;
688 }
689
690 __isl_give isl_aff *isl_aff_sub(__isl_take isl_aff *aff1,
691 __isl_take isl_aff *aff2)
692 {
693 return isl_aff_add(aff1, isl_aff_neg(aff2));
694 }
695
696 __isl_give isl_aff *isl_aff_scale(__isl_take isl_aff *aff, isl_int f)
697 {
698 isl_int gcd;
699
700 if (isl_int_is_one(f))
701 return aff;
702
703 aff = isl_aff_cow(aff);
704 if (!aff)
705 return NULL;
706 aff->v = isl_vec_cow(aff->v);
707 if (!aff->v)
708 return isl_aff_free(aff);
709
710 isl_int_init(gcd);
711 isl_int_gcd(gcd, aff->v->el[0], f);
712 isl_int_divexact(aff->v->el[0], aff->v->el[0], gcd);
713 isl_int_divexact(gcd, f, gcd);
714 isl_seq_scale(aff->v->el + 1, aff->v->el + 1, gcd, aff->v->size - 1);
715 isl_int_clear(gcd);
716
717 return aff;
718 }
719
720 __isl_give isl_aff *isl_aff_scale_down(__isl_take isl_aff *aff, isl_int f)
721 {
722 isl_int gcd;
723
724 if (isl_int_is_one(f))
725 return aff;
726
727 aff = isl_aff_cow(aff);
728 if (!aff)
729 return NULL;
730 aff->v = isl_vec_cow(aff->v);
731 if (!aff->v)
732 return isl_aff_free(aff);
733
734 isl_int_init(gcd);
735 isl_seq_gcd(aff->v->el + 1, aff->v->size - 1, &gcd);
736 isl_int_gcd(gcd, gcd, f);
737 isl_seq_scale_down(aff->v->el + 1, aff->v->el + 1, gcd, aff->v->size - 1);
738 isl_int_divexact(gcd, f, gcd);
739 isl_int_mul(aff->v->el[0], aff->v->el[0], gcd);
740 isl_int_clear(gcd);
741
742 return aff;
743 }
744
745 __isl_give isl_aff *isl_aff_scale_down_ui(__isl_take isl_aff *aff, unsigned f)
746 {
747 isl_int v;
748
749 if (f == 1)
750 return aff;
751
752 isl_int_init(v);
753 isl_int_set_ui(v, f);
754 aff = isl_aff_scale_down(aff, v);
755 isl_int_clear(v);
756
757 return aff;
758 }
759
760 __isl_give isl_aff *isl_aff_set_dim_name(__isl_take isl_aff *aff,
761 enum isl_dim_type type, unsigned pos, const char *s)
762 {
763 aff = isl_aff_cow(aff);
764 if (!aff)
765 return NULL;
766 aff->ls = isl_local_space_set_dim_name(aff->ls, type, pos, s);
767 if (!aff->ls)
768 return isl_aff_free(aff);
769
770 return aff;
771 }
772
773 /* Exploit the equalities in "eq" to simplify the affine expression
774 * and the expressions of the integer divisions in the local space.
775 * The integer divisions in this local space are assumed to appear
776 * as regular dimensions in "eq".
777 */
778 static __isl_give isl_aff *isl_aff_substitute_equalities_lifted(
779 __isl_take isl_aff *aff, __isl_take isl_basic_set *eq)
780 {
781 int i, j;
782 unsigned total;
783 unsigned n_div;
784
785 if (!eq)
786 goto error;
787 if (eq->n_eq == 0) {
788 isl_basic_set_free(eq);
789 return aff;
790 }
791
792 aff = isl_aff_cow(aff);
793 if (!aff)
794 goto error;
795
796 aff->ls = isl_local_space_substitute_equalities(aff->ls,
797 isl_basic_set_copy(eq));
798 if (!aff->ls)
799 goto error;
800
801 total = 1 + isl_dim_total(eq->dim);
802 n_div = eq->n_div;
803 for (i = 0; i < eq->n_eq; ++i) {
804 j = isl_seq_last_non_zero(eq->eq[i], total + n_div);
805 if (j < 0 || j == 0 || j >= total)
806 continue;
807
808 isl_seq_elim(aff->v->el + 1, eq->eq[i], j, total,
809 &aff->v->el[0]);
810 }
811
812 isl_basic_set_free(eq);
813 return aff;
814 error:
815 isl_basic_set_free(eq);
816 isl_aff_free(aff);
817 return NULL;
818 }
819
820 /* Exploit the equalities in "eq" to simplify the affine expression
821 * and the expressions of the integer divisions in the local space.
822 */
823 static __isl_give isl_aff *isl_aff_substitute_equalities(
824 __isl_take isl_aff *aff, __isl_take isl_basic_set *eq)
825 {
826 int n_div;
827
828 if (!aff || !eq)
829 goto error;
830 n_div = isl_local_space_dim(aff->ls, isl_dim_div);
831 if (n_div > 0)
832 eq = isl_basic_set_add(eq, isl_dim_set, n_div);
833 return isl_aff_substitute_equalities_lifted(aff, eq);
834 error:
835 isl_basic_set_free(eq);
836 isl_aff_free(aff);
837 return NULL;
838 }
839
840 /* Look for equalities among the variables shared by context and aff
841 * and the integer divisions of aff, if any.
842 * The equalities are then used to eliminate coefficients and/or integer
843 * divisions from aff.
844 */
845 __isl_give isl_aff *isl_aff_gist(__isl_take isl_aff *aff,
846 __isl_take isl_set *context)
847 {
848 isl_basic_set *hull;
849 int n_div;
850
851 if (!aff)
852 goto error;
853 n_div = isl_local_space_dim(aff->ls, isl_dim_div);
854 if (n_div > 0) {
855 isl_basic_set *bset;
856 context = isl_set_add_dims(context, isl_dim_set, n_div);
857 bset = isl_basic_set_from_local_space(
858 isl_aff_get_local_space(aff));
859 bset = isl_basic_set_lift(bset);
860 bset = isl_basic_set_flatten(bset);
861 context = isl_set_intersect(context,
862 isl_set_from_basic_set(bset));
863 }
864
865 hull = isl_set_affine_hull(context);
866 return isl_aff_substitute_equalities_lifted(aff, hull);
867 error:
868 isl_aff_free(aff);
869 isl_set_free(context);
870 return NULL;
871 }
872
873 /* Return a basic set containing those elements in the space
874 * of aff where it is non-negative.
875 */
876 __isl_give isl_basic_set *isl_aff_nonneg_basic_set(__isl_take isl_aff *aff)
877 {
878 isl_constraint *ineq;
879
880 ineq = isl_inequality_from_aff(aff);
881
882 return isl_basic_set_from_constraint(ineq);
883 }
884
885 /* Return a basic set containing those elements in the space
886 * of aff where it is zero.
887 */
888 __isl_give isl_basic_set *isl_aff_zero_basic_set(__isl_take isl_aff *aff)
889 {
890 isl_constraint *ineq;
891
892 ineq = isl_equality_from_aff(aff);
893
894 return isl_basic_set_from_constraint(ineq);
895 }
896
897 /* Return a basic set containing those elements in the shared space
898 * of aff1 and aff2 where aff1 is greater than or equal to aff2.
899 */
900 __isl_give isl_basic_set *isl_aff_ge_basic_set(__isl_take isl_aff *aff1,
901 __isl_take isl_aff *aff2)
902 {
903 aff1 = isl_aff_sub(aff1, aff2);
904
905 return isl_aff_nonneg_basic_set(aff1);
906 }
907
908 /* Return a basic set containing those elements in the shared space
909 * of aff1 and aff2 where aff1 is smaller than or equal to aff2.
910 */
911 __isl_give isl_basic_set *isl_aff_le_basic_set(__isl_take isl_aff *aff1,
912 __isl_take isl_aff *aff2)
913 {
914 return isl_aff_ge_basic_set(aff2, aff1);
915 }
916
917 __isl_give isl_aff *isl_aff_add_on_domain(__isl_keep isl_set *dom,
918 __isl_take isl_aff *aff1, __isl_take isl_aff *aff2)
919 {
920 aff1 = isl_aff_add(aff1, aff2);
921 aff1 = isl_aff_gist(aff1, isl_set_copy(dom));
922 return aff1;
923 }
924
925 int isl_aff_is_empty(__isl_keep isl_aff *aff)
926 {
927 if (!aff)
928 return -1;
929
930 return 0;
931 }
932
933 /* Set active[i] to 1 if the dimension at position i is involved
934 * in the affine expression.
935 */
936 static int set_active(__isl_keep isl_aff *aff, int *active)
937 {
938 int i, j;
939 unsigned total;
940 unsigned offset;
941
942 if (!aff || !active)
943 return -1;
944
945 total = aff->v->size - 2;
946 for (i = 0; i < total; ++i)
947 active[i] = !isl_int_is_zero(aff->v->el[2 + i]);
948
949 offset = isl_local_space_offset(aff->ls, isl_dim_div) - 1;
950 for (i = aff->ls->div->n_row - 1; i >= 0; --i) {
951 if (!active[offset + i])
952 continue;
953 for (j = 0; j < total; ++j)
954 active[j] |=
955 !isl_int_is_zero(aff->ls->div->row[i][2 + j]);
956 }
957
958 return 0;
959 }
960
961 /* Check whether the given affine expression has non-zero coefficient
962 * for any dimension in the given range or if any of these dimensions
963 * appear with non-zero coefficients in any of the integer divisions
964 * involved in the affine expression.
965 */
966 int isl_aff_involves_dims(__isl_keep isl_aff *aff,
967 enum isl_dim_type type, unsigned first, unsigned n)
968 {
969 int i;
970 isl_ctx *ctx;
971 int *active = NULL;
972 int involves = 0;
973
974 if (!aff)
975 return -1;
976 if (n == 0)
977 return 0;
978
979 ctx = isl_aff_get_ctx(aff);
980 if (first + n > isl_aff_dim(aff, type))
981 isl_die(ctx, isl_error_invalid,
982 "range out of bounds", return -1);
983
984 active = isl_calloc_array(ctx, int,
985 isl_local_space_dim(aff->ls, isl_dim_all));
986 if (set_active(aff, active) < 0)
987 goto error;
988
989 first += isl_local_space_offset(aff->ls, type) - 1;
990 for (i = 0; i < n; ++i)
991 if (active[first + i]) {
992 involves = 1;
993 break;
994 }
995
996 free(active);
997
998 return involves;
999 error:
1000 free(active);
1001 return -1;
1002 }
1003
1004 __isl_give isl_aff *isl_aff_drop_dims(__isl_take isl_aff *aff,
1005 enum isl_dim_type type, unsigned first, unsigned n)
1006 {
1007 isl_ctx *ctx;
1008
1009 if (!aff)
1010 return NULL;
1011 if (n == 0 && !isl_local_space_is_named_or_nested(aff->ls, type))
1012 return aff;
1013
1014 ctx = isl_aff_get_ctx(aff);
1015 if (first + n > isl_aff_dim(aff, type))
1016 isl_die(ctx, isl_error_invalid, "range out of bounds",
1017 return isl_aff_free(aff));
1018
1019 aff = isl_aff_cow(aff);
1020 if (!aff)
1021 return NULL;
1022
1023 aff->ls = isl_local_space_drop_dims(aff->ls, type, first, n);
1024 if (!aff->ls)
1025 return isl_aff_free(aff);
1026
1027 first += 1 + isl_local_space_offset(aff->ls, type);
1028 aff->v = isl_vec_drop_els(aff->v, first, n);
1029 if (!aff->v)
1030 return isl_aff_free(aff);
1031
1032 return aff;
1033 }
1034
1035 __isl_give isl_aff *isl_aff_insert_dims(__isl_take isl_aff *aff,
1036 enum isl_dim_type type, unsigned first, unsigned n)
1037 {
1038 isl_ctx *ctx;
1039
1040 if (!aff)
1041 return NULL;
1042 if (n == 0 && !isl_local_space_is_named_or_nested(aff->ls, type))
1043 return aff;
1044
1045 ctx = isl_aff_get_ctx(aff);
1046 if (first > isl_aff_dim(aff, type))
1047 isl_die(ctx, isl_error_invalid, "position out of bounds",
1048 return isl_aff_free(aff));
1049
1050 aff = isl_aff_cow(aff);
1051 if (!aff)
1052 return NULL;
1053
1054 aff->ls = isl_local_space_insert_dims(aff->ls, type, first, n);
1055 if (!aff->ls)
1056 return isl_aff_free(aff);
1057
1058 first += 1 + isl_local_space_offset(aff->ls, type);
1059 aff->v = isl_vec_insert_zero_els(aff->v, first, n);
1060 if (!aff->v)
1061 return isl_aff_free(aff);
1062
1063 return aff;
1064 }
1065
1066 __isl_give isl_aff *isl_aff_add_dims(__isl_take isl_aff *aff,
1067 enum isl_dim_type type, unsigned n)
1068 {
1069 unsigned pos;
1070
1071 pos = isl_aff_dim(aff, type);
1072
1073 return isl_aff_insert_dims(aff, type, pos, n);
1074 }
1075
1076 __isl_give isl_pw_aff *isl_pw_aff_add_dims(__isl_take isl_pw_aff *pwaff,
1077 enum isl_dim_type type, unsigned n)
1078 {
1079 unsigned pos;
1080
1081 pos = isl_pw_aff_dim(pwaff, type);
1082
1083 return isl_pw_aff_insert_dims(pwaff, type, pos, n);
1084 }
1085
1086 __isl_give isl_pw_aff *isl_pw_aff_set_tuple_id(__isl_take isl_pw_aff *pwaff,
1087 __isl_take isl_id *id)
1088 {
1089 isl_dim *dim;
1090
1091 dim = isl_pw_aff_get_dim(pwaff);
1092 dim = isl_dim_set_tuple_id(dim, isl_dim_set, id);
1093
1094 return isl_pw_aff_reset_dim(pwaff, dim);
1095 }
1096
1097 __isl_give isl_pw_aff *isl_pw_aff_from_aff(__isl_take isl_aff *aff)
1098 {
1099 isl_set *dom = isl_set_universe(isl_aff_get_dim(aff));
1100 return isl_pw_aff_alloc(dom, aff);
1101 }
1102
1103 #undef PW
1104 #define PW isl_pw_aff
1105 #undef EL
1106 #define EL isl_aff
1107 #undef EL_IS_ZERO
1108 #define EL_IS_ZERO is_empty
1109 #undef ZERO
1110 #define ZERO empty
1111 #undef IS_ZERO
1112 #define IS_ZERO is_empty
1113 #undef FIELD
1114 #define FIELD aff
1115
1116 #define NO_EVAL
1117 #define NO_OPT
1118 #define NO_MOVE_DIMS
1119 #define NO_LIFT
1120 #define NO_MORPH
1121
1122 #include <isl_pw_templ.c>
1123
1124 static __isl_give isl_set *align_params_pw_pw_set_and(
1125 __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2,
1126 __isl_give isl_set *(*fn)(__isl_take isl_pw_aff *pwaff1,
1127 __isl_take isl_pw_aff *pwaff2))
1128 {
1129 if (!pwaff1 || !pwaff2)
1130 goto error;
1131 if (isl_dim_match(pwaff1->dim, isl_dim_param,
1132 pwaff2->dim, isl_dim_param))
1133 return fn(pwaff1, pwaff2);
1134 if (!isl_dim_has_named_params(pwaff1->dim) ||
1135 !isl_dim_has_named_params(pwaff2->dim))
1136 isl_die(isl_pw_aff_get_ctx(pwaff1), isl_error_invalid,
1137 "unaligned unnamed parameters", goto error);
1138 pwaff1 = isl_pw_aff_align_params(pwaff1, isl_pw_aff_get_dim(pwaff2));
1139 pwaff2 = isl_pw_aff_align_params(pwaff2, isl_pw_aff_get_dim(pwaff1));
1140 return fn(pwaff1, pwaff2);
1141 error:
1142 isl_pw_aff_free(pwaff1);
1143 isl_pw_aff_free(pwaff2);
1144 return NULL;
1145 }
1146
1147 /* Compute a piecewise quasi-affine expression with a domain that
1148 * is the union of those of pwaff1 and pwaff2 and such that on each
1149 * cell, the quasi-affine expression is the better (according to cmp)
1150 * of those of pwaff1 and pwaff2. If only one of pwaff1 or pwaff2
1151 * is defined on a given cell, then the associated expression
1152 * is the defined one.
1153 */
1154 static __isl_give isl_pw_aff *pw_aff_union_opt(__isl_take isl_pw_aff *pwaff1,
1155 __isl_take isl_pw_aff *pwaff2,
1156 __isl_give isl_basic_set *(*cmp)(__isl_take isl_aff *aff1,
1157 __isl_take isl_aff *aff2))
1158 {
1159 int i, j, n;
1160 isl_pw_aff *res;
1161 isl_ctx *ctx;
1162 isl_set *set;
1163
1164 if (!pwaff1 || !pwaff2)
1165 goto error;
1166
1167 ctx = isl_dim_get_ctx(pwaff1->dim);
1168 if (!isl_dim_equal(pwaff1->dim, pwaff2->dim))
1169 isl_die(ctx, isl_error_invalid,
1170 "arguments should live in same space", goto error);
1171
1172 if (isl_pw_aff_is_empty(pwaff1)) {
1173 isl_pw_aff_free(pwaff1);
1174 return pwaff2;
1175 }
1176
1177 if (isl_pw_aff_is_empty(pwaff2)) {
1178 isl_pw_aff_free(pwaff2);
1179 return pwaff1;
1180 }
1181
1182 n = 2 * (pwaff1->n + 1) * (pwaff2->n + 1);
1183 res = isl_pw_aff_alloc_(isl_dim_copy(pwaff1->dim), n);
1184
1185 for (i = 0; i < pwaff1->n; ++i) {
1186 set = isl_set_copy(pwaff1->p[i].set);
1187 for (j = 0; j < pwaff2->n; ++j) {
1188 struct isl_set *common;
1189 isl_set *better;
1190
1191 common = isl_set_intersect(
1192 isl_set_copy(pwaff1->p[i].set),
1193 isl_set_copy(pwaff2->p[j].set));
1194 better = isl_set_from_basic_set(cmp(
1195 isl_aff_copy(pwaff2->p[j].aff),
1196 isl_aff_copy(pwaff1->p[i].aff)));
1197 better = isl_set_intersect(common, better);
1198 if (isl_set_plain_is_empty(better)) {
1199 isl_set_free(better);
1200 continue;
1201 }
1202 set = isl_set_subtract(set, isl_set_copy(better));
1203
1204 res = isl_pw_aff_add_piece(res, better,
1205 isl_aff_copy(pwaff2->p[j].aff));
1206 }
1207 res = isl_pw_aff_add_piece(res, set,
1208 isl_aff_copy(pwaff1->p[i].aff));
1209 }
1210
1211 for (j = 0; j < pwaff2->n; ++j) {
1212 set = isl_set_copy(pwaff2->p[j].set);
1213 for (i = 0; i < pwaff1->n; ++i)
1214 set = isl_set_subtract(set,
1215 isl_set_copy(pwaff1->p[i].set));
1216 res = isl_pw_aff_add_piece(res, set,
1217 isl_aff_copy(pwaff2->p[j].aff));
1218 }
1219
1220 isl_pw_aff_free(pwaff1);
1221 isl_pw_aff_free(pwaff2);
1222
1223 return res;
1224 error:
1225 isl_pw_aff_free(pwaff1);
1226 isl_pw_aff_free(pwaff2);
1227 return NULL;
1228 }
1229
1230 /* Compute a piecewise quasi-affine expression with a domain that
1231 * is the union of those of pwaff1 and pwaff2 and such that on each
1232 * cell, the quasi-affine expression is the maximum of those of pwaff1
1233 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
1234 * cell, then the associated expression is the defined one.
1235 */
1236 static __isl_give isl_pw_aff *pw_aff_union_max(__isl_take isl_pw_aff *pwaff1,
1237 __isl_take isl_pw_aff *pwaff2)
1238 {
1239 return pw_aff_union_opt(pwaff1, pwaff2, &isl_aff_ge_basic_set);
1240 }
1241
1242 __isl_give isl_pw_aff *isl_pw_aff_union_max(__isl_take isl_pw_aff *pwaff1,
1243 __isl_take isl_pw_aff *pwaff2)
1244 {
1245 return align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_union_max);
1246 }
1247
1248 /* Compute a piecewise quasi-affine expression with a domain that
1249 * is the union of those of pwaff1 and pwaff2 and such that on each
1250 * cell, the quasi-affine expression is the minimum of those of pwaff1
1251 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
1252 * cell, then the associated expression is the defined one.
1253 */
1254 static __isl_give isl_pw_aff *pw_aff_union_min(__isl_take isl_pw_aff *pwaff1,
1255 __isl_take isl_pw_aff *pwaff2)
1256 {
1257 return pw_aff_union_opt(pwaff1, pwaff2, &isl_aff_le_basic_set);
1258 }
1259
1260 __isl_give isl_pw_aff *isl_pw_aff_union_min(__isl_take isl_pw_aff *pwaff1,
1261 __isl_take isl_pw_aff *pwaff2)
1262 {
1263 return align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_union_min);
1264 }
1265
1266 __isl_give isl_pw_aff *isl_pw_aff_union_opt(__isl_take isl_pw_aff *pwaff1,
1267 __isl_take isl_pw_aff *pwaff2, int max)
1268 {
1269 if (max)
1270 return isl_pw_aff_union_max(pwaff1, pwaff2);
1271 else
1272 return isl_pw_aff_union_min(pwaff1, pwaff2);
1273 }
1274
1275 /* Construct a map with as domain the domain of pwaff and
1276 * one-dimensional range corresponding to the affine expressions.
1277 */
1278 __isl_give isl_map *isl_map_from_pw_aff(__isl_take isl_pw_aff *pwaff)
1279 {
1280 int i;
1281 isl_dim *dim;
1282 isl_map *map;
1283
1284 if (!pwaff)
1285 return NULL;
1286
1287 dim = isl_pw_aff_get_dim(pwaff);
1288 dim = isl_dim_from_domain(dim);
1289 dim = isl_dim_add(dim, isl_dim_out, 1);
1290 map = isl_map_empty(dim);
1291
1292 for (i = 0; i < pwaff->n; ++i) {
1293 isl_basic_map *bmap;
1294 isl_map *map_i;
1295
1296 bmap = isl_basic_map_from_aff(isl_aff_copy(pwaff->p[i].aff));
1297 map_i = isl_map_from_basic_map(bmap);
1298 map_i = isl_map_intersect_domain(map_i,
1299 isl_set_copy(pwaff->p[i].set));
1300 map = isl_map_union_disjoint(map, map_i);
1301 }
1302
1303 isl_pw_aff_free(pwaff);
1304
1305 return map;
1306 }
1307
1308 /* Return a set containing those elements in the domain
1309 * of pwaff where it is non-negative.
1310 */
1311 __isl_give isl_set *isl_pw_aff_nonneg_set(__isl_take isl_pw_aff *pwaff)
1312 {
1313 int i;
1314 isl_set *set;
1315
1316 if (!pwaff)
1317 return NULL;
1318
1319 set = isl_set_empty(isl_pw_aff_get_dim(pwaff));
1320
1321 for (i = 0; i < pwaff->n; ++i) {
1322 isl_basic_set *bset;
1323 isl_set *set_i;
1324
1325 bset = isl_aff_nonneg_basic_set(isl_aff_copy(pwaff->p[i].aff));
1326 set_i = isl_set_from_basic_set(bset);
1327 set_i = isl_set_intersect(set_i, isl_set_copy(pwaff->p[i].set));
1328 set = isl_set_union_disjoint(set, set_i);
1329 }
1330
1331 isl_pw_aff_free(pwaff);
1332
1333 return set;
1334 }
1335
1336 /* Return a set containing those elements in the domain
1337 * of pwaff where it is zero.
1338 */
1339 __isl_give isl_set *isl_pw_aff_zero_set(__isl_take isl_pw_aff *pwaff)
1340 {
1341 int i;
1342 isl_set *set;
1343
1344 if (!pwaff)
1345 return NULL;
1346
1347 set = isl_set_empty(isl_pw_aff_get_dim(pwaff));
1348
1349 for (i = 0; i < pwaff->n; ++i) {
1350 isl_basic_set *bset;
1351 isl_set *set_i;
1352
1353 bset = isl_aff_zero_basic_set(isl_aff_copy(pwaff->p[i].aff));
1354 set_i = isl_set_from_basic_set(bset);
1355 set_i = isl_set_intersect(set_i, isl_set_copy(pwaff->p[i].set));
1356 set = isl_set_union_disjoint(set, set_i);
1357 }
1358
1359 isl_pw_aff_free(pwaff);
1360
1361 return set;
1362 }
1363
1364 /* Return a set containing those elements in the domain
1365 * of pwaff where it is not zero.
1366 */
1367 __isl_give isl_set *isl_pw_aff_non_zero_set(__isl_take isl_pw_aff *pwaff)
1368 {
1369 return isl_set_complement(isl_pw_aff_zero_set(pwaff));
1370 }
1371
1372 /* Return a set containing those elements in the shared domain
1373 * of pwaff1 and pwaff2 where pwaff1 is greater than (or equal) to pwaff2.
1374 *
1375 * We compute the difference on the shared domain and then construct
1376 * the set of values where this difference is non-negative.
1377 * If strict is set, we first subtract 1 from the difference.
1378 * If equal is set, we only return the elements where pwaff1 and pwaff2
1379 * are equal.
1380 */
1381 static __isl_give isl_set *pw_aff_gte_set(__isl_take isl_pw_aff *pwaff1,
1382 __isl_take isl_pw_aff *pwaff2, int strict, int equal)
1383 {
1384 isl_set *set1, *set2;
1385
1386 set1 = isl_pw_aff_domain(isl_pw_aff_copy(pwaff1));
1387 set2 = isl_pw_aff_domain(isl_pw_aff_copy(pwaff2));
1388 set1 = isl_set_intersect(set1, set2);
1389 pwaff1 = isl_pw_aff_intersect_domain(pwaff1, isl_set_copy(set1));
1390 pwaff2 = isl_pw_aff_intersect_domain(pwaff2, isl_set_copy(set1));
1391 pwaff1 = isl_pw_aff_add(pwaff1, isl_pw_aff_neg(pwaff2));
1392
1393 if (strict) {
1394 isl_dim *dim = isl_set_get_dim(set1);
1395 isl_aff *aff;
1396 aff = isl_aff_zero(isl_local_space_from_dim(dim));
1397 aff = isl_aff_add_constant_si(aff, -1);
1398 pwaff1 = isl_pw_aff_add(pwaff1, isl_pw_aff_alloc(set1, aff));
1399 } else
1400 isl_set_free(set1);
1401
1402 if (equal)
1403 return isl_pw_aff_zero_set(pwaff1);
1404 return isl_pw_aff_nonneg_set(pwaff1);
1405 }
1406
1407 /* Return a set containing those elements in the shared domain
1408 * of pwaff1 and pwaff2 where pwaff1 is equal to pwaff2.
1409 */
1410 static __isl_give isl_set *pw_aff_eq_set(__isl_take isl_pw_aff *pwaff1,
1411 __isl_take isl_pw_aff *pwaff2)
1412 {
1413 return pw_aff_gte_set(pwaff1, pwaff2, 0, 1);
1414 }
1415
1416 __isl_give isl_set *isl_pw_aff_eq_set(__isl_take isl_pw_aff *pwaff1,
1417 __isl_take isl_pw_aff *pwaff2)
1418 {
1419 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_eq_set);
1420 }
1421
1422 /* Return a set containing those elements in the shared domain
1423 * of pwaff1 and pwaff2 where pwaff1 is greater than or equal to pwaff2.
1424 */
1425 static __isl_give isl_set *pw_aff_ge_set(__isl_take isl_pw_aff *pwaff1,
1426 __isl_take isl_pw_aff *pwaff2)
1427 {
1428 return pw_aff_gte_set(pwaff1, pwaff2, 0, 0);
1429 }
1430
1431 __isl_give isl_set *isl_pw_aff_ge_set(__isl_take isl_pw_aff *pwaff1,
1432 __isl_take isl_pw_aff *pwaff2)
1433 {
1434 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_ge_set);
1435 }
1436
1437 /* Return a set containing those elements in the shared domain
1438 * of pwaff1 and pwaff2 where pwaff1 is strictly greater than pwaff2.
1439 */
1440 static __isl_give isl_set *pw_aff_gt_set(__isl_take isl_pw_aff *pwaff1,
1441 __isl_take isl_pw_aff *pwaff2)
1442 {
1443 return pw_aff_gte_set(pwaff1, pwaff2, 1, 0);
1444 }
1445
1446 __isl_give isl_set *isl_pw_aff_gt_set(__isl_take isl_pw_aff *pwaff1,
1447 __isl_take isl_pw_aff *pwaff2)
1448 {
1449 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_gt_set);
1450 }
1451
1452 __isl_give isl_set *isl_pw_aff_le_set(__isl_take isl_pw_aff *pwaff1,
1453 __isl_take isl_pw_aff *pwaff2)
1454 {
1455 return isl_pw_aff_ge_set(pwaff2, pwaff1);
1456 }
1457
1458 __isl_give isl_set *isl_pw_aff_lt_set(__isl_take isl_pw_aff *pwaff1,
1459 __isl_take isl_pw_aff *pwaff2)
1460 {
1461 return isl_pw_aff_gt_set(pwaff2, pwaff1);
1462 }
1463
1464 /* Return a set containing those elements in the shared domain
1465 * of the elements of list1 and list2 where each element in list1
1466 * has the relation specified by "fn" with each element in list2.
1467 */
1468 static __isl_give isl_set *pw_aff_list_set(__isl_take isl_pw_aff_list *list1,
1469 __isl_take isl_pw_aff_list *list2,
1470 __isl_give isl_set *(*fn)(__isl_take isl_pw_aff *pwaff1,
1471 __isl_take isl_pw_aff *pwaff2))
1472 {
1473 int i, j;
1474 isl_ctx *ctx;
1475 isl_set *set;
1476
1477 if (!list1 || !list2)
1478 goto error;
1479
1480 ctx = isl_pw_aff_list_get_ctx(list1);
1481 if (list1->n < 1 || list2->n < 1)
1482 isl_die(ctx, isl_error_invalid,
1483 "list should contain at least one element", goto error);
1484
1485 set = isl_set_universe(isl_pw_aff_get_dim(list1->p[0]));
1486 for (i = 0; i < list1->n; ++i)
1487 for (j = 0; j < list2->n; ++j) {
1488 isl_set *set_ij;
1489
1490 set_ij = fn(isl_pw_aff_copy(list1->p[i]),
1491 isl_pw_aff_copy(list2->p[j]));
1492 set = isl_set_intersect(set, set_ij);
1493 }
1494
1495 isl_pw_aff_list_free(list1);
1496 isl_pw_aff_list_free(list2);
1497 return set;
1498 error:
1499 isl_pw_aff_list_free(list1);
1500 isl_pw_aff_list_free(list2);
1501 return NULL;
1502 }
1503
1504 /* Return a set containing those elements in the shared domain
1505 * of the elements of list1 and list2 where each element in list1
1506 * is equal to each element in list2.
1507 */
1508 __isl_give isl_set *isl_pw_aff_list_eq_set(__isl_take isl_pw_aff_list *list1,
1509 __isl_take isl_pw_aff_list *list2)
1510 {
1511 return pw_aff_list_set(list1, list2, &isl_pw_aff_eq_set);
1512 }
1513
1514 __isl_give isl_set *isl_pw_aff_list_ne_set(__isl_take isl_pw_aff_list *list1,
1515 __isl_take isl_pw_aff_list *list2)
1516 {
1517 return pw_aff_list_set(list1, list2, &isl_pw_aff_ne_set);
1518 }
1519
1520 /* Return a set containing those elements in the shared domain
1521 * of the elements of list1 and list2 where each element in list1
1522 * is less than or equal to each element in list2.
1523 */
1524 __isl_give isl_set *isl_pw_aff_list_le_set(__isl_take isl_pw_aff_list *list1,
1525 __isl_take isl_pw_aff_list *list2)
1526 {
1527 return pw_aff_list_set(list1, list2, &isl_pw_aff_le_set);
1528 }
1529
1530 __isl_give isl_set *isl_pw_aff_list_lt_set(__isl_take isl_pw_aff_list *list1,
1531 __isl_take isl_pw_aff_list *list2)
1532 {
1533 return pw_aff_list_set(list1, list2, &isl_pw_aff_lt_set);
1534 }
1535
1536 __isl_give isl_set *isl_pw_aff_list_ge_set(__isl_take isl_pw_aff_list *list1,
1537 __isl_take isl_pw_aff_list *list2)
1538 {
1539 return pw_aff_list_set(list1, list2, &isl_pw_aff_ge_set);
1540 }
1541
1542 __isl_give isl_set *isl_pw_aff_list_gt_set(__isl_take isl_pw_aff_list *list1,
1543 __isl_take isl_pw_aff_list *list2)
1544 {
1545 return pw_aff_list_set(list1, list2, &isl_pw_aff_gt_set);
1546 }
1547
1548
1549 /* Return a set containing those elements in the shared domain
1550 * of pwaff1 and pwaff2 where pwaff1 is not equal to pwaff2.
1551 */
1552 static __isl_give isl_set *pw_aff_ne_set(__isl_take isl_pw_aff *pwaff1,
1553 __isl_take isl_pw_aff *pwaff2)
1554 {
1555 isl_set *set_lt, *set_gt;
1556
1557 set_lt = isl_pw_aff_lt_set(isl_pw_aff_copy(pwaff1),
1558 isl_pw_aff_copy(pwaff2));
1559 set_gt = isl_pw_aff_gt_set(pwaff1, pwaff2);
1560 return isl_set_union_disjoint(set_lt, set_gt);
1561 }
1562
1563 __isl_give isl_set *isl_pw_aff_ne_set(__isl_take isl_pw_aff *pwaff1,
1564 __isl_take isl_pw_aff *pwaff2)
1565 {
1566 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_ne_set);
1567 }
1568
1569 __isl_give isl_pw_aff *isl_pw_aff_scale_down(__isl_take isl_pw_aff *pwaff,
1570 isl_int v)
1571 {
1572 int i;
1573
1574 if (isl_int_is_one(v))
1575 return pwaff;
1576 if (!isl_int_is_pos(v))
1577 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
1578 "factor needs to be positive",
1579 return isl_pw_aff_free(pwaff));
1580 pwaff = isl_pw_aff_cow(pwaff);
1581 if (!pwaff)
1582 return NULL;
1583 if (pwaff->n == 0)
1584 return pwaff;
1585
1586 for (i = 0; i < pwaff->n; ++i) {
1587 pwaff->p[i].aff = isl_aff_scale_down(pwaff->p[i].aff, v);
1588 if (!pwaff->p[i].aff)
1589 return isl_pw_aff_free(pwaff);
1590 }
1591
1592 return pwaff;
1593 }
1594
1595 __isl_give isl_pw_aff *isl_pw_aff_floor(__isl_take isl_pw_aff *pwaff)
1596 {
1597 int i;
1598
1599 pwaff = isl_pw_aff_cow(pwaff);
1600 if (!pwaff)
1601 return NULL;
1602 if (pwaff->n == 0)
1603 return pwaff;
1604
1605 for (i = 0; i < pwaff->n; ++i) {
1606 pwaff->p[i].aff = isl_aff_floor(pwaff->p[i].aff);
1607 if (!pwaff->p[i].aff)
1608 return isl_pw_aff_free(pwaff);
1609 }
1610
1611 return pwaff;
1612 }
1613
1614 __isl_give isl_pw_aff *isl_pw_aff_ceil(__isl_take isl_pw_aff *pwaff)
1615 {
1616 int i;
1617
1618 pwaff = isl_pw_aff_cow(pwaff);
1619 if (!pwaff)
1620 return NULL;
1621 if (pwaff->n == 0)
1622 return pwaff;
1623
1624 for (i = 0; i < pwaff->n; ++i) {
1625 pwaff->p[i].aff = isl_aff_ceil(pwaff->p[i].aff);
1626 if (!pwaff->p[i].aff)
1627 return isl_pw_aff_free(pwaff);
1628 }
1629
1630 return pwaff;
1631 }
1632
1633 /* Return an affine expression that is equal to pwaff_true for elements
1634 * in "cond" and to pwaff_false for elements not in "cond".
1635 * That is, return cond ? pwaff_true : pwaff_false;
1636 */
1637 __isl_give isl_pw_aff *isl_pw_aff_cond(__isl_take isl_set *cond,
1638 __isl_take isl_pw_aff *pwaff_true, __isl_take isl_pw_aff *pwaff_false)
1639 {
1640 isl_set *comp;
1641
1642 comp = isl_set_complement(isl_set_copy(cond));
1643 pwaff_true = isl_pw_aff_intersect_domain(pwaff_true, cond);
1644 pwaff_false = isl_pw_aff_intersect_domain(pwaff_false, comp);
1645
1646 return isl_pw_aff_add_disjoint(pwaff_true, pwaff_false);
1647 }
1648
1649 int isl_aff_is_cst(__isl_keep isl_aff *aff)
1650 {
1651 if (!aff)
1652 return -1;
1653
1654 return isl_seq_first_non_zero(aff->v->el + 2, aff->v->size - 2) == -1;
1655 }
1656
1657 /* Check whether pwaff is a piecewise constant.
1658 */
1659 int isl_pw_aff_is_cst(__isl_keep isl_pw_aff *pwaff)
1660 {
1661 int i;
1662
1663 if (!pwaff)
1664 return -1;
1665
1666 for (i = 0; i < pwaff->n; ++i) {
1667 int is_cst = isl_aff_is_cst(pwaff->p[i].aff);
1668 if (is_cst < 0 || !is_cst)
1669 return is_cst;
1670 }
1671
1672 return 1;
1673 }
1674
1675 __isl_give isl_aff *isl_aff_mul(__isl_take isl_aff *aff1,
1676 __isl_take isl_aff *aff2)
1677 {
1678 if (!isl_aff_is_cst(aff2) && isl_aff_is_cst(aff1))
1679 return isl_aff_mul(aff2, aff1);
1680
1681 if (!isl_aff_is_cst(aff2))
1682 isl_die(isl_aff_get_ctx(aff1), isl_error_invalid,
1683 "at least one affine expression should be constant",
1684 goto error);
1685
1686 aff1 = isl_aff_cow(aff1);
1687 if (!aff1 || !aff2)
1688 goto error;
1689
1690 aff1 = isl_aff_scale(aff1, aff2->v->el[1]);
1691 aff1 = isl_aff_scale_down(aff1, aff2->v->el[0]);
1692
1693 isl_aff_free(aff2);
1694 return aff1;
1695 error:
1696 isl_aff_free(aff1);
1697 isl_aff_free(aff2);
1698 return NULL;
1699 }
1700
1701 static __isl_give isl_pw_aff *pw_aff_mul(__isl_take isl_pw_aff *pwaff1,
1702 __isl_take isl_pw_aff *pwaff2)
1703 {
1704 int i, j, n;
1705 isl_pw_aff *res;
1706
1707 if (!pwaff1 || !pwaff2)
1708 goto error;
1709
1710 n = pwaff1->n * pwaff2->n;
1711 res = isl_pw_aff_alloc_(isl_dim_copy(pwaff1->dim), n);
1712
1713 for (i = 0; i < pwaff1->n; ++i) {
1714 for (j = 0; j < pwaff2->n; ++j) {
1715 isl_set *common;
1716 isl_aff *prod;
1717 common = isl_set_intersect(
1718 isl_set_copy(pwaff1->p[i].set),
1719 isl_set_copy(pwaff2->p[j].set));
1720 if (isl_set_plain_is_empty(common)) {
1721 isl_set_free(common);
1722 continue;
1723 }
1724
1725 prod = isl_aff_mul(isl_aff_copy(pwaff1->p[i].aff),
1726 isl_aff_copy(pwaff2->p[j].aff));
1727
1728 res = isl_pw_aff_add_piece(res, common, prod);
1729 }
1730 }
1731
1732 isl_pw_aff_free(pwaff1);
1733 isl_pw_aff_free(pwaff2);
1734 return res;
1735 error:
1736 isl_pw_aff_free(pwaff1);
1737 isl_pw_aff_free(pwaff2);
1738 return NULL;
1739 }
1740
1741 __isl_give isl_pw_aff *isl_pw_aff_mul(__isl_take isl_pw_aff *pwaff1,
1742 __isl_take isl_pw_aff *pwaff2)
1743 {
1744 return align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_mul);
1745 }
1746
1747 static __isl_give isl_pw_aff *pw_aff_min(__isl_take isl_pw_aff *pwaff1,
1748 __isl_take isl_pw_aff *pwaff2)
1749 {
1750 isl_set *le;
1751
1752 le = isl_pw_aff_le_set(isl_pw_aff_copy(pwaff1),
1753 isl_pw_aff_copy(pwaff2));
1754 return isl_pw_aff_cond(le, pwaff1, pwaff2);
1755 }
1756
1757 __isl_give isl_pw_aff *isl_pw_aff_min(__isl_take isl_pw_aff *pwaff1,
1758 __isl_take isl_pw_aff *pwaff2)
1759 {
1760 return align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_min);
1761 }
1762
1763 static __isl_give isl_pw_aff *pw_aff_max(__isl_take isl_pw_aff *pwaff1,
1764 __isl_take isl_pw_aff *pwaff2)
1765 {
1766 isl_set *le;
1767
1768 le = isl_pw_aff_ge_set(isl_pw_aff_copy(pwaff1),
1769 isl_pw_aff_copy(pwaff2));
1770 return isl_pw_aff_cond(le, pwaff1, pwaff2);
1771 }
1772
1773 __isl_give isl_pw_aff *isl_pw_aff_max(__isl_take isl_pw_aff *pwaff1,
1774 __isl_take isl_pw_aff *pwaff2)
1775 {
1776 return align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_max);
1777 }
1778
1779 static __isl_give isl_pw_aff *pw_aff_list_reduce(
1780 __isl_take isl_pw_aff_list *list,
1781 __isl_give isl_pw_aff *(*fn)(__isl_take isl_pw_aff *pwaff1,
1782 __isl_take isl_pw_aff *pwaff2))
1783 {
1784 int i;
1785 isl_ctx *ctx;
1786 isl_pw_aff *res;
1787
1788 if (!list)
1789 return NULL;
1790
1791 ctx = isl_pw_aff_list_get_ctx(list);
1792 if (list->n < 1)
1793 isl_die(ctx, isl_error_invalid,
1794 "list should contain at least one element",
1795 return isl_pw_aff_list_free(list));
1796
1797 res = isl_pw_aff_copy(list->p[0]);
1798 for (i = 1; i < list->n; ++i)
1799 res = fn(res, isl_pw_aff_copy(list->p[i]));
1800
1801 isl_pw_aff_list_free(list);
1802 return res;
1803 }
1804
1805 /* Return an isl_pw_aff that maps each element in the intersection of the
1806 * domains of the elements of list to the minimal corresponding affine
1807 * expression.
1808 */
1809 __isl_give isl_pw_aff *isl_pw_aff_list_min(__isl_take isl_pw_aff_list *list)
1810 {
1811 return pw_aff_list_reduce(list, &isl_pw_aff_min);
1812 }
1813
1814 /* Return an isl_pw_aff that maps each element in the intersection of the
1815 * domains of the elements of list to the maximal corresponding affine
1816 * expression.
1817 */
1818 __isl_give isl_pw_aff *isl_pw_aff_list_max(__isl_take isl_pw_aff_list *list)
1819 {
1820 return pw_aff_list_reduce(list, &isl_pw_aff_max);
1821 }
Integer set library