?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
isl_multi_aff_{add,sub}: align parameters
[isl.git] / isl_aff.c
blobba9d595ef59184cf2772e46690b2c6297105249d
1 /*
2 * Copyright 2011 INRIA Saclay
3 * Copyright 2011 Sven Verdoolaege
4 * Copyright 2012-2013 Ecole Normale Superieure
5 *
6 * Use of this software is governed by the MIT license
7 *
8 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
9 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
10 * 91893 Orsay, France
11 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
12 */
13
14 #include <isl_ctx_private.h>
15 #define ISL_DIM_H
16 #include <isl_map_private.h>
17 #include <isl_union_map_private.h>
18 #include <isl_aff_private.h>
19 #include <isl_space_private.h>
20 #include <isl_local_space_private.h>
21 #include <isl_vec_private.h>
22 #include <isl_mat_private.h>
23 #include <isl/constraint.h>
24 #include <isl_seq.h>
25 #include <isl/set.h>
26 #include <isl_val_private.h>
27 #include <isl/deprecated/aff_int.h>
28 #include <isl_config.h>
29
30 #undef BASE
31 #define BASE aff
32
33 #include <isl_list_templ.c>
34
35 #undef BASE
36 #define BASE pw_aff
37
38 #include <isl_list_templ.c>
39
40 __isl_give isl_aff *isl_aff_alloc_vec(__isl_take isl_local_space *ls,
41 __isl_take isl_vec *v)
42 {
43 isl_aff *aff;
44
45 if (!ls || !v)
46 goto error;
47
48 aff = isl_calloc_type(v->ctx, struct isl_aff);
49 if (!aff)
50 goto error;
51
52 aff->ref = 1;
53 aff->ls = ls;
54 aff->v = v;
55
56 return aff;
57 error:
58 isl_local_space_free(ls);
59 isl_vec_free(v);
60 return NULL;
61 }
62
63 __isl_give isl_aff *isl_aff_alloc(__isl_take isl_local_space *ls)
64 {
65 isl_ctx *ctx;
66 isl_vec *v;
67 unsigned total;
68
69 if (!ls)
70 return NULL;
71
72 ctx = isl_local_space_get_ctx(ls);
73 if (!isl_local_space_divs_known(ls))
74 isl_die(ctx, isl_error_invalid, "local space has unknown divs",
75 goto error);
76 if (!isl_local_space_is_set(ls))
77 isl_die(ctx, isl_error_invalid,
78 "domain of affine expression should be a set",
79 goto error);
80
81 total = isl_local_space_dim(ls, isl_dim_all);
82 v = isl_vec_alloc(ctx, 1 + 1 + total);
83 return isl_aff_alloc_vec(ls, v);
84 error:
85 isl_local_space_free(ls);
86 return NULL;
87 }
88
89 __isl_give isl_aff *isl_aff_zero_on_domain(__isl_take isl_local_space *ls)
90 {
91 isl_aff *aff;
92
93 aff = isl_aff_alloc(ls);
94 if (!aff)
95 return NULL;
96
97 isl_int_set_si(aff->v->el[0], 1);
98 isl_seq_clr(aff->v->el + 1, aff->v->size - 1);
99
100 return aff;
101 }
102
103 /* Return a piecewise affine expression defined on the specified domain
104 * that is equal to zero.
105 */
106 __isl_give isl_pw_aff *isl_pw_aff_zero_on_domain(__isl_take isl_local_space *ls)
107 {
108 return isl_pw_aff_from_aff(isl_aff_zero_on_domain(ls));
109 }
110
111 /* Return an affine expression that is equal to "val" on
112 * domain local space "ls".
113 */
114 __isl_give isl_aff *isl_aff_val_on_domain(__isl_take isl_local_space *ls,
115 __isl_take isl_val *val)
116 {
117 isl_aff *aff;
118
119 if (!ls || !val)
120 goto error;
121 if (!isl_val_is_rat(val))
122 isl_die(isl_val_get_ctx(val), isl_error_invalid,
123 "expecting rational value", goto error);
124
125 aff = isl_aff_alloc(isl_local_space_copy(ls));
126 if (!aff)
127 goto error;
128
129 isl_seq_clr(aff->v->el + 2, aff->v->size - 2);
130 isl_int_set(aff->v->el[1], val->n);
131 isl_int_set(aff->v->el[0], val->d);
132
133 isl_local_space_free(ls);
134 isl_val_free(val);
135 return aff;
136 error:
137 isl_local_space_free(ls);
138 isl_val_free(val);
139 return NULL;
140 }
141
142 /* Return an affine expression that is equal to the specified dimension
143 * in "ls".
144 */
145 __isl_give isl_aff *isl_aff_var_on_domain(__isl_take isl_local_space *ls,
146 enum isl_dim_type type, unsigned pos)
147 {
148 isl_space *space;
149 isl_aff *aff;
150
151 if (!ls)
152 return NULL;
153
154 space = isl_local_space_get_space(ls);
155 if (!space)
156 goto error;
157 if (isl_space_is_map(space))
158 isl_die(isl_space_get_ctx(space), isl_error_invalid,
159 "expecting (parameter) set space", goto error);
160 if (pos >= isl_local_space_dim(ls, type))
161 isl_die(isl_space_get_ctx(space), isl_error_invalid,
162 "position out of bounds", goto error);
163
164 isl_space_free(space);
165 aff = isl_aff_alloc(ls);
166 if (!aff)
167 return NULL;
168
169 pos += isl_local_space_offset(aff->ls, type);
170
171 isl_int_set_si(aff->v->el[0], 1);
172 isl_seq_clr(aff->v->el + 1, aff->v->size - 1);
173 isl_int_set_si(aff->v->el[1 + pos], 1);
174
175 return aff;
176 error:
177 isl_local_space_free(ls);
178 isl_space_free(space);
179 return NULL;
180 }
181
182 /* Return a piecewise affine expression that is equal to
183 * the specified dimension in "ls".
184 */
185 __isl_give isl_pw_aff *isl_pw_aff_var_on_domain(__isl_take isl_local_space *ls,
186 enum isl_dim_type type, unsigned pos)
187 {
188 return isl_pw_aff_from_aff(isl_aff_var_on_domain(ls, type, pos));
189 }
190
191 __isl_give isl_aff *isl_aff_copy(__isl_keep isl_aff *aff)
192 {
193 if (!aff)
194 return NULL;
195
196 aff->ref++;
197 return aff;
198 }
199
200 __isl_give isl_aff *isl_aff_dup(__isl_keep isl_aff *aff)
201 {
202 if (!aff)
203 return NULL;
204
205 return isl_aff_alloc_vec(isl_local_space_copy(aff->ls),
206 isl_vec_copy(aff->v));
207 }
208
209 __isl_give isl_aff *isl_aff_cow(__isl_take isl_aff *aff)
210 {
211 if (!aff)
212 return NULL;
213
214 if (aff->ref == 1)
215 return aff;
216 aff->ref--;
217 return isl_aff_dup(aff);
218 }
219
220 void *isl_aff_free(__isl_take isl_aff *aff)
221 {
222 if (!aff)
223 return NULL;
224
225 if (--aff->ref > 0)
226 return NULL;
227
228 isl_local_space_free(aff->ls);
229 isl_vec_free(aff->v);
230
231 free(aff);
232
233 return NULL;
234 }
235
236 isl_ctx *isl_aff_get_ctx(__isl_keep isl_aff *aff)
237 {
238 return aff ? isl_local_space_get_ctx(aff->ls) : NULL;
239 }
240
241 /* Externally, an isl_aff has a map space, but internally, the
242 * ls field corresponds to the domain of that space.
243 */
244 int isl_aff_dim(__isl_keep isl_aff *aff, enum isl_dim_type type)
245 {
246 if (!aff)
247 return 0;
248 if (type == isl_dim_out)
249 return 1;
250 if (type == isl_dim_in)
251 type = isl_dim_set;
252 return isl_local_space_dim(aff->ls, type);
253 }
254
255 __isl_give isl_space *isl_aff_get_domain_space(__isl_keep isl_aff *aff)
256 {
257 return aff ? isl_local_space_get_space(aff->ls) : NULL;
258 }
259
260 __isl_give isl_space *isl_aff_get_space(__isl_keep isl_aff *aff)
261 {
262 isl_space *space;
263 if (!aff)
264 return NULL;
265 space = isl_local_space_get_space(aff->ls);
266 space = isl_space_from_domain(space);
267 space = isl_space_add_dims(space, isl_dim_out, 1);
268 return space;
269 }
270
271 __isl_give isl_local_space *isl_aff_get_domain_local_space(
272 __isl_keep isl_aff *aff)
273 {
274 return aff ? isl_local_space_copy(aff->ls) : NULL;
275 }
276
277 __isl_give isl_local_space *isl_aff_get_local_space(__isl_keep isl_aff *aff)
278 {
279 isl_local_space *ls;
280 if (!aff)
281 return NULL;
282 ls = isl_local_space_copy(aff->ls);
283 ls = isl_local_space_from_domain(ls);
284 ls = isl_local_space_add_dims(ls, isl_dim_out, 1);
285 return ls;
286 }
287
288 /* Externally, an isl_aff has a map space, but internally, the
289 * ls field corresponds to the domain of that space.
290 */
291 const char *isl_aff_get_dim_name(__isl_keep isl_aff *aff,
292 enum isl_dim_type type, unsigned pos)
293 {
294 if (!aff)
295 return NULL;
296 if (type == isl_dim_out)
297 return NULL;
298 if (type == isl_dim_in)
299 type = isl_dim_set;
300 return isl_local_space_get_dim_name(aff->ls, type, pos);
301 }
302
303 __isl_give isl_aff *isl_aff_reset_domain_space(__isl_take isl_aff *aff,
304 __isl_take isl_space *dim)
305 {
306 aff = isl_aff_cow(aff);
307 if (!aff || !dim)
308 goto error;
309
310 aff->ls = isl_local_space_reset_space(aff->ls, dim);
311 if (!aff->ls)
312 return isl_aff_free(aff);
313
314 return aff;
315 error:
316 isl_aff_free(aff);
317 isl_space_free(dim);
318 return NULL;
319 }
320
321 /* Reset the space of "aff". This function is called from isl_pw_templ.c
322 * and doesn't know if the space of an element object is represented
323 * directly or through its domain. It therefore passes along both.
324 */
325 __isl_give isl_aff *isl_aff_reset_space_and_domain(__isl_take isl_aff *aff,
326 __isl_take isl_space *space, __isl_take isl_space *domain)
327 {
328 isl_space_free(space);
329 return isl_aff_reset_domain_space(aff, domain);
330 }
331
332 /* Reorder the coefficients of the affine expression based
333 * on the given reodering.
334 * The reordering r is assumed to have been extended with the local
335 * variables.
336 */
337 static __isl_give isl_vec *vec_reorder(__isl_take isl_vec *vec,
338 __isl_take isl_reordering *r, int n_div)
339 {
340 isl_vec *res;
341 int i;
342
343 if (!vec || !r)
344 goto error;
345
346 res = isl_vec_alloc(vec->ctx,
347 2 + isl_space_dim(r->dim, isl_dim_all) + n_div);
348 isl_seq_cpy(res->el, vec->el, 2);
349 isl_seq_clr(res->el + 2, res->size - 2);
350 for (i = 0; i < r->len; ++i)
351 isl_int_set(res->el[2 + r->pos[i]], vec->el[2 + i]);
352
353 isl_reordering_free(r);
354 isl_vec_free(vec);
355 return res;
356 error:
357 isl_vec_free(vec);
358 isl_reordering_free(r);
359 return NULL;
360 }
361
362 /* Reorder the dimensions of the domain of "aff" according
363 * to the given reordering.
364 */
365 __isl_give isl_aff *isl_aff_realign_domain(__isl_take isl_aff *aff,
366 __isl_take isl_reordering *r)
367 {
368 aff = isl_aff_cow(aff);
369 if (!aff)
370 goto error;
371
372 r = isl_reordering_extend(r, aff->ls->div->n_row);
373 aff->v = vec_reorder(aff->v, isl_reordering_copy(r),
374 aff->ls->div->n_row);
375 aff->ls = isl_local_space_realign(aff->ls, r);
376
377 if (!aff->v || !aff->ls)
378 return isl_aff_free(aff);
379
380 return aff;
381 error:
382 isl_aff_free(aff);
383 isl_reordering_free(r);
384 return NULL;
385 }
386
387 __isl_give isl_aff *isl_aff_align_params(__isl_take isl_aff *aff,
388 __isl_take isl_space *model)
389 {
390 if (!aff || !model)
391 goto error;
392
393 if (!isl_space_match(aff->ls->dim, isl_dim_param,
394 model, isl_dim_param)) {
395 isl_reordering *exp;
396
397 model = isl_space_drop_dims(model, isl_dim_in,
398 0, isl_space_dim(model, isl_dim_in));
399 model = isl_space_drop_dims(model, isl_dim_out,
400 0, isl_space_dim(model, isl_dim_out));
401 exp = isl_parameter_alignment_reordering(aff->ls->dim, model);
402 exp = isl_reordering_extend_space(exp,
403 isl_aff_get_domain_space(aff));
404 aff = isl_aff_realign_domain(aff, exp);
405 }
406
407 isl_space_free(model);
408 return aff;
409 error:
410 isl_space_free(model);
411 isl_aff_free(aff);
412 return NULL;
413 }
414
415 int isl_aff_plain_is_zero(__isl_keep isl_aff *aff)
416 {
417 if (!aff)
418 return -1;
419
420 return isl_seq_first_non_zero(aff->v->el + 1, aff->v->size - 1) < 0;
421 }
422
423 int isl_aff_plain_is_equal(__isl_keep isl_aff *aff1, __isl_keep isl_aff *aff2)
424 {
425 int equal;
426
427 if (!aff1 || !aff2)
428 return -1;
429
430 equal = isl_local_space_is_equal(aff1->ls, aff2->ls);
431 if (equal < 0 || !equal)
432 return equal;
433
434 return isl_vec_is_equal(aff1->v, aff2->v);
435 }
436
437 int isl_aff_get_denominator(__isl_keep isl_aff *aff, isl_int *v)
438 {
439 if (!aff)
440 return -1;
441 isl_int_set(*v, aff->v->el[0]);
442 return 0;
443 }
444
445 /* Return the common denominator of "aff".
446 */
447 __isl_give isl_val *isl_aff_get_denominator_val(__isl_keep isl_aff *aff)
448 {
449 isl_ctx *ctx;
450
451 if (!aff)
452 return NULL;
453
454 ctx = isl_aff_get_ctx(aff);
455 return isl_val_int_from_isl_int(ctx, aff->v->el[0]);
456 }
457
458 int isl_aff_get_constant(__isl_keep isl_aff *aff, isl_int *v)
459 {
460 if (!aff)
461 return -1;
462 isl_int_set(*v, aff->v->el[1]);
463 return 0;
464 }
465
466 /* Return the constant term of "aff".
467 */
468 __isl_give isl_val *isl_aff_get_constant_val(__isl_keep isl_aff *aff)
469 {
470 isl_ctx *ctx;
471 isl_val *v;
472
473 if (!aff)
474 return NULL;
475
476 ctx = isl_aff_get_ctx(aff);
477 v = isl_val_rat_from_isl_int(ctx, aff->v->el[1], aff->v->el[0]);
478 return isl_val_normalize(v);
479 }
480
481 int isl_aff_get_coefficient(__isl_keep isl_aff *aff,
482 enum isl_dim_type type, int pos, isl_int *v)
483 {
484 if (!aff)
485 return -1;
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 -1);
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 -1);
497
498 pos += isl_local_space_offset(aff->ls, type);
499 isl_int_set(*v, aff->v->el[1 + pos]);
500
501 return 0;
502 }
503
504 /* Return the coefficient of the variable of type "type" at position "pos"
505 * of "aff".
506 */
507 __isl_give isl_val *isl_aff_get_coefficient_val(__isl_keep isl_aff *aff,
508 enum isl_dim_type type, int pos)
509 {
510 isl_ctx *ctx;
511 isl_val *v;
512
513 if (!aff)
514 return NULL;
515
516 ctx = isl_aff_get_ctx(aff);
517 if (type == isl_dim_out)
518 isl_die(ctx, isl_error_invalid,
519 "output/set dimension does not have a coefficient",
520 return NULL);
521 if (type == isl_dim_in)
522 type = isl_dim_set;
523
524 if (pos >= isl_local_space_dim(aff->ls, type))
525 isl_die(ctx, isl_error_invalid,
526 "position out of bounds", return NULL);
527
528 pos += isl_local_space_offset(aff->ls, type);
529 v = isl_val_rat_from_isl_int(ctx, aff->v->el[1 + pos], aff->v->el[0]);
530 return isl_val_normalize(v);
531 }
532
533 __isl_give isl_aff *isl_aff_set_denominator(__isl_take isl_aff *aff, isl_int v)
534 {
535 aff = isl_aff_cow(aff);
536 if (!aff)
537 return NULL;
538
539 aff->v = isl_vec_cow(aff->v);
540 if (!aff->v)
541 return isl_aff_free(aff);
542
543 isl_int_set(aff->v->el[0], v);
544
545 return aff;
546 }
547
548 __isl_give isl_aff *isl_aff_set_constant(__isl_take isl_aff *aff, isl_int v)
549 {
550 aff = isl_aff_cow(aff);
551 if (!aff)
552 return NULL;
553
554 aff->v = isl_vec_cow(aff->v);
555 if (!aff->v)
556 return isl_aff_free(aff);
557
558 isl_int_set(aff->v->el[1], v);
559
560 return aff;
561 }
562
563 /* Replace the constant term of "aff" by "v".
564 */
565 __isl_give isl_aff *isl_aff_set_constant_val(__isl_take isl_aff *aff,
566 __isl_take isl_val *v)
567 {
568 if (!aff || !v)
569 goto error;
570
571 if (!isl_val_is_rat(v))
572 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
573 "expecting rational value", goto error);
574
575 if (isl_int_eq(aff->v->el[1], v->n) &&
576 isl_int_eq(aff->v->el[0], v->d)) {
577 isl_val_free(v);
578 return aff;
579 }
580
581 aff = isl_aff_cow(aff);
582 if (!aff)
583 goto error;
584 aff->v = isl_vec_cow(aff->v);
585 if (!aff->v)
586 goto error;
587
588 if (isl_int_eq(aff->v->el[0], v->d)) {
589 isl_int_set(aff->v->el[1], v->n);
590 } else if (isl_int_is_one(v->d)) {
591 isl_int_mul(aff->v->el[1], aff->v->el[0], v->n);
592 } else {
593 isl_seq_scale(aff->v->el + 1,
594 aff->v->el + 1, v->d, aff->v->size - 1);
595 isl_int_mul(aff->v->el[1], aff->v->el[0], v->n);
596 isl_int_mul(aff->v->el[0], aff->v->el[0], v->d);
597 aff->v = isl_vec_normalize(aff->v);
598 if (!aff->v)
599 goto error;
600 }
601
602 isl_val_free(v);
603 return aff;
604 error:
605 isl_aff_free(aff);
606 isl_val_free(v);
607 return NULL;
608 }
609
610 __isl_give isl_aff *isl_aff_add_constant(__isl_take isl_aff *aff, isl_int v)
611 {
612 if (isl_int_is_zero(v))
613 return aff;
614
615 aff = isl_aff_cow(aff);
616 if (!aff)
617 return NULL;
618
619 aff->v = isl_vec_cow(aff->v);
620 if (!aff->v)
621 return isl_aff_free(aff);
622
623 isl_int_addmul(aff->v->el[1], aff->v->el[0], v);
624
625 return aff;
626 }
627
628 /* Add "v" to the constant term of "aff".
629 */
630 __isl_give isl_aff *isl_aff_add_constant_val(__isl_take isl_aff *aff,
631 __isl_take isl_val *v)
632 {
633 if (!aff || !v)
634 goto error;
635
636 if (isl_val_is_zero(v)) {
637 isl_val_free(v);
638 return aff;
639 }
640
641 if (!isl_val_is_rat(v))
642 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
643 "expecting rational value", goto error);
644
645 aff = isl_aff_cow(aff);
646 if (!aff)
647 goto error;
648
649 aff->v = isl_vec_cow(aff->v);
650 if (!aff->v)
651 goto error;
652
653 if (isl_int_is_one(v->d)) {
654 isl_int_addmul(aff->v->el[1], aff->v->el[0], v->n);
655 } else if (isl_int_eq(aff->v->el[0], v->d)) {
656 isl_int_add(aff->v->el[1], aff->v->el[1], v->n);
657 aff->v = isl_vec_normalize(aff->v);
658 if (!aff->v)
659 goto error;
660 } else {
661 isl_seq_scale(aff->v->el + 1,
662 aff->v->el + 1, v->d, aff->v->size - 1);
663 isl_int_addmul(aff->v->el[1], aff->v->el[0], v->n);
664 isl_int_mul(aff->v->el[0], aff->v->el[0], v->d);
665 aff->v = isl_vec_normalize(aff->v);
666 if (!aff->v)
667 goto error;
668 }
669
670 isl_val_free(v);
671 return aff;
672 error:
673 isl_aff_free(aff);
674 isl_val_free(v);
675 return NULL;
676 }
677
678 __isl_give isl_aff *isl_aff_add_constant_si(__isl_take isl_aff *aff, int v)
679 {
680 isl_int t;
681
682 isl_int_init(t);
683 isl_int_set_si(t, v);
684 aff = isl_aff_add_constant(aff, t);
685 isl_int_clear(t);
686
687 return aff;
688 }
689
690 /* Add "v" to the numerator of the constant term of "aff".
691 */
692 __isl_give isl_aff *isl_aff_add_constant_num(__isl_take isl_aff *aff, isl_int v)
693 {
694 if (isl_int_is_zero(v))
695 return aff;
696
697 aff = isl_aff_cow(aff);
698 if (!aff)
699 return NULL;
700
701 aff->v = isl_vec_cow(aff->v);
702 if (!aff->v)
703 return isl_aff_free(aff);
704
705 isl_int_add(aff->v->el[1], aff->v->el[1], v);
706
707 return aff;
708 }
709
710 /* Add "v" to the numerator of the constant term of "aff".
711 */
712 __isl_give isl_aff *isl_aff_add_constant_num_si(__isl_take isl_aff *aff, int v)
713 {
714 isl_int t;
715
716 if (v == 0)
717 return aff;
718
719 isl_int_init(t);
720 isl_int_set_si(t, v);
721 aff = isl_aff_add_constant_num(aff, t);
722 isl_int_clear(t);
723
724 return aff;
725 }
726
727 __isl_give isl_aff *isl_aff_set_constant_si(__isl_take isl_aff *aff, int v)
728 {
729 aff = isl_aff_cow(aff);
730 if (!aff)
731 return NULL;
732
733 aff->v = isl_vec_cow(aff->v);
734 if (!aff->v)
735 return isl_aff_free(aff);
736
737 isl_int_set_si(aff->v->el[1], v);
738
739 return aff;
740 }
741
742 __isl_give isl_aff *isl_aff_set_coefficient(__isl_take isl_aff *aff,
743 enum isl_dim_type type, int pos, isl_int v)
744 {
745 if (!aff)
746 return NULL;
747
748 if (type == isl_dim_out)
749 isl_die(aff->v->ctx, isl_error_invalid,
750 "output/set dimension does not have a coefficient",
751 return isl_aff_free(aff));
752 if (type == isl_dim_in)
753 type = isl_dim_set;
754
755 if (pos >= isl_local_space_dim(aff->ls, type))
756 isl_die(aff->v->ctx, isl_error_invalid,
757 "position out of bounds", return isl_aff_free(aff));
758
759 aff = isl_aff_cow(aff);
760 if (!aff)
761 return NULL;
762
763 aff->v = isl_vec_cow(aff->v);
764 if (!aff->v)
765 return isl_aff_free(aff);
766
767 pos += isl_local_space_offset(aff->ls, type);
768 isl_int_set(aff->v->el[1 + pos], v);
769
770 return aff;
771 }
772
773 __isl_give isl_aff *isl_aff_set_coefficient_si(__isl_take isl_aff *aff,
774 enum isl_dim_type type, int pos, int v)
775 {
776 if (!aff)
777 return NULL;
778
779 if (type == isl_dim_out)
780 isl_die(aff->v->ctx, isl_error_invalid,
781 "output/set dimension does not have a coefficient",
782 return isl_aff_free(aff));
783 if (type == isl_dim_in)
784 type = isl_dim_set;
785
786 if (pos >= isl_local_space_dim(aff->ls, type))
787 isl_die(aff->v->ctx, isl_error_invalid,
788 "position out of bounds", return isl_aff_free(aff));
789
790 aff = isl_aff_cow(aff);
791 if (!aff)
792 return NULL;
793
794 aff->v = isl_vec_cow(aff->v);
795 if (!aff->v)
796 return isl_aff_free(aff);
797
798 pos += isl_local_space_offset(aff->ls, type);
799 isl_int_set_si(aff->v->el[1 + pos], v);
800
801 return aff;
802 }
803
804 /* Replace the coefficient of the variable of type "type" at position "pos"
805 * of "aff" by "v".
806 */
807 __isl_give isl_aff *isl_aff_set_coefficient_val(__isl_take isl_aff *aff,
808 enum isl_dim_type type, int pos, __isl_take isl_val *v)
809 {
810 if (!aff || !v)
811 goto error;
812
813 if (type == isl_dim_out)
814 isl_die(aff->v->ctx, isl_error_invalid,
815 "output/set dimension does not have a coefficient",
816 goto error);
817 if (type == isl_dim_in)
818 type = isl_dim_set;
819
820 if (pos >= isl_local_space_dim(aff->ls, type))
821 isl_die(aff->v->ctx, isl_error_invalid,
822 "position out of bounds", goto error);
823
824 if (!isl_val_is_rat(v))
825 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
826 "expecting rational value", goto error);
827
828 pos += isl_local_space_offset(aff->ls, type);
829 if (isl_int_eq(aff->v->el[1 + pos], v->n) &&
830 isl_int_eq(aff->v->el[0], v->d)) {
831 isl_val_free(v);
832 return aff;
833 }
834
835 aff = isl_aff_cow(aff);
836 if (!aff)
837 goto error;
838 aff->v = isl_vec_cow(aff->v);
839 if (!aff->v)
840 goto error;
841
842 if (isl_int_eq(aff->v->el[0], v->d)) {
843 isl_int_set(aff->v->el[1 + pos], v->n);
844 } else if (isl_int_is_one(v->d)) {
845 isl_int_mul(aff->v->el[1 + pos], aff->v->el[0], v->n);
846 } else {
847 isl_seq_scale(aff->v->el + 1,
848 aff->v->el + 1, v->d, aff->v->size - 1);
849 isl_int_mul(aff->v->el[1 + pos], aff->v->el[0], v->n);
850 isl_int_mul(aff->v->el[0], aff->v->el[0], v->d);
851 aff->v = isl_vec_normalize(aff->v);
852 if (!aff->v)
853 goto error;
854 }
855
856 isl_val_free(v);
857 return aff;
858 error:
859 isl_aff_free(aff);
860 isl_val_free(v);
861 return NULL;
862 }
863
864 __isl_give isl_aff *isl_aff_add_coefficient(__isl_take isl_aff *aff,
865 enum isl_dim_type type, int pos, isl_int v)
866 {
867 if (!aff)
868 return NULL;
869
870 if (type == isl_dim_out)
871 isl_die(aff->v->ctx, isl_error_invalid,
872 "output/set dimension does not have a coefficient",
873 return isl_aff_free(aff));
874 if (type == isl_dim_in)
875 type = isl_dim_set;
876
877 if (pos >= isl_local_space_dim(aff->ls, type))
878 isl_die(aff->v->ctx, isl_error_invalid,
879 "position out of bounds", return isl_aff_free(aff));
880
881 aff = isl_aff_cow(aff);
882 if (!aff)
883 return NULL;
884
885 aff->v = isl_vec_cow(aff->v);
886 if (!aff->v)
887 return isl_aff_free(aff);
888
889 pos += isl_local_space_offset(aff->ls, type);
890 isl_int_addmul(aff->v->el[1 + pos], aff->v->el[0], v);
891
892 return aff;
893 }
894
895 /* Add "v" to the coefficient of the variable of type "type"
896 * at position "pos" of "aff".
897 */
898 __isl_give isl_aff *isl_aff_add_coefficient_val(__isl_take isl_aff *aff,
899 enum isl_dim_type type, int pos, __isl_take isl_val *v)
900 {
901 if (!aff || !v)
902 goto error;
903
904 if (isl_val_is_zero(v)) {
905 isl_val_free(v);
906 return aff;
907 }
908
909 if (type == isl_dim_out)
910 isl_die(aff->v->ctx, isl_error_invalid,
911 "output/set dimension does not have a coefficient",
912 goto error);
913 if (type == isl_dim_in)
914 type = isl_dim_set;
915
916 if (pos >= isl_local_space_dim(aff->ls, type))
917 isl_die(aff->v->ctx, isl_error_invalid,
918 "position out of bounds", goto error);
919
920 if (!isl_val_is_rat(v))
921 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
922 "expecting rational value", goto error);
923
924 aff = isl_aff_cow(aff);
925 if (!aff)
926 goto error;
927
928 aff->v = isl_vec_cow(aff->v);
929 if (!aff->v)
930 goto error;
931
932 pos += isl_local_space_offset(aff->ls, type);
933 if (isl_int_is_one(v->d)) {
934 isl_int_addmul(aff->v->el[1 + pos], aff->v->el[0], v->n);
935 } else if (isl_int_eq(aff->v->el[0], v->d)) {
936 isl_int_add(aff->v->el[1 + pos], aff->v->el[1 + pos], v->n);
937 aff->v = isl_vec_normalize(aff->v);
938 if (!aff->v)
939 goto error;
940 } else {
941 isl_seq_scale(aff->v->el + 1,
942 aff->v->el + 1, v->d, aff->v->size - 1);
943 isl_int_addmul(aff->v->el[1 + pos], aff->v->el[0], v->n);
944 isl_int_mul(aff->v->el[0], aff->v->el[0], v->d);
945 aff->v = isl_vec_normalize(aff->v);
946 if (!aff->v)
947 goto error;
948 }
949
950 isl_val_free(v);
951 return aff;
952 error:
953 isl_aff_free(aff);
954 isl_val_free(v);
955 return NULL;
956 }
957
958 __isl_give isl_aff *isl_aff_add_coefficient_si(__isl_take isl_aff *aff,
959 enum isl_dim_type type, int pos, int v)
960 {
961 isl_int t;
962
963 isl_int_init(t);
964 isl_int_set_si(t, v);
965 aff = isl_aff_add_coefficient(aff, type, pos, t);
966 isl_int_clear(t);
967
968 return aff;
969 }
970
971 __isl_give isl_aff *isl_aff_get_div(__isl_keep isl_aff *aff, int pos)
972 {
973 if (!aff)
974 return NULL;
975
976 return isl_local_space_get_div(aff->ls, pos);
977 }
978
979 __isl_give isl_aff *isl_aff_neg(__isl_take isl_aff *aff)
980 {
981 aff = isl_aff_cow(aff);
982 if (!aff)
983 return NULL;
984 aff->v = isl_vec_cow(aff->v);
985 if (!aff->v)
986 return isl_aff_free(aff);
987
988 isl_seq_neg(aff->v->el + 1, aff->v->el + 1, aff->v->size - 1);
989
990 return aff;
991 }
992
993 /* Remove divs from the local space that do not appear in the affine
994 * expression.
995 * We currently only remove divs at the end.
996 * Some intermediate divs may also not appear directly in the affine
997 * expression, but we would also need to check that no other divs are
998 * defined in terms of them.
999 */
1000 __isl_give isl_aff *isl_aff_remove_unused_divs( __isl_take isl_aff *aff)
1001 {
1002 int pos;
1003 int off;
1004 int n;
1005
1006 if (!aff)
1007 return NULL;
1008
1009 n = isl_local_space_dim(aff->ls, isl_dim_div);
1010 off = isl_local_space_offset(aff->ls, isl_dim_div);
1011
1012 pos = isl_seq_last_non_zero(aff->v->el + 1 + off, n) + 1;
1013 if (pos == n)
1014 return aff;
1015
1016 aff = isl_aff_cow(aff);
1017 if (!aff)
1018 return NULL;
1019
1020 aff->ls = isl_local_space_drop_dims(aff->ls, isl_dim_div, pos, n - pos);
1021 aff->v = isl_vec_drop_els(aff->v, 1 + off + pos, n - pos);
1022 if (!aff->ls || !aff->v)
1023 return isl_aff_free(aff);
1024
1025 return aff;
1026 }
1027
1028 /* Given two affine expressions "p" of length p_len (including the
1029 * denominator and the constant term) and "subs" of length subs_len,
1030 * plug in "subs" for the variable at position "pos".
1031 * The variables of "subs" and "p" are assumed to match up to subs_len,
1032 * but "p" may have additional variables.
1033 * "v" is an initialized isl_int that can be used internally.
1034 *
1035 * In particular, if "p" represents the expression
1036 *
1037 * (a i + g)/m
1038 *
1039 * with i the variable at position "pos" and "subs" represents the expression
1040 *
1041 * f/d
1042 *
1043 * then the result represents the expression
1044 *
1045 * (a f + d g)/(m d)
1046 *
1047 */
1048 void isl_seq_substitute(isl_int *p, int pos, isl_int *subs,
1049 int p_len, int subs_len, isl_int v)
1050 {
1051 isl_int_set(v, p[1 + pos]);
1052 isl_int_set_si(p[1 + pos], 0);
1053 isl_seq_combine(p + 1, subs[0], p + 1, v, subs + 1, subs_len - 1);
1054 isl_seq_scale(p + subs_len, p + subs_len, subs[0], p_len - subs_len);
1055 isl_int_mul(p[0], p[0], subs[0]);
1056 }
1057
1058 /* Look for any divs in the aff->ls with a denominator equal to one
1059 * and plug them into the affine expression and any subsequent divs
1060 * that may reference the div.
1061 */
1062 static __isl_give isl_aff *plug_in_integral_divs(__isl_take isl_aff *aff)
1063 {
1064 int i, n;
1065 int len;
1066 isl_int v;
1067 isl_vec *vec;
1068 isl_local_space *ls;
1069 unsigned pos;
1070
1071 if (!aff)
1072 return NULL;
1073
1074 n = isl_local_space_dim(aff->ls, isl_dim_div);
1075 len = aff->v->size;
1076 for (i = 0; i < n; ++i) {
1077 if (!isl_int_is_one(aff->ls->div->row[i][0]))
1078 continue;
1079 ls = isl_local_space_copy(aff->ls);
1080 ls = isl_local_space_substitute_seq(ls, isl_dim_div, i,
1081 aff->ls->div->row[i], len, i + 1, n - (i + 1));
1082 vec = isl_vec_copy(aff->v);
1083 vec = isl_vec_cow(vec);
1084 if (!ls || !vec)
1085 goto error;
1086
1087 isl_int_init(v);
1088
1089 pos = isl_local_space_offset(aff->ls, isl_dim_div) + i;
1090 isl_seq_substitute(vec->el, pos, aff->ls->div->row[i],
1091 len, len, v);
1092
1093 isl_int_clear(v);
1094
1095 isl_vec_free(aff->v);
1096 aff->v = vec;
1097 isl_local_space_free(aff->ls);
1098 aff->ls = ls;
1099 }
1100
1101 return aff;
1102 error:
1103 isl_vec_free(vec);
1104 isl_local_space_free(ls);
1105 return isl_aff_free(aff);
1106 }
1107
1108 /* Look for any divs j that appear with a unit coefficient inside
1109 * the definitions of other divs i and plug them into the definitions
1110 * of the divs i.
1111 *
1112 * In particular, an expression of the form
1113 *
1114 * floor((f(..) + floor(g(..)/n))/m)
1115 *
1116 * is simplified to
1117 *
1118 * floor((n * f(..) + g(..))/(n * m))
1119 *
1120 * This simplification is correct because we can move the expression
1121 * f(..) into the inner floor in the original expression to obtain
1122 *
1123 * floor(floor((n * f(..) + g(..))/n)/m)
1124 *
1125 * from which we can derive the simplified expression.
1126 */
1127 static __isl_give isl_aff *plug_in_unit_divs(__isl_take isl_aff *aff)
1128 {
1129 int i, j, n;
1130 int off;
1131
1132 if (!aff)
1133 return NULL;
1134
1135 n = isl_local_space_dim(aff->ls, isl_dim_div);
1136 off = isl_local_space_offset(aff->ls, isl_dim_div);
1137 for (i = 1; i < n; ++i) {
1138 for (j = 0; j < i; ++j) {
1139 if (!isl_int_is_one(aff->ls->div->row[i][1 + off + j]))
1140 continue;
1141 aff->ls = isl_local_space_substitute_seq(aff->ls,
1142 isl_dim_div, j, aff->ls->div->row[j],
1143 aff->v->size, i, 1);
1144 if (!aff->ls)
1145 return isl_aff_free(aff);
1146 }
1147 }
1148
1149 return aff;
1150 }
1151
1152 /* Swap divs "a" and "b" in "aff", which is assumed to be non-NULL.
1153 *
1154 * Even though this function is only called on isl_affs with a single
1155 * reference, we are careful to only change aff->v and aff->ls together.
1156 */
1157 static __isl_give isl_aff *swap_div(__isl_take isl_aff *aff, int a, int b)
1158 {
1159 unsigned off = isl_local_space_offset(aff->ls, isl_dim_div);
1160 isl_local_space *ls;
1161 isl_vec *v;
1162
1163 ls = isl_local_space_copy(aff->ls);
1164 ls = isl_local_space_swap_div(ls, a, b);
1165 v = isl_vec_copy(aff->v);
1166 v = isl_vec_cow(v);
1167 if (!ls || !v)
1168 goto error;
1169
1170 isl_int_swap(v->el[1 + off + a], v->el[1 + off + b]);
1171 isl_vec_free(aff->v);
1172 aff->v = v;
1173 isl_local_space_free(aff->ls);
1174 aff->ls = ls;
1175
1176 return aff;
1177 error:
1178 isl_vec_free(v);
1179 isl_local_space_free(ls);
1180 return isl_aff_free(aff);
1181 }
1182
1183 /* Merge divs "a" and "b" in "aff", which is assumed to be non-NULL.
1184 *
1185 * We currently do not actually remove div "b", but simply add its
1186 * coefficient to that of "a" and then zero it out.
1187 */
1188 static __isl_give isl_aff *merge_divs(__isl_take isl_aff *aff, int a, int b)
1189 {
1190 unsigned off = isl_local_space_offset(aff->ls, isl_dim_div);
1191
1192 if (isl_int_is_zero(aff->v->el[1 + off + b]))
1193 return aff;
1194
1195 aff->v = isl_vec_cow(aff->v);
1196 if (!aff->v)
1197 return isl_aff_free(aff);
1198
1199 isl_int_add(aff->v->el[1 + off + a],
1200 aff->v->el[1 + off + a], aff->v->el[1 + off + b]);
1201 isl_int_set_si(aff->v->el[1 + off + b], 0);
1202
1203 return aff;
1204 }
1205
1206 /* Sort the divs in the local space of "aff" according to
1207 * the comparison function "cmp_row" in isl_local_space.c,
1208 * combining the coefficients of identical divs.
1209 *
1210 * Reordering divs does not change the semantics of "aff",
1211 * so there is no need to call isl_aff_cow.
1212 * Moreover, this function is currently only called on isl_affs
1213 * with a single reference.
1214 */
1215 static __isl_give isl_aff *sort_divs(__isl_take isl_aff *aff)
1216 {
1217 int i, j, n;
1218 unsigned off;
1219
1220 if (!aff)
1221 return NULL;
1222
1223 off = isl_local_space_offset(aff->ls, isl_dim_div);
1224 n = isl_aff_dim(aff, isl_dim_div);
1225 for (i = 1; i < n; ++i) {
1226 for (j = i - 1; j >= 0; --j) {
1227 int cmp = isl_mat_cmp_div(aff->ls->div, j, j + 1);
1228 if (cmp < 0)
1229 break;
1230 if (cmp == 0)
1231 aff = merge_divs(aff, j, j + 1);
1232 else
1233 aff = swap_div(aff, j, j + 1);
1234 if (!aff)
1235 return NULL;
1236 }
1237 }
1238
1239 return aff;
1240 }
1241
1242 /* Normalize the representation of "aff".
1243 *
1244 * This function should only be called of "new" isl_affs, i.e.,
1245 * with only a single reference. We therefore do not need to
1246 * worry about affecting other instances.
1247 */
1248 __isl_give isl_aff *isl_aff_normalize(__isl_take isl_aff *aff)
1249 {
1250 if (!aff)
1251 return NULL;
1252 aff->v = isl_vec_normalize(aff->v);
1253 if (!aff->v)
1254 return isl_aff_free(aff);
1255 aff = plug_in_integral_divs(aff);
1256 aff = plug_in_unit_divs(aff);
1257 aff = sort_divs(aff);
1258 aff = isl_aff_remove_unused_divs(aff);
1259 return aff;
1260 }
1261
1262 /* Given f, return floor(f).
1263 * If f is an integer expression, then just return f.
1264 * If f is a constant, then return the constant floor(f).
1265 * Otherwise, if f = g/m, write g = q m + r,
1266 * create a new div d = [r/m] and return the expression q + d.
1267 * The coefficients in r are taken to lie between -m/2 and m/2.
1268 */
1269 __isl_give isl_aff *isl_aff_floor(__isl_take isl_aff *aff)
1270 {
1271 int i;
1272 int size;
1273 isl_ctx *ctx;
1274 isl_vec *div;
1275
1276 if (!aff)
1277 return NULL;
1278
1279 if (isl_int_is_one(aff->v->el[0]))
1280 return aff;
1281
1282 aff = isl_aff_cow(aff);
1283 if (!aff)
1284 return NULL;
1285
1286 aff->v = isl_vec_cow(aff->v);
1287 if (!aff->v)
1288 return isl_aff_free(aff);
1289
1290 if (isl_aff_is_cst(aff)) {
1291 isl_int_fdiv_q(aff->v->el[1], aff->v->el[1], aff->v->el[0]);
1292 isl_int_set_si(aff->v->el[0], 1);
1293 return aff;
1294 }
1295
1296 div = isl_vec_copy(aff->v);
1297 div = isl_vec_cow(div);
1298 if (!div)
1299 return isl_aff_free(aff);
1300
1301 ctx = isl_aff_get_ctx(aff);
1302 isl_int_fdiv_q(aff->v->el[0], aff->v->el[0], ctx->two);
1303 for (i = 1; i < aff->v->size; ++i) {
1304 isl_int_fdiv_r(div->el[i], div->el[i], div->el[0]);
1305 isl_int_fdiv_q(aff->v->el[i], aff->v->el[i], div->el[0]);
1306 if (isl_int_gt(div->el[i], aff->v->el[0])) {
1307 isl_int_sub(div->el[i], div->el[i], div->el[0]);
1308 isl_int_add_ui(aff->v->el[i], aff->v->el[i], 1);
1309 }
1310 }
1311
1312 aff->ls = isl_local_space_add_div(aff->ls, div);
1313 if (!aff->ls)
1314 return isl_aff_free(aff);
1315
1316 size = aff->v->size;
1317 aff->v = isl_vec_extend(aff->v, size + 1);
1318 if (!aff->v)
1319 return isl_aff_free(aff);
1320 isl_int_set_si(aff->v->el[0], 1);
1321 isl_int_set_si(aff->v->el[size], 1);
1322
1323 aff = isl_aff_normalize(aff);
1324
1325 return aff;
1326 }
1327
1328 /* Compute
1329 *
1330 * aff mod m = aff - m * floor(aff/m)
1331 */
1332 __isl_give isl_aff *isl_aff_mod(__isl_take isl_aff *aff, isl_int m)
1333 {
1334 isl_aff *res;
1335
1336 res = isl_aff_copy(aff);
1337 aff = isl_aff_scale_down(aff, m);
1338 aff = isl_aff_floor(aff);
1339 aff = isl_aff_scale(aff, m);
1340 res = isl_aff_sub(res, aff);
1341
1342 return res;
1343 }
1344
1345 /* Compute
1346 *
1347 * aff mod m = aff - m * floor(aff/m)
1348 *
1349 * with m an integer value.
1350 */
1351 __isl_give isl_aff *isl_aff_mod_val(__isl_take isl_aff *aff,
1352 __isl_take isl_val *m)
1353 {
1354 isl_aff *res;
1355
1356 if (!aff || !m)
1357 goto error;
1358
1359 if (!isl_val_is_int(m))
1360 isl_die(isl_val_get_ctx(m), isl_error_invalid,
1361 "expecting integer modulo", goto error);
1362
1363 res = isl_aff_copy(aff);
1364 aff = isl_aff_scale_down_val(aff, isl_val_copy(m));
1365 aff = isl_aff_floor(aff);
1366 aff = isl_aff_scale_val(aff, m);
1367 res = isl_aff_sub(res, aff);
1368
1369 return res;
1370 error:
1371 isl_aff_free(aff);
1372 isl_val_free(m);
1373 return NULL;
1374 }
1375
1376 /* Compute
1377 *
1378 * pwaff mod m = pwaff - m * floor(pwaff/m)
1379 */
1380 __isl_give isl_pw_aff *isl_pw_aff_mod(__isl_take isl_pw_aff *pwaff, isl_int m)
1381 {
1382 isl_pw_aff *res;
1383
1384 res = isl_pw_aff_copy(pwaff);
1385 pwaff = isl_pw_aff_scale_down(pwaff, m);
1386 pwaff = isl_pw_aff_floor(pwaff);
1387 pwaff = isl_pw_aff_scale(pwaff, m);
1388 res = isl_pw_aff_sub(res, pwaff);
1389
1390 return res;
1391 }
1392
1393 /* Compute
1394 *
1395 * pa mod m = pa - m * floor(pa/m)
1396 *
1397 * with m an integer value.
1398 */
1399 __isl_give isl_pw_aff *isl_pw_aff_mod_val(__isl_take isl_pw_aff *pa,
1400 __isl_take isl_val *m)
1401 {
1402 if (!pa || !m)
1403 goto error;
1404 if (!isl_val_is_int(m))
1405 isl_die(isl_pw_aff_get_ctx(pa), isl_error_invalid,
1406 "expecting integer modulo", goto error);
1407 pa = isl_pw_aff_mod(pa, m->n);
1408 isl_val_free(m);
1409 return pa;
1410 error:
1411 isl_pw_aff_free(pa);
1412 isl_val_free(m);
1413 return NULL;
1414 }
1415
1416 /* Given f, return ceil(f).
1417 * If f is an integer expression, then just return f.
1418 * Otherwise, let f be the expression
1419 *
1420 * e/m
1421 *
1422 * then return
1423 *
1424 * floor((e + m - 1)/m)
1425 */
1426 __isl_give isl_aff *isl_aff_ceil(__isl_take isl_aff *aff)
1427 {
1428 if (!aff)
1429 return NULL;
1430
1431 if (isl_int_is_one(aff->v->el[0]))
1432 return aff;
1433
1434 aff = isl_aff_cow(aff);
1435 if (!aff)
1436 return NULL;
1437 aff->v = isl_vec_cow(aff->v);
1438 if (!aff->v)
1439 return isl_aff_free(aff);
1440
1441 isl_int_add(aff->v->el[1], aff->v->el[1], aff->v->el[0]);
1442 isl_int_sub_ui(aff->v->el[1], aff->v->el[1], 1);
1443 aff = isl_aff_floor(aff);
1444
1445 return aff;
1446 }
1447
1448 /* Apply the expansion computed by isl_merge_divs.
1449 * The expansion itself is given by "exp" while the resulting
1450 * list of divs is given by "div".
1451 */
1452 __isl_give isl_aff *isl_aff_expand_divs( __isl_take isl_aff *aff,
1453 __isl_take isl_mat *div, int *exp)
1454 {
1455 int i, j;
1456 int old_n_div;
1457 int new_n_div;
1458 int offset;
1459
1460 aff = isl_aff_cow(aff);
1461 if (!aff || !div)
1462 goto error;
1463
1464 old_n_div = isl_local_space_dim(aff->ls, isl_dim_div);
1465 new_n_div = isl_mat_rows(div);
1466 if (new_n_div < old_n_div)
1467 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
1468 "not an expansion", goto error);
1469
1470 aff->v = isl_vec_extend(aff->v, aff->v->size + new_n_div - old_n_div);
1471 if (!aff->v)
1472 goto error;
1473
1474 offset = 1 + isl_local_space_offset(aff->ls, isl_dim_div);
1475 j = old_n_div - 1;
1476 for (i = new_n_div - 1; i >= 0; --i) {
1477 if (j >= 0 && exp[j] == i) {
1478 if (i != j)
1479 isl_int_swap(aff->v->el[offset + i],
1480 aff->v->el[offset + j]);
1481 j--;
1482 } else
1483 isl_int_set_si(aff->v->el[offset + i], 0);
1484 }
1485
1486 aff->ls = isl_local_space_replace_divs(aff->ls, isl_mat_copy(div));
1487 if (!aff->ls)
1488 goto error;
1489 isl_mat_free(div);
1490 return aff;
1491 error:
1492 isl_aff_free(aff);
1493 isl_mat_free(div);
1494 return NULL;
1495 }
1496
1497 /* Add two affine expressions that live in the same local space.
1498 */
1499 static __isl_give isl_aff *add_expanded(__isl_take isl_aff *aff1,
1500 __isl_take isl_aff *aff2)
1501 {
1502 isl_int gcd, f;
1503
1504 aff1 = isl_aff_cow(aff1);
1505 if (!aff1 || !aff2)
1506 goto error;
1507
1508 aff1->v = isl_vec_cow(aff1->v);
1509 if (!aff1->v)
1510 goto error;
1511
1512 isl_int_init(gcd);
1513 isl_int_init(f);
1514 isl_int_gcd(gcd, aff1->v->el[0], aff2->v->el[0]);
1515 isl_int_divexact(f, aff2->v->el[0], gcd);
1516 isl_seq_scale(aff1->v->el + 1, aff1->v->el + 1, f, aff1->v->size - 1);
1517 isl_int_divexact(f, aff1->v->el[0], gcd);
1518 isl_seq_addmul(aff1->v->el + 1, f, aff2->v->el + 1, aff1->v->size - 1);
1519 isl_int_divexact(f, aff2->v->el[0], gcd);
1520 isl_int_mul(aff1->v->el[0], aff1->v->el[0], f);
1521 isl_int_clear(f);
1522 isl_int_clear(gcd);
1523
1524 isl_aff_free(aff2);
1525 return aff1;
1526 error:
1527 isl_aff_free(aff1);
1528 isl_aff_free(aff2);
1529 return NULL;
1530 }
1531
1532 __isl_give isl_aff *isl_aff_add(__isl_take isl_aff *aff1,
1533 __isl_take isl_aff *aff2)
1534 {
1535 isl_ctx *ctx;
1536 int *exp1 = NULL;
1537 int *exp2 = NULL;
1538 isl_mat *div;
1539 int n_div1, n_div2;
1540
1541 if (!aff1 || !aff2)
1542 goto error;
1543
1544 ctx = isl_aff_get_ctx(aff1);
1545 if (!isl_space_is_equal(aff1->ls->dim, aff2->ls->dim))
1546 isl_die(ctx, isl_error_invalid,
1547 "spaces don't match", goto error);
1548
1549 n_div1 = isl_aff_dim(aff1, isl_dim_div);
1550 n_div2 = isl_aff_dim(aff2, isl_dim_div);
1551 if (n_div1 == 0 && n_div2 == 0)
1552 return add_expanded(aff1, aff2);
1553
1554 exp1 = isl_alloc_array(ctx, int, n_div1);
1555 exp2 = isl_alloc_array(ctx, int, n_div2);
1556 if ((n_div1 && !exp1) || (n_div2 && !exp2))
1557 goto error;
1558
1559 div = isl_merge_divs(aff1->ls->div, aff2->ls->div, exp1, exp2);
1560 aff1 = isl_aff_expand_divs(aff1, isl_mat_copy(div), exp1);
1561 aff2 = isl_aff_expand_divs(aff2, div, exp2);
1562 free(exp1);
1563 free(exp2);
1564
1565 return add_expanded(aff1, aff2);
1566 error:
1567 free(exp1);
1568 free(exp2);
1569 isl_aff_free(aff1);
1570 isl_aff_free(aff2);
1571 return NULL;
1572 }
1573
1574 __isl_give isl_aff *isl_aff_sub(__isl_take isl_aff *aff1,
1575 __isl_take isl_aff *aff2)
1576 {
1577 return isl_aff_add(aff1, isl_aff_neg(aff2));
1578 }
1579
1580 __isl_give isl_aff *isl_aff_scale(__isl_take isl_aff *aff, isl_int f)
1581 {
1582 isl_int gcd;
1583
1584 if (isl_int_is_one(f))
1585 return aff;
1586
1587 aff = isl_aff_cow(aff);
1588 if (!aff)
1589 return NULL;
1590 aff->v = isl_vec_cow(aff->v);
1591 if (!aff->v)
1592 return isl_aff_free(aff);
1593
1594 if (isl_int_is_pos(f) && isl_int_is_divisible_by(aff->v->el[0], f)) {
1595 isl_int_divexact(aff->v->el[0], aff->v->el[0], f);
1596 return aff;
1597 }
1598
1599 isl_int_init(gcd);
1600 isl_int_gcd(gcd, aff->v->el[0], f);
1601 isl_int_divexact(aff->v->el[0], aff->v->el[0], gcd);
1602 isl_int_divexact(gcd, f, gcd);
1603 isl_seq_scale(aff->v->el + 1, aff->v->el + 1, gcd, aff->v->size - 1);
1604 isl_int_clear(gcd);
1605
1606 return aff;
1607 }
1608
1609 /* Multiple "aff" by "v".
1610 */
1611 __isl_give isl_aff *isl_aff_scale_val(__isl_take isl_aff *aff,
1612 __isl_take isl_val *v)
1613 {
1614 if (!aff || !v)
1615 goto error;
1616
1617 if (isl_val_is_one(v)) {
1618 isl_val_free(v);
1619 return aff;
1620 }
1621
1622 if (!isl_val_is_rat(v))
1623 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
1624 "expecting rational factor", goto error);
1625
1626 aff = isl_aff_scale(aff, v->n);
1627 aff = isl_aff_scale_down(aff, v->d);
1628
1629 isl_val_free(v);
1630 return aff;
1631 error:
1632 isl_aff_free(aff);
1633 isl_val_free(v);
1634 return NULL;
1635 }
1636
1637 __isl_give isl_aff *isl_aff_scale_down(__isl_take isl_aff *aff, isl_int f)
1638 {
1639 isl_int gcd;
1640
1641 if (isl_int_is_one(f))
1642 return aff;
1643
1644 aff = isl_aff_cow(aff);
1645 if (!aff)
1646 return NULL;
1647
1648 if (isl_int_is_zero(f))
1649 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
1650 "cannot scale down by zero", return isl_aff_free(aff));
1651
1652 aff->v = isl_vec_cow(aff->v);
1653 if (!aff->v)
1654 return isl_aff_free(aff);
1655
1656 isl_int_init(gcd);
1657 isl_seq_gcd(aff->v->el + 1, aff->v->size - 1, &gcd);
1658 isl_int_gcd(gcd, gcd, f);
1659 isl_seq_scale_down(aff->v->el + 1, aff->v->el + 1, gcd, aff->v->size - 1);
1660 isl_int_divexact(gcd, f, gcd);
1661 isl_int_mul(aff->v->el[0], aff->v->el[0], gcd);
1662 isl_int_clear(gcd);
1663
1664 return aff;
1665 }
1666
1667 /* Divide "aff" by "v".
1668 */
1669 __isl_give isl_aff *isl_aff_scale_down_val(__isl_take isl_aff *aff,
1670 __isl_take isl_val *v)
1671 {
1672 if (!aff || !v)
1673 goto error;
1674
1675 if (isl_val_is_one(v)) {
1676 isl_val_free(v);
1677 return aff;
1678 }
1679
1680 if (!isl_val_is_rat(v))
1681 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
1682 "expecting rational factor", goto error);
1683 if (!isl_val_is_pos(v))
1684 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
1685 "factor needs to be positive", goto error);
1686
1687 aff = isl_aff_scale(aff, v->d);
1688 aff = isl_aff_scale_down(aff, v->n);
1689
1690 isl_val_free(v);
1691 return aff;
1692 error:
1693 isl_aff_free(aff);
1694 isl_val_free(v);
1695 return NULL;
1696 }
1697
1698 __isl_give isl_aff *isl_aff_scale_down_ui(__isl_take isl_aff *aff, unsigned f)
1699 {
1700 isl_int v;
1701
1702 if (f == 1)
1703 return aff;
1704
1705 isl_int_init(v);
1706 isl_int_set_ui(v, f);
1707 aff = isl_aff_scale_down(aff, v);
1708 isl_int_clear(v);
1709
1710 return aff;
1711 }
1712
1713 __isl_give isl_aff *isl_aff_set_dim_name(__isl_take isl_aff *aff,
1714 enum isl_dim_type type, unsigned pos, const char *s)
1715 {
1716 aff = isl_aff_cow(aff);
1717 if (!aff)
1718 return NULL;
1719 if (type == isl_dim_out)
1720 isl_die(aff->v->ctx, isl_error_invalid,
1721 "cannot set name of output/set dimension",
1722 return isl_aff_free(aff));
1723 if (type == isl_dim_in)
1724 type = isl_dim_set;
1725 aff->ls = isl_local_space_set_dim_name(aff->ls, type, pos, s);
1726 if (!aff->ls)
1727 return isl_aff_free(aff);
1728
1729 return aff;
1730 }
1731
1732 __isl_give isl_aff *isl_aff_set_dim_id(__isl_take isl_aff *aff,
1733 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
1734 {
1735 aff = isl_aff_cow(aff);
1736 if (!aff)
1737 return isl_id_free(id);
1738 if (type == isl_dim_out)
1739 isl_die(aff->v->ctx, isl_error_invalid,
1740 "cannot set name of output/set dimension",
1741 goto error);
1742 if (type == isl_dim_in)
1743 type = isl_dim_set;
1744 aff->ls = isl_local_space_set_dim_id(aff->ls, type, pos, id);
1745 if (!aff->ls)
1746 return isl_aff_free(aff);
1747
1748 return aff;
1749 error:
1750 isl_id_free(id);
1751 isl_aff_free(aff);
1752 return NULL;
1753 }
1754
1755 /* Exploit the equalities in "eq" to simplify the affine expression
1756 * and the expressions of the integer divisions in the local space.
1757 * The integer divisions in this local space are assumed to appear
1758 * as regular dimensions in "eq".
1759 */
1760 static __isl_give isl_aff *isl_aff_substitute_equalities_lifted(
1761 __isl_take isl_aff *aff, __isl_take isl_basic_set *eq)
1762 {
1763 int i, j;
1764 unsigned total;
1765 unsigned n_div;
1766
1767 if (!eq)
1768 goto error;
1769 if (eq->n_eq == 0) {
1770 isl_basic_set_free(eq);
1771 return aff;
1772 }
1773
1774 aff = isl_aff_cow(aff);
1775 if (!aff)
1776 goto error;
1777
1778 aff->ls = isl_local_space_substitute_equalities(aff->ls,
1779 isl_basic_set_copy(eq));
1780 aff->v = isl_vec_cow(aff->v);
1781 if (!aff->ls || !aff->v)
1782 goto error;
1783
1784 total = 1 + isl_space_dim(eq->dim, isl_dim_all);
1785 n_div = eq->n_div;
1786 for (i = 0; i < eq->n_eq; ++i) {
1787 j = isl_seq_last_non_zero(eq->eq[i], total + n_div);
1788 if (j < 0 || j == 0 || j >= total)
1789 continue;
1790
1791 isl_seq_elim(aff->v->el + 1, eq->eq[i], j, total,
1792 &aff->v->el[0]);
1793 }
1794
1795 isl_basic_set_free(eq);
1796 aff = isl_aff_normalize(aff);
1797 return aff;
1798 error:
1799 isl_basic_set_free(eq);
1800 isl_aff_free(aff);
1801 return NULL;
1802 }
1803
1804 /* Exploit the equalities in "eq" to simplify the affine expression
1805 * and the expressions of the integer divisions in the local space.
1806 */
1807 static __isl_give isl_aff *isl_aff_substitute_equalities(
1808 __isl_take isl_aff *aff, __isl_take isl_basic_set *eq)
1809 {
1810 int n_div;
1811
1812 if (!aff || !eq)
1813 goto error;
1814 n_div = isl_local_space_dim(aff->ls, isl_dim_div);
1815 if (n_div > 0)
1816 eq = isl_basic_set_add_dims(eq, isl_dim_set, n_div);
1817 return isl_aff_substitute_equalities_lifted(aff, eq);
1818 error:
1819 isl_basic_set_free(eq);
1820 isl_aff_free(aff);
1821 return NULL;
1822 }
1823
1824 /* Look for equalities among the variables shared by context and aff
1825 * and the integer divisions of aff, if any.
1826 * The equalities are then used to eliminate coefficients and/or integer
1827 * divisions from aff.
1828 */
1829 __isl_give isl_aff *isl_aff_gist(__isl_take isl_aff *aff,
1830 __isl_take isl_set *context)
1831 {
1832 isl_basic_set *hull;
1833 int n_div;
1834
1835 if (!aff)
1836 goto error;
1837 n_div = isl_local_space_dim(aff->ls, isl_dim_div);
1838 if (n_div > 0) {
1839 isl_basic_set *bset;
1840 isl_local_space *ls;
1841 context = isl_set_add_dims(context, isl_dim_set, n_div);
1842 ls = isl_aff_get_domain_local_space(aff);
1843 bset = isl_basic_set_from_local_space(ls);
1844 bset = isl_basic_set_lift(bset);
1845 bset = isl_basic_set_flatten(bset);
1846 context = isl_set_intersect(context,
1847 isl_set_from_basic_set(bset));
1848 }
1849
1850 hull = isl_set_affine_hull(context);
1851 return isl_aff_substitute_equalities_lifted(aff, hull);
1852 error:
1853 isl_aff_free(aff);
1854 isl_set_free(context);
1855 return NULL;
1856 }
1857
1858 __isl_give isl_aff *isl_aff_gist_params(__isl_take isl_aff *aff,
1859 __isl_take isl_set *context)
1860 {
1861 isl_set *dom_context = isl_set_universe(isl_aff_get_domain_space(aff));
1862 dom_context = isl_set_intersect_params(dom_context, context);
1863 return isl_aff_gist(aff, dom_context);
1864 }
1865
1866 /* Return a basic set containing those elements in the space
1867 * of aff where it is non-negative.
1868 * If "rational" is set, then return a rational basic set.
1869 */
1870 static __isl_give isl_basic_set *aff_nonneg_basic_set(
1871 __isl_take isl_aff *aff, int rational)
1872 {
1873 isl_constraint *ineq;
1874 isl_basic_set *bset;
1875
1876 ineq = isl_inequality_from_aff(aff);
1877
1878 bset = isl_basic_set_from_constraint(ineq);
1879 if (rational)
1880 bset = isl_basic_set_set_rational(bset);
1881 bset = isl_basic_set_simplify(bset);
1882 return bset;
1883 }
1884
1885 /* Return a basic set containing those elements in the space
1886 * of aff where it is non-negative.
1887 */
1888 __isl_give isl_basic_set *isl_aff_nonneg_basic_set(__isl_take isl_aff *aff)
1889 {
1890 return aff_nonneg_basic_set(aff, 0);
1891 }
1892
1893 /* Return a basic set containing those elements in the domain space
1894 * of aff where it is negative.
1895 */
1896 __isl_give isl_basic_set *isl_aff_neg_basic_set(__isl_take isl_aff *aff)
1897 {
1898 aff = isl_aff_neg(aff);
1899 aff = isl_aff_add_constant_num_si(aff, -1);
1900 return isl_aff_nonneg_basic_set(aff);
1901 }
1902
1903 /* Return a basic set containing those elements in the space
1904 * of aff where it is zero.
1905 * If "rational" is set, then return a rational basic set.
1906 */
1907 static __isl_give isl_basic_set *aff_zero_basic_set(__isl_take isl_aff *aff,
1908 int rational)
1909 {
1910 isl_constraint *ineq;
1911 isl_basic_set *bset;
1912
1913 ineq = isl_equality_from_aff(aff);
1914
1915 bset = isl_basic_set_from_constraint(ineq);
1916 if (rational)
1917 bset = isl_basic_set_set_rational(bset);
1918 bset = isl_basic_set_simplify(bset);
1919 return bset;
1920 }
1921
1922 /* Return a basic set containing those elements in the space
1923 * of aff where it is zero.
1924 */
1925 __isl_give isl_basic_set *isl_aff_zero_basic_set(__isl_take isl_aff *aff)
1926 {
1927 return aff_zero_basic_set(aff, 0);
1928 }
1929
1930 /* Return a basic set containing those elements in the shared space
1931 * of aff1 and aff2 where aff1 is greater than or equal to aff2.
1932 */
1933 __isl_give isl_basic_set *isl_aff_ge_basic_set(__isl_take isl_aff *aff1,
1934 __isl_take isl_aff *aff2)
1935 {
1936 aff1 = isl_aff_sub(aff1, aff2);
1937
1938 return isl_aff_nonneg_basic_set(aff1);
1939 }
1940
1941 /* Return a basic set containing those elements in the shared space
1942 * of aff1 and aff2 where aff1 is smaller than or equal to aff2.
1943 */
1944 __isl_give isl_basic_set *isl_aff_le_basic_set(__isl_take isl_aff *aff1,
1945 __isl_take isl_aff *aff2)
1946 {
1947 return isl_aff_ge_basic_set(aff2, aff1);
1948 }
1949
1950 __isl_give isl_aff *isl_aff_add_on_domain(__isl_keep isl_set *dom,
1951 __isl_take isl_aff *aff1, __isl_take isl_aff *aff2)
1952 {
1953 aff1 = isl_aff_add(aff1, aff2);
1954 aff1 = isl_aff_gist(aff1, isl_set_copy(dom));
1955 return aff1;
1956 }
1957
1958 int isl_aff_is_empty(__isl_keep isl_aff *aff)
1959 {
1960 if (!aff)
1961 return -1;
1962
1963 return 0;
1964 }
1965
1966 /* Check whether the given affine expression has non-zero coefficient
1967 * for any dimension in the given range or if any of these dimensions
1968 * appear with non-zero coefficients in any of the integer divisions
1969 * involved in the affine expression.
1970 */
1971 int isl_aff_involves_dims(__isl_keep isl_aff *aff,
1972 enum isl_dim_type type, unsigned first, unsigned n)
1973 {
1974 int i;
1975 isl_ctx *ctx;
1976 int *active = NULL;
1977 int involves = 0;
1978
1979 if (!aff)
1980 return -1;
1981 if (n == 0)
1982 return 0;
1983
1984 ctx = isl_aff_get_ctx(aff);
1985 if (first + n > isl_aff_dim(aff, type))
1986 isl_die(ctx, isl_error_invalid,
1987 "range out of bounds", return -1);
1988
1989 active = isl_local_space_get_active(aff->ls, aff->v->el + 2);
1990 if (!active)
1991 goto error;
1992
1993 first += isl_local_space_offset(aff->ls, type) - 1;
1994 for (i = 0; i < n; ++i)
1995 if (active[first + i]) {
1996 involves = 1;
1997 break;
1998 }
1999
2000 free(active);
2001
2002 return involves;
2003 error:
2004 free(active);
2005 return -1;
2006 }
2007
2008 __isl_give isl_aff *isl_aff_drop_dims(__isl_take isl_aff *aff,
2009 enum isl_dim_type type, unsigned first, unsigned n)
2010 {
2011 isl_ctx *ctx;
2012
2013 if (!aff)
2014 return NULL;
2015 if (type == isl_dim_out)
2016 isl_die(aff->v->ctx, isl_error_invalid,
2017 "cannot drop output/set dimension",
2018 return isl_aff_free(aff));
2019 if (type == isl_dim_in)
2020 type = isl_dim_set;
2021 if (n == 0 && !isl_local_space_is_named_or_nested(aff->ls, type))
2022 return aff;
2023
2024 ctx = isl_aff_get_ctx(aff);
2025 if (first + n > isl_local_space_dim(aff->ls, type))
2026 isl_die(ctx, isl_error_invalid, "range out of bounds",
2027 return isl_aff_free(aff));
2028
2029 aff = isl_aff_cow(aff);
2030 if (!aff)
2031 return NULL;
2032
2033 aff->ls = isl_local_space_drop_dims(aff->ls, type, first, n);
2034 if (!aff->ls)
2035 return isl_aff_free(aff);
2036
2037 first += 1 + isl_local_space_offset(aff->ls, type);
2038 aff->v = isl_vec_drop_els(aff->v, first, n);
2039 if (!aff->v)
2040 return isl_aff_free(aff);
2041
2042 return aff;
2043 }
2044
2045 /* Project the domain of the affine expression onto its parameter space.
2046 * The affine expression may not involve any of the domain dimensions.
2047 */
2048 __isl_give isl_aff *isl_aff_project_domain_on_params(__isl_take isl_aff *aff)
2049 {
2050 isl_space *space;
2051 unsigned n;
2052 int involves;
2053
2054 n = isl_aff_dim(aff, isl_dim_in);
2055 involves = isl_aff_involves_dims(aff, isl_dim_in, 0, n);
2056 if (involves < 0)
2057 return isl_aff_free(aff);
2058 if (involves)
2059 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
2060 "affine expression involves some of the domain dimensions",
2061 return isl_aff_free(aff));
2062 aff = isl_aff_drop_dims(aff, isl_dim_in, 0, n);
2063 space = isl_aff_get_domain_space(aff);
2064 space = isl_space_params(space);
2065 aff = isl_aff_reset_domain_space(aff, space);
2066 return aff;
2067 }
2068
2069 __isl_give isl_aff *isl_aff_insert_dims(__isl_take isl_aff *aff,
2070 enum isl_dim_type type, unsigned first, unsigned n)
2071 {
2072 isl_ctx *ctx;
2073
2074 if (!aff)
2075 return NULL;
2076 if (type == isl_dim_out)
2077 isl_die(aff->v->ctx, isl_error_invalid,
2078 "cannot insert output/set dimensions",
2079 return isl_aff_free(aff));
2080 if (type == isl_dim_in)
2081 type = isl_dim_set;
2082 if (n == 0 && !isl_local_space_is_named_or_nested(aff->ls, type))
2083 return aff;
2084
2085 ctx = isl_aff_get_ctx(aff);
2086 if (first > isl_local_space_dim(aff->ls, type))
2087 isl_die(ctx, isl_error_invalid, "position out of bounds",
2088 return isl_aff_free(aff));
2089
2090 aff = isl_aff_cow(aff);
2091 if (!aff)
2092 return NULL;
2093
2094 aff->ls = isl_local_space_insert_dims(aff->ls, type, first, n);
2095 if (!aff->ls)
2096 return isl_aff_free(aff);
2097
2098 first += 1 + isl_local_space_offset(aff->ls, type);
2099 aff->v = isl_vec_insert_zero_els(aff->v, first, n);
2100 if (!aff->v)
2101 return isl_aff_free(aff);
2102
2103 return aff;
2104 }
2105
2106 __isl_give isl_aff *isl_aff_add_dims(__isl_take isl_aff *aff,
2107 enum isl_dim_type type, unsigned n)
2108 {
2109 unsigned pos;
2110
2111 pos = isl_aff_dim(aff, type);
2112
2113 return isl_aff_insert_dims(aff, type, pos, n);
2114 }
2115
2116 __isl_give isl_pw_aff *isl_pw_aff_add_dims(__isl_take isl_pw_aff *pwaff,
2117 enum isl_dim_type type, unsigned n)
2118 {
2119 unsigned pos;
2120
2121 pos = isl_pw_aff_dim(pwaff, type);
2122
2123 return isl_pw_aff_insert_dims(pwaff, type, pos, n);
2124 }
2125
2126 /* Move the "n" dimensions of "src_type" starting at "src_pos" of "aff"
2127 * to dimensions of "dst_type" at "dst_pos".
2128 *
2129 * We only support moving input dimensions to parameters and vice versa.
2130 */
2131 __isl_give isl_aff *isl_aff_move_dims(__isl_take isl_aff *aff,
2132 enum isl_dim_type dst_type, unsigned dst_pos,
2133 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2134 {
2135 unsigned g_dst_pos;
2136 unsigned g_src_pos;
2137
2138 if (!aff)
2139 return NULL;
2140 if (n == 0 &&
2141 !isl_local_space_is_named_or_nested(aff->ls, src_type) &&
2142 !isl_local_space_is_named_or_nested(aff->ls, dst_type))
2143 return aff;
2144
2145 if (dst_type == isl_dim_out || src_type == isl_dim_out)
2146 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
2147 "cannot move output/set dimension", isl_aff_free(aff));
2148 if (dst_type == isl_dim_div || src_type == isl_dim_div)
2149 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
2150 "cannot move divs", isl_aff_free(aff));
2151 if (dst_type == isl_dim_in)
2152 dst_type = isl_dim_set;
2153 if (src_type == isl_dim_in)
2154 src_type = isl_dim_set;
2155
2156 if (src_pos + n > isl_local_space_dim(aff->ls, src_type))
2157 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
2158 "range out of bounds", isl_aff_free(aff));
2159 if (dst_type == src_type)
2160 isl_die(isl_aff_get_ctx(aff), isl_error_unsupported,
2161 "moving dims within the same type not supported",
2162 isl_aff_free(aff));
2163
2164 aff = isl_aff_cow(aff);
2165 if (!aff)
2166 return NULL;
2167
2168 g_src_pos = 1 + isl_local_space_offset(aff->ls, src_type) + src_pos;
2169 g_dst_pos = 1 + isl_local_space_offset(aff->ls, dst_type) + dst_pos;
2170 if (dst_type > src_type)
2171 g_dst_pos -= n;
2172
2173 aff->v = isl_vec_move_els(aff->v, g_dst_pos, g_src_pos, n);
2174 aff->ls = isl_local_space_move_dims(aff->ls, dst_type, dst_pos,
2175 src_type, src_pos, n);
2176 if (!aff->v || !aff->ls)
2177 return isl_aff_free(aff);
2178
2179 aff = sort_divs(aff);
2180
2181 return aff;
2182 }
2183
2184 __isl_give isl_pw_aff *isl_pw_aff_from_aff(__isl_take isl_aff *aff)
2185 {
2186 isl_set *dom = isl_set_universe(isl_aff_get_domain_space(aff));
2187 return isl_pw_aff_alloc(dom, aff);
2188 }
2189
2190 #undef PW
2191 #define PW isl_pw_aff
2192 #undef EL
2193 #define EL isl_aff
2194 #undef EL_IS_ZERO
2195 #define EL_IS_ZERO is_empty
2196 #undef ZERO
2197 #define ZERO empty
2198 #undef IS_ZERO
2199 #define IS_ZERO is_empty
2200 #undef FIELD
2201 #define FIELD aff
2202 #undef DEFAULT_IS_ZERO
2203 #define DEFAULT_IS_ZERO 0
2204
2205 #define NO_EVAL
2206 #define NO_OPT
2207 #define NO_LIFT
2208 #define NO_MORPH
2209
2210 #include <isl_pw_templ.c>
2211
2212 static __isl_give isl_set *align_params_pw_pw_set_and(
2213 __isl_take isl_pw_aff *pwaff1, __isl_take isl_pw_aff *pwaff2,
2214 __isl_give isl_set *(*fn)(__isl_take isl_pw_aff *pwaff1,
2215 __isl_take isl_pw_aff *pwaff2))
2216 {
2217 if (!pwaff1 || !pwaff2)
2218 goto error;
2219 if (isl_space_match(pwaff1->dim, isl_dim_param,
2220 pwaff2->dim, isl_dim_param))
2221 return fn(pwaff1, pwaff2);
2222 if (!isl_space_has_named_params(pwaff1->dim) ||
2223 !isl_space_has_named_params(pwaff2->dim))
2224 isl_die(isl_pw_aff_get_ctx(pwaff1), isl_error_invalid,
2225 "unaligned unnamed parameters", goto error);
2226 pwaff1 = isl_pw_aff_align_params(pwaff1, isl_pw_aff_get_space(pwaff2));
2227 pwaff2 = isl_pw_aff_align_params(pwaff2, isl_pw_aff_get_space(pwaff1));
2228 return fn(pwaff1, pwaff2);
2229 error:
2230 isl_pw_aff_free(pwaff1);
2231 isl_pw_aff_free(pwaff2);
2232 return NULL;
2233 }
2234
2235 /* Compute a piecewise quasi-affine expression with a domain that
2236 * is the union of those of pwaff1 and pwaff2 and such that on each
2237 * cell, the quasi-affine expression is the better (according to cmp)
2238 * of those of pwaff1 and pwaff2. If only one of pwaff1 or pwaff2
2239 * is defined on a given cell, then the associated expression
2240 * is the defined one.
2241 */
2242 static __isl_give isl_pw_aff *pw_aff_union_opt(__isl_take isl_pw_aff *pwaff1,
2243 __isl_take isl_pw_aff *pwaff2,
2244 __isl_give isl_basic_set *(*cmp)(__isl_take isl_aff *aff1,
2245 __isl_take isl_aff *aff2))
2246 {
2247 int i, j, n;
2248 isl_pw_aff *res;
2249 isl_ctx *ctx;
2250 isl_set *set;
2251
2252 if (!pwaff1 || !pwaff2)
2253 goto error;
2254
2255 ctx = isl_space_get_ctx(pwaff1->dim);
2256 if (!isl_space_is_equal(pwaff1->dim, pwaff2->dim))
2257 isl_die(ctx, isl_error_invalid,
2258 "arguments should live in same space", goto error);
2259
2260 if (isl_pw_aff_is_empty(pwaff1)) {
2261 isl_pw_aff_free(pwaff1);
2262 return pwaff2;
2263 }
2264
2265 if (isl_pw_aff_is_empty(pwaff2)) {
2266 isl_pw_aff_free(pwaff2);
2267 return pwaff1;
2268 }
2269
2270 n = 2 * (pwaff1->n + 1) * (pwaff2->n + 1);
2271 res = isl_pw_aff_alloc_size(isl_space_copy(pwaff1->dim), n);
2272
2273 for (i = 0; i < pwaff1->n; ++i) {
2274 set = isl_set_copy(pwaff1->p[i].set);
2275 for (j = 0; j < pwaff2->n; ++j) {
2276 struct isl_set *common;
2277 isl_set *better;
2278
2279 common = isl_set_intersect(
2280 isl_set_copy(pwaff1->p[i].set),
2281 isl_set_copy(pwaff2->p[j].set));
2282 better = isl_set_from_basic_set(cmp(
2283 isl_aff_copy(pwaff2->p[j].aff),
2284 isl_aff_copy(pwaff1->p[i].aff)));
2285 better = isl_set_intersect(common, better);
2286 if (isl_set_plain_is_empty(better)) {
2287 isl_set_free(better);
2288 continue;
2289 }
2290 set = isl_set_subtract(set, isl_set_copy(better));
2291
2292 res = isl_pw_aff_add_piece(res, better,
2293 isl_aff_copy(pwaff2->p[j].aff));
2294 }
2295 res = isl_pw_aff_add_piece(res, set,
2296 isl_aff_copy(pwaff1->p[i].aff));
2297 }
2298
2299 for (j = 0; j < pwaff2->n; ++j) {
2300 set = isl_set_copy(pwaff2->p[j].set);
2301 for (i = 0; i < pwaff1->n; ++i)
2302 set = isl_set_subtract(set,
2303 isl_set_copy(pwaff1->p[i].set));
2304 res = isl_pw_aff_add_piece(res, set,
2305 isl_aff_copy(pwaff2->p[j].aff));
2306 }
2307
2308 isl_pw_aff_free(pwaff1);
2309 isl_pw_aff_free(pwaff2);
2310
2311 return res;
2312 error:
2313 isl_pw_aff_free(pwaff1);
2314 isl_pw_aff_free(pwaff2);
2315 return NULL;
2316 }
2317
2318 /* Compute a piecewise quasi-affine expression with a domain that
2319 * is the union of those of pwaff1 and pwaff2 and such that on each
2320 * cell, the quasi-affine expression is the maximum of those of pwaff1
2321 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
2322 * cell, then the associated expression is the defined one.
2323 */
2324 static __isl_give isl_pw_aff *pw_aff_union_max(__isl_take isl_pw_aff *pwaff1,
2325 __isl_take isl_pw_aff *pwaff2)
2326 {
2327 return pw_aff_union_opt(pwaff1, pwaff2, &isl_aff_ge_basic_set);
2328 }
2329
2330 __isl_give isl_pw_aff *isl_pw_aff_union_max(__isl_take isl_pw_aff *pwaff1,
2331 __isl_take isl_pw_aff *pwaff2)
2332 {
2333 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2,
2334 &pw_aff_union_max);
2335 }
2336
2337 /* Compute a piecewise quasi-affine expression with a domain that
2338 * is the union of those of pwaff1 and pwaff2 and such that on each
2339 * cell, the quasi-affine expression is the minimum of those of pwaff1
2340 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
2341 * cell, then the associated expression is the defined one.
2342 */
2343 static __isl_give isl_pw_aff *pw_aff_union_min(__isl_take isl_pw_aff *pwaff1,
2344 __isl_take isl_pw_aff *pwaff2)
2345 {
2346 return pw_aff_union_opt(pwaff1, pwaff2, &isl_aff_le_basic_set);
2347 }
2348
2349 __isl_give isl_pw_aff *isl_pw_aff_union_min(__isl_take isl_pw_aff *pwaff1,
2350 __isl_take isl_pw_aff *pwaff2)
2351 {
2352 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2,
2353 &pw_aff_union_min);
2354 }
2355
2356 __isl_give isl_pw_aff *isl_pw_aff_union_opt(__isl_take isl_pw_aff *pwaff1,
2357 __isl_take isl_pw_aff *pwaff2, int max)
2358 {
2359 if (max)
2360 return isl_pw_aff_union_max(pwaff1, pwaff2);
2361 else
2362 return isl_pw_aff_union_min(pwaff1, pwaff2);
2363 }
2364
2365 /* Construct a map with as domain the domain of pwaff and
2366 * one-dimensional range corresponding to the affine expressions.
2367 */
2368 static __isl_give isl_map *map_from_pw_aff(__isl_take isl_pw_aff *pwaff)
2369 {
2370 int i;
2371 isl_space *dim;
2372 isl_map *map;
2373
2374 if (!pwaff)
2375 return NULL;
2376
2377 dim = isl_pw_aff_get_space(pwaff);
2378 map = isl_map_empty(dim);
2379
2380 for (i = 0; i < pwaff->n; ++i) {
2381 isl_basic_map *bmap;
2382 isl_map *map_i;
2383
2384 bmap = isl_basic_map_from_aff(isl_aff_copy(pwaff->p[i].aff));
2385 map_i = isl_map_from_basic_map(bmap);
2386 map_i = isl_map_intersect_domain(map_i,
2387 isl_set_copy(pwaff->p[i].set));
2388 map = isl_map_union_disjoint(map, map_i);
2389 }
2390
2391 isl_pw_aff_free(pwaff);
2392
2393 return map;
2394 }
2395
2396 /* Construct a map with as domain the domain of pwaff and
2397 * one-dimensional range corresponding to the affine expressions.
2398 */
2399 __isl_give isl_map *isl_map_from_pw_aff(__isl_take isl_pw_aff *pwaff)
2400 {
2401 if (!pwaff)
2402 return NULL;
2403 if (isl_space_is_set(pwaff->dim))
2404 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
2405 "space of input is not a map",
2406 return isl_pw_aff_free(pwaff));
2407 return map_from_pw_aff(pwaff);
2408 }
2409
2410 /* Construct a one-dimensional set with as parameter domain
2411 * the domain of pwaff and the single set dimension
2412 * corresponding to the affine expressions.
2413 */
2414 __isl_give isl_set *isl_set_from_pw_aff(__isl_take isl_pw_aff *pwaff)
2415 {
2416 if (!pwaff)
2417 return NULL;
2418 if (!isl_space_is_set(pwaff->dim))
2419 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
2420 "space of input is not a set",
2421 return isl_pw_aff_free(pwaff));
2422 return map_from_pw_aff(pwaff);
2423 }
2424
2425 /* Return a set containing those elements in the domain
2426 * of pwaff where it is non-negative.
2427 */
2428 __isl_give isl_set *isl_pw_aff_nonneg_set(__isl_take isl_pw_aff *pwaff)
2429 {
2430 int i;
2431 isl_set *set;
2432
2433 if (!pwaff)
2434 return NULL;
2435
2436 set = isl_set_empty(isl_pw_aff_get_domain_space(pwaff));
2437
2438 for (i = 0; i < pwaff->n; ++i) {
2439 isl_basic_set *bset;
2440 isl_set *set_i;
2441 int rational;
2442
2443 rational = isl_set_has_rational(pwaff->p[i].set);
2444 bset = aff_nonneg_basic_set(isl_aff_copy(pwaff->p[i].aff),
2445 rational);
2446 set_i = isl_set_from_basic_set(bset);
2447 set_i = isl_set_intersect(set_i, isl_set_copy(pwaff->p[i].set));
2448 set = isl_set_union_disjoint(set, set_i);
2449 }
2450
2451 isl_pw_aff_free(pwaff);
2452
2453 return set;
2454 }
2455
2456 /* Return a set containing those elements in the domain
2457 * of pwaff where it is zero (if complement is 0) or not zero
2458 * (if complement is 1).
2459 */
2460 static __isl_give isl_set *pw_aff_zero_set(__isl_take isl_pw_aff *pwaff,
2461 int complement)
2462 {
2463 int i;
2464 isl_set *set;
2465
2466 if (!pwaff)
2467 return NULL;
2468
2469 set = isl_set_empty(isl_pw_aff_get_domain_space(pwaff));
2470
2471 for (i = 0; i < pwaff->n; ++i) {
2472 isl_basic_set *bset;
2473 isl_set *set_i, *zero;
2474 int rational;
2475
2476 rational = isl_set_has_rational(pwaff->p[i].set);
2477 bset = aff_zero_basic_set(isl_aff_copy(pwaff->p[i].aff),
2478 rational);
2479 zero = isl_set_from_basic_set(bset);
2480 set_i = isl_set_copy(pwaff->p[i].set);
2481 if (complement)
2482 set_i = isl_set_subtract(set_i, zero);
2483 else
2484 set_i = isl_set_intersect(set_i, zero);
2485 set = isl_set_union_disjoint(set, set_i);
2486 }
2487
2488 isl_pw_aff_free(pwaff);
2489
2490 return set;
2491 }
2492
2493 /* Return a set containing those elements in the domain
2494 * of pwaff where it is zero.
2495 */
2496 __isl_give isl_set *isl_pw_aff_zero_set(__isl_take isl_pw_aff *pwaff)
2497 {
2498 return pw_aff_zero_set(pwaff, 0);
2499 }
2500
2501 /* Return a set containing those elements in the domain
2502 * of pwaff where it is not zero.
2503 */
2504 __isl_give isl_set *isl_pw_aff_non_zero_set(__isl_take isl_pw_aff *pwaff)
2505 {
2506 return pw_aff_zero_set(pwaff, 1);
2507 }
2508
2509 /* Return a set containing those elements in the shared domain
2510 * of pwaff1 and pwaff2 where pwaff1 is greater than (or equal) to pwaff2.
2511 *
2512 * We compute the difference on the shared domain and then construct
2513 * the set of values where this difference is non-negative.
2514 * If strict is set, we first subtract 1 from the difference.
2515 * If equal is set, we only return the elements where pwaff1 and pwaff2
2516 * are equal.
2517 */
2518 static __isl_give isl_set *pw_aff_gte_set(__isl_take isl_pw_aff *pwaff1,
2519 __isl_take isl_pw_aff *pwaff2, int strict, int equal)
2520 {
2521 isl_set *set1, *set2;
2522
2523 set1 = isl_pw_aff_domain(isl_pw_aff_copy(pwaff1));
2524 set2 = isl_pw_aff_domain(isl_pw_aff_copy(pwaff2));
2525 set1 = isl_set_intersect(set1, set2);
2526 pwaff1 = isl_pw_aff_intersect_domain(pwaff1, isl_set_copy(set1));
2527 pwaff2 = isl_pw_aff_intersect_domain(pwaff2, isl_set_copy(set1));
2528 pwaff1 = isl_pw_aff_add(pwaff1, isl_pw_aff_neg(pwaff2));
2529
2530 if (strict) {
2531 isl_space *dim = isl_set_get_space(set1);
2532 isl_aff *aff;
2533 aff = isl_aff_zero_on_domain(isl_local_space_from_space(dim));
2534 aff = isl_aff_add_constant_si(aff, -1);
2535 pwaff1 = isl_pw_aff_add(pwaff1, isl_pw_aff_alloc(set1, aff));
2536 } else
2537 isl_set_free(set1);
2538
2539 if (equal)
2540 return isl_pw_aff_zero_set(pwaff1);
2541 return isl_pw_aff_nonneg_set(pwaff1);
2542 }
2543
2544 /* Return a set containing those elements in the shared domain
2545 * of pwaff1 and pwaff2 where pwaff1 is equal to pwaff2.
2546 */
2547 static __isl_give isl_set *pw_aff_eq_set(__isl_take isl_pw_aff *pwaff1,
2548 __isl_take isl_pw_aff *pwaff2)
2549 {
2550 return pw_aff_gte_set(pwaff1, pwaff2, 0, 1);
2551 }
2552
2553 __isl_give isl_set *isl_pw_aff_eq_set(__isl_take isl_pw_aff *pwaff1,
2554 __isl_take isl_pw_aff *pwaff2)
2555 {
2556 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_eq_set);
2557 }
2558
2559 /* Return a set containing those elements in the shared domain
2560 * of pwaff1 and pwaff2 where pwaff1 is greater than or equal to pwaff2.
2561 */
2562 static __isl_give isl_set *pw_aff_ge_set(__isl_take isl_pw_aff *pwaff1,
2563 __isl_take isl_pw_aff *pwaff2)
2564 {
2565 return pw_aff_gte_set(pwaff1, pwaff2, 0, 0);
2566 }
2567
2568 __isl_give isl_set *isl_pw_aff_ge_set(__isl_take isl_pw_aff *pwaff1,
2569 __isl_take isl_pw_aff *pwaff2)
2570 {
2571 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_ge_set);
2572 }
2573
2574 /* Return a set containing those elements in the shared domain
2575 * of pwaff1 and pwaff2 where pwaff1 is strictly greater than pwaff2.
2576 */
2577 static __isl_give isl_set *pw_aff_gt_set(__isl_take isl_pw_aff *pwaff1,
2578 __isl_take isl_pw_aff *pwaff2)
2579 {
2580 return pw_aff_gte_set(pwaff1, pwaff2, 1, 0);
2581 }
2582
2583 __isl_give isl_set *isl_pw_aff_gt_set(__isl_take isl_pw_aff *pwaff1,
2584 __isl_take isl_pw_aff *pwaff2)
2585 {
2586 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_gt_set);
2587 }
2588
2589 __isl_give isl_set *isl_pw_aff_le_set(__isl_take isl_pw_aff *pwaff1,
2590 __isl_take isl_pw_aff *pwaff2)
2591 {
2592 return isl_pw_aff_ge_set(pwaff2, pwaff1);
2593 }
2594
2595 __isl_give isl_set *isl_pw_aff_lt_set(__isl_take isl_pw_aff *pwaff1,
2596 __isl_take isl_pw_aff *pwaff2)
2597 {
2598 return isl_pw_aff_gt_set(pwaff2, pwaff1);
2599 }
2600
2601 /* Return a set containing those elements in the shared domain
2602 * of the elements of list1 and list2 where each element in list1
2603 * has the relation specified by "fn" with each element in list2.
2604 */
2605 static __isl_give isl_set *pw_aff_list_set(__isl_take isl_pw_aff_list *list1,
2606 __isl_take isl_pw_aff_list *list2,
2607 __isl_give isl_set *(*fn)(__isl_take isl_pw_aff *pwaff1,
2608 __isl_take isl_pw_aff *pwaff2))
2609 {
2610 int i, j;
2611 isl_ctx *ctx;
2612 isl_set *set;
2613
2614 if (!list1 || !list2)
2615 goto error;
2616
2617 ctx = isl_pw_aff_list_get_ctx(list1);
2618 if (list1->n < 1 || list2->n < 1)
2619 isl_die(ctx, isl_error_invalid,
2620 "list should contain at least one element", goto error);
2621
2622 set = isl_set_universe(isl_pw_aff_get_domain_space(list1->p[0]));
2623 for (i = 0; i < list1->n; ++i)
2624 for (j = 0; j < list2->n; ++j) {
2625 isl_set *set_ij;
2626
2627 set_ij = fn(isl_pw_aff_copy(list1->p[i]),
2628 isl_pw_aff_copy(list2->p[j]));
2629 set = isl_set_intersect(set, set_ij);
2630 }
2631
2632 isl_pw_aff_list_free(list1);
2633 isl_pw_aff_list_free(list2);
2634 return set;
2635 error:
2636 isl_pw_aff_list_free(list1);
2637 isl_pw_aff_list_free(list2);
2638 return NULL;
2639 }
2640
2641 /* Return a set containing those elements in the shared domain
2642 * of the elements of list1 and list2 where each element in list1
2643 * is equal to each element in list2.
2644 */
2645 __isl_give isl_set *isl_pw_aff_list_eq_set(__isl_take isl_pw_aff_list *list1,
2646 __isl_take isl_pw_aff_list *list2)
2647 {
2648 return pw_aff_list_set(list1, list2, &isl_pw_aff_eq_set);
2649 }
2650
2651 __isl_give isl_set *isl_pw_aff_list_ne_set(__isl_take isl_pw_aff_list *list1,
2652 __isl_take isl_pw_aff_list *list2)
2653 {
2654 return pw_aff_list_set(list1, list2, &isl_pw_aff_ne_set);
2655 }
2656
2657 /* Return a set containing those elements in the shared domain
2658 * of the elements of list1 and list2 where each element in list1
2659 * is less than or equal to each element in list2.
2660 */
2661 __isl_give isl_set *isl_pw_aff_list_le_set(__isl_take isl_pw_aff_list *list1,
2662 __isl_take isl_pw_aff_list *list2)
2663 {
2664 return pw_aff_list_set(list1, list2, &isl_pw_aff_le_set);
2665 }
2666
2667 __isl_give isl_set *isl_pw_aff_list_lt_set(__isl_take isl_pw_aff_list *list1,
2668 __isl_take isl_pw_aff_list *list2)
2669 {
2670 return pw_aff_list_set(list1, list2, &isl_pw_aff_lt_set);
2671 }
2672
2673 __isl_give isl_set *isl_pw_aff_list_ge_set(__isl_take isl_pw_aff_list *list1,
2674 __isl_take isl_pw_aff_list *list2)
2675 {
2676 return pw_aff_list_set(list1, list2, &isl_pw_aff_ge_set);
2677 }
2678
2679 __isl_give isl_set *isl_pw_aff_list_gt_set(__isl_take isl_pw_aff_list *list1,
2680 __isl_take isl_pw_aff_list *list2)
2681 {
2682 return pw_aff_list_set(list1, list2, &isl_pw_aff_gt_set);
2683 }
2684
2685
2686 /* Return a set containing those elements in the shared domain
2687 * of pwaff1 and pwaff2 where pwaff1 is not equal to pwaff2.
2688 */
2689 static __isl_give isl_set *pw_aff_ne_set(__isl_take isl_pw_aff *pwaff1,
2690 __isl_take isl_pw_aff *pwaff2)
2691 {
2692 isl_set *set_lt, *set_gt;
2693
2694 set_lt = isl_pw_aff_lt_set(isl_pw_aff_copy(pwaff1),
2695 isl_pw_aff_copy(pwaff2));
2696 set_gt = isl_pw_aff_gt_set(pwaff1, pwaff2);
2697 return isl_set_union_disjoint(set_lt, set_gt);
2698 }
2699
2700 __isl_give isl_set *isl_pw_aff_ne_set(__isl_take isl_pw_aff *pwaff1,
2701 __isl_take isl_pw_aff *pwaff2)
2702 {
2703 return align_params_pw_pw_set_and(pwaff1, pwaff2, &pw_aff_ne_set);
2704 }
2705
2706 __isl_give isl_pw_aff *isl_pw_aff_scale_down(__isl_take isl_pw_aff *pwaff,
2707 isl_int v)
2708 {
2709 int i;
2710
2711 if (isl_int_is_one(v))
2712 return pwaff;
2713 if (!isl_int_is_pos(v))
2714 isl_die(isl_pw_aff_get_ctx(pwaff), isl_error_invalid,
2715 "factor needs to be positive",
2716 return isl_pw_aff_free(pwaff));
2717 pwaff = isl_pw_aff_cow(pwaff);
2718 if (!pwaff)
2719 return NULL;
2720 if (pwaff->n == 0)
2721 return pwaff;
2722
2723 for (i = 0; i < pwaff->n; ++i) {
2724 pwaff->p[i].aff = isl_aff_scale_down(pwaff->p[i].aff, v);
2725 if (!pwaff->p[i].aff)
2726 return isl_pw_aff_free(pwaff);
2727 }
2728
2729 return pwaff;
2730 }
2731
2732 /* Divide "pa" by "f".
2733 */
2734 __isl_give isl_pw_aff *isl_pw_aff_scale_down_val(__isl_take isl_pw_aff *pa,
2735 __isl_take isl_val *f)
2736 {
2737 int i;
2738
2739 if (!pa || !f)
2740 goto error;
2741
2742 if (isl_val_is_one(f)) {
2743 isl_val_free(f);
2744 return pa;
2745 }
2746
2747 if (!isl_val_is_rat(f))
2748 isl_die(isl_pw_aff_get_ctx(pa), isl_error_invalid,
2749 "expecting rational factor", goto error);
2750 if (!isl_val_is_pos(f))
2751 isl_die(isl_pw_aff_get_ctx(pa), isl_error_invalid,
2752 "factor needs to be positive", goto error);
2753
2754 pa = isl_pw_aff_cow(pa);
2755 if (!pa)
2756 return NULL;
2757 if (pa->n == 0)
2758 return pa;
2759
2760 for (i = 0; i < pa->n; ++i) {
2761 pa->p[i].aff = isl_aff_scale_down_val(pa->p[i].aff,
2762 isl_val_copy(f));
2763 if (!pa->p[i].aff)
2764 goto error;
2765 }
2766
2767 isl_val_free(f);
2768 return pa;
2769 error:
2770 isl_pw_aff_free(pa);
2771 isl_val_free(f);
2772 return NULL;
2773 }
2774
2775 __isl_give isl_pw_aff *isl_pw_aff_floor(__isl_take isl_pw_aff *pwaff)
2776 {
2777 int i;
2778
2779 pwaff = isl_pw_aff_cow(pwaff);
2780 if (!pwaff)
2781 return NULL;
2782 if (pwaff->n == 0)
2783 return pwaff;
2784
2785 for (i = 0; i < pwaff->n; ++i) {
2786 pwaff->p[i].aff = isl_aff_floor(pwaff->p[i].aff);
2787 if (!pwaff->p[i].aff)
2788 return isl_pw_aff_free(pwaff);
2789 }
2790
2791 return pwaff;
2792 }
2793
2794 __isl_give isl_pw_aff *isl_pw_aff_ceil(__isl_take isl_pw_aff *pwaff)
2795 {
2796 int i;
2797
2798 pwaff = isl_pw_aff_cow(pwaff);
2799 if (!pwaff)
2800 return NULL;
2801 if (pwaff->n == 0)
2802 return pwaff;
2803
2804 for (i = 0; i < pwaff->n; ++i) {
2805 pwaff->p[i].aff = isl_aff_ceil(pwaff->p[i].aff);
2806 if (!pwaff->p[i].aff)
2807 return isl_pw_aff_free(pwaff);
2808 }
2809
2810 return pwaff;
2811 }
2812
2813 /* Assuming that "cond1" and "cond2" are disjoint,
2814 * return an affine expression that is equal to pwaff1 on cond1
2815 * and to pwaff2 on cond2.
2816 */
2817 static __isl_give isl_pw_aff *isl_pw_aff_select(
2818 __isl_take isl_set *cond1, __isl_take isl_pw_aff *pwaff1,
2819 __isl_take isl_set *cond2, __isl_take isl_pw_aff *pwaff2)
2820 {
2821 pwaff1 = isl_pw_aff_intersect_domain(pwaff1, cond1);
2822 pwaff2 = isl_pw_aff_intersect_domain(pwaff2, cond2);
2823
2824 return isl_pw_aff_add_disjoint(pwaff1, pwaff2);
2825 }
2826
2827 /* Return an affine expression that is equal to pwaff_true for elements
2828 * where "cond" is non-zero and to pwaff_false for elements where "cond"
2829 * is zero.
2830 * That is, return cond ? pwaff_true : pwaff_false;
2831 */
2832 __isl_give isl_pw_aff *isl_pw_aff_cond(__isl_take isl_pw_aff *cond,
2833 __isl_take isl_pw_aff *pwaff_true, __isl_take isl_pw_aff *pwaff_false)
2834 {
2835 isl_set *cond_true, *cond_false;
2836
2837 cond_true = isl_pw_aff_non_zero_set(isl_pw_aff_copy(cond));
2838 cond_false = isl_pw_aff_zero_set(cond);
2839 return isl_pw_aff_select(cond_true, pwaff_true,
2840 cond_false, pwaff_false);
2841 }
2842
2843 int isl_aff_is_cst(__isl_keep isl_aff *aff)
2844 {
2845 if (!aff)
2846 return -1;
2847
2848 return isl_seq_first_non_zero(aff->v->el + 2, aff->v->size - 2) == -1;
2849 }
2850
2851 /* Check whether pwaff is a piecewise constant.
2852 */
2853 int isl_pw_aff_is_cst(__isl_keep isl_pw_aff *pwaff)
2854 {
2855 int i;
2856
2857 if (!pwaff)
2858 return -1;
2859
2860 for (i = 0; i < pwaff->n; ++i) {
2861 int is_cst = isl_aff_is_cst(pwaff->p[i].aff);
2862 if (is_cst < 0 || !is_cst)
2863 return is_cst;
2864 }
2865
2866 return 1;
2867 }
2868
2869 __isl_give isl_aff *isl_aff_mul(__isl_take isl_aff *aff1,
2870 __isl_take isl_aff *aff2)
2871 {
2872 if (!isl_aff_is_cst(aff2) && isl_aff_is_cst(aff1))
2873 return isl_aff_mul(aff2, aff1);
2874
2875 if (!isl_aff_is_cst(aff2))
2876 isl_die(isl_aff_get_ctx(aff1), isl_error_invalid,
2877 "at least one affine expression should be constant",
2878 goto error);
2879
2880 aff1 = isl_aff_cow(aff1);
2881 if (!aff1 || !aff2)
2882 goto error;
2883
2884 aff1 = isl_aff_scale(aff1, aff2->v->el[1]);
2885 aff1 = isl_aff_scale_down(aff1, aff2->v->el[0]);
2886
2887 isl_aff_free(aff2);
2888 return aff1;
2889 error:
2890 isl_aff_free(aff1);
2891 isl_aff_free(aff2);
2892 return NULL;
2893 }
2894
2895 /* Divide "aff1" by "aff2", assuming "aff2" is a piecewise constant.
2896 */
2897 __isl_give isl_aff *isl_aff_div(__isl_take isl_aff *aff1,
2898 __isl_take isl_aff *aff2)
2899 {
2900 int is_cst;
2901 int neg;
2902
2903 is_cst = isl_aff_is_cst(aff2);
2904 if (is_cst < 0)
2905 goto error;
2906 if (!is_cst)
2907 isl_die(isl_aff_get_ctx(aff2), isl_error_invalid,
2908 "second argument should be a constant", goto error);
2909
2910 if (!aff2)
2911 goto error;
2912
2913 neg = isl_int_is_neg(aff2->v->el[1]);
2914 if (neg) {
2915 isl_int_neg(aff2->v->el[0], aff2->v->el[0]);
2916 isl_int_neg(aff2->v->el[1], aff2->v->el[1]);
2917 }
2918
2919 aff1 = isl_aff_scale(aff1, aff2->v->el[0]);
2920 aff1 = isl_aff_scale_down(aff1, aff2->v->el[1]);
2921
2922 if (neg) {
2923 isl_int_neg(aff2->v->el[0], aff2->v->el[0]);
2924 isl_int_neg(aff2->v->el[1], aff2->v->el[1]);
2925 }
2926
2927 isl_aff_free(aff2);
2928 return aff1;
2929 error:
2930 isl_aff_free(aff1);
2931 isl_aff_free(aff2);
2932 return NULL;
2933 }
2934
2935 static __isl_give isl_pw_aff *pw_aff_add(__isl_take isl_pw_aff *pwaff1,
2936 __isl_take isl_pw_aff *pwaff2)
2937 {
2938 return isl_pw_aff_on_shared_domain(pwaff1, pwaff2, &isl_aff_add);
2939 }
2940
2941 __isl_give isl_pw_aff *isl_pw_aff_add(__isl_take isl_pw_aff *pwaff1,
2942 __isl_take isl_pw_aff *pwaff2)
2943 {
2944 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_add);
2945 }
2946
2947 __isl_give isl_pw_aff *isl_pw_aff_union_add(__isl_take isl_pw_aff *pwaff1,
2948 __isl_take isl_pw_aff *pwaff2)
2949 {
2950 return isl_pw_aff_union_add_(pwaff1, pwaff2);
2951 }
2952
2953 static __isl_give isl_pw_aff *pw_aff_mul(__isl_take isl_pw_aff *pwaff1,
2954 __isl_take isl_pw_aff *pwaff2)
2955 {
2956 return isl_pw_aff_on_shared_domain(pwaff1, pwaff2, &isl_aff_mul);
2957 }
2958
2959 __isl_give isl_pw_aff *isl_pw_aff_mul(__isl_take isl_pw_aff *pwaff1,
2960 __isl_take isl_pw_aff *pwaff2)
2961 {
2962 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_mul);
2963 }
2964
2965 static __isl_give isl_pw_aff *pw_aff_div(__isl_take isl_pw_aff *pa1,
2966 __isl_take isl_pw_aff *pa2)
2967 {
2968 return isl_pw_aff_on_shared_domain(pa1, pa2, &isl_aff_div);
2969 }
2970
2971 /* Divide "pa1" by "pa2", assuming "pa2" is a piecewise constant.
2972 */
2973 __isl_give isl_pw_aff *isl_pw_aff_div(__isl_take isl_pw_aff *pa1,
2974 __isl_take isl_pw_aff *pa2)
2975 {
2976 int is_cst;
2977
2978 is_cst = isl_pw_aff_is_cst(pa2);
2979 if (is_cst < 0)
2980 goto error;
2981 if (!is_cst)
2982 isl_die(isl_pw_aff_get_ctx(pa2), isl_error_invalid,
2983 "second argument should be a piecewise constant",
2984 goto error);
2985 return isl_pw_aff_align_params_pw_pw_and(pa1, pa2, &pw_aff_div);
2986 error:
2987 isl_pw_aff_free(pa1);
2988 isl_pw_aff_free(pa2);
2989 return NULL;
2990 }
2991
2992 /* Compute the quotient of the integer division of "pa1" by "pa2"
2993 * with rounding towards zero.
2994 * "pa2" is assumed to be a piecewise constant.
2995 *
2996 * In particular, return
2997 *
2998 * pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2)
2999 *
3000 */
3001 __isl_give isl_pw_aff *isl_pw_aff_tdiv_q(__isl_take isl_pw_aff *pa1,
3002 __isl_take isl_pw_aff *pa2)
3003 {
3004 int is_cst;
3005 isl_set *cond;
3006 isl_pw_aff *f, *c;
3007
3008 is_cst = isl_pw_aff_is_cst(pa2);
3009 if (is_cst < 0)
3010 goto error;
3011 if (!is_cst)
3012 isl_die(isl_pw_aff_get_ctx(pa2), isl_error_invalid,
3013 "second argument should be a piecewise constant",
3014 goto error);
3015
3016 pa1 = isl_pw_aff_div(pa1, pa2);
3017
3018 cond = isl_pw_aff_nonneg_set(isl_pw_aff_copy(pa1));
3019 f = isl_pw_aff_floor(isl_pw_aff_copy(pa1));
3020 c = isl_pw_aff_ceil(pa1);
3021 return isl_pw_aff_cond(isl_set_indicator_function(cond), f, c);
3022 error:
3023 isl_pw_aff_free(pa1);
3024 isl_pw_aff_free(pa2);
3025 return NULL;
3026 }
3027
3028 /* Compute the remainder of the integer division of "pa1" by "pa2"
3029 * with rounding towards zero.
3030 * "pa2" is assumed to be a piecewise constant.
3031 *
3032 * In particular, return
3033 *
3034 * pa1 - pa2 * (pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2))
3035 *
3036 */
3037 __isl_give isl_pw_aff *isl_pw_aff_tdiv_r(__isl_take isl_pw_aff *pa1,
3038 __isl_take isl_pw_aff *pa2)
3039 {
3040 int is_cst;
3041 isl_pw_aff *res;
3042
3043 is_cst = isl_pw_aff_is_cst(pa2);
3044 if (is_cst < 0)
3045 goto error;
3046 if (!is_cst)
3047 isl_die(isl_pw_aff_get_ctx(pa2), isl_error_invalid,
3048 "second argument should be a piecewise constant",
3049 goto error);
3050 res = isl_pw_aff_tdiv_q(isl_pw_aff_copy(pa1), isl_pw_aff_copy(pa2));
3051 res = isl_pw_aff_mul(pa2, res);
3052 res = isl_pw_aff_sub(pa1, res);
3053 return res;
3054 error:
3055 isl_pw_aff_free(pa1);
3056 isl_pw_aff_free(pa2);
3057 return NULL;
3058 }
3059
3060 static __isl_give isl_pw_aff *pw_aff_min(__isl_take isl_pw_aff *pwaff1,
3061 __isl_take isl_pw_aff *pwaff2)
3062 {
3063 isl_set *le;
3064 isl_set *dom;
3065
3066 dom = isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1)),
3067 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2)));
3068 le = isl_pw_aff_le_set(isl_pw_aff_copy(pwaff1),
3069 isl_pw_aff_copy(pwaff2));
3070 dom = isl_set_subtract(dom, isl_set_copy(le));
3071 return isl_pw_aff_select(le, pwaff1, dom, pwaff2);
3072 }
3073
3074 __isl_give isl_pw_aff *isl_pw_aff_min(__isl_take isl_pw_aff *pwaff1,
3075 __isl_take isl_pw_aff *pwaff2)
3076 {
3077 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_min);
3078 }
3079
3080 static __isl_give isl_pw_aff *pw_aff_max(__isl_take isl_pw_aff *pwaff1,
3081 __isl_take isl_pw_aff *pwaff2)
3082 {
3083 isl_set *ge;
3084 isl_set *dom;
3085
3086 dom = isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1)),
3087 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2)));
3088 ge = isl_pw_aff_ge_set(isl_pw_aff_copy(pwaff1),
3089 isl_pw_aff_copy(pwaff2));
3090 dom = isl_set_subtract(dom, isl_set_copy(ge));
3091 return isl_pw_aff_select(ge, pwaff1, dom, pwaff2);
3092 }
3093
3094 __isl_give isl_pw_aff *isl_pw_aff_max(__isl_take isl_pw_aff *pwaff1,
3095 __isl_take isl_pw_aff *pwaff2)
3096 {
3097 return isl_pw_aff_align_params_pw_pw_and(pwaff1, pwaff2, &pw_aff_max);
3098 }
3099
3100 static __isl_give isl_pw_aff *pw_aff_list_reduce(
3101 __isl_take isl_pw_aff_list *list,
3102 __isl_give isl_pw_aff *(*fn)(__isl_take isl_pw_aff *pwaff1,
3103 __isl_take isl_pw_aff *pwaff2))
3104 {
3105 int i;
3106 isl_ctx *ctx;
3107 isl_pw_aff *res;
3108
3109 if (!list)
3110 return NULL;
3111
3112 ctx = isl_pw_aff_list_get_ctx(list);
3113 if (list->n < 1)
3114 isl_die(ctx, isl_error_invalid,
3115 "list should contain at least one element",
3116 return isl_pw_aff_list_free(list));
3117
3118 res = isl_pw_aff_copy(list->p[0]);
3119 for (i = 1; i < list->n; ++i)
3120 res = fn(res, isl_pw_aff_copy(list->p[i]));
3121
3122 isl_pw_aff_list_free(list);
3123 return res;
3124 }
3125
3126 /* Return an isl_pw_aff that maps each element in the intersection of the
3127 * domains of the elements of list to the minimal corresponding affine
3128 * expression.
3129 */
3130 __isl_give isl_pw_aff *isl_pw_aff_list_min(__isl_take isl_pw_aff_list *list)
3131 {
3132 return pw_aff_list_reduce(list, &isl_pw_aff_min);
3133 }
3134
3135 /* Return an isl_pw_aff that maps each element in the intersection of the
3136 * domains of the elements of list to the maximal corresponding affine
3137 * expression.
3138 */
3139 __isl_give isl_pw_aff *isl_pw_aff_list_max(__isl_take isl_pw_aff_list *list)
3140 {
3141 return pw_aff_list_reduce(list, &isl_pw_aff_max);
3142 }
3143
3144 /* Mark the domains of "pwaff" as rational.
3145 */
3146 __isl_give isl_pw_aff *isl_pw_aff_set_rational(__isl_take isl_pw_aff *pwaff)
3147 {
3148 int i;
3149
3150 pwaff = isl_pw_aff_cow(pwaff);
3151 if (!pwaff)
3152 return NULL;
3153 if (pwaff->n == 0)
3154 return pwaff;
3155
3156 for (i = 0; i < pwaff->n; ++i) {
3157 pwaff->p[i].set = isl_set_set_rational(pwaff->p[i].set);
3158 if (!pwaff->p[i].set)
3159 return isl_pw_aff_free(pwaff);
3160 }
3161
3162 return pwaff;
3163 }
3164
3165 /* Mark the domains of the elements of "list" as rational.
3166 */
3167 __isl_give isl_pw_aff_list *isl_pw_aff_list_set_rational(
3168 __isl_take isl_pw_aff_list *list)
3169 {
3170 int i, n;
3171
3172 if (!list)
3173 return NULL;
3174 if (list->n == 0)
3175 return list;
3176
3177 n = list->n;
3178 for (i = 0; i < n; ++i) {
3179 isl_pw_aff *pa;
3180
3181 pa = isl_pw_aff_list_get_pw_aff(list, i);
3182 pa = isl_pw_aff_set_rational(pa);
3183 list = isl_pw_aff_list_set_pw_aff(list, i, pa);
3184 }
3185
3186 return list;
3187 }
3188
3189 /* Do the parameters of "aff" match those of "space"?
3190 */
3191 int isl_aff_matching_params(__isl_keep isl_aff *aff,
3192 __isl_keep isl_space *space)
3193 {
3194 isl_space *aff_space;
3195 int match;
3196
3197 if (!aff || !space)
3198 return -1;
3199
3200 aff_space = isl_aff_get_domain_space(aff);
3201
3202 match = isl_space_match(space, isl_dim_param, aff_space, isl_dim_param);
3203
3204 isl_space_free(aff_space);
3205 return match;
3206 }
3207
3208 /* Check that the domain space of "aff" matches "space".
3209 *
3210 * Return 0 on success and -1 on error.
3211 */
3212 int isl_aff_check_match_domain_space(__isl_keep isl_aff *aff,
3213 __isl_keep isl_space *space)
3214 {
3215 isl_space *aff_space;
3216 int match;
3217
3218 if (!aff || !space)
3219 return -1;
3220
3221 aff_space = isl_aff_get_domain_space(aff);
3222
3223 match = isl_space_match(space, isl_dim_param, aff_space, isl_dim_param);
3224 if (match < 0)
3225 goto error;
3226 if (!match)
3227 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
3228 "parameters don't match", goto error);
3229 match = isl_space_tuple_match(space, isl_dim_in,
3230 aff_space, isl_dim_set);
3231 if (match < 0)
3232 goto error;
3233 if (!match)
3234 isl_die(isl_aff_get_ctx(aff), isl_error_invalid,
3235 "domains don't match", goto error);
3236 isl_space_free(aff_space);
3237 return 0;
3238 error:
3239 isl_space_free(aff_space);
3240 return -1;
3241 }
3242
3243 #undef BASE
3244 #define BASE aff
3245
3246 #include <isl_multi_templ.c>
3247
3248 /* Create an isl_pw_multi_aff with the given isl_multi_aff on a universe
3249 * domain.
3250 */
3251 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_multi_aff(
3252 __isl_take isl_multi_aff *ma)
3253 {
3254 isl_set *dom = isl_set_universe(isl_multi_aff_get_domain_space(ma));
3255 return isl_pw_multi_aff_alloc(dom, ma);
3256 }
3257
3258 /* Create a piecewise multi-affine expression in the given space that maps each
3259 * input dimension to the corresponding output dimension.
3260 */
3261 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_identity(
3262 __isl_take isl_space *space)
3263 {
3264 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_identity(space));
3265 }
3266
3267 /* Add "ma2" to "ma1" and return the result.
3268 *
3269 * The parameters of "ma1" and "ma2" are assumed to have been aligned.
3270 */
3271 static __isl_give isl_multi_aff *isl_multi_aff_add_aligned(
3272 __isl_take isl_multi_aff *maff1, __isl_take isl_multi_aff *maff2)
3273 {
3274 return isl_multi_aff_bin_op(maff1, maff2, &isl_aff_add);
3275 }
3276
3277 /* Add "ma2" to "ma1" and return the result.
3278 */
3279 __isl_give isl_multi_aff *isl_multi_aff_add(__isl_take isl_multi_aff *ma1,
3280 __isl_take isl_multi_aff *ma2)
3281 {
3282 return isl_multi_aff_align_params_multi_multi_and(ma1, ma2,
3283 &isl_multi_aff_add_aligned);
3284 }
3285
3286 /* Subtract "ma2" from "ma1" and return the result.
3287 *
3288 * The parameters of "ma1" and "ma2" are assumed to have been aligned.
3289 */
3290 static __isl_give isl_multi_aff *isl_multi_aff_sub_aligned(
3291 __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2)
3292 {
3293 return isl_multi_aff_bin_op(ma1, ma2, &isl_aff_sub);
3294 }
3295
3296 /* Subtract "ma2" from "ma1" and return the result.
3297 */
3298 __isl_give isl_multi_aff *isl_multi_aff_sub(__isl_take isl_multi_aff *ma1,
3299 __isl_take isl_multi_aff *ma2)
3300 {
3301 return isl_multi_aff_align_params_multi_multi_and(ma1, ma2,
3302 &isl_multi_aff_sub_aligned);
3303 }
3304
3305 /* Given two multi-affine expressions A -> B and C -> D,
3306 * construct a multi-affine expression [A -> C] -> [B -> D].
3307 */
3308 __isl_give isl_multi_aff *isl_multi_aff_product(
3309 __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2)
3310 {
3311 int i;
3312 isl_aff *aff;
3313 isl_space *space;
3314 isl_multi_aff *res;
3315 int in1, in2, out1, out2;
3316
3317 in1 = isl_multi_aff_dim(ma1, isl_dim_in);
3318 in2 = isl_multi_aff_dim(ma2, isl_dim_in);
3319 out1 = isl_multi_aff_dim(ma1, isl_dim_out);
3320 out2 = isl_multi_aff_dim(ma2, isl_dim_out);
3321 space = isl_space_product(isl_multi_aff_get_space(ma1),
3322 isl_multi_aff_get_space(ma2));
3323 res = isl_multi_aff_alloc(isl_space_copy(space));
3324 space = isl_space_domain(space);
3325
3326 for (i = 0; i < out1; ++i) {
3327 aff = isl_multi_aff_get_aff(ma1, i);
3328 aff = isl_aff_insert_dims(aff, isl_dim_in, in1, in2);
3329 aff = isl_aff_reset_domain_space(aff, isl_space_copy(space));
3330 res = isl_multi_aff_set_aff(res, i, aff);
3331 }
3332
3333 for (i = 0; i < out2; ++i) {
3334 aff = isl_multi_aff_get_aff(ma2, i);
3335 aff = isl_aff_insert_dims(aff, isl_dim_in, 0, in1);
3336 aff = isl_aff_reset_domain_space(aff, isl_space_copy(space));
3337 res = isl_multi_aff_set_aff(res, out1 + i, aff);
3338 }
3339
3340 isl_space_free(space);
3341 isl_multi_aff_free(ma1);
3342 isl_multi_aff_free(ma2);
3343 return res;
3344 }
3345
3346 /* Exploit the equalities in "eq" to simplify the affine expressions.
3347 */
3348 static __isl_give isl_multi_aff *isl_multi_aff_substitute_equalities(
3349 __isl_take isl_multi_aff *maff, __isl_take isl_basic_set *eq)
3350 {
3351 int i;
3352
3353 maff = isl_multi_aff_cow(maff);
3354 if (!maff || !eq)
3355 goto error;
3356
3357 for (i = 0; i < maff->n; ++i) {
3358 maff->p[i] = isl_aff_substitute_equalities(maff->p[i],
3359 isl_basic_set_copy(eq));
3360 if (!maff->p[i])
3361 goto error;
3362 }
3363
3364 isl_basic_set_free(eq);
3365 return maff;
3366 error:
3367 isl_basic_set_free(eq);
3368 isl_multi_aff_free(maff);
3369 return NULL;
3370 }
3371
3372 __isl_give isl_multi_aff *isl_multi_aff_scale(__isl_take isl_multi_aff *maff,
3373 isl_int f)
3374 {
3375 int i;
3376
3377 maff = isl_multi_aff_cow(maff);
3378 if (!maff)
3379 return NULL;
3380
3381 for (i = 0; i < maff->n; ++i) {
3382 maff->p[i] = isl_aff_scale(maff->p[i], f);
3383 if (!maff->p[i])
3384 return isl_multi_aff_free(maff);
3385 }
3386
3387 return maff;
3388 }
3389
3390 __isl_give isl_multi_aff *isl_multi_aff_add_on_domain(__isl_keep isl_set *dom,
3391 __isl_take isl_multi_aff *maff1, __isl_take isl_multi_aff *maff2)
3392 {
3393 maff1 = isl_multi_aff_add(maff1, maff2);
3394 maff1 = isl_multi_aff_gist(maff1, isl_set_copy(dom));
3395 return maff1;
3396 }
3397
3398 int isl_multi_aff_is_empty(__isl_keep isl_multi_aff *maff)
3399 {
3400 if (!maff)
3401 return -1;
3402
3403 return 0;
3404 }
3405
3406 int isl_multi_aff_plain_is_equal(__isl_keep isl_multi_aff *maff1,
3407 __isl_keep isl_multi_aff *maff2)
3408 {
3409 int i;
3410 int equal;
3411
3412 if (!maff1 || !maff2)
3413 return -1;
3414 if (maff1->n != maff2->n)
3415 return 0;
3416 equal = isl_space_is_equal(maff1->space, maff2->space);
3417 if (equal < 0 || !equal)
3418 return equal;
3419
3420 for (i = 0; i < maff1->n; ++i) {
3421 equal = isl_aff_plain_is_equal(maff1->p[i], maff2->p[i]);
3422 if (equal < 0 || !equal)
3423 return equal;
3424 }
3425
3426 return 1;
3427 }
3428
3429 /* Return the set of domain elements where "ma1" is lexicographically
3430 * smaller than or equal to "ma2".
3431 */
3432 __isl_give isl_set *isl_multi_aff_lex_le_set(__isl_take isl_multi_aff *ma1,
3433 __isl_take isl_multi_aff *ma2)
3434 {
3435 return isl_multi_aff_lex_ge_set(ma2, ma1);
3436 }
3437
3438 /* Return the set of domain elements where "ma1" is lexicographically
3439 * greater than or equal to "ma2".
3440 */
3441 __isl_give isl_set *isl_multi_aff_lex_ge_set(__isl_take isl_multi_aff *ma1,
3442 __isl_take isl_multi_aff *ma2)
3443 {
3444 isl_space *space;
3445 isl_map *map1, *map2;
3446 isl_map *map, *ge;
3447
3448 map1 = isl_map_from_multi_aff(ma1);
3449 map2 = isl_map_from_multi_aff(ma2);
3450 map = isl_map_range_product(map1, map2);
3451 space = isl_space_range(isl_map_get_space(map));
3452 space = isl_space_domain(isl_space_unwrap(space));
3453 ge = isl_map_lex_ge(space);
3454 map = isl_map_intersect_range(map, isl_map_wrap(ge));
3455
3456 return isl_map_domain(map);
3457 }
3458
3459 #undef PW
3460 #define PW isl_pw_multi_aff
3461 #undef EL
3462 #define EL isl_multi_aff
3463 #undef EL_IS_ZERO
3464 #define EL_IS_ZERO is_empty
3465 #undef ZERO
3466 #define ZERO empty
3467 #undef IS_ZERO
3468 #define IS_ZERO is_empty
3469 #undef FIELD
3470 #define FIELD maff
3471 #undef DEFAULT_IS_ZERO
3472 #define DEFAULT_IS_ZERO 0
3473
3474 #define NO_NEG
3475 #define NO_EVAL
3476 #define NO_OPT
3477 #define NO_INVOLVES_DIMS
3478 #define NO_INSERT_DIMS
3479 #define NO_LIFT
3480 #define NO_MORPH
3481
3482 #include <isl_pw_templ.c>
3483
3484 #undef UNION
3485 #define UNION isl_union_pw_multi_aff
3486 #undef PART
3487 #define PART isl_pw_multi_aff
3488 #undef PARTS
3489 #define PARTS pw_multi_aff
3490 #define ALIGN_DOMAIN
3491
3492 #define NO_EVAL
3493
3494 #include <isl_union_templ.c>
3495
3496 /* Given a function "cmp" that returns the set of elements where
3497 * "ma1" is "better" than "ma2", return the intersection of this
3498 * set with "dom1" and "dom2".
3499 */
3500 static __isl_give isl_set *shared_and_better(__isl_keep isl_set *dom1,
3501 __isl_keep isl_set *dom2, __isl_keep isl_multi_aff *ma1,
3502 __isl_keep isl_multi_aff *ma2,
3503 __isl_give isl_set *(*cmp)(__isl_take isl_multi_aff *ma1,
3504 __isl_take isl_multi_aff *ma2))
3505 {
3506 isl_set *common;
3507 isl_set *better;
3508 int is_empty;
3509
3510 common = isl_set_intersect(isl_set_copy(dom1), isl_set_copy(dom2));
3511 is_empty = isl_set_plain_is_empty(common);
3512 if (is_empty >= 0 && is_empty)
3513 return common;
3514 if (is_empty < 0)
3515 return isl_set_free(common);
3516 better = cmp(isl_multi_aff_copy(ma1), isl_multi_aff_copy(ma2));
3517 better = isl_set_intersect(common, better);
3518
3519 return better;
3520 }
3521
3522 /* Given a function "cmp" that returns the set of elements where
3523 * "ma1" is "better" than "ma2", return a piecewise multi affine
3524 * expression defined on the union of the definition domains
3525 * of "pma1" and "pma2" that maps to the "best" of "pma1" and
3526 * "pma2" on each cell. If only one of the two input functions
3527 * is defined on a given cell, then it is considered the best.
3528 */
3529 static __isl_give isl_pw_multi_aff *pw_multi_aff_union_opt(
3530 __isl_take isl_pw_multi_aff *pma1,
3531 __isl_take isl_pw_multi_aff *pma2,
3532 __isl_give isl_set *(*cmp)(__isl_take isl_multi_aff *ma1,
3533 __isl_take isl_multi_aff *ma2))
3534 {
3535 int i, j, n;
3536 isl_pw_multi_aff *res = NULL;
3537 isl_ctx *ctx;
3538 isl_set *set = NULL;
3539
3540 if (!pma1 || !pma2)
3541 goto error;
3542
3543 ctx = isl_space_get_ctx(pma1->dim);
3544 if (!isl_space_is_equal(pma1->dim, pma2->dim))
3545 isl_die(ctx, isl_error_invalid,
3546 "arguments should live in the same space", goto error);
3547
3548 if (isl_pw_multi_aff_is_empty(pma1)) {
3549 isl_pw_multi_aff_free(pma1);
3550 return pma2;
3551 }
3552
3553 if (isl_pw_multi_aff_is_empty(pma2)) {
3554 isl_pw_multi_aff_free(pma2);
3555 return pma1;
3556 }
3557
3558 n = 2 * (pma1->n + 1) * (pma2->n + 1);
3559 res = isl_pw_multi_aff_alloc_size(isl_space_copy(pma1->dim), n);
3560
3561 for (i = 0; i < pma1->n; ++i) {
3562 set = isl_set_copy(pma1->p[i].set);
3563 for (j = 0; j < pma2->n; ++j) {
3564 isl_set *better;
3565 int is_empty;
3566
3567 better = shared_and_better(pma2->p[j].set,
3568 pma1->p[i].set, pma2->p[j].maff,
3569 pma1->p[i].maff, cmp);
3570 is_empty = isl_set_plain_is_empty(better);
3571 if (is_empty < 0 || is_empty) {
3572 isl_set_free(better);
3573 if (is_empty < 0)
3574 goto error;
3575 continue;
3576 }
3577 set = isl_set_subtract(set, isl_set_copy(better));
3578
3579 res = isl_pw_multi_aff_add_piece(res, better,
3580 isl_multi_aff_copy(pma2->p[j].maff));
3581 }
3582 res = isl_pw_multi_aff_add_piece(res, set,
3583 isl_multi_aff_copy(pma1->p[i].maff));
3584 }
3585
3586 for (j = 0; j < pma2->n; ++j) {
3587 set = isl_set_copy(pma2->p[j].set);
3588 for (i = 0; i < pma1->n; ++i)
3589 set = isl_set_subtract(set,
3590 isl_set_copy(pma1->p[i].set));
3591 res = isl_pw_multi_aff_add_piece(res, set,
3592 isl_multi_aff_copy(pma2->p[j].maff));
3593 }
3594
3595 isl_pw_multi_aff_free(pma1);
3596 isl_pw_multi_aff_free(pma2);
3597
3598 return res;
3599 error:
3600 isl_pw_multi_aff_free(pma1);
3601 isl_pw_multi_aff_free(pma2);
3602 isl_set_free(set);
3603 return isl_pw_multi_aff_free(res);
3604 }
3605
3606 static __isl_give isl_pw_multi_aff *pw_multi_aff_union_lexmax(
3607 __isl_take isl_pw_multi_aff *pma1,
3608 __isl_take isl_pw_multi_aff *pma2)
3609 {
3610 return pw_multi_aff_union_opt(pma1, pma2, &isl_multi_aff_lex_ge_set);
3611 }
3612
3613 /* Given two piecewise multi affine expressions, return a piecewise
3614 * multi-affine expression defined on the union of the definition domains
3615 * of the inputs that is equal to the lexicographic maximum of the two
3616 * inputs on each cell. If only one of the two inputs is defined on
3617 * a given cell, then it is considered to be the maximum.
3618 */
3619 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_lexmax(
3620 __isl_take isl_pw_multi_aff *pma1,
3621 __isl_take isl_pw_multi_aff *pma2)
3622 {
3623 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
3624 &pw_multi_aff_union_lexmax);
3625 }
3626
3627 static __isl_give isl_pw_multi_aff *pw_multi_aff_union_lexmin(
3628 __isl_take isl_pw_multi_aff *pma1,
3629 __isl_take isl_pw_multi_aff *pma2)
3630 {
3631 return pw_multi_aff_union_opt(pma1, pma2, &isl_multi_aff_lex_le_set);
3632 }
3633
3634 /* Given two piecewise multi affine expressions, return a piecewise
3635 * multi-affine expression defined on the union of the definition domains
3636 * of the inputs that is equal to the lexicographic minimum of the two
3637 * inputs on each cell. If only one of the two inputs is defined on
3638 * a given cell, then it is considered to be the minimum.
3639 */
3640 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_lexmin(
3641 __isl_take isl_pw_multi_aff *pma1,
3642 __isl_take isl_pw_multi_aff *pma2)
3643 {
3644 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
3645 &pw_multi_aff_union_lexmin);
3646 }
3647
3648 static __isl_give isl_pw_multi_aff *pw_multi_aff_add(
3649 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3650 {
3651 return isl_pw_multi_aff_on_shared_domain(pma1, pma2,
3652 &isl_multi_aff_add);
3653 }
3654
3655 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_add(
3656 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3657 {
3658 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
3659 &pw_multi_aff_add);
3660 }
3661
3662 static __isl_give isl_pw_multi_aff *pw_multi_aff_sub(
3663 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3664 {
3665 return isl_pw_multi_aff_on_shared_domain(pma1, pma2,
3666 &isl_multi_aff_sub);
3667 }
3668
3669 /* Subtract "pma2" from "pma1" and return the result.
3670 */
3671 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_sub(
3672 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3673 {
3674 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
3675 &pw_multi_aff_sub);
3676 }
3677
3678 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_union_add(
3679 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3680 {
3681 return isl_pw_multi_aff_union_add_(pma1, pma2);
3682 }
3683
3684 /* Given two piecewise multi-affine expressions A -> B and C -> D,
3685 * construct a piecewise multi-affine expression [A -> C] -> [B -> D].
3686 */
3687 static __isl_give isl_pw_multi_aff *pw_multi_aff_product(
3688 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3689 {
3690 int i, j, n;
3691 isl_space *space;
3692 isl_pw_multi_aff *res;
3693
3694 if (!pma1 || !pma2)
3695 goto error;
3696
3697 n = pma1->n * pma2->n;
3698 space = isl_space_product(isl_space_copy(pma1->dim),
3699 isl_space_copy(pma2->dim));
3700 res = isl_pw_multi_aff_alloc_size(space, n);
3701
3702 for (i = 0; i < pma1->n; ++i) {
3703 for (j = 0; j < pma2->n; ++j) {
3704 isl_set *domain;
3705 isl_multi_aff *ma;
3706
3707 domain = isl_set_product(isl_set_copy(pma1->p[i].set),
3708 isl_set_copy(pma2->p[j].set));
3709 ma = isl_multi_aff_product(
3710 isl_multi_aff_copy(pma1->p[i].maff),
3711 isl_multi_aff_copy(pma2->p[j].maff));
3712 res = isl_pw_multi_aff_add_piece(res, domain, ma);
3713 }
3714 }
3715
3716 isl_pw_multi_aff_free(pma1);
3717 isl_pw_multi_aff_free(pma2);
3718 return res;
3719 error:
3720 isl_pw_multi_aff_free(pma1);
3721 isl_pw_multi_aff_free(pma2);
3722 return NULL;
3723 }
3724
3725 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_product(
3726 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
3727 {
3728 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
3729 &pw_multi_aff_product);
3730 }
3731
3732 /* Construct a map mapping the domain of the piecewise multi-affine expression
3733 * to its range, with each dimension in the range equated to the
3734 * corresponding affine expression on its cell.
3735 */
3736 __isl_give isl_map *isl_map_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma)
3737 {
3738 int i;
3739 isl_map *map;
3740
3741 if (!pma)
3742 return NULL;
3743
3744 map = isl_map_empty(isl_pw_multi_aff_get_space(pma));
3745
3746 for (i = 0; i < pma->n; ++i) {
3747 isl_multi_aff *maff;
3748 isl_basic_map *bmap;
3749 isl_map *map_i;
3750
3751 maff = isl_multi_aff_copy(pma->p[i].maff);
3752 bmap = isl_basic_map_from_multi_aff(maff);
3753 map_i = isl_map_from_basic_map(bmap);
3754 map_i = isl_map_intersect_domain(map_i,
3755 isl_set_copy(pma->p[i].set));
3756 map = isl_map_union_disjoint(map, map_i);
3757 }
3758
3759 isl_pw_multi_aff_free(pma);
3760 return map;
3761 }
3762
3763 __isl_give isl_set *isl_set_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma)
3764 {
3765 if (!pma)
3766 return NULL;
3767
3768 if (!isl_space_is_set(pma->dim))
3769 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
3770 "isl_pw_multi_aff cannot be converted into an isl_set",
3771 return isl_pw_multi_aff_free(pma));
3772
3773 return isl_map_from_pw_multi_aff(pma);
3774 }
3775
3776 /* Given a basic map with a single output dimension that is defined
3777 * in terms of the parameters and input dimensions using an equality,
3778 * extract an isl_aff that expresses the output dimension in terms
3779 * of the parameters and input dimensions.
3780 *
3781 * Since some applications expect the result of isl_pw_multi_aff_from_map
3782 * to only contain integer affine expressions, we compute the floor
3783 * of the expression before returning.
3784 *
3785 * This function shares some similarities with
3786 * isl_basic_map_has_defining_equality and isl_constraint_get_bound.
3787 */
3788 static __isl_give isl_aff *extract_isl_aff_from_basic_map(
3789 __isl_take isl_basic_map *bmap)
3790 {
3791 int i;
3792 unsigned offset;
3793 unsigned total;
3794 isl_local_space *ls;
3795 isl_aff *aff;
3796
3797 if (!bmap)
3798 return NULL;
3799 if (isl_basic_map_dim(bmap, isl_dim_out) != 1)
3800 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
3801 "basic map should have a single output dimension",
3802 goto error);
3803 offset = isl_basic_map_offset(bmap, isl_dim_out);
3804 total = isl_basic_map_total_dim(bmap);
3805 for (i = 0; i < bmap->n_eq; ++i) {
3806 if (isl_int_is_zero(bmap->eq[i][offset]))
3807 continue;
3808 if (isl_seq_first_non_zero(bmap->eq[i] + offset + 1,
3809 1 + total - (offset + 1)) != -1)
3810 continue;
3811 break;
3812 }
3813 if (i >= bmap->n_eq)
3814 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
3815 "unable to find suitable equality", goto error);
3816 ls = isl_basic_map_get_local_space(bmap);
3817 aff = isl_aff_alloc(isl_local_space_domain(ls));
3818 if (!aff)
3819 goto error;
3820 if (isl_int_is_neg(bmap->eq[i][offset]))
3821 isl_seq_cpy(aff->v->el + 1, bmap->eq[i], offset);
3822 else
3823 isl_seq_neg(aff->v->el + 1, bmap->eq[i], offset);
3824 isl_seq_clr(aff->v->el + 1 + offset, aff->v->size - (1 + offset));
3825 isl_int_abs(aff->v->el[0], bmap->eq[i][offset]);
3826 isl_basic_map_free(bmap);
3827
3828 aff = isl_aff_remove_unused_divs(aff);
3829 aff = isl_aff_floor(aff);
3830 return aff;
3831 error:
3832 isl_basic_map_free(bmap);
3833 return NULL;
3834 }
3835
3836 /* Given a basic map where each output dimension is defined
3837 * in terms of the parameters and input dimensions using an equality,
3838 * extract an isl_multi_aff that expresses the output dimensions in terms
3839 * of the parameters and input dimensions.
3840 */
3841 static __isl_give isl_multi_aff *extract_isl_multi_aff_from_basic_map(
3842 __isl_take isl_basic_map *bmap)
3843 {
3844 int i;
3845 unsigned n_out;
3846 isl_multi_aff *ma;
3847
3848 if (!bmap)
3849 return NULL;
3850
3851 ma = isl_multi_aff_alloc(isl_basic_map_get_space(bmap));
3852 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3853
3854 for (i = 0; i < n_out; ++i) {
3855 isl_basic_map *bmap_i;
3856 isl_aff *aff;
3857
3858 bmap_i = isl_basic_map_copy(bmap);
3859 bmap_i = isl_basic_map_project_out(bmap_i, isl_dim_out,
3860 i + 1, n_out - (1 + i));
3861 bmap_i = isl_basic_map_project_out(bmap_i, isl_dim_out, 0, i);
3862 aff = extract_isl_aff_from_basic_map(bmap_i);
3863 ma = isl_multi_aff_set_aff(ma, i, aff);
3864 }
3865
3866 isl_basic_map_free(bmap);
3867
3868 return ma;
3869 }
3870
3871 /* Create an isl_pw_multi_aff that is equivalent to
3872 * isl_map_intersect_domain(isl_map_from_basic_map(bmap), domain).
3873 * The given basic map is such that each output dimension is defined
3874 * in terms of the parameters and input dimensions using an equality.
3875 */
3876 static __isl_give isl_pw_multi_aff *plain_pw_multi_aff_from_map(
3877 __isl_take isl_set *domain, __isl_take isl_basic_map *bmap)
3878 {
3879 isl_multi_aff *ma;
3880
3881 ma = extract_isl_multi_aff_from_basic_map(bmap);
3882 return isl_pw_multi_aff_alloc(domain, ma);
3883 }
3884
3885 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
3886 * This obviously only works if the input "map" is single-valued.
3887 * If so, we compute the lexicographic minimum of the image in the form
3888 * of an isl_pw_multi_aff. Since the image is unique, it is equal
3889 * to its lexicographic minimum.
3890 * If the input is not single-valued, we produce an error.
3891 */
3892 static __isl_give isl_pw_multi_aff *pw_multi_aff_from_map_base(
3893 __isl_take isl_map *map)
3894 {
3895 int i;
3896 int sv;
3897 isl_pw_multi_aff *pma;
3898
3899 sv = isl_map_is_single_valued(map);
3900 if (sv < 0)
3901 goto error;
3902 if (!sv)
3903 isl_die(isl_map_get_ctx(map), isl_error_invalid,
3904 "map is not single-valued", goto error);
3905 map = isl_map_make_disjoint(map);
3906 if (!map)
3907 return NULL;
3908
3909 pma = isl_pw_multi_aff_empty(isl_map_get_space(map));
3910
3911 for (i = 0; i < map->n; ++i) {
3912 isl_pw_multi_aff *pma_i;
3913 isl_basic_map *bmap;
3914 bmap = isl_basic_map_copy(map->p[i]);
3915 pma_i = isl_basic_map_lexmin_pw_multi_aff(bmap);
3916 pma = isl_pw_multi_aff_add_disjoint(pma, pma_i);
3917 }
3918
3919 isl_map_free(map);
3920 return pma;
3921 error:
3922 isl_map_free(map);
3923 return NULL;
3924 }
3925
3926 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map,
3927 * taking into account that the output dimension at position "d"
3928 * can be represented as
3929 *
3930 * x = floor((e(...) + c1) / m)
3931 *
3932 * given that constraint "i" is of the form
3933 *
3934 * e(...) + c1 - m x >= 0
3935 *
3936 *
3937 * Let "map" be of the form
3938 *
3939 * A -> B
3940 *
3941 * We construct a mapping
3942 *
3943 * A -> [A -> x = floor(...)]
3944 *
3945 * apply that to the map, obtaining
3946 *
3947 * [A -> x = floor(...)] -> B
3948 *
3949 * and equate dimension "d" to x.
3950 * We then compute a isl_pw_multi_aff representation of the resulting map
3951 * and plug in the mapping above.
3952 */
3953 static __isl_give isl_pw_multi_aff *pw_multi_aff_from_map_div(
3954 __isl_take isl_map *map, __isl_take isl_basic_map *hull, int d, int i)
3955 {
3956 isl_ctx *ctx;
3957 isl_space *space;
3958 isl_local_space *ls;
3959 isl_multi_aff *ma;
3960 isl_aff *aff;
3961 isl_vec *v;
3962 isl_map *insert;
3963 int offset;
3964 int n;
3965 int n_in;
3966 isl_pw_multi_aff *pma;
3967 int is_set;
3968
3969 is_set = isl_map_is_set(map);
3970
3971 offset = isl_basic_map_offset(hull, isl_dim_out);
3972 ctx = isl_map_get_ctx(map);
3973 space = isl_space_domain(isl_map_get_space(map));
3974 n_in = isl_space_dim(space, isl_dim_set);
3975 n = isl_space_dim(space, isl_dim_all);
3976
3977 v = isl_vec_alloc(ctx, 1 + 1 + n);
3978 if (v) {
3979 isl_int_neg(v->el[0], hull->ineq[i][offset + d]);
3980 isl_seq_cpy(v->el + 1, hull->ineq[i], 1 + n);
3981 }
3982 isl_basic_map_free(hull);
3983
3984 ls = isl_local_space_from_space(isl_space_copy(space));
3985 aff = isl_aff_alloc_vec(ls, v);
3986 aff = isl_aff_floor(aff);
3987 if (is_set) {
3988 isl_space_free(space);
3989 ma = isl_multi_aff_from_aff(aff);
3990 } else {
3991 ma = isl_multi_aff_identity(isl_space_map_from_set(space));
3992 ma = isl_multi_aff_range_product(ma,
3993 isl_multi_aff_from_aff(aff));
3994 }
3995
3996 insert = isl_map_from_multi_aff(isl_multi_aff_copy(ma));
3997 map = isl_map_apply_domain(map, insert);
3998 map = isl_map_equate(map, isl_dim_in, n_in, isl_dim_out, d);
3999 pma = isl_pw_multi_aff_from_map(map);
4000 pma = isl_pw_multi_aff_pullback_multi_aff(pma, ma);
4001
4002 return pma;
4003 }
4004
4005 /* Is constraint "c" of the form
4006 *
4007 * e(...) + c1 - m x >= 0
4008 *
4009 * or
4010 *
4011 * -e(...) + c2 + m x >= 0
4012 *
4013 * where m > 1 and e only depends on parameters and input dimemnsions?
4014 *
4015 * "offset" is the offset of the output dimensions
4016 * "pos" is the position of output dimension x.
4017 */
4018 static int is_potential_div_constraint(isl_int *c, int offset, int d, int total)
4019 {
4020 if (isl_int_is_zero(c[offset + d]))
4021 return 0;
4022 if (isl_int_is_one(c[offset + d]))
4023 return 0;
4024 if (isl_int_is_negone(c[offset + d]))
4025 return 0;
4026 if (isl_seq_first_non_zero(c + offset, d) != -1)
4027 return 0;
4028 if (isl_seq_first_non_zero(c + offset + d + 1,
4029 total - (offset + d + 1)) != -1)
4030 return 0;
4031 return 1;
4032 }
4033
4034 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4035 *
4036 * As a special case, we first check if there is any pair of constraints,
4037 * shared by all the basic maps in "map" that force a given dimension
4038 * to be equal to the floor of some affine combination of the input dimensions.
4039 *
4040 * In particular, if we can find two constraints
4041 *
4042 * e(...) + c1 - m x >= 0 i.e., m x <= e(...) + c1
4043 *
4044 * and
4045 *
4046 * -e(...) + c2 + m x >= 0 i.e., m x >= e(...) - c2
4047 *
4048 * where m > 1 and e only depends on parameters and input dimemnsions,
4049 * and such that
4050 *
4051 * c1 + c2 < m i.e., -c2 >= c1 - (m - 1)
4052 *
4053 * then we know that we can take
4054 *
4055 * x = floor((e(...) + c1) / m)
4056 *
4057 * without having to perform any computation.
4058 *
4059 * Note that we know that
4060 *
4061 * c1 + c2 >= 1
4062 *
4063 * If c1 + c2 were 0, then we would have detected an equality during
4064 * simplification. If c1 + c2 were negative, then we would have detected
4065 * a contradiction.
4066 */
4067 static __isl_give isl_pw_multi_aff *pw_multi_aff_from_map_check_div(
4068 __isl_take isl_map *map)
4069 {
4070 int d, dim;
4071 int i, j, n;
4072 int offset, total;
4073 isl_int sum;
4074 isl_basic_map *hull;
4075
4076 hull = isl_map_unshifted_simple_hull(isl_map_copy(map));
4077 if (!hull)
4078 goto error;
4079
4080 isl_int_init(sum);
4081 dim = isl_map_dim(map, isl_dim_out);
4082 offset = isl_basic_map_offset(hull, isl_dim_out);
4083 total = 1 + isl_basic_map_total_dim(hull);
4084 n = hull->n_ineq;
4085 for (d = 0; d < dim; ++d) {
4086 for (i = 0; i < n; ++i) {
4087 if (!is_potential_div_constraint(hull->ineq[i],
4088 offset, d, total))
4089 continue;
4090 for (j = i + 1; j < n; ++j) {
4091 if (!isl_seq_is_neg(hull->ineq[i] + 1,
4092 hull->ineq[j] + 1, total - 1))
4093 continue;
4094 isl_int_add(sum, hull->ineq[i][0],
4095 hull->ineq[j][0]);
4096 if (isl_int_abs_lt(sum,
4097 hull->ineq[i][offset + d]))
4098 break;
4099
4100 }
4101 if (j >= n)
4102 continue;
4103 isl_int_clear(sum);
4104 if (isl_int_is_pos(hull->ineq[j][offset + d]))
4105 j = i;
4106 return pw_multi_aff_from_map_div(map, hull, d, j);
4107 }
4108 }
4109 isl_int_clear(sum);
4110 isl_basic_map_free(hull);
4111 return pw_multi_aff_from_map_base(map);
4112 error:
4113 isl_map_free(map);
4114 isl_basic_map_free(hull);
4115 return NULL;
4116 }
4117
4118 /* Given an affine expression
4119 *
4120 * [A -> B] -> f(A,B)
4121 *
4122 * construct an isl_multi_aff
4123 *
4124 * [A -> B] -> B'
4125 *
4126 * such that dimension "d" in B' is set to "aff" and the remaining
4127 * dimensions are set equal to the corresponding dimensions in B.
4128 * "n_in" is the dimension of the space A.
4129 * "n_out" is the dimension of the space B.
4130 *
4131 * If "is_set" is set, then the affine expression is of the form
4132 *
4133 * [B] -> f(B)
4134 *
4135 * and we construct an isl_multi_aff
4136 *
4137 * B -> B'
4138 */
4139 static __isl_give isl_multi_aff *range_map(__isl_take isl_aff *aff, int d,
4140 unsigned n_in, unsigned n_out, int is_set)
4141 {
4142 int i;
4143 isl_multi_aff *ma;
4144 isl_space *space, *space2;
4145 isl_local_space *ls;
4146
4147 space = isl_aff_get_domain_space(aff);
4148 ls = isl_local_space_from_space(isl_space_copy(space));
4149 space2 = isl_space_copy(space);
4150 if (!is_set)
4151 space2 = isl_space_range(isl_space_unwrap(space2));
4152 space = isl_space_map_from_domain_and_range(space, space2);
4153 ma = isl_multi_aff_alloc(space);
4154 ma = isl_multi_aff_set_aff(ma, d, aff);
4155
4156 for (i = 0; i < n_out; ++i) {
4157 if (i == d)
4158 continue;
4159 aff = isl_aff_var_on_domain(isl_local_space_copy(ls),
4160 isl_dim_set, n_in + i);
4161 ma = isl_multi_aff_set_aff(ma, i, aff);
4162 }
4163
4164 isl_local_space_free(ls);
4165
4166 return ma;
4167 }
4168
4169 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map,
4170 * taking into account that the dimension at position "d" can be written as
4171 *
4172 * x = m a + f(..) (1)
4173 *
4174 * where m is equal to "gcd".
4175 * "i" is the index of the equality in "hull" that defines f(..).
4176 * In particular, the equality is of the form
4177 *
4178 * f(..) - x + m g(existentials) = 0
4179 *
4180 * or
4181 *
4182 * -f(..) + x + m g(existentials) = 0
4183 *
4184 * We basically plug (1) into "map", resulting in a map with "a"
4185 * in the range instead of "x". The corresponding isl_pw_multi_aff
4186 * defining "a" is then plugged back into (1) to obtain a definition fro "x".
4187 *
4188 * Specifically, given the input map
4189 *
4190 * A -> B
4191 *
4192 * We first wrap it into a set
4193 *
4194 * [A -> B]
4195 *
4196 * and define (1) on top of the corresponding space, resulting in "aff".
4197 * We use this to create an isl_multi_aff that maps the output position "d"
4198 * from "a" to "x", leaving all other (intput and output) dimensions unchanged.
4199 * We plug this into the wrapped map, unwrap the result and compute the
4200 * corresponding isl_pw_multi_aff.
4201 * The result is an expression
4202 *
4203 * A -> T(A)
4204 *
4205 * We adjust that to
4206 *
4207 * A -> [A -> T(A)]
4208 *
4209 * so that we can plug that into "aff", after extending the latter to
4210 * a mapping
4211 *
4212 * [A -> B] -> B'
4213 *
4214 *
4215 * If "map" is actually a set, then there is no "A" space, meaning
4216 * that we do not need to perform any wrapping, and that the result
4217 * of the recursive call is of the form
4218 *
4219 * [T]
4220 *
4221 * which is plugged into a mapping of the form
4222 *
4223 * B -> B'
4224 */
4225 static __isl_give isl_pw_multi_aff *pw_multi_aff_from_map_stride(
4226 __isl_take isl_map *map, __isl_take isl_basic_map *hull, int d, int i,
4227 isl_int gcd)
4228 {
4229 isl_set *set;
4230 isl_space *space;
4231 isl_local_space *ls;
4232 isl_aff *aff;
4233 isl_multi_aff *ma;
4234 isl_pw_multi_aff *pma, *id;
4235 unsigned n_in;
4236 unsigned o_out;
4237 unsigned n_out;
4238 int is_set;
4239
4240 is_set = isl_map_is_set(map);
4241
4242 n_in = isl_basic_map_dim(hull, isl_dim_in);
4243 n_out = isl_basic_map_dim(hull, isl_dim_out);
4244 o_out = isl_basic_map_offset(hull, isl_dim_out);
4245
4246 if (is_set)
4247 set = map;
4248 else
4249 set = isl_map_wrap(map);
4250 space = isl_space_map_from_set(isl_set_get_space(set));
4251 ma = isl_multi_aff_identity(space);
4252 ls = isl_local_space_from_space(isl_set_get_space(set));
4253 aff = isl_aff_alloc(ls);
4254 if (aff) {
4255 isl_int_set_si(aff->v->el[0], 1);
4256 if (isl_int_is_one(hull->eq[i][o_out + d]))
4257 isl_seq_neg(aff->v->el + 1, hull->eq[i],
4258 aff->v->size - 1);
4259 else
4260 isl_seq_cpy(aff->v->el + 1, hull->eq[i],
4261 aff->v->size - 1);
4262 isl_int_set(aff->v->el[1 + o_out + d], gcd);
4263 }
4264 ma = isl_multi_aff_set_aff(ma, n_in + d, isl_aff_copy(aff));
4265 set = isl_set_preimage_multi_aff(set, ma);
4266
4267 ma = range_map(aff, d, n_in, n_out, is_set);
4268
4269 if (is_set)
4270 map = set;
4271 else
4272 map = isl_set_unwrap(set);
4273 pma = isl_pw_multi_aff_from_map(set);
4274
4275 if (!is_set) {
4276 space = isl_pw_multi_aff_get_domain_space(pma);
4277 space = isl_space_map_from_set(space);
4278 id = isl_pw_multi_aff_identity(space);
4279 pma = isl_pw_multi_aff_range_product(id, pma);
4280 }
4281 id = isl_pw_multi_aff_from_multi_aff(ma);
4282 pma = isl_pw_multi_aff_pullback_pw_multi_aff(id, pma);
4283
4284 isl_basic_map_free(hull);
4285 return pma;
4286 }
4287
4288 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4289 *
4290 * As a special case, we first check if all output dimensions are uniquely
4291 * defined in terms of the parameters and input dimensions over the entire
4292 * domain. If so, we extract the desired isl_pw_multi_aff directly
4293 * from the affine hull of "map" and its domain.
4294 *
4295 * Otherwise, we check if any of the output dimensions is "strided".
4296 * That is, we check if can be written as
4297 *
4298 * x = m a + f(..)
4299 *
4300 * with m greater than 1, a some combination of existentiall quantified
4301 * variables and f and expression in the parameters and input dimensions.
4302 * If so, we remove the stride in pw_multi_aff_from_map_stride.
4303 *
4304 * Otherwise, we continue with pw_multi_aff_from_map_check_div for a further
4305 * special case.
4306 */
4307 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_map(__isl_take isl_map *map)
4308 {
4309 int i, j;
4310 int sv;
4311 isl_basic_map *hull;
4312 unsigned n_out;
4313 unsigned o_out;
4314 unsigned n_div;
4315 unsigned o_div;
4316 isl_int gcd;
4317
4318 if (!map)
4319 return NULL;
4320
4321 hull = isl_map_affine_hull(isl_map_copy(map));
4322 sv = isl_basic_map_plain_is_single_valued(hull);
4323 if (sv >= 0 && sv)
4324 return plain_pw_multi_aff_from_map(isl_map_domain(map), hull);
4325 if (sv < 0)
4326 hull = isl_basic_map_free(hull);
4327 if (!hull)
4328 goto error;
4329
4330 n_div = isl_basic_map_dim(hull, isl_dim_div);
4331 o_div = isl_basic_map_offset(hull, isl_dim_div);
4332
4333 if (n_div == 0) {
4334 isl_basic_map_free(hull);
4335 return pw_multi_aff_from_map_check_div(map);
4336 }
4337
4338 isl_int_init(gcd);
4339
4340 n_out = isl_basic_map_dim(hull, isl_dim_out);
4341 o_out = isl_basic_map_offset(hull, isl_dim_out);
4342
4343 for (i = 0; i < n_out; ++i) {
4344 for (j = 0; j < hull->n_eq; ++j) {
4345 isl_int *eq = hull->eq[j];
4346 isl_pw_multi_aff *res;
4347
4348 if (!isl_int_is_one(eq[o_out + i]) &&
4349 !isl_int_is_negone(eq[o_out + i]))
4350 continue;
4351 if (isl_seq_first_non_zero(eq + o_out, i) != -1)
4352 continue;
4353 if (isl_seq_first_non_zero(eq + o_out + i + 1,
4354 n_out - (i + 1)) != -1)
4355 continue;
4356 isl_seq_gcd(eq + o_div, n_div, &gcd);
4357 if (isl_int_is_zero(gcd))
4358 continue;
4359 if (isl_int_is_one(gcd))
4360 continue;
4361
4362 res = pw_multi_aff_from_map_stride(map, hull,
4363 i, j, gcd);
4364 isl_int_clear(gcd);
4365 return res;
4366 }
4367 }
4368
4369 isl_int_clear(gcd);
4370 isl_basic_map_free(hull);
4371 return pw_multi_aff_from_map_check_div(map);
4372 error:
4373 isl_map_free(map);
4374 return NULL;
4375 }
4376
4377 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_set(__isl_take isl_set *set)
4378 {
4379 return isl_pw_multi_aff_from_map(set);
4380 }
4381
4382 /* Convert "map" into an isl_pw_multi_aff (if possible) and
4383 * add it to *user.
4384 */
4385 static int pw_multi_aff_from_map(__isl_take isl_map *map, void *user)
4386 {
4387 isl_union_pw_multi_aff **upma = user;
4388 isl_pw_multi_aff *pma;
4389
4390 pma = isl_pw_multi_aff_from_map(map);
4391 *upma = isl_union_pw_multi_aff_add_pw_multi_aff(*upma, pma);
4392
4393 return *upma ? 0 : -1;
4394 }
4395
4396 /* Try and create an isl_union_pw_multi_aff that is equivalent
4397 * to the given isl_union_map.
4398 * The isl_union_map is required to be single-valued in each space.
4399 * Otherwise, an error is produced.
4400 */
4401 __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_from_union_map(
4402 __isl_take isl_union_map *umap)
4403 {
4404 isl_space *space;
4405 isl_union_pw_multi_aff *upma;
4406
4407 space = isl_union_map_get_space(umap);
4408 upma = isl_union_pw_multi_aff_empty(space);
4409 if (isl_union_map_foreach_map(umap, &pw_multi_aff_from_map, &upma) < 0)
4410 upma = isl_union_pw_multi_aff_free(upma);
4411 isl_union_map_free(umap);
4412
4413 return upma;
4414 }
4415
4416 /* Try and create an isl_union_pw_multi_aff that is equivalent
4417 * to the given isl_union_set.
4418 * The isl_union_set is required to be a singleton in each space.
4419 * Otherwise, an error is produced.
4420 */
4421 __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_from_union_set(
4422 __isl_take isl_union_set *uset)
4423 {
4424 return isl_union_pw_multi_aff_from_union_map(uset);
4425 }
4426
4427 /* Return the piecewise affine expression "set ? 1 : 0".
4428 */
4429 __isl_give isl_pw_aff *isl_set_indicator_function(__isl_take isl_set *set)
4430 {
4431 isl_pw_aff *pa;
4432 isl_space *space = isl_set_get_space(set);
4433 isl_local_space *ls = isl_local_space_from_space(space);
4434 isl_aff *zero = isl_aff_zero_on_domain(isl_local_space_copy(ls));
4435 isl_aff *one = isl_aff_zero_on_domain(ls);
4436
4437 one = isl_aff_add_constant_si(one, 1);
4438 pa = isl_pw_aff_alloc(isl_set_copy(set), one);
4439 set = isl_set_complement(set);
4440 pa = isl_pw_aff_add_disjoint(pa, isl_pw_aff_alloc(set, zero));
4441
4442 return pa;
4443 }
4444
4445 /* Plug in "subs" for dimension "type", "pos" of "aff".
4446 *
4447 * Let i be the dimension to replace and let "subs" be of the form
4448 *
4449 * f/d
4450 *
4451 * and "aff" of the form
4452 *
4453 * (a i + g)/m
4454 *
4455 * The result is
4456 *
4457 * (a f + d g')/(m d)
4458 *
4459 * where g' is the result of plugging in "subs" in each of the integer
4460 * divisions in g.
4461 */
4462 __isl_give isl_aff *isl_aff_substitute(__isl_take isl_aff *aff,
4463 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
4464 {
4465 isl_ctx *ctx;
4466 isl_int v;
4467
4468 aff = isl_aff_cow(aff);
4469 if (!aff || !subs)
4470 return isl_aff_free(aff);
4471
4472 ctx = isl_aff_get_ctx(aff);
4473 if (!isl_space_is_equal(aff->ls->dim, subs->ls->dim))
4474 isl_die(ctx, isl_error_invalid,
4475 "spaces don't match", return isl_aff_free(aff));
4476 if (isl_local_space_dim(subs->ls, isl_dim_div) != 0)
4477 isl_die(ctx, isl_error_unsupported,
4478 "cannot handle divs yet", return isl_aff_free(aff));
4479
4480 aff->ls = isl_local_space_substitute(aff->ls, type, pos, subs);
4481 if (!aff->ls)
4482 return isl_aff_free(aff);
4483
4484 aff->v = isl_vec_cow(aff->v);
4485 if (!aff->v)
4486 return isl_aff_free(aff);
4487
4488 pos += isl_local_space_offset(aff->ls, type);
4489
4490 isl_int_init(v);
4491 isl_seq_substitute(aff->v->el, pos, subs->v->el,
4492 aff->v->size, subs->v->size, v);
4493 isl_int_clear(v);
4494
4495 return aff;
4496 }
4497
4498 /* Plug in "subs" for dimension "type", "pos" in each of the affine
4499 * expressions in "maff".
4500 */
4501 __isl_give isl_multi_aff *isl_multi_aff_substitute(
4502 __isl_take isl_multi_aff *maff, enum isl_dim_type type, unsigned pos,
4503 __isl_keep isl_aff *subs)
4504 {
4505 int i;
4506
4507 maff = isl_multi_aff_cow(maff);
4508 if (!maff || !subs)
4509 return isl_multi_aff_free(maff);
4510
4511 if (type == isl_dim_in)
4512 type = isl_dim_set;
4513
4514 for (i = 0; i < maff->n; ++i) {
4515 maff->p[i] = isl_aff_substitute(maff->p[i], type, pos, subs);
4516 if (!maff->p[i])
4517 return isl_multi_aff_free(maff);
4518 }
4519
4520 return maff;
4521 }
4522
4523 /* Plug in "subs" for dimension "type", "pos" of "pma".
4524 *
4525 * pma is of the form
4526 *
4527 * A_i(v) -> M_i(v)
4528 *
4529 * while subs is of the form
4530 *
4531 * v' = B_j(v) -> S_j
4532 *
4533 * Each pair i,j such that C_ij = A_i \cap B_i is non-empty
4534 * has a contribution in the result, in particular
4535 *
4536 * C_ij(S_j) -> M_i(S_j)
4537 *
4538 * Note that plugging in S_j in C_ij may also result in an empty set
4539 * and this contribution should simply be discarded.
4540 */
4541 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_substitute(
4542 __isl_take isl_pw_multi_aff *pma, enum isl_dim_type type, unsigned pos,
4543 __isl_keep isl_pw_aff *subs)
4544 {
4545 int i, j, n;
4546 isl_pw_multi_aff *res;
4547
4548 if (!pma || !subs)
4549 return isl_pw_multi_aff_free(pma);
4550
4551 n = pma->n * subs->n;
4552 res = isl_pw_multi_aff_alloc_size(isl_space_copy(pma->dim), n);
4553
4554 for (i = 0; i < pma->n; ++i) {
4555 for (j = 0; j < subs->n; ++j) {
4556 isl_set *common;
4557 isl_multi_aff *res_ij;
4558 int empty;
4559
4560 common = isl_set_intersect(
4561 isl_set_copy(pma->p[i].set),
4562 isl_set_copy(subs->p[j].set));
4563 common = isl_set_substitute(common,
4564 type, pos, subs->p[j].aff);
4565 empty = isl_set_plain_is_empty(common);
4566 if (empty < 0 || empty) {
4567 isl_set_free(common);
4568 if (empty < 0)
4569 goto error;
4570 continue;
4571 }
4572
4573 res_ij = isl_multi_aff_substitute(
4574 isl_multi_aff_copy(pma->p[i].maff),
4575 type, pos, subs->p[j].aff);
4576
4577 res = isl_pw_multi_aff_add_piece(res, common, res_ij);
4578 }
4579 }
4580
4581 isl_pw_multi_aff_free(pma);
4582 return res;
4583 error:
4584 isl_pw_multi_aff_free(pma);
4585 isl_pw_multi_aff_free(res);
4586 return NULL;
4587 }
4588
4589 /* Compute the preimage of a range of dimensions in the affine expression "src"
4590 * under "ma" and put the result in "dst". The number of dimensions in "src"
4591 * that precede the range is given by "n_before". The number of dimensions
4592 * in the range is given by the number of output dimensions of "ma".
4593 * The number of dimensions that follow the range is given by "n_after".
4594 * If "has_denom" is set (to one),
4595 * then "src" and "dst" have an extra initial denominator.
4596 * "n_div_ma" is the number of existentials in "ma"
4597 * "n_div_bset" is the number of existentials in "src"
4598 * The resulting "dst" (which is assumed to have been allocated by
4599 * the caller) contains coefficients for both sets of existentials,
4600 * first those in "ma" and then those in "src".
4601 * f, c1, c2 and g are temporary objects that have been initialized
4602 * by the caller.
4603 *
4604 * Let src represent the expression
4605 *
4606 * (a(p) + f_u u + b v + f_w w + c(divs))/d
4607 *
4608 * and let ma represent the expressions
4609 *
4610 * v_i = (r_i(p) + s_i(y) + t_i(divs'))/m_i
4611 *
4612 * We start out with the following expression for dst:
4613 *
4614 * (a(p) + f_u u + 0 y + f_w w + 0 divs' + c(divs) + f \sum_i b_i v_i)/d
4615 *
4616 * with the multiplication factor f initially equal to 1
4617 * and f \sum_i b_i v_i kept separately.
4618 * For each x_i that we substitute, we multiply the numerator
4619 * (and denominator) of dst by c_1 = m_i and add the numerator
4620 * of the x_i expression multiplied by c_2 = f b_i,
4621 * after removing the common factors of c_1 and c_2.
4622 * The multiplication factor f also needs to be multiplied by c_1
4623 * for the next x_j, j > i.
4624 */
4625 void isl_seq_preimage(isl_int *dst, isl_int *src,
4626 __isl_keep isl_multi_aff *ma, int n_before, int n_after,
4627 int n_div_ma, int n_div_bmap,
4628 isl_int f, isl_int c1, isl_int c2, isl_int g, int has_denom)
4629 {
4630 int i;
4631 int n_param, n_in, n_out;
4632 int o_dst, o_src;
4633
4634 n_param = isl_multi_aff_dim(ma, isl_dim_param);
4635 n_in = isl_multi_aff_dim(ma, isl_dim_in);
4636 n_out = isl_multi_aff_dim(ma, isl_dim_out);
4637
4638 isl_seq_cpy(dst, src, has_denom + 1 + n_param + n_before);
4639 o_dst = o_src = has_denom + 1 + n_param + n_before;
4640 isl_seq_clr(dst + o_dst, n_in);
4641 o_dst += n_in;
4642 o_src += n_out;
4643 isl_seq_cpy(dst + o_dst, src + o_src, n_after);
4644 o_dst += n_after;
4645 o_src += n_after;
4646 isl_seq_clr(dst + o_dst, n_div_ma);
4647 o_dst += n_div_ma;
4648 isl_seq_cpy(dst + o_dst, src + o_src, n_div_bmap);
4649
4650 isl_int_set_si(f, 1);
4651
4652 for (i = 0; i < n_out; ++i) {
4653 int offset = has_denom + 1 + n_param + n_before + i;
4654
4655 if (isl_int_is_zero(src[offset]))
4656 continue;
4657 isl_int_set(c1, ma->p[i]->v->el[0]);
4658 isl_int_mul(c2, f, src[offset]);
4659 isl_int_gcd(g, c1, c2);
4660 isl_int_divexact(c1, c1, g);
4661 isl_int_divexact(c2, c2, g);
4662
4663 isl_int_mul(f, f, c1);
4664 o_dst = has_denom;
4665 o_src = 1;
4666 isl_seq_combine(dst + o_dst, c1, dst + o_dst,
4667 c2, ma->p[i]->v->el + o_src, 1 + n_param);
4668 o_dst += 1 + n_param;
4669 o_src += 1 + n_param;
4670 isl_seq_scale(dst + o_dst, dst + o_dst, c1, n_before);
4671 o_dst += n_before;
4672 isl_seq_combine(dst + o_dst, c1, dst + o_dst,
4673 c2, ma->p[i]->v->el + o_src, n_in);
4674 o_dst += n_in;
4675 o_src += n_in;
4676 isl_seq_scale(dst + o_dst, dst + o_dst, c1, n_after);
4677 o_dst += n_after;
4678 isl_seq_combine(dst + o_dst, c1, dst + o_dst,
4679 c2, ma->p[i]->v->el + o_src, n_div_ma);
4680 o_dst += n_div_ma;
4681 o_src += n_div_ma;
4682 isl_seq_scale(dst + o_dst, dst + o_dst, c1, n_div_bmap);
4683 if (has_denom)
4684 isl_int_mul(dst[0], dst[0], c1);
4685 }
4686 }
4687
4688 /* Compute the pullback of "aff" by the function represented by "ma".
4689 * In other words, plug in "ma" in "aff". The result is an affine expression
4690 * defined over the domain space of "ma".
4691 *
4692 * If "aff" is represented by
4693 *
4694 * (a(p) + b x + c(divs))/d
4695 *
4696 * and ma is represented by
4697 *
4698 * x = D(p) + F(y) + G(divs')
4699 *
4700 * then the result is
4701 *
4702 * (a(p) + b D(p) + b F(y) + b G(divs') + c(divs))/d
4703 *
4704 * The divs in the local space of the input are similarly adjusted
4705 * through a call to isl_local_space_preimage_multi_aff.
4706 */
4707 __isl_give isl_aff *isl_aff_pullback_multi_aff(__isl_take isl_aff *aff,
4708 __isl_take isl_multi_aff *ma)
4709 {
4710 isl_aff *res = NULL;
4711 isl_local_space *ls;
4712 int n_div_aff, n_div_ma;
4713 isl_int f, c1, c2, g;
4714
4715 ma = isl_multi_aff_align_divs(ma);
4716 if (!aff || !ma)
4717 goto error;
4718
4719 n_div_aff = isl_aff_dim(aff, isl_dim_div);
4720 n_div_ma = ma->n ? isl_aff_dim(ma->p[0], isl_dim_div) : 0;
4721
4722 ls = isl_aff_get_domain_local_space(aff);
4723 ls = isl_local_space_preimage_multi_aff(ls, isl_multi_aff_copy(ma));
4724 res = isl_aff_alloc(ls);
4725 if (!res)
4726 goto error;
4727
4728 isl_int_init(f);
4729 isl_int_init(c1);
4730 isl_int_init(c2);
4731 isl_int_init(g);
4732
4733 isl_seq_preimage(res->v->el, aff->v->el, ma, 0, 0, n_div_ma, n_div_aff,
4734 f, c1, c2, g, 1);
4735
4736 isl_int_clear(f);
4737 isl_int_clear(c1);
4738 isl_int_clear(c2);
4739 isl_int_clear(g);
4740
4741 isl_aff_free(aff);
4742 isl_multi_aff_free(ma);
4743 res = isl_aff_normalize(res);
4744 return res;
4745 error:
4746 isl_aff_free(aff);
4747 isl_multi_aff_free(ma);
4748 isl_aff_free(res);
4749 return NULL;
4750 }
4751
4752 /* Compute the pullback of "ma1" by the function represented by "ma2".
4753 * In other words, plug in "ma2" in "ma1".
4754 */
4755 __isl_give isl_multi_aff *isl_multi_aff_pullback_multi_aff(
4756 __isl_take isl_multi_aff *ma1, __isl_take isl_multi_aff *ma2)
4757 {
4758 int i;
4759 isl_space *space = NULL;
4760
4761 ma2 = isl_multi_aff_align_divs(ma2);
4762 ma1 = isl_multi_aff_cow(ma1);
4763 if (!ma1 || !ma2)
4764 goto error;
4765
4766 space = isl_space_join(isl_multi_aff_get_space(ma2),
4767 isl_multi_aff_get_space(ma1));
4768
4769 for (i = 0; i < ma1->n; ++i) {
4770 ma1->p[i] = isl_aff_pullback_multi_aff(ma1->p[i],
4771 isl_multi_aff_copy(ma2));
4772 if (!ma1->p[i])
4773 goto error;
4774 }
4775
4776 ma1 = isl_multi_aff_reset_space(ma1, space);
4777 isl_multi_aff_free(ma2);
4778 return ma1;
4779 error:
4780 isl_space_free(space);
4781 isl_multi_aff_free(ma2);
4782 isl_multi_aff_free(ma1);
4783 return NULL;
4784 }
4785
4786 /* Extend the local space of "dst" to include the divs
4787 * in the local space of "src".
4788 */
4789 __isl_give isl_aff *isl_aff_align_divs(__isl_take isl_aff *dst,
4790 __isl_keep isl_aff *src)
4791 {
4792 isl_ctx *ctx;
4793 int *exp1 = NULL;
4794 int *exp2 = NULL;
4795 isl_mat *div;
4796
4797 if (!src || !dst)
4798 return isl_aff_free(dst);
4799
4800 ctx = isl_aff_get_ctx(src);
4801 if (!isl_space_is_equal(src->ls->dim, dst->ls->dim))
4802 isl_die(ctx, isl_error_invalid,
4803 "spaces don't match", goto error);
4804
4805 if (src->ls->div->n_row == 0)
4806 return dst;
4807
4808 exp1 = isl_alloc_array(ctx, int, src->ls->div->n_row);
4809 exp2 = isl_alloc_array(ctx, int, dst->ls->div->n_row);
4810 if (!exp1 || (dst->ls->div->n_row && !exp2))
4811 goto error;
4812
4813 div = isl_merge_divs(src->ls->div, dst->ls->div, exp1, exp2);
4814 dst = isl_aff_expand_divs(dst, div, exp2);
4815 free(exp1);
4816 free(exp2);
4817
4818 return dst;
4819 error:
4820 free(exp1);
4821 free(exp2);
4822 return isl_aff_free(dst);
4823 }
4824
4825 /* Adjust the local spaces of the affine expressions in "maff"
4826 * such that they all have the save divs.
4827 */
4828 __isl_give isl_multi_aff *isl_multi_aff_align_divs(
4829 __isl_take isl_multi_aff *maff)
4830 {
4831 int i;
4832
4833 if (!maff)
4834 return NULL;
4835 if (maff->n == 0)
4836 return maff;
4837 maff = isl_multi_aff_cow(maff);
4838 if (!maff)
4839 return NULL;
4840
4841 for (i = 1; i < maff->n; ++i)
4842 maff->p[0] = isl_aff_align_divs(maff->p[0], maff->p[i]);
4843 for (i = 1; i < maff->n; ++i) {
4844 maff->p[i] = isl_aff_align_divs(maff->p[i], maff->p[0]);
4845 if (!maff->p[i])
4846 return isl_multi_aff_free(maff);
4847 }
4848
4849 return maff;
4850 }
4851
4852 __isl_give isl_aff *isl_aff_lift(__isl_take isl_aff *aff)
4853 {
4854 aff = isl_aff_cow(aff);
4855 if (!aff)
4856 return NULL;
4857
4858 aff->ls = isl_local_space_lift(aff->ls);
4859 if (!aff->ls)
4860 return isl_aff_free(aff);
4861
4862 return aff;
4863 }
4864
4865 /* Lift "maff" to a space with extra dimensions such that the result
4866 * has no more existentially quantified variables.
4867 * If "ls" is not NULL, then *ls is assigned the local space that lies
4868 * at the basis of the lifting applied to "maff".
4869 */
4870 __isl_give isl_multi_aff *isl_multi_aff_lift(__isl_take isl_multi_aff *maff,
4871 __isl_give isl_local_space **ls)
4872 {
4873 int i;
4874 isl_space *space;
4875 unsigned n_div;
4876
4877 if (ls)
4878 *ls = NULL;
4879
4880 if (!maff)
4881 return NULL;
4882
4883 if (maff->n == 0) {
4884 if (ls) {
4885 isl_space *space = isl_multi_aff_get_domain_space(maff);
4886 *ls = isl_local_space_from_space(space);
4887 if (!*ls)
4888 return isl_multi_aff_free(maff);
4889 }
4890 return maff;
4891 }
4892
4893 maff = isl_multi_aff_cow(maff);
4894 maff = isl_multi_aff_align_divs(maff);
4895 if (!maff)
4896 return NULL;
4897
4898 n_div = isl_aff_dim(maff->p[0], isl_dim_div);
4899 space = isl_multi_aff_get_space(maff);
4900 space = isl_space_lift(isl_space_domain(space), n_div);
4901 space = isl_space_extend_domain_with_range(space,
4902 isl_multi_aff_get_space(maff));
4903 if (!space)
4904 return isl_multi_aff_free(maff);
4905 isl_space_free(maff->space);
4906 maff->space = space;
4907
4908 if (ls) {
4909 *ls = isl_aff_get_domain_local_space(maff->p[0]);
4910 if (!*ls)
4911 return isl_multi_aff_free(maff);
4912 }
4913
4914 for (i = 0; i < maff->n; ++i) {
4915 maff->p[i] = isl_aff_lift(maff->p[i]);
4916 if (!maff->p[i])
4917 goto error;
4918 }
4919
4920 return maff;
4921 error:
4922 if (ls)
4923 isl_local_space_free(*ls);
4924 return isl_multi_aff_free(maff);
4925 }
4926
4927
4928 /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma".
4929 */
4930 __isl_give isl_pw_aff *isl_pw_multi_aff_get_pw_aff(
4931 __isl_keep isl_pw_multi_aff *pma, int pos)
4932 {
4933 int i;
4934 int n_out;
4935 isl_space *space;
4936 isl_pw_aff *pa;
4937
4938 if (!pma)
4939 return NULL;
4940
4941 n_out = isl_pw_multi_aff_dim(pma, isl_dim_out);
4942 if (pos < 0 || pos >= n_out)
4943 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
4944 "index out of bounds", return NULL);
4945
4946 space = isl_pw_multi_aff_get_space(pma);
4947 space = isl_space_drop_dims(space, isl_dim_out,
4948 pos + 1, n_out - pos - 1);
4949 space = isl_space_drop_dims(space, isl_dim_out, 0, pos);
4950
4951 pa = isl_pw_aff_alloc_size(space, pma->n);
4952 for (i = 0; i < pma->n; ++i) {
4953 isl_aff *aff;
4954 aff = isl_multi_aff_get_aff(pma->p[i].maff, pos);
4955 pa = isl_pw_aff_add_piece(pa, isl_set_copy(pma->p[i].set), aff);
4956 }
4957
4958 return pa;
4959 }
4960
4961 /* Return an isl_pw_multi_aff with the given "set" as domain and
4962 * an unnamed zero-dimensional range.
4963 */
4964 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_from_domain(
4965 __isl_take isl_set *set)
4966 {
4967 isl_multi_aff *ma;
4968 isl_space *space;
4969
4970 space = isl_set_get_space(set);
4971 space = isl_space_from_domain(space);
4972 ma = isl_multi_aff_zero(space);
4973 return isl_pw_multi_aff_alloc(set, ma);
4974 }
4975
4976 /* Add an isl_pw_multi_aff with the given "set" as domain and
4977 * an unnamed zero-dimensional range to *user.
4978 */
4979 static int add_pw_multi_aff_from_domain(__isl_take isl_set *set, void *user)
4980 {
4981 isl_union_pw_multi_aff **upma = user;
4982 isl_pw_multi_aff *pma;
4983
4984 pma = isl_pw_multi_aff_from_domain(set);
4985 *upma = isl_union_pw_multi_aff_add_pw_multi_aff(*upma, pma);
4986
4987 return 0;
4988 }
4989
4990 /* Return an isl_union_pw_multi_aff with the given "uset" as domain and
4991 * an unnamed zero-dimensional range.
4992 */
4993 __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_from_domain(
4994 __isl_take isl_union_set *uset)
4995 {
4996 isl_space *space;
4997 isl_union_pw_multi_aff *upma;
4998
4999 if (!uset)
5000 return NULL;
5001
5002 space = isl_union_set_get_space(uset);
5003 upma = isl_union_pw_multi_aff_empty(space);
5004
5005 if (isl_union_set_foreach_set(uset,
5006 &add_pw_multi_aff_from_domain, &upma) < 0)
5007 goto error;
5008
5009 isl_union_set_free(uset);
5010 return upma;
5011 error:
5012 isl_union_set_free(uset);
5013 isl_union_pw_multi_aff_free(upma);
5014 return NULL;
5015 }
5016
5017 /* Convert "pma" to an isl_map and add it to *umap.
5018 */
5019 static int map_from_pw_multi_aff(__isl_take isl_pw_multi_aff *pma, void *user)
5020 {
5021 isl_union_map **umap = user;
5022 isl_map *map;
5023
5024 map = isl_map_from_pw_multi_aff(pma);
5025 *umap = isl_union_map_add_map(*umap, map);
5026
5027 return 0;
5028 }
5029
5030 /* Construct a union map mapping the domain of the union
5031 * piecewise multi-affine expression to its range, with each dimension
5032 * in the range equated to the corresponding affine expression on its cell.
5033 */
5034 __isl_give isl_union_map *isl_union_map_from_union_pw_multi_aff(
5035 __isl_take isl_union_pw_multi_aff *upma)
5036 {
5037 isl_space *space;
5038 isl_union_map *umap;
5039
5040 if (!upma)
5041 return NULL;
5042
5043 space = isl_union_pw_multi_aff_get_space(upma);
5044 umap = isl_union_map_empty(space);
5045
5046 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma,
5047 &map_from_pw_multi_aff, &umap) < 0)
5048 goto error;
5049
5050 isl_union_pw_multi_aff_free(upma);
5051 return umap;
5052 error:
5053 isl_union_pw_multi_aff_free(upma);
5054 isl_union_map_free(umap);
5055 return NULL;
5056 }
5057
5058 /* Local data for bin_entry and the callback "fn".
5059 */
5060 struct isl_union_pw_multi_aff_bin_data {
5061 isl_union_pw_multi_aff *upma2;
5062 isl_union_pw_multi_aff *res;
5063 isl_pw_multi_aff *pma;
5064 int (*fn)(void **entry, void *user);
5065 };
5066
5067 /* Given an isl_pw_multi_aff from upma1, store it in data->pma
5068 * and call data->fn for each isl_pw_multi_aff in data->upma2.
5069 */
5070 static int bin_entry(void **entry, void *user)
5071 {
5072 struct isl_union_pw_multi_aff_bin_data *data = user;
5073 isl_pw_multi_aff *pma = *entry;
5074
5075 data->pma = pma;
5076 if (isl_hash_table_foreach(data->upma2->dim->ctx, &data->upma2->table,
5077 data->fn, data) < 0)
5078 return -1;
5079
5080 return 0;
5081 }
5082
5083 /* Call "fn" on each pair of isl_pw_multi_affs in "upma1" and "upma2".
5084 * The isl_pw_multi_aff from upma1 is stored in data->pma (where data is
5085 * passed as user field) and the isl_pw_multi_aff from upma2 is available
5086 * as *entry. The callback should adjust data->res if desired.
5087 */
5088 static __isl_give isl_union_pw_multi_aff *bin_op(
5089 __isl_take isl_union_pw_multi_aff *upma1,
5090 __isl_take isl_union_pw_multi_aff *upma2,
5091 int (*fn)(void **entry, void *user))
5092 {
5093 isl_space *space;
5094 struct isl_union_pw_multi_aff_bin_data data = { NULL, NULL, NULL, fn };
5095
5096 space = isl_union_pw_multi_aff_get_space(upma2);
5097 upma1 = isl_union_pw_multi_aff_align_params(upma1, space);
5098 space = isl_union_pw_multi_aff_get_space(upma1);
5099 upma2 = isl_union_pw_multi_aff_align_params(upma2, space);
5100
5101 if (!upma1 || !upma2)
5102 goto error;
5103
5104 data.upma2 = upma2;
5105 data.res = isl_union_pw_multi_aff_alloc(isl_space_copy(upma1->dim),
5106 upma1->table.n);
5107 if (isl_hash_table_foreach(upma1->dim->ctx, &upma1->table,
5108 &bin_entry, &data) < 0)
5109 goto error;
5110
5111 isl_union_pw_multi_aff_free(upma1);
5112 isl_union_pw_multi_aff_free(upma2);
5113 return data.res;
5114 error:
5115 isl_union_pw_multi_aff_free(upma1);
5116 isl_union_pw_multi_aff_free(upma2);
5117 isl_union_pw_multi_aff_free(data.res);
5118 return NULL;
5119 }
5120
5121 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
5122 * construct an isl_pw_multi_aff (A * C) -> [B -> D].
5123 */
5124 static __isl_give isl_pw_multi_aff *pw_multi_aff_range_product(
5125 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
5126 {
5127 isl_space *space;
5128
5129 space = isl_space_range_product(isl_pw_multi_aff_get_space(pma1),
5130 isl_pw_multi_aff_get_space(pma2));
5131 return isl_pw_multi_aff_on_shared_domain_in(pma1, pma2, space,
5132 &isl_multi_aff_range_product);
5133 }
5134
5135 /* Given two isl_pw_multi_affs A -> B and C -> D,
5136 * construct an isl_pw_multi_aff (A * C) -> [B -> D].
5137 */
5138 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_range_product(
5139 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
5140 {
5141 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
5142 &pw_multi_aff_range_product);
5143 }
5144
5145 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
5146 * construct an isl_pw_multi_aff (A * C) -> (B, D).
5147 */
5148 static __isl_give isl_pw_multi_aff *pw_multi_aff_flat_range_product(
5149 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
5150 {
5151 isl_space *space;
5152
5153 space = isl_space_range_product(isl_pw_multi_aff_get_space(pma1),
5154 isl_pw_multi_aff_get_space(pma2));
5155 space = isl_space_flatten_range(space);
5156 return isl_pw_multi_aff_on_shared_domain_in(pma1, pma2, space,
5157 &isl_multi_aff_flat_range_product);
5158 }
5159
5160 /* Given two isl_pw_multi_affs A -> B and C -> D,
5161 * construct an isl_pw_multi_aff (A * C) -> (B, D).
5162 */
5163 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_flat_range_product(
5164 __isl_take isl_pw_multi_aff *pma1, __isl_take isl_pw_multi_aff *pma2)
5165 {
5166 return isl_pw_multi_aff_align_params_pw_pw_and(pma1, pma2,
5167 &pw_multi_aff_flat_range_product);
5168 }
5169
5170 /* If data->pma and *entry have the same domain space, then compute
5171 * their flat range product and the result to data->res.
5172 */
5173 static int flat_range_product_entry(void **entry, void *user)
5174 {
5175 struct isl_union_pw_multi_aff_bin_data *data = user;
5176 isl_pw_multi_aff *pma2 = *entry;
5177
5178 if (!isl_space_tuple_match(data->pma->dim, isl_dim_in,
5179 pma2->dim, isl_dim_in))
5180 return 0;
5181
5182 pma2 = isl_pw_multi_aff_flat_range_product(
5183 isl_pw_multi_aff_copy(data->pma),
5184 isl_pw_multi_aff_copy(pma2));
5185
5186 data->res = isl_union_pw_multi_aff_add_pw_multi_aff(data->res, pma2);
5187
5188 return 0;
5189 }
5190
5191 /* Given two isl_union_pw_multi_affs A -> B and C -> D,
5192 * construct an isl_union_pw_multi_aff (A * C) -> (B, D).
5193 */
5194 __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_flat_range_product(
5195 __isl_take isl_union_pw_multi_aff *upma1,
5196 __isl_take isl_union_pw_multi_aff *upma2)
5197 {
5198 return bin_op(upma1, upma2, &flat_range_product_entry);
5199 }
5200
5201 /* Replace the affine expressions at position "pos" in "pma" by "pa".
5202 * The parameters are assumed to have been aligned.
5203 *
5204 * The implementation essentially performs an isl_pw_*_on_shared_domain,
5205 * except that it works on two different isl_pw_* types.
5206 */
5207 static __isl_give isl_pw_multi_aff *pw_multi_aff_set_pw_aff(
5208 __isl_take isl_pw_multi_aff *pma, unsigned pos,
5209 __isl_take isl_pw_aff *pa)
5210 {
5211 int i, j, n;
5212 isl_pw_multi_aff *res = NULL;
5213
5214 if (!pma || !pa)
5215 goto error;
5216
5217 if (!isl_space_tuple_match(pma->dim, isl_dim_in, pa->dim, isl_dim_in))
5218 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
5219 "domains don't match", goto error);
5220 if (pos >= isl_pw_multi_aff_dim(pma, isl_dim_out))
5221 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
5222 "index out of bounds", goto error);
5223
5224 n = pma->n * pa->n;
5225 res = isl_pw_multi_aff_alloc_size(isl_pw_multi_aff_get_space(pma), n);
5226
5227 for (i = 0; i < pma->n; ++i) {
5228 for (j = 0; j < pa->n; ++j) {
5229 isl_set *common;
5230 isl_multi_aff *res_ij;
5231 int empty;
5232
5233 common = isl_set_intersect(isl_set_copy(pma->p[i].set),
5234 isl_set_copy(pa->p[j].set));
5235 empty = isl_set_plain_is_empty(common);
5236 if (empty < 0 || empty) {
5237 isl_set_free(common);
5238 if (empty < 0)
5239 goto error;
5240 continue;
5241 }
5242
5243 res_ij = isl_multi_aff_set_aff(
5244 isl_multi_aff_copy(pma->p[i].maff), pos,
5245 isl_aff_copy(pa->p[j].aff));
5246 res_ij = isl_multi_aff_gist(res_ij,
5247 isl_set_copy(common));
5248
5249 res = isl_pw_multi_aff_add_piece(res, common, res_ij);
5250 }
5251 }
5252
5253 isl_pw_multi_aff_free(pma);
5254 isl_pw_aff_free(pa);
5255 return res;
5256 error:
5257 isl_pw_multi_aff_free(pma);
5258 isl_pw_aff_free(pa);
5259 return isl_pw_multi_aff_free(res);
5260 }
5261
5262 /* Replace the affine expressions at position "pos" in "pma" by "pa".
5263 */
5264 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_set_pw_aff(
5265 __isl_take isl_pw_multi_aff *pma, unsigned pos,
5266 __isl_take isl_pw_aff *pa)
5267 {
5268 if (!pma || !pa)
5269 goto error;
5270 if (isl_space_match(pma->dim, isl_dim_param, pa->dim, isl_dim_param))
5271 return pw_multi_aff_set_pw_aff(pma, pos, pa);
5272 if (!isl_space_has_named_params(pma->dim) ||
5273 !isl_space_has_named_params(pa->dim))
5274 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
5275 "unaligned unnamed parameters", goto error);
5276 pma = isl_pw_multi_aff_align_params(pma, isl_pw_aff_get_space(pa));
5277 pa = isl_pw_aff_align_params(pa, isl_pw_multi_aff_get_space(pma));
5278 return pw_multi_aff_set_pw_aff(pma, pos, pa);
5279 error:
5280 isl_pw_multi_aff_free(pma);
5281 isl_pw_aff_free(pa);
5282 return NULL;
5283 }
5284
5285 /* Do the parameters of "pa" match those of "space"?
5286 */
5287 int isl_pw_aff_matching_params(__isl_keep isl_pw_aff *pa,
5288 __isl_keep isl_space *space)
5289 {
5290 isl_space *pa_space;
5291 int match;
5292
5293 if (!pa || !space)
5294 return -1;
5295
5296 pa_space = isl_pw_aff_get_space(pa);
5297
5298 match = isl_space_match(space, isl_dim_param, pa_space, isl_dim_param);
5299
5300 isl_space_free(pa_space);
5301 return match;
5302 }
5303
5304 /* Check that the domain space of "pa" matches "space".
5305 *
5306 * Return 0 on success and -1 on error.
5307 */
5308 int isl_pw_aff_check_match_domain_space(__isl_keep isl_pw_aff *pa,
5309 __isl_keep isl_space *space)
5310 {
5311 isl_space *pa_space;
5312 int match;
5313
5314 if (!pa || !space)
5315 return -1;
5316
5317 pa_space = isl_pw_aff_get_space(pa);
5318
5319 match = isl_space_match(space, isl_dim_param, pa_space, isl_dim_param);
5320 if (match < 0)
5321 goto error;
5322 if (!match)
5323 isl_die(isl_pw_aff_get_ctx(pa), isl_error_invalid,
5324 "parameters don't match", goto error);
5325 match = isl_space_tuple_match(space, isl_dim_in, pa_space, isl_dim_in);
5326 if (match < 0)
5327 goto error;
5328 if (!match)
5329 isl_die(isl_pw_aff_get_ctx(pa), isl_error_invalid,
5330 "domains don't match", goto error);
5331 isl_space_free(pa_space);
5332 return 0;
5333 error:
5334 isl_space_free(pa_space);
5335 return -1;
5336 }
5337
5338 #undef BASE
5339 #define BASE pw_aff
5340
5341 #include <isl_multi_templ.c>
5342
5343 /* Scale the elements of "pma" by the corresponding elements of "mv".
5344 */
5345 __isl_give isl_pw_multi_aff *isl_pw_multi_aff_scale_multi_val(
5346 __isl_take isl_pw_multi_aff *pma, __isl_take isl_multi_val *mv)
5347 {
5348 int i;
5349
5350 pma = isl_pw_multi_aff_cow(pma);
5351 if (!pma || !mv)
5352 goto error;
5353 if (!isl_space_tuple_match(pma->dim, isl_dim_out,
5354 mv->space, isl_dim_set))
5355 isl_die(isl_pw_multi_aff_get_ctx(pma), isl_error_invalid,
5356 "spaces don't match", goto error);
5357 if (!isl_space_match(pma->dim, isl_dim_param,
5358 mv->space, isl_dim_param)) {
5359 pma = isl_pw_multi_aff_align_params(pma,
5360 isl_multi_val_get_space(mv));
5361 mv = isl_multi_val_align_params(mv,
5362 isl_pw_multi_aff_get_space(pma));
5363 if (!pma || !mv)
5364 goto error;
5365 }
5366
5367 for (i = 0; i < pma->n; ++i) {
5368 pma->p[i].maff = isl_multi_aff_scale_multi_val(pma->p[i].maff,
5369 isl_multi_val_copy(mv));
5370 if (!pma->p[i].maff)
5371 goto error;
5372 }
5373
5374 isl_multi_val_free(mv);
5375 return pma;
5376 error:
5377 isl_multi_val_free(mv);
5378 isl_pw_multi_aff_free(pma);
5379 return NULL;
5380 }
5381
5382 /* Internal data structure for isl_union_pw_multi_aff_scale_multi_val.
5383 * mv contains the mv argument.
5384 * res collects the results.
5385 */
5386 struct isl_union_pw_multi_aff_scale_multi_val_data {
5387 isl_multi_val *mv;
5388 isl_union_pw_multi_aff *res;
5389 };
5390
5391 /* This function is called for each entry of an isl_union_pw_multi_aff.
5392 * If the space of the entry matches that of data->mv,
5393 * then apply isl_pw_multi_aff_scale_multi_val and add the result
5394 * to data->res.
5395 */
5396 static int union_pw_multi_aff_scale_multi_val_entry(void **entry, void *user)
5397 {
5398 struct isl_union_pw_multi_aff_scale_multi_val_data *data = user;
5399 isl_pw_multi_aff *pma = *entry;
5400
5401 if (!pma)
5402 return -1;
5403 if (!isl_space_tuple_match(pma->dim, isl_dim_out,
5404 data->mv->space, isl_dim_set))
5405 return 0;
5406
5407 pma = isl_pw_multi_aff_copy(pma);
5408 pma = isl_pw_multi_aff_scale_multi_val(pma,
5409 isl_multi_val_copy(data->mv));
5410 data->res = isl_union_pw_multi_aff_add_pw_multi_aff(data->res, pma);
5411 if (!data->res)
5412 return -1;
5413
5414 return 0;
5415 }
5416
5417 /* Scale the elements of "upma" by the corresponding elements of "mv",
5418 * for those entries that match the space of "mv".
5419 */
5420 __isl_give isl_union_pw_multi_aff *isl_union_pw_multi_aff_scale_multi_val(
5421 __isl_take isl_union_pw_multi_aff *upma, __isl_take isl_multi_val *mv)
5422 {
5423 struct isl_union_pw_multi_aff_scale_multi_val_data data;
5424
5425 upma = isl_union_pw_multi_aff_align_params(upma,
5426 isl_multi_val_get_space(mv));
5427 mv = isl_multi_val_align_params(mv,
5428 isl_union_pw_multi_aff_get_space(upma));
5429 if (!upma || !mv)
5430 goto error;
5431
5432 data.mv = mv;
5433 data.res = isl_union_pw_multi_aff_alloc(isl_space_copy(upma->dim),
5434 upma->table.n);
5435 if (isl_hash_table_foreach(upma->dim->ctx, &upma->table,
5436 &union_pw_multi_aff_scale_multi_val_entry, &data) < 0)
5437 goto error;
5438
5439 isl_multi_val_free(mv);
5440 isl_union_pw_multi_aff_free(upma);
5441 return data.res;
5442 error:
5443 isl_multi_val_free(mv);
5444 isl_union_pw_multi_aff_free(upma);
5445 return NULL;
5446 }
Integer set library