?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
add Feautrier's scheduling algorithm
[isl.git] / isl_aff.c
blobd0e101040c1d5bfcfc364736433ea0c0af9022e1
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 #undef DEFAULT_IS_ZERO
1223 #define DEFAULT_IS_ZERO 0
1224
1225 #define NO_EVAL
1226 #define NO_OPT
1227 #define NO_MOVE_DIMS
1228 #define NO_LIFT
1229 #define NO_MORPH
1230
1231 #include <isl_pw_templ.c>
1232
1233 static __isl_give isl_set *align_params_pw_pw_set_and(
1234 __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2,
1235 __isl_give isl_set *(*fn)(__isl_take isl_pw_aff *pwaff1,
1236 __isl_take isl_pw_aff *pwaff2))
1237 {
1238 if (!pwaff1 || !pwaff2)
1239 goto error;
1240 if (isl_space_match(pwaff1->dim, isl_dim_param,
1241 pwaff2->dim, isl_dim_param))
1242 return fn(pwaff1, pwaff2);
1243 if (!isl_space_has_named_params(pwaff1->dim) ||
1244 !isl_space_has_named_params(pwaff2->dim))
1245 isl_die(isl_pw_aff_get_ctx(pwaff1), isl_error_invalid,
1246 "unaligned unnamed parameters", goto error);
1247 pwaff1 = isl_pw_aff_align_params(pwaff1, isl_pw_aff_get_space(pwaff2));
1248 pwaff2 = isl_pw_aff_align_params(pwaff2, isl_pw_aff_get_space(pwaff1));
1249 return fn(pwaff1, pwaff2);
1250 error:
1251 isl_pw_aff_free(pwaff1);
1252 isl_pw_aff_free(pwaff2);
1253 return NULL;
1254 }
1255
1256 /* Compute a piecewise quasi-affine expression with a domain that
1257 * is the union of those of pwaff1 and pwaff2 and such that on each
1258 * cell, the quasi-affine expression is the better (according to cmp)
1259 * of those of pwaff1 and pwaff2. If only one of pwaff1 or pwaff2
1260 * is defined on a given cell, then the associated expression
1261 * is the defined one.
1262 */
1263 static __isl_give isl_pw_aff *pw_aff_union_opt(__isl_take isl_pw_aff *pwaff1,
1264 __isl_take isl_pw_aff *pwaff2,
1265 __isl_give isl_basic_set *(*cmp)(__isl_take isl_aff *aff1,
1266 __isl_take isl_aff *aff2))
1267 {
1268 int i, j, n;
1269 isl_pw_aff *res;
1270 isl_ctx *ctx;
1271 isl_set *set;
1272
1273 if (!pwaff1 || !pwaff2)
1274 goto error;
1275
1276 ctx = isl_space_get_ctx(pwaff1->dim);
1277 if (!isl_space_is_equal(pwaff1->dim, pwaff2->dim))
1278 isl_die(ctx, isl_error_invalid,
1279 "arguments should live in same space", goto error);
1280
1281 if (isl_pw_aff_is_empty(pwaff1)) {
1282 isl_pw_aff_free(pwaff1);
1283 return pwaff2;
1284 }
1285
1286 if (isl_pw_aff_is_empty(pwaff2)) {
1287 isl_pw_aff_free(pwaff2);
1288 return pwaff1;
1289 }
1290
1291 n = 2 * (pwaff1->n + 1) * (pwaff2->n + 1);
1292 res = isl_pw_aff_alloc_size(isl_space_copy(pwaff1->dim), n);
1293
1294 for (i = 0; i < pwaff1->n; ++i) {
1295 set = isl_set_copy(pwaff1->p[i].set);
1296 for (j = 0; j < pwaff2->n; ++j) {
1297 struct isl_set *common;
1298 isl_set *better;
1299
1300 common = isl_set_intersect(
1301 isl_set_copy(pwaff1->p[i].set),
1302 isl_set_copy(pwaff2->p[j].set));
1303 better = isl_set_from_basic_set(cmp(
1304 isl_aff_copy(pwaff2->p[j].aff),
1305 isl_aff_copy(pwaff1->p[i].aff)));
1306 better = isl_set_intersect(common, better);
1307 if (isl_set_plain_is_empty(better)) {
1308 isl_set_free(better);
1309 continue;
1310 }
1311 set = isl_set_subtract(set, isl_set_copy(better));
1312
1313 res = isl_pw_aff_add_piece(res, better,
1314 isl_aff_copy(pwaff2->p[j].aff));
1315 }
1316 res = isl_pw_aff_add_piece(res, set,
1317 isl_aff_copy(pwaff1->p[i].aff));
1318 }
1319
1320 for (j = 0; j < pwaff2->n; ++j) {
1321 set = isl_set_copy(pwaff2->p[j].set);
1322 for (i = 0; i < pwaff1->n; ++i)
1323 set = isl_set_subtract(set,
1324 isl_set_copy(pwaff1->p[i].set));
1325 res = isl_pw_aff_add_piece(res, set,
1326 isl_aff_copy(pwaff2->p[j].aff));
1327 }
1328
1329 isl_pw_aff_free(pwaff1);
1330 isl_pw_aff_free(pwaff2);
1331
1332 return res;
1333 error:
1334 isl_pw_aff_free(pwaff1);
1335 isl_pw_aff_free(pwaff2);
1336 return NULL;
1337 }
1338
1339 /* Compute a piecewise quasi-affine expression with a domain that
1340 * is the union of those of pwaff1 and pwaff2 and such that on each
1341 * cell, the quasi-affine expression is the maximum of those of pwaff1
1342 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
1343 * cell, then the associated expression is the defined one.
1344 */
1345 static __isl_give isl_pw_aff *pw_aff_union_max(__isl_take isl_pw_aff *pwaff1,
1346 __isl_take isl_pw_aff *pwaff2)
1347 {
1348 return pw_aff_union_opt(pwaff1, pwaff2, &isl_aff_ge_basic_set);
1349 }
1350
1351 __isl_give isl_pw_aff *isl_pw_aff_union_max(__isl_take isl_pw_aff *pwaff1,
1352 __isl_take isl_pw_aff *pwaff2)
1353 {
1354 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2,
1355 &pw_aff_union_max);
1356 }
1357
1358 /* Compute a piecewise quasi-affine expression with a domain that
1359 * is the union of those of pwaff1 and pwaff2 and such that on each
1360 * cell, the quasi-affine expression is the minimum of those of pwaff1
1361 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
1362 * cell, then the associated expression is the defined one.
1363 */
1364 static __isl_give isl_pw_aff *pw_aff_union_min(__isl_take isl_pw_aff *pwaff1,
1365 __isl_take isl_pw_aff *pwaff2)
1366 {
1367 return pw_aff_union_opt(pwaff1, pwaff2, &isl_aff_le_basic_set);
1368 }
1369
1370 __isl_give isl_pw_aff *isl_pw_aff_union_min(__isl_take isl_pw_aff *pwaff1,
1371 __isl_take isl_pw_aff *pwaff2)
1372 {
1373 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2,
1374 &pw_aff_union_min);
1375 }
1376
1377 __isl_give isl_pw_aff *isl_pw_aff_union_opt(__isl_take isl_pw_aff *pwaff1,
1378 __isl_take isl_pw_aff *pwaff2, int max)
1379 {
1380 if (max)
1381 return isl_pw_aff_union_max(pwaff1, pwaff2);
1382 else
1383 return isl_pw_aff_union_min(pwaff1, pwaff2);
1384 }
1385
1386 /* Construct a map with as domain the domain of pwaff and
1387 * one-dimensional range corresponding to the affine expressions.
1388 */
1389 static __isl_give isl_map *map_from_pw_aff(__isl_take isl_pw_aff *pwaff)
1390 {
1391 int i;
1392 isl_space *dim;
1393 isl_map *map;
1394
1395 if (!pwaff)
1396 return NULL;
1397
1398 dim = isl_pw_aff_get_space(pwaff);
1399 map = isl_map_empty(dim);
1400
1401 for (i = 0; i < pwaff->n; ++i) {
1402 isl_basic_map *bmap;
1403 isl_map *map_i;
1404
1405 bmap = isl_basic_map_from_aff(isl_aff_copy(pwaff->p[i].aff));
1406 map_i = isl_map_from_basic_map(bmap);
1407 map_i = isl_map_intersect_domain(map_i,
1408 isl_set_copy(pwaff->p[i].set));
1409 map = isl_map_union_disjoint(map, map_i);
1410 }
1411
1412 isl_pw_aff_free(pwaff);
1413
1414 return map;
1415 }
1416
1417 /* Construct a map with as domain the domain of pwaff and
1418 * one-dimensional range corresponding to the affine expressions.
1419 */
1420 __isl_give isl_map *isl_map_from_pw_aff(__isl_take isl_pw_aff *pwaff)
1421 {
1422 if (!pwaff)
1423 return NULL;
1424 if (isl_space_is_set(pwaff->dim))
1425 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
1426 "space of input is not a map",
1427 return isl_pw_aff_free(pwaff));
1428 return map_from_pw_aff(pwaff);
1429 }
1430
1431 /* Construct a one-dimensional set with as parameter domain
1432 * the domain of pwaff and the single set dimension
1433 * corresponding to the affine expressions.
1434 */
1435 __isl_give isl_set *isl_set_from_pw_aff(__isl_take isl_pw_aff *pwaff)
1436 {
1437 if (!pwaff)
1438 return NULL;
1439 if (!isl_space_is_set(pwaff->dim))
1440 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
1441 "space of input is not a set",
1442 return isl_pw_aff_free(pwaff));
1443 return map_from_pw_aff(pwaff);
1444 }
1445
1446 /* Return a set containing those elements in the domain
1447 * of pwaff where it is non-negative.
1448 */
1449 __isl_give isl_set *isl_pw_aff_nonneg_set(__isl_take isl_pw_aff *pwaff)
1450 {
1451 int i;
1452 isl_set *set;
1453
1454 if (!pwaff)
1455 return NULL;
1456
1457 set = isl_set_empty(isl_pw_aff_get_domain_space(pwaff));
1458
1459 for (i = 0; i < pwaff->n; ++i) {
1460 isl_basic_set *bset;
1461 isl_set *set_i;
1462
1463 bset = isl_aff_nonneg_basic_set(isl_aff_copy(pwaff->p[i].aff));
1464 set_i = isl_set_from_basic_set(bset);
1465 set_i = isl_set_intersect(set_i, isl_set_copy(pwaff->p[i].set));
1466 set = isl_set_union_disjoint(set, set_i);
1467 }
1468
1469 isl_pw_aff_free(pwaff);
1470
1471 return set;
1472 }
1473
1474 /* Return a set containing those elements in the domain
1475 * of pwaff where it is zero.
1476 */
1477 __isl_give isl_set *isl_pw_aff_zero_set(__isl_take isl_pw_aff *pwaff)
1478 {
1479 int i;
1480 isl_set *set;
1481
1482 if (!pwaff)
1483 return NULL;
1484
1485 set = isl_set_empty(isl_pw_aff_get_domain_space(pwaff));
1486
1487 for (i = 0; i < pwaff->n; ++i) {
1488 isl_basic_set *bset;
1489 isl_set *set_i;
1490
1491 bset = isl_aff_zero_basic_set(isl_aff_copy(pwaff->p[i].aff));
1492 set_i = isl_set_from_basic_set(bset);
1493 set_i = isl_set_intersect(set_i, isl_set_copy(pwaff->p[i].set));
1494 set = isl_set_union_disjoint(set, set_i);
1495 }
1496
1497 isl_pw_aff_free(pwaff);
1498
1499 return set;
1500 }
1501
1502 /* Return a set containing those elements in the domain
1503 * of pwaff where it is not zero.
1504 */
1505 __isl_give isl_set *isl_pw_aff_non_zero_set(__isl_take isl_pw_aff *pwaff)
1506 {
1507 return isl_set_complement(isl_pw_aff_zero_set(pwaff));
1508 }
1509
1510 /* Return a set containing those elements in the shared domain
1511 * of pwaff1 and pwaff2 where pwaff1 is greater than (or equal) to pwaff2.
1512 *
1513 * We compute the difference on the shared domain and then construct
1514 * the set of values where this difference is non-negative.
1515 * If strict is set, we first subtract 1 from the difference.
1516 * If equal is set, we only return the elements where pwaff1 and pwaff2
1517 * are equal.
1518 */
1519 static __isl_give isl_set *pw_aff_gte_set(__isl_take isl_pw_aff *pwaff1,
1520 __isl_take isl_pw_aff *pwaff2, int strict, int equal)
1521 {
1522 isl_set *set1, *set2;
1523
1524 set1 = isl_pw_aff_domain(isl_pw_aff_copy(pwaff1));
1525 set2 = isl_pw_aff_domain(isl_pw_aff_copy(pwaff2));
1526 set1 = isl_set_intersect(set1, set2);
1527 pwaff1 = isl_pw_aff_intersect_domain(pwaff1, isl_set_copy(set1));
1528 pwaff2 = isl_pw_aff_intersect_domain(pwaff2, isl_set_copy(set1));
1529 pwaff1 = isl_pw_aff_add(pwaff1, isl_pw_aff_neg(pwaff2));
1530
1531 if (strict) {
1532 isl_space *dim = isl_set_get_space(set1);
1533 isl_aff *aff;
1534 aff = isl_aff_zero_on_domain(isl_local_space_from_space(dim));
1535 aff = isl_aff_add_constant_si(aff, -1);
1536 pwaff1 = isl_pw_aff_add(pwaff1, isl_pw_aff_alloc(set1, aff));
1537 } else
1538 isl_set_free(set1);
1539
1540 if (equal)
1541 return isl_pw_aff_zero_set(pwaff1);
1542 return isl_pw_aff_nonneg_set(pwaff1);
1543 }
1544
1545 /* Return a set containing those elements in the shared domain
1546 * of pwaff1 and pwaff2 where pwaff1 is equal to pwaff2.
1547 */
1548 static __isl_give isl_set *pw_aff_eq_set(__isl_take isl_pw_aff *pwaff1,
1549 __isl_take isl_pw_aff *pwaff2)
1550 {
1551 return pw_aff_gte_set(pwaff1, pwaff2, 0, 1);
1552 }
1553
1554 __isl_give isl_set *isl_pw_aff_eq_set(__isl_take isl_pw_aff *pwaff1,
1555 __isl_take isl_pw_aff *pwaff2)
1556 {
1557 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_eq_set);
1558 }
1559
1560 /* Return a set containing those elements in the shared domain
1561 * of pwaff1 and pwaff2 where pwaff1 is greater than or equal to pwaff2.
1562 */
1563 static __isl_give isl_set *pw_aff_ge_set(__isl_take isl_pw_aff *pwaff1,
1564 __isl_take isl_pw_aff *pwaff2)
1565 {
1566 return pw_aff_gte_set(pwaff1, pwaff2, 0, 0);
1567 }
1568
1569 __isl_give isl_set *isl_pw_aff_ge_set(__isl_take isl_pw_aff *pwaff1,
1570 __isl_take isl_pw_aff *pwaff2)
1571 {
1572 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_ge_set);
1573 }
1574
1575 /* Return a set containing those elements in the shared domain
1576 * of pwaff1 and pwaff2 where pwaff1 is strictly greater than pwaff2.
1577 */
1578 static __isl_give isl_set *pw_aff_gt_set(__isl_take isl_pw_aff *pwaff1,
1579 __isl_take isl_pw_aff *pwaff2)
1580 {
1581 return pw_aff_gte_set(pwaff1, pwaff2, 1, 0);
1582 }
1583
1584 __isl_give isl_set *isl_pw_aff_gt_set(__isl_take isl_pw_aff *pwaff1,
1585 __isl_take isl_pw_aff *pwaff2)
1586 {
1587 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_gt_set);
1588 }
1589
1590 __isl_give isl_set *isl_pw_aff_le_set(__isl_take isl_pw_aff *pwaff1,
1591 __isl_take isl_pw_aff *pwaff2)
1592 {
1593 return isl_pw_aff_ge_set(pwaff2, pwaff1);
1594 }
1595
1596 __isl_give isl_set *isl_pw_aff_lt_set(__isl_take isl_pw_aff *pwaff1,
1597 __isl_take isl_pw_aff *pwaff2)
1598 {
1599 return isl_pw_aff_gt_set(pwaff2, pwaff1);
1600 }
1601
1602 /* Return a set containing those elements in the shared domain
1603 * of the elements of list1 and list2 where each element in list1
1604 * has the relation specified by "fn" with each element in list2.
1605 */
1606 static __isl_give isl_set *pw_aff_list_set(__isl_take isl_pw_aff_list *list1,
1607 __isl_take isl_pw_aff_list *list2,
1608 __isl_give isl_set *(*fn)(__isl_take isl_pw_aff *pwaff1,
1609 __isl_take isl_pw_aff *pwaff2))
1610 {
1611 int i, j;
1612 isl_ctx *ctx;
1613 isl_set *set;
1614
1615 if (!list1 || !list2)
1616 goto error;
1617
1618 ctx = isl_pw_aff_list_get_ctx(list1);
1619 if (list1->n < 1 || list2->n < 1)
1620 isl_die(ctx, isl_error_invalid,
1621 "list should contain at least one element", goto error);
1622
1623 set = isl_set_universe(isl_pw_aff_get_domain_space(list1->p[0]));
1624 for (i = 0; i < list1->n; ++i)
1625 for (j = 0; j < list2->n; ++j) {
1626 isl_set *set_ij;
1627
1628 set_ij = fn(isl_pw_aff_copy(list1->p[i]),
1629 isl_pw_aff_copy(list2->p[j]));
1630 set = isl_set_intersect(set, set_ij);
1631 }
1632
1633 isl_pw_aff_list_free(list1);
1634 isl_pw_aff_list_free(list2);
1635 return set;
1636 error:
1637 isl_pw_aff_list_free(list1);
1638 isl_pw_aff_list_free(list2);
1639 return NULL;
1640 }
1641
1642 /* Return a set containing those elements in the shared domain
1643 * of the elements of list1 and list2 where each element in list1
1644 * is equal to each element in list2.
1645 */
1646 __isl_give isl_set *isl_pw_aff_list_eq_set(__isl_take isl_pw_aff_list *list1,
1647 __isl_take isl_pw_aff_list *list2)
1648 {
1649 return pw_aff_list_set(list1, list2, &isl_pw_aff_eq_set);
1650 }
1651
1652 __isl_give isl_set *isl_pw_aff_list_ne_set(__isl_take isl_pw_aff_list *list1,
1653 __isl_take isl_pw_aff_list *list2)
1654 {
1655 return pw_aff_list_set(list1, list2, &isl_pw_aff_ne_set);
1656 }
1657
1658 /* Return a set containing those elements in the shared domain
1659 * of the elements of list1 and list2 where each element in list1
1660 * is less than or equal to each element in list2.
1661 */
1662 __isl_give isl_set *isl_pw_aff_list_le_set(__isl_take isl_pw_aff_list *list1,
1663 __isl_take isl_pw_aff_list *list2)
1664 {
1665 return pw_aff_list_set(list1, list2, &isl_pw_aff_le_set);
1666 }
1667
1668 __isl_give isl_set *isl_pw_aff_list_lt_set(__isl_take isl_pw_aff_list *list1,
1669 __isl_take isl_pw_aff_list *list2)
1670 {
1671 return pw_aff_list_set(list1, list2, &isl_pw_aff_lt_set);
1672 }
1673
1674 __isl_give isl_set *isl_pw_aff_list_ge_set(__isl_take isl_pw_aff_list *list1,
1675 __isl_take isl_pw_aff_list *list2)
1676 {
1677 return pw_aff_list_set(list1, list2, &isl_pw_aff_ge_set);
1678 }
1679
1680 __isl_give isl_set *isl_pw_aff_list_gt_set(__isl_take isl_pw_aff_list *list1,
1681 __isl_take isl_pw_aff_list *list2)
1682 {
1683 return pw_aff_list_set(list1, list2, &isl_pw_aff_gt_set);
1684 }
1685
1686
1687 /* Return a set containing those elements in the shared domain
1688 * of pwaff1 and pwaff2 where pwaff1 is not equal to pwaff2.
1689 */
1690 static __isl_give isl_set *pw_aff_ne_set(__isl_take isl_pw_aff *pwaff1,
1691 __isl_take isl_pw_aff *pwaff2)
1692 {
1693 isl_set *set_lt, *set_gt;
1694
1695 set_lt = isl_pw_aff_lt_set(isl_pw_aff_copy(pwaff1),
1696 isl_pw_aff_copy(pwaff2));
1697 set_gt = isl_pw_aff_gt_set(pwaff1, pwaff2);
1698 return isl_set_union_disjoint(set_lt, set_gt);
1699 }
1700
1701 __isl_give isl_set *isl_pw_aff_ne_set(__isl_take isl_pw_aff *pwaff1,
1702 __isl_take isl_pw_aff *pwaff2)
1703 {
1704 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_ne_set);
1705 }
1706
1707 __isl_give isl_pw_aff *isl_pw_aff_scale_down(__isl_take isl_pw_aff *pwaff,
1708 isl_int v)
1709 {
1710 int i;
1711
1712 if (isl_int_is_one(v))
1713 return pwaff;
1714 if (!isl_int_is_pos(v))
1715 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
1716 "factor needs to be positive",
1717 return isl_pw_aff_free(pwaff));
1718 pwaff = isl_pw_aff_cow(pwaff);
1719 if (!pwaff)
1720 return NULL;
1721 if (pwaff->n == 0)
1722 return pwaff;
1723
1724 for (i = 0; i < pwaff->n; ++i) {
1725 pwaff->p[i].aff = isl_aff_scale_down(pwaff->p[i].aff, v);
1726 if (!pwaff->p[i].aff)
1727 return isl_pw_aff_free(pwaff);
1728 }
1729
1730 return pwaff;
1731 }
1732
1733 __isl_give isl_pw_aff *isl_pw_aff_floor(__isl_take isl_pw_aff *pwaff)
1734 {
1735 int i;
1736
1737 pwaff = isl_pw_aff_cow(pwaff);
1738 if (!pwaff)
1739 return NULL;
1740 if (pwaff->n == 0)
1741 return pwaff;
1742
1743 for (i = 0; i < pwaff->n; ++i) {
1744 pwaff->p[i].aff = isl_aff_floor(pwaff->p[i].aff);
1745 if (!pwaff->p[i].aff)
1746 return isl_pw_aff_free(pwaff);
1747 }
1748
1749 return pwaff;
1750 }
1751
1752 __isl_give isl_pw_aff *isl_pw_aff_ceil(__isl_take isl_pw_aff *pwaff)
1753 {
1754 int i;
1755
1756 pwaff = isl_pw_aff_cow(pwaff);
1757 if (!pwaff)
1758 return NULL;
1759 if (pwaff->n == 0)
1760 return pwaff;
1761
1762 for (i = 0; i < pwaff->n; ++i) {
1763 pwaff->p[i].aff = isl_aff_ceil(pwaff->p[i].aff);
1764 if (!pwaff->p[i].aff)
1765 return isl_pw_aff_free(pwaff);
1766 }
1767
1768 return pwaff;
1769 }
1770
1771 /* Return an affine expression that is equal to pwaff_true for elements
1772 * in "cond" and to pwaff_false for elements not in "cond".
1773 * That is, return cond ? pwaff_true : pwaff_false;
1774 */
1775 __isl_give isl_pw_aff *isl_pw_aff_cond(__isl_take isl_set *cond,
1776 __isl_take isl_pw_aff *pwaff_true, __isl_take isl_pw_aff *pwaff_false)
1777 {
1778 isl_set *comp;
1779
1780 comp = isl_set_complement(isl_set_copy(cond));
1781 pwaff_true = isl_pw_aff_intersect_domain(pwaff_true, cond);
1782 pwaff_false = isl_pw_aff_intersect_domain(pwaff_false, comp);
1783
1784 return isl_pw_aff_add_disjoint(pwaff_true, pwaff_false);
1785 }
1786
1787 int isl_aff_is_cst(__isl_keep isl_aff *aff)
1788 {
1789 if (!aff)
1790 return -1;
1791
1792 return isl_seq_first_non_zero(aff->v->el + 2, aff->v->size - 2) == -1;
1793 }
1794
1795 /* Check whether pwaff is a piecewise constant.
1796 */
1797 int isl_pw_aff_is_cst(__isl_keep isl_pw_aff *pwaff)
1798 {
1799 int i;
1800
1801 if (!pwaff)
1802 return -1;
1803
1804 for (i = 0; i < pwaff->n; ++i) {
1805 int is_cst = isl_aff_is_cst(pwaff->p[i].aff);
1806 if (is_cst < 0 || !is_cst)
1807 return is_cst;
1808 }
1809
1810 return 1;
1811 }
1812
1813 __isl_give isl_aff *isl_aff_mul(__isl_take isl_aff *aff1,
1814 __isl_take isl_aff *aff2)
1815 {
1816 if (!isl_aff_is_cst(aff2) && isl_aff_is_cst(aff1))
1817 return isl_aff_mul(aff2, aff1);
1818
1819 if (!isl_aff_is_cst(aff2))
1820 isl_die(isl_aff_get_ctx(aff1), isl_error_invalid,
1821 "at least one affine expression should be constant",
1822 goto error);
1823
1824 aff1 = isl_aff_cow(aff1);
1825 if (!aff1 || !aff2)
1826 goto error;
1827
1828 aff1 = isl_aff_scale(aff1, aff2->v->el[1]);
1829 aff1 = isl_aff_scale_down(aff1, aff2->v->el[0]);
1830
1831 isl_aff_free(aff2);
1832 return aff1;
1833 error:
1834 isl_aff_free(aff1);
1835 isl_aff_free(aff2);
1836 return NULL;
1837 }
1838
1839 static __isl_give isl_pw_aff *pw_aff_add(__isl_take isl_pw_aff *pwaff1,
1840 __isl_take isl_pw_aff *pwaff2)
1841 {
1842 return isl_pw_aff_on_shared_domain(pwaff1, pwaff2, &isl_aff_add);
1843 }
1844
1845 __isl_give isl_pw_aff *isl_pw_aff_add(__isl_take isl_pw_aff *pwaff1,
1846 __isl_take isl_pw_aff *pwaff2)
1847 {
1848 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_add);
1849 }
1850
1851 __isl_give isl_pw_aff *isl_pw_aff_union_add(__isl_take isl_pw_aff *pwaff1,
1852 __isl_take isl_pw_aff *pwaff2)
1853 {
1854 return isl_pw_aff_union_add_(pwaff1, pwaff2);
1855 }
1856
1857 static __isl_give isl_pw_aff *pw_aff_mul(__isl_take isl_pw_aff *pwaff1,
1858 __isl_take isl_pw_aff *pwaff2)
1859 {
1860 return isl_pw_aff_on_shared_domain(pwaff1, pwaff2, &isl_aff_mul);
1861 }
1862
1863 __isl_give isl_pw_aff *isl_pw_aff_mul(__isl_take isl_pw_aff *pwaff1,
1864 __isl_take isl_pw_aff *pwaff2)
1865 {
1866 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_mul);
1867 }
1868
1869 static __isl_give isl_pw_aff *pw_aff_min(__isl_take isl_pw_aff *pwaff1,
1870 __isl_take isl_pw_aff *pwaff2)
1871 {
1872 isl_set *le;
1873
1874 le = isl_pw_aff_le_set(isl_pw_aff_copy(pwaff1),
1875 isl_pw_aff_copy(pwaff2));
1876 return isl_pw_aff_cond(le, pwaff1, pwaff2);
1877 }
1878
1879 __isl_give isl_pw_aff *isl_pw_aff_min(__isl_take isl_pw_aff *pwaff1,
1880 __isl_take isl_pw_aff *pwaff2)
1881 {
1882 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_min);
1883 }
1884
1885 static __isl_give isl_pw_aff *pw_aff_max(__isl_take isl_pw_aff *pwaff1,
1886 __isl_take isl_pw_aff *pwaff2)
1887 {
1888 isl_set *le;
1889
1890 le = isl_pw_aff_ge_set(isl_pw_aff_copy(pwaff1),
1891 isl_pw_aff_copy(pwaff2));
1892 return isl_pw_aff_cond(le, pwaff1, pwaff2);
1893 }
1894
1895 __isl_give isl_pw_aff *isl_pw_aff_max(__isl_take isl_pw_aff *pwaff1,
1896 __isl_take isl_pw_aff *pwaff2)
1897 {
1898 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_max);
1899 }
1900
1901 static __isl_give isl_pw_aff *pw_aff_list_reduce(
1902 __isl_take isl_pw_aff_list *list,
1903 __isl_give isl_pw_aff *(*fn)(__isl_take isl_pw_aff *pwaff1,
1904 __isl_take isl_pw_aff *pwaff2))
1905 {
1906 int i;
1907 isl_ctx *ctx;
1908 isl_pw_aff *res;
1909
1910 if (!list)
1911 return NULL;
1912
1913 ctx = isl_pw_aff_list_get_ctx(list);
1914 if (list->n < 1)
1915 isl_die(ctx, isl_error_invalid,
1916 "list should contain at least one element",
1917 return isl_pw_aff_list_free(list));
1918
1919 res = isl_pw_aff_copy(list->p[0]);
1920 for (i = 1; i < list->n; ++i)
1921 res = fn(res, isl_pw_aff_copy(list->p[i]));
1922
1923 isl_pw_aff_list_free(list);
1924 return res;
1925 }
1926
1927 /* Return an isl_pw_aff that maps each element in the intersection of the
1928 * domains of the elements of list to the minimal corresponding affine
1929 * expression.
1930 */
1931 __isl_give isl_pw_aff *isl_pw_aff_list_min(__isl_take isl_pw_aff_list *list)
1932 {
1933 return pw_aff_list_reduce(list, &isl_pw_aff_min);
1934 }
1935
1936 /* Return an isl_pw_aff that maps each element in the intersection of the
1937 * domains of the elements of list to the maximal corresponding affine
1938 * expression.
1939 */
1940 __isl_give isl_pw_aff *isl_pw_aff_list_max(__isl_take isl_pw_aff_list *list)
1941 {
1942 return pw_aff_list_reduce(list, &isl_pw_aff_max);
1943 }
1944
1945 #undef BASE
1946 #define BASE aff
1947
1948 #include <isl_multi_templ.c>
1949
1950 __isl_give isl_multi_aff *isl_multi_aff_add(__isl_take isl_multi_aff *maff1,
1951 __isl_take isl_multi_aff *maff2)
1952 {
1953 int i;
1954 isl_ctx *ctx;
1955
1956 maff1 = isl_multi_aff_cow(maff1);
1957 if (!maff1 || !maff2)
1958 goto error;
1959
1960 ctx = isl_multi_aff_get_ctx(maff1);
1961 if (!isl_space_is_equal(maff1->space, maff2->space))
1962 isl_die(ctx, isl_error_invalid,
1963 "spaces don't match", goto error);
1964
1965 for (i = 0; i < maff1->n; ++i) {
1966 maff1->p[i] = isl_aff_add(maff1->p[i],
1967 isl_aff_copy(maff2->p[i]));
1968 if (!maff1->p[i])
1969 goto error;
1970 }
1971
1972 isl_multi_aff_free(maff2);
1973 return maff1;
1974 error:
1975 isl_multi_aff_free(maff1);
1976 isl_multi_aff_free(maff2);
1977 return NULL;
1978 }
1979
1980 /* Exploit the equalities in "eq" to simplify the affine expressions.
1981 */
1982 static __isl_give isl_multi_aff *isl_multi_aff_substitute_equalities(
1983 __isl_take isl_multi_aff *maff, __isl_take isl_basic_set *eq)
1984 {
1985 int i;
1986
1987 maff = isl_multi_aff_cow(maff);
1988 if (!maff || !eq)
1989 goto error;
1990
1991 for (i = 0; i < maff->n; ++i) {
1992 maff->p[i] = isl_aff_substitute_equalities(maff->p[i],
1993 isl_basic_set_copy(eq));
1994 if (!maff->p[i])
1995 goto error;
1996 }
1997
1998 isl_basic_set_free(eq);
1999 return maff;
2000 error:
2001 isl_basic_set_free(eq);
2002 isl_multi_aff_free(maff);
2003 return NULL;
2004 }
2005
2006 __isl_give isl_multi_aff *isl_multi_aff_scale(__isl_take isl_multi_aff *maff,
2007 isl_int f)
2008 {
2009 int i;
2010
2011 maff = isl_multi_aff_cow(maff);
2012 if (!maff)
2013 return NULL;
2014
2015 for (i = 0; i < maff->n; ++i) {
2016 maff->p[i] = isl_aff_scale(maff->p[i], f);
2017 if (!maff->p[i])
2018 return isl_multi_aff_free(maff);
2019 }
2020
2021 return maff;
2022 }
2023
2024 __isl_give isl_multi_aff *isl_multi_aff_add_on_domain(__isl_keep isl_set *dom,
2025 __isl_take isl_multi_aff *maff1, __isl_take isl_multi_aff *maff2)
2026 {
2027 maff1 = isl_multi_aff_add(maff1, maff2);
2028 maff1 = isl_multi_aff_gist(maff1, isl_set_copy(dom));
2029 return maff1;
2030 }
2031
2032 int isl_multi_aff_is_empty(__isl_keep isl_multi_aff *maff)
2033 {
2034 if (!maff)
2035 return -1;
2036
2037 return 0;
2038 }
2039
2040 int isl_multi_aff_plain_is_equal(__isl_keep isl_multi_aff *maff1,
2041 __isl_keep isl_multi_aff *maff2)
2042 {
2043 int i;
2044 int equal;
2045
2046 if (!maff1 || !maff2)
2047 return -1;
2048 if (maff1->n != maff2->n)
2049 return 0;
2050 equal = isl_space_is_equal(maff1->space, maff2->space);
2051 if (equal < 0 || !equal)
2052 return equal;
2053
2054 for (i = 0; i < maff1->n; ++i) {
2055 equal = isl_aff_plain_is_equal(maff1->p[i], maff2->p[i]);
2056 if (equal < 0 || !equal)
2057 return equal;
2058 }
2059
2060 return 1;
2061 }
2062
2063 __isl_give isl_multi_aff *isl_multi_aff_set_dim_name(
2064 __isl_take isl_multi_aff *maff,
2065 enum isl_dim_type type, unsigned pos, const char *s)
2066 {
2067 int i;
2068
2069 maff = isl_multi_aff_cow(maff);
2070 if (!maff)
2071 return NULL;
2072
2073 maff->space = isl_space_set_dim_name(maff->space, type, pos, s);
2074 if (!maff->space)
2075 return isl_multi_aff_free(maff);
2076 for (i = 0; i < maff->n; ++i) {
2077 maff->p[i] = isl_aff_set_dim_name(maff->p[i], type, pos, s);
2078 if (!maff->p[i])
2079 return isl_multi_aff_free(maff);
2080 }
2081
2082 return maff;
2083 }
2084
2085 __isl_give isl_multi_aff *isl_multi_aff_drop_dims(__isl_take isl_multi_aff *maff,
2086 enum isl_dim_type type, unsigned first, unsigned n)
2087 {
2088 int i;
2089
2090 maff = isl_multi_aff_cow(maff);
2091 if (!maff)
2092 return NULL;
2093
2094 maff->space = isl_space_drop_dims(maff->space, type, first, n);
2095 if (!maff->space)
2096 return isl_multi_aff_free(maff);
2097 for (i = 0; i < maff->n; ++i) {
2098 maff->p[i] = isl_aff_drop_dims(maff->p[i], type, first, n);
2099 if (!maff->p[i])
2100 return isl_multi_aff_free(maff);
2101 }
2102
2103 return maff;
2104 }
2105
2106 #undef PW
2107 #define PW isl_pw_multi_aff
2108 #undef EL
2109 #define EL isl_multi_aff
2110 #undef EL_IS_ZERO
2111 #define EL_IS_ZERO is_empty
2112 #undef ZERO
2113 #define ZERO empty
2114 #undef IS_ZERO
2115 #define IS_ZERO is_empty
2116 #undef FIELD
2117 #define FIELD maff
2118 #undef DEFAULT_IS_ZERO
2119 #define DEFAULT_IS_ZERO 0
2120
2121 #define NO_NEG
2122 #define NO_EVAL
2123 #define NO_OPT
2124 #define NO_INVOLVES_DIMS
2125 #define NO_MOVE_DIMS
2126 #define NO_INSERT_DIMS
2127 #define NO_LIFT
2128 #define NO_MORPH
2129
2130 #include <isl_pw_templ.c>
2131
2132 static __isl_give isl_pw_multi_aff *pw_multi_aff_add(
2133 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
2134 {
2135 return isl_pw_multi_aff_on_shared_domain(pma1, pma2,
2136 &isl_multi_aff_add);
2137 }
2138
2139 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_add(
2140 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
2141 {
2142 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
2143 &pw_multi_aff_add);
2144 }
2145
2146 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_add(
2147 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
2148 {
2149 return isl_pw_multi_aff_union_add_(pma1, pma2);
2150 }
2151
2152 /* Construct a map mapping the domain the piecewise multi-affine expression
2153 * to its range, with each dimension in the range equated to the
2154 * corresponding affine expression on its cell.
2155 */
2156 __isl_give isl_map *isl_map_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma)
2157 {
2158 int i;
2159 isl_map *map;
2160
2161 if (!pma)
2162 return NULL;
2163
2164 map = isl_map_empty(isl_pw_multi_aff_get_space(pma));
2165
2166 for (i = 0; i < pma->n; ++i) {
2167 isl_multi_aff *maff;
2168 isl_basic_map *bmap;
2169 isl_map *map_i;
2170
2171 maff = isl_multi_aff_copy(pma->p[i].maff);
2172 bmap = isl_basic_map_from_multi_aff(maff);
2173 map_i = isl_map_from_basic_map(bmap);
2174 map_i = isl_map_intersect_domain(map_i,
2175 isl_set_copy(pma->p[i].set));
2176 map = isl_map_union_disjoint(map, map_i);
2177 }
2178
2179 isl_pw_multi_aff_free(pma);
2180 return map;
2181 }
2182
2183 __isl_give isl_set *isl_set_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma)
2184 {
2185 if (!isl_space_is_set(pma->dim))
2186 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
2187 "isl_pw_multi_aff cannot be converted into an isl_set",
2188 return isl_pw_multi_aff_free(pma));
2189
2190 return isl_map_from_pw_multi_aff(pma);
2191 }
2192
2193 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
2194 * This obivously only works if the input "map" is single-valued.
2195 * If so, we compute the lexicographic minimum of the image in the form
2196 * of an isl_pw_multi_aff. Since the image is unique, it is equal
2197 * to its lexicographic minimum.
2198 * If the input is not single-valued, we produce an error.
2199 */
2200 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_map(__isl_take isl_map *map)
2201 {
2202 int i;
2203 int sv;
2204 isl_pw_multi_aff *pma;
2205
2206 if (!map)
2207 return NULL;
2208
2209 sv = isl_map_is_single_valued(map);
2210 if (sv < 0)
2211 goto error;
2212 if (!sv)
2213 isl_die(isl_map_get_ctx(map), isl_error_invalid,
2214 "map is not single-valued", goto error);
2215 map = isl_map_make_disjoint(map);
2216 if (!map)
2217 return NULL;
2218
2219 pma = isl_pw_multi_aff_empty(isl_map_get_space(map));
2220
2221 for (i = 0; i < map->n; ++i) {
2222 isl_pw_multi_aff *pma_i;
2223 isl_basic_map *bmap;
2224 bmap = isl_basic_map_copy(map->p[i]);
2225 pma_i = isl_basic_map_lexmin_pw_multi_aff(bmap);
2226 pma = isl_pw_multi_aff_add_disjoint(pma, pma_i);
2227 }
2228
2229 isl_map_free(map);
2230 return pma;
2231 error:
2232 isl_map_free(map);
2233 return NULL;
2234 }
2235
2236 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_set(__isl_take isl_set *set)
2237 {
2238 return isl_pw_multi_aff_from_map(set);
2239 }
2240
2241 /* Plug in "subs" for dimension "type", "pos" of "aff".
2242 *
2243 * Let i be the dimension to replace and let "subs" be of the form
2244 *
2245 * f/d
2246 *
2247 * and "aff" of the form
2248 *
2249 * (a i + g)/m
2250 *
2251 * The result is
2252 *
2253 * floor((a f + d g')/(m d))
2254 *
2255 * where g' is the result of plugging in "subs" in each of the integer
2256 * divisions in g.
2257 */
2258 __isl_give isl_aff *isl_aff_substitute(__isl_take isl_aff *aff,
2259 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
2260 {
2261 isl_ctx *ctx;
2262 isl_int v;
2263
2264 aff = isl_aff_cow(aff);
2265 if (!aff || !subs)
2266 return isl_aff_free(aff);
2267
2268 ctx = isl_aff_get_ctx(aff);
2269 if (!isl_space_is_equal(aff->ls->dim, subs->ls->dim))
2270 isl_die(ctx, isl_error_invalid,
2271 "spaces don't match", return isl_aff_free(aff));
2272 if (isl_local_space_dim(subs->ls, isl_dim_div) != 0)
2273 isl_die(ctx, isl_error_unsupported,
2274 "cannot handle divs yet", return isl_aff_free(aff));
2275
2276 aff->ls = isl_local_space_substitute(aff->ls, type, pos, subs);
2277 if (!aff->ls)
2278 return isl_aff_free(aff);
2279
2280 aff->v = isl_vec_cow(aff->v);
2281 if (!aff->v)
2282 return isl_aff_free(aff);
2283
2284 pos += isl_local_space_offset(aff->ls, type);
2285
2286 isl_int_init(v);
2287 isl_int_set(v, aff->v->el[1 + pos]);
2288 isl_int_set_si(aff->v->el[1 + pos], 0);
2289 isl_seq_combine(aff->v->el + 1, subs->v->el[0], aff->v->el + 1,
2290 v, subs->v->el + 1, subs->v->size - 1);
2291 isl_int_mul(aff->v->el[0], aff->v->el[0], subs->v->el[0]);
2292 isl_int_clear(v);
2293
2294 return aff;
2295 }
2296
2297 /* Plug in "subs" for dimension "type", "pos" in each of the affine
2298 * expressions in "maff".
2299 */
2300 __isl_give isl_multi_aff *isl_multi_aff_substitute(
2301 __isl_take isl_multi_aff *maff, enum isl_dim_type type, unsigned pos,
2302 __isl_keep isl_aff *subs)
2303 {
2304 int i;
2305
2306 maff = isl_multi_aff_cow(maff);
2307 if (!maff || !subs)
2308 return isl_multi_aff_free(maff);
2309
2310 if (type == isl_dim_in)
2311 type = isl_dim_set;
2312
2313 for (i = 0; i < maff->n; ++i) {
2314 maff->p[i] = isl_aff_substitute(maff->p[i], type, pos, subs);
2315 if (!maff->p[i])
2316 return isl_multi_aff_free(maff);
2317 }
2318
2319 return maff;
2320 }
2321
2322 /* Plug in "subs" for dimension "type", "pos" of "pma".
2323 *
2324 * pma is of the form
2325 *
2326 * A_i(v) -> M_i(v)
2327 *
2328 * while subs is of the form
2329 *
2330 * v' = B_j(v) -> S_j
2331 *
2332 * Each pair i,j such that C_ij = A_i \cap B_i is non-empty
2333 * has a contribution in the result, in particular
2334 *
2335 * C_ij(S_j) -> M_i(S_j)
2336 *
2337 * Note that plugging in S_j in C_ij may also result in an empty set
2338 * and this contribution should simply be discarded.
2339 */
2340 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_substitute(
2341 __isl_take isl_pw_multi_aff *pma, enum isl_dim_type type, unsigned pos,
2342 __isl_keep isl_pw_aff *subs)
2343 {
2344 int i, j, n;
2345 isl_pw_multi_aff *res;
2346
2347 if (!pma || !subs)
2348 return isl_pw_multi_aff_free(pma);
2349
2350 n = pma->n * subs->n;
2351 res = isl_pw_multi_aff_alloc_size(isl_space_copy(pma->dim), n);
2352
2353 for (i = 0; i < pma->n; ++i) {
2354 for (j = 0; j < subs->n; ++j) {
2355 isl_set *common;
2356 isl_multi_aff *res_ij;
2357 common = isl_set_intersect(
2358 isl_set_copy(pma->p[i].set),
2359 isl_set_copy(subs->p[j].set));
2360 common = isl_set_substitute(common,
2361 type, pos, subs->p[j].aff);
2362 if (isl_set_plain_is_empty(common)) {
2363 isl_set_free(common);
2364 continue;
2365 }
2366
2367 res_ij = isl_multi_aff_substitute(
2368 isl_multi_aff_copy(pma->p[i].maff),
2369 type, pos, subs->p[j].aff);
2370
2371 res = isl_pw_multi_aff_add_piece(res, common, res_ij);
2372 }
2373 }
2374
2375 isl_pw_multi_aff_free(pma);
2376 return res;
2377 }
2378
2379 /* Extend the local space of "dst" to include the divs
2380 * in the local space of "src".
2381 */
2382 __isl_give isl_aff *isl_aff_align_divs(__isl_take isl_aff *dst,
2383 __isl_keep isl_aff *src)
2384 {
2385 isl_ctx *ctx;
2386 int *exp1 = NULL;
2387 int *exp2 = NULL;
2388 isl_mat *div;
2389
2390 if (!src || !dst)
2391 return isl_aff_free(dst);
2392
2393 ctx = isl_aff_get_ctx(src);
2394 if (!isl_space_is_equal(src->ls->dim, dst->ls->dim))
2395 isl_die(ctx, isl_error_invalid,
2396 "spaces don't match", goto error);
2397
2398 if (src->ls->div->n_row == 0)
2399 return dst;
2400
2401 exp1 = isl_alloc_array(ctx, int, src->ls->div->n_row);
2402 exp2 = isl_alloc_array(ctx, int, dst->ls->div->n_row);
2403 if (!exp1 || !exp2)
2404 goto error;
2405
2406 div = isl_merge_divs(src->ls->div, dst->ls->div, exp1, exp2);
2407 dst = isl_aff_expand_divs(dst, div, exp2);
2408 free(exp1);
2409 free(exp2);
2410
2411 return dst;
2412 error:
2413 free(exp1);
2414 free(exp2);
2415 return isl_aff_free(dst);
2416 }
2417
2418 /* Adjust the local spaces of the affine expressions in "maff"
2419 * such that they all have the save divs.
2420 */
2421 __isl_give isl_multi_aff *isl_multi_aff_align_divs(
2422 __isl_take isl_multi_aff *maff)
2423 {
2424 int i;
2425
2426 if (!maff)
2427 return NULL;
2428 if (maff->n == 0)
2429 return maff;
2430 maff = isl_multi_aff_cow(maff);
2431 if (!maff)
2432 return NULL;
2433
2434 for (i = 1; i < maff->n; ++i)
2435 maff->p[0] = isl_aff_align_divs(maff->p[0], maff->p[i]);
2436 for (i = 1; i < maff->n; ++i) {
2437 maff->p[i] = isl_aff_align_divs(maff->p[i], maff->p[0]);
2438 if (!maff->p[i])
2439 return isl_multi_aff_free(maff);
2440 }
2441
2442 return maff;
2443 }
2444
2445 __isl_give isl_aff *isl_aff_lift(__isl_take isl_aff *aff)
2446 {
2447 aff = isl_aff_cow(aff);
2448 if (!aff)
2449 return NULL;
2450
2451 aff->ls = isl_local_space_lift(aff->ls);
2452 if (!aff->ls)
2453 return isl_aff_free(aff);
2454
2455 return aff;
2456 }
2457
2458 /* Lift "maff" to a space with extra dimensions such that the result
2459 * has no more existentially quantified variables.
2460 * If "ls" is not NULL, then *ls is assigned the local space that lies
2461 * at the basis of the lifting applied to "maff".
2462 */
2463 __isl_give isl_multi_aff *isl_multi_aff_lift(__isl_take isl_multi_aff *maff,
2464 __isl_give isl_local_space **ls)
2465 {
2466 int i;
2467 isl_space *space;
2468 unsigned n_div;
2469
2470 if (ls)
2471 *ls = NULL;
2472
2473 if (!maff)
2474 return NULL;
2475
2476 if (maff->n == 0) {
2477 if (ls) {
2478 isl_space *space = isl_multi_aff_get_domain_space(maff);
2479 *ls = isl_local_space_from_space(space);
2480 if (!*ls)
2481 return isl_multi_aff_free(maff);
2482 }
2483 return maff;
2484 }
2485
2486 maff = isl_multi_aff_cow(maff);
2487 maff = isl_multi_aff_align_divs(maff);
2488 if (!maff)
2489 return NULL;
2490
2491 n_div = isl_aff_dim(maff->p[0], isl_dim_div);
2492 space = isl_multi_aff_get_space(maff);
2493 space = isl_space_lift(isl_space_domain(space), n_div);
2494 space = isl_space_extend_domain_with_range(space,
2495 isl_multi_aff_get_space(maff));
2496 if (!space)
2497 return isl_multi_aff_free(maff);
2498 isl_space_free(maff->space);
2499 maff->space = space;
2500
2501 if (ls) {
2502 *ls = isl_aff_get_domain_local_space(maff->p[0]);
2503 if (!*ls)
2504 return isl_multi_aff_free(maff);
2505 }
2506
2507 for (i = 0; i < maff->n; ++i) {
2508 maff->p[i] = isl_aff_lift(maff->p[i]);
2509 if (!maff->p[i])
2510 goto error;
2511 }
2512
2513 return maff;
2514 error:
2515 if (ls)
2516 isl_local_space_free(*ls);
2517 return isl_multi_aff_free(maff);
2518 }
2519
2520
2521 /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma".
2522 */
2523 __isl_give isl_pw_aff *isl_pw_multi_aff_get_pw_aff(
2524 __isl_keep isl_pw_multi_aff *pma, int pos)
2525 {
2526 int i;
2527 int n_out;
2528 isl_space *space;
2529 isl_pw_aff *pa;
2530
2531 if (!pma)
2532 return NULL;
2533
2534 n_out = isl_pw_multi_aff_dim(pma, isl_dim_out);
2535 if (pos < 0 || pos >= n_out)
2536 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
2537 "index out of bounds", return NULL);
2538
2539 space = isl_pw_multi_aff_get_space(pma);
2540 space = isl_space_drop_dims(space, isl_dim_out,
2541 pos + 1, n_out - pos - 1);
2542 space = isl_space_drop_dims(space, isl_dim_out, 0, pos);
2543
2544 pa = isl_pw_aff_alloc_size(space, pma->n);
2545 for (i = 0; i < pma->n; ++i) {
2546 isl_aff *aff;
2547 aff = isl_multi_aff_get_aff(pma->p[i].maff, pos);
2548 pa = isl_pw_aff_add_piece(pa, isl_set_copy(pma->p[i].set), aff);
2549 }
2550
2551 return pa;
2552 }
Integer set library