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/none - mp_indep.c (source / functions) Hit Total Coverage
Test: PARI/GP v2.14.0 lcov report (development 27713-af4b496856) Lines: 540 572 94.4 %
Date: 2022-05-21 10:32:40 Functions: 52 53 98.1 %
Legend: Lines: hit not hit

          Line data    Source code
       1             : #line 2 "../src/kernel/none/mp_indep.c"
       2             : /* Copyright (C) 2000  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             : /* Find c such that 1=c*b mod 2^BITS_IN_LONG, assuming b odd (unchecked) */
      17             : ulong
      18    48697510 : invmod2BIL(ulong b)
      19             : {
      20             :   static int tab[] = { 0, 0, 0, 8, 0, 8, 0, 0 };
      21    48697510 :   ulong x = b + tab[b & 7]; /* b^(-1) mod 2^4 */
      22             : 
      23             :   /* Newton applied to 1/x - b = 0 */
      24             : #ifdef LONG_IS_64BIT
      25    48697510 :   x = x*(2-b*x); /* one more pass necessary */
      26             : #endif
      27    48697510 :   x = x*(2-b*x);
      28    48697510 :   x = x*(2-b*x); return x*(2-b*x);
      29             : }
      30             : 
      31             : void
      32   847517233 : affrr(GEN x, GEN y)
      33             : {
      34   847517233 :   long i, lx, ly = lg(y);
      35   847517233 :   if (!signe(x))
      36             :   {
      37      278327 :     y[1] = evalexpo(minss(expo(x), -bit_accuracy(ly)));
      38      278327 :     return;
      39             :   }
      40   847238906 :   y[1] = x[1]; lx = lg(x);
      41   847238906 :   if (lx <= ly)
      42             :   {
      43  3964098404 :     for (i=2; i<lx; i++) y[i]=x[i];
      44   802886975 :     for (   ; i<ly; i++) y[i]=0;
      45   688763597 :     return;
      46             :   }
      47   790304972 :   for (i=2; i<ly; i++) y[i]=x[i];
      48             :   /* lx > ly: round properly */
      49   158475309 :   if (x[ly] & HIGHBIT) roundr_up_ip(y, ly);
      50             : }
      51             : 
      52             : GEN
      53    58701386 : trunc2nr(GEN x, long n)
      54             : {
      55             :   long ex;
      56    58701386 :   if (!signe(x)) return gen_0;
      57    58195897 :   ex = expo(x) + n; if (ex < 0) return gen_0;
      58    55422674 :   return mantissa2nr(x, ex - bit_prec(x) + 1);
      59             : }
      60             : 
      61             : /* x a t_REAL, x = i/2^e, i a t_INT */
      62             : GEN
      63    59951335 : mantissa_real(GEN x, long *e)
      64             : {
      65    59951335 :   *e = bit_prec(x)-1-expo(x);
      66    59951281 :   return mantissa2nr(x, 0);
      67             : }
      68             : 
      69             : GEN
      70   926988792 : mului(ulong x, GEN y)
      71             : {
      72   926988792 :   long s = signe(y);
      73             :   GEN z;
      74             : 
      75   926988792 :   if (!s || !x) return gen_0;
      76   769394795 :   z = muluispec(x, y+2, lgefint(y)-2);
      77   766958779 :   setsigne(z,s); return z;
      78             : }
      79             : 
      80             : GEN
      81   572001687 : mulsi(long x, GEN y)
      82             : {
      83   572001687 :   long s = signe(y);
      84             :   GEN z;
      85             : 
      86   572001687 :   if (!s || !x) return gen_0;
      87   361848440 :   if (x<0) { s = -s; x = -x; }
      88   361848440 :   z = muluispec((ulong)x, y+2, lgefint(y)-2);
      89   361837340 :   setsigne(z,s); return z;
      90             : }
      91             : 
      92             : GEN
      93   195546796 : mulss(long x, long y)
      94             : {
      95             :   long p1;
      96             :   LOCAL_HIREMAINDER;
      97             : 
      98   195546796 :   if (!x || !y) return gen_0;
      99   195362120 :   if (x<0) {
     100      339657 :     x = -x;
     101      339657 :     if (y<0) { y = -y; p1 = mulll(x,y); return uutoi(hiremainder, p1); }
     102      225636 :     p1 = mulll(x,y); return uutoineg(hiremainder, p1);
     103             :   } else {
     104   195022463 :     if (y<0) { y = -y; p1 = mulll(x,y); return uutoineg(hiremainder, p1); }
     105   195018309 :     p1 = mulll(x,y); return uutoi(hiremainder, p1);
     106             :   }
     107             : }
     108             : GEN
     109     1663319 : sqrs(long x)
     110             : {
     111             :   long p1;
     112             :   LOCAL_HIREMAINDER;
     113             : 
     114     1663319 :   if (!x) return gen_0;
     115     1662395 :   if (x<0) x = -x;
     116     1662395 :   p1 = mulll(x,x); return uutoi(hiremainder, p1);
     117             : }
     118             : GEN
     119  3614120956 : muluu(ulong x, ulong y)
     120             : {
     121             :   long p1;
     122             :   LOCAL_HIREMAINDER;
     123             : 
     124  3614120956 :   if (!x || !y) return gen_0;
     125  3614764996 :   p1 = mulll(x,y); return uutoi(hiremainder, p1);
     126             : }
     127             : GEN
     128   529471691 : sqru(ulong x)
     129             : {
     130             :   long p1;
     131             :   LOCAL_HIREMAINDER;
     132             : 
     133   529471691 :   if (!x) return gen_0;
     134   529140995 :   p1 = mulll(x,x); return uutoi(hiremainder, p1);
     135             : }
     136             : 
     137             : /* assume x > 1, y != 0. Return u * y with sign s */
     138             : static GEN
     139   630117896 : mulur_2(ulong x, GEN y, long s)
     140             : {
     141   630117896 :   long m, sh, i, lx = lg(y), e = expo(y);
     142   630117896 :   GEN z = cgetr(lx);
     143             :   ulong garde;
     144             :   LOCAL_HIREMAINDER;
     145             : 
     146   629794854 :   y--; garde = mulll(x,y[lx]);
     147  2934068111 :   for (i=lx-1; i>=3; i--) z[i]=addmul(x,y[i]);
     148   629794854 :   z[2]=hiremainder; /* != 0 since y normalized and |x| > 1 */
     149   629794854 :   sh = bfffo(hiremainder); m = BITS_IN_LONG-sh;
     150   629794854 :   if (sh) shift_left(z,z, 2,lx-1, garde,sh);
     151   630005928 :   z[1] = evalsigne(s) | evalexpo(m+e);
     152   630000232 :   if ((garde << sh) & HIGHBIT) roundr_up_ip(z, lx);
     153   629992288 :   return z;
     154             : }
     155             : 
     156             : INLINE GEN
     157      963513 : mul0r(GEN x)
     158             : {
     159      963513 :   long l = lg(x), e = expo(x);
     160      963513 :   e = (l > 2)? -prec2nbits(l) + e: (e < 0? 2*e: 0);
     161      963512 :   return real_0_bit(e);
     162             : }
     163             : /* lg(x) > 2 */
     164             : INLINE GEN
     165      171865 : div0r(GEN x) {
     166      171865 :   long l = lg(x), e = expo(x);
     167      171865 :   return real_0_bit(-prec2nbits(l) - e);
     168             : }
     169             : 
     170             : GEN
     171   117436592 : mulsr(long x, GEN y)
     172             : {
     173             :   long s;
     174             : 
     175   117436592 :   if (!x) return mul0r(y);
     176   117436544 :   s = signe(y);
     177   117436544 :   if (!s)
     178             :   {
     179      283287 :     if (x < 0) x = -x;
     180      283287 :     return real_0_bit( expo(y) + expu(x) );
     181             :   }
     182   117153257 :   if (x==1)  return rcopy(y);
     183   109434657 :   if (x==-1) return negr(y);
     184   107707516 :   if (x < 0)
     185    34620068 :     return mulur_2((ulong)-x, y, -s);
     186             :   else
     187    73087448 :     return mulur_2((ulong)x, y, s);
     188             : }
     189             : 
     190             : GEN
     191   816863265 : mulur(ulong x, GEN y)
     192             : {
     193             :   long s;
     194             : 
     195   816863265 :   if (!x) return mul0r(y);
     196   816863258 :   s = signe(y);
     197   816863258 :   if (!s) return real_0_bit( expo(y) + expu(x) );
     198   807279450 :   if (x==1) return rcopy(y);
     199   522316704 :   return mulur_2(x, y, s);
     200             : }
     201             : 
     202             : INLINE void
     203  3774300841 : mulrrz_end(GEN z, GEN hi, long lz, long sz, long ez, ulong garde)
     204             : {
     205             :   long i;
     206  3774300841 :   if (hi[2] < 0)
     207             :   {
     208  1866359530 :     if (z != hi)
     209  1902925637 :       for (i=2; i<lz ; i++) z[i] = hi[i];
     210  1866359530 :     ez++;
     211             :   }
     212             :   else
     213             :   {
     214  1907941311 :     shift_left(z,hi,2,lz-1, garde, 1);
     215  1908361384 :     garde <<= 1;
     216             :   }
     217  3774720914 :   if (garde & HIGHBIT)
     218             :   { /* round to nearest */
     219  1895130149 :     i = lz; do ((ulong*)z)[--i]++; while (i>1 && z[i]==0);
     220  1857515765 :     if (i == 1) { z[2] = (long)HIGHBIT; ez++; }
     221             :   }
     222  3774720914 :   z[1] = evalsigne(sz)|evalexpo(ez);
     223  3771849434 : }
     224             : /* mulrrz_end for lz = 3, minor simplifications. z[2]=hiremainder from mulll */
     225             : INLINE void
     226   651111417 : mulrrz_3end(GEN z, long sz, long ez, ulong garde)
     227             : {
     228   651111417 :   if (z[2] < 0)
     229             :   { /* z2 < (2^BIL-1)^2 / 2^BIL, hence z2+1 != 0 */
     230   306074827 :     if (garde & HIGHBIT) z[2]++; /* round properly */
     231   306074827 :     ez++;
     232             :   }
     233             :   else
     234             :   {
     235   345036590 :     uel(z,2) = (uel(z,2)<<1) | (garde>>(BITS_IN_LONG-1));
     236   345036590 :     if (garde & (1UL<<(BITS_IN_LONG-2)))
     237             :     {
     238   145528952 :       uel(z,2)++; /* round properly, z2+1 can overflow */
     239   145528952 :       if (!uel(z,2)) { uel(z,2) = HIGHBIT; ez++; }
     240             :     }
     241             :   }
     242   651111417 :   z[1] = evalsigne(sz)|evalexpo(ez);
     243   650666338 : }
     244             : 
     245             : /* set z <-- x^2 != 0, floating point multiplication.
     246             :  * lz = lg(z) = lg(x) */
     247             : INLINE void
     248   497132212 : sqrz_i(GEN z, GEN x, long lz)
     249             : {
     250   497132212 :   long ez = 2*expo(x);
     251             :   long i, j, lzz, p1;
     252             :   ulong garde;
     253             :   GEN x1;
     254             :   LOCAL_HIREMAINDER;
     255             :   LOCAL_OVERFLOW;
     256             : 
     257   497132212 :   if (lz > SQRR_SQRI_LIMIT)
     258             :   {
     259    46232053 :     pari_sp av = avma;
     260    46232053 :     GEN hi = sqrispec_mirror(x+2, lz-2);
     261    46232053 :     mulrrz_end(z, hi, lz, 1, ez, hi[lz]);
     262    46232053 :     set_avma(av); return;
     263             :   }
     264   450900159 :   if (lz == 3)
     265             :   {
     266    92647356 :     garde = mulll(x[2],x[2]);
     267    92647356 :     z[2] = hiremainder;
     268    92647356 :     mulrrz_3end(z, 1, ez, garde);
     269    92675332 :     return;
     270             :   }
     271             : 
     272   358252803 :   lzz = lz-1; p1 = x[lzz];
     273   358252803 :   if (p1)
     274             :   {
     275   337668869 :     (void)mulll(p1,x[3]);
     276   337668869 :     garde = addmul(p1,x[2]);
     277   337668869 :     z[lzz] = hiremainder;
     278             :   }
     279             :   else
     280             :   {
     281    20583934 :     garde = 0;
     282    20583934 :     z[lzz] = 0;
     283             :   }
     284  1340324265 :   for (j=lz-2, x1=x-j; j>=3; j--)
     285             :   {
     286   982071462 :     p1 = x[j]; x1++;
     287   982071462 :     if (p1)
     288             :     {
     289   948011884 :       (void)mulll(p1,x1[lz+1]);
     290   948011884 :       garde = addll(addmul(p1,x1[lz]), garde);
     291  4762560991 :       for (i=lzz; i>j; i--)
     292             :       {
     293  3814549107 :         hiremainder += overflow;
     294  3814549107 :         z[i] = addll(addmul(p1,x1[i]), z[i]);
     295             :       }
     296   948011884 :       z[j] = hiremainder+overflow;
     297             :     }
     298    34059578 :     else z[j]=0;
     299             :   }
     300   358252803 :   p1 = x[2]; x1++;
     301   358252803 :   garde = addll(mulll(p1,x1[lz]), garde);
     302  1698997031 :   for (i=lzz; i>2; i--)
     303             :   {
     304  1340744228 :     hiremainder += overflow;
     305  1340744228 :     z[i] = addll(addmul(p1,x1[i]), z[i]);
     306             :   }
     307   358252803 :   z[2] = hiremainder+overflow;
     308   358252803 :   mulrrz_end(z, z, lz, 1, ez, garde);
     309             : }
     310             : 
     311             : /* lz "large" = lg(y) = lg(z), lg(x) > lz if flag = 1 and >= if flag = 0 */
     312             : INLINE void
     313    51423579 : mulrrz_int(GEN z, GEN x, GEN y, long lz, long flag, long sz)
     314             : {
     315    51423579 :   pari_sp av = avma;
     316    51423579 :   GEN hi = muliispec_mirror(y+2, x+2, lz+flag-2, lz-2);
     317    51423579 :   mulrrz_end(z, hi, lz, sz, expo(x)+expo(y), hi[lz]);
     318    51423579 :   set_avma(av);
     319    51423579 : }
     320             : 
     321             : /* lz = 3 */
     322             : INLINE void
     323   558586350 : mulrrz_3(GEN z, GEN x, GEN y, long flag, long sz)
     324             : {
     325             :   ulong garde;
     326             :   LOCAL_HIREMAINDER;
     327   558586350 :   if (flag)
     328             :   {
     329    72691928 :     (void)mulll(x[2],y[3]);
     330    72691928 :     garde = addmul(x[2],y[2]);
     331             :   }
     332             :   else
     333   485894422 :     garde = mulll(x[2],y[2]);
     334   558586350 :   z[2] = hiremainder;
     335   558586350 :   mulrrz_3end(z, sz, expo(x)+expo(y), garde);
     336   558779846 : }
     337             : 
     338             : /* set z <-- x*y, floating point multiplication. Trailing 0s for x are
     339             :  * treated efficiently (important application: mulir).
     340             :  * lz = lg(z) = lg(x) <= ly <= lg(y), sz = signe(z). flag = lg(x) < lg(y) */
     341             : INLINE void
     342  3881029273 : mulrrz_i(GEN z, GEN x, GEN y, long lz, long flag, long sz)
     343             : {
     344             :   long ez, i, j, lzz, p1;
     345             :   ulong garde;
     346             :   GEN y1;
     347             :   LOCAL_HIREMAINDER;
     348             :   LOCAL_OVERFLOW;
     349             : 
     350  3881029273 :   if (x == y) { sqrz_i(z,x,lz); return; }
     351  3881029273 :   if (lz > MULRR_MULII_LIMIT) { mulrrz_int(z,x,y,lz,flag,sz); return; }
     352  3829605694 :   if (lz == 3) { mulrrz_3(z,x,y,flag,sz); return; }
     353  3271246517 :   ez = expo(x) + expo(y);
     354  3271246517 :   if (flag) { (void)mulll(x[2],y[lz]); garde = hiremainder; } else garde = 0;
     355  3271246517 :   lzz=lz-1; p1=x[lzz];
     356  3271246517 :   if (p1)
     357             :   {
     358  3159522699 :     (void)mulll(p1,y[3]);
     359  3159522699 :     garde = addll(addmul(p1,y[2]), garde);
     360  3159522699 :     z[lzz] = overflow+hiremainder;
     361             :   }
     362   111723818 :   else z[lzz]=0;
     363 12875200943 :   for (j=lz-2, y1=y-j; j>=3; j--)
     364             :   {
     365  9603954426 :     p1 = x[j]; y1++;
     366  9603954426 :     if (p1)
     367             :     {
     368  9342451954 :       (void)mulll(p1,y1[lz+1]);
     369  9342451954 :       garde = addll(addmul(p1,y1[lz]), garde);
     370 52089340594 :       for (i=lzz; i>j; i--)
     371             :       {
     372 42746888640 :         hiremainder += overflow;
     373 42746888640 :         z[i] = addll(addmul(p1,y1[i]), z[i]);
     374             :       }
     375  9342451954 :       z[j] = hiremainder+overflow;
     376             :     }
     377   261502472 :     else z[j]=0;
     378             :   }
     379  3271246517 :   p1 = x[2]; y1++;
     380  3271246517 :   garde = addll(mulll(p1,y1[lz]), garde);
     381 16160831475 :   for (i=lzz; i>2; i--)
     382             :   {
     383 12889584958 :     hiremainder += overflow;
     384 12889584958 :     z[i] = addll(addmul(p1,y1[i]), z[i]);
     385             :   }
     386  3271246517 :   z[2] = hiremainder+overflow;
     387  3271246517 :   mulrrz_end(z, z, lz, sz, ez, garde);
     388             : }
     389             : 
     390             : GEN
     391  3892708491 : mulrr(GEN x, GEN y)
     392             : {
     393             :   long flag, ly, lz, sx, sy;
     394             :   GEN z;
     395             : 
     396  3892708491 :   if (x == y) return sqrr(x);
     397  3891478961 :   sx = signe(x); if (!sx) return real_0_bit(expo(x) + expo(y));
     398  3853769420 :   sy = signe(y); if (!sy) return real_0_bit(expo(x) + expo(y));
     399  3826800563 :   if (sy < 0) sx = -sx;
     400  3826800563 :   lz = lg(x);
     401  3826800563 :   ly = lg(y);
     402  3826800563 :   if (lz > ly) { lz = ly; swap(x, y); flag = 1; } else flag = (lz != ly);
     403  3826800563 :   z = cgetr(lz);
     404  3822363102 :   mulrrz_i(z, x,y, lz,flag, sx);
     405  3827408506 :   return z;
     406             : }
     407             : 
     408             : GEN
     409   513493581 : sqrr(GEN x)
     410             : {
     411   513493581 :   long lz, sx = signe(x);
     412             :   GEN z;
     413             : 
     414   513493581 :   if (!sx) return real_0_bit(2*expo(x));
     415   497376352 :   lz = lg(x); z = cgetr(lz);
     416   497143008 :   sqrz_i(z, x, lz);
     417   497292929 :   return z;
     418             : }
     419             : 
     420             : GEN
     421   863269541 : mulir(GEN x, GEN y)
     422             : {
     423   863269541 :   long sx = signe(x), sy;
     424   863269541 :   if (!sx) return mul0r(y);
     425   862306083 :   if (lgefint(x) == 3) {
     426   766432204 :     GEN z = mulur(uel(x,2), y);
     427   766073977 :     if (sx < 0) togglesign(z);
     428   766079898 :     return z;
     429             :   }
     430    95873879 :   sy = signe(y);
     431    95873879 :   if (!sy) return real_0_bit(expi(x) + expo(y));
     432    95510230 :   if (sy < 0) sx = -sx;
     433             :   {
     434    95510230 :     long lz = lg(y), lx = lgefint(x);
     435    95510230 :     GEN hi, z = cgetr(lz);
     436    95589655 :     pari_sp av = avma;
     437    95589655 :     if (lx < (lz>>1) || (lx < lz && lz > MULRR_MULII_LIMIT))
     438             :     { /* size mantissa of x < half size of mantissa z, or lx < lz so large
     439             :        * that mulrr will call mulii anyway: mulii */
     440    36680473 :       x = itor(x, lx);
     441    36680943 :       hi = muliispec_mirror(y+2, x+2, lz-2, lx-2);
     442    36680951 :       mulrrz_end(z, hi, lz, sx, expo(x)+expo(y), hi[lz]);
     443             :     }
     444             :     else /* dubious: complete x with 0s and call mulrr */
     445    58909182 :       mulrrz_i(z, itor(x,lz), y, lz, 0, sx);
     446    95594170 :     set_avma(av); return z;
     447             :   }
     448             : }
     449             : 
     450             : /* x + y*z, generic. If lgefint(z) <= 3, caller should use faster variants  */
     451             : static GEN
     452    94218327 : addmulii_gen(GEN x, GEN y, GEN z, long lz)
     453             : {
     454    94218327 :   long lx = lgefint(x), ly;
     455             :   pari_sp av;
     456             :   GEN t;
     457    94218327 :   if (lx == 2) return mulii(z,y);
     458    91465563 :   ly = lgefint(y);
     459    91465563 :   if (ly == 2) return icopy(x); /* y = 0, wasteful copy */
     460    90914673 :   av = avma; (void)new_chunk(lx+ly+lz); /*HACK*/
     461    90915420 :   t = mulii(z, y);
     462    90911380 :   set_avma(av); return addii(t,x);
     463             : }
     464             : /* x + y*z, lgefint(z) == 3 */
     465             : static GEN
     466   643145754 : addmulii_lg3(GEN x, GEN y, GEN z)
     467             : {
     468   643145754 :   long s = signe(z), lx, ly;
     469   643145754 :   ulong w = z[2];
     470             :   pari_sp av;
     471             :   GEN t;
     472   643145754 :   if (w == 1) return (s > 0)? addii(x,y): subii(x,y); /* z = +- 1 */
     473   529352482 :   lx = lgefint(x);
     474   529352482 :   ly = lgefint(y);
     475   529352482 :   if (lx == 2)
     476             :   { /* x = 0 */
     477    92968531 :     if (ly == 2) return gen_0;
     478    56703422 :     t = muluispec(w, y+2, ly-2);
     479    56650085 :     if (signe(y) < 0) s = -s;
     480    56650085 :     setsigne(t, s); return t;
     481             :   }
     482   436383951 :   if (ly == 2) return icopy(x); /* y = 0, wasteful copy */
     483   399969684 :   av = avma; (void)new_chunk(1+lx+ly);/*HACK*/
     484   400681046 :   t = muluispec(w, y+2, ly-2);
     485   400059201 :   if (signe(y) < 0) s = -s;
     486   400059201 :   setsigne(t, s);
     487   400059201 :   set_avma(av); return addii(x,t);
     488             : }
     489             : /* x + y*z */
     490             : GEN
     491   209708568 : addmulii(GEN x, GEN y, GEN z)
     492             : {
     493   209708568 :   long lz = lgefint(z);
     494   209708568 :   switch(lz)
     495             :   {
     496      553105 :     case 2: return icopy(x); /* z = 0, wasteful copy */
     497   164021047 :     case 3: return addmulii_lg3(x, y, z);
     498    45134416 :     default:return addmulii_gen(x, y, z, lz);
     499             :   }
     500             : }
     501             : /* x + y*z, returns x itself and not a copy when y*z = 0 */
     502             : GEN
     503  1593222158 : addmulii_inplace(GEN x, GEN y, GEN z)
     504             : {
     505             :   long lz;
     506  1593222158 :   if (lgefint(y) == 2) return x;
     507   526008734 :   lz = lgefint(z);
     508   526008734 :   switch(lz)
     509             :   {
     510        4538 :     case 2: return x;
     511   479347132 :     case 3: return addmulii_lg3(x, y, z);
     512    46657064 :     default:return addmulii_gen(x, y, z, lz);
     513             :   }
     514             : }
     515             : 
     516             : /* written by Bruno Haible following an idea of Robert Harley */
     517             : long
     518  2361811524 : vals(ulong z)
     519             : {
     520             :   static char tab[64]={-1,0,1,12,2,6,-1,13,3,-1,7,-1,-1,-1,-1,14,10,4,-1,-1,8,-1,-1,25,-1,-1,-1,-1,-1,21,27,15,31,11,5,-1,-1,-1,-1,-1,9,-1,-1,24,-1,-1,20,26,30,-1,-1,-1,-1,23,-1,19,29,-1,22,18,28,17,16,-1};
     521             : #ifdef LONG_IS_64BIT
     522             :   long s;
     523             : #endif
     524             : 
     525  2361811524 :   if (!z) return -1;
     526             : #ifdef LONG_IS_64BIT
     527  2162111934 :   if (! (z&0xffffffff)) { s = 32; z >>=32; } else s = 0;
     528             : #endif
     529  2361811524 :   z |= ~z + 1;
     530  2361811524 :   z += z << 4;
     531  2361811524 :   z += z << 6;
     532  2361811524 :   z ^= z << 16; /* or  z -= z<<16 */
     533             : #ifdef LONG_IS_64BIT
     534  2162111934 :   return s + tab[(z&0xffffffff)>>26];
     535             : #else
     536   199699590 :   return tab[z>>26];
     537             : #endif
     538             : }
     539             : 
     540             : GEN
     541          98 : divsi(long x, GEN y)
     542             : {
     543          98 :   long p1, s = signe(y);
     544             :   LOCAL_HIREMAINDER;
     545             : 
     546          98 :   if (!s) pari_err_INV("divsi",gen_0);
     547          98 :   if (!x || lgefint(y)>3 || ((long)y[2])<0) return gen_0;
     548          98 :   hiremainder=0; p1=divll(labs(x),y[2]);
     549          98 :   if (x<0) { hiremainder = -((long)hiremainder); p1 = -p1; }
     550          98 :   if (s<0) p1 = -p1;
     551          98 :   return stoi(p1);
     552             : }
     553             : 
     554             : GEN
     555     3415501 : divir(GEN x, GEN y)
     556             : {
     557             :   GEN z;
     558     3415501 :   long ly = lg(y), lx = lgefint(x);
     559             :   pari_sp av;
     560             : 
     561     3415501 :   if (ly == 2) pari_err_INV("divir",y);
     562     3415507 :   if (lx == 2) return div0r(y);
     563     3243642 :   if (lx == 3) {
     564     2006487 :     z = divur(x[2], y);
     565     2006480 :     if (signe(x) < 0) togglesign(z);
     566     2006480 :     return z;
     567             :   }
     568     1237155 :   z = cgetr(ly); av = avma;
     569     1237155 :   affrr(divrr(itor(x, ly+1), y), z);
     570     1237155 :   set_avma(av); return z;
     571             : }
     572             : 
     573             : GEN
     574     2315109 : divur(ulong x, GEN y)
     575             : {
     576             :   pari_sp av;
     577     2315109 :   long ly = lg(y);
     578             :   GEN z;
     579             : 
     580     2315109 :   if (ly == 2) pari_err_INV("divur",y);
     581     2315110 :   if (!x) return div0r(y);
     582     2315110 :   if (ly > INVNEWTON_LIMIT) {
     583         183 :     av = avma; z = invr(y);
     584         183 :     if (x == 1) return z;
     585         183 :     return gerepileuptoleaf(av, mulur(x, z));
     586             :   }
     587     2314927 :   z = cgetr(ly); av = avma;
     588     2314875 :   affrr(divrr(utor(x,ly+1), y), z);
     589     2314891 :   set_avma(av); return z;
     590             : }
     591             : 
     592             : GEN
     593         315 : divsr(long x, GEN y)
     594             : {
     595             :   pari_sp av;
     596         315 :   long ly = lg(y);
     597             :   GEN z;
     598             : 
     599         315 :   if (ly == 2) pari_err_INV("divsr",y);
     600         315 :   if (!x) return div0r(y);
     601         315 :   if (ly > INVNEWTON_LIMIT) {
     602           0 :     av = avma; z = invr(y);
     603           0 :     if (x == 1) return z;
     604           0 :     if (x ==-1) { togglesign(z); return z; }
     605           0 :     return gerepileuptoleaf(av, mulsr(x, z));
     606             :   }
     607         315 :   z = cgetr(ly); av = avma;
     608         315 :   affrr(divrr(stor(x,ly+1), y), z);
     609         315 :   set_avma(av); return z;
     610             : }
     611             : 
     612             : /* returns 1/y, assume y != 0 */
     613             : static GEN
     614    34740960 : invr_basecase(GEN y)
     615             : {
     616    34740960 :   long ly = lg(y);
     617    34740960 :   GEN z = cgetr(ly);
     618    34732330 :   pari_sp av = avma;
     619    34732330 :   affrr(divrr(real_1(ly+1), y), z);
     620    34738604 :   set_avma(av); return z;
     621             : }
     622             : /* returns 1/b, Newton iteration */
     623             : GEN
     624    34740939 : invr(GEN b)
     625             : {
     626    34740939 :   const long s = 6;
     627    34740939 :   long i, p, l = lg(b);
     628             :   GEN x, a;
     629             :   ulong mask;
     630             : 
     631    34740939 :   if (l <= maxss(INVNEWTON_LIMIT, (1L<<s) + 2)) {
     632    34739107 :     if (l == 2) pari_err_INV("invr",b);
     633    34739107 :     return invr_basecase(b);
     634             :   }
     635        1804 :   mask = quadratic_prec_mask(l-2);
     636       13090 :   for(i=0, p=1; i<s; i++) { p <<= 1; if (mask & 1) p--; mask >>= 1; }
     637        1870 :   x = cgetr(l);
     638        1870 :   a = rcopy(b); a[1] = _evalexpo(0) | evalsigne(1);
     639        1870 :   affrr(invr_basecase(rtor(a, p+2)), x);
     640        5128 :   while (mask > 1)
     641             :   {
     642        3258 :     p <<= 1; if (mask & 1) p--;
     643        3258 :     mask >>= 1;
     644        3258 :     setlg(a, p + 2);
     645        3258 :     setlg(x, p + 2);
     646             :     /* TODO: mulrr(a,x) should be a half product (the higher half is known).
     647             :      * mulrr(x, ) already is */
     648        3258 :     affrr(addrr(x, mulrr(x, subsr(1, mulrr(a,x)))), x);
     649        3258 :     set_avma((pari_sp)a);
     650             :   }
     651        1870 :   x[1] = (b[1] & SIGNBITS) | evalexpo(expo(x)-expo(b));
     652        1870 :   set_avma((pari_sp)x); return x;
     653             : }
     654             : 
     655             : GEN
     656  2188014534 : modii(GEN x, GEN y)
     657             : {
     658  2188014534 :   switch(signe(x))
     659             :   {
     660   458554910 :     case 0: return gen_0;
     661  1299528825 :     case 1: return remii(x,y);
     662   429930799 :     default:
     663             :     {
     664   429930799 :       pari_sp av = avma;
     665   429930799 :       (void)new_chunk(lgefint(y));
     666   434882631 :       x = remii(x,y); set_avma(av);
     667   434792124 :       if (x==gen_0) return x;
     668   395792979 :       return subiispec(y+2,x+2,lgefint(y)-2,lgefint(x)-2);
     669             :     }
     670             :   }
     671             : }
     672             : 
     673             : void
     674      648508 : modiiz(GEN x, GEN y, GEN z)
     675             : {
     676      648508 :   const pari_sp av = avma;
     677      648508 :   affii(modii(x,y),z); set_avma(av);
     678      648494 : }
     679             : 
     680             : GEN
     681     6108974 : divrs(GEN x, long y)
     682             : {
     683             :   GEN z;
     684     6108974 :   if (y < 0)
     685             :   {
     686     3706848 :     z = divru(x, (ulong)-y);
     687     3706778 :     togglesign(z);
     688             :   }
     689             :   else
     690     2402126 :     z = divru(x, (ulong)y);
     691     6108916 :   return z;
     692             : }
     693             : 
     694             : GEN
     695   674286789 : divru(GEN x, ulong y)
     696             : {
     697   674286789 :   long i, lx, sh, e, s = signe(x);
     698             :   ulong garde;
     699             :   GEN z;
     700             :   LOCAL_HIREMAINDER;
     701             : 
     702   674286789 :   if (!y) pari_err_INV("divru",gen_0);
     703   674325179 :   if (!s) return real_0_bit(expo(x) - expu(y));
     704   673990187 :   if (!(y & (y-1))) /* power of 2 */
     705             :   {
     706    60267054 :     if (y == 1) return rcopy(x);
     707    58514676 :     return shiftr(x, -expu(y));
     708             :   }
     709   613723133 :   e = expo(x);
     710   613723133 :   lx = lg(x);
     711   613723133 :   z = cgetr(lx);
     712   613325239 :   if (lx == 3)
     713             :   {
     714   111772348 :     if (y <= uel(x,2))
     715             :     {
     716   111772102 :       hiremainder = 0;
     717   111772102 :       z[2] = divll(x[2],y);
     718             :       /* we may have hiremainder != 0 ==> garde */
     719   111772102 :       garde = divll(0,y);
     720             :     }
     721             :     else
     722             :     {
     723         246 :       hiremainder = x[2];
     724         246 :       z[2] = divll(0,y);
     725         246 :       garde = hiremainder;
     726         246 :       e -= BITS_IN_LONG;
     727             :     }
     728             :   }
     729             :   else
     730             :   {
     731   501552891 :     ulong yp = get_Fl_red(y);
     732   501933478 :     if (y <= uel(x,2))
     733             :     {
     734   501972972 :       hiremainder = 0;
     735  4781638754 :       for (i=2; i<lx; i++) z[i] = divll_pre(x[i],y,yp);
     736             :       /* we may have hiremainder != 0 ==> garde */
     737   502026565 :       garde = divll_pre(0,y,yp);
     738             :     }
     739             :     else
     740             :     {
     741        3224 :       long l = lx-1;
     742        3224 :       hiremainder = x[2];
     743       56835 :       for (i=2; i<l; i++) z[i] = divll_pre(x[i+1],y,yp);
     744        3224 :       z[i] = divll_pre(0,y,yp);
     745        3756 :       garde = hiremainder;
     746        3756 :       e -= BITS_IN_LONG;
     747             :     }
     748             :   }
     749   614271946 :   sh=bfffo(z[2]); /* z[2] != 0 */
     750   614271946 :   if (sh) shift_left(z,z, 2,lx-1, garde,sh);
     751   614628504 :   z[1] = evalsigne(s) | evalexpo(e-sh);
     752   614063921 :   if ((garde << sh) & HIGHBIT) roundr_up_ip(z, lx);
     753   614047403 :   return z;
     754             : }
     755             : 
     756             : GEN
     757   133878153 : truedvmdii(GEN x, GEN y, GEN *z)
     758             : {
     759             :   pari_sp av;
     760             :   GEN r, q, *gptr[2];
     761   133878153 :   if (!is_bigint(y)) return truedvmdis(x, itos(y), z);
     762     2174257 :   if (z == ONLY_REM) return modii(x,y);
     763             : 
     764     2174257 :   av = avma;
     765     2174257 :   q = dvmdii(x,y,&r); /* assume that r is last on stack */
     766     2174239 :   switch(signe(r))
     767             :   {
     768      712128 :     case 0:
     769      712128 :       if (z) *z = gen_0;
     770      712128 :       return q;
     771      884041 :     case 1:
     772      884041 :       if (z) *z = r; else cgiv(r);
     773      884041 :       return q;
     774      578097 :     case -1: break;
     775             :   }
     776      578070 :   q = addis(q, -signe(y));
     777      578094 :   if (!z) return gerepileuptoint(av, q);
     778             : 
     779      453137 :   *z = subiispec(y+2,r+2, lgefint(y)-2,lgefint(r)-2);
     780      453136 :   gptr[0]=&q; gptr[1]=z; gerepilemanysp(av,(pari_sp)r,gptr,2);
     781      456289 :   return q;
     782             : }
     783             : GEN
     784   132132676 : truedvmdis(GEN x, long y, GEN *z)
     785             : {
     786   132132676 :   pari_sp av = avma;
     787             :   long r;
     788             :   GEN q;
     789             : 
     790   132132676 :   if (z == ONLY_REM) return modis(x, y);
     791   132132676 :   q = divis_rem(x,y,&r);
     792             : 
     793   132084364 :   if (r >= 0)
     794             :   {
     795   122266232 :     if (z) *z = utoi(r);
     796   122263908 :     return q;
     797             :   }
     798     9818132 :   q = gerepileuptoint(av, addis(q, (y < 0)? 1: -1));
     799     9837533 :   if (z) *z = utoi(r + labs(y));
     800     9837450 :   return q;
     801             : }
     802             : GEN
     803     6327397 : truedvmdsi(long x, GEN y, GEN *z)
     804             : {
     805             :   long q, r;
     806     6327397 :   if (z == ONLY_REM) return modsi(x, y);
     807     6327397 :   q = sdivsi_rem(x,y,&r);
     808     6327397 :   if (r >= 0) {
     809     6327397 :     if (z) *z = utoi(r);
     810     6327397 :     return stoi(q);
     811             :   }
     812           0 :   q = q - signe(y);
     813           0 :   if (!z) return stoi(q);
     814             : 
     815           0 :   *z = subiuspec(y+2,(ulong)-r, lgefint(y)-2);
     816           0 :   return stoi(q);
     817             : }
     818             : 
     819             : /* 2^n = shifti(gen_1, n) */
     820             : GEN
     821   105083396 : int2n(long n) {
     822             :   long i, m, l;
     823             :   GEN z;
     824   105083396 :   if (n < 0) return gen_0;
     825   105064797 :   if (n == 0) return gen_1;
     826             : 
     827   103641652 :   l = dvmdsBIL(n, &m) + 3;
     828   103639050 :   z = cgetipos(l);
     829   505625887 :   for (i = 2; i < l; i++) z[i] = 0;
     830   103590450 :   *int_MSW(z) = 1UL << m; return z;
     831             : }
     832             : /* To avoid problems when 2^(BIL-1) < n. Overflow cleanly, where int2n
     833             :  * returns gen_0 */
     834             : GEN
     835    23925319 : int2u(ulong n) {
     836             :   ulong i, m, l;
     837             :   GEN z;
     838    23925319 :   if (n == 0) return gen_1;
     839             : 
     840    23925319 :   l = dvmduBIL(n, &m) + 3;
     841    23925138 :   z = cgetipos(l);
     842    48173042 :   for (i = 2; i < l; i++) z[i] = 0;
     843    23919338 :   *int_MSW(z) = 1UL << m; return z;
     844             : }
     845             : /* 2^n - 1 */
     846             : GEN
     847        9793 : int2um1(ulong n) {
     848             :   ulong i, m, l;
     849             :   GEN z;
     850        9793 :   if (n == 0) return gen_0;
     851             : 
     852        9793 :   l = dvmduBIL(n, &m);
     853        9793 :   l += m? 3: 2;
     854        9793 :   z = cgetipos(l);
     855       19725 :   for (i = 2; i < l; i++) z[i] = ~0UL;
     856        9793 :   if (m) *int_MSW(z) = (1UL << m) - 1;
     857        9793 :   return z;
     858             : }
     859             : 
     860             : GEN
     861  2773937079 : shifti(GEN x, long n)
     862             : {
     863  2773937079 :   long s = signe(x);
     864             :   GEN y;
     865             : 
     866  2773937079 :   if(s == 0) return gen_0;
     867  2516821828 :   y = shiftispec(x + 2, lgefint(x) - 2, n);
     868  2516230478 :   if (signe(y)) setsigne(y, s);
     869  2516230478 :   return y;
     870             : }
     871             : 
     872             : /* actual operations will take place on a+2 and b+2: we strip the codewords */
     873             : GEN
     874 15221828240 : mulii(GEN a,GEN b)
     875             : {
     876             :   long sa,sb;
     877             :   GEN z;
     878             : 
     879 15221828240 :   sa=signe(a); if (!sa) return gen_0;
     880 11665462335 :   sb=signe(b); if (!sb) return gen_0;
     881  8005110531 :   if (sb<0) sa = -sa;
     882  8005110531 :   z = muliispec(a+2,b+2, lgefint(a)-2,lgefint(b)-2);
     883  8033636622 :   setsigne(z,sa); return z;
     884             : }
     885             : 
     886             : GEN
     887  1693131818 : sqri(GEN a) { return sqrispec(a+2, lgefint(a)-2); }
     888             : 
     889             : /* sqrt()'s result may be off by 1 when a is not representable exactly as a
     890             :  * double [64bit machine] */
     891             : ulong
     892   224130896 : usqrt(ulong a)
     893             : {
     894   224130896 :   ulong x = (ulong)sqrt((double)a);
     895             : #ifdef LONG_IS_64BIT
     896   194274647 :   if (x > LOWMASK || x*x > a) x--;
     897             : #endif
     898   224130896 :   return x;
     899             : }
     900             : 
     901             : /********************************************************************/
     902             : /**                                                                **/
     903             : /**              EXPONENT / CONVERSION t_REAL --> double           **/
     904             : /**                                                                **/
     905             : /********************************************************************/
     906             : 
     907             : #ifdef LONG_IS_64BIT
     908             : long
     909    11175921 : dblexpo(double x)
     910             : {
     911             :   union { double f; ulong i; } fi;
     912    11175921 :   const int mant_len = 52;  /* mantissa bits (excl. hidden bit) */
     913    11175921 :   const int exp_mid = 0x3ff;/* exponent bias */
     914             : 
     915    11175921 :   if (x==0.) return -exp_mid;
     916    11175921 :   fi.f = x;
     917    11175921 :   return ((fi.i & (HIGHBIT-1)) >> mant_len) - exp_mid;
     918             : }
     919             : 
     920             : ulong
     921           0 : dblmantissa(double x)
     922             : {
     923             :   union { double f; ulong i; } fi;
     924           0 :   const int expo_len = 11; /* number of bits of exponent */
     925             : 
     926           0 :   if (x==0.) return 0;
     927           0 :   fi.f = x;
     928           0 :   return (fi.i << expo_len) | HIGHBIT;
     929             : }
     930             : 
     931             : GEN
     932     8498625 : dbltor(double x)
     933             : {
     934             :   GEN z;
     935             :   long e;
     936             :   union { double f; ulong i; } fi;
     937     8498625 :   const int mant_len = 52;  /* mantissa bits (excl. hidden bit) */
     938     8498625 :   const int exp_mid = 0x3ff;/* exponent bias */
     939     8498625 :   const int expo_len = 11; /* number of bits of exponent */
     940             : 
     941     8498625 :   if (x==0.) return real_0_bit(-exp_mid);
     942     8494211 :   fi.f = x; z = cgetr(DEFAULTPREC);
     943             :   {
     944     8491523 :     const ulong a = fi.i;
     945             :     ulong A;
     946     8491523 :     e = ((a & (HIGHBIT-1)) >> mant_len) - exp_mid;
     947     8491523 :     if (e == exp_mid+1) pari_err_OVERFLOW("dbltor [NaN or Infinity]");
     948     8491565 :     A = a << expo_len;
     949     8491565 :     if (e == -exp_mid)
     950             :     { /* unnormalized values */
     951           0 :       int sh = bfffo(A);
     952           0 :       e -= sh-1;
     953           0 :       z[2] = A << sh;
     954             :     }
     955             :     else
     956     8491565 :       z[2] = HIGHBIT | A;
     957     8491565 :     z[1] = _evalexpo(e) | evalsigne(x<0? -1: 1);
     958             :   }
     959     8491565 :   return z;
     960             : }
     961             : 
     962             : double
     963   525055302 : rtodbl(GEN x)
     964             : {
     965   525055302 :   long ex,s=signe(x);
     966             :   ulong a;
     967             :   union { double f; ulong i; } fi;
     968   525055302 :   const int mant_len = 52;  /* mantissa bits (excl. hidden bit) */
     969   525055302 :   const int exp_mid = 0x3ff;/* exponent bias */
     970   525055302 :   const int expo_len = 11; /* number of bits of exponent */
     971             : 
     972   525055302 :   if (!s || (ex=expo(x)) < - exp_mid) return 0.0;
     973             : 
     974             :   /* start by rounding to closest */
     975   427956602 :   a = (x[2] & (HIGHBIT-1)) + 0x400;
     976   427956602 :   if (a & HIGHBIT) { ex++; a=0; }
     977   427956602 :   if (ex >= exp_mid) pari_err_OVERFLOW("t_REAL->double conversion");
     978   427964868 :   fi.i = ((ex + exp_mid) << mant_len) | (a >> expo_len);
     979   427964868 :   if (s<0) fi.i |= HIGHBIT;
     980   427964868 :   return fi.f;
     981             : }
     982             : 
     983             : #else /* LONG_IS_64BIT */
     984             : 
     985             : #if   PARI_DOUBLE_FORMAT == 1
     986             : #  define INDEX0 1
     987             : #  define INDEX1 0
     988             : #elif PARI_DOUBLE_FORMAT == 0
     989             : #  define INDEX0 0
     990             : #  define INDEX1 1
     991             : #endif
     992             : 
     993             : long
     994     1858508 : dblexpo(double x)
     995             : {
     996             :   union { double f; ulong i[2]; } fi;
     997     1858508 :   const int mant_len = 52;  /* mantissa bits (excl. hidden bit) */
     998     1858508 :   const int exp_mid = 0x3ff;/* exponent bias */
     999     1858508 :   const int shift = mant_len-32;
    1000             : 
    1001     1858508 :   if (x==0.) return -exp_mid;
    1002     1858508 :   fi.f = x;
    1003             :   {
    1004     1858508 :     const ulong a = fi.i[INDEX0];
    1005     1858508 :     return ((a & (HIGHBIT-1)) >> shift) - exp_mid;
    1006             :   }
    1007             : }
    1008             : 
    1009             : ulong
    1010           0 : dblmantissa(double x)
    1011             : {
    1012             :   union { double f; ulong i[2]; } fi;
    1013           0 :   const int expo_len = 11; /* number of bits of exponent */
    1014             : 
    1015           0 :   if (x==0.) return 0;
    1016           0 :   fi.f = x;
    1017             :   {
    1018           0 :     const ulong a = fi.i[INDEX0];
    1019           0 :     const ulong b = fi.i[INDEX1];
    1020           0 :     return HIGHBIT | b >> (BITS_IN_LONG-expo_len) | (a << expo_len);
    1021             :   }
    1022             : }
    1023             : 
    1024             : GEN
    1025     1367885 : dbltor(double x)
    1026             : {
    1027             :   GEN z;
    1028             :   long e;
    1029             :   union { double f; ulong i[2]; } fi;
    1030     1367885 :   const int mant_len = 52;  /* mantissa bits (excl. hidden bit) */
    1031     1367885 :   const int exp_mid = 0x3ff;/* exponent bias */
    1032     1367885 :   const int expo_len = 11; /* number of bits of exponent */
    1033     1367885 :   const int shift = mant_len-32;
    1034             : 
    1035     1367885 :   if (x==0.) return real_0_bit(-exp_mid);
    1036     1367162 :   fi.f = x; z = cgetr(DEFAULTPREC);
    1037             :   {
    1038     1367162 :     const ulong a = fi.i[INDEX0];
    1039     1367162 :     const ulong b = fi.i[INDEX1];
    1040             :     ulong A, B;
    1041     1367162 :     e = ((a & (HIGHBIT-1)) >> shift) - exp_mid;
    1042     1367162 :     if (e == exp_mid+1) pari_err_OVERFLOW("dbltor [NaN or Infinity]");
    1043     1367162 :     A = b >> (BITS_IN_LONG-expo_len) | (a << expo_len);
    1044     1367162 :     B = b << expo_len;
    1045     1367162 :     if (e == -exp_mid)
    1046             :     { /* unnormalized values */
    1047             :       int sh;
    1048           0 :       if (A)
    1049             :       {
    1050           0 :         sh = bfffo(A);
    1051           0 :         e -= sh-1;
    1052           0 :         z[2] = (A << sh) | (B >> (32-sh));
    1053           0 :         z[3] = B << sh;
    1054             :       }
    1055             :       else
    1056             :       {
    1057           0 :         sh = bfffo(B); /* B != 0 */
    1058           0 :         e -= sh-1 + 32;
    1059           0 :         z[2] = B << sh;
    1060           0 :         z[3] = 0;
    1061             :       }
    1062             :     }
    1063             :     else
    1064             :     {
    1065     1367162 :       z[3] = B;
    1066     1367162 :       z[2] = HIGHBIT | A;
    1067             :     }
    1068     1367162 :     z[1] = _evalexpo(e) | evalsigne(x<0? -1: 1);
    1069             :   }
    1070     1367162 :   return z;
    1071             : }
    1072             : 
    1073             : double
    1074    87643086 : rtodbl(GEN x)
    1075             : {
    1076    87643086 :   long ex,s=signe(x),lx=lg(x);
    1077             :   ulong a,b,k;
    1078             :   union { double f; ulong i[2]; } fi;
    1079    87643086 :   const int mant_len = 52;  /* mantissa bits (excl. hidden bit) */
    1080    87643086 :   const int exp_mid = 0x3ff;/* exponent bias */
    1081    87643086 :   const int expo_len = 11; /* number of bits of exponent */
    1082    87643086 :   const int shift = mant_len-32;
    1083             : 
    1084    87643086 :   if (!s || (ex=expo(x)) < - exp_mid) return 0.0;
    1085             : 
    1086             :   /* start by rounding to closest */
    1087    71435546 :   a = x[2] & (HIGHBIT-1);
    1088    71435546 :   if (lx > 3)
    1089             :   {
    1090    71304546 :     b = x[3] + 0x400UL; if (b < 0x400UL) a++;
    1091    71304546 :     if (a & HIGHBIT) { ex++; a=0; }
    1092             :   }
    1093      131000 :   else b = 0;
    1094    71435546 :   if (ex >= exp_mid) pari_err_OVERFLOW("t_REAL->double conversion");
    1095    71435546 :   ex += exp_mid;
    1096    71435546 :   k = (a >> expo_len) | (ex << shift);
    1097    71435546 :   if (s<0) k |= HIGHBIT;
    1098    71435546 :   fi.i[INDEX0] = k;
    1099    71435546 :   fi.i[INDEX1] = (a << (BITS_IN_LONG-expo_len)) | (b >> expo_len);
    1100    71435546 :   return fi.f;
    1101             : }
    1102             : #endif /* LONG_IS_64BIT */
    1103             : 

Generated by: LCOV version 1.13