2 * Copyright 2011 INRIA Saclay
3 * Copyright 2012 Ecole Normale Superieure
5 * Use of this software is governed by the GNU LGPLv2.1 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>
21 isl_ctx
*isl_local_space_get_ctx(__isl_keep isl_local_space
*ls
)
23 return ls
? ls
->dim
->ctx
: NULL
;
26 __isl_give isl_local_space
*isl_local_space_alloc_div(__isl_take isl_space
*dim
,
27 __isl_take isl_mat
*div
)
30 isl_local_space
*ls
= NULL
;
35 ctx
= isl_space_get_ctx(dim
);
36 ls
= isl_calloc_type(ctx
, struct isl_local_space
);
48 isl_local_space_free(ls
);
52 __isl_give isl_local_space
*isl_local_space_alloc(__isl_take isl_space
*dim
,
62 total
= isl_space_dim(dim
, isl_dim_all
);
64 ctx
= isl_space_get_ctx(dim
);
65 div
= isl_mat_alloc(ctx
, n_div
, 1 + 1 + total
+ n_div
);
66 return isl_local_space_alloc_div(dim
, div
);
69 __isl_give isl_local_space
*isl_local_space_from_space(__isl_take isl_space
*dim
)
71 return isl_local_space_alloc(dim
, 0);
74 __isl_give isl_local_space
*isl_local_space_copy(__isl_keep isl_local_space
*ls
)
83 __isl_give isl_local_space
*isl_local_space_dup(__isl_keep isl_local_space
*ls
)
88 return isl_local_space_alloc_div(isl_space_copy(ls
->dim
),
89 isl_mat_copy(ls
->div
));
93 __isl_give isl_local_space
*isl_local_space_cow(__isl_take isl_local_space
*ls
)
101 return isl_local_space_dup(ls
);
104 void *isl_local_space_free(__isl_take isl_local_space
*ls
)
112 isl_space_free(ls
->dim
);
113 isl_mat_free(ls
->div
);
120 /* Is the local space that of a set?
122 int isl_local_space_is_set(__isl_keep isl_local_space
*ls
)
124 return ls
? isl_space_is_set(ls
->dim
) : -1;
127 /* Return true if the two local spaces are identical, with identical
128 * expressions for the integer divisions.
130 int isl_local_space_is_equal(__isl_keep isl_local_space
*ls1
,
131 __isl_keep isl_local_space
*ls2
)
138 equal
= isl_space_is_equal(ls1
->dim
, ls2
->dim
);
139 if (equal
< 0 || !equal
)
142 if (!isl_local_space_divs_known(ls1
))
144 if (!isl_local_space_divs_known(ls2
))
147 return isl_mat_is_equal(ls1
->div
, ls2
->div
);
150 int isl_local_space_dim(__isl_keep isl_local_space
*ls
,
151 enum isl_dim_type type
)
155 if (type
== isl_dim_div
)
156 return ls
->div
->n_row
;
157 if (type
== isl_dim_all
)
158 return isl_space_dim(ls
->dim
, isl_dim_all
) + ls
->div
->n_row
;
159 return isl_space_dim(ls
->dim
, type
);
162 unsigned isl_local_space_offset(__isl_keep isl_local_space
*ls
,
163 enum isl_dim_type type
)
172 case isl_dim_cst
: return 0;
173 case isl_dim_param
: return 1;
174 case isl_dim_in
: return 1 + dim
->nparam
;
175 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
176 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
181 /* Does the given dimension have a name?
183 int isl_local_space_has_dim_name(__isl_keep isl_local_space
*ls
,
184 enum isl_dim_type type
, unsigned pos
)
186 return ls
? isl_space_has_dim_name(ls
->dim
, type
, pos
) : -1;
189 const char *isl_local_space_get_dim_name(__isl_keep isl_local_space
*ls
,
190 enum isl_dim_type type
, unsigned pos
)
192 return ls
? isl_space_get_dim_name(ls
->dim
, type
, pos
) : NULL
;
195 __isl_give isl_aff
*isl_local_space_get_div(__isl_keep isl_local_space
*ls
,
203 if (pos
< 0 || pos
>= ls
->div
->n_row
)
204 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
205 "index out of bounds", return NULL
);
207 if (isl_int_is_zero(ls
->div
->row
[pos
][0]))
208 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
209 "expression of div unknown", return NULL
);
211 aff
= isl_aff_alloc(isl_local_space_copy(ls
));
214 isl_seq_cpy(aff
->v
->el
, ls
->div
->row
[pos
], aff
->v
->size
);
218 __isl_give isl_space
*isl_local_space_get_space(__isl_keep isl_local_space
*ls
)
223 return isl_space_copy(ls
->dim
);
226 __isl_give isl_local_space
*isl_local_space_set_dim_name(
227 __isl_take isl_local_space
*ls
,
228 enum isl_dim_type type
, unsigned pos
, const char *s
)
230 ls
= isl_local_space_cow(ls
);
233 ls
->dim
= isl_space_set_dim_name(ls
->dim
, type
, pos
, s
);
235 return isl_local_space_free(ls
);
240 __isl_give isl_local_space
*isl_local_space_set_dim_id(
241 __isl_take isl_local_space
*ls
,
242 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
244 ls
= isl_local_space_cow(ls
);
246 return isl_id_free(id
);
247 ls
->dim
= isl_space_set_dim_id(ls
->dim
, type
, pos
, id
);
249 return isl_local_space_free(ls
);
254 __isl_give isl_local_space
*isl_local_space_reset_space(
255 __isl_take isl_local_space
*ls
, __isl_take isl_space
*dim
)
257 ls
= isl_local_space_cow(ls
);
261 isl_space_free(ls
->dim
);
266 isl_local_space_free(ls
);
271 /* Reorder the columns of the given div definitions according to the
273 * The order of the divs themselves is assumed not to change.
275 static __isl_give isl_mat
*reorder_divs(__isl_take isl_mat
*div
,
276 __isl_take isl_reordering
*r
)
285 extra
= isl_space_dim(r
->dim
, isl_dim_all
) + div
->n_row
- r
->len
;
286 mat
= isl_mat_alloc(div
->ctx
, div
->n_row
, div
->n_col
+ extra
);
290 for (i
= 0; i
< div
->n_row
; ++i
) {
291 isl_seq_cpy(mat
->row
[i
], div
->row
[i
], 2);
292 isl_seq_clr(mat
->row
[i
] + 2, mat
->n_col
- 2);
293 for (j
= 0; j
< r
->len
; ++j
)
294 isl_int_set(mat
->row
[i
][2 + r
->pos
[j
]],
298 isl_reordering_free(r
);
302 isl_reordering_free(r
);
307 /* Reorder the dimensions of "ls" according to the given reordering.
308 * The reordering r is assumed to have been extended with the local
309 * variables, leaving them in the same order.
311 __isl_give isl_local_space
*isl_local_space_realign(
312 __isl_take isl_local_space
*ls
, __isl_take isl_reordering
*r
)
314 ls
= isl_local_space_cow(ls
);
318 ls
->div
= reorder_divs(ls
->div
, isl_reordering_copy(r
));
322 ls
= isl_local_space_reset_space(ls
, isl_space_copy(r
->dim
));
324 isl_reordering_free(r
);
327 isl_local_space_free(ls
);
328 isl_reordering_free(r
);
332 __isl_give isl_local_space
*isl_local_space_add_div(
333 __isl_take isl_local_space
*ls
, __isl_take isl_vec
*div
)
335 ls
= isl_local_space_cow(ls
);
339 if (ls
->div
->n_col
!= div
->size
)
340 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
341 "incompatible dimensions", goto error
);
343 ls
->div
= isl_mat_add_zero_cols(ls
->div
, 1);
344 ls
->div
= isl_mat_add_rows(ls
->div
, 1);
348 isl_seq_cpy(ls
->div
->row
[ls
->div
->n_row
- 1], div
->el
, div
->size
);
349 isl_int_set_si(ls
->div
->row
[ls
->div
->n_row
- 1][div
->size
], 0);
354 isl_local_space_free(ls
);
359 __isl_give isl_local_space
*isl_local_space_replace_divs(
360 __isl_take isl_local_space
*ls
, __isl_take isl_mat
*div
)
362 ls
= isl_local_space_cow(ls
);
367 isl_mat_free(ls
->div
);
372 isl_local_space_free(ls
);
376 /* Copy row "s" of "src" to row "d" of "dst", applying the expansion
379 static void expand_row(__isl_keep isl_mat
*dst
, int d
,
380 __isl_keep isl_mat
*src
, int s
, int *exp
)
383 unsigned c
= src
->n_col
- src
->n_row
;
385 isl_seq_cpy(dst
->row
[d
], src
->row
[s
], c
);
386 isl_seq_clr(dst
->row
[d
] + c
, dst
->n_col
- c
);
388 for (i
= 0; i
< s
; ++i
)
389 isl_int_set(dst
->row
[d
][c
+ exp
[i
]], src
->row
[s
][c
+ i
]);
392 /* Compare (known) divs.
393 * Return non-zero if at least one of the two divs is unknown.
394 * In particular, if both divs are unknown, we respect their
395 * current order. Otherwise, we sort the known div after the unknown
396 * div only if the known div depends on the unknown div.
398 static int cmp_row(isl_int
*row_i
, isl_int
*row_j
, int i
, int j
,
399 unsigned n_row
, unsigned n_col
)
402 int unknown_i
, unknown_j
;
404 unknown_i
= isl_int_is_zero(row_i
[0]);
405 unknown_j
= isl_int_is_zero(row_j
[0]);
407 if (unknown_i
&& unknown_j
)
411 li
= n_col
- n_row
+ i
;
413 li
= isl_seq_last_non_zero(row_i
, n_col
);
415 lj
= n_col
- n_row
+ j
;
417 lj
= isl_seq_last_non_zero(row_j
, n_col
);
422 return isl_seq_cmp(row_i
, row_j
, n_col
);
425 /* Call cmp_row for divs in a matrix.
427 static int mat_cmp_row(__isl_keep isl_mat
*div
, int i
, int j
)
429 return cmp_row(div
->row
[i
], div
->row
[j
], i
, j
, div
->n_row
, div
->n_col
);
432 /* Call cmp_row for divs in a basic map.
434 static int bmap_cmp_row(__isl_keep isl_basic_map
*bmap
, int i
, int j
,
437 return cmp_row(bmap
->div
[i
], bmap
->div
[j
], i
, j
, bmap
->n_div
, total
);
440 /* Sort the divs in "bmap".
442 * We first make sure divs are placed after divs on which they depend.
443 * Then we perform a simple insertion sort based on the same ordering
444 * that is used in isl_merge_divs.
446 __isl_give isl_basic_map
*isl_basic_map_sort_divs(
447 __isl_take isl_basic_map
*bmap
)
452 bmap
= isl_basic_map_order_divs(bmap
);
455 if (bmap
->n_div
<= 1)
458 total
= 2 + isl_basic_map_total_dim(bmap
);
459 for (i
= 1; i
< bmap
->n_div
; ++i
) {
460 for (j
= i
- 1; j
>= 0; --j
) {
461 if (bmap_cmp_row(bmap
, j
, j
+ 1, total
) <= 0)
463 isl_basic_map_swap_div(bmap
, j
, j
+ 1);
470 /* Sort the divs in the basic maps of "map".
472 __isl_give isl_map
*isl_map_sort_divs(__isl_take isl_map
*map
)
474 return isl_map_inline_foreach_basic_map(map
, &isl_basic_map_sort_divs
);
477 /* Combine the two lists of divs into a single list.
478 * For each row i in div1, exp1[i] is set to the position of the corresponding
479 * row in the result. Similarly for div2 and exp2.
480 * This function guarantees
482 * exp1[i+1] > exp1[i]
483 * For optimal merging, the two input list should have been sorted.
485 __isl_give isl_mat
*isl_merge_divs(__isl_keep isl_mat
*div1
,
486 __isl_keep isl_mat
*div2
, int *exp1
, int *exp2
)
495 d
= div1
->n_col
- div1
->n_row
;
496 div
= isl_mat_alloc(div1
->ctx
, 1 + div1
->n_row
+ div2
->n_row
,
497 d
+ div1
->n_row
+ div2
->n_row
);
501 for (i
= 0, j
= 0, k
= 0; i
< div1
->n_row
&& j
< div2
->n_row
; ++k
) {
504 expand_row(div
, k
, div1
, i
, exp1
);
505 expand_row(div
, k
+ 1, div2
, j
, exp2
);
507 cmp
= mat_cmp_row(div
, k
, k
+ 1);
511 } else if (cmp
< 0) {
515 isl_seq_cpy(div
->row
[k
], div
->row
[k
+ 1], div
->n_col
);
518 for (; i
< div1
->n_row
; ++i
, ++k
) {
519 expand_row(div
, k
, div1
, i
, exp1
);
522 for (; j
< div2
->n_row
; ++j
, ++k
) {
523 expand_row(div
, k
, div2
, j
, exp2
);
533 /* Construct a local space that contains all the divs in either
536 __isl_give isl_local_space
*isl_local_space_intersect(
537 __isl_take isl_local_space
*ls1
, __isl_take isl_local_space
*ls2
)
547 ctx
= isl_local_space_get_ctx(ls1
);
548 if (!isl_space_is_equal(ls1
->dim
, ls2
->dim
))
549 isl_die(ctx
, isl_error_invalid
,
550 "spaces should be identical", goto error
);
552 if (ls2
->div
->n_row
== 0) {
553 isl_local_space_free(ls2
);
557 if (ls1
->div
->n_row
== 0) {
558 isl_local_space_free(ls1
);
562 exp1
= isl_alloc_array(ctx
, int, ls1
->div
->n_row
);
563 exp2
= isl_alloc_array(ctx
, int, ls2
->div
->n_row
);
567 div
= isl_merge_divs(ls1
->div
, ls2
->div
, exp1
, exp2
);
573 isl_local_space_free(ls2
);
574 isl_mat_free(ls1
->div
);
581 isl_local_space_free(ls1
);
582 isl_local_space_free(ls2
);
586 int isl_local_space_divs_known(__isl_keep isl_local_space
*ls
)
593 for (i
= 0; i
< ls
->div
->n_row
; ++i
)
594 if (isl_int_is_zero(ls
->div
->row
[i
][0]))
600 __isl_give isl_local_space
*isl_local_space_domain(
601 __isl_take isl_local_space
*ls
)
603 ls
= isl_local_space_drop_dims(ls
, isl_dim_out
,
604 0, isl_local_space_dim(ls
, isl_dim_out
));
605 ls
= isl_local_space_cow(ls
);
608 ls
->dim
= isl_space_domain(ls
->dim
);
610 return isl_local_space_free(ls
);
614 __isl_give isl_local_space
*isl_local_space_range(
615 __isl_take isl_local_space
*ls
)
617 ls
= isl_local_space_drop_dims(ls
, isl_dim_in
,
618 0, isl_local_space_dim(ls
, isl_dim_in
));
619 ls
= isl_local_space_cow(ls
);
623 ls
->dim
= isl_space_range(ls
->dim
);
625 return isl_local_space_free(ls
);
629 /* Construct a local space for a map that has the given local
630 * space as domain and that has a zero-dimensional range.
632 __isl_give isl_local_space
*isl_local_space_from_domain(
633 __isl_take isl_local_space
*ls
)
635 ls
= isl_local_space_cow(ls
);
638 ls
->dim
= isl_space_from_domain(ls
->dim
);
640 return isl_local_space_free(ls
);
644 __isl_give isl_local_space
*isl_local_space_add_dims(
645 __isl_take isl_local_space
*ls
, enum isl_dim_type type
, unsigned n
)
651 pos
= isl_local_space_dim(ls
, type
);
652 return isl_local_space_insert_dims(ls
, type
, pos
, n
);
655 /* Remove common factor of non-constant terms and denominator.
657 static void normalize_div(__isl_keep isl_local_space
*ls
, int div
)
659 isl_ctx
*ctx
= ls
->div
->ctx
;
660 unsigned total
= ls
->div
->n_col
- 2;
662 isl_seq_gcd(ls
->div
->row
[div
] + 2, total
, &ctx
->normalize_gcd
);
663 isl_int_gcd(ctx
->normalize_gcd
,
664 ctx
->normalize_gcd
, ls
->div
->row
[div
][0]);
665 if (isl_int_is_one(ctx
->normalize_gcd
))
668 isl_seq_scale_down(ls
->div
->row
[div
] + 2, ls
->div
->row
[div
] + 2,
669 ctx
->normalize_gcd
, total
);
670 isl_int_divexact(ls
->div
->row
[div
][0], ls
->div
->row
[div
][0],
672 isl_int_fdiv_q(ls
->div
->row
[div
][1], ls
->div
->row
[div
][1],
676 /* Exploit the equalities in "eq" to simplify the expressions of
677 * the integer divisions in "ls".
678 * The integer divisions in "ls" are assumed to appear as regular
679 * dimensions in "eq".
681 __isl_give isl_local_space
*isl_local_space_substitute_equalities(
682 __isl_take isl_local_space
*ls
, __isl_take isl_basic_set
*eq
)
688 ls
= isl_local_space_cow(ls
);
692 total
= isl_space_dim(eq
->dim
, isl_dim_all
);
693 if (isl_local_space_dim(ls
, isl_dim_all
) != total
)
694 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
695 "dimensions don't match", goto error
);
698 for (i
= 0; i
< eq
->n_eq
; ++i
) {
699 j
= isl_seq_last_non_zero(eq
->eq
[i
], total
+ n_div
);
700 if (j
< 0 || j
== 0 || j
>= total
)
703 for (k
= 0; k
< ls
->div
->n_row
; ++k
) {
704 if (isl_int_is_zero(ls
->div
->row
[k
][1 + j
]))
706 isl_seq_elim(ls
->div
->row
[k
] + 1, eq
->eq
[i
], j
, total
,
707 &ls
->div
->row
[k
][0]);
708 normalize_div(ls
, k
);
712 isl_basic_set_free(eq
);
715 isl_basic_set_free(eq
);
716 isl_local_space_free(ls
);
720 /* Plug in "subs" for dimension "type", "pos" in the integer divisions
723 * Let i be the dimension to replace and let "subs" be of the form
727 * Any integer division with a non-zero coefficient for i,
733 * floor((a f + d g)/(m d))
735 __isl_give isl_local_space
*isl_local_space_substitute(
736 __isl_take isl_local_space
*ls
,
737 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
742 ls
= isl_local_space_cow(ls
);
744 return isl_local_space_free(ls
);
746 if (!isl_space_is_equal(ls
->dim
, subs
->ls
->dim
))
747 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
748 "spaces don't match", return isl_local_space_free(ls
));
749 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
750 isl_die(isl_local_space_get_ctx(ls
), isl_error_unsupported
,
751 "cannot handle divs yet",
752 return isl_local_space_free(ls
));
754 pos
+= isl_local_space_offset(ls
, type
);
757 for (i
= 0; i
< ls
->div
->n_row
; ++i
) {
758 if (isl_int_is_zero(ls
->div
->row
[i
][1 + pos
]))
760 isl_int_set(v
, ls
->div
->row
[i
][1 + pos
]);
761 isl_int_set_si(ls
->div
->row
[i
][1 + pos
], 0);
762 isl_seq_combine(ls
->div
->row
[i
] + 1,
763 subs
->v
->el
[0], ls
->div
->row
[i
] + 1,
764 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
765 isl_int_mul(ls
->div
->row
[i
][0],
766 ls
->div
->row
[i
][0], subs
->v
->el
[0]);
767 normalize_div(ls
, i
);
774 int isl_local_space_is_named_or_nested(__isl_keep isl_local_space
*ls
,
775 enum isl_dim_type type
)
779 return isl_space_is_named_or_nested(ls
->dim
, type
);
782 __isl_give isl_local_space
*isl_local_space_drop_dims(
783 __isl_take isl_local_space
*ls
,
784 enum isl_dim_type type
, unsigned first
, unsigned n
)
790 if (n
== 0 && !isl_local_space_is_named_or_nested(ls
, type
))
793 ctx
= isl_local_space_get_ctx(ls
);
794 if (first
+ n
> isl_local_space_dim(ls
, type
))
795 isl_die(ctx
, isl_error_invalid
, "range out of bounds",
796 return isl_local_space_free(ls
));
798 ls
= isl_local_space_cow(ls
);
802 if (type
== isl_dim_div
) {
803 ls
->div
= isl_mat_drop_rows(ls
->div
, first
, n
);
805 ls
->dim
= isl_space_drop_dims(ls
->dim
, type
, first
, n
);
807 return isl_local_space_free(ls
);
810 first
+= 1 + isl_local_space_offset(ls
, type
);
811 ls
->div
= isl_mat_drop_cols(ls
->div
, first
, n
);
813 return isl_local_space_free(ls
);
818 __isl_give isl_local_space
*isl_local_space_insert_dims(
819 __isl_take isl_local_space
*ls
,
820 enum isl_dim_type type
, unsigned first
, unsigned n
)
826 if (n
== 0 && !isl_local_space_is_named_or_nested(ls
, type
))
829 ctx
= isl_local_space_get_ctx(ls
);
830 if (first
> isl_local_space_dim(ls
, type
))
831 isl_die(ctx
, isl_error_invalid
, "position out of bounds",
832 return isl_local_space_free(ls
));
834 ls
= isl_local_space_cow(ls
);
838 if (type
== isl_dim_div
) {
839 ls
->div
= isl_mat_insert_zero_rows(ls
->div
, first
, n
);
841 ls
->dim
= isl_space_insert_dims(ls
->dim
, type
, first
, n
);
843 return isl_local_space_free(ls
);
846 first
+= 1 + isl_local_space_offset(ls
, type
);
847 ls
->div
= isl_mat_insert_zero_cols(ls
->div
, first
, n
);
849 return isl_local_space_free(ls
);
854 /* Check if the constraints pointed to by "constraint" is a div
855 * constraint corresponding to div "div" in "ls".
857 * That is, if div = floor(f/m), then check if the constraint is
861 * -(f-(m-1)) + m d >= 0
863 int isl_local_space_is_div_constraint(__isl_keep isl_local_space
*ls
,
864 isl_int
*constraint
, unsigned div
)
871 if (isl_int_is_zero(ls
->div
->row
[div
][0]))
874 pos
= isl_local_space_offset(ls
, isl_dim_div
) + div
;
876 if (isl_int_eq(constraint
[pos
], ls
->div
->row
[div
][0])) {
878 isl_int_sub(ls
->div
->row
[div
][1],
879 ls
->div
->row
[div
][1], ls
->div
->row
[div
][0]);
880 isl_int_add_ui(ls
->div
->row
[div
][1], ls
->div
->row
[div
][1], 1);
881 neg
= isl_seq_is_neg(constraint
, ls
->div
->row
[div
]+1, pos
);
882 isl_int_sub_ui(ls
->div
->row
[div
][1], ls
->div
->row
[div
][1], 1);
883 isl_int_add(ls
->div
->row
[div
][1],
884 ls
->div
->row
[div
][1], ls
->div
->row
[div
][0]);
887 if (isl_seq_first_non_zero(constraint
+pos
+1,
888 ls
->div
->n_row
-div
-1) != -1)
890 } else if (isl_int_abs_eq(constraint
[pos
], ls
->div
->row
[div
][0])) {
891 if (!isl_seq_eq(constraint
, ls
->div
->row
[div
]+1, pos
))
893 if (isl_seq_first_non_zero(constraint
+pos
+1,
894 ls
->div
->n_row
-div
-1) != -1)
903 * Set active[i] to 1 if the dimension at position i is involved
904 * in the linear expression l.
906 int *isl_local_space_get_active(__isl_keep isl_local_space
*ls
, isl_int
*l
)
914 ctx
= isl_local_space_get_ctx(ls
);
915 total
= isl_local_space_dim(ls
, isl_dim_all
);
916 active
= isl_calloc_array(ctx
, int, total
);
920 for (i
= 0; i
< total
; ++i
)
921 active
[i
] = !isl_int_is_zero(l
[i
]);
923 offset
= isl_local_space_offset(ls
, isl_dim_div
) - 1;
924 for (i
= ls
->div
->n_row
- 1; i
>= 0; --i
) {
925 if (!active
[offset
+ i
])
927 for (j
= 0; j
< total
; ++j
)
928 active
[j
] |= !isl_int_is_zero(ls
->div
->row
[i
][2 + j
]);
934 /* Given a local space "ls" of a set, create a local space
935 * for the lift of the set. In particular, the result
936 * is of the form [dim -> local[..]], with ls->div->n_row variables in the
937 * range of the wrapped map.
939 __isl_give isl_local_space
*isl_local_space_lift(
940 __isl_take isl_local_space
*ls
)
942 ls
= isl_local_space_cow(ls
);
946 ls
->dim
= isl_space_lift(ls
->dim
, ls
->div
->n_row
);
947 ls
->div
= isl_mat_drop_rows(ls
->div
, 0, ls
->div
->n_row
);
948 if (!ls
->dim
|| !ls
->div
)
949 return isl_local_space_free(ls
);
954 /* Construct a basic map that maps a set living in local space "ls"
955 * to the corresponding lifted local space.
957 __isl_give isl_basic_map
*isl_local_space_lifting(
958 __isl_take isl_local_space
*ls
)
960 isl_basic_map
*lifting
;
965 if (!isl_local_space_is_set(ls
))
966 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
967 "lifting only defined on set spaces",
968 return isl_local_space_free(ls
));
970 bset
= isl_basic_set_from_local_space(ls
);
971 lifting
= isl_basic_set_unwrap(isl_basic_set_lift(bset
));
972 lifting
= isl_basic_map_domain_map(lifting
);
973 lifting
= isl_basic_map_reverse(lifting
);