Code coverage tests

This page documents the degree to which the PARI/GP source code is tested by our public test suite, distributed with the source distribution in directory src/test/. This is measured by the gcov utility; we then process gcov output using the lcov frond-end.

We test a few variants depending on Configure flags on the pari.math.u-bordeaux.fr machine (x86_64 architecture), and agregate them in the final report:

The target is to exceed 90% coverage for all mathematical modules (given that branches depending on DEBUGLEVEL or DEBUGMEM are not covered). This script is run to produce the results below.

LCOV - code coverage report
Current view: top level - kernel/gmp - mp.c (source / functions) Hit Total Coverage
Test: PARI/GP v2.14.0 lcov report (development 27775-aca467eab2) Lines: 657 719 91.4 %
Date: 2022-07-03 07:33:15 Functions: 55 56 98.2 %
Legend: Lines: hit not hit

          Line data    Source code
       1             : #line 2 "../src/kernel/gmp/mp.c"
       2             : /* Copyright (C) 2002-2003  The PARI group.
       3             : 
       4             : This file is part of the PARI/GP package.
       5             : 
       6             : PARI/GP is free software; you can redistribute it and/or modify it under the
       7             : terms of the GNU General Public License as published by the Free Software
       8             : Foundation; either version 2 of the License, or (at your option) any later
       9             : version. It is distributed in the hope that it will be useful, but WITHOUT
      10             : ANY WARRANTY WHATSOEVER.
      11             : 
      12             : Check the License for details. You should have received a copy of it, along
      13             : with the package; see the file 'COPYING'. If not, write to the Free Software
      14             : Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. */
      15             : 
      16             : /***********************************************************************/
      17             : /**                                                                   **/
      18             : /**                               GMP KERNEL                          **/
      19             : /** BA2002Sep24                                                       **/
      20             : /***********************************************************************/
      21             : /* GMP t_INT as just like normal t_INT, just the mantissa is the other way
      22             :  * round
      23             :  *
      24             :  *   `How would you like to live in Looking-glass House, Kitty?  I
      25             :  *   wonder if they'd give you milk in there?  Perhaps Looking-glass
      26             :  *   milk isn't good to drink--But oh, Kitty! now we come to the
      27             :  *   passage.  You can just see a little PEEP of the passage in
      28             :  *   Looking-glass House, if you leave the door of our drawing-room
      29             :  *   wide open:  and it's very like our passage as far as you can see,
      30             :  *   only you know it may be quite different on beyond.  Oh, Kitty!
      31             :  *   how nice it would be if we could only get through into Looking-
      32             :  *   glass House!  I'm sure it's got, oh! such beautiful things in it!
      33             :  *
      34             :  *  Through the Looking Glass,  Lewis Carrol
      35             :  *
      36             :  *  (pityful attempt to beat GN code/comments rate)
      37             :  *  */
      38             : 
      39             : #include <gmp.h>
      40             : #include "pari.h"
      41             : #include "paripriv.h"
      42             : #include "../src/kernel/none/tune-gen.h"
      43             : 
      44             : /*We need PARI invmod renamed to invmod_pari*/
      45             : #define INVMOD_PARI
      46             : 
      47           0 : static void *pari_gmp_realloc(void *ptr, size_t old_size, size_t new_size) {
      48           0 :   (void)old_size; return (void *) pari_realloc(ptr,new_size);
      49             : }
      50             : 
      51     1510721 : static void pari_gmp_free(void *ptr, size_t old_size){
      52     1510721 :   (void)old_size; pari_free(ptr);
      53     1510721 : }
      54             : 
      55             : static void *(*old_gmp_malloc)(size_t new_size);
      56             : static void *(*old_gmp_realloc)(void *ptr, size_t old_size, size_t new_size);
      57             : static void (*old_gmp_free)(void *ptr, size_t old_size);
      58             : 
      59             : void
      60        1056 : pari_kernel_init(void)
      61             : {
      62        1056 :   mp_get_memory_functions (&old_gmp_malloc, &old_gmp_realloc, &old_gmp_free);
      63        1056 :   mp_set_memory_functions((void *(*)(size_t)) pari_malloc, pari_gmp_realloc, pari_gmp_free);
      64        1056 : }
      65             : 
      66             : const char *
      67           4 : pari_kernel_version(void)
      68             : {
      69             : #ifdef gmp_version
      70           4 :   return gmp_version;
      71             : #else
      72             :   return "";
      73             : #endif
      74             : }
      75             : 
      76             : void
      77        1048 : pari_kernel_close(void)
      78             : {
      79             :   void *(*new_gmp_malloc)(size_t new_size);
      80             :   void *(*new_gmp_realloc)(void *ptr, size_t old_size, size_t new_size);
      81             :   void (*new_gmp_free)(void *ptr, size_t old_size);
      82        1048 :   mp_get_memory_functions (&new_gmp_malloc, &new_gmp_realloc, &new_gmp_free);
      83        1048 :   if (new_gmp_malloc==pari_malloc) new_gmp_malloc = old_gmp_malloc;
      84        1048 :   if (new_gmp_realloc==pari_gmp_realloc) new_gmp_realloc = old_gmp_realloc;
      85        1048 :   if (new_gmp_free==pari_gmp_free) new_gmp_free = old_gmp_free;
      86        1048 :   mp_set_memory_functions(new_gmp_malloc, new_gmp_realloc, new_gmp_free);
      87        1048 : }
      88             : 
      89             : #define LIMBS(x)  ((mp_limb_t *)((x)+2))
      90             : #define NLIMBS(x) (lgefint(x)-2)
      91             : /*This one is for t_REALs to emphasize they are not t_INTs*/
      92             : #define RLIMBS(x)  ((mp_limb_t *)((x)+2))
      93             : #define RNLIMBS(x) (lg(x)-2)
      94             : 
      95             : INLINE void
      96     9348403 : xmpn_copy(mp_limb_t *x, mp_limb_t *y, long n)
      97             : {
      98    69015134 :   while (--n >= 0) x[n]=y[n];
      99     9348403 : }
     100             : 
     101             : INLINE void
     102   540785722 : xmpn_mirror(mp_limb_t *x, long n)
     103             : {
     104             :   long i;
     105  3861659667 :   for(i=0;i<(n>>1);i++)
     106             :   {
     107  3320873945 :     ulong m=x[i];
     108  3320873945 :     x[i]=x[n-1-i];
     109  3320873945 :     x[n-1-i]=m;
     110             :   }
     111   540785722 : }
     112             : 
     113             : INLINE void
     114   654895496 : xmpn_mirrorcopy(mp_limb_t *z, mp_limb_t *x, long n)
     115             : {
     116             :   long i;
     117  9550512254 :   for(i=0;i<n;i++)
     118  8895616758 :     z[i]=x[n-1-i];
     119   654895496 : }
     120             : 
     121             : INLINE void
     122   201417284 : xmpn_zero(mp_ptr x, mp_size_t n)
     123             : {
     124  1953611873 :   while (--n >= 0) x[n]=0;
     125   201417284 : }
     126             : 
     127             : INLINE GEN
     128    31361438 : icopy_ef(GEN x, long l)
     129             : {
     130    31361438 :   long lx = lgefint(x);
     131    31361438 :   const GEN y = cgeti(l);
     132             : 
     133   229883148 :   while (--lx > 0) y[lx]=x[lx];
     134    31359567 :   return y;
     135             : }
     136             : 
     137             : /* NOTE: arguments of "spec" routines (muliispec, addiispec, etc.) aren't
     138             :  * GENs but pairs (long *a, long na) representing a list of digits (in basis
     139             :  * BITS_IN_LONG) : a[0], ..., a[na-1]. [ In ordre to facilitate splitting: no
     140             :  * need to reintroduce codewords ]
     141             :  * Use speci(a,na) to visualize the corresponding GEN.
     142             :  */
     143             : 
     144             : /***********************************************************************/
     145             : /**                                                                   **/
     146             : /**                     ADDITION / SUBTRACTION                        **/
     147             : /**                                                                   **/
     148             : /***********************************************************************/
     149             : 
     150             : GEN
     151     2986173 : setloop(GEN a)
     152             : {
     153     2986173 :   pari_sp av = avma - 2 * sizeof(long);
     154     2986173 :   (void)cgetg(lgefint(a) + 3, t_VECSMALL);
     155     2986173 :   return icopy_avma(a, av); /* two cells of extra space after a */
     156             : }
     157             : 
     158             : /* we had a = setloop(?), then some incloops. Reset a to b */
     159             : GEN
     160      171104 : resetloop(GEN a, GEN b) {
     161      171104 :   a[0] = evaltyp(t_INT) | evallg(lgefint(b));
     162      171104 :   affii(b, a); return a;
     163             : }
     164             : 
     165             : /* assume a > 0, initialized by setloop. Do a++ */
     166             : static GEN
     167   100431280 : incpos(GEN a)
     168             : {
     169   100431280 :   long i, l = lgefint(a);
     170   100431285 :   for (i=2; i<l; i++)
     171   100433132 :     if (++uel(a,i)) return a;
     172           3 :   a[l] = 1; l++;
     173           3 :   a[0]=evaltyp(t_INT) | _evallg(l);
     174           3 :   a[1]=evalsigne(1) | evallgefint(l);
     175           3 :   return a;
     176             : }
     177             : 
     178             : /* assume a < 0, initialized by setloop. Do a++ */
     179             : static GEN
     180       33788 : incneg(GEN a)
     181             : {
     182       33788 :   long i, l = lgefint(a)-1;
     183       33788 :   if (uel(a,2)--)
     184             :   {
     185       33784 :     if (!a[l]) /* implies l = 2 */
     186             :     {
     187        1604 :       a[0] = evaltyp(t_INT) | _evallg(2);
     188        1604 :       a[1] = evalsigne(0) | evallgefint(2);
     189             :     }
     190       33784 :     return a;
     191             :   }
     192           5 :   for (i=3; i<=l; i++)
     193           5 :     if (uel(a,i)--) break;
     194           4 :   if (!a[l])
     195             :   {
     196           4 :     a[0] = evaltyp(t_INT) | _evallg(l);
     197           4 :     a[1] = evalsigne(-1) | evallgefint(l);
     198             :   }
     199           4 :   return a;
     200             : }
     201             : 
     202             : /* assume a initialized by setloop. Do a++ */
     203             : GEN
     204   100798173 : incloop(GEN a)
     205             : {
     206   100798173 :   switch(signe(a))
     207             :   {
     208      332056 :     case 0:
     209      332056 :       a[0]=evaltyp(t_INT) | _evallg(3);
     210      332056 :       a[1]=evalsigne(1) | evallgefint(3);
     211      332056 :       a[2]=1; return a;
     212       33788 :     case -1: return incneg(a);
     213   100432329 :     default: return incpos(a);
     214             :   }
     215             : }
     216             : 
     217             : INLINE GEN
     218  2083134667 : adduispec(ulong s, GEN x, long nx)
     219             : {
     220             :   GEN  zd;
     221             :   long lz;
     222             : 
     223  2083134667 :   if (nx == 1) return adduu(uel(x,0), s);
     224   329012210 :   lz = nx+3; zd = cgeti(lz);
     225   330117472 :   if (mpn_add_1(LIMBS(zd),(mp_limb_t *)x,nx,s))
     226     4990184 :     zd[lz-1]=1;
     227             :   else
     228   325122701 :     lz--;
     229   330112885 :   zd[1] = evalsigne(1) | evallgefint(lz);
     230   330112885 :   return zd;
     231             : }
     232             : 
     233             : GEN
     234   432039406 : adduispec_offset(ulong s, GEN x, long offset, long nx)
     235             : {
     236   432039406 :   GEN xd=x+2+offset;
     237   597024863 :   while (nx && *(xd+nx-1)==0) nx--;
     238   432039406 :   if (!nx) return utoi(s);
     239   392531703 :   return adduispec(s,xd,nx);
     240             : }
     241             : 
     242             : INLINE GEN
     243  2850797937 : addiispec(GEN x, GEN y, long nx, long ny)
     244             : {
     245             :   GEN zd;
     246             :   long lz;
     247             : 
     248  2850797937 :   if (nx < ny) swapspec(x,y, nx,ny);
     249  2850797937 :   if (ny == 1) return adduispec(*y,x,nx);
     250  1245846709 :   lz = nx+3; zd = cgeti(lz);
     251             : 
     252  1242952799 :   if (mpn_add(LIMBS(zd),(mp_limb_t *)x,nx,(mp_limb_t *)y,ny))
     253    15838156 :     zd[lz-1]=1;
     254             :   else
     255  1228118346 :     lz--;
     256             : 
     257  1243956502 :   zd[1] = evalsigne(1) | evallgefint(lz);
     258  1243956502 :   return zd;
     259             : }
     260             : 
     261             : /* assume x >= y */
     262             : INLINE GEN
     263  1636479402 : subiuspec(GEN x, ulong s, long nx)
     264             : {
     265             :   GEN zd;
     266             :   long lz;
     267             : 
     268  1636479402 :   if (nx == 1) return utoi(x[0] - s);
     269             : 
     270   155216254 :   lz = nx + 2; zd = cgeti(lz);
     271   155741934 :   mpn_sub_1 (LIMBS(zd), (mp_limb_t *)x, nx, s);
     272   155742028 :   if (! zd[lz - 1]) { --lz; }
     273             : 
     274   155742028 :   zd[1] = evalsigne(1) | evallgefint(lz);
     275   155742028 :   return zd;
     276             : }
     277             : 
     278             : /* assume x > y */
     279             : INLINE GEN
     280  2947563309 : subiispec(GEN x, GEN y, long nx, long ny)
     281             : {
     282             :   GEN zd;
     283             :   long lz;
     284  2947563309 :   if (ny==1) return subiuspec(x,*y,nx);
     285  1340297173 :   lz = nx+2; zd = cgeti(lz);
     286             : 
     287  1331563041 :   mpn_sub (LIMBS(zd), (mp_limb_t *)x, nx, (mp_limb_t *)y, ny);
     288  1648030689 :   while (lz >= 3 && zd[lz - 1] == 0) { lz--; }
     289             : 
     290  1332724714 :   zd[1] = evalsigne(1) | evallgefint(lz);
     291  1332724714 :   return zd;
     292             : }
     293             : 
     294             : static void
     295   377888593 : roundr_up_ip(GEN x, long l)
     296             : {
     297   377888593 :   long i = l;
     298             :   for(;;)
     299             :   {
     300   379152966 :     if (++((ulong*)x)[--i]) break;
     301     1517114 :     if (i == 2) { x[2] = HIGHBIT; shiftr_inplace(x, 1); break; }
     302             :   }
     303   377898705 : }
     304             : 
     305             : void
     306   385916906 : affir(GEN x, GEN y)
     307             : {
     308   385916906 :   const long s = signe(x), ly = lg(y);
     309             :   long lx, sh, i;
     310             : 
     311   385916906 :   if (!s)
     312             :   {
     313    39015128 :     y[1] = evalexpo(-bit_accuracy(ly));
     314    39009074 :     return;
     315             :   }
     316   346901778 :   lx = lgefint(x); sh = bfffo(*int_MSW(x));
     317   346901778 :   y[1] = evalsigne(s) | evalexpo(bit_accuracy(lx)-sh-1);
     318   347108148 :   if (sh) {
     319   343050530 :     if (lx <= ly)
     320             :     {
     321   747072206 :       for (i=lx; i<ly; i++) y[i]=0;
     322   235526811 :       mpn_lshift(LIMBS(y),LIMBS(x),lx-2,sh);
     323   235529444 :       xmpn_mirror(LIMBS(y),lx-2);
     324   235523909 :       return;
     325             :     }
     326   107523719 :     mpn_lshift(LIMBS(y),LIMBS(x)+lx-ly,ly-2,sh);
     327   107522768 :     uel(y,2) |= uel(x,lx-ly+1) >> (BITS_IN_LONG-sh);
     328   107522768 :     xmpn_mirror(LIMBS(y),ly-2);
     329             :     /* lx > ly: round properly */
     330   107518219 :     if ((uel(x,lx-ly+1)<<sh) & HIGHBIT) roundr_up_ip(y, ly);
     331             :   }
     332             :   else {
     333     4057618 :     GEN xd=int_MSW(x);
     334     4057618 :     if (lx <= ly)
     335             :     {
     336     6174715 :       for (i=2; i<lx; i++,xd=int_precW(xd)) y[i]=*xd;
     337     3872404 :       for (   ; i<ly; i++) y[i]=0;
     338     1471011 :       return;
     339             :     }
     340     7067467 :     for (i=2; i<ly; i++,xd=int_precW(xd)) y[i]=*xd;
     341             :     /* lx > ly: round properly */
     342     2586607 :     if (uel(x,lx-ly+1) & HIGHBIT) roundr_up_ip(y, ly);
     343             :   }
     344             : }
     345             : 
     346             : INLINE GEN
     347   595987850 : shiftispec(GEN x, long nx, long n)
     348             : {
     349             :   long ny,m;
     350             :   GEN yd, y;
     351             : 
     352   595987850 :   if (!n) return icopyspec(x, nx);
     353             : 
     354   572897877 :   if (n > 0)
     355             :   {
     356   352864583 :     long d = dvmdsBIL(n, &m);
     357             :     long i;
     358             : 
     359   353206236 :     ny = nx + d + (m!=0);
     360   353206236 :     y = cgeti(ny + 2); yd = y + 2;
     361  3446074381 :     for (i=0; i<d; i++) yd[i] = 0;
     362             : 
     363   351587619 :     if (!m) xmpn_copy((mp_limb_t *) (yd + d), (mp_limb_t *) x, nx);
     364             :     else
     365             :     {
     366   349752646 :       ulong carryd = mpn_lshift((mp_limb_t *) (yd + d), (mp_limb_t *) x, nx, m);
     367   350100144 :       if (carryd) yd[ny - 1] = carryd;
     368   325373686 :       else ny--;
     369             :     }
     370             :   }
     371             :   else
     372             :   {
     373   220033294 :     long d = dvmdsBIL(-n, &m);
     374             : 
     375   221838720 :     ny = nx - d;
     376   221838720 :     if (ny < 1) return gen_0;
     377   219528575 :     y = cgeti(ny + 2); yd = y + 2;
     378             : 
     379   218629652 :     if (!m) xmpn_copy((mp_limb_t *) yd, (mp_limb_t *) (x + d), nx - d);
     380             :     else
     381             :     {
     382   211467085 :       mpn_rshift((mp_limb_t *) yd, (mp_limb_t *) (x + d), nx - d, m);
     383   211480317 :       if (yd[ny - 1] == 0)
     384             :       {
     385    43334771 :         if (ny == 1) return gc_const((pari_sp)(yd + 1), gen_0);
     386    36566208 :         ny--;
     387             :       }
     388             :     }
     389             :   }
     390   561820018 :   y[1] = evalsigne(1)|evallgefint(ny + 2);
     391   561820018 :   return y;
     392             : }
     393             : 
     394             : GEN
     395   104988280 : mantissa2nr(GEN x, long n)
     396             : {
     397   104988280 :   long ly, i, m, s = signe(x), lx = lg(x);
     398             :   GEN y;
     399   104988280 :   if (!s) return gen_0;
     400   104986937 :   if (!n)
     401             :   {
     402    25226483 :     y = cgeti(lx);
     403    25222964 :     y[1] = evalsigne(s) | evallgefint(lx);
     404    25222964 :     xmpn_mirrorcopy(LIMBS(y),RLIMBS(x),lx-2);
     405    25223408 :     return y;
     406             :   }
     407    79760454 :   if (n > 0)
     408             :   {
     409      158617 :     GEN z = (GEN)avma;
     410      158617 :     long d = dvmdsBIL(n, &m);
     411             : 
     412      158617 :     ly = lx+d; y = new_chunk(ly);
     413      407839 :     for ( ; d; d--) *--z = 0;
     414      162585 :     if (!m) for (i=2; i<lx; i++) y[i]=x[i];
     415             :     else
     416             :     {
     417      157366 :       const ulong sh = BITS_IN_LONG - m;
     418      157366 :       shift_left(y,x, 2,lx-1, 0,m);
     419      157366 :       i = uel(x,2) >> sh;
     420             :       /* Extend y on the left? */
     421      157366 :       if (i) { ly++; y = new_chunk(1); y[2] = i; }
     422             :     }
     423             :   }
     424             :   else
     425             :   {
     426    79601837 :     ly = lx - dvmdsBIL(-n, &m);
     427    79632022 :     if (ly<3) return gen_0;
     428    79632022 :     y = new_chunk(ly);
     429    79598779 :     if (m) {
     430    79364568 :       shift_right(y,x, 2,ly, 0,m);
     431    79412185 :       if (y[2] == 0)
     432             :       {
     433           0 :         if (ly==3) return gc_const((pari_sp)(y+3), gen_0);
     434           0 :         ly--; set_avma((pari_sp)(++y));
     435             :       }
     436             :     } else {
     437      655269 :       for (i=2; i<ly; i++) y[i]=x[i];
     438             :     }
     439             :   }
     440    79807089 :   xmpn_mirror(LIMBS(y),ly-2);
     441    79828623 :   y[1] = evalsigne(s)|evallgefint(ly);
     442    79828623 :   y[0] = evaltyp(t_INT)|evallg(ly); return y;
     443             : }
     444             : 
     445             : GEN
     446     2788701 : truncr(GEN x)
     447             : {
     448             :   long s, e, d, m, i;
     449             :   GEN y;
     450     2788701 :   if ((s=signe(x)) == 0 || (e=expo(x)) < 0) return gen_0;
     451     1438944 :   d = nbits2lg(e+1); m = remsBIL(e);
     452     1438939 :   if (d > lg(x)) pari_err_PREC( "truncr (precision loss in truncation)");
     453             : 
     454     1438935 :   y=cgeti(d); y[1] = evalsigne(s) | evallgefint(d);
     455     1438847 :   if (++m == BITS_IN_LONG)
     456        1554 :     for (i=2; i<d; i++) y[d-i+1]=x[i];
     457             :   else
     458             :   {
     459     1438143 :     GEN z=cgeti(d);
     460     2943387 :     for (i=2; i<d; i++) z[d-i+1]=x[i];
     461     1438078 :     mpn_rshift(LIMBS(y),LIMBS(z),d-2,BITS_IN_LONG-m);
     462     1438086 :     set_avma((pari_sp)y);
     463             :   }
     464     1438786 :   return y;
     465             : }
     466             : 
     467             : /* integral part */
     468             : GEN
     469     2921242 : floorr(GEN x)
     470             : {
     471             :   long e, d, m, i, lx;
     472             :   GEN y;
     473     2921242 :   if (signe(x) >= 0) return truncr(x);
     474     1040669 :   if ((e=expo(x)) < 0) return gen_m1;
     475      369089 :   d = nbits2lg(e+1); m = remsBIL(e);
     476      369322 :   lx=lg(x); if (d>lx) pari_err_PREC( "floorr (precision loss in truncation)");
     477      369322 :   y = cgeti(d+1);
     478      369314 :   if (++m == BITS_IN_LONG)
     479             :   {
     480        6332 :     for (i=2; i<d; i++) y[d-i+1]=x[i];
     481        5930 :     i=d; while (i<lx && !x[i]) i++;
     482        2891 :     if (i==lx) goto END;
     483             :   }
     484             :   else
     485             :   {
     486      366423 :     GEN z=cgeti(d);
     487      809823 :     for (i=2; i<d; i++) z[d-i+1]=x[i];
     488      366407 :     mpn_rshift(LIMBS(y),LIMBS(z),d-2,BITS_IN_LONG-m);
     489      366410 :     if (uel(x,d-1)<<m == 0)
     490             :     {
     491      576588 :       i=d; while (i<lx && !x[i]) i++;
     492      112437 :       if (i==lx) goto END;
     493             :     }
     494             :   }
     495      303363 :   if (mpn_add_1(LIMBS(y),LIMBS(y),d-2,1))
     496           0 :     y[d++]=1;
     497      303377 : END:
     498      369315 :   y[1] = evalsigne(-1) | evallgefint(d);
     499      369315 :   return y;
     500             : }
     501             : 
     502             : INLINE int
     503  3576700006 : cmpiispec(GEN x, GEN y, long lx, long ly)
     504             : {
     505  3576700006 :   if (lx < ly) return -1;
     506  3400298112 :   if (lx > ly) return  1;
     507  3250178694 :   return mpn_cmp((mp_limb_t*)x,(mp_limb_t*)y, lx);
     508             : }
     509             : 
     510             : INLINE int
     511   249238550 : equaliispec(GEN x, GEN y, long lx, long ly)
     512             : {
     513   249238550 :   if (lx != ly) return 0;
     514   249121460 :   return !mpn_cmp((mp_limb_t*)x,(mp_limb_t*)y, lx);
     515             : }
     516             : 
     517             : /***********************************************************************/
     518             : /**                                                                   **/
     519             : /**                          MULTIPLICATION                           **/
     520             : /**                                                                   **/
     521             : /***********************************************************************/
     522             : /* assume ny > 0 */
     523             : INLINE GEN
     524  4449518487 : muluispec(ulong x, GEN y, long ny)
     525             : {
     526  4449518487 :   if (ny == 1)
     527  3569355142 :     return muluu(x, *y);
     528             :   else
     529             :   {
     530   880163345 :     long lz = ny+3;
     531   880163345 :     GEN z = cgeti(lz);
     532   880531640 :     ulong hi = mpn_mul_1 (LIMBS(z), (mp_limb_t *)y, ny, x);
     533   880938995 :     if (hi) { z[lz - 1] = hi; } else lz--;
     534   880938995 :     z[1] = evalsigne(1) | evallgefint(lz);
     535   880938995 :     return z;
     536             :   }
     537             : }
     538             : 
     539             : /* a + b*|y| */
     540             : GEN
     541     1640643 : addumului(ulong a, ulong b, GEN y)
     542             : {
     543             :   GEN z;
     544             :   long i, lz;
     545             :   ulong hi;
     546     1640643 :   if (!b || !signe(y)) return utoi(a);
     547     1634977 :   lz = lgefint(y)+1;
     548     1634977 :   z = cgeti(lz);
     549     1634977 :   z[2]=a;
     550     3269954 :   for(i=3;i<lz;i++) z[i]=0;
     551     1634977 :   hi=mpn_addmul_1(LIMBS(z), LIMBS(y), NLIMBS(y), b);
     552     1634977 :   if (hi) z[lz-1]=hi; else lz--;
     553     1634977 :   z[1] = evalsigne(1) | evallgefint(lz);
     554     1634977 :   return gc_const((pari_sp)z, z);
     555             : }
     556             : 
     557             : /***********************************************************************/
     558             : /**                                                                   **/
     559             : /**                          DIVISION                                 **/
     560             : /**                                                                   **/
     561             : /***********************************************************************/
     562             : 
     563             : ulong
     564  1152990230 : umodiu(GEN y, ulong x)
     565             : {
     566  1152990230 :   long sy=signe(y);
     567             :   ulong hi;
     568  1152990230 :   if (!x) pari_err_INV("umodiu",gen_0);
     569  1154416703 :   if (!sy) return 0;
     570   824329208 :   hi = mpn_mod_1(LIMBS(y),NLIMBS(y),x);
     571   824329208 :   if (!hi) return 0;
     572   810572462 :   return (sy > 0)? hi: x - hi;
     573             : }
     574             : 
     575             : /* return |y| \/ x */
     576             : GEN
     577   813572733 : absdiviu_rem(GEN y, ulong x, ulong *rem)
     578             : {
     579             :   long ly;
     580             :   GEN z;
     581             : 
     582   813572733 :   if (!x) pari_err_INV("absdiviu_rem",gen_0);
     583   813589366 :   if (!signe(y)) { *rem = 0; return gen_0; }
     584             : 
     585   795425930 :   ly = lgefint(y);
     586   795425930 :   if (ly == 3 && (ulong)x > uel(y,2)) { *rem = uel(y,2); return gen_0; }
     587             : 
     588   783630421 :   z = cgeti(ly);
     589   782818487 :   *rem = mpn_divrem_1(LIMBS(z), 0, LIMBS(y), NLIMBS(y), x);
     590   782872924 :   if (z [ly - 1] == 0) ly--;
     591   782872924 :   z[1] = evallgefint(ly) | evalsigne(1);
     592   782872924 :   return z;
     593             : }
     594             : 
     595             : GEN
     596    87311237 : divis_rem(GEN y, long x, long *rem)
     597             : {
     598    87311237 :   long sy=signe(y),ly,s;
     599             :   GEN z;
     600             : 
     601    87311237 :   if (!x) pari_err_INV("divis_rem",gen_0);
     602    87321956 :   if (!sy) { *rem = 0; return gen_0; }
     603    64047002 :   if (x<0) { s = -sy; x = -x; } else s = sy;
     604             : 
     605    64047002 :   ly = lgefint(y);
     606    64047002 :   if (ly == 3 && (ulong)x > uel(y,2)) { *rem = itos(y); return gen_0; }
     607             : 
     608    44738143 :   z = cgeti(ly);
     609    44715515 :   *rem = mpn_divrem_1(LIMBS(z), 0, LIMBS(y), NLIMBS(y), x);
     610    44717313 :   if (sy<0) *rem = -  *rem;
     611    44717313 :   if (z[ly - 1] == 0) ly--;
     612    44717313 :   z[1] = evallgefint(ly) | evalsigne(s);
     613    44717313 :   return z;
     614             : }
     615             : 
     616             : GEN
     617      903383 : divis(GEN y, long x)
     618             : {
     619      903383 :   long sy=signe(y),ly,s;
     620             :   GEN z;
     621             : 
     622      903383 :   if (!x) pari_err_INV("divis",gen_0);
     623      903383 :   if (!sy) return gen_0;
     624      903339 :   if (x<0) { s = -sy; x = -x; } else s=sy;
     625             : 
     626      903339 :   ly = lgefint(y);
     627      903339 :   if (ly == 3 && (ulong)x > uel(y,2)) return gen_0;
     628             : 
     629      903339 :   z = cgeti(ly);
     630      903332 :   (void)mpn_divrem_1(LIMBS(z), 0, LIMBS(y), NLIMBS(y), x);
     631      903332 :   if (z[ly - 1] == 0) ly--;
     632      903332 :   z[1] = evallgefint(ly) | evalsigne(s);
     633      903332 :   return z;
     634             : }
     635             : 
     636             : /* We keep llx bits of x and lly bits of y*/
     637             : static GEN
     638    90734295 : divrr_with_gmp(GEN x, GEN y)
     639             : {
     640    90734295 :   long lx=RNLIMBS(x),ly=RNLIMBS(y);
     641    90734295 :   long lw=minss(lx,ly);
     642    90729825 :   long lly=minss(lw+1,ly);
     643    90726046 :   GEN  w=cgetr(lw+2);
     644    90664391 :   long lu=lw+lly;
     645    90664391 :   long llx=minss(lu,lx);
     646    90649966 :   mp_limb_t *u=(mp_limb_t *)new_chunk(lu);
     647    90597987 :   mp_limb_t *z=(mp_limb_t *)new_chunk(lly);
     648             :   mp_limb_t *q,*r;
     649    90518818 :   long e=expo(x)-expo(y);
     650    90518818 :   long sx=signe(x),sy=signe(y);
     651    90518818 :   xmpn_mirrorcopy(z,RLIMBS(y),lly);
     652    90626791 :   xmpn_mirrorcopy(u+lu-llx,RLIMBS(x),llx);
     653    90689578 :   xmpn_zero(u,lu-llx);
     654    90747596 :   q = (mp_limb_t *)new_chunk(lw+1);
     655    90712376 :   r = (mp_limb_t *)new_chunk(lly);
     656             : 
     657    90629000 :   mpn_tdiv_qr(q,r,0,u,lu,z,lly);
     658             : 
     659             :   /*Round up: This is not exactly correct we should test 2*r>z*/
     660    90833293 :   if (uel(r,lly-1) > (uel(z,lly-1)>>1))
     661    44644876 :     mpn_add_1(q,q,lw+1,1);
     662             : 
     663    90833554 :   xmpn_mirrorcopy(RLIMBS(w),q,lw);
     664             : 
     665    90824028 :   if (q[lw] == 0) e--;
     666    49862474 :   else if (q[lw] == 1) { shift_right(w,w, 2,lw+2, 1,1); }
     667          14 :   else { w[2] = HIGHBIT; e++; }
     668    90820568 :   if (sy < 0) sx = -sx;
     669    90820568 :   w[1] = evalsigne(sx) | evalexpo(e);
     670    90765029 :   return gc_const((pari_sp)w, w);
     671             : }
     672             : 
     673             : /* We keep llx bits of x and lly bits of y*/
     674             : static GEN
     675    15668610 : divri_with_gmp(GEN x, GEN y)
     676             : {
     677    15668610 :   long llx=RNLIMBS(x),ly=NLIMBS(y);
     678    15668610 :   long lly=minss(llx+1,ly);
     679    15668545 :   GEN  w=cgetr(llx+2);
     680    15666983 :   long lu=llx+lly, ld=ly-lly;
     681    15666983 :   mp_limb_t *u=(mp_limb_t *)new_chunk(lu);
     682    15665749 :   mp_limb_t *z=(mp_limb_t *)new_chunk(lly);
     683             :   mp_limb_t *q,*r;
     684    15664359 :   long sh=bfffo(y[ly+1]);
     685    15664359 :   long e=expo(x)-expi(y);
     686    15666014 :   long sx=signe(x),sy=signe(y);
     687    15666014 :   if (sh) mpn_lshift(z,LIMBS(y)+ld,lly,sh);
     688      350876 :   else xmpn_copy(z,LIMBS(y)+ld,lly);
     689    15666343 :   xmpn_mirrorcopy(u+lu-llx,RLIMBS(x),llx);
     690    15668344 :   xmpn_zero(u,lu-llx);
     691    15669751 :   q = (mp_limb_t *)new_chunk(llx+1);
     692    15668976 :   r = (mp_limb_t *)new_chunk(lly);
     693             : 
     694    15667305 :   mpn_tdiv_qr(q,r,0,u,lu,z,lly);
     695             : 
     696             :   /*Round up: This is not exactly correct we should test 2*r>z*/
     697    15671515 :   if (uel(r,lly-1) > (uel(z,lly-1)>>1))
     698     6294587 :     mpn_add_1(q,q,llx+1,1);
     699             : 
     700    15671508 :   xmpn_mirrorcopy(RLIMBS(w),q,llx);
     701             : 
     702    15671224 :   if (q[llx] == 0) e--;
     703     9736739 :   else if (q[llx] == 1) { shift_right(w,w, 2,llx+2, 1,1); }
     704           0 :   else { w[2] = HIGHBIT; e++; }
     705    15671134 :   if (sy < 0) sx = -sx;
     706    15671134 :   w[1] = evalsigne(sx) | evalexpo(e);
     707    15670062 :   return gc_const((pari_sp)w, w);
     708             : }
     709             : 
     710             : GEN
     711   115873069 : divri(GEN x, GEN y)
     712             : {
     713   115873069 :   long  s = signe(y);
     714             : 
     715   115873069 :   if (!s) pari_err_INV("divri",gen_0);
     716   115873173 :   if (!signe(x)) return real_0_bit(expo(x) - expi(y));
     717   115651277 :   if (!is_bigint(y)) {
     718    99985306 :     GEN z = divru(x, y[2]);
     719    99982896 :     if (s < 0) togglesign(z);
     720    99983006 :     return z;
     721             :   }
     722    15666707 :   return divri_with_gmp(x,y);
     723             : }
     724             : 
     725             : GEN
     726   107863727 : divrr(GEN x, GEN y)
     727             : {
     728   107863727 :   long sx=signe(x), sy=signe(y), lx,ly,lr,e,i,j;
     729             :   ulong y0,y1;
     730             :   GEN r, r1;
     731             : 
     732   107863727 :   if (!sy) pari_err_INV("divrr",y);
     733   107881921 :   e = expo(x) - expo(y);
     734   107881921 :   if (!sx) return real_0_bit(e);
     735   107517326 :   if (sy<0) sx = -sx;
     736             : 
     737   107517326 :   lx=lg(x); ly=lg(y);
     738   107517326 :   if (ly==3)
     739             :   {
     740    16827839 :     ulong k = x[2], l = (lx>3)? x[3]: 0;
     741             :     LOCAL_HIREMAINDER;
     742    16827839 :     if (k < uel(y,2)) e--;
     743             :     else
     744             :     {
     745     6341398 :       l >>= 1; if (k&1) l |= HIGHBIT;
     746     6341398 :       k >>= 1;
     747             :     }
     748    16827839 :     hiremainder = k; k = divll(l,y[2]);
     749    16827839 :     if (hiremainder > (uel(y,2) >> 1) && !++k) { k = HIGHBIT; e++; }
     750    16827839 :     r = cgetr(3);
     751    16819702 :     r[1] = evalsigne(sx) | evalexpo(e);
     752    16814505 :     r[2] = k; return r;
     753             :   }
     754             : 
     755    90689487 :   if (ly>=DIVRR_GMP_LIMIT)
     756    90734888 :     return divrr_with_gmp(x,y);
     757             : 
     758           0 :   lr = minss(lx,ly); r = new_chunk(lr);
     759           0 :   r1 = r-1;
     760           0 :   r1[1] = 0; for (i=2; i<lr; i++) r1[i]=x[i];
     761           0 :   r1[lr] = (lx>ly)? x[lr]: 0;
     762           0 :   y0 = y[2]; y1 = y[3];
     763           0 :   for (i=0; i<lr-1; i++)
     764             :   { /* r1 = r + (i-1), OK up to r1[2] (accesses at most r[lr]) */
     765             :     ulong k, qp;
     766             :     LOCAL_HIREMAINDER;
     767             :     LOCAL_OVERFLOW;
     768             : 
     769           0 :     if (uel(r1,1) == y0) { qp = ULONG_MAX; k = addll(y0,r1[2]); }
     770             :     else
     771             :     {
     772           0 :       if (uel(r1,1) > y0) /* can't happen if i=0 */
     773             :       {
     774           0 :         GEN y1 = y+1;
     775           0 :         j = lr-i; r1[j] = subll(r1[j],y1[j]);
     776           0 :         for (j--; j>0; j--) r1[j] = subllx(r1[j],y1[j]);
     777           0 :         j=i; do uel(r,--j)++; while (j && !r[j]);
     778             :       }
     779           0 :       hiremainder = r1[1]; overflow = 0;
     780           0 :       qp = divll(r1[2],y0); k = hiremainder;
     781             :     }
     782           0 :     j = lr-i+1;
     783           0 :     if (!overflow)
     784             :     {
     785             :       long k3, k4;
     786           0 :       k3 = mulll(qp,y1);
     787           0 :       if (j == 3) /* i = lr - 2 maximal, r1[3] undefined -> 0 */
     788           0 :         k4 = subll(hiremainder,k);
     789             :       else
     790             :       {
     791           0 :         k3 = subll(k3, r1[3]);
     792           0 :         k4 = subllx(hiremainder,k);
     793             :       }
     794           0 :       while (!overflow && k4) { qp--; k3=subll(k3,y1); k4=subllx(k4,y0); }
     795             :     }
     796           0 :     if (j<ly) (void)mulll(qp,y[j]); else { hiremainder = 0 ; j = ly; }
     797           0 :     for (j--; j>1; j--)
     798             :     {
     799           0 :       r1[j] = subll(r1[j], addmul(qp,y[j]));
     800           0 :       hiremainder += overflow;
     801             :     }
     802           0 :     if (uel(r1,1) != hiremainder)
     803             :     {
     804           0 :       if (uel(r1,1) < hiremainder)
     805             :       {
     806           0 :         qp--;
     807           0 :         j = lr-i-(lr-i>=ly); r1[j] = addll(r1[j], y[j]);
     808           0 :         for (j--; j>1; j--) r1[j] = addllx(r1[j], y[j]);
     809             :       }
     810             :       else
     811             :       {
     812           0 :         uel(r1,1) -= hiremainder;
     813           0 :         while (r1[1])
     814             :         {
     815           0 :           qp++; if (!qp) { j=i; do uel(r,--j)++; while (j && !r[j]); }
     816           0 :           j = lr-i-(lr-i>=ly); r1[j] = subll(r1[j],y[j]);
     817           0 :           for (j--; j>1; j--) r1[j] = subllx(r1[j],y[j]);
     818           0 :           uel(r1,1) -= overflow;
     819             :         }
     820             :       }
     821             :     }
     822           0 :     *++r1 = qp;
     823             :   }
     824             :   /* i = lr-1 */
     825             :   /* round correctly */
     826           0 :   if (uel(r1,1) > (y0>>1))
     827             :   {
     828           0 :     j=i; do uel(r,--j)++; while (j && !r[j]);
     829             :   }
     830           0 :   r1 = r-1; for (j=i; j>=2; j--) r[j]=r1[j];
     831           0 :   if (r[0] == 0) e--;
     832           0 :   else if (r[0] == 1) { shift_right(r,r, 2,lr, 1,1); }
     833             :   else { /* possible only when rounding up to 0x2 0x0 ... */
     834           0 :     r[2] = (long)HIGHBIT; e++;
     835             :   }
     836           0 :   r[0] = evaltyp(t_REAL)|evallg(lr);
     837           0 :   r[1] = evalsigne(sx) | evalexpo(e);
     838           0 :   return r;
     839             : }
     840             : 
     841             : /* Integer division x / y: such that sign(r) = sign(x)
     842             :  *   if z = ONLY_REM return remainder, otherwise return quotient
     843             :  *   if z != NULL set *z to remainder
     844             :  *   *z is the last object on stack (and thus can be disposed of with cgiv
     845             :  *   instead of gerepile)
     846             :  * If *z is zero, we put gen_0 here and no copy.
     847             :  * space needed: lx + ly
     848             :  */
     849             : GEN
     850  1575561817 : dvmdii(GEN x, GEN y, GEN *z)
     851             : {
     852  1575561817 :   long sx=signe(x),sy=signe(y);
     853             :   long lx, ly, lq;
     854             :   pari_sp av;
     855             :   GEN r,q;
     856             : 
     857  1575561817 :   if (!sy) pari_err_INV("dvmdii",y);
     858  1577201116 :   if (!sx)
     859             :   {
     860    56105169 :     if (!z || z == ONLY_REM) return gen_0;
     861    21124444 :     *z=gen_0; return gen_0;
     862             :   }
     863  1521095947 :   lx=lgefint(x);
     864  1521095947 :   ly=lgefint(y); lq=lx-ly;
     865  1521095947 :   if (lq <= 0)
     866             :   {
     867   930214523 :     if (lq == 0)
     868             :     {
     869   867818884 :       long s=mpn_cmp(LIMBS(x),LIMBS(y),NLIMBS(x));
     870   867818884 :       if (s>0) goto DIVIDE;
     871   368516910 :       if (s==0)
     872             :       {
     873    26757105 :         if (z == ONLY_REM) return gen_0;
     874    16444470 :         if (z) *z = gen_0;
     875    16444470 :         if (sx < 0) sy = -sy;
     876    16444470 :         return stoi(sy);
     877             :       }
     878             :     }
     879   404155444 :     if (z == ONLY_REM) return icopy(x);
     880    11336830 :     if (z) *z = icopy(x);
     881    11336830 :     return gen_0;
     882             :   }
     883   590881424 : DIVIDE: /* quotient is nonzero */
     884  1090183398 :   av=avma; if (sx<0) sy = -sy;
     885  1090183398 :   if (ly==3)
     886             :   {
     887   467609532 :     ulong lq = lx;
     888             :     ulong si;
     889   467609532 :     q  = cgeti(lq);
     890   465973212 :     si = mpn_divrem_1(LIMBS(q), 0, LIMBS(x), NLIMBS(x), y[2]);
     891   466401267 :     if (q[lq - 1] == 0) lq--;
     892   466401267 :     if (z == ONLY_REM)
     893             :     {
     894   336562135 :       if (!si) return gc_const(av, gen_0);
     895   292130317 :       set_avma(av); r = cgeti(3);
     896   291697702 :       r[1] = evalsigne(sx) | evallgefint(3);
     897   291697702 :       r[2] = si; return r;
     898             :     }
     899   129839132 :     q[1] = evalsigne(sy) | evallgefint(lq);
     900   129839132 :     if (!z) return q;
     901   125992443 :     if (!si) { *z=gen_0; return q; }
     902    50167616 :     r=cgeti(3);
     903    50186345 :     r[1] = evalsigne(sx) | evallgefint(3);
     904    50186345 :     r[2] = si; *z=r; return q;
     905             :   }
     906   622573866 :   if (z == ONLY_REM)
     907             :   {
     908   606881195 :     ulong lr = lgefint(y);
     909   606881195 :     ulong lq = lgefint(x)-lgefint(y)+3;
     910   606881195 :     GEN r = cgeti(lr);
     911   593562464 :     GEN q = cgeti(lq);
     912   587940991 :     mpn_tdiv_qr(LIMBS(q), LIMBS(r),0, LIMBS(x), NLIMBS(x), LIMBS(y), NLIMBS(y));
     913   614838265 :     if (!r[lr - 1])
     914             :     {
     915   409595047 :       while(lr>2 && !r[lr - 1]) lr--;
     916   165994600 :       if (lr == 2) return gc_const(av, gen_0); /* exact division */
     917             :     }
     918   602024955 :     r[1] = evalsigne(sx) | evallgefint(lr);
     919   602024955 :     return gc_const((pari_sp)r, r);
     920             :   }
     921             :   else
     922             :   {
     923    15692671 :     ulong lq = lgefint(x)-lgefint(y)+3;
     924    15692671 :     ulong lr = lgefint(y);
     925    15692671 :     GEN q = cgeti(lq);
     926    20047005 :     GEN r = cgeti(lr);
     927    20045628 :     mpn_tdiv_qr(LIMBS(q), LIMBS(r),0, LIMBS(x), NLIMBS(x), LIMBS(y), NLIMBS(y));
     928    20049158 :     if (q[lq - 1] == 0) lq--;
     929    20049158 :     q[1] = evalsigne(sy) | evallgefint(lq);
     930    20049158 :     if (!z) return gc_const((pari_sp)q, q);
     931    16989605 :     if (!r[lr - 1])
     932             :     {
     933    22765490 :       while(lr>2 && !r[lr - 1]) lr--;
     934     4092176 :       if (lr == 2) { *z = gen_0; return gc_const((pari_sp)q, q); } /* exact */
     935             :     }
     936    13907713 :     r[1] = evalsigne(sx) | evallgefint(lr);
     937    13907713 :     *z = gc_const((pari_sp)r, r); return q;
     938             :   }
     939             : }
     940             : 
     941             : /* Montgomery reduction.
     942             :  * N has k words, assume T >= 0 has less than 2k.
     943             :  * Return res := T / B^k mod N, where B = 2^BIL
     944             :  * such that 0 <= res < T/B^k + N  and  res has less than k words */
     945             : GEN
     946    26799050 : red_montgomery(GEN T, GEN N, ulong inv)
     947             : {
     948             :   pari_sp av;
     949             :   GEN Te, Td, Ne, Nd, scratch;
     950    26799050 :   ulong i, j, m, t, d, k = NLIMBS(N);
     951             :   int carry;
     952             :   LOCAL_HIREMAINDER;
     953             :   LOCAL_OVERFLOW;
     954             : 
     955    26799050 :   if (k == 0) return gen_0;
     956    26799050 :   d = NLIMBS(T); /* <= 2*k */
     957    26799050 :   if (d == 0) return gen_0;
     958             : #ifdef DEBUG
     959             :   if (d > 2*k) pari_err_BUG("red_montgomery");
     960             : #endif
     961    26799041 :   if (k == 1)
     962             :   { /* as below, special cased for efficiency */
     963       66303 :     ulong n = uel(N,2);
     964       66303 :     if (d == 1) {
     965       66231 :       hiremainder = uel(T,2);
     966       66231 :       m = hiremainder * inv;
     967       66231 :       (void)addmul(m, n); /* t + m*n = 0 */
     968       66231 :       return utoi(hiremainder);
     969             :     } else { /* d = 2 */
     970          72 :       hiremainder = uel(T,2);
     971          72 :       m = hiremainder * inv;
     972          72 :       (void)addmul(m, n); /* t + m*n = 0 */
     973          72 :       t = addll(hiremainder, uel(T,3));
     974          72 :       if (overflow) t -= n; /* t > n doesn't fit in 1 word */
     975          72 :       return utoi(t);
     976             :     }
     977             :   }
     978             :   /* assume k >= 2 */
     979    26732738 :   av = avma; scratch = new_chunk(k<<1); /* >= k + 2: result fits */
     980             : 
     981             :   /* copy T to scratch space (pad with zeroes to 2k words) */
     982    26439046 :   Td = scratch;
     983    26439046 :   Te = T + 2;
     984   363367803 :   for (i=0; i < d     ; i++) *Td++ = *Te++;
     985    52780423 :   for (   ; i < (k<<1); i++) *Td++ = 0;
     986             : 
     987    26439046 :   Te = scratch - 1; /* 1 beyond end of current T mantissa (in scratch) */
     988    26439046 :   Ne = N + 1;       /* 1 beyond end of N mantissa */
     989             : 
     990    26439046 :   carry = 0;
     991   185939666 :   for (i=0; i<k; i++) /* set T := T/B nod N, k times */
     992             :   {
     993   159500620 :     Td = Te; /* one beyond end of (new) T mantissa */
     994   159500620 :     Nd = Ne;
     995   159500620 :     hiremainder = *++Td;
     996   159500620 :     m = hiremainder * inv; /* solve T + m N = O(B) */
     997             : 
     998             :     /* set T := (T + mN) / B */
     999   159500620 :     Te = Td;
    1000   159500620 :     (void)addmul(m, *++Nd); /* = 0 */
    1001  1342021203 :     for (j=1; j<k; j++)
    1002             :     {
    1003  1182520583 :       t = addll(addmul(m, *++Nd), *++Td);
    1004  1182520583 :       *Td = t;
    1005  1182520583 :       hiremainder += overflow;
    1006             :     }
    1007   159500620 :     t = addll(hiremainder, *++Td); *Td = t + carry;
    1008   159500620 :     carry = (overflow || (carry && *Td == 0));
    1009             :   }
    1010    26439046 :   if (carry)
    1011             :   { /* Td > N overflows (k+1 words), set Td := Td - N */
    1012       44336 :     GEN NE = N + k+1;
    1013       44336 :     Td = Te;
    1014       44336 :     Nd = Ne;
    1015       44336 :     t = subll(*++Td, *++Nd); *Td = t;
    1016      362045 :     while (Nd < NE) { t = subllx(*++Td, *++Nd); *Td = t; }
    1017             :   }
    1018             : 
    1019             :   /* copy result */
    1020    26439046 :   Td = (GEN)av - 1; /* *Td = high word of final result */
    1021    30129826 :   while (*Td == 0 && Te < Td) Td--; /* strip leading 0s */
    1022    26439046 :   k = Td - Te; if (!k) return gc_const(av, gen_0);
    1023    26439046 :   Td = (GEN)av - k; /* will write mantissa there */
    1024    26439046 :   (void)memmove(Td, Te+1, k*sizeof(long));
    1025    26439046 :   Td -= 2;
    1026    26439046 :   Td[0] = evaltyp(t_INT) | evallg(k+2);
    1027    26478091 :   Td[1] = evalsigne(1) | evallgefint(k+2);
    1028             : #ifdef DEBUG
    1029             : {
    1030             :   long l = NLIMBS(N), s = BITS_IN_LONG*l;
    1031             :   GEN R = int2n(s);
    1032             :   GEN res = remii(mulii(T, Fp_inv(R, N)), N);
    1033             :   if (k > lgefint(N)
    1034             :     || !equalii(remii(Td,N),res)
    1035             :     || cmpii(Td, addii(shifti(T, -s), N)) >= 0) pari_err_BUG("red_montgomery");
    1036             : }
    1037             : #endif
    1038    26478091 :   return gc_const((pari_sp)Td, Td);
    1039             : }
    1040             : 
    1041             : /* EXACT INTEGER DIVISION */
    1042             : 
    1043             : /* use undocumented GMP interface */
    1044             : static void
    1045    69553149 : GEN2mpz(mpz_t X, GEN x)
    1046             : {
    1047    69553149 :   long l = lgefint(x)-2;
    1048    69553149 :   X->_mp_alloc = l;
    1049    69553149 :   X->_mp_size = signe(x) > 0? l: -l;
    1050    69553149 :   X->_mp_d = LIMBS(x);
    1051    69553149 : }
    1052             : static void
    1053    34778452 : mpz2GEN(GEN z, mpz_t Z)
    1054             : {
    1055    34778452 :   long l = Z->_mp_size;
    1056    34778452 :   z[1] = evalsigne(l > 0? 1: -1) | evallgefint(labs(l)+2);
    1057    34778452 : }
    1058             : 
    1059             : #ifdef mpn_divexact_1
    1060             : static GEN
    1061   312420176 : diviuexact_i(GEN x, ulong y)
    1062             : {
    1063   312420176 :   long l = lgefint(x);
    1064   312420176 :   GEN z = cgeti(l);
    1065   311482513 :   mpn_divexact_1(LIMBS(z), LIMBS(x), NLIMBS(x), y);
    1066   311492282 :   if (z[l-1] == 0) l--;
    1067   311492282 :   z[1] = evallgefint(l) | evalsigne(signe(x));
    1068   311492282 :   return z;
    1069             : }
    1070             : #elif 1 && !defined(_WIN64) /* mpz_divexact_ui is not LLP64 friendly   */
    1071             :                             /* assume y != 0 and the division is exact */
    1072             : static GEN
    1073             : diviuexact_i(GEN x, ulong y)
    1074             : {
    1075             :   long l = lgefint(x);
    1076             :   GEN z = cgeti(l);
    1077             :   mpz_t X, Z;
    1078             :   GEN2mpz(X, x);
    1079             :   Z->_mp_alloc = l-2;
    1080             :   Z->_mp_size  = l-2;
    1081             :   Z->_mp_d = LIMBS(z);
    1082             :   mpz_divexact_ui(Z, X, y);
    1083             :   mpz2GEN(z, Z); return z;
    1084             : }
    1085             : #else
    1086             : /* assume y != 0 and the division is exact */
    1087             : static GEN
    1088             : diviuexact_i(GEN x, ulong y)
    1089             : {
    1090             :   /*TODO: implement true exact division.*/
    1091             :   return divii(x,utoi(y));
    1092             : }
    1093             : #endif
    1094             : 
    1095             : GEN
    1096    28154476 : diviuexact(GEN x, ulong y)
    1097             : {
    1098             :   GEN z;
    1099    28154476 :   if (!signe(x)) return gen_0;
    1100    27038620 :   z = diviuexact_i(x, y);
    1101    27031883 :   if (lgefint(z) == 2) pari_err_OP("exact division", x, utoi(y));
    1102    27031592 :   return z;
    1103             : }
    1104             : 
    1105             : /* Find z such that x=y*z, knowing that y | x (unchecked) */
    1106             : GEN
    1107   398824604 : diviiexact(GEN x, GEN y)
    1108             : {
    1109             :   GEN z;
    1110   398824604 :   if (!signe(y)) pari_err_INV("diviiexact",y);
    1111   399958425 :   if (!signe(x)) return gen_0;
    1112   319943070 :   if (lgefint(y) == 3)
    1113             :   {
    1114   285234188 :     z = diviuexact_i(x, y[2]);
    1115   284677207 :     if (signe(y) < 0) togglesign(z);
    1116             :   }
    1117             :   else
    1118             :   {
    1119    34708882 :     long l = lgefint(x);
    1120             :     mpz_t X, Y, Z;
    1121    34708882 :     z = cgeti(l);
    1122    34776770 :     GEN2mpz(X, x);
    1123    34776723 :     GEN2mpz(Y, y);
    1124    34776745 :     Z->_mp_alloc = l-2;
    1125    34776745 :     Z->_mp_size  = l-2;
    1126    34776745 :     Z->_mp_d = LIMBS(z);
    1127    34776745 :     mpz_divexact(Z, X, Y);
    1128    34778516 :     mpz2GEN(z, Z);
    1129             :   }
    1130   319459559 :   if (lgefint(z) == 2) pari_err_OP("exact division", x, y);
    1131   319427593 :   return z;
    1132             : }
    1133             : 
    1134             : /* assume yz != and yz | x */
    1135             : GEN
    1136      199733 : diviuuexact(GEN x, ulong y, ulong z)
    1137             : {
    1138             :   long tmp[4];
    1139             :   ulong t;
    1140             :   LOCAL_HIREMAINDER;
    1141      199733 :   t = mulll(y, z);
    1142      199733 :   if (!hiremainder) return diviuexact(x, t);
    1143           0 :   tmp[0] = evaltyp(t_INT)|_evallg(4);
    1144           0 :   tmp[1] = evalsigne(1)|evallgefint(4);
    1145           0 :   tmp[2] = t;
    1146           0 :   tmp[3] = hiremainder;
    1147           0 :   return diviiexact(x, tmp);
    1148             : }
    1149             : 
    1150             : /********************************************************************/
    1151             : /**                                                                **/
    1152             : /**               INTEGER MULTIPLICATION                           **/
    1153             : /**                                                                **/
    1154             : /********************************************************************/
    1155             : 
    1156             : /* nx >= ny = num. of digits of x, y (not GEN, see mulii) */
    1157             : GEN
    1158  4516259378 : muliispec(GEN x, GEN y, long nx, long ny)
    1159             : {
    1160             :   GEN zd;
    1161             :   long lz;
    1162             :   ulong hi;
    1163             : 
    1164  4516259378 :   if (nx < ny) swapspec(x,y, nx,ny);
    1165  4516259378 :   if (!ny) return gen_0;
    1166  4516259378 :   if (ny == 1) return muluispec((ulong)*y, x, nx);
    1167             : 
    1168   920865150 :   lz = nx+ny+2;
    1169   920865150 :   zd = cgeti(lz);
    1170   920339577 :   hi = mpn_mul(LIMBS(zd), (mp_limb_t *)x, nx, (mp_limb_t *)y, ny);
    1171   928175903 :   if (!hi) lz--;
    1172             :   /*else zd[lz-1]=hi; GH tell me it is not necessary.*/
    1173             : 
    1174   928175903 :   zd[1] = evalsigne(1) | evallgefint(lz);
    1175   928175903 :   return zd;
    1176             : }
    1177             : GEN
    1178      222070 : muluui(ulong x, ulong y, GEN z)
    1179             : {
    1180      222070 :   long t, s = signe(z);
    1181             :   GEN r;
    1182             :   LOCAL_HIREMAINDER;
    1183             : 
    1184      222070 :   if (!x || !y || !signe(z)) return gen_0;
    1185      221706 :   t = mulll(x,y);
    1186      221706 :   if (!hiremainder)
    1187      221760 :     r = muluispec(t, z+2, lgefint(z)-2);
    1188             :   else
    1189             :   {
    1190             :     long tmp[2];
    1191           0 :     tmp[1] = hiremainder;
    1192           0 :     tmp[0] = t;
    1193           0 :     r = muliispec(z+2,tmp, lgefint(z)-2, 2);
    1194             :   }
    1195      221522 :   setsigne(r,s); return r;
    1196             : }
    1197             : 
    1198             : GEN
    1199   916233680 : sqrispec(GEN x, long nx)
    1200             : {
    1201             :   GEN zd;
    1202             :   long lz;
    1203             : 
    1204   916233680 :   if (!nx) return gen_0;
    1205   408948283 :   if (nx==1) return sqru(*x);
    1206             : 
    1207   244481748 :   lz = (nx<<1)+2;
    1208   244481748 :   zd = cgeti(lz);
    1209             : #ifdef mpn_sqr
    1210   239090239 :   mpn_sqr(LIMBS(zd), (mp_limb_t *)x, nx);
    1211             : #else
    1212             :   mpn_mul_n(LIMBS(zd), (mp_limb_t *)x, (mp_limb_t *)x, nx);
    1213             : #endif
    1214   243073505 :   if (zd[lz-1]==0) lz--;
    1215             : 
    1216   243073505 :   zd[1] = evalsigne(1) | evallgefint(lz);
    1217   243073505 :   return zd;
    1218             : }
    1219             : 
    1220             : INLINE GEN
    1221    45546186 : sqrispec_mirror(GEN x, long nx)
    1222             : {
    1223    45546186 :   GEN cx=new_chunk(nx);
    1224             :   GEN z;
    1225    45546185 :   xmpn_mirrorcopy((mp_limb_t *)cx,(mp_limb_t *)x,nx);
    1226    45546187 :   z=sqrispec(cx, nx);
    1227    45546188 :   xmpn_mirror(LIMBS(z), NLIMBS(z));
    1228    45546186 :   return z;
    1229             : }
    1230             : 
    1231             : /* leaves garbage on the stack. */
    1232             : INLINE GEN
    1233    72808577 : muliispec_mirror(GEN x, GEN y, long nx, long ny)
    1234             : {
    1235             :   GEN cx, cy, z;
    1236    72808577 :   long s = 0;
    1237    92201076 :   while (nx && x[nx-1]==0) { nx--; s++; }
    1238    97305101 :   while (ny && y[ny-1]==0) { ny--; s++; }
    1239    72808577 :   cx=new_chunk(nx); cy=new_chunk(ny);
    1240    72808551 :   xmpn_mirrorcopy((mp_limb_t *)cx,(mp_limb_t *)x,nx);
    1241    72808557 :   xmpn_mirrorcopy((mp_limb_t *)cy,(mp_limb_t *)y,ny);
    1242    72808581 :   z =  nx>=ny ? muliispec(cx, cy, nx, ny): muliispec(cy, cx, ny, nx);
    1243    72808584 :   if (s)
    1244             :   {
    1245     5746164 :     long i, lz = lgefint(z) + s;
    1246     5746164 :     (void)new_chunk(s);
    1247     5746142 :     z -= s;
    1248    49635081 :     for (i=0; i<s; i++) z[2+i]=0;
    1249     5746142 :     z[1] = evalsigne(1) | evallgefint(lz);
    1250     5746142 :     z[0] = evaltyp(t_INT) | evallg(lz);
    1251             :   }
    1252    72808563 :   xmpn_mirror(LIMBS(z), NLIMBS(z));
    1253    72808587 :   return z;
    1254             : }
    1255             : 
    1256             : /* x % (2^n), assuming n >= 0 */
    1257             : GEN
    1258    32407959 : remi2n(GEN x, long n)
    1259             : {
    1260             :   ulong hi;
    1261    32407959 :   long l, k, lx, ly, sx = signe(x);
    1262             :   GEN z, xd, zd;
    1263             : 
    1264    32407959 :   if (!sx || !n) return gen_0;
    1265             : 
    1266    32140077 :   k = dvmdsBIL(n, &l);
    1267    32449926 :   lx = lgefint(x);
    1268    32449926 :   if (lx < k+3) return icopy(x);
    1269             : 
    1270    31957630 :   xd = x + (2 + k);
    1271             :   /* x = |k|...|1|#|... : copy the last l bits of # and the first k words
    1272             :    *              ^--- initial xd  */
    1273    31957630 :   hi = ((ulong)*xd) & ((1UL<<l)-1); /* last l bits of # = top bits of result */
    1274    31957630 :   if (!hi)
    1275             :   { /* strip leading zeroes from result */
    1276     7674152 :     xd--; while (k && !*xd) { k--; xd--; }
    1277     7632730 :     if (!k) return gen_0;
    1278     6645421 :     ly = k+2;
    1279             :   }
    1280             :   else
    1281    24324900 :     ly = k+3;
    1282             : 
    1283    30970321 :   zd = z = cgeti(ly);
    1284    30653712 :   *++zd = evalsigne(sx) | evallgefint(ly);
    1285   297607105 :   xd = x+1; for ( ;k; k--) *++zd = *++xd;
    1286    30653712 :   if (hi) *++zd = hi;
    1287    30653712 :   return z;
    1288             : }
    1289             : 
    1290             : /********************************************************************/
    1291             : /**                                                                **/
    1292             : /**                      INTEGER SQUARE ROOT                       **/
    1293             : /**                                                                **/
    1294             : /********************************************************************/
    1295             : 
    1296             : /* Return S (and set R) s.t S^2 + R = N, 0 <= R <= 2S.
    1297             :  * As for dvmdii, R is last on stack and guaranteed to be gen_0 in case the
    1298             :  * remainder is 0. R = NULL is allowed. */
    1299             : GEN
    1300     3863038 : sqrtremi(GEN a, GEN *r)
    1301             : {
    1302     3863038 :   long l, na = NLIMBS(a);
    1303             :   mp_size_t nr;
    1304             :   GEN S;
    1305     3863038 :   if (!na) {
    1306         712 :     if (r) *r = gen_0;
    1307         712 :     return gen_0;
    1308             :   }
    1309     3862326 :   l = (na + 5) >> 1; /* 2 + ceil(na/2) */
    1310     3862326 :   S = cgetipos(l);
    1311     3862291 :   if (r) {
    1312     1033799 :     GEN R = cgeti(2 + na);
    1313     1033799 :     nr = mpn_sqrtrem(LIMBS(S), LIMBS(R), LIMBS(a), na);
    1314     1033799 :     if (nr) R[1] = evalsigne(1) | evallgefint(nr+2);
    1315       27022 :     else    { set_avma((pari_sp)S); R = gen_0; }
    1316     1033799 :     *r = R;
    1317             :   }
    1318             :   else
    1319     2828492 :     (void)mpn_sqrtrem(LIMBS(S), NULL, LIMBS(a), na);
    1320     3862376 :   return S;
    1321             : }
    1322             : 
    1323             : /* compute sqrt(|a|), assuming a != 0 */
    1324             : GEN
    1325    95270864 : sqrtr_abs(GEN a)
    1326             : {
    1327             :   GEN res;
    1328             :   mp_limb_t *b, *c;
    1329    95270864 :   long l = RNLIMBS(a), e = expo(a), er = e>>1;
    1330             :   long n;
    1331    95270864 :   res = cgetr(2 + l);
    1332    95179188 :   res[1] = evalsigne(1) | evalexpo(er);
    1333    95235287 :   if (e&1)
    1334             :   {
    1335    40670271 :     b = (mp_limb_t *) new_chunk(l<<1);
    1336    40660355 :     xmpn_zero(b,l);
    1337    40676748 :     xmpn_mirrorcopy(b+l, RLIMBS(a), l);
    1338    40696998 :     c = (mp_limb_t *) new_chunk(l);
    1339    40684844 :     n = mpn_sqrtrem(c,b,b,l<<1); /* c <- sqrt; b <- rem */
    1340    40708629 :     if (n>l || (n==l && mpn_cmp(b,c,l) > 0)) mpn_add_1(c,c,l,1);
    1341             :   }
    1342             :   else
    1343             :   {
    1344             :     ulong u;
    1345    54565016 :     b = (mp_limb_t *) mantissa2nr(a,-1);
    1346    54609451 :     b[1] = uel(a,l+1)<<(BITS_IN_LONG-1);
    1347    54609451 :     b = (mp_limb_t *) new_chunk(l);
    1348    54584637 :     xmpn_zero(b,l+1); /* overwrites the former b[0] */
    1349    54596739 :     c = (mp_limb_t *) new_chunk(l + 1);
    1350    54580789 :     n = mpn_sqrtrem(c,b,b,(l<<1)+2); /* c <- sqrt; b <- rem */
    1351    54638493 :     u = (ulong)*c++;
    1352    54638493 :     if ( u&HIGHBIT || (u == ~HIGHBIT &&
    1353           0 :              (n>l || (n==l && mpn_cmp(b,c,l)>0))))
    1354    26883359 :       mpn_add_1(c,c,l,1);
    1355             :   }
    1356    95351206 :   xmpn_mirrorcopy(RLIMBS(res),c,l);
    1357    95336278 :   return gc_const((pari_sp)res, res);
    1358             : }
    1359             : 
    1360             : /* Normalize a nonnegative integer */
    1361             : GEN
    1362   279567469 : int_normalize(GEN x, long known_zero_words)
    1363             : {
    1364   279567469 :   long i =  lgefint(x) - 1 - known_zero_words;
    1365  1643660645 :   for ( ; i > 1; i--)
    1366  1601043682 :     if (x[i]) { setlgefint(x, i+1); return x; }
    1367    42616963 :   x[1] = evalsigne(0) | evallgefint(2); return x;
    1368             : }
    1369             : 
    1370             : /********************************************************************
    1371             :  **                                                                **
    1372             :  **                           Base Conversion                      **
    1373             :  **                                                                **
    1374             :  ********************************************************************/
    1375             : 
    1376             : ulong *
    1377      418136 : convi(GEN x, long *l)
    1378             : {
    1379      418136 :   long n = nchar2nlong(2 + (long)(NLIMBS(x) * (BITS_IN_LONG * LOG10_2)));
    1380      418136 :   GEN str = cgetg(n+1, t_VECSMALL);
    1381      418136 :   unsigned char *res = (unsigned char*) GSTR(str);
    1382      418136 :   long llz = mpn_get_str(res, 10, LIMBS(icopy(x)), NLIMBS(x));
    1383             :   long lz;
    1384             :   ulong *z;
    1385             :   long i, j;
    1386             :   unsigned char *t;
    1387      418136 :   while (!*res) {res++; llz--;} /*Strip leading zeros*/
    1388      418136 :   lz  = (8+llz)/9;
    1389      418136 :   z = (ulong*)new_chunk(1+lz);
    1390      418136 :   t=res+llz+9;
    1391      832820 :   for(i=0;i<llz-8;i+=9)
    1392             :   {
    1393             :     ulong s;
    1394      414684 :     t-=18;
    1395      414684 :     s=*t++;
    1396     3732156 :     for (j=1; j<9;j++)
    1397     3317472 :       s=10*s+*t++;
    1398      414684 :     *z++=s;
    1399             :   }
    1400      418136 :   if (i<llz)
    1401             :   {
    1402      414417 :     unsigned char *t = res;
    1403      414417 :     ulong s=*t++;
    1404     1162137 :     for (j=i+1; j<llz;j++)
    1405      747720 :       s=10*s+*t++;
    1406      414417 :     *z++=s;
    1407             :   }
    1408      418136 :   *l = lz;
    1409      418136 :   return z;
    1410             : }

Generated by: LCOV version 1.13