version 1.1.1.2, 2000/09/09 14:12:24 |
version 1.1.1.3, 2003/08/25 16:06:20 |
|
|
/* mpn_addmul_1 -- multiply the S1_SIZE long limb vector pointed to by S1_PTR |
/* mpn_addmul_1 -- multiply the N long limb vector pointed to by UP by VL, |
by S2_LIMB, add the S1_SIZE least significant limbs of the product to the |
add the N least significant limbs of the product to the limb vector |
limb vector pointed to by RES_PTR. Return the most significant limb of |
pointed to by RP. Return the most significant limb of the product, |
the product, adjusted for carry-out from the addition. |
adjusted for carry-out from the addition. |
|
|
Copyright (C) 1992, 1993, 1994, 1996 Free Software Foundation, Inc. |
Copyright 1992, 1993, 1994, 1996, 2000, 2002 Free Software Foundation, Inc. |
|
|
This file is part of the GNU MP Library. |
This file is part of the GNU MP Library. |
|
|
Line 26 MA 02111-1307, USA. */ |
|
Line 26 MA 02111-1307, USA. */ |
|
#include "gmp-impl.h" |
#include "gmp-impl.h" |
#include "longlong.h" |
#include "longlong.h" |
|
|
|
|
|
#if GMP_NAIL_BITS == 0 |
|
|
mp_limb_t |
mp_limb_t |
mpn_addmul_1 (res_ptr, s1_ptr, s1_size, s2_limb) |
mpn_addmul_1 (mp_ptr rp, mp_srcptr up, mp_size_t n, mp_limb_t vl) |
register mp_ptr res_ptr; |
|
register mp_srcptr s1_ptr; |
|
mp_size_t s1_size; |
|
register mp_limb_t s2_limb; |
|
{ |
{ |
register mp_limb_t cy_limb; |
mp_limb_t ul, cl, hpl, lpl, rl; |
register mp_size_t j; |
|
register mp_limb_t prod_high, prod_low; |
|
register mp_limb_t x; |
|
|
|
/* The loop counter and index J goes from -SIZE to -1. This way |
ASSERT (n >= 1); |
the loop becomes faster. */ |
ASSERT (MPN_SAME_OR_SEPARATE_P (rp, up, n)); |
j = -s1_size; |
|
|
|
/* Offset the base pointers to compensate for the negative indices. */ |
cl = 0; |
res_ptr -= j; |
|
s1_ptr -= j; |
|
|
|
cy_limb = 0; |
|
do |
do |
{ |
{ |
umul_ppmm (prod_high, prod_low, s1_ptr[j], s2_limb); |
ul = *up++; |
|
umul_ppmm (hpl, lpl, ul, vl); |
|
|
prod_low += cy_limb; |
lpl += cl; |
cy_limb = (prod_low < cy_limb) + prod_high; |
cl = (lpl < cl) + hpl; |
|
|
x = res_ptr[j]; |
rl = *rp; |
prod_low = x + prod_low; |
lpl = rl + lpl; |
cy_limb += (prod_low < x); |
cl += lpl < rl; |
res_ptr[j] = prod_low; |
*rp++ = lpl; |
} |
} |
while (++j != 0); |
while (--n != 0); |
|
|
return cy_limb; |
return cl; |
} |
} |
|
|
|
#endif |
|
|
|
#if GMP_NAIL_BITS == 1 |
|
you lose |
|
#endif |
|
|
|
#if GMP_NAIL_BITS >= 2 |
|
|
|
mp_limb_t |
|
mpn_addmul_1 (mp_ptr rp, mp_srcptr up, mp_size_t n, mp_limb_t vl) |
|
{ |
|
mp_limb_t shifted_vl, ul, rl, lpl, hpl, prev_hpl, xw, cl, xl; |
|
|
|
ASSERT (n >= 1); |
|
ASSERT (MPN_SAME_OR_SEPARATE_P (rp, up, n)); |
|
ASSERT_MPN (rp, n); |
|
ASSERT_MPN (up, n); |
|
ASSERT_LIMB (vl); |
|
|
|
shifted_vl = vl << GMP_NAIL_BITS; |
|
cl = 0; |
|
prev_hpl = 0; |
|
do |
|
{ |
|
ul = *up++; |
|
rl = *rp; |
|
umul_ppmm (hpl, lpl, ul, shifted_vl); |
|
lpl >>= GMP_NAIL_BITS; |
|
xw = prev_hpl + lpl + rl + cl; |
|
cl = xw >> GMP_NUMB_BITS; |
|
xl = xw & GMP_NUMB_MASK; |
|
*rp++ = xl; |
|
prev_hpl = hpl; |
|
} |
|
while (--n != 0); |
|
|
|
return prev_hpl + cl; |
|
} |
|
|
|
#endif |