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_eq -- Compare two floats up to a specified bit #.
Copied from mpf_eq.
Copyright (C) 1993, 1995, 1996 Free Software Foundation, Inc.
This file is part of the GNU MP Library.
The GNU MP 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 GNU MP 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 GNU MP 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 "mpfr.h"
#include "mpfr-impl.h"
int
#if __STDC__
mpfr_eq (mpfr_srcptr u, mpfr_srcptr v, unsigned long int n_bits)
#else
mpfr_eq (u, v, n_bits)
mpfr_srcptr u;
mpfr_srcptr v;
unsigned long int n_bits;
#endif
{
mp_srcptr up, vp;
mp_size_t usize, vsize, size, i;
mp_exp_t uexp, vexp;
int usign, k;
uexp = MPFR_EXP(u);
vexp = MPFR_EXP(v);
usize = (MPFR_PREC(u)-1)/BITS_PER_MP_LIMB + 1;
vsize = (MPFR_PREC(v)-1)/BITS_PER_MP_LIMB + 1;
usign = MPFR_SIGN(u);
/* 1. Are the signs different? */
if (usign == MPFR_SIGN(v))
{
/* U and V are both non-negative or both negative. */
if (!MPFR_NOTZERO(u))
return !MPFR_NOTZERO(v);
if (!MPFR_NOTZERO(v))
return !MPFR_NOTZERO(u);
/* Fall out. */
}
else
{
/* Either U or V is negative, but not both. */
if (MPFR_NOTZERO(u) || MPFR_NOTZERO(v))
return 0;
else return 1; /* particular case -0 = +0 */
}
/* U and V have the same sign and are both non-zero. */
if (MPFR_IS_INF(u))
return (MPFR_IS_INF(v) && (usign == MPFR_SIGN(v)));
else if (MPFR_IS_INF(v)) return 0;
if (MPFR_IS_NAN(u) || MPFR_IS_NAN(v)) return 0;
/* 2. Are the exponents different? */
if (uexp > vexp)
return 0; /* ??? handle (uexp = vexp + 1) */
if (vexp > uexp)
return 0; /* ??? handle (vexp = uexp + 1) */
usize = ABS (usize);
vsize = ABS (vsize);
up = MPFR_MANT(u);
vp = MPFR_MANT(v);
if (usize > vsize)
{
if (vsize * BITS_PER_MP_LIMB < n_bits)
{
k = usize - vsize - 1;
while (k >= 0 && !up[k]) --k;
if (k >= 0)
return 0; /* surely too different */
}
size = vsize;
}
else if (vsize > usize)
{
if (usize * BITS_PER_MP_LIMB < n_bits)
{
k = vsize - usize - 1;
while (k >= 0 && !vp[k]) --k;
if (k >= 0)
return 0; /* surely too different */
}
size = usize;
}
else
{
size = usize;
}
if (size > (n_bits + BITS_PER_MP_LIMB - 1) / BITS_PER_MP_LIMB)
size = (n_bits + BITS_PER_MP_LIMB - 1) / BITS_PER_MP_LIMB;
up += usize - size;
vp += vsize - size;
for (i = size - 1; i > 0; i--)
{
if (up[i] != vp[i])
return 0;
}
if (n_bits & (BITS_PER_MP_LIMB - 1))
return (up[i] >> (BITS_PER_MP_LIMB - (n_bits & (BITS_PER_MP_LIMB - 1))) ==
vp[i] >> (BITS_PER_MP_LIMB - (n_bits & (BITS_PER_MP_LIMB - 1))));
else
return (up[i] == vp[i]);
}
|
