2 * Copyright 2008-2009 Katholieke Universiteit Leuven
4 * Use of this software is governed by the GNU LGPLv2.1 license
6 * Written by Sven Verdoolaege, K.U.Leuven, Departement
7 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
13 #include "isl_map_private.h"
15 struct isl_mat *isl_mat_alloc(struct isl_ctx *ctx,
16 unsigned n_row, unsigned n_col)
21 mat = isl_alloc_type(ctx, struct isl_mat);
26 mat->block = isl_blk_alloc(ctx, n_row * n_col);
27 if (isl_blk_is_error(mat->block))
29 mat->row = isl_alloc_array(ctx, isl_int *, n_row);
33 for (i = 0; i < n_row; ++i)
34 mat->row[i] = mat->block.data + i * n_col;
46 isl_blk_free(ctx, mat->block);
51 struct isl_mat *isl_mat_extend(struct isl_mat *mat,
52 unsigned n_row, unsigned n_col)
60 if (mat->max_col >= n_col && mat->n_row >= n_row) {
61 if (mat->n_col < n_col)
66 if (mat->max_col < n_col) {
67 struct isl_mat *new_mat;
69 if (n_row < mat->n_row)
71 new_mat = isl_mat_alloc(mat->ctx, n_row, n_col);
74 for (i = 0; i < mat->n_row; ++i)
75 isl_seq_cpy(new_mat->row[i], mat->row[i], mat->n_col);
80 mat = isl_mat_cow(mat);
84 assert(mat->ref == 1);
85 old = mat->block.data;
86 mat->block = isl_blk_extend(mat->ctx, mat->block, n_row * mat->max_col);
87 if (isl_blk_is_error(mat->block))
89 mat->row = isl_realloc_array(mat->ctx, mat->row, isl_int *, n_row);
93 for (i = 0; i < mat->n_row; ++i)
94 mat->row[i] = mat->block.data + (mat->row[i] - old);
95 for (i = mat->n_row; i < n_row; ++i)
96 mat->row[i] = mat->block.data + i * mat->max_col;
98 if (mat->n_col < n_col)
107 struct isl_mat *isl_mat_sub_alloc(struct isl_ctx *ctx, isl_int **row,
108 unsigned first_row, unsigned n_row, unsigned first_col, unsigned n_col)
113 mat = isl_alloc_type(ctx, struct isl_mat);
116 mat->row = isl_alloc_array(ctx, isl_int *, n_row);
119 for (i = 0; i < n_row; ++i)
120 mat->row[i] = row[first_row+i] + first_col;
126 mat->block = isl_blk_empty();
127 mat->flags = ISL_MAT_BORROWED;
134 void isl_mat_sub_copy(struct isl_ctx *ctx, isl_int **dst, isl_int **src,
135 unsigned n_row, unsigned dst_col, unsigned src_col, unsigned n_col)
139 for (i = 0; i < n_row; ++i)
140 isl_seq_cpy(dst[i]+dst_col, src[i]+src_col, n_col);
143 void isl_mat_sub_neg(struct isl_ctx *ctx, isl_int **dst, isl_int **src,
144 unsigned n_row, unsigned dst_col, unsigned src_col, unsigned n_col)
148 for (i = 0; i < n_row; ++i)
149 isl_seq_neg(dst[i]+dst_col, src[i]+src_col, n_col);
152 struct isl_mat *isl_mat_copy(struct isl_mat *mat)
161 struct isl_mat *isl_mat_dup(struct isl_mat *mat)
164 struct isl_mat *mat2;
168 mat2 = isl_mat_alloc(mat->ctx, mat->n_row, mat->n_col);
171 for (i = 0; i < mat->n_row; ++i)
172 isl_seq_cpy(mat2->row[i], mat->row[i], mat->n_col);
176 struct isl_mat *isl_mat_cow(struct isl_mat *mat)
178 struct isl_mat *mat2;
182 if (mat->ref == 1 && !ISL_F_ISSET(mat, ISL_MAT_BORROWED))
185 mat2 = isl_mat_dup(mat);
190 void isl_mat_free(struct isl_mat *mat)
198 if (!ISL_F_ISSET(mat, ISL_MAT_BORROWED))
199 isl_blk_free(mat->ctx, mat->block);
200 isl_ctx_deref(mat->ctx);
205 struct isl_mat *isl_mat_identity(struct isl_ctx *ctx, unsigned n_row)
210 mat = isl_mat_alloc(ctx, n_row, n_row);
213 for (i = 0; i < n_row; ++i) {
214 isl_seq_clr(mat->row[i], i);
215 isl_int_set_si(mat->row[i][i], 1);
216 isl_seq_clr(mat->row[i]+i+1, n_row-(i+1));
222 struct isl_vec *isl_mat_vec_product(struct isl_mat *mat, struct isl_vec *vec)
225 struct isl_vec *prod;
230 isl_assert(mat->ctx, mat->n_col == vec->size, goto error);
232 prod = isl_vec_alloc(mat->ctx, mat->n_row);
236 for (i = 0; i < prod->size; ++i)
237 isl_seq_inner_product(mat->row[i], vec->el, vec->size,
238 &prod->block.data[i]);
248 __isl_give isl_vec *isl_mat_vec_inverse_product(__isl_take isl_mat *mat,
249 __isl_take isl_vec *vec)
251 struct isl_mat *vec_mat;
256 vec_mat = isl_mat_alloc(vec->ctx, vec->size, 1);
259 for (i = 0; i < vec->size; ++i)
260 isl_int_set(vec_mat->row[i][0], vec->el[i]);
261 vec_mat = isl_mat_inverse_product(mat, vec_mat);
265 vec = isl_vec_alloc(vec_mat->ctx, vec_mat->n_row);
267 for (i = 0; i < vec->size; ++i)
268 isl_int_set(vec->el[i], vec_mat->row[i][0]);
269 isl_mat_free(vec_mat);
277 struct isl_vec *isl_vec_mat_product(struct isl_vec *vec, struct isl_mat *mat)
280 struct isl_vec *prod;
285 isl_assert(mat->ctx, mat->n_row == vec->size, goto error);
287 prod = isl_vec_alloc(mat->ctx, mat->n_col);
291 for (i = 0; i < prod->size; ++i) {
292 isl_int_set_si(prod->el[i], 0);
293 for (j = 0; j < vec->size; ++j)
294 isl_int_addmul(prod->el[i], vec->el[j], mat->row[j][i]);
305 struct isl_mat *isl_mat_aff_direct_sum(struct isl_mat *left,
306 struct isl_mat *right)
314 isl_assert(left->ctx, left->n_row == right->n_row, goto error);
315 isl_assert(left->ctx, left->n_row >= 1, goto error);
316 isl_assert(left->ctx, left->n_col >= 1, goto error);
317 isl_assert(left->ctx, right->n_col >= 1, goto error);
318 isl_assert(left->ctx,
319 isl_seq_first_non_zero(left->row[0]+1, left->n_col-1) == -1,
321 isl_assert(left->ctx,
322 isl_seq_first_non_zero(right->row[0]+1, right->n_col-1) == -1,
325 sum = isl_mat_alloc(left->ctx, left->n_row, left->n_col + right->n_col - 1);
328 isl_int_lcm(sum->row[0][0], left->row[0][0], right->row[0][0]);
329 isl_int_divexact(left->row[0][0], sum->row[0][0], left->row[0][0]);
330 isl_int_divexact(right->row[0][0], sum->row[0][0], right->row[0][0]);
332 isl_seq_clr(sum->row[0]+1, sum->n_col-1);
333 for (i = 1; i < sum->n_row; ++i) {
334 isl_int_mul(sum->row[i][0], left->row[0][0], left->row[i][0]);
335 isl_int_addmul(sum->row[i][0],
336 right->row[0][0], right->row[i][0]);
337 isl_seq_scale(sum->row[i]+1, left->row[i]+1, left->row[0][0],
339 isl_seq_scale(sum->row[i]+left->n_col,
340 right->row[i]+1, right->row[0][0],
344 isl_int_divexact(left->row[0][0], sum->row[0][0], left->row[0][0]);
345 isl_int_divexact(right->row[0][0], sum->row[0][0], right->row[0][0]);
355 static void exchange(struct isl_mat *M, struct isl_mat **U,
356 struct isl_mat **Q, unsigned row, unsigned i, unsigned j)
359 for (r = row; r < M->n_row; ++r)
360 isl_int_swap(M->row[r][i], M->row[r][j]);
362 for (r = 0; r < (*U)->n_row; ++r)
363 isl_int_swap((*U)->row[r][i], (*U)->row[r][j]);
366 isl_mat_swap_rows(*Q, i, j);
369 static void subtract(struct isl_mat *M, struct isl_mat **U,
370 struct isl_mat **Q, unsigned row, unsigned i, unsigned j, isl_int m)
373 for (r = row; r < M->n_row; ++r)
374 isl_int_submul(M->row[r][j], m, M->row[r][i]);
376 for (r = 0; r < (*U)->n_row; ++r)
377 isl_int_submul((*U)->row[r][j], m, (*U)->row[r][i]);
380 for (r = 0; r < (*Q)->n_col; ++r)
381 isl_int_addmul((*Q)->row[i][r], m, (*Q)->row[j][r]);
385 static void oppose(struct isl_mat *M, struct isl_mat **U,
386 struct isl_mat **Q, unsigned row, unsigned col)
389 for (r = row; r < M->n_row; ++r)
390 isl_int_neg(M->row[r][col], M->row[r][col]);
392 for (r = 0; r < (*U)->n_row; ++r)
393 isl_int_neg((*U)->row[r][col], (*U)->row[r][col]);
396 isl_seq_neg((*Q)->row[col], (*Q)->row[col], (*Q)->n_col);
399 /* Given matrix M, compute
404 * with U and Q unimodular matrices and H a matrix in column echelon form
405 * such that on each echelon row the entries in the non-echelon column
406 * are non-negative (if neg == 0) or non-positive (if neg == 1)
407 * and stricly smaller (in absolute value) than the entries in the echelon
409 * If U or Q are NULL, then these matrices are not computed.
411 struct isl_mat *isl_mat_left_hermite(struct isl_mat *M, int neg,
412 struct isl_mat **U, struct isl_mat **Q)
427 *U = isl_mat_identity(M->ctx, M->n_col);
432 *Q = isl_mat_identity(M->ctx, M->n_col);
439 for (row = 0; row < M->n_row; ++row) {
441 first = isl_seq_abs_min_non_zero(M->row[row]+col, M->n_col-col);
446 exchange(M, U, Q, row, first, col);
447 if (isl_int_is_neg(M->row[row][col]))
448 oppose(M, U, Q, row, col);
450 while ((off = isl_seq_first_non_zero(M->row[row]+first,
451 M->n_col-first)) != -1) {
453 isl_int_fdiv_q(c, M->row[row][first], M->row[row][col]);
454 subtract(M, U, Q, row, col, first, c);
455 if (!isl_int_is_zero(M->row[row][first]))
456 exchange(M, U, Q, row, first, col);
460 for (i = 0; i < col; ++i) {
461 if (isl_int_is_zero(M->row[row][i]))
464 isl_int_cdiv_q(c, M->row[row][i], M->row[row][col]);
466 isl_int_fdiv_q(c, M->row[row][i], M->row[row][col]);
467 if (isl_int_is_zero(c))
469 subtract(M, U, Q, row, col, i, c);
488 struct isl_mat *isl_mat_right_kernel(struct isl_mat *mat)
491 struct isl_mat *U = NULL;
494 mat = isl_mat_left_hermite(mat, 0, &U, NULL);
498 for (i = 0, rank = 0; rank < mat->n_col; ++rank) {
499 while (i < mat->n_row && isl_int_is_zero(mat->row[i][rank]))
504 K = isl_mat_alloc(U->ctx, U->n_row, U->n_col - rank);
507 isl_mat_sub_copy(K->ctx, K->row, U->row, U->n_row, 0, rank, U->n_col-rank);
517 struct isl_mat *isl_mat_lin_to_aff(struct isl_mat *mat)
520 struct isl_mat *mat2;
524 mat2 = isl_mat_alloc(mat->ctx, 1+mat->n_row, 1+mat->n_col);
527 isl_int_set_si(mat2->row[0][0], 1);
528 isl_seq_clr(mat2->row[0]+1, mat->n_col);
529 for (i = 0; i < mat->n_row; ++i) {
530 isl_int_set_si(mat2->row[1+i][0], 0);
531 isl_seq_cpy(mat2->row[1+i]+1, mat->row[i], mat->n_col);
540 static int row_first_non_zero(isl_int **row, unsigned n_row, unsigned col)
544 for (i = 0; i < n_row; ++i)
545 if (!isl_int_is_zero(row[i][col]))
550 static int row_abs_min_non_zero(isl_int **row, unsigned n_row, unsigned col)
552 int i, min = row_first_non_zero(row, n_row, col);
555 for (i = min + 1; i < n_row; ++i) {
556 if (isl_int_is_zero(row[i][col]))
558 if (isl_int_abs_lt(row[i][col], row[min][col]))
564 static void inv_exchange(struct isl_mat *left, struct isl_mat *right,
565 unsigned i, unsigned j)
567 left = isl_mat_swap_rows(left, i, j);
568 right = isl_mat_swap_rows(right, i, j);
571 static void inv_oppose(
572 struct isl_mat *left, struct isl_mat *right, unsigned row)
574 isl_seq_neg(left->row[row]+row, left->row[row]+row, left->n_col-row);
575 isl_seq_neg(right->row[row], right->row[row], right->n_col);
578 static void inv_subtract(struct isl_mat *left, struct isl_mat *right,
579 unsigned row, unsigned i, isl_int m)
582 isl_seq_combine(left->row[i]+row,
583 left->ctx->one, left->row[i]+row,
584 m, left->row[row]+row,
586 isl_seq_combine(right->row[i], right->ctx->one, right->row[i],
587 m, right->row[row], right->n_col);
590 /* Compute inv(left)*right
592 struct isl_mat *isl_mat_inverse_product(struct isl_mat *left,
593 struct isl_mat *right)
601 isl_assert(left->ctx, left->n_row == left->n_col, goto error);
602 isl_assert(left->ctx, left->n_row == right->n_row, goto error);
604 if (left->n_row == 0) {
609 left = isl_mat_cow(left);
610 right = isl_mat_cow(right);
616 for (row = 0; row < left->n_row; ++row) {
617 int pivot, first, i, off;
618 pivot = row_abs_min_non_zero(left->row+row, left->n_row-row, row);
622 isl_assert(left->ctx, pivot >= 0, goto error);
626 inv_exchange(left, right, pivot, row);
627 if (isl_int_is_neg(left->row[row][row]))
628 inv_oppose(left, right, row);
630 while ((off = row_first_non_zero(left->row+first,
631 left->n_row-first, row)) != -1) {
633 isl_int_fdiv_q(a, left->row[first][row],
634 left->row[row][row]);
635 inv_subtract(left, right, row, first, a);
636 if (!isl_int_is_zero(left->row[first][row]))
637 inv_exchange(left, right, row, first);
641 for (i = 0; i < row; ++i) {
642 if (isl_int_is_zero(left->row[i][row]))
644 isl_int_gcd(a, left->row[row][row], left->row[i][row]);
645 isl_int_divexact(b, left->row[i][row], a);
646 isl_int_divexact(a, left->row[row][row], a);
648 isl_seq_combine(left->row[i] + i,
650 b, left->row[row] + i,
652 isl_seq_combine(right->row[i], a, right->row[i],
653 b, right->row[row], right->n_col);
658 isl_int_set(a, left->row[0][0]);
659 for (row = 1; row < left->n_row; ++row)
660 isl_int_lcm(a, a, left->row[row][row]);
661 if (isl_int_is_zero(a)){
663 isl_assert(left->ctx, 0, goto error);
665 for (row = 0; row < left->n_row; ++row) {
666 isl_int_divexact(left->row[row][row], a, left->row[row][row]);
667 if (isl_int_is_one(left->row[row][row]))
669 isl_seq_scale(right->row[row], right->row[row],
670 left->row[row][row], right->n_col);
682 void isl_mat_col_scale(struct isl_mat *mat, unsigned col, isl_int m)
686 for (i = 0; i < mat->n_row; ++i)
687 isl_int_mul(mat->row[i][col], mat->row[i][col], m);
690 void isl_mat_col_combine(struct isl_mat *mat, unsigned dst,
691 isl_int m1, unsigned src1, isl_int m2, unsigned src2)
697 for (i = 0; i < mat->n_row; ++i) {
698 isl_int_mul(tmp, m1, mat->row[i][src1]);
699 isl_int_addmul(tmp, m2, mat->row[i][src2]);
700 isl_int_set(mat->row[i][dst], tmp);
705 struct isl_mat *isl_mat_right_inverse(struct isl_mat *mat)
711 mat = isl_mat_cow(mat);
715 inv = isl_mat_identity(mat->ctx, mat->n_col);
716 inv = isl_mat_cow(inv);
722 for (row = 0; row < mat->n_row; ++row) {
723 int pivot, first, i, off;
724 pivot = isl_seq_abs_min_non_zero(mat->row[row]+row, mat->n_col-row);
728 isl_assert(mat->ctx, pivot >= 0, goto error);
732 exchange(mat, &inv, NULL, row, pivot, row);
733 if (isl_int_is_neg(mat->row[row][row]))
734 oppose(mat, &inv, NULL, row, row);
736 while ((off = isl_seq_first_non_zero(mat->row[row]+first,
737 mat->n_col-first)) != -1) {
739 isl_int_fdiv_q(a, mat->row[row][first],
741 subtract(mat, &inv, NULL, row, row, first, a);
742 if (!isl_int_is_zero(mat->row[row][first]))
743 exchange(mat, &inv, NULL, row, row, first);
747 for (i = 0; i < row; ++i) {
748 if (isl_int_is_zero(mat->row[row][i]))
750 isl_int_gcd(a, mat->row[row][row], mat->row[row][i]);
751 isl_int_divexact(b, mat->row[row][i], a);
752 isl_int_divexact(a, mat->row[row][row], a);
754 isl_mat_col_combine(mat, i, a, i, b, row);
755 isl_mat_col_combine(inv, i, a, i, b, row);
760 isl_int_set(a, mat->row[0][0]);
761 for (row = 1; row < mat->n_row; ++row)
762 isl_int_lcm(a, a, mat->row[row][row]);
763 if (isl_int_is_zero(a)){
767 for (row = 0; row < mat->n_row; ++row) {
768 isl_int_divexact(mat->row[row][row], a, mat->row[row][row]);
769 if (isl_int_is_one(mat->row[row][row]))
771 isl_mat_col_scale(inv, row, mat->row[row][row]);
783 struct isl_mat *isl_mat_transpose(struct isl_mat *mat)
785 struct isl_mat *transpose = NULL;
788 if (mat->n_col == mat->n_row) {
789 mat = isl_mat_cow(mat);
792 for (i = 0; i < mat->n_row; ++i)
793 for (j = i + 1; j < mat->n_col; ++j)
794 isl_int_swap(mat->row[i][j], mat->row[j][i]);
797 transpose = isl_mat_alloc(mat->ctx, mat->n_col, mat->n_row);
800 for (i = 0; i < mat->n_row; ++i)
801 for (j = 0; j < mat->n_col; ++j)
802 isl_int_set(transpose->row[j][i], mat->row[i][j]);
810 struct isl_mat *isl_mat_swap_cols(struct isl_mat *mat, unsigned i, unsigned j)
814 mat = isl_mat_cow(mat);
817 isl_assert(mat->ctx, i < mat->n_col, goto error);
818 isl_assert(mat->ctx, j < mat->n_col, goto error);
820 for (r = 0; r < mat->n_row; ++r)
821 isl_int_swap(mat->row[r][i], mat->row[r][j]);
828 struct isl_mat *isl_mat_swap_rows(struct isl_mat *mat, unsigned i, unsigned j)
834 mat = isl_mat_cow(mat);
838 mat->row[i] = mat->row[j];
843 struct isl_mat *isl_mat_product(struct isl_mat *left, struct isl_mat *right)
846 struct isl_mat *prod;
850 isl_assert(left->ctx, left->n_col == right->n_row, goto error);
851 prod = isl_mat_alloc(left->ctx, left->n_row, right->n_col);
854 if (left->n_col == 0) {
855 for (i = 0; i < prod->n_row; ++i)
856 isl_seq_clr(prod->row[i], prod->n_col);
859 for (i = 0; i < prod->n_row; ++i) {
860 for (j = 0; j < prod->n_col; ++j) {
861 isl_int_mul(prod->row[i][j],
862 left->row[i][0], right->row[0][j]);
863 for (k = 1; k < left->n_col; ++k)
864 isl_int_addmul(prod->row[i][j],
865 left->row[i][k], right->row[k][j]);
877 /* Replace the variables x in the rows q by x' given by x = M x',
878 * with M the matrix mat.
880 * If the number of new variables is greater than the original
881 * number of variables, then the rows q have already been
882 * preextended. If the new number is smaller, then the coefficients
883 * of the divs, which are not changed, need to be shifted down.
884 * The row q may be the equalities, the inequalities or the
885 * div expressions. In the latter case, has_div is true and
886 * we need to take into account the extra denominator column.
888 static int preimage(struct isl_ctx *ctx, isl_int **q, unsigned n,
889 unsigned n_div, int has_div, struct isl_mat *mat)
895 if (mat->n_col >= mat->n_row)
898 e = mat->n_row - mat->n_col;
900 for (i = 0; i < n; ++i)
901 isl_int_mul(q[i][0], q[i][0], mat->row[0][0]);
902 t = isl_mat_sub_alloc(mat->ctx, q, 0, n, has_div, mat->n_row);
903 t = isl_mat_product(t, mat);
906 for (i = 0; i < n; ++i) {
907 isl_seq_swp_or_cpy(q[i] + has_div, t->row[i], t->n_col);
908 isl_seq_cpy(q[i] + has_div + t->n_col,
909 q[i] + has_div + t->n_col + e, n_div);
910 isl_seq_clr(q[i] + has_div + t->n_col + n_div, e);
916 /* Replace the variables x in bset by x' given by x = M x', with
919 * If there are fewer variables x' then there are x, then we perform
920 * the transformation in place, which that, in principle,
921 * this frees up some extra variables as the number
922 * of columns remains constant, but we would have to extend
923 * the div array too as the number of rows in this array is assumed
924 * to be equal to extra.
926 struct isl_basic_set *isl_basic_set_preimage(struct isl_basic_set *bset,
935 bset = isl_basic_set_cow(bset);
939 isl_assert(ctx, bset->dim->nparam == 0, goto error);
940 isl_assert(ctx, 1+bset->dim->n_out == mat->n_row, goto error);
941 isl_assert(ctx, mat->n_col > 0, goto error);
943 if (mat->n_col > mat->n_row)
944 bset = isl_basic_set_extend(bset, 0, mat->n_col-1, 0,
946 else if (mat->n_col < mat->n_row) {
947 bset->dim = isl_dim_cow(bset->dim);
950 bset->dim->n_out -= mat->n_row - mat->n_col;
953 if (preimage(ctx, bset->eq, bset->n_eq, bset->n_div, 0,
954 isl_mat_copy(mat)) < 0)
957 if (preimage(ctx, bset->ineq, bset->n_ineq, bset->n_div, 0,
958 isl_mat_copy(mat)) < 0)
961 if (preimage(ctx, bset->div, bset->n_div, bset->n_div, 1, mat) < 0)
964 ISL_F_CLR(bset, ISL_BASIC_SET_NO_IMPLICIT);
965 ISL_F_CLR(bset, ISL_BASIC_SET_NO_REDUNDANT);
966 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
967 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED_DIVS);
968 ISL_F_CLR(bset, ISL_BASIC_SET_ALL_EQUALITIES);
970 bset = isl_basic_set_simplify(bset);
971 bset = isl_basic_set_finalize(bset);
977 isl_basic_set_free(bset);
981 struct isl_set *isl_set_preimage(struct isl_set *set, struct isl_mat *mat)
986 set = isl_set_cow(set);
991 for (i = 0; i < set->n; ++i) {
992 set->p[i] = isl_basic_set_preimage(set->p[i],
997 if (mat->n_col != mat->n_row) {
998 set->dim = isl_dim_cow(set->dim);
1001 set->dim->n_out += mat->n_col;
1002 set->dim->n_out -= mat->n_row;
1005 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1013 void isl_mat_dump(struct isl_mat *mat, FILE *out, int indent)
1018 fprintf(out, "%*snull mat\n", indent, "");
1022 if (mat->n_row == 0)
1023 fprintf(out, "%*s[]\n", indent, "");
1025 for (i = 0; i < mat->n_row; ++i) {
1027 fprintf(out, "%*s[[", indent, "");
1029 fprintf(out, "%*s[", indent+1, "");
1030 for (j = 0; j < mat->n_col; ++j) {
1033 isl_int_print(out, mat->row[i][j], 0);
1035 if (i == mat->n_row-1)
1036 fprintf(out, "]]\n");
1038 fprintf(out, "]\n");
1042 struct isl_mat *isl_mat_drop_cols(struct isl_mat *mat, unsigned col, unsigned n)
1046 mat = isl_mat_cow(mat);
1050 if (col != mat->n_col-n) {
1051 for (r = 0; r < mat->n_row; ++r)
1052 isl_seq_cpy(mat->row[r]+col, mat->row[r]+col+n,
1053 mat->n_col - col - n);
1059 struct isl_mat *isl_mat_drop_rows(struct isl_mat *mat, unsigned row, unsigned n)
1063 mat = isl_mat_cow(mat);
1067 for (r = row; r+n < mat->n_row; ++r)
1068 mat->row[r] = mat->row[r+n];
1074 __isl_give isl_mat *isl_mat_insert_cols(__isl_take isl_mat *mat,
1075 unsigned col, unsigned n)
1084 ext = isl_mat_alloc(mat->ctx, mat->n_row, mat->n_col + n);
1088 isl_mat_sub_copy(mat->ctx, ext->row, mat->row, mat->n_row, 0, 0, col);
1089 isl_mat_sub_copy(mat->ctx, ext->row, mat->row, mat->n_row,
1090 col + n, col, mat->n_col - col);
1099 void isl_mat_col_submul(struct isl_mat *mat,
1100 int dst_col, isl_int f, int src_col)
1104 for (i = 0; i < mat->n_row; ++i)
1105 isl_int_submul(mat->row[i][dst_col], f, mat->row[i][src_col]);
1108 void isl_mat_col_mul(struct isl_mat *mat, int dst_col, isl_int f, int src_col)
1112 for (i = 0; i < mat->n_row; ++i)
1113 isl_int_mul(mat->row[i][dst_col], f, mat->row[i][src_col]);
1116 struct isl_mat *isl_mat_unimodular_complete(struct isl_mat *M, int row)
1119 struct isl_mat *H = NULL, *Q = NULL;
1124 isl_assert(M->ctx, M->n_row == M->n_col, goto error);
1126 H = isl_mat_left_hermite(isl_mat_copy(M), 0, NULL, &Q);
1127 M->n_row = M->n_col;
1130 for (r = 0; r < row; ++r)
1131 isl_assert(M->ctx, isl_int_is_one(H->row[r][r]), goto error);
1132 for (r = row; r < M->n_row; ++r)
1133 isl_seq_cpy(M->row[r], Q->row[r], M->n_col);
1144 __isl_give isl_mat *isl_mat_concat(__isl_take isl_mat *top,
1145 __isl_take isl_mat *bot)
1147 struct isl_mat *mat;
1152 isl_assert(top->ctx, top->n_col == bot->n_col, goto error);
1153 if (top->n_row == 0) {
1157 if (bot->n_row == 0) {
1162 mat = isl_mat_alloc(top->ctx, top->n_row + bot->n_row, top->n_col);
1165 isl_mat_sub_copy(mat->ctx, mat->row, top->row, top->n_row,
1167 isl_mat_sub_copy(mat->ctx, mat->row + top->n_row, bot->row, bot->n_row,
1178 int isl_mat_is_equal(__isl_keep isl_mat *mat1, __isl_keep isl_mat *mat2)
1185 if (mat1->n_row != mat2->n_row)
1188 if (mat1->n_col != mat2->n_col)
1191 for (i = 0; i < mat1->n_row; ++i)
1192 if (!isl_seq_eq(mat1->row[i], mat2->row[i], mat1->n_col))
1198 __isl_give isl_mat *isl_mat_from_row_vec(__isl_take isl_vec *vec)
1200 struct isl_mat *mat;
1204 mat = isl_mat_alloc(vec->ctx, 1, vec->size);
1208 isl_seq_cpy(mat->row[0], vec->el, vec->size);
1217 __isl_give isl_mat *isl_mat_vec_concat(__isl_take isl_mat *top,
1218 __isl_take isl_vec *bot)
1220 return isl_mat_concat(top, isl_mat_from_row_vec(bot));
1223 __isl_give isl_mat *isl_mat_move_cols(__isl_take isl_mat *mat,
1224 unsigned dst_col, unsigned src_col, unsigned n)
1230 if (n == 0 || dst_col == src_col)
1233 res = isl_mat_alloc(mat->ctx, mat->n_row, mat->n_col);
1237 if (dst_col < src_col) {
1238 isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row,
1240 isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row,
1241 dst_col, src_col, n);
1242 isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row,
1243 dst_col + n, dst_col, src_col - dst_col);
1244 isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row,
1245 src_col + n, src_col + n,
1246 res->n_col - src_col - n);
1248 isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row,
1250 isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row,
1251 src_col, src_col + n, dst_col - src_col);
1252 isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row,
1253 dst_col, src_col, n);
1254 isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row,
1255 dst_col + n, dst_col + n,
1256 res->n_col - dst_col - n);