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 - mt - mt.c (source / functions) Hit Total Coverage
Test: PARI/GP v2.14.0 lcov report (development 27775-aca467eab2) Lines: 72 73 98.6 %
Date: 2022-07-03 07:33:15 Functions: 17 17 100.0 %
Legend: Lines: hit not hit

          Line data    Source code
       1             : /* $Id$
       2             : 
       3             : Copyright (C) 2013  The PARI group.
       4             : 
       5             : This file is part of the PARI/GP package.
       6             : 
       7             : PARI/GP is free software; you can redistribute it and/or modify it under the
       8             : terms of the GNU General Public License as published by the Free Software
       9             : Foundation; either version 2 of the License, or (at your option) any later
      10             : version. It is distributed in the hope that it will be useful, but WITHOUT
      11             : ANY WARRANTY WHATSOEVER.
      12             : 
      13             : Check the License for details. You should have received a copy of it, along
      14             : with the package; see the file 'COPYING'. If not, write to the Free Software
      15             : Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
      16             : #include "pari.h"
      17             : #include "paripriv.h"
      18             : #include "mt.h"
      19             : 
      20             : static GEN
      21     1470409 : mtsingle_queue_get(struct mt_state *mt, long *workid, long *pending)
      22             : {
      23     1470409 :   GEN done = mt->pending;
      24     1470409 :   if (workid) *workid = mt->workid;
      25     1470409 :   mt->pending = NULL; *pending = 0;
      26     1470409 :   return done;
      27             : }
      28             : 
      29             : static int single_is_thread = 0;
      30             : static long single_trace_level = 0;
      31             : 
      32             : static void
      33     1470435 : mtsingle_queue_submit(struct mt_state *mt, long workid, GEN work)
      34             : {
      35     1470435 :   int is_thread = single_is_thread;
      36     1470435 :   single_is_thread = 1;
      37     1470435 :   mt->pending = work? closure_callgenvec(mt->worker, work): NULL;
      38     1470409 :   single_is_thread = is_thread;
      39     1470409 :   mt->workid = workid;
      40     1470409 : }
      41             : 
      42             : static void
      43      294382 : mtsingle_queue_end(void) {  }
      44             : 
      45             : static GEN
      46       22839 : mtsequential_queue_get(struct mt_state *mt, long *workid, long *pending)
      47             : {
      48       22839 :   GEN done = mt->pending;
      49       22839 :   if (workid) *workid = mt->workid;
      50       22839 :   mt->pending = NULL; *pending = 0;
      51       22839 :   return done;
      52             : }
      53             : 
      54             : static void
      55       22838 : mtsequential_queue_submit(struct mt_state *mt, long workid, GEN work)
      56             : {
      57       22838 :   mt->pending = work? closure_callgenvec(mt->worker, work): NULL;
      58       22841 :   mt->workid = workid;
      59       22841 : }
      60             : 
      61             : static void
      62        4224 : mtsequential_queue_end(void) {  }
      63             : 
      64             : int
      65   213104092 : mtsingle_is_thread(void) { return single_is_thread; }
      66             : 
      67             : void
      68       11005 : mtsingle_err_recover(long er)
      69             : {
      70             :   (void) er;
      71       11005 :   if (single_is_thread)
      72             :   {
      73          18 :     evalstate_set_trace(single_trace_level);
      74          18 :     single_is_thread = 0;
      75             :   }
      76       11005 : }
      77             : 
      78             : void
      79      294408 : mtsingle_queue_start(struct pari_mt *pt, GEN worker)
      80             : {
      81      294408 :   pt->get = mtsingle_queue_get;
      82      294408 :   pt->submit = mtsingle_queue_submit;
      83      294408 :   pt->end = mtsingle_queue_end;
      84      294408 :   pt->mt.worker = worker;
      85      294408 :   pt->mt.pending = NULL;
      86      294408 :   single_trace_level = evalstate_get_trace();
      87      294408 : }
      88             : 
      89             : void
      90        4225 : mtsequential_queue_start(struct pari_mt *pt, GEN worker)
      91             : {
      92        4225 :   pt->get = mtsequential_queue_get;
      93        4225 :   pt->submit = mtsequential_queue_submit;
      94        4225 :   pt->end = mtsequential_queue_end;
      95        4225 :   pt->mt.worker = worker;
      96        4225 :   pt->mt.pending = NULL;
      97        4225 : }
      98             : 
      99             : void
     100      336308 : mt_queue_end(struct pari_mt *pt) { pt->end(); }
     101             : 
     102             : void
     103     1967158 : mt_queue_submit(struct pari_mt *pt, long workid, GEN work)
     104     1967158 : { pt->submit(&pt->mt, workid, work); }
     105             : 
     106             : GEN
     107     1967133 : mt_queue_get(struct pari_mt *pt, long *workid, long *pending)
     108     1967133 : { return pt->get(&pt->mt, workid, pending); }
     109             : 
     110             : void
     111          87 : mt_queue_start(struct pari_mt *pt, GEN worker)
     112          87 : { return mt_queue_start_lim(pt, worker, 0); }
     113             : 
     114             : void
     115     1400692 : mtstate_save(struct pari_mtstate *mt)
     116             : {
     117     1400692 :   if (mt_is_parallel())
     118             :   {
     119         207 :     mt->is_thread = 0;
     120         207 :     mt->trace_level = 0;
     121         207 :     mt->pending_threads = 1;
     122             :   } else
     123             :   {
     124     1400484 :     mt->is_thread = single_is_thread;
     125     1400484 :     mt->trace_level = single_trace_level;
     126     1400484 :     mt->pending_threads = 0;
     127             :   }
     128     1400691 : }
     129             : 
     130             : void
     131       45958 : mtstate_restore(struct pari_mtstate *mt)
     132             : {
     133       45958 :   if (!mt_is_parallel())
     134             :   {
     135       45949 :     single_is_thread = mt->is_thread;
     136       45949 :     single_trace_level = mt->trace_level;
     137             :   }
     138       45958 :   if (!mt->pending_threads && mt_is_parallel())
     139           7 :     mt_queue_reset();
     140       45958 : }
     141             : 
     142             : void
     143         487 : mtstate_reset(void)
     144             : {
     145         487 :   single_is_thread = 0;
     146         487 :   single_trace_level = 0;
     147         487 :   if (mt_is_parallel())
     148           0 :     mt_queue_reset();
     149         487 : }

Generated by: LCOV version 1.13