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,
10 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
13 #include <isl_ctx_private.h>
14 #include <isl_map_private.h>
15 #include <isl_local_space_private.h>
16 #include <isl_space_private.h>
17 #include <isl_mat_private.h>
18 #include <isl_aff_private.h>
19 #include <isl_vec_private.h>
22 isl_ctx
*isl_local_space_get_ctx(__isl_keep isl_local_space
*ls
)
24 return ls
? ls
->dim
->ctx
: NULL
;
27 __isl_give isl_local_space
*isl_local_space_alloc_div(__isl_take isl_space
*dim
,
28 __isl_take isl_mat
*div
)
31 isl_local_space
*ls
= NULL
;
36 ctx
= isl_space_get_ctx(dim
);
37 ls
= isl_calloc_type(ctx
, struct isl_local_space
);
49 isl_local_space_free(ls
);
53 __isl_give isl_local_space
*isl_local_space_alloc(__isl_take isl_space
*dim
,
63 total
= isl_space_dim(dim
, isl_dim_all
);
65 ctx
= isl_space_get_ctx(dim
);
66 div
= isl_mat_alloc(ctx
, n_div
, 1 + 1 + total
+ n_div
);
67 return isl_local_space_alloc_div(dim
, div
);
70 __isl_give isl_local_space
*isl_local_space_from_space(__isl_take isl_space
*dim
)
72 return isl_local_space_alloc(dim
, 0);
75 __isl_give isl_local_space
*isl_local_space_copy(__isl_keep isl_local_space
*ls
)
84 __isl_give isl_local_space
*isl_local_space_dup(__isl_keep isl_local_space
*ls
)
89 return isl_local_space_alloc_div(isl_space_copy(ls
->dim
),
90 isl_mat_copy(ls
->div
));
94 __isl_give isl_local_space
*isl_local_space_cow(__isl_take isl_local_space
*ls
)
102 return isl_local_space_dup(ls
);
105 __isl_null isl_local_space
*isl_local_space_free(
106 __isl_take isl_local_space
*ls
)
114 isl_space_free(ls
->dim
);
115 isl_mat_free(ls
->div
);
122 /* Is the local space that of a set?
124 int isl_local_space_is_set(__isl_keep isl_local_space
*ls
)
126 return ls
? isl_space_is_set(ls
->dim
) : -1;
129 /* Return true if the two local spaces are identical, with identical
130 * expressions for the integer divisions.
132 int isl_local_space_is_equal(__isl_keep isl_local_space
*ls1
,
133 __isl_keep isl_local_space
*ls2
)
140 equal
= isl_space_is_equal(ls1
->dim
, ls2
->dim
);
141 if (equal
< 0 || !equal
)
144 if (!isl_local_space_divs_known(ls1
))
146 if (!isl_local_space_divs_known(ls2
))
149 return isl_mat_is_equal(ls1
->div
, ls2
->div
);
152 /* Compare two isl_local_spaces.
154 * Return -1 if "ls1" is "smaller" than "ls2", 1 if "ls1" is "greater"
155 * than "ls2" and 0 if they are equal.
157 * The order is fairly arbitrary. We do "prefer" divs that only involve
158 * earlier dimensions in the sense that we consider local spaces where
159 * the first differing div involves earlier dimensions to be smaller.
161 int isl_local_space_cmp(__isl_keep isl_local_space
*ls1
,
162 __isl_keep isl_local_space
*ls2
)
177 cmp
= isl_space_cmp(ls1
->dim
, ls2
->dim
);
181 if (ls1
->div
->n_row
!= ls2
->div
->n_row
)
182 return ls1
->div
->n_row
- ls2
->div
->n_row
;
184 n_col
= isl_mat_cols(ls1
->div
);
185 for (i
= 0; i
< ls1
->div
->n_row
; ++i
) {
186 known1
= isl_local_space_div_is_known(ls1
, i
);
187 known2
= isl_local_space_div_is_known(ls2
, i
);
188 if (!known1
&& !known2
)
194 last1
= isl_seq_last_non_zero(ls1
->div
->row
[i
] + 1, n_col
- 1);
195 last2
= isl_seq_last_non_zero(ls2
->div
->row
[i
] + 1, n_col
- 1);
197 return last1
- last2
;
198 cmp
= isl_seq_cmp(ls1
->div
->row
[i
], ls2
->div
->row
[i
], n_col
);
206 int isl_local_space_dim(__isl_keep isl_local_space
*ls
,
207 enum isl_dim_type type
)
211 if (type
== isl_dim_div
)
212 return ls
->div
->n_row
;
213 if (type
== isl_dim_all
)
214 return isl_space_dim(ls
->dim
, isl_dim_all
) + ls
->div
->n_row
;
215 return isl_space_dim(ls
->dim
, type
);
218 unsigned isl_local_space_offset(__isl_keep isl_local_space
*ls
,
219 enum isl_dim_type type
)
228 case isl_dim_cst
: return 0;
229 case isl_dim_param
: return 1;
230 case isl_dim_in
: return 1 + dim
->nparam
;
231 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
232 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
237 /* Does the given dimension have a name?
239 int isl_local_space_has_dim_name(__isl_keep isl_local_space
*ls
,
240 enum isl_dim_type type
, unsigned pos
)
242 return ls
? isl_space_has_dim_name(ls
->dim
, type
, pos
) : -1;
245 const char *isl_local_space_get_dim_name(__isl_keep isl_local_space
*ls
,
246 enum isl_dim_type type
, unsigned pos
)
248 return ls
? isl_space_get_dim_name(ls
->dim
, type
, pos
) : NULL
;
251 int isl_local_space_has_dim_id(__isl_keep isl_local_space
*ls
,
252 enum isl_dim_type type
, unsigned pos
)
254 return ls
? isl_space_has_dim_id(ls
->dim
, type
, pos
) : -1;
257 __isl_give isl_id
*isl_local_space_get_dim_id(__isl_keep isl_local_space
*ls
,
258 enum isl_dim_type type
, unsigned pos
)
260 return ls
? isl_space_get_dim_id(ls
->dim
, type
, pos
) : NULL
;
263 __isl_give isl_aff
*isl_local_space_get_div(__isl_keep isl_local_space
*ls
,
271 if (pos
< 0 || pos
>= ls
->div
->n_row
)
272 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
273 "index out of bounds", return NULL
);
275 if (isl_int_is_zero(ls
->div
->row
[pos
][0]))
276 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
277 "expression of div unknown", return NULL
);
278 if (!isl_local_space_is_set(ls
))
279 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
280 "cannot represent divs of map spaces", return NULL
);
282 aff
= isl_aff_alloc(isl_local_space_copy(ls
));
285 isl_seq_cpy(aff
->v
->el
, ls
->div
->row
[pos
], aff
->v
->size
);
289 __isl_give isl_space
*isl_local_space_get_space(__isl_keep isl_local_space
*ls
)
294 return isl_space_copy(ls
->dim
);
297 /* Replace the identifier of the tuple of type "type" by "id".
299 __isl_give isl_local_space
*isl_local_space_set_tuple_id(
300 __isl_take isl_local_space
*ls
,
301 enum isl_dim_type type
, __isl_take isl_id
*id
)
303 ls
= isl_local_space_cow(ls
);
306 ls
->dim
= isl_space_set_tuple_id(ls
->dim
, type
, id
);
308 return isl_local_space_free(ls
);
315 __isl_give isl_local_space
*isl_local_space_set_dim_name(
316 __isl_take isl_local_space
*ls
,
317 enum isl_dim_type type
, unsigned pos
, const char *s
)
319 ls
= isl_local_space_cow(ls
);
322 ls
->dim
= isl_space_set_dim_name(ls
->dim
, type
, pos
, s
);
324 return isl_local_space_free(ls
);
329 __isl_give isl_local_space
*isl_local_space_set_dim_id(
330 __isl_take isl_local_space
*ls
,
331 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
333 ls
= isl_local_space_cow(ls
);
336 ls
->dim
= isl_space_set_dim_id(ls
->dim
, type
, pos
, id
);
338 return isl_local_space_free(ls
);
346 __isl_give isl_local_space
*isl_local_space_reset_space(
347 __isl_take isl_local_space
*ls
, __isl_take isl_space
*dim
)
349 ls
= isl_local_space_cow(ls
);
353 isl_space_free(ls
->dim
);
358 isl_local_space_free(ls
);
363 /* Reorder the columns of the given div definitions according to the
365 * The order of the divs themselves is assumed not to change.
367 static __isl_give isl_mat
*reorder_divs(__isl_take isl_mat
*div
,
368 __isl_take isl_reordering
*r
)
377 extra
= isl_space_dim(r
->dim
, isl_dim_all
) + div
->n_row
- r
->len
;
378 mat
= isl_mat_alloc(div
->ctx
, div
->n_row
, div
->n_col
+ extra
);
382 for (i
= 0; i
< div
->n_row
; ++i
) {
383 isl_seq_cpy(mat
->row
[i
], div
->row
[i
], 2);
384 isl_seq_clr(mat
->row
[i
] + 2, mat
->n_col
- 2);
385 for (j
= 0; j
< r
->len
; ++j
)
386 isl_int_set(mat
->row
[i
][2 + r
->pos
[j
]],
390 isl_reordering_free(r
);
394 isl_reordering_free(r
);
399 /* Reorder the dimensions of "ls" according to the given reordering.
400 * The reordering r is assumed to have been extended with the local
401 * variables, leaving them in the same order.
403 __isl_give isl_local_space
*isl_local_space_realign(
404 __isl_take isl_local_space
*ls
, __isl_take isl_reordering
*r
)
406 ls
= isl_local_space_cow(ls
);
410 ls
->div
= reorder_divs(ls
->div
, isl_reordering_copy(r
));
414 ls
= isl_local_space_reset_space(ls
, isl_space_copy(r
->dim
));
416 isl_reordering_free(r
);
419 isl_local_space_free(ls
);
420 isl_reordering_free(r
);
424 __isl_give isl_local_space
*isl_local_space_add_div(
425 __isl_take isl_local_space
*ls
, __isl_take isl_vec
*div
)
427 ls
= isl_local_space_cow(ls
);
431 if (ls
->div
->n_col
!= div
->size
)
432 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
433 "incompatible dimensions", goto error
);
435 ls
->div
= isl_mat_add_zero_cols(ls
->div
, 1);
436 ls
->div
= isl_mat_add_rows(ls
->div
, 1);
440 isl_seq_cpy(ls
->div
->row
[ls
->div
->n_row
- 1], div
->el
, div
->size
);
441 isl_int_set_si(ls
->div
->row
[ls
->div
->n_row
- 1][div
->size
], 0);
446 isl_local_space_free(ls
);
451 __isl_give isl_local_space
*isl_local_space_replace_divs(
452 __isl_take isl_local_space
*ls
, __isl_take isl_mat
*div
)
454 ls
= isl_local_space_cow(ls
);
459 isl_mat_free(ls
->div
);
464 isl_local_space_free(ls
);
468 /* Copy row "s" of "src" to row "d" of "dst", applying the expansion
471 static void expand_row(__isl_keep isl_mat
*dst
, int d
,
472 __isl_keep isl_mat
*src
, int s
, int *exp
)
475 unsigned c
= src
->n_col
- src
->n_row
;
477 isl_seq_cpy(dst
->row
[d
], src
->row
[s
], c
);
478 isl_seq_clr(dst
->row
[d
] + c
, dst
->n_col
- c
);
480 for (i
= 0; i
< s
; ++i
)
481 isl_int_set(dst
->row
[d
][c
+ exp
[i
]], src
->row
[s
][c
+ i
]);
484 /* Compare (known) divs.
485 * Return non-zero if at least one of the two divs is unknown.
486 * In particular, if both divs are unknown, we respect their
487 * current order. Otherwise, we sort the known div after the unknown
488 * div only if the known div depends on the unknown div.
490 static int cmp_row(isl_int
*row_i
, isl_int
*row_j
, int i
, int j
,
491 unsigned n_row
, unsigned n_col
)
494 int unknown_i
, unknown_j
;
496 unknown_i
= isl_int_is_zero(row_i
[0]);
497 unknown_j
= isl_int_is_zero(row_j
[0]);
499 if (unknown_i
&& unknown_j
)
503 li
= n_col
- n_row
+ i
;
505 li
= isl_seq_last_non_zero(row_i
, n_col
);
507 lj
= n_col
- n_row
+ j
;
509 lj
= isl_seq_last_non_zero(row_j
, n_col
);
514 return isl_seq_cmp(row_i
, row_j
, n_col
);
517 /* Call cmp_row for divs in a matrix.
519 int isl_mat_cmp_div(__isl_keep isl_mat
*div
, int i
, int j
)
521 return cmp_row(div
->row
[i
], div
->row
[j
], i
, j
, div
->n_row
, div
->n_col
);
524 /* Call cmp_row for divs in a basic map.
526 static int bmap_cmp_row(__isl_keep isl_basic_map
*bmap
, int i
, int j
,
529 return cmp_row(bmap
->div
[i
], bmap
->div
[j
], i
, j
, bmap
->n_div
, total
);
532 /* Sort the divs in "bmap".
534 * We first make sure divs are placed after divs on which they depend.
535 * Then we perform a simple insertion sort based on the same ordering
536 * that is used in isl_merge_divs.
538 __isl_give isl_basic_map
*isl_basic_map_sort_divs(
539 __isl_take isl_basic_map
*bmap
)
544 bmap
= isl_basic_map_order_divs(bmap
);
547 if (bmap
->n_div
<= 1)
550 total
= 2 + isl_basic_map_total_dim(bmap
);
551 for (i
= 1; i
< bmap
->n_div
; ++i
) {
552 for (j
= i
- 1; j
>= 0; --j
) {
553 if (bmap_cmp_row(bmap
, j
, j
+ 1, total
) <= 0)
555 isl_basic_map_swap_div(bmap
, j
, j
+ 1);
562 /* Sort the divs in the basic maps of "map".
564 __isl_give isl_map
*isl_map_sort_divs(__isl_take isl_map
*map
)
566 return isl_map_inline_foreach_basic_map(map
, &isl_basic_map_sort_divs
);
569 /* Combine the two lists of divs into a single list.
570 * For each row i in div1, exp1[i] is set to the position of the corresponding
571 * row in the result. Similarly for div2 and exp2.
572 * This function guarantees
574 * exp1[i+1] > exp1[i]
575 * For optimal merging, the two input list should have been sorted.
577 __isl_give isl_mat
*isl_merge_divs(__isl_keep isl_mat
*div1
,
578 __isl_keep isl_mat
*div2
, int *exp1
, int *exp2
)
587 d
= div1
->n_col
- div1
->n_row
;
588 div
= isl_mat_alloc(div1
->ctx
, 1 + div1
->n_row
+ div2
->n_row
,
589 d
+ div1
->n_row
+ div2
->n_row
);
593 for (i
= 0, j
= 0, k
= 0; i
< div1
->n_row
&& j
< div2
->n_row
; ++k
) {
596 expand_row(div
, k
, div1
, i
, exp1
);
597 expand_row(div
, k
+ 1, div2
, j
, exp2
);
599 cmp
= isl_mat_cmp_div(div
, k
, k
+ 1);
603 } else if (cmp
< 0) {
607 isl_seq_cpy(div
->row
[k
], div
->row
[k
+ 1], div
->n_col
);
610 for (; i
< div1
->n_row
; ++i
, ++k
) {
611 expand_row(div
, k
, div1
, i
, exp1
);
614 for (; j
< div2
->n_row
; ++j
, ++k
) {
615 expand_row(div
, k
, div2
, j
, exp2
);
625 /* Swap divs "a" and "b" in "ls".
627 __isl_give isl_local_space
*isl_local_space_swap_div(
628 __isl_take isl_local_space
*ls
, int a
, int b
)
632 ls
= isl_local_space_cow(ls
);
635 if (a
< 0 || a
>= ls
->div
->n_row
|| b
< 0 || b
>= ls
->div
->n_row
)
636 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
637 "index out of bounds", return isl_local_space_free(ls
));
638 offset
= ls
->div
->n_col
- ls
->div
->n_row
;
639 ls
->div
= isl_mat_swap_cols(ls
->div
, offset
+ a
, offset
+ b
);
640 ls
->div
= isl_mat_swap_rows(ls
->div
, a
, b
);
642 return isl_local_space_free(ls
);
646 /* Construct a local space that contains all the divs in either
649 __isl_give isl_local_space
*isl_local_space_intersect(
650 __isl_take isl_local_space
*ls1
, __isl_take isl_local_space
*ls2
)
660 ctx
= isl_local_space_get_ctx(ls1
);
661 if (!isl_space_is_equal(ls1
->dim
, ls2
->dim
))
662 isl_die(ctx
, isl_error_invalid
,
663 "spaces should be identical", goto error
);
665 if (ls2
->div
->n_row
== 0) {
666 isl_local_space_free(ls2
);
670 if (ls1
->div
->n_row
== 0) {
671 isl_local_space_free(ls1
);
675 exp1
= isl_alloc_array(ctx
, int, ls1
->div
->n_row
);
676 exp2
= isl_alloc_array(ctx
, int, ls2
->div
->n_row
);
680 div
= isl_merge_divs(ls1
->div
, ls2
->div
, exp1
, exp2
);
686 isl_local_space_free(ls2
);
687 isl_mat_free(ls1
->div
);
694 isl_local_space_free(ls1
);
695 isl_local_space_free(ls2
);
699 /* Does "ls" have an explicit representation for div "div"?
701 int isl_local_space_div_is_known(__isl_keep isl_local_space
*ls
, int div
)
705 if (div
< 0 || div
>= ls
->div
->n_row
)
706 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
707 "position out of bounds", return -1);
708 return !isl_int_is_zero(ls
->div
->row
[div
][0]);
711 int isl_local_space_divs_known(__isl_keep isl_local_space
*ls
)
718 for (i
= 0; i
< ls
->div
->n_row
; ++i
)
719 if (isl_int_is_zero(ls
->div
->row
[i
][0]))
725 __isl_give isl_local_space
*isl_local_space_domain(
726 __isl_take isl_local_space
*ls
)
728 ls
= isl_local_space_drop_dims(ls
, isl_dim_out
,
729 0, isl_local_space_dim(ls
, isl_dim_out
));
730 ls
= isl_local_space_cow(ls
);
733 ls
->dim
= isl_space_domain(ls
->dim
);
735 return isl_local_space_free(ls
);
739 __isl_give isl_local_space
*isl_local_space_range(
740 __isl_take isl_local_space
*ls
)
742 ls
= isl_local_space_drop_dims(ls
, isl_dim_in
,
743 0, isl_local_space_dim(ls
, isl_dim_in
));
744 ls
= isl_local_space_cow(ls
);
748 ls
->dim
= isl_space_range(ls
->dim
);
750 return isl_local_space_free(ls
);
754 /* Construct a local space for a map that has the given local
755 * space as domain and that has a zero-dimensional range.
757 __isl_give isl_local_space
*isl_local_space_from_domain(
758 __isl_take isl_local_space
*ls
)
760 ls
= isl_local_space_cow(ls
);
763 ls
->dim
= isl_space_from_domain(ls
->dim
);
765 return isl_local_space_free(ls
);
769 __isl_give isl_local_space
*isl_local_space_add_dims(
770 __isl_take isl_local_space
*ls
, enum isl_dim_type type
, unsigned n
)
776 pos
= isl_local_space_dim(ls
, type
);
777 return isl_local_space_insert_dims(ls
, type
, pos
, n
);
780 /* Remove common factor of non-constant terms and denominator.
782 static void normalize_div(__isl_keep isl_local_space
*ls
, int div
)
784 isl_ctx
*ctx
= ls
->div
->ctx
;
785 unsigned total
= ls
->div
->n_col
- 2;
787 isl_seq_gcd(ls
->div
->row
[div
] + 2, total
, &ctx
->normalize_gcd
);
788 isl_int_gcd(ctx
->normalize_gcd
,
789 ctx
->normalize_gcd
, ls
->div
->row
[div
][0]);
790 if (isl_int_is_one(ctx
->normalize_gcd
))
793 isl_seq_scale_down(ls
->div
->row
[div
] + 2, ls
->div
->row
[div
] + 2,
794 ctx
->normalize_gcd
, total
);
795 isl_int_divexact(ls
->div
->row
[div
][0], ls
->div
->row
[div
][0],
797 isl_int_fdiv_q(ls
->div
->row
[div
][1], ls
->div
->row
[div
][1],
801 /* Exploit the equalities in "eq" to simplify the expressions of
802 * the integer divisions in "ls".
803 * The integer divisions in "ls" are assumed to appear as regular
804 * dimensions in "eq".
806 __isl_give isl_local_space
*isl_local_space_substitute_equalities(
807 __isl_take isl_local_space
*ls
, __isl_take isl_basic_set
*eq
)
816 total
= isl_space_dim(eq
->dim
, isl_dim_all
);
817 if (isl_local_space_dim(ls
, isl_dim_all
) != total
)
818 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
819 "spaces don't match", goto error
);
822 for (i
= 0; i
< eq
->n_eq
; ++i
) {
823 j
= isl_seq_last_non_zero(eq
->eq
[i
], total
+ n_div
);
824 if (j
< 0 || j
== 0 || j
>= total
)
827 for (k
= 0; k
< ls
->div
->n_row
; ++k
) {
828 if (isl_int_is_zero(ls
->div
->row
[k
][1 + j
]))
830 ls
= isl_local_space_cow(ls
);
833 ls
->div
= isl_mat_cow(ls
->div
);
836 isl_seq_elim(ls
->div
->row
[k
] + 1, eq
->eq
[i
], j
, total
,
837 &ls
->div
->row
[k
][0]);
838 normalize_div(ls
, k
);
842 isl_basic_set_free(eq
);
845 isl_basic_set_free(eq
);
846 isl_local_space_free(ls
);
850 /* Plug in the affine expressions "subs" of length "subs_len" (including
851 * the denominator and the constant term) into the variable at position "pos"
852 * of the "n" div expressions starting at "first".
854 * Let i be the dimension to replace and let "subs" be of the form
858 * Any integer division starting at "first" with a non-zero coefficient for i,
864 * floor((a f + d g)/(m d))
866 __isl_give isl_local_space
*isl_local_space_substitute_seq(
867 __isl_take isl_local_space
*ls
,
868 enum isl_dim_type type
, unsigned pos
, isl_int
*subs
, int subs_len
,
876 ls
= isl_local_space_cow(ls
);
879 ls
->div
= isl_mat_cow(ls
->div
);
881 return isl_local_space_free(ls
);
883 if (first
+ n
> ls
->div
->n_row
)
884 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
885 "index out of bounds", return isl_local_space_free(ls
));
887 pos
+= isl_local_space_offset(ls
, type
);
890 for (i
= first
; i
< ls
->div
->n_row
; ++i
) {
891 if (isl_int_is_zero(ls
->div
->row
[i
][1 + pos
]))
893 isl_seq_substitute(ls
->div
->row
[i
], pos
, subs
,
894 ls
->div
->n_col
, subs_len
, v
);
895 normalize_div(ls
, i
);
902 /* Plug in "subs" for dimension "type", "pos" in the integer divisions
905 * Let i be the dimension to replace and let "subs" be of the form
909 * Any integer division with a non-zero coefficient for i,
915 * floor((a f + d g)/(m d))
917 __isl_give isl_local_space
*isl_local_space_substitute(
918 __isl_take isl_local_space
*ls
,
919 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
921 ls
= isl_local_space_cow(ls
);
923 return isl_local_space_free(ls
);
925 if (!isl_space_is_equal(ls
->dim
, subs
->ls
->dim
))
926 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
927 "spaces don't match", return isl_local_space_free(ls
));
928 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
929 isl_die(isl_local_space_get_ctx(ls
), isl_error_unsupported
,
930 "cannot handle divs yet",
931 return isl_local_space_free(ls
));
933 return isl_local_space_substitute_seq(ls
, type
, pos
, subs
->v
->el
,
934 subs
->v
->size
, 0, ls
->div
->n_row
);
937 int isl_local_space_is_named_or_nested(__isl_keep isl_local_space
*ls
,
938 enum isl_dim_type type
)
942 return isl_space_is_named_or_nested(ls
->dim
, type
);
945 __isl_give isl_local_space
*isl_local_space_drop_dims(
946 __isl_take isl_local_space
*ls
,
947 enum isl_dim_type type
, unsigned first
, unsigned n
)
953 if (n
== 0 && !isl_local_space_is_named_or_nested(ls
, type
))
956 ctx
= isl_local_space_get_ctx(ls
);
957 if (first
+ n
> isl_local_space_dim(ls
, type
))
958 isl_die(ctx
, isl_error_invalid
, "range out of bounds",
959 return isl_local_space_free(ls
));
961 ls
= isl_local_space_cow(ls
);
965 if (type
== isl_dim_div
) {
966 ls
->div
= isl_mat_drop_rows(ls
->div
, first
, n
);
968 ls
->dim
= isl_space_drop_dims(ls
->dim
, type
, first
, n
);
970 return isl_local_space_free(ls
);
973 first
+= 1 + isl_local_space_offset(ls
, type
);
974 ls
->div
= isl_mat_drop_cols(ls
->div
, first
, n
);
976 return isl_local_space_free(ls
);
981 __isl_give isl_local_space
*isl_local_space_insert_dims(
982 __isl_take isl_local_space
*ls
,
983 enum isl_dim_type type
, unsigned first
, unsigned n
)
989 if (n
== 0 && !isl_local_space_is_named_or_nested(ls
, type
))
992 ctx
= isl_local_space_get_ctx(ls
);
993 if (first
> isl_local_space_dim(ls
, type
))
994 isl_die(ctx
, isl_error_invalid
, "position out of bounds",
995 return isl_local_space_free(ls
));
997 ls
= isl_local_space_cow(ls
);
1001 if (type
== isl_dim_div
) {
1002 ls
->div
= isl_mat_insert_zero_rows(ls
->div
, first
, n
);
1004 ls
->dim
= isl_space_insert_dims(ls
->dim
, type
, first
, n
);
1006 return isl_local_space_free(ls
);
1009 first
+= 1 + isl_local_space_offset(ls
, type
);
1010 ls
->div
= isl_mat_insert_zero_cols(ls
->div
, first
, n
);
1012 return isl_local_space_free(ls
);
1017 /* Check if the constraints pointed to by "constraint" is a div
1018 * constraint corresponding to div "div" in "ls".
1020 * That is, if div = floor(f/m), then check if the constraint is
1024 * -(f-(m-1)) + m d >= 0
1026 int isl_local_space_is_div_constraint(__isl_keep isl_local_space
*ls
,
1027 isl_int
*constraint
, unsigned div
)
1034 if (isl_int_is_zero(ls
->div
->row
[div
][0]))
1037 pos
= isl_local_space_offset(ls
, isl_dim_div
) + div
;
1039 if (isl_int_eq(constraint
[pos
], ls
->div
->row
[div
][0])) {
1041 isl_int_sub(ls
->div
->row
[div
][1],
1042 ls
->div
->row
[div
][1], ls
->div
->row
[div
][0]);
1043 isl_int_add_ui(ls
->div
->row
[div
][1], ls
->div
->row
[div
][1], 1);
1044 neg
= isl_seq_is_neg(constraint
, ls
->div
->row
[div
]+1, pos
);
1045 isl_int_sub_ui(ls
->div
->row
[div
][1], ls
->div
->row
[div
][1], 1);
1046 isl_int_add(ls
->div
->row
[div
][1],
1047 ls
->div
->row
[div
][1], ls
->div
->row
[div
][0]);
1050 if (isl_seq_first_non_zero(constraint
+pos
+1,
1051 ls
->div
->n_row
-div
-1) != -1)
1053 } else if (isl_int_abs_eq(constraint
[pos
], ls
->div
->row
[div
][0])) {
1054 if (!isl_seq_eq(constraint
, ls
->div
->row
[div
]+1, pos
))
1056 if (isl_seq_first_non_zero(constraint
+pos
+1,
1057 ls
->div
->n_row
-div
-1) != -1)
1066 * Set active[i] to 1 if the dimension at position i is involved
1067 * in the linear expression l.
1069 int *isl_local_space_get_active(__isl_keep isl_local_space
*ls
, isl_int
*l
)
1077 ctx
= isl_local_space_get_ctx(ls
);
1078 total
= isl_local_space_dim(ls
, isl_dim_all
);
1079 active
= isl_calloc_array(ctx
, int, total
);
1080 if (total
&& !active
)
1083 for (i
= 0; i
< total
; ++i
)
1084 active
[i
] = !isl_int_is_zero(l
[i
]);
1086 offset
= isl_local_space_offset(ls
, isl_dim_div
) - 1;
1087 for (i
= ls
->div
->n_row
- 1; i
>= 0; --i
) {
1088 if (!active
[offset
+ i
])
1090 for (j
= 0; j
< total
; ++j
)
1091 active
[j
] |= !isl_int_is_zero(ls
->div
->row
[i
][2 + j
]);
1097 /* Given a local space "ls" of a set, create a local space
1098 * for the lift of the set. In particular, the result
1099 * is of the form [dim -> local[..]], with ls->div->n_row variables in the
1100 * range of the wrapped map.
1102 __isl_give isl_local_space
*isl_local_space_lift(
1103 __isl_take isl_local_space
*ls
)
1105 ls
= isl_local_space_cow(ls
);
1109 ls
->dim
= isl_space_lift(ls
->dim
, ls
->div
->n_row
);
1110 ls
->div
= isl_mat_drop_rows(ls
->div
, 0, ls
->div
->n_row
);
1111 if (!ls
->dim
|| !ls
->div
)
1112 return isl_local_space_free(ls
);
1117 /* Construct a basic map that maps a set living in local space "ls"
1118 * to the corresponding lifted local space.
1120 __isl_give isl_basic_map
*isl_local_space_lifting(
1121 __isl_take isl_local_space
*ls
)
1123 isl_basic_map
*lifting
;
1124 isl_basic_set
*bset
;
1128 if (!isl_local_space_is_set(ls
))
1129 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
1130 "lifting only defined on set spaces", goto error
);
1132 bset
= isl_basic_set_from_local_space(ls
);
1133 lifting
= isl_basic_set_unwrap(isl_basic_set_lift(bset
));
1134 lifting
= isl_basic_map_domain_map(lifting
);
1135 lifting
= isl_basic_map_reverse(lifting
);
1139 isl_local_space_free(ls
);
1143 /* Compute the preimage of "ls" under the function represented by "ma".
1144 * In other words, plug in "ma" in "ls". The result is a local space
1145 * that is part of the domain space of "ma".
1147 * If the divs in "ls" are represented as
1149 * floor((a_i(p) + b_i x + c_i(divs))/n_i)
1151 * and ma is represented by
1153 * x = D(p) + F(y) + G(divs')
1155 * then the resulting divs are
1157 * floor((a_i(p) + b_i D(p) + b_i F(y) + B_i G(divs') + c_i(divs))/n_i)
1159 * We first copy over the divs from "ma" and then
1160 * we add the modified divs from "ls".
1162 __isl_give isl_local_space
*isl_local_space_preimage_multi_aff(
1163 __isl_take isl_local_space
*ls
, __isl_take isl_multi_aff
*ma
)
1167 isl_local_space
*res
= NULL
;
1168 int n_div_ls
, n_div_ma
;
1169 isl_int f
, c1
, c2
, g
;
1171 ma
= isl_multi_aff_align_divs(ma
);
1174 if (!isl_space_is_range_internal(ls
->dim
, ma
->space
))
1175 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
1176 "spaces don't match", goto error
);
1178 n_div_ls
= isl_local_space_dim(ls
, isl_dim_div
);
1179 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
1181 space
= isl_space_domain(isl_multi_aff_get_space(ma
));
1182 res
= isl_local_space_alloc(space
, n_div_ma
+ n_div_ls
);
1187 isl_mat_free(res
->div
);
1188 res
->div
= isl_mat_copy(ma
->p
[0]->ls
->div
);
1189 res
->div
= isl_mat_add_zero_cols(res
->div
, n_div_ls
);
1190 res
->div
= isl_mat_add_rows(res
->div
, n_div_ls
);
1200 for (i
= 0; i
< ls
->div
->n_row
; ++i
) {
1201 if (isl_int_is_zero(ls
->div
->row
[i
][0])) {
1202 isl_int_set_si(res
->div
->row
[n_div_ma
+ i
][0], 0);
1205 isl_seq_preimage(res
->div
->row
[n_div_ma
+ i
], ls
->div
->row
[i
],
1206 ma
, 0, 0, n_div_ma
, n_div_ls
, f
, c1
, c2
, g
, 1);
1207 normalize_div(res
, n_div_ma
+ i
);
1215 isl_local_space_free(ls
);
1216 isl_multi_aff_free(ma
);
1219 isl_local_space_free(ls
);
1220 isl_multi_aff_free(ma
);
1221 isl_local_space_free(res
);
1225 /* Move the "n" dimensions of "src_type" starting at "src_pos" of "ls"
1226 * to dimensions of "dst_type" at "dst_pos".
1228 * Moving to/from local dimensions is not allowed.
1229 * We currently assume that the dimension type changes.
1231 __isl_give isl_local_space
*isl_local_space_move_dims(
1232 __isl_take isl_local_space
*ls
,
1233 enum isl_dim_type dst_type
, unsigned dst_pos
,
1234 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
1242 !isl_local_space_is_named_or_nested(ls
, src_type
) &&
1243 !isl_local_space_is_named_or_nested(ls
, dst_type
))
1246 if (src_pos
+ n
> isl_local_space_dim(ls
, src_type
))
1247 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
1248 "range out of bounds", return isl_local_space_free(ls
));
1249 if (dst_pos
> isl_local_space_dim(ls
, dst_type
))
1250 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
1251 "position out of bounds",
1252 return isl_local_space_free(ls
));
1253 if (src_type
== isl_dim_div
)
1254 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
1255 "cannot move divs", return isl_local_space_free(ls
));
1256 if (dst_type
== isl_dim_div
)
1257 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
1258 "cannot move to divs", return isl_local_space_free(ls
));
1259 if (dst_type
== src_type
&& dst_pos
== src_pos
)
1261 if (dst_type
== src_type
)
1262 isl_die(isl_local_space_get_ctx(ls
), isl_error_unsupported
,
1263 "moving dims within the same type not supported",
1264 return isl_local_space_free(ls
));
1266 ls
= isl_local_space_cow(ls
);
1270 g_src_pos
= 1 + isl_local_space_offset(ls
, src_type
) + src_pos
;
1271 g_dst_pos
= 1 + isl_local_space_offset(ls
, dst_type
) + dst_pos
;
1272 if (dst_type
> src_type
)
1274 ls
->div
= isl_mat_move_cols(ls
->div
, g_dst_pos
, g_src_pos
, n
);
1276 return isl_local_space_free(ls
);
1277 ls
->dim
= isl_space_move_dims(ls
->dim
, dst_type
, dst_pos
,
1278 src_type
, src_pos
, n
);
1280 return isl_local_space_free(ls
);
1285 /* Remove any internal structure of the domain of "ls".
1286 * If there is any such internal structure in the input,
1287 * then the name of the corresponding space is also removed.
1289 __isl_give isl_local_space
*isl_local_space_flatten_domain(
1290 __isl_take isl_local_space
*ls
)
1295 if (!ls
->dim
->nested
[0])
1298 ls
= isl_local_space_cow(ls
);
1302 ls
->dim
= isl_space_flatten_domain(ls
->dim
);
1304 return isl_local_space_free(ls
);
1309 /* Remove any internal structure of the range of "ls".
1310 * If there is any such internal structure in the input,
1311 * then the name of the corresponding space is also removed.
1313 __isl_give isl_local_space
*isl_local_space_flatten_range(
1314 __isl_take isl_local_space
*ls
)
1319 if (!ls
->dim
->nested
[1])
1322 ls
= isl_local_space_cow(ls
);
1326 ls
->dim
= isl_space_flatten_range(ls
->dim
);
1328 return isl_local_space_free(ls
);