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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
/* mpfr_mul_ui -- multiply a floating-point number by a machine integer
Copyright 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
This file is part of the MPFR Library.
The MPFR Library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or (at your
option) any later version.
The MPFR Library is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the MPFR Library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
MA 02111-1307, USA. */
#include "gmp.h"
#include "gmp-impl.h"
#include "longlong.h"
#include "mpfr.h"
#include "mpfr-impl.h"
int
mpfr_mul_ui (mpfr_ptr y, mpfr_srcptr x, unsigned long int u, mp_rnd_t rnd_mode)
{
mp_limb_t *yp, *old_yp;
mp_size_t xn, yn;
int cnt, c, inexact;
TMP_DECL(marker);
if (MPFR_IS_NAN(x))
{
MPFR_SET_NAN(y);
MPFR_RET_NAN;
}
if (MPFR_IS_INF(x))
{
if (u != 0)
{
MPFR_CLEAR_FLAGS(y);
MPFR_SET_INF(y);
MPFR_SET_SAME_SIGN(y, x);
MPFR_RET(0); /* infinity is exact */
}
else /* 0 * infinity */
{
MPFR_SET_NAN(y);
MPFR_RET_NAN;
}
}
MPFR_CLEAR_FLAGS(y);
if (u == 0 || MPFR_IS_ZERO(x))
{
MPFR_SET_ZERO(y);
MPFR_SET_SAME_SIGN(y, x);
MPFR_RET(0); /* zero is exact */
}
if (u == 1)
return mpfr_set (y, x, rnd_mode);
TMP_MARK(marker);
yp = MPFR_MANT(y);
yn = (MPFR_PREC(y) - 1) / BITS_PER_MP_LIMB + 1;
xn = (MPFR_PREC(x) - 1) / BITS_PER_MP_LIMB + 1;
old_yp = yp;
MPFR_ASSERTN(xn < MP_SIZE_T_MAX);
if (yn < xn + 1)
yp = (mp_ptr) TMP_ALLOC ((size_t) (xn + 1) * BYTES_PER_MP_LIMB);
yp[xn] = mpn_mul_1 (yp, MPFR_MANT(x), xn, u);
/* x * u is stored in yp[xn], ..., yp[0] */
/* since the case u=1 was treated above, we have u >= 2, thus
yp[xn] >= 1 since x was msb-normalized */
MPFR_ASSERTN(yp[xn] != 0);
if ((yp[xn] & GMP_LIMB_HIGHBIT) == 0)
{
count_leading_zeros(cnt, yp[xn]);
mpn_lshift (yp, yp, xn + 1, cnt);
}
else
{
cnt = 0;
}
/* now yp[xn], ..., yp[0] is msb-normalized too, and has at most
PREC(x) + (BITS_PER_MP_LIMB - cnt) non-zero bits */
c = mpfr_round_raw (old_yp, yp, (mp_prec_t) (xn + 1) * BITS_PER_MP_LIMB,
(MPFR_SIGN(x) < 0), MPFR_PREC(y), rnd_mode, &inexact);
cnt = BITS_PER_MP_LIMB - cnt;
if (c) /* rounded result is 1.0000000000000000... */
{
old_yp[yn-1] = GMP_LIMB_HIGHBIT;
cnt++;
}
TMP_FREE(marker);
if (__mpfr_emax < MPFR_EMAX_MIN + cnt || MPFR_EXP(x) > __mpfr_emax - cnt)
return mpfr_set_overflow(y, rnd_mode, MPFR_SIGN(x));
MPFR_EXP(y) = MPFR_EXP(x) + cnt;
MPFR_SET_SAME_SIGN(y, x);
return inexact;
}
|
