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.18.0 lcov report (development 29789-eb252ba62d) Lines: 187 187 100.0 %
Date: 2024-12-03 09:08:48 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  3922804610 : icopy_sign(GEN x, long sx)
      18             : {
      19  3922804610 :   GEN y=icopy(x);
      20  3932004751 :   setsigne(y,sx);
      21  3932004751 :   return y;
      22             : }
      23             : 
      24             : GEN
      25   311305005 : addsi_sign(long x, GEN y, long sy)
      26             : {
      27             :   long sx,ly;
      28             :   GEN z;
      29             : 
      30   311305005 :   if (!x) return icopy_sign(y, sy);
      31   294968640 :   if (!sy) return stoi(x);
      32   166838029 :   if (x<0) { sx=-1; x=-x; } else sx=1;
      33   166838029 :   if (sx==sy)
      34             :   {
      35    46487518 :     z = adduispec(x,y+2, lgefint(y)-2);
      36    46481924 :     setsigne(z,sy); return z;
      37             :   }
      38   120350511 :   ly=lgefint(y);
      39   120350511 :   if (ly==3)
      40             :   {
      41    18084148 :     const long d = (long)(uel(y,2) - (ulong)x);
      42    18084148 :     if (!d) return gen_0;
      43    17066307 :     z=cgeti(3);
      44    17063867 :     if (y[2] < 0 || d > 0) {
      45    14590100 :       z[1] = evalsigne(sy) | evallgefint(3);
      46    14590100 :       z[2] = d;
      47             :     }
      48             :     else {
      49     2473767 :       z[1] = evalsigne(-sy) | evallgefint(3);
      50     2473767 :       z[2] =-d;
      51             :     }
      52    17063867 :     return z;
      53             :   }
      54   102266363 :   z = subiuspec(y+2,x, ly-2);
      55   102422574 :   setsigne(z,sy); return z;
      56             : }
      57             : GEN
      58   235877384 : addui_sign(ulong x, GEN y, long sy)
      59             : {
      60             :   long ly;
      61             :   GEN z;
      62             : 
      63   235877384 :   if (!x) return icopy_sign(y, sy);
      64   234296828 :   if (!sy) return utoipos(x);
      65   227222865 :   if (sy == 1) return adduispec(x,y+2, lgefint(y)-2);
      66   111645549 :   ly=lgefint(y);
      67   111645549 :   if (ly==3)
      68             :   {
      69    25292168 :     const ulong t = y[2];
      70    25292168 :     if (x == t) return gen_0;
      71    23420127 :     z=cgeti(3);
      72    23419801 :     if (x < t) {
      73    23186622 :       z[1] = evalsigne(-1) | evallgefint(3);
      74    23186622 :       z[2] = t - x;
      75             :     }
      76             :     else {
      77      233179 :       z[1] = evalsigne(1) | evallgefint(3);
      78      233179 :       z[2] = x - t;
      79             :     }
      80    23419801 :     return z;
      81             :   }
      82    86353381 :   z = subiuspec(y+2,x, ly-2);
      83    86355746 :   setsigne(z,-1); return z;
      84             : }
      85             : 
      86             : /* return gen_0 when the sign is 0 */
      87             : GEN
      88 18212056338 : addii_sign(GEN x, long sx, GEN y, long sy)
      89             : {
      90             :   long lx,ly;
      91             :   GEN z;
      92             : 
      93 18212056338 :   if (!sx) return sy? icopy_sign(y, sy): gen_0;
      94 14478639891 :   if (!sy) return icopy_sign(x, sx);
      95 11773072558 :   lx = lgefint(x);
      96 11773072558 :   ly = lgefint(y);
      97 11773072558 :   if (sx==sy)
      98  6344487118 :     z = addiispec(x+2,y+2,lx-2,ly-2);
      99             :   else
     100             :   { /* sx != sy */
     101  5428585440 :     long i = cmpiispec(x+2,y+2,lx-2,ly-2);
     102  5505784010 :     if (!i) return gen_0;
     103             :     /* we must ensure |x| > |y| for subiispec */
     104  5228405750 :     if (i < 0) {
     105  2127850693 :       sx = sy;
     106  2127850693 :       z = subiispec(y+2,x+2,ly-2,lx-2);
     107             :     }
     108             :     else
     109  3100555057 :       z = subiispec(x+2,y+2,lx-2,ly-2);
     110             :   }
     111 11546591407 :   setsigne(z,sx); return z;
     112             : }
     113             : 
     114             : INLINE GEN
     115   388718398 : rcopy_sign(GEN x, long sx) { GEN y = rcopy(x); setsigne(y,sx); return y; }
     116             : 
     117             : GEN
     118   483030820 : addir_sign(GEN x, long sx, GEN y, long sy)
     119             : {
     120             :   long e, l, ly;
     121             :   GEN z;
     122             : 
     123   483030820 :   if (!sx) return rcopy_sign(y, sy);
     124   144572963 :   e = expo(y) - expi(x);
     125   144631911 :   if (!sy)
     126             :   {
     127      689058 :     if (e >= 0) return rcopy_sign(y, sy);
     128      689024 :     z = itor(x, nbits2prec(-e));
     129      688985 :     setsigne(z, sx); return z;
     130             :   }
     131             : 
     132   143942853 :   ly = lg(y);
     133   143942853 :   if (e > 0)
     134             :   {
     135    41094314 :     l = lg2prec(ly - divsBIL(e));
     136    41093039 :     if (l < LOWDEFAULTPREC) return rcopy_sign(y, sy);
     137             :   }
     138   102848539 :   else l = lg2prec(ly) + nbits2extraprec(-e);
     139   143457012 :   z = (GEN)avma;
     140   143457012 :   y = addrr_sign(itor(x,l), sx, y, sy);
     141  1406341612 :   ly = lg(y); while (ly--) *--z = y[ly];
     142   143425227 :   set_avma((pari_sp)z); return z;
     143             : }
     144             : 
     145             : static GEN
     146   489149183 : addsr_sign(long x, GEN y, long sy)
     147             : {
     148             :   long e, l, ly, sx;
     149             :   GEN z;
     150             : 
     151   489149183 :   if (!x) return rcopy_sign(y, sy);
     152   489141427 :   if (x < 0) { sx = -1; x = -x; } else sx = 1;
     153   489141427 :   e = expo(y) - expu(x);
     154   489089790 :   if (!sy)
     155             :   {
     156      503810 :     if (e >= 0) return rcopy_sign(y, sy);
     157      503782 :     if (sx == -1) x = -x;
     158      503782 :     return stor(x, nbits2prec(-e));
     159             :   }
     160             : 
     161   488585980 :   ly = lg(y);
     162   488585980 :   if (e > 0)
     163             :   {
     164     4975971 :     l = lg2prec(ly - divsBIL(e));
     165     4975951 :     if (l < LOWDEFAULTPREC) return rcopy_sign(y, sy);
     166             :   }
     167   483610009 :   else l = lg2prec(ly) + nbits2extraprec(-e);
     168   487520633 :   z = (GEN)avma;
     169   487520633 :   y = addrr_sign(stor(x,l), sx, y, sy);
     170  6387962972 :   ly = lg(y); while (ly--) *--z = y[ly];
     171   487615668 :   set_avma((pari_sp)z); return z;
     172             : }
     173             : 
     174             : GEN
     175   479780407 : addsr(long x, GEN y) { return addsr_sign(x, y, signe(y)); }
     176             : 
     177             : GEN
     178     9356751 : subsr(long x, GEN y) { return addsr_sign(x, y, -signe(y)); }
     179             : 
     180             : GEN
     181  5013440410 : addrr_sign(GEN x, long sx, GEN y, long sy)
     182             : {
     183  5013440410 :   long lx, ex = expo(x);
     184  5013440410 :   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  5013440410 :   if (!sy)
     191             :   {
     192   313880825 :     if (!sx)
     193             :     {
     194   100672687 :       if (e > 0) ex = ey;
     195   100672687 :       return real_0_bit(ex);
     196             :     }
     197   213208138 :     if (e >= 0) return real_0_bit(ey);
     198   212129042 :     lz = nbits2lg(-e);
     199   212290792 :     lx = lg(x); if (lz > lx) lz = lx;
     200  1625026040 :     z = cgetg(lz, t_REAL); while(--lz) z[lz] = x[lz];
     201   212306303 :     setsigne(z,sx); return z;
     202             :   }
     203  4699559585 :   if (!sx)
     204             :   {
     205    28135482 :     if (e <= 0) return real_0_bit(ex);
     206    26646673 :     lz = nbits2lg(e);
     207    26646517 :     ly = lg(y); if (lz > ly) lz = ly;
     208   135548747 :     z = cgetg(lz, t_REAL); while (--lz) z[lz] = y[lz];
     209    26644964 :     setsigne(z,sy); return z;
     210             :   }
     211             : 
     212  4671424103 :   if (e < 0) { swap(x,y); lswap(sx,sy); ey=ex; e=-e; }
     213             :   /* now ey >= ex */
     214  4671424103 :   lx = lg(x);
     215  4671424103 :   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  4671424103 :   extend = 0;
     220  4671424103 :   if (e)
     221             :   {
     222  4035399821 :     long d = dvmdsBIL(e, &m), l = ly-d;
     223  4032425940 :     if (l <= 2) return rcopy_sign(y, sy);
     224  3989245358 :     if (l > lx) { lz = lx + d + 1; extend = 1; }
     225  3189897141 :     else        { lz = ly; lx = l; }
     226  3989245358 :     if (m)
     227             :     { /* shift x right m bits */
     228  3975884209 :       const pari_sp av = avma;
     229  3975884209 :       const ulong sh = BITS_IN_LONG-m;
     230  3975884209 :       GEN p1 = x; x = new_chunk(lx + lz + 1);
     231  3970737598 :       shift_right(x,p1,2,lx, 0,m);
     232  3973138282 :       if (extend) uel(x,lx) = uel(p1,lx-1) << sh;
     233  3973138282 :       set_avma(av); /* HACK: cgetg(lz, t_REAL) will not overwrite x */
     234             :     }
     235             :   }
     236             :   else
     237             :   { /* d = 0 */
     238   636024282 :     m = 0;
     239   636024282 :     if (lx > ly) lx = ly;
     240   636024282 :     lz = lx;
     241             :   }
     242             : 
     243  4628736126 :   if (sx == sy)
     244             :   { /* addition */
     245  2393092519 :     i = lz-1;
     246  2393092519 :     j = lx-1;
     247  2393092519 :     if (extend) {
     248   477356118 :       ulong garde = addll(x[lx], y[i]);
     249   477356118 :       if (m < 4) /* don't extend for few correct bits */
     250    55165130 :         z = cgetg(--lz, t_REAL);
     251             :       else
     252             :       {
     253   422190988 :         z = cgetg(lz, t_REAL);
     254   422239923 :         z[i] = garde;
     255             :       }
     256             :     }
     257             :     else
     258             :     {
     259  1915736401 :       z = cgetg(lz, t_REAL);
     260  1916947961 :       z[i] = addll(x[j], y[i]); j--;
     261             :     }
     262  2390867856 :     i--;
     263 13133522800 :     for (; j>=2; i--,j--) z[i] = addllx(x[j],y[i]);
     264  2390867856 :     if (overflow)
     265             :     {
     266   574687689 :       z[1] = 1; /* stops since z[1] != 0 */
     267   575970463 :       for (;;) { z[i] = uel(y,i)+1; if (z[i--]) break; }
     268   574687689 :       if (i <= 0)
     269             :       {
     270   571102007 :         shift_right(z,z, 2,lz, 1,1);
     271   571392721 :         z[1] = evalsigne(sx) | evalexpo(ey+1); return z;
     272             :       }
     273             :     }
     274  2313896115 :     for (; i>=2; i--) z[i] = y[i];
     275  1819765849 :     z[1] = evalsigne(sx) | evalexpo(ey); return z;
     276             :   }
     277             : 
     278             :   /* subtraction */
     279  2235643607 :   if (e) f2 = 1;
     280             :   else
     281             :   {
     282   595654952 :     i = 2; while (i < lx && x[i] == y[i]) i++;
     283   361023498 :     if (i==lx) return real_0_bit(ey+1 - lg2prec(lx));
     284   336348420 :     f2 = (uel(y,i) > uel(x,i));
     285             :   }
     286             :   /* result is nonzero. f2 = (y > x) */
     287  2210968529 :   i = lz-1; z = cgetg(lz, t_REAL);
     288  2207750055 :   if (f2)
     289             :   {
     290  2061486631 :     j = lx-1;
     291  2061486631 :     if (extend) z[i] = subll(y[i], x[lx]);
     292  1739900157 :     else        z[i] = subll(y[i], x[j--]);
     293 12873029153 :     for (i--; j>=2; i--) z[i] = subllx(y[i], x[j--]);
     294  2061486631 :     if (overflow) /* stops since y[1] != 0 */
     295    66804357 :       for (;;) { z[i] = uel(y,i)-1; if (y[i--]) break; }
     296  2419808531 :     for (; i>=2; i--) z[i] = y[i];
     297  2061486631 :     sx = sy;
     298             :   }
     299             :   else
     300             :   {
     301   146263424 :     if (extend) z[i] = subll(x[lx], y[i]);
     302   146263424 :     else        z[i] = subll(x[i],  y[i]);
     303   788952885 :     for (i--; i>=2; i--) z[i] = subllx(x[i], y[i]);
     304             :   }
     305             : 
     306  2363583261 :   x = z+2; i = 0; while (!x[i]) i++;
     307  2207750055 :   lz -= i; z += i;
     308  2207750055 :   j = bfffo(z[2]); /* need to shift left by j bits to normalize mantissa */
     309  2207750055 :   ez = ey - (j | (i * BITS_IN_LONG));
     310  2207750055 :   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   321992279 :     if (m - j < 5 && lz > 3)
     314   170436899 :     { /* shorten z */
     315   170432234 :       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   170432234 :       if (j == 0)
     320             :         /* stackdummy((pari_sp)(z + lz+1), (pari_sp)(z + lz)); */
     321    13624001 :         z[lz] = evaltyp(t_VECSMALL) | _evallg(1);
     322             :       else
     323             :       {
     324   156808233 :         GEN t = z;
     325   156808233 :         z++; shift_left(z,t,2,lz-1, last,j);
     326             :       }
     327   170436899 :       if ((last<<j) & HIGHBIT)
     328             :       { /* round up */
     329    61771686 :         i = lz-1;
     330    62233466 :         while (++((ulong*)z)[i] == 0 && i > 1) i--;
     331    61771686 :         if (i == 1) { ez++; z[2] = (long)HIGHBIT; }
     332             :       }
     333             :     }
     334   151560045 :     else if (j) shift_left(z,z,2,lz-1, 0,j);
     335             :   }
     336  1885757776 :   else if (j) shift_left(z,z,2,lz-1, 0,j);
     337  2208899522 :   z[1] = evalsigne(sx) | evalexpo(ez);
     338  2215850092 :   z[0] = evaltyp(t_REAL) | evallg(lz);
     339  2214598354 :   set_avma((pari_sp)z); return z;
     340             : }

Generated by: LCOV version 1.16