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
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
|
/* mpn_mu_bdiv_q(qp,np,nn,dp,dn,tp) -- Compute {np,nn} / {dp,dn} mod B^nn.
storing the result in {qp,nn}. Overlap allowed between Q and N; all other
overlap disallowed.
Contributed to the GNU project by Torbjorn Granlund.
THE FUNCTIONS IN THIS FILE ARE INTERNAL WITH MUTABLE INTERFACES. IT IS ONLY
SAFE TO REACH THEM THROUGH DOCUMENTED INTERFACES. IN FACT, IT IS ALMOST
GUARANTEED THAT THEY WILL CHANGE OR DISAPPEAR IN A FUTURE GMP RELEASE.
Copyright 2005, 2006, 2007, 2009, 2010 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 Lesser General Public License as published by
the Free Software Foundation; either version 3 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 Lesser General Public
License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the GNU MP Library. If not, see http://www.gnu.org/licenses/. */
/*
The idea of the algorithm used herein is to compute a smaller inverted value
than used in the standard Barrett algorithm, and thus save time in the
Newton iterations, and pay just a small price when using the inverted value
for developing quotient bits. This algorithm was presented at ICMS 2006.
*/
#include "gmp.h"
#include "gmp-impl.h"
/* N = {np,nn}
D = {dp,dn}
Requirements: N >= D
D >= 1
D odd
dn >= 2
nn >= 2
scratch space as determined by mpn_mu_bdiv_q_itch(nn,dn).
Write quotient to Q = {qp,nn}.
FIXME: When iterating, perhaps do the small step before loop, not after.
FIXME: Try to avoid the scalar divisions when computing inverse size.
FIXME: Trim allocation for (qn > dn) case, 3*dn might be possible. In
particular, when dn==in, tp and rp could use the same space.
FIXME: Trim final quotient calculation to qn limbs of precision.
*/
void
mpn_mu_bdiv_q (mp_ptr qp,
mp_srcptr np, mp_size_t nn,
mp_srcptr dp, mp_size_t dn,
mp_ptr scratch)
{
mp_size_t qn;
mp_size_t in;
int cy, c0;
mp_size_t tn, wn;
qn = nn;
ASSERT (dn >= 2);
ASSERT (qn >= 2);
if (qn > dn)
{
mp_size_t b;
/* |_______________________| dividend
|________| divisor */
#define ip scratch /* in */
#define rp (scratch + in) /* dn or rest >= binvert_itch(in) */
#define tp (scratch + in + dn) /* dn+in or next_size(dn) */
#define scratch_out (scratch + in + dn + tn) /* mulmod_bnm1_itch(next_size(dn)) */
/* Compute an inverse size that is a nice partition of the quotient. */
b = (qn - 1) / dn + 1; /* ceil(qn/dn), number of blocks */
in = (qn - 1) / b + 1; /* ceil(qn/b) = ceil(qn / ceil(qn/dn)) */
/* Some notes on allocation:
When in = dn, R dies when mpn_mullo returns, if in < dn the low in
limbs of R dies at that point. We could save memory by letting T live
just under R, and let the upper part of T expand into R. These changes
should reduce itch to perhaps 3dn.
*/
mpn_binvert (ip, dp, in, rp);
cy = 0;
MPN_COPY (rp, np, dn);
np += dn;
mpn_mullo_n (qp, rp, ip, in);
qn -= in;
while (qn > in)
{
if (BELOW_THRESHOLD (in, MUL_TO_MULMOD_BNM1_FOR_2NXN_THRESHOLD))
mpn_mul (tp, dp, dn, qp, in); /* mulhi, need tp[dn+in-1...in] */
else
{
tn = mpn_mulmod_bnm1_next_size (dn);
mpn_mulmod_bnm1 (tp, tn, dp, dn, qp, in, scratch_out);
wn = dn + in - tn; /* number of wrapped limbs */
if (wn > 0)
{
c0 = mpn_sub_n (tp + tn, tp, rp, wn);
mpn_decr_u (tp + wn, c0);
}
}
qp += in;
if (dn != in)
{
/* Subtract tp[dn-1...in] from partial remainder. */
cy += mpn_sub_n (rp, rp + in, tp + in, dn - in);
if (cy == 2)
{
mpn_incr_u (tp + dn, 1);
cy = 1;
}
}
/* Subtract tp[dn+in-1...dn] from dividend. */
cy = mpn_sub_nc (rp + dn - in, np, tp + dn, in, cy);
np += in;
mpn_mullo_n (qp, rp, ip, in);
qn -= in;
}
/* Generate last qn limbs.
FIXME: It should be possible to limit precision here, since qn is
typically somewhat smaller than dn. No big gains expected. */
if (BELOW_THRESHOLD (in, MUL_TO_MULMOD_BNM1_FOR_2NXN_THRESHOLD))
mpn_mul (tp, dp, dn, qp, in); /* mulhi, need tp[qn+in-1...in] */
else
{
tn = mpn_mulmod_bnm1_next_size (dn);
mpn_mulmod_bnm1 (tp, tn, dp, dn, qp, in, scratch_out);
wn = dn + in - tn; /* number of wrapped limbs */
if (wn > 0)
{
c0 = mpn_sub_n (tp + tn, tp, rp, wn);
mpn_decr_u (tp + wn, c0);
}
}
qp += in;
if (dn != in)
{
cy += mpn_sub_n (rp, rp + in, tp + in, dn - in);
if (cy == 2)
{
mpn_incr_u (tp + dn, 1);
cy = 1;
}
}
mpn_sub_nc (rp + dn - in, np, tp + dn, qn - (dn - in), cy);
mpn_mullo_n (qp, rp, ip, qn);
#undef ip
#undef rp
#undef tp
#undef scratch_out
}
else
{
/* |_______________________| dividend
|________________| divisor */
#define ip scratch /* in */
#define tp (scratch + in) /* qn+in or next_size(qn) or rest >= binvert_itch(in) */
#define scratch_out (scratch + in + tn)/* mulmod_bnm1_itch(next_size(qn)) */
/* Compute half-sized inverse. */
in = qn - (qn >> 1);
mpn_binvert (ip, dp, in, tp);
mpn_mullo_n (qp, np, ip, in); /* low `in' quotient limbs */
if (BELOW_THRESHOLD (in, MUL_TO_MULMOD_BNM1_FOR_2NXN_THRESHOLD))
mpn_mul (tp, dp, qn, qp, in); /* mulhigh */
else
{
tn = mpn_mulmod_bnm1_next_size (qn);
mpn_mulmod_bnm1 (tp, tn, dp, qn, qp, in, scratch_out);
wn = qn + in - tn; /* number of wrapped limbs */
if (wn > 0)
{
c0 = mpn_cmp (tp, np, wn) < 0;
mpn_decr_u (tp + wn, c0);
}
}
mpn_sub_n (tp, np + in, tp + in, qn - in);
mpn_mullo_n (qp + in, tp, ip, qn - in); /* high qn-in quotient limbs */
#undef ip
#undef tp
#undef scratch_out
}
}
mp_size_t
mpn_mu_bdiv_q_itch (mp_size_t nn, mp_size_t dn)
{
mp_size_t qn, in, tn, itch_binvert, itch_out, itches;
mp_size_t b;
qn = nn;
if (qn > dn)
{
b = (qn - 1) / dn + 1; /* ceil(qn/dn), number of blocks */
in = (qn - 1) / b + 1; /* ceil(qn/b) = ceil(qn / ceil(qn/dn)) */
if (BELOW_THRESHOLD (in, MUL_TO_MULMOD_BNM1_FOR_2NXN_THRESHOLD))
{
tn = dn + in;
itch_out = 0;
}
else
{
tn = mpn_mulmod_bnm1_next_size (dn);
itch_out = mpn_mulmod_bnm1_itch (tn, dn, in);
}
itch_binvert = mpn_binvert_itch (in);
itches = dn + tn + itch_out;
return in + MAX (itches, itch_binvert);
}
else
{
in = qn - (qn >> 1);
if (BELOW_THRESHOLD (in, MUL_TO_MULMOD_BNM1_FOR_2NXN_THRESHOLD))
{
tn = qn + in;
itch_out = 0;
}
else
{
tn = mpn_mulmod_bnm1_next_size (qn);
itch_out = mpn_mulmod_bnm1_itch (tn, qn, in);
}
itch_binvert = mpn_binvert_itch (in);
itches = tn + itch_out;
return in + MAX (itches, itch_binvert);
}
}
|
