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
162
163
164
165
166
|
/*
* M_APM - mapm_rcp.c
*
* Copyright (C) 2000 - 2003 Michael C. Ring
*
* Permission to use, copy, and distribute this software and its
* documentation for any purpose with or without fee is hereby granted,
* provided that the above copyright notice appear in all copies and
* that both that copyright notice and this permission notice appear
* in supporting documentation.
*
* Permission to modify the software is granted. Permission to distribute
* the modified code is granted. Modifications are to be distributed
* by using the file 'license.txt' as a template to modify the file header.
* 'license.txt' is available in the official MAPM distribution.
*
* This software is provided "as is" without express or implied warranty.
*
* THIS FILE HAS BEEN MODIFIED FROM THE OFFICIAL MAPM DISTRIBUTION BY
* 'XQilla project' on 2005/11/03.
* THIS FILE IS ORIGINALLY FROM MAPM VERSION 4.6.1.
*/
#include "m_apm_lc.h"
#include <math.h>
/****************************************************************************/
void m_apm_divide(M_APM rr, int places, M_APM aa, M_APM bb)
{
M_APM tmp0, tmp1;
int sn, nexp, dplaces;
sn = aa->m_apm_sign * bb->m_apm_sign;
if (sn == 0) /* one number is zero, result is zero */
{
if (bb->m_apm_sign == 0)
{
M_apm_log_error_msg(M_APM_RETURN,
"Warning! ... \'m_apm_divide\', Divide by 0");
}
M_set_to_zero(rr);
return;
}
/*
* Use the original 'Knuth' method for smaller divides. On the
* author's system, this was the *approx* break even point before
* the reciprocal method used below became faster.
*/
if (places < 250)
{
M_apm_sdivide(rr, places, aa, bb);
return;
}
/* mimic the decimal place behavior of the original divide */
nexp = aa->m_apm_exponent - bb->m_apm_exponent;
if (nexp > 0)
dplaces = nexp + places;
else
dplaces = places;
tmp0 = M_get_stack_var();
tmp1 = M_get_stack_var();
m_apm_reciprocal(tmp0, (dplaces + 8), bb);
m_apm_multiply(tmp1, tmp0, aa);
m_apm_round(rr, dplaces, tmp1);
M_restore_stack(2);
}
/****************************************************************************/
void m_apm_reciprocal(M_APM rr, int places, M_APM aa)
{
M_APM last_x, guess, tmpN, tmp1, tmp2;
int ii, bflag, dplaces, nexp, tolerance;
if (aa->m_apm_sign == 0)
{
M_apm_log_error_msg(M_APM_RETURN,
"Warning! ... \'m_apm_reciprocal\', Input = 0");
M_set_to_zero(rr);
return;
}
last_x = M_get_stack_var();
guess = M_get_stack_var();
tmpN = M_get_stack_var();
tmp1 = M_get_stack_var();
tmp2 = M_get_stack_var();
m_apm_absolute_value(tmpN, aa);
/*
normalize the input number (make the exponent 0) so
the 'guess' below will not over/under flow on large
magnitude exponents.
*/
nexp = aa->m_apm_exponent;
tmpN->m_apm_exponent -= nexp;
m_apm_set_double(guess, (1.0 / m_apm_get_double(tmpN)));
tolerance = places + 4;
dplaces = places + 16;
bflag = FALSE;
m_apm_negate(last_x, MM_Ten);
/* Use the following iteration to calculate the reciprocal :
X = X * [ 2 - N * X ]
n+1
*/
ii = 0;
while (TRUE)
{
m_apm_multiply(tmp1, tmpN, guess);
m_apm_subtract(tmp2, MM_Two, tmp1);
m_apm_multiply(tmp1, tmp2, guess);
if (bflag)
break;
m_apm_round(guess, dplaces, tmp1);
/* force at least 2 iterations so 'last_x' has valid data */
if (ii != 0)
{
m_apm_subtract(tmp2, guess, last_x);
if (tmp2->m_apm_sign == 0)
break;
/*
* if we are within a factor of 4 on the error term,
* we will be accurate enough after the *next* iteration
* is complete.
*/
if ((-4 * tmp2->m_apm_exponent) > tolerance)
bflag = TRUE;
}
m_apm_copy(last_x, guess);
ii++;
}
m_apm_round(rr, places, tmp1);
rr->m_apm_exponent -= nexp;
rr->m_apm_sign = aa->m_apm_sign;
M_restore_stack(5);
}
/****************************************************************************/
|
