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

          Line data    Source code
       1             : #include <tommath.h>
       2             : #ifdef BN_MP_AND_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             : /* AND two ints together */
      19             : int
      20           0 : mp_and (mp_int * a, mp_int * b, mp_int * c)
      21             : {
      22             :   int     res, ix, px;
      23             :   mp_int  t, *x;
      24             : 
      25           0 :   if (a->used > b->used) {
      26           0 :     if ((res = mp_init_copy (&t, a)) != MP_OKAY) {
      27           0 :       return res;
      28             :     }
      29           0 :     px = b->used;
      30           0 :     x = b;
      31             :   } else {
      32           0 :     if ((res = mp_init_copy (&t, b)) != MP_OKAY) {
      33           0 :       return res;
      34             :     }
      35           0 :     px = a->used;
      36           0 :     x = a;
      37             :   }
      38             : 
      39           0 :   for (ix = 0; ix < px; ix++) {
      40           0 :     t.dp[ix] &= x->dp[ix];
      41             :   }
      42             : 
      43             :   /* zero digits above the last from the smallest mp_int */
      44           0 :   for (; ix < t.used; ix++) {
      45           0 :     t.dp[ix] = 0;
      46             :   }
      47             : 
      48           0 :   mp_clamp (&t);
      49           0 :   mp_exch (c, &t);
      50           0 :   mp_clear (&t);
      51           0 :   return MP_OKAY;
      52             : }
      53             : #endif
      54             : 
      55             : /* $Source: /cvs/libtom/libtommath/bn_mp_and.c,v $ */
      56             : /* $Revision: 1.4 $ */
      57             : /* $Date: 2006/12/28 01:25:13 $ */

Generated by: LCOV version 1.13