1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
/*
Copyright (C) 2018 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 3 of the License, or
(at your option) any later version. See <https://www.gnu.org/licenses/>.
*/
#include <gmp.h>
#include "mpoly.h"
#if FLINT_WANT_ASSERT
# include "fmpz.h"
#endif
void mpoly_monomial_mul_fmpz(ulong * exp2, const ulong * exp3,
slong N, const fmpz_t c)
{
FLINT_ASSERT(fmpz_sgn(c) >= 0);
if (!COEFF_IS_MPZ(*c))
{
FLINT_ASSERT(N > 0);
mpn_mul_1(exp2, exp3, N, *c);
}
else
{
slong i, cn;
ulong * cp;
cn = COEFF_TO_PTR(*c)->_mp_size;
cp = COEFF_TO_PTR(*c)->_mp_d;
FLINT_ASSERT(0 < cn);
FLINT_ASSERT(cn <= N);
if (exp2 != exp3)
{
FLINT_ASSERT(N > 0);
mpn_mul_1(exp2, exp3, N, cp[0]);
for (i = 1; i < cn; i++)
{
FLINT_ASSERT(N > i);
mpn_addmul_1(exp2 + i, exp3, N - i, cp[i]);
}
}
else
{
ulong * t;
TMP_INIT;
TMP_START;
t = TMP_ALLOC(N*sizeof(ulong));
FLINT_ASSERT(N > 0);
mpn_mul_1(t, exp3, N, cp[0]);
for (i = 1; i < cn; i++)
{
FLINT_ASSERT(N > i);
mpn_addmul_1(t + i, exp3, N - i, cp[i]);
}
for (i = 0; i < N; i++)
exp2[i] = t[i];
TMP_END;
}
}
}