1
/* mpz_scan1 -- search for a 1 bit.
3
Copyright 2000, 2001 Free Software Foundation, Inc.
5
This file is part of the GNU MP Library.
7
The GNU MP Library is free software; you can redistribute it and/or modify
8
it under the terms of the GNU Lesser General Public License as published by
9
the Free Software Foundation; either version 2.1 of the License, or (at your
10
option) any later version.
12
The GNU MP Library is distributed in the hope that it will be useful, but
13
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
14
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
15
License for more details.
17
You should have received a copy of the GNU Lesser General Public License
18
along with the GNU MP Library; see the file COPYING.LIB. If not, write to
19
the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
20
MA 02111-1307, USA. */
27
/* mpn_scan0 can't be used for the inverted u<0 search since there might not
28
be a 0 bit before the end of the data. mpn_scan1 could be used under u>0
29
(except when in the high limb), but usually the search won't go very far
30
so it seems reasonable to inline that code. */
33
mpz_scan1 (mpz_srcptr u, unsigned long starting_bit)
35
mp_srcptr u_ptr = PTR(u);
37
unsigned abs_size = ABS(size);
38
mp_srcptr u_end = u_ptr + abs_size;
39
unsigned long starting_limb = starting_bit / BITS_PER_MP_LIMB;
40
mp_srcptr p = u_ptr + starting_limb;
44
/* Past the end there's no 1 bits for u>=0, or an immediate 1 bit for u<0.
45
Notice this test picks up any u==0 too. */
46
if (starting_limb >= abs_size)
47
return (size >= 0 ? ULONG_MAX : starting_bit);
53
/* Mask to 0 all bits before starting_bit, thus ignoring them. */
54
limb &= (MP_LIMB_T_MAX << (starting_bit % BITS_PER_MP_LIMB));
58
/* If it's the high limb which is zero after masking, then there's
59
no 1 bits after starting_bit. */
64
/* Otherwise search further for a non-zero limb. The high limb is
65
non-zero, if nothing else. */
80
/* If there's a non-zero limb before ours then we're in the ones
81
complement region. Search from *(p-1) downwards since that might
82
give better cache locality, and since a non-zero in the middle of a
83
number is perhaps a touch more likely than at the end. */
94
/* Skip zero limbs, to find the start of twos complement. The
95
high limb is non-zero, if nothing else. This search is
96
necessary so the -limb is applied at the right spot. */
105
/* Apply twos complement, and look for a 1 bit in that. Since
106
limb!=0 here, also have (-limb)!=0 so there's certainly a 1
112
/* Adjust so ~limb implied by searching for 0 bit becomes -limb. */
116
/* Now seeking a 0 bit. */
118
/* Mask to 1 all bits before starting_bit, thus ignoring them. */
119
limb |= (CNST_LIMB(1) << (starting_bit % BITS_PER_MP_LIMB)) - 1;
121
/* Search for a limb which is not all ones. If the end is reached
122
then the zero immediately past the end is the result. */
123
while (limb == MP_LIMB_T_MAX)
127
return abs_size * BITS_PER_MP_LIMB;
131
/* Now seeking low 1 bit. */
136
/* Mask to 0 all bits above the lowest 1 bit. */
140
count_leading_zeros (cnt, limb);
141
return (p - u_ptr) * BITS_PER_MP_LIMB + BITS_PER_MP_LIMB-1 - cnt;