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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
|
/* mpfr_div_ui -- divide a floating-point number by a machine integer
Copyright (C) 1999 PolKA project, Inria Lorraine and Loria
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 Library General Public License as published by
the Free Software Foundation; either version 2 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 Library General Public
License for more details.
You should have received a copy of the GNU Library 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 <stdio.h>
#include "gmp.h"
#include "gmp-impl.h"
#include "longlong.h"
#include "mpfr.h"
/* #define DEBUG */
/* returns 0 if result exact, non-zero otherwise */
int
#ifdef __STDC__
mpfr_div_ui(mpfr_ptr y, mpfr_srcptr x, unsigned long u, unsigned char rnd_mode)
#else
mpfr_div_ui(y, x, u, rnd_mode)
mpfr_ptr y;
mpfr_srcptr x;
unsigned long u;
unsigned char rnd_mode;
#endif
{
int xn, yn, dif, sh, i; mp_limb_t *xp, *yp, *tmp, c, d;
TMP_DECL(marker);
if (FLAG_NAN(x)) { SET_NAN(y); return 1; }
if (u==0) { printf("infinity\n"); return 1; }
TMP_MARK(marker);
xn = (PREC(x)-1)/BITS_PER_MP_LIMB + 1;
yn = (PREC(y)-1)/BITS_PER_MP_LIMB + 1;
xp = MANT(x);
yp = MANT(y);
EXP(y) = EXP(x);
if (SIGN(x)!=SIGN(y)) CHANGE_SIGN(y);
dif = yn+1-xn;
#ifdef DEBUG
printf("dif=%d u=%lu xn=%d\n",dif,u,xn);
printf("x="); mpfr_print_raw(x); putchar('\n');
#endif
/* we need to store yn+1 = xn + dif limbs of the quotient */
if (ABSSIZE(y)>=yn+1) tmp=yp;
else tmp=TMP_ALLOC((yn+1)*BYTES_PER_MP_LIMB);
c = (mp_limb_t) u;
if (dif>=0) {
/* patch for bug in mpn_divrem_1 */
#if (UDIV_NEEDS_NORMALIZATION==1)
count_leading_zeros(sh, c);
c <<= sh;
EXP(y) += sh;
#endif
c = mpn_divrem_1(tmp, dif, xp, xn, c);
}
else /* dif < 0 i.e. xn > yn */
c = mpn_divrem_1(tmp, 0, xp-dif, yn, c);
if (tmp[yn]==0) { tmp--; sh=0; EXP(y) -= mp_bits_per_limb; }
/* shift left to normalize */
count_leading_zeros(sh, tmp[yn]);
if (sh) {
mpn_lshift(yp, tmp+1, yn, sh);
yp[0] += tmp[0] >> (BITS_PER_MP_LIMB-sh);
EXP(y) -= sh;
}
else MPN_COPY(yp, tmp+1, yn);
#ifdef DEBUG
printf("y="); mpfr_print_raw(y); putchar('\n');
#endif
sh = yn*BITS_PER_MP_LIMB - PREC(y);
/* it remains sh bits in less significant limb of y */
d = *yp & (((mp_limb_t)1 << sh) - 1);
*yp ^= d; /* set to zero lowest sh bits */
TMP_FREE(marker);
if ((c | d)==0) {
for (i=0; i<-dif && xp[i]==0; i++);
if (i>=-dif) return 0; /* result is exact */
}
switch (rnd_mode) {
case GMP_RNDZ:
return 1; /* result is inexact */
case GMP_RNDU:
if (SIGN(y)>0) mpfr_add_one_ulp(y);
return 1; /* result is inexact */
case GMP_RNDD:
if (SIGN(y)<0) mpfr_add_one_ulp(y);
return 1; /* result is inexact */
case GMP_RNDN:
if (d < ((mp_limb_t)1 << (sh-1))) return 1;
else if (d > ((mp_limb_t)1 << (sh-1))) {
mpfr_add_one_ulp(y);
}
else { /* d = (mp_limb_t)1 << (sh-1) */
if (c) mpfr_add_one_ulp(y);
else {
for (i=0; i<-dif && xp[i]==0; i++);
if (i<-dif) mpfr_add_one_ulp(y);
else { /* exactly in the middle */
if (*yp & ((mp_limb_t)1 << sh)) mpfr_add_one_ulp(y);
}
}
}
return 1;
}
return 0; /* to prevent warning from gcc */
}
|
