isl_output.c: print_constraint_c: use print_ls_affine_c
[isl.git] / isl_local_space.c
blob332c346ef63bcb2d7f2f68dc7b97ec411d37c700
1 /*
2 * Copyright 2011 INRIA Saclay
3 * Copyright 2012-2014 Ecole Normale Superieure
5 * Use of this software is governed by the MIT license
7 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
8 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
9 * 91893 Orsay, France
10 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
13 #include <isl_ctx_private.h>
14 #include <isl/id.h>
15 #include <isl_map_private.h>
16 #include <isl_local_space_private.h>
17 #include <isl_space_private.h>
18 #include <isl_mat_private.h>
19 #include <isl_aff_private.h>
20 #include <isl_vec_private.h>
21 #include <isl_point_private.h>
22 #include <isl_seq.h>
23 #include <isl_local.h>
25 isl_ctx *isl_local_space_get_ctx(__isl_keep isl_local_space *ls)
27 return ls ? ls->dim->ctx : NULL;
30 /* Return a hash value that digests "ls".
32 uint32_t isl_local_space_get_hash(__isl_keep isl_local_space *ls)
34 uint32_t hash, space_hash, div_hash;
36 if (!ls)
37 return 0;
39 hash = isl_hash_init();
40 space_hash = isl_space_get_hash(ls->dim);
41 isl_hash_hash(hash, space_hash);
42 div_hash = isl_mat_get_hash(ls->div);
43 isl_hash_hash(hash, div_hash);
45 return hash;
48 __isl_give isl_local_space *isl_local_space_alloc_div(
49 __isl_take isl_space *space, __isl_take isl_mat *div)
51 isl_ctx *ctx;
52 isl_local_space *ls = NULL;
54 if (!space || !div)
55 goto error;
57 ctx = isl_space_get_ctx(space);
58 ls = isl_calloc_type(ctx, struct isl_local_space);
59 if (!ls)
60 goto error;
62 ls->ref = 1;
63 ls->dim = space;
64 ls->div = div;
66 return ls;
67 error:
68 isl_mat_free(div);
69 isl_space_free(space);
70 isl_local_space_free(ls);
71 return NULL;
74 __isl_give isl_local_space *isl_local_space_alloc(__isl_take isl_space *space,
75 unsigned n_div)
77 isl_ctx *ctx;
78 isl_mat *div;
79 unsigned total;
81 if (!space)
82 return NULL;
84 total = isl_space_dim(space, isl_dim_all);
86 ctx = isl_space_get_ctx(space);
87 div = isl_mat_alloc(ctx, n_div, 1 + 1 + total + n_div);
88 return isl_local_space_alloc_div(space, div);
91 __isl_give isl_local_space *isl_local_space_from_space(__isl_take isl_space *dim)
93 return isl_local_space_alloc(dim, 0);
96 __isl_give isl_local_space *isl_local_space_copy(__isl_keep isl_local_space *ls)
98 if (!ls)
99 return NULL;
101 ls->ref++;
102 return ls;
105 __isl_give isl_local_space *isl_local_space_dup(__isl_keep isl_local_space *ls)
107 if (!ls)
108 return NULL;
110 return isl_local_space_alloc_div(isl_space_copy(ls->dim),
111 isl_mat_copy(ls->div));
115 __isl_give isl_local_space *isl_local_space_cow(__isl_take isl_local_space *ls)
117 if (!ls)
118 return NULL;
120 if (ls->ref == 1)
121 return ls;
122 ls->ref--;
123 return isl_local_space_dup(ls);
126 __isl_null isl_local_space *isl_local_space_free(
127 __isl_take isl_local_space *ls)
129 if (!ls)
130 return NULL;
132 if (--ls->ref > 0)
133 return NULL;
135 isl_space_free(ls->dim);
136 isl_mat_free(ls->div);
138 free(ls);
140 return NULL;
143 /* Is the local space that of a parameter domain?
145 isl_bool isl_local_space_is_params(__isl_keep isl_local_space *ls)
147 if (!ls)
148 return isl_bool_error;
149 return isl_space_is_params(ls->dim);
152 /* Is the local space that of a set?
154 isl_bool isl_local_space_is_set(__isl_keep isl_local_space *ls)
156 return ls ? isl_space_is_set(ls->dim) : isl_bool_error;
159 /* Do "ls1" and "ls2" have the same space?
161 isl_bool isl_local_space_has_equal_space(__isl_keep isl_local_space *ls1,
162 __isl_keep isl_local_space *ls2)
164 if (!ls1 || !ls2)
165 return isl_bool_error;
167 return isl_space_is_equal(ls1->dim, ls2->dim);
170 /* Is the space of "ls" equal to "space"?
172 isl_bool isl_local_space_has_space(__isl_keep isl_local_space *ls,
173 __isl_keep isl_space *space)
175 return isl_space_is_equal(isl_local_space_peek_space(ls), space);
178 /* Check that the space of "ls" is equal to "space".
180 static isl_stat isl_local_space_check_has_space(__isl_keep isl_local_space *ls,
181 __isl_keep isl_space *space)
183 isl_bool ok;
185 ok = isl_local_space_has_space(ls, space);
186 if (ok < 0)
187 return isl_stat_error;
188 if (!ok)
189 isl_die(isl_local_space_get_ctx(ls), isl_error_invalid,
190 "spaces don't match", return isl_stat_error);
191 return isl_stat_ok;
194 /* Return true if the two local spaces are identical, with identical
195 * expressions for the integer divisions.
197 isl_bool isl_local_space_is_equal(__isl_keep isl_local_space *ls1,
198 __isl_keep isl_local_space *ls2)
200 isl_bool equal;
202 equal = isl_local_space_has_equal_space(ls1, ls2);
203 if (equal < 0 || !equal)
204 return equal;
206 if (!isl_local_space_divs_known(ls1))
207 return isl_bool_false;
208 if (!isl_local_space_divs_known(ls2))
209 return isl_bool_false;
211 return isl_mat_is_equal(ls1->div, ls2->div);
214 /* Compare two isl_local_spaces.
216 * Return -1 if "ls1" is "smaller" than "ls2", 1 if "ls1" is "greater"
217 * than "ls2" and 0 if they are equal.
219 int isl_local_space_cmp(__isl_keep isl_local_space *ls1,
220 __isl_keep isl_local_space *ls2)
222 int cmp;
224 if (ls1 == ls2)
225 return 0;
226 if (!ls1)
227 return -1;
228 if (!ls2)
229 return 1;
231 cmp = isl_space_cmp(ls1->dim, ls2->dim);
232 if (cmp != 0)
233 return cmp;
235 return isl_local_cmp(ls1->div, ls2->div);
238 int isl_local_space_dim(__isl_keep isl_local_space *ls,
239 enum isl_dim_type type)
241 if (!ls)
242 return 0;
243 if (type == isl_dim_div)
244 return ls->div->n_row;
245 if (type == isl_dim_all)
246 return isl_space_dim(ls->dim, isl_dim_all) + ls->div->n_row;
247 return isl_space_dim(ls->dim, type);
250 #undef TYPE
251 #define TYPE isl_local_space
252 #include "check_type_range_templ.c"
254 unsigned isl_local_space_offset(__isl_keep isl_local_space *ls,
255 enum isl_dim_type type)
257 isl_space *space;
259 if (!ls)
260 return 0;
262 space = ls->dim;
263 switch (type) {
264 case isl_dim_cst: return 0;
265 case isl_dim_param: return 1;
266 case isl_dim_in: return 1 + space->nparam;
267 case isl_dim_out: return 1 + space->nparam + space->n_in;
268 case isl_dim_div:
269 return 1 + space->nparam + space->n_in + space->n_out;
270 default: return 0;
274 /* Return the position of the dimension of the given type and name
275 * in "ls".
276 * Return -1 if no such dimension can be found.
278 int isl_local_space_find_dim_by_name(__isl_keep isl_local_space *ls,
279 enum isl_dim_type type, const char *name)
281 if (!ls)
282 return -1;
283 if (type == isl_dim_div)
284 return -1;
285 return isl_space_find_dim_by_name(ls->dim, type, name);
288 /* Does the given dimension have a name?
290 isl_bool isl_local_space_has_dim_name(__isl_keep isl_local_space *ls,
291 enum isl_dim_type type, unsigned pos)
293 return ls ? isl_space_has_dim_name(ls->dim, type, pos) : isl_bool_error;
296 const char *isl_local_space_get_dim_name(__isl_keep isl_local_space *ls,
297 enum isl_dim_type type, unsigned pos)
299 return ls ? isl_space_get_dim_name(ls->dim, type, pos) : NULL;
302 isl_bool isl_local_space_has_dim_id(__isl_keep isl_local_space *ls,
303 enum isl_dim_type type, unsigned pos)
305 return ls ? isl_space_has_dim_id(ls->dim, type, pos) : isl_bool_error;
308 __isl_give isl_id *isl_local_space_get_dim_id(__isl_keep isl_local_space *ls,
309 enum isl_dim_type type, unsigned pos)
311 return ls ? isl_space_get_dim_id(ls->dim, type, pos) : NULL;
314 /* Return the argument of the integer division at position "pos" in "ls".
315 * All local variables in "ls" are known to have a (complete) explicit
316 * representation.
318 static __isl_give isl_aff *extract_div(__isl_keep isl_local_space *ls, int pos)
320 isl_aff *aff;
322 aff = isl_aff_alloc(isl_local_space_copy(ls));
323 if (!aff)
324 return NULL;
325 isl_seq_cpy(aff->v->el, ls->div->row[pos], aff->v->size);
326 return aff;
329 /* Return the argument of the integer division at position "pos" in "ls".
330 * The integer division at that position is known to have a complete
331 * explicit representation, but some of the others do not.
332 * Remove them first because the domain of an isl_aff
333 * is not allowed to have unknown local variables.
335 static __isl_give isl_aff *drop_unknown_divs_and_extract_div(
336 __isl_keep isl_local_space *ls, int pos)
338 int i, n;
339 isl_bool unknown;
340 isl_aff *aff;
342 ls = isl_local_space_copy(ls);
343 n = isl_local_space_dim(ls, isl_dim_div);
344 for (i = n - 1; i >= 0; --i) {
345 unknown = isl_local_space_div_is_marked_unknown(ls, i);
346 if (unknown < 0)
347 ls = isl_local_space_free(ls);
348 else if (!unknown)
349 continue;
350 ls = isl_local_space_drop_dims(ls, isl_dim_div, i, 1);
351 if (pos > i)
352 --pos;
354 aff = extract_div(ls, pos);
355 isl_local_space_free(ls);
356 return aff;
359 /* Return the argument of the integer division at position "pos" in "ls".
360 * The integer division is assumed to have a complete explicit
361 * representation. If some of the other integer divisions
362 * do not have an explicit representation, then they need
363 * to be removed first because the domain of an isl_aff
364 * is not allowed to have unknown local variables.
366 __isl_give isl_aff *isl_local_space_get_div(__isl_keep isl_local_space *ls,
367 int pos)
369 isl_bool known;
371 if (!ls)
372 return NULL;
374 if (pos < 0 || pos >= ls->div->n_row)
375 isl_die(isl_local_space_get_ctx(ls), isl_error_invalid,
376 "index out of bounds", return NULL);
378 known = isl_local_space_div_is_known(ls, pos);
379 if (known < 0)
380 return NULL;
381 if (!known)
382 isl_die(isl_local_space_get_ctx(ls), isl_error_invalid,
383 "expression of div unknown", return NULL);
384 if (!isl_local_space_is_set(ls))
385 isl_die(isl_local_space_get_ctx(ls), isl_error_invalid,
386 "cannot represent divs of map spaces", return NULL);
388 known = isl_local_space_divs_known(ls);
389 if (known < 0)
390 return NULL;
391 if (known)
392 return extract_div(ls, pos);
393 else
394 return drop_unknown_divs_and_extract_div(ls, pos);
397 /* Return the space of "ls".
399 __isl_keep isl_space *isl_local_space_peek_space(__isl_keep isl_local_space *ls)
401 if (!ls)
402 return NULL;
404 return ls->dim;
407 __isl_give isl_space *isl_local_space_get_space(__isl_keep isl_local_space *ls)
409 return isl_space_copy(isl_local_space_peek_space(ls));
412 /* Return the space of "ls".
413 * This may be either a copy or the space itself
414 * if there is only one reference to "ls".
415 * This allows the space to be modified inplace
416 * if both the local space and its space have only a single reference.
417 * The caller is not allowed to modify "ls" between this call and
418 * a subsequent call to isl_local_space_restore_space.
419 * The only exception is that isl_local_space_free can be called instead.
421 __isl_give isl_space *isl_local_space_take_space(__isl_keep isl_local_space *ls)
423 isl_space *space;
425 if (!ls)
426 return NULL;
427 if (ls->ref != 1)
428 return isl_local_space_get_space(ls);
429 space = ls->dim;
430 ls->dim = NULL;
431 return space;
434 /* Set the space of "ls" to "space", where the space of "ls" may be missing
435 * due to a preceding call to isl_local_space_take_space.
436 * However, in this case, "ls" only has a single reference and
437 * then the call to isl_local_space_cow has no effect.
439 __isl_give isl_local_space *isl_local_space_restore_space(
440 __isl_take isl_local_space *ls, __isl_take isl_space *space)
442 if (!ls || !space)
443 goto error;
445 if (ls->dim == space) {
446 isl_space_free(space);
447 return ls;
450 ls = isl_local_space_cow(ls);
451 if (!ls)
452 goto error;
453 isl_space_free(ls->dim);
454 ls->dim = space;
456 return ls;
457 error:
458 isl_local_space_free(ls);
459 isl_space_free(space);
460 return NULL;
463 /* Return the local variables of "ls".
465 __isl_keep isl_local *isl_local_space_peek_local(__isl_keep isl_local_space *ls)
467 return ls ? ls->div : NULL;
470 /* Replace the identifier of the tuple of type "type" by "id".
472 __isl_give isl_local_space *isl_local_space_set_tuple_id(
473 __isl_take isl_local_space *ls,
474 enum isl_dim_type type, __isl_take isl_id *id)
476 ls = isl_local_space_cow(ls);
477 if (!ls)
478 goto error;
479 ls->dim = isl_space_set_tuple_id(ls->dim, type, id);
480 if (!ls->dim)
481 return isl_local_space_free(ls);
482 return ls;
483 error:
484 isl_id_free(id);
485 return NULL;
488 __isl_give isl_local_space *isl_local_space_set_dim_name(
489 __isl_take isl_local_space *ls,
490 enum isl_dim_type type, unsigned pos, const char *s)
492 ls = isl_local_space_cow(ls);
493 if (!ls)
494 return NULL;
495 ls->dim = isl_space_set_dim_name(ls->dim, type, pos, s);
496 if (!ls->dim)
497 return isl_local_space_free(ls);
499 return ls;
502 __isl_give isl_local_space *isl_local_space_set_dim_id(
503 __isl_take isl_local_space *ls,
504 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
506 ls = isl_local_space_cow(ls);
507 if (!ls)
508 goto error;
509 ls->dim = isl_space_set_dim_id(ls->dim, type, pos, id);
510 if (!ls->dim)
511 return isl_local_space_free(ls);
513 return ls;
514 error:
515 isl_id_free(id);
516 return NULL;
519 /* Construct a zero-dimensional local space with the given parameter domain.
521 __isl_give isl_local_space *isl_local_space_set_from_params(
522 __isl_take isl_local_space *ls)
524 isl_space *space;
526 space = isl_local_space_take_space(ls);
527 space = isl_space_set_from_params(space);
528 ls = isl_local_space_restore_space(ls, space);
530 return ls;
533 __isl_give isl_local_space *isl_local_space_reset_space(
534 __isl_take isl_local_space *ls, __isl_take isl_space *dim)
536 ls = isl_local_space_cow(ls);
537 if (!ls || !dim)
538 goto error;
540 isl_space_free(ls->dim);
541 ls->dim = dim;
543 return ls;
544 error:
545 isl_local_space_free(ls);
546 isl_space_free(dim);
547 return NULL;
550 /* Reorder the dimensions of "ls" according to the given reordering.
551 * The reordering r is assumed to have been extended with the local
552 * variables, leaving them in the same order.
554 __isl_give isl_local_space *isl_local_space_realign(
555 __isl_take isl_local_space *ls, __isl_take isl_reordering *r)
557 ls = isl_local_space_cow(ls);
558 if (!ls || !r)
559 goto error;
561 ls->div = isl_local_reorder(ls->div, isl_reordering_copy(r));
562 if (!ls->div)
563 goto error;
565 ls = isl_local_space_reset_space(ls, isl_reordering_get_space(r));
567 isl_reordering_free(r);
568 return ls;
569 error:
570 isl_local_space_free(ls);
571 isl_reordering_free(r);
572 return NULL;
575 __isl_give isl_local_space *isl_local_space_add_div(
576 __isl_take isl_local_space *ls, __isl_take isl_vec *div)
578 ls = isl_local_space_cow(ls);
579 if (!ls || !div)
580 goto error;
582 if (ls->div->n_col != div->size)
583 isl_die(isl_local_space_get_ctx(ls), isl_error_invalid,
584 "incompatible dimensions", goto error);
586 ls->div = isl_mat_add_zero_cols(ls->div, 1);
587 ls->div = isl_mat_add_rows(ls->div, 1);
588 if (!ls->div)
589 goto error;
591 isl_seq_cpy(ls->div->row[ls->div->n_row - 1], div->el, div->size);
592 isl_int_set_si(ls->div->row[ls->div->n_row - 1][div->size], 0);
594 isl_vec_free(div);
595 return ls;
596 error:
597 isl_local_space_free(ls);
598 isl_vec_free(div);
599 return NULL;
602 __isl_give isl_local_space *isl_local_space_replace_divs(
603 __isl_take isl_local_space *ls, __isl_take isl_mat *div)
605 ls = isl_local_space_cow(ls);
607 if (!ls || !div)
608 goto error;
610 isl_mat_free(ls->div);
611 ls->div = div;
612 return ls;
613 error:
614 isl_mat_free(div);
615 isl_local_space_free(ls);
616 return NULL;
619 /* Copy row "s" of "src" to row "d" of "dst", applying the expansion
620 * defined by "exp".
622 static void expand_row(__isl_keep isl_mat *dst, int d,
623 __isl_keep isl_mat *src, int s, int *exp)
625 int i;
626 unsigned c = src->n_col - src->n_row;
628 isl_seq_cpy(dst->row[d], src->row[s], c);
629 isl_seq_clr(dst->row[d] + c, dst->n_col - c);
631 for (i = 0; i < s; ++i)
632 isl_int_set(dst->row[d][c + exp[i]], src->row[s][c + i]);
635 /* Compare (known) divs.
636 * Return non-zero if at least one of the two divs is unknown.
637 * In particular, if both divs are unknown, we respect their
638 * current order. Otherwise, we sort the known div after the unknown
639 * div only if the known div depends on the unknown div.
641 static int cmp_row(isl_int *row_i, isl_int *row_j, int i, int j,
642 unsigned n_row, unsigned n_col)
644 int li, lj;
645 int unknown_i, unknown_j;
647 unknown_i = isl_int_is_zero(row_i[0]);
648 unknown_j = isl_int_is_zero(row_j[0]);
650 if (unknown_i && unknown_j)
651 return i - j;
653 if (unknown_i)
654 li = n_col - n_row + i;
655 else
656 li = isl_seq_last_non_zero(row_i, n_col);
657 if (unknown_j)
658 lj = n_col - n_row + j;
659 else
660 lj = isl_seq_last_non_zero(row_j, n_col);
662 if (li != lj)
663 return li - lj;
665 return isl_seq_cmp(row_i, row_j, n_col);
668 /* Call cmp_row for divs in a matrix.
670 int isl_mat_cmp_div(__isl_keep isl_mat *div, int i, int j)
672 return cmp_row(div->row[i], div->row[j], i, j, div->n_row, div->n_col);
675 /* Call cmp_row for divs in a basic map.
677 static int bmap_cmp_row(__isl_keep isl_basic_map *bmap, int i, int j,
678 unsigned total)
680 return cmp_row(bmap->div[i], bmap->div[j], i, j, bmap->n_div, total);
683 /* Sort the divs in "bmap".
685 * We first make sure divs are placed after divs on which they depend.
686 * Then we perform a simple insertion sort based on the same ordering
687 * that is used in isl_merge_divs.
689 __isl_give isl_basic_map *isl_basic_map_sort_divs(
690 __isl_take isl_basic_map *bmap)
692 int i, j;
693 unsigned total;
695 bmap = isl_basic_map_order_divs(bmap);
696 if (!bmap)
697 return NULL;
698 if (bmap->n_div <= 1)
699 return bmap;
701 total = 2 + isl_basic_map_total_dim(bmap);
702 for (i = 1; i < bmap->n_div; ++i) {
703 for (j = i - 1; j >= 0; --j) {
704 if (bmap_cmp_row(bmap, j, j + 1, total) <= 0)
705 break;
706 isl_basic_map_swap_div(bmap, j, j + 1);
710 return bmap;
713 /* Sort the divs in the basic maps of "map".
715 __isl_give isl_map *isl_map_sort_divs(__isl_take isl_map *map)
717 return isl_map_inline_foreach_basic_map(map, &isl_basic_map_sort_divs);
720 /* Combine the two lists of divs into a single list.
721 * For each row i in div1, exp1[i] is set to the position of the corresponding
722 * row in the result. Similarly for div2 and exp2.
723 * This function guarantees
724 * exp1[i] >= i
725 * exp1[i+1] > exp1[i]
726 * For optimal merging, the two input list should have been sorted.
728 __isl_give isl_mat *isl_merge_divs(__isl_keep isl_mat *div1,
729 __isl_keep isl_mat *div2, int *exp1, int *exp2)
731 int i, j, k;
732 isl_mat *div = NULL;
733 unsigned d;
735 if (!div1 || !div2)
736 return NULL;
738 d = div1->n_col - div1->n_row;
739 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row,
740 d + div1->n_row + div2->n_row);
741 if (!div)
742 return NULL;
744 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) {
745 int cmp;
747 expand_row(div, k, div1, i, exp1);
748 expand_row(div, k + 1, div2, j, exp2);
750 cmp = isl_mat_cmp_div(div, k, k + 1);
751 if (cmp == 0) {
752 exp1[i++] = k;
753 exp2[j++] = k;
754 } else if (cmp < 0) {
755 exp1[i++] = k;
756 } else {
757 exp2[j++] = k;
758 isl_seq_cpy(div->row[k], div->row[k + 1], div->n_col);
761 for (; i < div1->n_row; ++i, ++k) {
762 expand_row(div, k, div1, i, exp1);
763 exp1[i] = k;
765 for (; j < div2->n_row; ++j, ++k) {
766 expand_row(div, k, div2, j, exp2);
767 exp2[j] = k;
770 div->n_row = k;
771 div->n_col = d + k;
773 return div;
776 /* Swap divs "a" and "b" in "ls".
778 __isl_give isl_local_space *isl_local_space_swap_div(
779 __isl_take isl_local_space *ls, int a, int b)
781 int offset;
783 ls = isl_local_space_cow(ls);
784 if (!ls)
785 return NULL;
786 if (a < 0 || a >= ls->div->n_row || b < 0 || b >= ls->div->n_row)
787 isl_die(isl_local_space_get_ctx(ls), isl_error_invalid,
788 "index out of bounds", return isl_local_space_free(ls));
789 offset = ls->div->n_col - ls->div->n_row;
790 ls->div = isl_mat_swap_cols(ls->div, offset + a, offset + b);
791 ls->div = isl_mat_swap_rows(ls->div, a, b);
792 if (!ls->div)
793 return isl_local_space_free(ls);
794 return ls;
797 /* Construct a local space that contains all the divs in either
798 * "ls1" or "ls2".
800 __isl_give isl_local_space *isl_local_space_intersect(
801 __isl_take isl_local_space *ls1, __isl_take isl_local_space *ls2)
803 isl_ctx *ctx;
804 int *exp1 = NULL;
805 int *exp2 = NULL;
806 isl_mat *div = NULL;
807 isl_bool equal;
809 if (!ls1 || !ls2)
810 goto error;
812 ctx = isl_local_space_get_ctx(ls1);
813 if (!isl_space_is_equal(ls1->dim, ls2->dim))
814 isl_die(ctx, isl_error_invalid,
815 "spaces should be identical", goto error);
817 if (ls2->div->n_row == 0) {
818 isl_local_space_free(ls2);
819 return ls1;
822 if (ls1->div->n_row == 0) {
823 isl_local_space_free(ls1);
824 return ls2;
827 exp1 = isl_alloc_array(ctx, int, ls1->div->n_row);
828 exp2 = isl_alloc_array(ctx, int, ls2->div->n_row);
829 if (!exp1 || !exp2)
830 goto error;
832 div = isl_merge_divs(ls1->div, ls2->div, exp1, exp2);
833 if (!div)
834 goto error;
836 equal = isl_mat_is_equal(ls1->div, div);
837 if (equal < 0)
838 goto error;
839 if (!equal)
840 ls1 = isl_local_space_cow(ls1);
841 if (!ls1)
842 goto error;
844 free(exp1);
845 free(exp2);
846 isl_local_space_free(ls2);
847 isl_mat_free(ls1->div);
848 ls1->div = div;
850 return ls1;
851 error:
852 free(exp1);
853 free(exp2);
854 isl_mat_free(div);
855 isl_local_space_free(ls1);
856 isl_local_space_free(ls2);
857 return NULL;
860 /* Is the local variable "div" of "ls" marked as not having
861 * an explicit representation?
862 * Note that even if this variable is not marked in this way and therefore
863 * does have an explicit representation, this representation may still
864 * depend (indirectly) on other local variables that do not
865 * have an explicit representation.
867 isl_bool isl_local_space_div_is_marked_unknown(__isl_keep isl_local_space *ls,
868 int div)
870 if (!ls)
871 return isl_bool_error;
872 return isl_local_div_is_marked_unknown(ls->div, div);
875 /* Does "ls" have a complete explicit representation for div "div"?
877 isl_bool isl_local_space_div_is_known(__isl_keep isl_local_space *ls, int div)
879 if (!ls)
880 return isl_bool_error;
881 return isl_local_div_is_known(ls->div, div);
884 /* Does "ls" have an explicit representation for all local variables?
886 isl_bool isl_local_space_divs_known(__isl_keep isl_local_space *ls)
888 if (!ls)
889 return isl_bool_error;
890 return isl_local_divs_known(ls->div);
893 __isl_give isl_local_space *isl_local_space_domain(
894 __isl_take isl_local_space *ls)
896 ls = isl_local_space_drop_dims(ls, isl_dim_out,
897 0, isl_local_space_dim(ls, isl_dim_out));
898 ls = isl_local_space_cow(ls);
899 if (!ls)
900 return NULL;
901 ls->dim = isl_space_domain(ls->dim);
902 if (!ls->dim)
903 return isl_local_space_free(ls);
904 return ls;
907 __isl_give isl_local_space *isl_local_space_range(
908 __isl_take isl_local_space *ls)
910 ls = isl_local_space_drop_dims(ls, isl_dim_in,
911 0, isl_local_space_dim(ls, isl_dim_in));
912 ls = isl_local_space_cow(ls);
913 if (!ls)
914 return NULL;
916 ls->dim = isl_space_range(ls->dim);
917 if (!ls->dim)
918 return isl_local_space_free(ls);
919 return ls;
922 /* Construct a local space for a map that has the given local
923 * space as domain and that has a zero-dimensional range.
925 __isl_give isl_local_space *isl_local_space_from_domain(
926 __isl_take isl_local_space *ls)
928 ls = isl_local_space_cow(ls);
929 if (!ls)
930 return NULL;
931 ls->dim = isl_space_from_domain(ls->dim);
932 if (!ls->dim)
933 return isl_local_space_free(ls);
934 return ls;
937 __isl_give isl_local_space *isl_local_space_add_dims(
938 __isl_take isl_local_space *ls, enum isl_dim_type type, unsigned n)
940 int pos;
942 if (!ls)
943 return NULL;
944 pos = isl_local_space_dim(ls, type);
945 return isl_local_space_insert_dims(ls, type, pos, n);
948 /* Lift the basic set "bset", living in the space of "ls"
949 * to live in a space with extra coordinates corresponding
950 * to the local variables of "ls".
952 __isl_give isl_basic_set *isl_local_space_lift_basic_set(
953 __isl_take isl_local_space *ls, __isl_take isl_basic_set *bset)
955 unsigned n_local;
956 isl_space *space;
957 isl_basic_set *ls_bset;
959 space = isl_basic_set_peek_space(bset);
960 if (isl_local_space_check_has_space(ls, space) < 0)
961 goto error;
963 n_local = isl_local_space_dim(ls, isl_dim_div);
964 if (n_local == 0) {
965 isl_local_space_free(ls);
966 return bset;
969 bset = isl_basic_set_add_dims(bset, isl_dim_set, n_local);
970 ls_bset = isl_basic_set_from_local_space(ls);
971 ls_bset = isl_basic_set_lift(ls_bset);
972 ls_bset = isl_basic_set_flatten(ls_bset);
973 bset = isl_basic_set_intersect(bset, ls_bset);
975 return bset;
976 error:
977 isl_local_space_free(ls);
978 isl_basic_set_free(bset);
979 return NULL;
982 /* Lift the set "set", living in the space of "ls"
983 * to live in a space with extra coordinates corresponding
984 * to the local variables of "ls".
986 __isl_give isl_set *isl_local_space_lift_set(__isl_take isl_local_space *ls,
987 __isl_take isl_set *set)
989 unsigned n_local;
990 isl_basic_set *bset;
992 if (isl_local_space_check_has_space(ls, isl_set_peek_space(set)) < 0)
993 goto error;
995 n_local = isl_local_space_dim(ls, isl_dim_div);
996 if (n_local == 0) {
997 isl_local_space_free(ls);
998 return set;
1001 set = isl_set_add_dims(set, isl_dim_set, n_local);
1002 bset = isl_basic_set_from_local_space(ls);
1003 bset = isl_basic_set_lift(bset);
1004 bset = isl_basic_set_flatten(bset);
1005 set = isl_set_intersect(set, isl_set_from_basic_set(bset));
1007 return set;
1008 error:
1009 isl_local_space_free(ls);
1010 isl_set_free(set);
1011 return NULL;
1014 /* Remove common factor of non-constant terms and denominator.
1016 static void normalize_div(__isl_keep isl_local_space *ls, int div)
1018 isl_ctx *ctx = ls->div->ctx;
1019 unsigned total = ls->div->n_col - 2;
1021 isl_seq_gcd(ls->div->row[div] + 2, total, &ctx->normalize_gcd);
1022 isl_int_gcd(ctx->normalize_gcd,
1023 ctx->normalize_gcd, ls->div->row[div][0]);
1024 if (isl_int_is_one(ctx->normalize_gcd))
1025 return;
1027 isl_seq_scale_down(ls->div->row[div] + 2, ls->div->row[div] + 2,
1028 ctx->normalize_gcd, total);
1029 isl_int_divexact(ls->div->row[div][0], ls->div->row[div][0],
1030 ctx->normalize_gcd);
1031 isl_int_fdiv_q(ls->div->row[div][1], ls->div->row[div][1],
1032 ctx->normalize_gcd);
1035 /* Exploit the equalities in "eq" to simplify the expressions of
1036 * the integer divisions in "ls".
1037 * The integer divisions in "ls" are assumed to appear as regular
1038 * dimensions in "eq".
1040 __isl_give isl_local_space *isl_local_space_substitute_equalities(
1041 __isl_take isl_local_space *ls, __isl_take isl_basic_set *eq)
1043 int i, j, k;
1044 unsigned total;
1045 unsigned n_div;
1047 if (!ls || !eq)
1048 goto error;
1050 total = isl_space_dim(eq->dim, isl_dim_all);
1051 if (isl_local_space_dim(ls, isl_dim_all) != total)
1052 isl_die(isl_local_space_get_ctx(ls), isl_error_invalid,
1053 "spaces don't match", goto error);
1054 total++;
1055 n_div = eq->n_div;
1056 for (i = 0; i < eq->n_eq; ++i) {
1057 j = isl_seq_last_non_zero(eq->eq[i], total + n_div);
1058 if (j < 0 || j == 0 || j >= total)
1059 continue;
1061 for (k = 0; k < ls->div->n_row; ++k) {
1062 if (isl_int_is_zero(ls->div->row[k][1 + j]))
1063 continue;
1064 ls = isl_local_space_cow(ls);
1065 if (!ls)
1066 goto error;
1067 ls->div = isl_mat_cow(ls->div);
1068 if (!ls->div)
1069 goto error;
1070 isl_seq_elim(ls->div->row[k] + 1, eq->eq[i], j, total,
1071 &ls->div->row[k][0]);
1072 normalize_div(ls, k);
1076 isl_basic_set_free(eq);
1077 return ls;
1078 error:
1079 isl_basic_set_free(eq);
1080 isl_local_space_free(ls);
1081 return NULL;
1084 /* Plug in the affine expressions "subs" of length "subs_len" (including
1085 * the denominator and the constant term) into the variable at position "pos"
1086 * of the "n" div expressions starting at "first".
1088 * Let i be the dimension to replace and let "subs" be of the form
1090 * f/d
1092 * Any integer division starting at "first" with a non-zero coefficient for i,
1094 * floor((a i + g)/m)
1096 * is replaced by
1098 * floor((a f + d g)/(m d))
1100 __isl_give isl_local_space *isl_local_space_substitute_seq(
1101 __isl_take isl_local_space *ls,
1102 enum isl_dim_type type, unsigned pos, isl_int *subs, int subs_len,
1103 int first, int n)
1105 int i;
1106 isl_int v;
1108 if (n == 0)
1109 return ls;
1110 ls = isl_local_space_cow(ls);
1111 if (!ls)
1112 return NULL;
1113 ls->div = isl_mat_cow(ls->div);
1114 if (!ls->div)
1115 return isl_local_space_free(ls);
1117 if (first + n > ls->div->n_row)
1118 isl_die(isl_local_space_get_ctx(ls), isl_error_invalid,
1119 "index out of bounds", return isl_local_space_free(ls));
1121 pos += isl_local_space_offset(ls, type);
1123 isl_int_init(v);
1124 for (i = first; i < first + n; ++i) {
1125 if (isl_int_is_zero(ls->div->row[i][1 + pos]))
1126 continue;
1127 isl_seq_substitute(ls->div->row[i], pos, subs,
1128 ls->div->n_col, subs_len, v);
1129 normalize_div(ls, i);
1131 isl_int_clear(v);
1133 return ls;
1136 /* Plug in "subs" for dimension "type", "pos" in the integer divisions
1137 * of "ls".
1139 * Let i be the dimension to replace and let "subs" be of the form
1141 * f/d
1143 * Any integer division with a non-zero coefficient for i,
1145 * floor((a i + g)/m)
1147 * is replaced by
1149 * floor((a f + d g)/(m d))
1151 __isl_give isl_local_space *isl_local_space_substitute(
1152 __isl_take isl_local_space *ls,
1153 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
1155 ls = isl_local_space_cow(ls);
1156 if (!ls || !subs)
1157 return isl_local_space_free(ls);
1159 if (!isl_space_is_equal(ls->dim, subs->ls->dim))
1160 isl_die(isl_local_space_get_ctx(ls), isl_error_invalid,
1161 "spaces don't match", return isl_local_space_free(ls));
1162 if (isl_local_space_dim(subs->ls, isl_dim_div) != 0)
1163 isl_die(isl_local_space_get_ctx(ls), isl_error_unsupported,
1164 "cannot handle divs yet",
1165 return isl_local_space_free(ls));
1167 return isl_local_space_substitute_seq(ls, type, pos, subs->v->el,
1168 subs->v->size, 0, ls->div->n_row);
1171 isl_bool isl_local_space_is_named_or_nested(__isl_keep isl_local_space *ls,
1172 enum isl_dim_type type)
1174 if (!ls)
1175 return isl_bool_error;
1176 return isl_space_is_named_or_nested(ls->dim, type);
1179 __isl_give isl_local_space *isl_local_space_drop_dims(
1180 __isl_take isl_local_space *ls,
1181 enum isl_dim_type type, unsigned first, unsigned n)
1183 if (!ls)
1184 return NULL;
1185 if (n == 0 && !isl_local_space_is_named_or_nested(ls, type))
1186 return ls;
1188 if (isl_local_space_check_range(ls, type, first, n) < 0)
1189 return isl_local_space_free(ls);
1191 ls = isl_local_space_cow(ls);
1192 if (!ls)
1193 return NULL;
1195 if (type == isl_dim_div) {
1196 ls->div = isl_mat_drop_rows(ls->div, first, n);
1197 } else {
1198 ls->dim = isl_space_drop_dims(ls->dim, type, first, n);
1199 if (!ls->dim)
1200 return isl_local_space_free(ls);
1203 first += 1 + isl_local_space_offset(ls, type);
1204 ls->div = isl_mat_drop_cols(ls->div, first, n);
1205 if (!ls->div)
1206 return isl_local_space_free(ls);
1208 return ls;
1211 __isl_give isl_local_space *isl_local_space_insert_dims(
1212 __isl_take isl_local_space *ls,
1213 enum isl_dim_type type, unsigned first, unsigned n)
1215 if (!ls)
1216 return NULL;
1217 if (n == 0 && !isl_local_space_is_named_or_nested(ls, type))
1218 return ls;
1220 if (isl_local_space_check_range(ls, type, first, 0) < 0)
1221 return isl_local_space_free(ls);
1223 ls = isl_local_space_cow(ls);
1224 if (!ls)
1225 return NULL;
1227 if (type == isl_dim_div) {
1228 ls->div = isl_mat_insert_zero_rows(ls->div, first, n);
1229 } else {
1230 ls->dim = isl_space_insert_dims(ls->dim, type, first, n);
1231 if (!ls->dim)
1232 return isl_local_space_free(ls);
1235 first += 1 + isl_local_space_offset(ls, type);
1236 ls->div = isl_mat_insert_zero_cols(ls->div, first, n);
1237 if (!ls->div)
1238 return isl_local_space_free(ls);
1240 return ls;
1243 /* Does the linear part of "constraint" correspond to
1244 * integer division "div" in "ls"?
1246 * That is, given div = floor((c + f)/m), is the constraint of the form
1248 * f - m d + c' >= 0 [sign = 1]
1249 * or
1250 * -f + m d + c'' >= 0 [sign = -1]
1252 * If so, set *sign to the corresponding value.
1254 static isl_bool is_linear_div_constraint(__isl_keep isl_local_space *ls,
1255 isl_int *constraint, unsigned div, int *sign)
1257 isl_bool unknown;
1258 unsigned pos;
1260 unknown = isl_local_space_div_is_marked_unknown(ls, div);
1261 if (unknown < 0)
1262 return isl_bool_error;
1263 if (unknown)
1264 return isl_bool_false;
1266 pos = isl_local_space_offset(ls, isl_dim_div) + div;
1268 if (isl_int_eq(constraint[pos], ls->div->row[div][0])) {
1269 *sign = -1;
1270 if (!isl_seq_is_neg(constraint + 1,
1271 ls->div->row[div] + 2, pos - 1))
1272 return isl_bool_false;
1273 } else if (isl_int_abs_eq(constraint[pos], ls->div->row[div][0])) {
1274 *sign = 1;
1275 if (!isl_seq_eq(constraint + 1, ls->div->row[div] + 2, pos - 1))
1276 return isl_bool_false;
1277 } else {
1278 return isl_bool_false;
1280 if (isl_seq_first_non_zero(constraint + pos + 1,
1281 ls->div->n_row - div - 1) != -1)
1282 return isl_bool_false;
1283 return isl_bool_true;
1286 /* Check if the constraints pointed to by "constraint" is a div
1287 * constraint corresponding to div "div" in "ls".
1289 * That is, if div = floor(f/m), then check if the constraint is
1291 * f - m d >= 0
1292 * or
1293 * -(f-(m-1)) + m d >= 0
1295 * First check if the linear part is of the right form and
1296 * then check the constant term.
1298 isl_bool isl_local_space_is_div_constraint(__isl_keep isl_local_space *ls,
1299 isl_int *constraint, unsigned div)
1301 int sign;
1302 isl_bool linear;
1304 linear = is_linear_div_constraint(ls, constraint, div, &sign);
1305 if (linear < 0 || !linear)
1306 return linear;
1308 if (sign < 0) {
1309 int neg;
1310 isl_int_sub(ls->div->row[div][1],
1311 ls->div->row[div][1], ls->div->row[div][0]);
1312 isl_int_add_ui(ls->div->row[div][1], ls->div->row[div][1], 1);
1313 neg = isl_seq_is_neg(constraint, ls->div->row[div] + 1, 1);
1314 isl_int_sub_ui(ls->div->row[div][1], ls->div->row[div][1], 1);
1315 isl_int_add(ls->div->row[div][1],
1316 ls->div->row[div][1], ls->div->row[div][0]);
1317 if (!neg)
1318 return isl_bool_false;
1319 } else {
1320 if (!isl_int_eq(constraint[0], ls->div->row[div][1]))
1321 return isl_bool_false;
1324 return isl_bool_true;
1327 /* Is the constraint pointed to by "constraint" one
1328 * of an equality that corresponds to integer division "div" in "ls"?
1330 * That is, given an integer division of the form
1332 * a = floor((f + c)/m)
1334 * is the equality of the form
1336 * -f + m d + c' = 0
1338 * Note that the constant term is not checked explicitly, but given
1339 * that this is a valid equality constraint, the constant c' necessarily
1340 * has a value close to -c.
1342 isl_bool isl_local_space_is_div_equality(__isl_keep isl_local_space *ls,
1343 isl_int *constraint, unsigned div)
1345 int sign;
1346 isl_bool linear;
1348 linear = is_linear_div_constraint(ls, constraint, div, &sign);
1349 if (linear < 0 || !linear)
1350 return linear;
1352 return sign < 0;
1356 * Set active[i] to 1 if the dimension at position i is involved
1357 * in the linear expression l.
1359 int *isl_local_space_get_active(__isl_keep isl_local_space *ls, isl_int *l)
1361 int i, j;
1362 isl_ctx *ctx;
1363 int *active = NULL;
1364 unsigned total;
1365 unsigned offset;
1367 ctx = isl_local_space_get_ctx(ls);
1368 total = isl_local_space_dim(ls, isl_dim_all);
1369 active = isl_calloc_array(ctx, int, total);
1370 if (total && !active)
1371 return NULL;
1373 for (i = 0; i < total; ++i)
1374 active[i] = !isl_int_is_zero(l[i]);
1376 offset = isl_local_space_offset(ls, isl_dim_div) - 1;
1377 for (i = ls->div->n_row - 1; i >= 0; --i) {
1378 if (!active[offset + i])
1379 continue;
1380 for (j = 0; j < total; ++j)
1381 active[j] |= !isl_int_is_zero(ls->div->row[i][2 + j]);
1384 return active;
1387 /* Given a local space "ls" of a set, create a local space
1388 * for the lift of the set. In particular, the result
1389 * is of the form [dim -> local[..]], with ls->div->n_row variables in the
1390 * range of the wrapped map.
1392 __isl_give isl_local_space *isl_local_space_lift(
1393 __isl_take isl_local_space *ls)
1395 ls = isl_local_space_cow(ls);
1396 if (!ls)
1397 return NULL;
1399 ls->dim = isl_space_lift(ls->dim, ls->div->n_row);
1400 ls->div = isl_mat_drop_rows(ls->div, 0, ls->div->n_row);
1401 if (!ls->dim || !ls->div)
1402 return isl_local_space_free(ls);
1404 return ls;
1407 /* Construct a basic map that maps a set living in local space "ls"
1408 * to the corresponding lifted local space.
1410 __isl_give isl_basic_map *isl_local_space_lifting(
1411 __isl_take isl_local_space *ls)
1413 isl_basic_map *lifting;
1414 isl_basic_set *bset;
1416 if (!ls)
1417 return NULL;
1418 if (!isl_local_space_is_set(ls))
1419 isl_die(isl_local_space_get_ctx(ls), isl_error_invalid,
1420 "lifting only defined on set spaces", goto error);
1422 bset = isl_basic_set_from_local_space(ls);
1423 lifting = isl_basic_set_unwrap(isl_basic_set_lift(bset));
1424 lifting = isl_basic_map_domain_map(lifting);
1425 lifting = isl_basic_map_reverse(lifting);
1427 return lifting;
1428 error:
1429 isl_local_space_free(ls);
1430 return NULL;
1433 /* Compute the preimage of "ls" under the function represented by "ma".
1434 * In other words, plug in "ma" in "ls". The result is a local space
1435 * that is part of the domain space of "ma".
1437 * If the divs in "ls" are represented as
1439 * floor((a_i(p) + b_i x + c_i(divs))/n_i)
1441 * and ma is represented by
1443 * x = D(p) + F(y) + G(divs')
1445 * then the resulting divs are
1447 * floor((a_i(p) + b_i D(p) + b_i F(y) + B_i G(divs') + c_i(divs))/n_i)
1449 * We first copy over the divs from "ma" and then
1450 * we add the modified divs from "ls".
1452 __isl_give isl_local_space *isl_local_space_preimage_multi_aff(
1453 __isl_take isl_local_space *ls, __isl_take isl_multi_aff *ma)
1455 int i;
1456 isl_space *space;
1457 isl_local_space *res = NULL;
1458 int n_div_ls, n_div_ma;
1459 isl_int f, c1, c2, g;
1461 ma = isl_multi_aff_align_divs(ma);
1462 if (!ls || !ma)
1463 goto error;
1464 if (!isl_space_is_range_internal(ls->dim, ma->space))
1465 isl_die(isl_local_space_get_ctx(ls), isl_error_invalid,
1466 "spaces don't match", goto error);
1468 n_div_ls = isl_local_space_dim(ls, isl_dim_div);
1469 n_div_ma = ma->n ? isl_aff_dim(ma->u.p[0], isl_dim_div) : 0;
1471 space = isl_space_domain(isl_multi_aff_get_space(ma));
1472 res = isl_local_space_alloc(space, n_div_ma + n_div_ls);
1473 if (!res)
1474 goto error;
1476 if (n_div_ma) {
1477 isl_mat_free(res->div);
1478 res->div = isl_mat_copy(ma->u.p[0]->ls->div);
1479 res->div = isl_mat_add_zero_cols(res->div, n_div_ls);
1480 res->div = isl_mat_add_rows(res->div, n_div_ls);
1481 if (!res->div)
1482 goto error;
1485 isl_int_init(f);
1486 isl_int_init(c1);
1487 isl_int_init(c2);
1488 isl_int_init(g);
1490 for (i = 0; i < ls->div->n_row; ++i) {
1491 if (isl_int_is_zero(ls->div->row[i][0])) {
1492 isl_int_set_si(res->div->row[n_div_ma + i][0], 0);
1493 continue;
1495 isl_seq_preimage(res->div->row[n_div_ma + i], ls->div->row[i],
1496 ma, 0, 0, n_div_ma, n_div_ls, f, c1, c2, g, 1);
1497 normalize_div(res, n_div_ma + i);
1500 isl_int_clear(f);
1501 isl_int_clear(c1);
1502 isl_int_clear(c2);
1503 isl_int_clear(g);
1505 isl_local_space_free(ls);
1506 isl_multi_aff_free(ma);
1507 return res;
1508 error:
1509 isl_local_space_free(ls);
1510 isl_multi_aff_free(ma);
1511 isl_local_space_free(res);
1512 return NULL;
1515 /* Move the "n" dimensions of "src_type" starting at "src_pos" of "ls"
1516 * to dimensions of "dst_type" at "dst_pos".
1518 * Moving to/from local dimensions is not allowed.
1519 * We currently assume that the dimension type changes.
1521 __isl_give isl_local_space *isl_local_space_move_dims(
1522 __isl_take isl_local_space *ls,
1523 enum isl_dim_type dst_type, unsigned dst_pos,
1524 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
1526 unsigned g_dst_pos;
1527 unsigned g_src_pos;
1529 if (!ls)
1530 return NULL;
1531 if (n == 0 &&
1532 !isl_local_space_is_named_or_nested(ls, src_type) &&
1533 !isl_local_space_is_named_or_nested(ls, dst_type))
1534 return ls;
1536 if (isl_local_space_check_range(ls, src_type, src_pos, n) < 0)
1537 return isl_local_space_free(ls);
1538 if (isl_local_space_check_range(ls, dst_type, dst_pos, 0) < 0)
1539 return isl_local_space_free(ls);
1540 if (src_type == isl_dim_div)
1541 isl_die(isl_local_space_get_ctx(ls), isl_error_invalid,
1542 "cannot move divs", return isl_local_space_free(ls));
1543 if (dst_type == isl_dim_div)
1544 isl_die(isl_local_space_get_ctx(ls), isl_error_invalid,
1545 "cannot move to divs", return isl_local_space_free(ls));
1546 if (dst_type == src_type && dst_pos == src_pos)
1547 return ls;
1548 if (dst_type == src_type)
1549 isl_die(isl_local_space_get_ctx(ls), isl_error_unsupported,
1550 "moving dims within the same type not supported",
1551 return isl_local_space_free(ls));
1553 ls = isl_local_space_cow(ls);
1554 if (!ls)
1555 return NULL;
1557 g_src_pos = 1 + isl_local_space_offset(ls, src_type) + src_pos;
1558 g_dst_pos = 1 + isl_local_space_offset(ls, dst_type) + dst_pos;
1559 if (dst_type > src_type)
1560 g_dst_pos -= n;
1561 ls->div = isl_mat_move_cols(ls->div, g_dst_pos, g_src_pos, n);
1562 if (!ls->div)
1563 return isl_local_space_free(ls);
1564 ls->dim = isl_space_move_dims(ls->dim, dst_type, dst_pos,
1565 src_type, src_pos, n);
1566 if (!ls->dim)
1567 return isl_local_space_free(ls);
1569 return ls;
1572 /* Remove any internal structure of the domain of "ls".
1573 * If there is any such internal structure in the input,
1574 * then the name of the corresponding space is also removed.
1576 __isl_give isl_local_space *isl_local_space_flatten_domain(
1577 __isl_take isl_local_space *ls)
1579 if (!ls)
1580 return NULL;
1582 if (!ls->dim->nested[0])
1583 return ls;
1585 ls = isl_local_space_cow(ls);
1586 if (!ls)
1587 return NULL;
1589 ls->dim = isl_space_flatten_domain(ls->dim);
1590 if (!ls->dim)
1591 return isl_local_space_free(ls);
1593 return ls;
1596 /* Remove any internal structure of the range of "ls".
1597 * If there is any such internal structure in the input,
1598 * then the name of the corresponding space is also removed.
1600 __isl_give isl_local_space *isl_local_space_flatten_range(
1601 __isl_take isl_local_space *ls)
1603 if (!ls)
1604 return NULL;
1606 if (!ls->dim->nested[1])
1607 return ls;
1609 ls = isl_local_space_cow(ls);
1610 if (!ls)
1611 return NULL;
1613 ls->dim = isl_space_flatten_range(ls->dim);
1614 if (!ls->dim)
1615 return isl_local_space_free(ls);
1617 return ls;
1620 /* Given the local space "ls" of a map, return the local space of a set
1621 * that lives in a space that wraps the space of "ls" and that has
1622 * the same divs.
1624 __isl_give isl_local_space *isl_local_space_wrap(__isl_take isl_local_space *ls)
1626 ls = isl_local_space_cow(ls);
1627 if (!ls)
1628 return NULL;
1630 ls->dim = isl_space_wrap(ls->dim);
1631 if (!ls->dim)
1632 return isl_local_space_free(ls);
1634 return ls;
1637 /* Lift the point "pnt", living in the space of "ls"
1638 * to live in a space with extra coordinates corresponding
1639 * to the local variables of "ls".
1641 __isl_give isl_point *isl_local_space_lift_point(__isl_take isl_local_space *ls,
1642 __isl_take isl_point *pnt)
1644 unsigned n_local;
1645 isl_space *space;
1646 isl_local *local;
1647 isl_vec *vec;
1649 if (isl_local_space_check_has_space(ls, isl_point_peek_space(pnt)) < 0)
1650 goto error;
1652 local = isl_local_space_peek_local(ls);
1653 n_local = isl_local_space_dim(ls, isl_dim_div);
1655 space = isl_point_take_space(pnt);
1656 vec = isl_point_take_vec(pnt);
1658 space = isl_space_lift(space, n_local);
1659 vec = isl_local_extend_point_vec(local, vec);
1661 pnt = isl_point_restore_vec(pnt, vec);
1662 pnt = isl_point_restore_space(pnt, space);
1664 isl_local_space_free(ls);
1666 return pnt;
1667 error:
1668 isl_local_space_free(ls);
1669 isl_point_free(pnt);
1670 return NULL;