[BACK]Return to mul_1.c CVS log [TXT][DIR] Up to [local] / OpenXM_contrib / gmp / mpn / generic

Diff for /OpenXM_contrib/gmp/mpn/generic/Attic/mul_1.c between version 1.1 and 1.1.1.3

version 1.1, 2000/01/10 15:35:23 version 1.1.1.3, 2003/08/25 16:06:20
Line 1 
Line 1 
 /* mpn_mul_1 -- Multiply a limb vector with a single limb and  /* mpn_mul_1 -- Multiply a limb vector with a single limb and store the
    store the product in a second limb vector.     product in a second limb vector.
   
 Copyright (C) 1991, 1992, 1993, 1994, 1996 Free Software Foundation, Inc.  Copyright 1991, 1992, 1993, 1994, 1996, 2000, 2001, 2002 Free Software
   Foundation, Inc.
   
 This file is part of the GNU MP Library.  This file is part of the GNU MP Library.
   
 The GNU MP Library is free software; you can redistribute it and/or modify  The GNU MP Library is free software; you can redistribute it and/or modify
 it under the terms of the GNU Library General Public License as published by  it under the terms of the GNU Lesser General Public License as published by
 the Free Software Foundation; either version 2 of the License, or (at your  the Free Software Foundation; either version 2.1 of the License, or (at your
 option) any later version.  option) any later version.
   
 The GNU MP Library is distributed in the hope that it will be useful, but  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  WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
 or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Library General Public  or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public
 License for more details.  License for more details.
   
 You should have received a copy of the GNU Library General Public License  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  along with the GNU MP Library; see the file COPYING.LIB.  If not, write to
 the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,  the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
 MA 02111-1307, USA. */  MA 02111-1307, USA. */
Line 24  MA 02111-1307, USA. */
Line 25  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_mul_1 (res_ptr, s1_ptr, s1_size, s2_limb)  mpn_mul_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;
   register mp_size_t j;  
   register mp_limb_t prod_high, prod_low;  
   
   /* The loop counter and index J goes from -S1_SIZE to -1.  This way    ASSERT (n >= 1);
      the loop becomes faster.  */    ASSERT (MPN_SAME_OR_INCR_P (rp, up, n));
   j = -s1_size;  
   
   /* Offset the base pointers to compensate for the negative indices.  */    cl = 0;
   s1_ptr -= j;  
   res_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;
   
       res_ptr[j] = prod_low;        *rp++ = lpl;
     }      }
   while (++j != 0);    while (--n != 0);
   
   return cy_limb;    return cl;
 }  }
   
   #endif
   
   #if GMP_NAIL_BITS >= 1
   
   mp_limb_t
   mpn_mul_1 (mp_ptr rp, mp_srcptr up, mp_size_t n, mp_limb_t vl)
   {
     mp_limb_t shifted_vl, ul, lpl, hpl, prev_hpl, xw, cl, xl;
   
     ASSERT (n >= 1);
     ASSERT (MPN_SAME_OR_INCR_P (rp, up, n));
     ASSERT_MPN (up, n);
     ASSERT_LIMB (vl);
   
     shifted_vl = vl << GMP_NAIL_BITS;
     cl = 0;
     prev_hpl = 0;
     do
       {
         ul = *up++;
   
         umul_ppmm (hpl, lpl, ul, shifted_vl);
         lpl >>= GMP_NAIL_BITS;
         xw = prev_hpl + lpl + cl;
         cl = xw >> GMP_NUMB_BITS;
         xl = xw & GMP_NUMB_MASK;
         *rp++ = xl;
         prev_hpl = hpl;
       }
     while (--n != 0);
   
     return prev_hpl + cl;
   }
   
   #endif

Legend:
Removed from v.1.1  
changed lines
  Added in v.1.1.1.3

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>