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 - add.c (source / functions) Hit Total Coverage
Test: PARI/GP v2.16.1 lcov report (development 28904-c3aa21e911) Lines: 187 187 100.0 %
Date: 2023-12-04 07:51:13 Functions: 10 10 100.0 %
Legend: Lines: hit not hit

          Line data    Source code
       1             : #line 2 "../src/kernel/none/add.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             : INLINE GEN
      17  2833712937 : icopy_sign(GEN x, long sx)
      18             : {
      19  2833712937 :   GEN y=icopy(x);
      20  2846669626 :   setsigne(y,sx);
      21  2846669626 :   return y;
      22             : }
      23             : 
      24             : GEN
      25   277397179 : addsi_sign(long x, GEN y, long sy)
      26             : {
      27             :   long sx,ly;
      28             :   GEN z;
      29             : 
      30   277397179 :   if (!x) return icopy_sign(y, sy);
      31   267786784 :   if (!sy) return stoi(x);
      32   139486380 :   if (x<0) { sx=-1; x=-x; } else sx=1;
      33   139486380 :   if (sx==sy)
      34             :   {
      35    42328198 :     z = adduispec(x,y+2, lgefint(y)-2);
      36    42315100 :     setsigne(z,sy); return z;
      37             :   }
      38    97158182 :   ly=lgefint(y);
      39    97158182 :   if (ly==3)
      40             :   {
      41    14046116 :     const long d = (long)(uel(y,2) - (ulong)x);
      42    14046116 :     if (!d) return gen_0;
      43    13166459 :     z=cgeti(3);
      44    13161807 :     if (y[2] < 0 || d > 0) {
      45    10194841 :       z[1] = evalsigne(sy) | evallgefint(3);
      46    10194841 :       z[2] = d;
      47             :     }
      48             :     else {
      49     2966966 :       z[1] = evalsigne(-sy) | evallgefint(3);
      50     2966966 :       z[2] =-d;
      51             :     }
      52    13161807 :     return z;
      53             :   }
      54    83112066 :   z = subiuspec(y+2,x, ly-2);
      55    83225239 :   setsigne(z,sy); return z;
      56             : }
      57             : GEN
      58   218497489 : addui_sign(ulong x, GEN y, long sy)
      59             : {
      60             :   long ly;
      61             :   GEN z;
      62             : 
      63   218497489 :   if (!x) return icopy_sign(y, sy);
      64   217022925 :   if (!sy) return utoipos(x);
      65   211624488 :   if (sy == 1) return adduispec(x,y+2, lgefint(y)-2);
      66   110812268 :   ly=lgefint(y);
      67   110812268 :   if (ly==3)
      68             :   {
      69    25087807 :     const ulong t = y[2];
      70    25087807 :     if (x == t) return gen_0;
      71    23224918 :     z=cgeti(3);
      72    23223893 :     if (x < t) {
      73    22990894 :       z[1] = evalsigne(-1) | evallgefint(3);
      74    22990894 :       z[2] = t - x;
      75             :     }
      76             :     else {
      77      232999 :       z[1] = evalsigne(1) | evallgefint(3);
      78      232999 :       z[2] = x - t;
      79             :     }
      80    23223893 :     return z;
      81             :   }
      82    85724461 :   z = subiuspec(y+2,x, ly-2);
      83    85725873 :   setsigne(z,-1); return z;
      84             : }
      85             : 
      86             : /* return gen_0 when the sign is 0 */
      87             : GEN
      88 16185280684 : addii_sign(GEN x, long sx, GEN y, long sy)
      89             : {
      90             :   long lx,ly;
      91             :   GEN z;
      92             : 
      93 16185280684 :   if (!sx) return sy? icopy_sign(y, sy): gen_0;
      94 12843129846 :   if (!sy) return icopy_sign(x, sx);
      95 11058969192 :   lx = lgefint(x);
      96 11058969192 :   ly = lgefint(y);
      97 11058969192 :   if (sx==sy)
      98  5992040419 :     z = addiispec(x+2,y+2,lx-2,ly-2);
      99             :   else
     100             :   { /* sx != sy */
     101  5066928773 :     long i = cmpiispec(x+2,y+2,lx-2,ly-2);
     102  5141818813 :     if (!i) return gen_0;
     103             :     /* we must ensure |x| > |y| for subiispec */
     104  4885427639 :     if (i < 0) {
     105  1975187275 :       sx = sy;
     106  1975187275 :       z = subiispec(y+2,x+2,ly-2,lx-2);
     107             :     }
     108             :     else
     109  2910240364 :       z = subiispec(x+2,y+2,lx-2,ly-2);
     110             :   }
     111 10838289503 :   setsigne(z,sx); return z;
     112             : }
     113             : 
     114             : INLINE GEN
     115   376602554 : rcopy_sign(GEN x, long sx) { GEN y = rcopy(x); setsigne(y,sx); return y; }
     116             : 
     117             : GEN
     118   470354629 : addir_sign(GEN x, long sx, GEN y, long sy)
     119             : {
     120             :   long e, l, ly;
     121             :   GEN z;
     122             : 
     123   470354629 :   if (!sx) return rcopy_sign(y, sy);
     124   143608107 :   e = expo(y) - expi(x);
     125   143647688 :   if (!sy)
     126             :   {
     127     1304395 :     if (e >= 0) return rcopy_sign(y, sy);
     128     1304361 :     z = itor(x, nbits2prec(-e));
     129     1303924 :     setsigne(z, sx); return z;
     130             :   }
     131             : 
     132   142343293 :   ly = lg(y);
     133   142343293 :   if (e > 0)
     134             :   {
     135    40044956 :     l = lg2prec(ly - divsBIL(e));
     136    40043755 :     if (l < LOWDEFAULTPREC) return rcopy_sign(y, sy);
     137             :   }
     138   102298337 :   else l = lg2prec(ly) + nbits2extraprec(-e);
     139   141858301 :   z = (GEN)avma;
     140   141858301 :   y = addrr_sign(itor(x,l), sx, y, sy);
     141  1106755709 :   ly = lg(y); while (ly--) *--z = y[ly];
     142   141836577 :   set_avma((pari_sp)z); return z;
     143             : }
     144             : 
     145             : static GEN
     146   413092873 : addsr_sign(long x, GEN y, long sy)
     147             : {
     148             :   long e, l, ly, sx;
     149             :   GEN z;
     150             : 
     151   413092873 :   if (!x) return rcopy_sign(y, sy);
     152   413085271 :   if (x < 0) { sx = -1; x = -x; } else sx = 1;
     153   413085271 :   e = expo(y) - expu(x);
     154   413048632 :   if (!sy)
     155             :   {
     156      528311 :     if (e >= 0) return rcopy_sign(y, sy);
     157      528283 :     if (sx == -1) x = -x;
     158      528283 :     return stor(x, nbits2prec(-e));
     159             :   }
     160             : 
     161   412520321 :   ly = lg(y);
     162   412520321 :   if (e > 0)
     163             :   {
     164     3809047 :     l = lg2prec(ly - divsBIL(e));
     165     3809035 :     if (l < LOWDEFAULTPREC) return rcopy_sign(y, sy);
     166             :   }
     167   408711274 :   else l = lg2prec(ly) + nbits2extraprec(-e);
     168   412017497 :   z = (GEN)avma;
     169   412017497 :   y = addrr_sign(stor(x,l), sx, y, sy);
     170  5281367270 :   ly = lg(y); while (ly--) *--z = y[ly];
     171   412141886 :   set_avma((pari_sp)z); return z;
     172             : }
     173             : 
     174             : GEN
     175   402658085 : addsr(long x, GEN y) { return addsr_sign(x, y, signe(y)); }
     176             : 
     177             : GEN
     178    10448497 : subsr(long x, GEN y) { return addsr_sign(x, y, -signe(y)); }
     179             : 
     180             : GEN
     181  4187547985 : addrr_sign(GEN x, long sx, GEN y, long sy)
     182             : {
     183  4187547985 :   long lx, ex = expo(x);
     184  4187547985 :   long ly, ey = expo(y), e = ey - ex;
     185             :   long i, j, lz, ez, m;
     186             :   int extend, f2;
     187             :   GEN z;
     188             :   LOCAL_OVERFLOW;
     189             : 
     190  4187547985 :   if (!sy)
     191             :   {
     192   100806563 :     if (!sx)
     193             :     {
     194    36768006 :       if (e > 0) ex = ey;
     195    36768006 :       return real_0_bit(ex);
     196             :     }
     197    64038557 :     if (e >= 0) return real_0_bit(ey);
     198    62974977 :     lz = nbits2lg(-e);
     199    62978366 :     lx = lg(x); if (lz > lx) lz = lx;
     200   378844156 :     z = cgetg(lz, t_REAL); while(--lz) z[lz] = x[lz];
     201    62974725 :     setsigne(z,sx); return z;
     202             :   }
     203  4086741422 :   if (!sx)
     204             :   {
     205    22223103 :     if (e <= 0) return real_0_bit(ex);
     206    20742060 :     lz = nbits2lg(e);
     207    20742017 :     ly = lg(y); if (lz > ly) lz = ly;
     208   102808401 :     z = cgetg(lz, t_REAL); while (--lz) z[lz] = y[lz];
     209    20739414 :     setsigne(z,sy); return z;
     210             :   }
     211             : 
     212  4064518319 :   if (e < 0) { swap(x,y); lswap(sx,sy); ey=ex; e=-e; }
     213             :   /* now ey >= ex */
     214  4064518319 :   lx = lg(x);
     215  4064518319 :   ly = lg(y);
     216             :   /* If exponents differ, need to shift one argument, here x. If
     217             :    * extend = 1: extension of x,z by m < BIL bits (round to 1 word) */
     218             :   /* in this case, lz = lx + d + 1, otherwise lx + d */
     219  4064518319 :   extend = 0;
     220  4064518319 :   if (e)
     221             :   {
     222  3484077373 :     long d = dvmdsBIL(e, &m), l = ly-d;
     223  3481512253 :     if (l <= 2) return rcopy_sign(y, sy);
     224  3435415723 :     if (l > lx) { lz = lx + d + 1; extend = 1; }
     225  2791511617 :     else        { lz = ly; lx = l; }
     226  3435415723 :     if (m)
     227             :     { /* shift x right m bits */
     228  3424691962 :       const pari_sp av = avma;
     229  3424691962 :       const ulong sh = BITS_IN_LONG-m;
     230  3424691962 :       GEN p1 = x; x = new_chunk(lx + lz + 1);
     231  3418015207 :       shift_right(x,p1,2,lx, 0,m);
     232  3423221422 :       if (extend) uel(x,lx) = uel(p1,lx-1) << sh;
     233  3423221422 :       set_avma(av); /* HACK: cgetg(lz, t_REAL) will not overwrite x */
     234             :     }
     235             :   }
     236             :   else
     237             :   { /* d = 0 */
     238   580440946 :     m = 0;
     239   580440946 :     if (lx > ly) lx = ly;
     240   580440946 :     lz = lx;
     241             :   }
     242             : 
     243  4019602883 :   if (sx == sy)
     244             :   { /* addition */
     245  2098373136 :     i = lz-1;
     246  2098373136 :     j = lx-1;
     247  2098373136 :     if (extend) {
     248   388446764 :       ulong garde = addll(x[lx], y[i]);
     249   388446764 :       if (m < 4) /* don't extend for few correct bits */
     250    52841507 :         z = cgetg(--lz, t_REAL);
     251             :       else
     252             :       {
     253   335605257 :         z = cgetg(lz, t_REAL);
     254   335552683 :         z[i] = garde;
     255             :       }
     256             :     }
     257             :     else
     258             :     {
     259  1709926372 :       z = cgetg(lz, t_REAL);
     260  1709360232 :       z[i] = addll(x[j], y[i]); j--;
     261             :     }
     262  2094695819 :     i--;
     263 10026903258 :     for (; j>=2; i--,j--) z[i] = addllx(x[j],y[i]);
     264  2094695819 :     if (overflow)
     265             :     {
     266   529276311 :       z[1] = 1; /* stops since z[1] != 0 */
     267   530439098 :       for (;;) { z[i] = uel(y,i)+1; if (z[i--]) break; }
     268   529276311 :       if (i <= 0)
     269             :       {
     270   525892952 :         shift_right(z,z, 2,lz, 1,1);
     271   526138650 :         z[1] = evalsigne(sx) | evalexpo(ey+1); return z;
     272             :       }
     273             :     }
     274  2033255451 :     for (; i>=2; i--) z[i] = y[i];
     275  1568802867 :     z[1] = evalsigne(sx) | evalexpo(ey); return z;
     276             :   }
     277             : 
     278             :   /* subtraction */
     279  1921229747 :   if (e) f2 = 1;
     280             :   else
     281             :   {
     282   540690854 :     i = 2; while (i < lx && x[i] == y[i]) i++;
     283   330383476 :     if (i==lx) return real_0_bit(ey+1 - lg2prec(lx));
     284   309757400 :     f2 = (uel(y,i) > uel(x,i));
     285             :   }
     286             :   /* result is nonzero. f2 = (y > x) */
     287  1900603671 :   i = lz-1; z = cgetg(lz, t_REAL);
     288  1897864245 :   if (f2)
     289             :   {
     290  1761757590 :     j = lx-1;
     291  1761757590 :     if (extend) z[i] = subll(y[i], x[lx]);
     292  1506512091 :     else        z[i] = subll(y[i], x[j--]);
     293 10265163837 :     for (i--; j>=2; i--) z[i] = subllx(y[i], x[j--]);
     294  1761757590 :     if (overflow) /* stops since y[1] != 0 */
     295    59843606 :       for (;;) { z[i] = uel(y,i)-1; if (y[i--]) break; }
     296  2090156939 :     for (; i>=2; i--) z[i] = y[i];
     297  1761757590 :     sx = sy;
     298             :   }
     299             :   else
     300             :   {
     301   136106655 :     if (extend) z[i] = subll(x[lx], y[i]);
     302   136106655 :     else        z[i] = subll(x[i],  y[i]);
     303   635416861 :     for (i--; i>=2; i--) z[i] = subllx(x[i], y[i]);
     304             :   }
     305             : 
     306  2040577152 :   x = z+2; i = 0; while (!x[i]) i++;
     307  1897864245 :   lz -= i; z += i;
     308  1897864245 :   j = bfffo(z[2]); /* need to shift left by j bits to normalize mantissa */
     309  1897864245 :   ez = ey - (j | (i * BITS_IN_LONG));
     310  1897864245 :   if (extend)
     311             :   { /* z was extended by d+1 words [should be e bits = d words + m bits] */
     312             :     /* not worth keeping extra word if less than 5 significant bits in there */
     313   255292317 :     if (m - j < 5 && lz > 3)
     314   158206167 :     { /* shorten z */
     315   158205574 :       ulong last = (ulong)z[--lz]; /* cancelled word */
     316             : 
     317             :       /* if we need to shift anyway, shorten from left
     318             :        * If not, shorten from right, neutralizing last word of z */
     319   158205574 :       if (j == 0)
     320             :         /* stackdummy((pari_sp)(z + lz+1), (pari_sp)(z + lz)); */
     321    13112906 :         z[lz] = evaltyp(t_VECSMALL) | _evallg(1);
     322             :       else
     323             :       {
     324   145092668 :         GEN t = z;
     325   145092668 :         z++; shift_left(z,t,2,lz-1, last,j);
     326             :       }
     327   158206167 :       if ((last<<j) & HIGHBIT)
     328             :       { /* round up */
     329    57155191 :         i = lz-1;
     330    57293483 :         while (++((ulong*)z)[i] == 0 && i > 1) i--;
     331    57155191 :         if (i == 1) { ez++; z[2] = (long)HIGHBIT; }
     332             :       }
     333             :     }
     334    97086743 :     else if (j) shift_left(z,z,2,lz-1, 0,j);
     335             :   }
     336  1642571928 :   else if (j) shift_left(z,z,2,lz-1, 0,j);
     337  1898138727 :   z[1] = evalsigne(sx) | evalexpo(ez);
     338  1901789738 :   z[0] = evaltyp(t_REAL) | evallg(lz);
     339  1900966522 :   set_avma((pari_sp)z); return z;
     340             : }

Generated by: LCOV version 1.14