Coverage Report

Created: 2026-09-01 06:31

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/dropbear/libtommath/bn_mp_cmp_mag.c
Line
Count
Source
1
#include "tommath_private.h"
2
#ifdef BN_MP_CMP_MAG_C
3
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
4
/* SPDX-License-Identifier: Unlicense */
5
6
/* compare maginitude of two ints (unsigned) */
7
mp_ord mp_cmp_mag(const mp_int *a, const mp_int *b)
8
116M
{
9
116M
   int     n;
10
116M
   const mp_digit *tmpa, *tmpb;
11
12
   /* compare based on # of non-zero digits */
13
116M
   if (a->used > b->used) {
14
1.02M
      return MP_GT;
15
1.02M
   }
16
17
115M
   if (a->used < b->used) {
18
1.66M
      return MP_LT;
19
1.66M
   }
20
21
   /* alias for a */
22
113M
   tmpa = a->dp + (a->used - 1);
23
24
   /* alias for b */
25
113M
   tmpb = b->dp + (a->used - 1);
26
27
   /* compare based on digits  */
28
117M
   for (n = 0; n < a->used; ++n, --tmpa, --tmpb) {
29
117M
      if (*tmpa > *tmpb) {
30
30.6M
         return MP_GT;
31
30.6M
      }
32
33
86.7M
      if (*tmpa < *tmpb) {
34
82.7M
         return MP_LT;
35
82.7M
      }
36
86.7M
   }
37
27.1k
   return MP_EQ;
38
113M
}
39
#endif