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
|
/* hgcd.c.
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'LL CHANGE OR DISAPPEAR IN A FUTURE GNU MP RELEASE.
Copyright 2003, 2004, 2005, 2008, 2011 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/. */
#include "gmp.h"
#include "gmp-impl.h"
#include "longlong.h"
/* Size analysis for hgcd:
For the recursive calls, we have n1 <= ceil(n / 2). Then the
storage need is determined by the storage for the recursive call
computing M1, and hgcd_matrix_adjust and hgcd_matrix_mul calls that use M1
(after this, the storage needed for M1 can be recycled).
Let S(r) denote the required storage. For M1 we need 4 * (ceil(n1/2) + 1)
= 4 * (ceil(n/4) + 1), for the hgcd_matrix_adjust call, we need n + 2,
and for the hgcd_matrix_mul, we may need 3 ceil(n/2) + 8. In total,
4 * ceil(n/4) + 3 ceil(n/2) + 12 <= 10 ceil(n/4) + 12.
For the recursive call, we need S(n1) = S(ceil(n/2)).
S(n) <= 10*ceil(n/4) + 12 + S(ceil(n/2))
<= 10*(ceil(n/4) + ... + ceil(n/2^(1+k))) + 12k + S(ceil(n/2^k))
<= 10*(2 ceil(n/4) + k) + 12k + S(ceil(n/2^k))
<= 20 ceil(n/4) + 22k + S(ceil(n/2^k))
*/
mp_size_t
mpn_hgcd_itch (mp_size_t n)
{
unsigned k;
int count;
mp_size_t nscaled;
if (BELOW_THRESHOLD (n, HGCD_THRESHOLD))
return n;
/* Get the recursion depth. */
nscaled = (n - 1) / (HGCD_THRESHOLD - 1);
count_leading_zeros (count, nscaled);
k = GMP_LIMB_BITS - count;
return 20 * ((n+3) / 4) + 22 * k + HGCD_THRESHOLD;
}
/* Reduces a,b until |a-b| fits in n/2 + 1 limbs. Constructs matrix M
with elements of size at most (n+1)/2 - 1. Returns new size of a,
b, or zero if no reduction is possible. */
mp_size_t
mpn_hgcd (mp_ptr ap, mp_ptr bp, mp_size_t n,
struct hgcd_matrix *M, mp_ptr tp)
{
mp_size_t s = n/2 + 1;
mp_size_t nn;
int success = 0;
if (n <= s)
/* Happens when n <= 2, a fairly uninteresting case but exercised
by the random inputs of the testsuite. */
return 0;
ASSERT ((ap[n-1] | bp[n-1]) > 0);
ASSERT ((n+1)/2 - 1 < M->alloc);
if (ABOVE_THRESHOLD (n, HGCD_THRESHOLD))
{
mp_size_t n2 = (3*n)/4 + 1;
mp_size_t p = n/2;
nn = mpn_hgcd (ap + p, bp + p, n - p, M, tp);
if (nn > 0)
{
/* Needs 2*(p + M->n) <= 2*(floor(n/2) + ceil(n/2) - 1)
= 2 (n - 1) */
n = mpn_hgcd_matrix_adjust (M, p + nn, ap, bp, p, tp);
success = 1;
}
/* NOTE: It apppears this loop never runs more than once. */
while (n > n2)
{
/* Needs n + 1 storage */
nn = mpn_hgcd_step (n, ap, bp, s, M, tp);
if (!nn)
return success ? n : 0;
n = nn;
success = 1;
}
if (n > s + 2)
{
struct hgcd_matrix M1;
mp_size_t scratch;
p = 2*s - n + 1;
scratch = MPN_HGCD_MATRIX_INIT_ITCH (n-p);
mpn_hgcd_matrix_init(&M1, n - p, tp);
nn = mpn_hgcd (ap + p, bp + p, n - p, &M1, tp + scratch);
if (nn > 0)
{
/* We always have max(M) > 2^{-(GMP_NUMB_BITS + 1)} max(M1) */
ASSERT (M->n + 2 >= M1.n);
/* Furthermore, assume M ends with a quotient (1, q; 0, 1),
then either q or q + 1 is a correct quotient, and M1 will
start with either (1, 0; 1, 1) or (2, 1; 1, 1). This
rules out the case that the size of M * M1 is much
smaller than the expected M->n + M1->n. */
ASSERT (M->n + M1.n < M->alloc);
/* Needs 2 (p + M->n) <= 2 (2*s - n2 + 1 + n2 - s - 1)
= 2*s <= 2*(floor(n/2) + 1) <= n + 2. */
n = mpn_hgcd_matrix_adjust (&M1, p + nn, ap, bp, p, tp + scratch);
/* We need a bound for of M->n + M1.n. Let n be the original
input size. Then
ceil(n/2) - 1 >= size of product >= M.n + M1.n - 2
and it follows that
M.n + M1.n <= ceil(n/2) + 1
Then 3*(M.n + M1.n) + 5 <= 3 * ceil(n/2) + 8 is the
amount of needed scratch space. */
mpn_hgcd_matrix_mul (M, &M1, tp + scratch);
success = 1;
}
}
}
for (;;)
{
/* Needs s+3 < n */
nn = mpn_hgcd_step (n, ap, bp, s, M, tp);
if (!nn)
return success ? n : 0;
n = nn;
success = 1;
}
}
|
