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
|
/* mpz_congruent_2exp_p -- test congruence of mpz mod 2^n.
Copyright 2001, 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 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"
int
mpz_congruent_2exp_p (mpz_srcptr a, mpz_srcptr c, mp_bitcnt_t d) __GMP_NOTHROW
{
mp_size_t i, dlimbs;
unsigned dbits;
mp_ptr ap, cp;
mp_limb_t dmask, alimb, climb, sum;
mp_size_t asize_signed, csize_signed, asize, csize;
if (ABSIZ(a) < ABSIZ(c))
MPZ_SRCPTR_SWAP (a, c);
dlimbs = d / GMP_NUMB_BITS;
dbits = d % GMP_NUMB_BITS;
dmask = (CNST_LIMB(1) << dbits) - 1;
ap = PTR(a);
cp = PTR(c);
asize_signed = SIZ(a);
asize = ABS(asize_signed);
csize_signed = SIZ(c);
csize = ABS(csize_signed);
if (csize_signed == 0)
goto a_zeros;
if ((asize_signed ^ csize_signed) >= 0)
{
/* same signs, direct comparison */
/* a==c for limbs in common */
if (mpn_cmp (ap, cp, MIN (csize, dlimbs)) != 0)
return 0;
/* if that's all of dlimbs, then a==c for remaining bits */
if (csize > dlimbs)
return ((ap[dlimbs]-cp[dlimbs]) & dmask) == 0;
a_zeros:
/* a remains, need all zero bits */
/* if d covers all of a and c, then must be exactly equal */
if (asize <= dlimbs)
return asize == csize;
/* whole limbs zero */
for (i = csize; i < dlimbs; i++)
if (ap[i] != 0)
return 0;
/* partial limb zero */
return (ap[dlimbs] & dmask) == 0;
}
else
{
/* different signs, negated comparison */
/* common low zero limbs, stopping at first non-zeros, which must
match twos complement */
i = 0;
for (;;)
{
ASSERT (i < csize); /* always have a non-zero limb on c */
alimb = ap[i];
climb = cp[i];
sum = (alimb + climb) & GMP_NUMB_MASK;
if (i >= dlimbs)
return (sum & dmask) == 0;
i++;
/* require both zero, or first non-zeros as twos-complements */
if (sum != 0)
return 0;
if (alimb != 0)
break;
}
/* further limbs matching as ones-complement */
for (;;)
{
if (i >= csize)
break;
alimb = ap[i];
climb = cp[i];
sum = (alimb + climb + 1) & GMP_NUMB_MASK;
if (i >= dlimbs)
return (sum & dmask) == 0;
if (sum != 0)
return 0;
i++;
}
/* no more c, so require all 1 bits in a */
if (asize < dlimbs)
return 0; /* not enough a */
/* whole limbs */
for ( ; i < dlimbs; i++)
if (ap[i] != GMP_NUMB_MAX)
return 0;
/* if only whole limbs, no further fetches from a */
if (dbits == 0)
return 1;
/* need enough a */
if (asize == dlimbs)
return 0;
return ((ap[dlimbs]+1) & dmask) == 0;
}
}
|
