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
|
/* mpn_mod_1(dividend_ptr, dividend_size, divisor_limb) --
Divide (DIVIDEND_PTR,,DIVIDEND_SIZE) by DIVISOR_LIMB.
Return the single-limb remainder.
There are no constraints on the value of the divisor.
Copyright 1991, 1993, 1994, 1999, 2000, 2002 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 2.1 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; 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 "gmp.h"
#include "gmp-impl.h"
#include "longlong.h"
/* The size where udiv_qrnnd_preinv should be used rather than udiv_qrnnd,
meaning the quotient size where that should happen, the quotient size
being how many udiv divisions will be done.
The default is to use preinv always, CPUs where this doesn't suit have
tuned thresholds. Note in particular that preinv should certainly be
used if that's the only division available (USE_PREINV_ALWAYS). */
#ifndef MOD_1_NORM_THRESHOLD
#define MOD_1_NORM_THRESHOLD 0
#endif
#ifndef MOD_1_UNNORM_THRESHOLD
#define MOD_1_UNNORM_THRESHOLD 0
#endif
/* The comments in mpn/generic/divrem_1.c apply here too.
As noted in the algorithms section of the manual, the shifts in the loop
for the unnorm case can be avoided by calculating r = a%(d*2^n), followed
by a final (r*2^n)%(d*2^n). In fact if it happens that a%(d*2^n) can
skip a division where (a*2^n)%(d*2^n) can't then there's the same number
of divide steps, though how often that happens depends on the assumed
distributions of dividend and divisor. In any case this idea is left to
CPU specific implementations to consider. */
mp_limb_t
mpn_mod_1 (mp_srcptr up, mp_size_t un, mp_limb_t d)
{
mp_size_t i;
mp_limb_t n1, n0, r;
mp_limb_t dummy;
ASSERT (un >= 0);
ASSERT (d != 0);
/* Botch: Should this be handled at all? Rely on callers?
But note un==0 is currently required by mpz/fdiv_r_ui.c and possibly
other places. */
if (un == 0)
return 0;
d <<= GMP_NAIL_BITS;
if ((d & MP_LIMB_T_HIGHBIT) != 0)
{
/* High limb is initial remainder, possibly with one subtract of
d to get r<d. */
r = up[un - 1] << GMP_NAIL_BITS;
if (r >= d)
r -= d;
r >>= GMP_NAIL_BITS;
un--;
if (un == 0)
return r;
if (BELOW_THRESHOLD (un, MOD_1_NORM_THRESHOLD))
{
plain:
for (i = un - 1; i >= 0; i--)
{
n0 = up[i] << GMP_NAIL_BITS;
udiv_qrnnd (dummy, r, r, n0, d);
r >>= GMP_NAIL_BITS;
}
return r;
}
else
{
mp_limb_t inv;
invert_limb (inv, d);
for (i = un - 1; i >= 0; i--)
{
n0 = up[i] << GMP_NAIL_BITS;
udiv_qrnnd_preinv (dummy, r, r, n0, d, inv);
r >>= GMP_NAIL_BITS;
}
return r;
}
}
else
{
int norm;
/* Skip a division if high < divisor. Having the test here before
normalizing will still skip as often as possible. */
r = up[un - 1] << GMP_NAIL_BITS;
if (r < d)
{
r >>= GMP_NAIL_BITS;
un--;
if (un == 0)
return r;
}
else
r = 0;
/* If udiv_qrnnd doesn't need a normalized divisor, can use the simple
code above. */
if (! UDIV_NEEDS_NORMALIZATION
&& BELOW_THRESHOLD (un, MOD_1_UNNORM_THRESHOLD))
goto plain;
count_leading_zeros (norm, d);
d <<= norm;
n1 = up[un - 1] << GMP_NAIL_BITS;
r = (r << norm) | (n1 >> (GMP_LIMB_BITS - norm));
if (UDIV_NEEDS_NORMALIZATION
&& BELOW_THRESHOLD (un, MOD_1_UNNORM_THRESHOLD))
{
for (i = un - 2; i >= 0; i--)
{
n0 = up[i] << GMP_NAIL_BITS;
udiv_qrnnd (dummy, r, r,
(n1 << norm) | (n0 >> (GMP_NUMB_BITS - norm)),
d);
r >>= GMP_NAIL_BITS;
n1 = n0;
}
udiv_qrnnd (dummy, r, r, n1 << norm, d);
r >>= GMP_NAIL_BITS;
return r >> norm;
}
else
{
mp_limb_t inv;
invert_limb (inv, d);
for (i = un - 2; i >= 0; i--)
{
n0 = up[i] << GMP_NAIL_BITS;
udiv_qrnnd_preinv (dummy, r, r,
(n1 << norm) | (n0 >> (GMP_NUMB_BITS - norm)),
d, inv);
r >>= GMP_NAIL_BITS;
n1 = n0;
}
udiv_qrnnd_preinv (dummy, r, r, n1 << norm, d, inv);
r >>= GMP_NAIL_BITS;
return r >> norm;
}
}
}
|
