2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2013 Ecole Normale Superieure
5 * Use of this software is governed by the MIT license
7 * Written by Sven Verdoolaege, K.U.Leuven, Departement
8 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
9 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
12 #include <isl_ctx_private.h>
14 #include <isl_val_private.h>
15 #include <isl_vec_private.h>
16 #include <isl/deprecated/vec_int.h>
18 isl_ctx
*isl_vec_get_ctx(__isl_keep isl_vec
*vec
)
20 return vec
? vec
->ctx
: NULL
;
23 /* Return a hash value that digests "vec".
25 uint32_t isl_vec_get_hash(__isl_keep isl_vec
*vec
)
30 return isl_seq_get_hash(vec
->el
, vec
->size
);
33 struct isl_vec
*isl_vec_alloc(struct isl_ctx
*ctx
, unsigned size
)
37 vec
= isl_alloc_type(ctx
, struct isl_vec
);
41 vec
->block
= isl_blk_alloc(ctx
, size
);
42 if (isl_blk_is_error(vec
->block
))
49 vec
->el
= vec
->block
.data
;
53 isl_blk_free(ctx
, vec
->block
);
57 __isl_give isl_vec
*isl_vec_extend(__isl_take isl_vec
*vec
, unsigned size
)
61 if (size
<= vec
->size
)
64 vec
= isl_vec_cow(vec
);
68 vec
->block
= isl_blk_extend(vec
->ctx
, vec
->block
, size
);
73 vec
->el
= vec
->block
.data
;
81 /* Apply the expansion specified by "exp" to the "n" elements starting at "pos".
82 * "expanded" it the number of elements that need to replace those "n"
83 * elements. The entries in "exp" have increasing values between
86 __isl_give isl_vec
*isl_vec_expand(__isl_take isl_vec
*vec
, int pos
, int n
,
87 int exp
[n
], int expanded
)
95 isl_die(isl_vec_get_ctx(vec
), isl_error_invalid
,
96 "not an expansion", isl_vec_free(vec
));
99 if (pos
< 0 || n
< 0 || pos
+ n
> vec
->size
)
100 isl_die(isl_vec_get_ctx(vec
), isl_error_invalid
,
101 "position out of bounds", return isl_vec_free(vec
));
103 old_size
= vec
->size
;
104 extra
= expanded
- n
;
105 vec
= isl_vec_extend(vec
, old_size
+ extra
);
106 vec
= isl_vec_cow(vec
);
110 for (i
= old_size
- 1; i
>= pos
+ n
; --i
)
111 isl_int_set(vec
->el
[i
+ extra
], vec
->el
[i
]);
114 for (i
= expanded
- 1; i
>= 0; --i
) {
115 if (j
>= 0 && exp
[j
] == i
) {
117 isl_int_swap(vec
->el
[pos
+ i
],
121 isl_int_set_si(vec
->el
[pos
+ i
], 0);
128 __isl_give isl_vec
*isl_vec_zero_extend(__isl_take isl_vec
*vec
, unsigned size
)
134 if (size
<= vec
->size
)
137 vec
= isl_vec_cow(vec
);
141 extra
= size
- vec
->size
;
142 vec
= isl_vec_extend(vec
, size
);
146 isl_seq_clr(vec
->el
+ size
- extra
, extra
);
151 /* Return a vector containing the elements of "vec1" followed by
154 __isl_give isl_vec
*isl_vec_concat(__isl_take isl_vec
*vec1
,
155 __isl_take isl_vec
*vec2
)
160 if (vec2
->size
== 0) {
165 if (vec1
->size
== 0) {
170 vec1
= isl_vec_extend(vec1
, vec1
->size
+ vec2
->size
);
174 isl_seq_cpy(vec1
->el
+ vec1
->size
- vec2
->size
, vec2
->el
, vec2
->size
);
184 struct isl_vec
*isl_vec_copy(struct isl_vec
*vec
)
193 struct isl_vec
*isl_vec_dup(struct isl_vec
*vec
)
195 struct isl_vec
*vec2
;
199 vec2
= isl_vec_alloc(vec
->ctx
, vec
->size
);
202 isl_seq_cpy(vec2
->el
, vec
->el
, vec
->size
);
206 struct isl_vec
*isl_vec_cow(struct isl_vec
*vec
)
208 struct isl_vec
*vec2
;
215 vec2
= isl_vec_dup(vec
);
220 __isl_null isl_vec
*isl_vec_free(__isl_take isl_vec
*vec
)
228 isl_ctx_deref(vec
->ctx
);
229 isl_blk_free(vec
->ctx
, vec
->block
);
235 int isl_vec_size(__isl_keep isl_vec
*vec
)
237 return vec
? vec
->size
: -1;
240 int isl_vec_get_element(__isl_keep isl_vec
*vec
, int pos
, isl_int
*v
)
245 if (pos
< 0 || pos
>= vec
->size
)
246 isl_die(vec
->ctx
, isl_error_invalid
, "position out of range",
248 isl_int_set(*v
, vec
->el
[pos
]);
252 /* Extract the element at position "pos" of "vec".
254 __isl_give isl_val
*isl_vec_get_element_val(__isl_keep isl_vec
*vec
, int pos
)
260 ctx
= isl_vec_get_ctx(vec
);
261 if (pos
< 0 || pos
>= vec
->size
)
262 isl_die(ctx
, isl_error_invalid
, "position out of range",
264 return isl_val_int_from_isl_int(ctx
, vec
->el
[pos
]);
267 __isl_give isl_vec
*isl_vec_set_element(__isl_take isl_vec
*vec
,
270 vec
= isl_vec_cow(vec
);
273 if (pos
< 0 || pos
>= vec
->size
)
274 isl_die(vec
->ctx
, isl_error_invalid
, "position out of range",
276 isl_int_set(vec
->el
[pos
], v
);
283 __isl_give isl_vec
*isl_vec_set_element_si(__isl_take isl_vec
*vec
,
286 vec
= isl_vec_cow(vec
);
289 if (pos
< 0 || pos
>= vec
->size
)
290 isl_die(vec
->ctx
, isl_error_invalid
, "position out of range",
292 isl_int_set_si(vec
->el
[pos
], v
);
299 /* Replace the element at position "pos" of "vec" by "v".
301 __isl_give isl_vec
*isl_vec_set_element_val(__isl_take isl_vec
*vec
,
302 int pos
, __isl_take isl_val
*v
)
305 return isl_vec_free(vec
);
306 if (!isl_val_is_int(v
))
307 isl_die(isl_val_get_ctx(v
), isl_error_invalid
,
308 "expecting integer value", goto error
);
309 vec
= isl_vec_set_element(vec
, pos
, v
->n
);
314 return isl_vec_free(vec
);
317 /* Compare the elements of "vec1" and "vec2" at position "pos".
319 int isl_vec_cmp_element(__isl_keep isl_vec
*vec1
, __isl_keep isl_vec
*vec2
,
324 if (pos
< 0 || pos
>= vec1
->size
|| pos
>= vec2
->size
)
325 isl_die(isl_vec_get_ctx(vec1
), isl_error_invalid
,
326 "position out of range", return 0);
327 return isl_int_cmp(vec1
->el
[pos
], vec2
->el
[pos
]);
330 isl_bool
isl_vec_is_equal(__isl_keep isl_vec
*vec1
, __isl_keep isl_vec
*vec2
)
333 return isl_bool_error
;
335 if (vec1
->size
!= vec2
->size
)
336 return isl_bool_false
;
338 return isl_seq_eq(vec1
->el
, vec2
->el
, vec1
->size
);
341 __isl_give isl_printer
*isl_printer_print_vec(__isl_take isl_printer
*printer
,
342 __isl_keep isl_vec
*vec
)
346 if (!printer
|| !vec
)
349 printer
= isl_printer_print_str(printer
, "[");
350 for (i
= 0; i
< vec
->size
; ++i
) {
352 printer
= isl_printer_print_str(printer
, ",");
353 printer
= isl_printer_print_isl_int(printer
, vec
->el
[i
]);
355 printer
= isl_printer_print_str(printer
, "]");
359 isl_printer_free(printer
);
363 void isl_vec_dump(struct isl_vec
*vec
)
365 isl_printer
*printer
;
370 printer
= isl_printer_to_file(vec
->ctx
, stderr
);
371 printer
= isl_printer_print_vec(printer
, vec
);
372 printer
= isl_printer_end_line(printer
);
374 isl_printer_free(printer
);
377 __isl_give isl_vec
*isl_vec_set(__isl_take isl_vec
*vec
, isl_int v
)
379 vec
= isl_vec_cow(vec
);
382 isl_seq_set(vec
->el
, v
, vec
->size
);
386 __isl_give isl_vec
*isl_vec_set_si(__isl_take isl_vec
*vec
, int v
)
388 vec
= isl_vec_cow(vec
);
391 isl_seq_set_si(vec
->el
, v
, vec
->size
);
395 /* Replace all elements of "vec" by "v".
397 __isl_give isl_vec
*isl_vec_set_val(__isl_take isl_vec
*vec
,
398 __isl_take isl_val
*v
)
400 vec
= isl_vec_cow(vec
);
403 if (!isl_val_is_int(v
))
404 isl_die(isl_val_get_ctx(v
), isl_error_invalid
,
405 "expecting integer value", goto error
);
406 isl_seq_set(vec
->el
, v
->n
, vec
->size
);
415 __isl_give isl_vec
*isl_vec_clr(__isl_take isl_vec
*vec
)
417 vec
= isl_vec_cow(vec
);
420 isl_seq_clr(vec
->el
, vec
->size
);
424 void isl_vec_lcm(struct isl_vec
*vec
, isl_int
*lcm
)
426 isl_seq_lcm(vec
->block
.data
, vec
->size
, lcm
);
429 /* Given a rational vector, with the denominator in the first element
430 * of the vector, round up all coordinates.
432 struct isl_vec
*isl_vec_ceil(struct isl_vec
*vec
)
434 vec
= isl_vec_cow(vec
);
438 isl_seq_cdiv_q(vec
->el
+ 1, vec
->el
+ 1, vec
->el
[0], vec
->size
- 1);
440 isl_int_set_si(vec
->el
[0], 1);
445 struct isl_vec
*isl_vec_normalize(struct isl_vec
*vec
)
449 isl_seq_normalize(vec
->ctx
, vec
->el
, vec
->size
);
453 __isl_give isl_vec
*isl_vec_neg(__isl_take isl_vec
*vec
)
455 vec
= isl_vec_cow(vec
);
458 isl_seq_neg(vec
->el
, vec
->el
, vec
->size
);
462 __isl_give isl_vec
*isl_vec_scale(__isl_take isl_vec
*vec
, isl_int m
)
464 if (isl_int_is_one(m
))
466 vec
= isl_vec_cow(vec
);
469 isl_seq_scale(vec
->el
, vec
->el
, m
, vec
->size
);
473 /* Reduce the elements of "vec" modulo "m".
475 __isl_give isl_vec
*isl_vec_fdiv_r(__isl_take isl_vec
*vec
, isl_int m
)
477 vec
= isl_vec_cow(vec
);
481 isl_seq_fdiv_r(vec
->el
, vec
->el
, m
, vec
->size
);
486 __isl_give isl_vec
*isl_vec_add(__isl_take isl_vec
*vec1
,
487 __isl_take isl_vec
*vec2
)
489 vec1
= isl_vec_cow(vec1
);
493 isl_assert(vec1
->ctx
, vec1
->size
== vec2
->size
, goto error
);
495 isl_seq_combine(vec1
->el
, vec1
->ctx
->one
, vec1
->el
,
496 vec1
->ctx
->one
, vec2
->el
, vec1
->size
);
506 static int qsort_int_cmp(const void *p1
, const void *p2
)
508 const isl_int
*i1
= (const isl_int
*) p1
;
509 const isl_int
*i2
= (const isl_int
*) p2
;
511 return isl_int_cmp(*i1
, *i2
);
514 __isl_give isl_vec
*isl_vec_sort(__isl_take isl_vec
*vec
)
519 qsort(vec
->el
, vec
->size
, sizeof(*vec
->el
), &qsort_int_cmp
);
524 __isl_give isl_vec
*isl_vec_drop_els(__isl_take isl_vec
*vec
,
525 unsigned pos
, unsigned n
)
529 vec
= isl_vec_cow(vec
);
533 if (pos
+ n
> vec
->size
)
534 isl_die(vec
->ctx
, isl_error_invalid
,
535 "range out of bounds", goto error
);
537 if (pos
+ n
!= vec
->size
)
538 isl_seq_cpy(vec
->el
+ pos
, vec
->el
+ pos
+ n
,
539 vec
->size
- pos
- n
);
549 __isl_give isl_vec
*isl_vec_insert_els(__isl_take isl_vec
*vec
,
550 unsigned pos
, unsigned n
)
560 isl_die(vec
->ctx
, isl_error_invalid
,
561 "position out of bounds", goto error
);
563 ext
= isl_vec_alloc(vec
->ctx
, vec
->size
+ n
);
567 isl_seq_cpy(ext
->el
, vec
->el
, pos
);
568 isl_seq_cpy(ext
->el
+ pos
+ n
, vec
->el
+ pos
, vec
->size
- pos
);
578 __isl_give isl_vec
*isl_vec_insert_zero_els(__isl_take isl_vec
*vec
,
579 unsigned pos
, unsigned n
)
581 vec
= isl_vec_insert_els(vec
, pos
, n
);
585 isl_seq_clr(vec
->el
+ pos
, n
);
590 /* Move the "n" elements starting as "src_pos" of "vec"
591 * to "dst_pos". The elements originally at "dst_pos" are moved
592 * up or down depending on whether "dst_pos" is smaller or greater
595 __isl_give isl_vec
*isl_vec_move_els(__isl_take isl_vec
*vec
,
596 unsigned dst_pos
, unsigned src_pos
, unsigned n
)
603 if (src_pos
+ n
> vec
->size
)
604 isl_die(vec
->ctx
, isl_error_invalid
,
605 "source range out of bounds", return isl_vec_free(vec
));
606 if (dst_pos
+ n
> vec
->size
)
607 isl_die(vec
->ctx
, isl_error_invalid
,
608 "destination range out of bounds",
609 return isl_vec_free(vec
));
611 if (n
== 0 || dst_pos
== src_pos
)
614 res
= isl_vec_alloc(vec
->ctx
, vec
->size
);
616 return isl_vec_free(vec
);
618 if (dst_pos
< src_pos
) {
619 isl_seq_cpy(res
->el
, vec
->el
, dst_pos
);
620 isl_seq_cpy(res
->el
+ dst_pos
, vec
->el
+ src_pos
, n
);
621 isl_seq_cpy(res
->el
+ dst_pos
+ n
,
622 vec
->el
+ dst_pos
, src_pos
- dst_pos
);
623 isl_seq_cpy(res
->el
+ src_pos
+ n
,
624 vec
->el
+ src_pos
+ n
, res
->size
- src_pos
- n
);
626 isl_seq_cpy(res
->el
, vec
->el
, src_pos
);
627 isl_seq_cpy(res
->el
+ src_pos
,
628 vec
->el
+ src_pos
+ n
, dst_pos
- src_pos
);
629 isl_seq_cpy(res
->el
+ dst_pos
, vec
->el
+ src_pos
, n
);
630 isl_seq_cpy(res
->el
+ dst_pos
+ n
,
631 vec
->el
+ dst_pos
+ n
, res
->size
- dst_pos
- n
);