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.1 lcov report (development 30482-15ec328664) Lines: 187 187 100.0 %
Date: 2025-09-04 09:23:52 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  3979037067 : icopy_sign(GEN x, long sx)
      18             : {
      19  3979037067 :   GEN y=icopy(x);
      20  3986265766 :   setsigne(y,sx);
      21  3986265766 :   return y;
      22             : }
      23             : 
      24             : GEN
      25   313681635 : addsi_sign(long x, GEN y, long sy)
      26             : {
      27             :   long sx,ly;
      28             :   GEN z;
      29             : 
      30   313681635 :   if (!x) return icopy_sign(y, sy);
      31   297305235 :   if (!sy) return stoi(x);
      32   168908382 :   if (x<0) { sx=-1; x=-x; } else sx=1;
      33   168908382 :   if (sx==sy)
      34             :   {
      35    47175099 :     z = adduispec(x,y+2, lgefint(y)-2);
      36    47169006 :     setsigne(z,sy); return z;
      37             :   }
      38   121733283 :   ly=lgefint(y);
      39   121733283 :   if (ly==3)
      40             :   {
      41    18109659 :     const long d = (long)(uel(y,2) - (ulong)x);
      42    18109659 :     if (!d) return gen_0;
      43    17089773 :     z=cgeti(3);
      44    17086963 :     if (y[2] < 0 || d > 0) {
      45    14610491 :       z[1] = evalsigne(sy) | evallgefint(3);
      46    14610491 :       z[2] = d;
      47             :     }
      48             :     else {
      49     2476472 :       z[1] = evalsigne(-sy) | evallgefint(3);
      50     2476472 :       z[2] =-d;
      51             :     }
      52    17086963 :     return z;
      53             :   }
      54   103623624 :   z = subiuspec(y+2,x, ly-2);
      55   103731774 :   setsigne(z,sy); return z;
      56             : }
      57             : GEN
      58   235021008 : addui_sign(ulong x, GEN y, long sy)
      59             : {
      60             :   long ly;
      61             :   GEN z;
      62             : 
      63   235021008 :   if (!x) return icopy_sign(y, sy);
      64   232075989 :   if (!sy) return utoipos(x);
      65   223448280 :   if (sy == 1) return adduispec(x,y+2, lgefint(y)-2);
      66   115650323 :   ly=lgefint(y);
      67   115650323 :   if (ly==3)
      68             :   {
      69    28788705 :     const ulong t = y[2];
      70    28788705 :     if (x == t) return gen_0;
      71    26667897 :     z=cgeti(3);
      72    26667546 :     if (x < t) {
      73    24935919 :       z[1] = evalsigne(-1) | evallgefint(3);
      74    24935919 :       z[2] = t - x;
      75             :     }
      76             :     else {
      77     1731627 :       z[1] = evalsigne(1) | evallgefint(3);
      78     1731627 :       z[2] = x - t;
      79             :     }
      80    26667546 :     return z;
      81             :   }
      82    86861618 :   z = subiuspec(y+2,x, ly-2);
      83    86864981 :   setsigne(z,-1); return z;
      84             : }
      85             : 
      86             : /* return gen_0 when the sign is 0 */
      87             : GEN
      88 18672459537 : addii_sign(GEN x, long sx, GEN y, long sy)
      89             : {
      90             :   long lx,ly;
      91             :   GEN z;
      92             : 
      93 18672459537 :   if (!sx) return sy? icopy_sign(y, sy): gen_0;
      94 14811184096 :   if (!sy) return icopy_sign(x, sx);
      95 12065612871 :   lx = lgefint(x);
      96 12065612871 :   ly = lgefint(y);
      97 12065612871 :   if (sx==sy)
      98  6484938195 :     z = addiispec(x+2,y+2,lx-2,ly-2);
      99             :   else
     100             :   { /* sx != sy */
     101  5580674676 :     long i = cmpiispec(x+2,y+2,lx-2,ly-2);
     102  5658638606 :     if (!i) return gen_0;
     103             :     /* we must ensure |x| > |y| for subiispec */
     104  5363448270 :     if (i < 0) {
     105  2208946478 :       sx = sy;
     106  2208946478 :       z = subiispec(y+2,x+2,ly-2,lx-2);
     107             :     }
     108             :     else
     109  3154501792 :       z = subiispec(x+2,y+2,lx-2,ly-2);
     110             :   }
     111 11821951599 :   setsigne(z,sx); return z;
     112             : }
     113             : 
     114             : INLINE GEN
     115   392599677 : rcopy_sign(GEN x, long sx) { GEN y = rcopy(x); setsigne(y,sx); return y; }
     116             : 
     117             : GEN
     118   488758405 : addir_sign(GEN x, long sx, GEN y, long sy)
     119             : {
     120             :   long e, l, ly;
     121             :   GEN z;
     122             : 
     123   488758405 :   if (!sx) return rcopy_sign(y, sy);
     124   147328396 :   e = expo(y) - expi(x);
     125   147384898 :   if (!sy)
     126             :   {
     127      693695 :     if (e >= 0) return rcopy_sign(y, sy);
     128      693647 :     z = itor(x, nbits2prec(-e));
     129      693621 :     setsigne(z, sx); return z;
     130             :   }
     131             : 
     132   146691203 :   ly = lg(y);
     133   146691203 :   if (e > 0)
     134             :   {
     135    42001415 :     l = lg2prec(ly - divsBIL(e));
     136    42000179 :     if (l < LOWDEFAULTPREC) return rcopy_sign(y, sy);
     137             :   }
     138   104689788 :   else l = lg2prec(ly) + nbits2extraprec(-e);
     139   146205050 :   z = (GEN)avma;
     140   146205050 :   y = addrr_sign(itor(x,l), sx, y, sy);
     141  1440882351 :   ly = lg(y); while (ly--) *--z = y[ly];
     142   146171381 :   set_avma((pari_sp)z); return z;
     143             : }
     144             : 
     145             : static GEN
     146   495178696 : addsr_sign(long x, GEN y, long sy)
     147             : {
     148             :   long e, l, ly, sx;
     149             :   GEN z;
     150             : 
     151   495178696 :   if (!x) return rcopy_sign(y, sy);
     152   495165949 :   if (x < 0) { sx = -1; x = -x; } else sx = 1;
     153   495165949 :   e = expo(y) - expu(x);
     154   495111080 :   if (!sy)
     155             :   {
     156      503767 :     if (e >= 0) return rcopy_sign(y, sy);
     157      503739 :     if (sx == -1) x = -x;
     158      503739 :     return stor(x, nbits2prec(-e));
     159             :   }
     160             : 
     161   494607313 :   ly = lg(y);
     162   494607313 :   if (e > 0)
     163             :   {
     164     5042775 :     l = lg2prec(ly - divsBIL(e));
     165     5042751 :     if (l < LOWDEFAULTPREC) return rcopy_sign(y, sy);
     166             :   }
     167   489564538 :   else l = lg2prec(ly) + nbits2extraprec(-e);
     168   493523976 :   z = (GEN)avma;
     169   493523976 :   y = addrr_sign(stor(x,l), sx, y, sy);
     170  6491702345 :   ly = lg(y); while (ly--) *--z = y[ly];
     171   493653245 :   set_avma((pari_sp)z); return z;
     172             : }
     173             : 
     174             : GEN
     175   485713246 : addsr(long x, GEN y) { return addsr_sign(x, y, signe(y)); }
     176             : 
     177             : GEN
     178     9455765 : subsr(long x, GEN y) { return addsr_sign(x, y, -signe(y)); }
     179             : 
     180             : GEN
     181  5081840684 : addrr_sign(GEN x, long sx, GEN y, long sy)
     182             : {
     183  5081840684 :   long lx, ex = expo(x);
     184  5081840684 :   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  5081840684 :   if (!sy)
     191             :   {
     192   320573516 :     if (!sx)
     193             :     {
     194   102013167 :       if (e > 0) ex = ey;
     195   102013167 :       return real_0_bit(ex);
     196             :     }
     197   218560349 :     if (e >= 0) return real_0_bit(ey);
     198   217439540 :     lz = nbits2lg(-e);
     199   217607783 :     lx = lg(x); if (lz > lx) lz = lx;
     200  1691335555 :     z = cgetg(lz, t_REAL); while(--lz) z[lz] = x[lz];
     201   217618512 :     setsigne(z,sx); return z;
     202             :   }
     203  4761267168 :   if (!sx)
     204             :   {
     205    28360793 :     if (e <= 0) return real_0_bit(ex);
     206    26823423 :     lz = nbits2lg(e);
     207    26823287 :     ly = lg(y); if (lz > ly) lz = ly;
     208   136825968 :     z = cgetg(lz, t_REAL); while (--lz) z[lz] = y[lz];
     209    26820574 :     setsigne(z,sy); return z;
     210             :   }
     211             : 
     212  4732906375 :   if (e < 0) { swap(x,y); lswap(sx,sy); ey=ex; e=-e; }
     213             :   /* now ey >= ex */
     214  4732906375 :   lx = lg(x);
     215  4732906375 :   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  4732906375 :   extend = 0;
     220  4732906375 :   if (e)
     221             :   {
     222  4089438437 :     long d = dvmdsBIL(e, &m), l = ly-d;
     223  4087423045 :     if (l <= 2) return rcopy_sign(y, sy);
     224  4042668610 :     if (l > lx) { lz = lx + d + 1; extend = 1; }
     225  3231012741 :     else        { lz = ly; lx = l; }
     226  4042668610 :     if (m)
     227             :     { /* shift x right m bits */
     228  4029819490 :       const pari_sp av = avma;
     229  4029819490 :       const ulong sh = BITS_IN_LONG-m;
     230  4029819490 :       GEN p1 = x; x = new_chunk(lx + lz + 1);
     231  4024695519 :       shift_right(x,p1,2,lx, 0,m);
     232  4027572108 :       if (extend) uel(x,lx) = uel(p1,lx-1) << sh;
     233  4027572108 :       set_avma(av); /* HACK: cgetg(lz, t_REAL) will not overwrite x */
     234             :     }
     235             :   }
     236             :   else
     237             :   { /* d = 0 */
     238   643467938 :     m = 0;
     239   643467938 :     if (lx > ly) lx = ly;
     240   643467938 :     lz = lx;
     241             :   }
     242             : 
     243  4689737761 :   if (sx == sy)
     244             :   { /* addition */
     245  2432632479 :     i = lz-1;
     246  2432632479 :     j = lx-1;
     247  2432632479 :     if (extend) {
     248   487815688 :       ulong garde = addll(x[lx], y[i]);
     249   487815688 :       if (m < 4) /* don't extend for few correct bits */
     250    55906916 :         z = cgetg(--lz, t_REAL);
     251             :       else
     252             :       {
     253   431908772 :         z = cgetg(lz, t_REAL);
     254   431755473 :         z[i] = garde;
     255             :       }
     256             :     }
     257             :     else
     258             :     {
     259  1944816791 :       z = cgetg(lz, t_REAL);
     260  1944361881 :       z[i] = addll(x[j], y[i]); j--;
     261             :     }
     262  2428345388 :     i--;
     263 13467401275 :     for (; j>=2; i--,j--) z[i] = addllx(x[j],y[i]);
     264  2428345388 :     if (overflow)
     265             :     {
     266   581334064 :       z[1] = 1; /* stops since z[1] != 0 */
     267   582596688 :       for (;;) { z[i] = uel(y,i)+1; if (z[i--]) break; }
     268   581334064 :       if (i <= 0)
     269             :       {
     270   577690898 :         shift_right(z,z, 2,lz, 1,1);
     271   578006677 :         z[1] = evalsigne(sx) | evalexpo(ey+1); return z;
     272             :       }
     273             :     }
     274  2352526581 :     for (; i>=2; i--) z[i] = y[i];
     275  1850654490 :     z[1] = evalsigne(sx) | evalexpo(ey); return z;
     276             :   }
     277             : 
     278             :   /* subtraction */
     279  2257105282 :   if (e) f2 = 1;
     280             :   else
     281             :   {
     282   604718099 :     i = 2; while (i < lx && x[i] == y[i]) i++;
     283   364837456 :     if (i==lx) return real_0_bit(ey+1 - lg2prec(lx));
     284   339919436 :     f2 = (uel(y,i) > uel(x,i));
     285             :   }
     286             :   /* result is nonzero. f2 = (y > x) */
     287  2232187262 :   i = lz-1; z = cgetg(lz, t_REAL);
     288  2227381052 :   if (f2)
     289             :   {
     290  2079953678 :     j = lx-1;
     291  2079953678 :     if (extend) z[i] = subll(y[i], x[lx]);
     292  1756711933 :     else        z[i] = subll(y[i], x[j--]);
     293 13010188923 :     for (i--; j>=2; i--) z[i] = subllx(y[i], x[j--]);
     294  2079953678 :     if (overflow) /* stops since y[1] != 0 */
     295    68347383 :       for (;;) { z[i] = uel(y,i)-1; if (y[i--]) break; }
     296  2440946720 :     for (; i>=2; i--) z[i] = y[i];
     297  2079953678 :     sx = sy;
     298             :   }
     299             :   else
     300             :   {
     301   147427374 :     if (extend) z[i] = subll(x[lx], y[i]);
     302   147427374 :     else        z[i] = subll(x[i],  y[i]);
     303   799079677 :     for (i--; i>=2; i--) z[i] = subllx(x[i], y[i]);
     304             :   }
     305             : 
     306  2386920998 :   x = z+2; i = 0; while (!x[i]) i++;
     307  2227381052 :   lz -= i; z += i;
     308  2227381052 :   j = bfffo(z[2]); /* need to shift left by j bits to normalize mantissa */
     309  2227381052 :   ez = ey - (j | (i * BITS_IN_LONG));
     310  2227381052 :   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   323660267 :     if (m - j < 5 && lz > 3)
     314   171687290 :     { /* shorten z */
     315   171681250 :       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   171681250 :       if (j == 0)
     320             :         /* stackdummy((pari_sp)(z + lz+1), (pari_sp)(z + lz)); */
     321    14101764 :         z[lz] = evaltyp(t_VECSMALL) | _evallg(1);
     322             :       else
     323             :       {
     324   157579486 :         GEN t = z;
     325   157579486 :         z++; shift_left(z,t,2,lz-1, last,j);
     326             :       }
     327   171687290 :       if ((last<<j) & HIGHBIT)
     328             :       { /* round up */
     329    62360439 :         i = lz-1;
     330    62821345 :         while (++((ulong*)z)[i] == 0 && i > 1) i--;
     331    62360439 :         if (i == 1) { ez++; z[2] = (long)HIGHBIT; }
     332             :       }
     333             :     }
     334   151979017 :     else if (j) shift_left(z,z,2,lz-1, 0,j);
     335             :   }
     336  1903720785 :   else if (j) shift_left(z,z,2,lz-1, 0,j);
     337  2228577082 :   z[1] = evalsigne(sx) | evalexpo(ez);
     338  2235829004 :   z[0] = evaltyp(t_REAL) | evallg(lz);
     339  2234569723 :   set_avma((pari_sp)z); return z;
     340             : }

Generated by: LCOV version 1.16