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
|
/* mpz_setbit -- set a specified bit.
Copyright 1991, 1993, 1994, 1995, 1997, 1999, 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 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., 51 Franklin Street, Fifth Floor, Boston,
MA 02110-1301, USA. */
#include "gmp.h"
#include "gmp-impl.h"
void
mpz_setbit (mpz_ptr d, unsigned long int bit_index)
{
mp_size_t dsize = d->_mp_size;
mp_ptr dp = d->_mp_d;
mp_size_t limb_index;
limb_index = bit_index / GMP_NUMB_BITS;
if (dsize >= 0)
{
if (limb_index < dsize)
{
dp[limb_index] |= (mp_limb_t) 1 << (bit_index % GMP_NUMB_BITS);
d->_mp_size = dsize;
}
else
{
/* Ugh. The bit should be set outside of the end of the
number. We have to increase the size of the number. */
if (UNLIKELY (d->_mp_alloc < limb_index + 1))
dp = _mpz_realloc (d, limb_index + 1);
MPN_ZERO (dp + dsize, limb_index - dsize);
dp[limb_index] = (mp_limb_t) 1 << (bit_index % GMP_NUMB_BITS);
d->_mp_size = limb_index + 1;
}
}
else
{
mp_size_t zero_bound;
/* Simulate two's complement arithmetic, i.e. simulate
1. Set OP = ~(OP - 1) [with infinitely many leading ones].
2. Set the bit.
3. Set OP = ~OP + 1. */
dsize = -dsize;
/* No upper bound on this loop, we're sure there's a non-zero limb
sooner ot later. */
for (zero_bound = 0; ; zero_bound++)
if (dp[zero_bound] != 0)
break;
if (limb_index > zero_bound)
{
if (limb_index < dsize)
{
mp_limb_t dlimb;
dlimb = dp[limb_index];
dlimb &= ~((mp_limb_t) 1 << (bit_index % GMP_NUMB_BITS));
dp[limb_index] = dlimb;
if (UNLIKELY (dlimb == 0 && limb_index == dsize-1))
{
/* high limb became zero, must normalize */
do {
dsize--;
} while (dsize > 0 && dp[dsize-1] == 0);
d->_mp_size = -dsize;
}
}
}
else if (limb_index == zero_bound)
{
dp[limb_index] = ((dp[limb_index] - 1)
& ~((mp_limb_t) 1 << (bit_index % GMP_NUMB_BITS))) + 1;
if (dp[limb_index] == 0)
{
mp_size_t i;
for (i = limb_index + 1; i < dsize; i++)
{
dp[i] += 1;
if (dp[i] != 0)
goto fin;
}
/* We got carry all way out beyond the end of D. Increase
its size (and allocation if necessary). */
dsize++;
if (UNLIKELY (d->_mp_alloc < dsize))
dp = _mpz_realloc (d, dsize);
dp[i] = 1;
d->_mp_size = -dsize;
fin:;
}
}
else
{
mpn_decr_u (dp + limb_index,
(mp_limb_t) 1 << (bit_index % GMP_NUMB_BITS));
dsize -= dp[dsize - 1] == 0;
d->_mp_size = -dsize;
}
}
}
|
