LCOV - code coverage report
Current view: top level - source4/heimdal/lib/hcrypto/libtommath - bn_mp_reduce_is_2k.c (source / functions) Hit Total Coverage
Test: coverage report for abartlet/fix-coverage dd10fb34 Lines: 12 17 70.6 %
Date: 2021-09-23 10:06:22 Functions: 1 1 100.0 %

          Line data    Source code
       1             : #include <tommath.h>
       2             : #ifdef BN_MP_REDUCE_IS_2K_C
       3             : /* LibTomMath, multiple-precision integer library -- Tom St Denis
       4             :  *
       5             :  * LibTomMath is a library that provides multiple-precision
       6             :  * integer arithmetic as well as number theoretic functionality.
       7             :  *
       8             :  * The library was designed directly after the MPI library by
       9             :  * Michael Fromberger but has been written from scratch with
      10             :  * additional optimizations in place.
      11             :  *
      12             :  * The library is free for all purposes without any express
      13             :  * guarantee it works.
      14             :  *
      15             :  * Tom St Denis, tomstdenis@gmail.com, http://libtom.org
      16             :  */
      17             : 
      18             : /* determines if mp_reduce_2k can be used */
      19         872 : int mp_reduce_is_2k(mp_int *a)
      20             : {
      21             :    int ix, iy, iw;
      22             :    mp_digit iz;
      23             : 
      24         872 :    if (a->used == 0) {
      25           0 :       return MP_NO;
      26         872 :    } else if (a->used == 1) {
      27           0 :       return MP_YES;
      28         872 :    } else if (a->used > 1) {
      29         872 :       iy = mp_count_bits(a);
      30         872 :       iz = 1;
      31         872 :       iw = 1;
      32             : 
      33             :       /* Test every bit from the second digit up, must be 1 */
      34        2062 :       for (ix = DIGIT_BIT; ix < iy; ix++) {
      35        2062 :           if ((a->dp[iw] & iz) == 0) {
      36         840 :              return MP_NO;
      37             :           }
      38        1190 :           iz <<= 1;
      39        1190 :           if (iz > (mp_digit)MP_MASK) {
      40           0 :              ++iw;
      41           0 :              iz = 1;
      42             :           }
      43             :       }
      44             :    }
      45           0 :    return MP_YES;
      46             : }
      47             : 
      48             : #endif
      49             : 
      50             : /* $Source: /cvs/libtom/libtommath/bn_mp_reduce_is_2k.c,v $ */
      51             : /* $Revision: 1.4 $ */
      52             : /* $Date: 2006/12/28 01:25:13 $ */

Generated by: LCOV version 1.13