2 * Copyright 2011 INRIA Saclay
4 * Use of this software is governed by the GNU LGPLv2.1 license
6 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
7 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
11 #include <isl_ctx_private.h>
12 #include <isl_map_private.h>
13 #include <isl_local_space_private.h>
14 #include <isl_space_private.h>
15 #include <isl_mat_private.h>
18 isl_ctx
*isl_local_space_get_ctx(__isl_keep isl_local_space
*ls
)
20 return ls
? ls
->dim
->ctx
: NULL
;
23 __isl_give isl_local_space
*isl_local_space_alloc_div(__isl_take isl_space
*dim
,
24 __isl_take isl_mat
*div
)
27 isl_local_space
*ls
= NULL
;
32 ctx
= isl_space_get_ctx(dim
);
33 ls
= isl_calloc_type(ctx
, struct isl_local_space
);
44 isl_local_space_free(ls
);
48 __isl_give isl_local_space
*isl_local_space_alloc(__isl_take isl_space
*dim
,
58 total
= isl_space_dim(dim
, isl_dim_all
);
60 ctx
= isl_space_get_ctx(dim
);
61 div
= isl_mat_alloc(ctx
, n_div
, 1 + 1 + total
+ n_div
);
62 return isl_local_space_alloc_div(dim
, div
);
65 __isl_give isl_local_space
*isl_local_space_from_space(__isl_take isl_space
*dim
)
67 return isl_local_space_alloc(dim
, 0);
70 __isl_give isl_local_space
*isl_local_space_copy(__isl_keep isl_local_space
*ls
)
79 __isl_give isl_local_space
*isl_local_space_dup(__isl_keep isl_local_space
*ls
)
84 return isl_local_space_alloc_div(isl_space_copy(ls
->dim
),
85 isl_mat_copy(ls
->div
));
89 __isl_give isl_local_space
*isl_local_space_cow(__isl_take isl_local_space
*ls
)
97 return isl_local_space_dup(ls
);
100 void *isl_local_space_free(__isl_take isl_local_space
*ls
)
108 isl_space_free(ls
->dim
);
109 isl_mat_free(ls
->div
);
116 /* Is the local space that of a set?
118 int isl_local_space_is_set(__isl_keep isl_local_space
*ls
)
120 return ls
? isl_space_is_set(ls
->dim
) : -1;
123 /* Return true if the two local spaces are identical, with identical
124 * expressions for the integer divisions.
126 int isl_local_space_is_equal(__isl_keep isl_local_space
*ls1
,
127 __isl_keep isl_local_space
*ls2
)
134 equal
= isl_space_is_equal(ls1
->dim
, ls2
->dim
);
135 if (equal
< 0 || !equal
)
138 if (!isl_local_space_divs_known(ls1
))
140 if (!isl_local_space_divs_known(ls2
))
143 return isl_mat_is_equal(ls1
->div
, ls2
->div
);
146 int isl_local_space_dim(__isl_keep isl_local_space
*ls
,
147 enum isl_dim_type type
)
151 if (type
== isl_dim_div
)
152 return ls
->div
->n_row
;
153 if (type
== isl_dim_all
)
154 return isl_space_dim(ls
->dim
, isl_dim_all
) + ls
->div
->n_row
;
155 return isl_space_dim(ls
->dim
, type
);
158 unsigned isl_local_space_offset(__isl_keep isl_local_space
*ls
,
159 enum isl_dim_type type
)
168 case isl_dim_cst
: return 0;
169 case isl_dim_param
: return 1;
170 case isl_dim_in
: return 1 + dim
->nparam
;
171 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
172 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
177 const char *isl_local_space_get_dim_name(__isl_keep isl_local_space
*ls
,
178 enum isl_dim_type type
, unsigned pos
)
180 return ls
? isl_space_get_dim_name(ls
->dim
, type
, pos
) : NULL
;
183 __isl_give isl_div
*isl_local_space_get_div(__isl_keep isl_local_space
*ls
,
191 if (pos
< 0 || pos
>= ls
->div
->n_row
)
192 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
193 "index out of bounds", return NULL
);
195 if (isl_int_is_zero(ls
->div
->row
[pos
][0]))
196 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
197 "expression of div unknown", return NULL
);
199 bmap
= isl_basic_map_from_local_space(isl_local_space_copy(ls
));
200 return isl_basic_map_div(bmap
, pos
);
203 __isl_give isl_space
*isl_local_space_get_space(__isl_keep isl_local_space
*ls
)
208 return isl_space_copy(ls
->dim
);
211 __isl_give isl_local_space
*isl_local_space_set_dim_name(
212 __isl_take isl_local_space
*ls
,
213 enum isl_dim_type type
, unsigned pos
, const char *s
)
215 ls
= isl_local_space_cow(ls
);
218 ls
->dim
= isl_space_set_dim_name(ls
->dim
, type
, pos
, s
);
220 return isl_local_space_free(ls
);
225 __isl_give isl_local_space
*isl_local_space_reset_space(
226 __isl_take isl_local_space
*ls
, __isl_take isl_space
*dim
)
228 ls
= isl_local_space_cow(ls
);
232 isl_space_free(ls
->dim
);
237 isl_local_space_free(ls
);
242 /* Reorder the columns of the given div definitions according to the
244 * The order of the divs themselves is assumed not to change.
246 static __isl_give isl_mat
*reorder_divs(__isl_take isl_mat
*div
,
247 __isl_take isl_reordering
*r
)
256 extra
= isl_space_dim(r
->dim
, isl_dim_all
) + div
->n_row
- r
->len
;
257 mat
= isl_mat_alloc(div
->ctx
, div
->n_row
, div
->n_col
+ extra
);
261 for (i
= 0; i
< div
->n_row
; ++i
) {
262 isl_seq_cpy(mat
->row
[i
], div
->row
[i
], 2);
263 isl_seq_clr(mat
->row
[i
] + 2, mat
->n_col
- 2);
264 for (j
= 0; j
< r
->len
; ++j
)
265 isl_int_set(mat
->row
[i
][2 + r
->pos
[j
]],
269 isl_reordering_free(r
);
273 isl_reordering_free(r
);
278 /* Reorder the dimensions of "ls" according to the given reordering.
279 * The reordering r is assumed to have been extended with the local
280 * variables, leaving them in the same order.
282 __isl_give isl_local_space
*isl_local_space_realign(
283 __isl_take isl_local_space
*ls
, __isl_take isl_reordering
*r
)
285 ls
= isl_local_space_cow(ls
);
289 ls
->div
= reorder_divs(ls
->div
, isl_reordering_copy(r
));
293 ls
= isl_local_space_reset_space(ls
, isl_space_copy(r
->dim
));
295 isl_reordering_free(r
);
298 isl_local_space_free(ls
);
299 isl_reordering_free(r
);
303 __isl_give isl_local_space
*isl_local_space_add_div(
304 __isl_take isl_local_space
*ls
, __isl_take isl_vec
*div
)
306 ls
= isl_local_space_cow(ls
);
310 if (ls
->div
->n_col
!= div
->size
)
311 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
312 "incompatible dimensions", goto error
);
314 ls
->div
= isl_mat_add_zero_cols(ls
->div
, 1);
315 ls
->div
= isl_mat_add_rows(ls
->div
, 1);
319 isl_seq_cpy(ls
->div
->row
[ls
->div
->n_row
- 1], div
->el
, div
->size
);
320 isl_int_set_si(ls
->div
->row
[ls
->div
->n_row
- 1][div
->size
], 0);
325 isl_local_space_free(ls
);
330 __isl_give isl_local_space
*isl_local_space_replace_divs(
331 __isl_take isl_local_space
*ls
, __isl_take isl_mat
*div
)
333 ls
= isl_local_space_cow(ls
);
338 isl_mat_free(ls
->div
);
343 isl_local_space_free(ls
);
347 /* Copy row "s" of "src" to row "d" of "dst", applying the expansion
350 static void expand_row(__isl_keep isl_mat
*dst
, int d
,
351 __isl_keep isl_mat
*src
, int s
, int *exp
)
354 unsigned c
= src
->n_col
- src
->n_row
;
356 isl_seq_cpy(dst
->row
[d
], src
->row
[s
], c
);
357 isl_seq_clr(dst
->row
[d
] + c
, dst
->n_col
- c
);
359 for (i
= 0; i
< s
; ++i
)
360 isl_int_set(dst
->row
[d
][c
+ exp
[i
]], src
->row
[s
][c
+ i
]);
363 /* Compare (known) divs.
364 * Return non-zero if at least one of the two divs is unknown.
366 static int cmp_row(__isl_keep isl_mat
*div
, int i
, int j
)
370 if (isl_int_is_zero(div
->row
[j
][0]))
372 if (isl_int_is_zero(div
->row
[i
][0]))
375 li
= isl_seq_last_non_zero(div
->row
[i
], div
->n_col
);
376 lj
= isl_seq_last_non_zero(div
->row
[j
], div
->n_col
);
381 return isl_seq_cmp(div
->row
[i
], div
->row
[j
], div
->n_col
);
384 /* Combine the two lists of divs into a single list.
385 * For each row i in div1, exp1[i] is set to the position of the corresponding
386 * row in the result. Similarly for div2 and exp2.
387 * This function guarantees
389 * exp1[i+1] > exp1[i]
390 * For optimal merging, the two input list should have been sorted.
392 __isl_give isl_mat
*isl_merge_divs(__isl_keep isl_mat
*div1
,
393 __isl_keep isl_mat
*div2
, int *exp1
, int *exp2
)
397 unsigned d
= div1
->n_col
- div1
->n_row
;
399 div
= isl_mat_alloc(div1
->ctx
, 1 + div1
->n_row
+ div2
->n_row
,
400 d
+ div1
->n_row
+ div2
->n_row
);
404 for (i
= 0, j
= 0, k
= 0; i
< div1
->n_row
&& j
< div2
->n_row
; ++k
) {
407 expand_row(div
, k
, div1
, i
, exp1
);
408 expand_row(div
, k
+ 1, div2
, j
, exp2
);
410 cmp
= cmp_row(div
, k
, k
+ 1);
414 } else if (cmp
< 0) {
418 isl_seq_cpy(div
->row
[k
], div
->row
[k
+ 1], div
->n_col
);
421 for (; i
< div1
->n_row
; ++i
, ++k
) {
422 expand_row(div
, k
, div1
, i
, exp1
);
425 for (; j
< div2
->n_row
; ++j
, ++k
) {
426 expand_row(div
, k
, div2
, j
, exp2
);
436 int isl_local_space_divs_known(__isl_keep isl_local_space
*ls
)
443 for (i
= 0; i
< ls
->div
->n_row
; ++i
)
444 if (isl_int_is_zero(ls
->div
->row
[i
][0]))
450 __isl_give isl_local_space
*isl_local_space_domain(
451 __isl_take isl_local_space
*ls
)
453 ls
= isl_local_space_drop_dims(ls
, isl_dim_out
,
454 0, isl_local_space_dim(ls
, isl_dim_out
));
455 ls
= isl_local_space_cow(ls
);
458 ls
->dim
= isl_space_domain(ls
->dim
);
460 return isl_local_space_free(ls
);
464 /* Construct a local space for a map that has the given local
465 * space as domain and that has a zero-dimensional range.
467 __isl_give isl_local_space
*isl_local_space_from_domain(
468 __isl_take isl_local_space
*ls
)
470 ls
= isl_local_space_cow(ls
);
473 ls
->dim
= isl_space_from_domain(ls
->dim
);
475 return isl_local_space_free(ls
);
479 __isl_give isl_local_space
*isl_local_space_add_dims(
480 __isl_take isl_local_space
*ls
, enum isl_dim_type type
, unsigned n
)
486 pos
= isl_local_space_dim(ls
, type
);
487 return isl_local_space_insert_dims(ls
, type
, pos
, n
);
490 /* Remove common factor of non-constant terms and denominator.
492 static void normalize_div(__isl_keep isl_local_space
*ls
, int div
)
494 isl_ctx
*ctx
= ls
->div
->ctx
;
495 unsigned total
= ls
->div
->n_col
- 2;
497 isl_seq_gcd(ls
->div
->row
[div
] + 2, total
, &ctx
->normalize_gcd
);
498 isl_int_gcd(ctx
->normalize_gcd
,
499 ctx
->normalize_gcd
, ls
->div
->row
[div
][0]);
500 if (isl_int_is_one(ctx
->normalize_gcd
))
503 isl_seq_scale_down(ls
->div
->row
[div
] + 2, ls
->div
->row
[div
] + 2,
504 ctx
->normalize_gcd
, total
);
505 isl_int_divexact(ls
->div
->row
[div
][0], ls
->div
->row
[div
][0],
507 isl_int_fdiv_q(ls
->div
->row
[div
][1], ls
->div
->row
[div
][1],
511 /* Exploit the equalities in "eq" to simplify the expressions of
512 * the integer divisions in "ls".
513 * The integer divisions in "ls" are assumed to appear as regular
514 * dimensions in "eq".
516 __isl_give isl_local_space
*isl_local_space_substitute_equalities(
517 __isl_take isl_local_space
*ls
, __isl_take isl_basic_set
*eq
)
523 ls
= isl_local_space_cow(ls
);
527 total
= isl_space_dim(eq
->dim
, isl_dim_all
);
528 if (isl_local_space_dim(ls
, isl_dim_all
) != total
)
529 isl_die(isl_local_space_get_ctx(ls
), isl_error_invalid
,
530 "dimensions don't match", goto error
);
533 for (i
= 0; i
< eq
->n_eq
; ++i
) {
534 j
= isl_seq_last_non_zero(eq
->eq
[i
], total
+ n_div
);
535 if (j
< 0 || j
== 0 || j
>= total
)
538 for (k
= 0; k
< ls
->div
->n_row
; ++k
) {
539 if (isl_int_is_zero(ls
->div
->row
[k
][1 + j
]))
541 isl_seq_elim(ls
->div
->row
[k
] + 1, eq
->eq
[i
], j
, total
,
542 &ls
->div
->row
[k
][0]);
543 normalize_div(ls
, k
);
547 isl_basic_set_free(eq
);
550 isl_basic_set_free(eq
);
551 isl_local_space_free(ls
);
555 int isl_local_space_is_named_or_nested(__isl_keep isl_local_space
*ls
,
556 enum isl_dim_type type
)
560 return isl_space_is_named_or_nested(ls
->dim
, type
);
563 __isl_give isl_local_space
*isl_local_space_drop_dims(
564 __isl_take isl_local_space
*ls
,
565 enum isl_dim_type type
, unsigned first
, unsigned n
)
571 if (n
== 0 && !isl_local_space_is_named_or_nested(ls
, type
))
574 ctx
= isl_local_space_get_ctx(ls
);
575 if (first
+ n
> isl_local_space_dim(ls
, type
))
576 isl_die(ctx
, isl_error_invalid
, "range out of bounds",
577 return isl_local_space_free(ls
));
579 ls
= isl_local_space_cow(ls
);
583 if (type
== isl_dim_div
) {
584 ls
->div
= isl_mat_drop_rows(ls
->div
, first
, n
);
586 ls
->dim
= isl_space_drop_dims(ls
->dim
, type
, first
, n
);
588 return isl_local_space_free(ls
);
591 first
+= 1 + isl_local_space_offset(ls
, type
);
592 ls
->div
= isl_mat_drop_cols(ls
->div
, first
, n
);
594 return isl_local_space_free(ls
);
599 __isl_give isl_local_space
*isl_local_space_insert_dims(
600 __isl_take isl_local_space
*ls
,
601 enum isl_dim_type type
, unsigned first
, unsigned n
)
607 if (n
== 0 && !isl_local_space_is_named_or_nested(ls
, type
))
610 ctx
= isl_local_space_get_ctx(ls
);
611 if (first
> isl_local_space_dim(ls
, type
))
612 isl_die(ctx
, isl_error_invalid
, "position out of bounds",
613 return isl_local_space_free(ls
));
615 ls
= isl_local_space_cow(ls
);
619 if (type
== isl_dim_div
) {
620 ls
->div
= isl_mat_insert_zero_rows(ls
->div
, first
, n
);
622 ls
->dim
= isl_space_insert_dims(ls
->dim
, type
, first
, n
);
624 return isl_local_space_free(ls
);
627 first
+= 1 + isl_local_space_offset(ls
, type
);
628 ls
->div
= isl_mat_insert_zero_cols(ls
->div
, first
, n
);
630 return isl_local_space_free(ls
);
635 /* Check if the constraints pointed to by "constraint" is a div
636 * constraint corresponding to div "div" in "ls".
638 * That is, if div = floor(f/m), then check if the constraint is
642 * -(f-(m-1)) + m d >= 0
644 int isl_local_space_is_div_constraint(__isl_keep isl_local_space
*ls
,
645 isl_int
*constraint
, unsigned div
)
652 if (isl_int_is_zero(ls
->div
->row
[div
][0]))
655 pos
= isl_local_space_offset(ls
, isl_dim_div
) + div
;
657 if (isl_int_eq(constraint
[pos
], ls
->div
->row
[div
][0])) {
659 isl_int_sub(ls
->div
->row
[div
][1],
660 ls
->div
->row
[div
][1], ls
->div
->row
[div
][0]);
661 isl_int_add_ui(ls
->div
->row
[div
][1], ls
->div
->row
[div
][1], 1);
662 neg
= isl_seq_is_neg(constraint
, ls
->div
->row
[div
]+1, pos
);
663 isl_int_sub_ui(ls
->div
->row
[div
][1], ls
->div
->row
[div
][1], 1);
664 isl_int_add(ls
->div
->row
[div
][1],
665 ls
->div
->row
[div
][1], ls
->div
->row
[div
][0]);
668 if (isl_seq_first_non_zero(constraint
+pos
+1,
669 ls
->div
->n_row
-div
-1) != -1)
671 } else if (isl_int_abs_eq(constraint
[pos
], ls
->div
->row
[div
][0])) {
672 if (!isl_seq_eq(constraint
, ls
->div
->row
[div
]+1, pos
))
674 if (isl_seq_first_non_zero(constraint
+pos
+1,
675 ls
->div
->n_row
-div
-1) != -1)
684 * Set active[i] to 1 if the dimension at position i is involved
685 * in the linear expression l.
687 int *isl_local_space_get_active(__isl_keep isl_local_space
*ls
, isl_int
*l
)
695 ctx
= isl_local_space_get_ctx(ls
);
696 total
= isl_local_space_dim(ls
, isl_dim_all
);
697 active
= isl_calloc_array(ctx
, int, total
);
701 for (i
= 0; i
< total
; ++i
)
702 active
[i
] = !isl_int_is_zero(l
[i
]);
704 offset
= isl_local_space_offset(ls
, isl_dim_div
) - 1;
705 for (i
= ls
->div
->n_row
- 1; i
>= 0; --i
) {
706 if (!active
[offset
+ i
])
708 for (j
= 0; j
< total
; ++j
)
709 active
[j
] |= !isl_int_is_zero(ls
->div
->row
[i
][2 + j
]);