glibc/stdlib/rshift.c

79 lines
2.0 KiB
C
Raw Normal View History

/* mpn_rshift -- Shift right a low-level natural-number integer.
1995-02-18 02:27:10 +01:00
Copyright (C) 1991-2018 Free Software Foundation, Inc.
1995-02-18 02:27:10 +01:00
This file is part of the GNU MP Library.
The GNU MP Library is free software; you can redistribute it and/or modify
2001-07-07 12:13:33 +02:00
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
1995-02-18 02:27:10 +01:00
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
2001-07-07 12:13:33 +02:00
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
1995-02-18 02:27:10 +01:00
License for more details.
2001-07-07 12:13:33 +02:00
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, see
<http://www.gnu.org/licenses/>. */
1995-02-18 02:27:10 +01:00
2005-12-14 16:06:39 +01:00
#include <gmp.h>
1995-02-18 02:27:10 +01:00
#include "gmp-impl.h"
#include <assert.h>
1995-02-18 02:27:10 +01:00
/* Shift U (pointed to by UP and USIZE limbs long) CNT bits to the right
and store the USIZE least significant limbs of the result at WP.
The bits shifted out to the right are returned.
Argument constraints:
1. 0 < CNT < BITS_PER_MP_LIMB
2. If the result is to be written over the input, WP must be <= UP.
*/
1996-05-07 23:04:52 +02:00
mp_limb_t
mpn_rshift (register mp_ptr wp,
1995-02-18 02:27:10 +01:00
register mp_srcptr up, mp_size_t usize,
register unsigned int cnt)
{
1996-05-07 23:04:52 +02:00
register mp_limb_t high_limb, low_limb;
1995-02-18 02:27:10 +01:00
register unsigned sh_1, sh_2;
register mp_size_t i;
1996-05-07 23:04:52 +02:00
mp_limb_t retval;
1995-02-18 02:27:10 +01:00
assert (usize != 0 && cnt != 0);
1995-02-18 02:27:10 +01:00
sh_1 = cnt;
#if 0
if (sh_1 == 0)
{
if (wp != up)
{
/* Copy from low end to high end, to allow specified input/output
overlapping. */
for (i = 0; i < usize; i++)
wp[i] = up[i];
}
return usize;
}
#endif
wp -= 1;
sh_2 = BITS_PER_MP_LIMB - sh_1;
high_limb = up[0];
retval = high_limb << sh_2;
low_limb = high_limb;
for (i = 1; i < usize; i++)
{
high_limb = up[i];
wp[i] = (low_limb >> sh_1) | (high_limb << sh_2);
low_limb = high_limb;
}
wp[i] = low_limb >> sh_1;
return retval;
}