#include "fmpz_poly.h"
#include "fmpz_poly_mat.h"
#define E(j,k) fmpz_poly_mat_entry(B,j,k)
static inline void
fmpz_poly_mat_swap_rows(fmpz_poly_mat_t mat, slong * perm, slong r, slong s)
{
if (r != s)
{
slong i, t;
if (perm)
{
t = perm[s];
perm[s] = perm[r];
perm[r] = t;
}
for (i = 0; i < mat->c; i++)
FLINT_SWAP(fmpz_poly_struct, *fmpz_poly_mat_entry(mat, r, i), *fmpz_poly_mat_entry(mat, s, i));
}
}
slong
fmpz_poly_mat_fflu(fmpz_poly_mat_t B, fmpz_poly_t den, slong * perm,
const fmpz_poly_mat_t A, int rank_check)
{
fmpz_poly_t t;
slong m, n, j, k, rank, r, pivot_row, pivot_col;
if (fmpz_poly_mat_is_empty(A))
{
fmpz_poly_one(den);
return 0;
}
fmpz_poly_mat_set(B, A);
m = B->r;
n = B->c;
rank = pivot_row = pivot_col = 0;
fmpz_poly_init(t);
while (pivot_row < m && pivot_col < n)
{
r = fmpz_poly_mat_find_pivot_partial(B, pivot_row, m, pivot_col);
if (r == -1)
{
if (rank_check)
{
fmpz_poly_zero(den);
rank = 0;
break;
}
pivot_col++;
continue;
}
else if (r != pivot_row)
fmpz_poly_mat_swap_rows(B, perm, pivot_row, r);
rank++;
for (j = pivot_row + 1; j < m; j++)
{
for (k = pivot_col + 1; k < n; k++)
{
fmpz_poly_mul(E(j, k), E(j, k), E(pivot_row, pivot_col));
fmpz_poly_mul(t, E(j, pivot_col), E(pivot_row, k));
fmpz_poly_sub(E(j, k), E(j, k), t);
if (pivot_row > 0)
fmpz_poly_divexact(E(j, k), E(j, k), den);
}
}
fmpz_poly_set(den, E(pivot_row, pivot_col));
pivot_row++;
pivot_col++;
}
fmpz_poly_clear(t);
return rank;
}