/* Copyright (C) 2017 Daniel Schultz This file is part of FLINT. FLINT is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License (LGPL) as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. See . */ #include "fq_nmod_mpoly.h" int fq_nmod_mpoly_repack_bits( fq_nmod_mpoly_t A, const fq_nmod_mpoly_t B, flint_bitcnt_t Abits, const fq_nmod_mpoly_ctx_t ctx) { int success; Abits = mpoly_fix_bits(Abits, ctx->minfo); if (B->bits == Abits || B->length == 0) { fq_nmod_mpoly_set(A, B, ctx); return 1; } if (A == B) return fq_nmod_mpoly_repack_bits_inplace(A, Abits, ctx); fq_nmod_mpoly_fit_length_reset_bits(A, B->length, Abits, ctx); success = mpoly_repack_monomials(A->exps, Abits, B->exps, B->bits, B->length, ctx->minfo); if (success) { slong d = fq_nmod_ctx_degree(ctx->fqctx); _nmod_vec_set(A->coeffs, B->coeffs, d*B->length); A->length = B->length; } else { A->length = 0; } return success; } int fq_nmod_mpoly_repack_bits_inplace( fq_nmod_mpoly_t A, flint_bitcnt_t Abits, const fq_nmod_mpoly_ctx_t ctx) { int success; ulong * texps; slong talloc; slong N = mpoly_words_per_exp(Abits, ctx->minfo); if (A->bits == Abits) { return 1; } if (A->length < 1) { A->bits = Abits; return 1; } N = mpoly_words_per_exp(Abits, ctx->minfo); talloc = N*A->length; texps = FLINT_ARRAY_ALLOC(talloc, ulong); success = mpoly_repack_monomials(texps, Abits, A->exps, A->bits, A->length, ctx->minfo); A->bits = Abits; if (success) { flint_free(A->exps); A->exps = texps; A->exps_alloc = talloc; } else { flint_free(texps); A->length = 0; } return success; }