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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
/* mpfr_cmp2 -- exponent shift when subtracting two numbers.
Copyright (C) 1999-2001 Free Software Foundation.
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"
#include "mpfr-impl.h"
/* returns the number of cancelled bits when one subtracts abs(c) from abs(b).
Assumes b>=c, which implies MPFR_EXP(b)>=MPFR_EXP(c).
if b=c, returns prec(b).
Assumes neither of b or c is NaN or +/- infinity.
In other terms mpfr_cmp2 (b, c) returns EXP(b) - EXP(b-c).
*/
unsigned long
mpfr_cmp2 (mpfr_srcptr b, mpfr_srcptr c)
{
mp_limb_t *bp, *cp, bb, cc = 0, lastc = 0, dif, high_dif = 0;
long bn, cn, z;
unsigned long diff_exp, res = 0;
if (MPFR_IS_ZERO(c)) return 0;
bp = MPFR_MANT(b);
cp = MPFR_MANT(c);
bn = (MPFR_PREC(b) - 1) / BITS_PER_MP_LIMB;
cn = (MPFR_PREC(c) - 1) / BITS_PER_MP_LIMB;
diff_exp = MPFR_EXP(b) - MPFR_EXP(c);
if (diff_exp == 0) /* otherwise the shifted most significant limb of c
cannot match bp[bn] */
{
while (bn>=0 && cn>=0 && bp[bn] == cp[cn])
{
bn--;
cn--;
res += BITS_PER_MP_LIMB;
}
if (bn < 0) /* b = c */
return MPFR_PREC(b);
if (cn < 0) /* c discards exactly the upper part of b */
{
while (bn>=0 && bp[bn]==0)
{
bn--;
res += BITS_PER_MP_LIMB;
}
if (bn < 0) /* b = c */
return MPFR_PREC(b);
count_leading_zeros(z, bp[bn]); /* bp[bn] <> 0 */
return res + z;
}
}
/* now we have removed the identical upper limbs of b and c
(can happen only when diff_exp = 0): bp[bn] > cc, bn>=0, cn>=0 */
if (diff_exp < BITS_PER_MP_LIMB)
{
cc = cp[cn] >> diff_exp;
/* warning: a shift by BITS_PER_MP_LIMB may give wrong results */
if (diff_exp) lastc = cp[cn] << (BITS_PER_MP_LIMB - diff_exp);
cn--;
}
else
diff_exp -= BITS_PER_MP_LIMB;
dif = bp[bn--] - cc; /* necessarily dif >= 1 */
while ((cn>=0 || lastc) && (high_dif==0) && (dif==1))
{ /* dif=1 implies diff_exp = 0 or 1 */
bb = (bn >= 0) ? bp[bn] : 0;
cc = lastc;
if (cn >= 0)
{
cc += cp[cn] >> diff_exp;
if (diff_exp) lastc = cp[cn] << (BITS_PER_MP_LIMB - diff_exp);
}
else
lastc = 0;
high_dif = 1 - mpn_sub_n (&dif, &bb, &cc, 1);
bn--;
cn--;
res += BITS_PER_MP_LIMB;
}
/* (cn<0 and lastc=0) or (high_dif,dif)<>(0,1) */
if (high_dif) /* necessarily high_dif = 1 */
{
res--;
if (dif)
return res;
}
else /* high_dif = 0 */
{
count_leading_zeros(z, dif); /* dif > 1 here */
res += z;
if (dif != ((mp_limb_t) 1 << (BITS_PER_MP_LIMB - z - 1)))
return res; /* dif is not a power of two */
}
/* now result is res + (low(b) < low(c)) */
while (bn>=0 && (cn>=0 || lastc))
{
if (diff_exp >= BITS_PER_MP_LIMB)
diff_exp -= BITS_PER_MP_LIMB;
else
{
cc = lastc;
if (cn >= 0)
{
cc += cp[cn] >> diff_exp;
if (diff_exp) lastc = cp[cn] << (BITS_PER_MP_LIMB - diff_exp);
}
else
lastc = 0;
cn--;
}
if (bp[bn] != cc)
return res + (bp[bn] < cc);
bn--;
}
if (bn < 0)
{
if (lastc)
return res + 1;
while (cn>=0 && cp[cn]==0) cn--;
return res + (cn >= 0);
}
return res; /* remainder from c is 0 */
}
|
