?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
Merge branch 'maint'
[isl.git] / isl_aff.c
blob656ebdf098d39b24736b936fe8170665861034f7
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_space_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 #include <isl_config.h>
23
24 __isl_give isl_aff *isl_aff_alloc_vec(__isl_take isl_local_space *ls,
25 __isl_take isl_vec *v)
26 {
27 isl_aff *aff;
28
29 if (!ls || !v)
30 goto error;
31
32 aff = isl_calloc_type(v->ctx, struct isl_aff);
33 if (!aff)
34 goto error;
35
36 aff->ref = 1;
37 aff->ls = ls;
38 aff->v = v;
39
40 return aff;
41 error:
42 isl_local_space_free(ls);
43 isl_vec_free(v);
44 return NULL;
45 }
46
47 __isl_give isl_aff *isl_aff_alloc(__isl_take isl_local_space *ls)
48 {
49 isl_ctx *ctx;
50 isl_vec *v;
51 unsigned total;
52
53 if (!ls)
54 return NULL;
55
56 ctx = isl_local_space_get_ctx(ls);
57 if (!isl_local_space_divs_known(ls))
58 isl_die(ctx, isl_error_invalid, "local space has unknown divs",
59 goto error);
60 if (!isl_local_space_is_set(ls))
61 isl_die(ctx, isl_error_invalid,
62 "domain of affine expression should be a set",
63 goto error);
64
65 total = isl_local_space_dim(ls, isl_dim_all);
66 v = isl_vec_alloc(ctx, 1 + 1 + total);
67 return isl_aff_alloc_vec(ls, v);
68 error:
69 isl_local_space_free(ls);
70 return NULL;
71 }
72
73 __isl_give isl_aff *isl_aff_zero_on_domain(__isl_take isl_local_space *ls)
74 {
75 isl_aff *aff;
76
77 aff = isl_aff_alloc(ls);
78 if (!aff)
79 return NULL;
80
81 isl_int_set_si(aff->v->el[0], 1);
82 isl_seq_clr(aff->v->el + 1, aff->v->size - 1);
83
84 return aff;
85 }
86
87 __isl_give isl_aff *isl_aff_copy(__isl_keep isl_aff *aff)
88 {
89 if (!aff)
90 return NULL;
91
92 aff->ref++;
93 return aff;
94 }
95
96 __isl_give isl_aff *isl_aff_dup(__isl_keep isl_aff *aff)
97 {
98 if (!aff)
99 return NULL;
100
101 return isl_aff_alloc_vec(isl_local_space_copy(aff->ls),
102 isl_vec_copy(aff->v));
103 }
104
105 __isl_give isl_aff *isl_aff_cow(__isl_take isl_aff *aff)
106 {
107 if (!aff)
108 return NULL;
109
110 if (aff->ref == 1)
111 return aff;
112 aff->ref--;
113 return isl_aff_dup(aff);
114 }
115
116 void *isl_aff_free(__isl_take isl_aff *aff)
117 {
118 if (!aff)
119 return NULL;
120
121 if (--aff->ref > 0)
122 return NULL;
123
124 isl_local_space_free(aff->ls);
125 isl_vec_free(aff->v);
126
127 free(aff);
128
129 return NULL;
130 }
131
132 isl_ctx *isl_aff_get_ctx(__isl_keep isl_aff *aff)
133 {
134 return aff ? isl_local_space_get_ctx(aff->ls) : NULL;
135 }
136
137 /* Externally, an isl_aff has a map space, but internally, the
138 * ls field corresponds to the domain of that space.
139 */
140 int isl_aff_dim(__isl_keep isl_aff *aff, enum isl_dim_type type)
141 {
142 if (!aff)
143 return 0;
144 if (type == isl_dim_out)
145 return 1;
146 if (type == isl_dim_in)
147 type = isl_dim_set;
148 return isl_local_space_dim(aff->ls, type);
149 }
150
151 __isl_give isl_space *isl_aff_get_domain_space(__isl_keep isl_aff *aff)
152 {
153 return aff ? isl_local_space_get_space(aff->ls) : NULL;
154 }
155
156 __isl_give isl_space *isl_aff_get_space(__isl_keep isl_aff *aff)
157 {
158 isl_space *space;
159 if (!aff)
160 return NULL;
161 space = isl_local_space_get_space(aff->ls);
162 space = isl_space_from_domain(space);
163 space = isl_space_add_dims(space, isl_dim_out, 1);
164 return space;
165 }
166
167 __isl_give isl_local_space *isl_aff_get_domain_local_space(
168 __isl_keep isl_aff *aff)
169 {
170 return aff ? isl_local_space_copy(aff->ls) : NULL;
171 }
172
173 __isl_give isl_local_space *isl_aff_get_local_space(__isl_keep isl_aff *aff)
174 {
175 isl_local_space *ls;
176 if (!aff)
177 return NULL;
178 ls = isl_local_space_copy(aff->ls);
179 ls = isl_local_space_from_domain(ls);
180 ls = isl_local_space_add_dims(ls, isl_dim_out, 1);
181 return ls;
182 }
183
184 /* Externally, an isl_aff has a map space, but internally, the
185 * ls field corresponds to the domain of that space.
186 */
187 const char *isl_aff_get_dim_name(__isl_keep isl_aff *aff,
188 enum isl_dim_type type, unsigned pos)
189 {
190 if (!aff)
191 return NULL;
192 if (type == isl_dim_out)
193 return NULL;
194 if (type == isl_dim_in)
195 type = isl_dim_set;
196 return isl_local_space_get_dim_name(aff->ls, type, pos);
197 }
198
199 __isl_give isl_aff *isl_aff_reset_domain_space(__isl_take isl_aff *aff,
200 __isl_take isl_space *dim)
201 {
202 aff = isl_aff_cow(aff);
203 if (!aff || !dim)
204 goto error;
205
206 aff->ls = isl_local_space_reset_space(aff->ls, dim);
207 if (!aff->ls)
208 return isl_aff_free(aff);
209
210 return aff;
211 error:
212 isl_aff_free(aff);
213 isl_space_free(dim);
214 return NULL;
215 }
216
217 /* Reset the space of "aff". This function is called from isl_pw_templ.c
218 * and doesn't know if the space of an element object is represented
219 * directly or through its domain. It therefore passes along both.
220 */
221 __isl_give isl_aff *isl_aff_reset_space_and_domain(__isl_take isl_aff *aff,
222 __isl_take isl_space *space, __isl_take isl_space *domain)
223 {
224 isl_space_free(space);
225 return isl_aff_reset_domain_space(aff, domain);
226 }
227
228 /* Reorder the coefficients of the affine expression based
229 * on the given reodering.
230 * The reordering r is assumed to have been extended with the local
231 * variables.
232 */
233 static __isl_give isl_vec *vec_reorder(__isl_take isl_vec *vec,
234 __isl_take isl_reordering *r, int n_div)
235 {
236 isl_vec *res;
237 int i;
238
239 if (!vec || !r)
240 goto error;
241
242 res = isl_vec_alloc(vec->ctx,
243 2 + isl_space_dim(r->dim, isl_dim_all) + n_div);
244 isl_seq_cpy(res->el, vec->el, 2);
245 isl_seq_clr(res->el + 2, res->size - 2);
246 for (i = 0; i < r->len; ++i)
247 isl_int_set(res->el[2 + r->pos[i]], vec->el[2 + i]);
248
249 isl_reordering_free(r);
250 isl_vec_free(vec);
251 return res;
252 error:
253 isl_vec_free(vec);
254 isl_reordering_free(r);
255 return NULL;
256 }
257
258 /* Reorder the dimensions of the domain of "aff" according
259 * to the given reordering.
260 */
261 __isl_give isl_aff *isl_aff_realign_domain(__isl_take isl_aff *aff,
262 __isl_take isl_reordering *r)
263 {
264 aff = isl_aff_cow(aff);
265 if (!aff)
266 goto error;
267
268 r = isl_reordering_extend(r, aff->ls->div->n_row);
269 aff->v = vec_reorder(aff->v, isl_reordering_copy(r),
270 aff->ls->div->n_row);
271 aff->ls = isl_local_space_realign(aff->ls, r);
272
273 if (!aff->v || !aff->ls)
274 return isl_aff_free(aff);
275
276 return aff;
277 error:
278 isl_aff_free(aff);
279 isl_reordering_free(r);
280 return NULL;
281 }
282
283 int isl_aff_plain_is_zero(__isl_keep isl_aff *aff)
284 {
285 if (!aff)
286 return -1;
287
288 return isl_seq_first_non_zero(aff->v->el + 1, aff->v->size - 1) < 0;
289 }
290
291 int isl_aff_plain_is_equal(__isl_keep isl_aff *aff1, __isl_keep isl_aff *aff2)
292 {
293 int equal;
294
295 if (!aff1 || !aff2)
296 return -1;
297
298 equal = isl_local_space_is_equal(aff1->ls, aff2->ls);
299 if (equal < 0 || !equal)
300 return equal;
301
302 return isl_vec_is_equal(aff1->v, aff2->v);
303 }
304
305 int isl_aff_get_denominator(__isl_keep isl_aff *aff, isl_int *v)
306 {
307 if (!aff)
308 return -1;
309 isl_int_set(*v, aff->v->el[0]);
310 return 0;
311 }
312
313 int isl_aff_get_constant(__isl_keep isl_aff *aff, isl_int *v)
314 {
315 if (!aff)
316 return -1;
317 isl_int_set(*v, aff->v->el[1]);
318 return 0;
319 }
320
321 int isl_aff_get_coefficient(__isl_keep isl_aff *aff,
322 enum isl_dim_type type, int pos, isl_int *v)
323 {
324 if (!aff)
325 return -1;
326
327 if (type == isl_dim_out)
328 isl_die(aff->v->ctx, isl_error_invalid,
329 "output/set dimension does not have a coefficient",
330 return -1);
331 if (type == isl_dim_in)
332 type = isl_dim_set;
333
334 if (pos >= isl_local_space_dim(aff->ls, type))
335 isl_die(aff->v->ctx, isl_error_invalid,
336 "position out of bounds", return -1);
337
338 pos += isl_local_space_offset(aff->ls, type);
339 isl_int_set(*v, aff->v->el[1 + pos]);
340
341 return 0;
342 }
343
344 __isl_give isl_aff *isl_aff_set_denominator(__isl_take isl_aff *aff, isl_int v)
345 {
346 aff = isl_aff_cow(aff);
347 if (!aff)
348 return NULL;
349
350 aff->v = isl_vec_cow(aff->v);
351 if (!aff->v)
352 return isl_aff_free(aff);
353
354 isl_int_set(aff->v->el[0], v);
355
356 return aff;
357 }
358
359 __isl_give isl_aff *isl_aff_set_constant(__isl_take isl_aff *aff, isl_int v)
360 {
361 aff = isl_aff_cow(aff);
362 if (!aff)
363 return NULL;
364
365 aff->v = isl_vec_cow(aff->v);
366 if (!aff->v)
367 return isl_aff_free(aff);
368
369 isl_int_set(aff->v->el[1], v);
370
371 return aff;
372 }
373
374 __isl_give isl_aff *isl_aff_add_constant(__isl_take isl_aff *aff, isl_int v)
375 {
376 if (isl_int_is_zero(v))
377 return aff;
378
379 aff = isl_aff_cow(aff);
380 if (!aff)
381 return NULL;
382
383 aff->v = isl_vec_cow(aff->v);
384 if (!aff->v)
385 return isl_aff_free(aff);
386
387 isl_int_addmul(aff->v->el[1], aff->v->el[0], v);
388
389 return aff;
390 }
391
392 __isl_give isl_aff *isl_aff_add_constant_si(__isl_take isl_aff *aff, int v)
393 {
394 isl_int t;
395
396 isl_int_init(t);
397 isl_int_set_si(t, v);
398 aff = isl_aff_add_constant(aff, t);
399 isl_int_clear(t);
400
401 return aff;
402 }
403
404 __isl_give isl_aff *isl_aff_set_constant_si(__isl_take isl_aff *aff, int v)
405 {
406 aff = isl_aff_cow(aff);
407 if (!aff)
408 return NULL;
409
410 aff->v = isl_vec_cow(aff->v);
411 if (!aff->v)
412 return isl_aff_free(aff);
413
414 isl_int_set_si(aff->v->el[1], v);
415
416 return aff;
417 }
418
419 __isl_give isl_aff *isl_aff_set_coefficient(__isl_take isl_aff *aff,
420 enum isl_dim_type type, int pos, isl_int v)
421 {
422 if (!aff)
423 return NULL;
424
425 if (type == isl_dim_out)
426 isl_die(aff->v->ctx, isl_error_invalid,
427 "output/set dimension does not have a coefficient",
428 return isl_aff_free(aff));
429 if (type == isl_dim_in)
430 type = isl_dim_set;
431
432 if (pos >= isl_local_space_dim(aff->ls, type))
433 isl_die(aff->v->ctx, isl_error_invalid,
434 "position out of bounds", return isl_aff_free(aff));
435
436 aff = isl_aff_cow(aff);
437 if (!aff)
438 return NULL;
439
440 aff->v = isl_vec_cow(aff->v);
441 if (!aff->v)
442 return isl_aff_free(aff);
443
444 pos += isl_local_space_offset(aff->ls, type);
445 isl_int_set(aff->v->el[1 + pos], v);
446
447 return aff;
448 }
449
450 __isl_give isl_aff *isl_aff_set_coefficient_si(__isl_take isl_aff *aff,
451 enum isl_dim_type type, int pos, int v)
452 {
453 if (!aff)
454 return NULL;
455
456 if (type == isl_dim_out)
457 isl_die(aff->v->ctx, isl_error_invalid,
458 "output/set dimension does not have a coefficient",
459 return isl_aff_free(aff));
460 if (type == isl_dim_in)
461 type = isl_dim_set;
462
463 if (pos >= isl_local_space_dim(aff->ls, type))
464 isl_die(aff->v->ctx, isl_error_invalid,
465 "position out of bounds", return isl_aff_free(aff));
466
467 aff = isl_aff_cow(aff);
468 if (!aff)
469 return NULL;
470
471 aff->v = isl_vec_cow(aff->v);
472 if (!aff->v)
473 return isl_aff_free(aff);
474
475 pos += isl_local_space_offset(aff->ls, type);
476 isl_int_set_si(aff->v->el[1 + pos], v);
477
478 return aff;
479 }
480
481 __isl_give isl_aff *isl_aff_add_coefficient(__isl_take isl_aff *aff,
482 enum isl_dim_type type, int pos, isl_int v)
483 {
484 if (!aff)
485 return NULL;
486
487 if (type == isl_dim_out)
488 isl_die(aff->v->ctx, isl_error_invalid,
489 "output/set dimension does not have a coefficient",
490 return isl_aff_free(aff));
491 if (type == isl_dim_in)
492 type = isl_dim_set;
493
494 if (pos >= isl_local_space_dim(aff->ls, type))
495 isl_die(aff->v->ctx, isl_error_invalid,
496 "position out of bounds", return isl_aff_free(aff));
497
498 aff = isl_aff_cow(aff);
499 if (!aff)
500 return NULL;
501
502 aff->v = isl_vec_cow(aff->v);
503 if (!aff->v)
504 return isl_aff_free(aff);
505
506 pos += isl_local_space_offset(aff->ls, type);
507 isl_int_addmul(aff->v->el[1 + pos], aff->v->el[0], v);
508
509 return aff;
510 }
511
512 __isl_give isl_aff *isl_aff_add_coefficient_si(__isl_take isl_aff *aff,
513 enum isl_dim_type type, int pos, int v)
514 {
515 isl_int t;
516
517 isl_int_init(t);
518 isl_int_set_si(t, v);
519 aff = isl_aff_add_coefficient(aff, type, pos, t);
520 isl_int_clear(t);
521
522 return aff;
523 }
524
525 __isl_give isl_aff *isl_aff_get_div(__isl_keep isl_aff *aff, int pos)
526 {
527 if (!aff)
528 return NULL;
529
530 return isl_local_space_get_div(aff->ls, pos);
531 }
532
533 __isl_give isl_aff *isl_aff_neg(__isl_take isl_aff *aff)
534 {
535 aff = isl_aff_cow(aff);
536 if (!aff)
537 return NULL;
538 aff->v = isl_vec_cow(aff->v);
539 if (!aff->v)
540 return isl_aff_free(aff);
541
542 isl_seq_neg(aff->v->el + 1, aff->v->el + 1, aff->v->size - 1);
543
544 return aff;
545 }
546
547 __isl_give isl_aff *isl_aff_normalize(__isl_take isl_aff *aff)
548 {
549 if (!aff)
550 return NULL;
551 aff->v = isl_vec_normalize(aff->v);
552 if (!aff->v)
553 return isl_aff_free(aff);
554 return aff;
555 }
556
557 /* Given f, return floor(f).
558 * If f is an integer expression, then just return f.
559 * Otherwise, if f = g/m, write g = q m + r,
560 * create a new div d = [r/m] and return the expression q + d.
561 * The coefficients in r are taken to lie between -m/2 and m/2.
562 */
563 __isl_give isl_aff *isl_aff_floor(__isl_take isl_aff *aff)
564 {
565 int i;
566 int size;
567 isl_ctx *ctx;
568 isl_vec *div;
569
570 if (!aff)
571 return NULL;
572
573 if (isl_int_is_one(aff->v->el[0]))
574 return aff;
575
576 aff = isl_aff_cow(aff);
577 if (!aff)
578 return NULL;
579
580 aff->v = isl_vec_cow(aff->v);
581 div = isl_vec_copy(aff->v);
582 div = isl_vec_cow(div);
583 if (!div)
584 return isl_aff_free(aff);
585
586 ctx = isl_aff_get_ctx(aff);
587 isl_int_fdiv_q(aff->v->el[0], aff->v->el[0], ctx->two);
588 for (i = 1; i < aff->v->size; ++i) {
589 isl_int_fdiv_r(div->el[i], div->el[i], div->el[0]);
590 isl_int_fdiv_q(aff->v->el[i], aff->v->el[i], div->el[0]);
591 if (isl_int_gt(div->el[i], aff->v->el[0])) {
592 isl_int_sub(div->el[i], div->el[i], div->el[0]);
593 isl_int_add_ui(aff->v->el[i], aff->v->el[i], 1);
594 }
595 }
596
597 aff->ls = isl_local_space_add_div(aff->ls, div);
598 if (!aff->ls)
599 return isl_aff_free(aff);
600
601 size = aff->v->size;
602 aff->v = isl_vec_extend(aff->v, size + 1);
603 if (!aff->v)
604 return isl_aff_free(aff);
605 isl_int_set_si(aff->v->el[0], 1);
606 isl_int_set_si(aff->v->el[size], 1);
607
608 return aff;
609 }
610
611 /* Compute
612 *
613 * aff mod m = aff - m * floor(aff/m)
614 */
615 __isl_give isl_aff *isl_aff_mod(__isl_take isl_aff *aff, isl_int m)
616 {
617 isl_aff *res;
618
619 res = isl_aff_copy(aff);
620 aff = isl_aff_scale_down(aff, m);
621 aff = isl_aff_floor(aff);
622 aff = isl_aff_scale(aff, m);
623 res = isl_aff_sub(res, aff);
624
625 return res;
626 }
627
628 /* Compute
629 *
630 * pwaff mod m = pwaff - m * floor(pwaff/m)
631 */
632 __isl_give isl_pw_aff *isl_pw_aff_mod(__isl_take isl_pw_aff *pwaff, isl_int m)
633 {
634 isl_pw_aff *res;
635
636 res = isl_pw_aff_copy(pwaff);
637 pwaff = isl_pw_aff_scale_down(pwaff, m);
638 pwaff = isl_pw_aff_floor(pwaff);
639 pwaff = isl_pw_aff_scale(pwaff, m);
640 res = isl_pw_aff_sub(res, pwaff);
641
642 return res;
643 }
644
645 /* Given f, return ceil(f).
646 * If f is an integer expression, then just return f.
647 * Otherwise, create a new div d = [-f] and return the expression -d.
648 */
649 __isl_give isl_aff *isl_aff_ceil(__isl_take isl_aff *aff)
650 {
651 if (!aff)
652 return NULL;
653
654 if (isl_int_is_one(aff->v->el[0]))
655 return aff;
656
657 aff = isl_aff_neg(aff);
658 aff = isl_aff_floor(aff);
659 aff = isl_aff_neg(aff);
660
661 return aff;
662 }
663
664 /* Apply the expansion computed by isl_merge_divs.
665 * The expansion itself is given by "exp" while the resulting
666 * list of divs is given by "div".
667 */
668 __isl_give isl_aff *isl_aff_expand_divs( __isl_take isl_aff *aff,
669 __isl_take isl_mat *div, int *exp)
670 {
671 int i, j;
672 int old_n_div;
673 int new_n_div;
674 int offset;
675
676 aff = isl_aff_cow(aff);
677 if (!aff || !div)
678 goto error;
679
680 old_n_div = isl_local_space_dim(aff->ls, isl_dim_div);
681 new_n_div = isl_mat_rows(div);
682 if (new_n_div < old_n_div)
683 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
684 "not an expansion", goto error);
685
686 aff->v = isl_vec_extend(aff->v, aff->v->size + new_n_div - old_n_div);
687 if (!aff->v)
688 goto error;
689
690 offset = 1 + isl_local_space_offset(aff->ls, isl_dim_div);
691 j = old_n_div - 1;
692 for (i = new_n_div - 1; i >= 0; --i) {
693 if (j >= 0 && exp[j] == i) {
694 if (i != j)
695 isl_int_swap(aff->v->el[offset + i],
696 aff->v->el[offset + j]);
697 j--;
698 } else
699 isl_int_set_si(aff->v->el[offset + i], 0);
700 }
701
702 aff->ls = isl_local_space_replace_divs(aff->ls, isl_mat_copy(div));
703 if (!aff->ls)
704 goto error;
705 isl_mat_free(div);
706 return aff;
707 error:
708 isl_aff_free(aff);
709 isl_mat_free(div);
710 return NULL;
711 }
712
713 /* Add two affine expressions that live in the same local space.
714 */
715 static __isl_give isl_aff *add_expanded(__isl_take isl_aff *aff1,
716 __isl_take isl_aff *aff2)
717 {
718 isl_int gcd, f;
719
720 aff1 = isl_aff_cow(aff1);
721 if (!aff1 || !aff2)
722 goto error;
723
724 aff1->v = isl_vec_cow(aff1->v);
725 if (!aff1->v)
726 goto error;
727
728 isl_int_init(gcd);
729 isl_int_init(f);
730 isl_int_gcd(gcd, aff1->v->el[0], aff2->v->el[0]);
731 isl_int_divexact(f, aff2->v->el[0], gcd);
732 isl_seq_scale(aff1->v->el + 1, aff1->v->el + 1, f, aff1->v->size - 1);
733 isl_int_divexact(f, aff1->v->el[0], gcd);
734 isl_seq_addmul(aff1->v->el + 1, f, aff2->v->el + 1, aff1->v->size - 1);
735 isl_int_divexact(f, aff2->v->el[0], gcd);
736 isl_int_mul(aff1->v->el[0], aff1->v->el[0], f);
737 isl_int_clear(f);
738 isl_int_clear(gcd);
739
740 isl_aff_free(aff2);
741 return aff1;
742 error:
743 isl_aff_free(aff1);
744 isl_aff_free(aff2);
745 return NULL;
746 }
747
748 __isl_give isl_aff *isl_aff_add(__isl_take isl_aff *aff1,
749 __isl_take isl_aff *aff2)
750 {
751 isl_ctx *ctx;
752 int *exp1 = NULL;
753 int *exp2 = NULL;
754 isl_mat *div;
755
756 if (!aff1 || !aff2)
757 goto error;
758
759 ctx = isl_aff_get_ctx(aff1);
760 if (!isl_space_is_equal(aff1->ls->dim, aff2->ls->dim))
761 isl_die(ctx, isl_error_invalid,
762 "spaces don't match", goto error);
763
764 if (aff1->ls->div->n_row == 0 && aff2->ls->div->n_row == 0)
765 return add_expanded(aff1, aff2);
766
767 exp1 = isl_alloc_array(ctx, int, aff1->ls->div->n_row);
768 exp2 = isl_alloc_array(ctx, int, aff2->ls->div->n_row);
769 if (!exp1 || !exp2)
770 goto error;
771
772 div = isl_merge_divs(aff1->ls->div, aff2->ls->div, exp1, exp2);
773 aff1 = isl_aff_expand_divs(aff1, isl_mat_copy(div), exp1);
774 aff2 = isl_aff_expand_divs(aff2, div, exp2);
775 free(exp1);
776 free(exp2);
777
778 return add_expanded(aff1, aff2);
779 error:
780 free(exp1);
781 free(exp2);
782 isl_aff_free(aff1);
783 isl_aff_free(aff2);
784 return NULL;
785 }
786
787 __isl_give isl_aff *isl_aff_sub(__isl_take isl_aff *aff1,
788 __isl_take isl_aff *aff2)
789 {
790 return isl_aff_add(aff1, isl_aff_neg(aff2));
791 }
792
793 __isl_give isl_aff *isl_aff_scale(__isl_take isl_aff *aff, isl_int f)
794 {
795 isl_int gcd;
796
797 if (isl_int_is_one(f))
798 return aff;
799
800 aff = isl_aff_cow(aff);
801 if (!aff)
802 return NULL;
803 aff->v = isl_vec_cow(aff->v);
804 if (!aff->v)
805 return isl_aff_free(aff);
806
807 isl_int_init(gcd);
808 isl_int_gcd(gcd, aff->v->el[0], f);
809 isl_int_divexact(aff->v->el[0], aff->v->el[0], gcd);
810 isl_int_divexact(gcd, f, gcd);
811 isl_seq_scale(aff->v->el + 1, aff->v->el + 1, gcd, aff->v->size - 1);
812 isl_int_clear(gcd);
813
814 return aff;
815 }
816
817 __isl_give isl_aff *isl_aff_scale_down(__isl_take isl_aff *aff, isl_int f)
818 {
819 isl_int gcd;
820
821 if (isl_int_is_one(f))
822 return aff;
823
824 aff = isl_aff_cow(aff);
825 if (!aff)
826 return NULL;
827 aff->v = isl_vec_cow(aff->v);
828 if (!aff->v)
829 return isl_aff_free(aff);
830
831 isl_int_init(gcd);
832 isl_seq_gcd(aff->v->el + 1, aff->v->size - 1, &gcd);
833 isl_int_gcd(gcd, gcd, f);
834 isl_seq_scale_down(aff->v->el + 1, aff->v->el + 1, gcd, aff->v->size - 1);
835 isl_int_divexact(gcd, f, gcd);
836 isl_int_mul(aff->v->el[0], aff->v->el[0], gcd);
837 isl_int_clear(gcd);
838
839 return aff;
840 }
841
842 __isl_give isl_aff *isl_aff_scale_down_ui(__isl_take isl_aff *aff, unsigned f)
843 {
844 isl_int v;
845
846 if (f == 1)
847 return aff;
848
849 isl_int_init(v);
850 isl_int_set_ui(v, f);
851 aff = isl_aff_scale_down(aff, v);
852 isl_int_clear(v);
853
854 return aff;
855 }
856
857 __isl_give isl_aff *isl_aff_set_dim_name(__isl_take isl_aff *aff,
858 enum isl_dim_type type, unsigned pos, const char *s)
859 {
860 aff = isl_aff_cow(aff);
861 if (!aff)
862 return NULL;
863 if (type == isl_dim_out)
864 isl_die(aff->v->ctx, isl_error_invalid,
865 "cannot set name of output/set dimension",
866 return isl_aff_free(aff));
867 if (type == isl_dim_in)
868 type = isl_dim_set;
869 aff->ls = isl_local_space_set_dim_name(aff->ls, type, pos, s);
870 if (!aff->ls)
871 return isl_aff_free(aff);
872
873 return aff;
874 }
875
876 __isl_give isl_aff *isl_aff_set_dim_id(__isl_take isl_aff *aff,
877 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
878 {
879 aff = isl_aff_cow(aff);
880 if (!aff)
881 return isl_id_free(id);
882 if (type == isl_dim_out)
883 isl_die(aff->v->ctx, isl_error_invalid,
884 "cannot set name of output/set dimension",
885 goto error);
886 if (type == isl_dim_in)
887 type = isl_dim_set;
888 aff->ls = isl_local_space_set_dim_id(aff->ls, type, pos, id);
889 if (!aff->ls)
890 return isl_aff_free(aff);
891
892 return aff;
893 error:
894 isl_id_free(id);
895 isl_aff_free(aff);
896 return NULL;
897 }
898
899 /* Exploit the equalities in "eq" to simplify the affine expression
900 * and the expressions of the integer divisions in the local space.
901 * The integer divisions in this local space are assumed to appear
902 * as regular dimensions in "eq".
903 */
904 static __isl_give isl_aff *isl_aff_substitute_equalities_lifted(
905 __isl_take isl_aff *aff, __isl_take isl_basic_set *eq)
906 {
907 int i, j;
908 unsigned total;
909 unsigned n_div;
910
911 if (!eq)
912 goto error;
913 if (eq->n_eq == 0) {
914 isl_basic_set_free(eq);
915 return aff;
916 }
917
918 aff = isl_aff_cow(aff);
919 if (!aff)
920 goto error;
921
922 aff->ls = isl_local_space_substitute_equalities(aff->ls,
923 isl_basic_set_copy(eq));
924 if (!aff->ls)
925 goto error;
926
927 total = 1 + isl_space_dim(eq->dim, isl_dim_all);
928 n_div = eq->n_div;
929 for (i = 0; i < eq->n_eq; ++i) {
930 j = isl_seq_last_non_zero(eq->eq[i], total + n_div);
931 if (j < 0 || j == 0 || j >= total)
932 continue;
933
934 isl_seq_elim(aff->v->el + 1, eq->eq[i], j, total,
935 &aff->v->el[0]);
936 }
937
938 isl_basic_set_free(eq);
939 return aff;
940 error:
941 isl_basic_set_free(eq);
942 isl_aff_free(aff);
943 return NULL;
944 }
945
946 /* Exploit the equalities in "eq" to simplify the affine expression
947 * and the expressions of the integer divisions in the local space.
948 */
949 static __isl_give isl_aff *isl_aff_substitute_equalities(
950 __isl_take isl_aff *aff, __isl_take isl_basic_set *eq)
951 {
952 int n_div;
953
954 if (!aff || !eq)
955 goto error;
956 n_div = isl_local_space_dim(aff->ls, isl_dim_div);
957 if (n_div > 0)
958 eq = isl_basic_set_add(eq, isl_dim_set, n_div);
959 return isl_aff_substitute_equalities_lifted(aff, eq);
960 error:
961 isl_basic_set_free(eq);
962 isl_aff_free(aff);
963 return NULL;
964 }
965
966 /* Look for equalities among the variables shared by context and aff
967 * and the integer divisions of aff, if any.
968 * The equalities are then used to eliminate coefficients and/or integer
969 * divisions from aff.
970 */
971 __isl_give isl_aff *isl_aff_gist(__isl_take isl_aff *aff,
972 __isl_take isl_set *context)
973 {
974 isl_basic_set *hull;
975 int n_div;
976
977 if (!aff)
978 goto error;
979 n_div = isl_local_space_dim(aff->ls, isl_dim_div);
980 if (n_div > 0) {
981 isl_basic_set *bset;
982 isl_local_space *ls;
983 context = isl_set_add_dims(context, isl_dim_set, n_div);
984 ls = isl_aff_get_domain_local_space(aff);
985 bset = isl_basic_set_from_local_space(ls);
986 bset = isl_basic_set_lift(bset);
987 bset = isl_basic_set_flatten(bset);
988 context = isl_set_intersect(context,
989 isl_set_from_basic_set(bset));
990 }
991
992 hull = isl_set_affine_hull(context);
993 return isl_aff_substitute_equalities_lifted(aff, hull);
994 error:
995 isl_aff_free(aff);
996 isl_set_free(context);
997 return NULL;
998 }
999
1000 __isl_give isl_aff *isl_aff_gist_params(__isl_take isl_aff *aff,
1001 __isl_take isl_set *context)
1002 {
1003 isl_set *dom_context = isl_set_universe(isl_aff_get_domain_space(aff));
1004 dom_context = isl_set_intersect_params(dom_context, context);
1005 return isl_aff_gist(aff, dom_context);
1006 }
1007
1008 /* Return a basic set containing those elements in the space
1009 * of aff where it is non-negative.
1010 */
1011 __isl_give isl_basic_set *isl_aff_nonneg_basic_set(__isl_take isl_aff *aff)
1012 {
1013 isl_constraint *ineq;
1014
1015 ineq = isl_inequality_from_aff(aff);
1016
1017 return isl_basic_set_from_constraint(ineq);
1018 }
1019
1020 /* Return a basic set containing those elements in the space
1021 * of aff where it is zero.
1022 */
1023 __isl_give isl_basic_set *isl_aff_zero_basic_set(__isl_take isl_aff *aff)
1024 {
1025 isl_constraint *ineq;
1026
1027 ineq = isl_equality_from_aff(aff);
1028
1029 return isl_basic_set_from_constraint(ineq);
1030 }
1031
1032 /* Return a basic set containing those elements in the shared space
1033 * of aff1 and aff2 where aff1 is greater than or equal to aff2.
1034 */
1035 __isl_give isl_basic_set *isl_aff_ge_basic_set(__isl_take isl_aff *aff1,
1036 __isl_take isl_aff *aff2)
1037 {
1038 aff1 = isl_aff_sub(aff1, aff2);
1039
1040 return isl_aff_nonneg_basic_set(aff1);
1041 }
1042
1043 /* Return a basic set containing those elements in the shared space
1044 * of aff1 and aff2 where aff1 is smaller than or equal to aff2.
1045 */
1046 __isl_give isl_basic_set *isl_aff_le_basic_set(__isl_take isl_aff *aff1,
1047 __isl_take isl_aff *aff2)
1048 {
1049 return isl_aff_ge_basic_set(aff2, aff1);
1050 }
1051
1052 __isl_give isl_aff *isl_aff_add_on_domain(__isl_keep isl_set *dom,
1053 __isl_take isl_aff *aff1, __isl_take isl_aff *aff2)
1054 {
1055 aff1 = isl_aff_add(aff1, aff2);
1056 aff1 = isl_aff_gist(aff1, isl_set_copy(dom));
1057 return aff1;
1058 }
1059
1060 int isl_aff_is_empty(__isl_keep isl_aff *aff)
1061 {
1062 if (!aff)
1063 return -1;
1064
1065 return 0;
1066 }
1067
1068 /* Check whether the given affine expression has non-zero coefficient
1069 * for any dimension in the given range or if any of these dimensions
1070 * appear with non-zero coefficients in any of the integer divisions
1071 * involved in the affine expression.
1072 */
1073 int isl_aff_involves_dims(__isl_keep isl_aff *aff,
1074 enum isl_dim_type type, unsigned first, unsigned n)
1075 {
1076 int i;
1077 isl_ctx *ctx;
1078 int *active = NULL;
1079 int involves = 0;
1080
1081 if (!aff)
1082 return -1;
1083 if (n == 0)
1084 return 0;
1085
1086 ctx = isl_aff_get_ctx(aff);
1087 if (first + n > isl_aff_dim(aff, type))
1088 isl_die(ctx, isl_error_invalid,
1089 "range out of bounds", return -1);
1090
1091 active = isl_local_space_get_active(aff->ls, aff->v->el + 2);
1092 if (!active)
1093 goto error;
1094
1095 first += isl_local_space_offset(aff->ls, type) - 1;
1096 for (i = 0; i < n; ++i)
1097 if (active[first + i]) {
1098 involves = 1;
1099 break;
1100 }
1101
1102 free(active);
1103
1104 return involves;
1105 error:
1106 free(active);
1107 return -1;
1108 }
1109
1110 __isl_give isl_aff *isl_aff_drop_dims(__isl_take isl_aff *aff,
1111 enum isl_dim_type type, unsigned first, unsigned n)
1112 {
1113 isl_ctx *ctx;
1114
1115 if (!aff)
1116 return NULL;
1117 if (type == isl_dim_out)
1118 isl_die(aff->v->ctx, isl_error_invalid,
1119 "cannot drop output/set dimension",
1120 return isl_aff_free(aff));
1121 if (type == isl_dim_in)
1122 type = isl_dim_set;
1123 if (n == 0 && !isl_local_space_is_named_or_nested(aff->ls, type))
1124 return aff;
1125
1126 ctx = isl_aff_get_ctx(aff);
1127 if (first + n > isl_local_space_dim(aff->ls, type))
1128 isl_die(ctx, isl_error_invalid, "range out of bounds",
1129 return isl_aff_free(aff));
1130
1131 aff = isl_aff_cow(aff);
1132 if (!aff)
1133 return NULL;
1134
1135 aff->ls = isl_local_space_drop_dims(aff->ls, type, first, n);
1136 if (!aff->ls)
1137 return isl_aff_free(aff);
1138
1139 first += 1 + isl_local_space_offset(aff->ls, type);
1140 aff->v = isl_vec_drop_els(aff->v, first, n);
1141 if (!aff->v)
1142 return isl_aff_free(aff);
1143
1144 return aff;
1145 }
1146
1147 __isl_give isl_aff *isl_aff_insert_dims(__isl_take isl_aff *aff,
1148 enum isl_dim_type type, unsigned first, unsigned n)
1149 {
1150 isl_ctx *ctx;
1151
1152 if (!aff)
1153 return NULL;
1154 if (type == isl_dim_out)
1155 isl_die(aff->v->ctx, isl_error_invalid,
1156 "cannot insert output/set dimensions",
1157 return isl_aff_free(aff));
1158 if (type == isl_dim_in)
1159 type = isl_dim_set;
1160 if (n == 0 && !isl_local_space_is_named_or_nested(aff->ls, type))
1161 return aff;
1162
1163 ctx = isl_aff_get_ctx(aff);
1164 if (first > isl_local_space_dim(aff->ls, type))
1165 isl_die(ctx, isl_error_invalid, "position out of bounds",
1166 return isl_aff_free(aff));
1167
1168 aff = isl_aff_cow(aff);
1169 if (!aff)
1170 return NULL;
1171
1172 aff->ls = isl_local_space_insert_dims(aff->ls, type, first, n);
1173 if (!aff->ls)
1174 return isl_aff_free(aff);
1175
1176 first += 1 + isl_local_space_offset(aff->ls, type);
1177 aff->v = isl_vec_insert_zero_els(aff->v, first, n);
1178 if (!aff->v)
1179 return isl_aff_free(aff);
1180
1181 return aff;
1182 }
1183
1184 __isl_give isl_aff *isl_aff_add_dims(__isl_take isl_aff *aff,
1185 enum isl_dim_type type, unsigned n)
1186 {
1187 unsigned pos;
1188
1189 pos = isl_aff_dim(aff, type);
1190
1191 return isl_aff_insert_dims(aff, type, pos, n);
1192 }
1193
1194 __isl_give isl_pw_aff *isl_pw_aff_add_dims(__isl_take isl_pw_aff *pwaff,
1195 enum isl_dim_type type, unsigned n)
1196 {
1197 unsigned pos;
1198
1199 pos = isl_pw_aff_dim(pwaff, type);
1200
1201 return isl_pw_aff_insert_dims(pwaff, type, pos, n);
1202 }
1203
1204 __isl_give isl_pw_aff *isl_pw_aff_from_aff(__isl_take isl_aff *aff)
1205 {
1206 isl_set *dom = isl_set_universe(isl_aff_get_domain_space(aff));
1207 return isl_pw_aff_alloc(dom, aff);
1208 }
1209
1210 #undef PW
1211 #define PW isl_pw_aff
1212 #undef EL
1213 #define EL isl_aff
1214 #undef EL_IS_ZERO
1215 #define EL_IS_ZERO is_empty
1216 #undef ZERO
1217 #define ZERO empty
1218 #undef IS_ZERO
1219 #define IS_ZERO is_empty
1220 #undef FIELD
1221 #define FIELD aff
1222
1223 #define NO_EVAL
1224 #define NO_OPT
1225 #define NO_MOVE_DIMS
1226 #define NO_LIFT
1227 #define NO_MORPH
1228
1229 #include <isl_pw_templ.c>
1230
1231 static __isl_give isl_set *align_params_pw_pw_set_and(
1232 __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2,
1233 __isl_give isl_set *(*fn)(__isl_take isl_pw_aff *pwaff1,
1234 __isl_take isl_pw_aff *pwaff2))
1235 {
1236 if (!pwaff1 || !pwaff2)
1237 goto error;
1238 if (isl_space_match(pwaff1->dim, isl_dim_param,
1239 pwaff2->dim, isl_dim_param))
1240 return fn(pwaff1, pwaff2);
1241 if (!isl_space_has_named_params(pwaff1->dim) ||
1242 !isl_space_has_named_params(pwaff2->dim))
1243 isl_die(isl_pw_aff_get_ctx(pwaff1), isl_error_invalid,
1244 "unaligned unnamed parameters", goto error);
1245 pwaff1 = isl_pw_aff_align_params(pwaff1, isl_pw_aff_get_space(pwaff2));
1246 pwaff2 = isl_pw_aff_align_params(pwaff2, isl_pw_aff_get_space(pwaff1));
1247 return fn(pwaff1, pwaff2);
1248 error:
1249 isl_pw_aff_free(pwaff1);
1250 isl_pw_aff_free(pwaff2);
1251 return NULL;
1252 }
1253
1254 /* Compute a piecewise quasi-affine expression with a domain that
1255 * is the union of those of pwaff1 and pwaff2 and such that on each
1256 * cell, the quasi-affine expression is the better (according to cmp)
1257 * of those of pwaff1 and pwaff2. If only one of pwaff1 or pwaff2
1258 * is defined on a given cell, then the associated expression
1259 * is the defined one.
1260 */
1261 static __isl_give isl_pw_aff *pw_aff_union_opt(__isl_take isl_pw_aff *pwaff1,
1262 __isl_take isl_pw_aff *pwaff2,
1263 __isl_give isl_basic_set *(*cmp)(__isl_take isl_aff *aff1,
1264 __isl_take isl_aff *aff2))
1265 {
1266 int i, j, n;
1267 isl_pw_aff *res;
1268 isl_ctx *ctx;
1269 isl_set *set;
1270
1271 if (!pwaff1 || !pwaff2)
1272 goto error;
1273
1274 ctx = isl_space_get_ctx(pwaff1->dim);
1275 if (!isl_space_is_equal(pwaff1->dim, pwaff2->dim))
1276 isl_die(ctx, isl_error_invalid,
1277 "arguments should live in same space", goto error);
1278
1279 if (isl_pw_aff_is_empty(pwaff1)) {
1280 isl_pw_aff_free(pwaff1);
1281 return pwaff2;
1282 }
1283
1284 if (isl_pw_aff_is_empty(pwaff2)) {
1285 isl_pw_aff_free(pwaff2);
1286 return pwaff1;
1287 }
1288
1289 n = 2 * (pwaff1->n + 1) * (pwaff2->n + 1);
1290 res = isl_pw_aff_alloc_size(isl_space_copy(pwaff1->dim), n);
1291
1292 for (i = 0; i < pwaff1->n; ++i) {
1293 set = isl_set_copy(pwaff1->p[i].set);
1294 for (j = 0; j < pwaff2->n; ++j) {
1295 struct isl_set *common;
1296 isl_set *better;
1297
1298 common = isl_set_intersect(
1299 isl_set_copy(pwaff1->p[i].set),
1300 isl_set_copy(pwaff2->p[j].set));
1301 better = isl_set_from_basic_set(cmp(
1302 isl_aff_copy(pwaff2->p[j].aff),
1303 isl_aff_copy(pwaff1->p[i].aff)));
1304 better = isl_set_intersect(common, better);
1305 if (isl_set_plain_is_empty(better)) {
1306 isl_set_free(better);
1307 continue;
1308 }
1309 set = isl_set_subtract(set, isl_set_copy(better));
1310
1311 res = isl_pw_aff_add_piece(res, better,
1312 isl_aff_copy(pwaff2->p[j].aff));
1313 }
1314 res = isl_pw_aff_add_piece(res, set,
1315 isl_aff_copy(pwaff1->p[i].aff));
1316 }
1317
1318 for (j = 0; j < pwaff2->n; ++j) {
1319 set = isl_set_copy(pwaff2->p[j].set);
1320 for (i = 0; i < pwaff1->n; ++i)
1321 set = isl_set_subtract(set,
1322 isl_set_copy(pwaff1->p[i].set));
1323 res = isl_pw_aff_add_piece(res, set,
1324 isl_aff_copy(pwaff2->p[j].aff));
1325 }
1326
1327 isl_pw_aff_free(pwaff1);
1328 isl_pw_aff_free(pwaff2);
1329
1330 return res;
1331 error:
1332 isl_pw_aff_free(pwaff1);
1333 isl_pw_aff_free(pwaff2);
1334 return NULL;
1335 }
1336
1337 /* Compute a piecewise quasi-affine expression with a domain that
1338 * is the union of those of pwaff1 and pwaff2 and such that on each
1339 * cell, the quasi-affine expression is the maximum of those of pwaff1
1340 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
1341 * cell, then the associated expression is the defined one.
1342 */
1343 static __isl_give isl_pw_aff *pw_aff_union_max(__isl_take isl_pw_aff *pwaff1,
1344 __isl_take isl_pw_aff *pwaff2)
1345 {
1346 return pw_aff_union_opt(pwaff1, pwaff2, &isl_aff_ge_basic_set);
1347 }
1348
1349 __isl_give isl_pw_aff *isl_pw_aff_union_max(__isl_take isl_pw_aff *pwaff1,
1350 __isl_take isl_pw_aff *pwaff2)
1351 {
1352 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2,
1353 &pw_aff_union_max);
1354 }
1355
1356 /* Compute a piecewise quasi-affine expression with a domain that
1357 * is the union of those of pwaff1 and pwaff2 and such that on each
1358 * cell, the quasi-affine expression is the minimum of those of pwaff1
1359 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
1360 * cell, then the associated expression is the defined one.
1361 */
1362 static __isl_give isl_pw_aff *pw_aff_union_min(__isl_take isl_pw_aff *pwaff1,
1363 __isl_take isl_pw_aff *pwaff2)
1364 {
1365 return pw_aff_union_opt(pwaff1, pwaff2, &isl_aff_le_basic_set);
1366 }
1367
1368 __isl_give isl_pw_aff *isl_pw_aff_union_min(__isl_take isl_pw_aff *pwaff1,
1369 __isl_take isl_pw_aff *pwaff2)
1370 {
1371 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2,
1372 &pw_aff_union_min);
1373 }
1374
1375 __isl_give isl_pw_aff *isl_pw_aff_union_opt(__isl_take isl_pw_aff *pwaff1,
1376 __isl_take isl_pw_aff *pwaff2, int max)
1377 {
1378 if (max)
1379 return isl_pw_aff_union_max(pwaff1, pwaff2);
1380 else
1381 return isl_pw_aff_union_min(pwaff1, pwaff2);
1382 }
1383
1384 /* Construct a map with as domain the domain of pwaff and
1385 * one-dimensional range corresponding to the affine expressions.
1386 */
1387 static __isl_give isl_map *map_from_pw_aff(__isl_take isl_pw_aff *pwaff)
1388 {
1389 int i;
1390 isl_space *dim;
1391 isl_map *map;
1392
1393 if (!pwaff)
1394 return NULL;
1395
1396 dim = isl_pw_aff_get_space(pwaff);
1397 map = isl_map_empty(dim);
1398
1399 for (i = 0; i < pwaff->n; ++i) {
1400 isl_basic_map *bmap;
1401 isl_map *map_i;
1402
1403 bmap = isl_basic_map_from_aff(isl_aff_copy(pwaff->p[i].aff));
1404 map_i = isl_map_from_basic_map(bmap);
1405 map_i = isl_map_intersect_domain(map_i,
1406 isl_set_copy(pwaff->p[i].set));
1407 map = isl_map_union_disjoint(map, map_i);
1408 }
1409
1410 isl_pw_aff_free(pwaff);
1411
1412 return map;
1413 }
1414
1415 /* Construct a map with as domain the domain of pwaff and
1416 * one-dimensional range corresponding to the affine expressions.
1417 */
1418 __isl_give isl_map *isl_map_from_pw_aff(__isl_take isl_pw_aff *pwaff)
1419 {
1420 if (isl_space_is_set(pwaff->dim))
1421 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
1422 "space of input is not a map",
1423 return isl_pw_aff_free(pwaff));
1424 return map_from_pw_aff(pwaff);
1425 }
1426
1427 /* Construct a one-dimensional set with as parameter domain
1428 * the domain of pwaff and the single set dimension
1429 * corresponding to the affine expressions.
1430 */
1431 __isl_give isl_set *isl_set_from_pw_aff(__isl_take isl_pw_aff *pwaff)
1432 {
1433 if (!pwaff)
1434 return NULL;
1435 if (!isl_space_is_set(pwaff->dim))
1436 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
1437 "space of input is not a set",
1438 return isl_pw_aff_free(pwaff));
1439 return map_from_pw_aff(pwaff);
1440 }
1441
1442 /* Return a set containing those elements in the domain
1443 * of pwaff where it is non-negative.
1444 */
1445 __isl_give isl_set *isl_pw_aff_nonneg_set(__isl_take isl_pw_aff *pwaff)
1446 {
1447 int i;
1448 isl_set *set;
1449
1450 if (!pwaff)
1451 return NULL;
1452
1453 set = isl_set_empty(isl_pw_aff_get_domain_space(pwaff));
1454
1455 for (i = 0; i < pwaff->n; ++i) {
1456 isl_basic_set *bset;
1457 isl_set *set_i;
1458
1459 bset = isl_aff_nonneg_basic_set(isl_aff_copy(pwaff->p[i].aff));
1460 set_i = isl_set_from_basic_set(bset);
1461 set_i = isl_set_intersect(set_i, isl_set_copy(pwaff->p[i].set));
1462 set = isl_set_union_disjoint(set, set_i);
1463 }
1464
1465 isl_pw_aff_free(pwaff);
1466
1467 return set;
1468 }
1469
1470 /* Return a set containing those elements in the domain
1471 * of pwaff where it is zero.
1472 */
1473 __isl_give isl_set *isl_pw_aff_zero_set(__isl_take isl_pw_aff *pwaff)
1474 {
1475 int i;
1476 isl_set *set;
1477
1478 if (!pwaff)
1479 return NULL;
1480
1481 set = isl_set_empty(isl_pw_aff_get_domain_space(pwaff));
1482
1483 for (i = 0; i < pwaff->n; ++i) {
1484 isl_basic_set *bset;
1485 isl_set *set_i;
1486
1487 bset = isl_aff_zero_basic_set(isl_aff_copy(pwaff->p[i].aff));
1488 set_i = isl_set_from_basic_set(bset);
1489 set_i = isl_set_intersect(set_i, isl_set_copy(pwaff->p[i].set));
1490 set = isl_set_union_disjoint(set, set_i);
1491 }
1492
1493 isl_pw_aff_free(pwaff);
1494
1495 return set;
1496 }
1497
1498 /* Return a set containing those elements in the domain
1499 * of pwaff where it is not zero.
1500 */
1501 __isl_give isl_set *isl_pw_aff_non_zero_set(__isl_take isl_pw_aff *pwaff)
1502 {
1503 return isl_set_complement(isl_pw_aff_zero_set(pwaff));
1504 }
1505
1506 /* Return a set containing those elements in the shared domain
1507 * of pwaff1 and pwaff2 where pwaff1 is greater than (or equal) to pwaff2.
1508 *
1509 * We compute the difference on the shared domain and then construct
1510 * the set of values where this difference is non-negative.
1511 * If strict is set, we first subtract 1 from the difference.
1512 * If equal is set, we only return the elements where pwaff1 and pwaff2
1513 * are equal.
1514 */
1515 static __isl_give isl_set *pw_aff_gte_set(__isl_take isl_pw_aff *pwaff1,
1516 __isl_take isl_pw_aff *pwaff2, int strict, int equal)
1517 {
1518 isl_set *set1, *set2;
1519
1520 set1 = isl_pw_aff_domain(isl_pw_aff_copy(pwaff1));
1521 set2 = isl_pw_aff_domain(isl_pw_aff_copy(pwaff2));
1522 set1 = isl_set_intersect(set1, set2);
1523 pwaff1 = isl_pw_aff_intersect_domain(pwaff1, isl_set_copy(set1));
1524 pwaff2 = isl_pw_aff_intersect_domain(pwaff2, isl_set_copy(set1));
1525 pwaff1 = isl_pw_aff_add(pwaff1, isl_pw_aff_neg(pwaff2));
1526
1527 if (strict) {
1528 isl_space *dim = isl_set_get_space(set1);
1529 isl_aff *aff;
1530 aff = isl_aff_zero_on_domain(isl_local_space_from_space(dim));
1531 aff = isl_aff_add_constant_si(aff, -1);
1532 pwaff1 = isl_pw_aff_add(pwaff1, isl_pw_aff_alloc(set1, aff));
1533 } else
1534 isl_set_free(set1);
1535
1536 if (equal)
1537 return isl_pw_aff_zero_set(pwaff1);
1538 return isl_pw_aff_nonneg_set(pwaff1);
1539 }
1540
1541 /* Return a set containing those elements in the shared domain
1542 * of pwaff1 and pwaff2 where pwaff1 is equal to pwaff2.
1543 */
1544 static __isl_give isl_set *pw_aff_eq_set(__isl_take isl_pw_aff *pwaff1,
1545 __isl_take isl_pw_aff *pwaff2)
1546 {
1547 return pw_aff_gte_set(pwaff1, pwaff2, 0, 1);
1548 }
1549
1550 __isl_give isl_set *isl_pw_aff_eq_set(__isl_take isl_pw_aff *pwaff1,
1551 __isl_take isl_pw_aff *pwaff2)
1552 {
1553 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_eq_set);
1554 }
1555
1556 /* Return a set containing those elements in the shared domain
1557 * of pwaff1 and pwaff2 where pwaff1 is greater than or equal to pwaff2.
1558 */
1559 static __isl_give isl_set *pw_aff_ge_set(__isl_take isl_pw_aff *pwaff1,
1560 __isl_take isl_pw_aff *pwaff2)
1561 {
1562 return pw_aff_gte_set(pwaff1, pwaff2, 0, 0);
1563 }
1564
1565 __isl_give isl_set *isl_pw_aff_ge_set(__isl_take isl_pw_aff *pwaff1,
1566 __isl_take isl_pw_aff *pwaff2)
1567 {
1568 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_ge_set);
1569 }
1570
1571 /* Return a set containing those elements in the shared domain
1572 * of pwaff1 and pwaff2 where pwaff1 is strictly greater than pwaff2.
1573 */
1574 static __isl_give isl_set *pw_aff_gt_set(__isl_take isl_pw_aff *pwaff1,
1575 __isl_take isl_pw_aff *pwaff2)
1576 {
1577 return pw_aff_gte_set(pwaff1, pwaff2, 1, 0);
1578 }
1579
1580 __isl_give isl_set *isl_pw_aff_gt_set(__isl_take isl_pw_aff *pwaff1,
1581 __isl_take isl_pw_aff *pwaff2)
1582 {
1583 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_gt_set);
1584 }
1585
1586 __isl_give isl_set *isl_pw_aff_le_set(__isl_take isl_pw_aff *pwaff1,
1587 __isl_take isl_pw_aff *pwaff2)
1588 {
1589 return isl_pw_aff_ge_set(pwaff2, pwaff1);
1590 }
1591
1592 __isl_give isl_set *isl_pw_aff_lt_set(__isl_take isl_pw_aff *pwaff1,
1593 __isl_take isl_pw_aff *pwaff2)
1594 {
1595 return isl_pw_aff_gt_set(pwaff2, pwaff1);
1596 }
1597
1598 /* Return a set containing those elements in the shared domain
1599 * of the elements of list1 and list2 where each element in list1
1600 * has the relation specified by "fn" with each element in list2.
1601 */
1602 static __isl_give isl_set *pw_aff_list_set(__isl_take isl_pw_aff_list *list1,
1603 __isl_take isl_pw_aff_list *list2,
1604 __isl_give isl_set *(*fn)(__isl_take isl_pw_aff *pwaff1,
1605 __isl_take isl_pw_aff *pwaff2))
1606 {
1607 int i, j;
1608 isl_ctx *ctx;
1609 isl_set *set;
1610
1611 if (!list1 || !list2)
1612 goto error;
1613
1614 ctx = isl_pw_aff_list_get_ctx(list1);
1615 if (list1->n < 1 || list2->n < 1)
1616 isl_die(ctx, isl_error_invalid,
1617 "list should contain at least one element", goto error);
1618
1619 set = isl_set_universe(isl_pw_aff_get_domain_space(list1->p[0]));
1620 for (i = 0; i < list1->n; ++i)
1621 for (j = 0; j < list2->n; ++j) {
1622 isl_set *set_ij;
1623
1624 set_ij = fn(isl_pw_aff_copy(list1->p[i]),
1625 isl_pw_aff_copy(list2->p[j]));
1626 set = isl_set_intersect(set, set_ij);
1627 }
1628
1629 isl_pw_aff_list_free(list1);
1630 isl_pw_aff_list_free(list2);
1631 return set;
1632 error:
1633 isl_pw_aff_list_free(list1);
1634 isl_pw_aff_list_free(list2);
1635 return NULL;
1636 }
1637
1638 /* Return a set containing those elements in the shared domain
1639 * of the elements of list1 and list2 where each element in list1
1640 * is equal to each element in list2.
1641 */
1642 __isl_give isl_set *isl_pw_aff_list_eq_set(__isl_take isl_pw_aff_list *list1,
1643 __isl_take isl_pw_aff_list *list2)
1644 {
1645 return pw_aff_list_set(list1, list2, &isl_pw_aff_eq_set);
1646 }
1647
1648 __isl_give isl_set *isl_pw_aff_list_ne_set(__isl_take isl_pw_aff_list *list1,
1649 __isl_take isl_pw_aff_list *list2)
1650 {
1651 return pw_aff_list_set(list1, list2, &isl_pw_aff_ne_set);
1652 }
1653
1654 /* Return a set containing those elements in the shared domain
1655 * of the elements of list1 and list2 where each element in list1
1656 * is less than or equal to each element in list2.
1657 */
1658 __isl_give isl_set *isl_pw_aff_list_le_set(__isl_take isl_pw_aff_list *list1,
1659 __isl_take isl_pw_aff_list *list2)
1660 {
1661 return pw_aff_list_set(list1, list2, &isl_pw_aff_le_set);
1662 }
1663
1664 __isl_give isl_set *isl_pw_aff_list_lt_set(__isl_take isl_pw_aff_list *list1,
1665 __isl_take isl_pw_aff_list *list2)
1666 {
1667 return pw_aff_list_set(list1, list2, &isl_pw_aff_lt_set);
1668 }
1669
1670 __isl_give isl_set *isl_pw_aff_list_ge_set(__isl_take isl_pw_aff_list *list1,
1671 __isl_take isl_pw_aff_list *list2)
1672 {
1673 return pw_aff_list_set(list1, list2, &isl_pw_aff_ge_set);
1674 }
1675
1676 __isl_give isl_set *isl_pw_aff_list_gt_set(__isl_take isl_pw_aff_list *list1,
1677 __isl_take isl_pw_aff_list *list2)
1678 {
1679 return pw_aff_list_set(list1, list2, &isl_pw_aff_gt_set);
1680 }
1681
1682
1683 /* Return a set containing those elements in the shared domain
1684 * of pwaff1 and pwaff2 where pwaff1 is not equal to pwaff2.
1685 */
1686 static __isl_give isl_set *pw_aff_ne_set(__isl_take isl_pw_aff *pwaff1,
1687 __isl_take isl_pw_aff *pwaff2)
1688 {
1689 isl_set *set_lt, *set_gt;
1690
1691 set_lt = isl_pw_aff_lt_set(isl_pw_aff_copy(pwaff1),
1692 isl_pw_aff_copy(pwaff2));
1693 set_gt = isl_pw_aff_gt_set(pwaff1, pwaff2);
1694 return isl_set_union_disjoint(set_lt, set_gt);
1695 }
1696
1697 __isl_give isl_set *isl_pw_aff_ne_set(__isl_take isl_pw_aff *pwaff1,
1698 __isl_take isl_pw_aff *pwaff2)
1699 {
1700 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_ne_set);
1701 }
1702
1703 __isl_give isl_pw_aff *isl_pw_aff_scale_down(__isl_take isl_pw_aff *pwaff,
1704 isl_int v)
1705 {
1706 int i;
1707
1708 if (isl_int_is_one(v))
1709 return pwaff;
1710 if (!isl_int_is_pos(v))
1711 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
1712 "factor needs to be positive",
1713 return isl_pw_aff_free(pwaff));
1714 pwaff = isl_pw_aff_cow(pwaff);
1715 if (!pwaff)
1716 return NULL;
1717 if (pwaff->n == 0)
1718 return pwaff;
1719
1720 for (i = 0; i < pwaff->n; ++i) {
1721 pwaff->p[i].aff = isl_aff_scale_down(pwaff->p[i].aff, v);
1722 if (!pwaff->p[i].aff)
1723 return isl_pw_aff_free(pwaff);
1724 }
1725
1726 return pwaff;
1727 }
1728
1729 __isl_give isl_pw_aff *isl_pw_aff_floor(__isl_take isl_pw_aff *pwaff)
1730 {
1731 int i;
1732
1733 pwaff = isl_pw_aff_cow(pwaff);
1734 if (!pwaff)
1735 return NULL;
1736 if (pwaff->n == 0)
1737 return pwaff;
1738
1739 for (i = 0; i < pwaff->n; ++i) {
1740 pwaff->p[i].aff = isl_aff_floor(pwaff->p[i].aff);
1741 if (!pwaff->p[i].aff)
1742 return isl_pw_aff_free(pwaff);
1743 }
1744
1745 return pwaff;
1746 }
1747
1748 __isl_give isl_pw_aff *isl_pw_aff_ceil(__isl_take isl_pw_aff *pwaff)
1749 {
1750 int i;
1751
1752 pwaff = isl_pw_aff_cow(pwaff);
1753 if (!pwaff)
1754 return NULL;
1755 if (pwaff->n == 0)
1756 return pwaff;
1757
1758 for (i = 0; i < pwaff->n; ++i) {
1759 pwaff->p[i].aff = isl_aff_ceil(pwaff->p[i].aff);
1760 if (!pwaff->p[i].aff)
1761 return isl_pw_aff_free(pwaff);
1762 }
1763
1764 return pwaff;
1765 }
1766
1767 /* Return an affine expression that is equal to pwaff_true for elements
1768 * in "cond" and to pwaff_false for elements not in "cond".
1769 * That is, return cond ? pwaff_true : pwaff_false;
1770 */
1771 __isl_give isl_pw_aff *isl_pw_aff_cond(__isl_take isl_set *cond,
1772 __isl_take isl_pw_aff *pwaff_true, __isl_take isl_pw_aff *pwaff_false)
1773 {
1774 isl_set *comp;
1775
1776 comp = isl_set_complement(isl_set_copy(cond));
1777 pwaff_true = isl_pw_aff_intersect_domain(pwaff_true, cond);
1778 pwaff_false = isl_pw_aff_intersect_domain(pwaff_false, comp);
1779
1780 return isl_pw_aff_add_disjoint(pwaff_true, pwaff_false);
1781 }
1782
1783 int isl_aff_is_cst(__isl_keep isl_aff *aff)
1784 {
1785 if (!aff)
1786 return -1;
1787
1788 return isl_seq_first_non_zero(aff->v->el + 2, aff->v->size - 2) == -1;
1789 }
1790
1791 /* Check whether pwaff is a piecewise constant.
1792 */
1793 int isl_pw_aff_is_cst(__isl_keep isl_pw_aff *pwaff)
1794 {
1795 int i;
1796
1797 if (!pwaff)
1798 return -1;
1799
1800 for (i = 0; i < pwaff->n; ++i) {
1801 int is_cst = isl_aff_is_cst(pwaff->p[i].aff);
1802 if (is_cst < 0 || !is_cst)
1803 return is_cst;
1804 }
1805
1806 return 1;
1807 }
1808
1809 __isl_give isl_aff *isl_aff_mul(__isl_take isl_aff *aff1,
1810 __isl_take isl_aff *aff2)
1811 {
1812 if (!isl_aff_is_cst(aff2) && isl_aff_is_cst(aff1))
1813 return isl_aff_mul(aff2, aff1);
1814
1815 if (!isl_aff_is_cst(aff2))
1816 isl_die(isl_aff_get_ctx(aff1), isl_error_invalid,
1817 "at least one affine expression should be constant",
1818 goto error);
1819
1820 aff1 = isl_aff_cow(aff1);
1821 if (!aff1 || !aff2)
1822 goto error;
1823
1824 aff1 = isl_aff_scale(aff1, aff2->v->el[1]);
1825 aff1 = isl_aff_scale_down(aff1, aff2->v->el[0]);
1826
1827 isl_aff_free(aff2);
1828 return aff1;
1829 error:
1830 isl_aff_free(aff1);
1831 isl_aff_free(aff2);
1832 return NULL;
1833 }
1834
1835 static __isl_give isl_pw_aff *pw_aff_add(__isl_take isl_pw_aff *pwaff1,
1836 __isl_take isl_pw_aff *pwaff2)
1837 {
1838 return isl_pw_aff_on_shared_domain(pwaff1, pwaff2, &isl_aff_add);
1839 }
1840
1841 __isl_give isl_pw_aff *isl_pw_aff_add(__isl_take isl_pw_aff *pwaff1,
1842 __isl_take isl_pw_aff *pwaff2)
1843 {
1844 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_add);
1845 }
1846
1847 __isl_give isl_pw_aff *isl_pw_aff_union_add(__isl_take isl_pw_aff *pwaff1,
1848 __isl_take isl_pw_aff *pwaff2)
1849 {
1850 return isl_pw_aff_union_add_(pwaff1, pwaff2);
1851 }
1852
1853 static __isl_give isl_pw_aff *pw_aff_mul(__isl_take isl_pw_aff *pwaff1,
1854 __isl_take isl_pw_aff *pwaff2)
1855 {
1856 return isl_pw_aff_on_shared_domain(pwaff1, pwaff2, &isl_aff_mul);
1857 }
1858
1859 __isl_give isl_pw_aff *isl_pw_aff_mul(__isl_take isl_pw_aff *pwaff1,
1860 __isl_take isl_pw_aff *pwaff2)
1861 {
1862 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_mul);
1863 }
1864
1865 static __isl_give isl_pw_aff *pw_aff_min(__isl_take isl_pw_aff *pwaff1,
1866 __isl_take isl_pw_aff *pwaff2)
1867 {
1868 isl_set *le;
1869
1870 le = isl_pw_aff_le_set(isl_pw_aff_copy(pwaff1),
1871 isl_pw_aff_copy(pwaff2));
1872 return isl_pw_aff_cond(le, pwaff1, pwaff2);
1873 }
1874
1875 __isl_give isl_pw_aff *isl_pw_aff_min(__isl_take isl_pw_aff *pwaff1,
1876 __isl_take isl_pw_aff *pwaff2)
1877 {
1878 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_min);
1879 }
1880
1881 static __isl_give isl_pw_aff *pw_aff_max(__isl_take isl_pw_aff *pwaff1,
1882 __isl_take isl_pw_aff *pwaff2)
1883 {
1884 isl_set *le;
1885
1886 le = isl_pw_aff_ge_set(isl_pw_aff_copy(pwaff1),
1887 isl_pw_aff_copy(pwaff2));
1888 return isl_pw_aff_cond(le, pwaff1, pwaff2);
1889 }
1890
1891 __isl_give isl_pw_aff *isl_pw_aff_max(__isl_take isl_pw_aff *pwaff1,
1892 __isl_take isl_pw_aff *pwaff2)
1893 {
1894 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_max);
1895 }
1896
1897 static __isl_give isl_pw_aff *pw_aff_list_reduce(
1898 __isl_take isl_pw_aff_list *list,
1899 __isl_give isl_pw_aff *(*fn)(__isl_take isl_pw_aff *pwaff1,
1900 __isl_take isl_pw_aff *pwaff2))
1901 {
1902 int i;
1903 isl_ctx *ctx;
1904 isl_pw_aff *res;
1905
1906 if (!list)
1907 return NULL;
1908
1909 ctx = isl_pw_aff_list_get_ctx(list);
1910 if (list->n < 1)
1911 isl_die(ctx, isl_error_invalid,
1912 "list should contain at least one element",
1913 return isl_pw_aff_list_free(list));
1914
1915 res = isl_pw_aff_copy(list->p[0]);
1916 for (i = 1; i < list->n; ++i)
1917 res = fn(res, isl_pw_aff_copy(list->p[i]));
1918
1919 isl_pw_aff_list_free(list);
1920 return res;
1921 }
1922
1923 /* Return an isl_pw_aff that maps each element in the intersection of the
1924 * domains of the elements of list to the minimal corresponding affine
1925 * expression.
1926 */
1927 __isl_give isl_pw_aff *isl_pw_aff_list_min(__isl_take isl_pw_aff_list *list)
1928 {
1929 return pw_aff_list_reduce(list, &isl_pw_aff_min);
1930 }
1931
1932 /* Return an isl_pw_aff that maps each element in the intersection of the
1933 * domains of the elements of list to the maximal corresponding affine
1934 * expression.
1935 */
1936 __isl_give isl_pw_aff *isl_pw_aff_list_max(__isl_take isl_pw_aff_list *list)
1937 {
1938 return pw_aff_list_reduce(list, &isl_pw_aff_max);
1939 }
1940
1941 #undef BASE
1942 #define BASE aff
1943
1944 #include <isl_multi_templ.c>
1945
1946 __isl_give isl_multi_aff *isl_multi_aff_add(__isl_take isl_multi_aff *maff1,
1947 __isl_take isl_multi_aff *maff2)
1948 {
1949 int i;
1950 isl_ctx *ctx;
1951
1952 maff1 = isl_multi_aff_cow(maff1);
1953 if (!maff1 || !maff2)
1954 goto error;
1955
1956 ctx = isl_multi_aff_get_ctx(maff1);
1957 if (!isl_space_is_equal(maff1->space, maff2->space))
1958 isl_die(ctx, isl_error_invalid,
1959 "spaces don't match", goto error);
1960
1961 for (i = 0; i < maff1->n; ++i) {
1962 maff1->p[i] = isl_aff_add(maff1->p[i],
1963 isl_aff_copy(maff2->p[i]));
1964 if (!maff1->p[i])
1965 goto error;
1966 }
1967
1968 isl_multi_aff_free(maff2);
1969 return maff1;
1970 error:
1971 isl_multi_aff_free(maff1);
1972 isl_multi_aff_free(maff2);
1973 return NULL;
1974 }
1975
1976 /* Exploit the equalities in "eq" to simplify the affine expressions.
1977 */
1978 static __isl_give isl_multi_aff *isl_multi_aff_substitute_equalities(
1979 __isl_take isl_multi_aff *maff, __isl_take isl_basic_set *eq)
1980 {
1981 int i;
1982
1983 maff = isl_multi_aff_cow(maff);
1984 if (!maff || !eq)
1985 goto error;
1986
1987 for (i = 0; i < maff->n; ++i) {
1988 maff->p[i] = isl_aff_substitute_equalities(maff->p[i],
1989 isl_basic_set_copy(eq));
1990 if (!maff->p[i])
1991 goto error;
1992 }
1993
1994 isl_basic_set_free(eq);
1995 return maff;
1996 error:
1997 isl_basic_set_free(eq);
1998 isl_multi_aff_free(maff);
1999 return NULL;
2000 }
2001
2002 __isl_give isl_multi_aff *isl_multi_aff_scale(__isl_take isl_multi_aff *maff,
2003 isl_int f)
2004 {
2005 int i;
2006
2007 maff = isl_multi_aff_cow(maff);
2008 if (!maff)
2009 return NULL;
2010
2011 for (i = 0; i < maff->n; ++i) {
2012 maff->p[i] = isl_aff_scale(maff->p[i], f);
2013 if (!maff->p[i])
2014 return isl_multi_aff_free(maff);
2015 }
2016
2017 return maff;
2018 }
2019
2020 __isl_give isl_multi_aff *isl_multi_aff_add_on_domain(__isl_keep isl_set *dom,
2021 __isl_take isl_multi_aff *maff1, __isl_take isl_multi_aff *maff2)
2022 {
2023 maff1 = isl_multi_aff_add(maff1, maff2);
2024 maff1 = isl_multi_aff_gist(maff1, isl_set_copy(dom));
2025 return maff1;
2026 }
2027
2028 int isl_multi_aff_is_empty(__isl_keep isl_multi_aff *maff)
2029 {
2030 if (!maff)
2031 return -1;
2032
2033 return 0;
2034 }
2035
2036 int isl_multi_aff_plain_is_equal(__isl_keep isl_multi_aff *maff1,
2037 __isl_keep isl_multi_aff *maff2)
2038 {
2039 int i;
2040 int equal;
2041
2042 if (!maff1 || !maff2)
2043 return -1;
2044 if (maff1->n != maff2->n)
2045 return 0;
2046 equal = isl_space_is_equal(maff1->space, maff2->space);
2047 if (equal < 0 || !equal)
2048 return equal;
2049
2050 for (i = 0; i < maff1->n; ++i) {
2051 equal = isl_aff_plain_is_equal(maff1->p[i], maff2->p[i]);
2052 if (equal < 0 || !equal)
2053 return equal;
2054 }
2055
2056 return 1;
2057 }
2058
2059 __isl_give isl_multi_aff *isl_multi_aff_set_dim_name(
2060 __isl_take isl_multi_aff *maff,
2061 enum isl_dim_type type, unsigned pos, const char *s)
2062 {
2063 int i;
2064
2065 maff = isl_multi_aff_cow(maff);
2066 if (!maff)
2067 return NULL;
2068
2069 maff->space = isl_space_set_dim_name(maff->space, type, pos, s);
2070 if (!maff->space)
2071 return isl_multi_aff_free(maff);
2072 for (i = 0; i < maff->n; ++i) {
2073 maff->p[i] = isl_aff_set_dim_name(maff->p[i], type, pos, s);
2074 if (!maff->p[i])
2075 return isl_multi_aff_free(maff);
2076 }
2077
2078 return maff;
2079 }
2080
2081 __isl_give isl_multi_aff *isl_multi_aff_drop_dims(__isl_take isl_multi_aff *maff,
2082 enum isl_dim_type type, unsigned first, unsigned n)
2083 {
2084 int i;
2085
2086 maff = isl_multi_aff_cow(maff);
2087 if (!maff)
2088 return NULL;
2089
2090 maff->space = isl_space_drop_dims(maff->space, type, first, n);
2091 if (!maff->space)
2092 return isl_multi_aff_free(maff);
2093 for (i = 0; i < maff->n; ++i) {
2094 maff->p[i] = isl_aff_drop_dims(maff->p[i], type, first, n);
2095 if (!maff->p[i])
2096 return isl_multi_aff_free(maff);
2097 }
2098
2099 return maff;
2100 }
2101
2102 #undef PW
2103 #define PW isl_pw_multi_aff
2104 #undef EL
2105 #define EL isl_multi_aff
2106 #undef EL_IS_ZERO
2107 #define EL_IS_ZERO is_empty
2108 #undef ZERO
2109 #define ZERO empty
2110 #undef IS_ZERO
2111 #define IS_ZERO is_empty
2112 #undef FIELD
2113 #define FIELD maff
2114
2115 #define NO_NEG
2116 #define NO_EVAL
2117 #define NO_OPT
2118 #define NO_INVOLVES_DIMS
2119 #define NO_MOVE_DIMS
2120 #define NO_INSERT_DIMS
2121 #define NO_LIFT
2122 #define NO_MORPH
2123
2124 #include <isl_pw_templ.c>
2125
2126 static __isl_give isl_pw_multi_aff *pw_multi_aff_add(
2127 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
2128 {
2129 return isl_pw_multi_aff_on_shared_domain(pma1, pma2,
2130 &isl_multi_aff_add);
2131 }
2132
2133 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_add(
2134 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
2135 {
2136 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
2137 &pw_multi_aff_add);
2138 }
2139
2140 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_add(
2141 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
2142 {
2143 return isl_pw_multi_aff_union_add_(pma1, pma2);
2144 }
2145
2146 /* Construct a map mapping the domain the piecewise multi-affine expression
2147 * to its range, with each dimension in the range equated to the
2148 * corresponding affine expression on its cell.
2149 */
2150 __isl_give isl_map *isl_map_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma)
2151 {
2152 int i;
2153 isl_map *map;
2154
2155 if (!pma)
2156 return NULL;
2157
2158 map = isl_map_empty(isl_pw_multi_aff_get_space(pma));
2159
2160 for (i = 0; i < pma->n; ++i) {
2161 isl_multi_aff *maff;
2162 isl_basic_map *bmap;
2163 isl_map *map_i;
2164
2165 maff = isl_multi_aff_copy(pma->p[i].maff);
2166 bmap = isl_basic_map_from_multi_aff(maff);
2167 map_i = isl_map_from_basic_map(bmap);
2168 map_i = isl_map_intersect_domain(map_i,
2169 isl_set_copy(pma->p[i].set));
2170 map = isl_map_union_disjoint(map, map_i);
2171 }
2172
2173 isl_pw_multi_aff_free(pma);
2174 return map;
2175 }
2176
2177 __isl_give isl_set *isl_set_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma)
2178 {
2179 if (!isl_space_is_set(pma->dim))
2180 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
2181 "isl_pw_multi_aff cannot be converted into an isl_set",
2182 return isl_pw_multi_aff_free(pma));
2183
2184 return isl_map_from_pw_multi_aff(pma);
2185 }
2186
2187 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
2188 * This obivously only works if the input "map" is single-valued.
2189 * If so, we compute the lexicographic minimum of the image in the form
2190 * of an isl_pw_multi_aff. Since the image is unique, it is equal
2191 * to its lexicographic minimum.
2192 * If the input is not single-valued, we produce an error.
2193 */
2194 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_map(__isl_take isl_map *map)
2195 {
2196 int i;
2197 int sv;
2198 isl_pw_multi_aff *pma;
2199
2200 if (!map)
2201 return NULL;
2202
2203 sv = isl_map_is_single_valued(map);
2204 if (sv < 0)
2205 goto error;
2206 if (!sv)
2207 isl_die(isl_map_get_ctx(map), isl_error_invalid,
2208 "map is not single-valued", goto error);
2209 map = isl_map_make_disjoint(map);
2210 if (!map)
2211 return NULL;
2212
2213 pma = isl_pw_multi_aff_empty(isl_map_get_space(map));
2214
2215 for (i = 0; i < map->n; ++i) {
2216 isl_pw_multi_aff *pma_i;
2217 isl_basic_map *bmap;
2218 bmap = isl_basic_map_copy(map->p[i]);
2219 pma_i = isl_basic_map_lexmin_pw_multi_aff(bmap);
2220 pma = isl_pw_multi_aff_add_disjoint(pma, pma_i);
2221 }
2222
2223 isl_map_free(map);
2224 return pma;
2225 error:
2226 isl_map_free(map);
2227 return NULL;
2228 }
2229
2230 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_set(__isl_take isl_set *set)
2231 {
2232 return isl_pw_multi_aff_from_map(set);
2233 }
2234
2235 /* Plug in "subs" for dimension "type", "pos" of "aff".
2236 *
2237 * Let i be the dimension to replace and let "subs" be of the form
2238 *
2239 * f/d
2240 *
2241 * and "aff" of the form
2242 *
2243 * (a i + g)/m
2244 *
2245 * The result is
2246 *
2247 * floor((a f + d g')/(m d))
2248 *
2249 * where g' is the result of plugging in "subs" in each of the integer
2250 * divisions in g.
2251 */
2252 __isl_give isl_aff *isl_aff_substitute(__isl_take isl_aff *aff,
2253 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
2254 {
2255 isl_ctx *ctx;
2256 isl_int v;
2257
2258 aff = isl_aff_cow(aff);
2259 if (!aff || !subs)
2260 return isl_aff_free(aff);
2261
2262 ctx = isl_aff_get_ctx(aff);
2263 if (!isl_space_is_equal(aff->ls->dim, subs->ls->dim))
2264 isl_die(ctx, isl_error_invalid,
2265 "spaces don't match", return isl_aff_free(aff));
2266 if (isl_local_space_dim(subs->ls, isl_dim_div) != 0)
2267 isl_die(ctx, isl_error_unsupported,
2268 "cannot handle divs yet", return isl_aff_free(aff));
2269
2270 aff->ls = isl_local_space_substitute(aff->ls, type, pos, subs);
2271 if (!aff->ls)
2272 return isl_aff_free(aff);
2273
2274 aff->v = isl_vec_cow(aff->v);
2275 if (!aff->v)
2276 return isl_aff_free(aff);
2277
2278 pos += isl_local_space_offset(aff->ls, type);
2279
2280 isl_int_init(v);
2281 isl_int_set(v, aff->v->el[1 + pos]);
2282 isl_int_set_si(aff->v->el[1 + pos], 0);
2283 isl_seq_combine(aff->v->el + 1, subs->v->el[0], aff->v->el + 1,
2284 v, subs->v->el + 1, subs->v->size - 1);
2285 isl_int_mul(aff->v->el[0], aff->v->el[0], subs->v->el[0]);
2286 isl_int_clear(v);
2287
2288 return aff;
2289 }
2290
2291 /* Plug in "subs" for dimension "type", "pos" in each of the affine
2292 * expressions in "maff".
2293 */
2294 __isl_give isl_multi_aff *isl_multi_aff_substitute(
2295 __isl_take isl_multi_aff *maff, enum isl_dim_type type, unsigned pos,
2296 __isl_keep isl_aff *subs)
2297 {
2298 int i;
2299
2300 maff = isl_multi_aff_cow(maff);
2301 if (!maff || !subs)
2302 return isl_multi_aff_free(maff);
2303
2304 if (type == isl_dim_in)
2305 type = isl_dim_set;
2306
2307 for (i = 0; i < maff->n; ++i) {
2308 maff->p[i] = isl_aff_substitute(maff->p[i], type, pos, subs);
2309 if (!maff->p[i])
2310 return isl_multi_aff_free(maff);
2311 }
2312
2313 return maff;
2314 }
2315
2316 /* Plug in "subs" for dimension "type", "pos" of "pma".
2317 *
2318 * pma is of the form
2319 *
2320 * A_i(v) -> M_i(v)
2321 *
2322 * while subs is of the form
2323 *
2324 * v' = B_j(v) -> S_j
2325 *
2326 * Each pair i,j such that C_ij = A_i \cap B_i is non-empty
2327 * has a contribution in the result, in particular
2328 *
2329 * C_ij(S_j) -> M_i(S_j)
2330 *
2331 * Note that plugging in S_j in C_ij may also result in an empty set
2332 * and this contribution should simply be discarded.
2333 */
2334 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_substitute(
2335 __isl_take isl_pw_multi_aff *pma, enum isl_dim_type type, unsigned pos,
2336 __isl_keep isl_pw_aff *subs)
2337 {
2338 int i, j, n;
2339 isl_pw_multi_aff *res;
2340
2341 if (!pma || !subs)
2342 return isl_pw_multi_aff_free(pma);
2343
2344 n = pma->n * subs->n;
2345 res = isl_pw_multi_aff_alloc_size(isl_space_copy(pma->dim), n);
2346
2347 for (i = 0; i < pma->n; ++i) {
2348 for (j = 0; j < subs->n; ++j) {
2349 isl_set *common;
2350 isl_multi_aff *res_ij;
2351 common = isl_set_intersect(
2352 isl_set_copy(pma->p[i].set),
2353 isl_set_copy(subs->p[j].set));
2354 common = isl_set_substitute(common,
2355 type, pos, subs->p[j].aff);
2356 if (isl_set_plain_is_empty(common)) {
2357 isl_set_free(common);
2358 continue;
2359 }
2360
2361 res_ij = isl_multi_aff_substitute(
2362 isl_multi_aff_copy(pma->p[i].maff),
2363 type, pos, subs->p[j].aff);
2364
2365 res = isl_pw_multi_aff_add_piece(res, common, res_ij);
2366 }
2367 }
2368
2369 isl_pw_multi_aff_free(pma);
2370 return res;
2371 }
2372
2373 /* Extend the local space of "dst" to include the divs
2374 * in the local space of "src".
2375 */
2376 __isl_give isl_aff *isl_aff_align_divs(__isl_take isl_aff *dst,
2377 __isl_keep isl_aff *src)
2378 {
2379 isl_ctx *ctx;
2380 int *exp1 = NULL;
2381 int *exp2 = NULL;
2382 isl_mat *div;
2383
2384 if (!src || !dst)
2385 return isl_aff_free(dst);
2386
2387 ctx = isl_aff_get_ctx(src);
2388 if (!isl_space_is_equal(src->ls->dim, dst->ls->dim))
2389 isl_die(ctx, isl_error_invalid,
2390 "spaces don't match", goto error);
2391
2392 if (src->ls->div->n_row == 0)
2393 return dst;
2394
2395 exp1 = isl_alloc_array(ctx, int, src->ls->div->n_row);
2396 exp2 = isl_alloc_array(ctx, int, dst->ls->div->n_row);
2397 if (!exp1 || !exp2)
2398 goto error;
2399
2400 div = isl_merge_divs(src->ls->div, dst->ls->div, exp1, exp2);
2401 dst = isl_aff_expand_divs(dst, div, exp2);
2402 free(exp1);
2403 free(exp2);
2404
2405 return dst;
2406 error:
2407 free(exp1);
2408 free(exp2);
2409 return isl_aff_free(dst);
2410 }
2411
2412 /* Adjust the local spaces of the affine expressions in "maff"
2413 * such that they all have the save divs.
2414 */
2415 __isl_give isl_multi_aff *isl_multi_aff_align_divs(
2416 __isl_take isl_multi_aff *maff)
2417 {
2418 int i;
2419
2420 if (!maff)
2421 return NULL;
2422 if (maff->n == 0)
2423 return maff;
2424 maff = isl_multi_aff_cow(maff);
2425 if (!maff)
2426 return NULL;
2427
2428 for (i = 1; i < maff->n; ++i)
2429 maff->p[0] = isl_aff_align_divs(maff->p[0], maff->p[i]);
2430 for (i = 1; i < maff->n; ++i) {
2431 maff->p[i] = isl_aff_align_divs(maff->p[i], maff->p[0]);
2432 if (!maff->p[i])
2433 return isl_multi_aff_free(maff);
2434 }
2435
2436 return maff;
2437 }
2438
2439 __isl_give isl_aff *isl_aff_lift(__isl_take isl_aff *aff)
2440 {
2441 aff = isl_aff_cow(aff);
2442 if (!aff)
2443 return NULL;
2444
2445 aff->ls = isl_local_space_lift(aff->ls);
2446 if (!aff->ls)
2447 return isl_aff_free(aff);
2448
2449 return aff;
2450 }
2451
2452 /* Lift "maff" to a space with extra dimensions such that the result
2453 * has no more existentially quantified variables.
2454 * If "ls" is not NULL, then *ls is assigned the local space that lies
2455 * at the basis of the lifting applied to "maff".
2456 */
2457 __isl_give isl_multi_aff *isl_multi_aff_lift(__isl_take isl_multi_aff *maff,
2458 __isl_give isl_local_space **ls)
2459 {
2460 int i;
2461 isl_space *space;
2462 unsigned n_div;
2463
2464 if (ls)
2465 *ls = NULL;
2466
2467 if (!maff)
2468 return NULL;
2469
2470 if (maff->n == 0) {
2471 if (ls) {
2472 isl_space *space = isl_multi_aff_get_domain_space(maff);
2473 *ls = isl_local_space_from_space(space);
2474 if (!*ls)
2475 return isl_multi_aff_free(maff);
2476 }
2477 return maff;
2478 }
2479
2480 maff = isl_multi_aff_cow(maff);
2481 maff = isl_multi_aff_align_divs(maff);
2482 if (!maff)
2483 return NULL;
2484
2485 n_div = isl_aff_dim(maff->p[0], isl_dim_div);
2486 space = isl_multi_aff_get_space(maff);
2487 space = isl_space_lift(isl_space_domain(space), n_div);
2488 space = isl_space_extend_domain_with_range(space,
2489 isl_multi_aff_get_space(maff));
2490 if (!space)
2491 return isl_multi_aff_free(maff);
2492 isl_space_free(maff->space);
2493 maff->space = space;
2494
2495 if (ls) {
2496 *ls = isl_aff_get_domain_local_space(maff->p[0]);
2497 if (!*ls)
2498 return isl_multi_aff_free(maff);
2499 }
2500
2501 for (i = 0; i < maff->n; ++i) {
2502 maff->p[i] = isl_aff_lift(maff->p[i]);
2503 if (!maff->p[i])
2504 goto error;
2505 }
2506
2507 return maff;
2508 error:
2509 if (ls)
2510 isl_local_space_free(*ls);
2511 return isl_multi_aff_free(maff);
2512 }
Integer set library