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
|
/* Compute remainder and a congruent to the quotient.
Copyright (C) 1997-2017 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Ulrich Drepper <drepper@cygnus.com>, 1997.
The GNU C 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 GNU C 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 GNU C Library; if not, see
<http://www.gnu.org/licenses/>. */
#include <math.h>
#include <math_private.h>
static const long double zero = 0.0;
long double
__remquol (long double x, long double p, int *quo)
{
int32_t ex,ep,hx,hp;
u_int32_t sx,lx,lp;
int cquo,qs;
GET_LDOUBLE_WORDS (ex, hx, lx, x);
GET_LDOUBLE_WORDS (ep, hp, lp, p);
sx = ex & 0x8000;
qs = (sx ^ (ep & 0x8000)) >> 15;
ep &= 0x7fff;
ex &= 0x7fff;
/* Purge off exception values. */
if ((ep | hp | lp) == 0)
return (x * p) / (x * p); /* p = 0 */
if ((ex == 0x7fff) /* x not finite */
|| ((ep == 0x7fff) /* p is NaN */
&& (((hp & 0x7fffffff) | lp) != 0)))
return (x * p) / (x * p);
if (ep <= 0x7ffb)
x = __ieee754_fmodl (x, 8 * p); /* now x < 8p */
if (((ex - ep) | (hx - hp) | (lx - lp)) == 0)
{
*quo = qs ? -1 : 1;
return zero * x;
}
x = fabsl (x);
p = fabsl (p);
cquo = 0;
if (ep <= 0x7ffc && x >= 4 * p)
{
x -= 4 * p;
cquo += 4;
}
if (ep <= 0x7ffd && x >= 2 * p)
{
x -= 2 * p;
cquo += 2;
}
if (ep < 0x0002)
{
if (x + x > p)
{
x -= p;
++cquo;
if (x + x >= p)
{
x -= p;
++cquo;
}
}
}
else
{
long double p_half = 0.5 * p;
if (x > p_half)
{
x -= p;
++cquo;
if (x >= p_half)
{
x -= p;
++cquo;
}
}
}
*quo = qs ? -cquo : cquo;
/* Ensure correct sign of zero result in round-downward mode. */
if (x == 0.0L)
x = 0.0L;
if (sx)
x = -x;
return x;
}
weak_alias (__remquol, remquol)
|
